IsEmpty

abstract def empty[A]: F[A]

abstract def isEmpty[A](fa: F[A]): Boolean

abstract def plus[A](a: F[A], b: ⇒ F[A]): F[A]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def compose[G[_]]: PlusEmpty[[α]F[G[α]]]

The composition of PlusEmpty F and G, [x]F[G[x]], is a PlusEmpty

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

def isEmptyLaw: IsEmptyLaw

val isEmptySyntax: IsEmptySyntax[F]

final def isInstanceOf[T0]: Boolean

def monoid[A]: Monoid[F[A]]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def plusEmptyLaw: EmptyLaw

val plusEmptySyntax: PlusEmptySyntax[F]

def plusLaw: PlusLaw

val plusSyntax: PlusSyntax[F]

def product[G[_]](implicit G0: PlusEmpty[G]): PlusEmpty[[α](F[α], G[α])]

The product of PlusEmpty F and G, [x](F[x], G[x]]), is a PlusEmpty

def product[G[_]](implicit G0: Plus[G]): Plus[[α](F[α], G[α])]

The product of Plus F and G, [x](F[x], G[x]]), is a Plus

def semigroup[A]: Semigroup[F[A]]

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