Proptics core/proptics/IndexedTraversal_

IndexedTraversal_

abstract class IndexedTraversal_[I, S, T, A, B] extends IndexedTraversal1[I, S, T, A, B]

An IndexedTraversal_ is an indexed optic that focuses on zero or more values, and their indices.

Type parameters:
A

the foci of an IndexedTraversal_

B

the modified foci of an IndexedTraversal_

I

the index of an IndexedTraversal_

S

the source of an IndexedTraversal_

T

the modified source of an IndexedTraversal_

Companion:
object
trait IndexedTraversal1[I, S, T, A, B]
trait IndexedGetter0[I, S, A]
trait IndexedTraversal0[I, S, T, A, B]
trait IndexedSetter0[I, S, T, A, B]
class Object
trait Matchable
class Any
IndexedTraversal_[I, S, T, A, B]

Value members

Concrete methods

final def *>>[J, C, D](other: IndexedLens_[J, A, B, C, D]): IndexedTraversal_[J, S, T, C, D]

compose this IndexedTraversal_ with an IndexedLens_, while preserving the indices of the other optic

compose this IndexedTraversal_ with an IndexedLens_, while preserving the indices of the other optic

final def *>>[J, C, D](other: AnIndexedLens_[J, A, B, C, D]): IndexedTraversal_[J, S, T, C, D]

compose this IndexedTraversal_ with an AnIndexedLens_, while preserving the indices of the other optic

compose this IndexedTraversal_ with an AnIndexedLens_, while preserving the indices of the other optic

final def *>>[J, C, D](other: IndexedTraversal_[J, A, B, C, D]): IndexedTraversal_[J, S, T, C, D]

compose this IndexedTraversal_ with an IndexedTraversal_, while preserving the indices of the other optic

compose this IndexedTraversal_ with an IndexedTraversal_, while preserving the indices of the other optic

final def *>>[J, C, D](other: IndexedSetter_[J, A, B, C, D]): IndexedSetter_[J, S, T, C, D]

compose this IndexedTraversal_ with an IndexedSetter_, while preserving the indices of the other optic

compose this IndexedTraversal_ with an IndexedSetter_, while preserving the indices of the other optic

final def *>>[J, C, D](other: IndexedGetter_[J, A, B, C, D]): IndexedFold_[J, S, T, C, D]

compose this IndexedTraversal_ with an IndexedGetter_, while preserving the indices of the other optic

compose this IndexedTraversal_ with an IndexedGetter_, while preserving the indices of the other optic

final def *>>[J, C, D](other: IndexedFold_[J, A, B, C, D]): IndexedFold_[J, S, T, C, D]

compose IndexedTraversal_ with an IndexedFold_, while preserving the indices of the other optic

compose IndexedTraversal_ with an IndexedFold_, while preserving the indices of the other optic

final def <<*[C, D](other: IndexedLens_[_, A, B, C, D]): IndexedTraversal_[I, S, T, C, D]

compose this IndexedTraversal_ with an IndexedLens_, while preserving self indices

compose this IndexedTraversal_ with an IndexedLens_, while preserving self indices

final def <<*[C, D](other: AnIndexedLens_[_, A, B, C, D]): IndexedTraversal_[I, S, T, C, D]

compose this IndexedTraversal_ with an AnIndexedLens_, while preserving self indices

compose this IndexedTraversal_ with an AnIndexedLens_, while preserving self indices

final def <<*[C, D](other: IndexedTraversal_[_, A, B, C, D]): IndexedTraversal_[I, S, T, C, D]

compose this IndexedTraversal_ with an IndexedTraversal_, while preserving self indices

compose this IndexedTraversal_ with an IndexedTraversal_, while preserving self indices

final def <<*[C, D](other: IndexedSetter_[_, A, B, C, D]): IndexedSetter_[I, S, T, C, D]

compose this IndexedTraversal_ with an IndexedSetter_, while preserving self indices

compose this IndexedTraversal_ with an IndexedSetter_, while preserving self indices

final def <<*[C, D](other: IndexedGetter_[_, A, B, C, D]): IndexedFold_[I, S, T, C, D]

compose this IndexedTraversal_ with an IndexedGetter_, while preserving self indices

