CompositeMonoidK

implicit abstract def F: MonoidK[F]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def algebra[A]: Monoid[F[G[A]]]

Given a type A, create a concrete Monoid[F[A]].

final def asInstanceOf[T0]: T0

def clone(): AnyRef

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

Combine two F[A] values.

def composeK[G[_]]: MonoidK[[α]F[G[G[α]]]]

Compose this MonoidK with an arbitrary type constructor

def empty[A]: F[G[A]]

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

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