Alternatives and similar repositories for inline-array

Users that are interested in inline-array are comparing it to the libraries listed below

• komora-io / fault-injection
  trigger io::Error's in test, and annotate their source
  ☆31Updated 2 years ago
• komora-io / ebr
  high-efficiency concurrent reclamation
  ☆37Updated last year
• komora-io / pagetable
  wait-free 4-level 64-bit pagetable for contiguous low-contention concurrent metadata
  ☆41Updated last year
• nextest-rs / future-queue
  Queue futures to run concurrently, in the order they're spawned, and with global and group limits.
  ☆65Updated this week
• graydon / backtrace-error
  wrap errors with automatic backtrace capture and print-on-result-unwrap
  ☆33Updated last year
• zzau13 / v_escape
  The simd optimized escape code
  ☆54Updated last week
• komora-io / stack-map
  constant-size associative container backed by a simple array
  ☆20Updated 2 years ago
• komora-io / sharded-log
  log for concurrent workloads, with support for atomic batches and in-order recovery
  ☆37Updated 3 years ago
• komora-io / tiny-lsm
  super simple in-memory blocking LSM for constant-size keys and values
  ☆72Updated 8 months ago
• udoprog / unicycle
  A futures abstraction that runs a set of futures which may complete in any order.
  ☆91Updated last month
• spacejam / seaslug
  scraps of a potential language
  ☆38Updated 4 years ago
• tomaka / futures-diagnose
  Wraps around a futures::Spawn and adds diagnostics to it
  ☆32Updated 5 years ago
• ringbahn / maglev
  ☆47Updated 5 years ago
• sval-rs / sval
  A lightweight, no-std, object-safe, serialization-only framework for Rust
  ☆99Updated 3 weeks ago
• kolloch / reqray
  Log call tree summaries after each request for rust programs instrumented with `tracing`.
  ☆45Updated 3 years ago
• rkyv / bytecheck
  Memory validation framework for Rust
  ☆70Updated last month
• ferrilab / radium
  ☆36Updated last year
• taiki-e / atomic-maybe-uninit
  Atomic operations on potentially uninitialized integers.
  ☆22Updated 2 weeks ago
• Kerollmops / sdset
  Set theory applied on sorted and deduplicated slices.
  ☆47Updated 3 years ago
• jonhoo / cliff
  Find the load at which a benchmark falls over.
  ☆36Updated 5 years ago
• jonhoo / indexmap-amortized
  bluss/IndexMap with amortized resizes
  ☆14Updated 4 years ago
• frankmcsherry / columnation
  An experimental columnar arena
  ☆43Updated last year
• grego / bset
  Fast and compact sets of bytes or ASCII characters
  ☆28Updated 4 years ago
• willcrichton / indexical
  Human-friendly indexed collections
  ☆56Updated 3 weeks ago
• dtolnay / serde-stacker
  Serializer and Deserializer adapters that avoid stack overflows by dynamically growing the stack
  ☆35Updated last month
• Xaeroxe / c-closures-rs
  Rust closures you can transfer over an FFI boundary
  ☆27Updated 4 years ago
• taiki-e / atomic-memcpy
  Byte-wise atomic memcpy.
  ☆38Updated 3 weeks ago
• komora-io / cache-advisor
  scan-resistant concurrent lazy LRU
  ☆63Updated 2 years ago
• maciejhirsz / ordnung
  Fast, vector-based map implementation that preserves insertion order.
  ☆15Updated 5 years ago
• irrustible / futures-micro
  To futures-lite as futures-lite is to futures: smaller.
  ☆54Updated 10 months ago