sealed trait ParSeq[+Z <: Unit, +A] extends AnyRef
ParSeq is a data type that represents some notion of "events" that can
take place in parallel or in sequence. For example, a ParSeq
parameterized on some error type could be used to model the potentially
multiple ways that an application can fail. On the other hand, a ParSeq
parameterized on some request type could be used to model a collection of
requests to external data sources, some of which could be executed in
parallel and some of which must be executed sequentially.
- Self Type
- ParSeq[Z, A]
- Alphabetic
- By Inheritance
- ParSeq
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Value Members
- final def &&[Z1 >: Z <: Unit, A1 >: A](that: ParSeq[Z1, A1]): ParSeq[Z1, A1]
Combines this collection of events with that collection of events to return a new collection of events that represents this collection of events in parallel with that collection of events.
- final def *>[Z1 >: Z <: Unit, B](that: ParSeq[Z1, B]): ParSeq[Z1, B]
A symbolic alias for
zipRight. - final def ++[Z1 >: Z <: Unit, A1 >: A](that: ParSeq[Z1, A1]): ParSeq[Z1, A1]
Combines this collection of events with that collection of events to return a new collection of events that represents this collection of events followed by that collection of events.
- final def <*[Z1 >: Z <: Unit, B](that: ParSeq[Z1, B]): ParSeq[Z1, A]
A symbolic alias for
zipLeft. - final def <*>[Z1 >: Z <: Unit, B](that: ParSeq[Z1, B]): ParSeq[Z1, (A, B)]
A symbolic alias for
zip. - final def as[B](b: B): ParSeq[Z, B]
Maps the events in this collection of events to the specified constant value.
- final def first(implicit ev: <:<[Z, Nothing]): A
Returns the first event in this collection of events.
Returns the first event in this collection of events. If multiple events occur in parallel and before any other events then any of these events may be returned.
- Annotations
- @tailrec()
- final def flatMap[Z1 >: Z <: Unit, B](f: (A) => ParSeq[Z1, B]): ParSeq[Z1, B]
Constructs a new collection of events for each event in this collection of events, collecting them back into a single collection of events.
- final def flatten[Z1 >: Z <: Unit, B](implicit ev: <:<[A, ParSeq[Z1, B]]): ParSeq[Z1, B]
Flattens a collection of collections of events into a single collection of events.
- final def fold[B](emptyCase: B, singleCase: (A) => B)(thenCase: (B, B) => B, bothCase: (B, B) => B): B
Folds over the events in this collection of events using the specified functions.
- final def forEach[F[+_], B](f: (A) => F[B])(implicit arg0: IdentityBoth[F], arg1: Covariant[F]): F[ParSeq[Z, B]]
Performs the specified effectual function for each event in this collection of events, collecting them back into a single collection of events.
- final def map[B](f: (A) => B): ParSeq[Z, B]
Transforms the type of events in this collection of events with the specified function.
- final def toCause: Cause[A]
- final def toNonEmptyMultiSet(implicit ev: <:<[Z, Nothing]): NonEmptyMultiSet[A]
Converts this collection of events to a
NonEmptyMultiSetof events, discarding information about the sequential structure of events. - final def zip[Z1 >: Z <: Unit, B](that: ParSeq[Z1, B]): ParSeq[Z1, (A, B)]
Combines this collection of events with that collection of events to return the Cartesian product of events, combining the elements into a tuple.
- final def zipLeft[Z1 >: Z <: Unit, B](that: ParSeq[Z1, B]): ParSeq[Z1, A]
Combines this collection of events with that collection of events to return the Cartesian product of events, keeping only the events from this collection.
- final def zipRight[Z1 >: Z <: Unit, B](that: ParSeq[Z1, B]): ParSeq[Z1, B]
Combines this collection of events with that collection of events to return the Cartesian product of events, keeping only the events from that collection.
- final def zipWith[Z1 >: Z <: Unit, B, C](that: ParSeq[Z1, B])(f: (A, B) => C): ParSeq[Z1, C]
Combines this collection of events with that collection of events to return the Cartesian product of events using the specified function.