pub struct MergeSortTree<T> { /* private fields */ }
Expand description
Merge-sort Tree
Implementations§
Source§impl<T> MergeSortTree<T>
impl<T> MergeSortTree<T>
Sourcepub fn sum_count_le(&self, range: impl RangeBounds<usize>, ub: T) -> (T, usize)
pub fn sum_count_le(&self, range: impl RangeBounds<usize>, ub: T) -> (T, usize)
ub
以下の総和を求める
Time complexity $O((\log N) ^ 2)$
Auto Trait Implementations§
impl<T> Freeze for MergeSortTree<T>
impl<T> RefUnwindSafe for MergeSortTree<T>where
T: RefUnwindSafe,
impl<T> Send for MergeSortTree<T>where
T: Send,
impl<T> Sync for MergeSortTree<T>where
T: Sync,
impl<T> Unpin for MergeSortTree<T>where
T: Unpin,
impl<T> UnwindSafe for MergeSortTree<T>where
T: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more