Kerollmops / sdsetLinks
Set theory applied on sorted and deduplicated slices.
☆45Updated 2 years ago
Alternatives and similar repositories for sdset
Users that are interested in sdset are comparing it to the libraries listed below
Sorting:
- An experimental columnar arena☆43Updated 7 months ago
- Retriever stores ordinary rust data types in a similar manner as a NoSQL database.☆48Updated 2 years ago
- A safe and reliable process manager☆43Updated 5 years ago
- An experimental asynchronous runtime based on `io-uring`.☆77Updated 4 years ago
- An in-memory topological sort algorithm for trees based on Group Theory☆24Updated 4 years ago
- A trait-based system for creating async Wakers. Because RawWakers are healthier after they've been cooked.☆21Updated 4 years ago
- An intrusive splay tree implementation that is no-std compatible and free from allocation and moves☆67Updated last month
- To futures-lite as futures-lite is to futures: smaller.☆54Updated 5 months ago
- Concurrent hash trie☆54Updated 4 years ago
- Wraps around a futures::Spawn and adds diagnostics to it☆32Updated 5 years ago
- Run a process on a particular subset of the available hardware.☆36Updated 5 years ago
- A safe-guarded transmute for Rust☆38Updated last year
- ☆47Updated 4 years ago
- Rust library that provides helpers for testing resilience of I/O operations.☆32Updated 2 years ago
- An I/O-oriented tokio runtime thread pool☆49Updated 5 years ago
- high-speed metrics collection library in Rust☆19Updated 6 years ago
- Rust crate to use process file descriptors (pidfd) for Linux☆47Updated last week
- lonely is a no_std+alloc+no TLS task executor for the Rust async/await ecosystem, focused on minimizing cross-core synchronization overhe…☆18Updated 5 years ago
- Rust crate to support allocation in contexts☆15Updated 2 years ago
- Rust closures you can transfer over an FFI boundary☆27Updated 4 years ago
- Log call tree summaries after each request for rust programs instrumented with `tracing`.☆44Updated 3 years ago
- An implementation of Kensler's hashed permutation algorithm☆16Updated 3 months ago
- Combine a reader + writer into a duplex of Read + Write☆46Updated 4 years ago
- Hazard pointer based concurrent memory reclamation for Rust.☆30Updated 5 years ago
- parallel iterator consumers for rust☆12Updated 6 years ago
- An implementation of the `group_by` Haskell function for slice and strings☆53Updated 2 years ago
- ☆73Updated 3 years ago
- ☆53Updated 5 years ago
- A fast, small, full-featured, no-std compatible oneshot channel☆60Updated last year
- Wrapper providing a safe and simple way to access liburing-sys features.☆19Updated 5 years ago