trait Laws[F[_]] extends Cobind.Laws[F] with Type[F]
Ordering
- Alphabetic
- By Inheritance
Inherited
- Laws
- Type
- Laws
- Type
- Laws
- Type
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Abstract Value Members
Concrete Value Members
-
def
coflatMapAssociativity[A, B, C](fa: F[A], f: (F[A]) ⇒ B, g: (F[B]) ⇒ C): IsEquiv[F[C]]
- Definition Classes
- Laws
-
def
coflatMapIdentity[A, B](fa: F[A]): IsEquiv[F[F[A]]]
- Definition Classes
- Laws
-
def
coflattenCoherence[A, B](fa: F[A], f: (F[A]) ⇒ B): IsEquiv[F[B]]
- Definition Classes
- Laws
-
def
coflattenThroughMap[A](fa: F[A]): IsEquiv[F[F[F[A]]]]
- Definition Classes
- Laws
- def comonadLeftIdentity[A](fa: F[A]): IsEquiv[F[A]]
- def comonadRightIdentity[A, B](fa: F[A], f: (F[A]) ⇒ B): IsEquiv[B]
-
def
covariantComposition[A, B, C](fa: F[A], f: (A) ⇒ B, g: (B) ⇒ C): IsEquiv[F[C]]
- Definition Classes
- Laws
-
def
covariantIdentity[A](fa: F[A]): IsEquiv[F[A]]
- Definition Classes
- Laws
- def extractCoflattenIdentity[A](fa: F[A]): IsEquiv[F[A]]
- def mapCoflatMapCoherence[A, B](fa: F[A], f: (A) ⇒ B): IsEquiv[F[B]]
- def mapCoflattenIdentity[A](fa: F[A]): IsEquiv[F[A]]
This is the API documentation for the Monix library.
Package Overview
monix.execution exposes lower level primitives for dealing with asynchronous execution:
Atomic
types, as alternative tojava.util.concurrent.atomic
monix.eval is for dealing with evaluation of results, thus exposing Task and Coeval.
monix.reactive exposes the
Observable
pattern:Observable
implementationsmonix.types implements type-class shims, to be translated to type-classes provided by libraries such as Cats or Scalaz.
monix.cats is the optional integration with the Cats library, providing translations for the types described in
monix.types
.monix.scalaz is the optional integration with the Scalaz library, providing translations for the types described in
monix.types
.