Struct BTreeCounter

pub struct BTreeCounter<T> { /* private fields */ }

Implementations

impl<T> BTreeCounter<T>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn keys(&self) -> Keys<'_, T, usize>

pub fn values(&self) -> Values<'_, T, usize>

pub fn iter(&self) -> Iter<'_, T, usize>

Examples found in repository

crates/competitive/src/data_structure/counter.rs (line 150)

    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        f.debug_map().entries(self.iter()).finish()
    }

pub fn range<Q, R>(&self, range: R) -> Range<'_, T, usize>

where Q: Ord, R: RangeBounds<Q>, T: Borrow<Q> + Ord,

impl<T> BTreeCounter<T>

where T: Ord,

pub fn new() -> Self

pub fn clear(&mut self)

pub fn get(&self, item: &T) -> usize

pub fn add(&mut self, item: T)

Examples found in repository

crates/competitive/src/data_structure/counter.rs (line 231)

    fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I) {
        for item in iter {
            self.add(item)
        }
    }

pub fn add_count(&mut self, item: T, count: usize)

Examples found in repository

crates/competitive/src/data_structure/counter.rs (line 202)

    pub fn add(&mut self, item: T) {
        self.add_count(item, 1)
    }
    pub fn add_count(&mut self, item: T, count: usize) {
        *self.map.entry(item).or_default() += count;
    }
    pub fn remove(&mut self, item: &T) -> bool {
        self.remove_count(item, 1) == 1
    }
    pub fn remove_count(&mut self, item: &T, count: usize) -> usize {
        if let Some(cnt) = self.map.get_mut(item) {
            if *cnt <= count {
                let cnt = *cnt;
                self.map.remove(item);
                cnt
            } else {
                *cnt -= count;
                count
            }
        } else {
            0
        }
    }
}
impl<T> Extend<T> for BTreeCounter<T>
where
    T: Ord,
{
    fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I) {
        for item in iter {
            self.add(item)
        }
    }
}
impl<T> Extend<(T, usize)> for BTreeCounter<T>
where
    T: Ord,
{
    fn extend<I: IntoIterator<Item = (T, usize)>>(&mut self, iter: I) {
        for (item, count) in iter {
            self.add_count(item, count)
        }
    }

pub fn remove(&mut self, item: &T) -> bool

pub fn remove_count(&mut self, item: &T, count: usize) -> usize

Examples found in repository

crates/competitive/src/data_structure/counter.rs (line 208)

    pub fn remove(&mut self, item: &T) -> bool {
        self.remove_count(item, 1) == 1
    }

Trait Implementations

impl<T: Clone> Clone for BTreeCounter<T>

fn clone(&self) -> BTreeCounter<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T> Debug for BTreeCounter<T>

where T: Debug,

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

Formats the value using the given formatter.

impl<T> Default for BTreeCounter<T>

where T: Ord,

fn default() -> Self

Returns the “default value” for a type.

impl<T> Extend<(T, usize)> for BTreeCounter<T>

where T: Ord,

fn extend<I: IntoIterator<Item = (T, usize)>>(&mut self, iter: I)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<T> Extend<T> for BTreeCounter<T>

where T: Ord,

fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<T> FromIterator<(T, usize)> for BTreeCounter<T>

where T: Ord,

fn from_iter<I: IntoIterator<Item = (T, usize)>>(iter: I) -> Self

Creates a value from an iterator.

impl<T> FromIterator<T> for BTreeCounter<T>

where T: Ord,

fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self

Creates a value from an iterator.