[−][src]Struct algonium::data_structure::BITRange
Binary Indexed Tree (range-version) (0-indexed)
This data structure two queries in O(log n)
- add w to v[begin], v[begin+1], ..., v[end-1]
- get the sum of v[begin], v[begin+1], ..., v[end-1]
Methods
impl BITRange
[src]
pub fn new(n: usize) -> BITRange
[src]
pub fn add(&mut self, begin: usize, end: usize, by: i64)
[src]
v[begin], v[begin+1], ..., v[end-1] += by
pub fn get(&self, begin: usize, end: usize) -> i64
[src]
v[begin] + ... + v[end-1]
Auto Trait Implementations
Blanket Implementations
impl<T, U> Into for T where
U: From<T>,
[src]
U: From<T>,
impl<T> From for T
[src]
impl<T, U> TryFrom for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = !
🔬 This is a nightly-only experimental API. (
try_from
)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> Borrow for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> BorrowMut for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T, U> TryInto for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,