Uses of Package
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.
Umod main model class: This is a model for the
results of d2d text parsing.
Model for w3c XML DTDs, with preserved syntax.
Canonical model of a W3C DTD with evaluated semantics; plus utility applications.
Utility functions for Swing GUI interaction and for graphics: drawing and coordinate calculation.
Mathematical graph tools.
Abstract Syntax of LLJava, representing the byte code instructions, the
objects which contain byte code, and the attributes specific to byte code
classes.
Types for fundamental mathematical structures, plus libraries of respective
constants and operators.
Command line parser and graphical user input generated from
one abstract description of programming options, incl data types
and multi-lingual descriptions.
Runtime library for generated option processing code: building blocks for
parsing and GUI.
A modular implementation of pattern matching on arbitrary objects.
Generates typed models of XML documents,
see
meta-tools TDOM user documentation.
A DocumentClient implementation for W3C Dom.
Infrastructure for evaluating tpath expressions.
Type checking for tpath expressions.
Runtime classes for the model code generated by the
umod-Compiler
, esp for data integrity
de/serialization, visualzation, visitors and rewriters.Utility classes for Java and JVM runtime objects and bytecode.
Ubiquitously needed auxiliary classes which need the
eu.bandm.tools.option
package.txsl = typed xslt 1.0 interpreter with "fragmented validation".
-
ClassDescriptionA finite set of pairs.A map which allows fast access to pre-images of every element in the range.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.
-
-
-
-
ClassDescriptionModels the four regular-expression operators which are frequently used in extended Bakus-Naur-forms.A finite set of pairs.
-
-
-
ClassDescriptionFinite partial equivalence relations modulo equals, implemented as union-find trees.A finite set of pairs.
-
ClassDescriptionA 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.DOCMEDOCMEDOCMEDeprecated.A parametrized action on a stateful class.Class realizing a "tagged union" of two(2) to four(4) different cases.Models the four regular-expression operators which are frequently used in extended Bakus-Naur-forms.Deprecated.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.Abstract type with realizes an interval of a value type by lower and upper bound.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.Deprecated.Deprecated.Deprecated.Deprecated.Pattern variable.A map which allows fast access to pre-images of every element in the range.Immutable prime factor combinations as representation of Rationals, thus wiht positive or negative exponents.A value delivery from a stateful class.Realizing Rational numbers, internally based onBigInteger
.DOCMEDeprecated.better useBiPredicate
directly.One 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, whereTreeMultiset
not 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.Protects the contents of a multi set. -
-
-
-
ClassDescriptionA map which allows fast access to pre-images of every element in the range.
-
ClassDescriptionSubinterface which provides an initial state, on which the very first call to
Producer.produce(S)
can be executed. -
-
ClassDescriptionAn index is a totally ordered finite collection, the generalization of an enum type.
-
ClassDescriptionTop level of the generic implementations of
Multimap
.An Implementation where both directions of look-up are realized by hashing.Generic implementation using maps of sets in both directions.A finite set of pairs. -
ClassDescriptionAn index is a totally ordered finite collection, the generalization of an enum type.
-
-
ClassDescriptionModels the four regular-expression operators which are frequently used in extended Bakus-Naur-forms.A finite set of pairs.
Function
instead.