RangeFrequencyProcessor

Struct RangeFrequencyProcessor 

Source
struct RangeFrequencyProcessor {
    bit: BinaryIndexedTree<AdditiveOperation<i32>>,
    data: Vec<u64>,
}

Fields§

§bit: BinaryIndexedTree<AdditiveOperation<i32>>§data: Vec<u64>

Implementations§

Source§

impl RangeFrequencyProcessor

Source

fn new(size: usize) -> Self

Examples found in repository?
crates/competitive/src/data_structure/range_frequency.rs (line 75)
74    pub fn execute_with_callback(mut self, mut callback: impl FnMut(usize, usize)) {
75        let mut processor = RangeFrequencyProcessor::new(self.array.len());
76        for (index, value) in self.array.into_iter().enumerate() {
77            self.queries
78                .entry(value)
79                .or_default()
80                .push(RangeFrequencyQuery::Remove { index });
81        }
82        for (_, queries) in self.queries {
83            for query in queries {
84                match query {
85                    RangeFrequencyQuery::Add { index } => {
86                        processor.add(index);
87                    }
88                    RangeFrequencyQuery::Remove { index } => {
89                        processor.remove(index);
90                    }
91                    RangeFrequencyQuery::Query {
92                        left,
93                        right,
94                        output_index,
95                    } => {
96                        callback(output_index, processor.query(left, right));
97                    }
98                }
99            }
100        }
101    }
Source

fn add(&mut self, index: usize)

Examples found in repository?
crates/competitive/src/data_structure/range_frequency.rs (line 86)
74    pub fn execute_with_callback(mut self, mut callback: impl FnMut(usize, usize)) {
75        let mut processor = RangeFrequencyProcessor::new(self.array.len());
76        for (index, value) in self.array.into_iter().enumerate() {
77            self.queries
78                .entry(value)
79                .or_default()
80                .push(RangeFrequencyQuery::Remove { index });
81        }
82        for (_, queries) in self.queries {
83            for query in queries {
84                match query {
85                    RangeFrequencyQuery::Add { index } => {
86                        processor.add(index);
87                    }
88                    RangeFrequencyQuery::Remove { index } => {
89                        processor.remove(index);
90                    }
91                    RangeFrequencyQuery::Query {
92                        left,
93                        right,
94                        output_index,
95                    } => {
96                        callback(output_index, processor.query(left, right));
97                    }
98                }
99            }
100        }
101    }
Source

fn remove(&mut self, index: usize)

Examples found in repository?
crates/competitive/src/data_structure/range_frequency.rs (line 89)
74    pub fn execute_with_callback(mut self, mut callback: impl FnMut(usize, usize)) {
75        let mut processor = RangeFrequencyProcessor::new(self.array.len());
76        for (index, value) in self.array.into_iter().enumerate() {
77            self.queries
78                .entry(value)
79                .or_default()
80                .push(RangeFrequencyQuery::Remove { index });
81        }
82        for (_, queries) in self.queries {
83            for query in queries {
84                match query {
85                    RangeFrequencyQuery::Add { index } => {
86                        processor.add(index);
87                    }
88                    RangeFrequencyQuery::Remove { index } => {
89                        processor.remove(index);
90                    }
91                    RangeFrequencyQuery::Query {
92                        left,
93                        right,
94                        output_index,
95                    } => {
96                        callback(output_index, processor.query(left, right));
97                    }
98                }
99            }
100        }
101    }
Source

fn query(&self, left: usize, right: usize) -> usize

Examples found in repository?
crates/competitive/src/data_structure/range_frequency.rs (line 96)
74    pub fn execute_with_callback(mut self, mut callback: impl FnMut(usize, usize)) {
75        let mut processor = RangeFrequencyProcessor::new(self.array.len());
76        for (index, value) in self.array.into_iter().enumerate() {
77            self.queries
78                .entry(value)
79                .or_default()
80                .push(RangeFrequencyQuery::Remove { index });
81        }
82        for (_, queries) in self.queries {
83            for query in queries {
84                match query {
85                    RangeFrequencyQuery::Add { index } => {
86                        processor.add(index);
87                    }
88                    RangeFrequencyQuery::Remove { index } => {
89                        processor.remove(index);
90                    }
91                    RangeFrequencyQuery::Query {
92                        left,
93                        right,
94                        output_index,
95                    } => {
96                        callback(output_index, processor.query(left, right));
97                    }
98                }
99            }
100        }
101    }

Trait Implementations§

Source§

impl Clone for RangeFrequencyProcessor

Source§

fn clone(&self) -> RangeFrequencyProcessor

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 Debug for RangeFrequencyProcessor

Source§

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

Formats the value using the given formatter. Read more

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