abstract class ATraversal_[S, T, A, B] extends Traversal1[S, T, A, B]

ATraversal_ is an optic that focuses on zero or more values.

ATraversal_ is a Traversal_ with fixed type proptics.internal.Bazaar cats.arrow.Profunctor

S

the source of a ATraversal_

T

the modified source of a ATraversal_

A

the foci of a ATraversal_

B

the modified foci of a ATraversal_

Self Type
ATraversal_[S, T, A, B]
Source
ATraversal.scala
Linear Supertypes
Traversal1[S, T, A, B], Fold1[S, A], Fold0[S, A], FoldInstances, Getter0[S, A], Serializable, Traversal0[S, T, A, B], Setter0[S, T, A, B], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ATraversal_
  2. Traversal1
  3. Fold1
  4. Fold0
  5. FoldInstances
  6. Getter0
  7. Serializable
  8. Traversal0
  9. Setter0
  10. AnyRef
  11. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new ATraversal_()

Abstract Value Members

  1. abstract def traverse[G[_]](s: S)(f: (A) => G[B])(implicit ev: Applicative[G]): G[T]

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

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

    Definition Classes
    ATraversal_ → Traversal0

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def and(s: S)(implicit ev: Heyting[A]): A

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

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

    Definition Classes
    Fold1
  5. final def andThen[I, C, D](other: IndexedFold_[I, A, B, C, D]): IndexedFold_[I, S, T, C, D]

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  24. final def any[R](s: S)(f: (A) => R)(implicit arg0: Heyting[R]): R

    test whether a predicate holds for any focus of a Fold, using a spire.algebra.lattice.Heyting algebra

    test whether a predicate holds for any focus of a Fold, using a spire.algebra.lattice.Heyting algebra

    Definition Classes
    Fold1
  25. final def asFold: Fold_[S, T, A, B]

    transform an ATraversal_ to a Fold_

  26. final def asIndexableTraversal(implicit ev0: Applicative[[β$12$]IndexedStateT[Eval, Int, Int, β$12$]]): IndexedTraversal_[Int, S, T, A, B]

    convert an ATraversal_ to an IndexedTraversal_ by using the integer positions as indices

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

    transform an ATraversal_ to a Traversal_

  29. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  30. final def compose[I, C, D](other: IndexedFold_[I, C, D, S, T]): IndexedFold_[I, C, D, A, B]

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

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

    compose this Traversal_ with an IndexedGetter_, having this ATraversal_ applied last

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

    compose this Traversal_ with an IndexedSetter_, having this ATraversal_ applied last

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

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

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

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

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

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

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

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

  37. final def compose[C, D](other: Getter_[C, D, S, T]): Fold_[C, D, A, B]

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

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

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

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

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

  40. final def compose[C, D](other: Traversal_[C, D, S, T]): ATraversal_[C, D, A, B]

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

  41. final def compose[C, D](other: AnAffineTraversal_[C, D, S, T]): ATraversal_[C, D, A, B]

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

  42. final def compose[C, D](other: AffineTraversal_[C, D, S, T]): ATraversal_[C, D, A, B]

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

  43. final def compose[C, D](other: APrism_[C, D, S, T]): ATraversal_[C, D, A, B]

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

  44. final def compose[C, D](other: Prism_[C, D, S, T]): ATraversal_[C, D, A, B]

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

  45. final def compose[C, D](other: ALens_[C, D, S, T]): ATraversal_[C, D, A, B]

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

  46. final def compose[C, D](other: Lens_[C, D, S, T]): ATraversal_[C, D, A, B]

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

  47. final def compose[C, D](other: AnIso_[C, D, S, T]): ATraversal_[C, D, A, B]

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

  48. final def compose[C, D](other: Iso_[C, D, S, T]): ATraversal_[C, D, A, B]

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

  49. final def contains(a: A)(s: S)(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

    Definition Classes
    Getter0
  50. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  51. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  52. final def exists(f: (A) => Boolean): (S) => Boolean

    test whether a predicate holds for the focus of a Fold

    test whether a predicate holds for the focus of a Fold

    Definition Classes
    Fold0 → Getter0
  53. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  54. final def find(f: (A) => Boolean): (S) => Option[A]

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

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

    Definition Classes
    Fold1 → Getter0
  55. final def first(s: S): Option[A]

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

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

    Definition Classes
    Fold1
  56. final def focus[C, D](f: (A) => C): Fold_[S, T, C, D]

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

  57. final def fold(s: S)(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

    Definition Classes
    Fold1
  58. final def foldLeft[R](s: S)(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

    Definition Classes
    Fold1
  59. final def foldMap[R](s: S)(f: (A) => 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
    Traversal1 → Fold1 → Fold0 → Traversal0
  60. final def foldRight[R](s: S)(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

    Definition Classes
    Fold1
  61. final def forall(f: (A) => Boolean): (S) => 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

    Definition Classes
    Fold1 → Fold0
  62. final def forall[R](s: S)(f: (A) => R)(implicit arg0: Heyting[R]): R

    test whether there is no focus or a predicate holds for the focus of a Fold, using a spire.algebra.lattice.Heyting algebra

    test whether there is no focus or a predicate holds for the focus of a Fold, using a spire.algebra.lattice.Heyting algebra

    Definition Classes
    Fold0
  63. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  64. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  65. final def intercalate(s: S, a: A)(implicit ev0: Monoid[A], ev1: <:<[S, Iterable[A]]): A

    intercalate/insert an element between the existing elements while folding

    intercalate/insert an element between the existing elements while folding

    Definition Classes
    Fold1
  66. final def isEmpty(s: S): Boolean

    check if the Fold does not contain a focus

    check if the Fold does not contain a focus

    Definition Classes
    Fold0
  67. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  68. final def last(s: S): Option[A]

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

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

    Definition Classes
    Fold1
  69. final def length(s: S): Int

    the number of foci of a Fold

    the number of foci of a Fold

    Definition Classes
    Fold1
  70. final def maximum(s: S)(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

    Definition Classes
    Fold1
  71. def minMax(s: S)(f: (A, A) => A): Option[A]
    Attributes
    protected[proptics]
    Definition Classes
    Fold1
  72. final def minimum(s: S)(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

    Definition Classes
    Fold1
  73. final def mkString(s: S, start: String, sep: String, end: String)(implicit ev: <:<[S, Iterable[A]]): String

    displays all foci of a Fold in a string using a start, end and a separator

    displays all foci of a Fold in a string using a start, end and a separator

    Definition Classes
    Fold1
  74. final def mkString(s: S, sep: String)(implicit ev: <:<[S, Iterable[A]]): String

    displays all foci of a Fold in a string using a separator

    displays all foci of a Fold in a string using a separator

    Definition Classes
    Fold1
  75. final def mkString(s: S)(implicit ev: <:<[S, Iterable[A]]): String

    displays all foci of a Fold in a string

    displays all foci of a Fold in a string

    Definition Classes
    Fold1
  76. implicit def monoidBooleanDisj: Monoid[Disj[Boolean]]
    Definition Classes
    FoldInstances
  77. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  78. final def nonEmpty(s: S): Boolean

    check if the Fold contains a focus

    check if the Fold contains a focus

    Definition Classes
    Fold0
  79. final def notContains(a: A)(s: S)(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

    Definition Classes
    Getter0
  80. final def notExists(f: (A) => Boolean): (S) => 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

    Definition Classes
    Getter0
  81. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  82. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  83. final def or(s: S)(implicit ev: Heyting[A]): A

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

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

    Definition Classes
    Fold1
  84. final def over(f: (A) => B): (S) => T

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

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

    Definition Classes
    ATraversal_ → Setter0
  85. final def overF[F[_]](f: (A) => F[B])(s: S)(implicit arg0: Applicative[F]): F[T]

    synonym for traverse, flipped

    synonym for traverse, flipped

    Definition Classes
    Traversal0
  86. final def preview(s: S): Option[A]

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

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

    Definition Classes
    Fold0
  87. final def product(s: S)(implicit ev: MultiplicativeMonoid[A]): A

    the product of all foci of a Fold

    the product of all foci of a Fold

    Definition Classes
    Fold1
  88. final def sequence_[F[_]](s: S)(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

    Definition Classes
    Traversal1
  89. final def set(b: B): (S) => T

    set the modified focus of a Setter

    set the modified focus of a Setter

    Definition Classes
    Setter0
  90. final def sum(s: S)(implicit ev: AdditiveMonoid[A]): A

    the sum of all foci of a Fold

    the sum of all foci of a Fold

    Definition Classes
    Fold1
  91. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  92. final def toArray[AA >: A](s: S)(implicit ev: ClassTag[AA]): Array[AA]

    collect all the foci of a Fold into an Array

    collect all the foci of a Fold into an Array

    Definition Classes
    Fold1
  93. final def toBazaar: Bazaar[[α$4$, β$5$](α$4$) => β$5$, A, B, S, T]

    convert an ATraversal_ to a proptics.internal.Bazaar

  94. final def toList(s: S): List[A]

    synonym for viewAll

    synonym for viewAll

    Definition Classes
    Fold1
  95. def toString(): String
    Definition Classes
    AnyRef → Any
  96. final def traverse_[F[_], R](s: S)(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

    Definition Classes
    Traversal1
  97. final def unsafePartsOf(implicit ev0: Sellable[[α$15$, β$16$](α$15$) => β$16$, [β$17$, γ$18$, ε$19$]Bazaar[[α$13$, β$14$](α$13$) => β$14$, β$17$, γ$18$, Unit, ε$19$]], ev1: Aux[[α$20$, β$21$](α$20$) => β$21$, [β$22$]IndexedStateT[Eval, List[B], List[B], β$22$]]): Lens_[S, T, List[A], List[B]]

    convert a ATraversal into a Lens over a list of the ATraversal's foci

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

    Definition Classes
    Fold1
  99. final def view(s: S)(implicit ev: Monoid[A]): A

    synonym for fold

    synonym for fold

    Definition Classes
    Traversal1 → Fold1
  100. final def viewAll(s: S): List[A]

    collect all the foci of a Fold into aList

    collect all the foci of a Fold into aList

    Definition Classes
    Fold1
  101. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  102. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  103. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()

Inherited from Traversal1[S, T, A, B]

Inherited from Fold1[S, A]

Inherited from Fold0[S, A]

Inherited from FoldInstances

Inherited from Getter0[S, A]

Inherited from Serializable

Inherited from Traversal0[S, T, A, B]

Inherited from Setter0[S, T, A, B]

Inherited from AnyRef

Inherited from Any

Ungrouped