Correctly implementing a bidirectional range on a linked list?

[anonymous via Digitalmars-d-learn]

On Monday, 6 July 2015 at 21:58:31 UTC, anonymous wrote:
> To make your removal methods stable, it may be enough to not 
> free the removed node. That is, don't do this:
> https://github.com/nomad-software/etcetera/blob/master/source/etcetera/collection

Looks like I messed up the URL. Here's the right one:

https://github.com/nomad-software/etcetera/blob/master/source/etcetera/collection/linkedlist.d#L205-L206