ApplyFold

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def ^<->[B, C, D](other: PIso[A, B, C, D]): ApplyFold[S, C]

alias to composeIso

def ^<-?[B, C, D](other: PPrism[A, B, C, D]): ApplyFold[S, C]

alias to composePrism

def ^|->[B, C, D](other: PLens[A, B, C, D]): ApplyFold[S, C]

alias to composeLens

def ^|->>[B, C, D](other: PTraversal[A, B, C, D]): ApplyFold[S, C]

alias to composeTraversal

def ^|-?[B, C, D](other: POptional[A, B, C, D]): ApplyFold[S, C]

alias to composeOptional

val _fold: Fold[S, A]

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

final def asInstanceOf[T0]: T0

def clone(): AnyRef

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

def composeGetter[B](other: Getter[A, B]): ApplyFold[S, B]

def composeIso[B, C, D](other: PIso[A, B, C, D]): ApplyFold[S, C]

def composeLens[B, C, D](other: PLens[A, B, C, D]): ApplyFold[S, C]

def composeOptional[B, C, D](other: POptional[A, B, C, D]): ApplyFold[S, C]

def composePrism[B, C, D](other: PPrism[A, B, C, D]): ApplyFold[S, C]

def composeTraversal[B, C, D](other: PTraversal[A, B, C, D]): ApplyFold[S, C]

final def eq(arg0: AnyRef): Boolean

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

def finalize(): Unit

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

def getAll: List[A]

final def getClass(): Class[_]

def headOption: Option[A]

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val s: S

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

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def headMaybe: Maybe[A]