contain-rs / par-vec

Related projects ⓘ

Alternatives and complementary repositories for par-vec

• contain-rs / blist
  A deque implemented as a hybrid linked-list-of-arrays
  ☆10Updated 9 years ago
• contain-rs / ordered_iter
  Ordered iterators
  ☆11Updated 4 years ago
• contain-rs / enum-set
  A structure for holding a set of enum variants
  ☆20Updated 5 years ago
• contain-rs / raw-vec
  A Raw utility for managing contiguous heap allocations
  ☆11Updated 8 years ago
• contain-rs / interval-heap
  A double-ended priority queue implemented with an interval heap.
  ☆15Updated 7 years ago
• contain-rs / bst
  An ordered map and set based on a binary search tree.
  ☆14Updated 9 years ago
• contain-rs / linear-map
  A map backed by a vector
  ☆25Updated 7 months ago
• nox / inert
  Inert lets you use non-Sync values in Sync context
  ☆16Updated 5 years ago
• contain-rs / compare
  Experimental comparators for collections to be generic over
  ☆16Updated 6 months ago
• contain-rs / trie
  An ordered map and set based on a trie.
  ☆29Updated 4 years ago
• tokio-rs / service-fn
  A service implemented by a closure
  ☆11Updated 7 years ago
• deprecrated / mio-uds
  Unix Domain Sockets for mio
  ☆28Updated 4 years ago
• stbuehler / rust-boxfnonce
  obsolete since rust 1.35.0 doesn't need it anymore
  ☆10Updated 3 years ago
• fitzgen / rent_to_own
  A wrapper type for optionally giving up ownership of the underlying value.
  ☆11Updated 6 years ago
• bitemyapp / brotli2-rs
  Brotli encoders/decoers for Rust
  ☆28Updated last year
• carllerche / string
  Rust String type with configurable byte storage.
  ☆33Updated last month
• llogiq / optional
  A small crate to provide space-efficient Option<_> replacements
  ☆37Updated last week
• carllerche / two-lock-queue
  A MPMC channel based on the two lock queue algorithm
  ☆16Updated 7 years ago
• matklad / jthread-rs
  ☆15Updated 5 years ago
• tokio-rs / async
  Utilities building on top of Rust's async primitives.
  ☆22Updated 5 years ago
• advancedresearch / tree_mem_sort
  An in-memory topological sort algorithm for trees based on Group Theory
  ☆24Updated 3 years ago
• steveklabnik / ref_slice
  Take a reference and get back a slice of length one
  ☆26Updated 3 years ago
• rust-analyzer / WG-rls2.0
  Home for rls2.0 working group
  ☆13Updated 5 years ago
• irrustible / futures-micro
  To futures-lite as futures-lite is to futures: smaller.
  ☆53Updated 6 months ago
• tormol / map_in_place
  A rust library for reusing heap allocations
  ☆23Updated 4 years ago
• CAD97 / pegcel
  A syn targetting PEG parser generator
  ☆20Updated last year
• ranweiler / liar
  Flexible, stand-alone benchmarking
  ☆17Updated 6 years ago