public static class MemorySparseMatrixState.MemorySparseVector<T> extends TreeMap<Long,T> implements SparseMatrixState.SparseVector<T>
AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>| Constructor and Description |
|---|
MemorySparseMatrixState.MemorySparseVector() |
MemorySparseMatrixState.MemorySparseVector(Map<Long,T> map) |
| Modifier and Type | Method and Description |
|---|---|
T |
get(long i)
Gets a specific value
|
Set<Long> |
indexes()
Returns a
Set of the present indexes (ordered ASC) |
void |
set(long i,
T value)
Sets/Replace a specific value
|
ceilingEntry, ceilingKey, clear, clone, comparator, containsKey, containsValue, descendingKeySet, descendingMap, entrySet, firstEntry, firstKey, floorEntry, floorKey, get, headMap, headMap, higherEntry, higherKey, keySet, lastEntry, lastKey, lowerEntry, lowerKey, navigableKeySet, pollFirstEntry, pollLastEntry, put, putAll, remove, size, subMap, subMap, tailMap, tailMap, valuesequals, hashCode, isEmpty, toStringpublic MemorySparseMatrixState.MemorySparseVector()
public T get(long i)
SparseMatrixState.SparseVectorget in interface SparseMatrixState.SparseVector<T>i - value indexnull if no value was foundpublic void set(long i,
T value)
SparseMatrixState.SparseVectorset in interface SparseMatrixState.SparseVector<T>i - value indexvalue - the new valuepublic Set<Long> indexes()
SparseMatrixState.SparseVectorSet of the present indexes (ordered ASC)indexes in interface SparseMatrixState.SparseVector<T>Copyright © 2013. All rights reserved.