protected static class BTreeMapJava.DescendingMap<K,V> extends java.util.AbstractMap<K,V> implements BTreeMapJava.ConcurrentNavigableMap2<K,V>
Modifier and Type | Field and Description |
---|---|
protected K |
hi |
protected boolean |
hiInclusive |
protected K |
lo |
protected boolean |
loInclusive |
protected org.mapdb.ConcurrentNavigableMapExtra<K,V> |
m |
Constructor and Description |
---|
DescendingMap(org.mapdb.ConcurrentNavigableMapExtra<K,V> m,
K lo,
boolean loInclusive,
K hi,
boolean hiInclusive) |
Modifier and Type | Method and Description |
---|---|
java.util.Map.Entry<K,V> |
ceilingEntry(K key) |
K |
ceilingKey(K key) |
void |
clear() |
java.util.Comparator<? super K> |
comparator() |
boolean |
containsKey(java.lang.Object key) |
boolean |
containsValue(java.lang.Object value) |
java.util.NavigableSet<K> |
descendingKeySet() |
java.util.concurrent.ConcurrentNavigableMap<K,V> |
descendingMap() |
java.util.Set<java.util.Map.Entry<K,V>> |
entrySet() |
java.util.Map.Entry<K,V> |
firstEntry() |
K |
firstKey() |
K |
firstKey2() |
java.util.Map.Entry<K,V> |
floorEntry(K key) |
K |
floorKey(K key) |
V |
get(java.lang.Object key) |
BTreeMapJava.DescendingMap<K,V> |
headMap(K toKey) |
BTreeMapJava.DescendingMap<K,V> |
headMap(K toKey,
boolean inclusive) |
java.util.Map.Entry<K,V> |
higherEntry(K key) |
K |
higherKey(K key) |
boolean |
isEmpty() |
java.util.NavigableSet<K> |
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() |
java.util.Map.Entry<K,V> |
pollFirstEntry() |
java.util.Map.Entry<K,V> |
pollLastEntry() |
V |
put(K key,
V value) |
V |
putIfAbsent(K key,
V value) |
V |
remove(java.lang.Object key) |
boolean |
remove(java.lang.Object key,
java.lang.Object value) |
V |
replace(K key,
V value) |
boolean |
replace(K key,
V oldValue,
V newValue) |
int |
size() |
BTreeMapJava.DescendingMap<K,V> |
subMap(K fromKey,
boolean fromInclusive,
K toKey,
boolean toInclusive) |
BTreeMapJava.DescendingMap<K,V> |
subMap(K fromKey,
K toKey) |
BTreeMapJava.DescendingMap<K,V> |
tailMap(K fromKey) |
BTreeMapJava.DescendingMap<K,V> |
tailMap(K fromKey,
boolean inclusive) |
clone, equals, hashCode, putAll, toString, values
finalize, getClass, notify, notifyAll, wait, wait, wait
protected final K lo
protected final boolean loInclusive
protected final K hi
protected final boolean hiInclusive
public boolean containsKey(java.lang.Object key)
public V get(java.lang.Object key)
public V remove(java.lang.Object key)
public int size()
public boolean isEmpty()
public boolean containsValue(java.lang.Object value)
public void clear()
public boolean remove(java.lang.Object key, java.lang.Object value)
public java.util.Comparator<? super K> comparator()
public K firstKey2()
firstKey2
in interface BTreeMapJava.ConcurrentNavigableMap2<K,V>
public K lastKey2()
lastKey2
in interface BTreeMapJava.ConcurrentNavigableMap2<K,V>
public BTreeMapJava.DescendingMap<K,V> subMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive)
public BTreeMapJava.DescendingMap<K,V> headMap(K toKey, boolean inclusive)
public BTreeMapJava.DescendingMap<K,V> tailMap(K fromKey, boolean inclusive)
public BTreeMapJava.DescendingMap<K,V> subMap(K fromKey, K toKey)
public BTreeMapJava.DescendingMap<K,V> headMap(K toKey)
public BTreeMapJava.DescendingMap<K,V> tailMap(K fromKey)
public java.util.NavigableSet<K> navigableKeySet()
public java.util.NavigableSet<K> keySet()
public java.util.NavigableSet<K> descendingKeySet()
Copyright © 2018. All Rights Reserved.