Suggestion: rush() — eagerly takes n first elements of an iterable an leaves the rest

Example

const [rushed, rest] = rush(4, range())

Expect:

• rushed should be an array of 4 numbers: [0, 1, 2, 3]
• rest should be an iterator starting from 4

[KSXGitHub]

So I guess I should reopen https://github.com/sithmel/iter-tools/issues/134 then.

[conartist6]

Yeah, indeed it would. It could use a simple array cache though since it would know right up front how many elements it was going to need to cache, and it could avoid making the array cache at all if no items were consumed from the latter half of the split before the iterable for the first half of the split was exhausted, which would be the case in the sample code above.