public static class AbstractIntBigList.IntSubList extends AbstractIntBigList implements Serializable
AbstractIntBigList.IntSubList
Constructor and Description |
---|
IntSubList(IntBigList l,
long from,
long to) |
Modifier and Type | Method and Description |
---|---|
boolean |
add(int k) |
void |
add(long index,
int k) |
boolean |
addAll(long index,
Collection<? extends Integer> c)
Inserts all of the elements in the specified collection into this big list at the specified position (optional operation).
|
boolean |
addAll(long index,
IntCollection c)
Delegates to a more generic method.
|
boolean |
addAll(long index,
IntList l) |
void |
addElements(long index,
int[][] a,
long offset,
long length)
Adds elements to this type-specific big list one-by-one.
|
void |
clear() |
void |
getElements(long from,
int[][] a,
long offset,
long length)
Copies element of this type-specific big list into the given big array one-by-one.
|
int |
getInt(long index) |
IntBigListIterator |
listIterator(long index)
Returns a type-specific list iterator on this type-specific big list starting at a given index.
|
boolean |
rem(int k)
|
boolean |
remove(Object o)
Delegates to the type-specific
rem() method. |
void |
removeElements(long from,
long to)
Removes elements of this type-specific big list one-by-one.
|
int |
removeInt(long index) |
int |
set(long index,
int k) |
long |
size64()
Returns the size of this data structure as a long.
|
IntBigList |
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, addAll, addAll, addAll, addAll, addElements, compareTo, contains, equals, get, getInt, hashCode, indexOf, indexOf, iterator, lastIndexOf, lastIndexOf, listIterator, listIterator, peek, peekInt, pop, popInt, push, push, remove, remove, removeInt, set, set, size, size, size, top, topInt, toString
add, contains, containsAll, containsAll, intIterator, isEmpty, rem, removeAll, removeAll, retainAll, retainAll, toArray, toArray, toArray, toIntArray, toIntArray
containsAll, intIterator, removeAll, retainAll, toArray, toArray, toIntArray, toIntArray
add, contains, containsAll, isEmpty, parallelStream, removeAll, removeIf, retainAll, spliterator, stream, toArray
public IntSubList(IntBigList l, long from, long to)
public boolean add(int k)
add
in interface IntCollection
add
in class AbstractIntBigList
Collection.add(Object)
public void add(long index, int k)
add
in interface IntBigList
add
in class AbstractIntBigList
List.add(int,Object)
public boolean addAll(long index, Collection<? extends Integer> c)
BigList
addAll
in interface BigList<Integer>
addAll
in class AbstractIntBigList
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 int getInt(long index)
getInt
in interface IntBigList
BigList.get(long)
public int removeInt(long index)
removeInt
in interface IntBigList
removeInt
in class AbstractIntBigList
BigList.remove(long)
public int set(long index, int k)
set
in interface IntBigList
set
in class AbstractIntBigList
BigList.set(long,Object)
public void clear()
clear
in interface Collection<Integer>
clear
in class AbstractCollection<Integer>
public long size64()
Size64
public void getElements(long from, int[][] a, long offset, long length)
AbstractIntBigList
This is a trivial iterator-based implementation. It is expected that implementations will override this method with a more optimized version.
getElements
in interface IntBigList
getElements
in class AbstractIntBigList
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)
AbstractIntBigList
This is a trivial iterator-based implementation. It is expected that implementations will override this method with a more optimized version.
removeElements
in interface IntBigList
removeElements
in class AbstractIntBigList
from
- the start index (inclusive).to
- the end index (exclusive).public void addElements(long index, int[][] a, long offset, long length)
AbstractIntBigList
This is a trivial iterator-based implementation. It is expected that implementations will override this method with a more optimized version.
addElements
in interface IntBigList
addElements
in class AbstractIntBigList
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 IntBigListIterator listIterator(long index)
IntBigList
listIterator
in interface BigList<Integer>
listIterator
in interface IntBigList
listIterator
in class AbstractIntBigList
index
- index of first element to be returned from the big-list iterator.BigList.listIterator(long)
public IntBigList subList(long from, long to)
IntBigList
from
, inclusive, to the index to
, exclusive.
Note that this specification strengthens the one given in BigList.subList(long,long)
.
subList
in interface BigList<Integer>
subList
in interface IntBigList
subList
in class AbstractIntBigList
from
- the starting element (inclusive).to
- the ending element (exclusive).BigList.subList(long,long)
public boolean rem(int k)
IntCollection
remove()
, but the clash with the similarly named index-based method in the List
interface
forces us to use a distinguished name. For simplicity, the set interfaces reinstates remove()
.rem
in interface IntCollection
rem
in class AbstractIntBigList
Collection.remove(Object)
public boolean remove(Object o)
AbstractIntCollection
rem()
method.remove
in interface Collection<Integer>
remove
in class AbstractIntCollection
public boolean addAll(long index, IntCollection c)
AbstractIntBigList
addAll
in interface IntBigList
addAll
in class AbstractIntBigList
List.addAll(int,java.util.Collection)
public boolean addAll(long index, IntList l)