refactoring - 你能帮我重构这段clojure代码来生成seq吗？

Question

我想生成一个序列，稍后我可以对其进行(映射)。它应该看起来像这样:

((0 0) (0 1) (0 2) (0 3) ... (7 7))

为了产生如此简单的结果，我现在必须执行的这段代码看起来非常非常难看。我需要一些帮助来弄清楚这一点。

(loop [y 0 x 0 args (list)]  
  (if (and (= y 7) (= x 7))  
    (reverse (conj args (list y x)))  
    (if (= x 7)  
    (recur (+ y 1) 0 (conj args (list y x)))  
    (recur y (+ x 1) (conj args (list y x))))))  

Answer 1

(let [my-range (range 0 8)]
  (for [i my-range
        j my-range]
      (list i j)))


=> ((0 0) (0 1) (0 2) (0 3) (0 4) (0 5) (0 6) (0 7)
    (1 0) (1 1) (1 2) (1 3) (1 4) (1 5) (1 6) (1 7)
    ...
    (7 0) (7 1) (7 2) (7 3) (7 4) (7 5) (7 6) (7 7))

---

for 类似于 doseq，但它收集结果:

(for   [i [1 2 3]] i)           => (1 2 3)
(doseq [i [1 2 3]] (print i))   => nil