Package

quasar

fp

Permalink

package fp

Linear Supertypes
DebugOps, ProcessOps, JsonOps, PartialFunctionOps, ListMapInstances, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. fp
  2. DebugOps
  3. ProcessOps
  4. JsonOps
  5. PartialFunctionOps
  6. ListMapInstances
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

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

    Permalink
  2. type NTComp[F[X], G[Y]] = NaturalTransformation[F, [A]G[F[A]]]

    Permalink
  3. implicit class PFOps[A, B] extends AnyRef

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

    Permalink
    Definition Classes
    ProcessOps
  5. implicit class ProcessOfTaskOps[O] extends AnyRef

    Permalink
    Definition Classes
    ProcessOps
  6. class SeqW[A] extends AnyRef

    Permalink
    Definition Classes
    ListMapInstances
  7. implicit class TaskOps[A] extends AnyRef

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

    Permalink
    Definition Classes
    DebugOps

Value Members

  1. implicit def ListMapEqual[A, B](implicit arg0: Equal[A], arg1: Equal[B]): Equal[slamdata.Predef.ListMap[A, B]]

    Permalink
    Definition Classes
    ListMapInstances
  2. implicit def TraverseListMap[K]: Traverse[[β$0$]ListMap[K, β$0$]] with IsEmpty[[β$1$]ListMap[K, β$1$]]

    Permalink
    Definition Classes
    ListMapInstances
  3. def applyCoEnvFrom[T[_[_]], F[_], A](modify: (T[[γ$20$]CoEnv[A, F, γ$20$]]) ⇒ T[[γ$21$]CoEnv[A, F, γ$21$]])(implicit arg0: BirecursiveT[T], arg1: Functor[F]): (Free[F, A]) ⇒ Free[F, A]

    Permalink
  4. def applyFrom[A, B](bij: Bijection[A, B])(modify: (B) ⇒ B): (A) ⇒ A

    Permalink
  5. def coenvBijection[T[_[_]], F[_], A](implicit arg0: BirecursiveT[T], arg1: Functor[F]): Bijection[Free[F, A], T[[γ$17$]CoEnv[A, F, γ$17$]]]

    Permalink
  6. def coenvPrism[F[_], A]: PrismNT[[γ$4$]CoEnv[A, F, γ$4$], F]

    Permalink
  7. implicit def constEqual[A](implicit arg0: Equal[A]): Delay[Equal, [β$13$]Const[A, β$13$]]

    Permalink
  8. implicit def constShow[A](implicit arg0: Show[A]): Delay[Show, [β$15$]Const[A, β$15$]]

    Permalink
  9. implicit def coproductEqual[F[_], G[_]](implicit F: Delay[Equal, F], G: Delay[Equal, G]): Delay[Equal, [γ$9$]Coproduct[F, G, γ$9$]]

    Permalink
  10. implicit def coproductShow[F[_], G[_]](implicit F: Delay[Show, F], G: Delay[Show, G]): Delay[Show, [γ$11$]Coproduct[F, G, γ$11$]]

    Permalink
  11. def decodeJson[A](text: slamdata.Predef.String)(implicit DA: DecodeJson[A]): \/[slamdata.Predef.String, A]

    Permalink
    Definition Classes
    JsonOps
  12. def evalNT[F[_], S](initial: S)(implicit arg0: Monad[F]): ~>[[γ$7$]IndexedStateT[F, S, S, γ$7$], F]

    Permalink
  13. implicit def finEqual[N <: Succ[_]]: Equal[Fin[N]]

    Permalink
  14. implicit def finShow[N <: Succ[_]]: Show[Fin[N]]

    Permalink
  15. def idPrism[F[_]]: PrismNT[F, F]

    Permalink
  16. def ignore[A](a: A): slamdata.Predef.Unit

    Permalink
  17. def injR[T[_[_]], F[_], G[_]](orig: T[F])(implicit arg0: BirecursiveT[T], arg1: Functor[F], arg2: Functor[G], F: :<:[F, G]): T[G]

    Permalink
  18. def liftCo[T[_[_]], F[_], A, B](f: (F[B]) ⇒ CoEnv[A, F, B]): (CoEnv[A, F, B]) ⇒ CoEnv[A, F, B]

    Permalink
  19. def liftCoM[T[_[_]], M[_], F[_], A, B](f: (F[B]) ⇒ M[CoEnv[A, F, B]])(implicit arg0: Applicative[M]): (CoEnv[A, F, B]) ⇒ M[CoEnv[A, F, B]]

    Permalink
  20. def liftFF[F[_], G[_], A](orig: (F[A]) ⇒ F[A])(implicit F: :<:[F, G]): (G[A]) ⇒ G[A]

    Permalink
  21. def liftFFTrans[F[_], G[_], A](prism: PrismNT[G, F])(f: (F[A]) ⇒ slamdata.Predef.Option[F[A]]): (G[A]) ⇒ slamdata.Predef.Option[G[A]]

    Permalink
  22. def liftFG[F[_], G[_], A](orig: (F[A]) ⇒ G[A])(implicit F: :<:[F, G]): (G[A]) ⇒ G[A]

    Permalink
  23. def liftFGM[M[_], F[_], G[_], A](orig: (F[A]) ⇒ M[G[A]])(implicit arg0: Monad[M], F: :<:[F, G]): (G[A]) ⇒ M[G[A]]

    Permalink
  24. def liftFGTrans[F[_], G[_], A](prism: PrismNT[G, F])(f: (F[A]) ⇒ slamdata.Predef.Option[G[A]]): (G[A]) ⇒ slamdata.Predef.Option[G[A]]

    Permalink
  25. def liftMT[F[_], G[_[_], _]](implicit arg0: Monad[F], arg1: MonadTrans[G]): ~>[F, [β$4$]G[F, β$4$]]

    Permalink
  26. 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]

    Permalink
  27. val minspace: PrettyParams

    Permalink
    Definition Classes
    JsonOps
  28. val multiline: PrettyParams

    Permalink
    Definition Classes
    JsonOps
  29. implicit def natEqual[N <: Nat]: Equal[N]

    Permalink
  30. implicit def natShow[N <: Nat]: Show[N]

    Permalink
  31. def optional[A](cur: ACursor)(implicit arg0: DecodeJson[A]): DecodeResult[slamdata.Predef.Option[A]]

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

    Permalink
    Definition Classes
    JsonOps
  33. def pointNT[F[_]](implicit arg0: Applicative[F]): ~>[scalaz.Scalaz.Id, F]

    Permalink
  34. def prjR[T[_[_]], F[_], G[_]](orig: T[G])(implicit arg0: BirecursiveT[T], arg1: Traverse[F], arg2: Traverse[G], F: :<:[F, G]): slamdata.Predef.Option[T[F]]

    Permalink
  35. def reflNT[F[_]]: ~>[F, F]

    Permalink
  36. implicit def seqW[A](xs: slamdata.Predef.Seq[A]): SeqW[A]

    Permalink
    Definition Classes
    ListMapInstances
  37. implicit def sizedEqual[A, N <: Nat](implicit arg0: Equal[A]): Equal[Sized[A, N]]

    Permalink
  38. implicit def sizedShow[A, N <: Nat](implicit arg0: Show[A]): Show[Sized[A, N]]

    Permalink
  39. implicit val symbolEqual: Equal[slamdata.Predef.Symbol]

    Permalink
  40. implicit val symbolShow: Show[slamdata.Predef.Symbol]

    Permalink

Inherited from DebugOps

Inherited from ProcessOps

Inherited from JsonOps

Inherited from PartialFunctionOps

Inherited from ListMapInstances

Inherited from AnyRef

Inherited from Any

Ungrouped