compose this IndexedTraversal_ with an IndexedGetter_, while preserving self indices

final def <<*[C, D](other: IndexedFold_[_, A, B, C, D]): IndexedFold_[I, S, T, C, D]

compose IndexedTraversal_ with an IndexedFold_, while preserving self indices

compose IndexedTraversal_ with an IndexedFold_, while preserving self indices

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

final def andThenWithLeftIndex[C, D](other: IndexedLens_[_, A, B, C, D]): IndexedTraversal_[I, S, T, C, D]

compose this IndexedTraversal_ with an IndexedLens_, while preserving self indices

compose this IndexedTraversal_ with an IndexedLens_, while preserving self indices

final def andThenWithLeftIndex[C, D](other: AnIndexedLens_[_, A, B, C, D]): IndexedTraversal_[I, S, T, C, D]

compose this IndexedTraversal_ with an AnIndexedLens_, while preserving self indices

compose this IndexedTraversal_ with an AnIndexedLens_, while preserving self indices

final def andThenWithLeftIndex[J, C, D](other: IndexedTraversal_[J, A, B, C, D]): IndexedTraversal_[I, S, T, C, D]

compose this IndexedTraversal_ with an IndexedTraversal_, while preserving self indices

compose this IndexedTraversal_ with an IndexedTraversal_, while preserving self indices

final def andThenWithLeftIndex[C, D](other: IndexedSetter_[_, A, B, C, D]): IndexedSetter_[I, S, T, C, D]

compose this IndexedTraversal_ with an IndexedSetter_, while preserving self indices

compose this IndexedTraversal_ with an IndexedSetter_, while preserving self indices

final def andThenWithLeftIndex[J, C, D](other: IndexedGetter_[_, A, B, C, D]): IndexedFold_[I, S, T, C, D]

compose this IndexedTraversal_ with an IndexedGetter_, while preserving self indices

compose this IndexedTraversal_ with an IndexedGetter_, while preserving self indices

final def andThenWithLeftIndex[C, D](other: IndexedFold_[_, A, B, C, D]): IndexedFold_[I, S, T, C, D]

compose IndexedTraversal_ with an IndexedFold_, while preserving self indices

compose IndexedTraversal_ with an IndexedFold_, while preserving self indices

final def andThenWithRightIndex[J, C, D](other: IndexedLens_[J, A, B, C, D]): IndexedTraversal_[J, S, T, C, D]

compose this IndexedTraversal_ with an IndexedLens_, while preserving the indices of the other optic

compose this IndexedTraversal_ with an IndexedLens_, while preserving the indices of the other optic

final def andThenWithRightIndex[J, C, D](other: AnIndexedLens_[J, A, B, C, D]): IndexedTraversal_[J, S, T, C, D]

compose this IndexedTraversal_ with an AnIndexedLens_, while preserving the indices of the other optic

compose this IndexedTraversal_ with an AnIndexedLens_, while preserving the indices of the other optic

final def andThenWithRightIndex[J, C, D](other: IndexedTraversal_[J, A, B, C, D]): IndexedTraversal_[J, S, T, C, D]

compose this IndexedTraversal_ with an IndexedTraversal_, while preserving the indices of the other optic

compose this IndexedTraversal_ with an IndexedTraversal_, while preserving the indices of the other optic

final def andThenWithRightIndex[J, C, D](other: IndexedSetter_[J, A, B, C, D]): IndexedSetter_[J, S, T, C, D]

compose this IndexedTraversal_ with an IndexedSetter_, while preserving the indices of the other optic

compose this IndexedTraversal_ with an IndexedSetter_, while preserving the indices of the other optic

final def andThenWithRightIndex[J, C, D](other: IndexedGetter_[J, A, B, C, D]): IndexedFold_[J, S, T, C, D]

compose this IndexedTraversal_ with an IndexedGetter_, while preserving the indices of the other optic

compose this IndexedTraversal_ with an IndexedGetter_, while preserving the indices of the other optic

final def andThenWithRightIndex[J, C, D](other: IndexedFold_[J, A, B, C, D]): IndexedFold_[J, S, T, C, D]

compose IndexedTraversal_ with an IndexedFold_, while preserving the indices of the other optic

