FreeInstances

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. def ana[T[_[_]], F[_]](f: (FreeInstances) ⇒ F[FreeInstances])(implicit arg0: Functor[F], T: Corecursive[T]): T[F]

   

   Implicit information

   This member is added by an implicit conversion from FreeInstances to IdOps[FreeInstances] performed by method toIdOps in matryoshka.

   Definition Classes

   IdOps

5. def anaM[T[_[_]], M[_], F[_]](f: (FreeInstances) ⇒ M[F[FreeInstances]])(implicit arg0: Monad[M], arg1: Traverse[F], T: Corecursive[T]): M[T[F]]

   

   Implicit information

   This member is added by an implicit conversion from FreeInstances to IdOps[FreeInstances] performed by method toIdOps in matryoshka.

   Definition Classes

   IdOps

6. def apo[T[_[_]], F[_]](f: (FreeInstances) ⇒ F[\/[T[F], FreeInstances]])(implicit arg0: Functor[F], T: Corecursive[T]): T[F]

   

   Implicit information

   This member is added by an implicit conversion from FreeInstances to IdOps[FreeInstances] performed by method toIdOps in matryoshka.

   Definition Classes

   IdOps

7. def apoM[T[_[_]], M[_], F[_]](f: (FreeInstances) ⇒ M[F[\/[T[F], FreeInstances]]])(implicit arg0: Monad[M], arg1: Traverse[F], T: Corecursive[T]): M[T[F]]

   

   Implicit information

   This member is added by an implicit conversion from FreeInstances to IdOps[FreeInstances] performed by method toIdOps in matryoshka.

   Definition Classes

   IdOps

8. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

9. def attributeAna[F[_]](ψ: (FreeInstances) ⇒ F[FreeInstances])(implicit arg0: Functor[F]): Cofree[F, FreeInstances]

   

   Implicit information

   This member is added by an implicit conversion from FreeInstances to IdOps[FreeInstances] performed by method toIdOps in matryoshka.

   Definition Classes

   IdOps

10. def attributeAnaM[M[_], F[_]](ψ: (FreeInstances) ⇒ M[F[FreeInstances]])(implicit arg0: Monad[M], arg1: Traverse[F]): M[Cofree[F, FreeInstances]]

    

    Implicit information

    This member is added by an implicit conversion from FreeInstances to IdOps[FreeInstances] performed by method toIdOps in matryoshka.

    Definition Classes

    IdOps

11. def chrono[F[_], B](g: (F[Cofree[F, B]]) ⇒ B, f: (FreeInstances) ⇒ F[Free[F, FreeInstances]])(implicit arg0: Functor[F]): B

    

    Implicit information

    This member is added by an implicit conversion from FreeInstances to IdOps[FreeInstances] performed by method toIdOps in matryoshka.

    Definition Classes

    IdOps

12. def clone(): AnyRef

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

13. def codyna[F[_], B](φ: (F[B]) ⇒ B, ψ: (FreeInstances) ⇒ F[Free[F, FreeInstances]])(implicit arg0: Functor[F]): B

    

    Implicit information

    This member is added by an implicit conversion from FreeInstances to IdOps[FreeInstances] performed by method toIdOps in matryoshka.

    Definition Classes

    IdOps

14. def codynaM[M[_], F[_], B](φ: (F[B]) ⇒ M[B], ψ: (FreeInstances) ⇒ M[F[Free[F, FreeInstances]]])(implicit arg0: Monad[M], arg1: Traverse[F]): M[B]

    

    Implicit information

    This member is added by an implicit conversion from FreeInstances to IdOps[FreeInstances] performed by method toIdOps in matryoshka.

    Definition Classes

    IdOps

15. def coelgot[F[_], B](φ: ((FreeInstances, F[B])) ⇒ B, ψ: (FreeInstances) ⇒ F[FreeInstances])(implicit arg0: Functor[F]): B

    

    Implicit information

    This member is added by an implicit conversion from FreeInstances to IdOps[FreeInstances] performed by method toIdOps in matryoshka.

    Definition Classes

    IdOps

