rpds
rpds copied to clipboard
Rust persistent data structures
- [ ] `List` - [ ] `Vector` - [ ] `Stack` - [ ] `Queue` - [ ] `HashTrieMap` - [ ] `HashTrieSet` - [ ] `RedBlackTreeMap` - [...
I was trying to look up if `new()` allocates on the heap, or if like std it only allocates when the first item is inserted. Then I wanted to know...
This should happen in rust 1.26: https://github.com/rust-lang/rust/pull/47463
- [ ] `List` - [ ] `Vector` - [ ] `Stack` - [ ] `Queue` - [ ] `HashTrieMap` - [ ] `RedBlackTreeMap` For set we have #20.
- [ ] `HashTrieSet` - [ ] `RedBlackTreeSet` Depends on #21.
When inserting values in bulk it should be possible to do better than calling `insert/push/etc` repeatedly. Each insertion call requires that the tree gets traversed again but this could instead...
Updates the requirements on [criterion](https://github.com/bheisler/criterion.rs) to permit the latest version. Changelog Sourced from criterion's changelog. [0.4.0] - 2022-09-10 Removed The Criterion::can_plot function has been removed. The Criterion::bench_function_over_inputs function has been...
As discussed previously in #80. This should be a valid public api in persistent data-structures. It's already in [im](https://docs.rs/im/latest/im/?search=ptr_eq) and in the [stdlib](https://doc.rust-lang.org/std/index.html?search=ptr_eq). It's valuable in a some cases as...