public interface AsyncConsistentTreeMap<V> extends AsyncConsistentMap<java.lang.String,V>
DistributedPrimitive.Status, DistributedPrimitive.Type
DEFAULT_OPERATION_TIMEOUT_MILLIS, DEFAULT_OPERTATION_TIMEOUT_MILLIS
Modifier and Type | Method and Description |
---|---|
default ConsistentTreeMap<V> |
asTreeMap() |
default ConsistentTreeMap<V> |
asTreeMap(long timeoutMillis) |
java.util.concurrent.CompletableFuture<java.util.Map.Entry<java.lang.String,Versioned<V>>> |
ceilingEntry(java.lang.String key)
Returns the entry associated with the least key greater than or equal to
the key.
|
java.util.concurrent.CompletableFuture<java.lang.String> |
ceilingKey(java.lang.String key)
Return the lowest key greater than or equal to key.
|
java.util.concurrent.CompletableFuture<java.util.Map.Entry<java.lang.String,Versioned<V>>> |
firstEntry()
Return the entry associated with the lowest key in the map.
|
java.util.concurrent.CompletableFuture<java.lang.String> |
firstKey()
Return the lowest key in the map.
|
java.util.concurrent.CompletableFuture<java.util.Map.Entry<java.lang.String,Versioned<V>>> |
floorEntry(java.lang.String key)
Returns the entry associated with the greatest key less than or equal
to key.
|
java.util.concurrent.CompletableFuture<java.lang.String> |
floorKey(java.lang.String key)
Return the highest key less than or equal to key.
|
java.util.concurrent.CompletableFuture<java.util.Map.Entry<java.lang.String,Versioned<V>>> |
higherEntry(java.lang.String key)
Returns the entry associated with the least key greater than key.
|
java.util.concurrent.CompletableFuture<java.lang.String> |
higherKey(java.lang.String key)
Return the lowest key greater than key.
|
java.util.concurrent.CompletableFuture<java.util.Map.Entry<java.lang.String,Versioned<V>>> |
lastEntry()
Return the entry associated with the highest key in the map.
|
java.util.concurrent.CompletableFuture<java.lang.String> |
lastKey()
Return the highest key in the map.
|
java.util.concurrent.CompletableFuture<java.util.Map.Entry<java.lang.String,Versioned<V>>> |
lowerEntry(java.lang.String key)
Returns the entry associated with the largest key less than key.
|
java.util.concurrent.CompletableFuture<java.lang.String> |
lowerKey(java.lang.String key)
Return the entry associated with the greatest key less than key.
|
java.util.concurrent.CompletableFuture<java.util.NavigableSet<java.lang.String>> |
navigableKeySet()
Returns a navigable set of the keys in this map.
|
java.util.concurrent.CompletableFuture<java.util.Map.Entry<java.lang.String,Versioned<V>>> |
pollFirstEntry()
Return and remove the entry associated with the lowest key.
|
java.util.concurrent.CompletableFuture<java.util.Map.Entry<java.lang.String,Versioned<V>>> |
pollLastEntry()
Return and remove the entry associated with the highest key.
|
java.util.concurrent.CompletableFuture<java.util.NavigableMap<java.lang.String,V>> |
subMap(java.lang.String upperKey,
java.lang.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, values
addStatusChangeListener, applicationId, name, removeStatusChangeListener, statusChangeListeners
begin, commit, prepare, prepareAndCommit, rollback
java.util.concurrent.CompletableFuture<java.lang.String> firstKey()
java.util.concurrent.CompletableFuture<java.lang.String> lastKey()
java.util.concurrent.CompletableFuture<java.util.Map.Entry<java.lang.String,Versioned<V>>> ceilingEntry(java.lang.String key)
key
- the keyjava.util.concurrent.CompletableFuture<java.util.Map.Entry<java.lang.String,Versioned<V>>> floorEntry(java.lang.String key)
key
- the keyjava.util.concurrent.CompletableFuture<java.util.Map.Entry<java.lang.String,Versioned<V>>> higherEntry(java.lang.String key)
key
- the keyjava.util.concurrent.CompletableFuture<java.util.Map.Entry<java.lang.String,Versioned<V>>> lowerEntry(java.lang.String key)
key
- the keyjava.util.concurrent.CompletableFuture<java.util.Map.Entry<java.lang.String,Versioned<V>>> firstEntry()
java.util.concurrent.CompletableFuture<java.util.Map.Entry<java.lang.String,Versioned<V>>> lastEntry()
java.util.concurrent.CompletableFuture<java.util.Map.Entry<java.lang.String,Versioned<V>>> pollFirstEntry()
java.util.concurrent.CompletableFuture<java.util.Map.Entry<java.lang.String,Versioned<V>>> pollLastEntry()
java.util.concurrent.CompletableFuture<java.lang.String> lowerKey(java.lang.String key)
key
- the keyjava.util.concurrent.CompletableFuture<java.lang.String> floorKey(java.lang.String key)
key
- the keyjava.util.concurrent.CompletableFuture<java.lang.String> ceilingKey(java.lang.String key)
key
- the keyjava.util.concurrent.CompletableFuture<java.lang.String> higherKey(java.lang.String key)
key
- the keyjava.util.concurrent.CompletableFuture<java.util.NavigableSet<java.lang.String>> navigableKeySet()
java.util.concurrent.CompletableFuture<java.util.NavigableMap<java.lang.String,V>> subMap(java.lang.String upperKey, java.lang.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)