Modifier and Type	Class and Description
pack-priv class	ReverseOrderListView.DescendingIterator
pack-priv class	ReverseOrderListView.DescendingListIterator
pack-priv static class	ReverseOrderListView.Rand<E>

Modifier and Type	Field and Description
pack-priv final List<E>	base
pack-priv final boolean	modifiable

Access	Constructor and Description
private	ReverseOrderListView(List<E> list, boolean modifiable)

Method Summary

Modifier and Type	Method and Description
public boolean	add(E e) Implements java.util.List.add. Appends the specified element to the end of this list (optional operation).
public void	add(int index, E element) Implements java.util.List.add. Inserts the specified element at the specified position in this list (optional operation).
public boolean	addAll(Collection<? extends E> c) Implements java.util.List.addAll. Appends all of the elements in the specified collection to the end of this list, in the order that they are returned by the specified collection's iterator (optional operation).
public boolean	addAll(int index, Collection<? extends E> c) Implements java.util.List.addAll. Inserts all of the elements in the specified collection into this list at the specified position (optional operation).
pack-priv static void	checkClosedRange(int index, int size)
pack-priv void	checkModifiable() Throws if this list is unmodifiable.
public void	clear() Implements java.util.List.clear. Removes all of the elements from this list (optional operation).
public boolean	contains(Object o) Implements java.util.List.contains. Returns `true` if this list contains the specified element.
public boolean	containsAll(Collection<?> c) Implements java.util.List.containsAll. Returns `true` if this list contains all of the elements of the specified collection.
public boolean	equals(Object o) Overrides java.lang.Object.equals. Implements java.util.List.equals. Compares the specified object with this list for equality.
public void	forEach(Consumer<? super E> action) Overrides default java.lang.Iterable.forEach. Performs the given action for each element of the `Iterable` until all elements have been processed or the action throws an exception.
public E	get(int i) Implements java.util.List.get. Returns the element at the specified position in this list.
public int	hashCode() Overrides java.lang.Object.hashCode. Implements java.util.List.hashCode. Returns the hash code value for this list.
public int	indexOf(Object o) Implements java.util.List.indexOf. Returns the index of the first occurrence of the specified element in this list, or -1 if this list does not contain the element.
public boolean	isEmpty() Implements java.util.List.isEmpty. Returns `true` if this list contains no elements.
public Iterator<E>	iterator() Implements java.util.List.iterator. Returns an iterator over the elements in this list in proper sequence.
public int	lastIndexOf(Object o) Implements java.util.List.lastIndexOf. Returns the index of the last occurrence of the specified element in this list, or -1 if this list does not contain the element.
public ListIterator<E>	listIterator() Implements java.util.List.listIterator. Returns a list iterator over the elements in this list (in proper sequence).
public ListIterator<E>	listIterator(int index) Implements java.util.List.listIterator. Returns a list iterator over the elements in this list (in proper sequence), starting at the specified position in the list.
public static <T> List<T>	of(List<T> list, boolean modifiable) Hides java.util.List.of. Returns an unmodifiable list containing two elements.
public Stream<E>	parallelStream() Overrides default java.util.Collection.parallelStream. Returns a possibly parallel `Stream` with this collection as its source.
public boolean	remove(Object o) Implements java.util.List.remove. Removes the first occurrence of the specified element from this list, if it is present (optional operation).
public E	remove(int index) Implements java.util.List.remove. Removes the element at the specified position in this list (optional operation).
public boolean	removeAll(Collection<?> c) Implements java.util.List.removeAll. Removes from this list all of its elements that are contained in the specified collection (optional operation).
public boolean	removeIf(Predicate<? super E> filter) Overrides default java.util.Collection.removeIf. Removes all of the elements of this collection that satisfy the given predicate (optional operation).
public void	replaceAll(UnaryOperator<E> operator) Overrides default java.util.List.replaceAll. Replaces each element of this list with the result of applying the operator to that element (optional operation).
public boolean	retainAll(Collection<?> c) Implements java.util.List.retainAll. Retains only the elements in this list that are contained in the specified collection (optional operation).
public List<E>	reversed() Overrides default java.util.List.reversed. Returns a reverse-ordered view of this collection.
public E	set(int index, E element) Implements java.util.List.set. Replaces the element at the specified position in this list with the specified element (optional operation).
public int	size() Implements java.util.List.size. Returns the number of elements in this list.
public void	sort(Comparator<? super E> c) Overrides default java.util.List.sort. Sorts this list according to the order induced by the specified `Comparator` (optional operation).
public Spliterator<E>	spliterator() Overrides default java.util.List.spliterator. Creates a `Spliterator` over the elements in this list.
public Stream<E>	stream() Overrides default java.util.Collection.stream. Returns a sequential `Stream` with this collection as its source.
public List<E>	subList(int fromIndex, int toIndex) Implements java.util.List.subList. Returns a view of the portion of this list between the specified `fromIndex`, inclusive, and `toIndex`, exclusive.
public Object[]	toArray() Implements java.util.List.toArray. Returns an array containing all of the elements in this list in proper sequence (from first to last element).
public <T> T[]	toArray(T[] a) Implements java.util.List.toArray. Returns an array containing all of the elements in this list in proper sequence (from first to last element); the runtime type of the returned array is that of the specified array.
public <T> T[]	toArray(IntFunction<T[]> generator) Overrides default java.util.Collection.toArray. Returns an array containing all of the elements in this collection, using the provided `generator` function to allocate the returned array.
public String	toString() Overrides java.lang.Object.toString. Returns a string representation of the object.

