Uses of Package
net.hydromatic.morel.util
Packages that use net.hydromatic.morel.util
Package
Description
Standard ML interpreter, implemented in Java.
Abstract syntax tree.
Validates programs
(represented as
AstNode),
deduces their type,
and compiles them into code that can be evaluated.Evaluates expressions.
Type system.
Utilities.
-
Classes in net.hydromatic.morel.util used by net.hydromatic.morelClassDescriptionInterface implemented by all exceptions in Morel.Pair of objects.
-
Classes in net.hydromatic.morel.util used by net.hydromatic.morel.astClassDescriptionImmutable list of pairs.Pair of objects.A list of pairs, stored as a quotient list.
-
Classes in net.hydromatic.morel.util used by net.hydromatic.morel.compileClassDescriptionImmutable list of pairs.Interface implemented by all exceptions in Morel.Pair of objects.A list of pairs, stored as a quotient list.Boolean satisfiability.Base class for all terms (variables, and, or, not).Variable.Given pairs of terms, finds a substitution to minimize those pairs of terms.Called by the unifier when a Term's type becomes known.A sequence of terms.Map from variables to terms.Term (variable, symbol or node).Visitor for terms.A variable that represents a symbol or a sequence; unification's task is to find the substitutions for such variables.
-
Classes in net.hydromatic.morel.util used by net.hydromatic.morel.evalClassDescriptionImmutable list of pairs.Interface implemented by all exceptions in Morel.A list of pairs, stored as a quotient list.
-
Classes in net.hydromatic.morel.util used by net.hydromatic.morel.type
-
Classes in net.hydromatic.morel.util used by net.hydromatic.morel.utilClassDescriptionBase class for lists whose contents are constant after creation.A comparable singleton list.Enable creating right-deep trees.Immutable list of pairs.Version of the JDK.Read-only list that generates elements between 0 and
size- 1 by applying a function.Pair of an element and an ordinal.Consumer that receives an ordinal, a key, and a value.List ofOrdbacked by a list of elements.Pair of objects.Represents an operation that accepts two input arguments and an ordinal, and returns no result.A list of pairs, stored as a quotient list.Builds a PairList.Action to be taken each step of an indexed iteration over a PairList.Base class for all implementations of PairList.Term that has a variable number of arguments ("and" or "or").Operator (or type of term), with its left and right precedence and print name.Base class for all terms (variables, and, or, not).Variable.Implementation ofUnifier.Tracerthat does nothing.Given pairs of terms, finds a substitution to minimize those pairs of terms.Called by the unifier when a Term's type becomes known.Control flow exception, thrown byUnifier.Term.checkCycle(Map, Map)if it finds a cycle in a substitution map.Result indicating that unification was not possible.Result of attempting unification.A sequence of terms.Map from variables to terms.The results of a successful unification.Term (variable, symbol or node).A pair of terms.Visitor for terms.Called on various events during unification.A variable that represents a symbol or a sequence; unification's task is to find the substitutions for such variables.