|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectcom.hazelcast.spi.AbstractDistributedObject
com.hazelcast.replicatedmap.impl.ReplicatedMapProxy<K,V>
K - key typeV - value typepublic class ReplicatedMapProxy<K,V>
The internal ReplicatedMap implementation proxying the requests to the underlying
ReplicatedRecordStore
| Nested Class Summary |
|---|
| Nested classes/interfaces inherited from interface java.util.Map |
|---|
Map.Entry<K,V> |
| Field Summary |
|---|
| Fields inherited from class com.hazelcast.spi.AbstractDistributedObject |
|---|
PARTITIONING_STRATEGY |
| Method Summary | |
|---|---|
String |
addEntryListener(EntryListener<K,V> listener)
Adds an entry listener for this map. |
String |
addEntryListener(EntryListener<K,V> listener,
K key)
Adds the specified entry listener for the specified key. |
String |
addEntryListener(EntryListener<K,V> listener,
Predicate<K,V> predicate)
Adds an continuous entry listener for this map. |
String |
addEntryListener(EntryListener<K,V> listener,
Predicate<K,V> predicate,
K key)
Adds an continuous entry listener for this map. |
void |
clear()
The clear operation is used for wiping data out of the replicated maps. |
boolean |
containsKey(Object key)
|
boolean |
containsValue(Object value)
|
Set<Map.Entry<K,V>> |
entrySet()
Returns a lazy Set view of the mappings contained in this map. |
V |
get(Object key)
|
String |
getName()
Returns the unique name for this DistributedObject. |
String |
getPartitionKey()
Returns the key of the partition that this DistributedObject is assigned to. |
LocalReplicatedMapStats |
getReplicatedMapStats()
|
String |
getServiceName()
Returns the service name for this object. |
int |
hashCode()
|
void |
initialize()
|
boolean |
isEmpty()
|
Set<K> |
keySet()
Returns a lazy Set view of the key contained in this map. |
V |
put(K key,
V value)
|
V |
put(K key,
V value,
long ttl,
TimeUnit timeUnit)
Associates a given value to the specified key and replicates it to the cluster. |
void |
putAll(Map<? extends K,? extends V> m)
|
V |
remove(Object key)
|
boolean |
removeEntryListener(String id)
Removes the specified entry listener. |
void |
setPreReplicationHook(PreReplicationHook preReplicationHook)
|
int |
size()
|
boolean |
storageEquals(Object o)
|
String |
toString()
|
Collection<V> |
values()
Returns a lazy Collection view of the values contained in this map. |
Collection<V> |
values(Comparator<V> comparator)
Returns a eagerly populated Collection view of the values contained in this map. |
| Methods inherited from class com.hazelcast.spi.AbstractDistributedObject |
|---|
destroy, equals, getId, getNameAsPartitionAwareData, getNodeEngine, getOperationService, getService, invalidate, postDestroy, throwNotActiveException |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, notify, notifyAll, wait, wait, wait |
| Methods inherited from interface java.util.Map |
|---|
equals |
| Methods inherited from interface com.hazelcast.core.DistributedObject |
|---|
destroy, getId |
| Method Detail |
|---|
public String getName()
DistributedObject
getName in interface DistributedObjectpublic String getPartitionKey()
DistributedObjectIAtomicLong. For a partitioned data structure like an IMap,
the returned value will not be null, but otherwise undefined.
getPartitionKey in interface DistributedObjectgetPartitionKey in class AbstractDistributedObjectpublic String getServiceName()
DistributedObject
getServiceName in interface DistributedObjectgetServiceName in class AbstractDistributedObjectpublic int size()
size in interface Map<K,V>public boolean isEmpty()
isEmpty in interface Map<K,V>public boolean containsKey(Object key)
containsKey in interface Map<K,V>public boolean containsValue(Object value)
containsValue in interface Map<K,V>public V get(Object key)
get in interface Map<K,V>
public V put(K key,
V value)
put in interface Map<K,V>
public V put(K key,
V value,
long ttl,
TimeUnit timeUnit)
ReplicatedMapAssociates a given value to the specified key and replicates it to the cluster. If there is an old value, it will be replaced by the specified one and returned from the call.
In addition, you have to specify a ttl and its TimeUnit
to define when the value is outdated and thus should be removed from the
replicated map.
put in interface ReplicatedMap<K,V>key - key with which the specified value is to be associatedvalue - value to be associated with the specified keyttl - ttl to be associated with the specified key-value pairtimeUnit - TimeUnit to be used for the ttl valuepublic V remove(Object key)
remove in interface Map<K,V>public void putAll(Map<? extends K,? extends V> m)
putAll in interface Map<K,V>public void clear()
ReplicatedMapThe clear operation is used for wiping data out of the replicated maps. It is the only synchronous remote operation in this implementation, so be aware that this might be a slow operation.
If some node fails on executing the operation, it is retried for at most
3 times (on the failing nodes only). If not working after the third time, this
method throws a OperationTimeoutException back
to the caller.
clear in interface ReplicatedMap<K,V>clear in interface Map<K,V>public boolean removeEntryListener(String id)
ReplicatedMap
removeEntryListener in interface ReplicatedMap<K,V>id - id of the registered listener
public String addEntryListener(EntryListener<K,V> listener)
ReplicatedMap
addEntryListener in interface ReplicatedMap<K,V>listener - entry listener
public String addEntryListener(EntryListener<K,V> listener,
K key)
ReplicatedMapWarning:
This method uses hashCode and equals of the binary form of the key, not the actual implementations of hashCode and equals defined in the key's class.
addEntryListener in interface ReplicatedMap<K,V>listener - the entry listenerkey - the key to listen to
public String addEntryListener(EntryListener<K,V> listener,
Predicate<K,V> predicate)
ReplicatedMap
addEntryListener in interface ReplicatedMap<K,V>listener - the entry listenerpredicate - the predicate for filtering entries
public String addEntryListener(EntryListener<K,V> listener,
Predicate<K,V> predicate,
K key)
ReplicatedMap
addEntryListener in interface ReplicatedMap<K,V>listener - the entry listenerpredicate - the predicate for filtering entrieskey - the key to listen topublic Set<K> keySet()
ReplicatedMapSet view of the key contained in this map.
The set is NOT backed by the map, so changes to the map are
NOT reflected in the set, and vice-versa.
keySet in interface ReplicatedMap<K,V>keySet in interface Map<K,V>public Collection<V> values()
ReplicatedMapCollection view of the values contained in this map.
The collection is NOT backed by the map, so changes to the map are
NOT reflected in the collection, and vice-versa.ReplicatedMap.values(java.util.Comparator) to force reordering of the
elements before returning.
values in interface ReplicatedMap<K,V>values in interface Map<K,V>public Collection<V> values(Comparator<V> comparator)
ReplicatedMapCollection view of the values contained in this map.
The collection is NOT backed by the map, so changes to the map are
NOT reflected in the collection, and vice-versa.Comparator before returning the elements.
values in interface ReplicatedMap<K,V>comparator - the Comparator to sort the returned elements
public Set<Map.Entry<K,V>> entrySet()
ReplicatedMapSet view of the mappings contained in this map.
The set is NOT backed by the map, so changes to the map are
NOT reflected in the set, and vice-versa.
entrySet in interface ReplicatedMap<K,V>entrySet in interface Map<K,V>public boolean storageEquals(Object o)
public int hashCode()
hashCode in interface Map<K,V>hashCode in class AbstractDistributedObjectpublic String toString()
toString in class AbstractDistributedObjectpublic void initialize()
initialize in interface InitializingObjectpublic LocalReplicatedMapStats getReplicatedMapStats()
public void setPreReplicationHook(PreReplicationHook preReplicationHook)
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||