Struct DynamicArq

pub struct DynamicArq<T: ArqSpec> { /* private fields */ }

A dynamic, and optionally persistent, associative range query data structure.

Implementations

impl<T: ArqSpec> DynamicArq<T>

pub fn new(is_persistent: bool) -> Self

Initializes the data structure without creating any nodes.

pub fn build_from_identity(&mut self, size: i64) -> ArqView

Lazily builds a tree initialized to the identity.

pub fn build_from_slice(&mut self, init_val: &[T::S]) -> ArqView

Builds a tree whose leaves are set to a given non-empty slice.

pub fn merge_equal_sized( &mut self, (lp, ls): ArqView, (rp, rs): ArqView, ) -> ArqView

Merges two balanced subtrees into a single tree with a 0-indexed view.

pub fn push(&mut self, (p, s): ArqView) -> (ArqView, ArqView)

pub fn pull(&mut self, p: usize)

pub fn update(&mut self, view: ArqView, l: i64, r: i64, f: &T::F) -> ArqView

Applies the endomorphism f to all entries from l to r, inclusive. If l == r, the updates are eager. Otherwise, they are lazy.

pub fn query(&mut self, view: ArqView, l: i64, r: i64) -> T::S

Returns the aggregate range query on all entries from l to r, inclusive.