Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $
You can buy this project and download/modify it how often you want.
lucuma.ui.optics.package.scala Maven / Gradle / Ivy
// Copyright (c) 2016-2023 Association of Universities for Research in Astronomy, Inc. (AURA)
// For license information see LICENSE or https://opensource.org/licenses/BSD-3-Clause
package lucuma.ui.optics
import cats.syntax.all.*
import eu.timepit.refined.types.numeric.NonNegInt
import eu.timepit.refined.types.string.NonEmptyString
import lucuma.core.optics.SplitEpi
import lucuma.core.syntax.time.*
import lucuma.core.util.TimeSpan
import monocle.Iso
import monocle.Lens
import scala.collection.immutable.SortedSet
extension [S, A](l1: Lens[S, A])
// Lenses must be disjoint (not overlap), or the result will be unsafe.
// See https://github.com/optics-dev/Monocle/issues/545
def disjointZip[B](l2: Lens[S, B]): Lens[S, (A, B)] =
Lens((s: S) => (l1.get(s), l2.get(s)))((ab: (A, B)) =>
(s: S) => l2.replace(ab._2)(l1.replace(ab._1)(s))
)
extension [S, A, B](lenses: (Lens[S, A], Lens[S, B]))
def disjointZip: Lens[S, (A, B)] = lenses._1.disjointZip(lenses._2)
extension [S, A, B, C](lenses: (Lens[S, A], Lens[S, B], Lens[S, C]))
def disjointZip: Lens[S, (A, B, C)] =
((lenses._1, lenses._2).disjointZip, lenses._3).disjointZip
.andThen(Iso[((A, B), C), (A, B, C)] { case ((a, b), c) => (a, b, c) } { case (a, b, c) =>
((a, b), c)
})
extension [S, A, B, C, D](lenses: (Lens[S, A], Lens[S, B], Lens[S, C], Lens[S, D]))
def disjointZip: Lens[S, (A, B, C, D)] =
((lenses._1, lenses._2, lenses._3).disjointZip, lenses._4).disjointZip
.andThen(Iso[((A, B, C), D), (A, B, C, D)] { case ((a, b, c), d) => (a, b, c, d) } {
case (a, b, c, d) => ((a, b, c), d)
})
extension [S, A, B, C, D, E](lenses: (Lens[S, A], Lens[S, B], Lens[S, C], Lens[S, D], Lens[S, E]))
def disjointZip: Lens[S, (A, B, C, D, E)] =
((lenses._1, lenses._2, lenses._3, lenses._4).disjointZip, lenses._5).disjointZip
.andThen(Iso[((A, B, C, D), E), (A, B, C, D, E)] { case ((a, b, c, d), e) =>
(a, b, c, d, e)
} { case (a, b, c, d, e) =>
((a, b, c, d), e)
})
// This only behaves as a lawful lens as long as A and B are both null or both set.
def unsafeDisjointOptionZip[S, A, B](
l1: Lens[S, Option[A]],
l2: Lens[S, Option[B]]
): Lens[S, Option[(A, B)]] =
Lens((s: S) => (l1.get(s), l2.get(s)).tupled)((ab: Option[(A, B)]) =>
(s: S) => l2.replace(ab.map(_._2))(l1.replace(ab.map(_._1))(s))
)
extension [A, B](iso: Iso[A, B])
def option: Iso[Option[A], Option[B]] =
Iso[Option[A], Option[B]](_.map(iso.get))(_.map(iso.reverseGet))
val OptionNonEmptyStringIso: Iso[Option[NonEmptyString], String] =
Iso[Option[NonEmptyString], String](_.foldMap(_.value))(s => NonEmptyString.from(s).toOption)
// Note: truncates to Int.MaxValue - shouldn't have durations longer than that...
val TimeSpanSecondsSplitEpi: SplitEpi[TimeSpan, NonNegInt] = SplitEpi(
ts => NonNegInt.unsafeFrom(math.min(ts.toSeconds.longValue, Int.MaxValue.toLong).toInt),
secs => TimeSpan.unsafeFromDuration(secs.value.toLong.seconds)
)
def SortedSetFromList[A: Ordering]: SplitEpi[List[A], SortedSet[A]] =
SplitEpi[List[A], SortedSet[A]](SortedSet.from(_), _.toList)
