/
regex.cljc
658 lines (560 loc) · 26.3 KB
/
regex.cljc
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
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
(ns malli.impl.regex
"Regular expressions of sequences implementation namespace.
The implementation is very similar to Packrat or GLL parser combinators.
The parsing functions need to be written in CPS to support backtracking
inside :*, :+ and :repeat. They also need to be trampolined because the
(manually) CPS-converted code (for :*, :+ and :repeat) has to use tail
calls instead of loops and Clojure does not have TCO.
Because backtracking is used we need to memoize (parsing function, seq
position, register stack) triples to avoid exponential behaviour. Discarding
the memoization cache after traversing an input seq also requires trampolining.
Because regular expressions don't use (nontail) recursion by definition, finding
a memoization entry just means the parser already went 'here' and ultimately
failed; much simpler than the graph-structured stacks of GLL. And the register
stack is only there for and used by :repeat.
NOTE: For the memoization to work correctly, every node in the schema tree
must get its own validation/explanation/... function instance. So even every
`(malli.impl.regex/cat)` call must return a new fn instance although it does not
close over anything.
https://epsil.github.io/gll/ is a nice explanation of GLL parser combinators
and has links to papers etc. It also inspired Instaparse, which Engelberg
had a presentation about at Clojure/West 2014.
Despite the CPS and memoization, this implementation looks more like normal
Clojure code than the 'Pike VM' in Seqexp. Hopefully JITs also see it that
way and compile decent machine code for it. It is also much easier to extend
for actual parsing (e.g. encode, decode [and parse?]) instead of just
recognition for `validate`.
For a more detailed explanation of this namespace see also
https://www.metosin.fi/blog/malli-regex-schemas/."
(:refer-clojure :exclude [+ * repeat cat])
(:require [malli.impl.util :as miu])
#?(:bb (:import [java.util ArrayDeque])
:clj (:import [java.util ArrayDeque]
[clojure.lang Util Murmur3]
[java.lang.reflect Array])))
;;;; # Driver Protocols
(defprotocol ^:private Driver
(succeed! [self])
(succeeded? [self])
(pop-thunk! [self]))
(defprotocol ^:private IValidationDriver
(noncaching-park-validator! [driver validator regs pos coll k])
(park-validator! [driver validator regs pos coll k]))
(defprotocol ^:private IExplanationDriver
(noncaching-park-explainer! [driver explainer regs pos coll k])
(park-explainer! [driver explainer regs pos coll k])
(value-path [self pos])
(fail! [self pos errors*])
(latest-errors [self]))
(defprotocol ^:private IParseDriver
(noncaching-park-transformer! [driver transformer regs coll* pos coll k])
(park-transformer! [driver transformer regs coll* pos coll k])
(succeed-with! [self v])
(success-result [self]))
;;;; # Primitives
;;;; ## Seq Item
(defn item-validator [valid?]
(fn [_ _ pos coll k]
(when (and (seq coll) (valid? (first coll)))
(k (inc pos) (rest coll)))))
(defn item-explainer [path schema schema-explainer]
(fn [driver _ pos coll k]
(let [in (value-path driver pos)]
(if (seq coll)
(let [errors (schema-explainer (first coll) in [])]
(if (seq errors)
(fail! driver pos errors)
(k (inc pos) (rest coll))))
(fail! driver pos [(miu/-error path in schema nil :malli.core/end-of-input)])))))
(defn item-parser [parse]
(fn [_ _ pos coll k]
(when (seq coll)
(let [v (parse (first coll))]
(when-not (= v :malli.core/invalid)
(k v (inc pos) (rest coll)))))))
(defn item-unparser [unparse] (fn [v] (miu/-map-valid vector (unparse v))))
(defn item-encoder [valid? encode]
(fn [_ _ coll* pos coll k]
(when (seq coll)
(let [v (first coll)]
(when (valid? v)
(k (conj coll* (encode v)) (inc pos) (rest coll)))))))
(defn item-decoder [decode valid?]
(fn [_ _ coll* pos coll k]
(when (seq coll)
(let [v (decode (first coll))]
(when (valid? v)
(k (conj coll* v) (inc pos) (rest coll)))))))
(defn item-transformer [method validator t]
(case method
:encode (item-encoder validator t)
:decode (item-decoder t validator)))
;;;; ## End of Seq
(defn end-validator [] (fn [_ _ pos coll k] (when (empty? coll) (k pos coll))))
(defn end-explainer [schema path]
(fn [driver _ pos coll k]
(if (empty? coll)
(k pos coll)
(fail! driver pos (list (miu/-error path (value-path driver pos) schema (first coll) :malli.core/input-remaining))))))
(defn end-parser [] (fn [_ _ pos coll k] (when (empty? coll) (k nil pos coll))))
(defn end-transformer [] (fn [_ _ coll* pos coll k] (when (empty? coll) (k coll* pos coll))))
;;;; ## Unit
(defn pure-parser [v] (fn [_ _ pos coll k] (k v pos coll)))
(defn pure-unparser [_] [])
;;;; # Combinators
;;;; ## Functor
(defn fmap-parser [f p]
(fn [driver regs pos coll k]
(p driver regs pos coll (fn [v pos coll] (k (f v) pos coll)))))
;;;; ## Catenation
(defn- entry->regex [?kr] (if (vector? ?kr) (get ?kr 1) ?kr))
(defn cat-validator
([] (fn [_ _ pos coll k] (k pos coll)))
([?kr & ?krs]
(reduce (fn [acc ?kr]
(let [r* (entry->regex ?kr)]
(fn [driver regs pos coll k]
(acc driver regs pos coll (fn [pos coll] (r* driver regs pos coll k))))))
(entry->regex ?kr) ?krs)))
(defn cat-explainer
([] (fn [_ _ pos coll k] (k pos coll)))
([?kr & ?krs]
(reduce (fn [acc ?kr]
(let [r* (entry->regex ?kr)]
(fn [driver regs pos coll k]
(acc driver regs pos coll (fn [pos coll] (r* driver regs pos coll k))))))
(entry->regex ?kr) ?krs)))
(defn cat-parser
([] (fn [_ _ pos coll k] (k [] pos coll)))
([r & rs]
(let [sp (reduce (fn [acc r]
(fn [driver regs coll* pos coll k]
(r driver regs pos coll
(fn [v pos coll] (acc driver regs (conj coll* v) pos coll k)))))
(fn [_ _ coll* pos coll k] (k coll* pos coll))
(reverse (cons r rs)))]
(fn [driver regs pos coll k] (sp driver regs [] pos coll k)))))
(defn catn-parser
([] (fn [_ _ pos coll k] (k {} pos coll)))
([kr & krs]
(let [sp (reduce (fn [acc [tag r]]
(fn [driver regs m pos coll k]
(r driver regs pos coll
(fn [v pos coll] (acc driver regs (assoc m tag v) pos coll k)))))
(fn [_ _ m pos coll k] (k m pos coll))
(reverse (cons kr krs)))]
(fn [driver regs pos coll k] (sp driver regs {} pos coll k)))))
(defn cat-unparser [& unparsers]
(let [unparsers (vec unparsers)]
(fn [tup]
(if (and (vector? tup) (= (count tup) (count unparsers)))
(miu/-reduce-kv-valid (fn [coll i unparser] (miu/-map-valid #(into coll %) (unparser (get tup i))))
[] unparsers)
:malli.core/invalid))))
(defn catn-unparser [& unparsers]
(let [unparsers (apply array-map (mapcat identity unparsers))]
(fn [m]
(if (and (map? m) (= (count m) (count unparsers)))
(miu/-reduce-kv-valid (fn [coll tag unparser]
(if-some [kv (find m tag)]
(miu/-map-valid #(into coll %) (unparser (val kv)))
:malli.core/invalid))
;; `m` is in hash order, so have to iterate over `unparsers` to restore seq order:
[] unparsers)
:malli.core/invalid))))
(defn cat-transformer
([] (fn [_ _ coll* pos coll k] (k coll* pos coll)))
([?kr & ?krs]
(reduce (fn [acc ?kr]
(let [r (entry->regex ?kr)]
(fn [driver regs coll* pos coll k]
(acc driver regs coll* pos coll (fn [coll* pos coll] (r driver regs coll* pos coll k))))))
(entry->regex ?kr) ?krs)))
;;;; ## Alternation
(defn alt-validator [?kr & ?krs]
(reduce (fn [r ?kr]
(let [r* (entry->regex ?kr)]
(fn [driver regs pos coll k]
(park-validator! driver r* regs pos coll k) ; remember fallback
(park-validator! driver r regs pos coll k))))
(entry->regex ?kr) ?krs))
(defn alt-explainer [?kr & ?krs]
(reduce (fn [r ?kr]
(let [r* (entry->regex ?kr)]
(fn [driver regs pos coll k]
(park-explainer! driver r* regs pos coll k) ; remember fallback
(park-explainer! driver r regs pos coll k))))
(entry->regex ?kr) ?krs))
(defn alt-parser [& rs]
(reduce (fn [r r*]
(fn [driver regs pos coll k]
(park-validator! driver r* regs pos coll k) ; remember fallback
(park-validator! driver r regs pos coll k)))
rs))
(defn altn-parser [kr & krs]
(reduce (fn [r [tag r*]]
(let [r* (fmap-parser (fn [v] (miu/-tagged tag v)) r*)]
(fn [driver regs pos coll k]
(park-validator! driver r* regs pos coll k) ; remember fallback
(park-validator! driver r regs pos coll k))))
(let [[tag r] kr]
(fmap-parser (fn [v] (miu/-tagged tag v)) r))
krs))
(defn alt-unparser [& unparsers]
(fn [x]
(reduce (fn [_ unparse] (miu/-map-valid reduced (unparse x)))
:malli.core/invalid unparsers)))
(defn altn-unparser [& unparsers]
(let [unparsers (into {} unparsers)]
(fn [x]
(if (miu/-tagged? x)
(if-some [kv (find unparsers (key x))]
((val kv) (val x))
:malli.core/invalid)
:malli.core/invalid))))
(defn alt-transformer [?kr & ?krs]
(reduce (fn [r ?kr]
(let [r* (entry->regex ?kr)]
(fn [driver regs coll* pos coll k]
(park-transformer! driver r* regs coll* pos coll k) ; remember fallback
(park-transformer! driver r regs coll* pos coll k))))
(entry->regex ?kr) ?krs))
;;;; ## Option
(defn ?-validator [p] (alt-validator p (cat-validator)))
(defn ?-explainer [p] (alt-explainer p (cat-explainer)))
(defn ?-parser [p] (alt-parser p (pure-parser nil)))
(defn ?-unparser [p] (alt-unparser p pure-unparser))
(defn ?-transformer [p] (alt-transformer p (cat-transformer)))
;;;; ## Kleene Star
(defn *-validator [p]
(let [*p-epsilon (cat-validator)]
(fn *p [driver regs pos coll k]
(park-validator! driver *p-epsilon regs pos coll k) ; remember fallback
(p driver regs pos coll (fn [pos coll] (park-validator! driver *p regs pos coll k)))))) ; TCO
(defn *-explainer [p]
(let [*p-epsilon (cat-explainer)]
(fn *p [driver regs pos coll k]
(park-explainer! driver *p-epsilon regs pos coll k) ; remember fallback
(p driver regs pos coll (fn [pos coll] (park-explainer! driver *p regs pos coll k)))))) ; TCO
(defn *-parser [p]
(let [*p-epsilon (fn [_ _ coll* pos coll k] (k coll* pos coll))] ; TCO
(fn *p
([driver regs pos coll k] (*p driver regs [] pos coll k))
([driver regs coll* pos coll k]
(park-transformer! driver *p-epsilon regs coll* pos coll k) ; remember fallback
(p driver regs pos coll
(fn [v pos coll] (park-transformer! driver *p regs (conj coll* v) pos coll k))))))) ; TCO
(defn *-unparser [up]
(fn [v]
(reduce (fn [acc v]
(let [result (up v)]
(if (miu/-invalid? result)
(reduced result)
(into acc result))))
[] v)))
(defn *-transformer [p]
(let [*p-epsilon (cat-transformer)]
(fn *p [driver regs coll* pos coll k]
(park-transformer! driver *p-epsilon regs coll* pos coll k) ; remember fallback
(p driver regs coll* pos coll
(fn [coll* pos coll] (park-transformer! driver *p regs coll* pos coll k)))))) ; TCO
;;;; ## Non-Kleene Plus
(defn +-validator [p] (cat-validator p (*-validator p)))
(defn +-explainer [p] (cat-explainer p (*-explainer p)))
(defn +-parser [p] (fmap-parser (fn [[v vs]] (into [v] vs)) (cat-parser p (*-parser p))))
(defn +-unparser [up]
(let [up* (*-unparser up)]
(fn [x]
(if (and (vector? x) (<= 1 (count x)))
(up* x)
:malli.core/invalid))))
(defn +-transformer [p] (cat-transformer p (*-transformer p)))
;;;; ## Repeat
;; eagerly repeat a child until either:
;; - the child consumes no elements
;; - then bail to check for remaining elements
;; - we run out of repetitions via :max
;; - then bail to check for remaining elements
;; - we have repeated at least :min times and the coll is empty
;; - success case
(defn repeat-validator [min max p]
(let [rep-epsilon (cat-validator)]
(letfn [(compulsories [driver regs pos coll k]
(if (< (peek regs) min)
(p driver regs pos coll
(fn [pos coll]
(noncaching-park-validator! driver
(fn [driver stack pos coll k]
(compulsories driver (conj (pop stack) (inc (peek stack))) pos coll k))
regs pos coll k))) ; TCO
(optionals driver regs pos coll k)))
(optionals [driver regs pos coll k]
(if (and (< (peek regs) max)
(<= (peek regs) pos)
(seq coll))
(do
(park-validator! driver rep-epsilon regs pos coll k) ; remember fallback
(p driver regs pos coll
(fn [pos coll]
(park-validator! driver
(fn [driver regs pos coll k]
(optionals driver (conj (pop regs) (inc (peek regs))) pos coll k))
regs pos coll k)))) ; TCO
(k pos coll)))]
(fn [driver regs pos coll k] (compulsories driver (conj regs 0) pos coll k)))))
(defn repeat-explainer [min max p]
(let [rep-epsilon (cat-explainer)]
(letfn [(compulsories [driver regs pos coll k]
(if (< (peek regs) min)
(p driver regs pos coll
(fn [pos coll]
(noncaching-park-explainer! driver
(fn [driver regs pos coll k]
(compulsories driver (conj (pop regs) (inc (peek regs))) pos coll k))
regs pos coll k))) ; TCO
(optionals driver regs pos coll k)))
(optionals [driver regs pos coll k]
(if (and (< (peek regs) max)
(<= (peek regs) pos)
(seq coll))
(do
(park-explainer! driver rep-epsilon regs pos coll k) ; remember fallback
(p driver regs pos coll
(fn [pos coll]
(park-explainer! driver
(fn [driver regs pos coll k]
(optionals driver (conj (pop regs) (inc (peek regs))) pos coll k))
regs pos coll k)))) ; TCO
(k pos coll)))]
(fn [driver regs pos coll k] (compulsories driver (conj regs 0) pos coll k)))))
(defn repeat-parser [min max p]
(let [rep-epsilon (fn [_ _ coll* pos coll k] (k coll* pos coll))]
(letfn [(compulsories [driver regs coll* pos coll k]
(if (< (peek regs) min)
(p driver regs pos coll
(fn [v pos coll]
(noncaching-park-transformer! driver
(fn [driver regs coll* pos coll k]
(compulsories driver (conj (pop regs) (inc (peek regs))) (conj coll* v) pos coll k))
regs coll* pos coll k))) ; TCO
(optionals driver regs coll* pos coll k)))
(optionals [driver regs coll* pos coll k]
(if (and (< (peek regs) max)
(<= (peek regs) pos)
(seq coll))
(do
(park-transformer! driver rep-epsilon regs coll* pos coll k) ; remember fallback
(p driver regs pos coll
(fn [v pos coll]
(park-transformer!
driver
(fn [driver regs coll* pos coll k]
(optionals driver (conj (pop regs) (inc (peek regs))) (conj coll* v) pos coll k))
regs coll* pos coll k)))) ; TCO
(k coll* pos coll)))]
(fn [driver regs pos coll k] (compulsories driver (conj regs 0) [] pos coll k)))))
(defn repeat-unparser [min max up]
(let [up* (*-unparser up)]
(fn [v]
(if (and (vector? v) (<= min (count v) max))
(up* v)
:malli.core/invalid))))
(defn repeat-transformer [min max p]
(let [rep-epsilon (cat-transformer)]
(letfn [(compulsories [driver regs coll* pos coll k]
(if (< (peek regs) min)
(p driver regs coll* pos coll
(fn [coll* pos coll]
(noncaching-park-transformer! driver
(fn [driver regs coll* pos coll k]
(compulsories driver (conj (pop regs) (inc (peek regs))) coll* pos coll k))
regs coll* pos coll k))) ; TCO
(optionals driver regs coll* pos coll k)))
(optionals [driver regs coll* pos coll k]
(if (and (< (peek regs) max)
(<= (peek regs) pos)
(seq coll))
(do
(park-transformer! driver rep-epsilon regs coll* pos coll k) ; remember fallback
(p driver regs coll* pos coll
(fn [coll* pos coll]
(park-transformer! driver
(fn [driver regs coll* pos coll k]
(optionals driver (conj (pop regs) (inc (peek regs))) coll* pos coll k))
regs coll* pos coll k)))) ; TCO
(k coll* pos coll)))]
(fn [driver regs coll* pos coll k] (compulsories driver (conj regs 0) coll* pos coll k)))))
;;;; # Shared Drivers
(defn- make-stack [] #?(:clj (ArrayDeque.), :cljs #js []))
(defn- empty-stack? [^ArrayDeque stack] #?(:clj (.isEmpty stack), :cljs (zero? (alength stack))))
(defprotocol ^:private ICache
(ensure-cached! [cache f pos regs]))
(deftype ^:private CacheEntry [^long hash f ^long pos regs])
#?(:clj (set! *unchecked-math* true))
;; Custom hash set so that Cljs Malli users can have decent perf without having to to set up Closure ES6 Set polyfill.
;; Uses quadratic probing with power-of-two sizes and triangular numbers, what a nice trick!
(deftype Cache
#?(:clj [^:unsynchronized-mutable ^"[Ljava.lang.Object;" values, ^:unsynchronized-mutable ^long size]
:cljs [^:mutable values, ^:mutable size])
ICache
(ensure-cached! [_ f pos regs]
(when (> (unchecked-inc size) (bit-shift-right (alength values) 1)) ; potential new load factor > 0.5
;; Rehash:
(let [capacity* (bit-shift-left (alength values) 1)
^objects values* #?(:bb (object-array capacity*)
:clj (Array/newInstance Object capacity*)
:cljs (object-array capacity*))
max-index (unchecked-dec capacity*)]
(let [len (alength values)]
(loop [i 0]
(when (< i len)
(when-some [^CacheEntry v (aget values i)]
(loop [i* (bit-and (.-hash v) max-index)
collisions 0]
(if (aget values* i*)
(let [collisions (unchecked-inc collisions)]
(recur
(bit-and (unchecked-add i* collisions) max-index)
collisions))
(aset values* i* v))))
(recur (unchecked-inc i)))))
(set! values values*)))
(let [capacity (alength values)
max-index (unchecked-dec capacity)
#?@(:clj [pos (.longValue ^Long pos)])
;; Unfortunately `hash-combine` hashes its second argument on clj and neither argument on cljs:
h #?(:bb (-> (hash f) (hash-combine pos) (hash-combine regs))
:clj (-> (.hashCode ^Object f) (Util/hashCombine (Murmur3/hashLong pos)) (Util/hashCombine (Util/hash regs)))
:cljs (-> (hash f) (hash-combine (hash pos)) (hash-combine (hash regs))))]
(loop [i (bit-and h max-index), collisions 0]
(if-some [^CacheEntry entry (aget values i)]
(or (and (= (.-hash entry) h)
(= (.-f entry) f)
(= (.-pos entry) pos)
(= (.-regs entry) regs))
(let [collisions (unchecked-inc collisions)]
(recur (bit-and (unchecked-add i collisions) max-index) ; i = (i + collisions) % capacity
collisions)))
(do
(aset values i (CacheEntry. h f pos regs))
(set! size (unchecked-inc size))
false))))))
(defn- make-cache [] (Cache. (object-array 2) 0))
#?(:clj (set! *unchecked-math* false))
(deftype ^:private CheckDriver
#?(:clj [^:unsynchronized-mutable ^boolean success, ^ArrayDeque stack, cache]
:cljs [^:mutable success, stack, cache])
Driver
(succeed! [_] (set! success (boolean true)))
(succeeded? [_] success)
(pop-thunk! [_] (when-not (empty-stack? stack) (.pop stack)))
IValidationDriver
(noncaching-park-validator! [self validator regs pos coll k] (.push stack #(validator self regs pos coll k)))
(park-validator! [self validator regs pos coll k]
(when-not (ensure-cached! cache validator pos regs)
(noncaching-park-validator! self validator regs pos coll k))))
(deftype ^:private ParseDriver
#?(:clj [^:unsynchronized-mutable ^boolean success, ^ArrayDeque stack, cache
^:unsynchronized-mutable result]
:cljs [^:mutable success, stack, cache, ^:mutable result])
Driver
(succeed! [_] (set! success (boolean true)))
(succeeded? [_] success)
(pop-thunk! [_] (when-not (empty-stack? stack) (.pop stack)))
IValidationDriver
(noncaching-park-validator! [self validator regs pos coll k] (.push stack #(validator self regs pos coll k)))
(park-validator! [self validator regs pos coll k]
(when-not (ensure-cached! cache validator pos regs)
(noncaching-park-validator! self validator regs pos coll k)))
IParseDriver
(noncaching-park-transformer! [driver transformer regs coll* pos coll k]
(.push stack #(transformer driver regs coll* pos coll k)))
(park-transformer! [driver transformer regs coll* pos coll k]
(when-not (ensure-cached! cache transformer pos regs)
(noncaching-park-transformer! driver transformer regs coll* pos coll k)))
(succeed-with! [self v] (succeed! self) (set! result v))
(success-result [_] result))
;;;; # Validator
(defn validator [p]
(let [p (cat-validator p (end-validator))]
(fn [coll]
(and (sequential? coll)
(let [driver (CheckDriver. false (make-stack) (make-cache))]
(p driver () 0 coll (fn [_ _] (succeed! driver)))
(or (succeeded? driver)
(loop []
(if-some [thunk (pop-thunk! driver)]
(do
(thunk)
(or (succeeded? driver) (recur)))
false))))))))
;;;; # Explainer
(deftype ^:private ExplanationDriver
#?(:clj [^:unsynchronized-mutable ^boolean success, ^ArrayDeque stack, cache
in, ^:unsynchronized-mutable errors-max-pos, ^:unsynchronized-mutable errors]
:cljs [^:mutable success, stack, cache, in, ^:mutable errors-max-pos, ^:mutable errors])
Driver
(succeed! [_] (set! success (boolean true)))
(succeeded? [_] success)
(pop-thunk! [_] (when-not (empty-stack? stack) (.pop stack)))
IExplanationDriver
(noncaching-park-explainer! [self validator regs pos coll k] (.push stack #(validator self regs pos coll k)))
(park-explainer! [self validator regs pos coll k]
(when-not (ensure-cached! cache validator pos regs)
(noncaching-park-explainer! self validator regs pos coll k)))
(value-path [_ pos] (conj in pos))
(fail! [_ pos errors*]
(cond
(> pos errors-max-pos) (do
(set! errors-max-pos pos)
(set! errors errors*))
(= pos errors-max-pos) (set! errors (into errors errors*))))
(latest-errors [_] errors))
(defn explainer [schema path p]
(let [p (cat-explainer p (end-explainer schema path))]
(fn [coll in errors]
(if (sequential? coll)
(let [pos 0
driver (ExplanationDriver. false (make-stack) (make-cache) in pos [])]
(p driver () pos coll (fn [_ _] (succeed! driver)))
(if (succeeded? driver)
errors
(loop []
(if-some [thunk (pop-thunk! driver)]
(do
(thunk)
(if (succeeded? driver) errors (recur)))
(into errors (latest-errors driver))))))
(conj errors (miu/-error path in schema coll :malli.core/invalid-type))))))
;;;; # Parser
(defn parser [p]
(let [p (cat-parser p (end-parser))]
(fn [coll]
(if (sequential? coll)
(let [driver (ParseDriver. false (make-stack) (make-cache) nil)]
(p driver () 0 coll (fn [v _ _] (succeed-with! driver v)))
(if (succeeded? driver)
(first (success-result driver))
(loop []
(if-some [thunk (pop-thunk! driver)]
(do
(thunk)
(if (succeeded? driver) (first (success-result driver)) (recur)))
:malli.core/invalid))))
:malli.core/invalid))))
;;;; # Transformer
(defn transformer [p]
(let [p (cat-transformer p (end-transformer))]
(fn [coll]
(if (sequential? coll)
(let [driver (ParseDriver. false (make-stack) (make-cache) nil)]
(p driver () [] 0 coll (fn [coll* _ _] (succeed-with! driver coll*)))
(if (succeeded? driver)
(success-result driver)
(loop []
(if-some [thunk (pop-thunk! driver)]
(do
(thunk)
(if (succeeded? driver) (success-result driver) (recur)))
coll))))
coll))))