matklad / bounds-check-cost
☆18Updated 5 years ago
Alternatives and similar repositories for bounds-check-cost:
Users that are interested in bounds-check-cost are comparing it to the libraries listed below
- High-precision and consistent benchmarking framework/harness for Rust☆121Updated this week
- Map data structure whose keys are stored as ranges☆81Updated last month
- A big integer library in Rust with good performance.☆104Updated last year
- Faster integer division and modulus operations☆87Updated 2 years ago
- Cargo subcommand for viewing LLVM optimization remarks.☆174Updated 9 months ago
- Cross-platform atomic wait and wake (aka futex) functionality for Rust.☆120Updated 8 months ago
- SIMD base64 codecs☆79Updated last year
- Recipes for avoiding bounds checks in Rust, without unsafe!☆108Updated 2 years ago
- Reflection via DWARF.☆296Updated last year
- A Rust implementation of OS provided synchronization primitives☆56Updated last year
- a lock-free concurrent slab (experimental)☆278Updated last month
- Library safely exposing the io_uring API.☆57Updated 3 weeks ago
- A lock-free, partially wait-free, eventually consistent, concurrent hashmap.☆243Updated 2 years ago
- offsetof for Rust☆225Updated 10 months ago
- Easy function multiversioning for Rust☆211Updated 2 months ago
- Native Rust port of Google's HighwayHash, which makes use of SIMD instructions for a fast and strong hash function☆160Updated 3 weeks ago
- A buffering MPSC queue.☆78Updated 7 months ago
- A Rust data structure for efficient lower-bound lookups☆89Updated 11 months ago
- A concurrent, append-only vector.☆149Updated this week
- Exploration of using Storage instead of Allocator to parameterize collections in Rust☆139Updated 2 years ago
- Simple interoperability between C++ coroutines and asynchronous Rust☆244Updated 3 months ago
- ☆30Updated 3 years ago
- Experiments with structured concurrency in Rust☆347Updated 6 months ago
- Rust ABI safe code generator☆183Updated 6 months ago
- Portable SIMD project group☆96Updated 2 months ago
- Safe, fallible, embedded-friendly ordered set/map via a scapegoat tree. Validated against BTreeSet/BTreeMap.☆258Updated 3 years ago
- Concurrently Readable Data Structures for Rust☆349Updated this week
- Simple and flexible multi-index containers.☆105Updated 6 months ago
- Small, fast, synchronization primitives☆241Updated 5 months ago