trait Laws[F[_], E] extends Monad.Laws[F] with Type[F, E]
Ordering
- Alphabetic
- By Inheritance
Inherited
- Laws
- Type
- Laws
- Type
- Laws
- Type
- Laws
- Type
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Abstract Value Members
Concrete Value Members
-
def
applicativeComposition[A, B, C](fa: F[A], fab: F[(A) ⇒ B], fbc: F[(B) ⇒ C]): IsEquiv[F[C]]
- Definition Classes
- Laws
- def applicativeErrorHandle[A](e: E, f: (E) ⇒ A): IsEquiv[F[A]]
- def applicativeErrorHandleWith[A](e: E, f: (E) ⇒ F[A]): IsEquiv[F[A]]
-
def
applicativeHomomorphism[A, B](a: A, f: (A) ⇒ B): IsEquiv[F[B]]
- Definition Classes
- Laws
-
def
applicativeIdentity[A](fa: F[A]): IsEquiv[F[A]]
- Definition Classes
- Laws
-
def
applicativeInterchange[A, B](a: A, ff: F[(A) ⇒ B]): IsEquiv[F[B]]
- Definition Classes
- Laws
-
def
applicativeMap[A, B](fa: F[A], f: (A) ⇒ B): IsEquiv[F[B]]
- Definition Classes
- Laws
-
def
applyComposition[A, B, C](fa: F[A], fab: F[(A) ⇒ B], fbc: F[(B) ⇒ C]): IsEquiv[F[C]]
- Definition Classes
- Laws
-
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
flatMapAssociativity[A, B, C](fa: F[A], f: (A) ⇒ F[B], g: (B) ⇒ F[C]): IsEquiv[F[C]]
- Definition Classes
- Laws
-
def
flatMapConsistentApply[A, B](fa: F[A], fab: F[(A) ⇒ B]): IsEquiv[F[B]]
- Definition Classes
- Laws
-
def
flatMapConsistentMap2[A, B, C](fa: F[A], fb: F[B], f: (A, B) ⇒ C): IsEquiv[F[C]]
- Definition Classes
- Laws
- def monadErrorLeftZero[A, B](e: E, f: (A) ⇒ F[B]): IsEquiv[F[B]]
- def onErrorHandleConsistentWithRecover[A](fa: F[A], f: (E) ⇒ A): IsEquiv[F[A]]
- def onErrorHandlePure[A](a: A, f: (E) ⇒ A): IsEquiv[F[A]]
- def onErrorHandleWithConsistentWithRecoverWith[A](fa: F[A], f: (E) ⇒ F[A]): IsEquiv[F[A]]
- def onErrorHandleWithPure[A](a: A, f: (E) ⇒ F[A]): IsEquiv[F[A]]
- def recoverConsistentWithRecoverWith[A](fa: F[A], pf: PartialFunction[E, 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:
Atomictypes, as alternative tojava.util.concurrent.atomicmonix.eval is for dealing with evaluation of results, thus exposing Task and Coeval.
monix.reactive exposes the
Observablepattern:Observableimplementationsmonix.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.