|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
K
- V
- public interface Transforms<T,K,V>
Interface for transformation objects that manage the leaf nodes in the hash table. Implementations are free to use any class for their leaf nodes and manage them as needed. NOTE: The transforms object is shared across all versions of a hash table so it MUST BE IMMUTABLE. If the transforms object is not immutable it can cause the table to become corrupted over time and/or make older versions of the table invalid.
Method Summary | |
---|---|
Cursor<JImmutableMap.Entry<K,V>> |
cursor(T leaf)
Return a (possibly empty) Cursor over all of the JImmutableMap.Entries in the specified leaf object. |
Holder<T> |
delete(T leaf,
K key,
MutableDelta delta)
Take the current leaf object and produce a new one (possibly the same) with the specified key removed. |
Holder<JImmutableMap.Entry<K,V>> |
findEntry(T leaf,
K key)
Look for the specified key in the leaf object and return a Holder that is empty if the key is not in the leaf or else contains a JImmutableMap.Entry associated with the key and value. |
Holder<V> |
findValue(T leaf,
K key)
Look for the specified key in the leaf object and return a Holder that is empty if the key is not in the leaf or else contains the value associated with the key. |
T |
update(Holder<T> leaf,
K key,
V value,
MutableDelta delta)
Take the current leaf object (if there is one) and produce a new one (possibly the same) with the specified key and value. |
Method Detail |
---|
T update(Holder<T> leaf, K key, V value, MutableDelta delta)
Holder<T> delete(T leaf, K key, MutableDelta delta)
Holder<V> findValue(T leaf, K key)
Holder<JImmutableMap.Entry<K,V>> findEntry(T leaf, K key)
Cursor<JImmutableMap.Entry<K,V>> cursor(T leaf)
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |