c

tip.solvers

UnionFindSolver

class UnionFindSolver[A] extends AnyRef

Unification solver based on union-find.

A

type parameter describing the kind of constraint system

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. UnionFindSolver
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new UnionFindSolver()

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native() @IntrinsicCandidate()
  6. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  8. def find(t: Term[A]): Term[A]

    Returns the canonical element of the equivalence class of the term t.

    Returns the canonical element of the equivalence class of the term t. The term is added as a new equivalence class if it has not been encountered before. Uses path compression.

  9. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  10. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  11. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  12. val log: Logger
  13. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  14. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  15. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  16. def solution(): Map[Var[A], Term[A]]

    Returns the solution of the solver.

    Returns the solution of the solver. Note that the terms in the solution have not yet been closed, i.e. they may contain constraint variables.

    returns

    a map associating to each variable the representative of its equivalence class

  17. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  18. def toString(): String

    Produces a string representation of the solution.

    Produces a string representation of the solution.

    Definition Classes
    UnionFindSolver → AnyRef → Any
  19. def unifications(): Map[Term[A], Traversable[Term[A]]]

    Returns all the unifications of the solution.

    Returns all the unifications of the solution.

    returns

    a map from representative to equivalence class

  20. def unify(t1: Term[A], t2: Term[A]): Unit

    Performs the unification of the two terms t1 and t2.

    Performs the unification of the two terms t1 and t2. When unifying a variable and a non-variable term, the non-variable term has higher priority for becoming the representative.

  21. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  22. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  23. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] ) @Deprecated
    Deprecated

Inherited from AnyRef

Inherited from Any

Ungrouped