AppliedTraversal_

trait AppliedTraversal_[S, T, A, B] extends AppliedTraversal1[S, T, A, B]
Companion:
object
trait AppliedTraversal1[S, T, A, B]
trait AppliedFoldCompat[S, A]
trait AppliedFold1[S, A]
trait AppliedFoldCompat0[S, A]
trait AppliedGetter0[S, A]
trait AppliedFold0[S, A]
trait AppliedTraversal0[S, T, A, B]
trait AppliedSetter0[S, T, A, B]
class Object
trait Matchable
class Any

Value members

Concrete methods

final def andThen[C, D](other: Iso_[A, B, C, D]): AppliedTraversal_[S, T, C, D]

compose this Traversal_ with an Iso_, having this Traversal_ applied first

compose this Traversal_ with an Iso_, having this Traversal_ applied first

final def andThen[C, D](other: AnIso_[A, B, C, D]): AppliedTraversal_[S, T, C, D]

compose this Traversal_ with an AnIso_, having this Traversal_ applied first

compose this Traversal_ with an AnIso_, having this Traversal_ applied first

final def andThen[C, D](other: Lens_[A, B, C, D]): AppliedTraversal_[S, T, C, D]

compose this Traversal_ with a Lens_, having this Traversal_ applied first

compose this Traversal_ with a Lens_, having this Traversal_ applied first

final def andThen[C, D](other: ALens_[A, B, C, D]): AppliedTraversal_[S, T, C, D]

compose this Traversal_ with an ALens_, having this Traversal_ applied first

compose this Traversal_ with an ALens_, having this Traversal_ applied first

final def andThen[C, D](other: Prism_[A, B, C, D]): AppliedTraversal_[S, T, C, D]

compose this Traversal_ with a Prism_, having this Traversal_ applied first

compose this Traversal_ with a Prism_, having this Traversal_ applied first

final def andThen[C, D](other: APrism_[A, B, C, D]): AppliedTraversal_[S, T, C, D]

compose this Traversal_ with an APrism_, having this Traversal_ applied first

compose this Traversal_ with an APrism_, having this Traversal_ applied first

final def andThen[C, D](other: AffineTraversal_[A, B, C, D]): AppliedTraversal_[S, T, C, D]

compose this Traversal_ with an AffineTraversal_, having this Traversal_ applied first

compose this Traversal_ with an AffineTraversal_, having this Traversal_ applied first

final def andThen[C, D](other: AnAffineTraversal_[A, B, C, D]): AppliedTraversal_[S, T, C, D]

compose this Traversal_ with an AnAffineTraversal_, having this Traversal_ applied first

compose this Traversal_ with an AnAffineTraversal_, having this Traversal_ applied first

final def andThen[C, D](other: Traversal_[A, B, C, D]): AppliedTraversal_[S, T, C, D]

compose this Traversal_ with a Traversal_, having this Traversal_ applied first

compose this Traversal_ with a Traversal_, having this Traversal_ applied first

final def andThen[C, D](other: ATraversal_[A, B, C, D]): AppliedTraversal_[S, T, C, D]

compose this Traversal_ with an ATraversal_, having this Traversal_ applied first

compose this Traversal_ with an ATraversal_, having this Traversal_ applied first

final def andThen[C, D](other: Setter_[A, B, C, D]): AppliedSetter_[S, T, C, D]

compose this Traversal_ with a Setter_, having this Traversal_ applied first

compose this Traversal_ with a Setter_, having this Traversal_ applied first

final def andThen[C, D](other: Getter_[A, B, C, D]): AppliedFold_[S, T, C, D]

compose this Traversal_ with a Getter_, having this Traversal_ applied first

compose this Traversal_ with a Getter_, having this Traversal_ applied first

final def andThen[C, D](other: Fold_[A, B, C, D]): AppliedFold_[S, T, C, D]

compose this Traversal_ with a Fold_, having this Traversal_ applied first

compose this Traversal_ with a Fold_, having this Traversal_ applied first

final def focus[C, D](f: A => C): AppliedFold_[S, T, C, D]

compose this Traversal_ with a function lifted to a Getter_, having this Traversal_ applied first

compose this Traversal_ with a function lifted to a Getter_, having this Traversal_ applied first

final def unsafePartsOf(implicit ev0: Sellable[Function1, [_, _, _] =>> Bazaar[Function1, _$5, _$6, Unit, _$7]], ev1: Aux[Function1, [_] =>> State[List[B], _$10]]): AppliedLens_[S, T, List[A], List[B]]

convert a Traversal_ into a Lens_ over a list of the Traversal_'s foci

convert a Traversal_ into a Lens_ over a list of the Traversal_'s foci

Inherited methods

final def contains(a: A)(implicit ev: Eq[A]): Boolean

test whether the focus of a Getter contains a given value

test whether the focus of a Getter contains a given value

Inherited from:
AppliedGetter0
final def exists(f: A => Boolean): Boolean

test whether a predicate holds for the focus of a Getter

test whether a predicate holds for the focus of a Getter

Inherited from:
AppliedFold0
final def find(f: A => Boolean): Option[A]
Inherited from:
AppliedFold1
final def first: Option[A]

find the first focus of a Fold, if there is any. Synonym for preview

find the first focus of a Fold, if there is any. Synonym for preview

Inherited from:
AppliedFold1
final def fold(implicit ev: Monoid[A]): A

fold the foci of a Fold using a cats.Monoid

fold the foci of a Fold using a cats.Monoid

Inherited from:
AppliedFold1
final def foldLeft[R](r: R)(f: (R, A) => R): R

fold the foci of a Fold using a binary operator, going left to right

fold the foci of a Fold using a binary operator, going left to right

Inherited from:
AppliedFold1
def foldMap[R : Monoid](f: A => R): R

map each focus of a Fold to a cats.Monoid, and combine the results

map each focus of a Fold to a cats.Monoid, and combine the results

Inherited from:
AppliedFold1
final def foldRight[R](r: R)(f: (A, R) => R): R

fold the foci of a Fold using a binary operator, going right to left

fold the foci of a Fold using a binary operator, going right to left

Inherited from:
AppliedFold1
def forall(f: A => Boolean): Boolean

test whether there is no focus or a predicate holds for the focus of a Fold

test whether there is no focus or a predicate holds for the focus of a Fold

Inherited from:
AppliedFold0
final def intercalate(implicit ev: Monoid[A]): A

intercalate/insert an element between the existing elements while folding

intercalate/insert an element between the existing elements while folding

Inherited from:
AppliedFold1
final def intercalate(a: A)(implicit ev: Monoid[A]): A

intercalate/insert an element between the existing elements while folding

intercalate/insert an element between the existing elements while folding

Inherited from:
AppliedFold1
final def isEmpty: Boolean

check if the Getter does not contain a focus

check if the Getter does not contain a focus

Inherited from:
AppliedGetter0
final def last: Option[A]

find the last focus of a Fold, if there is any

find the last focus of a Fold, if there is any

Inherited from:
AppliedFold1
final def length: Int

the number of foci of a Fold

the number of foci of a Fold

Inherited from:
AppliedFold1
final def maximum(implicit ev: Order[A]): Option[A]

the maximum of all foci of a Fold, if there is any

the maximum of all foci of a Fold, if there is any

Inherited from:
AppliedFold1
final def minimum(implicit ev: Order[A]): Option[A]

the minimum of all foci of a Fold, if there is any

the minimum of all foci of a Fold, if there is any

Inherited from:
AppliedFold1
final def mkString: String

displays all foci of a Fold in a string

displays all foci of a Fold in a string

Inherited from:
AppliedFold1
final def nonEmpty: Boolean

check if the Getter contains a focus

check if the Getter contains a focus

Inherited from:
AppliedGetter0
final def notContains(a: A)(implicit ev: Eq[A]): Boolean

test whether the focus of a Getter does not contain a given value

test whether the focus of a Getter does not contain a given value

Inherited from:
AppliedGetter0
final def notExists(f: A => Boolean): Boolean

test whether a predicate does not hold for the focus of a Getter

test whether a predicate does not hold for the focus of a Getter

Inherited from:
AppliedGetter0
def over(f: A => B): T

modify the foci type of a Setter using a function, resulting in a change of type to the full structure

modify the foci type of a Setter using a function, resulting in a change of type to the full structure

Inherited from:
AppliedSetter0
final def overF[F[_] : Applicative](f: A => F[B]): F[T]

synonym for traverse

synonym for traverse

Inherited from:
AppliedTraversal0
final def preview: Option[A]

view the first focus of a Fold, if there is any

view the first focus of a Fold, if there is any

Inherited from:
AppliedFold0
final def sequence_[F[_]](implicit ev: Applicative[F]): F[Unit]

evaluate each focus of a Traversal from left to right, and ignore the results structure

evaluate each focus of a Traversal from left to right, and ignore the results structure

Inherited from:
AppliedTraversal1
final def set(b: B): T

set the modified foci of a Setter

set the modified foci of a Setter

Inherited from:
AppliedSetter0
final def toArray(implicit ev: ClassTag[A]): Array[A]

collect all the foci of a Fold into an Array

collect all the foci of a Fold into an Array

Inherited from:
AppliedFold1
final def toList: List[A]

synonym to viewAll

synonym to viewAll

Inherited from:
AppliedFold1
def traverse[F[_] : Applicative](f: A => F[B]): F[T]

modify each focus of a Traversal using a Functor, resulting in a change of type to the full structure

modify each focus of a Traversal using a Functor, resulting in a change of type to the full structure

Inherited from:
AppliedTraversal0
final def traverse_[F[_], R](f: A => F[R])(implicit ev: Applicative[F]): F[Unit]

map each focus of a Traversal to an effect, from left to right, and ignore the results

map each focus of a Traversal to an effect, from left to right, and ignore the results

Inherited from:
AppliedTraversal1
final def use(implicit ev: State[S, A]): State[S, List[A]]

collect all the foci of a Fold in the state of a monad

collect all the foci of a Fold in the state of a monad

Inherited from:
AppliedFold1
def view(implicit ev: Monoid[A]): A

synonym to fold

synonym to fold

Inherited from:
AppliedFold1
final def viewAll: List[A]

collect all the foci of a Fold into aList

collect all the foci of a Fold into aList

Inherited from:
AppliedFold1

Abstract fields

val optic: Traversal_[S, T, A, B]
val value: S