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)
Ensures that this collection contains the specified element (optional
operation).
|
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)
Adds all of the elements in the specified collection to this collection
(optional operation).
|
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()
Removes all of the elements from this collection (optional operation).
|
boolean |
contains(Object k)
Returns true if this list contains the specified element.
|
boolean |
equals(Object o)
Indicates whether some other object is "equal to" this one.
|
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 an iterator over the elements contained in 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()
Returns a string representation of this collection.
|
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)
Collections that support this operation may place limitations on what elements may be added to this collection. In particular, some collections will refuse to add null elements, and others will impose restrictions on the type of elements that may be added. Collection classes should clearly specify in their documentation any restrictions on what elements may be added.
If a collection refuses to add a particular element for any reason other than that it already contains the element, it must throw an exception (rather than returning false). This preserves the invariant that a collection always contains the specified element after this call returns.
This implementation always throws an UnsupportedOperationException.
This implementation delegates to the type-specific version of
BigList.add(long, Object).
add in interface Collection<K>add in class AbstractCollection<K>k - element whose presence in this collection is to be ensuredpublic 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 iterates over the specified collection, and adds each object returned by the iterator to this collection, in turn.
Note that this implementation will throw an UnsupportedOperationException unless add is overridden (assuming the specified collection is non-empty).
This implementation delegates to the type-specific version of
BigList.addAll(long, Collection).
addAll in interface Collection<K>addAll in class AbstractCollection<K>c - collection containing elements to be added to this collectionAbstractCollection.add(Object)public ObjectBigListIterator<K> iterator()
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>k - element whose presence in this collection is to be testedCollection.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 iterates over this collection, removing each element using the Iterator.remove operation. Most implementations will probably choose to override this method for efficiency.
Note that this implementation will throw an UnsupportedOperationException if the iterator returned by this collection's iterator method does not implement the remove method and this collection is non-empty.
This implementation delegates to removeElements(long, long).
clear in interface Collection<K>clear in class AbstractCollection<K>@Deprecated public int size()
Size64.size64() instead.
This implementation delegates to Size64.size64().
size in interface Size64size in interface Collection<K>size in class AbstractCollection<K>Collection.size()public int hashCode()
List.hashCode().hashCode in interface Collection<K>hashCode in class ObjectObject.equals(java.lang.Object),
System.identityHashCode(java.lang.Object)public boolean equals(Object o)
java.lang.Object
The equals method implements an equivalence relation
on non-null object references:
x, x.equals(x) should return
true.
x and y, x.equals(y)
should return true if and only if
y.equals(x) returns true.
x, y, and z, if
x.equals(y) returns true and
y.equals(z) returns true, then
x.equals(z) should return true.
x and y, multiple invocations of
x.equals(y) consistently return true
or consistently return false, provided no
information used in equals comparisons on the
objects is modified.
x,
x.equals(null) should return false.
The equals method for class Object implements
the most discriminating possible equivalence relation on objects;
that is, for any non-null reference values x and
y, this method returns true if and only
if x and y refer to the same object
(x == y has the value true).
Note that it is generally necessary to override the hashCode
method whenever this method is overridden, so as to maintain the
general contract for the hashCode method, which states
that equal objects must have equal hash codes.
equals in interface Collection<K>equals in class Objecto - the reference object with which to compare.true if this object is the same as the obj
argument; false otherwise.Object.hashCode(),
HashMappublic 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()
java.util.AbstractCollectionString.valueOf(Object).toString in class AbstractReferenceCollection<K>