final case class Recursive[Case[+_]](caseValue: Case[Recursive[Case]]) extends Product with Serializable
- Self Type
- Recursive[Case]
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- Recursive
- Serializable
- Product
- Equals
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- val caseValue: Case[Recursive[Case]]
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def fold[Z](f: (Case[Z]) => Z)(implicit covariant: Covariant[Case]): Z
- def foldAnnotated[Z](f: (Case[Annotated[Case, Z]]) => Z)(implicit covariant: Covariant[Case]): Z
Folds over the recursive data structure to reduce it to a summary value, providing access to the recursive structure annotated with the current previous summary values in each step of the fold.
- def foldDown[Z](z: Z)(f: (Z, Recursive[Case]) => Z)(implicit foreach: ForEach[Case]): Z
- def foldDownSome[Z](z: Z)(pf: PartialFunction[(Z, Recursive[Case]), Z])(implicit foreach: ForEach[Case]): Z
- def foldM[F[+_], Z](f: (Case[Z]) => F[Z])(implicit arg0: AssociativeFlatten[F], arg1: Covariant[F], arg2: IdentityBoth[F], foreach: ForEach[Case]): F[Z]
- def foldManaged[R, E, Z](f: (Case[Z]) => ZManaged[R, E, Z])(implicit foreach: ForEach[Case]): ZManaged[R, E, Z]
- def foldPure[W, S, R, E, Z](f: (Case[Z]) => ZPure[W, S, S, R, E, Z])(implicit foreach: ForEach[Case]): ZPure[W, S, S, R, E, Z]
- def foldRecursive[Z](f: (Case[(Recursive[Case], Z)]) => Z)(implicit covariant: Covariant[Case]): Z
- def foldSTM[R, E, Z](f: (Case[Z]) => ZSTM[R, E, Z])(implicit foreach: ForEach[Case]): ZSTM[R, E, Z]
- def foldUp[Z](z: Z)(f: (Z, Recursive[Case]) => Z)(implicit foreach: ForEach[Case]): Z
- def foldUpSome[Z](z: Z)(pf: PartialFunction[(Z, Recursive[Case]), Z])(implicit foreach: ForEach[Case]): Z
- def foldValidation[W, E, Z](f: (Case[Z]) => ZValidation[W, E, Z])(implicit foreach: ForEach[Case]): ZValidation[W, E, Z]
- def foldZIO[R, E, Z](f: (Case[Z]) => ZIO[R, E, Z])(implicit foreach: ForEach[Case]): ZIO[R, E, Z]
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def transformDown(f: (Recursive[Case]) => Recursive[Case])(implicit covariant: Covariant[Case]): Recursive[Case]
- def transformDownSome(pf: PartialFunction[Recursive[Case], Recursive[Case]])(implicit covariant: Covariant[Case]): Recursive[Case]
- def transformUp(f: (Recursive[Case]) => Recursive[Case])(implicit covariant: Covariant[Case]): Recursive[Case]
- def transformUpSome(pf: PartialFunction[Recursive[Case], Recursive[Case]])(implicit covariant: Covariant[Case]): Recursive[Case]
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()