-
Notifications
You must be signed in to change notification settings - Fork 3
/
Resolver.scala
251 lines (191 loc) · 9.5 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
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
/*
* Copyright 2023 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.data._
import cats._
import cats.implicits._
import gql._
/** Resolver is one of the core abstractions of gql. The resolver class contains a collection of methods to aid comosition.
*
* A Resolver forms an [[cats.arrow.Arrow]]; it can lift a function I => O. Resolver also forms [[cats.arrow.Choice]] which allows
* conditional branching.
*
* Resolver also forms an [[cats.Applicative]] instance that sequences the operations.
*
* Some methods are only available resolvers that have a certain shape. Consider taking a look at the companion object for more
* information.
*/
final class Resolver[+F[_], -I, +O](private[gql] val underlying: Step[F, I, O]) {
def andThen[F2[x] >: F[x], O2](that: Resolver[F2, O, O2]): Resolver[F2, I, O2] =
new Resolver(Step.compose(underlying, that.underlying))
def compose[F2[x] >: F[x], I1 <: I, I2](that: Resolver[F2, I2, I1]): Resolver[F2, I2, O] =
that andThen this
def map[O2](f: O => O2): Resolver[F, I, O2] =
this andThen Resolver.lift(f)
def evalMap[F2[x] >: F[x], O2](f: O => F2[O2]): Resolver[F2, I, O2] =
this andThen Resolver.liftF(f)
def evalContramap[F2[x] >: F[x], I1 <: I, I2](f: I2 => F2[I1]): Resolver[F2, I2, O] =
Resolver.liftF(f) andThen this
def emap[O2](f: O => Ior[String, O2]): Resolver[F, I, O2] =
this.map(f) andThen (new Resolver(Step.embedError))
def first[C]: Resolver[F, (I, C), (O, C)] =
new Resolver(Step.first(underlying))
def arg[A](arg: Arg[A]): Resolver[F, I, (A, O)] =
this andThen Resolver.argument[F, O, A](arg).tupleIn
def contraArg[A, I2](arg: Arg[A])(implicit ev: (A, I2) <:< I): Resolver[F, I2, O] =
Resolver.id[F, I2].arg(arg) andThen this.contramap(ev.apply)
def meta: Resolver[F, I, (FieldMeta, O)] =
this andThen Resolver.meta[F, O].tupleIn
def streamMap[F2[x] >: F[x], O2](f: O => fs2.Stream[F2, O2]): Resolver[F2, I, O2] =
this.map(f).embedStream
def sequentialStreamMap[F2[x] >: F[x], O2](f: O => fs2.Stream[F2, O2]): Resolver[F2, I, O2] =
this.map(f).embedSequentialStream
def step: Step[F, I, O] = underlying
def covaryAll[F2[x] >: F[x], O2 >: O]: Resolver[F2, I, O2] = this
}
object Resolver extends ResolverInstances {
def liftFull[F[_], I, O](f: I => O): Resolver[F, I, O] =
new Resolver(Step.lift(f))
final class PartiallyAppliedLift[F[_], I](private val dummy: Boolean = true) extends AnyVal {
def apply[O](f: I => O): Resolver[F, I, O] = liftFull(f)
}
def lift[F[_], I]: PartiallyAppliedLift[F, I] = new PartiallyAppliedLift[F, I]
def id[F[_], I]: Resolver[F, I, I] =
lift(identity)
def liftFFull[F[_], I, O](f: I => F[O]): Resolver[F, I, O] =
liftFull(f).andThen(new Resolver(Step.embedEffect))
final class PartiallAppliedLiftF[F[_], I](private val dummy: Boolean = true) extends AnyVal {
def apply[O](f: I => F[O]): Resolver[F, I, O] = liftFFull(f)
}
def liftF[F[_], I]: PartiallAppliedLiftF[F, I] = new PartiallAppliedLiftF[F, I]
def argument[F[_], I <: Any, A](arg: Arg[A]): Resolver[F, I, A] =
new Resolver(Step.argument(arg))
def meta[F[_], I <: Any]: Resolver[F, I, FieldMeta] =
new Resolver(Step.getMeta)
def streamFull[F[_], I, O](f: I => fs2.Stream[F, O]): Resolver[F, I, O] =
liftFull(f).andThen(new Resolver(Step.embedStream))
final class PartiallyAppliedStream[F[_], I](private val dummy: Boolean = true) extends AnyVal {
def apply[O](f: I => fs2.Stream[F, O]): Resolver[F, I, O] = streamFull(f)
}
def stream[F[_], I]: PartiallyAppliedStream[F, I] = new PartiallyAppliedStream[F, I]
def batch[F[_], K, V](f: Set[K] => F[Map[K, V]]): State[gql.SchemaState[F], Resolver[F, Set[K], Map[K, V]]] =
Step.batch[F, K, V](f).map(new Resolver(_))
implicit class RethrowOps[F[_], I, O](private val self: Resolver[F, I, Ior[String, O]]) extends AnyVal {
def rethrow: Resolver[F, I, O] =
self andThen (new Resolver(Step.embedError))
}
implicit class InvariantOps[F[_], I, O](private val self: Resolver[F, I, O]) extends AnyVal {
def choose[I2, O2](that: Resolver[F, I2, O2]): Resolver[F, Either[I, I2], Either[O, O2]] =
new Resolver(Step.choose(self.underlying, that.underlying))
def choice[I2](that: Resolver[F, I2, O]): Resolver[F, Either[I, I2], O] =
choose[I2, O](that).map(_.merge)
def skippable: Resolver[F, Either[I, O], O] =
this.choice(Resolver.id[F, O])
def skipThis[I2](verify: Resolver[F, I2, Either[I, O]]): Resolver[F, I2, O] =
verify andThen self.skippable
def skipThisWith[I2](f: Resolver[F, I2, I2] => Resolver[F, I2, Either[I, O]]): Resolver[F, I2, O] =
skipThis[I2](f(Resolver.id[F, I2]))
def continue[O2](f: Resolver[F, O, O] => Resolver[F, O, O2]): Resolver[F, I, O2] =
self andThen f(Resolver.id[F, O])
def contramap[I2](f: I2 => I): Resolver[F, I2, O] =
Resolver.lift(f) andThen self
def evalContramap[I2](f: I2 => F[I]): Resolver[F, I2, O] =
Resolver.liftF(f) andThen self
def econtraMap[I2](f: I2 => Ior[String, I]): Resolver[F, I2, O] =
(new Resolver(Step.embedError[F, I])).contramap[I2](f) andThen self
def tupleIn: Resolver[F, I, (O, I)] =
self.first[I].contramap[I](i => (i, i))
}
implicit class SkipThatInvariantOps[F[_], I, I2, O](private val self: Resolver[F, I, Either[I2, O]]) extends AnyVal {
def skipThat(compute: Resolver[F, I2, O]): Resolver[F, I, O] =
compute skipThis self
def skipThatWith(f: Resolver[F, I2, I2] => Resolver[F, I2, O]): Resolver[F, I, O] =
skipThat(f(Resolver.id[F, I2]))
}
implicit class StreamOps[F[_], I, O](private val self: Resolver[F, I, fs2.Stream[F, O]]) extends AnyVal {
def embedStream: Resolver[F, I, O] =
self andThen new Resolver(Step.embedStream)
def embedSequentialStream: Resolver[F, I, O] =
self andThen new Resolver(Step.embedStreamFull(signal = false))
}
implicit class ResolverBatchOps[F[_], K, V](private val r: Resolver[F, Set[K], Map[K, V]]) extends AnyVal {
def optionals[G[_]: Foldable: Functor]: Resolver[F, G[K], G[Option[V]]] =
r.contramap[G[K]](_.toList.toSet).tupleIn.map { case (m, g) => g.map(m.get) }
def values[G[_]: Foldable: FunctorFilter: Functor]: Resolver[F, G[K], G[V]] =
optionals[G].map(_.collect { case Some(v) => v })
def force[G[_]: Foldable: FunctorFilter: Functor](implicit
S: ShowMissingKeys[K]
): Resolver[F, G[K], G[V]] =
r.contramap[G[K]](_.toList.toSet).tupleIn.map { case (m, g) => g.map(k => (k, m.get(k))) }.emap { gov =>
val errs = gov.collect { case (k, None) => k }
errs.toList.toNel match {
case None => gov.collect { case (_, Some(v)) => v }.rightIor[String]
case Some(xs) => S.showMissingKeys(xs).leftIor[G[V]]
}
}
def optional: Resolver[F, K, Option[V]] =
optionals[Id]
def forceOne(implicit S: ShowMissingKeys[K]): Resolver[F, K, V] =
optional.tupleIn.emap {
case (Some(v), _) => v.rightIor[String]
case (None, k) => S.showMissingKeys(NonEmptyList.one(k)).leftIor[V]
}
def forceNE[G[_]: NonEmptyTraverse](implicit S: ShowMissingKeys[K]): Resolver[F, G[K], G[V]] =
force[List]
.contramap[G[K]](_.toList)
.tupleIn
.emap { case (v, ks) =>
val varr = v.toVector
ks.mapWithIndex { case (_, i) => varr(i) }.rightIor
}
}
}
trait ShowMissingKeys[A] {
def showMissingKeys(xs: NonEmptyList[A]): String
}
object ShowMissingKeys {
def apply[A](implicit ev: ShowMissingKeys[A]): ShowMissingKeys[A] = ev
def showFull[A](show: NonEmptyList[A] => String): ShowMissingKeys[A] =
new ShowMissingKeys[A] {
def showMissingKeys(xs: NonEmptyList[A]): String = show(xs)
}
def showForKey[A: Show](prefix: String): ShowMissingKeys[A] =
showFull(xs => s"$prefix: ${xs.map(_.show).mkString_(", ")}")
def show[A](showKey: A => String, prefix: String): ShowMissingKeys[A] =
showForKey[A](prefix)(Show.show(showKey))
}
trait ResolverInstances {
import cats.arrow._
implicit def arrowChoiceForResolver[F[_]]: ArrowChoice[Resolver[F, *, *]] = new ArrowChoice[Resolver[F, *, *]] {
override def choose[A, B, C, D](f: Resolver[F, A, C])(g: Resolver[F, B, D]): Resolver[F, Either[A, B], Either[C, D]] =
f.choose(g)
override def compose[A, B, C](f: Resolver[F, B, C], g: Resolver[F, A, B]): Resolver[F, A, C] =
f.compose(g)
override def first[A, B, C](fa: Resolver[F, A, B]): Resolver[F, (A, C), (B, C)] =
fa.first[C]
override def lift[A, B](f: A => B): Resolver[F, A, B] = Resolver.lift(f)
}
implicit def applicativeForResolver[F[_], I]: Applicative[Resolver[F, I, *]] = new Applicative[Resolver[F, I, *]] {
override def ap[A, B](ff: Resolver[F, I, A => B])(fa: Resolver[F, I, A]): Resolver[F, I, B] =
ff.tupleIn andThen
fa
.contramap[(A => B, I)] { case (_, i) => i }
.tupleIn
.map { case (a, (f, _)) => f(a) }
override def pure[A](x: A): Resolver[F, I, A] =
Resolver.lift(_ => x)
}
}