cats

Type Members

1. type <~[F[_], G[_]] = NaturalTransformation[G, F]

2. trait Alternative[F[_]] extends Applicative[F] with MonoidK[F] with Serializable

3. final class Always[A] extends Eval[A]

   Construct a lazy Eval[A] instance.

4. trait Applicative[F[_]] extends Apply[F] with Serializable

   Applicative functor.

5. trait ApplicativeError[F[_], E] extends Applicative[F]

   An applicative that also allows you to raise and or handle an error value.

6. trait Apply[F[_]] extends Functor[F] with Cartesian[F] with ApplyArityFunctions[F] with Serializable

   Weaker version of Applicative[F]; has apply but not pure.

7. trait ApplyArityFunctions[F[_]] extends AnyRef

8. trait Bimonad[F[_]] extends Monad[F] with Comonad[F] with Serializable

9. trait Cartesian[F[_]] extends Serializable

   Cartesian captures the idea of composing independent effectful values.

10. trait CartesianArityFunctions extends AnyRef

11. trait CoflatMap[F[_]] extends Functor[F] with Serializable

    Must obey the laws defined in cats.

12. trait Comonad[F[_]] extends CoflatMap[F] with Serializable

    Must obey the laws defined in cats.

13. trait CompositeAlternative[F[_], G[_]] extends Alternative[[α]F[G[α]]] with CompositeApplicative[F, G] with CompositeMonoidK[F, G]

14. trait CompositeApplicative[F[_], G[_]] extends Applicative[[α]F[G[α]]] with CompositeApply[F, G]

15. trait CompositeApply[F[_], G[_]] extends Apply[[X]F[G[X]]] with Composite[F, G]

16. trait CompositeFoldable[F[_], G[_]] extends Foldable[[α]F[G[α]]]

    Methods that apply to 2 nested Foldable instances

17. trait CompositeMonoidK[F[_], G[_]] extends MonoidK[[α]F[G[α]]] with CompositeSemigroupK[F, G]

18. trait CompositeReducible[F[_], G[_]] extends Reducible[[α]F[G[α]]] with CompositeFoldable[F, G]

    This class composes two Reducible instances to provide an instance for the nested types.

19. trait CompositeSemigroupK[F[_], G[_]] extends SemigroupK[[α]F[G[α]]]

20. type Eq[A] = algebra.Eq[A]

21. sealed abstract class Eval[A] extends Serializable

    Eval is a monad which controls evaluation.

22. trait EvalGroup[A] extends Group[Eval[A]] with EvalMonoid[A]

23. trait EvalMonoid[A] extends Monoid[Eval[A]] with EvalSemigroup[A]

24. trait EvalSemigroup[A] extends Semigroup[Eval[A]]

25. trait FlatMap[F[_]] extends Apply[F] with Serializable

    FlatMap type class gives us flatMap, which allows us to have a value in a context (F[A]) and then feed that into a function that takes a normal value and returns a value in a context (A => F[B]).

26. trait Foldable[F[_]] extends Serializable

    Data structures that can be folded to a summary value.

27. trait Functor[F[_]] extends Invariant[F] with Serializable

    Functor.

28. type Group[A] = algebra.Group[A]

29. type Id[A] = A

    Identity, encoded as type Id[A] = A, a convenient alias to make identity instances well-kinded.

    Identity, encoded as type Id[A] = A, a convenient alias to make identity instances well-kinded.

    The identity monad can be seen as the ambient monad that encodes the effect of having no effect. It is ambient in the sense that plain pure values are values of Id.

    For instance, the cats.Functor instance for cats.Id allows us to apply a function A => B to an Id[A] and get an Id[B]. However, an Id[A] is the same as A, so all we're doing is applying a pure function of type A => B to a pure value of type A to get a pure value of type B. That is, the instance encodes pure unary function application.

30. final class Later[A] extends Eval[A]

    Construct a lazy Eval[A] instance.

31. trait Monad[F[_]] extends FlatMap[F] with Applicative[F] with Serializable

    Monad.

32. trait MonadCombine[F[_]] extends MonadFilter[F] with Alternative[F] with Serializable

    The combination of a Monad with a MonoidK

33. trait MonadError[F[_], E] extends ApplicativeError[F, E] with Monad[F]

    A monad that also allows you to raise and or handle an error value.

34. trait MonadFilter[F[_]] extends Monad[F] with Serializable

    a Monad equipped with an additional method which allows us to create an "Empty" value for the Monad (for whatever "empty" makes sense for that particular monad).

35. trait MonadReader[F[_], R] extends Monad[F]

    A monad that has the ability to read from an environment.

36. trait MonadState[F[_], S] extends Monad[F]

    A monad that can read, update, and pass along state (e.

37. type Monoid[A] = algebra.Monoid[A]

38. trait MonoidK[F[_]] extends SemigroupK[F] with Serializable

    MonoidK is a universal monoid which operates on kinds.

39. abstract class NonEmptyReducible[F[_], G[_]] extends Reducible[F]

    This class defines a Reducible[F] in terms of a Foldable[G] together with a split method, F[A] => (A, G[A]).

40. sealed trait NotNull[A] extends AnyRef

    An instance of NotNull[A] indicates that A does not have a static type of Null.

41. final case class Now[A](value: A) extends Eval[A] with Product with Serializable

    Construct an eager Eval[A] instance.

42. type Order[A] = algebra.Order[A]

43. type PartialOrder[A] = algebra.PartialOrder[A]

44. trait Reducible[F[_]] extends Foldable[F] with Serializable

    Data structures that can be reduced to a summary value.

45. type Semigroup[A] = algebra.Semigroup[A]

46. trait SemigroupK[F[_]] extends Serializable

    SemigroupK is a universal semigroup which operates on kinds.

47. trait Show[T] extends Serializable

    A type class to provide textual representation.

48. trait Traverse[F[_]] extends Functor[F] with Foldable[F] with Serializable

    Traverse, also known as Traversable.

49. trait Unapply[TC[_[_]], MA] extends AnyRef

    A type class that is used to help guide Scala's type inference to find type class instances for types which have shapes which differ from what their type classes are looking for.

50. type ~>[F[_], G[_]] = NaturalTransformation[F, G]

51. type ⊤ = Any

52. type ⊥ = Nothing