Packages

class Var extends AbsVar

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Var
  2. AbsVar
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Var(path: Tree, staticTp: Type)

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[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  6. def describe: String
  7. lazy val domain: Option[Set[Const]]
  8. lazy val domainSyms: Option[Set[TreesAndTypesDomain.Sym]]
    Definition Classes
    VarAbsVar
  9. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  10. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  12. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  13. lazy val groupedDomains: List[Set[TreesAndTypesDomain.Sym]]
    Definition Classes
    VarAbsVar
  14. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  15. 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 pattern C, where the type test gives rise to a TypeConst C, and the constant pattern yields a ValueConst C

    for 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"

    Definition Classes
    VarAbsVar
  16. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  17. def mayBeNull: Boolean
    Definition Classes
    VarAbsVar
  18. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  19. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  20. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  21. val path: Tree
  22. def propForEqualsTo(c: Const): TreesAndTypesDomain.Prop
    Definition Classes
    VarAbsVar
  23. def registerEquality(c: Const): Unit
    Definition Classes
    VarAbsVar
  24. def registerNull(): Unit
    Definition Classes
    VarAbsVar
  25. val staticTpCheckable: Type
  26. lazy val symForStaticTp: Option[TreesAndTypesDomain.Sym]
    Definition Classes
    VarAbsVar
  27. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  28. def toString(): String
    Definition Classes
    Var → AnyRef → Any
  29. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  30. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  31. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped