rpds
bimap-rs
Our great sponsors
rpds | bimap-rs | |
---|---|---|
3 | 2 | |
1,122 | 123 | |
- | - | |
7.6 | 1.6 | |
2 months ago | 6 months ago | |
Rust | Rust | |
Mozilla Public License 2.0 | Apache License 2.0 |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
rpds
-
Getting both a mutable and immutable reference to a shared structure?
Another option I can think of - but not completely sure how one would implement in Rust - would be to never mutate the shared state, but rather when updating it - completely swapping it out with a completely new copy of the desired state. There's lots of different ways to go about doing this - each with their own trade offs. But using some form of Persistent Data Structure would probably be a good way to start. If you only have a single writer - then I believe using a Cell and simply updating which version of the structure is being read could work. rpds seems to be a decent start to look at these sorts of structures in Rust.
-
Learning Clojure made me return back to C/C++
Thanks for taking the time to provide a detailed response. Need to think on this. I had actually started a regular Clojure parser using LLVM as a hobby, but then my friend said it was better to implement this in a safe-memory and. save-concurrency language like Rust and leverage cranelift for code generation. So, now I am learning rust, lol. (Btw, Rust has a persistent data structures lib too: https://github.com/orium/rpds )
-
Persisting data that has revisions for values
Take a look at https://github.com/orium/rpds or one of the many others.
bimap-rs
-
BTreeMap but sorted by value?
Your requirements may be slightly different, but you could take a look at how e.g. bimap does it.
-
Announcing MultiIndexMap: A generic multi-index map inspired by cpp-boost's multi-index containers
`multi_index_map` is designed to allow storage and retrieval of data through multiple indexes, along the lines of in-memory relational database. This is useful in a few situations, notably when you want to implement structures like a bi-directional map (ie. searchable either for key or value), or sets with multiple iteration orders. There exist great crates for bi-directional maps already eg. [bimap-rs](https://github.com/billyrieger/bimap-rs/), however MultiIndexMap goes further and removes the distinction between key and value, such that as many keys as necessary can be added and searched for. Multiple iteration orders can be specificed using multiple `ordered_unique` keys, and iterating by these keys. Non-unique keys are also supported, so more than one element can be retrieved from a single lookup. This crate was inspired by [Boost's C++ Multi-Index Containers](https://www.boost.org/doc/libs/1\_80\_0/libs/multi\_index/doc/index.html), but completely redesigned for a more idiomatic Rust API. We've got to v0.4.0 now, and the main features have been fleshed out enough for me to feel comfortable announcing this. There is still lots to do, and I'm welcoming PRs from anyone who wishes to contribute. The [Future Work](https://github.com/lun3x/multi\_index\_map#future-work) section explains the general direction I am planning on going in.
What are some alternatives?
hypergraph - Hypergraph is data structure library to create a directed hypergraph in which a hyperedge can join any number of vertices.
hora - 🚀 efficient approximate nearest neighbor search algorithm collections library written in Rust 🦀 .
moodycamel - A fast multi-producer, multi-consumer lock-free concurrent queue for C++11
heapless - Heapless, `static` friendly data structures
rust-rocksdb - rust wrapper for rocksdb
crossbeam - Tools for concurrent programming in Rust
cranelift - Cranelift code generator
Rust - All Algorithms implemented in Rust
pest - The Elegant Parser
multi_index_map - Simple and flexible multi-index containers.
grid - Two dimensional grid data structure
vectops - Basic operations with Clojure vectors.