abstract class AnAffineTraversal_[S, T, A, B] extends AffineTraversal0[S, T, A, B]

AnAffineTraversal_ has at most one focus, but is not a Prism_, you cannot use it to construct a value.

AnAffineTraversal_ is an AffineTraversal_ with fixed type proptics.internal.Stall cats.arrow.Profunctor

S

the source of an AnAffineTraversal_

T

the modified source of an AnAffineTraversal_

A

the focus of an AnAffineTraversal_

B

the modified focus of an AnAffineTraversal_

Self Type
AnAffineTraversal_[S, T, A, B]
Source
AnAffineTraversal.scala
Linear Supertypes
AffineTraversal0[S, T, A, B], 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. AnAffineTraversal_
  2. AffineTraversal0
  3. Fold0
  4. FoldInstances
  5. Getter0
  6. Serializable
  7. Traversal0
  8. Setter0
  9. AnyRef
  10. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new AnAffineTraversal_()

Abstract Value Members

  1. abstract def viewOrModify(s: S): Either[T, A]

    view the focus or return the modified source of an AffineTraversal

    view the focus or return the modified source of an AffineTraversal

    Definition Classes
    AffineTraversal0

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 andThen[I, C, D](other: IndexedFold_[I, A, B, C, D]): IndexedFold_[I, S, T, C, D]

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    compose an AnAffineTraversal_ with a Getter_, having this AnAffineTraversal_ applied first

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  23. final def asAffineTraversal: AffineTraversal_[S, T, A, B]

    transform an AnAffineTraversal_ to an AffineTraversal_

  24. final def asFold: Fold_[S, T, A, B]

    transform an AnAffineTraversal_ to a Fold_

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  46. 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
  47. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  48. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  49. 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
  50. final def failover[F[_]](f: (A) => B)(s: S)(implicit ev0: Choice[[β$1$, γ$2$]Kleisli[[β$0$](Disj[Boolean], β$0$), β$1$, γ$2$]], ev1: Strong[[β$4$, γ$5$]Kleisli[[β$3$](Disj[Boolean], β$3$), β$4$, γ$5$]], ev2: Alternative[F]): F[T]

    try to map a function over this AnAffineTraversal_, failing if the AnAffineTraversal_ has no focus.

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

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

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

    Definition Classes
    AffineTraversal0 → Getter0
  53. final def focus[C, D](f: (A) => C): Fold_[S, T, C, D]

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

  54. def foldMap[R](s: S)(f: (A) => R)(implicit arg0: Monoid[R]): R
    Attributes
    protected
    Definition Classes
    Traversal0
  55. 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
  56. 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
    Fold0
  57. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  58. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  59. 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
  60. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  61. implicit def monoidBooleanDisj: Monoid[Disj[Boolean]]
    Definition Classes
    FoldInstances
  62. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  63. final def nonEmpty(s: S): Boolean

    check if the Fold contains a focus

    check if the Fold contains a focus

    Definition Classes
    Fold0
  64. 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
  65. 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
  66. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  67. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  68. final def over(f: (A) => B): (S) => T

    modify the focus type of an AnAffineTraversal_ using a function, resulting in a change of type to the full structure

    modify the focus type of an AnAffineTraversal_ using a function, resulting in a change of type to the full structure

    Definition Classes
    AnAffineTraversal_ → Setter0
  69. 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
  70. final def overOption(f: (A) => B): (S) => Option[T]

    modify the focus of an AffineTraversal using a function conditionally if it is not None, resulting in a change of type to the full structure

    modify the focus of an AffineTraversal using a function conditionally if it is not None, resulting in a change of type to the full structure

    Definition Classes
    AffineTraversal0
  71. 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
  72. final def set(b: B): (S) => T

    set the modified focus of a Setter

    set the modified focus of a Setter

    Definition Classes
    Setter0
  73. final def setOption(b: B): (S) => Option[T]

    set the focus of an AffineTraversal conditionally if it is not None

    set the focus of an AffineTraversal conditionally if it is not None

    Definition Classes
    AffineTraversal0
  74. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  75. final def toStall: Stall[A, B, S, T]

    convert an AnAffineTraversal_ to an proptics.internal.Stall

  76. def toString(): String
    Definition Classes
    AnyRef → Any
  77. final def traverse[F[_]](s: S)(f: (A) => F[B])(implicit arg0: Applicative[F]): F[T]

    modify the focus type of an AnAffineTraversal_ using a cats.Functor, resulting in a change of type to the full structure

    modify the focus type of an AnAffineTraversal_ using a cats.Functor, resulting in a change of type to the full structure

    Definition Classes
    AnAffineTraversal_ → Traversal0
  78. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  79. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  80. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  81. final def withAffineTraversal[R](f: ((S) => Either[T, A]) => ((S) => (B) => T) => R): R

    convert an AnAffineTraversal_ to the pair of functions that characterize it

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

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