fix: keyword/set/map as IFn in higher-order fns; nil-seq; take-nth/interpose/sort-by/min-key arities

Biggest fix: jolt keywords are Janet keywords and maps are Janet structs/phm, but
(:a struct) at the Janet level returns nil (not a Clojure accessor) and errors on
a phm — so core-map/filter/sort-by/group-by/etc. calling (f x) directly broke the
ubiquitous keyword/set/map-as-function idioms ((map :a coll), (sort-by :k coll),
(filter a-set coll), (group-by :type coll)). Added as-fn coercion (keyword/symbol
-> key lookup, map -> key lookup, set -> membership) applied at the entry of
map/filter/remove/keep/mapv/filterv/sort-by/group-by/partition-by/some/
not-any?/not-every?/take-while/drop-while/min-key/max-key.

Also:
- realize-for-iteration treats nil as an empty seq (Clojure semantics), fixing
  nth/nthrest/nthnext/take-last/reduce/doseq over nil.
- take-nth and interpose gained their 1-arg transducer arities.
- sort-by gained the 3-arg (keyfn comparator coll) form.
- min-key/max-key: single item returns it without calling f; ties keep the last.
- underive gained the 2-arg global-hierarchy form.

clojure-test-suite pass 3535->3649, errors 177->122, clean files 39->44.
spec: seq/IFn-values-as-functions (11). jpm test green.

src/jolt/core.janet

@@ -69,6 +69,8 @@
   set -> seq, lazy-seq -> realized array; others pass through. Warning: will
   loop on infinite lazy-seqs. Terminates on the empty cell, not on nil."
   (cond
+    # nil is an empty seq in Clojure — iterating it yields nothing.
+    (nil? c) @[]
     (pvec? c) (pv->array c)
     (plist? c) (pl->array c)
     (set? c) (phs-seq c)
@@ -432,6 +434,19 @@
             (and (number? key) (>= key 0) (< key (length coll)))
             false))))))))
 
+# Coerce a Clojure IFn value to a Janet-callable fn for higher-order fns
+# (map/filter/sort-by/group-by/...). Janet functions pass through; a keyword or
+# symbol becomes a key lookup, a map a key lookup, a set a membership test — so
+# (map :k coll), (sort-by :k coll), (filter a-set coll) work.
+(defn- as-fn [f]
+  (cond
+    (or (function? f) (cfunction? f)) f
+    (keyword? f) (fn [x &opt d] (core-get x f d))
+    (core-symbol? f) (fn [x &opt d] (core-get x f d))
+    (phm? f) (fn [k &opt d] (core-get f k d))
+    (set? f) (fn [x &opt d] (if (core-contains? f x) x d))
+    true f))
+
 # Sorted collections — minimal: backed by a struct (map) / sorted array (set),
 # ordered by key/element on read. Defined early so seq/count/get can dispatch.
 (defn core-sorted-map? [x] (and (table? x) (= :jolt/sorted-map (x :jolt/type))))
@@ -709,6 +724,7 @@
     (or (nil? c) (= 0 (length c)))))
 
 (defn core-map [f & colls]
+  (def f (as-fn f))
   (if (= 0 (length colls))
     (td-map f)   # transducer arity
   (if (= 1 (length colls))
@@ -773,6 +789,7 @@
       (make-lazy-seq (step init-cs init-idxs init-reals))))))
 
 (defn core-filter [pred & rest]
+  (def pred (as-fn pred))
   (if (= 0 (length rest)) (td-filter pred)
    (let [coll (in rest 0)]
    (if (lazy-seq? coll)
@@ -794,6 +811,7 @@
       (if (jvec? coll) (make-vec result) result))))))
 
 (defn core-remove [pred & rest]
+  (def pred (as-fn pred))
   (if (= 0 (length rest)) (td-remove pred)
     (core-filter (fn [x] (not (pred x))) (in rest 0))))
 
@@ -877,6 +895,7 @@
     (if (= 0 (length c)) nil (tuple ;(array/slice c start)))))
 
 (defn core-take-while [pred & rest]
+ (def pred (as-fn pred))
  (if (= 0 (length rest)) (td-take-while pred)
   (let [coll (in rest 0)]
   (if (lazy-seq? coll)
@@ -893,6 +912,7 @@
       (if (jvec? coll) (make-vec result) result))))))
 
 (defn core-drop-while [pred & rest]
+ (def pred (as-fn pred))
  (if (= 0 (length rest)) (td-drop-while pred)
   (let [coll (in rest 0)
         c (realize-for-iteration coll)]
@@ -1046,12 +1066,21 @@
           (sort arr))
         (tuple/slice (tuple ;arr))))))
 
