brurucy / ftreeLinks
A pure-rust(with zero dependencies) fenwick tree, for the efficient computation of dynamic prefix sums.
☆20Updated last month
Alternatives and similar repositories for ftree
Users that are interested in ftree are comparing it to the libraries listed below
Sorting:
- ☆34Updated last year
- Human-friendly indexed collections☆56Updated 3 months ago
- Asynchronize blocking operation.☆26Updated 3 years ago
- Fast Function Dispatch: Improving the performance of Rust's dynamic function calls☆36Updated last year
- A tiny crate mimicking Elixir's pipe operator for Rust without macros.☆36Updated 4 years ago
- A radioactive stabilization of the ptr_meta RFC.☆39Updated 4 months ago
- Easy-cast library☆30Updated 2 months ago
- Provides truly zero-cost alternatives to Iterator::step_by for both incrementing and decrementing any type that satisfies RangeBounds<T: …☆13Updated 4 years ago
- A Rust memory allocator for large slices that don't escape the stack.☆31Updated 3 years ago
- A vector-based map and set implementation for rust☆16Updated last week
- Visualise recursive functions and tree structures.☆30Updated 4 years ago
- ☆36Updated last year
- ☆30Updated last year
- A growable bit-vector for Rust, optimized for size☆45Updated 11 months ago
- Unbuffered and unlocked I/O streams☆45Updated 11 months ago
- SegVec data structure for rust. Similar to Vec, but allocates memory in chunks of increasing size.☆39Updated 2 years ago
- A Rust library for rendering images to terminals☆28Updated 3 years ago
- Helps you frob those bits☆42Updated last year
- Extremely minimal parser for ELF/PE/Mach-o/ar☆42Updated 4 years ago
- Solve hard constraints easily with Rust.☆15Updated 3 years ago
- Compile-time temporary directory shared by multiple crates and erased by `cargo clean`☆77Updated last month
- A Rust library for runtime-checked linearish types☆37Updated 2 years ago
- Fast and compact sets of bytes or ASCII characters☆28Updated 4 years ago
- Nudging the compiler to auto-vectorize things☆76Updated 2 years ago
- Linked Atomic Random Insert Vector: a thread-safe, self-memory-managed vector with no guaranteed sequential insert.☆58Updated 2 years ago
- Exhaustive iteration trait in Rust☆21Updated last week
- A generic, fixed-size, associative cache☆40Updated last year
- A simple macro to create correct opaque pointers☆21Updated 4 years ago
- Increased precision floating point numbers implemented purely in Rust.☆21Updated 9 months ago
- Extra event types built on top of rsevents☆17Updated 2 years ago