[−][src]Struct competitive_programming_rs::data_structure::fenwick_tree::fenwick_tree::FenwickTree
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
Implementations
impl<T: Copy + AddAssign + Sub<Output = T>> FenwickTree<T>
[src]
pub fn new(size: usize, init: T) -> FenwickTree<T>
[src]
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 sum(&self, l: usize, r: usize) -> T
[src]
Returns a sum of range [l, r)
pub fn sum_one(&self, k: usize) -> T
[src]
Returns a sum of range [0, k)
Auto Trait Implementations
impl<T> RefUnwindSafe for FenwickTree<T> where
T: RefUnwindSafe,
T: RefUnwindSafe,
impl<T> Send for FenwickTree<T> where
T: Send,
T: Send,
impl<T> Sync for FenwickTree<T> where
T: Sync,
T: Sync,
impl<T> Unpin for FenwickTree<T> where
T: Unpin,
T: Unpin,
impl<T> UnwindSafe for FenwickTree<T> where
T: UnwindSafe,
T: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,