trait IndexedTraversal1[I, S, T, A, B] extends IndexedTraversal0[I, S, T, A, B] with IndexedFold0[I, S, A]
- Alphabetic
- By Inheritance
- IndexedTraversal1
- IndexedFold0
- FoldInstances
- IndexedGetter0
- IndexedTraversal0
- IndexedSetter0
- Serializable
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Abstract Value Members
- abstract def over(f: ((A, I)) => B): (S) => T
modify the focus type of an IndexedSetter using a function, resulting in a change of type to the full structure
modify the focus type of an IndexedSetter using a function, resulting in a change of type to the full structure
- Definition Classes
- IndexedSetter0
- abstract def traverse[F[_]](s: S)(f: ((A, I)) => 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
- IndexedTraversal0
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(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
- 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
- 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, 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
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- 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
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- 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
- final def first(s: S): Option[(A, I)]
synonym for preview
synonym for preview
- Definition Classes
- IndexedFold0
- 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
- 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
- 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
- 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
- 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
- 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
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- 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
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- 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
- final def length(s: S): Int
the number of foci of an IndexedFold
the number of foci of an IndexedFold
- Definition Classes
- IndexedFold0
- 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
- 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
- implicit def monoidBooleanDisj: Monoid[Disj[Boolean]]
- Definition Classes
- FoldInstances
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def nonEmpty(s: S): Boolean
check if the IndexedFold contains a focus
check if the IndexedFold contains a focus
- Definition Classes
- IndexedFold0
- 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
- 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
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- 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
- 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
- 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
- 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
- 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
- final def set(b: B): (S) => T
set the modified focus of an IndexedSetter
set the modified focus of an IndexedSetter
- Definition Classes
- 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
- Definition Classes
- IndexedFold0
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- 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
- 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
- def toString(): String
- Definition Classes
- AnyRef → Any
- 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
- 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
- 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
- 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()