org.corfudb.runtime.collections

Interface ICorfuMap<K,V>

All Superinterfaces:

Map<K,V>

All Known Implementing Classes:

CorfuTable

public interface ICorfuMap<K,V>
extends Map<K,V>

Nested Class Summary

Nested classes/interfaces inherited from interface java.util.Map

Map.Entry<K,V>

Method Summary

Modifier and Type	Method and Description
void	delete(K key) Delete a key from a map.
void	insert(K key, V value) Insert a key-value pair into a map, overwriting any previous mapping.
Collection<Map.Entry<K,V>>	scanAndFilterByEntry(Predicate<? super Map.Entry<K,V>> entryPredicate) Returns a Collection filtered by entries (keys and/or values).

Methods inherited from interface java.util.Map

clear, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, entrySet, equals, forEach, get, getOrDefault, hashCode, isEmpty, keySet, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll, size, values

Method Detail

insert

void insert(K key,
            V value)

Insert a key-value pair into a map, overwriting any previous mapping. This function performs better than put, because no value is returned (and is therefore a write rather than a read-modify-write).

Parameters:

key - The key to insert

value - The value to insert

delete

void delete(K key)

Delete a key from a map. This function performs better than a remove, because no value is returned (and is therefore a write rather than a read-modify-write).

Parameters:

key - The key to delete

scanAndFilterByEntry

Collection<Map.Entry<K,V>> scanAndFilterByEntry(Predicate<? super Map.Entry<K,V>> entryPredicate)

Returns a Collection filtered by entries (keys and/or values). This method has a memory/CPU advantage over the map iterators as no deep copy is actually performed.

Parameters:

entryPredicate - java predicate (function to evaluate)

Returns:

a view of the entries contained in this map meeting the predicate condition.