matklad / bounds-check-costLinks
☆18Updated 6 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
Sorting:
- High-precision and consistent benchmarking framework/harness for Rust☆160Updated this week
- Recipes for avoiding bounds checks in Rust, without unsafe!☆116Updated 2 years ago
- Portable SIMD project group☆99Updated 9 months ago
- SIMD base64 codecs☆87Updated last year
- Easy function multiversioning for Rust☆235Updated 8 months ago
- Test and benchmark suite for sort implementations.☆398Updated last week
- Cargo subcommand for viewing LLVM optimization remarks.☆178Updated last year
- A fast, non-cryptographic, minimally DoS-resistant hashing algorithm for Rust.☆290Updated last week
- The cost of Rust async/await☆131Updated 3 years ago
- Cross-platform atomic wait and wake (aka futex) functionality for Rust.☆129Updated 2 months ago
- Hazard pointers in Rust.☆206Updated 2 months ago
- Native Rust port of Google's HighwayHash, which makes use of SIMD instructions for a fast and strong hash function☆170Updated 3 weeks ago
- Fast, efficient, and robust memory reclamation for Rust.☆432Updated 2 months ago
- Small, fast, synchronization primitives☆249Updated 11 months ago
- A Rust data structure for efficient lower-bound lookups☆92Updated last year
- Map data structure whose keys are stored as ranges☆94Updated last month
- ☆167Updated 2 years ago
- Fast implementations of integer/floating point conversion operations.☆134Updated 2 years ago
- Experiments with structured concurrency in Rust☆382Updated last year
- Rust microbenchmarking harness based on paired-testing methodology☆138Updated last week
- An ε-copy serialization/deserialization framework for Rust☆154Updated last month
- Rust io_uring examples☆83Updated last year
- Atomically updatable variants of Arc and Weak for lock-free concurrency.☆183Updated 10 months ago
- property testing and verification front-end for Rust☆218Updated this week
- Parallel processing with disjoint indices in Rust☆89Updated 4 months ago
- Safe, fallible, embedded-friendly ordered set/map via a scapegoat tree. Validated against BTreeSet/BTreeMap.☆261Updated 3 years ago
- ☆46Updated 5 years ago
- ☆209Updated last week
- An educational implementation of a modern compressor in Rust☆48Updated last year
- Reflection via DWARF.☆297Updated 2 years ago