Alternatives and similar repositories for bitintr

Users that are interested in bitintr are comparing it to the libraries listed below

• gnzlbg / bitwise
  Portable high-level bitwise manipulation algorithms
  ☆50Updated 3 years ago
• fitzgen / intrusive_splay_tree
  An intrusive splay tree implementation that is no-std compatible and free from allocation and moves
  ☆67Updated 2 months ago
• servo / smallbitvec
  A growable bit-vector for Rust, optimized for size
  ☆41Updated 4 months ago
• rust-bakery / nom-peg
  PEG parser generator built on top of nom
  ☆70Updated 5 years ago
• calebzulawski / generic-simd
  Generic SIMD abstractions for Rust.
  ☆47Updated 2 years ago
• llogiq / optional
  A small crate to provide space-efficient Option<_> replacements
  ☆37Updated 3 months ago
• contain-rs / vec-map
  A simple map based on a vector for small integer keys
  ☆65Updated 6 months ago
• hsivonen / simd
  A crate that exposes some SIMD functionality on nightly Rust; to be obsoleted by stdsimd
  ☆82Updated last year
• irrustible / async-oneshot
  A fast, small, full-featured, no-std compatible oneshot channel
  ☆60Updated last year
• fulmicoton / fastdivide
  ☆27Updated 7 months ago
• droundy / tinyset
  Compact sets in rust
  ☆57Updated 3 months ago
• dtolnay / tt-call
  Token tree calling convention
  ☆79Updated 2 years ago
• wagnerf42 / rayon-adaptive
  adaptive algorithms for rayon
  ☆39Updated 5 years ago
• jonhoo / ordsearch
  A Rust data structure for efficient lower-bound lookups
  ☆90Updated last year
• ratel-rust / toolshed
  Arena allocator and a handful of useful data structures
  ☆41Updated 5 years ago
• ejmahler / strength_reduce
  Faster integer division and modulus operations
  ☆87Updated 2 years ago
• bluss / indexing
  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
• dtolnay / lalrproc
  Proof of concept of procedural macro input parsed by LALRPOP
  ☆52Updated 2 years ago
• contain-rs / linear-map
  A map backed by a vector
  ☆25Updated last year
• thomcc / arcstr
  Better reference counted strings for Rust
  ☆126Updated 11 months ago
• nrc / darkly
  ☆40Updated 6 years ago
• fitzgen / inlinable_string
  An owned, grow-able UTF-8 string that stores small strings inline and avoids heap-allocation.
  ☆68Updated 3 years ago
• fitzgen / fast-bernoulli
  Efficient sampling with uniform probability
  ☆31Updated 3 years ago
• Manishearth / mitosis
  Spawn processes with arbitrary closures in rust
  ☆111Updated 3 years ago
• benashford / rust-lazysort
  Iterate in a lazily achieved sorted order
  ☆59Updated 6 years ago
• zheland / typed-index-collections
  Typed index version of Rust slice and Vec containers
  ☆69Updated last month
• Kixunil / fast_fmt
  Faster, more flexible and more correct alternative to core::fmt
  ☆40Updated 4 years ago
• Diggsey / lockless
  Composable, lock-free, allocation-light data structures
  ☆60Updated 7 years ago
• ogoffart / vptr
  Light references to trait objects by embedding the virtual table pointer in the struct
  ☆25Updated 10 months ago
• fitzgen / id-arena
  A simple, id-based arena
  ☆120Updated last year