PartiallyApplied

Instance Constructors

new PartiallyApplied()

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
def all(p: (PartiallyApplied[T]) ⇒ Boolean)(implicit BF: Functor[F], B: Foldable[F]): Boolean

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def any(p: (PartiallyApplied[T]) ⇒ Boolean)(implicit BF: Functor[F], B: Foldable[F]): Boolean

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def apply[N[_], M[_], F[_]](k: DistributiveLaw[N, F], f: GCoalgebraM[N, M, F, A])(implicit arg0: Monad[N], arg1: Traverse[N], arg2: Monad[M], arg3: Traverse[F], T: Aux[T, F]): M[T]
final def asInstanceOf[T0]: T0

Definition Classes
Any
def attributeTopDown[A](z: A)(f: (A, F[PartiallyApplied[T]]) ⇒ A)(implicit BF: Functor[F]): Cofree[F, A]

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def attributeTopDownM[M[_], A](z: A)(f: (A, F[PartiallyApplied[T]]) ⇒ M[A])(implicit arg0: Monad[M], BT: Traverse[F]): M[Cofree[F, A]]

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def cata[A](f: Algebra[F, A])(implicit BF: Functor[F]): A

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def cataM[M[_], A](f: AlgebraM[M, F, A])(implicit arg0: Monad[M], BT: Traverse[F]): M[A]

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def children(implicit BT: Traverse[F]): List[PartiallyApplied[T]]

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def chrono[F[_], B](g: GAlgebra[[β$3$]Cofree[F, β$3$], F, B], f: GCoalgebra[[β$4$]Free[F, β$4$], F, PartiallyApplied[T]])(implicit arg0: Functor[F]): B

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to IdOps[PartiallyApplied[T]] performed by method toIdOps in matryoshka.implicits.
Definition Classes
IdOps
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def codyna[F[_], B](φ: Algebra[F, B], ψ: GCoalgebra[[β$1$]Free[F, β$1$], F, PartiallyApplied[T]])(implicit arg0: Functor[F]): B

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to IdOps[PartiallyApplied[T]] performed by method toIdOps in matryoshka.implicits.
Definition Classes
IdOps
def codynaM[M[_], F[_], B](φ: AlgebraM[M, F, B], ψ: GCoalgebraM[[β$2$]Free[F, β$2$], M, F, PartiallyApplied[T]])(implicit arg0: Monad[M], arg1: Traverse[F]): M[B]

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to IdOps[PartiallyApplied[T]] performed by method toIdOps in matryoshka.implicits.
Definition Classes
IdOps
def coelgot[F[_], B](φ: ElgotAlgebra[[β$6$](PartiallyApplied[T], β$6$), F, B], ψ: Coalgebra[F, PartiallyApplied[T]])(implicit arg0: Functor[F]): B

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to IdOps[PartiallyApplied[T]] performed by method toIdOps in matryoshka.implicits.
Definition Classes
IdOps
def colambek(implicit TR: Aux[T, FF], F: Functor[FF]): T

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to CorecursiveOps[T, PartiallyApplied, FF] performed by method CorecursiveOps in matryoshka.implicits. This conversion will take place only if an implicit value of type Aux[T, FF] is in scope and at the same time an implicit value of type <~<[PartiallyApplied[T], FF[T]] is in scope.
Definition Classes
CorecursiveOps
def collect[B](pf: PartialFunction[PartiallyApplied[T], B])(implicit BF: Functor[F], B: Foldable[F]): List[B]

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def contains(c: PartiallyApplied[T])(implicit T: Equal[PartiallyApplied[T]], BF: Functor[F], B: Foldable[F]): Boolean

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def convertTo[R](implicit R: Aux[R, F], BF: Functor[F]): R

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def dyna[F[_], B](φ: GAlgebra[[β$0$]Cofree[F, β$0$], F, B], ψ: Coalgebra[F, PartiallyApplied[T]])(implicit arg0: Functor[F]): B

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to IdOps[PartiallyApplied[T]] performed by method toIdOps in matryoshka.implicits.
Definition Classes
IdOps
def elgot[F[_], B](φ: Algebra[F, B], ψ: ElgotCoalgebra[[β$5$]\/[B, β$5$], F, PartiallyApplied[T]])(implicit arg0: Functor[F]): B

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to IdOps[PartiallyApplied[T]] performed by method toIdOps in matryoshka.implicits.
Definition Classes
IdOps
def elgotCata[W[_], A](k: DistributiveLaw[F, W], g: ElgotAlgebra[W, F, A])(implicit arg0: Comonad[W], BF: Functor[F]): A

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def elgotHisto[A](f: ElgotAlgebra[[β$35$]Cofree[F, β$35$], F, A])(implicit BF: Functor[F]): A

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def elgotPara[A](f: ElgotAlgebra[[β$25$](PartiallyApplied[T], β$25$), F, A])(implicit BF: Functor[F]): A

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def elgotZygo[A, B](f: Algebra[F, B], g: ElgotAlgebra[[β$29$](B, β$29$), F, A])(implicit BF: Functor[F]): A

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def embed(implicit F: Functor[FF]): T

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to CorecursiveOps[T, PartiallyApplied, FF] performed by method CorecursiveOps in matryoshka.implicits. This conversion will take place only if an implicit value of type Aux[T, FF] is in scope and at the same time an implicit value of type <~<[PartiallyApplied[T], FF[T]] is in scope.
Definition Classes
CorecursiveOps
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 foldMap[Z](f: (PartiallyApplied[T]) ⇒ Z)(implicit arg0: Monoid[Z], BF: Functor[F], B: Foldable[F]): Z

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def foldMapM[M[_], Z](f: (PartiallyApplied[T]) ⇒ M[Z])(implicit arg0: Monad[M], arg1: Monoid[Z], BF: Functor[F], B: Foldable[F]): M[Z]

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def futuM[T, M[_], F[_]](f: GCoalgebraM[[β$12$]Free[F, β$12$], M, F, PartiallyApplied[T]])(implicit arg0: Monad[M], arg1: Traverse[F], T: Aux[T, F]): M[T]

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to IdOps[PartiallyApplied[T]] performed by method toIdOps in matryoshka.implicits.
Definition Classes
IdOps
def gElgotZygo[W[_], A, B](f: Algebra[F, B], w: DistributiveLaw[F, W], g: ElgotAlgebra[[γ$31$]EnvT[B, W, γ$31$], F, A])(implicit arg0: Comonad[W], BF: Functor[F]): A

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def gcata[W[_], A](k: DistributiveLaw[F, W], g: GAlgebra[W, F, A])(implicit arg0: Comonad[W], BF: Functor[F]): A

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def gcataM[W[_], M[_], A](k: DistributiveLaw[F, W], g: GAlgebraM[W, M, F, A])(implicit arg0: Comonad[W], arg1: Traverse[W], arg2: Monad[M], BT: Traverse[F]): M[A]

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def ghisto[H[_], A](g: DistributiveLaw[F, H], f: GAlgebra[[β$36$]Cofree[H, β$36$], F, A])(implicit arg0: Functor[H], BF: Functor[F]): A

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def ghyloM[W[_], N[_], M[_], F[_], B](w: DistributiveLaw[F, W], n: DistributiveLaw[N, F], f: GAlgebraM[W, M, F, B], g: GCoalgebraM[N, M, F, PartiallyApplied[T]])(implicit arg0: Comonad[W], arg1: Traverse[W], arg2: Monad[N], arg3: Traverse[N], arg4: Monad[M], arg5: Traverse[F]): M[B]

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to IdOps[PartiallyApplied[T]] performed by method toIdOps in matryoshka.implicits.
Definition Classes
IdOps
def gpara[W[_], A](e: DistributiveLaw[F, W], f: GAlgebra[[γ$27$]EnvT[PartiallyApplied[T], W, γ$27$], F, A])(implicit arg0: Comonad[W], T: Aux[PartiallyApplied[T], F], BF: Functor[F]): A

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def gprepro[W[_], A](k: DistributiveLaw[F, W], e: ~>[F, F], f: GAlgebra[W, F, A])(implicit arg0: Comonad[W], T: Aux[PartiallyApplied[T], F], BF: Functor[F]): A

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def gzygo[W[_], A, B](f: Algebra[F, B], w: DistributiveLaw[F, W], g: GAlgebra[[γ$30$]EnvT[B, W, γ$30$], F, A])(implicit arg0: Comonad[W], BF: Functor[F]): A

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def hashCode(): Int

Definition Classes
AnyRef → Any
def histo[A](f: GAlgebra[[β$34$]Cofree[F, β$34$], F, A])(implicit BF: Functor[F]): A

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def hylo[F[_], B](f: Algebra[F, B], g: Coalgebra[F, PartiallyApplied[T]])(implicit arg0: Functor[F]): B

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to IdOps[PartiallyApplied[T]] performed by method toIdOps in matryoshka.implicits.
Definition Classes
IdOps
def hyloM[M[_], F[_], B](f: AlgebraM[M, F, B], g: CoalgebraM[M, F, PartiallyApplied[T]])(implicit arg0: Monad[M], arg1: Traverse[F]): M[B]

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to IdOps[PartiallyApplied[T]] performed by method toIdOps in matryoshka.implicits.
Definition Classes
IdOps
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isLeaf(implicit BT: Traverse[F]): Boolean

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def lambek(implicit T: Aux[PartiallyApplied[T], F], BF: Functor[F]): F[PartiallyApplied[T]]

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def mapR[U, G[_]](f: (F[PartiallyApplied[T]]) ⇒ G[U])(implicit arg0: Functor[G], U: Aux[U, G], BF: Functor[F]): U

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def merge[B](fb: ⇒ PartiallyApplied[B]): Option[PartiallyApplied[(T, B)]]

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied, T] performed by method toMergeOps in matryoshka.Merge.ToMergeOps. This conversion will take place only if an implicit value of type Merge[PartiallyApplied] is in scope.
Definition Classes
Ops
def mergeWith[B, C, D](fb: ⇒ PartiallyApplied[B])(g: (T, B) ⇒ D)(implicit F: Functor[PartiallyApplied]): Option[PartiallyApplied[D]]

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied, T] performed by method toMergeOps in matryoshka.Merge.ToMergeOps. This conversion will take place only if an implicit value of type Merge[PartiallyApplied] is in scope.
Definition Classes
Ops
def mutu[A, B](f: GAlgebra[[β$32$](A, β$32$), F, B], g: GAlgebra[[β$33$](B, β$33$), F, A])(implicit BF: Functor[F]): A

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def para[A](f: GAlgebra[[β$24$](PartiallyApplied[T], β$24$), F, A])(implicit BF: Functor[F]): A

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def paraM[M[_], A](f: GAlgebraM[[β$26$](PartiallyApplied[T], β$26$), M, F, A])(implicit arg0: Monad[M], BT: Traverse[F]): M[A]

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def paraMerga[A](that: PartiallyApplied[T])(f: (PartiallyApplied[T], PartiallyApplied[T], Option[F[A]]) ⇒ A)(implicit BF: Functor[F], BM: Merge[F]): A

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def paraZygo[A, B](f: GAlgebra[[β$37$](PartiallyApplied[T], β$37$), F, B], g: GAlgebra[[β$38$](B, β$38$), F, A])(implicit BF: Functor[F], BU: Unzip[F]): A

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def prepro[A](e: ~>[F, F], f: Algebra[F, A])(implicit T: Aux[PartiallyApplied[T], F], BF: Functor[F]): A

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def project(implicit BF: Functor[F]): F[PartiallyApplied[T]]

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
def topDownCata[A](a: A)(f: (A, PartiallyApplied[T]) ⇒ (A, PartiallyApplied[T]))(implicit T: Aux[PartiallyApplied[T], F], BF: Functor[F]): PartiallyApplied[T]

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def topDownCataM[M[_], A](a: A)(f: (A, PartiallyApplied[T]) ⇒ M[(A, PartiallyApplied[T])])(implicit arg0: Monad[M], T: Aux[PartiallyApplied[T], F], BT: Traverse[F]): M[PartiallyApplied[T]]

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def transAnaM[M[_], U, G[_]](f: TransformM[M, PartiallyApplied[T], F, G])(implicit arg0: Monad[M], arg1: Traverse[G], U: Aux[U, G], BF: Functor[F]): M[U]

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def transAnaT(f: (PartiallyApplied[T]) ⇒ PartiallyApplied[T])(implicit T: Aux[PartiallyApplied[T], F], BF: Functor[F]): PartiallyApplied[T]

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def transAnaTM[M[_]](f: (PartiallyApplied[T]) ⇒ M[PartiallyApplied[T]])(implicit arg0: Monad[M], T: Aux[PartiallyApplied[T], F], BF: Traverse[F]): M[PartiallyApplied[T]]

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def transApo[U, G[_]](f: CoalgebraicGTransform[[β$40$]\/[U, β$40$], PartiallyApplied[T], F, G])(implicit arg0: Functor[G], U: Aux[U, G], BF: Functor[F]): U

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def transApoT(f: (PartiallyApplied[T]) ⇒ \/[PartiallyApplied[T], PartiallyApplied[T]])(implicit T: Aux[PartiallyApplied[T], F], BF: Functor[F]): PartiallyApplied[T]

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def transCataM[M[_], U, G[_]](f: TransformM[M, U, F, G])(implicit arg0: Monad[M], arg1: Functor[G], U: Aux[U, G], BT: Traverse[F]): M[U]

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def transCataT(f: (PartiallyApplied[T]) ⇒ PartiallyApplied[T])(implicit T: Aux[PartiallyApplied[T], F], BF: Functor[F]): PartiallyApplied[T]

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def transCataTM[M[_]](f: (PartiallyApplied[T]) ⇒ M[PartiallyApplied[T]])(implicit arg0: Monad[M], T: Aux[PartiallyApplied[T], F], BF: Traverse[F]): M[PartiallyApplied[T]]

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def transHylo[G[_], U, H[_]](φ: (G[U]) ⇒ H[U], ψ: (F[PartiallyApplied[T]]) ⇒ G[PartiallyApplied[T]])(implicit arg0: Functor[G], arg1: Functor[H], U: Aux[U, H], BF: Functor[F]): U

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def transParaT(f: ((PartiallyApplied[T], PartiallyApplied[T])) ⇒ PartiallyApplied[T])(implicit T: Aux[PartiallyApplied[T], F], BF: Functor[F]): PartiallyApplied[T]

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def traverseR[M[_], U, G[_]](f: (F[PartiallyApplied[T]]) ⇒ M[G[U]])(implicit arg0: Functor[M], arg1: Functor[G], U: Aux[U, G], BF: Functor[F]): M[U]

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
def universe(implicit BT: Traverse[F]): List[PartiallyApplied[T]]

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops
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
@throws( ... )
def zygo[A, B](f: Algebra[F, B], g: GAlgebra[[β$28$](B, β$28$), F, A])(implicit BF: Functor[F]): A

Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Definition Classes
Ops

Shadowed Implicit Value Members

def self: PartiallyApplied[T]
Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Shadowing
This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
To access this member you can use a type ascription:
(partiallyApplied: Ops[PartiallyApplied[T], F]).self
Definition Classes
Ops
def self: PartiallyApplied[T]
Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied, T] performed by method toMergeOps in matryoshka.Merge.ToMergeOps. This conversion will take place only if an implicit value of type Merge[PartiallyApplied] is in scope.
Shadowing
This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
To access this member you can use a type ascription:
(partiallyApplied: Ops[PartiallyApplied, T]).self
Definition Classes
Ops
def self: PartiallyApplied[T]
Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toBirecursiveOps in matryoshka.Birecursive.ToBirecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Shadowing
This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
To access this member you can use a type ascription:
(partiallyApplied: Ops[PartiallyApplied[T], F]).self
Definition Classes
Ops
def typeClassInstance: Aux[PartiallyApplied[T], F]
Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Shadowing
This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
To access this member you can use a type ascription:
(partiallyApplied: Ops[PartiallyApplied[T], F]).typeClassInstance
Definition Classes
Ops
def typeClassInstance: Aux[PartiallyApplied[T], F]
Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied[T], F] performed by method toBirecursiveOps in matryoshka.Birecursive.ToBirecursiveOps. This conversion will take place only if an implicit value of type Aux[PartiallyApplied[T], F] is in scope.
Shadowing
This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
To access this member you can use a type ascription:
(partiallyApplied: Ops[PartiallyApplied[T], F]).typeClassInstance
Definition Classes
Ops
val typeClassInstance: Merge[PartiallyApplied]
Implicit information
This member is added by an implicit conversion from PartiallyApplied[T] to Ops[PartiallyApplied, T] performed by method toMergeOps in matryoshka.Merge.ToMergeOps. This conversion will take place only if an implicit value of type Merge[PartiallyApplied] is in scope.
Shadowing
This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
To access this member you can use a type ascription:
(partiallyApplied: Ops[PartiallyApplied, T]).typeClassInstance
Definition Classes
Ops

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion toRecursiveOps from PartiallyApplied[T] to Ops[PartiallyApplied[T], F]

Inherited by implicit conversion toMergeOps from PartiallyApplied[T] to Ops[PartiallyApplied, T]

Inherited by implicit conversion toBirecursiveOps from PartiallyApplied[T] to Ops[PartiallyApplied[T], F]

Inherited by implicit conversion CorecursiveOps from PartiallyApplied[T] to CorecursiveOps[T, PartiallyApplied, FF]

Inherited by implicit conversion toIdOps from PartiallyApplied[T] to IdOps[PartiallyApplied[T]]

Ungrouped

Related Doc: package ganaM

final class PartiallyApplied[T] extends AnyRef

Instance Constructors

new PartiallyApplied()

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def all(p: (PartiallyApplied[T]) ⇒ Boolean)(implicit BF: Functor[F], B: Foldable[F]): Boolean

def any(p: (PartiallyApplied[T]) ⇒ Boolean)(implicit BF: Functor[F], B: Foldable[F]): Boolean

def apply[N[_], M[_], F[_]](k: DistributiveLaw[N, F], f: GCoalgebraM[N, M, F, A])(implicit arg0: Monad[N], arg1: Traverse[N], arg2: Monad[M], arg3: Traverse[F], T: Aux[T, F]): M[T]

final def asInstanceOf[T0]: T0

def attributeTopDown[A](z: A)(f: (A, F[PartiallyApplied[T]]) ⇒ A)(implicit BF: Functor[F]): Cofree[F, A]

def attributeTopDownM[M[_], A](z: A)(f: (A, F[PartiallyApplied[T]]) ⇒ M[A])(implicit arg0: Monad[M], BT: Traverse[F]): M[Cofree[F, A]]

def cata[A](f: Algebra[F, A])(implicit BF: Functor[F]): A

def cataM[M[_], A](f: AlgebraM[M, F, A])(implicit arg0: Monad[M], BT: Traverse[F]): M[A]

def children(implicit BT: Traverse[F]): List[PartiallyApplied[T]]

def chrono[F[_], B](g: GAlgebra[[β$3$]Cofree[F, β$3$], F, B], f: GCoalgebra[[β$4$]Free[F, β$4$], F, PartiallyApplied[T]])(implicit arg0: Functor[F]): B

def clone(): AnyRef

def codyna[F[_], B](φ: Algebra[F, B], ψ: GCoalgebra[[β$1$]Free[F, β$1$], F, PartiallyApplied[T]])(implicit arg0: Functor[F]): B

def codynaM[M[_], F[_], B](φ: AlgebraM[M, F, B], ψ: GCoalgebraM[[β$2$]Free[F, β$2$], M, F, PartiallyApplied[T]])(implicit arg0: Monad[M], arg1: Traverse[F]): M[B]

def coelgot[F[_], B](φ: ElgotAlgebra[[β$6$](PartiallyApplied[T], β$6$), F, B], ψ: Coalgebra[F, PartiallyApplied[T]])(implicit arg0: Functor[F]): B

def colambek(implicit TR: Aux[T, FF], F: Functor[FF]): T

def collect[B](pf: PartialFunction[PartiallyApplied[T], B])(implicit BF: Functor[F], B: Foldable[F]): List[B]

def contains(c: PartiallyApplied[T])(implicit T: Equal[PartiallyApplied[T]], BF: Functor[F], B: Foldable[F]): Boolean

def convertTo[R](implicit R: Aux[R, F], BF: Functor[F]): R

def dyna[F[_], B](φ: GAlgebra[[β$0$]Cofree[F, β$0$], F, B], ψ: Coalgebra[F, PartiallyApplied[T]])(implicit arg0: Functor[F]): B

def elgot[F[_], B](φ: Algebra[F, B], ψ: ElgotCoalgebra[[β$5$]\/[B, β$5$], F, PartiallyApplied[T]])(implicit arg0: Functor[F]): B

def elgotCata[W[_], A](k: DistributiveLaw[F, W], g: ElgotAlgebra[W, F, A])(implicit arg0: Comonad[W], BF: Functor[F]): A

def elgotHisto[A](f: ElgotAlgebra[[β$35$]Cofree[F, β$35$], F, A])(implicit BF: Functor[F]): A

def elgotPara[A](f: ElgotAlgebra[[β$25$](PartiallyApplied[T], β$25$), F, A])(implicit BF: Functor[F]): A

def elgotZygo[A, B](f: Algebra[F, B], g: ElgotAlgebra[[β$29$](B, β$29$), F, A])(implicit BF: Functor[F]): A

def embed(implicit F: Functor[FF]): T

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def foldMap[Z](f: (PartiallyApplied[T]) ⇒ Z)(implicit arg0: Monoid[Z], BF: Functor[F], B: Foldable[F]): Z

def foldMapM[M[_], Z](f: (PartiallyApplied[T]) ⇒ M[Z])(implicit arg0: Monad[M], arg1: Monoid[Z], BF: Functor[F], B: Foldable[F]): M[Z]

def futuM[T, M[_], F[_]](f: GCoalgebraM[[β$12$]Free[F, β$12$], M, F, PartiallyApplied[T]])(implicit arg0: Monad[M], arg1: Traverse[F], T: Aux[T, F]): M[T]

def gElgotZygo[W[_], A, B](f: Algebra[F, B], w: DistributiveLaw[F, W], g: ElgotAlgebra[[γ$31$]EnvT[B, W, γ$31$], F, A])(implicit arg0: Comonad[W], BF: Functor[F]): A

def gcata[W[_], A](k: DistributiveLaw[F, W], g: GAlgebra[W, F, A])(implicit arg0: Comonad[W], BF: Functor[F]): A

def gcataM[W[_], M[_], A](k: DistributiveLaw[F, W], g: GAlgebraM[W, M, F, A])(implicit arg0: Comonad[W], arg1: Traverse[W], arg2: Monad[M], BT: Traverse[F]): M[A]

final def getClass(): Class[_]

def ghisto[H[_], A](g: DistributiveLaw[F, H], f: GAlgebra[[β$36$]Cofree[H, β$36$], F, A])(implicit arg0: Functor[H], BF: Functor[F]): A

def ghyloM[W[_], N[_], M[_], F[_], B](w: DistributiveLaw[F, W], n: DistributiveLaw[N, F], f: GAlgebraM[W, M, F, B], g: GCoalgebraM[N, M, F, PartiallyApplied[T]])(implicit arg0: Comonad[W], arg1: Traverse[W], arg2: Monad[N], arg3: Traverse[N], arg4: Monad[M], arg5: Traverse[F]): M[B]

def gpara[W[_], A](e: DistributiveLaw[F, W], f: GAlgebra[[γ$27$]EnvT[PartiallyApplied[T], W, γ$27$], F, A])(implicit arg0: Comonad[W], T: Aux[PartiallyApplied[T], F], BF: Functor[F]): A

def gprepro[W[_], A](k: DistributiveLaw[F, W], e: ~>[F, F], f: GAlgebra[W, F, A])(implicit arg0: Comonad[W], T: Aux[PartiallyApplied[T], F], BF: Functor[F]): A

def gzygo[W[_], A, B](f: Algebra[F, B], w: DistributiveLaw[F, W], g: GAlgebra[[γ$30$]EnvT[B, W, γ$30$], F, A])(implicit arg0: Comonad[W], BF: Functor[F]): A

def hashCode(): Int

def histo[A](f: GAlgebra[[β$34$]Cofree[F, β$34$], F, A])(implicit BF: Functor[F]): A

def hylo[F[_], B](f: Algebra[F, B], g: Coalgebra[F, PartiallyApplied[T]])(implicit arg0: Functor[F]): B

def hyloM[M[_], F[_], B](f: AlgebraM[M, F, B], g: CoalgebraM[M, F, PartiallyApplied[T]])(implicit arg0: Monad[M], arg1: Traverse[F]): M[B]

