array_range_query 0.2.2

Generic segment tree and lazy segment tree implementations for efficient range queries and range updates
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20

# Targets

## Feature Ideas

### Version 0.2

- [x] Change queries and updates to use `std::ops::{Bound, RangeBounds}`
  (In the future, consider changing the API to use `core::range`)
- [x] Use the AddAssign style instead of Add style everywhere
- [x] Improve SegTree type bounds (we already encapsulate the Monoid structure in the Spec)

## Version 0.3

- [x] `from_vec` in `LazySegTree` must take ownership of the vector
- [x] Add profiling to the library README
- [x] Try using `Box<&[T]>` instead of `Vec<T>`

## Version 0.4

- [ ] Add Immutable Array Range Queries (SparseTable) for idempotent operations with `O(1)` query time and `O(n log n)` space complexity