-
Notifications
You must be signed in to change notification settings - Fork 3
/
Resolver.scala
82 lines (67 loc) · 2.77 KB
/
Resolver.scala
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
/*
* Copyright 2022 Valdemar Grange
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package gql.resolver
import cats._
import cats.data._
import fs2.Stream
trait Resolver[F[_], -I, A] {
def mapK[G[_]: Functor](fk: F ~> G): Resolver[G, I, A]
def contramap[B](g: B => I): Resolver[F, B, A]
}
final case class FallibleResolver[F[_], I, A](resolve: I => F[Ior[String, A]]) extends Resolver[F, I, A] {
def mapK[G[_]: Functor](fk: F ~> G): FallibleResolver[G, I, A] =
FallibleResolver(resolve.andThen(fk.apply))
def contramap[B](g: B => I): FallibleResolver[F, B, A] =
FallibleResolver(g andThen resolve)
}
final case class EffectResolver[F[_], I, A](resolve: I => F[A]) extends Resolver[F, I, A] {
def mapK[G[_]: Functor](fk: F ~> G): EffectResolver[G, I, A] =
EffectResolver(resolve.andThen(fk.apply))
def contramap[B](g: B => I): EffectResolver[F, B, A] =
EffectResolver(g andThen resolve)
}
final case class PureResolver[F[_], I, A](resolve: I => A) extends Resolver[F, I, A] {
override def mapK[G[_]: Functor](fk: F ~> G): PureResolver[G, I, A] =
PureResolver(resolve)
def contramap[B](g: B => I): PureResolver[F, B, A] =
PureResolver(g andThen resolve)
}
final case class StreamResolver[F[_], I, A](
stream: I => Stream[F, IorNec[String, A]]
) extends Resolver[F, I, A] {
override def mapK[G[_]: Functor](fk: F ~> G): Resolver[G, I, A] =
StreamResolver(stream.andThen(_.translate(fk)))
override def contramap[B](g: B => I): Resolver[F, B, A] =
StreamResolver[F, B, A](i => stream(g(i)))
}
final case class CompositionResolver[F[_], I, A, O](
left: Resolver[F, I, A],
right: Resolver[F, A, O]
) extends Resolver[F, I, O] {
override def mapK[G[_]: Functor](fk: F ~> G): Resolver[G, I, O] =
CompositionResolver(left.mapK(fk), right.mapK(fk))
override def contramap[B](g: B => I): Resolver[F, B, O] =
CompositionResolver(left.contramap(g), right)
}
final case class CacheResolver[F[_], I, I2, O](
first: I => F[Either[I2, O]],
fallback: Resolver[F, I2, O]
) extends Resolver[F, I, O] {
override def mapK[G[_]: Functor](fk: F ~> G): Resolver[G, I, O] =
CacheResolver(first.andThen(fk.apply), fallback.mapK(fk))
override def contramap[B](g: B => I): Resolver[F, B, O] =
CacheResolver(i => first(g(i)), fallback)
}