compose IndexedTraversal_ with an IndexedFold_, while preserving the indices of the other optic

final def asIndexedFold: IndexedFold_[I, S, T, A, B]

transform an IndexedLens_ to an IndexedFold_

transform an IndexedLens_ to an IndexedFold_

final def asTraversal: Traversal_[S, T, A, B]

transform an IndexedTraversal_ to a Traversal_

transform an IndexedTraversal_ to a Traversal_

final def compose[C, D](other: Iso_[C, D, S, T]): IndexedTraversal_[I, C, D, A, B]

compose this IndexedTraversal_ with an Iso_, having this IndexedTraversal_ applied last

compose this IndexedTraversal_ with an Iso_, having this IndexedTraversal_ applied last

final def compose[C, D](other: AnIso_[C, D, S, T]): IndexedTraversal_[I, C, D, A, B]

compose this IndexedTraversal_ with an AnIso_, having this IndexedTraversal_ applied last

compose this IndexedTraversal_ with an AnIso_, having this IndexedTraversal_ applied last

final def compose[C, D](other: Lens_[C, D, S, T]): IndexedTraversal_[I, C, D, A, B]

compose this IndexedTraversal_ with a Lens_, having this IndexedTraversal_ applied last

compose this IndexedTraversal_ with a Lens_, having this IndexedTraversal_ applied last

final def compose[C, D](other: ALens_[C, D, S, T]): IndexedTraversal_[I, C, D, A, B]

compose this IndexedTraversal_ with an ALens_, having this IndexedTraversal_ applied last

compose this IndexedTraversal_ with an ALens_, having this IndexedTraversal_ applied last

final def compose[C, D](other: Prism_[C, D, S, T]): IndexedTraversal_[I, C, D, A, B]

compose this IndexedTraversal_ with a Prism_, having this IndexedTraversal_ applied last

compose this IndexedTraversal_ with a Prism_, having this IndexedTraversal_ applied last

final def compose[C, D](other: APrism_[C, D, S, T]): IndexedTraversal_[I, C, D, A, B]

compose this IndexedTraversal_ with an APrism_, having this IndexedTraversal_ applied last

compose this IndexedTraversal_ with an APrism_, having this IndexedTraversal_ applied last

final def compose[C, D](other: AffineTraversal_[C, D, S, T]): IndexedTraversal_[I, C, D, A, B]

compose this IndexedTraversal_ with an AffineTraversal_, having this IndexedTraversal_ applied last

compose this IndexedTraversal_ with an AffineTraversal_, having this IndexedTraversal_ applied last

final def compose[C, D](other: AnAffineTraversal_[C, D, S, T]): IndexedTraversal_[I, C, D, A, B]

compose this IndexedTraversal_ with an AnAffineTraversal_, having this IndexedTraversal_ applied last

compose this IndexedTraversal_ with an AnAffineTraversal_, having this IndexedTraversal_ applied last

final def compose[C, D](other: Traversal_[C, D, S, T]): IndexedTraversal_[I, C, D, A, B]

compose this IndexedTraversal_ with a Traversal_, having this IndexedTraversal_ applied last

compose this IndexedTraversal_ with a Traversal_, having this IndexedTraversal_ applied last

final def compose[C, D](other: ATraversal_[C, D, S, T]): IndexedTraversal_[I, C, D, A, B]

compose this IndexedTraversal_ with an ATraversal_, having this IndexedTraversal_ applied last

compose this IndexedTraversal_ with an ATraversal_, having this IndexedTraversal_ applied last

final def compose[C, D](other: Setter_[C, D, S, T]): IndexedSetter_[I, C, D, A, B]

compose this IndexedTraversal_ with a Setter_, having this IndexedTraversal_ applied last

compose this IndexedTraversal_ with a Setter_, having this IndexedTraversal_ applied last

final def compose[C, D](other: Getter_[C, D, S, T]): IndexedFold_[I, C, D, A, B]

compose this IndexedTraversal_ with a Getter_, having this IndexedTraversal_ applied last

compose this IndexedTraversal_ with a Getter_, having this IndexedTraversal_ applied last

final def compose[C, D](other: Fold_[C, D, S, T]): IndexedFold_[I, C, D, A, B]

