Class MapStoreAdapter<K,V>
- Type Parameters:
K- key of the map entryV- value of the map entry.
- See Also:
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionvoidDeletes the entry with the given key from the external store.voiddeleteAll(Collection<K> keys) Deletes multiple entries from the external store.Loads the value of a given key.loadAll(Collection<K> keys) Loads given keys.Loads all the keys from the store.voidStores the key-value pair in the external store.voidStores multiple entries in the external store.
-
Constructor Details
-
MapStoreAdapter
public MapStoreAdapter()
-
-
Method Details
-
delete
Deletes the entry with the given key from the external store.Invocation semantics depend on configuration:
- Write-through: invoked synchronously as part of
IMap.remove(). - Write-behind: invoked asynchronously on a background thread.
Hazelcast provides at-least-once delivery semantics. Implementations must tolerate retries and duplicate invocations. Deleting a non-existent entry should be treated as a successful no-op.
- Write-through: invoked synchronously as part of
-
store
Stores the key-value pair in the external store.Invocation semantics depend on configuration:
- Write-through (
writeDelaySeconds == 0): this method is invoked synchronously as part of theIMap.put()call. If this method throws an exception, the map operation fails. - Write-behind (
writeDelaySeconds > 0): this method may be invoked asynchronously on a background thread, potentially long after the original map operation has completed.
Under normal circumstances Hazelcast provides at-least-once delivery semantics for calls to this method. Implementations must therefore be idempotent and tolerate retries, reordering, and duplicate invocations.
- Write-through (
-
storeAll
Stores multiple entries in the external store.This method is primarily used with write-behind enabled (
writeDelaySeconds > 0) when batching is applicable. Hazelcast may still invokeMapStore.store(Object, Object)instead of this method depending on runtime conditions (for example, batch size, write coalescing, or number of distinct keys in the current write window). Implementations must not rely on this method being invoked for every flush.Error handling and retries:
- If this method throws an exception, Hazelcast treats the batch as failed and starts retry handling.
- If the provided
maphas not been modified (no entries removed to signal partial success), Hazelcast retriesstoreAll(map)up to three times, waiting about 1 second between attempts. - After the final batch attempt fails, Hazelcast falls back to calling
MapStore.store(Object, Object)for the remaining entries, one by one. - If the implementation removes entries from
mapas they are stored (before throwing), Hazelcast treats removed entries as successful and does not retry them; only the entries still present inmapare retried and/or passed to the per-entry fallback.
This allows implementations to signal partial success explicitly. Entries left in the
mapafter an exception will be retried individually; removed entries will not be passed to subsequent calls.Hazelcast does not provide transactional guarantees across entries. Batch boundaries do not imply atomicity.
-
deleteAll
Deletes multiple entries from the external store.This method is primarily used with write-behind enabled (
writeDelaySeconds > 0) when batching is applicable. Hazelcast may still invokeMapStore.delete(Object)instead of this method depending on configuration and runtime conditions. Implementations must not rely on this method being invoked for every flush.Error handling and retries:
- If this method throws an exception, Hazelcast initiates retry handling.
- On retry, Hazelcast invokes
MapStore.delete(Object)one-by-one for the remaining keys. - If the implementation removes successfully deleted keys from the
provided
keyscollection before throwing, those keys are treated as successful and are not retried.
This allows implementations to signal partial success explicitly. Keys left in the
keyscollection after an exception will be retried individually; removed keys will not be passed to subsequent calls.Batch deletion does not imply atomicity or ordering guarantees.
-
load
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. -
loadAll
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
nullkeys. The returned Map should not contain anynullkeys or values.Loading other items than what provided in
keysprevents the map from being filled from the map store. -
loadAllKeys
Loads all the keys from the store. The returnedIterablemay return the keys lazily by loading them in batches. TheIteratorof thisIterablemay implement theCloseableinterface 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
nullkeys.- Specified by:
loadAllKeysin interfaceMapLoader<K,V> - Returns:
- all the keys. Keys inside the Iterable cannot be
null.
-