Uses of Class
eu.bandm.tools.ops.Trie

Packages that use Trie

Package	Description
eu.bandm.tools.ops

Uses of Trie in eu.bandm.tools.ops

Methods in eu.bandm.tools.ops that return Trie

Modifier and Type	Method and Description
Trie<K,V>	Trie.Evaluator.compose(Trie<K,V> x, Function<V,Trie<K,V>> f)
Trie<K,V>	Trie.Evaluator.compose(Trie<K,V> x, Function<V,Trie<K,V>> f, int limit)
static <K extends Comparable<? super K>> Trie<K,Boolean>	Trie.empty() Empty Set, when using Tries to represent "sets of K*", by V=Boolean.
static <K extends Comparable<? super K>> Trie<K,Boolean>	Trie.epsilon() Set containing the empty K-string, when using Tries to represent "sets of K*", by V=Boolean.
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.foldValue(BiFunction<? super V,? super SortedMap<K,W>,? extends W> fun, Trie<K,V> x)
Trie<K,V>	Trie.Evaluator.iterate(Function<V,Trie<K,V>> f, V init)
<V,W> Trie<K,W>	Trie.Functor.map(Function<? super V,? extends W> fun, Trie<K,V> x)
Trie<K,V>	Trie.Evaluator.restrict(Trie<K,V> x, Iterable<? extends K> path) Fundamental retrieval operation: Get the subtree starting at the given key prefix.
static <K extends Comparable<? super K>,V> Trie<K,V>	Trie.sequence(V pre, Iterable<? extends K> keys, V post)
static <K extends Comparable<? super K>> Trie<K,Boolean>	Trie.singleton(K key) Singlteon set containing a K-string with length=1, when using Tries to represent "sets of K*", by V=Boolean.
static <K extends Comparable<? super K>,V> Trie<K,V>	Trie.singleton(V pre, K key, V post)
Trie<K,V>	Trie.Evaluator.union(Trie<K,V> x, Trie<K,V> y) Unify Trie data using Monoid function on values.
static <K extends Comparable<? super K>,V> Trie<K,V>	Trie.unit(V value)

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

Modifier and Type	Method and Description
static <K extends Comparable<? super K>> Function<Boolean,Trie<K,Boolean>>	Trie.append(Trie<K,Boolean> cont)

Methods in eu.bandm.tools.ops with parameters of type Trie

Modifier and Type	Method and Description
static <K extends Comparable<? super K>> Function<Boolean,Trie<K,Boolean>>	Trie.append(Trie<K,Boolean> cont)
Trie<K,V>	Trie.Evaluator.compose(Trie<K,V> x, Function<V,Trie<K,V>> f)
Trie<K,V>	Trie.Evaluator.compose(Trie<K,V> x, Function<V,Trie<K,V>> f, int limit)
Iterable<Map.Entry<List<? extends K>,V>>	Trie.Evaluator.entries(Trie<K,V> x) Fundamental retrieval operation: Get the list of Map.Entry containing prefix (from K*) and values.
boolean	Trie.equals(Trie t)
<W> W	Trie.Evaluator.fold(BiFunction<? super V,? super SortedMap<K,W>,? extends W> fun, Trie<K,V> x) Special kind of folding as follows: For all leave nodes fun is applied to their value and to an empty map.
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.foldValue(BiFunction<? super V,? super SortedMap<K,W>,? extends W> fun, Trie<K,V> x)
boolean	Trie.Evaluator.leq(Relation<? super V,? super V> valueLeq, Trie<K,V> x, Trie<K,V> y)
boolean	Trie.Evaluator.leq(Relation<? super V,? super V> valueLeq, Trie<K,V> x, Trie<K,V> y)
<V,W> Trie<K,W>	Trie.Functor.map(Function<? super V,? extends W> fun, Trie<K,V> x)
Trie<K,V>	Trie.Evaluator.restrict(Trie<K,V> x, Iterable<? extends K> path) Fundamental retrieval operation: Get the subtree starting at the given key prefix.
V	Trie.Evaluator.select(Trie<K,V> x, Iterable<? extends K> path) Fundamental retrieval operation: Get the value entry at the given key prefix.
Trie<K,V>	Trie.Evaluator.union(Trie<K,V> x, Trie<K,V> y) Unify Trie data using Monoid function on values.
Trie<K,V>	Trie.Evaluator.union(Trie<K,V> x, Trie<K,V> y) Unify Trie data using Monoid function on values.

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

Modifier and Type	Method and Description
Trie<K,V>	Trie.Evaluator.compose(Trie<K,V> x, Function<V,Trie<K,V>> f)
Trie<K,V>	Trie.Evaluator.compose(Trie<K,V> x, Function<V,Trie<K,V>> f, int limit)
Trie<K,V>	Trie.Evaluator.iterate(Function<V,Trie<K,V>> f, V init)