-
Notifications
You must be signed in to change notification settings - Fork 786
/
core.clj
1143 lines (1026 loc) · 46.1 KB
/
core.clj
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
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
; Copyright (c) Rich Hickey. All rights reserved.
; The use and distribution terms for this software are covered by the
; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)
; which can be found in the file epl-v10.html at the root of this distribution.
; By using this software in any fashion, you are agreeing to be bound by
; the terms of this license.
; You must not remove this notice, or any other, from this software.
(ns cljs.core
(:refer-clojure :exclude [-> ->> .. amap and areduce alength aclone assert binding bound-fn case comment cond condp
declare definline definterface defmethod defmulti defn defn- defonce
defprotocol defrecord defstruct deftype delay destructure doseq dosync dotimes doto
extend-protocol extend-type fn for future gen-class gen-interface
if-let if-not import io! lazy-cat lazy-seq let letfn locking loop
memfn ns or proxy proxy-super pvalues refer-clojure reify sync time
when when-first when-let when-not while with-bindings with-in-str
with-loading-context with-local-vars with-open with-out-str with-precision with-redefs
satisfies? identical? true? false? nil? str get
aget aset
+ - * / < <= > >= == zero? pos? neg? inc dec max min mod
bit-and bit-and-not bit-clear bit-flip bit-not bit-or bit-set
bit-test bit-shift-left bit-shift-right bit-xor])
(:require clojure.walk))
(alias 'core 'clojure.core)
(defmacro import-macros [ns [& vars]]
(core/let [ns (find-ns ns)
vars (map #(ns-resolve ns %) vars)
syms (map (core/fn [^clojure.lang.Var v] (core/-> v .sym (with-meta {:macro true}))) vars)
defs (map (core/fn [sym var]
`(def ~sym (deref ~var))) syms vars)]
`(do ~@defs
:imported)))
(import-macros clojure.core
[-> ->> .. and assert comment cond
declare defn defn-
doto
extend-protocol fn for
if-let if-not letfn
memfn or
when when-first when-let when-not while])
(defmacro ^{:private true} assert-args [fnname & pairs]
`(do (when-not ~(first pairs)
(throw (IllegalArgumentException.
~(core/str fnname " requires " (second pairs)))))
~(core/let [more (nnext pairs)]
(when more
(list* `assert-args fnname more)))))
(defn destructure [bindings]
(core/let [bents (partition 2 bindings)
pb (fn pb [bvec b v]
(core/let [pvec
(fn [bvec b val]
(core/let [gvec (gensym "vec__")]
(core/loop [ret (-> bvec (conj gvec) (conj val))
n 0
bs b
seen-rest? false]
(if (seq bs)
(core/let [firstb (first bs)]
(cond
(= firstb '&) (recur (pb ret (second bs) (list `nthnext gvec n))
n
(nnext bs)
true)
(= firstb :as) (pb ret (second bs) gvec)
:else (if seen-rest?
(throw (new Exception "Unsupported binding form, only :as can follow & parameter"))
(recur (pb ret firstb (list `nth gvec n nil))
(core/inc n)
(next bs)
seen-rest?))))
ret))))
pmap
(fn [bvec b v]
(core/let [gmap (gensym "map__")
defaults (:or b)]
(core/loop [ret (-> bvec (conj gmap) (conj v)
(conj gmap) (conj `(if (seq? ~gmap) (apply hash-map ~gmap) ~gmap))
((fn [ret]
(if (:as b)
(conj ret (:as b) gmap)
ret))))
bes (reduce
(fn [bes entry]
(reduce #(assoc %1 %2 ((val entry) %2))
(dissoc bes (key entry))
((key entry) bes)))
(dissoc b :as :or)
{:keys #(keyword (core/str %)), :strs core/str, :syms #(list `quote %)})]
(if (seq bes)
(core/let [bb (key (first bes))
bk (val (first bes))
has-default (contains? defaults bb)]
(recur (pb ret bb (if has-default
(list `get gmap bk (defaults bb))
(list `get gmap bk)))
(next bes)))
ret))))]
(cond
(symbol? b) (-> bvec (conj b) (conj v))
(vector? b) (pvec bvec b v)
(map? b) (pmap bvec b v)
:else (throw (new Exception (core/str "Unsupported binding form: " b))))))
process-entry (fn [bvec b] (pb bvec (first b) (second b)))]
(if (every? symbol? (map first bents))
bindings
(reduce process-entry [] bents))))
(defmacro let
"binding => binding-form init-expr
Evaluates the exprs in a lexical context in which the symbols in
the binding-forms are bound to their respective init-exprs or parts
therein."
[bindings & body]
(assert-args
(vector? bindings) "a vector for its binding"
(even? (count bindings)) "an even number of forms in binding vector")
`(let* ~(destructure bindings) ~@body))
(defmacro loop
"Evaluates the exprs in a lexical context in which the symbols in
the binding-forms are bound to their respective init-exprs or parts
therein. Acts as a recur target."
[bindings & body]
(assert-args
(vector? bindings) "a vector for its binding"
(even? (count bindings)) "an even number of forms in binding vector")
(let [db (destructure bindings)]
(if (= db bindings)
`(loop* ~bindings ~@body)
(let [vs (take-nth 2 (drop 1 bindings))
bs (take-nth 2 bindings)
gs (map (fn [b] (if (symbol? b) b (gensym))) bs)
bfs (reduce (fn [ret [b v g]]
(if (symbol? b)
(conj ret g v)
(conj ret g v b g)))
[] (map vector bs vs gs))]
`(let ~bfs
(loop* ~(vec (interleave gs gs))
(let ~(vec (interleave bs gs))
~@body)))))))
(def fast-path-protocols
"protocol fqn -> [partition number, bit]"
(zipmap (map #(symbol "cljs.core" (core/str %))
'[IFn ICounted IEmptyableCollection ICollection IIndexed ASeq ISeq INext
ILookup IAssociative IMap IMapEntry ISet IStack IVector IDeref
IDerefWithTimeout IMeta IWithMeta IReduce IKVReduce IEquiv IHash
ISeqable ISequential IList IRecord IReversible ISorted IPrintable
IPending IWatchable IEditableCollection ITransientCollection
ITransientAssociative ITransientMap ITransientVector ITransientSet
IMultiFn])
(iterate (fn [[p b]]
(if (core/== 2147483648 b)
[(core/inc p) 1]
[p (core/bit-shift-left b 1)]))
[0 1])))
(def fast-path-protocol-partitions-count
"total number of partitions"
(let [c (count fast-path-protocols)
m (core/mod c 32)]
(if (core/zero? m)
(core/quot c 32)
(core/inc (core/quot c 32)))))
(defmacro str [& xs]
(let [strs (->> (repeat (count xs) "cljs.core.str(~{})")
(interpose ",")
(apply core/str))]
(concat (list 'js* (core/str "[" strs "].join('')")) xs)))
(defn bool-expr [e]
(vary-meta e assoc :tag 'boolean))
(defmacro nil? [x]
`(coercive-= ~x nil))
;; internal - do not use.
(defmacro coercive-not [x]
(bool-expr (list 'js* "(!~{})" x)))
;; internal - do not use.
(defmacro coercive-not= [x y]
(bool-expr (list 'js* "(~{} != ~{})" x y)))
;; internal - do not use.
(defmacro coercive-= [x y]
(bool-expr (list 'js* "(~{} == ~{})" x y)))
(defmacro true? [x]
(bool-expr (list 'js* "~{} === true" x)))
(defmacro false? [x]
(bool-expr (list 'js* "~{} === false" x)))
(defmacro undefined? [x]
(bool-expr (list 'js* "(void 0 === ~{})" x)))
(defmacro identical? [a b]
(bool-expr (list 'js* "(~{} === ~{})" a b)))
(defmacro aget
([a i]
(list 'js* "(~{}[~{}])" a i))
([a i & idxs]
(let [astr (apply core/str (repeat (count idxs) "[~{}]"))]
`(~'js* ~(core/str "(~{}[~{}]" astr ")") ~a ~i ~@idxs))))
(defmacro aset [a i v]
(list 'js* "(~{}[~{}] = ~{})" a i v))
(defmacro +
([] 0)
([x] x)
([x y] (list 'js* "(~{} + ~{})" x y))
([x y & more] `(+ (+ ~x ~y) ~@more)))
(defmacro -
([x] (list 'js* "(- ~{})" x))
([x y] (list 'js* "(~{} - ~{})" x y))
([x y & more] `(- (- ~x ~y) ~@more)))
(defmacro *
([] 1)
([x] x)
([x y] (list 'js* "(~{} * ~{})" x y))
([x y & more] `(* (* ~x ~y) ~@more)))
(defmacro /
([x] `(/ 1 ~x))
([x y] (list 'js* "(~{} / ~{})" x y))
([x y & more] `(/ (/ ~x ~y) ~@more)))
(defmacro <
([x] true)
([x y] (bool-expr (list 'js* "(~{} < ~{})" x y)))
([x y & more] `(and (< ~x ~y) (< ~y ~@more))))
(defmacro <=
([x] true)
([x y] (bool-expr (list 'js* "(~{} <= ~{})" x y)))
([x y & more] `(and (<= ~x ~y) (<= ~y ~@more))))
(defmacro >
([x] true)
([x y] (bool-expr (list 'js* "(~{} > ~{})" x y)))
([x y & more] `(and (> ~x ~y) (> ~y ~@more))))
(defmacro >=
([x] true)
([x y] (bool-expr (list 'js* "(~{} >= ~{})" x y)))
([x y & more] `(and (>= ~x ~y) (>= ~y ~@more))))
(defmacro ==
([x] true)
([x y] (bool-expr (list 'js* "(~{} === ~{})" x y)))
([x y & more] `(and (== ~x ~y) (== ~y ~@more))))
(defmacro dec [x]
`(- ~x 1))
(defmacro inc [x]
`(+ ~x 1))
(defmacro zero? [x]
`(== ~x 0))
(defmacro pos? [x]
`(> ~x 0))
(defmacro neg? [x]
`(< ~x 0))
(defmacro max
([x] x)
([x y] (list 'js* "((~{} > ~{}) ? ~{} : ~{})" x y x y))
([x y & more] `(max (max ~x ~y) ~@more)))
(defmacro min
([x] x)
([x y] (list 'js* "((~{} < ~{}) ? ~{} : ~{})" x y x y))
([x y & more] `(min (min ~x ~y) ~@more)))
(defmacro mod [num div]
(list 'js* "(~{} % ~{})" num div))
(defmacro bit-not [x]
(list 'js* "(~ ~{})" x))
(defmacro bit-and
([x y] (list 'js* "(~{} & ~{})" x y))
([x y & more] `(bit-and (bit-and ~x ~y) ~@more)))
;; internal do not use
(defmacro unsafe-bit-and
([x y] (bool-expr (list 'js* "(~{} & ~{})" x y)))
([x y & more] `(unsafe-bit-and (unsafe-bit-and ~x ~y) ~@more)))
(defmacro bit-or
([x y] (list 'js* "(~{} | ~{})" x y))
([x y & more] `(bit-or (bit-or ~x ~y) ~@more)))
(defmacro bit-xor
([x y] (list 'js* "(~{} ^ ~{})" x y))
([x y & more] `(bit-xor (bit-xor ~x ~y) ~@more)))
(defmacro bit-and-not
([x y] (list 'js* "(~{} & ~~{})" x y))
([x y & more] `(bit-and-not (bit-and-not ~x ~y) ~@more)))
(defmacro bit-clear [x n]
(list 'js* "(~{} & ~(1 << ~{}))" x n))
(defmacro bit-flip [x n]
(list 'js* "(~{} ^ (1 << ~{}))" x n))
(defmacro bit-test [x n]
(list 'js* "((~{} & (1 << ~{})) != 0)" x n))
(defmacro bit-shift-left [x n]
(list 'js* "(~{} << ~{})" x n))
(defmacro bit-shift-right [x n]
(list 'js* "(~{} >> ~{})" x n))
(defmacro bit-shift-right-zero-fill [x n]
(list 'js* "(~{} >>> ~{})" x n))
(defmacro bit-set [x n]
(list 'js* "(~{} | (1 << ~{}))" x n))
;; internal
(defmacro mask [hash shift]
(list 'js* "((~{} >>> ~{}) & 0x01f)" hash shift))
;; internal
(defmacro bitpos [hash shift]
(list 'js* "(1 << ~{})" `(mask ~hash ~shift)))
;; internal
(defmacro caching-hash [coll hash-fn hash-key]
`(let [h# ~hash-key]
(if-not (nil? h#)
h#
(let [h# (~hash-fn ~coll)]
(set! ~hash-key h#)
h#))))
(defmacro get
([coll k]
`(-lookup ~coll ~k nil))
([coll k not-found]
`(-lookup ~coll ~k ~not-found)))
;;; internal -- reducers-related macros
(defn- do-curried
[name doc meta args body]
(let [cargs (vec (butlast args))]
`(defn ~name ~doc ~meta
(~cargs (fn [x#] (~name ~@cargs x#)))
(~args ~@body))))
(defmacro ^:private defcurried
"Builds another arity of the fn that returns a fn awaiting the last
param"
[name doc meta args & body]
(do-curried name doc meta args body))
(defn- do-rfn [f1 k fkv]
`(fn
([] (~f1))
~(clojure.walk/postwalk
#(if (sequential? %)
((if (vector? %) vec identity)
(core/remove #{k} %))
%)
fkv)
~fkv))
(defmacro ^:private rfn
"Builds 3-arity reducing fn given names of wrapped fn and key, and k/v impl."
[[f1 k] fkv]
(do-rfn f1 k fkv))
;;; end of reducers macros
(defn protocol-prefix [psym]
(core/str (-> (core/str psym) (.replace \. \$) (.replace \/ \$)) "$"))
(def #^:private base-type
{nil "null"
'object "object"
'string "string"
'number "number"
'array "array"
'function "function"
'boolean "boolean"
'default "_"})
(defmacro reify [& impls]
(let [t (gensym "t")
meta-sym (gensym "meta")
this-sym (gensym "_")
locals (keys (:locals &env))
ns (-> &env :ns :name)
munge cljs.compiler/munge
ns-t (list 'js* (core/str (munge ns) "." (munge t)))]
`(do
(when (undefined? ~ns-t)
(deftype ~t [~@locals ~meta-sym]
IWithMeta
(~'-with-meta [~this-sym ~meta-sym]
(new ~t ~@locals ~meta-sym))
IMeta
(~'-meta [~this-sym] ~meta-sym)
~@impls))
(new ~t ~@locals nil))))
(defmacro this-as
"Defines a scope where JavaScript's implicit \"this\" is bound to the name provided."
[name & body]
`(let [~name (~'js* "this")]
~@body))
(defn to-property [sym]
(symbol (core/str "-" sym)))
(defmacro extend-type [tsym & impls]
(let [resolve #(let [ret (:name (cljs.analyzer/resolve-var (dissoc &env :locals) %))]
(assert ret (core/str "Can't resolve: " %))
ret)
impl-map (loop [ret {} s impls]
(if (seq s)
(recur (assoc ret (first s) (take-while seq? (next s)))
(drop-while seq? (next s)))
ret))
warn-if-not-protocol #(when-not (= 'Object %)
(if cljs.analyzer/*cljs-warn-on-undeclared*
(if-let [var (cljs.analyzer/resolve-existing-var (dissoc &env :locals) %)]
(when-not (:protocol-symbol var)
(cljs.analyzer/warning &env
(core/str "WARNING: Symbol " % " is not a protocol")))
(cljs.analyzer/warning &env
(core/str "WARNING: Can't resolve protocol symbol " %)))))
skip-flag (set (-> tsym meta :skip-protocol-flag))]
(if (base-type tsym)
(let [t (base-type tsym)
assign-impls (fn [[p sigs]]
(warn-if-not-protocol p)
(let [psym (resolve p)
pfn-prefix (subs (core/str psym) 0 (clojure.core/inc (.indexOf (core/str psym) "/")))]
(cons `(aset ~psym ~t true)
(map (fn [[f & meths :as form]]
`(aset ~(symbol (core/str pfn-prefix f)) ~t ~(with-meta `(fn ~@meths) (meta form))))
sigs))))]
`(do ~@(mapcat assign-impls impl-map)))
(let [t (resolve tsym)
prototype-prefix (fn [sym]
`(.. ~tsym -prototype ~(to-property sym)))
assign-impls (fn [[p sigs]]
(warn-if-not-protocol p)
(let [psym (resolve p)
pprefix (protocol-prefix psym)]
(if (= p 'Object)
(let [adapt-params (fn [[sig & body]]
(let [[tname & args] sig]
(list (vec args) (list* 'this-as (vary-meta tname assoc :tag t) body))))]
(map (fn [[f & meths :as form]]
`(set! ~(prototype-prefix f)
~(with-meta `(fn ~@(map adapt-params meths)) (meta form))))
sigs))
(concat (when-not (skip-flag psym)
[`(set! ~(prototype-prefix pprefix) true)])
(mapcat (fn [[f & meths :as form]]
(if (= psym 'cljs.core/IFn)
(let [adapt-params (fn [[[targ & args :as sig] & body]]
(let [this-sym (with-meta (gensym "this-sym") {:tag t})]
`(~(vec (cons this-sym args))
(this-as ~this-sym
(let [~targ ~this-sym]
~@body)))))
meths (map adapt-params meths)
this-sym (with-meta (gensym "this-sym") {:tag t})
argsym (gensym "args")]
[`(set! ~(prototype-prefix 'call) ~(with-meta `(fn ~@meths) (meta form)))
`(set! ~(prototype-prefix 'apply)
~(with-meta
`(fn ~[this-sym argsym]
(.apply (.-call ~this-sym) ~this-sym
(.concat (array ~this-sym) (aclone ~argsym))))
(meta form)))])
(let [pf (core/str pprefix f)
adapt-params (fn [[[targ & args :as sig] & body]]
(cons (vec (cons (vary-meta targ assoc :tag t) args))
body))]
(if (vector? (first meths))
[`(set! ~(prototype-prefix (core/str pf "$arity$" (count (first meths)))) ~(with-meta `(fn ~@(adapt-params meths)) (meta form)))]
(map (fn [[sig & body :as meth]]
`(set! ~(prototype-prefix (core/str pf "$arity$" (count sig)))
~(with-meta `(fn ~(adapt-params meth)) (meta form))))
meths)))))
sigs)))))]
`(do ~@(mapcat assign-impls impl-map))))))
(defn- prepare-protocol-masks [env t impls]
(let [resolve #(let [ret (:name (cljs.analyzer/resolve-var (dissoc env :locals) %))]
(assert ret (core/str "Can't resolve: " %))
ret)
impl-map (loop [ret {} s impls]
(if (seq s)
(recur (assoc ret (first s) (take-while seq? (next s)))
(drop-while seq? (next s)))
ret))]
(if-let [fpp-pbs (seq (keep fast-path-protocols
(map resolve
(keys impl-map))))]
(let [fpps (into #{} (filter (partial contains? fast-path-protocols)
(map resolve
(keys impl-map))))
fpp-partitions (group-by first fpp-pbs)
fpp-partitions (into {} (map (juxt key (comp (partial map peek) val))
fpp-partitions))
fpp-partitions (into {} (map (juxt key (comp (partial reduce core/bit-or) val))
fpp-partitions))]
[fpps
(reduce (fn [ps p]
(update-in ps [p] (fnil identity 0)))
fpp-partitions
(range fast-path-protocol-partitions-count))]))))
(defn dt->et
([specs fields] (dt->et specs fields false))
([specs fields inline]
(loop [ret [] s specs]
(if (seq s)
(recur (-> ret
(conj (first s))
(into
(reduce (fn [v [f sigs]]
(conj v (vary-meta (cons f (map #(cons (second %) (nnext %)) sigs))
assoc :cljs.analyzer/fields fields
:protocol-impl true
:protocol-inline inline)))
[]
(group-by first (take-while seq? (next s))))))
(drop-while seq? (next s)))
ret))))
(defn collect-protocols [impls env]
(->> impls
(filter symbol?)
(map #(:name (cljs.analyzer/resolve-var (dissoc env :locals) %)))
(into #{})))
(defmacro deftype [t fields & impls]
(let [r (:name (cljs.analyzer/resolve-var (dissoc &env :locals) t))
[fpps pmasks] (prepare-protocol-masks &env t impls)
protocols (collect-protocols impls &env)
t (vary-meta t assoc
:protocols protocols
:skip-protocol-flag fpps) ]
(if (seq impls)
`(do
(deftype* ~t ~fields ~pmasks)
(set! (.-cljs$lang$type ~t) true)
(set! (.-cljs$lang$ctorPrSeq ~t) (fn [this#] (list ~(core/str r))))
(extend-type ~t ~@(dt->et impls fields true))
~t)
`(do
(deftype* ~t ~fields ~pmasks)
(set! (.-cljs$lang$type ~t) true)
(set! (.-cljs$lang$ctorPrSeq ~t) (fn [this#] (list ~(core/str r))))
~t))))
(defn- emit-defrecord
"Do not use this directly - use defrecord"
[env tagname rname fields impls]
(let [hinted-fields fields
fields (vec (map #(with-meta % nil) fields))
base-fields fields
fields (conj fields '__meta '__extmap (with-meta '__hash {:mutable true}))]
(let [gs (gensym)
ksym (gensym "k")
impls (concat
impls
['IRecord
'IHash
`(~'-hash [this#] (caching-hash this# ~'hash-imap ~'__hash))
'IEquiv
`(~'-equiv [this# other#]
(if (and other#
(identical? (.-constructor this#)
(.-constructor other#))
(equiv-map this# other#))
true
false))
'IMeta
`(~'-meta [this#] ~'__meta)
'IWithMeta
`(~'-with-meta [this# ~gs] (new ~tagname ~@(replace {'__meta gs} fields)))
'ILookup
`(~'-lookup [this# k#] (-lookup this# k# nil))
`(~'-lookup [this# ~ksym else#]
(cond
~@(mapcat (fn [f] [`(identical? ~ksym ~(keyword f)) f]) base-fields)
:else (get ~'__extmap ~ksym else#)))
'ICounted
`(~'-count [this#] (+ ~(count base-fields) (count ~'__extmap)))
'ICollection
`(~'-conj [this# entry#]
(if (vector? entry#)
(-assoc this# (-nth entry# 0) (-nth entry# 1))
(reduce -conj
this#
entry#)))
'IAssociative
`(~'-assoc [this# k# ~gs]
(condp identical? k#
~@(mapcat (fn [fld]
[(keyword fld) (list* `new tagname (replace {fld gs '__hash nil} fields))])
base-fields)
(new ~tagname ~@(remove #{'__extmap '__hash} fields) (assoc ~'__extmap k# ~gs) nil)))
'IMap
`(~'-dissoc [this# k#] (if (contains? #{~@(map keyword base-fields)} k#)
(dissoc (with-meta (into {} this#) ~'__meta) k#)
(new ~tagname ~@(remove #{'__extmap} fields)
(not-empty (dissoc ~'__extmap k#))
nil)))
'ISeqable
`(~'-seq [this#] (seq (concat [~@(map #(list `vector (keyword %) %) base-fields)]
~'__extmap)))
'IPrintable
`(~'-pr-seq [this# opts#]
(let [pr-pair# (fn [keyval#] (pr-sequential pr-seq "" " " "" opts# keyval#))]
(pr-sequential
pr-pair# (core/str "#" ~(name rname) "{") ", " "}" opts#
(concat [~@(map #(list `vector (keyword %) %) base-fields)]
~'__extmap))))
])
[fpps pmasks] (prepare-protocol-masks env tagname impls)
protocols (collect-protocols impls env)
tagname (vary-meta tagname assoc
:protocols protocols
:skip-protocol-flag fpps)]
`(do
(~'defrecord* ~tagname ~hinted-fields ~pmasks)
(extend-type ~tagname ~@(dt->et impls fields true))))))
(defn- build-positional-factory
[rsym rname fields]
(let [fn-name (symbol (core/str '-> rsym))]
`(defn ~fn-name
[~@fields]
(new ~rname ~@fields))))
(defn- build-map-factory
[rsym rname fields]
(let [fn-name (symbol (core/str 'map-> rsym))
ms (gensym)
ks (map keyword fields)
getters (map (fn [k] `(~k ~ms)) ks)]
`(defn ~fn-name
[~ms]
(new ~rname ~@getters nil (dissoc ~ms ~@ks)))))
(defmacro defrecord [rsym fields & impls]
(let [r (:name (cljs.analyzer/resolve-var (dissoc &env :locals) rsym))]
`(let []
~(emit-defrecord &env rsym r fields impls)
(set! (.-cljs$lang$type ~r) true)
(set! (.-cljs$lang$ctorPrSeq ~r) (fn [this#] (list ~(core/str r))))
~(build-positional-factory rsym r fields)
~(build-map-factory rsym r fields)
~r)))
(defmacro defprotocol [psym & doc+methods]
(let [p (:name (cljs.analyzer/resolve-var (dissoc &env :locals) psym))
psym (vary-meta psym assoc :protocol-symbol true)
ns-name (-> &env :ns :name)
fqn (fn [n] (symbol (core/str ns-name "." n)))
prefix (protocol-prefix p)
methods (if (core/string? (first doc+methods)) (next doc+methods) doc+methods)
expand-sig (fn [fname slot sig]
`(~sig
(if (and ~(first sig) (. ~(first sig) ~(symbol (core/str "-" slot)))) ;; Property access needed here.
(. ~(first sig) ~slot ~@sig)
(let [t# ~(first sig)
t# (if (nil? t#) nil t#)]
((or
(aget ~(fqn fname) (goog.typeOf t#))
(aget ~(fqn fname) "_")
(throw (missing-protocol
~(core/str psym "." fname) ~(first sig))))
~@sig)))))
method (fn [[fname & sigs]]
(let [sigs (take-while vector? sigs)
slot (symbol (core/str prefix (name fname)))
fname (vary-meta fname assoc :protocol p)]
`(defn ~fname ~@(map (fn [sig]
(expand-sig fname
(symbol (core/str slot "$arity$" (count sig)))
sig))
sigs))))]
`(do
(set! ~'*unchecked-if* true)
(def ~psym (~'js* "{}"))
~@(map method methods)
(set! ~'*unchecked-if* false))))
(defmacro satisfies?
"Returns true if x satisfies the protocol"
[psym x]
(let [p (:name (cljs.analyzer/resolve-var (dissoc &env :locals) psym))
prefix (protocol-prefix p)
xsym (bool-expr (gensym))
[part bit] (fast-path-protocols p)
msym (symbol (core/str "-cljs$lang$protocol_mask$partition" part "$"))]
`(let [~xsym ~x]
(if ~xsym
(if (or ~(if bit `(unsafe-bit-and (. ~xsym ~msym) ~bit))
~(bool-expr `(. ~xsym ~(symbol (core/str "-" prefix)))))
true
(if (coercive-not (. ~xsym ~msym))
(cljs.core/type_satisfies_ ~psym ~xsym)
false))
(cljs.core/type_satisfies_ ~psym ~xsym)))))
(defmacro lazy-seq [& body]
`(new cljs.core/LazySeq nil false (fn [] ~@body) nil))
(defmacro delay [& body]
"Takes a body of expressions and yields a Delay object that will
invoke the body only the first time it is forced (with force or deref/@), and
will cache the result and return it on all subsequent force
calls."
`(new cljs.core/Delay (atom {:done false, :value nil}) (fn [] ~@body)))
(defmacro binding
"binding => var-symbol init-expr
Creates new bindings for the (already-existing) vars, with the
supplied initial values, executes the exprs in an implicit do, then
re-establishes the bindings that existed before. The new bindings
are made in parallel (unlike let); all init-exprs are evaluated
before the vars are bound to their new values."
[bindings & body]
(let [names (take-nth 2 bindings)
vals (take-nth 2 (drop 1 bindings))
tempnames (map (comp gensym name) names)
binds (map vector names vals)
resets (reverse (map vector names tempnames))]
(cljs.analyzer/confirm-bindings &env names)
`(let [~@(interleave tempnames names)]
(try
~@(map
(fn [[k v]] (list 'set! k v))
binds)
~@body
(finally
~@(map
(fn [[k v]] (list 'set! k v))
resets))))))
(defmacro condp
"Takes a binary predicate, an expression, and a set of clauses.
Each clause can take the form of either:
test-expr result-expr
test-expr :>> result-fn
Note :>> is an ordinary keyword.
For each clause, (pred test-expr expr) is evaluated. If it returns
logical true, the clause is a match. If a binary clause matches, the
result-expr is returned, if a ternary clause matches, its result-fn,
which must be a unary function, is called with the result of the
predicate as its argument, the result of that call being the return
value of condp. A single default expression can follow the clauses,
and its value will be returned if no clause matches. If no default
expression is provided and no clause matches, an
IllegalArgumentException is thrown."
{:added "1.0"}
[pred expr & clauses]
(let [gpred (gensym "pred__")
gexpr (gensym "expr__")
emit (fn emit [pred expr args]
(let [[[a b c :as clause] more]
(split-at (if (= :>> (second args)) 3 2) args)
n (count clause)]
(cond
(= 0 n) `(throw (js/Error. (core/str "No matching clause: " ~expr)))
(= 1 n) a
(= 2 n) `(if (~pred ~a ~expr)
~b
~(emit pred expr more))
:else `(if-let [p# (~pred ~a ~expr)]
(~c p#)
~(emit pred expr more)))))
gres (gensym "res__")]
`(let [~gpred ~pred
~gexpr ~expr]
~(emit gpred gexpr clauses))))
(defmacro case [e & clauses]
(let [default (if (odd? (count clauses))
(last clauses)
`(throw (js/Error. (core/str "No matching clause: " ~e))))
assoc-test (fn assoc-test [m test expr]
(if (contains? m test)
(throw (clojure.core/IllegalArgumentException.
(core/str "Duplicate case test constant '"
test "'"
(when (:line &env)
(core/str " on line " (:line &env) " "
cljs.analyzer/*cljs-file*)))))
(assoc m test expr)))
pairs (reduce (fn [m [test expr]]
(if (seq? test)
(reduce #(assoc-test %1 %2 expr) m test)
(assoc-test m test expr)))
{} (partition 2 clauses))
esym (gensym)]
`(let [~esym ~e]
(cond
~@(mapcat (fn [[m c]] `((cljs.core/= ~m ~esym) ~c)) pairs)
:else ~default))))
(defmacro try
"(try expr* catch-clause* finally-clause?)
Special Form
catch-clause => (catch protoname name expr*)
finally-clause => (finally expr*)
Catches and handles JavaScript exceptions."
[& forms]
(let [catch? #(and (list? %) (= (first %) 'catch))
[body catches] (split-with (complement catch?) forms)
[catches fin] (split-with catch? catches)
e (gensym "e")]
(assert (every? #(clojure.core/> (count %) 2) catches) "catch block must specify a prototype and a name")
(if (seq catches)
`(~'try*
~@body
(catch ~e
(cond
~@(mapcat
(fn [[_ type name & cb]]
`[(instance? ~type ~e) (let [~name ~e] ~@cb)])
catches)
:else (throw ~e)))
~@fin)
`(~'try*
~@body
~@fin))))
(defmacro assert
"Evaluates expr and throws an exception if it does not evaluate to
logical true."
([x]
(when *assert*
`(when-not ~x
(throw (js/Error.
(cljs.core/str "Assert failed: " (cljs.core/pr-str '~x)))))))
([x message]
(when *assert*
`(when-not ~x
(throw (js/Error.
(cljs.core/str "Assert failed: " ~message "\n" (cljs.core/pr-str '~x))))))))
(defmacro for
"List comprehension. Takes a vector of one or more
binding-form/collection-expr pairs, each followed by zero or more
modifiers, and yields a lazy sequence of evaluations of expr.
Collections are iterated in a nested fashion, rightmost fastest,
and nested coll-exprs can refer to bindings created in prior
binding-forms. Supported modifiers are: :let [binding-form expr ...],
:while test, :when test.
(take 100 (for [x (range 100000000) y (range 1000000) :while (< y x)] [x y]))"
[seq-exprs body-expr]
(assert-args for
(vector? seq-exprs) "a vector for its binding"
(even? (count seq-exprs)) "an even number of forms in binding vector")
(let [to-groups (fn [seq-exprs]
(reduce (fn [groups [k v]]
(if (keyword? k)
(conj (pop groups) (conj (peek groups) [k v]))
(conj groups [k v])))
[] (partition 2 seq-exprs)))
err (fn [& msg] (throw (apply core/str msg)))
emit-bind (fn emit-bind [[[bind expr & mod-pairs]
& [[_ next-expr] :as next-groups]]]
(let [giter (gensym "iter__")
gxs (gensym "s__")
do-mod (fn do-mod [[[k v :as pair] & etc]]
(cond
(= k :let) `(let ~v ~(do-mod etc))
(= k :while) `(when ~v ~(do-mod etc))
(= k :when) `(if ~v
~(do-mod etc)
(recur (rest ~gxs)))
(keyword? k) (err "Invalid 'for' keyword " k)
next-groups
`(let [iterys# ~(emit-bind next-groups)
fs# (seq (iterys# ~next-expr))]
(if fs#
(concat fs# (~giter (rest ~gxs)))
(recur (rest ~gxs))))
:else `(cons ~body-expr
(~giter (rest ~gxs)))))]
`(fn ~giter [~gxs]
(lazy-seq
(loop [~gxs ~gxs]
(when-first [~bind ~gxs]
~(do-mod mod-pairs)))))))]
`(let [iter# ~(emit-bind (to-groups seq-exprs))]
(iter# ~(second seq-exprs)))))
(defmacro doseq
"Repeatedly executes body (presumably for side-effects) with
bindings and filtering as provided by \"for\". Does not retain
the head of the sequence. Returns nil."
[seq-exprs & body]
(assert-args doseq
(vector? seq-exprs) "a vector for its binding"
(even? (count seq-exprs)) "an even number of forms in binding vector")
(let [step (fn step [recform exprs]
(if-not exprs
[true `(do ~@body)]
(let [k (first exprs)
v (second exprs)
seqsym (when-not (keyword? k) (gensym))
recform (if (keyword? k) recform `(recur (first ~seqsym) ~seqsym))
steppair (step recform (nnext exprs))
needrec (steppair 0)
subform (steppair 1)]
(cond
(= k :let) [needrec `(let ~v ~subform)]
(= k :while) [false `(when ~v
~subform
~@(when needrec [recform]))]
(= k :when) [false `(if ~v
(do
~subform
~@(when needrec [recform]))
~recform)]
:else [true `(let [~seqsym (seq ~v)]
(when ~seqsym
(loop [~k (first ~seqsym) ~seqsym ~seqsym]
~subform
(when-let [~seqsym (next ~seqsym)]
~@(when needrec [recform])))))]))))]
(nth (step nil (seq seq-exprs)) 1)))
(defmacro array [& rest]
(let [xs-str (->> (repeat "~{}")
(take (count rest))
(interpose ",")
(apply core/str))]
(concat
(list 'js* (core/str "[" xs-str "]"))
rest)))
(defmacro js-obj [& rest]
(let [kvs-str (->> (repeat "~{}:~{}")
(take (quot (count rest) 2))
(interpose ",")
(apply core/str))]
(concat
(list 'js* (core/str "{" kvs-str "}"))
rest)))
(defmacro alength [a]
(list 'js* "~{}.length" a))
(defmacro aclone [a]
(list 'js* "~{}.slice()" a))
(defmacro amap
"Maps an expression across an array a, using an index named idx, and
return value named ret, initialized to a clone of a, then setting
each element of ret to the evaluation of expr, returning the new
array ret."
[a idx ret expr]
`(let [a# ~a