Object

reftree.util

Optics

Related Doc: package util

Permalink

object Optics

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Optics
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. implicit final class RichLens[A, B] extends AnyVal

    Permalink

    Extra flattening for Lenses that point to optional values

  2. implicit final class RichOptional[A, B] extends AnyVal

    Permalink

    Convenience methods for Optionals

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. def collectAllLeft[A, B](projection: Prism[A, B])(implicit arg0: Unzip[A]): Traversal[A, B]

    Permalink

    Focuses on projections of all (projectable) elements of a recursive structure, in order of appearance in the structure (traversed depth-first, left-to-right).

  7. def collectAllLeft[A, B](projection: Optional[A, B])(implicit arg0: Unzip[A]): Traversal[A, B]

    Permalink

    Focuses on projections of all (projectable) elements of a recursive structure, in order of appearance in the structure (traversed depth-first, left-to-right).

  8. def collectFirst[A, B](projection: Prism[A, B])(implicit arg0: Unzip[A]): Optional[A, B]

    Permalink

    Focuses on the projection of the first (projectable) element of a recursive structure (traversal order is depth-first, left-to-right).

  9. def collectFirst[A, B](projection: Optional[A, B])(implicit arg0: Unzip[A]): Optional[A, B]

    Permalink

    Focuses on the projection of the first (projectable) element of a recursive structure (traversal order is depth-first, left-to-right).

  10. def collectLast[A, B](projection: Prism[A, B])(implicit arg0: Unzip[A]): Optional[A, B]

    Permalink

    Focuses on the projection of the last (projectable) element of a recursive structure (traversal order is depth-first, left-to-right).

  11. def collectLast[A, B](projection: Optional[A, B])(implicit arg0: Unzip[A]): Optional[A, B]

    Permalink

    Focuses on the projection of the last (projectable) element of a recursive structure (traversal order is depth-first, left-to-right).

  12. def collectLeftByIndex[A, B](projection: Prism[A, B])(implicit arg0: Unzip[A]): Lens[A, List[B]]

    Permalink

    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.

  13. def collectLeftByIndex[A, B](projection: Optional[A, B])(implicit arg0: Unzip[A]): Lens[A, List[B]]

    Permalink

    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.

  14. def collectLeftByKey[A, K, V](projection: Prism[A, V])(key: (A) ⇒ K)(implicit arg0: Unzip[A]): Lens[A, ListMap[K, V]]

    Permalink

    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.

  15. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  16. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  17. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  18. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  19. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  20. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  21. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  22. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  23. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  24. def only[A](pred: (A) ⇒ Boolean): Prism[A, A]

    Permalink

    A prism that matches values satisfying a predicate

  25. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  26. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  27. def tupleOptionalLeft[S, A, B, C](optionalA: Optional[S, A], optionalB: Optional[S, B], optionalC: Optional[S, C]): Optional[S, (A, B, C)]

    Permalink

    Tuple three optionals with a common source type

  28. def tupleOptionalLeft[S, A, B](optionalA: Optional[S, A], optionalB: Optional[S, B]): Optional[S, (A, B)]

    Permalink

    Tuple two optionals with a common source type

  29. def unzip[A](immediateChildren: Optional[A, List[A]]): Unzip[A]

    Permalink

    Derive a zipper.Unzip instance for a type A, given an Optional that extracts immediate children of a node of type A

  30. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  31. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  32. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped