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.
- Ranges and Take Jacob via Digitalmars-d
- Re: Ranges and Take Jonathan M Davis via Digitalmars-d
- Re: Ranges and Take Jacob via Digitalmars-d
- Re: Ranges and Take Jonathan M Davis via Digitalmars-d
- Re: Ranges and Take Jacob via Digitalmars-d