IsomorphismEnum

implicit abstract def G: Enum[G]

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

abstract def order(x: F, y: F): Ordering

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def apply(x: F, y: F): Ordering

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def contramap[B](f: (B) ⇒ F): Order[B]

def enumLaw: EnumLaw

val enumSyntax: EnumSyntax[F]

final def eq(arg0: AnyRef): Boolean

def equal(x: F, y: F): Boolean

def equalIsNatural: Boolean

def equalLaw: EqualLaw

val equalSyntax: EqualSyntax[F]

def equals(arg0: Any): Boolean

def finalize(): Unit

def from(a: F): EphemeralStream[F]

def fromStep(n: Int, a: F): EphemeralStream[F]

def fromStepTo(n: Int, a: F, z: F): EphemeralStream[F]

def fromStepToL(n: Int, a: F, z: F): List[F]

def fromTo(a: F, z: F): EphemeralStream[F]

def fromToL(a: F, z: F): List[F]

final def getClass(): Class[_]

def greaterThan(x: F, y: F): Boolean

def greaterThanOrEqual(x: F, y: F): Boolean

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def lessThan(x: F, y: F): Boolean

def lessThanOrEqual(x: F, y: F): Boolean

def max: Option[F]

def max(x: F, y: F): F

def min: Option[F]

def min(x: F, y: F): F

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def orderLaw: OrderLaw

val orderSyntax: OrderSyntax[F]

def pred(a: F): F

def predState[X](f: (F) ⇒ X): State[F, X]

Produce a state value that executes the predecessor (pred) on each spin and executing the given function on the current value.

def predStateMax[X, Y](f: (F) ⇒ X, k: (X) ⇒ Y): Option[Y]

Produce a value that starts at the maximum (if it exists) and decrements through a state value with the given mapping function.

def predStateMaxM[X, Y](f: (F) ⇒ X, k: (X) ⇒ State[F, Y]): Option[Y]

Produce a value that starts at the maximum (if it exists) and decrements through a state value with the given binding function.

def predStateZero[X, Y](f: (F) ⇒ X, k: (X) ⇒ Y)(implicit m: Monoid[F]): Y

Produce a value that starts at zero (Monoid.zero) and decrements through a state value with the given mapping function.

def predStateZeroM[X, Y](f: (F) ⇒ X, k: (X) ⇒ State[F, Y])(implicit m: Monoid[F]): Y

Produce a value that starts at zero (Monoid.zero) and decrements through a state value with the given binding function.

def predn(n: Int, a: F): F

def predx: Kleisli[Option, F, F]

Moves to the predecessor, unless at the minimum.

def reverseOrder: Order[F]

def sort(x: F, y: F): (F, F)

def succ(a: F): F

def succState[X](f: (F) ⇒ X): State[F, X]

Produce a state value that executes the successor (succ) on each spin and executing the given function on the current value.

def succStateMin[X, Y](f: (F) ⇒ X, k: (X) ⇒ Y): Option[Y]

Produce a value that starts at the minimum (if it exists) and increments through a state value with the given mapping function.

def succStateMinM[X, Y](f: (F) ⇒ X, k: (X) ⇒ State[F, Y]): Option[Y]

Produce a value that starts at the minimum (if it exists) and increments through a state value with the given binding function.

def succStateZero[X, Y](f: (F) ⇒ X, k: (X) ⇒ Y)(implicit m: Monoid[F]): Y

Produce a value that starts at zero (Monoid.zero) and increments through a state value with the given mapping function.

def succStateZeroM[X, Y](f: (F) ⇒ X, k: (X) ⇒ State[F, Y])(implicit m: Monoid[F]): Y

Produce a value that starts at zero (Monoid.zero) and increments through a state value with the given binding function.

def succn(n: Int, a: F): F

def succx: Kleisli[Option, F, F]

Moves to the successor, unless at the maximum.

final def synchronized[T0](arg0: ⇒ T0): T0

def toScalaOrdering: scala.math.Ordering[F]

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit