udoprog / unicycleLinks
A futures abstraction that runs a set of futures which may complete in any order.
☆90Updated 2 months ago
Alternatives and similar repositories for unicycle
Users that are interested in unicycle are comparing it to the libraries listed below
Sorting:
- A global executor built on top of async-executor and smol☆74Updated 3 months ago
- Thread parking and unparking☆78Updated 5 months ago
- Yet Another Async Runtime (yaar) focused on forbid(unsafe) and scalability☆81Updated 3 years ago
- A growable bit-vector for Rust, optimized for size☆41Updated 4 months ago
- A lightweight, no-std, object-safe, serialization-only framework for Rust☆97Updated 2 months ago
- Duplicate an async I/O handle☆41Updated 5 months ago
- futures::AtomicWaker extracted into its own crate☆27Updated last month
- Async tracing capabilities for the log crate☆99Updated 4 years ago
- Zero-cost bitsets over native Rust types☆78Updated 2 months ago
- Run closures in parallel☆113Updated 5 months ago
- Integer encoding for primitive integer types: Supports varint/varint+zigzag and fixed-length integer encoding and decoding, and provides …☆67Updated 10 months ago
- ☆47Updated 4 years ago
- The simd optimized escape code☆54Updated last week
- ☆72Updated 2 months ago
- Fake implementation of `std::Fn` for user-defined data types☆36Updated 2 years ago
- Timer facilities for Rust's async story☆56Updated 8 months ago
- Rust crate to use process file descriptors (pidfd) for Linux☆49Updated last month
- ☆46Updated last year
- Generate is a library for building iterators on the fly☆39Updated 4 years ago
- Take a value atomically once.☆30Updated 2 years ago
- Convert closures into wakers☆45Updated 5 months ago
- ☆57Updated last year
- Make trait methods callable without the trait in scope☆147Updated 3 weeks ago
- A leaky-bucket-as-a-meter rate-limiting implementation in Rust☆32Updated 4 years ago
- bencher is just a port of the libtest (unstable) benchmark runner to Rust stable releases. `cargo bench` on stable. "Not a better bencher…☆89Updated 3 years ago
- An implementation of the `group_by` Haskell function for slice and strings☆54Updated 2 years ago
- Additional utilities around the bytes crate☆19Updated 2 months ago
- A fast, small, full-featured, no-std compatible oneshot channel☆60Updated last year
- A map implementation that relies on fixed-size storage derived by a procedural macro☆45Updated last month
- An LRU cache implementation with constant time operations and weighted semantic.☆44Updated 6 months ago