Package net.hydromatic.morel.util

package net.hydromatic.morel.util

Utilities.

Related Packages

Package	Description
net.hydromatic.morel	Standard ML interpreter, implemented in Java.
net.hydromatic.morel.ast	Abstract syntax tree.
net.hydromatic.morel.compile	Validates programs (represented as AstNode), deduces their type, and compiles them into code that can be evaluated.
net.hydromatic.morel.eval	Evaluates expressions.
net.hydromatic.morel.foreign	Provides access to external data sources.
net.hydromatic.morel.type	Type system.

Class	Description
AbstractImmutableList<E>	Base class for lists whose contents are constant after creation.
ArrayQueue<E>	Like a list, but ArrayQueue.poll() (equivalent to remove(0) is O(1).
ComparableSingletonList<E extends Comparable<E>>	A comparable singleton list.
ConsList<E>	List that consists of a head element and an immutable non-empty list.
Folder<E>	Enable creating right-deep trees.
Folder.End<E>	Sub-class of Folder that marks the end of a list.
ImmutablePairList<T,U>	Immutable list of pairs.
JavaVersion	Version of the JDK.
MapEntry<T,U>	Simple implementation of Map.Entry.
MapList<E>	Read-only list that generates elements between 0 and size - 1 by applying a function.
MartelliUnifier	Unification algorithm due to Martelli, Montanari (1976) and Paterson, Wegman (1978).
MartelliUnifier.Kind
MartelliUnifier.MutableConstraint	As Unifier.Constraint, but mutable.
MorelException	Interface implemented by all exceptions in Morel.
Ord<E>	Pair of an element and an ordinal.
Ord.IntObjObjConsumer<K,V>	Consumer that receives an ordinal, a key, and a value.
Ord.OrdArrayList<E>	List of Ord backed by an array of elements.
Ord.OrdList<E>	List of Ord backed by a list of elements.
Ord.OrdRandomAccessList<E>	List of Ord backed by a random-access list of elements.
Pair<T1,T2>	Pair of objects.
Pair.AdjacentIterator<E>	Iterator that returns consecutive pairs of elements from an underlying iterator.
Pair.FirstAndIterator<E>	Iterator that returns the first element of a collection paired with every other element.
Pair.LeftIterator<L,R>	Iterator that returns the left field of each pair.
Pair.MutableZipList<K,V>	A mutable list of pairs backed by a pair of mutable lists.
Pair.PairWithOrdinalConsumer<K,V>	Represents an operation that accepts two input arguments and an ordinal, and returns no result.
Pair.RightIterator<L,R>	Iterator that returns the right field of each pair.
Pair.ZipIterator<L,R>	Iterator that pairs elements from two iterators.
Pair.ZipList<K,V>	Unmodifiable list of pairs, backed by a pair of lists.
PairList<T,U>	A list of pairs, stored as a quotient list.
PairList.Builder<T,U>	Builds a PairList.
PairList.IndexedBiConsumer<T,U>	Action to be taken each step of an indexed iteration over a PairList.
PairLists	Various implementations of PairList.
PairLists.AbstractPairList<T,U>	Base class for all implementations of PairList.
PairLists.ArrayImmutablePairList<T,U>	Immutable list of pairs backed by an array.
PairLists.EmptyImmutablePairList<T,U>	Empty immutable list of pairs.
PairLists.MapPairList<T,U>	List of pairs backed by a map.
PairLists.MutablePairList<T,U>	Mutable version of PairList.
PairLists.RandomAccessList<E>	Base class for a list that implements RandomAccess.
PairLists.SingletonImmutablePairList<T,U>	Immutable list that contains one pair.
RobinsonUnifier	Robinson's unification algorithm.
Sat	Boolean satisfiability.
Sat.And	"And" term.
Sat.Assignment	Assignment of a variable to a value.
Sat.Node	Term that has a variable number of arguments ("and" or "or").
Sat.Not	"Not" term.
Sat.Op	Operator (or type of term), with its left and right precedence and print name.
Sat.Or	"Or" term.
Sat.Term	Base class for all terms (variables, and, or, not).
Sat.Variable	Variable.
Static	Utilities.
TailList<E>	A dynamic list that reads from a given point in a backing list.
ThreadLocals	Utilities for ThreadLocal.
Tracers	Implementations of Unifier.Tracer.
Tracers.ConfigurableTracer	Tracer that allows each of its methods to be modified using a handler.
Tracers.ConfigurableTracerImpl	Implementation of Tracers.ConfigurableTracer that has a field for each handler.
Tracers.NullTracer	Implementation of Unifier.Tracer that does nothing.
Tracers.PrintTracer	Implementation of Unifier.Tracer that writes to a given PrintWriter.
Tracers.QuadConsumer<T,U,V,W>	Consumer that accepts four arguments.
TriConsumer<R,S,T>	Represents an operation that accepts three input arguments and returns no result.
Unifier	Given pairs of terms, finds a substitution to minimize those pairs of terms.
Unifier.Action	Called by the unifier when a Term's type becomes known.
Unifier.Constraint	Constraint arising from a call to an overloaded function.
Unifier.Constraint.Action	Called when a constraint is narrowed down to one possibility.
Unifier.CycleException	Control flow exception, thrown by Unifier.Term.checkCycle(Map, Map) if it finds a cycle in a substitution map.
Unifier.EquivAction	An action that, when executed, marks two terms as equivalent.
Unifier.Failure	Result indicating that unification was not possible.
Unifier.Result	Result of attempting unification.
Unifier.Retry	Result indicating that unification may be possible if we adjust some initial parameters.
Unifier.Sequence	A sequence of terms.
Unifier.Substitution	Map from variables to terms.
Unifier.SubstitutionResult	The results of a successful unification.
Unifier.Term	Term (variable, symbol or node).
Unifier.TermTerm	A pair of terms.
Unifier.TermVisitor<R>	Visitor for terms.
Unifier.Tracer	Called on various events during unification.
Unifier.Variable	A variable that represents a symbol or a sequence; unification's task is to find the substitutions for such variables.
Unifiers	Utilities for unification.
Unifiers.Dumper	Work space for Unifiers.dump(PrintWriter, Iterable).