Package eu.bandm.tools.ops

package eu.bandm.tools.ops

Types for fundamental mathematical structures, plus libraries of respective constants and operators.

Class	Description
AbstractInvertibleFunction<D,R>	Generic implementation for RetractableFunction.retract(R) and SectionableFunction.section(R), when a general InvertibleFunction.invert(R) is given.
AbstractLazyList<A>	A generic implementation which ..
AbstractMultimap<A,B>	Top level of the generic implementations of Multimap.
AbstractPreimageMap<A,B>	Generic implementation DOCME
ArrayIndex<T>	Sorted list of instances of T for indexed representation, realized internally by an array.
ArraySortedEntryList<A,B>	DOCME
ArraySortedList<A>	Implementation of a sorted list by an underlying array.
BinFunction<D1,D2,R>
BisectionEntrySet<A,B>	DOCME
BisectionMap<A,B>	DOCME
BisectionSet<A>	DOCME
CharMap<V>
CharSet
Consumer<D,S>	A parametrized action on a stateful class.
Consumers	Library of constants and combinators for classes implementing Consumer.
CoTuple<A,B,C,D>	Class realizing a "tagged union" of two(2) to four(4) different cases.
DynamicEnum<T>
DynamicEnum.Coproduct<T>	An enumeration type which comprises all items from a set of underlying enumeration types.
DynamicEnum.Item<T>	Wrapper for one single data item added to the enumeration.
DynamicEnum.Product<T>	The product of multiple DynamicEnum realized as one DynamicEnum of tuples.
EBNFModifier	Models the four regular-expression operators which are frequently used in extended Backus–Naur forms.
EnumIndex<T extends Enum<T>>	Wraps an enumeration class to get all the access methods to the enums values, as defined by Index
EquivalenceRelation<A>	Finite partial equivalence relations modulo equals, implemented as union-find trees.
ForwardMultimap<A,B>	Implementation which allows only one domain element per range elment, equivalent to a simple map.
Function0<R>	A function with zero arguments.
Function2<D0,D1,R>
GenMonoid<A,M>	Monoid generated by a given set.
GenSemigroup<A,M>	Semigroup generated by a given set.
HashIndex<T>	An index where the look-up by number is accelerated by hashing.
HashMultimap<A,B>	An Implementation where both directions of look-up are realized by hashing.
HashMultiset<A>	Implementation for domains with no default order, where TreeMultiset is not applicable.
HashPreimageMap<A,B>	DOCME
HeteroMap	Immutable map with heterogeneously typed entries.
HeteroMap.Key<V>	The class of map keys.
Index<T>	An index is a totally ordered finite collection, the generalization of an enum type.
IndexCounter<T>	DOCME
IndexMap<K,V>	DOCME
IndexMultimap<A,B>	Optimized Implementation using bit sets for both directions.
IndexSet<T>	Implements a set over an index type optimally, by using bit sets.
InitConsumer<D,S>	Subinterface which provides an initial state, on which the very first call to Consumer.consume(D, T) can be executed.
InitProducer<R,S>	Subinterface which provides an initial state, on which the very first call to Producer.produce(S) can be executed.
InitProducers	Library of constants and combinators for classes implementing InitProducer.
Interval<B>	Abstract type with realizes an interval of a value type by lower and upper bound.
InvertibleFunction<D,R>	One of three kinds a function can be invertible.
Lattice<A>	Realizing a mathematical lattice.
Lattices	Library of constants for classes implementing Lattice.
LazyList<A>	Implementation which may calculate its elements on demand.
LazyLists	Library of constants and combinators for classes implementing LazyList.
MapMultimap<A,B>	Generic implementation using maps of sets in both directions.
Monoid<M>	Extends a semigroup to a monoid by providing a neutral element.
MonoidAction<M,S>	Models the "operation" of a Monoid on some carrier set.
Monoids	Library of constants and combinators for classes implementing Monoid.
Multimap<A,B>	A finite set of pairs.
Multimaps	Library of constants and combinators for classes implementing Multimap.
MultipleHash	Utility class for hash code generation for aggregates of Objects.
Multiset<A>	Structure similar to a set, but every element can be contained more than once.
Multisets	Library of constants and combinators for classes implementing Multiset.
Pair<L,R>	Deprecated.
Pairs	Deprecated.
PairSink<A,B>	Deprecated.
Predicate<D>	Deprecated. use Predicate instead.
PreimageMap<A,B>	A map which allows fast access to pre-images of every element in the range.
PrimeFactors	Immutable prime factor combinations as representation of Rationals, thus with positive or negative exponents.
Producer<R,S>	A value delivery from a stateful class.
Rational	Rational numbers with unbounded precision.
RationalComparator<A>	A cache for a given comparator, probably expensive to execute.
RecursiveList<A>	DOCME
Relation<D,R>	Deprecated. better use BiPredicate directly.
RetractableFunction<D,R>	One of three kinds a function can be invertible.
RomanNumbers
RtArraySet<D>	A set implementation for real-time application.
RtArraySet2<D>	A set implementation for real-time application.
SectionableFunction<D,R>	One of three kinds a function can be invertible.
Semigroup<M>	Models the behaviour of a mathematical semigroup, namely to calculate an element of the carrier type from two given elements.
SetIndex<T>	DOCME
Sink<A>
SortedEntryList<A,B>	A list of map entries, which has a second comparator for the keys of the contained entries.
SortedList<A>	A list which maintains all its elements in the order supplied by the given comparator.
SortedMultimap<A,B>	Multimap for both sides of which sorting orders / comparators are defined.
SortedMultiset<A>
SpecialFunctions	Library of constants and combinators for special functions.
Stateful<S,A>	Calculation of a value based on a current inner state.
Statefuls	Library of constants and combinators for classes implementing Stateful.
TreeMultiset<A>	Implementation for sorted domains, where TreeMultiset not applicable.
Trie<K extends Comparable<? super K>,V>	Implementation of optimized prefix retrieval data structures.
Trie.Automaton<K,V>
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 leaf) of the whole Trie.
Tuple0	Implementation of a tuple with zero components.
Tuple2<A0,A1>	Implementation of a tuple with two components.
Tuple2.ListBuilder<B,C>
Tuple3<A0,A1,A2>	Implementation of a tuple with three components.
Tuple4<A0,A1,A2,A3>	Implementation of a tuple with four components.
Tuples	Library of methods operating on the different tuple classes.
Tuploid0	A mathematical tuple, maybe with zero components.
Tuploid1<A0>	A mathematical tuple with at least one component.
Tuploid2<A0,A1>	A mathematical tuple with at least two components.
Tuploid3<A0,A1,A2>	A mathematical tuple with at least three components.
Tuploid4<A0,A1,A2,A3>	A mathematical tuple with at least four components.
UnlazyList<A>	Technically needed: The type of a lazy list which has already been forced to evaluate all elements.
UnmodifiableMultimap<A,B>	A wrapper to protect the contents of an instance of Multimap.
UnmodifiableMultiset<A>	Protects the contents of a multi set.