Packages

sealed abstract class IndexedRecursiveDefinition[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]] extends AnyRef

indexed version of RecursiveDefinition

Self Type
IndexedRecursiveDefinition[H, F, C, Index, IF, IDF, IDFT]
Linear Supertypes
AnyRef, Any
Known Subclasses
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. IndexedRecursiveDefinition
  2. AnyRef
  3. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Type Members

  1. case class Funcs(ind: Index) extends IndRecFunc[H, C, F] with Product with Serializable

Abstract Value Members

  1. abstract val W: F
  2. abstract val X: Typ[C]
  3. abstract def caseFn(f: => IF)(arg: H): Option[C]
  4. abstract def dataSubs(that: IndexedRecursiveDefinition[H, F, C, Index, IF, IDF, IDFT], x: Term, y: Term): IndexedRecursiveDefinition[H, F, C, Index, IF, IDF, IDFT]
  5. abstract val defnData: Vector[Term]
  6. abstract val family: TypFamilyMap[H, F, C, Index, IF, IDF, IDFT]
  7. abstract def fromData(data: Vector[Term]): IndexedRecursiveDefinition[H, F, C, Index, IF, IDF, IDFT]
  8. abstract val intros: Vector[Term]
  9. abstract def subs(x: Term, y: Term): IndexedRecursiveDefinition[H, F, C, Index, IF, IDF, IDFT]

Concrete Value Members

  1. lazy val iterFunc: IF