object IndexedRecursiveDefinition
Type Members
- case class DataCons[H <: Term with Subs[H], F <: Term with Subs[F], C <: Term with Subs[C], Index <: HList, IF <: Term with Subs[IF], IDF <: Term with Subs[IDF], IDFT <: Term with Subs[IDFT], D <: Term with Subs[D]](data: D, cons: Term, defn: (D) => (IF) => (H) => Option[C], tail: IndexedRecursiveDefinition[H, F, C, Index, IF, IDF, IDFT], replacement: (Term) => (Term) => (Typ[C]) => Option[DataCons[H, F, C, Index, IF, IDF, IDFT, D]] = (_: Term) => (_: Term) => (_: Typ[C]) => None)(implicit evidence$3: TermList[Index]) extends IndexedRecursiveDefinition[H, F, C, Index, IF, IDF, IDFT] with Product with Serializable
- case class Empty[H <: Term with Subs[H], F <: Term with Subs[F], C <: Term with Subs[C], Index <: HList, IF <: Term with Subs[IF], IDF <: Term with Subs[IDF], IDFT <: Term with Subs[IDFT]](W: F, X: Typ[C], family: TypFamilyMap[H, F, C, Index, IF, IDF, IDFT])(implicit evidence$2: TermList[Index]) extends IndexedRecursiveDefinition[H, F, C, Index, IF, IDF, IDFT] with Product with Serializable
Value Members
- final def !=(arg0: Any): Boolean
- final def ##: Int
- final def ==(arg0: Any): Boolean
- final def asInstanceOf[T0]: T0
- def clone(): AnyRef
- final def eq(arg0: AnyRef): Boolean
- def equals(arg0: AnyRef): Boolean
- final def getClass(): Class[_ <: AnyRef]
- def hashCode(): Int
- final def isInstanceOf[T0]: Boolean
- final def ne(arg0: AnyRef): Boolean
- final def notify(): Unit
- final def notifyAll(): Unit
- final def synchronized[T0](arg0: => T0): T0
- def toString(): String
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit
- final def wait(): Unit
Deprecated Value Members
- def finalize(): Unit
Inherited from AnyRef
Value Members
- final def !=(arg0: Any): Boolean
- final def ##: Int
- final def ==(arg0: Any): Boolean
- def clone(): AnyRef
- final def eq(arg0: AnyRef): Boolean
- def equals(arg0: AnyRef): Boolean
- final def getClass(): Class[_ <: AnyRef]
- def hashCode(): Int
- final def ne(arg0: AnyRef): Boolean
- final def notify(): Unit
- final def notifyAll(): Unit
- final def synchronized[T0](arg0: => T0): T0
- def toString(): String
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit
- final def wait(): Unit
- def finalize(): Unit
Inherited from Any
Value Members
- final def asInstanceOf[T0]: T0
- final def isInstanceOf[T0]: Boolean
Ungrouped
- case class DataCons[H <: Term with Subs[H], F <: Term with Subs[F], C <: Term with Subs[C], Index <: HList, IF <: Term with Subs[IF], IDF <: Term with Subs[IDF], IDFT <: Term with Subs[IDFT], D <: Term with Subs[D]](data: D, cons: Term, defn: (D) => (IF) => (H) => Option[C], tail: IndexedRecursiveDefinition[H, F, C, Index, IF, IDF, IDFT], replacement: (Term) => (Term) => (Typ[C]) => Option[DataCons[H, F, C, Index, IF, IDF, IDFT, D]] = (_: Term) => (_: Term) => (_: Typ[C]) => None)(implicit evidence$3: TermList[Index]) extends IndexedRecursiveDefinition[H, F, C, Index, IF, IDF, IDFT] with Product with Serializable
- case class Empty[H <: Term with Subs[H], F <: Term with Subs[F], C <: Term with Subs[C], Index <: HList, IF <: Term with Subs[IF], IDF <: Term with Subs[IDF], IDFT <: Term with Subs[IDFT]](W: F, X: Typ[C], family: TypFamilyMap[H, F, C, Index, IF, IDF, IDFT])(implicit evidence$2: TermList[Index]) extends IndexedRecursiveDefinition[H, F, C, Index, IF, IDF, IDFT] with Product with Serializable
- final def !=(arg0: Any): Boolean
- final def ##: Int
- final def ==(arg0: Any): Boolean
- final def asInstanceOf[T0]: T0
- def clone(): AnyRef
- final def eq(arg0: AnyRef): Boolean
- def equals(arg0: AnyRef): Boolean
- final def getClass(): Class[_ <: AnyRef]
- def hashCode(): Int
- final def isInstanceOf[T0]: Boolean
- final def ne(arg0: AnyRef): Boolean
- final def notify(): Unit
- final def notifyAll(): Unit
- final def synchronized[T0](arg0: => T0): T0
- def toString(): String
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit
- final def wait(): Unit
- def finalize(): Unit