array_range_query 0.2.3

High-performance generic segment tree and lazy segment tree implementations in Rust for efficient range queries, range updates, and interval operations. Supports custom monoid operations with zero-cost abstractions.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21

//! Helper types for common segment tree operations.
//!
//! Pre-built implementations for sum, min, max queries and range operations.

mod seg_tree_max;
mod seg_tree_min;
mod seg_tree_sum;

mod lazy_seg_tree_add_max;
mod lazy_seg_tree_add_min;
mod lazy_seg_tree_add_sum;
mod lazy_seg_tree_replace_sum;

pub use seg_tree_max::SegTreeMax;
pub use seg_tree_min::SegTreeMin;
pub use seg_tree_sum::SegTreeSum;

pub use lazy_seg_tree_add_max::LazySegTreeAddMax;
pub use lazy_seg_tree_add_min::LazySegTreeAddMin;
pub use lazy_seg_tree_add_sum::LazySegTreeAddSum;
pub use lazy_seg_tree_replace_sum::LazySegTreeReplaceSum;