Inherited from java.lang.Object:: clone finalize getClass notify notifyAll wait wait wait

Field Detail

base	back to summary
pack-priv final List<E> base Annotations @Stable

modifiable	back to summary
pack-priv final boolean modifiable

Constructor Detail

ReverseOrderListView	back to summary
private ReverseOrderListView(List<E> list, boolean modifiable)

Method Detail

add	back to summary
public boolean add(E e) Implements java.util.List.add. Doc from java.util.List.add. Appends the specified element to the end of this list (optional operation). Lists that support this operation may place limitations on what elements may be added to this list. In particular, some lists will refuse to add null elements, and others will impose restrictions on the type of elements that may be added. List classes should clearly specify in their documentation any restrictions on what elements may be added.

add

back to summary

public boolean add(E e)

Implements java.util.List.add.

Doc from java.util.List.add.

Appends the specified element to the end of this list (optional operation).

Lists that support this operation may place limitations on what elements may be added to this list. In particular, some lists will refuse to add null elements, and others will impose restrictions on the type of elements that may be added. List classes should clearly specify in their documentation any restrictions on what elements may be added.

add	back to summary
public void add(int index, E element) Implements java.util.List.add. Doc from java.util.List.add. Inserts the specified element at the specified position in this list (optional operation). Shifts the element currently at that position (if any) and any subsequent elements to the right (adds one to their indices).

add

back to summary

public void add(int index, E element)

Implements java.util.List.add.

Doc from java.util.List.add.

Inserts the specified element at the specified position in this list (optional operation). Shifts the element currently at that position (if any) and any subsequent elements to the right (adds one to their indices).

addAll	back to summary
public boolean addAll(Collection<? extends E> c) Implements java.util.List.addAll. Doc from java.util.List.addAll. Appends all of the elements in the specified collection to the end of this list, in the order that they are returned by the specified collection's iterator (optional operation). The behavior of this operation is undefined if the specified collection is modified while the operation is in progress. (Note that this will occur if the specified collection is this list, and it's nonempty.)

addAll

back to summary

public boolean addAll(Collection<? extends E> c)

Implements java.util.List.addAll.

Doc from java.util.List.addAll.

Appends all of the elements in the specified collection to the end of this list, in the order that they are returned by the specified collection's iterator (optional operation). The behavior of this operation is undefined if the specified collection is modified while the operation is in progress. (Note that this will occur if the specified collection is this list, and it's nonempty.)

addAll	back to summary
public boolean addAll(int index, Collection<? extends E> c) Implements java.util.List.addAll. Doc from java.util.List.addAll. Inserts all of the elements in the specified collection into this list at the specified position (optional operation). Shifts the element currently at that position (if any) and any subsequent elements to the right (increases their indices). The new elements will appear in this list in the order that they are returned by the specified collection's iterator. The behavior of this operation is undefined if the specified collection is modified while the operation is in progress. (Note that this will occur if the specified collection is this list, and it's nonempty.)

addAll

back to summary

public boolean addAll(int index, Collection<? extends E> c)

Implements java.util.List.addAll.

Doc from java.util.List.addAll.

Inserts all of the elements in the specified collection into this list at the specified position (optional operation). Shifts the element currently at that position (if any) and any subsequent elements to the right (increases their indices). The new elements will appear in this list in the order that they are returned by the specified collection's iterator. The behavior of this operation is undefined if the specified collection is modified while the operation is in progress. (Note that this will occur if the specified collection is this list, and it's nonempty.)

checkClosedRange	back to summary
pack-priv static void checkClosedRange(int index, int size)

checkModifiable	back to summary
pack-priv void checkModifiable() Throws if this list is unmodifiable. This should be called from every mutator method. For bulk ops (addAll, removeAll, etc.) this throws unconditionally. In contrast, if the base list inherits a bulk op implementation from AbstractList, it might not throw if no actual mutation would be attempted (e.g., addAll on an empty collection). Arguably calling this is unnecessary for individual ops, for which the base list should always throw, but it's easier to verify the right behavior if every mutator of this class always checks.

checkModifiable

back to summary

pack-priv void checkModifiable()

Throws if this list is unmodifiable. This should be called from every mutator method. For bulk ops (addAll, removeAll, etc.) this throws unconditionally. In contrast, if the base list inherits a bulk op implementation from AbstractList, it might not throw if no actual mutation would be attempted (e.g., addAll on an empty collection). Arguably calling this is unnecessary for individual ops, for which the base list should always throw, but it's easier to verify the right behavior if every mutator of this class always checks.

clear	back to summary
public void clear() Implements java.util.List.clear. Doc from java.util.List.clear. Removes all of the elements from this list (optional operation). The list will be empty after this call returns.

clear

back to summary

public void clear()

Implements java.util.List.clear.

Doc from java.util.List.clear.

Removes all of the elements from this list (optional operation). The list will be empty after this call returns.

contains back to summary

contains	back to summary
public boolean contains(Object o) Implements java.util.List.contains. Doc from java.util.List.contains. Returns `true` if this list contains the specified element. More formally, returns `true` if and only if this list contains at least one element `e` such that `Objects.equals(o, e)`.

public boolean contains(Object o)

Implements java.util.List.contains.

Doc from java.util.List.contains.

Returns true if this list contains the specified element. More formally, returns true if and only if this list contains at least one element e such that Objects.equals(o, e).

containsAll back to summary

containsAll	back to summary
public boolean containsAll(Collection<?> c) Implements java.util.List.containsAll. Doc from java.util.List.containsAll. Returns `true` if this list contains all of the elements of the specified collection.

public boolean containsAll(Collection<?> c)

Implements java.util.List.containsAll.

Doc from java.util.List.containsAll.

Returns true if this list contains all of the elements of the specified collection.

equals back to summary

equals	back to summary
public boolean equals(Object o) Overrides java.lang.Object.equals. Implements java.util.List.equals. Doc from java.util.List.equals. Compares the specified object with this list for equality. Returns `true` if and only if the specified object is also a list, both lists have the same size, and all corresponding pairs of elements in the two lists are equal. (Two elements `e1` and `e2` are equal if `Objects.equals(e1, e2)`.) In other words, two lists are defined to be equal if they contain the same elements in the same order. This definition ensures that the equals method works properly across different implementations of the `List` interface.

public boolean equals(Object o)

Overrides java.lang.Object.equals.

Implements java.util.List.equals.

Doc from java.util.List.equals.

Compares the specified object with this list for equality. Returns true if and only if the specified object is also a list, both lists have the same size, and all corresponding pairs of elements in the two lists are equal. (Two elements e1 and e2 are equal if Objects.equals(e1, e2).) In other words, two lists are defined to be equal if they contain the same elements in the same order. This definition ensures that the equals method works properly across different implementations of the List interface.

forEach back to summary

forEach	back to summary
public void forEach(Consumer<? super E> action) Overrides default java.lang.Iterable.forEach. Doc from java.lang.Iterable.forEach. Performs the given action for each element of the `Iterable` until all elements have been processed or the action throws an exception. Actions are performed in the order of iteration, if that order is specified. Exceptions thrown by the action are relayed to the caller. The behavior of this method is unspecified if the action performs side-effects that modify the underlying source of elements, unless an overriding class has specified a concurrent modification policy.

public void forEach(Consumer<? super E> action)

Overrides default java.lang.Iterable.forEach.

Doc from java.lang.Iterable.forEach.

Performs the given action for each element of the Iterable until all elements have been processed or the action throws an exception. Actions are performed in the order of iteration, if that order is specified. Exceptions thrown by the action are relayed to the caller.

The behavior of this method is unspecified if the action performs side-effects that modify the underlying source of elements, unless an overriding class has specified a concurrent modification policy.

get	back to summary
public E get(int i) Implements java.util.List.get. Doc from java.util.List.get. Returns the element at the specified position in this list.

get

back to summary

public E get(int i)

Implements java.util.List.get.

Doc from java.util.List.get.

Returns the element at the specified position in this list.

hashCode back to summary

hashCode	back to summary
public int hashCode() Overrides java.lang.Object.hashCode. Implements java.util.List.hashCode. Doc from java.util.List.hashCode. Returns the hash code value for this list. The hash code of a list is defined to be the result of the following calculation: `int hashCode = 1; for (E e : list) hashCode = 31*hashCode + (e==null ? 0 : e.hashCode());` This ensures that `list1.equals(list2)` implies that `list1.hashCode()==list2.hashCode()` for any two lists, `list1` and `list2`, as required by the general contract of `Object#hashCode`.

public int hashCode()

Overrides java.lang.Object.hashCode.

Implements java.util.List.hashCode.

Doc from java.util.List.hashCode.

Returns the hash code value for this list. The hash code of a list is defined to be the result of the following calculation:

int hashCode = 1;
    for (E e : list)
        hashCode = 31*hashCode + (e==null ? 0 : e.hashCode());

This ensures that list1.equals(list2) implies that list1.hashCode()==list2.hashCode() for any two lists, list1 and list2, as required by the general contract of Object#hashCode.

indexOf back to summary

indexOf	back to summary
public int indexOf(Object o) Implements java.util.List.indexOf. Doc from java.util.List.indexOf. Returns the index of the first occurrence of the specified element in this list, or -1 if this list does not contain the element. More formally, returns the lowest index `i` such that `Objects.equals(o, get(i))`, or -1 if there is no such index.

