PackageTrack
Sign in Get early access

rpds

Persistent data structures with structural sharing

1.2.1 17M downloads/mo #2285 most downloaded on crates.io orium/rpds

What this package is like to depend on

Last release 3 months ago

15 May 2026

Release timing varies

gaps range from 4 weeks to 1.4 years

Nearly every release is documented

notes for 21 of 21 stable releases

Nothing withdrawn

no release was ever pulled

9 years old

21 releases · first in 2017

3 releases in the last 12 months

see the full history below

Release timeline

21 releases · Nov 2017 to May 2026
2018 2019 2020 2021 2022 2023 2024 2025 2026
Release Pre-release

Releases

latest 21
  1. 1.2.1 15 May 2026
    Release notes
    • Improved the performance of the HashTrie{Map,Set}.
    • Improved the performance of the HashTrie{Map,Set} iterator.
    • Updated dependencies.
    Open source →
    Release notes
    • Improved the performance of the HashTrie{Map,Set}.
    • Improved the performance of the HashTrie{Map,Set} iterator.
    • Updated dependencies.
    Open source →
  2. 1.2.0 10 Nov 2025
    Release notes
    • Added parallel iterator support for HashTrieMapSync.
    • Added ptr_eq() to {HashTrie,RedBlackTree}Map and {HashTrie,RedBlackTree}Set.
    Open source →
    Release notes
    • Added parallel iterator support for HashTrieMapSync.
    • Added ptr_eq() to {HashTrie,RedBlackTree}Map and {HashTrie,RedBlackTree}Set.
    Open source →
  3. 1.1.2 06 Oct 2025
    Release notes
    • Relicensed project under the MIT license.
    • Updated dependencies.
    Open source →
    Release notes
    • Relicensed project under the MIT license.
    • Updated dependencies.
    Open source →
  4. 1.1.1 08 Apr 2025
    Release notes
    • Updated dependencies.
    Open source →
    Release notes
    • Updated dependencies.
    Open source →
  5. 1.1.0 05 Nov 2023
    Release notes
    • Use triomphe reference-counting pointer by default in Sync data structures,
      which improves their performance.
    Open source →
    Release notes
    • Use triomphe reference-counting pointer by default in Sync data structures, which improves their performance.
    Open source →
  6. 1.0.1 06 Sep 2023
    Release notes
    • Fix the tests of SparseArrayUsize on 32-bit computers. This issue did not affect production code which did work correctly on 32-bit platforms.
    Open source →
    Release notes
    • Fix the tests of SparseArrayUsize on 32-bit computers. This issue did not affect production code which did work correctly on 32-bit platforms.
    Open source →
  7. 1.0.0 07 Aug 2023
    Release notes
    • First stable version. It’s time to commit to a stable release :).
    • Improved performance of equality check for {HashTrie,RedBlackTree}Map and {HashTrie,RedBlackTree}Set, as well as
      subset and superset checks for {HashTrie,RedBlackTree}Set when the references are the same.
    Open source →
    Release notes
    • First stable version. It’s time to commit to a stable release :).
    • Improved performance of equality check for {HashTrie,RedBlackTree}Map and {HashTrie,RedBlackTree}Set, as well as subset and superset checks for {HashTrie,RedBlackTree}Set when the references are the same.
    Open source →
  8. 0.13.0 15 Mar 2023
    Release notes
    • Updated archery fixing a soundness bug. See issue #18.
    Open source →
    Release notes
    • Updated archery fixing a soundness bug. See issue #18.
    Open source →
  9. 0.12.0 04 Jul 2022
    Release notes
    • Implemented Hash ofr RedBlackTreeSet.
    Open source →
    Release notes
    • Implemented Hash for RedBlackTreeSet.
    Open source →
  10. 0.11.0 18 Dec 2021
    Release notes
    • Added {HashTrie,RedBlackTree}Map::get_key_value() and {HashTrie,RedBlackTree}Set::get().
    Open source →
    Release notes
    • Added {HashTrie,RedBlackTree}Map::get_key_value() and {HashTrie,RedBlackTree}Set::get().
    Open source →
  11. 0.10.0 29 Sep 2021
    Release notes
    • Improved {HashTrieMap,HashTrieSet} iteration performance.
    Open source →
  12. 0.9.0 23 Feb 2021
    Release notes
    • Added {HashTrie,RedBlackTree}Map::get_mut().
    • Improved HashTrieMap performance when using Rc pointers.
    Open source →
  13. 0.8.0 31 Oct 2020
    Release notes
    • Added support for no_std.
    Open source →
  14. 0.7.0 11 Sep 2019
    Release notes
    • Now the shared pointer type of all data structures use can be parameterizable. See the Thread safety section in the README for details. (#7)
    • Fix bug where dropping long lists would cause a stack overflow. (#46)
    Open source →
  15. 0.6.0 27 Jan 2019
    Release notes
    • Implemented RedBlackTree{Map,Set}::range() iterator.
    • Implemented IndexMut and Vector::get_mut().
    • Added #[must_use] to the immutable methods of all data structures.
    • Improved performance of List::reverse_mut().
    • Improved performance of RedBlackTreeSet serialization.
    Open source →
  16. 0.5.0 12 Apr 2018
    Release notes
    • Mutable methods galore. Now all data structures offer mutable methods. These are generally much faster!
    • Implemented Extend for Vector.
    Open source →
  17. 0.4.0 08 Mar 2018
    Release notes
    • Added macros to create data structures with the given values (analog to vec![]).
    • Added {HashTrieSet,RedBlackTreeSet}::{is_disjoint(),is_subset(),is_superset()}.
    Open source →
  18. 0.3.0 10 Jan 2018
    Release notes
    • Added support for serialization with serde.
    • Speed-up HashTrieMap::remove() by ~70%.
    • Speed-up Vector::push_back() by ~80%.
    Open source →
  19. 0.2.0 14 Dec 2017
    Release notes
    • Implemented RedBlackTreeMap data structure.
    • Implemented RedBlackTreeSet data structure.
    Open source →
  20. 0.1.0 23 Nov 2017
    Release notes
    • Implemented Queue data structure.
    • Implemented HashTrieSet data structure.
    • Implemented Stack data structure.
    • Implemented List::last() and List::reverse().
    Open source →
  21. 0.0.0 17 Nov 2017
    Release notes
    • Initial release of rpds. This release contains these data structures: List, Vector, and HashTrieMap.
    Open source →

Every package, every release, already written down.

The archive is open and free. Watching your own project is what we are building next.

Browse the archive