某大佬说一年要学习一门新语言,最近入了clojure这个坑。
模仿haskell定义了一个无穷质数lazy序列
(def primes
(letfn [(primes-parts [part]
(lazy-seq
(when-let [[p & xs] (seq part)]
(let [cannot-div? #(not= 0 (mod % p))]
(cons p (primes-parts (filter cannot-div? xs)))))))]
(primes-parts (iterate inc 2))))
;;
user=> (take 10 primes)
(2 3 5 7 11 13 17 19 23 29)
user=> (nth primes 100)
547
user=> (first (filter #(> % 10000) primes))
10007
不过由于JVM不支持尾递归优化,当调用栈太深时会抛异常
user=> (nth primes 10000)
StackOverflowError clojure.lang.RT.first (RT.java:667)
恩,函数式编程还是haskell好玩点。
-- haskell写法
primes = filterPrime [2..]
where filterPrime (p:xs) =
p : filterPrime [x | x <- xs, x `mod` p /= 0]
--
*Main> take 10 primes
[2,3,5,7,11,13,17,19,23,29]
*Main> primes !! 10000
104743
*Main> primes !! 20000
224743