2020-07-07 07:35:12 +00:00
|
|
|
# vec-arena
|
2016-10-22 23:35:26 +00:00
|
|
|
|
2016-10-25 16:50:15 +00:00
|
|
|
[](https://travis-ci.org/stjepang/vec-arena)
|
|
|
|
|
[](https://github.com/stjepang/vec-arena)
|
2016-11-14 21:01:55 +00:00
|
|
|
[](https://crates.io/crates/vec-arena)
|
|
|
|
|
[](https://docs.rs/vec-arena)
|
2016-10-26 10:45:23 +00:00
|
|
|
|
2016-11-14 21:01:55 +00:00
|
|
|
#### What is this?
|
2016-10-26 10:45:23 +00:00
|
|
|
|
2016-11-14 21:01:55 +00:00
|
|
|
A simple object arena.
|
2016-10-25 16:50:15 +00:00
|
|
|
|
2016-11-14 21:01:55 +00:00
|
|
|
You want to build a doubly linked list? Or maybe a bidirectional tree? Perhaps an even more
|
|
|
|
|
complicated object graph?
|
2016-10-25 16:50:15 +00:00
|
|
|
|
2016-11-14 21:01:55 +00:00
|
|
|
Managing ownership and lifetimes might be tough then. Your options boil down to:
|
|
|
|
|
|
|
|
|
|
1. Use unsafe code to escape Rust's ownership rules.
|
|
|
|
|
2. Wrap every object in `Rc<RefCell<T>>`.
|
|
|
|
|
3. Use `Vec<T>` to store objects, then access them using indices.
|
|
|
|
|
|
|
|
|
|
If the last option seems most appealing to you, perhaps `Arena<T>` is for you.
|
|
|
|
|
It will provide a more convenient API than a plain `Vec<T>`.
|
|
|
|
|
|
|
|
|
|
#### Examples
|
|
|
|
|
|
|
|
|
|
Some data structures built using `Arena<T>`:
|
|
|
|
|
|
|
|
|
|
* [Doubly linked list](https://github.com/stjepang/vec-arena/blob/master/examples/linked_list.rs)
|
|
|
|
|
* [Splay tree](https://github.com/stjepang/vec-arena/blob/master/examples/splay_tree.rs)
|
