public class SortedTableMap<K,V> implements ConcurrentNavigableMapExtra<K,V>
Read only Sorted Table Map. It stores data in table and uses binary search to find records
Modifier and Type | Class and Description |
---|---|
static class |
SortedTableMap.Companion |
static class |
SortedTableMap.NodeIterator |
static class |
SortedTableMap.Sink<K,V> |
Modifier and Type | Field and Description |
---|---|
static SortedTableMap.Companion |
Companion |
Constructor and Description |
---|
SortedTableMap(GroupSerializer<K> keySerializer,
GroupSerializer<V> valueSerializer,
long pageSize,
Volume volume,
boolean hasValues)
Read only Sorted Table Map. It stores data in table and uses binary search to find records
|
Modifier and Type | Method and Description |
---|---|
java.util.Map.Entry<K,V> |
ceilingEntry(K key) |
K |
ceilingKey(K key) |
void |
clear() |
void |
close() |
java.util.Comparator<? super K> |
comparator() |
boolean |
containsKey(java.lang.Object key) |
boolean |
containsValue(java.lang.Object value) |
java.util.Iterator<java.util.Map.Entry> |
descendingEntryIterator() |
java.util.Iterator<java.util.Map.Entry> |
descendingEntryIterator(K lo,
boolean loInclusive,
K hi,
boolean hiInclusive) |
java.util.Iterator<K> |
descendingKeyIterator() |
java.util.Iterator<K> |
descendingKeyIterator(K lo,
boolean loInclusive,
K hi,
boolean hiInclusive) |
java.util.NavigableSet<K> |
descendingKeySet() |
java.util.concurrent.ConcurrentNavigableMap<K,V> |
descendingMap() |
SortedTableMap.NodeIterator |
descendingNodeIterator() |
java.util.Iterator<V> |
descendingValueIterator() |
java.util.Iterator<V> |
descendingValueIterator(K lo,
boolean loInclusive,
K hi,
boolean hiInclusive) |
java.util.Iterator<java.util.Map.Entry> |
entryIterator() |
java.util.Iterator<java.util.Map.Entry> |
entryIterator(K lo,
boolean loInclusive,
K hi,
boolean hiInclusive) |
java.util.Set |
entrySet() |
boolean |
equals(java.lang.Object other) |
java.util.Map.Entry<K,V> |
findHigher(K key,
boolean inclusive) |
K |
findHigherKey(K key,
boolean inclusive) |
java.util.Map.Entry<K,V> |
findLower(K key,
boolean inclusive) |
K |
findLowerKey(K key,
boolean inclusive) |
java.util.Map.Entry<K,V> |
firstEntry() |
K |
firstKey() |
K |
firstKey2() |
java.util.Map.Entry<K,V> |
floorEntry(K key) |
K |
floorKey(K key) |
void |
forEach(java.util.function.BiConsumer<? super K,? super V> action) |
void |
forEachKey(Function1<? super K,Unit> procedure) |
void |
forEachValue(Function1<? super V,Unit> procedure) |
V |
get(java.lang.Object key) |
GroupSerializer<K> |
getComparator() |
java.util.Set<java.util.Map.Entry> |
getEntries() |
boolean |
getHasValues() |
GroupSerializer<K> |
getKeySerializer() |
java.util.NavigableSet<K> |
getKeys() |
long |
getPageCount() |
java.lang.Object |
getPageKeys()
first key at beginning of each page
|
long |
getPageSize() |
int |
getSize() |
long |
getSizeLong() |
GroupSerializer<V> |
getValueSerializer() |
java.util.Collection<V> |
getValues() |
Volume |
getVolume() |
java.util.concurrent.ConcurrentNavigableMap<K,V> |
headMap(K toKey,
boolean inclusive) |
java.util.concurrent.ConcurrentNavigableMap<K,V> |
headMap(K toKey) |
java.util.Map.Entry<K,V> |
higherEntry(K key) |
K |
higherKey(K key) |
boolean |
isClosed() |
boolean |
isEmpty() |
java.util.Iterator<K> |
keyIterator() |
java.util.Iterator<K> |
keyIterator(K lo,
boolean loInclusive,
K hi,
boolean hiInclusive) |
java.util.Set |
keySet() |
java.util.Map.Entry<K,V> |
lastEntry() |
K |
lastKey() |
K |
lastKey2() |
java.util.Map.Entry<K,V> |
lowerEntry(K key) |
K |
lowerKey(K key) |
java.util.NavigableSet<K> |
navigableKeySet() |
SortedTableMap.NodeIterator |
nodeIterator() |
SortedTableMap.NodeIterator |
nodeIterator(K lo) |
int |
nodeSearch(K key,
long offset,
long offsetWithHead,
int nodeCount) |
java.util.Map.Entry<K,V> |
pollFirstEntry() |
java.util.Map.Entry<K,V> |
pollLastEntry() |
V |
put(K key,
V value) |
void |
putAll(java.util.Map<? extends K,? extends V> from) |
V |
putIfAbsent(K key,
V value) |
boolean |
putIfAbsentBoolean(K key,
V value)
Atomically associates the specified key with the given value if it is
not already associated with a value.
|
V |
remove(java.lang.Object key) |
boolean |
remove(java.lang.Object key,
java.lang.Object value) |
boolean |
replace(K key,
V oldValue,
V newValue) |
V |
replace(K key,
V value) |
int |
size() |
long |
sizeLong()
map size as long number
|
java.util.concurrent.ConcurrentNavigableMap<K,V> |
subMap(K fromKey,
boolean fromInclusive,
K toKey,
boolean toInclusive) |
java.util.concurrent.ConcurrentNavigableMap<K,V> |
subMap(K fromKey,
K toKey) |
java.util.concurrent.ConcurrentNavigableMap<K,V> |
tailMap(K fromKey,
boolean inclusive) |
java.util.concurrent.ConcurrentNavigableMap<K,V> |
tailMap(K fromKey) |
java.util.Iterator<V> |
valueIterator() |
java.util.Iterator<V> |
valueIterator(K lo,
boolean loInclusive,
K hi,
boolean hiInclusive) |
java.util.Collection |
values() |
descendingEntryIterator, descendingEntryIterator, descendingKeyIterator, descendingKeyIterator, descendingValueIterator, descendingValueIterator, entryIterator, findHigher, findHigherKey, findLower, findLowerKey, getHasValues, keyIterator, keyIterator, valueIterator
forEach, forEachKey, forEachValue, getKeySerializer, getValueSerializer, isClosed, putIfAbsentBoolean, sizeLong
firstKey2, lastKey2
public static SortedTableMap.Companion Companion
public SortedTableMap(GroupSerializer<K> keySerializer, GroupSerializer<V> valueSerializer, long pageSize, Volume volume, boolean hasValues)
Read only Sorted Table Map. It stores data in table and uses binary search to find records
public GroupSerializer<K> getComparator()
public long getSizeLong()
public long getPageCount()
public java.lang.Object getPageKeys()
first key at beginning of each page
public boolean containsKey(java.lang.Object key)
public boolean containsValue(java.lang.Object value)
public V get(java.lang.Object key)
public int nodeSearch(K key, long offset, long offsetWithHead, int nodeCount)
public boolean isEmpty()
public int getSize()
public int size()
public long sizeLong()
map size as long number
public SortedTableMap.NodeIterator nodeIterator()
public SortedTableMap.NodeIterator nodeIterator(K lo)
public SortedTableMap.NodeIterator descendingNodeIterator()
public java.util.Iterator<K> keyIterator()
public java.util.Iterator<java.util.Map.Entry> entryIterator()
public java.util.Iterator<V> valueIterator()
public java.util.Set<java.util.Map.Entry> getEntries()
public java.util.Set entrySet()
public java.util.NavigableSet<K> getKeys()
public java.util.Set keySet()
public java.util.NavigableSet<K> navigableKeySet()
public java.util.Collection<V> getValues()
public java.util.Collection values()
public void clear()
public V put(K key, V value)
public void putAll(java.util.Map<? extends K,? extends V> from)
public V remove(java.lang.Object key)
public V putIfAbsent(K key, V value)
public boolean remove(java.lang.Object key, java.lang.Object value)
public boolean replace(K key, V oldValue, V newValue)
public V replace(K key, V value)
public boolean equals(java.lang.Object other)
public java.util.Comparator<? super K> comparator()
public K firstKey2()
public K lastKey2()
public K firstKey()
public K lastKey()
public java.util.Map.Entry<K,V> ceilingEntry(K key)
public K ceilingKey(K key)
public java.util.Map.Entry<K,V> firstEntry()
public java.util.Map.Entry<K,V> floorEntry(K key)
public K floorKey(K key)
public java.util.Map.Entry<K,V> higherEntry(K key)
public K higherKey(K key)
public java.util.Map.Entry<K,V> lastEntry()
public java.util.Map.Entry<K,V> lowerEntry(K key)
public K lowerKey(K key)
public java.util.Map.Entry<K,V> pollFirstEntry()
public java.util.Map.Entry<K,V> pollLastEntry()
public java.util.concurrent.ConcurrentNavigableMap<K,V> subMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive)
public java.util.concurrent.ConcurrentNavigableMap<K,V> headMap(K toKey, boolean inclusive)
public java.util.concurrent.ConcurrentNavigableMap<K,V> tailMap(K fromKey, boolean inclusive)
public java.util.concurrent.ConcurrentNavigableMap<K,V> subMap(K fromKey, K toKey)
public java.util.concurrent.ConcurrentNavigableMap<K,V> headMap(K toKey)
public java.util.concurrent.ConcurrentNavigableMap<K,V> tailMap(K fromKey)
public java.util.NavigableSet<K> descendingKeySet()
public java.util.concurrent.ConcurrentNavigableMap<K,V> descendingMap()
public java.util.Iterator<java.util.Map.Entry> descendingEntryIterator()
public java.util.Iterator<java.util.Map.Entry> descendingEntryIterator(K lo, boolean loInclusive, K hi, boolean hiInclusive)
public java.util.Iterator<K> descendingKeyIterator()
public java.util.Iterator<K> descendingKeyIterator(K lo, boolean loInclusive, K hi, boolean hiInclusive)
public java.util.Iterator<V> descendingValueIterator()
public java.util.Iterator<V> descendingValueIterator(K lo, boolean loInclusive, K hi, boolean hiInclusive)
public java.util.Iterator<java.util.Map.Entry> entryIterator(K lo, boolean loInclusive, K hi, boolean hiInclusive)
public java.util.Iterator<K> keyIterator(K lo, boolean loInclusive, K hi, boolean hiInclusive)
public java.util.Iterator<V> valueIterator(K lo, boolean loInclusive, K hi, boolean hiInclusive)
public java.util.Map.Entry<K,V> findHigher(K key, boolean inclusive)
public java.util.Map.Entry<K,V> findLower(K key, boolean inclusive)
public K findHigherKey(K key, boolean inclusive)
public K findLowerKey(K key, boolean inclusive)
public void forEachKey(Function1<? super K,Unit> procedure)
public void forEachValue(Function1<? super V,Unit> procedure)
public void forEach(java.util.function.BiConsumer<? super K,? super V> action)
public boolean isClosed()
public void close()
public boolean putIfAbsentBoolean(K key, V value)
Atomically associates the specified key with the given value if it is not already associated with a value.
This is equivalent to:
if(cache.containsKey(key)){}cache.put(key,value);return true;}else{return false;}
*
except that the action is performed atomically.
public GroupSerializer<K> getKeySerializer()
public GroupSerializer<V> getValueSerializer()
public long getPageSize()
public Volume getVolume()
public boolean getHasValues()