Package

quasar

fp

Permalink

package fp

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. fp
  2. CatchableInstances
  3. DebugOps
  4. QFoldableOps
  5. ProcessOps
  6. JsonOps
  7. PartialFunctionOps
  8. ToCatchableOps
  9. WriterTInstances
  10. StateTInstances
  11. OptionTInstances
  12. ListMapInstances
  13. TreeInstances
  14. LowPriorityTreeInstances
  15. LowerPriorityTreeInstances
  16. AnyRef
  17. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. sealed trait :/:[F[_], G[_]] extends CoM

    Permalink
  2. sealed trait :\:[F[_], T <: CoM] extends CoM

    Permalink
  3. trait CatchableInstances extends AnyRef

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

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

    Permalink
    Definition Classes
    ToCatchableOps
  6. sealed trait CoM extends AnyRef

    Permalink

    Builds nested scalaz Coproducts.

    Builds nested scalaz Coproducts. Use like: * type MarkLogicFs[A] = ( Task :\: SessionIO :\: ContentSourceIO :\: GenUUID :\: MonotonicSeq :\: MLReadHandles :\: MLWriteHandles :/: MLResultHandles )#M[A]

  7. trait DelayedA[A] extends AnyRef

    Permalink
  8. trait DelayedFG[F[_], G[_]] extends AnyRef

    Permalink
  9. trait EitherTInstances extends EitherTInstances0

    Permalink
  10. trait EitherTInstances0 extends EitherTInstances1

    Permalink
  11. trait EitherTInstances1 extends AnyRef

    Permalink
  12. type EndoK[F[X]] = NaturalTransformation[F, F]

    Permalink

    An endomorphism is a mapping from a category to itself.

    An endomorphism is a mapping from a category to itself. It looks like scalaz already staked out "Endo" for the lower version.

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

    Permalink
  14. trait EqualF[F[_]] extends Serializable

    Permalink
  15. sealed abstract class ExternallyManaged extends AnyRef

    Permalink

    Used for a normally-recursive parameter that has been “externalized”.

    Used for a normally-recursive parameter that has been “externalized”. E.g., Tree[LogicalPlan[ExternallyManaged]] vs Fix[LogicalPlan]. This indicates that the recursive structure is intact, but is handled by some containing structure (Tree, in that example).

  16. trait KleisliInstances extends AnyRef

    Permalink
  17. implicit final class ListOps[A] extends AnyVal

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

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

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

    Permalink
    Definition Classes
    ProcessOps
  21. final case class PrismNT[F[_], G[_]](get: ~>[F, [A]Option[G[A]]], reverseGet: ~>[G, F]) extends Product with Serializable

    Permalink

    Just like Prism, but operates over Functors.

  22. implicit class ProcessOfTaskOps[O] extends AnyRef

    Permalink
    Definition Classes
    ProcessOps
  23. trait ProcessOps extends AnyRef

    Permalink
  24. implicit final class QuasarFreeOps[F[_], A] extends AnyVal

    Permalink
  25. trait SemigroupF[F[_]] extends Serializable

    Permalink
  26. class SeqW[A] extends AnyRef

    Permalink
    Definition Classes
    ListMapInstances
  27. trait ShowF[F[_]] extends Serializable

    Permalink
  28. implicit class TaskOps[A] extends AnyRef

    Permalink
    Definition Classes
    ProcessOps
  29. sealed abstract class TaskRef[A] extends AnyRef

    Permalink

    A thread-safe, atomically updatable mutable reference.

    A thread-safe, atomically updatable mutable reference.

    Cribbed from the IORef defined in oncue/remotely, an Apache 2 licensed project: https://github.com/oncue/remotely

  30. implicit final class ToDebugOps[A] extends AnyRef

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

    Permalink
    Definition Classes
    QFoldableOps

