public static class ReferenceBigLists.UnmodifiableBigList<K> extends ReferenceCollections.UnmodifiableCollection<K> implements ReferenceBigList<K>, Serializable
| Modifier and Type | Method and Description |
|---|---|
void |
add(long i,
K k)
Inserts the specified element at the specified position in this big list (optional operation).
|
boolean |
addAll(long index,
Collection<? extends K> c)
Inserts all of the elements in the specified collection into this big list at the specified position (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.
|
boolean |
equals(Object o)
Indicates whether some other object is "equal to" this one.
|
K |
get(long i)
Returns the element at the specified position.
|
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 a hash code value for the object.
|
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 i)
Returns a type-specific list iterator on this type-specific big list
starting at a given index.
|
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 i,
K k)
Replaces the element at the specified position in this big list with the specified element (optional operation).
|
void |
size(long size)
Deprecated.
|
long |
size64()
Returns the size of this data structure as a long.
|
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. |
add, addAll, clear, contains, containsAll, isEmpty, remove, removeAll, retainAll, size, toArray, toArray, toStringadd, addAll, clear, contains, containsAll, isEmpty, parallelStream, remove, removeAll, removeIf, retainAll, size, spliterator, stream, toArray, toArraypublic K get(long i)
BigListget in interface BigList<K>i - a position in the big list.List.get(int)public K set(long i, K k)
BigListset in interface BigList<K>i - a position in the big list.k - the element to be stored at the specified position.List.set(int,Object)public void add(long i,
K k)
BigListadd in interface BigList<K>i - a position in the big list.k - an element to be inserted.List.add(int,Object)public K remove(long i)
BigListremove in interface BigList<K>i - a position in the big list.List.remove(int)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 boolean addAll(long index,
Collection<? extends K> c)
BigListaddAll 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 void getElements(long from,
Object[][] a,
long offset,
long length)
ReferenceBigListgetElements 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 removeElements(long from,
long to)
ReferenceBigListremoveElements 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)
ReferenceBigListaddElements 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)
ReferenceBigListaddElements in interface ReferenceBigList<K>index - the index at which to add elements.a - the big array containing the elements.@Deprecated 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 long size64()
Size64public ObjectBigListIterator<K> iterator()
ReferenceCollection
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.
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 ReferenceCollections.UnmodifiableCollection<K>Iterable.iterator()public ObjectBigListIterator<K> listIterator()
ReferenceBigList
Note that this specification strengthens the one given in
BigList.listIterator().
listIterator in interface BigList<K>listIterator in interface ReferenceBigList<K>BigList.listIterator()public ObjectBigListIterator<K> listIterator(long i)
ReferenceBigList
Note that this specification strengthens the one given in
BigList.listIterator(long).
listIterator in interface BigList<K>listIterator in interface ReferenceBigList<K>i - index of first element to be returned from the big-list iterator.BigList.listIterator(long)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 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 ReferenceCollections.UnmodifiableCollection<K>o - the reference object with which to compare.true if this object is the same as the obj
argument; false otherwise.Object.hashCode(),
HashMappublic int hashCode()
java.lang.ObjectHashMap.
The general contract of hashCode is:
hashCode method
must consistently return the same integer, provided no information
used in equals comparisons on the object is modified.
This integer need not remain consistent from one execution of an
application to another execution of the same application.
equals(Object)
method, then calling the hashCode method on each of
the two objects must produce the same integer result.
Object.equals(java.lang.Object)
method, then calling the hashCode method on each of the
two objects must produce distinct integer results. However, the
programmer should be aware that producing distinct integer results
for unequal objects may improve the performance of hash tables.
As much as is reasonably practical, the hashCode method defined by
class Object does return distinct integers for distinct
objects. (This is typically implemented by converting the internal
address of the object into an integer, but this implementation
technique is not required by the
Java™ programming language.)
hashCode in interface Collection<K>hashCode in class ReferenceCollections.UnmodifiableCollection<K>Object.equals(java.lang.Object),
System.identityHashCode(java.lang.Object)