-(defn core-sort-by [keyfn coll]
+# (sort-by keyfn coll) or (sort-by keyfn comparator coll). The comparator (when
-  (if (nil? coll) (break @[]))
+# given) compares the KEYS and may return a boolean or a Clojure-style number.
-  (var c (realize-for-iteration coll))
+(defn core-sort-by [keyfn & rest]
-  (let [arr (if (tuple? c) (array/slice c) c)
+  (def keyfn (as-fn keyfn))
-        sorted (sort-by keyfn arr)]
+  (let [has-cmp (> (length rest) 1)
-    (if (tuple? c) (tuple/slice (tuple ;sorted)) sorted)))
+        coll (if has-cmp (in rest 1) (first rest))]
+    (if (nil? coll) (tuple)
+      (let [c (realize-for-iteration coll)
+            arr (if (tuple? c) (array/slice c) (array/slice c))]
+        (if has-cmp
+          (let [cmp (first rest)]
+            (sort arr (fn [x y] (let [r (cmp (keyfn x) (keyfn y))]
+                                  (if (number? r) (< r 0) (truthy? r))))))
+          (sort-by keyfn arr))
+        (tuple/slice (tuple ;arr))))))
 
 (defn core-distinct [coll]
   (if (nil? coll) @[]
@@ -1075,6 +1104,7 @@
       (if (jvec? coll) (make-vec result) result)))))
 
 (defn core-group-by [f coll]
+  (def f (as-fn f))
   # phm base so collection keys group by value
   (var result (make-phm))
   (each x (realize-for-iteration coll)
@@ -1105,6 +1135,7 @@
     result))
 
 (defn core-partition-by [f coll]
+  (def f (as-fn f))
   (var result @[])
   (var part @[])
   (var last-k nil)
@@ -2339,7 +2370,10 @@
   (let [[h tag] (if (= 1 (length args)) [the-global-hierarchy (in args 0)] args)
         p (get (h :parents) tag)]
     (if p (make-phs p) (make-phs))))
-(def core-underive underive)
+(defn core-underive [& args]
+  (case (length args)
+    2 (let [[tag parent] args] (underive the-global-hierarchy tag parent) nil)
+    3 (let [[h tag parent] args] (underive h tag parent))))
 (def core-get-method (fn [mm-var dispatch-val]
   (let [methods (get mm-var :jolt/methods)]
     (or (get methods dispatch-val) (get methods :default)))))
@@ -2749,10 +2783,17 @@
     (while (and (< i (length c)) (truthy? (pred (in c i)))) (++ i))
     [(tuple/slice (tuple ;(array/slice c 0 i))) (tuple/slice (tuple ;(array/slice c i)))]))
 
-(defn core-take-nth [n coll]
+(defn- td-take-nth [n]
-  (let [c (realize-for-iteration coll) r @[]]
+  (fn [rf]
+    (var i 0)
+    (fn [& a] (case (length a) 0 (rf) 1 (rf (a 0))
+                (let [keep (= 0 (mod i n))] (++ i)
+                  (if keep (rf (a 0) (a 1)) (a 0)))))))
+(defn core-take-nth [n & rest]
+  (if (= 0 (length rest)) (td-take-nth n)
+    (let [c (realize-for-iteration (in rest 0)) r @[]]
       (var i 0) (while (< i (length c)) (array/push r (in c i)) (+= i n))
-    (tuple/slice (tuple ;r))))
+      (tuple/slice (tuple ;r)))))
 
 (defn core-nthrest [coll n]
   (let [c (realize-for-iteration coll)]
@@ -2766,10 +2807,12 @@
     (if (<= (length c) 1) nil (tuple/slice (tuple ;(array/slice c 0 (- (length c) 1)))))))
 
 (defn core-filterv [pred coll]
+  (def pred (as-fn pred))
   (let [r @[]] (each x (realize-for-iteration coll) (when (truthy? (pred x)) (array/push r x)))
     (make-vec r)))
 
 (defn core-mapv [f & colls]
+  (def f (as-fn f))
   (let [r @[]]
     (if (= 1 (length colls))
       (each x (realize-for-iteration (colls 0)) (array/push r (f x)))
@@ -2778,15 +2821,23 @@
         (var i 0) (while (< i n) (array/push r (apply f (map (fn [c] (in c i)) cs))) (++ i))))
     (make-vec r)))
 