compose this IndexedTraversal_ with a Fold_, having this IndexedTraversal_ applied last

compose this IndexedTraversal_ with a Fold_, having this IndexedTraversal_ applied last

final def over(f: ((A, I)) => B): S => T

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

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

final def reindex[J](f: I => J): IndexedTraversal_[J, S, T, A, B]

remap the index, resulting in a change of type to the full structure

remap the index, resulting in a change of type to the full structure

final def traverse[F[_] : Applicative](s: S)(f: ((A, I)) => F[B]): F[T]

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

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

final def unIndex: Traversal_[S, T, A, B]

synonym for asTraversal

synonym for asTraversal

Inherited methods

final def and(s: S)(implicit ev: Heyting[A]): A

return the result of a conjunction of all foci of an IndexedFold, using a spire.algebra.lattice.Heyting algebra

return the result of a conjunction of all foci of an IndexedFold, using a spire.algebra.lattice.Heyting algebra

Inherited from:
IndexedFold0 (hidden)
final def any[F[_], R : Heyting](s: S)(f: ((A, I)) => R): R

test whether a predicate holds for any focus and index of an IndexedFold, using a spire.algebra.lattice.Heyting algebra

test whether a predicate holds for any focus and index of an IndexedFold, using a spire.algebra.lattice.Heyting algebra

Inherited from:
IndexedFold0 (hidden)
final def contains(a: (A, I))(s: S)(implicit ev: Eq[(A, I)]): Boolean

test whether a focus at specific index of an IndexedGetter contains a given value

test whether a focus at specific index of an IndexedGetter contains a given value

Inherited from:
IndexedGetter0
final override def exists(f: ((A, I)) => Boolean): S => Boolean

test whether a predicate holds for the focus of an IndexedGetter

test whether a predicate holds for the focus of an IndexedGetter

Definition Classes
IndexedFold0 -> IndexedGetter0
Inherited from:
IndexedFold0 (hidden)
final def find(f: ((A, I)) => Boolean): S => Option[(A, I)]

find the first focus of an IndexedFold that satisfies a predicate, if there is any

find the first focus of an IndexedFold that satisfies a predicate, if there is any

Inherited from:
IndexedFold0 (hidden)
final def first(s: S): Option[(A, I)]

synonym for preview

synonym for preview

Inherited from:
IndexedFold0 (hidden)
final def fold(s: S)(implicit ev: Monoid[A]): A

fold the foci of a IndexedFold using a cats.Monoid

fold the foci of a IndexedFold using a cats.Monoid

Inherited from:
IndexedFold0 (hidden)
final def foldLeft[R](s: S)(r: R)(f: (R, (A, I)) => R): R

fold the foci and indices of an IndexedFold using a binary operator, going left to right

fold the foci and indices of an IndexedFold using a binary operator, going left to right

Inherited from:
IndexedFold0 (hidden)
final override def foldMap[R : Monoid](s: S)(f: ((A, I)) => R): R

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

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

Definition Classes
Inherited from:
IndexedTraversal1
final def foldRight[R](s: S)(r: R)(f: ((A, I), R) => R): R

fold the foci and indices of an IndexedFold using a binary operator, going right to left

fold the foci and indices of an IndexedFold using a binary operator, going right to left

Inherited from:
IndexedFold0 (hidden)
final def forall[R : Heyting](s: S)(f: ((A, I)) => R): R

test whether there is no focus or a predicate holds for all foci and indices of an IndexedFold, using a spire.algebra.lattice.Heyting algebra

test whether there is no focus or a predicate holds for all foci and indices of an IndexedFold, using a spire.algebra.lattice.Heyting algebra

Inherited from:
IndexedFold0 (hidden)
final def forall(f: ((A, I)) => Boolean): S => Boolean

test whether there is no focus or a predicate holds for all foci and indices of an IndexedFold

test whether there is no focus or a predicate holds for all foci and indices of an IndexedFold

Inherited from:
IndexedFold0 (hidden)
final def isEmpty(s: S): Boolean

check if the IndexedFold does not contain a focus

check if the IndexedFold does not contain a focus

Inherited from:
IndexedFold0 (hidden)
final def last(s: S): Option[(A, I)]

find the last focus and index of an IndexedFold that satisfies a predicate, if there is any

