Loads the value of a given key. If distributed map doesn't contain the value
for the given key then Hazelcast will call implementation's load (key) method
to obtain the value. Implementation can use any means of loading the given key;
such as an O/R mapping tool, simple SQL or reading a file etc.
Loads given keys. This is batch load operation so that implementation can
optimize the multiple loads.
For any key in the input keys, there should be a single mapping in the resulting map. Also the resulting
map should not have any keys that are not part of the input keys.
The given collection should not contain any null keys.
The returned Map should not contain any null keys or values.
Loading other items than what provided in keys
prevents the map from being filled from the map store.
Loads all of the keys from the store. The returned Iterable may return the keys lazily
by loading them in batches. The Iterator of this Iterable may implement the
Closeable interface in which case it will be closed once iteration is over.
This is intended for releasing resources such as closing a JDBC result set.
The returned Iterable should not contain any null keys.
Stores multiple entries. Implementation of this method can optimize the
store operation by storing all entries in one database connection.
storeAll is used when writeDelaySeconds is positive (write-behind).
If an exception is thrown, the entries will try to be stored one by one using the store() method.
Note: on the retry phase only entries left in the map will be stored one-by-one. In this way a
MapStore implementation can handle partial storeAll cases when some entries were stored successfully
before failure happens. Entries removed from the map will be not passed to subsequent call to
store() method any more.
Deletes multiple entries from the store.
If an exception is thrown the entries will try to be deleted one by one using the delete() method.
Note: on the retry phase only entries left in the keys will be deleted one-by-one. In this way a
MapStore implementation can handle partial deleteAll cases when some entries were deleted successfully
before failure happens. Entries removed from the keys will be not passed to subsequent call to
delete() method any more.