|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface IStateLongVector
Describes an search vector with states (describing some history of the data structure).
Field Summary | |
---|---|
static Logger |
LOGGER
|
static int |
MIN_CAPACITY
Minimal capacity of a vector |
Method Summary | |
---|---|
void |
add(long i)
Adds a new search at the end of the vector. |
boolean |
contain(long val)
|
long |
get(int index)
Returns the index th element of the vector. |
DisposableIntIterator |
getIterator()
|
boolean |
isEmpty()
Checks if the vector is empty. |
long |
quickGet(int index)
access an element without any bound check |
long |
quickSet(int index,
long val)
Assigns a new value val to the element indexth and return the old value without bound check |
void |
remove(int idx)
Removes an int. |
void |
removeLast()
removes the search at the end of the vector. |
long |
set(int index,
long val)
Assigns a new value val to the element index and returns
the old value |
int |
size()
Returns the current size of the stored search vector. |
Field Detail |
---|
static final Logger LOGGER
static final int MIN_CAPACITY
Method Detail |
---|
int size()
boolean isEmpty()
void add(long i)
i
- The search to add.boolean contain(long val)
void remove(int idx)
idx
- The search to remove.void removeLast()
long get(int index)
index
th element of the vector.
long quickGet(int index)
index
-
long set(int index, long val)
val
to the element index
and returns
the old value
long quickSet(int index, long val)
index
- the index where the value is modifiedval
- the new value
DisposableIntIterator getIterator()
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |