public interface AsyncConsistentTreeMap<V> extends AsyncConsistentMap<String,V>
DistributedPrimitive.Status, DistributedPrimitive.TypeDEFAULT_OPERATION_TIMEOUT_MILLIS| Modifier and Type | Method and Description | 
|---|---|
default ConsistentTreeMap<V> | 
asTreeMap()  | 
default ConsistentTreeMap<V> | 
asTreeMap(long timeoutMillis)  | 
CompletableFuture<Map.Entry<String,Versioned<V>>> | 
ceilingEntry(String key)
Returns the entry associated with the least key greater than or equal to
 the key. 
 | 
CompletableFuture<String> | 
ceilingKey(String key)
Return the lowest key greater than or equal to key. 
 | 
CompletableFuture<Map.Entry<String,Versioned<V>>> | 
firstEntry()
Return the entry associated with the lowest key in the map. 
 | 
CompletableFuture<String> | 
firstKey()
Return the lowest key in the map. 
 | 
CompletableFuture<Map.Entry<String,Versioned<V>>> | 
floorEntry(String key)
Returns the entry associated with the greatest key less than or equal
 to key. 
 | 
CompletableFuture<String> | 
floorKey(String key)
Return the highest key less than or equal to key. 
 | 
CompletableFuture<Map.Entry<String,Versioned<V>>> | 
higherEntry(String key)
Returns the entry associated with the least key greater than key. 
 | 
CompletableFuture<String> | 
higherKey(String key)
Return the lowest key greater than key. 
 | 
CompletableFuture<Map.Entry<String,Versioned<V>>> | 
lastEntry()
Return the entry associated with the highest key in the map. 
 | 
CompletableFuture<String> | 
lastKey()
Return the highest key in the map. 
 | 
CompletableFuture<Map.Entry<String,Versioned<V>>> | 
lowerEntry(String key)
Returns the entry associated with the largest key less than key. 
 | 
CompletableFuture<String> | 
lowerKey(String key)
Return the entry associated with the greatest key less than key. 
 | 
CompletableFuture<NavigableSet<String>> | 
navigableKeySet()
Returns a navigable set of the keys in this map. 
 | 
CompletableFuture<Map.Entry<String,Versioned<V>>> | 
pollFirstEntry()
Return and remove the entry associated with the lowest key. 
 | 
CompletableFuture<Map.Entry<String,Versioned<V>>> | 
pollLastEntry()
Return and remove the entry associated with the highest key. 
 | 
CompletableFuture<NavigableMap<String,V>> | 
subMap(String upperKey,
      String lowerKey,
      boolean inclusiveUpper,
      boolean inclusiveLower)
Returns a navigable map containing the entries from the original map
 which are larger than (or if specified equal to)  
lowerKey AND
 less than (or if specified equal to) upperKey. | 
addListener, addListener, asConsistentMap, asConsistentMap, clear, compute, computeIf, computeIfAbsent, computeIfPresent, containsKey, containsValue, destroy, entrySet, get, getOrDefault, isEmpty, keySet, primitiveType, put, putAndGet, putIfAbsent, remove, remove, remove, removeListener, replace, replace, replace, size, valuesaddStatusChangeListener, applicationId, name, removeStatusChangeListener, statusChangeListenersbegin, commit, prepare, prepareAndCommit, rollbackiteratorCompletableFuture<String> firstKey()
CompletableFuture<String> lastKey()
CompletableFuture<Map.Entry<String,Versioned<V>>> ceilingEntry(String key)
key - the keyCompletableFuture<Map.Entry<String,Versioned<V>>> floorEntry(String key)
key - the keyCompletableFuture<Map.Entry<String,Versioned<V>>> higherEntry(String key)
key - the keyCompletableFuture<Map.Entry<String,Versioned<V>>> lowerEntry(String key)
key - the keyCompletableFuture<Map.Entry<String,Versioned<V>>> firstEntry()
CompletableFuture<Map.Entry<String,Versioned<V>>> lastEntry()
CompletableFuture<Map.Entry<String,Versioned<V>>> pollFirstEntry()
CompletableFuture<Map.Entry<String,Versioned<V>>> pollLastEntry()
CompletableFuture<String> lowerKey(String key)
key - the keyCompletableFuture<String> floorKey(String key)
key - the keyCompletableFuture<String> ceilingKey(String key)
key - the keyCompletableFuture<String> higherKey(String key)
key - the keyCompletableFuture<NavigableSet<String>> navigableKeySet()
CompletableFuture<NavigableMap<String,V>> subMap(String upperKey, String lowerKey, boolean inclusiveUpper, boolean inclusiveLower)
lowerKey AND
 less than (or if specified equal to) upperKey.upperKey - the upper bound for the keys in this maplowerKey - the lower bound for the keys in this mapinclusiveUpper - whether keys equal to the upperKey should be
                       includedinclusiveLower - whether keys equal to the lowerKey should be
                       includeddefault ConsistentTreeMap<V> asTreeMap()
default ConsistentTreeMap<V> asTreeMap(long timeoutMillis)