public int indexOf(Object o)

Implements java.util.List.indexOf.

Doc from java.util.List.indexOf.

Returns the index of the first occurrence of the specified element in this list, or -1 if this list does not contain the element. More formally, returns the lowest index i such that Objects.equals(o, get(i)), or -1 if there is no such index.

isEmpty back to summary

isEmpty	back to summary
public boolean isEmpty() Implements java.util.List.isEmpty. Doc from java.util.List.isEmpty. Returns `true` if this list contains no elements.

public boolean isEmpty()

Implements java.util.List.isEmpty.

Doc from java.util.List.isEmpty.

Returns true if this list contains no elements.

iterator	back to summary
public Iterator<E> iterator() Implements java.util.List.iterator. Doc from java.util.List.iterator. Returns an iterator over the elements in this list in proper sequence.

iterator

back to summary

public Iterator<E> iterator()

Implements java.util.List.iterator.

Doc from java.util.List.iterator.

Returns an iterator over the elements in this list in proper sequence.

lastIndexOf back to summary

lastIndexOf	back to summary
public int lastIndexOf(Object o) Implements java.util.List.lastIndexOf. Doc from java.util.List.lastIndexOf. Returns the index of the last occurrence of the specified element in this list, or -1 if this list does not contain the element. More formally, returns the highest index `i` such that `Objects.equals(o, get(i))`, or -1 if there is no such index.

public int lastIndexOf(Object o)

Implements java.util.List.lastIndexOf.

Doc from java.util.List.lastIndexOf.

Returns the index of the last occurrence of the specified element in this list, or -1 if this list does not contain the element. More formally, returns the highest index i such that Objects.equals(o, get(i)), or -1 if there is no such index.

listIterator	back to summary
public ListIterator<E> listIterator() Implements java.util.List.listIterator. Doc from java.util.List.listIterator. Returns a list iterator over the elements in this list (in proper sequence).

listIterator

back to summary

public ListIterator<E> listIterator()

Implements java.util.List.listIterator.

Doc from java.util.List.listIterator.

Returns a list iterator over the elements in this list (in proper sequence).

listIterator back to summary

listIterator	back to summary
public ListIterator<E> listIterator(int index) Implements java.util.List.listIterator. Doc from java.util.List.listIterator. Returns a list iterator over the elements in this list (in proper sequence), starting at the specified position in the list. The specified index indicates the first element that would be returned by an initial call to `next`. An initial call to `previous` would return the element with the specified index minus one.

public ListIterator<E> listIterator(int index)

Implements java.util.List.listIterator.

Doc from java.util.List.listIterator.

Returns a list iterator over the elements in this list (in proper sequence), starting at the specified position in the list. The specified index indicates the first element that would be returned by an initial call to next. An initial call to previous would return the element with the specified index minus one.

of	back to summary
public static <T> List<T> of(List<T> list, boolean modifiable) Hides java.util.List.of. Doc from java.util.List.of. Returns an unmodifiable list containing two elements. See Unmodifiable Lists for details.

back to summary

public static <T> List<T> of(List<T> list, boolean modifiable)

Hides java.util.List.of.

Doc from java.util.List.of.

Returns an unmodifiable list containing two elements. See Unmodifiable Lists for details.

parallelStream back to summary

parallelStream	back to summary
public Stream<E> parallelStream() Overrides default java.util.Collection.parallelStream. Doc from java.util.Collection.parallelStream. Returns a possibly parallel `Stream` with this collection as its source. It is allowable for this method to return a sequential stream. This method should be overridden when the `spliterator()` method cannot return a spliterator that is `IMMUTABLE`, `CONCURRENT`, or late-binding. (See `spliterator()` for details.)

public Stream<E> parallelStream()

Overrides default java.util.Collection.parallelStream.

Doc from java.util.Collection.parallelStream.

Returns a possibly parallel Stream with this collection as its source. It is allowable for this method to return a sequential stream.

This method should be overridden when the spliterator() method cannot return a spliterator that is IMMUTABLE, CONCURRENT, or late-binding. (See spliterator() for details.)

remove back to summary

remove	back to summary
public boolean remove(Object o) Implements java.util.List.remove. Doc from java.util.List.remove. Removes the first occurrence of the specified element from this list, if it is present (optional operation). If this list does not contain the element, it is unchanged. More formally, removes the element with the lowest index `i` such that `Objects.equals(o, get(i))` (if such an element exists). Returns `true` if this list contained the specified element (or equivalently, if this list changed as a result of the call).

public boolean remove(Object o)

Implements java.util.List.remove.

Doc from java.util.List.remove.

Removes the first occurrence of the specified element from this list, if it is present (optional operation). If this list does not contain the element, it is unchanged. More formally, removes the element with the lowest index i such that Objects.equals(o, get(i)) (if such an element exists). Returns true if this list contained the specified element (or equivalently, if this list changed as a result of the call).

