all

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 _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 children[A](a: A)(implicit arg0: Plated[A]): List[A]

get the immediate self-similar children of a target

def clone(): AnyRef

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]

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

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

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

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]

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]

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]

final def isInstanceOf[T0]: Boolean

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 ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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 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)

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 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 third[S, A](implicit ev: Field3[S, A]): Lens[S, A]

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 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 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]

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

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

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]