-
Notifications
You must be signed in to change notification settings - Fork 154
/
collection.scala
325 lines (260 loc) · 10.5 KB
/
collection.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
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
package eu.timepit.refined
import eu.timepit.refined.api.{Inference, Result, Validate}
import eu.timepit.refined.api.Inference.==>
import eu.timepit.refined.boolean.Not
import eu.timepit.refined.collection._
import eu.timepit.refined.generic.Equal
import eu.timepit.refined.internal.Resources
import eu.timepit.refined.numeric.{GreaterEqual, LessEqual}
import shapeless.Witness
/** Module for collection predicates. */
object collection extends CollectionValidate with CollectionInference {
/**
* Predicate that counts the number of elements in a `Traversable`
* which satisfy the predicate `PA` and passes the result to the numeric
* predicate `PC`.
*/
final case class Count[PA, PC](pa: PA, pc: PC)
/** Predicate that checks if a `Traversable` is empty. */
final case class Empty()
/**
* Predicate that checks if the predicate `P` holds for all elements of a
* `Traversable`.
*/
final case class Forall[P](p: P)
/**
* Predicate that checks if the predicate `P` holds for the first element
* of a `Traversable`.
*/
final case class Head[P](p: P)
/**
* Predicate that checks if the predicate `P` holds for the element at
* index `N` of a sequence.
*/
final case class Index[N, P](n: N, p: P)
/**
* Predicate that checks if the predicate `P` holds for all but the last
* element of a `Traversable`.
*/
final case class Init[P](p: P)
/**
* Predicate that checks if the predicate `P` holds for the last element
* of a `Traversable`.
*/
final case class Last[P](p: P)
/**
* Predicate that checks if the size of a `Traversable` satisfies the
* predicate `P`.
*/
final case class Size[P](p: P)
/**
* Predicate that checks if the predicate `P` holds for all but the first
* element of a `Traversable`.
*/
final case class Tail[P](p: P)
/**
* Predicate that checks if a `Traversable` contains a value
* equal to `U`.
*/
type Contains[U] = Exists[Equal[U]]
/**
* Predicate that checks if the predicate `P` holds for some elements of a
* `Traversable`.
*/
type Exists[P] = Not[Forall[Not[P]]]
/**
* Predicate that checks if the size of a `Traversable` is greater than
* or equal to `N`.
*/
type MinSize[N] = Size[GreaterEqual[N]]
/**
* Predicate that checks if the size of a `Traversable` is less than
* or equal to `N`.
*/
type MaxSize[N] = Size[LessEqual[N]]
/** Predicate that checks if a `Traversable` is not empty. */
type NonEmpty = Not[Empty]
}
private[refined] trait CollectionValidate {
implicit def countValidate[A, PA, RA, PC, RC, T](
implicit va: Validate.Aux[A, PA, RA],
vc: Validate.Aux[Int, PC, RC],
ev: T => Traversable[A]
): Validate.Aux[T, Count[PA, PC], Count[List[va.Res], vc.Res]] =
new Validate[T, Count[PA, PC]] {
override type R = Count[List[va.Res], vc.Res]
override def validate(t: T): Res = {
val ra = t.toList.map(va.validate)
val rc = vc.validate(ra.count(_.isPassed))
rc.as(Count(ra, rc))
}
override def showExpr(t: T): String =
vc.showExpr(count(t))
override def showResult(t: T, r: Res): String = {
val c = count(t)
val expr = t.map(va.showExpr).mkString("count(", ", ", ")")
Resources.predicateTakingResultDetail(s"$expr = $c", r, vc.showResult(c, r.detail.pc))
}
private def count(t: T): Int =
t.count(va.isValid)
}
implicit def emptyValidate[T](implicit ev: T => Traversable[_]): Validate.Plain[T, Empty] =
Validate.fromPredicate(_.isEmpty, t => s"isEmpty($t)", Empty())
implicit def forallValidate[A, P, R, T[a] <: Traversable[a]](
implicit v: Validate.Aux[A, P, R]
): Validate.Aux[T[A], Forall[P], Forall[List[v.Res]]] =
new Validate[T[A], Forall[P]] {
override type R = Forall[List[v.Res]]
override def validate(t: T[A]): Res = {
val rt = t.toList.map(v.validate)
Result.fromBoolean(rt.forall(_.isPassed), Forall(rt))
}
override def showExpr(t: T[A]): String =
t.map(v.showExpr).mkString("(", " && ", ")")
}
implicit def forallValidateView[A, P, R, T](
implicit v: Validate.Aux[A, P, R],
ev: T => Traversable[A]
): Validate.Aux[T, Forall[P], Forall[List[v.Res]]] =
forallValidate[A, P, R, Traversable].contramap(ev)
implicit def headValidate[A, P, R, T[a] <: Traversable[a]](
implicit v: Validate.Aux[A, P, R]
): Validate.Aux[T[A], Head[P], Head[Option[v.Res]]] =
new Validate[T[A], Head[P]] {
override type R = Head[Option[v.Res]]
override def validate(t: T[A]): Res = {
val ra = t.headOption.map(v.validate)
Result.fromBoolean(ra.fold(false)(_.isPassed), Head(ra))
}
override def showExpr(t: T[A]): String =
optElemShowExpr(t.headOption, v.showExpr)
override def showResult(t: T[A], r: Res): String =
optElemShowResult(t.headOption, r.detail.p, (a: A) => s"head($t) = $a", v.showResult)
}
implicit def headValidateView[A, P, R, T](
implicit v: Validate.Aux[A, P, R],
ev: T => Traversable[A]
): Validate.Aux[T, Head[P], Head[Option[v.Res]]] =
headValidate[A, P, R, Traversable].contramap(ev)
implicit def indexValidate[A, P, R, N <: Int, T](
implicit v: Validate.Aux[A, P, R],
ev: T => PartialFunction[Int, A],
wn: Witness.Aux[N]
): Validate.Aux[T, Index[N, P], Index[N, Option[v.Res]]] =
new Validate[T, Index[N, P]] {
override type R = Index[N, Option[v.Res]]
override def validate(t: T): Res = {
val ra = t.lift(wn.value).map(v.validate)
Result.fromBoolean(ra.fold(false)(_.isPassed), Index(wn.value, ra))
}
override def showExpr(t: T): String =
optElemShowExpr(t.lift(wn.value), v.showExpr)
override def showResult(t: T, r: Res): String =
optElemShowResult(t.lift(wn.value),
r.detail.p,
(a: A) => s"index($t, ${wn.value}) = $a",
v.showResult)
}
implicit def initValidate[A, P, R, T[a] <: Traversable[a]](
implicit v: Validate.Aux[A, P, R]
): Validate.Aux[T[A], Init[P], Init[List[v.Res]]] =
new Validate[T[A], Init[P]] {
override type R = Init[List[v.Res]]
override def validate(t: T[A]): Res = {
val ra = t.toList.dropRight(1).map(v.validate)
Result.fromBoolean(ra.forall(_.isPassed), Init(ra))
}
override def showExpr(t: T[A]): String =
t.toList.dropRight(1).map(v.showExpr).mkString("(", " && ", ")")
}
implicit def initValidateView[A, P, R, T](
implicit v: Validate.Aux[A, P, R],
ev: T => Traversable[A]
): Validate.Aux[T, Init[P], Init[List[v.Res]]] =
initValidate[A, P, R, Traversable].contramap(ev)
implicit def lastValidate[A, P, R, T[a] <: Traversable[a]](
implicit v: Validate.Aux[A, P, R]
): Validate.Aux[T[A], Last[P], Last[Option[v.Res]]] =
new Validate[T[A], Last[P]] {
override type R = Last[Option[v.Res]]
override def validate(t: T[A]): Res = {
val ra = t.lastOption.map(v.validate)
Result.fromBoolean(ra.fold(false)(_.isPassed), Last(ra))
}
override def showExpr(t: T[A]): String =
optElemShowExpr(t.lastOption, v.showExpr)
override def showResult(t: T[A], r: Res): String =
optElemShowResult(t.lastOption, r.detail.p, (a: A) => s"last($t) = $a", v.showResult)
}
implicit def lastValidateView[A, P, R, T](
implicit v: Validate.Aux[A, P, R],
ev: T => Traversable[A]
): Validate.Aux[T, Last[P], Last[Option[v.Res]]] =
lastValidate[A, P, R, Traversable].contramap(ev)
implicit def sizeValidate[T, P, RP](
implicit v: Validate.Aux[Int, P, RP],
ev: T => Traversable[_]
): Validate.Aux[T, Size[P], Size[v.Res]] =
new Validate[T, Size[P]] {
override type R = Size[v.Res]
override def validate(t: T): Res = {
val r = v.validate(t.size)
r.as(Size(r))
}
override def showExpr(t: T): String =
v.showExpr(t.size)
override def showResult(t: T, r: Res): String = {
val size = t.size
val nested = v.showResult(size, r.detail.p)
Resources.predicateTakingResultDetail(s"size($t) = $size", r, nested)
}
}
implicit def tailValidate[A, P, R, T[a] <: Traversable[a]](
implicit v: Validate.Aux[A, P, R]
): Validate.Aux[T[A], Tail[P], Tail[List[v.Res]]] =
new Validate[T[A], Tail[P]] {
override type R = Tail[List[v.Res]]
override def validate(t: T[A]): Res = {
val ra = t.toList.drop(1).map(v.validate)
Result.fromBoolean(ra.forall(_.isPassed), Tail(ra))
}
override def showExpr(t: T[A]): String =
t.toList.drop(1).map(v.showExpr).mkString("(", " && ", ")")
}
implicit def tailValidateView[A, P, R, T](
implicit v: Validate.Aux[A, P, R],
ev: T => Traversable[A]
): Validate.Aux[T, Tail[P], Tail[List[v.Res]]] =
tailValidate[A, P, R, Traversable].contramap(ev)
private def optElemShowExpr[A](elem: Option[A], f: A => String): String =
elem.fold(Resources.showExprEmptyCollection)(f)
private def optElemShowResult[A, R](elem: Option[A],
res: Option[Result[R]],
f: A => String,
g: (A, Result[R]) => String): String =
(elem, res) match {
case (Some(a), Some(r)) =>
Resources.predicateTakingResultDetail(f(a), r, g(a, r))
case _ => Resources.showResultEmptyCollection
}
}
private[refined] trait CollectionInference {
implicit def existsInference[A, B](implicit p1: A ==> B): Exists[A] ==> Exists[B] =
p1.adapt("existsInference(%s)")
implicit def existsNonEmptyInference[P]: Exists[P] ==> NonEmpty =
Inference.alwaysValid("existsNonEmptyInference")
implicit def headInference[A, B](implicit p1: A ==> B): Head[A] ==> Head[B] =
p1.adapt("headInference(%s)")
implicit def headExistsInference[P]: Head[P] ==> Exists[P] =
Inference.alwaysValid("headExistsInference")
implicit def indexInference[N, A, B](implicit p1: A ==> B): Index[N, A] ==> Index[N, B] =
p1.adapt("indexInference(%s)")
implicit def indexExistsInference[N, P]: Index[N, P] ==> Exists[P] =
Inference.alwaysValid("indexExistsInference")
implicit def lastInference[A, B](implicit p1: A ==> B): Last[A] ==> Last[B] =
p1.adapt("lastInference(%s)")
implicit def lastExistsInference[P]: Last[P] ==> Exists[P] =
Inference.alwaysValid("lastExistsInference")
implicit def sizeInference[A, B](implicit p1: A ==> B): Size[A] ==> Size[B] =
p1.adapt("sizeInference(%s)")
}