Trait/Object

monix.types

Streamable

Related Docs: object Streamable | package types

Permalink

trait Streamable[F[_]] extends MonadFilter[F] with MonadConsError[F, Throwable] with Recoverable[F, Throwable] with Scannable[F] with FFoldable[F] with Zippable[F] with CoflatMap[F] with Serializable

Type-class describing operations for streams.

Linear Supertypes
CoflatMap[F], Zippable[F], FFoldable[F], Scannable[F], MonadConsError[F, Throwable], Recoverable[F, Throwable], cats.MonadError[F, Throwable], ApplicativeError[F, Throwable], MonadCons[F], cats.MonadFilter[F], cats.Monad[F], Applicative[F], FlatMap[F], Apply[F], ApplyArityFunctions[F], Cartesian[F], cats.Functor[F], Invariant[F], Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Streamable
  2. CoflatMap
  3. Zippable
  4. FFoldable
  5. Scannable
  6. MonadConsError
  7. Recoverable
  8. MonadError
  9. ApplicativeError
  10. MonadCons
  11. MonadFilter
  12. Monad
  13. Applicative
  14. FlatMap
  15. Apply
  16. ApplyArityFunctions
  17. Cartesian
  18. Functor
  19. Invariant
  20. Serializable
  21. Serializable
  22. AnyRef
  23. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def bufferSkipped[A](fa: F[A], count: Int, skip: Int): F[Seq[A]]

    Permalink

    Periodically gather items emitted by the source into bundles.

    Periodically gather items emitted by the source into bundles.

    For count and skip there are 3 possibilities:

    1. in case skip == count, then there are no items dropped and no overlap, the call being equivalent to buffer(count) 2. in case skip < count, then overlap between buffers happens, with the number of elements being repeated being count - skip 3. in case skip > count, then skip - count elements start getting dropped between windows

  2. abstract def coflatMap[A, B](fa: F[A])(f: (F[A]) ⇒ B): F[B]

    Permalink
    Definition Classes
    CoflatMap

  3. abstract def concatMap[A, B](fa: F[A])(f: (A) ⇒ F[B]): F[B]

    Permalink

    Alias for flatMap.

    Alias for flatMap.

    Definition Classes
    MonadCons

  4. abstract def concatMapDelayError[A, B](fa: F[A])(f: (A) ⇒ F[B]): F[B]

    Permalink

    A variant of concatMap that delays any triggered errors for as long as possible.

    A variant of concatMap that delays any triggered errors for as long as possible.

    Typically this means delaying any errors until the source and any child produced by the given function are complete. Since this can involve delaying multiple errors, it is recommended for the final error to be a composite.

    Definition Classes
    MonadConsError

  5. abstract def cons[A](head: A, tail: Eval[F[A]]): F[A]

    Permalink

    Builds an instance by joining a head and a lazy tail.

    Builds an instance by joining a head and a lazy tail.

    Definition Classes
    MonadCons

  6. abstract def distinct[A](fa: F[A]): F[A]

    Permalink

    Creates a sequence that eliminates duplicates from the source.

  7. abstract def distinctByKey[A, Key](fa: F[A])(key: (A) ⇒ Key): F[A]

    Permalink

    Creates a sequence that eliminates duplicates from the source, as determined by the given selector function that returns keys for comparison.

  8. abstract def distinctUntilChanged[A](fa: F[A]): F[A]

    Permalink

    Suppress duplicate consecutive items emitted by the source.

  9. abstract def distinctUntilChangedByKey[A, Key](fa: F[A])(key: (A) ⇒ Key): F[A]

    Permalink

    Suppress duplicate consecutive items emitted by the source.

  10. abstract def drop[A](fa: F[A], n: Int): F[A]

    Permalink

    Returns a new sequence that will drop a maximum of n elements from the start of the source sequence.

  11. abstract def dropLast[A](fa: F[A], n: Int): F[A]

    Permalink

    Drops the last n elements (from the end).

  12. abstract def dropWhile[A](fa: F[A])(f: (A) ⇒ Boolean): F[A]

    Permalink

    Returns a new sequence that will drop elements from the start of the source sequence, for as long as the given function f returns true and then stop.

  13. abstract def empty[A]: F[A]

    Permalink
    Definition Classes
    MonadFilter

  14. abstract def existsF[A](fa: F[A])(p: (A) ⇒ Boolean): F[Boolean]

    Permalink

    Check whether at least one element satisfies the predicate.

    Check whether at least one element satisfies the predicate.

    If there are no elements, the result is false.

  15. abstract def failed[A](fa: F[A]): F[Throwable]

    Permalink

    In case the source emits an error, then emit that error.

    In case the source emits an error, then emit that error.

    Definition Classes
    Recoverable

  16. abstract def findOptF[A](fa: F[A])(p: (A) ⇒ Boolean): F[Option[A]]

    Permalink

    Find the first element matching the predicate, if one exists.

  17. abstract def foldLeftF[A, S](fa: F[A], seed: S)(f: (S, A) ⇒ S): F[S]

    Permalink

    Left associative asynchronous fold on 'F' using the function 'f'.

    Left associative asynchronous fold on 'F' using the function 'f'.

    Definition Classes
    FFoldable

  18. abstract def forAllF[A](fa: F[A])(p: (A) ⇒ Boolean): F[Boolean]

    Permalink

    Check whether all elements satisfies the predicate.

    Check whether all elements satisfies the predicate.

    If at least one element doesn't satisfy the predicate, the result is false.

  19. abstract def fromIterable[A](ia: Iterable[A]): F[A]

    Permalink

    Lifts any Iterable into a Sequenceable type.

  20. abstract def isEmptyF[A](fa: F[A]): F[Boolean]

    Permalink

    Checks if the source sequence is empty.

  21. abstract def nonEmptyF[A](fa: F[A]): F[Boolean]

    Permalink

    Checks if the source sequence is non-empty.

  22. abstract def onErrorRecoverWith[A](fa: F[A])(pf: PartialFunction[Throwable, F[A]]): F[A]

    Permalink

    Mirrors the source, until the source throws an error, after which it tries to fallback to the output of the given partial function.

    Mirrors the source, until the source throws an error, after which it tries to fallback to the output of the given partial function.

    Obviously, the implementation needs to be stack-safe.

    Definition Classes
    Recoverable

  23. abstract def pure[A](x: A): F[A]

    Permalink
    Definition Classes
    Applicative

  24. abstract def raiseError[A](e: Throwable): F[A]

    Permalink
    Definition Classes
    ApplicativeError

  25. abstract def scan[A, S](fa: F[A], seed: S)(f: (S, A) ⇒ S): F[S]

    Permalink
    Definition Classes
    Scannable

  26. abstract def take[A](fa: F[A], n: Int): F[A]

    Permalink

    Returns a new sequence that will take a maximum of n elements from the start of the source sequence.

  27. abstract def takeLast[A](fa: F[A], n: Int): F[A]

    Permalink

    Returns a new sequence that will take a maximum of n elements from the end of the source sequence.

  28. abstract def takeWhile[A](fa: F[A])(f: (A) ⇒ Boolean): F[A]

    Permalink

    Returns a new sequence that will take elements from the start of the source sequence, for as long as the given function f returns true and then stop.

  29. abstract def zipList[A](sources: Seq[F[A]]): F[Seq[A]]

    Permalink
    Definition Classes
    Zippable

  30. abstract def zipWith2[A1, A2, R](fa1: F[A1], fa2: F[A2])(f: (A1, A2) ⇒ R): F[R]

    Permalink
    Definition Classes
    Zippable

Concrete Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  4. def ap[A, B](ff: F[(A) ⇒ B])(fa: F[A]): F[B]

    Permalink
    Definition Classes
    FlatMap → Apply

  5. def ap10[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, Z](f: F[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9) ⇒ Z])(f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9]): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  6. def ap11[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, Z](f: F[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10) ⇒ Z])(f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10]): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  7. def ap12[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, Z](f: F[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11) ⇒ Z])(f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11]): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  8. def ap13[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, Z](f: F[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12) ⇒ Z])(f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12]): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  9. def ap14[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, Z](f: F[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13) ⇒ Z])(f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12], f13: F[A13]): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  10. def ap15[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, Z](f: F[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14) ⇒ Z])(f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12], f13: F[A13], f14: F[A14]): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  11. def ap16[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, Z](f: F[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15) ⇒ Z])(f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12], f13: F[A13], f14: F[A14], f15: F[A15]): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  12. def ap17[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, Z](f: F[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16) ⇒ Z])(f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12], f13: F[A13], f14: F[A14], f15: F[A15], f16: F[A16]): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  13. def ap18[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, Z](f: F[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17) ⇒ Z])(f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12], f13: F[A13], f14: F[A14], f15: F[A15], f16: F[A16], f17: F[A17]): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  14. def ap19[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, Z](f: F[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18) ⇒ Z])(f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12], f13: F[A13], f14: F[A14], f15: F[A15], f16: F[A16], f17: F[A17], f18: F[A18]): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  15. def ap2[A, B, Z](ff: F[(A, B) ⇒ Z])(fa: F[A], fb: F[B]): F[Z]

    Permalink
    Definition Classes
    Apply

  16. def ap20[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, A19, Z](f: F[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, A19) ⇒ Z])(f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12], f13: F[A13], f14: F[A14], f15: F[A15], f16: F[A16], f17: F[A17], f18: F[A18], f19: F[A19]): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  17. 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: F[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, A19, A20) ⇒ Z])(f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12], f13: F[A13], f14: F[A14], f15: F[A15], f16: F[A16], f17: F[A17], f18: F[A18], f19: F[A19], f20: F[A20]): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  18. 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: F[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, A19, A20, A21) ⇒ Z])(f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12], f13: F[A13], f14: F[A14], f15: F[A15], f16: F[A16], f17: F[A17], f18: F[A18], f19: F[A19], f20: F[A20], f21: F[A21]): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  19. def ap3[A0, A1, A2, Z](f: F[(A0, A1, A2) ⇒ Z])(f0: F[A0], f1: F[A1], f2: F[A2]): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  20. def ap4[A0, A1, A2, A3, Z](f: F[(A0, A1, A2, A3) ⇒ Z])(f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3]): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  21. def ap5[A0, A1, A2, A3, A4, Z](f: F[(A0, A1, A2, A3, A4) ⇒ Z])(f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4]): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  22. def ap6[A0, A1, A2, A3, A4, A5, Z](f: F[(A0, A1, A2, A3, A4, A5) ⇒ Z])(f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5]): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  23. def ap7[A0, A1, A2, A3, A4, A5, A6, Z](f: F[(A0, A1, A2, A3, A4, A5, A6) ⇒ Z])(f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6]): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  24. def ap8[A0, A1, A2, A3, A4, A5, A6, A7, Z](f: F[(A0, A1, A2, A3, A4, A5, A6, A7) ⇒ Z])(f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7]): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  25. def ap9[A0, A1, A2, A3, A4, A5, A6, A7, A8, Z](f: F[(A0, A1, A2, A3, A4, A5, A6, A7, A8) ⇒ Z])(f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8]): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  26. def as[A, B](fa: F[A], b: B): F[B]

    Permalink
    Definition Classes
    Functor

  27. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  28. def attempt[A](fa: F[A]): F[Xor[Throwable, A]]

    Permalink
    Definition Classes
    ApplicativeError

  29. def attemptT[A](fa: F[A]): XorT[F, Throwable, A]

    Permalink
    Definition Classes
    ApplicativeError

  30. def buffer[A](fa: F[A])(count: Int): F[Seq[A]]

    Permalink

    Periodically gather items emitted by the source into bundles of the specified size.

  31. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  32. def coflatten[A](fa: F[A]): F[F[A]]

    Permalink
    Definition Classes
    CoflatMap

  33. def collect[A, B](fa: F[A])(pf: PartialFunction[A, B]): F[B]

    Permalink

    Given a partial function, filters and transforms the source by it.

  34. def completed[A](fa: F[A]): F[A]

    Permalink

    Builds an empty instance that completes when the source completes.

  35. def compose[G[_]](implicit GG: Applicative[G]): Applicative[[α]F[G[α]]]

    Permalink
    Definition Classes
    Applicative

  36. def compose[G[_]](implicit GG: Apply[G]): Apply[[X]F[G[X]]]

    Permalink
    Definition Classes
    Apply

  37. def compose[G[_]](implicit GG: cats.Functor[G]): cats.Functor[[X]F[G[X]]]

    Permalink
    Definition Classes
    Functor

  38. def compose[G[_]](implicit arg0: Invariant[G], GG: Invariant[G]): Invariant[[X]F[G[X]]]

    Permalink
    Definition Classes
    Invariant

  39. def composeWithContravariant[G[_]](implicit GG: Contravariant[G]): Contravariant[[X]F[G[X]]]

    Permalink
    Definition Classes
    Functor → Invariant

  40. def composeWithFunctor[G[_]](implicit arg0: cats.Functor[G]): cats.Functor[[X]F[G[X]]]

    Permalink
    Definition Classes
    Functor → Invariant

  41. def concat[A](ffa: F[F[A]]): F[A]

    Permalink

    Alias for flatten.

    Alias for flatten.

    Definition Classes
    MonadCons

  42. def concatDelayError[A](ffa: F[F[A]]): F[A]

    Permalink

    A variant of concat that delays any triggered errors for as long as possible.

    A variant of concat that delays any triggered errors for as long as possible.

    Typically this means delaying any errors until the source and any child produced by it are complete. Since this can involve delaying multiple errors, it is recommended for the final error to be a composite.

    Definition Classes
    MonadConsError

  43. def countF[A](fa: F[A]): F[Long]

    Permalink

    Given a sequences, produces a new sequence that will expose the count of the source.

    Given a sequences, produces a new sequence that will expose the count of the source.

    Definition Classes
    FFoldable

  44. def endWith[A](fa: F[A])(elems: Seq[A]): F[A]

    Permalink

    Ends the sequence with the given elements.

  45. def endWithElem[A](fa: F[A])(elem: A): F[A]

    Permalink

    Appends the given elem at the end.

    Appends the given elem at the end.

    Definition Classes
    MonadCons
    Annotations
    @op( ":+" , simulacrum.this.op.<init>$default$2 )

  46. def endWithError[A](fa: F[A], error: Throwable): F[A]

    Permalink

    Mirrors the source, but ends it in error.

    Mirrors the source, but ends it in error.

    Definition Classes
    MonadConsError

  47. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  48. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  49. def filter[A](fa: F[A])(f: (A) ⇒ Boolean): F[A]

    Permalink
    Definition Classes
    MonadFilter

  50. def filterM[A](fa: F[A])(f: (A) ⇒ F[Boolean]): F[A]

    Permalink
    Definition Classes
    MonadFilter

  51. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  52. def firstOrElseF[A](fa: F[A], default: Eval[A]): F[A]

    Permalink

    Returns the first element in a sequence.

    Returns the first element in a sequence.

    Alias for headOrElseF.

  53. final def flatMap[A, B](fa: F[A])(f: (A) ⇒ F[B]): F[B]

    Permalink
    Definition Classes
    MonadCons → FlatMap

  54. final def flatten[A](ffa: F[F[A]]): F[A]

    Permalink
    Definition Classes
    MonadCons → FlatMap

  55. def foldF[A](fa: F[A])(implicit A: Monoid[A]): F[A]

    Permalink

    Folds a Monoid.

    Folds a Monoid.

    Definition Classes
    FFoldable

  56. def foldMapF[A, B](fa: F[A])(f: (A) ⇒ B)(implicit B: Monoid[B]): F[B]

    Permalink

    Fold implemented by mapping A values into B and then combining them using the given Monoid[B] instance.

    Fold implemented by mapping A values into B and then combining them using the given Monoid[B] instance.

    Definition Classes
    FFoldable

  57. def followWith[A](fa: F[A], other: ⇒ F[A]): F[A]

    Permalink

    Concatenates the source with other.

    Concatenates the source with other.

    Definition Classes
    MonadCons
    Annotations
    @op( "++" , simulacrum.this.op.<init>$default$2 )

  58. def fproduct[A, B](fa: F[A])(f: (A) ⇒ B): F[(A, B)]

    Permalink
    Definition Classes
    Functor

  59. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  60. final def handleError[A](fa: F[A])(f: (Throwable) ⇒ A): F[A]

    Permalink
    Definition Classes
    Recoverable → ApplicativeError

  61. final def handleErrorWith[A](fa: F[A])(f: (Throwable) ⇒ F[A]): F[A]

    Permalink
    Definition Classes
    Recoverable → ApplicativeError

  62. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  63. def headF[A](fa: F[A]): F[A]

    Permalink

    Returns the first element in a sequence.

  64. def headOrElseF[A](fa: F[A], default: Eval[A]): F[A]

    Permalink

    Returns the first element in a sequence.

  65. def ifM[B](fa: F[Boolean])(ifTrue: ⇒ F[B], ifFalse: ⇒ F[B]): F[B]

    Permalink
    Definition Classes
    FlatMap

  66. final def ignoreElements[A](fa: F[A]): F[A]

    Permalink

    Alias for completed.

  67. def imap[A, B](fa: F[A])(f: (A) ⇒ B)(fi: (B) ⇒ A): F[B]

    Permalink
    Definition Classes
    Functor → Invariant

  68. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  69. def lastF[A](fa: F[A]): F[A]

    Permalink

    Returns the last element in a sequence.

  70. def lift[A, B](f: (A) ⇒ B): (F[A]) ⇒ F[B]

    Permalink
    Definition Classes
    Functor

  71. def map[A, B](fa: F[A])(f: (A) ⇒ B): F[B]

    Permalink
    Definition Classes
    Monad → Functor

  72. def map10[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9])(f: (A0, A1, A2, A3, A4, A5, A6, A7, A8, A9) ⇒ Z): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  73. def map11[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10])(f: (A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10) ⇒ Z): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  74. def map12[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11])(f: (A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11) ⇒ Z): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  75. def map13[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12])(f: (A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12) ⇒ Z): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  76. def map14[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12], f13: F[A13])(f: (A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13) ⇒ Z): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  77. def map15[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12], f13: F[A13], f14: F[A14])(f: (A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14) ⇒ Z): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  78. def map16[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12], f13: F[A13], f14: F[A14], f15: F[A15])(f: (A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15) ⇒ Z): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  79. def map17[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12], f13: F[A13], f14: F[A14], f15: F[A15], f16: F[A16])(f: (A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16) ⇒ Z): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  80. def map18[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12], f13: F[A13], f14: F[A14], f15: F[A15], f16: F[A16], f17: F[A17])(f: (A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17) ⇒ Z): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  81. def map19[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12], f13: F[A13], f14: F[A14], f15: F[A15], f16: F[A16], f17: F[A17], f18: F[A18])(f: (A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18) ⇒ Z): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  82. def map2[A, B, Z](fa: F[A], fb: F[B])(f: (A, B) ⇒ Z): F[Z]

    Permalink
    Definition Classes
    Apply

  83. def map20[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, A19, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12], f13: F[A13], f14: F[A14], f15: F[A15], f16: F[A16], f17: F[A17], f18: F[A18], f19: F[A19])(f: (A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, A19) ⇒ Z): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  84. 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: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12], f13: F[A13], f14: F[A14], f15: F[A15], f16: F[A16], f17: F[A17], f18: F[A18], f19: F[A19], f20: F[A20])(f: (A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, A19, A20) ⇒ Z): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  85. 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: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12], f13: F[A13], f14: F[A14], f15: F[A15], f16: F[A16], f17: F[A17], f18: F[A18], f19: F[A19], f20: F[A20], f21: F[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): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  86. def map3[A0, A1, A2, Z](f0: F[A0], f1: F[A1], f2: F[A2])(f: (A0, A1, A2) ⇒ Z): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  87. def map4[A0, A1, A2, A3, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3])(f: (A0, A1, A2, A3) ⇒ Z): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  88. def map5[A0, A1, A2, A3, A4, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4])(f: (A0, A1, A2, A3, A4) ⇒ Z): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  89. def map6[A0, A1, A2, A3, A4, A5, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5])(f: (A0, A1, A2, A3, A4, A5) ⇒ Z): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  90. def map7[A0, A1, A2, A3, A4, A5, A6, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6])(f: (A0, A1, A2, A3, A4, A5, A6) ⇒ Z): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  91. def map8[A0, A1, A2, A3, A4, A5, A6, A7, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7])(f: (A0, A1, A2, A3, A4, A5, A6, A7) ⇒ Z): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  92. def map9[A0, A1, A2, A3, A4, A5, A6, A7, A8, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8])(f: (A0, A1, A2, A3, A4, A5, A6, A7, A8) ⇒ Z): F[Z]

    Permalink
    Definition Classes
    ApplyArityFunctions

  93. def maxByF[A, B](fa: F[A])(f: (A) ⇒ B)(implicit B: Ordering[B]): F[A]

    Permalink

    Given a key extractor, finds the element with the maximum key.

  94. def maxF[A](fa: F[A])(implicit A: Ordering[A]): F[A]

    Permalink

    Given an Ordering returns the maximum element of the source.

  95. def minByF[A, B](fa: F[A])(f: (A) ⇒ B)(implicit B: Ordering[B]): F[A]

    Permalink

    Given a key extractor, finds the element with the minimum key.

  96. def minF[A](fa: F[A])(implicit A: Ordering[A]): F[A]

    Permalink

    Given an Ordering returns the maximum element of the source.

  97. def mproduct[A, B](fa: F[A])(f: (A) ⇒ F[B]): F[(A, B)]

    Permalink
    Definition Classes
    FlatMap

  98. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  99. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  100. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  101. def onErrorFallbackTo[A](fa: F[A], other: Eval[F[A]]): F[A]

    Permalink

    Mirrors the source, but if an error happens, then fallback to other.

    Mirrors the source, but if an error happens, then fallback to other.

    Definition Classes
    Recoverable

  102. def onErrorRecover[A](fa: F[A])(pf: PartialFunction[Throwable, A]): F[A]

    Permalink

    Mirrors the source, but in case an error happens then use the given partial function to fallback to a given element for certain errors.

    Mirrors the source, but in case an error happens then use the given partial function to fallback to a given element for certain errors.

    Definition Classes
    Recoverable

  103. def onErrorRetry[A](fa: F[A], maxRetries: Long): F[A]

    Permalink

    In case an error happens, keeps retrying iterating the source from the start for maxRetries times.

    In case an error happens, keeps retrying iterating the source from the start for maxRetries times.

    So the number of attempted iterations of the source will be maxRetries+1.

    Definition Classes
    Recoverable

  104. def onErrorRetryIf[A](fa: F[A])(p: (Throwable) ⇒ Boolean): F[A]

    Permalink

    In case an error happens, retries iterating the source from the start for as long as the given predicate returns true.

    In case an error happens, retries iterating the source from the start for as long as the given predicate returns true.

    Definition Classes
    Recoverable

  105. def product[A, B](fa: F[A], fb: F[B]): F[(A, B)]

    Permalink
    Definition Classes
    FlatMap → Cartesian

  106. def pureEval[A](x: Eval[A]): F[A]

    Permalink
    Definition Classes
    Applicative

  107. final def recover[A](fa: F[A])(pf: PartialFunction[Throwable, A]): F[A]

    Permalink
    Definition Classes
    Recoverable → ApplicativeError

  108. final def recoverWith[A](fa: F[A])(pf: PartialFunction[Throwable, F[A]]): F[A]

    Permalink
    Definition Classes
    Recoverable → ApplicativeError

  109. def repeat[A](fa: F[A]): F[A]

    Permalink

    Repeats the source, continuously.

    Repeats the source, continuously.

    Definition Classes
    MonadCons

  110. def sequence[G[_], A](as: G[F[A]])(implicit arg0: Traverse[G]): F[G[A]]

    Permalink
    Definition Classes
    Applicative

  111. def startWith[A](fa: F[A])(elems: Seq[A]): F[A]

    Permalink

    Starts the sequence with the given elements.

  112. def startWithElem[A](fa: F[A])(elem: A): F[A]

    Permalink

    Prepends the given elem at the start.

    Prepends the given elem at the start.

    Definition Classes
    MonadCons
    Annotations
    @op( "+:" , simulacrum.this.op.<init>$default$2 )

  113. def sumF[A](fa: F[A])(implicit A: Numeric[A]): F[A]

    Permalink

    Given a sequence of numbers, calculates a sum.

    Given a sequence of numbers, calculates a sum.

    Definition Classes
    FFoldable

  114. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef

  115. def tail[A](fa: F[A]): F[A]

    Permalink

    Returns a new sequence with the first element dropped.

  116. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  117. def traverse[A, G[_], B](value: G[A])(f: (A) ⇒ F[B])(implicit G: Traverse[G]): F[G[B]]

    Permalink
    Definition Classes
    Applicative

  118. def tuple10[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9]): F[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9)]

    Permalink
    Definition Classes
    ApplyArityFunctions

  119. def tuple11[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10]): F[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10)]

    Permalink
    Definition Classes
    ApplyArityFunctions

  120. def tuple12[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11]): F[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11)]

    Permalink
    Definition Classes
    ApplyArityFunctions

  121. def tuple13[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12]): F[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12)]

    Permalink
    Definition Classes
    ApplyArityFunctions

  122. def tuple14[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12], f13: F[A13]): F[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13)]

    Permalink
    Definition Classes
    ApplyArityFunctions

  123. def tuple15[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12], f13: F[A13], f14: F[A14]): F[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14)]

    Permalink
    Definition Classes
    ApplyArityFunctions

  124. def tuple16[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12], f13: F[A13], f14: F[A14], f15: F[A15]): F[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15)]

    Permalink
    Definition Classes
    ApplyArityFunctions

  125. def tuple17[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12], f13: F[A13], f14: F[A14], f15: F[A15], f16: F[A16]): F[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16)]

    Permalink
    Definition Classes
    ApplyArityFunctions

  126. def tuple18[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12], f13: F[A13], f14: F[A14], f15: F[A15], f16: F[A16], f17: F[A17]): F[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17)]

    Permalink
    Definition Classes
    ApplyArityFunctions

  127. def tuple19[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12], f13: F[A13], f14: F[A14], f15: F[A15], f16: F[A16], f17: F[A17], f18: F[A18]): F[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18)]

    Permalink
    Definition Classes
    ApplyArityFunctions

  128. def tuple2[A, B](f1: F[A], f2: F[B]): F[(A, B)]

    Permalink
    Definition Classes
    ApplyArityFunctions

  129. def tuple20[A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, A19, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12], f13: F[A13], f14: F[A14], f15: F[A15], f16: F[A16], f17: F[A17], f18: F[A18], f19: F[A19]): F[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, A19)]

    Permalink
    Definition Classes
    ApplyArityFunctions

  130. 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: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12], f13: F[A13], f14: F[A14], f15: F[A15], f16: F[A16], f17: F[A17], f18: F[A18], f19: F[A19], f20: F[A20]): F[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, A19, A20)]

    Permalink
    Definition Classes
    ApplyArityFunctions

  131. 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: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8], f9: F[A9], f10: F[A10], f11: F[A11], f12: F[A12], f13: F[A13], f14: F[A14], f15: F[A15], f16: F[A16], f17: F[A17], f18: F[A18], f19: F[A19], f20: F[A20], f21: F[A21]): F[(A0, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, A18, A19, A20, A21)]

    Permalink
    Definition Classes
    ApplyArityFunctions

  132. def tuple3[A0, A1, A2, Z](f0: F[A0], f1: F[A1], f2: F[A2]): F[(A0, A1, A2)]

    Permalink
    Definition Classes
    ApplyArityFunctions

  133. def tuple4[A0, A1, A2, A3, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3]): F[(A0, A1, A2, A3)]

    Permalink
    Definition Classes
    ApplyArityFunctions

  134. def tuple5[A0, A1, A2, A3, A4, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4]): F[(A0, A1, A2, A3, A4)]

    Permalink
    Definition Classes
    ApplyArityFunctions

  135. def tuple6[A0, A1, A2, A3, A4, A5, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5]): F[(A0, A1, A2, A3, A4, A5)]

    Permalink
    Definition Classes
    ApplyArityFunctions

  136. def tuple7[A0, A1, A2, A3, A4, A5, A6, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6]): F[(A0, A1, A2, A3, A4, A5, A6)]

    Permalink
    Definition Classes
    ApplyArityFunctions

  137. def tuple8[A0, A1, A2, A3, A4, A5, A6, A7, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7]): F[(A0, A1, A2, A3, A4, A5, A6, A7)]

    Permalink
    Definition Classes
    ApplyArityFunctions

  138. def tuple9[A0, A1, A2, A3, A4, A5, A6, A7, A8, Z](f0: F[A0], f1: F[A1], f2: F[A2], f3: F[A3], f4: F[A4], f5: F[A5], f6: F[A6], f7: F[A7], f8: F[A8]): F[(A0, A1, A2, A3, A4, A5, A6, A7, A8)]

    Permalink
    Definition Classes
    ApplyArityFunctions

  139. def void[A](fa: F[A]): F[Unit]

    Permalink
    Definition Classes
    Functor

  140. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  141. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  142. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  143. def zip2[A1, A2](fa1: F[A1], fa2: F[A2]): F[(A1, A2)]

    Permalink
    Definition Classes
    Zippable

  144. def zip3[A1, A2, A3](fa1: F[A1], fa2: F[A2], fa3: F[A3]): F[(A1, A2, A3)]

    Permalink
    Definition Classes
    Zippable

  145. def zip4[A1, A2, A3, A4](fa1: F[A1], fa2: F[A2], fa3: F[A3], fa4: F[A4]): F[(A1, A2, A3, A4)]

    Permalink
    Definition Classes
    Zippable

  146. def zip5[A1, A2, A3, A4, A5](fa1: F[A1], fa2: F[A2], fa3: F[A3], fa4: F[A4], fa5: F[A5]): F[(A1, A2, A3, A4, A5)]

    Permalink
    Definition Classes
    Zippable

  147. def zip6[A1, A2, A3, A4, A5, A6](fa1: F[A1], fa2: F[A2], fa3: F[A3], fa4: F[A4], fa5: F[A5], fa6: F[A6]): F[(A1, A2, A3, A4, A5, A6)]

    Permalink
    Definition Classes
    Zippable

  148. def zipWith3[A1, A2, A3, R](fa1: F[A1], fa2: F[A2], fa3: F[A3])(f: (A1, A2, A3) ⇒ R): F[R]

    Permalink
    Definition Classes
    Zippable

  149. def zipWith4[A1, A2, A3, A4, R](fa1: F[A1], fa2: F[A2], fa3: F[A3], fa4: F[A4])(f: (A1, A2, A3, A4) ⇒ R): F[R]

    Permalink
    Definition Classes
    Zippable

  150. def zipWith5[A1, A2, A3, A4, A5, R](fa1: F[A1], fa2: F[A2], fa3: F[A3], fa4: F[A4], fa5: F[A5])(f: (A1, A2, A3, A4, A5) ⇒ R): F[R]

    Permalink
    Definition Classes
    Zippable

  151. def zipWith6[A1, A2, A3, A4, A5, A6, R](fa1: F[A1], fa2: F[A2], fa3: F[A3], fa4: F[A4], fa5: F[A5], fa6: F[A6])(f: (A1, A2, A3, A4, A5, A6) ⇒ R): F[R]

    Permalink
    Definition Classes
    Zippable

Inherited from CoflatMap[F]

Inherited from Zippable[F]

Inherited from FFoldable[F]

Inherited from Scannable[F]

Inherited from MonadConsError[F, Throwable]

Inherited from Recoverable[F, Throwable]

Inherited from cats.MonadError[F, Throwable]

Inherited from ApplicativeError[F, Throwable]

Inherited from MonadCons[F]

Inherited from cats.MonadFilter[F]

Inherited from cats.Monad[F]

Inherited from Applicative[F]

Inherited from FlatMap[F]

Inherited from Apply[F]

Inherited from ApplyArityFunctions[F]

Inherited from Cartesian[F]

Inherited from cats.Functor[F]

Inherited from Invariant[F]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped