Uses of Package
eu.bandm.tools.ops
Packages that use eu.bandm.tools.ops
Package
Description
D2d allows to write valid XML documents directly in the creative flow of authoring,
with minimum typographic noise.
This is a package of auxiliary classes for
the d2d version 2.0 implementation.
Canonical model of a W3C DTD with evaluated semantics;
plus utility applications.
Types for fundamental mathematical structures, plus libraries of respective
constants and operators.
Runtime library for generated option processing code: building blocks for
parsing and GUI.
A DocumentClient implementation for W3C Dom.
Infrastructure for evaluating tpath expressions.
Type checking for tpath expressions.
-
Classes in eu.bandm.tools.ops used by eu.bandm.tools.d2d2.baseClassDescriptionA map which allows fast access to pre-images of every element in the range.
-
Classes in eu.bandm.tools.ops used by eu.bandm.tools.d2d2.infra
-
Classes in eu.bandm.tools.ops used by eu.bandm.tools.dtmClassDescriptionModels the four regular-expression operators which are frequently used in extended Backus–Naur forms.
-
Classes in eu.bandm.tools.ops used by eu.bandm.tools.opsClassDescriptionA generic implementation which ..Top level of the generic implementations of
Multimap.Generic implementation DOCMESorted list of instances of T for indexed representation, realized internally by an array.Implementation of a sorted list by an underlying array.DOCMEDOCMEDOCMEA parametrized action on a stateful class.Class realizing a "tagged union" of two(2) to four(4) different cases.Wrapper for one single data item added to the enumeration.Models the four regular-expression operators which are frequently used in extended Backus–Naur forms.A real-valued matrix over an index set with finitely many nonzero coordinates, except perhaps for the diagonal.A real-valued vector over an index set with finitely many nonzero coordinates.Monoid generated by a given set.Semigroup generated by a given set.An Implementation where both directions of look-up are realized by hashing.Immutable map with heterogeneously typed entries.The class of map keys.An index is a totally ordered finite collection, the generalization of an enum type.DOCMEOptimized Implementation using bit sets for both directions.Implements a set over an index type optimally, by using bit sets.Subinterface which provides an initial state, on which the very first call toConsumer.consume(D, T)can be executed.Subinterface which provides an initial state, on which the very first call toProducer.produce(S)can be executed.One of three kinds a function can be invertible.Realizing a mathematical lattice.Implementation which may calculate its elements on demand.Generic implementation using maps of sets in both directions.Extends a semigroup to a monoid by providing a neutral element.A finite set of pairs.Structure similar to a set, but every element can be contained more than once.Deprecated.A map which allows fast access to pre-images of every element in the range.Immutable prime factor combinations as representation of Rationals, thus with positive or negative exponents.A value delivery from a stateful class.Rational numbers with unbounded precision.DOCMEOne of three kinds a function can be invertible.One of three kinds a function can be invertible.Models the behaviour of a mathematical semigroup, namely to calculate an element of the carrier type from two given elements.A list of map entries, which has a second comparator for the keys of the contained entries.A list which maintains all its elements in the order supplied by the given comparator.Calculation of a value based on a current inner state.Implementation for sorted domains, whereTreeMultisetnot applicable.Implementation of optimized prefix retrieval data structures.Immutable data, each instance represents one cell (inner node or leaf) of the whole Trie.Implementation of a tuple with zero components.Implementation of a tuple with two components.Implementation of a tuple with three components.Implementation of a tuple with four components.A mathematical tuple, maybe with zero components.A mathematical tuple with at least one component.A mathematical tuple with at least two components.A mathematical tuple with at least three components.A mathematical tuple with at least four components.Technically needed: The type of a lazy list which has already been forced to evaluate all elements. -
Classes in eu.bandm.tools.ops used by eu.bandm.tools.option.runtime
-
Classes in eu.bandm.tools.ops used by eu.bandm.tools.tpath.domClassDescriptionSubinterface which provides an initial state, on which the very first call to
Producer.produce(S)can be executed. -
Classes in eu.bandm.tools.ops used by eu.bandm.tools.tpath.runtime
-
Classes in eu.bandm.tools.ops used by eu.bandm.tools.tpath.typeClassDescriptionAn index is a totally ordered finite collection, the generalization of an enum type.