NonEmptyParallel

abstract def apply: Apply[F]

The Apply instance for F[_]

abstract def flatMap: FlatMap[M]

The FlatMap instance for M[_]

abstract def parallel: ~>[M, F]

Natural Transformation from the sequential FlatMap M[_] to the parallel Apply F[_].

abstract def sequential: ~>[F, M]

Natural Transformation from the parallel Apply F[_] to the sequential FlatMap M[_].

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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.

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.

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def parFollowedBy[A, B](ma: M[A])(mb: M[B]): M[B]

def parForEffect[A, B](ma: M[A])(mb: M[B]): M[A]