Struct DisjointSet 

pub struct DisjointSet<T: Mergeable> { /* private fields */ }

A set of mutually-disjoint (no two could_be_equal) merged values, built up one candidate at a time via DisjointSet::insert.

Implementations

impl<T: Mergeable> DisjointSet<T>

pub fn new() -> Self

pub fn len(&self) -> usize

The current number of disjoint entries.

pub fn is_empty(&self) -> bool

pub fn iter(&self) -> impl Iterator<Item = &T>

pub fn insert(&mut self, candidate: T)

Fold candidate into this set: absorb every existing entry it could_be_equal (via union), repeating — not just once — since absorbing one entry can widen the merged result enough to now also could_be_equal a different, previously-distinct entry (e.g. a third candidate bridging two already-found ones, which a single non-repeating pass would leave as two separate entries instead of joining them into one). The fully-merged result takes the place of the earliest entry it absorbed (or is appended), so entries keep the order in which they were first found.

pub fn into_vec(self) -> Vec<T>

Trait Implementations

impl<T: Clone + Mergeable> Clone for DisjointSet<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug + Mergeable> Debug for DisjointSet<T>

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

Formats the value using the given formatter.

impl<T: Mergeable> Default for DisjointSet<T>

fn default() -> Self

Returns the “default value” for a type.