AssociativeFlattenCovariantDeriveEqual

abstract def derive[A](implicit arg0: Equal[A]): Equal[F[A]]

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

Flattens a value of type F[F[A]] to produce an F[A].

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

Lift a function from A to B to a function from F[A] to F[B].

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def compose[G[-_]](implicit g: Contravariant[G]): Contravariant[[-A]F[G[A]]]

Compose covariant and contravariant functors.

final def compose[G[+_]](implicit g: Covariant[G]): Covariant[[+A]F[G[A]]]

Compose two covariant functors.

final def compose[G[_]](implicit g: Invariant[G]): Invariant[[A]F[G[A]]]

Compose two invariant functors.

def compositionLaw[A, B, C](fa: F[A], f: <=>[A, B], g: <=>[B, C])(implicit equal: Equal[F[C]]): Boolean

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def fproduct[A, B](f: (A) ⇒ B): (F[A]) ⇒ F[(A, B)]

def fproductLeft[A, B](f: (A) ⇒ B): (F[A]) ⇒ F[(B, A)]

final def getClass(): Class[_]

def hashCode(): Int

def identityLaw1[A](fa: F[A])(implicit equal: Equal[F[A]]): Boolean

final def invmap[A, B](f: <=>[A, B]): <=>[F[A], F[B]]

final def isInstanceOf[T0]: Boolean

final def mapSubset[A, B](f: (A) ⇒ B)(implicit arg0: AnyType[B]): (F[A]) ⇒ F[B]

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