Constructor and Description |
---|
TableCutList(int increment,
boolean enableQuickLookup) |
Modifier and Type | Method and Description |
---|---|
void |
clear() |
TableCutList |
clone() |
boolean |
containsKey(long key) |
long |
findKey(long key,
boolean upperBounds) |
int |
findKeyPosition(long coordinate,
boolean greater)
Tries to locate the key that matches the given key-parameter as closely as possible.
|
int |
findKeyPosition(long coordinate,
boolean greater,
int lastFoundPos) |
Boolean |
get(long key) |
long |
getKeyAt(int indexPosition) |
long[] |
getKeys()
Deprecated.
Always provide a buffer for performance reasons.
|
long[] |
getKeys(long[] retval) |
Boolean |
getPrevious(long key) |
Boolean[] |
getRawEntries() |
Boolean |
getValueAt(int indexPosition) |
boolean |
isEnableQuickLookup() |
boolean |
put(long key,
Boolean entry) |
boolean |
remove(long key) |
void |
removeAll(long[] cutArray,
long cutSize)
Expects a sorted (ascending) list of cut-entries that should be removed.
|
void |
setEnableQuickLookup(boolean enableQuickLookup) |
int |
size() |
public TableCutList clone()
public void clear()
public boolean isEnableQuickLookup()
public void setEnableQuickLookup(boolean enableQuickLookup)
public int size()
public boolean put(long key, Boolean entry)
public boolean remove(long key)
public Boolean get(long key)
public Boolean getPrevious(long key)
public boolean containsKey(long key)
public Boolean[] getRawEntries()
public long[] getKeys()
public long[] getKeys(long[] retval)
public int findKeyPosition(long coordinate, boolean greater)
coordinate
- greater
- public int findKeyPosition(long coordinate, boolean greater, int lastFoundPos)
public long getKeyAt(int indexPosition)
public Boolean getValueAt(int indexPosition)
public long findKey(long key, boolean upperBounds)
public void removeAll(long[] cutArray, long cutSize)
cutArray
-