Value Members

  1. implicit val BooleanRenderTree: RenderTree[Predef.Boolean]

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

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

    Permalink
    Definition Classes
    TreeInstances
  4. implicit def EqualEqualF[F[_], A, FF[A] <: F[A]](implicit arg0: Equal[A], FE: EqualF[F]): Equal[FF[A]]

    Permalink
  5. object EqualF extends Serializable

    Permalink
  6. implicit def EqualFNT[F[_]](implicit EF: EqualF[F]): ~>[Equal, [α]Equal[F[α]]]

    Permalink
  7. object Extern extends ExternallyManaged with Product with Serializable

    Permalink
  8. object ExternallyManaged

    Permalink
  9. object Inj

    Permalink
  10. implicit val IntRenderTree: RenderTree[Predef.Int]

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    TreeInstances
  18. object ProcessOps extends ProcessOps

    Permalink
  19. object SemigroupF extends Serializable

    Permalink
  20. object ShowF extends Serializable

    Permalink
  21. implicit def ShowFNT[F[_]](implicit SF: ShowF[F]): ~>[Show, [α]Show[F[α]]]

    Permalink
  22. implicit def ShowShowF[F[_], A, FF[A] <: F[A]](implicit arg0: Show[A], FS: ShowF[F]): Show[FF[A]]

    Permalink
  23. implicit val StringRenderTree: RenderTree[Predef.String]

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

    Permalink
    Definition Classes
    TreeInstances
  25. object TaskRef

    Permalink
  26. implicit def ToCatchableOpsFromCatchable[F[_], A](a: F[A]): CatchableOps[F, A]

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

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

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

    Permalink
    Definition Classes
    TreeInstances
  30. package binder

    Permalink
  31. object catchable extends CatchableInstances

    Permalink
  32. def coenvPrism[F[_], A]: PrismNT[[γ$27$]CoEnv[A, F, γ$27$], F]

    Permalink
  33. implicit def constEqual[A](implicit arg0: Equal[A]): ~>[Equal, [B]Equal[Const[A, B]]]

    Permalink
  34. implicit def constShow[A](implicit arg0: Show[A]): ~>[Show, [B]Show[Const[A, B]]]

    Permalink
  35. implicit def coproductEqual[F[_], G[_]](implicit F: Delay[Equal, F], G: Delay[Equal, G]): ~>[Equal, [A]Equal[Coproduct[F, G, A]]]

    Permalink
  36. implicit def coproductShow[F[_], G[_]](implicit F: Delay[Show, F], G: Delay[Show, G]): ~>[Show, [A]Show[Coproduct[F, G, A]]]

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

    Permalink
    Definition Classes
    JsonOps
  38. object eitherT extends EitherTInstances

    Permalink
  39. object enumeratee

    Permalink
  40. def evalNT[F[_], S](initial: S)(implicit arg0: Monad[F]): ~>[[γ$15$]IndexedStateT[F, S, S, γ$15$], F]

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

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

    Permalink
  43. package free

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

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

    Permalink

    Accept a value (forcing the argument expression to be evaluated for its effects), and then discard it, returning Unit.

    Accept a value (forcing the argument expression to be evaluated for its effects), and then discard it, returning Unit. Makes it explicit that you're discarding the result, and effectively suppresses the "NonUnitStatement" warning from wartremover.

  46. object kleisli extends KleisliInstances

    Permalink
  47. def liftCo[T[_[_]], F[_], A](f: (F[T[[γ$22$]CoEnv[A, F, γ$22$]]]) ⇒ CoEnv[A, F, T[[γ$23$]CoEnv[A, F, γ$23$]]]): (CoEnv[A, F, T[[γ$24$]CoEnv[A, F, γ$24$]]]) ⇒ CoEnv[A, F, T[[γ$25$]CoEnv[A, F, γ$25$]]]

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

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

    Permalink
  50. 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
  51. def liftMT[F[_], G[_[_], _]](implicit arg0: Monad[F], arg1: MonadTrans[G]): ~>[F, [β$12$]G[F, β$12$]]

    Permalink

    liftM as a natural transformation

    liftM as a natural transformation

    TODO: PR to scalaz

  52. val minspace: PrettyParams

    Permalink
    Definition Classes
    JsonOps
  53. val multiline: PrettyParams

    Permalink

    Nicely formatted, order-preserving, 2-space indented.

    Nicely formatted, order-preserving, 2-space indented.

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

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

    Permalink
  56. package numeric

    Permalink
  57. implicit def optionTCatchable[F[_]](implicit arg0: Catchable[F], arg1: Functor[F]): Catchable[[β$4$]OptionT[F, β$4$]]

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

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

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

    Permalink

    point as a natural transformation

  61. def reflNT[F[_]]: ~>[F, F]

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

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

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

    Permalink
  65. implicit def stateTCatchable[F[_], S](implicit arg0: Catchable[F], arg1: Monad[F]): Catchable[[γ$6$]IndexedStateT[F, S, S, γ$6$]]

    Permalink
    Definition Classes
    StateTInstances
  66. package tree

    Permalink

    "Generic" types for building partially-constructed trees in some "functorized" type.

  67. def unzipDisj[A, B](ds: Predef.List[\/[A, B]]): (Predef.List[A], Predef.List[B])

    Permalink
  68. implicit def writerTCatchable[F[_], W](implicit arg0: Catchable[F], arg1: Functor[F], arg2: Monoid[W]): Catchable[[γ$8$]WriterT[F, W, γ$8$]]

    Permalink
    Definition Classes
    WriterTInstances
  69. object zoomNT

    Permalink

    Lift a State computation to operate over a "larger" state given a Lens.

    Lift a State computation to operate over a "larger" state given a Lens.

    NB: Uses partial application of F[_] for better type inference, usage:

    zoomNT[F](lens)

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 AnyRef

Inherited from Any

Ungrouped