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.

I

the index of an IndexedTraversal_

S

the source of an IndexedTraversal_

T

the modified source of an IndexedTraversal_

A

the foci of an IndexedTraversal_

B

the modified foci of an IndexedTraversal_

Self Type
IndexedTraversal_[I, S, T, A, B]
Source
IndexedTraversal.scala
Linear Supertypes
IndexedTraversal1[I, S, T, A, B], IndexedFold0[I, S, A], FoldInstances, IndexedGetter0[I, S, A], IndexedTraversal0[I, S, T, A, B], IndexedSetter0[I, S, T, A, B], Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. IndexedTraversal_
  2. IndexedTraversal1
  3. IndexedFold0
  4. FoldInstances
  5. IndexedGetter0
  6. IndexedTraversal0
  7. IndexedSetter0
  8. Serializable
  9. AnyRef
  10. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new IndexedTraversal_()

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. 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

  4. 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

  5. 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

  6. 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

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

  8. 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

  9. 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

  10. 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

  11. 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

  12. 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

  13. 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

  14. 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

  15. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  16. 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

    Definition Classes
    IndexedFold0
  17. 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

  18. 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

  19. 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

  20. 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

  21. 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

  22. 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

  23. 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

  24. 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

  25. 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

  26. 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

  27. 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

  28. 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

  29. 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

  30. 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

  31. 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

  32. 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

  33. 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

  34. 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

  35. 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

  36. 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

  37. 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

  38. 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

  39. 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

  40. 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

  41. 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

  42. final def any[F[_], R](s: S)(f: ((A, I)) => R)(implicit arg0: Heyting[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

    Definition Classes
    IndexedFold0
  43. final def asIndexedFold: IndexedFold_[I, S, T, A, B]

    transform an IndexedLens_ to an IndexedFold_

  44. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  45. final def asTraversal: Traversal_[S, T, A, B]

    transform an IndexedTraversal_ to a Traversal_

  46. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  47. 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

  48. 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

  49. 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

  50. 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

  51. 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

  52. 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

  53. 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

  54. 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

  55. 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

  56. 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

  57. 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

  58. 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

  59. 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

  60. 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

    Definition Classes
    IndexedGetter0
  61. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  62. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  63. final 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
  64. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  65. 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

    Definition Classes
    IndexedFold0 → IndexedGetter0
  66. final def first(s: S): Option[(A, I)]

    synonym for preview

    synonym for preview

    Definition Classes
    IndexedFold0
  67. 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

    Definition Classes
    IndexedFold0
  68. 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

    Definition Classes
    IndexedFold0
  69. final def foldMap[R](s: S)(f: ((A, I)) => R)(implicit arg0: Monoid[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
    IndexedTraversal1 → IndexedFold0 → IndexedTraversal0
  70. 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

    Definition Classes
    IndexedFold0
  71. final def forall[R](s: S)(f: ((A, I)) => R)(implicit arg0: Heyting[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

    Definition Classes
    IndexedFold0
  72. 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

    Definition Classes
    IndexedFold0
  73. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  74. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  75. final def isEmpty(s: S): Boolean

    check if the IndexedFold does not contain a focus

    check if the IndexedFold does not contain a focus

    Definition Classes
    IndexedFold0
  76. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  77. 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

    Definition Classes
    IndexedFold0
  78. final def length(s: S): Int

    the number of foci of an IndexedFold

    the number of foci of an IndexedFold

    Definition Classes
    IndexedFold0
  79. 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

    Definition Classes
    IndexedFold0
  80. 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

    Definition Classes
    IndexedFold0
  81. implicit def monoidBooleanDisj: Monoid[Disj[Boolean]]
    Definition Classes
    FoldInstances
  82. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  83. final def nonEmpty(s: S): Boolean

    check if the IndexedFold contains a focus

    check if the IndexedFold contains a focus

    Definition Classes
    IndexedFold0
  84. 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

    Definition Classes
    IndexedGetter0
  85. 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

    Definition Classes
    IndexedGetter0
  86. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  87. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  88. 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

    Definition Classes
    IndexedFold0
  89. 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

    Definition Classes
    IndexedTraversal_ → IndexedSetter0
  90. final def overF[F[_]](f: ((A, I)) => F[B])(s: S)(implicit arg0: Applicative[F]): F[T]

    synonym for traverse, flipped

    synonym for traverse, flipped

    Definition Classes
    IndexedTraversal0
  91. 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

    Definition Classes
    IndexedFold0
  92. 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

    Definition Classes
    IndexedFold0
  93. 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

  94. 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

    Definition Classes
    IndexedTraversal1
  95. final def set(b: B): (S) => T

    set the modified focus of an IndexedSetter

    set the modified focus of an IndexedSetter

    Definition Classes
    IndexedSetter0
  96. 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

    Definition Classes
    IndexedFold0
  97. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  98. 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

    Definition Classes
    IndexedFold0
  99. 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

    Definition Classes
    IndexedFold0
  100. def toString(): String
    Definition Classes
    AnyRef → Any
  101. final def traverse[F[_]](s: S)(f: ((A, I)) => F[B])(implicit arg0: Applicative[F]): 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

    Definition Classes
    IndexedTraversal_ → IndexedTraversal0
  102. 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

    Definition Classes
    IndexedTraversal1
  103. final def unIndex: Traversal_[S, T, A, B]

    synonym for asTraversal

  104. 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

    Definition Classes
    IndexedFold0
  105. 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

    Definition Classes
    IndexedFold0
  106. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  107. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  108. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()

Inherited from IndexedTraversal1[I, S, T, A, B]

Inherited from IndexedFold0[I, S, A]

Inherited from FoldInstances

Inherited from IndexedGetter0[I, S, A]

Inherited from IndexedTraversal0[I, S, T, A, B]

Inherited from IndexedSetter0[I, S, T, A, B]

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped