AppliedPrism

abstract def _prism: Prism[S, T, A, B]

abstract val from: S

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def <-?[C, D](other: Prism[A, B, C, D]): AppliedPrism[S, T, C, D]

Alias to composePrism

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def _fold: Fold[S, A]

def _setter: Setter[S, T, A, B]

def _traversal: Traversal[S, T, A, B]

def all(p: (A) ⇒ Boolean): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def composeFold[B](other: Fold[A, B]): AppliedFold[S, B]

def composePrism[C, D](other: Prism[A, B, C, D]): AppliedPrism[S, T, C, D]

def composeSetter[C, D](other: Setter[A, B, C, D]): AppliedSetter[S, T, C, D]

def composeTraversal[C, D](other: Traversal[A, B, C, D]): AppliedTraversal[S, T, C, D]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def exist(p: (A) ⇒ Boolean): Boolean

def finalize(): Unit

def fold(implicit ev: Monoid[A]): A

def foldMap[B](f: (A) ⇒ B)(implicit arg0: Monoid[B]): B

def getAll: List[A]

final def getClass(): Class[_]

def getOption: Option[A]

def hashCode(): Int

def headOption: Option[A]

final def isInstanceOf[T0]: Boolean

def modify(f: (A) ⇒ B): T

def multiLift[F[_]](f: (A) ⇒ F[B])(implicit arg0: Applicative[F]): F[T]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def set(newValue: B): T

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 |->>[C, D](other: Traversal[A, B, C, D]): AppliedTraversal[S, T, C, D]

Alias to composeTraversal