Cons

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def _cons[S, A](head: A, tail: S)(implicit ev: Cons[S, A]): S

append an element to the head

final def _uncons[S, A](s: S)(implicit ev: Cons[S, A]): Option[(A, S)]

deconstruct an S between its head and tail

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def cons[S, A](implicit ev: Cons[S, A]): Prism[S, (A, S)]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def fromIso[S, A, B](iso: Iso[S, A])(implicit ev: Cons[A, B]): Cons[S, B]

lift an instance of Cons using an Iso

final def getClass(): Class[_]

def hashCode(): Int

final def headOption[S, A](implicit ev: Cons[S, A]): Optional[S, A]

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

final def tailOption[S, A](implicit ev: Cons[S, A]): Optional[S, S]

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

final def headMaybe[S, A](implicit ev: Cons[S, A]): Optional[S, A]

final def tailMaybe[S, A](implicit ev: Cons[S, A]): Optional[S, S]