Struct bio::data_structures::bit_tree::FenwickTree
source · Expand description
Max Bit Tree. get(i) will return the largest element e that has been added to the bit tree with set(j, e), where j <= i. Initially all positions have the value T::default(). Note that a set cannot be ‘undone’ by inserting a smaller element at the same index.
Implementations
sourceimpl<T: Ord + Default + Copy, Op: PrefixOp<T>> FenwickTree<T, Op>
impl<T: Ord + Default + Copy, Op: PrefixOp<T>> FenwickTree<T, Op>
Auto Trait Implementations
impl<T, Op> RefUnwindSafe for FenwickTree<T, Op>where
Op: RefUnwindSafe,
T: RefUnwindSafe,
impl<T, Op> Send for FenwickTree<T, Op>where
Op: Send,
T: Send,
impl<T, Op> Sync for FenwickTree<T, Op>where
Op: Sync,
T: Sync,
impl<T, Op> Unpin for FenwickTree<T, Op>where
Op: Unpin,
T: Unpin,
impl<T, Op> UnwindSafe for FenwickTree<T, Op>where
Op: UnwindSafe,
T: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more