Uses of Class
eu.bandm.tools.util.Trie.Node

Packages that use Trie.Node

Package	Description
eu.bandm.tools.util	Collection of mostly unrelated, tiny, ubiquitously needed auxiliary classes for many different purposes.

Uses of Trie.Node in eu.bandm.tools.util

Fields in eu.bandm.tools.util declared as Trie.Node

Modifier and Type	Field and Description
protected Trie.Node<K,V>	Trie.Evaluator.unit

Methods in eu.bandm.tools.util that return Trie.Node

Modifier and Type	Method and Description
protected Trie.Node<K,V>	Trie.Evaluator.compose(Trie.Node<K,V> x, Function<V,Trie.Node<K,V>> f, int limit)
protected <V,W> Trie.Node<K,W>	Trie.Functor.map(Function<? super V,? extends W> fun, Trie.Node<K,V> x)
protected Trie.Node<K,V>	Trie.Evaluator.restrict(Trie.Node<K,V> x, Iterator<? extends K> i)
static <K extends Comparable<? super K>,V> Trie.Node<K,V>	Trie.Node.sequence(V pre, Iterable<? extends K> keys, V post)
protected static <K extends Comparable<? super K>,V> Trie.Node<K,V>	Trie.Node.sequence(V pre, Iterator<? extends K> keys, V post)
static <K extends Comparable<? super K>,V> Trie.Node<K,V>	Trie.Node.singleton(V pre, K key, V post) Create a cell labelled with the value and having one subnode with given key and post value.
protected Trie.Node<K,V>	Trie.Evaluator.trim(Trie.Node<K,V> x, int limit) Prunes tree at the given maximal depth and inserts the "horizon" element, as defined in the constructor call Evaluator(Monoid,V,int).
protected Trie.Node<K,V>	Trie.Evaluator.union(Trie.Node<K,V> x, Trie.Node<K,V> y)
static <K extends Comparable<? super K>,V> Trie.Node<K,V>	Trie.Node.unit(V value) Create a cell labelled with the value and having no subnodes.

Methods in eu.bandm.tools.util that return types with arguments of type Trie.Node

Modifier and Type	Method and Description
SortedMap<K,Trie.Node<K,V>>	Trie.Node.branches()
protected SortedMap<K,Trie.Node<K,V>>	Trie.Evaluator.compose(SortedMap<K,Trie.Node<K,V>> x, Function<V,Trie.Node<K,V>> f, int limit)
protected SortedMap<K,Trie.Node<K,V>>	Trie.Evaluator.union(SortedMap<K,Trie.Node<K,V>> x, SortedMap<K,Trie.Node<K,V>> y)

Methods in eu.bandm.tools.util with parameters of type Trie.Node

Modifier and Type	Method and Description
protected Trie.Node<K,V>	Trie.Evaluator.compose(Trie.Node<K,V> x, Function<V,Trie.Node<K,V>> f, int limit)
protected Iterator<Map.Entry<List<? extends K>,V>>	Trie.Evaluator.entries(Trie.Node<K,V> x, List<? extends K> path)
boolean	Trie.Node.equals(Trie.Node o)
protected <W> W	Trie.Evaluator.fold(BiFunction<? super V,? super SortedMap<K,W>,? extends W> fun, Trie.Node<K,V> x)
protected boolean	Trie.Evaluator.leq(BiPredicate<? super V,? super V> valueLeq, Trie.Node<K,V> x, Trie.Node<K,V> y)
protected boolean	Trie.Evaluator.leq(BiPredicate<? super V,? super V> valueLeq, Trie.Node<K,V> x, Trie.Node<K,V> y)
protected <V,W> Trie.Node<K,W>	Trie.Functor.map(Function<? super V,? extends W> fun, Trie.Node<K,V> x)
protected Trie.Node<K,V>	Trie.Evaluator.restrict(Trie.Node<K,V> x, Iterator<? extends K> i)
protected Trie.Node<K,V>	Trie.Evaluator.trim(Trie.Node<K,V> x, int limit) Prunes tree at the given maximal depth and inserts the "horizon" element, as defined in the constructor call Evaluator(Monoid,V,int).
protected Trie.Node<K,V>	Trie.Evaluator.union(Trie.Node<K,V> x, Trie.Node<K,V> y)
protected Trie.Node<K,V>	Trie.Evaluator.union(Trie.Node<K,V> x, Trie.Node<K,V> y)

Method parameters in eu.bandm.tools.util with type arguments of type Trie.Node

Modifier and Type	Method and Description
protected SortedMap<K,Trie.Node<K,V>>	Trie.Evaluator.compose(SortedMap<K,Trie.Node<K,V>> x, Function<V,Trie.Node<K,V>> f, int limit)
protected SortedMap<K,Trie.Node<K,V>>	Trie.Evaluator.compose(SortedMap<K,Trie.Node<K,V>> x, Function<V,Trie.Node<K,V>> f, int limit)
protected Trie.Node<K,V>	Trie.Evaluator.compose(Trie.Node<K,V> x, Function<V,Trie.Node<K,V>> f, int limit)
protected <W> Trie<K,W>	Trie.Evaluator.foldNode(BiFunction<? super V,? super SortedMap<K,Trie.Node<K,W>>,? extends Trie.Node<K,W>> fun, Trie<K,V> x)
protected <W> Trie<K,W>	Trie.Evaluator.foldNode(BiFunction<? super V,? super SortedMap<K,Trie.Node<K,W>>,? extends Trie.Node<K,W>> fun, Trie<K,V> x)
protected SortedMap<K,Trie.Node<K,V>>	Trie.Evaluator.union(SortedMap<K,Trie.Node<K,V>> x, SortedMap<K,Trie.Node<K,V>> y)
protected SortedMap<K,Trie.Node<K,V>>	Trie.Evaluator.union(SortedMap<K,Trie.Node<K,V>> x, SortedMap<K,Trie.Node<K,V>> y)

Constructor parameters in eu.bandm.tools.util with type arguments of type Trie.Node

Constructor and Description
Node(V value, SortedMap<K,Trie.Node<K,V>> branches)