ADTDefinition

abstract val flags: Set[Trees.Flag]

abstract val id: Identifier

abstract val isSort: Boolean

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

The root of the class hierarchy

abstract val tparams: Seq[Trees.TypeParameterDef]

abstract def typed(implicit s: Trees.Symbols): Trees.TypedADTDefinition

abstract def typed(tps: Seq[Trees.Type])(implicit s: Trees.Symbols): Trees.TypedADTDefinition

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

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

def clone(): AnyRef

def copiedFrom(o: Tree): ADTDefinition.this.type

final def eq(arg0: AnyRef): Boolean

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

An equality relation defined on this ADTDefinition

def equals(that: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def getPos: Position

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

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

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

def hashCode(): Int

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

An invariant that refines this ADTDefinition

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

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def setPos(that: Positioned): ADTDefinition.this.type

def setPos(pos: Position): ADTDefinition.this.type

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

def toString(): String

def typeArgs: Seq[Trees.TypeParameter]

final def wait(): Unit

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

final def wait(arg0: Long): Unit