trait Parallel[M[_]] extends NonEmptyParallel[M]
Some types that form a Monad, are also capable of forming an Applicative that supports parallel composition. The Parallel type class allows us to represent this relationship.
- Source
- Parallel.scala
- Alphabetic
- By Inheritance
- Parallel
- NonEmptyParallel
- Serializable
- Serializable
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Type Members
-
abstract
type
F[_]
- Definition Classes
- NonEmptyParallel
Abstract Value Members
-
abstract
def
applicative: Applicative[F]
The applicative instance for F[_]
-
abstract
def
monad: Monad[M]
The monad instance for M[_]
-
abstract
def
parallel: ~>[M, F]
Natural Transformation from the sequential FlatMap M[_] to the parallel Apply F[_].
Natural Transformation from the sequential FlatMap M[_] to the parallel Apply F[_].
- Definition Classes
- NonEmptyParallel
-
abstract
def
sequential: ~>[F, M]
Natural Transformation from the parallel Apply F[_] to the sequential FlatMap M[_].
Natural Transformation from the parallel Apply F[_] to the sequential FlatMap M[_].
- Definition Classes
- NonEmptyParallel
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
applicativeError[E](implicit E: MonadError[M, E]): ApplicativeError[F, E]
Provides an
ApplicativeError[F, E]instance for any F, that has aParallel.Aux[M, F]and aMonadError[M, E]instance.Provides an
ApplicativeError[F, E]instance for any F, that has aParallel.Aux[M, F]and aMonadError[M, E]instance. I.e. if you have a type M[_], that supports parallel composition through type F[_], then you can getApplicativeError[F, E]fromMonadError[M, E]. -
def
apply: Apply[F]
The Apply instance for F[_]
The Apply instance for F[_]
- Definition Classes
- Parallel → NonEmptyParallel
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native() @IntrinsicCandidate()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
flatMap: FlatMap[M]
The FlatMap instance for M[_]
The FlatMap instance for M[_]
- Definition Classes
- Parallel → NonEmptyParallel
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
-
def
parProductL[A, B](ma: M[A])(mb: M[B]): M[A]
Like Apply.productL, but uses the apply instance corresponding to the Parallel instance instead.
Like Apply.productL, but uses the apply instance corresponding to the Parallel instance instead.
- Definition Classes
- NonEmptyParallel
-
def
parProductR[A, B](ma: M[A])(mb: M[B]): M[B]
Like Apply.productR, but uses the apply instance corresponding to the Parallel instance instead.
Like Apply.productR, but uses the apply instance corresponding to the Parallel instance instead.
- Definition Classes
- NonEmptyParallel
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )