public abstract class AbstractReferenceBigList<K> extends AbstractReferenceCollection<K> implements ReferenceBigList<K>, Stack<K>
| Modifier and Type | Class and Description |
|---|---|
static class |
AbstractReferenceBigList.ReferenceSubList<K>
A class implementing a sublist view.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(K k)
This implementation delegates to the type-specific version of
BigList.add(long, Object). |
void |
add(long index,
K k)
Inserts the specified element at the specified position in this big list (optional operation).
|
boolean |
addAll(Collection<? extends K> c)
This implementation delegates to the type-specific version of
BigList.addAll(long, Collection). |
boolean |
addAll(long index,
Collection<? extends K> c)
Adds all of the elements in the specified collection to this list (optional operation).
|
void |
addElements(long index,
K[][] a)
Add (hopefully quickly) elements to this type-specific big list.
|
void |
addElements(long index,
K[][] a,
long offset,
long length)
Add (hopefully quickly) elements to this type-specific big list.
|
void |
clear()
This implementation delegates to
removeElements(long, long). |
boolean |
contains(Object k)
Returns true if this list contains the specified element.
|
boolean |
equals(Object o) |
void |
getElements(long from,
Object[][] a,
long offset,
long length)
Copies (hopefully quickly) elements of this type-specific big list into the given big array.
|
int |
hashCode()
Returns the hash code for this big list, which is identical to
List.hashCode(). |
long |
indexOf(Object k)
Returns the index of the first occurrence of the specified element in this big list, or -1 if this big list does not contain the element.
|
ObjectBigListIterator<K> |
iterator()
Returns a type-specific iterator on the elements of this collection.
|
long |
lastIndexOf(Object k)
Returns the index of the last occurrence of the specified element in this big list, or -1 if this big list does not contain the element.
|
ObjectBigListIterator<K> |
listIterator()
Returns a type-specific big-list iterator on this type-specific big list.
|
ObjectBigListIterator<K> |
listIterator(long index)
Returns a type-specific list iterator on this type-specific big list starting at a given index.
|
K |
peek(int i)
Peeks at an element on the stack (optional operation).
|
K |
pop()
Pops the top off the stack.
|
void |
push(K o)
Pushes the given object on the stack.
|
K |
remove(long i)
Removes the element at the specified position.
|
void |
removeElements(long from,
long to)
Removes (hopefully quickly) elements of this type-specific big list.
|
K |
set(long index,
K k)
Replaces the element at the specified position in this big list with the specified element (optional operation).
|
int |
size()
Deprecated.
Please use
Size64.size64() instead. |
void |
size(long size)
Sets the size of this big list.
|
ReferenceBigList<K> |
subList(long from,
long to)
Returns a type-specific view of the portion of this type-specific big list from the index
from, inclusive, to the index to, exclusive. |
K |
top()
Peeks at the top of the stack (optional operation).
|
String |
toString() |
containsAll, isEmpty, remove, removeAll, retainAll, toArray, toArraycontainsAll, isEmpty, parallelStream, remove, removeAll, removeIf, retainAll, spliterator, stream, toArray, toArraypublic void add(long index,
K k)
This implementation always throws an UnsupportedOperationException.
add in interface BigList<K>index - a position in the big list.k - an element to be inserted.List.add(int,Object)public boolean add(K k)
This implementation delegates to the type-specific version of BigList.add(long, Object).
add in interface Collection<K>add in class AbstractCollection<K>public K remove(long i)
This implementation always throws an UnsupportedOperationException.
remove in interface BigList<K>i - a position in the big list.List.remove(int)public K set(long index, K k)
This implementation always throws an UnsupportedOperationException.
set in interface BigList<K>index - a position in the big list.k - the element to be stored at the specified position.List.set(int,Object)public boolean addAll(long index,
Collection<? extends K> c)
addAll in interface BigList<K>index - index at which to insert the first element from the specified collection.c - collection containing elements to be added to this big list.true if this big list changed as a result of the callList.addAll(int, Collection)public boolean addAll(Collection<? extends K> c)
This implementation delegates to the type-specific version of BigList.addAll(long, Collection).
addAll in interface Collection<K>addAll in class AbstractCollection<K>public ObjectBigListIterator<K> iterator()
Note that this specification strengthens the one given in
Iterable.iterator(), which was already
strengthened in the corresponding type-specific class,
but was weakened by the fact that this interface extends Collection.
This implementation delegates to listIterator().
iterator in interface ObjectIterable<K>iterator in interface ReferenceBigList<K>iterator in interface ReferenceCollection<K>iterator in interface Iterable<K>iterator in interface Collection<K>iterator in class AbstractReferenceCollection<K>Iterable.iterator()public ObjectBigListIterator<K> listIterator()
Note that this specification strengthens the one given in BigList.listIterator().
This implementation delegates to listIterator(0).
listIterator in interface BigList<K>listIterator in interface ReferenceBigList<K>BigList.listIterator()public ObjectBigListIterator<K> listIterator(long index)
Note that this specification strengthens the one given in BigList.listIterator(long).
This implementation is based on the random-access methods.
listIterator in interface BigList<K>listIterator in interface ReferenceBigList<K>index - index of first element to be returned from the big-list iterator.BigList.listIterator(long)public boolean contains(Object k)
This implementation delegates to indexOf().
contains in interface Collection<K>contains in class AbstractCollection<K>Collection.contains(Object)public long indexOf(Object k)
BigListindexOf in interface BigList<K>k - the object to search for.List.indexOf(Object)public long lastIndexOf(Object k)
BigListlastIndexOf in interface BigList<K>k - the object to search for.List.lastIndexOf(Object)public void size(long size)
BigListIf the specified size is smaller than the current size, the last elements are
discarded. Otherwise, they are filled with 0/null/false.
public ReferenceBigList<K> subList(long from, long to)
ReferenceBigListfrom, inclusive, to the index to, exclusive.
Note that this specification strengthens the one given in BigList.subList(long,long).
subList in interface BigList<K>subList in interface ReferenceBigList<K>from - the starting element (inclusive).to - the ending element (exclusive).BigList.subList(long,long)public void removeElements(long from,
long to)
This is a trivial iterator-based implementation. It is expected that implementations will override this method with a more optimized version.
removeElements in interface ReferenceBigList<K>from - the start index (inclusive).to - the end index (exclusive).public void addElements(long index,
K[][] a,
long offset,
long length)
This is a trivial iterator-based implementation. It is expected that implementations will override this method with a more optimized version.
addElements in interface ReferenceBigList<K>index - the index at which to add elements.a - the big array containing the elements.offset - the offset of the first element to add.length - the number of elements to add.public void addElements(long index,
K[][] a)
This implementation delegates to the analogous method for big-array fragments.
addElements in interface ReferenceBigList<K>index - the index at which to add elements.a - the big array containing the elements.public void getElements(long from,
Object[][] a,
long offset,
long length)
This is a trivial iterator-based implementation. It is expected that implementations will override this method with a more optimized version.
getElements in interface ReferenceBigList<K>from - the start index (inclusive).a - the destination big array.offset - the offset into the destination big array where to store the first element copied.length - the number of elements to be copied.public void clear()
This implementation delegates to removeElements(long, long).
clear in interface Collection<K>clear in class AbstractCollection<K>@Deprecated public int size()
Size64.size64() instead.Integer.MAX_VALUE.
This default implementation follows the definition above, which is compatible
with Collection.size().
This implementation delegates to Size64.size64().
size in interface BigList<K>size in interface Size64size in interface Collection<K>size in class AbstractCollection<K>Integer.MAX_VALUE.Collection.size()public int hashCode()
List.hashCode().hashCode in interface Collection<K>hashCode in class Objectpublic boolean equals(Object o)
equals in interface Collection<K>equals in class Objectpublic void push(K o)
Stackpublic K top()
StackThis default implementation returns peek(0).
public K peek(int i)
StackThis default implementation just throws an UnsupportedOperationException.
public String toString()
toString in class AbstractReferenceCollection<K>