Representable

abstract def F: Functor[F]

abstract def index[A](f: F[A]): (Representation) ⇒ A

Create a function that "indexes" into the F structure using Representation

scala> import cats.implicits._

scala> type Pair[A] = (A, A)

scala> val indexed: Boolean => String = Representable[Pair].index(("foo", "bar"))

scala> indexed(true)
res0: String = foo

scala> indexed(false)
res1: String = bar

abstract def tabulate[A](f: (Representation) ⇒ A): F[A]

Reconstructs the F structure using the index function

scala> import cats.implicits._

scala> type Pair[A] = (A, A)

scala> val f: Boolean => String = {
     | case true => "foo"
     | case false => "bar"
     | }

scala> f.tabulate[Pair]
res0: Pair[String] = (foo,bar)

final def !=(arg0: Any): Boolean

final def ##(): Int

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