Struct SortedGroups 

pub struct SortedGroups<G, E>
where
    G: Ord,
    E: Ord,
{ /* private fields */ }

Implementations

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

where G: Ord, E: Ord,

pub fn new( elements: impl IntoIterator<Item = E>, group_from_element: impl Fn(&E) -> G, ) -> Self

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn get(&self, index: usize) -> Option<(&G, &E)>

pub fn groups_len(&self) -> usize

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

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

where G: Ord, E: Ord,

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

Trait Implementations

impl<G, E> Clone for SortedGroups<G, E>

where G: Ord + Clone, E: Ord + Clone,

fn clone(&self) -> SortedGroups<G, E>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<G, E> Debug for SortedGroups<G, E>

where G: Ord + Debug, E: Ord + Debug,

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

Formats the value using the given formatter.

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

where G: Ord, E: Ord,

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.

impl<G, E> PartialEq for SortedGroups<G, E>

where G: Ord, E: Ord,

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.