dotty-cps-async/cps.runtime/IterableOpsAsyncShift

IterableOpsAsyncShift

class IterableOpsAsyncShift[A, C <: ([X] =>> Iterable[X] & IterableOps[X, C, C[X]]), CA <: C[A]]() extends IterableAsyncShift[A, CA]
class IterableAsyncShift[A, CA]
trait AsyncShift[CA]
class Object
trait Matchable
class Any
class MapOpsAsyncShift[K, V, CC, CI, CKV]
class SeqAsyncShift[A, C, CA]
class IndexedSeqAsyncShift[A, C, CA]

Value members

Concrete methods

def collect[F[_], B](c: CA, monad: CpsMonad[F])(pf: PartialFunction[A, F[B]]): F[C[B]]
def dropWhile[F[_]](c: CA, monad: CpsMonad[F])(p: A => F[Boolean]): F[C[A]]
def filter[F[_]](c: CA, monad: CpsMonad[F])(p: A => F[Boolean]): F[C[A]]
def filterNot[F[_]](c: CA, monad: CpsMonad[F])(p: A => F[Boolean]): F[C[A]]
def flatMap[F[_], B](c: CA, monad: CpsMonad[F])(f: A => F[IterableOnce[B]]): F[C[B]]
def flatten[F[_], B](c: CA, monad: CpsMonad[F])(asIterable: A => F[IterableOnce[B]]): F[C[B]]
def groupBy[F[_], K](c: CA, monad: CpsMonad[F])(f: A => F[K]): F[Map[K, C[A]]]
def groupMap[F[_], K, B](c: CA, monad: CpsMonad[F])(key: A => F[K])(f: A => F[B]): F[Map[K, C[B]]]
def map[F[_], B](c: CA, monad: CpsMonad[F])(f: A => F[B]): F[C[B]]
def partition[F[_]](c: CA, monad: CpsMonad[F])(p: A => F[Boolean]): F[(C[A], C[A])]
def partitionMap[F[_], A1, A2](c: CA, monad: CpsMonad[F])(f: A => F[Either[A1, A2]]): F[(C[A1], C[A2])]
def scanLeft[F[_], B](c: CA, monad: CpsMonad[F])(z: B)(op: (B, A) => F[B]): F[C[B]]
def scanRight[F[_], B](c: CA, monad: CpsMonad[F])(z: B)(op: (A, B) => F[B]): F[C[B]]
def span[F[_]](c: CA, monad: CpsMonad[F])(p: A => F[Boolean]): F[(C[A], C[A])]
def takeWhile[F[_]](c: CA, monad: CpsMonad[F])(p: A => F[Boolean]): F[C[A]]
def tapEach[F[_], U](c: CA, monad: CpsMonad[F])(f: A => F[U]): F[C[A]]
def withFilter[F[_]](c: CA, m: CpsMonad[F])(p: A => F[Boolean]): DelayedWithFilter[F, A, C, CA]

Inherited methods

def collectFirst[F[_], B](c: CA, monad: CpsMonad[F])(pf: PartialFunction[A, F[B]]): F[Option[B]]
Inherited from
IterableAsyncShift
def corresponds[F[_], B](c: CA, monad: CpsMonad[F])(that: IterableOnce[B])(p: (A, B) => F[Boolean]): F[Boolean]
Inherited from
IterableAsyncShift
def count[F[_]](c: CA, monad: CpsMonad[F])(p: A => F[Boolean]): F[Int]
Inherited from
IterableAsyncShift
def exists[F[_]](c: CA, monad: CpsMonad[F])(p: A => F[Boolean]): F[Boolean]
Inherited from
IterableAsyncShift
def find[F[_]](c: CA, monad: CpsMonad[F])(p: A => F[Boolean]): F[Option[A]]
Inherited from
IterableAsyncShift
def fold[F[_], A1 >: A](c: CA, monad: CpsMonad[F])(z: A1)(op: (A1, A1) => F[A1]): F[A1]
Inherited from
IterableAsyncShift
def foldLeft[F[_], B](c: CA, monad: CpsMonad[F])(z: B)(op: (B, A) => F[B]): F[B]
Inherited from
IterableAsyncShift
def foldRight[F[_], B](c: CA, monad: CpsMonad[F])(z: B)(op: (A, B) => F[B]): F[B]
Inherited from
IterableAsyncShift
def forall[F[_]](c: CA, monad: CpsMonad[F])(p: A => F[Boolean]): F[Boolean]
Inherited from
IterableAsyncShift
def foreach[F[_], U](c: CA, monad: CpsMonad[F])(f: A => F[U]): F[Unit]
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 maxBy[F[_], B](c: CA, monad: CpsTryMonad[F])(f: A => F[B])(cmp: Ordering[B]): F[A]
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 maxByOption[F[_], B](c: CA, monad: CpsMonad[F])(f: A => F[B])(cmp: Ordering[B]): F[Option[A]]
Inherited from
IterableAsyncShift
def minBy[F[_], B](c: CA, monad: CpsTryMonad[F])(f: A => F[B])(cmp: Ordering[B]): F[A]
Inherited from
IterableAsyncShift
def minByOption[F[_], B](c: CA, monad: CpsMonad[F])(f: A => F[B])(cmp: Ordering[B]): F[Option[A]]
Inherited from
IterableAsyncShift
def reduce[F[_], B >: A](c: CA, monad: CpsTryMonad[F])(op: (B, B) => F[B]): F[B]
Inherited from
IterableAsyncShift
def reduceLeft[F[_], B >: A](c: CA, monad: CpsTryMonad[F])(op: (B, A) => F[B]): F[B]
Inherited from
IterableAsyncShift
def reduceLeftOption[F[_], B >: A](c: CA, monad: CpsTryMonad[F])(op: (B, A) => F[B]): F[Option[B]]
Inherited from
IterableAsyncShift
def reduceOption[F[_], B >: A](c: CA, monad: CpsTryMonad[F])(op: (B, B) => F[B]): F[Option[B]]
Inherited from
IterableAsyncShift
def reduceRight[F[_], B >: A](c: CA, monad: CpsTryMonad[F])(op: (A, B) => F[B]): F[B]
Inherited from
IterableAsyncShift
def reduceRightOption[F[_], B >: A](c: CA, monad: CpsTryMonad[F])(op: (A, B) => F[B]): F[Option[B]]
Inherited from
IterableAsyncShift
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