final class MutCC extends AnyRef
Congruence closure implementation closely following [1]
[1] R. Nieuwenhuis and A. Oliveras, Fast congruence closure and extensions, Information and Computation 205.4 (2007), 557-580.
- Source
- congruence.scala
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- MutCC
- AnyRef
- Any
Implicitly
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
Visibility
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- def ->[B](y: B): (MutCC, B)
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def addEqn(eqn: Eqn): Unit
- def addEqn(l: Int, r: Int, lr: Int): Unit
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): MutCC
- Definition Classes
- MutCC → AnyRef
- def ensuring(cond: (MutCC) ⇒ Boolean, msg: ⇒ Any): MutCC
- def ensuring(cond: (MutCC) ⇒ Boolean): MutCC
- def ensuring(cond: Boolean, msg: ⇒ Any): MutCC
- def ensuring(cond: Boolean): MutCC
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def explain: Explainer
- def formatted(fmtstr: String): String
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def isEq(a: Int, b: Int): Boolean
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- val klass: Array[Vector[Int]]
- val lookup: Map[(Int, Int), Eqn]
- def merge(a: Int, b: Int, ref: Int): Unit
- def merge(p: Pending): Unit
- val n: Int
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- val parent: Array[Int]
- val pending: ArrayStack[Pending]
- def propagate(): Unit
- val reason: Array[Pending]
- val repr: Array[Int]
- def resize(newN: Int): MutCC
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
- val use: Array[Vector[Eqn]]
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
- def →[B](y: B): (MutCC, B)
This is the API documentation for GAPT.
The main package is gapt.