4 releases (breaking)
|0.4.0||Apr 15, 2023|
|0.3.0||Mar 22, 2023|
|0.2.0||Apr 12, 2022|
|0.1.0||Sep 11, 2021|
#421 in Data structures
44 downloads per month
An implementation of a persistent unrolled linked list and vlist. This linked list is implemented with a backing of either
Rc, for single or multi-threaded environments. The single threaded list can be found as a
List, and the thread-safe implementation can be found as a
SharedList. It is generic over smart pointer - so if you would like to use this with a custom smart pointer (i.e. something like a
Gc) then you can do so.
An unrolled linked list is a linked list where each node contains a vector of elements. While the algorithmic complexity is the same as a normal naive linked list, storing elements in vectors improves cache locality and also gives practical speed ups on common operations. A Vlist is like an unrolled linked list, however the vector capacity in each node grows exponentially. This also means that operations that need to iterate over nodes run in
Licensed under either of
- Apache License, Version 2.0 (LICENSE-APACHE or http://www.apache.org/licenses/LICENSE-2.0)
- MIT license (LICENSE-MIT or http://opensource.org/licenses/MIT)
at your option.
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.