Uses of Class
fj.data.hamt.Node

Packages that use Node

Package	Description
fj	Types that set the premise for the existence of Functional Java.
fj.data.hamt

Uses of Node in fj

Methods in fj that return types with arguments of type Node

Modifier and Type	Method	Description
static <K,V> Show<Node<K,V>>	Show.hamtNodeShow(Show<K> sk, Show<V> sv)

Uses of Node in fj.data.hamt

Fields in fj.data.hamt with type parameters of type Node

Modifier and Type	Field	Description
private Seq<Node<K,V>>	HashArrayMappedTrie.seq

Methods in fj.data.hamt that return Node

Modifier and Type	Method	Description
static <K,V> Node<K,V>	Node.hamtNode(HashArrayMappedTrie<K,V> hamt)
static <K,V> Node<K,V>	Node.p2Node(P2<K,V> p)

Methods in fj.data.hamt that return types with arguments of type Node

Modifier and Type	Method	Description
Seq<Node<K,V>>	HashArrayMappedTrie.getSeq()

Method parameters in fj.data.hamt with type arguments of type Node

Modifier and Type	Method	Description
<B> B	HashArrayMappedTrie.foldLeftOnNode(F2<B,Node<K,V>,B> f, B b)	Performs a left-fold reduction across this trie.
private static <K,V> HashArrayMappedTrie<K,V>	HashArrayMappedTrie.hamt(BitSet bs, Seq<Node<K,V>> s, Equal<K> e, Hash<K> h)	Static constructor for a HAMT instance.

Constructor parameters in fj.data.hamt with type arguments of type Node

Constructor	Description
HashArrayMappedTrie(BitSet bs, Seq<Node<K,V>> s, Equal<K> e, Hash<K> h)	Creates an empty trie for the bitset, sequence of nodes, equal and hash.