Monocle

final def !=(arg0: Any): Boolean

final def ##(): Int

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 _cons1[S, H, T](head: H, tail: T)(implicit ev: Cons1[S, H, T]): S

append an element to the head

def _empty[S](implicit ev: Empty[S]): S

def _isEmpty[S](s: S)(implicit ev: Empty[S]): Boolean

def _reverse[S](s: S)(implicit ev: Reverse[S, S]): S

final def _snoc[S, A](init: S, last: A)(implicit ev: Snoc[S, A]): S

append an element to the end

final def _snoc1[S, I, L](init: I, last: L)(implicit ev: Snoc1[S, I, L]): S

append an element to the end

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 _uncons1[S, H, T](s: S)(implicit ev: Cons1[S, H, T]): (H, T)

deconstruct an S between its head and tail

final def _unsnoc[S, A](s: S)(implicit ev: Snoc[S, A]): Option[(S, A)]

deconstruct an S between its init and last

final def _unsnoc1[S, I, L](s: S)(implicit ev: Snoc1[S, I, L]): (I, L)

deconstruct an S between its init and last

final def asInstanceOf[T0]: T0

def at[S, I, A](i: I)(implicit ev: At[S, I, A]): Lens[S, A]

def atIndex[S, I, A](implicit ev: At[S, I, Option[A]]): Index[S, I, A]

val bigDecimalToInt: Prism[BigDecimal, Int]

val bigDecimalToLong: Prism[BigDecimal, Long]

val bigIntToBoolean: Prism[BigInt, Boolean]

val bigIntToByte: Prism[BigInt, Byte]

val bigIntToChar: Prism[BigInt, Char]

val bigIntToInt: Prism[BigInt, Int]

val bigIntToLong: Prism[BigInt, Long]

val byteToBoolean: Prism[Byte, Boolean]

val charToBoolean: Prism[Char, Boolean]

def children[A](a: A)(implicit arg0: Plated[A]): List[A]

get the immediate self-similar children of a target

def clone(): AnyRef

def cofreeToStream[A]: Iso[Cofree[Option, A], OneAnd[Stream, A]]

Iso variant of pCofreeToStream

def cofreeToTree[A]: Iso[Cofree[Stream, A], Tree[A]]

Iso variant of pCofreeToTree

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

final def cons1[S, H, T](implicit ev: Cons1[S, H, T]): Iso[S, (H, T)]

def curry[F, G](implicit ev: Curry[F, G]): Iso[F, G]

final def disjunctionToEither[E, A]: Iso[\/[E, A], Either[E, A]]

final def disjunctionToValidation[E, A]: Iso[\/[E, A], Validation[E, A]]

val doubleToFloat: Prism[Double, Float]

val doubleToInt: Prism[Double, Int]

def each[S, A](implicit ev: Each[S, A]): Traversal[S, A]

final def eitherToDisjunction[E, A]: Iso[Either[E, A], \/[E, A]]

def empty[S](implicit ev: Empty[S]): Prism[S, Unit]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def failure[E, A]: Prism[Validation[E, A], E]

def fifth[S, A](implicit ev: Field5[S, A]): Lens[S, A]

def filterIndex[S, I, A](predicate: (I) ⇒ Boolean)(implicit ev: FilterIndex[S, I, A]): Traversal[S, A]

def finalize(): Unit

def first[S, A](implicit ev: Field1[S, A]): Lens[S, A]

final def flip[A, B, C]: Iso[(A) ⇒ (B) ⇒ C, (B) ⇒ (A) ⇒ C]

final def flipped[A, B, C]: ((A) ⇒ (B) ⇒ C) ⇒ (B) ⇒ (A) ⇒ C

def fourth[S, A](implicit ev: Field4[S, A]): Lens[S, A]

final def getClass(): Class[_]

def hashCode(): Int

final def head[S, H, T](implicit ev: Cons1[S, H, T]): Lens[S, H]

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

final def iListToList[A]: Iso[IList[A], List[A]]

def index[S, I, A](i: I)(implicit ev: Index[S, I, A]): Optional[S, A]

final def init[S, I, L](implicit ev: Snoc1[S, I, L]): Lens[S, I]

final def initOption[S, A](implicit ev: Snoc[S, A]): Optional[S, S]

val intToBoolean: Prism[Int, Boolean]

val intToByte: Prism[Int, Byte]

val intToChar: Prism[Int, Char]

final def isInstanceOf[T0]: Boolean

final def just[A]: Prism[Maybe[A], A]

final def last[S, I, L](implicit ev: Snoc1[S, I, L]): Lens[S, L]

final def lastOption[S, A](implicit ev: Snoc[S, A]): Optional[S, A]

final def left[A, B]: Prism[\/[A, B], A]

final def left3[A, B, C]: Prism[Either3[A, B, C], A]

final def leftMostLabel[A]: Lens[Tree[A], A]

def listToVector[A]: Iso[List[A], Vector[A]]

val longToBoolean: Prism[Long, Boolean]

val longToByte: Prism[Long, Byte]

val longToChar: Prism[Long, Char]

val longToInt: Prism[Long, Int]

def mapToSet[K]: Iso[Map[K, Unit], Set[K]]

final def maybeToOption[A]: Iso[Maybe[A], Option[A]]

final def middle3[A, B, C]: Prism[Either3[A, B, C], B]

final def ne(arg0: AnyRef): Boolean

final def nelToOneAnd[A]: Iso[NonEmptyList[A], OneAnd[List, A]]

final def none[A]: Prism[Option[A], Unit]

final def nothing[A]: Prism[Maybe[A], Unit]

final def notify(): Unit

final def notifyAll(): Unit

final def optNelToList[A]: Iso[Option[NonEmptyList[A]], List[A]]

final def optionToDisjunction[A]: Iso[Option[A], \/[Unit, A]]

def pCofreeToStream[A, B]: PIso[Cofree[Option, A], Cofree[Option, B], OneAnd[Stream, A], OneAnd[Stream, B]]

Polymorphic isomorphism between Cofree[Option, _] and OneAnd[Stream, _]

def pCofreeToTree[A, B]: PIso[Cofree[Stream, A], Cofree[Stream, B], Tree[A], Tree[B]]

Polymorphic isomorphism between Cofree[Stream, _] and Tree

final def pDisjunctionToEither[E1, E2, A1, A2]: PIso[\/[E1, A1], \/[E2, A2], Either[E1, A1], Either[E2, A2]]

final def pDisjunctionToValidation[E1, E2, A1, A2]: PIso[\/[E1, A1], \/[E2, A2], Validation[E1, A1], Validation[E2, A2]]

final def pEitherToDisjunction[E1, E2, A1, A2]: PIso[Either[E1, A1], Either[E2, A2], \/[E1, A1], \/[E2, A2]]

final def pFailure[E, A, F]: PPrism[Validation[E, A], Validation[F, A], E, F]

final def pIListToList[A, B]: PIso[IList[A], IList[B], List[A], List[B]]

final def pJust[A, B]: PPrism[Maybe[A], Maybe[B], A, B]

final def pLeft[A, B, C]: PPrism[\/[A, B], \/[C, B], A, C]

final def pLeft3[A, B, C, D]: PPrism[Either3[A, B, C], Either3[D, B, C], A, D]

def pListToVector[A, B]: PIso[List[A], List[B], Vector[A], Vector[B]]

final def pMaybeToOption[A, B]: PIso[Maybe[A], Maybe[B], Option[A], Option[B]]

final def pMiddle3[A, B, C, D]: PPrism[Either3[A, B, C], Either3[A, D, C], B, D]

final def pNelToOneAnd[A, B]: PIso[NonEmptyList[A], NonEmptyList[B], OneAnd[List, A], OneAnd[List, B]]

final def pOptNelToList[A, B]: PIso[Option[NonEmptyList[A]], Option[NonEmptyList[B]], List[A], List[B]]

final def pOptionToDisjunction[A, B]: PIso[Option[A], Option[B], \/[Unit, A], \/[Unit, B]]

final def pRight[A, B, C]: PPrism[\/[A, B], \/[A, C], B, C]

final def pRight3[A, B, C, D]: PPrism[Either3[A, B, C], Either3[A, B, D], C, D]

final def pSome[A, B]: PPrism[Option[A], Option[B], A, B]

final def pStdLeft[A, B, C]: PPrism[Either[A, B], Either[C, B], A, C]

final def pStdRight[A, B, C]: PPrism[Either[A, B], Either[A, C], B, C]

final def pSuccess[E, A, B]: PPrism[Validation[E, A], Validation[E, B], A, B]

final def pTrySuccess[A, B]: PPrism[Try[A], Try[B], A, B]

final def pValidationToDisjunction[E1, E2, A1, A2]: PIso[Validation[E1, A1], Validation[E2, A2], \/[E1, A1], \/[E2, A2]]

def plate[A](implicit P: Plated[A]): Traversal[A, A]

Traversal of immediate self-similar children

def possible[S, A](implicit ev: Possible[S, A]): Optional[S, A]

def remove[S, I, A](i: I)(s: S)(implicit ev: At[S, I, Option[A]]): S

delete a value associated with a key in a Map-like container