remove	back to summary
public E remove(int index) Implements java.util.List.remove. Doc from java.util.List.remove. Removes the element at the specified position in this list (optional operation). Shifts any subsequent elements to the left (subtracts one from their indices). Returns the element that was removed from the list.

remove

back to summary

public E remove(int index)

Implements java.util.List.remove.

Doc from java.util.List.remove.

Removes the element at the specified position in this list (optional operation). Shifts any subsequent elements to the left (subtracts one from their indices). Returns the element that was removed from the list.

removeAll	back to summary
public boolean removeAll(Collection<?> c) Implements java.util.List.removeAll. Doc from java.util.List.removeAll. Removes from this list all of its elements that are contained in the specified collection (optional operation).

removeAll

back to summary

public boolean removeAll(Collection<?> c)

Implements java.util.List.removeAll.

Doc from java.util.List.removeAll.

Removes from this list all of its elements that are contained in the specified collection (optional operation).

removeIf	back to summary
public boolean removeIf(Predicate<? super E> filter) Overrides default java.util.Collection.removeIf. Doc from java.util.Collection.removeIf. Removes all of the elements of this collection that satisfy the given predicate (optional operation). Errors or runtime exceptions thrown during iteration or by the predicate are relayed to the caller.

removeIf

back to summary

public boolean removeIf(Predicate<? super E> filter)

Overrides default java.util.Collection.removeIf.

Doc from java.util.Collection.removeIf.

Removes all of the elements of this collection that satisfy the given predicate (optional operation). Errors or runtime exceptions thrown during iteration or by the predicate are relayed to the caller.

replaceAll	back to summary
public void replaceAll(UnaryOperator<E> operator) Overrides default java.util.List.replaceAll. Doc from java.util.List.replaceAll. Replaces each element of this list with the result of applying the operator to that element (optional operation). Errors or runtime exceptions thrown by the operator are relayed to the caller.

replaceAll

back to summary

public void replaceAll(UnaryOperator<E> operator)

Overrides default java.util.List.replaceAll.

Doc from java.util.List.replaceAll.

Replaces each element of this list with the result of applying the operator to that element (optional operation). Errors or runtime exceptions thrown by the operator are relayed to the caller.

retainAll	back to summary
public boolean retainAll(Collection<?> c) Implements java.util.List.retainAll. Doc from java.util.List.retainAll. Retains only the elements in this list that are contained in the specified collection (optional operation). In other words, removes from this list all of its elements that are not contained in the specified collection.

retainAll

back to summary

public boolean retainAll(Collection<?> c)

Implements java.util.List.retainAll.

Doc from java.util.List.retainAll.

Retains only the elements in this list that are contained in the specified collection (optional operation). In other words, removes from this list all of its elements that are not contained in the specified collection.

reversed	back to summary
public List<E> reversed() Overrides default java.util.List.reversed. Doc from java.util.List.reversed. Returns a reverse-ordered view of this collection. The encounter order of elements in the returned view is the inverse of the encounter order of elements in this collection. The reverse ordering affects all order-sensitive operations, including those on the view collections of the returned view. If the collection implementation permits modifications to this view, the modifications "write through" to the underlying collection. Changes to the underlying collection might or might not be visible in this reversed view, depending upon the implementation.

reversed

back to summary

public List<E> reversed()

Overrides default java.util.List.reversed.

Doc from java.util.List.reversed.

Returns a reverse-ordered view of this collection. The encounter order of elements in the returned view is the inverse of the encounter order of elements in this collection. The reverse ordering affects all order-sensitive operations, including those on the view collections of the returned view. If the collection implementation permits modifications to this view, the modifications "write through" to the underlying collection. Changes to the underlying collection might or might not be visible in this reversed view, depending upon the implementation.

set	back to summary
public E set(int index, E element) Implements java.util.List.set. Doc from java.util.List.set. Replaces the element at the specified position in this list with the specified element (optional operation).

set

back to summary

public E set(int index, E element)

Implements java.util.List.set.

Doc from java.util.List.set.

Replaces the element at the specified position in this list with the specified element (optional operation).

size back to summary

size	back to summary
public int size() Implements java.util.List.size. Doc from java.util.List.size. Returns the number of elements in this list. If this list contains more than `Integer.MAX_VALUE` elements, returns `Integer.MAX_VALUE`.

public int size()

Implements java.util.List.size.

Doc from java.util.List.size.

Returns the number of elements in this list. If this list contains more than Integer.MAX_VALUE elements, returns Integer.MAX_VALUE.

sort back to summary

sort	back to summary
public void sort(Comparator<? super E> c) Overrides default java.util.List.sort. Doc from java.util.List.sort. Sorts this list according to the order induced by the specified `Comparator` (optional operation). The sort is stable: this method must not reorder equal elements. All elements in this list must be mutually comparable using the specified comparator (that is, `c.compare(e1, e2)` must not throw a `ClassCastException` for any elements `e1` and `e2` in the list). If the specified comparator is `null` then all elements in this list must implement the `Comparable` interface and the elements' natural ordering should be used. This list must be modifiable, but need not be resizable.

