Alternatives and similar repositories for rust-eytzinger

Users that are interested in rust-eytzinger are comparing it to the libraries listed below

• SchrodingerZhu / bench_suite
  ☆21Updated 4 years ago
• udoprog / unicycle
  A futures abstraction that runs a set of futures which may complete in any order.
  ☆91Updated last week
• komora-io / tiny-lsm
  super simple in-memory blocking LSM for constant-size keys and values
  ☆72Updated 7 months ago
• al8n / fmmap
  A flexible and convenient high-level mmap for zero-copy file I/O.
  ☆115Updated 7 months ago
• AltSysrq / supercow
  Rust crate for accepting general reference-like values without proliferating generics.
  ☆37Updated 8 years ago
• dtolnay / serde-starlark
  Serde serializer for generating Starlark build targets
  ☆69Updated last month
• zonyitoo / conhash-rs
  Consistent Hashing library in Rust
  ☆18Updated 2 years ago
• benfred / remoteprocess
  Cross platform process information in Rust
  ☆69Updated 2 months ago
• LucioFranco / kv
  ☆14Updated 2 years ago
• Bajix / evlru
  An eventually consistent LRU designed for lock-free concurrent reads
  ☆23Updated 2 years ago
• servo / smallbitvec
  A growable bit-vector for Rust, optimized for size
  ☆45Updated 8 months ago
• tikv / async-speed-limit
  Asynchronously speed-limiting multiple byte streams
  ☆66Updated last year
• jordanisaacs / rustix-uring
  The `io_uring` library for Rust (with Rustix)
  ☆35Updated 2 months ago
• komora-io / sharded-log
  log for concurrent workloads, with support for atomic batches and in-order recovery
  ☆37Updated 3 years ago
• Gregory-Meyer / cht
  Lockfree resizeable concurrent hash table.
  ☆54Updated 3 years ago
• velvia / compressed-vec
  SIMD Floating point and integer compressed vector library
  ☆80Updated last year
• rust-lang / odht
  An on-disk hash table implementation
  ☆124Updated 3 years ago
• sunfishcode / io-lifetimes
  A low-level I/O ownership and borrowing library
  ☆104Updated 2 months ago
• jonhoo / ordsearch
  A Rust data structure for efficient lower-bound lookups
  ☆92Updated last year
• fuzzypixelz / absolut
  Autogenerated Bytewise SIMD-Optimized Look-Up Tables
  ☆38Updated last year
• sekineh / binary-heap-plus-rs
  Enhancement over Rust's `std::BinaryHeap`. Supports other than max heap.
  ☆58Updated last year
• jonhoo / bustle
  A benchmarking harness for concurrent key-value collections
  ☆119Updated 2 years ago
• ringbahn / maglev
  ☆47Updated 5 years ago
• notriddle / rust-float-ord
  ☆34Updated last year
• zzau13 / v_escape
  The simd optimized escape code
  ☆54Updated last week
• vasi / positioned-io
  Read and write from offsets in Rust.
  ☆89Updated 2 weeks ago
• smol-rs / atomic-waker
  futures::AtomicWaker extracted into its own crate
  ☆35Updated 2 months ago
• ringbahn / uring-sys
  liburing bindings
  ☆35Updated 3 years ago
• asynchronics / st3
  Very fast lock-free, bounded, work-stealing queues with FIFO stealing and LIFO or FIFO semantic for the worker thread.
  ☆84Updated last year
• Darksonn / segment-tree
  A Rust implementation of two segment trees and a fenwick tree.
  ☆66Updated 6 years ago