monix-reactive/monix.reactive/Observable/CatsInstances

CatsInstances

class CatsInstances extends Bracket[Observable, Throwable] with Alternative[Observable] with CoflatMap[Observable] with FunctorFilter[Observable] with TaskLift[Observable]

Cats instances for Observable.

trait TaskLift[Observable]
trait FunctionK[Task, Observable]
trait Bracket[Observable, Throwable]
trait Serializable
class Object
trait Matchable
class Any

Value members

Concrete methods

override def ap[A, B](ff: Observable[A => B])(fa: Observable[A]): Observable[B]
Definition Classes
override def apply[A](task: Task[A]): Observable[A]
Definition Classes
TaskLift -> FunctionK
override def bracket[A, B](acquire: Observable[A])(use: A => Observable[B])(release: A => Observable[Unit]): Observable[B]
Definition Classes
Bracket
override def bracketCase[A, B](acquire: Observable[A])(use: A => Observable[B])(release: (A, ExitCase[Throwable]) => Observable[Unit]): Observable[B]
Definition Classes
Bracket
override def coflatMap[A, B](fa: Observable[A])(f: Observable[A] => B): Observable[B]
Definition Classes
override def collect[A, B](fa: Observable[A])(f: PartialFunction[A, B]): Observable[B]
Definition Classes
override def combineK[A](x: Observable[A], y: Observable[A]): Observable[A]
Definition Classes
override def empty[A]: Observable[A]
Definition Classes
override def filter[A](fa: Observable[A])(f: A => Boolean): Observable[A]
Definition Classes
override def flatMap[A, B](fa: Observable[A])(f: A => Observable[B]): Observable[B]
Definition Classes
override def flatten[A](ffa: Observable[Observable[A]]): Observable[A]
Definition Classes
override def functor: Functor[Observable]
Definition Classes
override def guarantee[A](fa: Observable[A])(finalizer: Observable[Unit]): Observable[A]
Definition Classes
Bracket
override def guaranteeCase[A](fa: Observable[A])(finalizer: ExitCase[Throwable] => Observable[Unit]): Observable[A]
Definition Classes
Bracket
override def handleError[A](fa: Observable[A])(f: Throwable => A): Observable[A]
Definition Classes
override def handleErrorWith[A](fa: Observable[A])(f: Throwable => Observable[A]): Observable[A]
Definition Classes
override def map[A, B](fa: Observable[A])(f: A => B): Observable[B]
Definition Classes
override def map2[A, B, Z](fa: Observable[A], fb: Observable[B])(f: (A, B) => Z): Observable[Z]
Definition Classes
override def mapFilter[A, B](fa: Observable[A])(f: A => Option[B]): Observable[B]
Definition Classes
override def pure[A](a: A): Observable[A]
Definition Classes
override def raiseError[A](e: Throwable): Observable[A]
Definition Classes
override def recover[A](fa: Observable[A])(pf: PartialFunction[Throwable, A]): Observable[A]
Definition Classes
override def recoverWith[A](fa: Observable[A])(pf: PartialFunction[Throwable, Observable[A]]): Observable[A]
Definition Classes
override def tailRecM[A, B](a: A)(f: A => Observable[Either[A, B]]): Observable[B]
Definition Classes
override def uncancelable[A](fa: Observable[A]): Observable[A]
Definition Classes
Bracket
override def unit: Observable[Unit]
Definition Classes

Inherited methods

final def *>[A, B](fa: Observable[A])(fb: Observable[B]): Observable[B]

Alias for productR.

Alias for productR.

Inherited from:
Apply
final def <*[A, B](fa: Observable[A])(fb: Observable[B]): Observable[A]

Alias for productL.

Alias for productL.

Inherited from:
Apply
final def <*>[A, B](ff: Observable[A => B])(fa: Observable[A]): Observable[B]

Alias for ap.

Alias for ap.

Inherited from:
Apply
override def adaptError[A](fa: Observable[A])(pf: PartialFunction[Throwable, Throwable]): Observable[A]
Definition Classes
Inherited from:
MonadError
override def algebra[A]: Monoid[Observable[A]]

Given a type A, create a concrete Monoid[F[A]].

Given a type A, create a concrete Monoid[F[A]].

Example:

scala> import cats.implicits._
scala> MonoidK[List].algebra[Long].empty
res0: List[Long] = List()
Definition Classes
Inherited from:
MonoidK
def and[H[_]](h: FunctionK[Task, H]): FunctionK[Task, [_] =>> Tuple2K[Observable, H, _$9]]

Composes two instances of FunctionK into a new FunctionK that transforms one single functor to a cats.data.Tuple2K of two functors.

Composes two instances of FunctionK into a new FunctionK that transforms one single functor to a cats.data.Tuple2K of two functors.

scala> import cats.arrow.FunctionK
scala> val list2option = λ[FunctionK[List, Option]](_.headOption)
scala> val list2vector = λ[FunctionK[List, Vector]](_.toVector)
scala> val optionAndVector = list2option and list2vector
scala> optionAndVector(List(1,2,3))
res0: cats.data.Tuple2K[Option,Vector,Int] = Tuple2K(Some(1),Vector(1, 2, 3))
Inherited from:
FunctionK
def andThen[H[_]](f: FunctionK[Observable, H]): FunctionK[Task, H]

Composes two instances of FunctionK into a new FunctionK with this transformation applied first.

Composes two instances of FunctionK into a new FunctionK with this transformation applied first.

Inherited from:
FunctionK
def ap10[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, Z](f: Observable[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9) => Z])(f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9]): Observable[Z]
Inherited from:
ApplyArityFunctions
def ap11[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, Z](f: Observable[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10) => Z])(f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10]): Observable[Z]
Inherited from:
ApplyArityFunctions
def ap12[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, Z](f: Observable[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11) => Z])(f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11]): Observable[Z]
Inherited from:
ApplyArityFunctions
def ap13[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, Z](f: Observable[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12) => Z])(f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12]): Observable[Z]
Inherited from:
ApplyArityFunctions
def ap14[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, Z](f: Observable[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13) => Z])(f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12], f13: Observable[A13]): Observable[Z]
Inherited from:
ApplyArityFunctions
def ap15[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, Z](f: Observable[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14) => Z])(f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12], f13: Observable[A13], f14: Observable[A14]): Observable[Z]
Inherited from:
ApplyArityFunctions
def ap16[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, Z](f: Observable[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15) => Z])(f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12], f13: Observable[A13], f14: Observable[A14], f15: Observable[A15]): Observable[Z]
Inherited from:
ApplyArityFunctions
def ap17[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, Z](f: Observable[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16) => Z])(f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12], f13: Observable[A13], f14: Observable[A14], f15: Observable[A15], f16: Observable[A16]): Observable[Z]
Inherited from:
ApplyArityFunctions
def ap18[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, Z](f: Observable[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17) => Z])(f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12], f13: Observable[A13], f14: Observable[A14], f15: Observable[A15], f16: Observable[A16], f17: Observable[A17]): Observable[Z]
Inherited from:
ApplyArityFunctions
def ap19[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, Z](f: Observable[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18) => Z])(f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12], f13: Observable[A13], f14: Observable[A14], f15: Observable[A15], f16: Observable[A16], f17: Observable[A17], f18: Observable[A18]): Observable[Z]
Inherited from:
ApplyArityFunctions
override def ap2[A, B, Z](ff: Observable[(A, B) => Z])(fa: Observable[A], fb: Observable[B]): Observable[Z]
Definition Classes
Inherited from:
FlatMap
def ap20[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, A19, Z](f: Observable[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, A19) => Z])(f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12], f13: Observable[A13], f14: Observable[A14], f15: Observable[A15], f16: Observable[A16], f17: Observable[A17], f18: Observable[A18], f19: Observable[A19]): Observable[Z]
Inherited from:
ApplyArityFunctions
def ap21[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, A19, A20, Z](f: Observable[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, A19, A20) => Z])(f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12], f13: Observable[A13], f14: Observable[A14], f15: Observable[A15], f16: Observable[A16], f17: Observable[A17], f18: Observable[A18], f19: Observable[A19], f20: Observable[A20]): Observable[Z]
Inherited from:
ApplyArityFunctions
def ap22[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, A19, A20, A21, Z](f: Observable[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, A19, A20, A21) => Z])(f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12], f13: Observable[A13], f14: Observable[A14], f15: Observable[A15], f16: Observable[A16], f17: Observable[A17], f18: Observable[A18], f19: Observable[A19], f20: Observable[A20], f21: Observable[A21]): Observable[Z]
Inherited from:
ApplyArityFunctions
def ap3[A0, A1, A2, Z](f: Observable[(A0, A1, A2) => Z])(f0: Observable[A0], f1: Observable[A1], f2: Observable[A2]): Observable[Z]
Inherited from:
ApplyArityFunctions
def ap4[A0, A1, A2, A3, Z](f: Observable[(A0, A1, A2, A3) => Z])(f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3]): Observable[Z]
Inherited from:
ApplyArityFunctions
def ap5[A0, A1, A2, A3, A4, Z](f: Observable[(A0, A1, A2, A3, A4) => Z])(f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4]): Observable[Z]
Inherited from:
ApplyArityFunctions
def ap6[A0, A1, A2, A3, A4, A5, Z](f: Observable[(A0, A1, A2, A3, A4, A5) => Z])(f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5]): Observable[Z]
Inherited from:
ApplyArityFunctions
def ap7[A0, A1, A2, A3, A4, A5, A6, Z](f: Observable[(A0, A1, A2, A3, A4, A5, A6) => Z])(f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6]): Observable[Z]
Inherited from:
ApplyArityFunctions
def ap8[A0, A1, A2, A3, A4, A5, A6, A7, Z](f: Observable[(A0, A1, A2, A3, A4, A5, A6, A7) => Z])(f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7]): Observable[Z]
Inherited from:
ApplyArityFunctions
def ap9[A0, A1, A2, A3, A4, A5, A6, A7, A8, Z](f: Observable[(A0, A1, A2, A3, A4, A5, A6, A7, A8) => Z])(f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8]): Observable[Z]
Inherited from:
ApplyArityFunctions
def as[A, B](fa: Observable[A], b: B): Observable[B]

Replaces the A value in F[A] with the supplied value.

Replaces the A value in F[A] with the supplied value.

Example:

scala> import cats.Functor
scala> import cats.implicits.catsStdInstancesForList

scala> Functor[List].as(List(1,2,3), "hello")
res0: List[String] = List(hello, hello, hello)
Inherited from:
Functor
def attempt[A](fa: Observable[A]): Observable[Either[Throwable, A]]

Handle errors by turning them into scala.util.Either values.

Handle errors by turning them into scala.util.Either values.

If there is no error, then an scala.util.Right value will be returned instead.

All non-fatal errors should be handled by this method.

Inherited from:
ApplicativeError
def attemptNarrow[EE <: Throwable, A](fa: Observable[A])(implicit tag: ClassTag[EE], ev: EE <:< Throwable): Observable[Either[EE, A]]

Similar to attempt, but it only handles errors of type EE.

Similar to attempt, but it only handles errors of type EE.

Inherited from:
ApplicativeError
def attemptT[A](fa: Observable[A]): EitherT[Observable, Throwable, A]

Similar to attempt, but wraps the result in a cats.data.EitherT for convenience.

Similar to attempt, but wraps the result in a cats.data.EitherT for convenience.

Inherited from:
ApplicativeError
def attemptTap[A, B](fa: Observable[A])(f: Either[Throwable, A] => Observable[B]): Observable[A]

Reifies the value or error of the source and performs an effect on the result, then recovers the original value or error back into F.

Reifies the value or error of the source and performs an effect on the result, then recovers the original value or error back into F.

Note that if the effect returned by f fails, the resulting effect will fail too.

Alias for fa.attempt.flatTap(f).rethrow for convenience.

Example:

scala> import cats.implicits._
scala> import scala.util.{Try, Success, Failure}

scala> def checkError(result: Either[Throwable, Int]): Try[String] = result.fold(_ => Failure(new java.lang.Exception), _ => Success("success"))

scala> val a: Try[Int] = Failure(new Throwable("failed"))
scala> a.attemptTap(checkError)
res0: scala.util.Try[Int] = Failure(java.lang.Exception)

scala> val b: Try[Int] = Success(1)
scala> b.attemptTap(checkError)
res1: scala.util.Try[Int] = Success(1)
Inherited from:
MonadError
def catchNonFatal[A](a: => A)(implicit ev: Throwable <:< Throwable): Observable[A]

Often E is Throwable. Here we try to call pure or catch and raise.

Often E is Throwable. Here we try to call pure or catch and raise.

Inherited from:
ApplicativeError
def catchNonFatalEval[A](a: Eval[A])(implicit ev: Throwable <:< Throwable): Observable[A]

Often E is Throwable. Here we try to call pure or catch and raise

Often E is Throwable. Here we try to call pure or catch and raise

Inherited from:
ApplicativeError
def catchOnly[T >: Null <: Throwable]: CatchOnlyPartiallyApplied[T, Observable, Throwable]

Evaluates the specified block, catching exceptions of the specified type. Uncaught exceptions are propagated.

Evaluates the specified block, catching exceptions of the specified type. Uncaught exceptions are propagated.

Inherited from:
ApplicativeError
def coflatten[A](fa: Observable[A]): Observable[Observable[A]]

coflatten is the dual of flatten on FlatMap. Whereas flatten removes a layer of F, coflatten adds a layer of F

coflatten is the dual of flatten on FlatMap. Whereas flatten removes a layer of F, coflatten adds a layer of F

Example:

scala> import cats.implicits._
scala> import cats.CoflatMap
scala> val fa = Some(3)
fa: Option[Int] = Some(3)
scala> CoflatMap[Option].coflatten(fa)
res0: Option[Option[Int]] = Some(Some(3))
Inherited from:
CoflatMap
def combineKEval[A](x: Observable[A], y: Eval[Observable[A]]): Eval[Observable[A]]

Similar to combineK but uses Eval to allow for laziness in the second argument. This can allow for "short-circuiting" of computations.

Similar to combineK but uses Eval to allow for laziness in the second argument. This can allow for "short-circuiting" of computations.

NOTE: the default implementation of combineKEval does not short-circuit computations. For data structures that can benefit from laziness, SemigroupK instances should override this method.

In the following example, x.combineK(bomb) would result in an error, but combineKEval "short-circuits" the computation. x is Some and thus the result of bomb doesn't even need to be evaluated in order to determine that the result of combineKEval should be x.

