Class

matryoshka.instances.fixedpoint

RecListFOps

Related Doc: package fixedpoint

Permalink

implicit class RecListFOps[T[_[_]], A] extends AnyRef

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. RecListFOps
  2. AnyRef
  3. Any
Implicitly
  1. by toIdOps
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new RecListFOps(self: T[[β]ListF[A, β]])(implicit arg0: Recursive[T])

    Permalink

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecListFOps[T, A] to IdOps[RecListFOps[T, A]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

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

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecListFOps[T, A] to IdOps[RecListFOps[T, A]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

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

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecListFOps[T, A] to IdOps[RecListFOps[T, A]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

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

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecListFOps[T, A] to IdOps[RecListFOps[T, A]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  8. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  9. def attributeAna[F[_]](ψ: (RecListFOps[T, A]) ⇒ F[RecListFOps[T, A]])(implicit arg0: Functor[F]): scalaz.Cofree[F, RecListFOps[T, A]]

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecListFOps[T, A] to IdOps[RecListFOps[T, A]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

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

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecListFOps[T, A] to IdOps[RecListFOps[T, A]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

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

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecListFOps[T, A] to IdOps[RecListFOps[T, A]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  12. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecListFOps[T, A] to IdOps[RecListFOps[T, A]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

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

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecListFOps[T, A] to IdOps[RecListFOps[T, A]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

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

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecListFOps[T, A] to IdOps[RecListFOps[T, A]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

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

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecListFOps[T, A] to IdOps[RecListFOps[T, A]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

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

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecListFOps[T, A] to IdOps[RecListFOps[T, A]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

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

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecListFOps[T, A] to IdOps[RecListFOps[T, A]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

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

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecListFOps[T, A] to IdOps[RecListFOps[T, A]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

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

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecListFOps[T, A] to IdOps[RecListFOps[T, A]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

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

    Permalink
    Definition Classes
    AnyRef

  22. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  23. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

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

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecListFOps[T, A] to IdOps[RecListFOps[T, A]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  25. def futu[T[_[_]], F[_]](f: (RecListFOps[T, A]) ⇒ F[scalaz.Free[F, RecListFOps[T, A]]])(implicit arg0: Functor[F], T: Corecursive[T]): T[F]

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecListFOps[T, A] to IdOps[RecListFOps[T, A]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  26. def futuM[T[_[_]], M[_], F[_]](f: (RecListFOps[T, A]) ⇒ M[F[scalaz.Free[F, RecListFOps[T, A]]]])(implicit arg0: Monad[M], arg1: Traverse[F], T: Corecursive[T]): M[T[F]]

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecListFOps[T, A] to IdOps[RecListFOps[T, A]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

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

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecListFOps[T, A] to IdOps[RecListFOps[T, A]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

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

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecListFOps[T, A] to IdOps[RecListFOps[T, A]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

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

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecListFOps[T, A] to IdOps[RecListFOps[T, A]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

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

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecListFOps[T, A] to IdOps[RecListFOps[T, A]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

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

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecListFOps[T, A] to IdOps[RecListFOps[T, A]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  33. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  34. def headOption: Option[A]

    Permalink

  35. def hylo[F[_], B](f: (F[B]) ⇒ B, g: (RecListFOps[T, A]) ⇒ F[RecListFOps[T, A]])(implicit arg0: Functor[F]): B

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecListFOps[T, A] to IdOps[RecListFOps[T, A]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  36. def hyloM[M[_], F[_], B](f: (F[B]) ⇒ M[B], g: (RecListFOps[T, A]) ⇒ M[F[RecListFOps[T, A]]])(implicit arg0: Monad[M], arg1: Traverse[F]): M[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecListFOps[T, A] to IdOps[RecListFOps[T, A]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

  37. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    AnyRef

  39. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  40. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecListFOps[T, A] to IdOps[RecListFOps[T, A]] performed by method toIdOps in matryoshka.
    Definition Classes
    IdOps

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

    Permalink
    Definition Classes
    AnyRef

  43. def tailOption: Option[T[[β]ListF[A, β]]]

    Permalink

  44. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  45. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion toIdOps from RecListFOps[T, A] to IdOps[RecListFOps[T, A]]

Ungrouped