Convert a stream, supplier, or an iterable into an iterator.

Create an iterator for any primitive or object java array.

Given a blocking queue return an iterable that iterates until queue returns term-symbol. Uses take to block indefinitely -- will throw any throwable that comes out of the queue.

Return an iterable that always returns a arg.

Return a current iterator - and iterator that retains the current object. This iterator is positioned just before the first object so it's current item is nil.

Execute body for every item in the iterable. Expecting side effects, returns nil.

Given an iterator or nil return true if the iterator has next.

Produce a new iterator that points to vv then defers to passed in iterator.

take n from an iterator returning a new iterator

Returns {:data :rest*} where rest* resolves to an iterator once data has been completely consumed.

Create an iterable. init-fn is not called until the first has-next call.

• valid? - ctx->boolean - defaults to non-nil?
• init-fn - creates new ctx
• update-fn - function from ctx->ctx
• val-fn - function from ctx->val - defaults to deref

Create a merging iterator - fast for N < 8.

Given an iterator or nil return the next element if the iterator hasNext.

Create an efficient stable n-way merge between a sequence of iterables using comparator. If iterables themselves are sorted result will be sorted. If two items tie then the one from the leftmost iterable wins.

Given an iterator call next.

Create an iterable that can only be iterated once - it always returns the same (non threadsafe) iterator every iterator call. init-fn is not called until the first has-next call - also see iterable.

The arguments have different defaults as once-iterables can close over global context on construction as they can only be iterated once.

• valid? - ctx->boolean - defaults to non-nil?
• init-fn - creates new ctx
• update-fn - function from ctx->ctx - defaults to init-fn ignoring argument.
• val-fn - function from ctx->val - defaults to identity

Iterable with efficient reduce but also contains a cached seq conversion so patterns like: (when (seq v) ...) still work without needing to dereference the iterable twice.

Create an efficient n-way merge between a sequence of iterables using comparator. If iterables themselves are sorted result will be sorted.

Wrap an iterator returning an iterable.