org.mapdb

Class BTreeMap.DescendingMap<K,V>

java.lang.Object

java.util.AbstractMap<K,V>

org.mapdb.BTreeMap.DescendingMap<K,V>

All Implemented Interfaces:

java.util.concurrent.ConcurrentMap<K,V>, java.util.concurrent.ConcurrentNavigableMap<K,V>, java.util.Map<K,V>, java.util.NavigableMap<K,V>, java.util.SortedMap<K,V>

Enclosing class:

BTreeMap<K,V>

protected static class BTreeMap.DescendingMap<K,V>
extends java.util.AbstractMap<K,V>
implements java.util.concurrent.ConcurrentNavigableMap<K,V>

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
(package private) class	BTreeMap.DescendingMap.Iter<E>

Nested classes/interfaces inherited from class java.util.AbstractMap

java.util.AbstractMap.SimpleEntry<K,V>, java.util.AbstractMap.SimpleImmutableEntry<K,V>

Nested classes/interfaces inherited from interface java.util.Map

java.util.Map.Entry<K,V>

Field Summary

Fields

Modifier and Type	Field and Description
protected K	hi
protected boolean	hiInclusive
protected K	lo
protected boolean	loInclusive
protected BTreeMap<K,V>	m

Constructor Summary

Constructors

Constructor and Description
DescendingMap(BTreeMap<K,V> m, K lo, boolean loInclusive, K hi, boolean hiInclusive)

Method Summary

Modifier and Type	Method and Description
java.util.Map.Entry<K,V>	ceilingEntry(K key)
K	ceilingKey(K key)
private void	checkKeyBounds(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()
(package private) java.util.Iterator<java.util.Map.Entry<K,V>>	entryIterator()
java.util.Set<java.util.Map.Entry<K,V>>	entrySet()
java.util.Map.Entry<K,V>	firstEntry()
K	firstKey()
java.util.Map.Entry<K,V>	floorEntry(K key)
K	floorKey(K key)
V	get(java.lang.Object key)
BTreeMap.DescendingMap<K,V>	headMap(K toKey)
BTreeMap.DescendingMap<K,V>	headMap(K toKey, boolean inclusive)
java.util.Map.Entry<K,V>	higherEntry(K key)
K	higherKey(K key)
private boolean	inBounds(K key)
boolean	isEmpty()
(package private) java.util.Iterator<K>	keyIterator()
java.util.NavigableSet<K>	keySet()
java.util.Map.Entry<K,V>	lastEntry()
K	lastKey()
java.util.Map.Entry<K,V>	lowerEntry(K key)
K	lowerKey(K key)
java.util.NavigableSet<K>	navigableKeySet()
private BTreeMap.DescendingMap<K,V>	newSubMap(K toKey, boolean toInclusive, K fromKey, boolean fromInclusive) Utility to create submaps, where given bounds override unbounded(null) ones and/or are checked against bounded ones.
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()
BTreeMap.DescendingMap<K,V>	subMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive)
BTreeMap.DescendingMap<K,V>	subMap(K fromKey, K toKey)
BTreeMap.DescendingMap<K,V>	tailMap(K fromKey)
BTreeMap.DescendingMap<K,V>	tailMap(K fromKey, boolean inclusive)
private boolean	tooHigh(K key)
private boolean	tooLow(K key)
(package private) java.util.Iterator<V>	valueIterator()

Methods inherited from class java.util.AbstractMap

clone, equals, hashCode, putAll, toString, values

Methods inherited from class java.lang.Object

finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.util.concurrent.ConcurrentMap

compute, computeIfAbsent, computeIfPresent, forEach, getOrDefault, merge, replaceAll

Methods inherited from interface java.util.SortedMap

values

Methods inherited from interface java.util.Map

equals, hashCode, putAll

Field Detail

m

protected final BTreeMap<K,V> m

lo

protected final K lo

loInclusive

protected final boolean loInclusive

hi

protected final K hi

hiInclusive

protected final boolean hiInclusive

Constructor Detail

DescendingMap

public DescendingMap(BTreeMap<K,V> m,
                     K lo,
                     boolean loInclusive,
                     K hi,
                     boolean hiInclusive)

Method Detail

containsKey

public boolean containsKey(java.lang.Object key)

Specified by:

containsKey in interface java.util.Map<K,V>

Overrides:

containsKey in class java.util.AbstractMap<K,V>

get

public V get(java.lang.Object key)

Specified by:

get in interface java.util.Map<K,V>

Overrides:

get in class java.util.AbstractMap<K,V>

put

public V put(K key,
             V value)

Specified by:

put in interface java.util.Map<K,V>

Overrides:

put in class java.util.AbstractMap<K,V>

remove

public V remove(java.lang.Object key)

Specified by:

remove in interface java.util.Map<K,V>

Overrides:

remove in class java.util.AbstractMap<K,V>

size

public int size()

Specified by:

size in interface java.util.Map<K,V>

Overrides:

size in class java.util.AbstractMap<K,V>

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface java.util.Map<K,V>

Overrides:

isEmpty in class java.util.AbstractMap<K,V>

containsValue

public boolean containsValue(java.lang.Object value)

Specified by:

containsValue in interface java.util.Map<K,V>

Overrides:

containsValue in class java.util.AbstractMap<K,V>

clear

public void clear()

Specified by:

clear in interface java.util.Map<K,V>

Overrides:

clear in class java.util.AbstractMap<K,V>

putIfAbsent

public V putIfAbsent(K key,
                     V value)

Specified by:

putIfAbsent in interface java.util.concurrent.ConcurrentMap<K,V>

Specified by:

putIfAbsent in interface java.util.Map<K,V>

remove

public boolean remove(java.lang.Object key,
                      java.lang.Object value)

Specified by:

remove in interface java.util.concurrent.ConcurrentMap<K,V>

Specified by:

remove in interface java.util.Map<K,V>

replace

public boolean replace(K key,
                       V oldValue,
                       V newValue)

Specified by:

replace in interface java.util.concurrent.ConcurrentMap<K,V>

Specified by:

replace in interface java.util.Map<K,V>

replace

public V replace(K key,
                 V value)

Specified by:

replace in interface java.util.concurrent.ConcurrentMap<K,V>

Specified by:

replace in interface java.util.Map<K,V>

comparator

public java.util.Comparator<? super K> comparator()

Specified by:

comparator in interface java.util.SortedMap<K,V>

higherEntry

public java.util.Map.Entry<K,V> higherEntry(K key)

Specified by:

higherEntry in interface java.util.NavigableMap<K,V>

lowerKey

public K lowerKey(K key)

Specified by:

lowerKey in interface java.util.NavigableMap<K,V>

ceilingEntry

public java.util.Map.Entry<K,V> ceilingEntry(K key)

Specified by:

ceilingEntry in interface java.util.NavigableMap<K,V>

floorKey

public K floorKey(K key)

Specified by:

floorKey in interface java.util.NavigableMap<K,V>

floorEntry

public java.util.Map.Entry<K,V> floorEntry(K key)

Specified by:

floorEntry in interface java.util.NavigableMap<K,V>

ceilingKey

public K ceilingKey(K key)

Specified by:

ceilingKey in interface java.util.NavigableMap<K,V>

lowerEntry

public java.util.Map.Entry<K,V> lowerEntry(K key)

Specified by:

lowerEntry in interface java.util.NavigableMap<K,V>

higherKey

public K higherKey(K key)

Specified by:

higherKey in interface java.util.NavigableMap<K,V>

firstKey

public K firstKey()

Specified by:

firstKey in interface java.util.SortedMap<K,V>

lastKey

public K lastKey()

Specified by:

lastKey in interface java.util.SortedMap<K,V>

lastEntry

public java.util.Map.Entry<K,V> lastEntry()

Specified by:

lastEntry in interface java.util.NavigableMap<K,V>

firstEntry

public java.util.Map.Entry<K,V> firstEntry()

Specified by:

firstEntry in interface java.util.NavigableMap<K,V>

pollFirstEntry

public java.util.Map.Entry<K,V> pollFirstEntry()

Specified by:

pollFirstEntry in interface java.util.NavigableMap<K,V>

pollLastEntry

public java.util.Map.Entry<K,V> pollLastEntry()

Specified by:

pollLastEntry in interface java.util.NavigableMap<K,V>

newSubMap

private BTreeMap.DescendingMap<K,V> newSubMap(K toKey,
                                              boolean toInclusive,
                                              K fromKey,
                                              boolean fromInclusive)

Utility to create submaps, where given bounds override unbounded(null) ones and/or are checked against bounded ones.

subMap

public BTreeMap.DescendingMap<K,V> subMap(K fromKey,
                                          boolean fromInclusive,
                                          K toKey,
                                          boolean toInclusive)

Specified by:

subMap in interface java.util.concurrent.ConcurrentNavigableMap<K,V>

Specified by:

subMap in interface java.util.NavigableMap<K,V>

headMap

public BTreeMap.DescendingMap<K,V> headMap(K toKey,
                                           boolean inclusive)

Specified by:

headMap in interface java.util.concurrent.ConcurrentNavigableMap<K,V>

Specified by:

headMap in interface java.util.NavigableMap<K,V>

tailMap

public BTreeMap.DescendingMap<K,V> tailMap(K fromKey,
                                           boolean inclusive)

Specified by:

tailMap in interface java.util.concurrent.ConcurrentNavigableMap<K,V>

Specified by:

tailMap in interface java.util.NavigableMap<K,V>

subMap

public BTreeMap.DescendingMap<K,V> subMap(K fromKey,
                                          K toKey)

Specified by:

subMap in interface java.util.concurrent.ConcurrentNavigableMap<K,V>

Specified by:

subMap in interface java.util.NavigableMap<K,V>

Specified by:

subMap in interface java.util.SortedMap<K,V>

headMap

public BTreeMap.DescendingMap<K,V> headMap(K toKey)

Specified by:

headMap in interface java.util.concurrent.ConcurrentNavigableMap<K,V>

Specified by:

headMap in interface java.util.NavigableMap<K,V>

Specified by:

headMap in interface java.util.SortedMap<K,V>

tailMap

public BTreeMap.DescendingMap<K,V> tailMap(K fromKey)

Specified by:

tailMap in interface java.util.concurrent.ConcurrentNavigableMap<K,V>

Specified by:

tailMap in interface java.util.NavigableMap<K,V>

Specified by:

tailMap in interface java.util.SortedMap<K,V>

descendingMap

public java.util.concurrent.ConcurrentNavigableMap<K,V> descendingMap()

Specified by:

descendingMap in interface java.util.concurrent.ConcurrentNavigableMap<K,V>

Specified by:

descendingMap in interface java.util.NavigableMap<K,V>

navigableKeySet

public java.util.NavigableSet<K> navigableKeySet()

Specified by:

navigableKeySet in interface java.util.concurrent.ConcurrentNavigableMap<K,V>

Specified by:

navigableKeySet in interface java.util.NavigableMap<K,V>

tooLow

private boolean tooLow(K key)

tooHigh

private boolean tooHigh(K key)

inBounds

private boolean inBounds(K key)

checkKeyBounds

private void checkKeyBounds(K key)
                     throws java.lang.IllegalArgumentException

Throws:

java.lang.IllegalArgumentException

keySet

public java.util.NavigableSet<K> keySet()

Specified by:

keySet in interface java.util.concurrent.ConcurrentNavigableMap<K,V>

Specified by:

keySet in interface java.util.Map<K,V>

Specified by:

keySet in interface java.util.SortedMap<K,V>

Overrides:

keySet in class java.util.AbstractMap<K,V>

descendingKeySet

public java.util.NavigableSet<K> descendingKeySet()

Specified by:

descendingKeySet in interface java.util.concurrent.ConcurrentNavigableMap<K,V>

Specified by:

descendingKeySet in interface java.util.NavigableMap<K,V>

entrySet

public java.util.Set<java.util.Map.Entry<K,V>> entrySet()

Specified by:

entrySet in interface java.util.Map<K,V>

Specified by:

entrySet in interface java.util.SortedMap<K,V>

Specified by:

entrySet in class java.util.AbstractMap<K,V>

keyIterator

java.util.Iterator<K> keyIterator()

valueIterator

java.util.Iterator<V> valueIterator()

entryIterator

java.util.Iterator<java.util.Map.Entry<K,V>> entryIterator()