taiki-e / easytimeLinks
Providing wrapper types for safely performing panic-free checked arithmetic on instants and durations.
☆15Updated 2 weeks ago
Alternatives and similar repositories for easytime
Users that are interested in easytime are comparing it to the libraries listed below
Sorting:
- Asynchronous adapter for byteorder☆20Updated 4 years ago
- Atomic operations on potentially uninitialized integers.☆21Updated last week
- ☆47Updated 4 years ago
- Byte-wise atomic memcpy.☆36Updated 2 weeks ago
- Generic SIMD abstractions for Rust.☆47Updated 2 years ago
- Thread-safe clone-on-write container for fast concurrent writing and reading.☆49Updated 2 years ago
- structured parallel execution for async Rust☆36Updated last year
- A more flexible version of the Rust `scoped-tls` library☆18Updated 10 months ago
- [DEPRECATED] Prevent false sharing by padding and aligning to the length of a cache line☆51Updated 2 years ago
- Lending iterators on stable Rust☆83Updated last year
- io traits/structs for tokio that automatically recover from potential disconnections/interruptions☆73Updated last year
- A flexible and convenient high-level mmap for zero-copy file I/O.☆115Updated 5 months ago
- A generic, fixed-size, associative cache☆40Updated 9 months ago
- Asynchronously speed-limiting multiple byte streams☆65Updated 10 months ago
- Wrapper around Rc safe to send to a different thread☆25Updated last year
- The simd optimized escape code☆54Updated last week
- ☆39Updated 5 years ago
- Async stream for Rust and the futures crate.☆185Updated 2 weeks ago
- Concurrent hash trie☆57Updated 4 years ago
- Copy-on-write string utilities for Rust☆159Updated last year
- Timer facilities for Tokio based on OS-level primitives.☆14Updated 5 years ago
- ☆33Updated 2 years ago
- A bit vector with the Rust standard library's portable SIMD API.☆41Updated 2 years ago
- cross-platform Rust API for memory mapped IO☆42Updated last year
- Unsafe marker trait for types that deref to a stable address☆32Updated last month
- A futures abstraction that runs a set of futures which may complete in any order.☆90Updated 2 weeks ago
- Enhancement over Rust's `std::BinaryHeap`. Supports other than max heap.☆57Updated last year
- A growable bit-vector for Rust, optimized for size☆42Updated 6 months ago
- ☆46Updated last year
- Non-interleaving multithreaded output queue☆71Updated last week