Packages

  • package root
    Definition Classes
    root
  • package izumi
    Definition Classes
    root
  • package functional
    Definition Classes
    izumi
  • package bio

    Current hierarchy (use http://www.nomnoml.com/ to render, rendered: https://izumi.7mind.io/bio/media/bio-relationship-hierarchy.svg)

    Current hierarchy (use http://www.nomnoml.com/ to render, rendered: https://izumi.7mind.io/bio/media/bio-relationship-hierarchy.svg)

    [Functor2]<--[Bifunctor2]
[Bifunctor2]<--[ApplicativeError2]
[Functor2]<--[Applicative2]
[Applicative2]<--[Guarantee2]
[Applicative2]<--[Monad2]
[Guarantee2]<--[ApplicativeError2]
[ApplicativeError2]<--[Error2]
[Monad2]<--[Error2]
[Error2]<--[Bracket2]
[Bracket2]<--[Panic2]
[Panic2]<--[IO2]
[IO2]<--[Async2]

[Monad2]<--[Parallel2]
[Parallel2]<--[Concurrent2]
[Concurrent2]<--[Async2]

[Error2]<--[Temporal2]

    Auxiliary algebras:

    [cats.effect.*]<:--[CatsConversions]

[Fork2]<:--[Fiber2]

[BlockingIO2]

[Primitives2]

[Primitives2]<:--[Ref2]
[Primitives2]<:--[Semaphore2]
[Primitives2]<:--[Promise2]

[PrimitivesM2]
[PrimitivesM2]<:--[RefM2]
[PrimitivesM2]<:--[Mutex2]

[Entropy1]<:--[Entropy2]
[Clock1]<:--[Clock2]

[UnsafeRun2]

    Raw inheritance hierarchy:

    [Functor2]<--[Applicative2]
[Applicative2]<--[Guarantee2]
[Applicative2]<--[Monad2]
[Guarantee2]<--[ApplicativeError2]
[Bifunctor2]<--[ApplicativeError2]
[ApplicativeError2]<--[Error2]
[Monad2]<--[Error2]
[Error2]<--[Bracket2]
[Bracket2]<--[Panic2]
[Panic2]<--[IO2]

[Parallel2]<--[Concurrent2]
[Concurrent2]<--[Async2]
[IO2]<--[Async2]

[Temporal2]

    current hierarchy roots:

    bifunctor:

    • Functor3
    • Bifunctor3
    • Parallel3
    • Temporal3

    standalone:

    • Fork3
    • BlockingIO3
    • Primitives3
    • PrimitivesM3
    Definition Classes
    functional
  • package data
    Definition Classes
    bio
  • object Free
    Definition Classes
    data
  • FlatMapped
  • Monad2Instance
  • Pure
  • Suspend

class Monad2Instance[S[_, _]] extends Monad2[[+β$4$, +γ$5$]Free[S, β$4$, γ$5$]]

Linear Supertypes
Monad2[[+β$4$, +γ$5$]Free[S, β$4$, γ$5$]], Applicative2[[+β$4$, +γ$5$]Free[S, β$4$, γ$5$]], Functor2[[+β$4$, +γ$5$]Free[S, β$4$, γ$5$]], RootBifunctor[[+β$4$, +γ$5$]Free[S, β$4$, γ$5$]], Root, PredefinedHelper, DivergenceHelper, AnyRef, Any
Known Subclasses
Monad2Instance
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Monad2Instance
  2. Monad2
  3. Applicative2
  4. Functor2
  5. RootBifunctor
  6. Root
  7. PredefinedHelper
  8. DivergenceHelper
  9. AnyRef
  10. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new Monad2Instance()

Type Members

  1. type Divergence = Nondivergent
    Definition Classes
    DivergenceHelper
  2. type IsPredefined = NotPredefined
    Definition Classes
    PredefinedHelper

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. def *>[E, A, B](f: Free[S, E, A], next: => Free[S, E, B]): Free[S, E, B]

    execute two operations in order, return result of second operation

    execute two operations in order, return result of second operation

    Definition Classes
    Monad2Instance → Monad2 → Applicative2
    Annotations
    @inline()
  4. def <*[E, A, B](f: Free[S, E, A], next: => Free[S, E, B]): Free[S, E, A]

    execute two operations in order, same as *>, but return result of first operation

    execute two operations in order, same as *>, but return result of first operation

    Definition Classes
    Monad2Instance → Monad2 → Applicative2
    Annotations
    @inline()
  5. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. def as[E, A, B](r: Free[S, E, A])(v: => B): Free[S, E, B]
    Definition Classes
    Monad2Instance → Functor2
    Annotations
    @inline()
  7. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  8. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  9. def collect[E, A, B](l: Iterable[A])(f: (A) => Free[S, E, Option[B]]): Free[S, E, List[B]]
    Definition Classes
    Applicative2
  10. def collectFirst[E, A, B](l: Iterable[A])(f: (A) => Free[S, E, Option[B]]): Free[S, E, Option[B]]
    Definition Classes
    Monad2
  11. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  12. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  13. def filter[E, A](l: Iterable[A])(f: (A) => Free[S, E, Boolean]): Free[S, E, List[A]]
    Definition Classes
    Applicative2
  14. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  15. def find[E, A](l: Iterable[A])(f: (A) => Free[S, E, Boolean]): Free[S, E, Option[A]]
    Definition Classes
    Monad2
  16. def flatMap[E, A, B](r: Free[S, E, A])(f: (A) => Free[S, E, B]): Free[S, E, B]
    Definition Classes
    Monad2Instance → Monad2
    Annotations
    @inline()
  17. def flatSequence[E, A](l: Iterable[Free[S, E, Iterable[A]]]): Free[S, E, List[A]]
    Definition Classes
    Applicative2
  18. def flatTraverse[E, A, B](l: Iterable[A])(f: (A) => Free[S, E, Iterable[B]]): Free[S, E, List[B]]
    Definition Classes
    Applicative2
  19. def flatten[E, A](r: Free[S, E, Free[S, E, A]]): Free[S, E, A]
    Definition Classes
    Monad2
  20. def foldLeft[E, A, AC](l: Iterable[A])(z: AC)(f: (AC, A) => Free[S, E, AC]): Free[S, E, AC]
    Definition Classes
    Monad2
  21. final def forever[E, A](r: Free[S, E, A]): Free[S, E, Nothing]
    Definition Classes
    Applicative2
    Annotations
    @inline()
  22. def fromOptionF[E, A](fallbackOnNone: => Free[S, E, A], r: Free[S, E, Option[A]]): Free[S, E, A]

    Extracts the optional value, or executes the fallbackOnNone effect

    Extracts the optional value, or executes the fallbackOnNone effect

    Definition Classes
    Monad2
  23. def fromOptionOr[E, A](valueOnNone: => A, r: Free[S, E, Option[A]]): Free[S, E, A]

    Extracts the optional value, or returns the given valueOnNone value

    Extracts the optional value, or returns the given valueOnNone value

    Definition Classes
    Functor2
  24. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  25. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  26. final def ifThenElse[E, E1, A](cond: Free[S, E, Boolean])(ifTrue: => Free[S, E1, A], ifFalse: => Free[S, E1, A])(implicit ev: <:<[E, E1]): Free[S, E1, A]
    Definition Classes
    Monad2
    Annotations
    @inline()
  27. final def ifThenElse[E, A](cond: Boolean)(ifTrue: => Free[S, E, A], ifFalse: => Free[S, E, A]): Free[S, E, A]
    Definition Classes
    Applicative2
    Annotations
    @inline()
  28. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  29. def iterateUntil[E, A](r: Free[S, E, A])(p: (A) => Boolean): Free[S, E, 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.

    Definition Classes
    Monad2
  30. def iterateUntilF[E, A](init: A)(f: (A) => Free[S, E, A])(p: (A) => Boolean): Free[S, E, A]

    Apply an effectful function iteratively until its result satisfies the given predicate and return that result.

    Apply an effectful function iteratively until its result satisfies the given predicate and return that result.

    Definition Classes
    Monad2
  31. def iterateWhile[E, A](r: Free[S, E, A])(p: (A) => Boolean): Free[S, E, 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.

    Definition Classes
    Monad2
  32. def iterateWhileF[E, A](init: A)(f: (A) => Free[S, E, A])(p: (A) => Boolean): Free[S, E, A]

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

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

    Definition Classes
    Monad2
  33. def map[E, A, B](r: Free[S, E, A])(f: (A) => B): Free[S, E, B]
    Definition Classes
    Monad2 → Functor2
  34. def map2[E, A, B, C](r1: Free[S, E, A], r2: => Free[S, E, B])(f: (A, B) => C): Free[S, E, C]

    execute two operations in order, map their results

    execute two operations in order, map their results

    Definition Classes
    Monad2 → Applicative2
  35. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  36. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  37. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  38. def pure[A](a: A): Free[S, Nothing, A]
    Definition Classes
    Monad2Instance → Applicative2
    Annotations
    @inline()
  39. def sequence[E, A](l: Iterable[Free[S, E, A]]): Free[S, E, List[A]]
    Definition Classes
    Applicative2
  40. def sequence_[E](l: Iterable[Free[S, E, Unit]]): Free[S, E, Unit]
    Definition Classes
    Applicative2
  41. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  42. def tailRecM[E, A, B](a: A)(f: (A) => Free[S, E, Either[A, B]]): Free[S, E, B]
    Definition Classes
    Monad2
  43. def tap[E, A](r: Free[S, E, A], f: (A) => Free[S, E, Unit]): Free[S, E, A]
    Definition Classes
    Monad2
  44. def toString(): String
    Definition Classes
    AnyRef → Any
  45. final def traverse[E, A, B](o: Option[A])(f: (A) => Free[S, E, B]): Free[S, E, Option[B]]
    Definition Classes
    Applicative2
    Annotations
    @inline()
  46. def traverse[E, A, B](l: Iterable[A])(f: (A) => Free[S, E, B]): Free[S, E, List[B]]
    Definition Classes
    Applicative2
  47. def traverse_[E, A](l: Iterable[A])(f: (A) => Free[S, E, Unit]): Free[S, E, Unit]
    Definition Classes
    Applicative2
  48. def unit: Free[S, Nothing, Unit]
    Definition Classes
    Applicative2
  49. final def unless[E, E1](cond: Free[S, E, Boolean])(ifFalse: => Free[S, E1, Unit])(implicit ev: <:<[E, E1]): Free[S, E1, Unit]
    Definition Classes
    Monad2
    Annotations
    @inline()
  50. final def unless[E](cond: Boolean)(ifFalse: => Free[S, E, Unit]): Free[S, E, Unit]
    Definition Classes
    Applicative2
    Annotations
    @inline()
  51. def void[E, A](r: Free[S, E, A]): Free[S, E, Unit]
    Definition Classes
    Monad2Instance → Functor2
    Annotations
    @inline()
  52. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  53. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  54. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  55. final def when[E, E1](cond: Free[S, E, Boolean])(ifTrue: => Free[S, E1, Unit])(implicit ev: <:<[E, E1]): Free[S, E1, Unit]
    Definition Classes
    Monad2
    Annotations
    @inline()
  56. final def when[E](cond: Boolean)(ifTrue: => Free[S, E, Unit]): Free[S, E, Unit]
    Definition Classes
    Applicative2
    Annotations
    @inline()
  57. final def widen[E, A, A1](r: Free[S, E, A])(implicit ev: <:<[A, A1]): Free[S, E, A1]
    Definition Classes
    Functor2
    Annotations
    @inline()

Inherited from Monad2[[+β$4$, +γ$5$]Free[S, β$4$, γ$5$]]

Inherited from Applicative2[[+β$4$, +γ$5$]Free[S, β$4$, γ$5$]]

Inherited from Functor2[[+β$4$, +γ$5$]Free[S, β$4$, γ$5$]]

Inherited from RootBifunctor[[+β$4$, +γ$5$]Free[S, β$4$, γ$5$]]

Inherited from Root

Inherited from PredefinedHelper

Inherited from DivergenceHelper

Inherited from AnyRef

Inherited from Any

Ungrouped