find the last focus and index of an IndexedFold that satisfies a predicate, if there is any

Inherited from:
IndexedFold0 (hidden)
final def length(s: S): Int

the number of foci of an IndexedFold

the number of foci of an IndexedFold

Inherited from:
IndexedFold0 (hidden)
final def maximum(s: S)(implicit ev: Order[A]): Option[A]

the maximum of all foci of an IndexedFold, if there is any

the maximum of all foci of an IndexedFold, if there is any

Inherited from:
IndexedFold0 (hidden)
final def minimum(s: S)(implicit ev: Order[A]): Option[A]

the minimum of all foci of an IndexedFold, if there is any

the minimum of all foci of an IndexedFold, if there is any

Inherited from:
IndexedFold0 (hidden)
final def nonEmpty(s: S): Boolean

check if the IndexedFold contains a focus

check if the IndexedFold contains a focus

Inherited from:
IndexedFold0 (hidden)
final def notContains(a: (A, I))(s: S)(implicit ev: Eq[(A, I)]): Boolean

test whether a focus at specific index of an IndexedGetter does not contain a given value

test whether a focus at specific index of an IndexedGetter does not contain a given value

Inherited from:
IndexedGetter0
final def notExists(f: ((A, I)) => Boolean): S => Boolean

test whether a predicate does not hold for the focus of an IndexedGetter

test whether a predicate does not hold for the focus of an IndexedGetter

Inherited from:
IndexedGetter0
final def or(s: S)(implicit ev: Heyting[A]): A

return the result of a disjunction of all foci of an IndexedFold, using a spire.algebra.lattice.Heyting algebra

return the result of a disjunction of all foci of an IndexedFold, using a spire.algebra.lattice.Heyting algebra

Inherited from:
IndexedFold0 (hidden)
final def overF[F[_] : Applicative](f: ((A, I)) => F[B])(s: S): F[T]

synonym for traverse, flipped

synonym for traverse, flipped

Inherited from:
IndexedTraversal0
final def preview(s: S): Option[(A, I)]

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

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

Inherited from:
IndexedFold0 (hidden)
final def product(s: S)(implicit ev: MultiplicativeMonoid[A]): A

the product of all foci of an IndexedFold

the product of all foci of an IndexedFold

Inherited from:
IndexedFold0 (hidden)
final def sequence_[F[_]](s: S)(implicit ev: Applicative[F]): F[Unit]

evaluate each focus and index of an IndexedTraversal from left to right, and ignore the results structure

evaluate each focus and index of an IndexedTraversal from left to right, and ignore the results structure

Inherited from:
IndexedTraversal1
final def set(b: B): S => T

set the modified focus of an IndexedSetter

set the modified focus of an IndexedSetter

Inherited from:
IndexedSetter0
final def sum(s: S)(implicit ev: AdditiveMonoid[A]): A

the sum of all foci of an IndexedFold

the sum of all foci of an IndexedFold

Inherited from:
IndexedFold0 (hidden)
final def toArray(s: S)(implicit ev0: ClassTag[A]): Array[A]

collect all the foci of an IndexedFold into an Array

collect all the foci of an IndexedFold into an Array

Inherited from:
IndexedFold0 (hidden)
final def toList(s: S): List[A]

collect all the foci of an IndexedFold into aList

collect all the foci of an IndexedFold into aList

Inherited from:
IndexedFold0 (hidden)
final def traverse_[F[_], R](s: S)(f: ((A, I)) => F[R])(implicit ev: Applicative[F]): F[Unit]

map each focus and index of an IndexedTraversal to an effect, from left to right, and ignore the results

map each focus and index of an IndexedTraversal to an effect, from left to right, and ignore the results

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

view the focus and the index of an IndexedFold in the state of a monad

view the focus and the index of an IndexedFold in the state of a monad

Inherited from:
IndexedFold0 (hidden)
final def viewAll(s: S): List[(A, I)]

collect all the foci of an IndexedFold into a List

collect all the foci of an IndexedFold into a List

Inherited from:
IndexedFold0 (hidden)

Implicits

Inherited implicits

implicit def monoidBooleanDisj: Monoid[Disj[Boolean]]
Inherited from:
FoldInstances (hidden)