def reverse[S, A](implicit ev: Reverse[S, A]): Iso[S, A]

def reverseFromReverseFunction[S](_reverse: (S) ⇒ S): Reverse[S, S]

def rewrite[A](f: (A) ⇒ Option[A])(a: A)(implicit arg0: Plated[A]): A

rewrite a target by applying a rule as often as possible until it reaches a fixpoint (this is an infinite loop if there is no fixpoint)

def rewriteOf[A](l: Setter[A, A])(f: (A) ⇒ Option[A])(a: A): A

rewrite a target by applying a rule within a Setter, as often as possible until it reaches a fixpoint (this is an infinite loop if there is no fixpoint)

final def right[A, B]: Prism[\/[A, B], B]

final def right3[A, B, C]: Prism[Either3[A, B, C], C]

final def rightMostLabel[A]: Lens[Tree[A], A]

final def rootLabel[A]: Lens[Tree[A], A]

def second[S, A](implicit ev: Field2[S, A]): Lens[S, A]

def sixth[S, A](implicit ev: Field6[S, A]): Lens[S, A]

final def snoc[S, A](implicit ev: Snoc[S, A]): Prism[S, (S, A)]

final def snoc1[S, I, L](implicit ev: Snoc1[S, I, L]): Iso[S, (I, L)]

final def some[A]: Prism[Option[A], A]

final def stdLeft[A, B]: Prism[Either[A, B], A]

final def stdRight[A, B]: Prism[Either[A, B], B]

val stringToBoolean: Prism[String, Boolean]

val stringToByte: Prism[String, Byte]

val stringToInt: Prism[String, Int]

val stringToList: Iso[String, List[Char]]

val stringToLong: Prism[String, Long]

final def subForest[A]: Lens[Tree[A], Stream[Tree[A]]]

final def success[E, A]: Prism[Validation[E, A], A]

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

final def tail[S, H, T](implicit ev: Cons1[S, H, T]): Lens[S, T]

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

def theseToDisjunction[A, B]: Prism[\&/[A, B], \/[A, B]]

def third[S, A](implicit ev: Field3[S, A]): Lens[S, A]

implicit def toApplyFoldOps[S](value: S): ApplyFoldOps[S]

implicit def toApplyGetterOps[S](value: S): ApplyGetterOps[S]

implicit def toApplyIsoOps[S](value: S): ApplyIsoOps[S]

implicit def toApplyLensOps[S](value: S): ApplyLensOps[S]

implicit def toApplyOptionalOps[S](value: S): ApplyOptionalOps[S]

implicit def toApplyPrismOps[S](value: S): ApplyPrismOps[S]

implicit def toApplySetterOps[S](value: S): ApplySetterOps[S]

implicit def toApplyTraversalOps[S](value: S): ApplyTraversalOps[S]

def toString(): String

def transform[A](f: (A) ⇒ A)(a: A)(implicit arg0: Plated[A]): A

transform every element

def transformCounting[A](f: (A) ⇒ Option[A])(a: A)(implicit arg0: Plated[A]): (Int, A)

transforming counting changes

def transformM[A, M[_]](f: (A) ⇒ M[A])(a: A)(implicit arg0: Plated[A], arg1: Monad[M]): M[A]

transforming every element using monadic transformation

def transformOf[A](l: Setter[A, A])(f: (A) ⇒ A)(a: A): A

transform every element by applying a Setter

def traverseEach[S[_], A](implicit arg0: Traverse[S]): Each[S[A], A]

def traverseFilterIndex[S[_], A](zipWithIndex: (S[A]) ⇒ S[(A, Int)])(implicit arg0: Traverse[S]): FilterIndex[S[A], Int, A]

final def tryFailure[A]: Prism[Try[A], Throwable]

final def trySuccess[A]: Prism[Try[A], A]

def tuple1Iso[A]: Iso[(A), A]

def uncurry[F, G](implicit ev: Curry[F, G]): Iso[G, F]

def universe[A](a: A)(implicit arg0: Plated[A]): Stream[A]

get all transitive self-similar elements of a target, including itself

def unwrapped[S, A](implicit ev: Wrapped[S, A]): Iso[A, S]

final def validationToDisjunction[E, A]: Iso[Validation[E, A], \/[E, A]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def wrapped[S, A](implicit ev: Wrapped[S, A]): Iso[S, A]

final def nelAndOneIso[A]: Iso[NonEmptyList[A], OneAnd[List, A]]

final def pNelAndOneIso[A, B]: PIso[NonEmptyList[A], NonEmptyList[B], OneAnd[List, A], OneAnd[List, B]]

def theseDisjunction[A, B]: Prism[\&/[A, B], \/[A, B]]