Ranges and Take

[Jonathan M Davis via Digitalmars-d]

On Wednesday, October 05, 2016 00:10:39 Jacob via Digitalmars-d wrote:
> Having access to iterators would solve the problem here I think.
> But everything is ranges and that wouldn't entirely fit. For a
> linked list though, you can create a range from a single
> iterator. The implementation of DList's Range is pretty much two
> iterators. Oh well, have to implement my own anyways I guess,
> since DList uses the garbage collector.

A replacement for std.container is in the works, but who knows when that
will be done (or whether the result will really be what you want anyway). In
the interim, I'd recommend checking out

http://code.dlang.org/packages/emsi_containers

- Jonathan M Davis