Adding here a few ideas for new features

Combinatory generators length

It would be nice to have handy functions to calculate the length of a combinatory generator (given the length of the input sequence). This way I can pick the nth item (for example).

flatten

A simple flatten (only one level), can be useful. For example I could use flatten(zipAll(...)) to interleave many iterators. You can do the same with “chain” and the spread operator, but would require to expand the argument in an array and it would be inefficient

window

window(3, range(100))
[0, 1, 2] [1, 2, 3] [2, 3, 4] [3, 4, 5] etc.

Better to pick up a different name though

collate

It takes as arguments n sorted iterable. It returns a single sorted iterable.

Reduce variant

Similar to the reduce but returning a iterable that return the accumulator. I don’t know yet how to call it.

[conartist6]

There’s nothing conceptually wrong with not treating strings as iterables for the purpose of a flatten, even though they technically are. I’d argue that even a not arbitrarily deep flatten implementation would want to do that. Obviously if you did let flatten into a string it would blow up as the string iterator returns other strings, which becomes an infinite recursion.

As for “all other types” being iterable, I’m sure I don’t know what you mean. Almost every type in javascript is derived from Object, which is not iterable, and this is probably a big part of why. That leaves Array, Map, Set, and classes with iterators defined, which are all acceptable things to flatten.

[sithmel]

Added #79 #80