MonadPlus

abstract def ap[A, B](fa: F[A])(ff: F[(A) ⇒ B]): F[B]

abstract def combineK[A](x: F[A], y: F[A]): F[A]

Combine two F[A] values.

abstract def empty[A]: F[A]

Given a type A, create an "empty" F[A] value.

abstract def filter[A](fa: F[A])(f: (A) ⇒ Boolean): F[A]

abstract def filterM[A](fa: F[A])(f: (A) ⇒ F[Boolean]): F[A]

abstract def flatMap[A, B](fa: F[A])(f: (A) ⇒ F[B]): F[B]

abstract def flatten[A](ffa: F[F[A]]): F[A]

abstract def map[A, B](fa: F[A])(f: (A) ⇒ B): F[B]

abstract def map2[A, B, Z](fa: F[A], fb: F[B])(f: (A, B) ⇒ Z): F[Z]

abstract def pure[A](a: A): F[A]

abstract def pureEval[A](a: ⇒ A): F[A]

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

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

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