refactor: registry pattern for jolt-pr-str/pr-readable + remaining arms (jolt-lmot)
The printer's two entry points (jolt-pr-str in rt.ss, jolt-pr-readable in printing.ss) get register-pr-str-arm! / register-pr-readable-arm!, plus register-pr-arm! for the types whose str and readable forms match (bigdec/inst/uuid/tagged/record/ns/var). The normalize arms (sorted, lazy-seq, queue) and the uri readable arm register per-printer. Also folds in the hash (dyn-binding var-cell), class (io uri/uuid/file), and get (transients) arms missed earlier. natives-array's get stays a case-lambda wrapper on purpose: its 2-arg path errors on an out-of-bounds index while the 3-arg path returns the default, an arity distinction the (coll k d) registry collapses — left as-is to preserve behaviour. Completes jolt-lmot: all six dispatchers (hash/class/get/=/pr-str/pr-readable) off the set!-rebind chains. make test green, 0 new corpus divergences; pr-str/str of inst, uuid, bigdec, sorted-map, record-with-lazyseq, queue all verified.
This commit is contained in:
parent
acf3e1ffd3
commit
9a21325972
14 changed files with 48 additions and 64 deletions
|
|
@ -169,11 +169,7 @@
|
|||
|
||||
;; Redefine the native get/count/contains?/nth (captured first) so the existing
|
||||
;; emit lowerings unwrap a transient; non-transients are untouched.
|
||||
(define %prev-jolt-get jolt-get)
|
||||
(set! jolt-get
|
||||
(case-lambda
|
||||
((coll k) (if (jolt-transient? coll) (t-get coll k jolt-nil) (%prev-jolt-get coll k)))
|
||||
((coll k d) (if (jolt-transient? coll) (t-get coll k d) (%prev-jolt-get coll k d)))))
|
||||
(register-get-arm! jolt-transient? (lambda (coll k d) (t-get coll k d)))
|
||||
(define %prev-jolt-count jolt-count)
|
||||
(set! jolt-count (lambda (coll) (if (jolt-transient? coll) (t-count coll) (%prev-jolt-count coll))))
|
||||
(define %prev-jolt-contains? jolt-contains?)
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue