fp - quasar.fp

Type Members

implicit class CatchableOfDisjunctionOps[F[_], A, B] extends AnyRef

Definition Classes
CatchableInstances
trait CatchableOps[F[_], A] extends Ops[F[A]]

Definition Classes
ToCatchableOps
type EndoK[F[X]] = NaturalTransformation[F, F]
type EnumT[F[_], A] = EnumeratorT[A, F]
type NTComp[F[X], G[Y]] = NaturalTransformation[F, [A]G[F[A]]]
implicit class PFOps[A, B] extends AnyRef

Definition Classes
PartialFunctionOps
implicit class PrOps[F[_], O] extends AnyRef

Definition Classes
ProcessOps
implicit class ProcessOfTaskOps[O] extends AnyRef

Definition Classes
ProcessOps
class SeqW[A] extends AnyRef

Definition Classes
ListMapInstances
implicit class TaskOps[A] extends AnyRef

Definition Classes
ProcessOps
implicit final class ToDebugOps[A] extends AnyRef

Definition Classes
DebugOps
implicit final class ToQFoldableOps[F[_], A] extends AnyRef

Definition Classes
QFoldableOps

Value Members

implicit val BooleanRenderTree: RenderTree[Predef.Boolean]

Definition Classes
TreeInstances
implicit val DoubleRenderTree: RenderTree[Predef.Double]

Definition Classes
TreeInstances
implicit def EitherRenderTree[A, B](implicit RA: RenderTree[A], RB: RenderTree[B]): RenderTree[\/[A, B]]

Definition Classes
TreeInstances
implicit val IntRenderTree: RenderTree[Predef.Int]

Definition Classes
TreeInstances
implicit def LeftTuple3RenderTree[A, B, C](implicit RA: RenderTree[A], RB: RenderTree[B], RC: RenderTree[C]): RenderTree[((A, B), C)]

Definition Classes
LowPriorityTreeInstances
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)]

Definition Classes
TreeInstances
implicit def ListMapEqual[A, B](implicit arg0: Equal[A], arg1: Equal[B]): Equal[Predef.ListMap[A, B]]

Definition Classes
TreeInstances
implicit def ListMapRenderTree[K, V](implicit arg0: Show[K], RV: RenderTree[V]): RenderTree[Predef.ListMap[K, V]]

Definition Classes
TreeInstances
implicit def ListRenderTree[A](implicit RA: RenderTree[A]): RenderTree[Predef.List[A]]

Definition Classes
TreeInstances
implicit def OptionRenderTree[A](implicit RA: RenderTree[A]): RenderTree[Predef.Option[A]]

Definition Classes
TreeInstances
implicit def PathRenderTree[B, T, S]: RenderTree[Path[B, T, S]]

Definition Classes
TreeInstances
implicit val StringRenderTree: RenderTree[Predef.String]

Definition Classes
TreeInstances
implicit val SymbolEqual: Equal[Predef.Symbol]

Definition Classes
TreeInstances
implicit def ToCatchableOpsFromCatchable[F[_], A](a: F[A]): CatchableOps[F, A]

Definition Classes
ToCatchableOps
implicit def TraverseListMap[K]: Traverse[[β$0$]ListMap[K, β$0$]] with IsEmpty[[β$1$]ListMap[K, β$1$]]

Definition Classes
ListMapInstances
implicit def Tuple2RenderTree[A, B](implicit RA: RenderTree[A], RB: RenderTree[B]): RenderTree[(A, B)]

Definition Classes
LowerPriorityTreeInstances
implicit def VectorRenderTree[A](implicit RA: RenderTree[A]): RenderTree[Predef.Vector[A]]

Definition Classes
TreeInstances
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 decodeJson[A](text: Predef.String)(implicit DA: DecodeJson[A]): \/[Predef.String, A]

Definition Classes
JsonOps
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 ignore[A](a: A): Predef.Unit
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

Definition Classes
JsonOps
val multiline: PrettyParams

Definition Classes
JsonOps
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$]]

Definition Classes
OptionTInstances
def optional[A](cur: ACursor)(implicit arg0: DecodeJson[A]): DecodeResult[Predef.Option[A]]

Definition Classes
JsonOps
def orElse[A](cur: ACursor, default: ⇒ A)(implicit arg0: DecodeJson[A]): DecodeResult[A]

Definition Classes
JsonOps
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]

Definition Classes
ListMapInstances
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$]]

Definition Classes
StateTInstances
implicit def writerTCatchable[F[_], W](implicit arg0: Catchable[F], arg1: Functor[F], arg2: Monoid[W]): Catchable[[γ$0$]WriterT[F, W, γ$0$]]

Definition Classes
WriterTInstances

fp

package fp

Type Members

implicit class CatchableOfDisjunctionOps[F[_], A, B] extends AnyRef

trait CatchableOps[F[_], A] extends Ops[F[A]]

type EndoK[F[X]] = NaturalTransformation[F, F]

type EnumT[F[_], A] = EnumeratorT[A, F]

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

implicit class ProcessOfTaskOps[O] extends AnyRef

class SeqW[A] extends AnyRef

implicit class TaskOps[A] extends AnyRef

implicit final class ToDebugOps[A] extends AnyRef

implicit final class ToQFoldableOps[F[_], A] extends AnyRef

Value Members

implicit val BooleanRenderTree: RenderTree[Predef.Boolean]

implicit val DoubleRenderTree: RenderTree[Predef.Double]

implicit def EitherRenderTree[A, B](implicit RA: RenderTree[A], RB: RenderTree[B]): RenderTree[\/[A, B]]

implicit val IntRenderTree: RenderTree[Predef.Int]

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 ListRenderTree[A](implicit RA: RenderTree[A]): RenderTree[Predef.List[A]]

implicit def OptionRenderTree[A](implicit RA: RenderTree[A]): RenderTree[Predef.Option[A]]

implicit def PathRenderTree[B, T, S]: RenderTree[Path[B, T, S]]

implicit val StringRenderTree: RenderTree[Predef.String]

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)]

implicit def VectorRenderTree[A](implicit RA: RenderTree[A]): RenderTree[Predef.Vector[A]]

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 decodeJson[A](text: Predef.String)(implicit DA: DecodeJson[A]): \/[Predef.String, A]

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 ignore[A](a: A): Predef.Unit

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 optional[A](cur: ACursor)(implicit arg0: DecodeJson[A]): DecodeResult[Predef.Option[A]]

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 CatchableInstances

Inherited from DebugOps

Inherited from QFoldableOps

Inherited from ProcessOps

Inherited from JsonOps

Inherited from PartialFunctionOps

Inherited from ToCatchableOps

Inherited from WriterTInstances

Inherited from StateTInstances

Inherited from OptionTInstances

Inherited from ListMapInstances

Inherited from TreeInstances

Inherited from LowPriorityTreeInstances

Inherited from LowerPriorityTreeInstances