16. def coelgotM[M[_]]: IdOps.CoelgotMPartiallyApplied[M]

    

    Implicit information

    This member is added by an implicit conversion from FreeInstances to IdOps[FreeInstances] performed by method toIdOps in matryoshka.

    Definition Classes

    IdOps

17. def dyna[F[_], B](φ: (F[Cofree[F, B]]) ⇒ B, ψ: (FreeInstances) ⇒ F[FreeInstances])(implicit arg0: Functor[F]): B

    

    Implicit information

    This member is added by an implicit conversion from FreeInstances to IdOps[FreeInstances] performed by method toIdOps in matryoshka.

    Definition Classes

    IdOps

18. def elgot[F[_], B](φ: (F[B]) ⇒ B, ψ: (FreeInstances) ⇒ \/[B, F[FreeInstances]])(implicit arg0: Functor[F]): B

    

    Implicit information

    This member is added by an implicit conversion from FreeInstances to IdOps[FreeInstances] performed by method toIdOps in matryoshka.

    Definition Classes

    IdOps

19. def elgotAna[T[_[_]], M[_], F[_]](k: DistributiveLaw[M, F], f: (FreeInstances) ⇒ M[F[FreeInstances]])(implicit arg0: Monad[M], arg1: Functor[F], T: Corecursive[T]): T[F]

    

    Implicit information

    This member is added by an implicit conversion from FreeInstances to IdOps[FreeInstances] performed by method toIdOps in matryoshka.

    Definition Classes

    IdOps

20. def elgotApo[T[_[_]], F[_]](f: (FreeInstances) ⇒ \/[T[F], F[FreeInstances]])(implicit arg0: Functor[F], T: Corecursive[T]): T[F]

    

    Implicit information

    This member is added by an implicit conversion from FreeInstances to IdOps[FreeInstances] performed by method toIdOps in matryoshka.

    Definition Classes

    IdOps

