Class

inox.ast.Definitions

ADTSort

Related Doc: package Definitions

Permalink

class ADTSort extends Tree with Trees.ADTDefinition

Algebraic datatype sort definition. An ADT sort is linked to a series of constructors (ADTConstructor) for this particular sort.

Linear Supertypes
Trees.ADTDefinition, Trees.Definition, Tree, Serializable, Serializable, Positioned, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ADTSort
  2. ADTDefinition
  3. Definition
  4. Tree
  5. Serializable
  6. Serializable
  7. Positioned
  8. AnyRef
  9. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ADTSort(id: Identifier, tparams: Seq[Trees.TypeParameterDef], cons: Seq[Identifier], flags: Set[Trees.Flag])

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. def asString(implicit opts: Trees.PrinterOptions): String

    Permalink
    Definition Classes
    Tree

  6. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  7. val cons: Seq[Identifier]

    Permalink

  8. def constructors(implicit s: Trees.Symbols): Seq[Trees.ADTConstructor]

    Permalink

  9. def copiedFrom(o: Tree): ADTSort.this.type

    Permalink
    Definition Classes
    Tree

  10. def copy(id: Identifier = this.id, tparams: Seq[Trees.TypeParameterDef] = this.tparams, cons: Seq[Identifier] = this.cons, flags: Set[Trees.Flag] = this.flags): Trees.ADTSort

    Permalink

  11. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  12. def equality(implicit s: Trees.Symbols): Option[Trees.FunDef]

    Permalink

    An equality relation defined on this ADTDefinition

    An equality relation defined on this ADTDefinition

    Definition Classes
    ADTDefinition

  13. def equals(that: Any): Boolean

    Permalink
    Definition Classes
    Definition → AnyRef → Any

  14. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  15. val flags: Set[Trees.Flag]

    Permalink
    Definition Classes
    ADTSort → ADTDefinition

  16. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  17. def getPos: Position

    Permalink
    Definition Classes
    Positioned

  18. def hasEquality(implicit s: Trees.Symbols): Boolean

    Permalink
    Definition Classes
    ADTDefinition

  19. def hasInstance(implicit s: Trees.Symbols): Boolean

    Permalink
    Definition Classes
    ADTDefinition

  20. def hasInvariant(implicit s: Trees.Symbols): Boolean

    Permalink
    Definition Classes
    ADTDefinition

  21. def hashCode(): Int

    Permalink
    Definition Classes
    Definition → AnyRef → Any

  22. val id: Identifier

    Permalink
    Definition Classes
    ADTSort → ADTDefinition → Definition

  23. def invariant(implicit s: Trees.Symbols): Option[Trees.FunDef]

    Permalink

    An invariant that refines this ADTDefinition

    An invariant that refines this ADTDefinition

    Definition Classes
    ADTDefinition

  24. def isInductive(implicit s: Trees.Symbols): Boolean

    Permalink
    Definition Classes
    ADTDefinition

  25. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  26. val isSort: Boolean

    Permalink
    Definition Classes
    ADTSort → ADTDefinition

  27. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  28. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  29. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  30. def root(implicit s: Trees.Symbols): Trees.ADTDefinition

    Permalink

    The root of the class hierarchy

    The root of the class hierarchy

    Definition Classes
    ADTSort → ADTDefinition

  31. def setPos(that: Positioned): ADTSort.this.type

    Permalink
    Definition Classes
    Positioned

  32. def setPos(pos: Position): ADTSort.this.type

    Permalink
    Definition Classes
    Positioned

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

    Permalink
    Definition Classes
    AnyRef

  34. def toString(): String

    Permalink
    Definition Classes
    Tree → AnyRef → Any

  35. val tparams: Seq[Trees.TypeParameterDef]

    Permalink
    Definition Classes
    ADTSort → ADTDefinition

  36. def typeArgs: Seq[Trees.TypeParameter]

    Permalink
    Definition Classes
    ADTDefinition

  37. def typed(tps: Seq[Trees.Type])(implicit s: Trees.Symbols): Trees.TypedADTSort

    Permalink
    Definition Classes
    ADTSort → ADTDefinition

  38. def typed(implicit s: Trees.Symbols): Trees.TypedADTSort

    Permalink
    Definition Classes
    ADTSort → ADTDefinition

  39. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  41. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Trees.ADTDefinition

Inherited from Trees.Definition

Inherited from Tree

Inherited from Serializable

Inherited from Serializable

Inherited from Positioned

Inherited from AnyRef

Inherited from Any

Ungrouped