Struct seg_tree::segment_tree::LazyPersistentSegmentTree

pub struct LazyPersistentSegmentTree<T: PersistentNode + LazyNode> { /* private fields */ }

Lazy persistent segment tree, it saves every version of itself, it has range queries and range updates. It uses O(n+q*log(n)) space, where q is the amount of updates, and assuming that each node uses O(1) space.

Implementations

impl<T> LazyPersistentSegmentTree<T> where
    T: PersistentNode + LazyNode + Clone, 

pub fn build(values: &[T]) -> Self

Builds a lazy persistent segment tree from slice, each element of the slice will correspond to a leaf of the segment tree. It has time complexity of O(n*log(n)), assuming that combine has constant time complexity.

pub fn query(&mut self, version: usize, left: usize, right: usize) -> Option<T>

Returns the result from the range [left,right] from the version of the segment tree. It returns None if and only if range is empty. It will panic if left or right are not in [0,n), or if version is not in [0,versions). It has time complexity of O(log(n)), assuming that combine, update_lazy_value and update_lazy_value have constant time complexity.

pub fn update(
    &mut self,
    version: usize,
    left: usize,
    right: usize,
    value: <T as Node>::Value
)

It will panic if p is not in [0,n), or if version is not in [0,versions). It has time complexity of O(log(n)), assuming that combine, update_lazy_value and update_lazy_value have constant time complexity.

pub fn versions(&self) -> usize

Return the amount of different versions the current segment tree has.