Skip to content

Instantly share code, notes, and snippets.

What would you like to do?
;; 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?]
(seq [_]
((fn step [seed]
(cons seed
(when (continue? seed)
(lazy-seq (step (f seed))))))
(reduce [_ rf init]
(loop [seed (f)
ret (rf init seed)]
(if (reduced? ret)
(if (continue? seed)
(let [next (f seed)]
(recur next (rf ret next)))
(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]
(seq [_]
((fn step []
(let [v (f)]
(if (identical? v fin)
(cons v (new clojure.lang.LazySeq step)))))))
(reduce [_ rf init]
(loop [res init]
(let [v (f)]
(if (identical? v fin)
(let [res (rf res v)]
(if (reduced? res)
(recur res)))))))
;; supply
(supply #(or (.readLine ^BufferedReader rdr) ::eof) ::eof)
;; series
(let [api (fn ([]
(GET "/initial"))
(GET (next-link response))))]
(series api next-link))

This comment has been minimized.

Copy link

@Ramblurr Ramblurr commented Dec 18, 2017

Found this gist via the jira ticket.. I'm tackling the exact problem of properly paging through a http api.

How does one get the result returned by series?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
You can’t perform that action at this time.