o

proptics

IndexedTraversal

object IndexedTraversal

Source
IndexedTraversal.scala
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. IndexedTraversal
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Value Members

  1. final def apply[I, S, A](get: (S) => (A, I))(set: (S) => (A) => S): IndexedTraversal[I, S, A]

    create a monomorphic IndexedTraversal from a getter/setter pair

  2. final def dropWhile[F[_], I, A](predicate: (A) => Boolean)(implicit ev0: TraverseWithIndex[F, I]): IndexedTraversal[I, F[A], A]

    create a monomorphic IndexedTraversal_ that drop longest prefix of elements of a Traverse that satisfy a predicate

  3. final def dropWhileWithIndex[F[_], I, A](predicate: ((A, I)) => Boolean)(implicit ev0: TraverseWithIndex[F, I]): IndexedTraversal[I, F[A], A]

    create a monomorphic IndexedTraversal_ that drop longest prefix of elements of a Traverse that satisfy a predicate

  4. final def fromTraverse[F[_], A](implicit ev0: Traverse[F]): IndexedTraversal[Int, F[A], A]

    create a monomorphic IndexedTraversal_ from a Traverse that has an index ot type Int

  5. final def fromTraverseWithIndex[F[_], I, A](implicit ev0: TraverseWithIndex[F, I]): IndexedTraversal[I, F[A], A]

    create a monomorphic IndexedTraversal_ from a cats.Traverse

  6. final def single[F[_], A](i: Int)(implicit ev0: TraverseWithIndex[F, Int]): IndexedTraversal[Int, F[A], A]

    create a monomorphic IndexedTraversal_ that narrows the focus to a single element

  7. final def takeWhile[F[_], I, A](predicate: (A) => Boolean)(implicit ev0: TraverseWithIndex[F, I]): IndexedTraversal[I, F[A], A]

    create a monomorphic IndexedTraversal_ that takes the longest prefix of elements of a Traverse that satisfy a predicate

  8. final def takeWhileWithIndex[F[_], I, A](predicate: ((A, I)) => Boolean)(implicit ev0: TraverseWithIndex[F, I]): IndexedTraversal[I, F[A], A]

    create a monomorphic IndexedTraversal_ that takes the longest prefix of elements of a Traverse that satisfy a predicate

  9. final def traversal[I, S, A](to: (S) => ((A, I), (A) => S)): IndexedTraversal[I, S, A]

    create a monomorphic IndexedTraversal from a combined getter/setter.

    create a monomorphic IndexedTraversal from a combined getter/setter. synonym for apply

  10. final def wander[I, S, A](lensLikeWithIndex: LensLikeWithIndex[I, S, S, A, A]): IndexedTraversal[I, S, A]

    create a monomorphic IndexedTraversal from a rank 2 type traversal function