Question is how to do these in Rust. An example might be a browser DOM: each node has a parent pointer, a list of child pointers, left and right sibling pointers, maybe a CSS node pointer, etc. Inserting or deleting nodes has to repair the pointers to and from the neighboring nodes as needed.

I know this is doable since obviously Servo (Rust's initial driving application) has to do it. I hope the answer doesn't involve the word "unsafe". But I am quite unclear about how to create such a structure under Rust's rules of pointer ownership, and also how to reliably reclaim storage when nodes and trees/subtrees are deleted. Plus there will be thread safety rules that should be statically enforced if possible.

I've heard that doubly linked lists in Rust are handled by an unsafe library, yet this seems even worse. Thanks.

you are viewing a single comment's thread
view the rest of the comments

[–] [email protected] 2 points 2 weeks ago (1 children)

Thanks. I might ask on irc how Servo does it. Given Servo's connection with Rust, it would be surprising for this to be too awkward.

[–] livingcoder 1 points 2 weeks ago (1 children)

Sounds good. Please share what you find and what you end up going with.

[–] [email protected] 2 points 2 weeks ago

I'm not trying to code anything right now. I'm just trying to understand Rust itself better, so I asked how its users deal with a particular problem. Thanks!