trait AppliedTraversal_[S, T, A, B] extends AppliedTraversal1[S, T, A, B]
- Source
- AppliedTraversal.scala
- Alphabetic
- By Inheritance
- AppliedTraversal_
- AppliedTraversal1
- AppliedFold1
- AppliedFold0
- AppliedGetter0
- AppliedTraversal0
- AppliedSetter0
- Serializable
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Abstract Value Members
- abstract val optic: Traversal_[S, T, A, B]
- Definition Classes
- AppliedTraversal_ → AppliedTraversal1 → AppliedFold1 → AppliedFold0 → AppliedGetter0 → AppliedTraversal0 → AppliedSetter0
- abstract val value: S
- Definition Classes
- AppliedTraversal_ → AppliedTraversal1 → AppliedFold1 → AppliedFold0 → AppliedGetter0 → AppliedTraversal0 → AppliedSetter0
Concrete Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def and(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
- AppliedFold1
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- final def any[R](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
- AppliedFold1
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- 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
- Definition Classes
- AppliedGetter0
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- 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
- Definition Classes
- AppliedGetter0
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def find(f: (A) => Boolean): Option[A]
find the first focus of a Getter that satisfies a predicate, if there is any
find the first focus of a Getter that satisfies a predicate, if there is any
- Definition Classes
- AppliedGetter0
- final def first: 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
- AppliedFold1
- 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
- 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
- Definition Classes
- 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
- Definition Classes
- AppliedFold1
- def foldMap[R](f: (A) => R)(implicit arg0: Monoid[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
- Definition Classes
- 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
- Definition Classes
- 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
- Definition Classes
- AppliedFold0
- final def forallH[R](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
- AppliedFold1
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def intercalate(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
- AppliedFold1
- final def isEmpty: Boolean
check if the Fold does not contain a focus
check if the Fold does not contain a focus
- Definition Classes
- AppliedFold0
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- 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
- Definition Classes
- AppliedFold1
- final def length: Int
the number of foci of a Fold
the number of foci of a Fold
- Definition Classes
- 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
- Definition Classes
- 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
- Definition Classes
- AppliedFold1
- final def mkString(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
- AppliedFold1
- final def mkString(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
- AppliedFold1
- final def mkString()(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
- AppliedFold1
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def nonEmpty: Boolean
check if the Fold contains a focus
check if the Fold contains a focus
- Definition Classes
- AppliedFold0
- 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
- Definition Classes
- 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
- Definition Classes
- AppliedGetter0
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def or(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
- AppliedFold1
- 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
- Definition Classes
- AppliedSetter0
- final def overF[F[_]](f: (A) => F[B])(implicit arg0: Applicative[F]): F[T]
synonym for traverse
synonym for traverse
- Definition Classes
- 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
- Definition Classes
- AppliedFold0
- final def product(implicit ev: MultiplicativeMonoid[A]): A
the product of all foci of a Fold
the product of all foci of a Fold
- Definition Classes
- AppliedFold1
- 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
- Definition Classes
- AppliedTraversal1
- final def set(b: B): T
set the modified foci of a Setter
set the modified foci of a Setter
- Definition Classes
- AppliedSetter0
- final def sum(implicit ev: AdditiveMonoid[A]): A
the sum of all foci of a Fold
the sum of all foci of a Fold
- Definition Classes
- AppliedFold1
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- 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
- Definition Classes
- AppliedFold1
- final def toList: List[A]
synonym for viewAll
synonym for viewAll
- Definition Classes
- AppliedFold1
- def toString(): String
- Definition Classes
- AnyRef → Any
- def traverse[F[_]](f: (A) => F[B])(implicit arg0: Applicative[F]): 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
- Definition Classes
- 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
- Definition Classes
- AppliedTraversal1
- final def unsafePartsOf(implicit ev0: Sellable[[α$2$, β$3$](α$2$) => β$3$, [β$4$, γ$5$, ε$6$]Bazaar[[α$0$, β$1$](α$0$) => β$1$, β$4$, γ$5$, Unit, ε$6$]], ev1: Aux[[α$7$, β$8$](α$7$) => β$8$, [β$9$]IndexedStateT[Eval, List[B], List[B], β$9$]]): AppliedLens_[S, T, List[A], List[B]]
convert a Traversal_ into a Lens_ over a list of the Traversal_'s foci
- 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
- AppliedFold1
- def view(implicit ev: Monoid[A]): A
synonym for fold
synonym for fold
- Definition Classes
- AppliedFold1
- final def viewAll: List[A]
collect all the foci of a Fold into aList
collect all the foci of a Fold into aList
- Definition Classes
- AppliedFold1
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()