Packages

o

scalaz.std.jsPromise

JSPromiseInstance

implicit object JSPromiseInstance extends Nondeterminism[Promise] with MonadError[Promise, Any] with Cobind[Promise]

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. JSPromiseInstance
  2. Cobind
  3. MonadError
  4. ApplicativeError
  5. Nondeterminism
  6. Monad
  7. Bind
  8. Applicative
  9. InvariantApplicative
  10. Apply
  11. Functor
  12. InvariantFunctor
  13. AnyRef
  14. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Type Members

  1. trait ApplicativeLaw extends ApplyLaw
    Definition Classes
    Applicative
  2. trait ApplicativeErrorLaws extends AnyRef
    Definition Classes
    ApplicativeError
  3. trait ApplyLaw extends FunctorLaw
    Definition Classes
    Apply
  4. trait FlippedApply extends Apply[F]
    Attributes
    protected[this]
    Definition Classes
    Apply
  5. trait BindLaw extends ApplyLaw
    Definition Classes
    Bind
  6. trait CobindLaws extends AnyRef
    Definition Classes
    Cobind
  7. trait FunctorLaw extends InvariantFunctorLaw
    Definition Classes
    Functor
  8. trait InvariantFunctorLaw extends AnyRef
    Definition Classes
    InvariantFunctor
  9. trait MonadLaw extends ApplicativeLaw with BindLaw
    Definition Classes
    Monad
  10. trait MonadErrorLaw extends ApplicativeErrorLaws
    Definition Classes
    MonadError

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def aggregate[A](fs: IList[Promise[A]])(implicit arg0: Monoid[A]): Promise[A]

    Nondeterministically sequence fs, collecting the results using a Monoid.

    Nondeterministically sequence fs, collecting the results using a Monoid.

    Definition Classes
    Nondeterminism
  5. def aggregate1[A](fs: NonEmptyList[Promise[A]])(implicit arg0: Semigroup[A]): Promise[A]
    Definition Classes
    Nondeterminism
  6. def aggregateCommutative[A](fs: IList[Promise[A]])(implicit arg0: Monoid[A]): Promise[A]

    Nondeterministically sequence fs, collecting the results using a commutative Monoid.

    Nondeterministically sequence fs, collecting the results using a commutative Monoid.

    Definition Classes
    Nondeterminism
  7. def aggregateCommutative1[A](fs: NonEmptyList[Promise[A]])(implicit arg0: Semigroup[A]): Promise[A]
    Definition Classes
    Nondeterminism
  8. def ap[A, B](fa: => Promise[A])(f: => Promise[(A) => B]): Promise[B]

    Sequence f, then fa, combining their results by function application.

    Sequence f, then fa, combining their results by function application.

    NB: with respect to apply2 and all other combinators, as well as scalaz.Bind, the f action appears to the *left*. So f should be the "first" F-action to perform. This is in accordance with all other implementations of this typeclass in common use, which are "function first".

    Definition Classes
    Bind → Apply
  9. def ap2[A, B, C](fa: => Promise[A], fb: => Promise[B])(f: Promise[(A, B) => C]): Promise[C]
    Definition Classes
    Apply
  10. def ap3[A, B, C, D](fa: => Promise[A], fb: => Promise[B], fc: => Promise[C])(f: Promise[(A, B, C) => D]): Promise[D]
    Definition Classes
    Apply
  11. def ap4[A, B, C, D, E](fa: => Promise[A], fb: => Promise[B], fc: => Promise[C], fd: => Promise[D])(f: Promise[(A, B, C, D) => E]): Promise[E]
    Definition Classes
    Apply
  12. def ap5[A, B, C, D, E, R](fa: => Promise[A], fb: => Promise[B], fc: => Promise[C], fd: => Promise[D], fe: => Promise[E])(f: Promise[(A, B, C, D, E) => R]): Promise[R]
    Definition Classes
    Apply
  13. def ap6[A, B, C, D, E, FF, R](fa: => Promise[A], fb: => Promise[B], fc: => Promise[C], fd: => Promise[D], fe: => Promise[E], ff: => Promise[FF])(f: Promise[(A, B, C, D, E, FF) => R]): Promise[R]
    Definition Classes
    Apply
  14. def ap7[A, B, C, D, E, FF, G, R](fa: => Promise[A], fb: => Promise[B], fc: => Promise[C], fd: => Promise[D], fe: => Promise[E], ff: => Promise[FF], fg: => Promise[G])(f: Promise[(A, B, C, D, E, FF, G) => R]): Promise[R]
    Definition Classes
    Apply
  15. def ap8[A, B, C, D, E, FF, G, H, R](fa: => Promise[A], fb: => Promise[B], fc: => Promise[C], fd: => Promise[D], fe: => Promise[E], ff: => Promise[FF], fg: => Promise[G], fh: => Promise[H])(f: Promise[(A, B, C, D, E, FF, G, H) => R]): Promise[R]
    Definition Classes
    Apply
  16. def apF[A, B](f: => Promise[(A) => B]): (Promise[A]) => Promise[B]

    Flipped variant of ap.

    Flipped variant of ap.

    Definition Classes
    Apply
  17. def applicativeErrorLaws: ApplicativeErrorLaws
    Definition Classes
    ApplicativeError
  18. val applicativeErrorSyntax: ApplicativeErrorSyntax[Promise, Any]
    Definition Classes
    ApplicativeError
  19. def applicativeLaw: ApplicativeLaw
    Definition Classes
    Applicative
  20. val applicativeSyntax: ApplicativeSyntax[Promise]
    Definition Classes
    Applicative
  21. def apply[A, B](fa: Promise[A])(f: (A) => B): Promise[B]

    Alias for map.

    Alias for map.

    Definition Classes
    Functor
  22. def apply10[A, B, C, D, E, FF, G, H, I, J, R](fa: => Promise[A], fb: => Promise[B], fc: => Promise[C], fd: => Promise[D], fe: => Promise[E], ff: => Promise[FF], fg: => Promise[G], fh: => Promise[H], fi: => Promise[I], fj: => Promise[J])(f: (A, B, C, D, E, FF, G, H, I, J) => R): Promise[R]
    Definition Classes
    Apply
  23. def apply11[A, B, C, D, E, FF, G, H, I, J, K, R](fa: => Promise[A], fb: => Promise[B], fc: => Promise[C], fd: => Promise[D], fe: => Promise[E], ff: => Promise[FF], fg: => Promise[G], fh: => Promise[H], fi: => Promise[I], fj: => Promise[J], fk: => Promise[K])(f: (A, B, C, D, E, FF, G, H, I, J, K) => R): Promise[R]
    Definition Classes
    Apply
  24. def apply12[A, B, C, D, E, FF, G, H, I, J, K, L, R](fa: => Promise[A], fb: => Promise[B], fc: => Promise[C], fd: => Promise[D], fe: => Promise[E], ff: => Promise[FF], fg: => Promise[G], fh: => Promise[H], fi: => Promise[I], fj: => Promise[J], fk: => Promise[K], fl: => Promise[L])(f: (A, B, C, D, E, FF, G, H, I, J, K, L) => R): Promise[R]
    Definition Classes
    Apply
  25. def apply2[A, B, C](fa: => Promise[A], fb: => Promise[B])(f: (A, B) => C): Promise[C]
    Definition Classes
    Bind → Apply
  26. def apply3[A, B, C, D](fa: => Promise[A], fb: => Promise[B], fc: => Promise[C])(f: (A, B, C) => D): Promise[D]
    Definition Classes
    Apply
  27. def apply4[A, B, C, D, E](fa: => Promise[A], fb: => Promise[B], fc: => Promise[C], fd: => Promise[D])(f: (A, B, C, D) => E): Promise[E]
    Definition Classes
    Apply
  28. def apply5[A, B, C, D, E, R](fa: => Promise[A], fb: => Promise[B], fc: => Promise[C], fd: => Promise[D], fe: => Promise[E])(f: (A, B, C, D, E) => R): Promise[R]
    Definition Classes
    Apply
  29. def apply6[A, B, C, D, E, FF, R](fa: => Promise[A], fb: => Promise[B], fc: => Promise[C], fd: => Promise[D], fe: => Promise[E], ff: => Promise[FF])(f: (A, B, C, D, E, FF) => R): Promise[R]
    Definition Classes
    Apply
  30. def apply7[A, B, C, D, E, FF, G, R](fa: => Promise[A], fb: => Promise[B], fc: => Promise[C], fd: => Promise[D], fe: => Promise[E], ff: => Promise[FF], fg: => Promise[G])(f: (A, B, C, D, E, FF, G) => R): Promise[R]
    Definition Classes
    Apply
  31. def apply8[A, B, C, D, E, FF, G, H, R](fa: => Promise[A], fb: => Promise[B], fc: => Promise[C], fd: => Promise[D], fe: => Promise[E], ff: => Promise[FF], fg: => Promise[G], fh: => Promise[H])(f: (A, B, C, D, E, FF, G, H) => R): Promise[R]
    Definition Classes
    Apply
  32. def apply9[A, B, C, D, E, FF, G, H, I, R](fa: => Promise[A], fb: => Promise[B], fc: => Promise[C], fd: => Promise[D], fe: => Promise[E], ff: => Promise[FF], fg: => Promise[G], fh: => Promise[H], fi: => Promise[I])(f: (A, B, C, D, E, FF, G, H, I) => R): Promise[R]
    Definition Classes
    Apply
  33. def applyApplicative: Applicative[[α]\/[Promise[α], α]]

    Add a unit to any Apply to form an Applicative.

    Add a unit to any Apply to form an Applicative.

    Definition Classes
    Apply
  34. def applyLaw: ApplyLaw
    Definition Classes
    Apply
  35. val applySyntax: ApplySyntax[Promise]
    Definition Classes
    Apply
  36. final def applying1[Z, A1](f: (A1) => Z)(implicit a1: Promise[A1]): Promise[Z]
    Definition Classes
    Apply
  37. final def applying2[Z, A1, A2](f: (A1, A2) => Z)(implicit a1: Promise[A1], a2: Promise[A2]): Promise[Z]
    Definition Classes
    Apply
  38. final def applying3[Z, A1, A2, A3](f: (A1, A2, A3) => Z)(implicit a1: Promise[A1], a2: Promise[A2], a3: Promise[A3]): Promise[Z]
    Definition Classes
    Apply
  39. final def applying4[Z, A1, A2, A3, A4](f: (A1, A2, A3, A4) => Z)(implicit a1: Promise[A1], a2: Promise[A2], a3: Promise[A3], a4: Promise[A4]): Promise[Z]
    Definition Classes
    Apply
  40. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  41. def bicompose[G[_, _]](implicit arg0: Bifunctor[G]): Bifunctor[[α, β]Promise[G[α, β]]]

    The composition of Functor F and Bifunctor G, [x, y]F[G[x, y]], is a Bifunctor

    The composition of Functor F and Bifunctor G, [x, y]F[G[x, y]], is a Bifunctor

    Definition Classes
    Functor
  42. def bind[A, B](fa: Promise[A])(f: (A) => Promise[B]): Promise[B]

    Equivalent to join(map(fa)(f)).

    Equivalent to join(map(fa)(f)).

    Definition Classes
    JSPromiseInstance → Bind
  43. def bindLaw: BindLaw
    Definition Classes
    Bind
  44. val bindSyntax: BindSyntax[Promise]
    Definition Classes
    Bind
  45. def both[A, B](a: Promise[A], b: Promise[B]): Promise[(A, B)]

    Obtain results from both a and b, nondeterministically ordering their effects.

    Obtain results from both a and b, nondeterministically ordering their effects.

    Definition Classes
    Nondeterminism
  46. def choose[A, B](a: Promise[A], b: Promise[B]): Promise[\/[(A, Promise[B]), (Promise[A], B)]]

    A commutative operation which chooses nondeterministically to obtain a value from either a or b.

    A commutative operation which chooses nondeterministically to obtain a value from either a or b. If a 'wins', a 'residual' context for b is returned; if b wins, a residual context for a is returned. The residual is useful for various instances like Future, which may race the two computations and require a residual to ensure the result of the 'losing' computation is not discarded.

    This function can be defined in terms of chooseAny or vice versa. The default implementation calls chooseAny with a two-element list and uses the Functor for F to fix up types.

    Definition Classes
    Nondeterminism
  47. def chooseAny[A](head: Promise[A], tail: IList[Promise[A]]): Promise[(A, IList[Promise[A]])]
    Definition Classes
    JSPromiseInstance → Nondeterminism
  48. def chooseAny[A](a: IList[Promise[A]]): Option[Promise[(A, IList[Promise[A]])]]

    A commutative operation which chooses nondeterministically to obtain a value from any of the elements of as.

    A commutative operation which chooses nondeterministically to obtain a value from any of the elements of as. In the language of posets, this constructs an antichain (a set of elements which are all incomparable) in the effect poset for this computation.

    returns

    None, if the input is empty.

    Definition Classes
    Nondeterminism
  49. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  50. def cobind[A, B](fa: Promise[A])(f: (Promise[A]) => B): Promise[B]

    Also know as extend

    Also know as extend

    Definition Classes
    JSPromiseInstance → Cobind
  51. def cobindLaw: CobindLaws
    Definition Classes
    Cobind
  52. val cobindSyntax: CobindSyntax[Promise]
    Definition Classes
    Cobind
  53. def cojoin[A](fa: Promise[A]): Promise[Promise[A]]

    Also known as duplicate

    Also known as duplicate

    Definition Classes
    Cobind
  54. def compose[G[_]](implicit G0: Applicative[G]): Applicative[[α]Promise[G[α]]]

    The composition of Applicatives F and G, [x]F[G[x]], is an Applicative

    The composition of Applicatives F and G, [x]F[G[x]], is an Applicative

    Definition Classes
    Applicative
  55. def compose[G[_]](implicit G0: Apply[G]): Apply[[α]Promise[G[α]]]

    The composition of Applys F and G, [x]F[G[x]], is a Apply

    The composition of Applys F and G, [x]F[G[x]], is a Apply

    Definition Classes
    Apply
  56. def compose[G[_]](implicit G0: Functor[G]): Functor[[α]Promise[G[α]]]

    The composition of Functors F and G, [x]F[G[x]], is a Functor

    The composition of Functors F and G, [x]F[G[x]], is a Functor

    Definition Classes
    Functor
  57. def counzip[A, B](a: \/[Promise[A], Promise[B]]): Promise[\/[A, B]]
    Definition Classes
    Functor
  58. def discardLeft[A, B](fa: => Promise[A], fb: => Promise[B]): Promise[B]

    Combine fa and fb according to Apply[F] with a function that discards the A(s)

    Combine fa and fb according to Apply[F] with a function that discards the A(s)

    Definition Classes
    Apply
  59. def discardRight[A, B](fa: => Promise[A], fb: => Promise[B]): Promise[A]

    Combine fa and fb according to Apply[F] with a function that discards the B(s)

    Combine fa and fb according to Apply[F] with a function that discards the B(s)

    Definition Classes
    Apply
  60. def emap[A, B](fa: Promise[A])(f: (A) => \/[Any, B]): Promise[B]
    Definition Classes
    MonadError
  61. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  62. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  63. final def extend[A, B](fa: Promise[A])(f: (Promise[A]) => B): Promise[B]
    Definition Classes
    Cobind
  64. def filterM[A](l: IList[A])(f: (A) => Promise[Boolean]): Promise[IList[A]]

    Filter l according to an applicative predicate.

    Filter l according to an applicative predicate.

    Definition Classes
    Applicative
  65. def filterM[A](l: List[A])(f: (A) => Promise[Boolean]): Promise[List[A]]

    Filter l according to an applicative predicate.

    Filter l according to an applicative predicate.

    Definition Classes
    Applicative
  66. def filterM[A, B](map: ==>>[A, B])(f: (B) => Promise[Boolean])(implicit O: Order[A]): Promise[==>>[A, B]]

    Filter map according to an applicative predicate.

    Filter map according to an applicative predicate. *

    Definition Classes
    Applicative
  67. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  68. def firstCompletedOf[A](as: Iterable[Promise[A]]): Option[Promise[A]]

    A commutative operation which chooses nondeterministically to obtain a value from any of the elements of as and discards other values.

    A commutative operation which chooses nondeterministically to obtain a value from any of the elements of as and discards other values.

    Definition Classes
    JSPromiseInstance → Nondeterminism
    Note

    A Nondeterminism instance could choose to override this function when a native implementation is available.

  69. def flip: Applicative[Promise]

    An Applicative for F in which effects happen in the opposite order.

    An Applicative for F in which effects happen in the opposite order.

    Definition Classes
    Applicative → Apply
  70. def forever[A, B](fa: Promise[A]): Promise[B]

    Repeats an applicative action infinitely

    Repeats an applicative action infinitely

    Definition Classes
    Apply
  71. def fpair[A](fa: Promise[A]): Promise[(A, A)]

    Twin all As in fa.

    Twin all As in fa.

    Definition Classes
    Functor
  72. def fproduct[A, B](fa: Promise[A])(f: (A) => B): Promise[(A, B)]

    Pair all As in fa with the result of function application.

    Pair all As in fa with the result of function application.

    Definition Classes
    Functor
  73. def functorLaw: FunctorLaw
    Definition Classes
    Functor
  74. val functorSyntax: FunctorSyntax[Promise]
    Definition Classes
    Functor
  75. def gather[A](fs: IList[Promise[A]]): Promise[IList[A]]

    Nondeterministically gather results from the given sequence of actions.

    Nondeterministically gather results from the given sequence of actions. This function is the nondeterministic analogue of sequence and should behave identically to sequence so long as there is no interaction between the effects being gathered. However, unlike sequence, which decides on a total order of effects, the effects in a gather are unordered with respect to each other.

    Although the effects are unordered, we ensure the order of results matches the order of the input sequence. Also see gatherUnordered.

    Definition Classes
    JSPromiseInstance → Nondeterminism
  76. def gather1[A](fs: NonEmptyList[Promise[A]]): Promise[NonEmptyList[A]]
    Definition Classes
    Nondeterminism
  77. def gatherUnordered[A](fs: IList[Promise[A]]): Promise[IList[A]]

    Nondeterministically gather results from the given sequence of actions to a list.

    Nondeterministically gather results from the given sequence of actions to a list. Same as calling reduceUnordered with the List Monoid.

    To preserve the order of the output list while allowing nondetermininstic ordering of effects, use gather.

    Definition Classes
    Nondeterminism
  78. def gatherUnordered1[A](fs: NonEmptyList[Promise[A]]): Promise[NonEmptyList[A]]
    Definition Classes
    Nondeterminism
  79. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  80. def handleError[A](fa: Promise[A])(f: (Any) => Promise[A]): Promise[A]
    Definition Classes
    JSPromiseInstance → ApplicativeError
  81. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  82. def icompose[G[_]](implicit G0: Contravariant[G]): Contravariant[[α]Promise[G[α]]]

    The composition of Functor F and Contravariant G, [x]F[G[x]], is contravariant.

    The composition of Functor F and Contravariant G, [x]F[G[x]], is contravariant.

    Definition Classes
    Functor
  83. def ifM[B](value: Promise[Boolean], ifTrue: => Promise[B], ifFalse: => Promise[B]): Promise[B]

    if lifted into a binding.

    if lifted into a binding. Unlike lift3((t,c,a)=>if(t)c else a), this will only include context from the chosen of ifTrue and ifFalse, not the other.

    Definition Classes
    Bind
  84. val invariantApplicativeSyntax: InvariantApplicativeSyntax[Promise]
    Definition Classes
    InvariantApplicative
  85. def invariantFunctorLaw: InvariantFunctorLaw
    Definition Classes
    InvariantFunctor
  86. val invariantFunctorSyntax: InvariantFunctorSyntax[Promise]
    Definition Classes
    InvariantFunctor
  87. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  88. def iterateUntil[A](f: Promise[A])(p: (A) => Boolean): Promise[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
    Monad
  89. def iterateWhile[A](f: Promise[A])(p: (A) => Boolean): Promise[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
    Monad
  90. def join[A](ffa: Promise[Promise[A]]): Promise[A]

    Sequence the inner F of FFA after the outer F, forming a single F[A].

    Sequence the inner F of FFA after the outer F, forming a single F[A].

    Definition Classes
    Bind
  91. def lift[A, B](f: (A) => B): (Promise[A]) => Promise[B]

    Lift f into F.

    Lift f into F.

    Definition Classes
    Functor
  92. def lift10[A, B, C, D, E, FF, G, H, I, J, R](f: (A, B, C, D, E, FF, G, H, I, J) => R): (Promise[A], Promise[B], Promise[C], Promise[D], Promise[E], Promise[FF], Promise[G], Promise[H], Promise[I], Promise[J]) => Promise[R]
    Definition Classes
    Apply
  93. def lift11[A, B, C, D, E, FF, G, H, I, J, K, R](f: (A, B, C, D, E, FF, G, H, I, J, K) => R): (Promise[A], Promise[B], Promise[C], Promise[D], Promise[E], Promise[FF], Promise[G], Promise[H], Promise[I], Promise[J], Promise[K]) => Promise[R]
    Definition Classes
    Apply
  94. def lift12[A, B, C, D, E, FF, G, H, I, J, K, L, R](f: (A, B, C, D, E, FF, G, H, I, J, K, L) => R): (Promise[A], Promise[B], Promise[C], Promise[D], Promise[E], Promise[FF], Promise[G], Promise[H], Promise[I], Promise[J], Promise[K], Promise[L]) => Promise[R]
    Definition Classes
    Apply
  95. def lift2[A, B, C](f: (A, B) => C): (Promise[A], Promise[B]) => Promise[C]
    Definition Classes
    Apply
  96. def lift3[A, B, C, D](f: (A, B, C) => D): (Promise[A], Promise[B], Promise[C]) => Promise[D]
    Definition Classes
    Apply
  97. def lift4[A, B, C, D, E](f: (A, B, C, D) => E): (Promise[A], Promise[B], Promise[C], Promise[D]) => Promise[E]
    Definition Classes
    Apply
  98. def lift5[A, B, C, D, E, R](f: (A, B, C, D, E) => R): (Promise[A], Promise[B], Promise[C], Promise[D], Promise[E]) => Promise[R]
    Definition Classes
    Apply
  99. def lift6[A, B, C, D, E, FF, R](f: (A, B, C, D, E, FF) => R): (Promise[A], Promise[B], Promise[C], Promise[D], Promise[E], Promise[FF]) => Promise[R]
    Definition Classes
    Apply
  100. def lift7[A, B, C, D, E, FF, G, R](f: (A, B, C, D, E, FF, G) => R): (Promise[A], Promise[B], Promise[C], Promise[D], Promise[E], Promise[FF], Promise[G]) => Promise[R]
    Definition Classes
    Apply
  101. def lift8[A, B, C, D, E, FF, G, H, R](f: (A, B, C, D, E, FF, G, H) => R): (Promise[A], Promise[B], Promise[C], Promise[D], Promise[E], Promise[FF], Promise[G], Promise[H]) => Promise[R]
    Definition Classes
    Apply
  102. def lift9[A, B, C, D, E, FF, G, H, I, R](f: (A, B, C, D, E, FF, G, H, I) => R): (Promise[A], Promise[B], Promise[C], Promise[D], Promise[E], Promise[FF], Promise[G], Promise[H], Promise[I]) => Promise[R]
    Definition Classes
    Apply
  103. def liftReducer[A, B](implicit r: Reducer[A, B]): Reducer[Promise[A], Promise[B]]
    Definition Classes
    Apply
  104. def map[A, B](fa: Promise[A])(f: (A) => B): Promise[B]

    Lift f into F and apply to F[A].

    Lift f into F and apply to F[A].

    Definition Classes
    Monad → Applicative → Functor
  105. def mapBoth[A, B, C](a: Promise[A], b: Promise[B])(f: (A, B) => C): Promise[C]

    Apply a function to the results of a and b, nondeterminstically ordering their effects.

    Apply a function to the results of a and b, nondeterminstically ordering their effects.

    Definition Classes
    Nondeterminism
  106. def mapply[A, B](a: A)(f: Promise[(A) => B]): Promise[B]

    Lift apply(a), and apply the result to f.

    Lift apply(a), and apply the result to f.

    Definition Classes
    Functor
  107. def monadErrorLaw: MonadErrorLaw
    Definition Classes
    MonadError
  108. val monadErrorSyntax: MonadErrorSyntax[Promise, Any]
    Definition Classes
    MonadError
  109. def monadLaw: MonadLaw
    Definition Classes
    Monad
  110. val monadSyntax: MonadSyntax[Promise]
    Definition Classes
    Monad
  111. def mproduct[A, B](fa: Promise[A])(f: (A) => Promise[B]): Promise[(A, B)]

    Pair A with the result of function application.

    Pair A with the result of function application.

    Definition Classes
    Bind
  112. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  113. def nmap2[A, B, C](a: Promise[A], b: Promise[B])(f: (A, B) => C): Promise[C]

    Apply a function to 2 results, nondeterminstically ordering their effects, alias of mapBoth

    Apply a function to 2 results, nondeterminstically ordering their effects, alias of mapBoth

    Definition Classes
    Nondeterminism
  114. def nmap3[A, B, C, R](a: Promise[A], b: Promise[B], c: Promise[C])(f: (A, B, C) => R): Promise[R]

    Apply a function to 3 results, nondeterminstically ordering their effects

    Apply a function to 3 results, nondeterminstically ordering their effects

    Definition Classes
    Nondeterminism
  115. def nmap4[A, B, C, D, R](a: Promise[A], b: Promise[B], c: Promise[C], d: Promise[D])(f: (A, B, C, D) => R): Promise[R]

    Apply a function to 4 results, nondeterminstically ordering their effects

    Apply a function to 4 results, nondeterminstically ordering their effects

    Definition Classes
    Nondeterminism
  116. def nmap5[A, B, C, D, E, R](a: Promise[A], b: Promise[B], c: Promise[C], d: Promise[D], e: Promise[E])(f: (A, B, C, D, E) => R): Promise[R]

    Apply a function to 5 results, nondeterminstically ordering their effects

    Apply a function to 5 results, nondeterminstically ordering their effects

    Definition Classes
    Nondeterminism
  117. def nmap6[A, B, C, D, E, FF, R](a: Promise[A], b: Promise[B], c: Promise[C], d: Promise[D], e: Promise[E], ff: Promise[FF])(f: (A, B, C, D, E, FF) => R): Promise[R]

    Apply a function to 6 results, nondeterminstically ordering their effects

    Apply a function to 6 results, nondeterminstically ordering their effects

    Definition Classes
    Nondeterminism
  118. val nondeterminismSyntax: NondeterminismSyntax[Promise]
    Definition Classes
    Nondeterminism
  119. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  120. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  121. def par: Par[Promise]

    A lawful implementation of this that is isomorphic up to the methods defined on Applicative allowing for optimised parallel implementations that would otherwise violate laws of more specific typeclasses (e.g.

    A lawful implementation of this that is isomorphic up to the methods defined on Applicative allowing for optimised parallel implementations that would otherwise violate laws of more specific typeclasses (e.g. Monad).

    Definition Classes
    Applicative
  122. def parallel: Applicative[[α]TagKind.@@[Promise[α], Parallel]]
    Definition Classes
    Nondeterminism
  123. def plusA[A](x: => Promise[A], y: => Promise[A])(implicit sa: Semigroup[A]): Promise[A]

    Semigroups can be added within an Applicative

    Semigroups can be added within an Applicative

    Definition Classes
    Applicative
  124. def point[A](a: => A): Promise[A]
    Definition Classes
    JSPromiseInstance → Applicative
    Annotations
    @inline()
  125. def product[G[_]](implicit G0: Monad[G]): Monad[[α](Promise[α], G[α])]

    The product of Monad F and G, [x](F[x], G[x]]), is a Monad

    The product of Monad F and G, [x](F[x], G[x]]), is a Monad

    Definition Classes
    Monad
  126. def product[G[_]](implicit G0: Bind[G]): Bind[[α](Promise[α], G[α])]

    The product of Bind F and G, [x](F[x], G[x]]), is a Bind

    The product of Bind F and G, [x](F[x], G[x]]), is a Bind

    Definition Classes
    Bind
  127. def product[G[_]](implicit G0: Applicative[G]): Applicative[[α](Promise[α], G[α])]

    The product of Applicatives F and G, [x](F[x], G[x]]), is an Applicative

    The product of Applicatives F and G, [x](F[x], G[x]]), is an Applicative

    Definition Classes
    Applicative
  128. def product[G[_]](implicit G0: Apply[G]): Apply[[α](Promise[α], G[α])]

    The product of Applys F and G, [x](F[x], G[x]]), is a Apply

    The product of Applys F and G, [x](F[x], G[x]]), is a Apply

    Definition Classes
    Apply
  129. def product[G[_]](implicit G0: Functor[G]): Functor[[α](Promise[α], G[α])]

    The product of Functors F and G, [x](F[x], G[x]]), is a Functor

    The product of Functors F and G, [x](F[x], G[x]]), is a Functor

    Definition Classes
    Functor
  130. final def pure[A](a: => A): Promise[A]
    Definition Classes
    Applicative
  131. def raiseError[A](e: Any): Promise[A]
    Definition Classes
    JSPromiseInstance → ApplicativeError
  132. def reduceUnordered[A, M](fs: IList[Promise[A]])(implicit R: Reducer[A, M], M: Monoid[M]): Promise[M]

    Nondeterministically gather results from the given sequence of actions.

    Nondeterministically gather results from the given sequence of actions. The result will be arbitrarily reordered, depending on the order results come back in a sequence of calls to chooseAny.

    Definition Classes
    Nondeterminism
  133. def replicateM[A](n: Int, fa: Promise[A]): Promise[IList[A]]

    Performs the action n times, returning the list of results.

    Performs the action n times, returning the list of results.

    Definition Classes
    Applicative
  134. def replicateM_[A](n: Int, fa: Promise[A]): Promise[Unit]

    Performs the action n times, returning nothing.

    Performs the action n times, returning nothing.

    Definition Classes
    Applicative
  135. def sequence[A, G[_]](as: G[Promise[A]])(implicit arg0: Traverse[G]): Promise[G[A]]
    Definition Classes
    Applicative
  136. def sequence1[A, G[_]](as: G[Promise[A]])(implicit arg0: Traverse1[G]): Promise[G[A]]
    Definition Classes
    Apply
  137. def strengthL[A, B](a: A, f: Promise[B]): Promise[(A, B)]

    Inject a to the left of Bs in f.

    Inject a to the left of Bs in f.

    Definition Classes
    Functor
  138. def strengthR[A, B](f: Promise[A], b: B): Promise[(A, B)]

    Inject b to the right of As in f.

    Inject b to the right of As in f.

    Definition Classes
    Functor
  139. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  140. def toString(): String
    Definition Classes
    AnyRef → Any
  141. def traverse[A, G[_], B](value: G[A])(f: (A) => Promise[B])(implicit G: Traverse[G]): Promise[G[B]]
    Definition Classes
    Applicative
  142. def traverse1[A, G[_], B](value: G[A])(f: (A) => Promise[B])(implicit G: Traverse1[G]): Promise[G[B]]
    Definition Classes
    Apply
  143. def tuple2[A, B](fa: => Promise[A], fb: => Promise[B]): Promise[(A, B)]
    Definition Classes
    Apply
  144. def tuple3[A, B, C](fa: => Promise[A], fb: => Promise[B], fc: => Promise[C]): Promise[(A, B, C)]
    Definition Classes
    Apply
  145. def tuple4[A, B, C, D](fa: => Promise[A], fb: => Promise[B], fc: => Promise[C], fd: => Promise[D]): Promise[(A, B, C, D)]
    Definition Classes
    Apply
  146. def tuple5[A, B, C, D, E](fa: => Promise[A], fb: => Promise[B], fc: => Promise[C], fd: => Promise[D], fe: => Promise[E]): Promise[(A, B, C, D, E)]
    Definition Classes
    Apply
  147. def unfoldrOpt[S, A, B](seed: S)(f: (S) => Maybe[(Promise[A], S)])(implicit R: Reducer[A, B]): Maybe[Promise[B]]

    Unfold seed to the right and combine effects left-to-right, using the given Reducer to combine values.

    Unfold seed to the right and combine effects left-to-right, using the given Reducer to combine values. Implementations may override this method to not unfold more than is necessary to determine the result.

    Definition Classes
    Apply
  148. def unlessM[A](cond: Boolean)(f: => Promise[A]): Promise[Unit]

    Returns the given argument if cond is false, otherwise, unit lifted into F.

    Returns the given argument if cond is false, otherwise, unit lifted into F.

    Definition Classes
    Applicative
  149. def untilM[G[_], A](f: Promise[A], cond: => Promise[Boolean])(implicit G: MonadPlus[G]): Promise[G[A]]

    Execute an action repeatedly until the Boolean condition returns true.

    Execute an action repeatedly until the Boolean condition returns true. The condition is evaluated after the loop body. Collects results into an arbitrary MonadPlus value, such as a List.

    Definition Classes
    Monad
  150. def untilM_[A](f: Promise[A], cond: => Promise[Boolean]): Promise[Unit]

    Execute an action repeatedly until the Boolean condition returns true.

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

    Definition Classes
    Monad
  151. def void[A](fa: Promise[A]): Promise[Unit]

    Empty fa of meaningful pure values, preserving its structure.

    Empty fa of meaningful pure values, preserving its structure.

    Definition Classes
    Functor
  152. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  153. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  154. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  155. def whenM[A](cond: Boolean)(f: => Promise[A]): Promise[Unit]

    Returns the given argument if cond is true, otherwise, unit lifted into F.

    Returns the given argument if cond is true, otherwise, unit lifted into F.

    Definition Classes
    Applicative
  156. def whileM[G[_], A](p: Promise[Boolean], body: => Promise[A])(implicit G: MonadPlus[G]): Promise[G[A]]

    Execute an action repeatedly as long as the given Boolean expression returns true.

    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 MonadPlus value, such as a List.

    Definition Classes
    Monad
  157. def whileM_[A](p: Promise[Boolean], body: => Promise[A]): Promise[Unit]

    Execute an action repeatedly as long as the given Boolean expression returns true.

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

    Definition Classes
    Monad
  158. def widen[A, B](fa: Promise[A])(implicit ev: <~<[A, B]): Promise[B]

    Functors are covariant by nature, so we can treat an F[A] as an F[B] if A is a subtype of B.

    Functors are covariant by nature, so we can treat an F[A] as an F[B] if A is a subtype of B.

    Definition Classes
    Functor
  159. final def xderiving0[Z](z: => Z): Promise[Z]
    Definition Classes
    InvariantApplicative
  160. final def xderiving1[Z, A1](f: (A1) => Z, g: (Z) => A1)(implicit a1: Promise[A1]): Promise[Z]
    Definition Classes
    InvariantApplicative
  161. final def xderiving2[Z, A1, A2](f: (A1, A2) => Z, g: (Z) => (A1, A2))(implicit a1: Promise[A1], a2: Promise[A2]): Promise[Z]
    Definition Classes
    InvariantApplicative
  162. final def xderiving3[Z, A1, A2, A3](f: (A1, A2, A3) => Z, g: (Z) => (A1, A2, A3))(implicit a1: Promise[A1], a2: Promise[A2], a3: Promise[A3]): Promise[Z]
    Definition Classes
    InvariantApplicative
  163. final def xderiving4[Z, A1, A2, A3, A4](f: (A1, A2, A3, A4) => Z, g: (Z) => (A1, A2, A3, A4))(implicit a1: Promise[A1], a2: Promise[A2], a3: Promise[A3], a4: Promise[A4]): Promise[Z]
    Definition Classes
    InvariantApplicative
  164. def xmap[A, B](fa: Promise[A], f: (A) => B, g: (B) => A): Promise[B]

    Converts ma to a value of type F[B] using the provided functions f and g.

    Converts ma to a value of type F[B] using the provided functions f and g.

    Definition Classes
    Functor → InvariantFunctor
  165. def xmapb[A, B](ma: Promise[A])(b: Bijection[A, B]): Promise[B]

    Converts ma to a value of type F[B] using the provided bijection.

    Converts ma to a value of type F[B] using the provided bijection.

    Definition Classes
    InvariantFunctor
  166. def xmapi[A, B](ma: Promise[A])(iso: Isomorphism.<=>[A, B]): Promise[B]

    Converts ma to a value of type F[B] using the provided isomorphism.

    Converts ma to a value of type F[B] using the provided isomorphism.

    Definition Classes
    InvariantFunctor
  167. def xproduct0[Z](z: => Z): Promise[Z]
    Definition Classes
    Applicative → InvariantApplicative
  168. def xproduct1[Z, A1](a1: => Promise[A1])(f: (A1) => Z, g: (Z) => A1): Promise[Z]
    Definition Classes
    Applicative → InvariantApplicative
  169. def xproduct2[Z, A1, A2](a1: => Promise[A1], a2: => Promise[A2])(f: (A1, A2) => Z, g: (Z) => (A1, A2)): Promise[Z]
    Definition Classes
    Applicative → InvariantApplicative
  170. def xproduct3[Z, A1, A2, A3](a1: => Promise[A1], a2: => Promise[A2], a3: => Promise[A3])(f: (A1, A2, A3) => Z, g: (Z) => (A1, A2, A3)): Promise[Z]
    Definition Classes
    Applicative → InvariantApplicative
  171. def xproduct4[Z, A1, A2, A3, A4](a1: => Promise[A1], a2: => Promise[A2], a3: => Promise[A3], a4: => Promise[A4])(f: (A1, A2, A3, A4) => Z, g: (Z) => (A1, A2, A3, A4)): Promise[Z]
    Definition Classes
    Applicative → InvariantApplicative

Inherited from Cobind[Promise]

Inherited from MonadError[Promise, Any]

Inherited from ApplicativeError[Promise, Any]

Inherited from Nondeterminism[Promise]

Inherited from Monad[Promise]

Inherited from Bind[Promise]

Inherited from Applicative[Promise]

Inherited from InvariantApplicative[Promise]

Inherited from Apply[Promise]

Inherited from Functor[Promise]

Inherited from InvariantFunctor[Promise]

Inherited from AnyRef

Inherited from Any

Ungrouped