final def isInstanceOf[T0]: Boolean

def isLeaf(implicit BT: Traverse[F]): Boolean

def lambek(implicit T: Aux[PartiallyApplied[T], F], BF: Functor[F]): F[PartiallyApplied[T]]

def mapR[U, G[_]](f: (F[PartiallyApplied[T]]) ⇒ G[U])(implicit arg0: Functor[G], U: Aux[U, G], BF: Functor[F]): U

def merge[B](fb: ⇒ PartiallyApplied[B]): Option[PartiallyApplied[(T, B)]]

def mergeWith[B, C, D](fb: ⇒ PartiallyApplied[B])(g: (T, B) ⇒ D)(implicit F: Functor[PartiallyApplied]): Option[PartiallyApplied[D]]

def mutu[A, B](f: GAlgebra[[β$32$](A, β$32$), F, B], g: GAlgebra[[β$33$](B, β$33$), F, A])(implicit BF: Functor[F]): A

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def para[A](f: GAlgebra[[β$24$](PartiallyApplied[T], β$24$), F, A])(implicit BF: Functor[F]): A

def paraM[M[_], A](f: GAlgebraM[[β$26$](PartiallyApplied[T], β$26$), M, F, A])(implicit arg0: Monad[M], BT: Traverse[F]): M[A]

def paraMerga[A](that: PartiallyApplied[T])(f: (PartiallyApplied[T], PartiallyApplied[T], Option[F[A]]) ⇒ A)(implicit BF: Functor[F], BM: Merge[F]): A

def paraZygo[A, B](f: GAlgebra[[β$37$](PartiallyApplied[T], β$37$), F, B], g: GAlgebra[[β$38$](B, β$38$), F, A])(implicit BF: Functor[F], BU: Unzip[F]): A

def prepro[A](e: ~>[F, F], f: Algebra[F, A])(implicit T: Aux[PartiallyApplied[T], F], BF: Functor[F]): A

def project(implicit BF: Functor[F]): F[PartiallyApplied[T]]

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

def toString(): String

def topDownCata[A](a: A)(f: (A, PartiallyApplied[T]) ⇒ (A, PartiallyApplied[T]))(implicit T: Aux[PartiallyApplied[T], F], BF: Functor[F]): PartiallyApplied[T]

def topDownCataM[M[_], A](a: A)(f: (A, PartiallyApplied[T]) ⇒ M[(A, PartiallyApplied[T])])(implicit arg0: Monad[M], T: Aux[PartiallyApplied[T], F], BT: Traverse[F]): M[PartiallyApplied[T]]

def transAnaM[M[_], U, G[_]](f: TransformM[M, PartiallyApplied[T], F, G])(implicit arg0: Monad[M], arg1: Traverse[G], U: Aux[U, G], BF: Functor[F]): M[U]

def transAnaT(f: (PartiallyApplied[T]) ⇒ PartiallyApplied[T])(implicit T: Aux[PartiallyApplied[T], F], BF: Functor[F]): PartiallyApplied[T]

def transAnaTM[M[_]](f: (PartiallyApplied[T]) ⇒ M[PartiallyApplied[T]])(implicit arg0: Monad[M], T: Aux[PartiallyApplied[T], F], BF: Traverse[F]): M[PartiallyApplied[T]]

def transApo[U, G[_]](f: CoalgebraicGTransform[[β$40$]\/[U, β$40$], PartiallyApplied[T], F, G])(implicit arg0: Functor[G], U: Aux[U, G], BF: Functor[F]): U

def transApoT(f: (PartiallyApplied[T]) ⇒ \/[PartiallyApplied[T], PartiallyApplied[T]])(implicit T: Aux[PartiallyApplied[T], F], BF: Functor[F]): PartiallyApplied[T]

def transCataM[M[_], U, G[_]](f: TransformM[M, U, F, G])(implicit arg0: Monad[M], arg1: Functor[G], U: Aux[U, G], BT: Traverse[F]): M[U]

def transCataT(f: (PartiallyApplied[T]) ⇒ PartiallyApplied[T])(implicit T: Aux[PartiallyApplied[T], F], BF: Functor[F]): PartiallyApplied[T]