competitive::data_structure

Struct CompressedBinaryIndexedTree

Source 
pub struct CompressedBinaryIndexedTree<M, X, Inner>
where
    M: Monoid,
{ /* private fields */ }

Implementations§

Source§

impl<M, A> CompressedBinaryIndexedTree<M, A, Tag<M>>
where M: Monoid, A: Clone + Ord,

Source

pub fn new(points: &[(A,)]) -> Self

Source

pub fn accumulate<QA>(&self, range: &(QA,)) -> M::T
where QA: RangeBounds<A>,

Source

pub fn update(&mut self, key: &(A,), x: &M::T)

Source§

impl<M, A, B> CompressedBinaryIndexedTree<M, A, CompressedBinaryIndexedTree<M, B, Tag<M>>>
where M: Monoid, A: Clone + Ord, B: Clone + Ord,

Source

pub fn new(points: &[(A, (B,))]) -> Self

Source

pub fn accumulate<QA, QB>(&self, range: &(QA, (QB,))) -> M::T
where QA: RangeBounds<A>, QB: RangeBounds<B>,

Source

pub fn update(&mut self, key: &(A, (B,)), x: &M::T)

Source§

impl<M, A, B, C> CompressedBinaryIndexedTree<M, A, CompressedBinaryIndexedTree<M, B, CompressedBinaryIndexedTree<M, C, Tag<M>>>>
where M: Monoid, A: Clone + Ord, B: Clone + Ord, C: Clone + Ord,

Source

pub fn new(points: &[(A, (B, (C,)))]) -> Self

Source

pub fn accumulate<QA, QB, QC>(&self, range: &(QA, (QB, (QC,)))) -> M::T
where QA: RangeBounds<A>, QB: RangeBounds<B>, QC: RangeBounds<C>,

Source

pub fn update(&mut self, key: &(A, (B, (C,))), x: &M::T)

Source§

impl<M, A, B, C, D> CompressedBinaryIndexedTree<M, A, CompressedBinaryIndexedTree<M, B, CompressedBinaryIndexedTree<M, C, CompressedBinaryIndexedTree<M, D, Tag<M>>>>>
where M: Monoid, A: Clone + Ord, B: Clone + Ord, C: Clone + Ord, D: Clone + Ord,

Source

pub fn new(points: &[(A, (B, (C, (D,))))]) -> Self

Source

pub fn accumulate<QA, QB, QC, QD>( &self, range: &(QA, (QB, (QC, (QD,)))), ) -> M::T
where QA: RangeBounds<A>, QB: RangeBounds<B>, QC: RangeBounds<C>, QD: RangeBounds<D>,

Source

pub fn update(&mut self, key: &(A, (B, (C, (D,)))), x: &M::T)

Trait Implementations§

Source§

impl<M, X, Inner> Clone for CompressedBinaryIndexedTree<M, X, Inner>
where M: Monoid, X: Clone, Inner: Clone,

Source§

fn clone(&self) -> Self

Returns a duplicate of the value. Read more
1.0.0 · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl<M, X, Inner> Debug for CompressedBinaryIndexedTree<M, X, Inner>
where M: Monoid, X: Debug, Inner: Debug,

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl<M, X, Inner> Default for CompressedBinaryIndexedTree<M, X, Inner>
where M: Monoid,

Source§

fn default() -> Self

Returns the “default value” for a type. Read more

Auto Trait Implementations§

§

impl<M, X, Inner> Freeze for CompressedBinaryIndexedTree<M, X, Inner>

§

impl<M, X, Inner> RefUnwindSafe for CompressedBinaryIndexedTree<M, X, Inner>
where X: RefUnwindSafe, Inner: RefUnwindSafe,

§

impl<M, X, Inner> Send for CompressedBinaryIndexedTree<M, X, Inner>
where X: Send, Inner: Send,

§

impl<M, X, Inner> Sync for CompressedBinaryIndexedTree<M, X, Inner>
where X: Sync, Inner: Sync,

§

impl<M, X, Inner> Unpin for CompressedBinaryIndexedTree<M, X, Inner>
where X: Unpin, Inner: Unpin,

§

impl<M, X, Inner> UnwindSafe for CompressedBinaryIndexedTree<M, X, Inner>
where X: UnwindSafe, Inner: UnwindSafe,

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.