bimap-rs
Generic bijective maps in Rust (by billyrieger)
multi_index_map
Simple and flexible multi-index containers. (by lun3x)
bimap-rs | multi_index_map | |
---|---|---|
2 | 1 | |
124 | 98 | |
- | - | |
1.6 | 8.6 | |
7 months ago | 6 months ago | |
Rust | Rust | |
Apache License 2.0 | MIT License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
bimap-rs
Posts with mentions or reviews of bimap-rs.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-08-26.
-
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.
multi_index_map
Posts with mentions or reviews of multi_index_map.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-08-26.
What are some alternatives?
When comparing bimap-rs and multi_index_map you can also consider the following projects:
rpds - Rust persistent data structures
staticvec - Implements a fixed-capacity stack-allocated Vec alternative backed by an array, using const generics.
hora - 🚀 efficient approximate nearest neighbor search algorithm collections library written in Rust 🦀 .
ipmap - An interactive map that shows connected IP addresses.
heapless - Heapless, `static` friendly data structures
sonic - 🦔 Fast, lightweight & schema-less search backend. An alternative to Elasticsearch that runs on a few MBs of RAM.
crossbeam - Tools for concurrent programming in Rust
alexandrie - An alternative crate registry, implemented in Rust.
Rust - All Algorithms implemented in Rust