class Var extends AbsVar
- Source
- Logic.scala
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- Var
- AbsVar
- 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): (Var, B)
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
- def describe: String
- lazy val domain: Option[Set[Const]]
- lazy val domainSyms: Option[Set[TreesAndTypesDomain.Sym]]
- def ensuring(cond: (Var) ⇒ Boolean, msg: ⇒ Any): Var
- def ensuring(cond: (Var) ⇒ Boolean): Var
- def ensuring(cond: Boolean, msg: ⇒ Any): Var
- def ensuring(cond: Boolean): Var
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
- def formatted(fmtstr: String): String
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- lazy val groupedDomains: List[Set[TreesAndTypesDomain.Sym]]
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
lazy val
implications: List[(TreesAndTypesDomain.Sym, List[TreesAndTypesDomain.Sym], List[TreesAndTypesDomain.Sym])]
the information needed to construct the boolean proposition that encodes the equality proposition (V = C)
the information needed to construct the boolean proposition that encodes the equality proposition (V = C)
that models a type test pattern
_: C
or constant patternC
, where the type test gives rise to a TypeConst C, and the constant pattern yields a ValueConst Cfor exhaustivity, we really only need implication (e.g., V = 1 implies that V = 1 /\ V = Int, if both tests occur in the match, and thus in this variable's equality symbols), but reachability also requires us to model things like V = 1 precluding V = "1"
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def mayBeNull: Boolean
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- val path: Tree
- def propForEqualsTo(c: Const): TreesAndTypesDomain.Prop
- def registerEquality(c: Const): Unit
- def registerNull(): Unit
- val staticTpCheckable: Type
- lazy val symForStaticTp: Option[TreesAndTypesDomain.Sym]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- Var → AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
- def →[B](y: B): (Var, B)
The Scala compiler and reflection APIs.