package
fp
Type Members
-
sealed
trait
:/:[F[_], G[_]] extends CoM
-
sealed
trait
:\:[F[_], T <: CoM] extends CoM
-
-
-
trait
CatchableOps[F[_], A] extends Ops[F[A]]
-
implicit final
class
CoEnvOps[T[_[_]], F[_], E] extends AnyVal
-
sealed
trait
CoM extends AnyRef
-
-
-
-
type
EnumT[F[_], A] = EnumeratorT[A, F]
-
-
-
sealed abstract
class
ExternallyManaged extends AnyRef
-
implicit final
class
FreeOps[F[_], E] extends AnyVal
-
-
implicit final
class
ListOps[A] extends AnyVal
-
implicit
class
PFOps[A, B] extends AnyRef
-
implicit
class
PrOps[F[_], O] extends AnyRef
-
final
case class
PrismNT[F[_], G[_]](get: ~>[F, [A]Option[G[A]]], reverseGet: ~>[G, F]) extends Product with Serializable
-
implicit
class
ProcessOfTaskOps[O] extends AnyRef
-
trait
ProcessOps extends AnyRef
-
-
class
SeqW[A] extends AnyRef
-
-
-
implicit
class
TaskOps[A] extends AnyRef
-
sealed abstract
class
TaskRef[A] extends AnyRef
-
implicit final
class
ToDebugOps[A] extends AnyRef
-
implicit final
class
ToQFoldableOps[F[_], A] extends AnyRef
Value Members
-
-
-
implicit
def
EitherRenderTree[A, B](implicit RA: RenderTree[A], RB: RenderTree[B]): RenderTree[\/[A, B]]
-
implicit
def
EqualEqualF[F[_], A, FF[A] <: F[A]](implicit arg0: Equal[A], FE: EqualF[F]): Equal[FF[A]]
-
-
implicit
def
EqualFNT[F[_]](implicit EF: EqualF[F]): ~>[Equal, [α]Equal[F[α]]]
-
-
-
-
object
Inj
-
-
implicit
def
LeftTuple3RenderTree[A, B, C](implicit RA: RenderTree[A], RB: RenderTree[B], RC: RenderTree[C]): RenderTree[((A, B), C)]
-
implicit
def
LeftTuple4RenderTree[A, B, C, D](implicit RA: RenderTree[A], RB: RenderTree[B], RC: RenderTree[C], RD: RenderTree[D]): RenderTree[(((A, B), C), D)]
-
implicit
def
ListMapEqual[A, B](implicit arg0: Equal[A], arg1: Equal[B]): Equal[Predef.ListMap[A, B]]
-
implicit
def
ListMapRenderTree[K, V](implicit arg0: Show[K], RV: RenderTree[V]): RenderTree[Predef.ListMap[K, V]]
-
-
-
implicit
def
PathRenderTree[B, T, S]: RenderTree[Path[B, T, S]]
-
-
implicit
def
RenderTreeToShow[N](implicit arg0: RenderTree[N]): Show[N]
-
-
-
implicit
def
ShowFNT[F[_]](implicit SF: ShowF[F]): ~>[Show, [α]Show[F[α]]]
-
implicit
def
ShowShowF[F[_], A, FF[A] <: F[A]](implicit arg0: Show[A], FS: ShowF[F]): Show[FF[A]]
-
-
-
implicit
val
SymbolEqual: Equal[Predef.Symbol]
-
-
implicit
def
ToCatchableOpsFromCatchable[F[_], A](a: F[A]): CatchableOps[F, A]
-
implicit
def
TraverseListMap[K]: Traverse[[β$0$]ListMap[K, β$0$]] with IsEmpty[[β$1$]ListMap[K, β$1$]]
-
implicit
def
Tuple2RenderTree[A, B](implicit RA: RenderTree[A], RB: RenderTree[B]): RenderTree[(A, B)]
-
-
-
-
def
coEnvHmap[F[_], G[_], A, B](fa: CoEnv[A, F, B])(f: ~>[F, G]): CoEnv[A, G, B]
-
def
coEnvHtraverse[G[_], F[_], H[_], A, B](fa: CoEnv[A, F, B])(f: ~>[F, [A]G[H[A]]])(implicit arg0: Applicative[G]): G[CoEnv[A, H, B]]
-
implicit
def
coenvFunctor[F[_], E](implicit arg0: Functor[F]): Functor[[γ$11$]CoEnv[E, F, γ$11$]]
-
def
coenvPrism[F[_], A]: PrismNT[[γ$54$]CoEnv[A, F, γ$54$], F]
-
implicit
def
coenvTraverse[F[_], E](implicit arg0: Traverse[F]): Traverse[[γ$10$]CoEnv[E, F, γ$10$]]
-
implicit
def
constEqual[A](implicit arg0: Equal[A]): Delay[Equal, [β$23$]Const[A, β$23$]]
-
implicit
def
constShow[A](implicit arg0: Show[A]): Delay[Show, [β$25$]Const[A, β$25$]]
-
implicit
def
coproductEqual[F[_], G[_]](implicit F: Delay[Equal, F], G: Delay[Equal, G]): Delay[Equal, [γ$19$]Coproduct[F, G, γ$19$]]
-
implicit
def
coproductShow[F[_], G[_]](implicit F: Delay[Show, F], G: Delay[Show, G]): Delay[Show, [γ$21$]Coproduct[F, G, γ$21$]]
-
-
def
distTraverse[F[_], G[_]](implicit arg0: Traverse[F], arg1: Applicative[G]): DistributiveLaw[F, G]
-
-
def
elgotM[M[_], F[_], A, B](a: A)(φ: (F[B]) ⇒ M[B], ψ: (A) ⇒ M[\/[B, F[A]]])(implicit arg0: Monad[M], arg1: Traverse[F]): M[B]
-
-
implicit
def
equalTEqual[T[_[_]], F[_]](implicit T: EqualT[T], F: Delay[Equal, F]): Equal[T[F]]
-
implicit
val
equalTFix: EqualT[Fix]
-
def
evalNT[F[_], S](initial: S)(implicit arg0: Monad[F]): ~>[[γ$17$]IndexedStateT[F, S, S, γ$17$], F]
-
implicit
def
finEqual[N <: Succ[_]]: Equal[Fin[N]]
-
implicit
def
finShow[N <: Succ[_]]: Show[Fin[N]]
-
-
def
freeCata[F[_], E, A](free: Free[F, E])(φ: Algebra[[γ$31$]CoEnv[E, F, γ$31$], A])(implicit arg0: Functor[F]): A
-
def
freeCataM[M[_], F[_], E, A](free: Free[F, E])(φ: AlgebraM[M, [γ$32$]CoEnv[E, F, γ$32$], A])(implicit arg0: Monad[M], arg1: Traverse[F]): M[A]
-
def
freeGcataM[W[_], M[_], F[_], E, A](free: Free[F, E])(k: DistributiveLaw[[γ$33$]CoEnv[E, F, γ$33$], W], φ: GAlgebraM[W, M, [γ$34$]CoEnv[E, F, γ$34$], A])(implicit arg0: Comonad[W], arg1: Traverse[W], arg2: Monad[M], arg3: Traverse[F]): M[A]
-
def
freeTransCata[T[_[_]], F[_], G[_], A, B](free: Free[F, A])(f: (CoEnv[A, F, T[[γ$39$]CoEnv[B, G, γ$39$]]]) ⇒ CoEnv[B, G, T[[γ$40$]CoEnv[B, G, γ$40$]]])(implicit arg0: Recursive[T], arg1: Corecursive[T], arg2: Functor[F], arg3: Functor[G]): Free[G, B]
-
def
freeTransCataM[T[_[_]], M[_], F[_], G[_], A, B](free: Free[F, A])(f: (CoEnv[A, F, T[[γ$42$]CoEnv[B, G, γ$42$]]]) ⇒ M[CoEnv[B, G, T[[γ$43$]CoEnv[B, G, γ$43$]]]])(implicit arg0: Recursive[T], arg1: Corecursive[T], arg2: Monad[M], arg3: Traverse[F], arg4: Functor[G]): M[Free[G, B]]
-
def
freeTransFutu[T[_[_]], F[_], G[_], A, B](free: Free[F, A])(f: (CoEnv[A, F, T[[γ$46$]CoEnv[A, F, γ$46$]]]) ⇒ CoEnv[B, G, Free[[γ$48$]CoEnv[B, G, γ$48$], T[[γ$47$]CoEnv[A, F, γ$47$]]]])(implicit arg0: Recursive[T], arg1: Corecursive[T], arg2: Functor[F], arg3: Traverse[G]): Free[G, B]
-
def
ginterpretM[W[_], M[_], F[_], A, B](f: (A) ⇒ M[B], φ: GAlgebraM[W, M, F, B]): GAlgebraM[W, M, [γ$29$]CoEnv[A, F, γ$29$], B]
-
def
idPrism[F[_]]: PrismNT[F, F]
-
-
def
interpret[F[_], A, B](f: (A) ⇒ B, φ: Algebra[F, B]): Algebra[[γ$27$]CoEnv[A, F, γ$27$], B]
-
def
interpretM[M[_], F[_], A, B](f: (A) ⇒ M[B], φ: AlgebraM[M, F, B]): AlgebraM[M, [γ$28$]CoEnv[A, F, γ$28$], B]
-
-
def
liftCo[T[_[_]], F[_], A](f: (F[T[[γ$49$]CoEnv[A, F, γ$49$]]]) ⇒ CoEnv[A, F, T[[γ$50$]CoEnv[A, F, γ$50$]]]): (CoEnv[A, F, T[[γ$51$]CoEnv[A, F, γ$51$]]]) ⇒ CoEnv[A, F, T[[γ$52$]CoEnv[A, F, γ$52$]]]
-
def
liftFF[F[_], G[_], A](orig: (F[A]) ⇒ F[A])(implicit F: :<:[F, G]): (G[A]) ⇒ G[A]
-
def
liftFG[F[_], G[_], A](orig: (F[A]) ⇒ G[A])(implicit F: :<:[F, G]): (G[A]) ⇒ G[A]
-
def
liftFGM[M[_], F[_], G[_], A](orig: (F[A]) ⇒ M[G[A]])(implicit arg0: Monad[M], F: :<:[F, G]): (G[A]) ⇒ M[G[A]]
-
def
liftMT[F[_], G[_[_], _]](implicit arg0: Monad[F], arg1: MonadTrans[G]): ~>[F, [β$14$]G[F, β$14$]]
-
val
minspace: PrettyParams
-
val
multiline: PrettyParams
-
implicit
def
natEqual[N <: Nat]: Equal[N]
-
implicit
def
natShow[N <: Nat]: Show[N]
-
-
implicit
def
optionTCatchable[F[_]](implicit arg0: Catchable[F], arg1: Functor[F]): Catchable[[β$4$]OptionT[F, β$4$]]
-
-
def
orElse[A](cur: ACursor, default: ⇒ A)(implicit arg0: DecodeJson[A]): DecodeResult[A]
-
def
pointNT[F[_]](implicit arg0: Applicative[F]): ~>[scalaz.Scalaz.Id, F]
-
def
recover[F[_], A](φ: Algebra[F, A]): Algebra[[γ$30$]CoEnv[A, F, γ$30$], A]
-
def
reflNT[F[_]]: ~>[F, F]
-
implicit
def
seqW[A](xs: Predef.Seq[A]): SeqW[A]
-
implicit
val
showTFix: ShowT[Fix]
-
implicit
def
showTShow[T[_[_]], F[_]](implicit T: ShowT[T], F: Delay[Show, F]): Show[T[F]]
-
implicit
def
sizedEqual[A, N <: Nat](implicit arg0: Equal[A]): Equal[Sized[A, N]]
-
implicit
def
sizedShow[A, N <: Nat](implicit arg0: Show[A]): Show[Sized[A, N]]
-
implicit
def
stateTCatchable[F[_], S](implicit arg0: Catchable[F], arg1: Monad[F]): Catchable[[γ$6$]IndexedStateT[F, S, S, γ$6$]]
-
def
substitute[T[_[_]], F[_]](original: T[F], replacement: T[F])(implicit T: Equal[T[F]]): (T[F]) ⇒ \/[T[F], T[F]]
-
def
transApoT[T[_[_]], F[_]](t: T[F])(f: (T[F]) ⇒ \/[T[F], T[F]])(implicit arg0: FunctorT[T], arg1: Functor[F]): T[F]
-
def
transFutu[T[_[_]], F[_], G[_]](t: T[F])(f: GCoalgebraicTransform[T, [β$45$]Free[G, β$45$], F, G])(implicit arg0: FunctorT[T], arg1: Corecursive[T], arg2: Functor[F], arg3: Traverse[G]): T[G]
-
-
-
implicit
def
writerTCatchable[F[_], W](implicit arg0: Catchable[F], arg1: Functor[F], arg2: Monoid[W]): Catchable[[γ$8$]WriterT[F, W, γ$8$]]
-
-
def
ι[A]: (A) ⇒ A
-
def
κ[A, B](x: B): (A) ⇒ B
-
def
κ2[A, B, C](x: C): (A, B) ⇒ C
-
def
κ3[A, B, C, D](x: D): (A, B, C) ⇒ D
-
def
κ6[A, B, C, D, E, F, G](x: G): (A, B, C, D, E, F) ⇒ G
-
def
σ[A, B, C](x: (A) ⇒ (B) ⇒ C, y: (A) ⇒ B, z: A): C
Inherited from AnyRef
Inherited from Any