Locates a key, given a replication count (number of copies).
key - key to locate
replCount - replication count (number of copies)
a list of addresses where the key resides, where this list is a subset of the addresses set in setCaches(java.util.Set). Should never be null, and should contain replCount elements or the max
number of caches available, whichever is smaller.
The logical equivalent of calling locate(Object, int) multiple times for each key in the collection of
keys. Implementations may be optimised for such a bulk lookup, or may just repeatedly call locate(Object,
keys - keys to locate
replCount - replication count (number of copies) for each key
Map of locations, keyed on key.
boolean isKeyLocalToAddress(Address a,
Test to see whether a key is mapped to a given address.
a - address to test
key - key to test
replCount - repl count
true if the key is mapped to the address; false otherwise
Returns a list of values between 0 and the hash space limit, or hash id,
for a particular address. If virtual nodes are disabled, the list will
only contain a single element, whereas if virtual nodes are enabled, this
list's size will be the number of virtual nodes configured. If there are
no hash ids for that address, it returns an empty list.
A list of N size where N is the configured number of virtual
nodes, or an empty list if there're no hash ids associated with
Deprecated.No longer supported. This method doesn't make sense with virtual nodes enabled.
Returns the nodes that need will replicate their state if the specified node crashes. The return collection
should contain all the nodes that backup-ed on leaver and one of the nodes which acted as a backup for the leaver .
Pre: leaver must be present in the caches known to this CH, as returned by getCaches()