Package io.vavr.collection
Class HashArrayMappedTrieModule.LeafNode<K,V>
java.lang.Object
io.vavr.collection.HashArrayMappedTrieModule.AbstractNode<K,V>
io.vavr.collection.HashArrayMappedTrieModule.LeafNode<K,V>
- Type Parameters:
K
- Key typeV
- Value type
- All Implemented Interfaces:
HashArrayMappedTrie<K,
,V> Serializable
,Iterable<Tuple2<K,
V>>
- Direct Known Subclasses:
HashArrayMappedTrieModule.LeafList
,HashArrayMappedTrieModule.LeafSingleton
- Enclosing interface:
HashArrayMappedTrieModule
public abstract static class HashArrayMappedTrieModule.LeafNode<K,V>
extends HashArrayMappedTrieModule.AbstractNode<K,V>
Representation of a HAMT leaf.
- See Also:
-
Field Summary
FieldsFields inherited from class io.vavr.collection.HashArrayMappedTrieModule.AbstractNode
BUCKET_SIZE, MAX_INDEX_NODE, MIN_ARRAY_NODE, SIZE
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescription(package private) abstract int
hash()
boolean
isEmpty()
(package private) abstract K
key()
(package private) static <K,
V> HashArrayMappedTrieModule.AbstractNode <K, V> mergeLeaves
(int shift, HashArrayMappedTrieModule.LeafNode<K, V> leaf1, HashArrayMappedTrieModule.LeafSingleton<K, V> leaf2) (package private) abstract V
value()
Methods inherited from class io.vavr.collection.HashArrayMappedTrieModule.AbstractNode
containsKey, fromBitmap, get, getOrElse, hashFragment, insert, iterator, keysIterator, lookup, lookup, modify, nodes, put, remove, remove, toBitmap, toString, update, valuesIterator
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
Methods inherited from interface io.vavr.collection.HashArrayMappedTrie
size
Methods inherited from interface java.lang.Iterable
forEach, spliterator
-
Field Details
-
serialVersionUID
private static final long serialVersionUID- See Also:
-
-
Constructor Details
-
LeafNode
public LeafNode()
-
-
Method Details
-
key
-
value
-
hash
abstract int hash() -
mergeLeaves
static <K,V> HashArrayMappedTrieModule.AbstractNode<K,V> mergeLeaves(int shift, HashArrayMappedTrieModule.LeafNode<K, V> leaf1, HashArrayMappedTrieModule.LeafSingleton<K, V> leaf2) -
isEmpty
public boolean isEmpty()
-