IsomorphismMonoid

implicit abstract def G: Monoid[G]

abstract def iso: Isomorphism.<=>[F, G]

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def append(f1: F, f2: ⇒ F): F

The binary operation to combine f1 and f2.

final def applicative: Applicative[[α]F]

A monoidal applicative functor, that implements point and ap with the operations zero and append respectively.

final def apply: Apply[[α]F]

final def asInstanceOf[T0]: T0

final def category: Category[[α, β]F]

Every Monoid gives rise to a scalaz.Category

def clone(): AnyRef

final def compose: Compose[[α, β]F]

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

def monoidLaw: MonoidLaw

val monoidSyntax: MonoidSyntax[F]

def multiply(value: F, n: Int): F

For n = 0, zero For n = 1, append(zero, value) For n = 2, append(append(zero, value), value)

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def semigroupLaw: SemigroupLaw

val semigroupSyntax: SemigroupSyntax[F]

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 zero: F

The identity element for append.