Both

Instance Constructors

new Both(left: ParSeq[Z, A], right: ParSeq[Z, A])

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
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.
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.

Definition Classes
ParSeq
final def *>[Z1 >: Z <: Unit, B](that: ParSeq[Z1, B]): ParSeq[Z1, B]

A symbolic alias for zipRight.
A symbolic alias for zipRight.

Definition Classes
ParSeq
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.
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.

Definition Classes
ParSeq
final def <*[Z1 >: Z <: Unit, B](that: ParSeq[Z1, B]): ParSeq[Z1, A]

A symbolic alias for zipLeft.
A symbolic alias for zipLeft.

Definition Classes
ParSeq
final def <*>[Z1 >: Z <: Unit, B](that: ParSeq[Z1, B]): ParSeq[Z1, (A, B)]

A symbolic alias for zip.
A symbolic alias for zip.

Definition Classes
ParSeq
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def as[B](b: B): ParSeq[Z, B]

Maps the events in this collection of events to the specified constant value.
Maps the events in this collection of events to the specified constant value.

Definition Classes
ParSeq
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(that: Any): Boolean

Definition Classes
Both → Equals → AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
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.

Definition Classes
ParSeq
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.
Constructs a new collection of events for each event in this collection of events, collecting them back into a single collection of events.

Definition Classes
ParSeq
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.
Flattens a collection of collections of events into a single collection of events.

Definition Classes
ParSeq
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.
Folds over the events in this collection of events using the specified functions.

Definition Classes
ParSeq
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.
Performs the specified effectual function for each event in this collection of events, collecting them back into a single collection of events.

Definition Classes
ParSeq
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
Both → AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
val left: ParSeq[Z, A]
final def map[B](f: (A) ⇒ B): ParSeq[Z, B]

Transforms the type of events in this collection of events with the specified function.
Transforms the type of events in this collection of events with the specified function.

Definition Classes
ParSeq
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
val right: ParSeq[Z, A]
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
final def toCause: Cause[A]

Definition Classes
ParSeq
final def toNonEmptyMultiSet(implicit ev: <:<[Z, Nothing]): NonEmptyMultiSet[A]

Converts this collection of events to a NonEmptyMultiSet of events, discarding information about the sequential structure of events.
Converts this collection of events to a NonEmptyMultiSet of events, discarding information about the sequential structure of events.

Definition Classes
ParSeq
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
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.
Combines this collection of events with that collection of events to return the Cartesian product of events, combining the elements into a tuple.

Definition Classes
ParSeq
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.
Combines this collection of events with that collection of events to return the Cartesian product of events, keeping only the events from this collection.

Definition Classes
ParSeq
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.
Combines this collection of events with that collection of events to return the Cartesian product of events, keeping only the events from that collection.

Definition Classes
ParSeq
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.
Combines this collection of events with that collection of events to return the Cartesian product of events using the specified function.

Definition Classes
ParSeq

Related Doc: package ParSeq

final case class Both[+Z <: Unit, +A](left: ParSeq[Z, A], right: ParSeq[Z, A]) extends ParSeq[Z, A] with Product with Serializable

Instance Constructors

new Both(left: ParSeq[Z, A], right: ParSeq[Z, A])

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def &&[Z1 >: Z <: Unit, A1 >: A](that: ParSeq[Z1, A1]): ParSeq[Z1, A1]

final def *>[Z1 >: Z <: Unit, B](that: ParSeq[Z1, B]): ParSeq[Z1, B]

final def ++[Z1 >: Z <: Unit, A1 >: A](that: ParSeq[Z1, A1]): ParSeq[Z1, A1]

final def <*[Z1 >: Z <: Unit, B](that: ParSeq[Z1, B]): ParSeq[Z1, A]

final def <*>[Z1 >: Z <: Unit, B](that: ParSeq[Z1, B]): ParSeq[Z1, (A, B)]

final def ==(arg0: Any): Boolean

final def as[B](b: B): ParSeq[Z, B]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def finalize(): Unit

final def first(implicit ev: <:<[Z, Nothing]): A

final def flatMap[Z1 >: Z <: Unit, B](f: (A) ⇒ ParSeq[Z1, B]): ParSeq[Z1, B]

final def flatten[Z1 >: Z <: Unit, B](implicit ev: <:<[A, ParSeq[Z1, B]]): ParSeq[Z1, B]

final def fold[B](emptyCase: B, singleCase: (A) ⇒ B)(thenCase: (B, B) ⇒ B, bothCase: (B, B) ⇒ B): B

final def forEach[F[+_], B](f: (A) ⇒ F[B])(implicit arg0: IdentityBoth[F], arg1: Covariant[F]): F[ParSeq[Z, B]]

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

val left: ParSeq[Z, A]

final def map[B](f: (A) ⇒ B): ParSeq[Z, B]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val right: ParSeq[Z, A]

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

final def toCause: Cause[A]

final def toNonEmptyMultiSet(implicit ev: <:<[Z, Nothing]): NonEmptyMultiSet[A]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

final def zip[Z1 >: Z <: Unit, B](that: ParSeq[Z1, B]): ParSeq[Z1, (A, B)]

final def zipLeft[Z1 >: Z <: Unit, B](that: ParSeq[Z1, B]): ParSeq[Z1, A]

final def zipRight[Z1 >: Z <: Unit, B](that: ParSeq[Z1, B]): ParSeq[Z1, B]

final def zipWith[Z1 >: Z <: Unit, B, C](that: ParSeq[Z1, B])(f: (A, B) ⇒ C): ParSeq[Z1, C]

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from ParSeq[Z, A]

Inherited from AnyRef

Inherited from Any

Ungrouped