unified generators

productions.clj

;;
;; Example usages at the bottom of the file
;;

(defn productions
  "Returns a sequence of values by repeatedly calling `produce!` until it
   returns `fin`. The sequence can be used lazily/caching or reducible/non-caching.

   The arity-2 variant's `produce!` takes no arguments and returns a value
     or the terminator.

   The arity-3 variant takes an initial state `s`, and its `produce!` function
    takes the state and returns the next state or terminator.  Each state will appear
    in the sequence."
  ([produce! fin]
   (reify
     clojure.lang.Sequential
     clojure.lang.Seqable
     (seq [_]
       ((fn step-fn []
          (let [val (produce!)]
            (if (identical? fin val)
              nil
              (cons val (lazy-seq (step-fn))))))))
     IReduceInit
     (reduce [_ rf init]
       (loop [res init]
         (let [v (produce!)]
           (if (identical? fin v)
             res
             (let [res (rf res v)]
               (if (reduced? res)
                 @res
                 (recur res)))))))))
  ([s produce! fin]
   (reify
     clojure.lang.Sequential
     clojure.lang.Seqable
     (seq [_]
       ((fn step-fn [s]
          (if (identical? fin s)
            nil
            (cons s (lazy-seq (step-fn (produce! s))))))
        s))
     clojure.lang.IReduceInit
     (reduce [_ rf init]
       (loop [acc init
              s s]
         (if (identical? fin s)
           acc
           (let [acc (rf acc s)]
             (if (reduced? acc)
               @acc
               (recur acc (produce! s))))))))))
             
             
;;;; two arity
;; (defn faster-line-seq
;;   [^BufferedReader rdr]
;;   (productions #(or (.readLine rdr) ::eos) ::eos))

;;;; three-arity w/ internal state
;; user> (vec (productions 10 (fn [i]
;;                              (if (> i 5) (dec i) :fin)) :fin))
;; [10 9 8 7 6 5]
;; this arity is useful for expressing things like paginating API calls

new version

(defn supply
  "Produces a sequence of values by repeatedly calling `f` for side-effects
    until it returns `fin`. The sequence can be used lazily/caching or
   reducible/non-caching. Not guaranteed to produce any values"
  [f fin]
  (reify
    clojure.lang.Seqable
    (seq [_]
      ((fn step []
         (let [v (f)]
           (if (identical? v fin)
             nil
             (cons v (new clojure.lang.LazySeq step)))))))
    clojure.lang.IReduceInit
    (reduce [_ rf init]
      (loop [res init]
        (let [v (f)]
          (if (identical? v fin)
            res
            (let [res (rf res v)]
              (if (reduced? res)
                @res
                (recur res)))))))
    clojure.lang.Sequential))

;; differences from scheme unfold
;; even initial value is lazy
;; predicate sense reversed
;; internal state == produced value, no special mapper-fn
;; no tail-gen
(defn series
  "Produces a sequence of values.

   `f` is a function that given a value, returns the next value.
   `continue?` is a predicate that determines whether to produce
    the next value. `f` called with no arguments produces the
    initial value. Always produces at least one value."
  [f continue?]
  (reify
    clojure.lang.Seqable
    (seq [_]
      ((fn step [seed]
         (cons seed
               (when (continue? seed)
                 (lazy-seq (step (f seed))))))
       (f)))
    clojure.lang.IReduceInit
    (reduce [_ rf init]
       (loop [seed (f)
             ret (rf init seed)]
        (if (reduced? ret)
          @ret
          (if (continue? seed)
            (let [next (f seed)]
               (recur next (rf ret next)))
            ret))))
    clojure.lang.Sequential))

Usage

;; supply
(supply #(or (.readLine ^BufferedReader rdr) ::eof) ::eof)

;; series
(let [api (fn ([]
	        (GET "/initial"))
	      ([response]
	        (GET (next-link response))))]
	(series api next-link))