MnO2 / zw-fast-quantile
Zhang Wang Fast Approximate Quantiles Algorithm in Rust
☆13Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for zw-fast-quantile
- Approximate Quantiles with Configurable Worst Case Error☆15Updated 2 years ago
- structured parallel execution for async Rust☆30Updated 3 months ago
- Completion futures for Rust☆19Updated 2 years ago
- A trait-based system for creating async Wakers. Because RawWakers are healthier after they've been cooked.☆21Updated 3 years ago
- The simd optimized escape code☆53Updated this week
- Test futures under all possible polling schedules☆18Updated 2 years ago
- An experimental columnar arena☆41Updated 3 weeks ago
- An implementation of Kensler's hashed permutation algorithm☆16Updated 2 weeks ago
- Helper macros: autoimpl, impl_scope☆59Updated last month
- ☆24Updated last year
- A growable bit-vector for Rust, optimized for size☆39Updated 8 months ago
- Lightweight FST-based autocompleter library written in Rust, targeting WebAssembly and data stored in-memory☆32Updated last year
- ☆45Updated 7 months ago
- Rust traits for key comparison in maps.☆19Updated last year
- ☆13Updated 2 years ago
- ☆46Updated 4 years ago
- A trait + derive to recursively compute / print the memory usage of a data structure.☆25Updated last month
- Extra components for use with Mio.☆31Updated last month
- Calculate statistics iteratively☆38Updated 6 months ago
- ☆25Updated 5 months ago
- Rust library that provides helpers for testing resilience of I/O operations.☆32Updated last year
- A simple in-memory search for collections and key-value stores.☆64Updated last month
- ☆21Updated 4 years ago
- Fast and compact sets of bytes or ASCII characters☆28Updated 3 years ago
- Make any value Sync but only available on its original thread☆37Updated last year
- Bit-vectors and bit-slices for Rust☆27Updated 3 years ago
- Find calls to panic functions in rust executables☆35Updated 3 years ago
- A pure-Rust two-level dynamic b-tree. This crate implements a compact set data structure that preserves its elements' sorted order and a…☆77Updated this week
- Polynomial fitting of data. This aims to be the Numpy equivalent for numpy.polyfit()☆11Updated last year