Exploration

abstract val needCompleteContentsForConflicts: Boolean

abstract def newStore(t: Term): ConstraintStore

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def addLengthConstraint(constraint: TermConstraint, sources: Seq[TermConstraint]): Unit

val allInitialConstraints: Seq[(Term, Automaton)]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def findModel: Option[Map[Term, Either[IdealInt, Seq[Int]]]]

Check for existence of a model.

val funApps: Seq[(PreOp, Seq[Term], Term)]

final def getClass(): Class[_]

def hashCode(): Int

val initialConstraints: Seq[(Term, Automaton)]

final def isInstanceOf[T0]: Boolean

val leafTerms: Set[Term]

def measure[A](op: String)(comp: ⇒ A): A

final def ne(arg0: AnyRef): Boolean

val nonTreeLikeApps: Boolean

final def notify(): Unit

final def notifyAll(): Unit

val resultTerms: Set[Term]

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit