64b1c60939
partition-by (10-seq.clj): ported canonical lazy implementation from CLJS — lazy-seq + cons + take-while, matching Clojure/CLJS exactly. Fixes the third and final remaining leak from Step 3. dedupe (20-coll.clj): replaced eager vec-based impl with lazy step function using lazy-seq + cons. Infinite input no longer hangs. trampoline (20-coll.clj): pure HOF ported from CLJS — recur until non-function result. Removed core-trampoline + binding from Janet. rand-int (20-coll.clj): thin overlay over Janet math/random + math/floor. Removed core-rand-int + binding from Janet. Removed core-partition-by + binding from core.janet (now in overlay). Tests: added dedupe infinite-input case to lazy-infinite harness. 22/22 pass. Conformance 229x3. Specs 32/32.
36 lines
1.5 KiB
Clojure
36 lines
1.5 KiB
Clojure
;; clojure.core — seq tier. Pure-Clojure leaf sequence fns on top of the kernel
|
|
;; tier (00-kernel) and the Janet seed. Loaded after the kernel tier; in compile
|
|
;; mode these self-host through the now-built analyzer (interpreted otherwise).
|
|
;;
|
|
;; Migration rule for adding fns here: the fn must (1) NOT be in
|
|
;; compiler/core-renames (that map emits core-X Janet symbols directly), (2) have
|
|
;; no internal Janet callers of its core-X binding, and (3) NOT be used by the
|
|
;; self-hosted compiler (jolt-core/jolt/*.clj). Compiler-facing structural fns go
|
|
;; in the kernel tier (00-kernel) instead — see its header.
|
|
|
|
(defn ffirst [coll] (first (first coll)))
|
|
(defn nfirst [coll] (next (first coll)))
|
|
(defn fnext [coll] (first (next coll)))
|
|
(defn nnext [coll] (next (next coll)))
|
|
|
|
;; Canonical Clojure defs: pure first/next/loop/recur, no Janet realize-for-iteration.
|
|
(defn last [s]
|
|
(if (next s) (recur (next s)) (first s)))
|
|
|
|
(defn butlast [s]
|
|
(loop [ret [] s s]
|
|
(if (next s)
|
|
(recur (conj ret (first s)) (next s))
|
|
(seq ret))))
|
|
|
|
;; Lazy partition-by: groups consecutive elements by (f x), matching Clojure/CLJS.
|
|
(defn partition-by [f coll]
|
|
(let [step (fn step [s]
|
|
(lazy-seq
|
|
(let [s (seq s)]
|
|
(when s
|
|
(let [fst (first s)
|
|
fv (f fst)
|
|
run (cons fst (take-while (fn [x] (= fv (f x))) (rest s)))]
|
|
(cons run (step (lazy-seq (drop (count run) s)))))))))]
|
|
(step coll)))
|