Traversal

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

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

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

def asFold: Fold[S, A]

final def asInstanceOf[T0]: T0

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

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

def clone(): AnyRef

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

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

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

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

non overloaded compose function

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

non overloaded compose function

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

non overloaded compose function

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

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

def finalize(): Unit

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

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

def getAll(from: S): List[A]

final def getClass(): Class[_]

def hashCode(): Int

def headOption(from: S): Option[A]

final def isInstanceOf[T0]: Boolean

def modify(from: S, f: (A) ⇒ B): T

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def set(from: S, 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