Possible tweaks to code example at http://swannodette.github.io/2013/07/12/communicating-sequential-processes/

CSP cljs example tweaks

;; proposed change #1, objective: make update to q more evident
(defn peekn
  "Returns vector of (up to) n items from the end of vector v"
  [v n]
  (if (> (count v) n)
    (subvec v (- (count v) n))
    v))

(let [el  (by-id "ex0")
      out (by-id "ex0-out")]
  (go (loop [q []]
        (set-html out (render q))
        (recur (-> (conj q (<! c)) (peekn 10))))))

;; proposed change #2, objective: reduce verbosity of loop/recur
(go (while true (<! (timeout 250)) (>! c 1)))
(go (while true (<! (timeout 1000)) (>! c 2)))
(go (while true (<! (timeout 1500)) (>! c 3)))