21. final def eq(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

22. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

23. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

24. def freeAna[F[_], B](ψ: (FreeInstances) ⇒ \/[B, F[FreeInstances]])(implicit arg0: Functor[F]): Free[F, B]

    

    Implicit information

    This member is added by an implicit conversion from FreeInstances to IdOps[FreeInstances] performed by method toIdOps in matryoshka.

    Definition Classes

    IdOps

25. implicit def freeCorecursive[A]: Corecursive[[α[_$1]]Free[α, A]]

    

26. implicit def freeEqual[F[_]](implicit arg0: Functor[F], F: Delay[Equal, F]): Delay[Equal, [β]Free[F, β]]

    

27. implicit def freeShow[F[_]](implicit arg0: Functor[F], F: Delay[Show, F]): Delay[Show, [β]Free[F, β]]

    

28. implicit def freeTraverseT[A]: TraverseT[[α[_$3]]Free[α, A]]

    

29. def futu[T[_[_]], F[_]](f: (FreeInstances) ⇒ F[Free[F, FreeInstances]])(implicit arg0: Functor[F], T: Corecursive[T]): T[F]

    

    Implicit information

    This member is added by an implicit conversion from FreeInstances to IdOps[FreeInstances] performed by method toIdOps in matryoshka.

    Definition Classes

    IdOps

30. def futuM[T[_[_]], M[_], F[_]](f: (FreeInstances) ⇒ M[F[Free[F, FreeInstances]]])(implicit arg0: Monad[M], arg1: Traverse[F], T: Corecursive[T]): M[T[F]]

    

    Implicit information

    This member is added by an implicit conversion from FreeInstances to IdOps[FreeInstances] performed by method toIdOps in matryoshka.

    Definition Classes

    IdOps

31. def gana[T[_[_]], M[_], F[_]](k: DistributiveLaw[M, F], f: (FreeInstances) ⇒ F[M[FreeInstances]])(implicit arg0: Monad[M], arg1: Functor[F], T: Corecursive[T]): T[F]

    

    Implicit information

    This member is added by an implicit conversion from FreeInstances to IdOps[FreeInstances] performed by method toIdOps in matryoshka.

    Definition Classes

    IdOps

32. def ganaM[T[_[_]], M[_], N[_], F[_]](k: DistributiveLaw[M, F], f: (FreeInstances) ⇒ N[F[M[FreeInstances]]])(implicit arg0: Monad[M], arg1: Traverse[M], arg2: Monad[N], arg3: Traverse[F], T: Corecursive[T]): N[T[F]]

    

    Implicit information

    This member is added by an implicit conversion from FreeInstances to IdOps[FreeInstances] performed by method toIdOps in matryoshka.

    Definition Classes

    IdOps

33. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

34. def ghylo[W[_], M[_], F[_], B](w: DistributiveLaw[F, W], m: DistributiveLaw[M, F], f: (F[W[B]]) ⇒ B, g: (FreeInstances) ⇒ F[M[FreeInstances]])(implicit arg0: Comonad[W], arg1: Monad[M], arg2: Functor[F]): B

    

    Implicit information

    This member is added by an implicit conversion from FreeInstances to IdOps[FreeInstances] performed by method toIdOps in matryoshka.

    Definition Classes

    IdOps

35. def ghyloM[W[_], M[_], N[_], F[_], B](w: DistributiveLaw[F, W], m: DistributiveLaw[M, F], f: (F[W[B]]) ⇒ N[B], g: (FreeInstances) ⇒ N[F[M[FreeInstances]]])(implicit arg0: Comonad[W], arg1: Traverse[W], arg2: Monad[M], arg3: Traverse[M], arg4: Monad[N], arg5: Traverse[F]): N[B]

    

    Implicit information

    This member is added by an implicit conversion from FreeInstances to IdOps[FreeInstances] performed by method toIdOps in matryoshka.

    Definition Classes

    IdOps

36. def gpostpro[T[_[_]], M[_], F[_]](k: DistributiveLaw[M, F], e: ~>[F, F], g: (FreeInstances) ⇒ F[M[FreeInstances]])(implicit arg0: Recursive[T], arg1: Monad[M], arg2: Functor[F], T: Corecursive[T]): T[F]

    

    Implicit information

    This member is added by an implicit conversion from FreeInstances to IdOps[FreeInstances] performed by method toIdOps in matryoshka.

    Definition Classes

    IdOps

37. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

38. def hylo[F[_], B](f: (F[B]) ⇒ B, g: (FreeInstances) ⇒ F[FreeInstances])(implicit arg0: Functor[F]): B

    

    Implicit information

    This member is added by an implicit conversion from FreeInstances to IdOps[FreeInstances] performed by method toIdOps in matryoshka.

    Definition Classes

    IdOps

39. def hyloM[M[_], F[_], B](f: (F[B]) ⇒ M[B], g: (FreeInstances) ⇒ M[F[FreeInstances]])(implicit arg0: Monad[M], arg1: Traverse[F]): M[B]

    

    Implicit information

    This member is added by an implicit conversion from FreeInstances to IdOps[FreeInstances] performed by method toIdOps in matryoshka.

    Definition Classes

    IdOps

40. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

41. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

42. final def notify(): Unit

    

    Definition Classes

    AnyRef

43. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

44. def postpro[T[_[_]], F[_]](e: ~>[F, F], g: (FreeInstances) ⇒ F[FreeInstances])(implicit arg0: Recursive[T], arg1: Functor[F], T: Corecursive[T]): T[F]

    

    Implicit information

    This member is added by an implicit conversion from FreeInstances to IdOps[FreeInstances] performed by method toIdOps in matryoshka.

    Definition Classes

    IdOps

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

    

    Definition Classes

    AnyRef

46. def toString(): String

    

    Definition Classes

    AnyRef → Any

47. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

49. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )