Struct BitwiseorConvolve

Source
pub struct BitwiseorConvolve<M> { /* private fields */ }

Implementations§

Source§

impl<M> BitwiseorConvolve<M>
where M: Monoid,

Source

pub fn zeta_transform(f: &mut [M::T])

$$g(m) = \sum_{n \mid m}f(n)$$

Examples found in repository?
crates/competitive/src/math/bitwiseor_convolve.rs (line 42)
41    fn transform(mut t: Self::T, _len: usize) -> Self::F {
42        BitwiseorConvolve::<R::Additive>::zeta_transform(&mut t);
43        t
44    }
More examples
Hide additional examples
crates/competitive/src/math/subset_convolve.rs (line 29)
21    fn transform(t: Self::T, len: usize) -> Self::F {
22        let k = len.trailing_zeros() as usize;
23        let mut f = vec![vec![R::zero(); len]; k + 1];
24        for (i, t) in t.iter().enumerate() {
25            let f = &mut f[i.count_ones() as usize][i];
26            *f = R::add(f, t);
27        }
28        for f in f.iter_mut() {
29            BitwiseorConvolve::<R::Additive>::zeta_transform(f);
30        }
31        f
32    }
Source§

impl<G> BitwiseorConvolve<G>
where G: Group,

Source

pub fn mobius_transform(f: &mut [G::T])

$$f(m) = \sum_{n \mid m}h(n)$$

Examples found in repository?
crates/competitive/src/math/bitwiseor_convolve.rs (line 47)
46    fn inverse_transform(mut f: Self::F, _len: usize) -> Self::T {
47        BitwiseorConvolve::<R::Additive>::mobius_transform(&mut f);
48        f
49    }
More examples
Hide additional examples
crates/competitive/src/math/subset_convolve.rs (line 36)
34    fn inverse_transform(mut f: Self::F, len: usize) -> Self::T {
35        for f in f.iter_mut() {
36            BitwiseorConvolve::<R::Additive>::mobius_transform(f);
37        }
38        let mut t = vec![R::zero(); len];
39        for (i, t) in t.iter_mut().enumerate() {
40            *t = R::add(t, &f[i.count_ones() as usize][i]);
41        }
42        t
43    }

Trait Implementations§

Source§

impl<R> ConvolveSteps for BitwiseorConvolve<R>
where R: Ring, R::T: PartialEq, R::Additive: Invertible,

Source§

type T = Vec<<R as SemiRing>::T>

Source§

type F = Vec<<R as SemiRing>::T>

Source§

fn length(t: &Self::T) -> usize

Source§

fn transform(t: Self::T, _len: usize) -> Self::F

Source§

fn inverse_transform(f: Self::F, _len: usize) -> Self::T

Source§

fn multiply(f: &mut Self::F, g: &Self::F)

Source§

fn convolve(a: Self::T, b: Self::T) -> Self::T

Auto Trait Implementations§

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, 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.