-(defn core-interpose [sep coll]
+(defn- td-interpose [sep]
-  (let [items (realize-for-iteration coll) r @[]]
+  (fn [rf]
+    (var started false)
+    (fn [& a] (case (length a) 0 (rf) 1 (rf (a 0))
+                (if started (rf (rf (a 0) sep) (a 1))
+                  (do (set started true) (rf (a 0) (a 1))))))))
+(defn core-interpose [sep & rest]
+  (if (= 0 (length rest)) (td-interpose sep)
+    (let [items (realize-for-iteration (in rest 0)) r @[]]
       (var first? true)
       (each x items (if first? (set first? false) (array/push r sep)) (array/push r x))
-    (tuple ;r)))
+      (tuple ;r))))
 
 (defn core-some-search
   "(some pred coll) — first truthy (pred x), else nil."
   [pred coll]
+  (def pred (as-fn pred))
   (var result nil)
   (each x (realize-for-iteration coll)
     (let [r (pred x)] (when (truthy? r) (set result r) (break))))
@@ -2795,6 +2846,7 @@
 (defn core-keep
   "(keep f coll) — (f x) for each x, dropping nils. (keep f) is a transducer."
   [f & rest]
+  (def f (as-fn f))
   (if (= 0 (length rest))
     (td-keep f)
     (let [r @[]]
@@ -2873,20 +2925,28 @@
   (each x xs (if (get seen x) (set ok false) (put seen x true)))
   ok)
 
+# With a single item, Clojure returns it WITHOUT calling f. On ties, the last
+# extremal item wins (>=/<= update), matching Clojure.
 (defn core-min-key [f & xs]
-  (var best (first xs)) (var bestv (f best))
+  (def f (as-fn f))
-  (each x (array/slice xs 1) (let [v (f x)] (when (< v bestv) (set best x) (set bestv v))))
+  (if (= 1 (length xs)) (first xs)
-  best)
+    (do (var best (first xs)) (var bestv (f best))
+        (each x (array/slice xs 1) (let [v (f x)] (when (<= v bestv) (set best x) (set bestv v))))
+        best)))
 
 (defn core-max-key [f & xs]
-  (var best (first xs)) (var bestv (f best))
+  (def f (as-fn f))
-  (each x (array/slice xs 1) (let [v (f x)] (when (> v bestv) (set best x) (set bestv v))))
+  (if (= 1 (length xs)) (first xs)
-  best)
+    (do (var best (first xs)) (var bestv (f best))
+        (each x (array/slice xs 1) (let [v (f x)] (when (>= v bestv) (set best x) (set bestv v))))
+        best)))
 
 (defn core-not-every? [pred coll]
+  (def pred (as-fn pred))
   (not (do (var ok true) (each x (realize-for-iteration coll) (when (not (truthy? (pred x))) (set ok false))) ok)))
 
 (defn core-not-any? [pred coll]
+  (def pred (as-fn pred))
   (do (var none true) (each x (realize-for-iteration coll) (when (truthy? (pred x)) (set none false))) none))
 
 (defn core-vary-meta [obj f & args]

test/integration/clojure-test-suite-test.janet

@@ -18,9 +18,9 @@
 
 # Baseline: assertions Jolt currently passes across the suite. Raise as Jolt
 # improves so a regression (previously-passing assertion breaking) is caught.
-(def baseline-pass 3450)
+(def baseline-pass 3600)
 # A file is "clean" when it ran with zero failures AND zero errors.
-(def baseline-clean-files 38)
+(def baseline-clean-files 43)
 # Per-file wall-clock budget (seconds). Normal files finish in well under 1s;
 # this only fires on infinite-sequence hangs.
 (def per-file-timeout 6)

test/spec/sequences-spec.janet

@@ -103,3 +103,18 @@
   ["take cycle"             "[1 2 1 2 1]" "(take 5 (cycle [1 2]))"]
   ["take repeatedly"        "3"           "(count (take 3 (repeatedly (fn [] 1))))"]
   ["take-last of range"     "[8 9]"       "(take-last 2 (range 10))"])
+
+# Clojure IFn values used as the function arg to higher-order fns: a keyword or
+# symbol looks up a key, a set tests membership, a map looks up a key.
+(defspec "seq / IFn values as functions"
+  ["map keyword"        "[1 2 3]"        "(map :a [{:a 1} {:a 2} {:a 3}])"]
+  ["filter keyword"     "[{:ok true}]"   "(filter :ok [{:ok true} {:ok false}])"]
+  ["remove keyword"     "[{:ok false}]"  "(remove :ok [{:ok true} {:ok false}])"]
+  ["sort-by keyword"    "[{:a 1} {:a 2} {:a 3}]" "(sort-by :a [{:a 3} {:a 1} {:a 2}])"]
+  ["sort-by key + cmp"  "[{:a 3} {:a 2} {:a 1}]" "(sort-by :a > [{:a 3} {:a 1} {:a 2}])"]
+  ["filter set"         "[2 4]"          "(filter #{2 4} [1 2 3 4 5])"]
+  ["remove set"         "[1 3 5]"        "(remove #{2 4} [1 2 3 4 5])"]
+  ["group-by keyword"   "{1 [{:n 1}], 2 [{:n 2}]}" "(group-by :n [{:n 1} {:n 2}])"]
+  ["map a map"          "[1 nil 2]"      "(map {:a 1 :b 2} [:a :z :b])"]
+  ["take-nth transducer" "[0 2 4 6 8]"   "(into [] (take-nth 2) (range 10))"]
+  ["interpose transducer" "[1 :x 2]"     "(into [] (interpose :x) [1 2])"])