gnzlbg / bitintrLinks
Portable Bitwise Manipulation Intrinsics
☆46Updated last year
Alternatives and similar repositories for bitintr
Users that are interested in bitintr are comparing it to the libraries listed below
Sorting:
- Judy array implementation in pure Rust☆88Updated 7 years ago
- An intrusive splay tree implementation that is no-std compatible and free from allocation and moves☆67Updated 3 months ago
- A Rust data structure for efficient lower-bound lookups☆92Updated last year
- Portable high-level bitwise manipulation algorithms☆50Updated 3 years ago
- PEG parser generator built on top of nom☆70Updated 5 years ago
- An implementation of union-find / congruence-closure in Rust. Extracted from rustc for independent experimentation.☆161Updated last year
- adaptive algorithms for rayon☆39Updated 5 years ago
- Spawn processes with arbitrary closures in rust☆112Updated 3 years ago
- SmallVec-backed stack string optimisation☆44Updated 5 years ago
- Sound unchecked indexing using “generativity”; a type system approach to indices, pointers and ranges that are trusted to be in bounds.☆102Updated 5 years ago
- Dynamically query a type-erased object for any trait implementation☆66Updated 2 years ago
- ☆48Updated last month
- Token tree calling convention☆80Updated 2 years ago
- An idiomatic and fast QP-trie implementation in pure Rust.☆101Updated last year
- (More or less) accurate floating point algorithms☆58Updated last year
- A growable bit-vector for Rust, optimized for size☆42Updated 5 months ago
- Type-safe transmutations between layout-compatible types.