trait Getter[S, A] extends Fold[S, A]
A Getter can be seen as a glorified get method between a type S and a type A.
- Self Type
- Getter[S, A]
- Source
- Getter.scala
- Alphabetic
- By Inheritance
- Getter
- Fold
- Serializable
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Concrete Value Members
- def all(p: (A) => Boolean): (S) => Boolean
check if all targets satisfy the predicate
check if all targets satisfy the predicate
- Definition Classes
- Fold
- def andThen[B](other: Getter[A, B]): Getter[S, B]
- def andThen[B](other: Fold[A, B]): Fold[S, B]
- def asFold: Fold[S, A]
- def choice[S1](other: Getter[S1, A]): Getter[Either[S, S1], A]
join two Getter with the same target
- def exist(p: (A) => Boolean): (S) => Boolean
check if the target satisfies the predicate
- def find(p: (A) => Boolean): (S) => Option[A]
find if the target satisfies the predicate
- def fold(s: S)(implicit ev: Monoid[A]): A
combine all targets using a target's Monoid
combine all targets using a target's Monoid
- Definition Classes
- Fold
- def foldMap[M](f: (A) => M)(s: S)(implicit arg0: Monoid[M]): M
map each target to a Monoid and combine the results underlying representation of Fold, all Fold methods are defined in terms of foldMap
- def getAll(s: S): List[A]
get all the targets of a Fold
- def headOption(s: S): Option[A]
get the first target
get the first target
- Definition Classes
- Fold
- def index[I, A1](i: I)(implicit evIndex: Index[A, I, A1]): Fold[S, A1]
- def isEmpty(s: S): Boolean
check if there is no target
check if there is no target
- Definition Classes
- Fold
- def lastOption(s: S): Option[A]
get the last target
get the last target
- Definition Classes
- Fold
- def length(s: S): Int
calculate the number of targets
calculate the number of targets
- Definition Classes
- Fold
- def nonEmpty(s: S): Boolean
check if there is at least one target
check if there is at least one target
- Definition Classes
- Fold
- def some[A1](implicit ev1: =:=[A, Option[A1]]): Fold[S, A1]
- def split[S1, A1](other: Getter[S1, A1]): Getter[(S, S1), (A, A1)]
pair two disjoint Getter
- def to[C](f: (A) => C): Getter[S, C]
Compose with a function lifted into a Getter
- def zip[A1](other: Getter[S, A1]): Getter[S, (A, A1)]
Deprecated Value Members
- def first[B]: Getter[(S, B), (A, B)]
- Annotations
- @deprecated
- Deprecated
(Since version 3.0.0-M4) no replacement
- def left[C]: Getter[Either[S, C], Either[A, C]]
- def right[C]: Getter[Either[C, S], Either[C, A]]
- def second[B]: Getter[(B, S), (B, A)]
- Annotations
- @deprecated
- Deprecated
(Since version 3.0.0-M4) no replacement