K
- keyV
- valuepublic interface RMap<K,V> extends ConcurrentMap<K,V>, RExpirable, RMapAsync<K,V>
ConcurrentMap
and Map
Modifier and Type | Method and Description |
---|---|
V |
addAndGet(K key,
Number delta)
Atomically adds the given
delta to the current value
by mapped key . |
Iterator<Map.Entry<K,V>> |
entryIterator()
Map entry-iterator with small memory footprint
|
boolean |
fastPut(K key,
V value)
Associates the specified
value with the specified key . |
long |
fastRemove(K... keys)
Removes
keys from map by one operation
Works faster than RMap.remove but not returning
the value associated with key |
Map<K,V> |
filterEntries(Predicate<Map.Entry<K,V>> predicate)
Returns a map slice containing the mappings in whose
Map.Entry<K, V> entries
satisfy a predicate. |
Map<K,V> |
filterKeys(Predicate<K> predicate)
Returns a map slice containing the mappings in whose
keys
satisfy a predicate. |
Map<K,V> |
filterValues(Predicate<V> predicate)
Returns a map slice containing the mappings in whose
values
satisfy a predicate. |
Map<K,V> |
getAll(Set<K> keys)
Gets a map slice contains the mappings with defined
keys
by one operation. |
Iterator<K> |
keyIterator()
Map key-iterator with small memory footprint
|
Iterator<V> |
valueIterator()
Map value-iterator with small memory footprint
|
putIfAbsent, remove, replace, replace
clear, containsKey, containsValue, entrySet, equals, get, hashCode, isEmpty, keySet, put, putAll, remove, size, values
clearExpire, expire, expireAt, expireAt, remainTimeToLive
delete, getName, isExists, migrate, move, rename, renamenx
addAndGetAsync, containsKeyAsync, containsValueAsync, fastPutAsync, fastRemoveAsync, getAllAsync, getAsync, putAllAsync, putAsync, putIfAbsentAsync, removeAsync, removeAsync, replaceAsync, replaceAsync, sizeAsync
clearExpireAsync, expireAsync, expireAtAsync, expireAtAsync, remainTimeToLiveAsync
deleteAsync, isExistsAsync, migrateAsync, moveAsync, renameAsync, renamenxAsync
V addAndGet(K key, Number delta)
delta
to the current value
by mapped key
.
Works only for numeric values!key
- delta
- the value to addMap<K,V> getAll(Set<K> keys)
keys
by one operation. This operation NOT traverses all map entries
like any other filter*
method, so works faster.
The returned map is NOT backed by the original map.keys
- map keysMap<K,V> filterEntries(Predicate<Map.Entry<K,V>> predicate)
Map.Entry<K, V> entries
satisfy a predicate. This operation traverses all map entries with small memory footprint.
The returned map is NOT backed by the original map.predicate
- Map<K,V> filterValues(Predicate<V> predicate)
values
satisfy a predicate. Traverses all map entries with small memory footprint.
The returned map is NOT backed by the original map.predicate
- Map<K,V> filterKeys(Predicate<K> predicate)
keys
satisfy a predicate. Traverses all map entries with small memory footprint.
The returned map is NOT backed by the original map.predicate
- long fastRemove(K... keys)
keys
from map by one operation
Works faster than RMap.remove
but not returning
the value associated with key
keys
- boolean fastPut(K key, V value)
value
with the specified key
.
Works faster than RMap.put
but not returning
the previous value associated with key
key
- value
- true
if key is a new key in the hash and value was set.
false
if key already exists in the hash and the value was updated.Iterator<Map.Entry<K,V>> entryIterator()
Copyright © 2014–2015. All rights reserved.