object Optics
- Alphabetic
- By Inheritance
- Optics
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Type Members
- implicit final class RichLens[A, B] extends AnyVal
Extra flattening for Lenses that point to optional values
- implicit final class RichOptional[A, B] extends AnyVal
Convenience methods for Optionals
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 asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @IntrinsicCandidate() @native()
- def collectAllLeft[A, B](projection: Prism[A, B])(implicit arg0: Unzip[A]): Traversal[A, B]
Focuses on projections of all (projectable) elements of a recursive structure, in order of appearance in the structure (traversed depth-first, left-to-right).
- def collectAllLeft[A, B](projection: Optional[A, B])(implicit arg0: Unzip[A]): Traversal[A, B]
Focuses on projections of all (projectable) elements of a recursive structure, in order of appearance in the structure (traversed depth-first, left-to-right).
- def collectFirst[A, B](projection: Prism[A, B])(implicit arg0: Unzip[A]): Optional[A, B]
Focuses on the projection of the first (projectable) element of a recursive structure (traversal order is depth-first, left-to-right).
- def collectFirst[A, B](projection: Optional[A, B])(implicit arg0: Unzip[A]): Optional[A, B]
Focuses on the projection of the first (projectable) element of a recursive structure (traversal order is depth-first, left-to-right).
- def collectLast[A, B](projection: Prism[A, B])(implicit arg0: Unzip[A]): Optional[A, B]
Focuses on the projection of the last (projectable) element of a recursive structure (traversal order is depth-first, left-to-right).
- def collectLast[A, B](projection: Optional[A, B])(implicit arg0: Unzip[A]): Optional[A, B]
Focuses on the projection of the last (projectable) element of a recursive structure (traversal order is depth-first, left-to-right).
- def collectLeftByIndex[A, B](projection: Prism[A, B])(implicit arg0: Unzip[A]): Lens[A, List[B]]
Focuses on projections of all (projectable) elements of a recursive structure, in order of appearance in the structure (traversed depth-first, left-to-right).
Focuses on projections of all (projectable) elements of a recursive structure, in order of appearance in the structure (traversed depth-first, left-to-right).
This lens assumes that the number of elements is preserved on update.
- def collectLeftByIndex[A, B](projection: Optional[A, B])(implicit arg0: Unzip[A]): Lens[A, List[B]]
Focuses on projections of all (projectable) elements of a recursive structure, in order of appearance in the structure (traversed depth-first, left-to-right).
Focuses on projections of all (projectable) elements of a recursive structure, in order of appearance in the structure (traversed depth-first, left-to-right).
This lens assumes that the number of elements is preserved on update.
- def collectLeftByKey[A, K, V](projection: Prism[A, V])(key: (A) => K)(implicit arg0: Unzip[A]): Lens[A, ListMap[K, V]]
Focuses on projections of all (projectable) elements of a recursive structure, where each projection is pointed to by a key, obtained from the element via a key function.
Focuses on projections of all (projectable) elements of a recursive structure, where each projection is pointed to by a key, obtained from the element via a key function.
The projections are arranged in the resulting map in order of appearance in the structure (traversed depth-first, left-to-right).
On update, elements with missing keys will be deleted, and projections with new keys will be inserted at the root of the structure.
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @IntrinsicCandidate() @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @IntrinsicCandidate() @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @IntrinsicCandidate() @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @IntrinsicCandidate() @native()
- def only[A](pred: (A) => Boolean): Prism[A, A]
A prism that matches values satisfying a predicate
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- def tupleOptionalLeft[S, A, B, C](optionalA: Optional[S, A], optionalB: Optional[S, B], optionalC: Optional[S, C]): Optional[S, (A, B, C)]
Tuple three optionals with a common source type
- def tupleOptionalLeft[S, A, B](optionalA: Optional[S, A], optionalB: Optional[S, B]): Optional[S, (A, B)]
Tuple two optionals with a common source type
- def unzip[A](immediateChildren: Optional[A, List[A]]): Unzip[A]
Derive a zipper.Unzip instance for a type
A
, given an Optional that extracts immediate children of a node of typeA
- 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()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
(Since version 9)