pie_core 0.2.7

A high-performance, index-based data structure toolkit. Provides an arena allocator (ElemPool) used to build a cache-friendly PieList (doubly-linked list) and FibHeap (priority queue).
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
# To Do List for `pielist`

These are suggestions for improvements:

- [x] pool.shrink_to_fit(): An advanced (and potentially unsafe if indices are held) method to reclaim unused memory from the end of the pool's vector.
- [x] Serialization support
- [ ] Add more comparative tests against `index_list`
- [ ] `#![no_std]` Try to do without the standard library, if possible
- [ ] Add `PieView<'a, T>` to bundle a PieList with its ElemPool and that way allow common traits to be implemented.
- [ ] no_std support: Enable usage in embedded contexts.
- [ ] "View" Pattern: Implement list.view(&pool) that implements Debug, IntoIterator, and PartialEq.
- [ ] Serde: Add an optional feature = "serde" to allow saving/loading the pool or lists.
- [ ] Documentation: Explicitly explain why standard traits (like Drop) are missing to manage user expectations.