Joseph Ferano
d6fc15474b
The author: "I think I prefer length over len, because then I'll use len as the variable name". One arm in check.ml, one row in the table beside it, and every (len x) in lib, test, examples, vendor, spike, docs, web, emacs, plan.org and NEXT.md rewritten. Shadowing and builtin/ had already taken most of the sting out: a (defn len ...) was legal and won in its own file, and builtin/len reached past it. What was left is that len was still a builtin — the defn earned a warning, and a wrapper had to say builtin/ at every inner call. Now there is nothing under the short name: len is an ordinary identifier in every position, which is what (let [len (length xs)] ...) wants. length takes over as shadowing's worked example rather than the feature losing one. shadow-builtin.flan, builtin-qualified.flan, pkgs/shadowed and the builtin/ rows in test_flan move to it and go on testing shadowing. A call to a len nothing defines is answered where an unknown function is, after every table and after the shadowing guard, so a program with its own len never reaches it. The sentence is said rather than guessed at — len and length are three edits apart and the did-you-mean's net is one — and the call is written back out through spell_arg, as-slice's spelling lifted out of it and now shared, so what is printed compiles. sand.flan:33 still calls the old name and is the author's to change; until it does, test_acceptance and test_session abort there. Both were run green against a copy with that one line changed. FIX.org says so.
51 lines
2.0 KiB
Plaintext
51 lines
2.0 KiB
Plaintext
;; The prelude's function-taking family: map-in-place, filter, reduce and a comparator
|
|
;; sort. These were the four the second tier could not write, and they arrived
|
|
;; the day function values did — so what this checks is that they are ordinary
|
|
;; prelude functions, called the ordinary way, with the function passed by
|
|
;; name or written inline.
|
|
|
|
(defn triple [x i32] i32 (* x 3))
|
|
(defn odd? [x i32] bool (= (% x 2) 1))
|
|
(defn adds [a i32 b i32] i32 (+ a b))
|
|
(defn longer-first [a i32 b i32] bool (> a b))
|
|
(defn halve [x f32] f32 (/ x 2.0))
|
|
(defn big? [x f32] bool (> x 1.0))
|
|
|
|
(defn main [] i32
|
|
;; map-in-place writes back into the slice it was handed.
|
|
(let [xs [1 2 3 4]
|
|
s (slice xs 0 4)]
|
|
(map-in-place s triple)
|
|
(print (at s 0)) (print " ") (print (at s 3)) (println "")
|
|
|
|
;; reduce, with the accumulator first in the step. The prelude's own
|
|
;; sum-i32 is this with the + written in.
|
|
(print (reduce s 0 adds)) (println "")
|
|
;; ... and an fn literal, whose parameter types come from the parameter.
|
|
(print (reduce s 1 (fn [a b] (* a b)))) (println "")
|
|
|
|
;; filter allocates and the caller frees.
|
|
(let [v (filter s odd?)]
|
|
(print (length v)) (print " ") (print (at v 0)) (println "")
|
|
(free v))
|
|
|
|
;; A comparator sort, both directions off the same slice.
|
|
(sort-by s longer-first)
|
|
(print (at s 0)) (print " ") (print (at s 3)) (println "")
|
|
(sort-by s (fn [a b] (< a b)))
|
|
(print (at s 0)) (print " ") (print (at s 3)) (println ""))
|
|
|
|
;; The f32 half of the family, which is the same code at the other element
|
|
;; type — the copy that generics would remove.
|
|
(let [ys [(f32 4.0) (f32 1.0) (f32 8.0) (f32 2.0)]
|
|
t (slice ys 0 4)]
|
|
(map-in-place t halve)
|
|
(print (at t 0)) (print " ") (print (at t 2)) (println "")
|
|
(print (reduce t 0.0 (fn [a b] (+ a b)))) (println "")
|
|
(let [w (filter t big?)]
|
|
(print (length w)) (println "")
|
|
(free w))
|
|
(sort-by t (fn [a b] (> a b)))
|
|
(print (at t 0)) (print " ") (print (at t 3)) (println ""))
|
|
0)
|