io.github.frenchy64.fully-satisfies.lazier — io.github.frenchy64/fully-satisfies 1.10.1

Variants of clojure.core functions that are slightly lazier when processing and/or returning lazy seqs.

Some common (anti)patterns were to blame for the less-lazy versions of these functions. The main insight was that if you are using a counter to bound how many elements of a seq you are walking, you can be lazier by testing the counter before testing for more elements. For example,

int n = 0;
while(iter.hasNext() && n < CHUNK_SIZE)

will force n+1 elements and

int n = 0;
while(n < CHUNK_SIZE && iter.hasNext())

will force n elements. In this case, realizing the extra element has no utility because the chunk only fits CHUNK_SIZE elements.

Another problematic pattern was using seq-based implementations for sequence functions. Seqs must be non-empty, but a sequence can be empty, so implementations can be lazier.

bounded-count clj

(bounded-count n coll)

If coll is counted? returns its count, else will count at most the first n elements of coll using its seq.

lazier/bounded-count additionally:

• does not force coll if n==0
• forces at most n elements of a lazy seq instead of n+1.

bounded-count' clj

(bounded-count' n coll)

If coll is counted? returns its count, else will count at most the first n elements of coll using its seq, short-circuiting if a counted? seq is found within n-1 nexts.

lazier/bounded-count' additionally:

• does not force coll if n==0
• forces at most n elements of a lazy seq instead of n+1.

cycle clj

(cycle coll)

Returns a lazy (infinite!) sequence of repetitions of the items in coll.

lazier/cycle does not realize a lazy seq coll until it is needed.

dedupe clj

(dedupe)

(dedupe coll)

Returns a lazy sequence removing consecutive duplicates in coll. Returns a transducer when no collection is provided.

lazier/dedupe additionally:

• does not force a lazy seq until needed
• forces 32 elements per chunk instead of 33, preserving 32 elements per chunk.
• transducer arity behaves correctly for all inputs (including :clojure.core/none)

iterator-seq clj

(iterator-seq iter)

Returns a seq on a java.util.Iterator. Note that most collections providing iterators implement Iterable and thus support seq directly. Seqs cache values, thus iterator-seq should not be used on any iterator that repeatedly returns the same mutable object.

lazier/iterator-seq additionally:

• forces 32 elements per chunk instead of 33, preserving 32 elements per chunk.

sequence clj

(sequence coll)

(sequence xform coll)

(sequence xform coll & colls)

Coerces coll to a (possibly empty) sequence, if it is not already one. Will not force a lazy seq. (sequence nil) yields (). When a transducer is supplied, returns a lazy sequence of applications of the transform to the items in coll(s), i.e. to the set of first items of each coll, followed by the set of second items in each coll, until any one of the colls is exhausted. Any remaining items in other colls are ignored. The transform should accept number-of-colls arguments.

lazier/sequence additionally:

• avoids realizing the first element of the return until it is needed.
• realizes 32 elements per chunk instead of 33, preserving 32 elements per chunk.
• fixes a comma in the docstring.