raphlinus / fearless_simd
☆120Updated last month
Alternatives and similar repositories for fearless_simd:
Users that are interested in fearless_simd are comparing it to the libraries listed below
- ☆52Updated 5 years ago
- Judy array implementation in pure Rust☆86Updated 7 years ago
- A crate that exposes some SIMD functionality on nightly Rust; to be obsoleted by stdsimd☆81Updated last year
- Implementation of triple buffering in Rust☆85Updated last month
- A trivial Rust struct for interchange of pixel buffers with width, height & stride☆61Updated 4 months ago
- A fast pure-rust no-unsafe implementation of LZ4 compression and decompression☆109Updated last year
- Wrapper around generic-array that adds efficient numeric trait implementations☆64Updated 8 months ago
- A Rust data structure for efficient lower-bound lookups☆90Updated last year
- Hierarchical bit set container☆120Updated last year
- skiplist☆141Updated 3 years ago
- A contiguous-in-memory double-ended queue that derefs into a slice☆154Updated 3 years ago
- Generic SIMD abstractions for Rust.☆47Updated 2 years ago
- Counting occurrences of a given byte or UTF-8 characters in a slice of memory – fast☆226Updated 5 months ago
- Composable, lock-free, allocation-light data structures☆60Updated 6 years ago
- Dynamically query a type-erased object for any trait implementation☆65Updated 2 years ago
- [DEPRECATED] A simple object arena☆37Updated 3 years ago
- Type-safe transmutations between layout-compatible types.☆122Updated 4 years ago
- Abstract over the atomicity of reference-counting pointers in rust☆150Updated 4 months ago
- Safely combine results☆81Updated 6 months ago
- Thermite SIMD: Melt your CPU☆154Updated 3 years ago
- Automatic testing of FFI bindings for Rust☆122Updated 3 years ago
- Rust serializer library☆87Updated 10 months ago
- Exploration of using Storage instead of Allocator to parameterize collections in Rust☆140Updated 2 years ago
- A cross-platform library for fast and safe memory-mapped IO in Rust☆64Updated 10 months ago
- Small Box optimization: store small item on stack and fallback to heap for large item.☆78Updated 2 months ago
- An experimental asynchronous runtime based on `io-uring`.☆77Updated 3 years ago
- An intrusive splay tree implementation that is no-std compatible and free from allocation and moves☆67Updated 2 months ago
- Asynchronous byte buffers and pipes for concurrent I/O programming.☆100Updated last month
- Generic and convenient `std` atomics via `Atomic<T>`☆46Updated 4 months ago
- Typed index version of Rust slice and Vec containers☆69Updated 5 months ago