Ops

Abstract Value Members

abstract def self: T[B]
abstract val typeClassInstance: TraverseT[T]

Concrete 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 ana[T[_[_]], F[_]](f: (Ops[T, B]) ⇒ F[Ops[T, B]])(implicit arg0: Functor[F], T: Corecursive[T]): T[F]

Implicit information
This member is added by an implicit conversion from Ops[T, B] to IdOps[Ops[T, B]] performed by method toIdOps in matryoshka.
Definition Classes
IdOps
def anaM[T[_[_]], M[_], F[_]](f: (Ops[T, B]) ⇒ M[F[Ops[T, B]]])(implicit arg0: Monad[M], arg1: Traverse[F], T: Corecursive[T]): M[T[F]]

Implicit information
This member is added by an implicit conversion from Ops[T, B] to IdOps[Ops[T, B]] performed by method toIdOps in matryoshka.
Definition Classes
IdOps
def apo[T[_[_]], F[_]](f: (Ops[T, B]) ⇒ F[\/[T[F], Ops[T, B]]])(implicit arg0: Functor[F], T: Corecursive[T]): T[F]

Implicit information
This member is added by an implicit conversion from Ops[T, B] to IdOps[Ops[T, B]] performed by method toIdOps in matryoshka.
Definition Classes
IdOps
def apoM[T[_[_]], M[_], F[_]](f: (Ops[T, B]) ⇒ M[F[\/[T[F], Ops[T, B]]]])(implicit arg0: Monad[M], arg1: Traverse[F], T: Corecursive[T]): M[T[F]]

Implicit information
This member is added by an implicit conversion from Ops[T, B] to IdOps[Ops[T, B]] performed by method toIdOps in matryoshka.
Definition Classes
IdOps
final def asInstanceOf[T0]: T0

Definition Classes
Any
def attributeAna[F[_]](ψ: (Ops[T, B]) ⇒ F[Ops[T, B]])(implicit arg0: Functor[F]): Cofree[F, Ops[T, B]]

Implicit information
This member is added by an implicit conversion from Ops[T, B] to IdOps[Ops[T, B]] performed by method toIdOps in matryoshka.
Definition Classes
IdOps
def attributeAnaM[M[_], F[_]](ψ: (Ops[T, B]) ⇒ M[F[Ops[T, B]]])(implicit arg0: Monad[M], arg1: Traverse[F]): M[Cofree[F, Ops[T, B]]]

Implicit information
This member is added by an implicit conversion from Ops[T, B] to IdOps[Ops[T, B]] performed by method toIdOps in matryoshka.
Definition Classes
IdOps
def chrono[F[_], B](g: (F[Cofree[F, B]]) ⇒ B, f: (Ops[T, B]) ⇒ F[Free[F, Ops[T, B]]])(implicit arg0: Functor[F]): B

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

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def codyna[F[_], B](φ: (F[B]) ⇒ B, ψ: (Ops[T, B]) ⇒ F[Free[F, Ops[T, B]]])(implicit arg0: Functor[F]): B

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

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

Implicit information
This member is added by an implicit conversion from Ops[T, B] to IdOps[Ops[T, B]] performed by method toIdOps in matryoshka.
Definition Classes
IdOps
def coelgotM[M[_]]: IdOps.CoelgotMPartiallyApplied[M]

Implicit information
This member is added by an implicit conversion from Ops[T, B] to IdOps[Ops[T, B]] performed by method toIdOps in matryoshka.
Definition Classes
IdOps
def dyna[F[_], B](φ: (F[Cofree[F, B]]) ⇒ B, ψ: (Ops[T, B]) ⇒ F[Ops[T, B]])(implicit arg0: Functor[F]): B

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

Implicit information
This member is added by an implicit conversion from Ops[T, B] to IdOps[Ops[T, B]] performed by method toIdOps in matryoshka.
Definition Classes
IdOps
def elgotAna[T[_[_]], M[_], F[_]](k: DistributiveLaw[M, F], f: (Ops[T, B]) ⇒ M[F[Ops[T, B]]])(implicit arg0: Monad[M], arg1: Functor[F], T: Corecursive[T]): T[F]

Implicit information
This member is added by an implicit conversion from Ops[T, B] to IdOps[Ops[T, B]] performed by method toIdOps in matryoshka.
Definition Classes
IdOps
def elgotApo[T[_[_]], F[_]](f: (Ops[T, B]) ⇒ \/[T[F], F[Ops[T, B]]])(implicit arg0: Functor[F], T: Corecursive[T]): T[F]

Implicit information
This member is added by an implicit conversion from Ops[T, B] to IdOps[Ops[T, B]] performed by method toIdOps in matryoshka.
Definition Classes
IdOps
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 freeAna[F[_], B](ψ: (Ops[T, B]) ⇒ \/[B, F[Ops[T, B]]])(implicit arg0: Functor[F]): Free[F, B]

Implicit information
This member is added by an implicit conversion from Ops[T, B] to IdOps[Ops[T, B]] performed by method toIdOps in matryoshka.
Definition Classes
IdOps
def futu[T[_[_]], F[_]](f: (Ops[T, B]) ⇒ F[Free[F, Ops[T, B]]])(implicit arg0: Functor[F], T: Corecursive[T]): T[F]

Implicit information
This member is added by an implicit conversion from Ops[T, B] to IdOps[Ops[T, B]] performed by method toIdOps in matryoshka.
Definition Classes
IdOps
def futuM[T[_[_]], M[_], F[_]](f: (Ops[T, B]) ⇒ M[F[Free[F, Ops[T, B]]]])(implicit arg0: Monad[M], arg1: Traverse[F], T: Corecursive[T]): M[T[F]]

Implicit information
This member is added by an implicit conversion from Ops[T, B] to IdOps[Ops[T, B]] performed by method toIdOps in matryoshka.
Definition Classes
IdOps
def gana[T[_[_]], M[_], F[_]](k: DistributiveLaw[M, F], f: (Ops[T, B]) ⇒ F[M[Ops[T, B]]])(implicit arg0: Monad[M], arg1: Functor[F], T: Corecursive[T]): T[F]

Implicit information
This member is added by an implicit conversion from Ops[T, B] to IdOps[Ops[T, B]] performed by method toIdOps in matryoshka.
Definition Classes
IdOps
def ganaM[T[_[_]], M[_], N[_], F[_]](k: DistributiveLaw[M, F], f: (Ops[T, B]) ⇒ N[F[M[Ops[T, B]]]])(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 Ops[T, B] to IdOps[Ops[T, B]] performed by method toIdOps in matryoshka.
Definition Classes
IdOps
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def ghylo[W[_], M[_], F[_], B](w: DistributiveLaw[F, W], m: DistributiveLaw[M, F], f: (F[W[B]]) ⇒ B, g: (Ops[T, B]) ⇒ F[M[Ops[T, B]]])(implicit arg0: Comonad[W], arg1: Monad[M], arg2: Functor[F]): B

Implicit information
This member is added by an implicit conversion from Ops[T, B] to IdOps[Ops[T, B]] performed by method toIdOps in matryoshka.
Definition Classes
IdOps
def ghyloM[W[_], M[_], N[_], F[_], B](w: DistributiveLaw[F, W], m: DistributiveLaw[M, F], f: (F[W[B]]) ⇒ N[B], g: (Ops[T, B]) ⇒ N[F[M[Ops[T, B]]]])(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 Ops[T, B] to IdOps[Ops[T, B]] performed by method toIdOps in matryoshka.
Definition Classes
IdOps
def gpostpro[T[_[_]], M[_], F[_]](k: DistributiveLaw[M, F], e: ~>[F, F], g: (Ops[T, B]) ⇒ F[M[Ops[T, B]]])(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 Ops[T, B] to IdOps[Ops[T, B]] performed by method toIdOps in matryoshka.
Definition Classes
IdOps
def hashCode(): Int

Definition Classes
AnyRef → Any
def hylo[F[_], B](f: (F[B]) ⇒ B, g: (Ops[T, B]) ⇒ F[Ops[T, B]])(implicit arg0: Functor[F]): B

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

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

Definition Classes
Any
def map[G[_]](f: (B[T[B]]) ⇒ G[T[G]])(implicit arg0: Functor[B], arg1: Functor[G]): scalaz.Scalaz.Id[T[G]]
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def postpro[T[_[_]], F[_]](e: ~>[F, F], g: (Ops[T, B]) ⇒ F[Ops[T, B]])(implicit arg0: Recursive[T], arg1: Functor[F], T: Corecursive[T]): T[F]

Implicit information
This member is added by an implicit conversion from Ops[T, B] to IdOps[Ops[T, B]] performed by method toIdOps in matryoshka.
Definition Classes
IdOps
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
def topDownCataM[M[_], A](a: A)(f: (A, T[B]) ⇒ M[(A, T[B])])(implicit arg0: Traverse[B], arg1: Monad[M]): M[T[B]]
def transAnaM[M[_], G[_]](f: (B[T[B]]) ⇒ M[G[T[B]]])(implicit arg0: Monad[M], arg1: Functor[B], arg2: Traverse[G]): M[T[G]]
def transAnaTM[M[_]](f: (T[B]) ⇒ M[T[B]])(implicit arg0: Traverse[B], arg1: Monad[M]): M[T[B]]
def transCataM[M[_], G[_]](f: (B[T[G]]) ⇒ M[G[T[G]]])(implicit arg0: Monad[M], arg1: Traverse[B], arg2: Functor[G]): M[T[G]]
def transCataTM[M[_]](f: (T[B]) ⇒ M[T[B]])(implicit arg0: Traverse[B], arg1: Monad[M]): M[T[B]]
def traverse[M[_], G[_]](f: (B[T[B]]) ⇒ M[G[T[G]]])(implicit arg0: Applicative[M], arg1: Functor[B], arg2: Functor[G]): M[T[G]]
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( ... )

Related Doc: package TraverseT

trait Ops[T[_[_]], B[_]] extends AnyRef

Abstract Value Members

abstract def self: T[B]

abstract val typeClassInstance: TraverseT[T]

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def ana[T[_[_]], F[_]](f: (Ops[T, B]) ⇒ F[Ops[T, B]])(implicit arg0: Functor[F], T: Corecursive[T]): T[F]

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

def apo[T[_[_]], F[_]](f: (Ops[T, B]) ⇒ F[\/[T[F], Ops[T, B]]])(implicit arg0: Functor[F], T: Corecursive[T]): T[F]

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

final def asInstanceOf[T0]: T0

def attributeAna[F[_]](ψ: (Ops[T, B]) ⇒ F[Ops[T, B]])(implicit arg0: Functor[F]): Cofree[F, Ops[T, B]]

def attributeAnaM[M[_], F[_]](ψ: (Ops[T, B]) ⇒ M[F[Ops[T, B]]])(implicit arg0: Monad[M], arg1: Traverse[F]): M[Cofree[F, Ops[T, B]]]

def chrono[F[_], B](g: (F[Cofree[F, B]]) ⇒ B, f: (Ops[T, B]) ⇒ F[Free[F, Ops[T, B]]])(implicit arg0: Functor[F]): B

def clone(): AnyRef

def codyna[F[_], B](φ: (F[B]) ⇒ B, ψ: (Ops[T, B]) ⇒ F[Free[F, Ops[T, B]]])(implicit arg0: Functor[F]): B

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

def coelgot[F[_], B](φ: ((Ops[T, B], F[B])) ⇒ B, ψ: (Ops[T, B]) ⇒ F[Ops[T, B]])(implicit arg0: Functor[F]): B

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

def dyna[F[_], B](φ: (F[Cofree[F, B]]) ⇒ B, ψ: (Ops[T, B]) ⇒ F[Ops[T, B]])(implicit arg0: Functor[F]): B

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

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

def elgotApo[T[_[_]], F[_]](f: (Ops[T, B]) ⇒ \/[T[F], F[Ops[T, B]]])(implicit arg0: Functor[F], T: Corecursive[T]): T[F]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def freeAna[F[_], B](ψ: (Ops[T, B]) ⇒ \/[B, F[Ops[T, B]]])(implicit arg0: Functor[F]): Free[F, B]

def futu[T[_[_]], F[_]](f: (Ops[T, B]) ⇒ F[Free[F, Ops[T, B]]])(implicit arg0: Functor[F], T: Corecursive[T]): T[F]

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

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

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

final def getClass(): Class[_]

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

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

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

def hashCode(): Int

def hylo[F[_], B](f: (F[B]) ⇒ B, g: (Ops[T, B]) ⇒ F[Ops[T, B]])(implicit arg0: Functor[F]): B

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

final def isInstanceOf[T0]: Boolean

def map[G[_]](f: (B[T[B]]) ⇒ G[T[G]])(implicit arg0: Functor[B], arg1: Functor[G]): scalaz.Scalaz.Id[T[G]]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

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

def toString(): String

def topDownCataM[M[_], A](a: A)(f: (A, T[B]) ⇒ M[(A, T[B])])(implicit arg0: Traverse[B], arg1: Monad[M]): M[T[B]]

def transAnaM[M[_], G[_]](f: (B[T[B]]) ⇒ M[G[T[B]]])(implicit arg0: Monad[M], arg1: Functor[B], arg2: Traverse[G]): M[T[G]]

def transAnaTM[M[_]](f: (T[B]) ⇒ M[T[B]])(implicit arg0: Traverse[B], arg1: Monad[M]): M[T[B]]

def transCataM[M[_], G[_]](f: (B[T[G]]) ⇒ M[G[T[G]]])(implicit arg0: Monad[M], arg1: Traverse[B], arg2: Functor[G]): M[T[G]]

def transCataTM[M[_]](f: (T[B]) ⇒ M[T[B]])(implicit arg0: Traverse[B], arg1: Monad[M]): M[T[B]]

def traverse[M[_], G[_]](f: (B[T[B]]) ⇒ M[G[T[G]]])(implicit arg0: Applicative[M], arg1: Functor[B], arg2: Functor[G]): M[T[G]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion toIdOps from Ops[T, B] to IdOps[Ops[T, B]]

Ungrouped