|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectjava.util.AbstractCollection<K>
it.unimi.dsi.fastutil.objects.AbstractReferenceCollection<K>
it.unimi.dsi.fastutil.objects.AbstractReferenceBigList<K>
public abstract class AbstractReferenceBigList<K>
An abstract class providing basic methods for big lists implementing a type-specific big list interface.
Nested Class Summary | |
---|---|
static class |
AbstractReferenceBigList.ReferenceSubList<K>
|
Method Summary | |
---|---|
boolean |
add(K k)
|
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)
Delegates to a more generic method. |
boolean |
addAll(int index,
Collection<? extends K> c)
|
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)
Adds elements to this type-specific big list one-by-one. |
boolean |
contains(Object k)
|
boolean |
equals(Object o)
|
K |
get(int index)
|
void |
getElements(long from,
Object[][] a,
long offset,
long length)
Copies element of this type-specific big list into the given big array one-by-one. |
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 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(int index)
|
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(int i)
|
K |
remove(long i)
Removes the element at the specified position. |
void |
removeElements(long from,
long to)
Removes elements of this type-specific big list one-by-one. |
K |
set(int index,
K k)
|
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. |
void |
size(int size)
|
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()
|
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractReferenceCollection |
---|
containsAll, isEmpty, objectIterator, removeAll, retainAll, toArray, toArray |
Methods inherited from class java.util.AbstractCollection |
---|
clear, remove |
Methods inherited from class java.lang.Object |
---|
getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface it.unimi.dsi.fastutil.BigList |
---|
get |
Methods inherited from interface it.unimi.dsi.fastutil.Size64 |
---|
size64 |
Methods inherited from interface it.unimi.dsi.fastutil.objects.ReferenceCollection |
---|
objectIterator, toArray |
Methods inherited from interface java.util.Collection |
---|
clear, containsAll, isEmpty, remove, removeAll, retainAll, toArray |
Methods inherited from interface it.unimi.dsi.fastutil.Stack |
---|
isEmpty |
Method Detail |
---|
public void add(long index, K k)
BigList
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)
add
in interface Collection<K>
add
in class AbstractReferenceCollection<K>
public K remove(long i)
BigList
remove
in interface BigList<K>
i
- a position in the big list.
List.remove(int)
public K remove(int i)
public K set(long index, K k)
BigList
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 K set(int index, K k)
public boolean addAll(long index, Collection<? extends K> c)
BigList
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(int index, Collection<? extends K> c)
public boolean addAll(Collection<? extends K> c)
addAll
in interface Collection<K>
addAll
in class AbstractReferenceCollection<K>
c
- a collection.
true
if this collection changed as a result of the call.public 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 AbstractReferenceCollection<K>
List.iterator()
public ObjectBigListIterator<K> listIterator()
ReferenceBigList
listIterator
in interface BigList<K>
listIterator
in interface ReferenceBigList<K>
List.listIterator()
public ObjectBigListIterator<K> listIterator(long index)
ReferenceBigList
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 ObjectBigListIterator<K> listIterator(int index)
public boolean contains(Object k)
contains
in interface Collection<K>
contains
in class AbstractCollection<K>
public long indexOf(Object k)
BigList
indexOf
in interface BigList<K>
k
- the object to search for.
List.indexOf(Object)
public long lastIndexOf(Object k)
BigList
lastIndexOf
in interface BigList<K>
k
- the object to search for.
List.lastIndexOf(Object)
public void size(long size)
BigList
If the specified size is smaller than the current size, the last elements are
discarded. Otherwise, they are filled with 0/null
/false
.
size
in interface BigList<K>
size
- the new size.public void size(int size)
public ReferenceBigList<K> subList(long from, long to)
ReferenceBigList
from
, 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)
ReferenceBigList
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.@Deprecated public int size()
Size64
Integer.MAX_VALUE
.
size
in interface Size64
size
in interface Collection<K>
size
in class AbstractCollection<K>
Integer.MAX_VALUE
.Collection.size()
public boolean equals(Object o)
equals
in interface Collection<K>
equals
in class Object
public int hashCode()
List.hashCode()
.
hashCode
in interface Collection<K>
hashCode
in class Object
public void push(K o)
Stack
push
in interface Stack<K>
o
- the object that will become the new top of the stack.public K pop()
Stack
pop
in interface Stack<K>
public K top()
Stack
top
in interface Stack<K>
public K peek(int i)
Stack
peek
in interface Stack<K>
i
-th element on the stack; 0 represents the top.public K get(int index)
public String toString()
toString
in class AbstractReferenceCollection<K>
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |