object RecFreeS extends Serializable
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- RecFreeS
- Serializable
- Serializable
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Type Members
- final case class Fix[F[_], A](form: RecFreeS[F, A], rec: Free[[β$6$]RecFreeS[F, β$6$], slamdata.Predef.Unit]) extends RecFreeS[F, A] with Product with Serializable
- type RecFreeMapA[T[_[_]], A] = Free[[β$4$]RecFreeS[[β$3$]Coproduct[[β$62$]MapFuncCore[T, β$62$], [β$63$]MapFuncDerived[T, β$63$], β$3$], β$4$], A]
- final case class Suspend[F[_], A](fa: F[A]) extends RecFreeS[F, A] with Product with Serializable
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
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
- def fromFree[F[_], A](f: Free[F, A]): Free[[β$7$]RecFreeS[F, β$7$], A]
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def letIn[F[_], A](form: Free[F, A])(rec: Free[F, slamdata.Predef.Unit]): Free[[β$10$]RecFreeS[F, β$10$], A]
-
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 recInterpret[F[_], A](fm: RecFreeS[F, A])(susint: Algebra[F, A], fixint: (A) ⇒ (A, (A) ⇒ A))(implicit arg0: Traverse[F]): A
-
def
recInterpretM[M[_], F[_], A](fm: RecFreeS[F, A])(susint: AlgebraM[M, F, A], fixint: (A) ⇒ M[(A, (A) ⇒ M[A])])(implicit arg0: Monad[M], arg1: Traverse[F]): M[A]
- Annotations
- @SuppressWarnings()
- implicit def renderTree[F[_], A](implicit arg0: Functor[F], F: RenderTree[F[A]], FR: RenderTree[Free[F, A]]): RenderTree[RecFreeS[F, A]]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
implicit
def
traverse[F[_]](implicit arg0: Traverse[F]): Traverse[[β$13$]RecFreeS[F, β$13$]]
- Annotations
- @SuppressWarnings()
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )