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]]
-
sealed
trait
CoM extends AnyRef
-
trait
DelayedA[A] extends AnyRef
-
trait
DelayedFG[F[_], G[_]] extends AnyRef
-
-
-
-
-
type
EndoK[F[X]] = NaturalTransformation[F, F]
-
type
EnumT[F[_], A] = EnumeratorT[A, F]
-
sealed abstract
class
ExternallyManaged extends AnyRef
-
-
implicit final
class
ListOps[A] extends AnyVal
-
type
NTComp[F[X], G[Y]] = NaturalTransformation[F, [A]G[F[A]]]
-
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
-
implicit final
class
QuasarFreeOps[F[_], A] extends AnyVal
-
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]]
-
-
-
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
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
coenvPrism[F[_], A]: PrismNT[[γ$23$]CoEnv[A, F, γ$23$], F]
-
implicit
def
constEqual[A](implicit arg0: Equal[A]): Delay[Equal, [β$18$]Const[A, β$18$]]
-
implicit
def
constShow[A](implicit arg0: Show[A]): Delay[Show, [β$20$]Const[A, β$20$]]
-
implicit
def
coproductEqual[F[_], G[_]](implicit F: Delay[Equal, F], G: Delay[Equal, G]): Delay[Equal, [γ$14$]Coproduct[F, G, γ$14$]]
-
implicit
def
coproductShow[F[_], G[_]](implicit F: Delay[Show, F], G: Delay[Show, G]): Delay[Show, [γ$16$]Coproduct[F, G, γ$16$]]
-
-
-
-
def
evalNT[F[_], S](initial: S)(implicit arg0: Monad[F]): ~>[[γ$12$]IndexedStateT[F, S, S, γ$12$], F]
-
implicit
def
finEqual[N <: Succ[_]]: Equal[Fin[N]]
-
implicit
def
finShow[N <: Succ[_]]: Show[Fin[N]]
-
-
def
idPrism[F[_]]: PrismNT[F, F]
-
-
def
injR[T[_[_]], F[_], G[_]](orig: T[F])(implicit arg0: BirecursiveT[T], arg1: Functor[F], arg2: Functor[G], F: :<:[F, G]): T[G]
-
-
def
liftCo[T[_[_]], F[_], A, B](f: (F[B]) ⇒ CoEnv[A, F, B]): (CoEnv[A, F, B]) ⇒ CoEnv[A, F, B]
-
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, [β$9$]G[F, β$9$]]
-
def
liftR[T[_[_]], F[_], G[_]](orig: (T[F]) ⇒ T[F])(implicit arg0: BirecursiveT[T], arg1: Traverse[F], arg2: Traverse[G], F: :<:[F, G]): (T[G]) ⇒ T[G]
-
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
prjR[T[_[_]], F[_], G[_]](orig: T[G])(implicit arg0: BirecursiveT[T], arg1: Traverse[F], arg2: Traverse[G], F: :<:[F, G]): Predef.Option[T[F]]
-
def
reflNT[F[_]]: ~>[F, F]
-
implicit
def
seqW[A](xs: Predef.Seq[A]): SeqW[A]
-
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$]]
-
-
-
implicit
def
writerTCatchable[F[_], W](implicit arg0: Catchable[F], arg1: Functor[F], arg2: Monoid[W]): Catchable[[γ$0$]WriterT[F, W, γ$0$]]
-
Inherited from AnyRef
Inherited from Any