monocle.syntax.ApplyIso.scala Maven / Gradle / Ivy
The newest version!
package monocle.syntax
import cats.{Eq, Functor}
import monocle.function.{At, Each, FilterIndex, Index}
import monocle.{std, Fold, Getter, Optional, PIso, PLens, POptional, PPrism, PSetter, PTraversal}
final case class ApplyIso[S, T, A, B](s: S, iso: PIso[S, T, A, B]) {
def get: A = iso.get(s)
def replace(b: B): T = iso.replace(b)(s)
def modify(f: A => B): T = iso.modify(f)(s)
def modifyF[F[_]: Functor](f: A => F[B]): F[T] = iso.modifyF(f)(s)
def exist(p: A => Boolean): S => Boolean = iso.exist(p)
def find(p: A => Boolean): S => Option[A] = iso.find(p)
@deprecated("use replace instead", since = "3.0.0-M1")
def set(b: B): T = replace(b)
def some[A1, B1](implicit ev1: A =:= Option[A1], ev2: B =:= Option[B1]): ApplyPrism[S, T, A1, B1] =
adapt[Option[A1], Option[B1]] composePrism (std.option.pSome)
private[monocle] def adapt[A1, B1](implicit evA: A =:= A1, evB: B =:= B1): ApplyIso[S, T, A1, B1] =
evB.substituteCo[ApplyIso[S, T, A1, *]](evA.substituteCo[ApplyIso[S, T, *, B]](this))
def andThen[C, D](other: PSetter[A, B, C, D]): ApplySetter[S, T, C, D] =
ApplySetter(s, iso.andThen(other))
def andThen[C](other: Fold[A, C]): ApplyFold[S, C] =
ApplyFold(s, iso.andThen(other))
def andThen[C](other: Getter[A, C]): ApplyGetter[S, C] =
ApplyGetter(s, iso.andThen(other))
def andThen[C, D](other: PTraversal[A, B, C, D]): ApplyTraversal[S, T, C, D] =
ApplyTraversal(s, iso.andThen(other))
def andThen[C, D](other: POptional[A, B, C, D]): ApplyOptional[S, T, C, D] =
ApplyOptional(s, iso.andThen(other))
def andThen[C, D](other: PPrism[A, B, C, D]): ApplyPrism[S, T, C, D] =
ApplyPrism(s, iso.andThen(other))
def andThen[C, D](other: PLens[A, B, C, D]): ApplyLens[S, T, C, D] =
ApplyLens(s, iso.andThen(other))
def andThen[C, D](other: PIso[A, B, C, D]): ApplyIso[S, T, C, D] =
ApplyIso(s, iso.andThen(other))
@deprecated("use andThen", since = "3.0.0-M1")
def composeSetter[C, D](other: PSetter[A, B, C, D]): ApplySetter[S, T, C, D] = andThen(other)
@deprecated("use andThen", since = "3.0.0-M1")
def composeFold[C](other: Fold[A, C]): ApplyFold[S, C] = andThen(other)
@deprecated("use andThen", since = "3.0.0-M1")
def composeGetter[C](other: Getter[A, C]): ApplyGetter[S, C] = andThen(other)
@deprecated("use andThen", since = "3.0.0-M1")
def composeTraversal[C, D](other: PTraversal[A, B, C, D]): ApplyTraversal[S, T, C, D] = andThen(other)
@deprecated("use andThen", since = "3.0.0-M1")
def composeOptional[C, D](other: POptional[A, B, C, D]): ApplyOptional[S, T, C, D] = andThen(other)
@deprecated("use andThen", since = "3.0.0-M1")
def composePrism[C, D](other: PPrism[A, B, C, D]): ApplyPrism[S, T, C, D] = andThen(other)
@deprecated("use andThen", since = "3.0.0-M1")
def composeLens[C, D](other: PLens[A, B, C, D]): ApplyLens[S, T, C, D] = andThen(other)
@deprecated("use andThen", since = "3.0.0-M1")
def composeIso[C, D](other: PIso[A, B, C, D]): ApplyIso[S, T, C, D] = andThen(other)
/** alias to composeTraversal */
@deprecated("use andThen", since = "3.0.0-M1")
def ^|->>[C, D](other: PTraversal[A, B, C, D]): ApplyTraversal[S, T, C, D] = andThen(other)
/** alias to composeOptional */
@deprecated("use andThen", since = "3.0.0-M1")
def ^|-?[C, D](other: POptional[A, B, C, D]): ApplyOptional[S, T, C, D] = andThen(other)
/** alias to composePrism */
@deprecated("use andThen", since = "3.0.0-M1")
def ^<-?[C, D](other: PPrism[A, B, C, D]): ApplyPrism[S, T, C, D] = andThen(other)
/** alias to composeLens */
@deprecated("use andThen", since = "3.0.0-M1")
def ^|->[C, D](other: PLens[A, B, C, D]): ApplyLens[S, T, C, D] = andThen(other)
/** alias to composeIso */
@deprecated("use andThen", since = "3.0.0-M1")
def ^<->[C, D](other: PIso[A, B, C, D]): ApplyIso[S, T, C, D] = andThen(other)
}
object ApplyIso {
implicit def applyIsoSyntax[S, A](self: ApplyIso[S, S, A, A]): ApplyIsoSyntax[S, A] =
new ApplyIsoSyntax(self)
}
/** Extension methods for monomorphic ApplyIso */
final case class ApplyIsoSyntax[S, A](private val self: ApplyIso[S, S, A, A]) extends AnyVal {
def each[C](implicit evEach: Each[A, C]): ApplyTraversal[S, S, C, C] =
self.andThen(evEach.each)
/** Select all the elements which satisfies the predicate.
* This combinator can break the fusion property see Optional.filter for more details.
*/
def filter(predicate: A => Boolean): ApplyOptional[S, S, A, A] =
self.andThen(Optional.filter(predicate))
def filterIndex[I, A1](predicate: I => Boolean)(implicit ev: FilterIndex[A, I, A1]): ApplyTraversal[S, S, A1, A1] =
self.andThen(ev.filterIndex(predicate))
def withDefault[A1: Eq](defaultValue: A1)(implicit evOpt: A =:= Option[A1]): ApplyIso[S, S, A1, A1] =
self.adapt[Option[A1], Option[A1]].andThen(std.option.withDefault(defaultValue))
def at[I, A1](i: I)(implicit evAt: At[A, i.type, A1]): ApplyLens[S, S, A1, A1] =
self.andThen(evAt.at(i))
def index[I, A1](i: I)(implicit evIndex: Index[A, I, A1]): ApplyOptional[S, S, A1, A1] =
self.andThen(evIndex.index(i))
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy