public static class ObjectBigLists.EmptyBigList<K> extends ObjectCollections.EmptyCollection<K> implements ObjectBigList<K>, Serializable, Cloneable
This class may be useful to implement your own in case you subclass a type-specific list.
| Modifier and Type | Method and Description |
|---|---|
void |
add(long index,
K k)
Inserts the specified element at the specified position in this big list (optional operation).
|
boolean |
addAll(long i,
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.
|
Object |
clone()
Creates and returns a copy of this object.
|
int |
compareTo(BigList<? extends K> o)
Compares this object with the specified object for order.
|
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 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 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.
|
boolean |
remove(Object k)
Removes a single instance of the specified element from this
collection, if it is present (optional operation).
|
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).
|
void |
size(long s)
Sets the size of this big list.
|
long |
size64()
Returns the size of this data structure as a long.
|
ObjectBigList<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. |
String |
toString()
Returns a string representation of this collection.
|
addAll, clear, contains, removeAll, retainAll, size, toArrayadd, containsAll, isEmpty, toArrayadd, addAll, clear, contains, containsAll, isEmpty, parallelStream, 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 boolean remove(Object k)
java.util.AbstractCollectionThis implementation iterates over the collection looking for the specified element. If it finds the element, it removes the element from the collection using the iterator's remove method.
Note that this implementation throws an UnsupportedOperationException if the iterator returned by this collection's iterator method does not implement the remove method and this collection contains the specified object.
remove in interface Collection<K>remove in class AbstractCollection<K>k - element to be removed from this collection, if presentpublic K remove(long i)
BigListremove in interface BigList<K>i - a position in the big list.List.remove(int)public void add(long index,
K k)
BigListadd in interface BigList<K>index - a position in the big list.k - an element to be inserted.List.add(int,Object)public K set(long index, K k)
BigListset 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 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 i,
Collection<? extends K> c)
BigListaddAll in interface BigList<K>i - 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 ObjectBigListIterator<K> listIterator()
ObjectBigList
Note that this specification strengthens the one given in
BigList.listIterator().
listIterator in interface BigList<K>listIterator in interface ObjectBigList<K>BigList.listIterator()public ObjectBigListIterator<K> iterator()
java.util.AbstractCollectioniterator in interface ObjectBigList<K>iterator in interface ObjectCollection<K>iterator in interface ObjectIterable<K>iterator in interface Iterable<K>iterator in interface Collection<K>iterator in class ObjectCollections.EmptyCollection<K>Iterable.iterator()public ObjectBigListIterator<K> listIterator(long i)
ObjectBigList
Note that this specification strengthens the one given in
BigList.listIterator(long).
listIterator in interface BigList<K>listIterator in interface ObjectBigList<K>i - index of first element to be returned from the big-list iterator.BigList.listIterator(long)public ObjectBigList<K> subList(long from, long to)
ObjectBigListfrom, 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 ObjectBigList<K>from - the starting element (inclusive).to - the ending element (exclusive).BigList.subList(long,long)public void getElements(long from,
Object[][] a,
long offset,
long length)
ObjectBigListgetElements in interface ObjectBigList<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)
ObjectBigListremoveElements in interface ObjectBigList<K>from - the start index (inclusive).to - the end index (exclusive).public void addElements(long index,
K[][] a,
long offset,
long length)
ObjectBigListaddElements in interface ObjectBigList<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)
ObjectBigListaddElements in interface ObjectBigList<K>index - the index at which to add elements.a - the big array containing the elements.public void size(long s)
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 int compareTo(BigList<? extends K> o)
java.lang.ComparableThe implementor must ensure sgn(x.compareTo(y)) == -sgn(y.compareTo(x)) for all x and y. (This implies that x.compareTo(y) must throw an exception iff y.compareTo(x) throws an exception.)
The implementor must also ensure that the relation is transitive: (x.compareTo(y)>0 && y.compareTo(z)>0) implies x.compareTo(z)>0.
Finally, the implementor must ensure that x.compareTo(y)==0 implies that sgn(x.compareTo(z)) == sgn(y.compareTo(z)), for all z.
It is strongly recommended, but not strictly required that (x.compareTo(y)==0) == (x.equals(y)). Generally speaking, any class that implements the Comparable interface and violates this condition should clearly indicate this fact. The recommended language is "Note: this class has a natural ordering that is inconsistent with equals."
In the foregoing description, the notation sgn(expression) designates the mathematical signum function, which is defined to return one of -1, 0, or 1 according to whether the value of expression is negative, zero or positive.
compareTo in interface Comparable<BigList<? extends K>>o - the object to be compared.public Object clone()
java.lang.Objectx, the expression:
will be true, and that the expression:x.clone() != x
will bex.clone().getClass() == x.getClass()
true, but these are not absolute requirements.
While it is typically the case that:
will bex.clone().equals(x)
true, this is not an absolute requirement.
By convention, the returned object should be obtained by calling
super.clone. If a class and all of its superclasses (except
Object) obey this convention, it will be the case that
x.clone().getClass() == x.getClass().
By convention, the object returned by this method should be independent
of this object (which is being cloned). To achieve this independence,
it may be necessary to modify one or more fields of the object returned
by super.clone before returning it. Typically, this means
copying any mutable objects that comprise the internal "deep structure"
of the object being cloned and replacing the references to these
objects with references to the copies. If a class contains only
primitive fields or references to immutable objects, then it is usually
the case that no fields in the object returned by super.clone
need to be modified.
The method clone for class Object performs a
specific cloning operation. First, if the class of this object does
not implement the interface Cloneable, then a
CloneNotSupportedException is thrown. Note that all arrays
are considered to implement the interface Cloneable and that
the return type of the clone method of an array type T[]
is T[] where T is any reference or primitive type.
Otherwise, this method creates a new instance of the class of this
object and initializes all its fields with exactly the contents of
the corresponding fields of this object, as if by assignment; the
contents of the fields are not themselves cloned. Thus, this method
performs a "shallow copy" of this object, not a "deep copy" operation.
The class Object does not itself implement the interface
Cloneable, so calling the clone method on an object
whose class is Object will result in throwing an
exception at run time.
public 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 ObjectCollections.EmptyCollection<K>Object.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 ObjectCollections.EmptyCollection<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 String toString()
java.util.AbstractCollectionString.valueOf(Object).toString in class AbstractObjectCollection<K>