arash16 / bisetmapLinks
BisetMap is a fast and thread-safe two-way hash map of sets for Rust.
☆13Updated 7 years ago
Alternatives and similar repositories for bisetmap
Users that are interested in bisetmap are comparing it to the libraries listed below
Sorting:
- A small crate to provide space-efficient Option<_> replacements☆37Updated 4 months ago
- A zero-allocation ring buffer for storing text logs, implemented in Rust☆51Updated 2 years ago
- Convert `try!()` into `?`s☆34Updated 8 years ago
- More maintainable Rust test☆28Updated 3 years ago
- ☆53Updated 5 years ago
- A pool of reusable values☆50Updated 5 years ago
- ☆40Updated 6 years ago
- An owned, grow-able UTF-8 string that stores small strings inline and avoids heap-allocation.☆68Updated 3 years ago
- Lint to disallow the moving of marked types in Rust☆35Updated 8 years ago
- A structure for holding a set of enum variants☆19Updated 6 years ago
- A Rust implementation of the Zopfli compression algorithm.☆77Updated 3 years ago
- Fast float-to-string conversion based on the Ryū algorithm by Ulf Adams.☆32Updated 7 years ago
- ☆27Updated 8 years ago
- A drop-in replacement for Rust's std::BufReader, with extra features☆41Updated 2 years ago
- Dynamically query a type-erased object for any trait implementation☆66Updated 2 years ago
- Fast json encoder in rust, that encodes the structure of JSON values in their types☆83Updated 2 years ago
- Epoch-based garbage collection☆81Updated 6 years ago
- ☆27Updated 10 years ago
- ☆17Updated 5 years ago
- A syntax extension providing higher-order attributes to Rust.☆17Updated 7 years ago
- A Rust compiler plugin and support library to annotate overflow behavior☆107Updated 2 years ago
- Proof of concept for fast regexes in rust☆39Updated 8 years ago
- a distributed-merge capable database for many small objects☆78Updated 5 years ago
- ☆22Updated 8 years ago
- ☆30Updated 3 years ago
- An ordered map and set based on a trie.☆28Updated 5 years ago
- Named arguments for Rust☆38Updated 8 years ago
- A synchronization primitive for lock-free reads with one concurrent writer☆21Updated 8 years ago
- reprints for your terminal screen☆20Updated 9 years ago
- An in-memory topological sort algorithm for trees based on Group Theory☆24Updated 4 years ago