SeqAsyncShift
class SeqAsyncShift[A, C <: ([X] =>> Seq[X] & SeqOps[X, C, C[X]]), CA <: C[A]] extends IterableOpsAsyncShift[A, C, CA] with PartialFunctionAsyncShiftBase[Int, A, CA]
Value members
Concrete methods
Inherited methods
def andThen[F[_], A](f: PartialFunction[Int, A], m: CpsMonad[F])(g: A => F[A]): PartialFunctionCallChainSubst[F, Int, A]
- Inherited from
- PartialFunctionAsyncShiftBase
def applyOrElse[F[_], A1 <: Int, B1 >: A](f: PartialFunction[Int, A], m: CpsMonad[F])(x1: A1, default: A1 => F[B1]): F[B1]
- Inherited from
- PartialFunctionAsyncShiftBase
def compose[F[_], A](f: PartialFunction[Int, A], m: CpsMonad[F])(g: A => F[Int]): PartialFunctionCallChainSubst[F, A, A]
- Inherited from
- PartialFunctionAsyncShiftBase
def corresponds[F[_], B](c: CA, monad: CpsMonad[F])(that: IterableOnce[B])(p: (A, B) => F[Boolean]): F[Boolean]
- Inherited from
- IterableAsyncShift
def groupMapReduce[F[_], K, B](c: CA, monad: CpsMonad[F])(key: A => F[K])(f: A => F[B])(reduce: (B, B) => F[B]): F[Map[K, B]]
- Inherited from
- IterableAsyncShift
def maxByOpOption[F[_], B](c: CA, monad: CpsMonad[F])(f: A => F[B])(cmp: (B, B) => Int): F[Option[A]]
- Inherited from
- IterableAsyncShift
def partitionMap[F[_], A1, A2](c: CA, monad: CpsMonad[F])(f: A => F[Either[A1, A2]]): F[(C[A1], C[A2])]
- Inherited from
- IterableOpsAsyncShift
def shiftedFold[F[_], S, B, R](c: CA, monad: CpsMonad[F])(prolog: S, action: A => F[B], acc: (S, A, B) => S, epilog: S => R): F[R]
sequentially do action. each action is started after prev. is finished
sequentially do action. each action is started after prev. is finished
- Inherited from
- IterableAsyncShift
def shiftedStateFold[F[_], S, R](c: CA, monad: CpsMonad[F])(prolog: S, acc: (S, A) => F[S], epilog: S => R): F[R]
- Inherited from
- IterableAsyncShift
def shiftedWhile[F[_], S, R](c: CA, monad: CpsMonad[F])(prolog: S, condition: A => F[Boolean], acc: (S, Boolean, A) => S, epilog: S => R): F[R]
- Inherited from
- IterableAsyncShift