scala> import cats.{Eval, Later}
scala> import cats.implicits._
scala> val bomb: Eval[Option[Int]] = Later(sys.error("boom"))
scala> val x: Option[Int] = Some(42)
scala> x.combineKEval(bomb).value
res0: Option[Int] = Some(42)
Inherited from:
SemigroupK
def compose[E[_]](f: FunctionK[E, Task]): FunctionK[E, Observable]

Composes two instances of FunctionK into a new FunctionK with this transformation applied last.

Composes two instances of FunctionK into a new FunctionK with this transformation applied last.

Inherited from:
FunctionK
def compose[G[_] : Functor]: Functor[[α] =>> Observable[G[α]]]
Inherited from:
Functor
def compose[G[_] : Invariant]: Invariant[[α] =>> Observable[G[α]]]

Compose Invariant F[_] and G[_] then produce Invariant[F[G[_]]] using their imap.

Compose Invariant F[_] and G[_] then produce Invariant[F[G[_]]] using their imap.

Example:

scala> import cats.implicits._
scala> import scala.concurrent.duration._

scala> val durSemigroupList: Semigroup[List[FiniteDuration]] =
    | Invariant[Semigroup].compose[List].imap(Semigroup[List[Long]])(Duration.fromNanos)(_.toNanos)
scala> durSemigroupList.combine(List(2.seconds, 3.seconds), List(4.seconds))
res1: List[FiniteDuration] = List(2 seconds, 3 seconds, 4 seconds)
Inherited from:
Invariant
override def compose[G[_] : Applicative]: Alternative[[α] =>> Observable[G[α]]]
Definition Classes
Inherited from:
Alternative
override def compose[G[_]]: MonoidK[[α] =>> Observable[G[α]]]

Given a kind G, create an "composed" MonoidK[F[G[_]]

Given a kind G, create an "composed" MonoidK[F[G[_]]

Example:

scala> import cats.implicits._
scala> val monoidK = MonoidK[List].compose[Option]
scala> monoidK.combineK(List(Some(1)), List(Some(2), None))
res0: List[Option[Int]] = List(Some(1), Some(2), None)
Definition Classes
Inherited from:
MonoidK
def compose[G[_] : Apply]: Apply[[α] =>> Observable[G[α]]]

Compose an Apply[F] and an Apply[G] into an Apply[λ[α => F[G[α]]]].

Compose an Apply[F] and an Apply[G] into an Apply[λ[α => F[G[α]]]].

Example:

scala> import cats.implicits._

scala> val alo = Apply[List].compose[Option]

scala> alo.product(List(None, Some(true), Some(false)), List(Some(2), None))
res1: List[Option[(Boolean, Int)]] = List(None, None, Some((true,2)), None, Some((false,2)), None)
Inherited from:
Apply
def composeApply[G[_] : Apply]: InvariantSemigroupal[[α] =>> Observable[G[α]]]
Inherited from:
InvariantSemigroupal
override def composeContravariant[G[_] : Contravariant]: Contravariant[[α] =>> Observable[G[α]]]
Definition Classes
Inherited from:
Functor
def composeContravariantMonoidal[G[_] : ContravariantMonoidal]: ContravariantMonoidal[[α] =>> Observable[G[α]]]

Compose an Applicative[F] and a ContravariantMonoidal[G] into a ContravariantMonoidal[λ[α => F[G[α]]]].

Compose an Applicative[F] and a ContravariantMonoidal[G] into a ContravariantMonoidal[λ[α => F[G[α]]]].

Example:

scala> import cats.kernel.Comparison
scala> import cats.implicits._

// compares strings by alphabetical order
scala> val alpha: Order[String] = Order[String]

// compares strings by their length
scala> val strLength: Order[String] = Order.by[String, Int](_.length)

scala> val stringOrders: List[Order[String]] = List(alpha, strLength)

// first comparison is with alpha order, second is with string length
scala> stringOrders.map(o => o.comparison("abc", "de"))
res0: List[Comparison] = List(LessThan, GreaterThan)

scala> val le = Applicative[List].composeContravariantMonoidal[Order]

// create Int orders that convert ints to strings and then use the string orders
scala> val intOrders: List[Order[Int]] = le.contramap(stringOrders)(_.toString)

// first comparison is with alpha order, second is with string length
scala> intOrders.map(o => o.comparison(12, 3))
res1: List[Comparison] = List(LessThan, GreaterThan)

// create the `product` of the string order list and the int order list
// `p` contains a list of the following orders:
// 1. (alpha comparison on strings followed by alpha comparison on ints)
// 2. (alpha comparison on strings followed by length comparison on ints)
// 3. (length comparison on strings followed by alpha comparison on ints)
// 4. (length comparison on strings followed by length comparison on ints)
scala> val p: List[Order[(String, Int)]] = le.product(stringOrders, intOrders)

scala> p.map(o => o.comparison(("abc", 12), ("def", 3)))
res2: List[Comparison] = List(LessThan, LessThan, LessThan, GreaterThan)
Inherited from:
Applicative
def composeFunctor[G[_] : Functor]: Invariant[[α] =>> Observable[G[α]]]

Compose Invariant F[_] and Functor G[_] then produce Invariant[F[G[_]]] using F's imap and G's map.

Compose Invariant F[_] and Functor G[_] then produce Invariant[F[G[_]]] using F's imap and G's map.

Example:

scala> import cats.implicits._
scala> import scala.concurrent.duration._

scala> val durSemigroupList: Semigroup[List[FiniteDuration]] =
    | Invariant[Semigroup]
    |   .composeFunctor[List]
    |   .imap(Semigroup[List[Long]])(Duration.fromNanos)(_.toNanos)
scala> durSemigroupList.combine(List(2.seconds, 3.seconds), List(4.seconds))
res1: List[FiniteDuration] = List(2 seconds, 3 seconds, 4 seconds)
Inherited from:
Invariant
def ensure[A](fa: Observable[A])(error: => Throwable)(predicate: A => Boolean): Observable[A]

Turns a successful value into an error if it does not satisfy a given predicate.

Turns a successful value into an error if it does not satisfy a given predicate.

Inherited from:
MonadError
def ensureOr[A](fa: Observable[A])(error: A => Throwable)(predicate: A => Boolean): Observable[A]

Turns a successful value into an error specified by the error function if it does not satisfy a given predicate.

Turns a successful value into an error specified by the error function if it does not satisfy a given predicate.

Inherited from:
MonadError
def filterNot[A](fa: Observable[A])(f: A => Boolean): Observable[A]

Apply a filter to a structure such that the output structure contains all A elements in the input structure that do not satisfy the predicate f.

Apply a filter to a structure such that the output structure contains all A elements in the input structure that do not satisfy the predicate f.

Inherited from:
FunctorFilter
def flatTap[A, B](fa: Observable[A])(f: A => Observable[B]): Observable[A]

Apply a monadic function and discard the result while keeping the effect.

Apply a monadic function and discard the result while keeping the effect.

scala> import cats._, implicits._
scala> Option(1).flatTap(_ => None)
res0: Option[Int] = None
scala> Option(1).flatTap(_ => Some("123"))
res1: Option[Int] = Some(1)
scala> def nCats(n: Int) = List.fill(n)("cat")
nCats: (n: Int)List[String]
scala> List[Int](0).flatTap(nCats)
res2: List[Int] = List()
scala> List[Int](4).flatTap(nCats)
res3: List[Int] = List(4, 4, 4, 4)
Inherited from:
FlatMap
def flattenOption[A](fa: Observable[Option[A]]): Observable[A]

"Flatten" out a structure by collapsing Options. Equivalent to using mapFilter with identity.

"Flatten" out a structure by collapsing Options. Equivalent to using mapFilter with identity.

Example:

scala> import cats.implicits._
scala> val l: List[Option[Int]] = List(Some(1), None, Some(3), None)
scala> l.flattenOption
res0: List[Int] = List(1, 3)
Inherited from:
FunctorFilter
final def fmap[A, B](fa: Observable[A])(f: A => B): Observable[B]

Alias for map, since map can't be injected as syntax if the implementing type already had a built-in .map method.

Alias for map, since map can't be injected as syntax if the implementing type already had a built-in .map method.

Example:

scala> import cats.implicits._

scala> val m: Map[Int, String] = Map(1 -> "hi", 2 -> "there", 3 -> "you")

scala> m.fmap(_ ++ "!")
res0: Map[Int,String] = Map(1 -> hi!, 2 -> there!, 3 -> you!)
Inherited from:
Functor
@noop
def foreverM[A, B](fa: Observable[A]): Observable[B]

Like an infinite loop of >> calls. This is most useful effect loops that you want to run forever in for instance a server.

Like an infinite loop of >> calls. This is most useful effect loops that you want to run forever in for instance a server.

This will be an infinite loop, or it will return an F[Nothing].

Be careful using this. For instance, a List of length k will produce a list of length k^n at iteration n. This means if k = 0, we return an empty list, if k = 1, we loop forever allocating single element lists, but if we have a k > 1, we will allocate exponentially increasing memory and very quickly OOM.

Inherited from:
FlatMap
def fproduct[A, B](fa: Observable[A])(f: A => B): Observable[(A, B)]

Tuple the values in fa with the result of applying a function with the value

Tuple the values in fa with the result of applying a function with the value

Example:

scala> import cats.Functor
scala> import cats.implicits.catsStdInstancesForOption

scala> Functor[Option].fproduct(Option(42))(_.toString)
res0: Option[(Int, String)] = Some((42,42))
Inherited from:
Functor
def fproductLeft[A, B](fa: Observable[A])(f: A => B): Observable[(B, A)]

Pair the result of function application with A.

Pair the result of function application with A.

Example:

scala> import cats.Functor
scala> import cats.implicits.catsStdInstancesForOption

scala> Functor[Option].fproductLeft(Option(42))(_.toString)
res0: Option[(String, Int)] = Some((42,42))
Inherited from:
Functor
def fromEither[A](x: Either[Throwable, A]): Observable[A]

Convert from scala.Either

Convert from scala.Either

Example:

scala> import cats.ApplicativeError
scala> import cats.instances.option._

scala> ApplicativeError[Option, Unit].fromEither(Right(1))
res0: scala.Option[Int] = Some(1)

scala> ApplicativeError[Option, Unit].fromEither(Left(()))
res1: scala.Option[Nothing] = None
Inherited from:
ApplicativeError
def fromOption[A](oa: Option[A], ifEmpty: => Throwable): Observable[A]

Convert from scala.Option

Convert from scala.Option

Example:

scala> import cats.implicits._
scala> import cats.ApplicativeError
scala> val F = ApplicativeError[Either[String, *], String]

scala> F.fromOption(Some(1), "Empty")
res0: scala.Either[String, Int] = Right(1)

scala> F.fromOption(Option.empty[Int], "Empty")
res1: scala.Either[String, Int] = Left(Empty)
Inherited from:
ApplicativeError
def fromTry[A](t: Try[A])(implicit ev: Throwable <:< Throwable): Observable[A]

If the error type is Throwable, we can convert from a scala.util.Try

If the error type is Throwable, we can convert from a scala.util.Try

Inherited from:
ApplicativeError
def fromValidated[A](x: Validated[Throwable, A]): Observable[A]

Convert from cats.data.Validated

Convert from cats.data.Validated

Example:

scala> import cats.implicits._
scala> import cats.ApplicativeError

scala> ApplicativeError[Option, Unit].fromValidated(1.valid[Unit])
res0: scala.Option[Int] = Some(1)

scala> ApplicativeError[Option, Unit].fromValidated(().invalid[Int])
res1: scala.Option[Int] = None
Inherited from:
ApplicativeError
def guard(condition: Boolean): Observable[Unit]

Return ().pure[F] if condition is true, empty otherwise

Return ().pure[F] if condition is true, empty otherwise

Example:

scala> import cats.implicits._
scala> def even(i: Int): Option[String] = Alternative[Option].guard(i % 2 == 0).as("even")
scala> even(2)
res0: Option[String] = Some(even)
scala> even(3)
res1: Option[String] = None
Inherited from:
Alternative
@noop
def ifA[A](fcond: Observable[Boolean])(ifTrue: Observable[A], ifFalse: Observable[A]): Observable[A]

An if-then-else lifted into the F context. This function combines the effects of the fcond condition and of the two branches, in the order in which they are given.

An if-then-else lifted into the F context. This function combines the effects of the fcond condition and of the two branches, in the order in which they are given.

The value of the result is, depending on the value of the condition, the value of the first argument, or the value of the second argument.

Example:

scala> import cats.implicits._

scala> val b1: Option[Boolean] = Some(true)
scala> val asInt1: Option[Int] = Apply[Option].ifA(b1)(Some(1), Some(0))
scala> asInt1.get
res0: Int = 1

scala> val b2: Option[Boolean] = Some(false)
scala> val asInt2: Option[Int] = Apply[Option].ifA(b2)(Some(1), Some(0))
scala> asInt2.get
res1: Int = 0

scala> val b3: Option[Boolean] = Some(true)
scala> val asInt3: Option[Int] = Apply[Option].ifA(b3)(Some(1), None)
asInt2: Option[Int] = None
Inherited from:
Apply
@noop
def ifElseM[A](branches: (Observable[Boolean], Observable[A])*)(els: Observable[A]): Observable[A]

Simulates an if/else-if/else in the context of an F. It evaluates conditions until one evaluates to true, and returns the associated F[A]. If no condition is true, returns els.

Simulates an if/else-if/else in the context of an F. It evaluates conditions until one evaluates to true, and returns the associated F[A]. If no condition is true, returns els.

scala> import cats._
scala> Monad[Eval].ifElseM(Eval.later(false) -> Eval.later(1), Eval.later(true) -> Eval.later(2))(Eval.later(5)).value
res0: Int = 2

Based on a gist by Daniel Spiewak with a stack-safe implementation due to P. Oscar Boykin

See also:
Inherited from:
Monad
@noop
def ifF[A](fb: Observable[Boolean])(ifTrue: => A, ifFalse: => A): Observable[A]

Lifts if to Functor

Lifts if to Functor

Example:

scala> import cats.Functor
scala> import cats.implicits.catsStdInstancesForList

scala> Functor[List].ifF(List(true, false, false))(1, 0)
res0: List[Int] = List(1, 0, 0)
Inherited from:
Functor
@noop
def ifM[B](fa: Observable[Boolean])(ifTrue: => Observable[B], ifFalse: => Observable[B]): Observable[B]

if lifted into monad.

if lifted into monad.

Inherited from:
FlatMap
override def imap[A, B](fa: Observable[A])(f: A => B)(g: B => A): Observable[B]
Definition Classes
Inherited from:
Functor
@noop
def iterateForeverM[A, B](a: A)(f: A => Observable[A]): Observable[B]

iterateForeverM is almost exclusively useful for effect types. For instance, A may be some state, we may take the current state, run some effect to get a new state and repeat.

iterateForeverM is almost exclusively useful for effect types. For instance, A may be some state, we may take the current state, run some effect to get a new state and repeat.

Inherited from:
FlatMap
def iterateUntil[A](f: Observable[A])(p: A => Boolean): Observable[A]

Execute an action repeatedly until its result satisfies the given predicate and return that result, discarding all others.

Execute an action repeatedly until its result satisfies the given predicate and return that result, discarding all others.

Inherited from:
Monad
def iterateUntilM[A](init: A)(f: A => Observable[A])(p: A => Boolean): Observable[A]

Apply a monadic function iteratively until its result satisfies the given predicate and return that result.

Apply a monadic function iteratively until its result satisfies the given predicate and return that result.

Inherited from:
Monad
def iterateWhile[A](f: Observable[A])(p: A => Boolean): Observable[A]

Execute an action repeatedly until its result fails to satisfy the given predicate and return that result, discarding all others.

Execute an action repeatedly until its result fails to satisfy the given predicate and return that result, discarding all others.

Inherited from:
Monad
def iterateWhileM[A](init: A)(f: A => Observable[A])(p: A => Boolean): Observable[A]

Apply a monadic function iteratively until its result fails to satisfy the given predicate and return that result.

Apply a monadic function iteratively until its result fails to satisfy the given predicate and return that result.

Inherited from:
Monad
def lift[A, B](f: A => B): Observable[A] => Observable[B]

Lift a function f to operate on Functors

Lift a function f to operate on Functors

Example:

scala> import cats.Functor
scala> import cats.implicits.catsStdInstancesForOption

scala> val o = Option(42)
scala> Functor[Option].lift((x: Int) => x + 10)(o)
res0: Option[Int] = Some(52)
Inherited from:
Functor
def map10[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9])(f: (A0, A1, A2, A3, A4, A5, A6, A7, A8, A9) => Z): Observable[Z]
Inherited from:
ApplyArityFunctions
def map11[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10])(f: (A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10) => Z): Observable[Z]
Inherited from:
ApplyArityFunctions
def map12[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11])(f: (A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11) => Z): Observable[Z]
Inherited from:
ApplyArityFunctions
def map13[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12])(f: (A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12) => Z): Observable[Z]
Inherited from:
ApplyArityFunctions
def map14[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12], f13: Observable[A13])(f: (A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13) => Z): Observable[Z]
Inherited from:
ApplyArityFunctions
def map15[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12], f13: Observable[A13], f14: Observable[A14])(f: (A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14) => Z): Observable[Z]
Inherited from:
ApplyArityFunctions
def map16[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12], f13: Observable[A13], f14: Observable[A14], f15: Observable[A15])(f: (A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15) => Z): Observable[Z]
Inherited from:
ApplyArityFunctions
def map17[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12], f13: Observable[A13], f14: Observable[A14], f15: Observable[A15], f16: Observable[A16])(f: (A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16) => Z): Observable[Z]
Inherited from:
ApplyArityFunctions
def map18[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12], f13: Observable[A13], f14: Observable[A14], f15: Observable[A15], f16: Observable[A16], f17: Observable[A17])(f: (A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17) => Z): Observable[Z]
Inherited from:
ApplyArityFunctions
def map19[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12], f13: Observable[A13], f14: Observable[A14], f15: Observable[A15], f16: Observable[A16], f17: Observable[A17], f18: Observable[A18])(f: (A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18) => Z): Observable[Z]
Inherited from:
ApplyArityFunctions
def map20[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, A19, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12], f13: Observable[A13], f14: Observable[A14], f15: Observable[A15], f16: Observable[A16], f17: Observable[A17], f18: Observable[A18], f19: Observable[A19])(f: (A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, A19) => Z): Observable[Z]
Inherited from:
ApplyArityFunctions
def map21[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, A19, A20, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12], f13: Observable[A13], f14: Observable[A14], f15: Observable[A15], f16: Observable[A16], f17: Observable[A17], f18: Observable[A18], f19: Observable[A19], f20: Observable[A20])(f: (A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, A19, A20) => Z): Observable[Z]
Inherited from:
ApplyArityFunctions
def map22[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, A19, A20, A21, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12], f13: Observable[A13], f14: Observable[A14], f15: Observable[A15], f16: Observable[A16], f17: Observable[A17], f18: Observable[A18], f19: Observable[A19], f20: Observable[A20], f21: Observable[A21])(f: (A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, A19, A20, A21) => Z): Observable[Z]
Inherited from:
ApplyArityFunctions
def map2Eval[A, B, Z](fa: Observable[A], fb: Eval[Observable[B]])(f: (A, B) => Z): Eval[Observable[Z]]

Similar to map2 but uses Eval to allow for laziness in the F[B] argument. This can allow for "short-circuiting" of computations.

Similar to map2 but uses Eval to allow for laziness in the F[B] argument. This can allow for "short-circuiting" of computations.

NOTE: the default implementation of map2Eval does not short-circuit computations. For data structures that can benefit from laziness, Apply instances should override this method.

In the following example, x.map2(bomb)(_ + _) would result in an error, but map2Eval "short-circuits" the computation. x is None and thus the result of bomb doesn't even need to be evaluated in order to determine that the result of map2Eval should be None.

scala> import cats.{Eval, Later}
scala> import cats.implicits._
scala> val bomb: Eval[Option[Int]] = Later(sys.error("boom"))
scala> val x: Option[Int] = None
scala> x.map2Eval(bomb)(_ + _).value
res0: Option[Int] = None
Inherited from:
Apply
def map3[A0, A1, A2, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2])(f: (A0, A1, A2) => Z): Observable[Z]
Inherited from:
ApplyArityFunctions
def map4[A0, A1, A2, A3, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3])(f: (A0, A1, A2, A3) => Z): Observable[Z]
Inherited from:
ApplyArityFunctions
def map5[A0, A1, A2, A3, A4, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4])(f: (A0, A1, A2, A3, A4) => Z): Observable[Z]
Inherited from:
ApplyArityFunctions
def map6[A0, A1, A2, A3, A4, A5, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5])(f: (A0, A1, A2, A3, A4, A5) => Z): Observable[Z]
Inherited from:
ApplyArityFunctions
def map7[A0, A1, A2, A3, A4, A5, A6, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6])(f: (A0, A1, A2, A3, A4, A5, A6) => Z): Observable[Z]
Inherited from:
ApplyArityFunctions
def map8[A0, A1, A2, A3, A4, A5, A6, A7, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7])(f: (A0, A1, A2, A3, A4, A5, A6, A7) => Z): Observable[Z]
Inherited from:
ApplyArityFunctions
def map9[A0, A1, A2, A3, A4, A5, A6, A7, A8, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8])(f: (A0, A1, A2, A3, A4, A5, A6, A7, A8) => Z): Observable[Z]
Inherited from:
ApplyArityFunctions
def mproduct[A, B](fa: Observable[A])(f: A => Observable[B]): Observable[(A, B)]

Pair A with the result of function application.

Pair A with the result of function application.

Example:

scala> import cats.implicits._
scala> List("12", "34", "56").mproduct(_.toList)
res0: List[(String, Char)] = List((12,1), (12,2), (34,3), (34,4), (56,5), (56,6))
Inherited from:
FlatMap
def narrow[F0 <: (Task)]: FunctionK[F0, Observable]

