class CatsMonadToMonoid[F[_], A] extends CatsMonadToSemigroup[F, A] with Monoid[F[A]]
Instance Constructors
- new CatsMonadToMonoid()(implicit F: Monad[F], A: Monoid[A])
Value Members
- final def !=(arg0: Any): Boolean
- final def ##: Int
- final def ==(arg0: Any): Boolean
- final def asInstanceOf[T0]: T0
- def clone(): AnyRef
- def combine(x: F[A], y: F[A]): F[A]
- def combineAll(as: IterableOnce[F[A]]): F[A]
- def combineAllOption(as: IterableOnce[F[A]]): Option[F[A]]
- def combineN(a: F[A], n: Int): F[A]
- def empty: F[A]
- final def eq(arg0: AnyRef): Boolean
- def equals(arg0: AnyRef): Boolean
- final def getClass(): Class[_ <: AnyRef]
- def hashCode(): Int
- def intercalate(middle: F[A]): Semigroup[F[A]]
- def isEmpty(a: F[A])(implicit ev: Eq[F[A]]): Boolean
- final def isInstanceOf[T0]: Boolean
- final def ne(arg0: AnyRef): Boolean
- final def notify(): Unit
- final def notifyAll(): Unit
- def repeatedCombineN(a: F[A], n: Int): F[A]
- def reverse: Monoid[F[A]]
- final def synchronized[T0](arg0: => T0): T0
- def toString(): String
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit
- final def wait(): Unit
Deprecated Value Members
- def finalize(): Unit
Inherited from Monoid[F[A]]
Value Members
- def combineAll(as: IterableOnce[F[A]]): F[A]
- def combineAllOption(as: IterableOnce[F[A]]): Option[F[A]]
- def combineN(a: F[A], n: Int): F[A]
- def isEmpty(a: F[A])(implicit ev: Eq[F[A]]): Boolean
- def reverse: Monoid[F[A]]
Value Members
- def combine(x: F[A], y: F[A]): F[A]
Inherited from Semigroup[F[A]]
Value Members
- def intercalate(middle: F[A]): Semigroup[F[A]]
- def repeatedCombineN(a: F[A], n: Int): F[A]
Inherited from Any
Value Members
- final def asInstanceOf[T0]: T0
- final def isInstanceOf[T0]: Boolean
Ungrouped
- final def !=(arg0: Any): Boolean
- final def ##: Int
- final def ==(arg0: Any): Boolean
- final def asInstanceOf[T0]: T0
- def clone(): AnyRef
- def combine(x: F[A], y: F[A]): F[A]
- def combineAll(as: IterableOnce[F[A]]): F[A]
- def combineAllOption(as: IterableOnce[F[A]]): Option[F[A]]
- def combineN(a: F[A], n: Int): F[A]
- def empty: F[A]
- final def eq(arg0: AnyRef): Boolean
- def equals(arg0: AnyRef): Boolean
- final def getClass(): Class[_ <: AnyRef]
- def hashCode(): Int
- def intercalate(middle: F[A]): Semigroup[F[A]]
- def isEmpty(a: F[A])(implicit ev: Eq[F[A]]): Boolean
- final def isInstanceOf[T0]: Boolean
- final def ne(arg0: AnyRef): Boolean
- final def notify(): Unit
- final def notifyAll(): Unit
- def repeatedCombineN(a: F[A], n: Int): F[A]
- def reverse: Monoid[F[A]]
- final def synchronized[T0](arg0: => T0): T0
- def toString(): String
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit
- final def wait(): Unit
- def finalize(): Unit
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.catnap exposes pure abstractions built on top of the Cats-Effect type classes:
monix.eval is for dealing with evaluation of results, thus exposing Task and Coeval.
monix.reactive exposes the
Observablepattern:Observableimplementationsmonix.tail exposes Iterant for purely functional pull based streaming:
BatchandBatchCursor, the alternatives to Scala'sIterableandIteratorrespectively that we are using within Iterant's encodingYou can control evaluation with type you choose - be it Task, Coeval, cats.effect.IO or your own as long as you provide correct cats-effect or cats typeclass instance.