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
22
23
24
25
26
27
28
29
30
31
32
33

//! Utility functions for range parsing and validation.
//!
//! Private helpers for consistent `RangeBounds` handling across segment trees.
use core::ops::{Bound, RangeBounds};

/// Converts any `RangeBounds<usize>` into a concrete `[start, end)` tuple.
pub(crate) fn parse_range<R: RangeBounds<usize>>(range: R, size: usize) -> (usize, usize) {
    let start = match range.start_bound() {
        Bound::Included(&s) => s,
        Bound::Excluded(&s) => s + 1,
        Bound::Unbounded => 0,
    };
    let end = match range.end_bound() {
        Bound::Included(&e) => e + 1,
        Bound::Excluded(&e) => e,
        Bound::Unbounded => size,
    };
    (start, end)
}

/// Validates that a range `[left, right)` is within bounds.
///
/// # Panics
/// Panics if `left > right` or `right > size`.
pub(crate) fn validate_range(left: usize, right: usize, size: usize) {
    assert!(
        left <= right && right <= size,
        "Invalid range: got [{}, {}), size is {}",
        left,
        right,
        size
    );
}