Narrows the input type of this FunctionK from F to F0

Narrows the input type of this FunctionK from F to F0

Inherited from:
FunctionK
def onCancel[A](fa: Observable[A])(finalizer: Observable[Unit]): Observable[A]

Executes the given finalizer when the source is canceled.

Executes the given finalizer when the source is canceled.

The typical use case for this function arises in the implementation of concurrent abstractions, which generally consist of operations that perform asynchronous waiting after concurrently modifying some state: in case the user asks for cancelation, we want to interrupt the waiting operation, and restore the state to its previous value.

waitingOp.onCancel(restoreState)

A direct use of bracket is not a good fit for this case as it would make the waiting action uncancelable.

NOTE: This function handles interruption only, you need to take care of the success and error case elsewhere in your code

See also:

guaranteeCase for the version that can discriminate between termination conditions

bracket for the more general operation

Concurrent.continual when you have a use case similar to the cancel/restore example above, but require access to the result of F[A]

Inherited from:
Bracket
def onError[A](fa: Observable[A])(pf: PartialFunction[Throwable, Observable[Unit]]): Observable[A]

Execute a callback on certain errors, then rethrow them. Any non matching error is rethrown as well.

Execute a callback on certain errors, then rethrow them. Any non matching error is rethrown as well.

In the following example, only one of the errors is logged, but they are both rethrown, to be possibly handled by another layer of the program:

scala> import cats._, data._, implicits._

scala> case class Err(msg: String)

scala> type F[A] = EitherT[State[String, *], Err, A]

scala> val action: PartialFunction[Err, F[Unit]] = {
    |   case Err("one") => EitherT.liftF(State.set("one"))
    | }

scala> val prog1: F[Int] = (Err("one")).raiseError[F, Int]
scala> val prog2: F[Int] = (Err("two")).raiseError[F, Int]

scala> prog1.onError(action).value.run("").value

res0: (String, Either[Err,Int]) = (one,Left(Err(one)))

scala> prog2.onError(action).value.run("").value
res1: (String, Either[Err,Int]) = ("",Left(Err(two)))
Inherited from:
ApplicativeError
def or[H[_]](h: FunctionK[H, Observable]): FunctionK[[_] =>> EitherK[Task, H, _$6], Observable]

Composes two instances of FunctionK into a new FunctionK that transforms a cats.data.EitherK to a single functor.

Composes two instances of FunctionK into a new FunctionK that transforms a cats.data.EitherK to a single functor.

This transformation will be used to transform left F values while h will be used to transform right H values.

Inherited from:
FunctionK
def point[A](a: A): Observable[A]

point lifts any value into a Monoidal Functor.

point lifts any value into a Monoidal Functor.

Example:

scala> import cats.implicits._

scala> InvariantMonoidal[Option].point(10)
res0: Option[Int] = Some(10)
Inherited from:
InvariantMonoidal
override def product[A, B](fa: Observable[A], fb: Observable[B]): Observable[(A, B)]
Definition Classes
Inherited from:
FlatMap
override def productL[A, B](fa: Observable[A])(fb: Observable[B]): Observable[A]
Definition Classes
Inherited from:
FlatMap
def productLEval[A, B](fa: Observable[A])(fb: Eval[Observable[B]]): Observable[A]

Sequentially compose two actions, discarding any value produced by the second. This variant of productL also lets you define the evaluation strategy of the second action. For instance you can evaluate it only ''after'' the first action has finished:

Sequentially compose two actions, discarding any value produced by the second. This variant of productL also lets you define the evaluation strategy of the second action. For instance you can evaluate it only ''after'' the first action has finished:

scala> import cats.Eval
scala> import cats.implicits._
scala> var count = 0
scala> val fa: Option[Int] = Some(3)
scala> def fb: Option[Unit] = Some(count += 1)
scala> fa.productLEval(Eval.later(fb))
res0: Option[Int] = Some(3)
scala> assert(count == 1)
scala> none[Int].productLEval(Eval.later(fb))
res1: Option[Int] = None
scala> assert(count == 1)
Inherited from:
FlatMap
override def productR[A, B](fa: Observable[A])(fb: Observable[B]): Observable[B]
Definition Classes
Inherited from:
FlatMap
def productREval[A, B](fa: Observable[A])(fb: Eval[Observable[B]]): Observable[B]

Sequentially compose two actions, discarding any value produced by the first. This variant of productR also lets you define the evaluation strategy of the second action. For instance you can evaluate it only ''after'' the first action has finished:

Sequentially compose two actions, discarding any value produced by the first. This variant of productR also lets you define the evaluation strategy of the second action. For instance you can evaluate it only ''after'' the first action has finished:

scala> import cats.Eval
scala> import cats.implicits._
scala> val fa: Option[Int] = Some(3)
scala> def fb: Option[String] = Some("foo")
scala> fa.productREval(Eval.later(fb))
res0: Option[String] = Some(foo)
Inherited from:
FlatMap
def redeem[A, B](fa: Observable[A])(recover: Throwable => B, f: A => B): Observable[B]

Returns a new value that transforms the result of the source, given the recover or map functions, which get executed depending on whether the result is successful or if it ends in error.

Returns a new value that transforms the result of the source, given the recover or map functions, which get executed depending on whether the result is successful or if it ends in error.

This is an optimization on usage of attempt and map, this equivalence being available:

 fa.redeem(fe, fs) <-> fa.attempt.map(_.fold(fe, fs))

Usage of redeem subsumes handleError because:

 fa.redeem(fe, id) <-> fa.handleError(fe)

Implementations are free to override it in order to optimize error recovery.

Value parameters:
fa

is the source whose result is going to get transformed

recover

is the function that gets called to recover the source in case of error

See also:
Inherited from:
ApplicativeError
def redeemWith[A, B](fa: Observable[A])(recover: Throwable => Observable[B], bind: A => Observable[B]): Observable[B]

Returns a new value that transforms the result of the source, given the recover or bind functions, which get executed depending on whether the result is successful or if it ends in error.

Returns a new value that transforms the result of the source, given the recover or bind functions, which get executed depending on whether the result is successful or if it ends in error.

This is an optimization on usage of attempt and flatMap, this equivalence being available:

 fa.redeemWith(fe, fs) <-> fa.attempt.flatMap(_.fold(fe, fs))

Usage of redeemWith subsumes handleErrorWith because:

 fa.redeemWith(fe, F.pure) <-> fa.handleErrorWith(fe)

Usage of redeemWith also subsumes flatMap because:

 fa.redeemWith(F.raiseError, fs) <-> fa.flatMap(fs)

Implementations are free to override it in order to optimize error recovery.

Value parameters:
bind

is the function that gets to transform the source in case of success

fa

is the source whose result is going to get transformed

recover

is the function that gets called to recover the source in case of error

See also:

redeem, attempt and handleErrorWith

Inherited from:
MonadError
def replicateA[A](n: Int, fa: Observable[A]): Observable[List[A]]

Given fa and n, apply fa n times to construct an F[List[A]] value.

Given fa and n, apply fa n times to construct an F[List[A]] value.

Example:

scala> import cats.data.State

scala> type Counter[A] = State[Int, A]
scala> val getAndIncrement: Counter[Int] = State { i => (i + 1, i) }
scala> val getAndIncrement5: Counter[List[Int]] =
    | Applicative[Counter].replicateA(5, getAndIncrement)
scala> getAndIncrement5.run(0).value
res0: (Int, List[Int]) = (5,List(0, 1, 2, 3, 4))
Inherited from:
Applicative
def rethrow[A, EE <: Throwable](fa: Observable[Either[EE, A]]): Observable[A]

Inverse of attempt

Inverse of attempt

Example:

scala> import cats.implicits._
scala> import scala.util.{Try, Success}

scala> val a: Try[Either[Throwable, Int]] = Success(Left(new java.lang.Exception))
scala> a.rethrow
res0: scala.util.Try[Int] = Failure(java.lang.Exception)

scala> val b: Try[Either[Throwable, Int]] = Success(Right(1))
scala> b.rethrow
res1: scala.util.Try[Int] = Success(1)
Inherited from:
MonadError
def separate[G[_, _], A, B](fgab: Observable[G[A, B]])(implicit FM: Monad[Observable], G: Bifoldable[G]): (Observable[A], Observable[B])

Separate the inner foldable values into the "lefts" and "rights"

Separate the inner foldable values into the "lefts" and "rights"

Example:

scala> import cats.implicits._
scala> val l: List[Either[String, Int]] = List(Right(1), Left("error"))
scala> Alternative[List].separate(l)
res0: (List[String], List[Int]) = (List(error),List(1))
Inherited from:
Alternative
def separateFoldable[G[_, _], A, B](fgab: Observable[G[A, B]])(implicit G: Bifoldable[G], FF: Foldable[Observable]): (Observable[A], Observable[B])

Separate the inner foldable values into the "lefts" and "rights". A variant of separate that is specialized for Fs that have Foldable instances which allows for a single-pass implementation (as opposed to

Separate the inner foldable values into the "lefts" and "rights". A variant of separate that is specialized for Fs that have Foldable instances which allows for a single-pass implementation (as opposed to

separate

which is 2-pass).

Example:

scala> import cats.implicits._
scala> val l: List[Either[String, Int]] = List(Right(1), Left("error"))
scala> Alternative[List].separateFoldable(l)
res0: (List[String], List[Int]) = (List(error),List(1))

separate }}}

Example:

scala> import cats.implicits._
scala> val l: List[Either[String, Int]] = List(Right(1), Left("error"))
scala> Alternative[List].separateFoldable(l)
res0: (List[String], List[Int]) = (List(error),List(1))
Inherited from:
Alternative
def sum[A, B](fa: Observable[A], fb: Observable[B])(implicit F: Functor[Observable]): Observable[Either[A, B]]

Combines F[A] and F[B] into a F[Either[A,B]]].

Combines F[A] and F[B] into a F[Either[A,B]]].

Example:

scala> import cats.SemigroupK
scala> import cats.data.NonEmptyList
scala> SemigroupK[NonEmptyList].sum(NonEmptyList.one("abc"), NonEmptyList.one(2))
res0: NonEmptyList[Either[String,Int]] = NonEmptyList(Left(abc), Right(2))
Inherited from:
SemigroupK
def tuple10[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9]): Observable[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9)]
Inherited from:
ApplyArityFunctions
def tuple11[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10]): Observable[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10)]
Inherited from:
ApplyArityFunctions
def tuple12[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11]): Observable[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11)]
Inherited from:
ApplyArityFunctions
def tuple13[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12]): Observable[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12)]
Inherited from:
ApplyArityFunctions
def tuple14[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12], f13: Observable[A13]): Observable[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13)]
Inherited from:
ApplyArityFunctions
def tuple15[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12], f13: Observable[A13], f14: Observable[A14]): Observable[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14)]
Inherited from:
ApplyArityFunctions
def tuple16[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12], f13: Observable[A13], f14: Observable[A14], f15: Observable[A15]): Observable[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15)]
Inherited from:
ApplyArityFunctions
def tuple17[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12], f13: Observable[A13], f14: Observable[A14], f15: Observable[A15], f16: Observable[A16]): Observable[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16)]
Inherited from:
ApplyArityFunctions
def tuple18[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12], f13: Observable[A13], f14: Observable[A14], f15: Observable[A15], f16: Observable[A16], f17: Observable[A17]): Observable[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17)]
Inherited from:
ApplyArityFunctions
def tuple19[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12], f13: Observable[A13], f14: Observable[A14], f15: Observable[A15], f16: Observable[A16], f17: Observable[A17], f18: Observable[A18]): Observable[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18)]
Inherited from:
ApplyArityFunctions
def tuple2[A, B](f1: Observable[A], f2: Observable[B]): Observable[(A, B)]
Inherited from:
ApplyArityFunctions
def tuple20[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, A19, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12], f13: Observable[A13], f14: Observable[A14], f15: Observable[A15], f16: Observable[A16], f17: Observable[A17], f18: Observable[A18], f19: Observable[A19]): Observable[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, A19)]
Inherited from:
ApplyArityFunctions
def tuple21[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, A19, A20, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12], f13: Observable[A13], f14: Observable[A14], f15: Observable[A15], f16: Observable[A16], f17: Observable[A17], f18: Observable[A18], f19: Observable[A19], f20: Observable[A20]): Observable[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, A19, A20)]
Inherited from:
ApplyArityFunctions
def tuple22[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, A19, A20, A21, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8], f9: Observable[A9], f10: Observable[A10], f11: Observable[A11], f12: Observable[A12], f13: Observable[A13], f14: Observable[A14], f15: Observable[A15], f16: Observable[A16], f17: Observable[A17], f18: Observable[A18], f19: Observable[A19], f20: Observable[A20], f21: Observable[A21]): Observable[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, A19, A20, A21)]
Inherited from:
ApplyArityFunctions
def tuple3[A0, A1, A2, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2]): Observable[(A0, A1, A2)]
Inherited from:
ApplyArityFunctions
def tuple4[A0, A1, A2, A3, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3]): Observable[(A0, A1, A2, A3)]
Inherited from:
ApplyArityFunctions
def tuple5[A0, A1, A2, A3, A4, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4]): Observable[(A0, A1, A2, A3, A4)]
Inherited from:
ApplyArityFunctions
def tuple6[A0, A1, A2, A3, A4, A5, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5]): Observable[(A0, A1, A2, A3, A4, A5)]
Inherited from:
ApplyArityFunctions
def tuple7[A0, A1, A2, A3, A4, A5, A6, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6]): Observable[(A0, A1, A2, A3, A4, A5, A6)]
Inherited from:
ApplyArityFunctions
def tuple8[A0, A1, A2, A3, A4, A5, A6, A7, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7]): Observable[(A0, A1, A2, A3, A4, A5, A6, A7)]
Inherited from:
ApplyArityFunctions
def tuple9[A0, A1, A2, A3, A4, A5, A6, A7, A8, Z](f0: Observable[A0], f1: Observable[A1], f2: Observable[A2], f3: Observable[A3], f4: Observable[A4], f5: Observable[A5], f6: Observable[A6], f7: Observable[A7], f8: Observable[A8]): Observable[(A0, A1, A2, A3, A4, A5, A6, A7, A8)]
Inherited from:
ApplyArityFunctions
def tupleLeft[A, B](fa: Observable[A], b: B): Observable[(B, A)]

Tuples the A value in F[A] with the supplied B value, with the B value on the left.

Tuples the A value in F[A] with the supplied B value, with the B value on the left.

Example:

scala> import scala.collection.immutable.Queue
scala> import cats.Functor
scala> import cats.implicits.catsStdInstancesForQueue

scala> Functor[Queue].tupleLeft(Queue("hello", "world"), 42)
res0: scala.collection.immutable.Queue[(Int, String)] = Queue((42,hello), (42,world))
Inherited from:
Functor
def tupleRight[A, B](fa: Observable[A], b: B): Observable[(A, B)]

Tuples the A value in F[A] with the supplied B value, with the B value on the right.

Tuples the A value in F[A] with the supplied B value, with the B value on the right.

Example:

scala> import scala.collection.immutable.Queue
scala> import cats.Functor
scala> import cats.implicits.catsStdInstancesForQueue

scala> Functor[Queue].tupleRight(Queue("hello", "world"), 42)
res0: scala.collection.immutable.Queue[(String, Int)] = Queue((hello,42), (world,42))
Inherited from:
Functor
def unite[G[_], A](fga: Observable[G[A]])(implicit FM: Monad[Observable], G: Foldable[G]): Observable[A]

Fold over the inner structure to combine all of the values with our combine method inherited from MonoidK. The result is for us to accumulate all of the "interesting" values of the inner G, so if G is Option, we collect all the Some values, if G is Either, we collect all the Right values, etc.

Fold over the inner structure to combine all of the values with our combine method inherited from MonoidK. The result is for us to accumulate all of the "interesting" values of the inner G, so if G is Option, we collect all the Some values, if G is Either, we collect all the Right values, etc.

Example:

scala> import cats.implicits._
scala> val x: List[Vector[Int]] = List(Vector(1, 2), Vector(3, 4))
scala> Alternative[List].unite(x)
res0: List[Int] = List(1, 2, 3, 4)
Inherited from:
Alternative
def unlessA[A](cond: Boolean)(f: => Observable[A]): Observable[Unit]

Returns the given argument (mapped to Unit) if cond is false, otherwise, unit lifted into F.

Returns the given argument (mapped to Unit) if cond is false, otherwise, unit lifted into F.

Example:

scala> import cats.implicits._

scala> Applicative[List].unlessA(true)(List(1, 2, 3))
res0: List[Unit] = List(())

scala> Applicative[List].unlessA(false)(List(1, 2, 3))
res1: List[Unit] = List((), (), ())

scala> Applicative[List].unlessA(true)(List.empty[Int])
res2: List[Unit] = List(())

scala> Applicative[List].unlessA(false)(List.empty[Int])
res3: List[Unit] = List()
Inherited from:
Applicative
@noop
def untilDefinedM[A](foa: Observable[Option[A]]): Observable[A]

This repeats an F until we get defined values. This can be useful for polling type operations on State (or RNG) Monads, or in effect monads.

This repeats an F until we get defined values. This can be useful for polling type operations on State (or RNG) Monads, or in effect monads.

Inherited from:
FlatMap
def untilM[G[_], A](f: Observable[A])(cond: => Observable[Boolean])(implicit G: Alternative[G]): Observable[G[A]]

Execute an action repeatedly until the Boolean condition returns true. The condition is evaluated after the loop body. Collects results into an arbitrary Alternative value, such as a Vector. This implementation uses append on each evaluation result, so avoid data structures with non-constant append performance, e.g. List.

Execute an action repeatedly until the Boolean condition returns true. The condition is evaluated after the loop body. Collects results into an arbitrary Alternative value, such as a Vector. This implementation uses append on each evaluation result, so avoid data structures with non-constant append performance, e.g. List.

Inherited from:
Monad
def untilM_[A](f: Observable[A])(cond: => Observable[Boolean]): Observable[Unit]

Execute an action repeatedly until the Boolean condition returns true. The condition is evaluated after the loop body. Discards results.

Execute an action repeatedly until the Boolean condition returns true. The condition is evaluated after the loop body. Discards results.

Inherited from:
Monad
@noop
def unzip[A, B](fab: Observable[(A, B)]): (Observable[A], Observable[B])

Un-zips an F[(A, B)] consisting of element pairs or Tuple2 into two separate F's tupled.

Un-zips an F[(A, B)] consisting of element pairs or Tuple2 into two separate F's tupled.

NOTE: Check for effect duplication, possibly memoize before

scala> import cats.Functor
scala> import cats.implicits.catsStdInstancesForList

scala> Functor[List].unzip(List((1,2), (3, 4)))
res0: (List[Int], List[Int]) = (List(1, 3),List(2, 4))
Inherited from:
Functor
def void[A](fa: Observable[A]): Observable[Unit]

Empty the fa of the values, preserving the structure

Empty the fa of the values, preserving the structure

Example:

scala> import cats.Functor
scala> import cats.implicits.catsStdInstancesForList

scala> Functor[List].void(List(1,2,3))
res0: List[Unit] = List((), (), ())
Inherited from:
Functor
def whenA[A](cond: Boolean)(f: => Observable[A]): Observable[Unit]

Returns the given argument (mapped to Unit) if cond is true, otherwise, unit lifted into F.

Returns the given argument (mapped to Unit) if cond is true, otherwise, unit lifted into F.

Example:

scala> import cats.implicits._

scala> Applicative[List].whenA(true)(List(1, 2, 3))
res0: List[Unit] = List((), (), ())

scala> Applicative[List].whenA(false)(List(1, 2, 3))
res1: List[Unit] = List(())

scala> Applicative[List].whenA(true)(List.empty[Int])
res2: List[Unit] = List()

scala> Applicative[List].whenA(false)(List.empty[Int])
res3: List[Unit] = List(())
Inherited from:
Applicative
@noop
def whileM[G[_], A](p: Observable[Boolean])(body: => Observable[A])(implicit G: Alternative[G]): Observable[G[A]]

Execute an action repeatedly as long as the given Boolean expression returns true. The condition is evaluated before the loop body. Collects the results into an arbitrary Alternative value, such as a Vector. This implementation uses append on each evaluation result, so avoid data structures with non-constant append performance, e.g. List.

Execute an action repeatedly as long as the given Boolean expression returns true. The condition is evaluated before the loop body. Collects the results into an arbitrary Alternative value, such as a Vector. This implementation uses append on each evaluation result, so avoid data structures with non-constant append performance, e.g. List.

Inherited from:
Monad
@noop
def whileM_[A](p: Observable[Boolean])(body: => Observable[A]): Observable[Unit]

Execute an action repeatedly as long as the given Boolean expression returns true. The condition is evaluated before the loop body. Discards results.

Execute an action repeatedly as long as the given Boolean expression returns true. The condition is evaluated before the loop body. Discards results.

Inherited from:
Monad
def widen[G0[x]]: FunctionK[Task, G0]

Widens the output type of this FunctionK from G to G0

Widens the output type of this FunctionK from G to G0

Inherited from:
FunctionK
def widen[A, B >: A](fa: Observable[A]): Observable[B]

Lifts natural subtyping covariance of covariant Functors.

Lifts natural subtyping covariance of covariant Functors.

NOTE: In certain (perhaps contrived) situations that rely on universal equality this can result in a ClassCastException, because it is implemented as a type cast. It could be implemented as map(identity), but according to the functor laws, that should be equal to fa, and a type cast is often much more performant. See this example of widen creating a ClassCastException.

Example:

scala> import cats.Functor
scala> import cats.implicits.catsStdInstancesForOption

scala> val s = Some(42)
scala> Functor[Option].widen(s)
res0: Option[Int] = Some(42)
Inherited from:
Functor