Double linked list

[stereobooster]

First of all: thank a lot. I enjoyed reading this manual.

I cheated a bit and googled for "rust double linked list". There is seems to be solution to problem of who is owning who: stackoverflow.

Second link it to your website e.g. cglab.ca/~abeinges/blah/too-many-lists/book/

[stereobooster]

I'm thinking about trying to use Weak for connection between nodes in one direction and Rc in opposite direction. It should remove cycles as far as I understand it.

[Manishearth]

Weak lets you implement it safely. I'm not sure what you're proposing? THere already is an impl of a DLL here. There's also one in the stdlib.

[stereobooster]

It seems I miss something. Trivial reference counting can't handle cycles. And DLL is the minimum possible cycle (graph of two objects). Right? And Weak references do not count when determining if the inner value should be dropped.

UPD: Yes I see

impl<T> Drop for List<T> {
    fn drop(&mut self) {
        while self.pop_front().is_some() {}
    }
}

doing the trick. I just thought that Weak is good fit for the case and want to give it a try