Struct SortedGroups

pub struct SortedGroups<G, E, F>
where
    G: Ord,
    E: Ord,
    F: Fn(&E) -> G,
{ /* private fields */ }

Implementations

impl<G, E, F> SortedGroups<G, E, F>

where G: Ord, E: Ord, F: Fn(&E) -> G,

pub fn new(group_from_element: F) -> Self

pub fn from_iter( elements: impl Iterator<Item = E>, group_from_element: F, ) -> Self

pub fn insert(&mut self, element: E)

pub fn len(&self) -> usize

pub fn groups_len(&self) -> usize

pub fn iter_groups(&self) -> impl Iterator<Item = (&G, &BTreeSet<E>)>

impl<G, E, F> SortedGroups<G, E, F>

where G: Ord, E: Ord, F: Fn(&E) -> G,

pub fn iter(&self) -> SortedGroupsIter<'_, G, E>

Trait Implementations

impl<'a, G, E, F> IntoIterator for &'a SortedGroups<G, E, F>

where G: Ord + Clone, E: Ord, F: Fn(&E) -> G,

type Item = (&'a G, &'a E)

The type of the elements being iterated over.

type IntoIter = SortedGroupsIter<'a, G, E>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.