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 this week
• jonhoo / ordsearch
  A Rust data structure for efficient lower-bound lookups
  ☆89Updated 10 months ago
• rust-bakery / nom-peg
  PEG parser generator built on top of nom
  ☆69Updated 5 years ago
• adevore / rudy
  Judy array implementation in pure Rust
  ☆84Updated 7 years ago
• hsivonen / simd
  A crate that exposes some SIMD functionality on nightly Rust; to be obsoleted by stdsimd
  ☆80Updated last year
• ejmahler / strength_reduce
  Faster integer division and modulus operations
  ☆70Updated 2 years ago
• servo / smallbitvec
  A growable bit-vector for Rust, optimized for size
  ☆40Updated 9 months ago
• fitzgen / inlinable_string
  An owned, grow-able UTF-8 string that stores small strings inline and avoids heap-allocation.
  ☆68Updated 3 years ago
• fulmicoton / fastdivide
  ☆23Updated 2 months ago
• wagnerf42 / rayon-adaptive
  adaptive algorithms for rayon
  ☆39Updated 4 years ago
• contain-rs / linear-map
  A map backed by a vector
  ☆25Updated 10 months ago
• shepmaster / jetscii
  A tiny library to efficiently search strings for sets of ASCII characters and byte slices for sets of bytes.
  ☆114Updated 5 months ago
• llogiq / optional
  A small crate to provide space-efficient Option<_> replacements
  ☆37Updated 2 weeks 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
• calebzulawski / generic-simd
  Generic SIMD abstractions for Rust.
  ☆47Updated 2 years ago
• contain-rs / vec-map
  A simple map based on a vector for small integer keys
  ☆64Updated last month
• benashford / rust-lazysort
  Iterate in a lazily achieved sorted order
  ☆59Updated 6 years ago
• eira-fransham / crunchy
  Crunchy unroller - deterministically unroll constant loops
  ☆36Updated last week
• Diggsey / query_interface
  Dynamically query a type-erased object for any trait implementation
  ☆65Updated 2 years ago
• BurntSushi / ucd-generate
  A command line tool to generate Unicode tables as source code.
  ☆99Updated 3 months ago
• rkyv / ptr_meta
  A radioactive stabilization of the ptr_meta RFC.
  ☆24Updated this week
• jFransham / smallstring
  SmallVec-backed stack string optimisation
  ☆43Updated 4 years ago
• rphmeier / allocators
  A collection of custom allocators
  ☆43Updated 7 years ago
• ratel-rust / toolshed
  Arena allocator and a handful of useful data structures
  ☆39Updated 4 years ago
• TyOverby / Bark
  A better Arc / Rc [Still in research mode]
  ☆19Updated 4 years ago
• bsteinb / accurate
  (More or less) accurate floating point algorithms
  ☆56Updated 5 months ago
• xlambein / syntactic-for
  A syntactic "for" loop Rust macro
  ☆56Updated 2 years ago
• Geal / pgo-rust
  Testing LLVM's profile guided optimization with Rust
  ☆45Updated 6 years ago
• bytecodealliance / regalloc.rs
  Modular register allocator algorithms
  ☆106Updated 2 years ago