ndokmai / nonblockinghashmap
Non-blocking hash map in Rust
☆13Updated 7 months ago
Related projects ⓘ
Alternatives and complementary repositories for nonblockinghashmap
- A concurrent lock-free hash map for Rust.☆21Updated 3 years ago
- An experimental asynchronous runtime based on `io-uring`.☆76Updated 3 years ago
- Concurrent hash trie☆51Updated 4 years ago
- Implementation of Adaptive Radix Tree in Rust☆42Updated 4 years ago
- Asynchronous adapter for byteorder☆19Updated 3 years ago
- Epoch-based garbage collection☆80Updated 6 years ago
- ☆36Updated last year
- Timer facilities for Tokio based on OS-level primitives.☆14Updated 4 years ago
- Concurrent skip list☆22Updated 6 years ago
- liburing bindings☆33Updated 2 years ago
- Experimental Rust QUIC implementation - moved to https://github.com/djc/quinn☆67Updated 6 years ago
- io_uring proof of concept in rust, integrated with tokio timers/executor (but not the reactor ofc)☆47Updated 5 years ago
- Lockfree resizeable concurrent hash table.☆53Updated 2 years ago
- An I/O-oriented tokio runtime thread pool☆48Updated 4 years ago
- An implementation of the `group_by` Haskell function for slice and strings☆53Updated last year
- raw bindings for git://git.kernel.dk/liburing☆17Updated 4 years ago
- ☆24Updated last year
- A fast thread safe memory pool for reusing allocations.☆29Updated 8 years ago
- Helper trait to create a boxed instance without going through stack☆35Updated 2 years ago
- Support for Linux kernel aio within Tokio.☆51Updated 3 years ago
- Extra components for use with Mio.☆31Updated last month
- Distributed consensus protocol for replicated state machines☆60Updated 5 years ago
- FST (Fast Succinct Trie) implementation in Rust☆24Updated 5 years ago
- Parallel HashMap and HashSet for Rust☆57Updated 5 years ago
- Atomically updatable Arc implementation using crossbeam-epoch for memory reclamation.☆41Updated 6 years ago
- Set theory applied on sorted and deduplicated slices.☆46Updated 2 years ago
- Concurrent work-stealing deque☆46Updated 6 years ago