@Runtime

Package eu.bandm.tools.ops

Interface Summary

Interface	Description
BinFunction<D1,D2,R>
Collections.LiteralList<A>	Very similar to java.util.Arrays.asList(), but truely immutable.
Collections.LiteralMap<A,B>
Collections.LiteralSet<A>
Computable<A>	Deprecated
Consumer<D,S>	A parametrized action on a stateful class.
Function<D,R>	Deprecated Use Function instead.
Function0<R>
Function2<D0,D1,R>
Function3<D0,D1,D2,R>
Function4<D0,D1,D2,D3,R>
Function5<D0,D1,D2,D3,D4,R>
Function6<D0,D1,D2,D3,D4,D5,R>
Function7<D0,D1,D2,D3,D4,D5,D6,R>
Function8<D0,D1,D2,D3,D4,D5,D6,D7,R>
GenMonoid<A,M>
GenSemigroup<A,M>
Index<T>	An index is a totally ordered finite collection, the generalization of an enum type.
InitConsumer<D,S>
InitProducer<R,S>
Interval<B>
InvertibleFunction<D,R>
Iterators.LookaheadIterator<A>
Iterators.PushbackIterator<A>
Lattice<A>
LazyList<A>
Monoid<M>
MonoidAction<M,S>
Multimap<A,B>	A finite set of pairs.
Multiset<A>
Pair<L,R>	Deprecated
PairSink<A,B>	Deprecated
Predicate<D>
PreimageMap<A,B>
Producer<R,S>
Relation<D,R>	A binary predicate.
RetractableFunction<D,R>
SectionableFunction<D,R>
Semigroup<M>
Sink<A>
SortedEntryList<A,B>
SortedList<A>
SortedMultimap<A,B>
SortedMultiset<A>
Stateful<S,A>
Trie.Automaton<K,V>
Tuploid0
Tuploid1<A0>
Tuploid2<A0,A1>
Tuploid3<A0,A1,A2>
Tuploid4<A0,A1,A2,A3>

Class Summary

Class	Description
AbstractInvertibleFunction<D,R>	invert .
AbstractLazyList<A>
AbstractMultimap<A,B>
AbstractPreimageMap<A,B>
ArrayIndex<T>
Arrays
ArraySortedEntryList<A,B>
ArraySortedList<A>
Backtrack
Backtrack.Exploration<A>
BisectionEntrySet<A,B>
BisectionMap<A,B>
BisectionSet<A>
BitSets	ml->bt 20160821 benoetigt fuer rtl, bitte glattziehen.
Collections
Comparators
Computables	Deprecated
Consumers
EnumIndex<T extends Enum<T>>
EquivalenceRelation<A>	Finite partial equivalence relations modulo equals, implemented as union-find trees.
ForwardMultimap<A,B>
Functions
Functions.MemoizedBiFunction<A,B,C>
HashIndex<T>
HashMultimap<A,B>
HashMultiset<A>
HashPreimageMap<A,B>
IndexCounter<T>
IndexMap<K,V>
IndexMultimap<A,B>
IndexSet<T>
InitProducers
IntervalRelation
Iterables
Iterables.Cached<A>
Iterables.FilterIterable<A>
Iterables.FilterTest
Iterators
Iterators.FilterIterator<A>
Lattices
LazyLists
ListIterators
Lists
MapMultimap<A,B>
Math
Monoids
Multimaps
Multisets
Null	An abstract class that has no instances, and only the null reference.
Pairs	Deprecated
Pattern<A>	A modular implementation of pattern matching on arbitrary objects.
Pattern.Atomic<A>
Pattern.Binary<A,B,C>
Pattern.Contravariant<A>
Pattern.Transform<A,B>
Pattern.Unary<A,B>
Pattern.Variable<A>	Pattern variable.
Predicates
RecursiveList<A>
ReflectedBinFunction<D1,D2,R>
ReflectedFunction<D,R>
ReflectedOperation
ReflectedRelation<D,R>
Relations
RtArraySet<D>	ATTENTION: This class restricts the contract of "Iterator": Once "hasNext()==false" has returned, all following behaviour is unspecified and further usage forbidden.
RtArraySet2<D>	"Lock-Free" variant of a "Real-Time Array Set". DISCUSS: not yet clear whether the old dynamic form for "size()" is more efficient, -- it needs one "atomic" variable less.
SetIndex<T>
Statefuls
TreeMultiset<A>
Trie<K extends Comparable<? super K>,V>	Implementation of optimized prefix retrieval data structures.
Trie.Evaluator<K extends Comparable<? super K>,V>	Realizes alebraic operation on Tries.
Trie.Functor<K extends Comparable<? super K>>
Trie.Node<K extends Comparable<? super K>,V>	Immutable data, each instance represents one "cell" (inner node or leave) of the whole Trie.
Tuple0
Tuple2<A0,A1>
Tuple3<A0,A1,A2>
Tuple4<A0,A1,A2,A3>
Tuples
UnlazyList<A>

Enum Summary

Enum	Description
IntervalRelation.Base