BigList<K>, ObjectIterable<K>, ReferenceBigList<K>, ReferenceCollection<K>, Size64, Stack<K>, java.io.Serializable, java.lang.Iterable<K>, java.util.Collection<K>public static class AbstractReferenceBigList.ReferenceSubList<K> extends AbstractReferenceBigList<K> implements java.io.Serializable
AbstractReferenceBigList.ReferenceSubList<K>| Constructor | Description |
|---|---|
ReferenceSubList(ReferenceBigList<K> l,
long from,
long to) |
| Modifier and Type | Method | Description |
|---|---|---|
void |
add(long index,
K k) |
Inserts the specified element at the specified position in this big list (optional operation).
|
boolean |
add(K k) |
|
boolean |
addAll(long index,
java.util.Collection<? extends K> c) |
Adds all of the elements in the specified collection to this list (optional
operation).
|
void |
addElements(long index,
K[][] a,
long offset,
long length) |
Add (hopefully quickly) elements to this type-specific big list.
|
K |
get(long index) |
Returns the element at the specified position.
|
void |
getElements(long from,
java.lang.Object[][] a,
long offset,
long length) |
Copies (hopefully quickly) elements of this type-specific big list into the
given big array.
|
ObjectBigListIterator<K> |
listIterator(long index) |
Returns a type-specific list iterator on this type-specific big list starting
at a given index.
|
K |
remove(long index) |
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).
|
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. |
containsAll, isEmpty, remove, removeAll, retainAll, toArray, toArrayaddAll, addElements, clear, contains, equals, hashCode, indexOf, iterator, lastIndexOf, listIterator, peek, pop, push, size, size, top, toStringpublic ReferenceSubList(ReferenceBigList<K> l, long from, long to)
public boolean add(K k)
AbstractReferenceBigList
This implementation delegates to the type-specific version of
BigList.add(long, Object).
add in interface java.util.Collection<K>add in class AbstractReferenceBigList<K>public void add(long index,
K k)
AbstractReferenceBigList
This implementation always throws an UnsupportedOperationException.
public boolean addAll(long index,
java.util.Collection<? extends K> c)
AbstractReferenceBigListaddAll in interface BigList<K>addAll in class AbstractReferenceBigList<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 K get(long index)
BigListpublic K remove(long index)
AbstractReferenceBigList
This implementation always throws an UnsupportedOperationException.
public K set(long index, K k)
AbstractReferenceBigList
This implementation always throws an UnsupportedOperationException.
public long size64()
Size64public void getElements(long from,
java.lang.Object[][] a,
long offset,
long length)
AbstractReferenceBigListThis 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>getElements in class AbstractReferenceBigList<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)
AbstractReferenceBigListThis 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>removeElements in class AbstractReferenceBigList<K>from - the start index (inclusive).to - the end index (exclusive).public void addElements(long index,
K[][] a,
long offset,
long length)
AbstractReferenceBigListThis 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>addElements in class AbstractReferenceBigList<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 ObjectBigListIterator<K> listIterator(long index)
AbstractReferenceBigList
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>listIterator in class AbstractReferenceBigList<K>index - 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>subList in class AbstractReferenceBigList<K>from - the starting element (inclusive).to - the ending element (exclusive).BigList.subList(long,long)