Struct competitive_programming_rs::data_structure::fenwick_tree::FenwickTree [−][src]
pub struct FenwickTree<T> { /* fields omitted */ }FenwickTree is a data structure that can efficiently update elements
and calculate prefix sums in a table of numbers.
https://en.wikipedia.org/wiki/Fenwick_tree
Methods
impl<T: Copy + AddAssign + Sub<Output = T>> FenwickTree<T>[src]
impl<T: Copy + AddAssign + Sub<Output = T>> FenwickTree<T>pub fn new(size: usize, init: T) -> FenwickTree<T>[src]
pub fn new(size: usize, init: T) -> FenwickTree<T>Constructs a new FenwickTree. The size of FenwickTree should be specified by size.
pub fn add(&mut self, k: usize, value: T)[src]
pub fn add(&mut self, k: usize, value: T)pub fn sum(&self, l: usize, r: usize) -> T[src]
pub fn sum(&self, l: usize, r: usize) -> TReturns a sum of range [l, r)
pub fn sum_one(&self, k: usize) -> T[src]
pub fn sum_one(&self, k: usize) -> TReturns a sum of range [0, k)
Auto Trait Implementations
impl<T> Send for FenwickTree<T> where
T: Send,
impl<T> Send for FenwickTree<T> where
T: Send, impl<T> Sync for FenwickTree<T> where
T: Sync,
impl<T> Sync for FenwickTree<T> where
T: Sync,