package
fp
Type Members
-
trait
CatchableOps[F[_], A] extends Ops[F[A]]
-
type
Delay[F[_], G[_]] = NaturalTransformation[F, [A]F[G[A]]]
-
type
EnumT[F[_], A] = EnumeratorT[A, F]
-
-
-
implicit final
class
ListOps[A] extends AnyVal
-
implicit
class
PFOps[A, B] extends AnyRef
-
sealed
trait
Polymorphic[F[_], TC[_]] extends AnyRef
-
implicit
class
PrOps[F[_], O] extends AnyRef
-
implicit
class
ProcessOfTaskOps[O] extends AnyRef
-
trait
ProcessOps extends AnyRef
-
-
class
SeqW[A] extends AnyRef
-
-
-
implicit final
class
StringOps extends AnyRef
-
implicit
class
TaskOps[A] extends AnyRef
-
sealed abstract
class
TaskRef[A] extends AnyRef
-
implicit final
class
ToQFoldableOps[F[_], A] extends AnyRef
-
implicit
class
eitherTOps[F[_], A, B] extends AnyRef
Value Members
-
-
implicit
val
DoubleRenderTree: RenderTree[Double]
-
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
val
IntRenderTree: RenderTree[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
ListMapRenderTree[K, V](implicit RV: RenderTree[V]): RenderTree[ListMap[K, V]]
-
implicit
def
ListRenderTree[A](implicit RA: RenderTree[A]): RenderTree[List[A]]
-
implicit
def
OptionRenderTree[A](implicit RA: RenderTree[A]): RenderTree[Option[A]]
-
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
StringRenderTree: RenderTree[String]
-
implicit
val
SymbolEqual: Equal[Symbol]
-
-
implicit
def
ToCatchableOpsFromCatchable[F[_], A](a: F[A]): CatchableOps[F, A]
-
implicit
def
TraverseListMap[K]: Traverse[[β]ListMap[K, β]] with IsEmpty[[β]ListMap[K, β]]
-
implicit
def
Tuple2RenderTree[A, B](implicit RA: RenderTree[A], RB: RenderTree[B]): RenderTree[(A, B)]
-
implicit
def
VectorRenderTree[A](implicit RA: RenderTree[A]): RenderTree[Vector[A]]
-
-
implicit
def
constEqual[A](implicit arg0: Equal[A]): Delay[Equal, [β]Const[A, β]]
-
implicit
def
constShow[A](implicit arg0: Show[A]): Delay[Show, [β]Const[A, β]]
-
implicit
def
coproductEqual[F[_], G[_]](implicit F: Delay[Equal, F], G: Delay[Equal, G]): Delay[Equal, [γ]Coproduct[F, G, γ]]
-
implicit
def
coproductShow[F[_], G[_]](implicit F: Delay[Show, F], G: Delay[Show, G]): Delay[Show, [γ]Coproduct[F, G, γ]]
-
def
decodeJson[A](text: String)(implicit DA: DecodeJson[A]): \/[String, A]
-
implicit
def
eitherTCatchable[F[_], E](implicit arg0: Catchable[F], arg1: Functor[F]): Catchable[[γ]EitherT[F, E, γ]]
-
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]): ~>[[γ]IndexedStateT[F, S, S, γ], F]
-
implicit
def
finEqual[N <: Succ[_]]: Equal[Fin[N]]
-
implicit
def
finShow[N <: Succ[_]]: Show[Fin[N]]
-
-
implicit
def
freeShow[F[_]](implicit arg0: Functor[F], F: Delay[Show, F]): Delay[Show, [β]Free[F, β]]
-
def
ginterpretM[W[_], M[_], F[_], A, B](f: (A) ⇒ M[B], φ: GAlgebraM[W, M, F, B]): GAlgebraM[W, M, [γ]CoEnv[A, F, γ], B]
-
def
ignore[A](a: A): Unit
-
def
interpret[F[_], A, B](f: (A) ⇒ B, φ: Algebra[F, B]): Algebra[[γ]CoEnv[A, F, γ], B]
-
def
interpretM[M[_], F[_], A, B](f: (A) ⇒ M[B], φ: AlgebraM[M, F, B]): AlgebraM[M, [γ]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
liftMT[F[_], G[_[_], _]](implicit arg0: Monad[F], arg1: MonadTrans[G]): ~>[F, [β]G[F, β]]
-
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[[β]OptionT[F, β]]
-
-
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[[γ]CoEnv[A, F, γ], A]
-
implicit
def
seqW[A](xs: 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[[γ]IndexedStateT[F, S, S, γ]]
-
def
unzipDisj[A, B](ds: List[\/[A, B]]): (List[A], List[B])
-
implicit
def
writerTCatchable[F[_], W](implicit arg0: Catchable[F], arg1: Functor[F], arg2: Monoid[W]): Catchable[[γ]WriterT[F, W, γ]]
-
-
def
ι[A]: (A) ⇒ A
-
def
κ[A, B, C, D, E, F, G](x: G): (A, B, C, D, E, F) ⇒ G
-
def
κ[A, B, C, D](x: D): (A, B, C) ⇒ D
-
def
κ[A, B, C](x: C): (A, B) ⇒ C
-
def
κ[A, B](x: B): (A) ⇒ B
-
def
σ[A, B, C](x: (A) ⇒ (B) ⇒ C, y: (A) ⇒ B, z: A): C
Inherited from AnyRef
Inherited from Any