Skip to main content

BinomialPolynomialPrefixSum

Struct BinomialPolynomialPrefixSum 

Source
pub struct BinomialPolynomialPrefixSum<M, const K: usize>
where M: MIntConvert<usize>,
{ query: Vec<(usize, usize, [MInt<M>; K])>, }

Fields§

§query: Vec<(usize, usize, [MInt<M>; K])>

Implementations§

Source§

impl<M, const K: usize> BinomialPolynomialPrefixSum<M, K>
where M: MIntConvert<usize>,

Source

pub fn new() -> Self

Source

pub fn with_capacity(capacity: usize) -> Self

Source

pub fn push(&mut self, n: usize, m: usize, coef: [MInt<M>; K]) -> usize

Source

pub fn for_each_contribution<F>(self, f: F)
where F: FnMut(usize, MInt<M>),

Examples found in repository?
crates/competitive/src/math/binomial_prefix_sum.rs (line 196)
194    pub fn solve(self) -> Vec<MInt<M>> {
195        let mut ans = vec![MInt::zero(); self.query.len()];
196        self.for_each_contribution(|i, x| ans[i] += x);
197        ans
198    }
Source

pub fn solve(self) -> Vec<MInt<M>>

Trait Implementations§

Source§

impl<M, const K: usize> Debug for BinomialPolynomialPrefixSum<M, K>
where M: MIntConvert<usize>,

Source§

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

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

impl<M, const K: usize> Default for BinomialPolynomialPrefixSum<M, K>
where M: MIntConvert<usize>,

Source§

fn default() -> Self

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

Auto Trait Implementations§

§

impl<M, const K: usize> Freeze for BinomialPolynomialPrefixSum<M, K>
where Vec<(usize, usize, [MInt<M>; K])>: Freeze,

§

impl<M, const K: usize> RefUnwindSafe for BinomialPolynomialPrefixSum<M, K>
where Vec<(usize, usize, [MInt<M>; K])>: RefUnwindSafe,

§

impl<M, const K: usize> Send for BinomialPolynomialPrefixSum<M, K>
where Vec<(usize, usize, [MInt<M>; K])>: Send,

§

impl<M, const K: usize> Sync for BinomialPolynomialPrefixSum<M, K>
where Vec<(usize, usize, [MInt<M>; K])>: Sync,

§

impl<M, const K: usize> Unpin for BinomialPolynomialPrefixSum<M, K>
where Vec<(usize, usize, [MInt<M>; K])>: Unpin,

§

impl<M, const K: usize> UnsafeUnpin for BinomialPolynomialPrefixSum<M, K>
where Vec<(usize, usize, [MInt<M>; K])>: UnsafeUnpin,

§

impl<M, const K: usize> UnwindSafe for BinomialPolynomialPrefixSum<M, K>
where Vec<(usize, usize, [MInt<M>; K])>: 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> 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> ToArrayVecScalar for T

Source§

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

Source§

type Error = !

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

fn try_from(value: U) -> Result<T, !>

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.