rolag / lockfreehashmap-rs
A concurrent lock-free hash map for Rust.
☆21Updated 3 years ago
Related projects: ⓘ
- Support for Linux kernel aio within Tokio.☆51Updated 3 years ago
- ☆29Updated this week
- An experimental asynchronous runtime based on `io-uring`.☆76Updated 3 years ago
- raw bindings for git://git.kernel.dk/liburing☆17Updated 4 years ago
- ☆45Updated 3 years ago
- Concurrent hash trie☆51Updated 3 years ago
- A MPMC channel based on the two lock queue algorithm☆16Updated 6 years ago
- Providing wrapper types for safely performing panic-free checked arithmetic on instants and durations.☆14Updated last week
- Asynchronous adapter for byteorder☆19Updated 3 years ago
- ☆50Updated this week
- Epoch-based garbage collection☆78Updated 5 years ago
- ☆29Updated this week
- Rust crate to support allocation in contexts☆15Updated 2 years ago
- impl Stream for (your own) Generator☆19Updated 5 years ago
- [DEPRECATED] Prevent false sharing by padding and aligning to the length of a cache line☆50Updated last year
- Implementation of Adaptive Radix Tree in Rust☆42Updated 4 years ago
- A growable bit-vector for Rust, optimized for size☆37Updated 5 months ago
- io_uring proof of concept in rust, integrated with tokio timers/executor (but not the reactor ofc)☆47Updated 5 years ago
- ☆28Updated 4 years ago
- liburing bindings☆33Updated 2 years ago
- Extra components for use with Mio.☆31Updated last month
- Lockfree resizeable concurrent hash table.☆51Updated 2 years ago
- ☆24Updated last year
- Treat application routes (URL path + query string) as strongly-typed Rust structs☆13Updated 5 years ago
- A concurrent implementation of pseudo-LRU cache tracking.☆24Updated 4 years ago
- ☆28Updated this week
- ☆69Updated this week
- Dynamically query a type-erased object for any trait implementation☆65Updated last year
- Set theory applied on sorted and deduplicated slices.☆46Updated last year
- A leaky-bucket-as-a-meter rate-limiting implementation in Rust☆33Updated 4 years ago