Class HashArrayMappedTrieModule.LeafList<K,V>

java.lang.Object

io.vavr.collection.HashArrayMappedTrieModule.AbstractNode<K,V>

io.vavr.collection.HashArrayMappedTrieModule.LeafNode<K,V>

io.vavr.collection.HashArrayMappedTrieModule.LeafList<K,V>

Type Parameters:

K - Key type

V - Value type

All Implemented Interfaces:

HashArrayMappedTrie<K,V>, Serializable, Iterable<Tuple2<K,V>>

Enclosing interface:

HashArrayMappedTrieModule

public static final class HashArrayMappedTrieModule.LeafList<K,V>
extends HashArrayMappedTrieModule.LeafNode<K,V>
implements Serializable

Representation of a HAMT leaf node with more than one element.

See Also:

• Serialized Form

Field Summary

Fields

Modifier and Type	Field	Description
private final int	hash
private final K	key
private static final long	serialVersionUID
private final int	size
private final HashArrayMappedTrieModule.LeafNode<K,V>	tail
private final V	value

Fields inherited from class HashArrayMappedTrieModule.AbstractNode

BUCKET_SIZE, MAX_INDEX_NODE, MIN_ARRAY_NODE, SIZE

Constructor Summary

Constructors

Constructor	Description
LeafList(int hash, K key, V value, HashArrayMappedTrieModule.LeafNode<K,V> tail)

Method Summary

Modifier and Type	Method	Description
(package private) int	hash()
(package private) K	key()
(package private) Option<V>	lookup(int shift, int keyHash, K key)
(package private) V	lookup(int shift, int keyHash, K key, V defaultValue)
private static <K,V> HashArrayMappedTrieModule.AbstractNode<K,V>	mergeNodes(HashArrayMappedTrieModule.LeafNode<K,V> leaf1, HashArrayMappedTrieModule.LeafNode<K,V> leaf2)
(package private) HashArrayMappedTrieModule.AbstractNode<K,V>	modify(int shift, int keyHash, K key, V value, HashArrayMappedTrieModule.Action action)
Iterator<HashArrayMappedTrieModule.LeafNode<K,V>>	nodes()
private HashArrayMappedTrieModule.AbstractNode<K,V>	removeElement(K k)
int	size()
(package private) V	value()

Methods inherited from class HashArrayMappedTrieModule.LeafNode

isEmpty, mergeLeaves

Methods inherited from class HashArrayMappedTrieModule.AbstractNode

containsKey, fromBitmap, get, getOrElse, hashFragment, insert, iterator, keysIterator, put, remove, remove, toBitmap, toString, update, valuesIterator

Methods inherited from class Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Methods inherited from interface Iterable

forEach, spliterator

Field Details

serialVersionUID

private static final long serialVersionUID

See Also:

• Constant Field Values

hash

private final int hash

key

private final K key

value

private final V value

size

private final int size

tail

private final HashArrayMappedTrieModule.LeafNode<K,V> tail

Constructor Details

LeafList

LeafList(int hash,
 K key,
 V value,
 HashArrayMappedTrieModule.LeafNode<K,V> tail)

Method Details

lookup

Option<V> lookup(int shift,
 int keyHash,
 K key)

Specified by:

lookup in class HashArrayMappedTrieModule.AbstractNode<K,V>

lookup

V lookup(int shift,
 int keyHash,
 K key,
 V defaultValue)

Specified by:

lookup in class HashArrayMappedTrieModule.AbstractNode<K,V>

modify

HashArrayMappedTrieModule.AbstractNode<K,V> modify(int shift,
 int keyHash,
 K key,
 V value,
 HashArrayMappedTrieModule.Action action)

Specified by:

modify in class HashArrayMappedTrieModule.AbstractNode<K,V>

mergeNodes

private static <K,V>
HashArrayMappedTrieModule.AbstractNode<K,V> mergeNodes(HashArrayMappedTrieModule.LeafNode<K,V> leaf1,
 HashArrayMappedTrieModule.LeafNode<K,V> leaf2)

removeElement

private HashArrayMappedTrieModule.AbstractNode<K,V> removeElement(K k)

size

public int size()

Specified by:

size in interface HashArrayMappedTrie<K,V>

nodes

public Iterator<HashArrayMappedTrieModule.LeafNode<K,V>> nodes()

Overrides:

nodes in class HashArrayMappedTrieModule.AbstractNode<K,V>

hash

int hash()

Specified by:

hash in class HashArrayMappedTrieModule.LeafNode<K,V>

key

K key()

Specified by:

key in class HashArrayMappedTrieModule.LeafNode<K,V>

value

V value()

Specified by:

value in class HashArrayMappedTrieModule.LeafNode<K,V>