public void sort(Comparator<? super E> c)

Overrides default java.util.List.sort.

Doc from java.util.List.sort.

Sorts this list according to the order induced by the specified Comparator (optional operation). The sort is stable: this method must not reorder equal elements.

All elements in this list must be mutually comparable using the specified comparator (that is, c.compare(e1, e2) must not throw a ClassCastException for any elements e1 and e2 in the list).

If the specified comparator is null then all elements in this list must implement the Comparable interface and the elements' natural ordering should be used.

This list must be modifiable, but need not be resizable.

spliterator back to summary

spliterator	back to summary
public Spliterator<E> spliterator() Overrides default java.util.List.spliterator. Doc from java.util.List.spliterator. Creates a `Spliterator` over the elements in this list. The `Spliterator` reports `Spliterator#SIZED` and `Spliterator#ORDERED`. Implementations should document the reporting of additional characteristic values.

public Spliterator<E> spliterator()

Overrides default java.util.List.spliterator.

Doc from java.util.List.spliterator.

Creates a Spliterator over the elements in this list.

The Spliterator reports Spliterator#SIZED and Spliterator#ORDERED. Implementations should document the reporting of additional characteristic values.

stream back to summary

stream	back to summary
public Stream<E> stream() Overrides default java.util.Collection.stream. Doc from java.util.Collection.stream. Returns a sequential `Stream` with this collection as its source. This method should be overridden when the `spliterator()` method cannot return a spliterator that is `IMMUTABLE`, `CONCURRENT`, or late-binding. (See `spliterator()` for details.)

public Stream<E> stream()

Overrides default java.util.Collection.stream.

Doc from java.util.Collection.stream.

Returns a sequential Stream with this collection as its source.

This method should be overridden when the spliterator() method cannot return a spliterator that is IMMUTABLE, CONCURRENT, or late-binding. (See spliterator() for details.)

subList back to summary

subList	back to summary
public List<E> subList(int fromIndex, int toIndex) Implements java.util.List.subList. Doc from java.util.List.subList. Returns a view of the portion of this list between the specified `fromIndex`, inclusive, and `toIndex`, exclusive. (If `fromIndex` and `toIndex` are equal, the returned list is empty.) The returned list is backed by this list, so non-structural changes in the returned list are reflected in this list, and vice-versa. The returned list supports all of the optional list operations supported by this list. This method eliminates the need for explicit range operations (of the sort that commonly exist for arrays). Any operation that expects a list can be used as a range operation by passing a subList view instead of a whole list. For example, the following idiom removes a range of elements from a list: `list.subList(from, to).clear();` Similar idioms may be constructed for `indexOf` and `lastIndexOf`, and all of the algorithms in the `Collections` class can be applied to a subList. The semantics of the list returned by this method become undefined if the backing list (i.e., this list) is structurally modified in any way other than via the returned list. (Structural modifications are those that change the size of this list, or otherwise perturb it in such a fashion that iterations in progress may yield incorrect results.)

public List<E> subList(int fromIndex, int toIndex)

Implements java.util.List.subList.

Doc from java.util.List.subList.

Returns a view of the portion of this list between the specified fromIndex, inclusive, and toIndex, exclusive. (If fromIndex and toIndex are equal, the returned list is empty.) The returned list is backed by this list, so non-structural changes in the returned list are reflected in this list, and vice-versa. The returned list supports all of the optional list operations supported by this list.

This method eliminates the need for explicit range operations (of the sort that commonly exist for arrays). Any operation that expects a list can be used as a range operation by passing a subList view instead of a whole list. For example, the following idiom removes a range of elements from a list:

list.subList(from, to).clear();

Similar idioms may be constructed for indexOf and lastIndexOf, and all of the algorithms in the Collections class can be applied to a subList.

The semantics of the list returned by this method become undefined if the backing list (i.e., this list) is structurally modified in any way other than via the returned list. (Structural modifications are those that change the size of this list, or otherwise perturb it in such a fashion that iterations in progress may yield incorrect results.)

toArray	back to summary
public Object[] toArray() Implements java.util.List.toArray. Doc from java.util.List.toArray. Returns an array containing all of the elements in this list in proper sequence (from first to last element). The returned array will be "safe" in that no references to it are maintained by this list. (In other words, this method must allocate a new array even if this list is backed by an array). The caller is thus free to modify the returned array. This method acts as bridge between array-based and collection-based APIs.

toArray

back to summary

public Object[] toArray()

Implements java.util.List.toArray.

Doc from java.util.List.toArray.

Returns an array containing all of the elements in this list in proper sequence (from first to last element).

The returned array will be "safe" in that no references to it are maintained by this list. (In other words, this method must allocate a new array even if this list is backed by an array). The caller is thus free to modify the returned array.

This method acts as bridge between array-based and collection-based APIs.

toArray back to summary

toArray	back to summary
public <T> T[] toArray(T[] a) Implements java.util.List.toArray. Doc from java.util.List.toArray. Returns an array containing all of the elements in this list in proper sequence (from first to last element); the runtime type of the returned array is that of the specified array. If the list fits in the specified array, it is returned therein. Otherwise, a new array is allocated with the runtime type of the specified array and the size of this list. If the list fits in the specified array with room to spare (i.e., the array has more elements than the list), the element in the array immediately following the end of the list is set to `null`. (This is useful in determining the length of the list only if the caller knows that the list does not contain any null elements.) Like the `toArray()` method, this method acts as bridge between array-based and collection-based APIs. Further, this method allows precise control over the runtime type of the output array, and may, under certain circumstances, be used to save allocation costs. Suppose `x` is a list known to contain only strings. The following code can be used to dump the list into a newly allocated array of `String`: `String[] y = x.toArray(new String[0]);` Note that `toArray(new Object[0])` is identical in function to `toArray()`.

public <T> T[] toArray(T[] a)

Implements java.util.List.toArray.

Doc from java.util.List.toArray.

Returns an array containing all of the elements in this list in proper sequence (from first to last element); the runtime type of the returned array is that of the specified array. If the list fits in the specified array, it is returned therein. Otherwise, a new array is allocated with the runtime type of the specified array and the size of this list.

If the list fits in the specified array with room to spare (i.e., the array has more elements than the list), the element in the array immediately following the end of the list is set to null. (This is useful in determining the length of the list only if the caller knows that the list does not contain any null elements.)

Like the toArray() method, this method acts as bridge between array-based and collection-based APIs. Further, this method allows precise control over the runtime type of the output array, and may, under certain circumstances, be used to save allocation costs.

Suppose x is a list known to contain only strings. The following code can be used to dump the list into a newly allocated array of String:

String[] y = x.toArray(new String[0]);

Note that toArray(new Object[0]) is identical in function to toArray().

toArray back to summary

toArray	back to summary
public <T> T[] toArray(IntFunction<T[]> generator) Overrides default java.util.Collection.toArray. Doc from java.util.Collection.toArray. Returns an array containing all of the elements in this collection, using the provided `generator` function to allocate the returned array. If this collection makes any guarantees as to what order its elements are returned by its iterator, this method must return the elements in the same order.

public <T> T[] toArray(IntFunction<T[]> generator)

Overrides default java.util.Collection.toArray.

Doc from java.util.Collection.toArray.

Returns an array containing all of the elements in this collection, using the provided generator function to allocate the returned array.

If this collection makes any guarantees as to what order its elements are returned by its iterator, this method must return the elements in the same order.

toString back to summary

toString	back to summary
public String toString() Overrides java.lang.Object.toString. Doc from java.lang.Object.toString. Returns a string representation of the object. Satisfying this method's contract implies a non-`null` result must be returned.

public String toString()

Overrides java.lang.Object.toString.

Doc from java.lang.Object.toString.

Returns a string representation of the object. Satisfying this method's contract implies a non-null result must be returned.

java.util back to summary

pack-priv Class ReverseOrderListView.DescendingIterator

Class Inheritance

extends Object
implements Iterator<E>

java.lang.Object
java.util.ReverseOrderListView.DescendingIterator

All Implemented Interfaces

java.util.Iterator

Field Summary

Modifier and Type	Field and Description
pack-priv final ListIterator<E>	it

Constructor Summary

Access	Constructor and Description
pack-priv	DescendingIterator()

Method Summary

Modifier and Type	Method and Description
public boolean	hasNext() Implements java.util.Iterator.hasNext. Returns `true` if the iteration has more elements.
public E	next() Implements java.util.Iterator.next. Returns the next element in the iteration.
public void	remove() Overrides default java.util.Iterator.remove. Removes from the underlying collection the last element returned by this iterator (optional operation).

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

it	back to summary
pack-priv final ListIterator<E> it

Constructor Detail

DescendingIterator	back to summary
pack-priv DescendingIterator()

Method Detail

hasNext back to summary

public boolean hasNext()

Implements java.util.Iterator.hasNext.

Doc from java.util.Iterator.hasNext.

Returns true if the iteration has more elements. (In other words, returns true if next would return an element rather than throwing an exception.)

back to summary

public E next()

Implements java.util.Iterator.next.

Doc from java.util.Iterator.next.

Returns the next element in the iteration.

remove back to summary

public void remove()

Overrides default java.util.Iterator.remove.

Doc from java.util.Iterator.remove.

Removes from the underlying collection the last element returned by this iterator (optional operation). This method can be called only once per call to next.

The behavior of an iterator is unspecified if the underlying collection is modified while the iteration is in progress in any way other than by calling this method, unless an overriding class has specified a concurrent modification policy.

The behavior of an iterator is unspecified if this method is called after a call to the forEachRemaining method.

java.util back to summary

pack-priv Class ReverseOrderListView.DescendingListIterator

Class Inheritance

extends Object
implements ListIterator<E>

java.lang.Object
java.util.ReverseOrderListView.DescendingListIterator

All Implemented Interfaces

java.util.ListIterator, java.util.Iterator

Field Summary

Modifier and Type	Field and Description
pack-priv final ListIterator<E>	it

Constructor Summary

Access	Constructor and Description
pack-priv	DescendingListIterator(int size, int pos)

Method Summary

Modifier and Type	Method and Description
public void	add(E e) Implements java.util.ListIterator.add. Inserts the specified element into the list (optional operation).
public boolean	hasNext() Implements java.util.ListIterator.hasNext. Returns `true` if this list iterator has more elements when traversing the list in the forward direction.
public boolean	hasPrevious() Implements java.util.ListIterator.hasPrevious. Returns `true` if this list iterator has more elements when traversing the list in the reverse direction.
public E	next() Implements java.util.ListIterator.next. Returns the next element in the list and advances the cursor position.
public int	nextIndex() Implements java.util.ListIterator.nextIndex. Returns the index of the element that would be returned by a subsequent call to `next`.
public E	previous() Implements java.util.ListIterator.previous. Returns the previous element in the list and moves the cursor position backwards.
public int	previousIndex() Implements java.util.ListIterator.previousIndex. Returns the index of the element that would be returned by a subsequent call to `previous`.
public void	remove() Implements java.util.ListIterator.remove. Removes from the list the last element that was returned by `next` or `previous` (optional operation).
public void	set(E e) Implements java.util.ListIterator.set. Replaces the last element returned by `next` or `previous` with the specified element (optional operation).

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

it	back to summary
pack-priv final ListIterator<E> it

Constructor Detail

DescendingListIterator	back to summary
pack-priv DescendingListIterator(int size, int pos)

Method Detail

add back to summary

public void add(E e)

Implements java.util.ListIterator.add.

Doc from java.util.ListIterator.add.

Inserts the specified element into the list (optional operation). The element is inserted immediately before the element that would be returned by next, if any, and after the element that would be returned by previous, if any. (If the list contains no elements, the new element becomes the sole element on the list.) The new element is inserted before the implicit cursor: a subsequent call to next would be unaffected, and a subsequent call to previous would return the new element. (This call increases by one the value that would be returned by a call to nextIndex or previousIndex.)

hasNext back to summary

public boolean hasNext()

Implements java.util.ListIterator.hasNext.

Doc from java.util.ListIterator.hasNext.

Returns true if this list iterator has more elements when traversing the list in the forward direction. (In other words, returns true if next would return an element rather than throwing an exception.)

hasPrevious back to summary

public boolean hasPrevious()

Implements java.util.ListIterator.hasPrevious.

Doc from java.util.ListIterator.hasPrevious.

Returns true if this list iterator has more elements when traversing the list in the reverse direction. (In other words, returns true if previous would return an element rather than throwing an exception.)

next back to summary

public E next()

Implements java.util.ListIterator.next.

Doc from java.util.ListIterator.next.

Returns the next element in the list and advances the cursor position. This method may be called repeatedly to iterate through the list, or intermixed with calls to previous to go back and forth. (Note that alternating calls to next and previous will return the same element repeatedly.)

nextIndex back to summary

public int nextIndex()

Implements java.util.ListIterator.nextIndex.

Doc from java.util.ListIterator.nextIndex.

Returns the index of the element that would be returned by a subsequent call to next. (Returns list size if the list iterator is at the end of the list.)

previous back to summary

public E previous()

Implements java.util.ListIterator.previous.

Doc from java.util.ListIterator.previous.

Returns the previous element in the list and moves the cursor position backwards. This method may be called repeatedly to iterate through the list backwards, or intermixed with calls to next to go back and forth. (Note that alternating calls to next and previous will return the same element repeatedly.)

previousIndex back to summary

public int previousIndex()

Implements java.util.ListIterator.previousIndex.

Doc from java.util.ListIterator.previousIndex.

Returns the index of the element that would be returned by a subsequent call to previous. (Returns -1 if the list iterator is at the beginning of the list.)

remove back to summary

public void remove()

Implements java.util.ListIterator.remove.

Doc from java.util.ListIterator.remove.

Removes from the list the last element that was returned by next or previous (optional operation). This call can only be made once per call to next or previous. It can be made only if add has not been called after the last call to next or previous.

set back to summary

public void set(E e)

Implements java.util.ListIterator.set.

Doc from java.util.ListIterator.set.

Replaces the last element returned by next or previous with the specified element (optional operation). This call can be made only if neither remove nor add have been called after the last call to next or previous.

pack-priv Class ReverseOrderListView<E>

Nested and Inner Type Summary

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

pack-priv Class ReverseOrderListView.DescendingIterator

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

pack-priv Class ReverseOrderListView.DescendingListIterator

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

pack-priv Class ReverseOrderListView.Rand<E>

Field Summary

Constructor Summary

Method Summary

Constructor Detail