Struct imageproc::union_find::DisjointSetForest
source · pub struct DisjointSetForest { /* private fields */ }
Expand description
Data structure for efficient union find.
Implementations§
source§impl DisjointSetForest
impl DisjointSetForest
sourcepub fn new(count: usize) -> DisjointSetForest
pub fn new(count: usize) -> DisjointSetForest
Constructs forest of singletons with count elements.
sourcepub fn root(&mut self, i: usize) -> usize
pub fn root(&mut self, i: usize) -> usize
Returns index of the root of the tree containing i. Needs mutable reference to self for path compression.
Auto Trait Implementations§
impl Freeze for DisjointSetForest
impl RefUnwindSafe for DisjointSetForest
impl Send for DisjointSetForest
impl Sync for DisjointSetForest
impl Unpin for DisjointSetForest
impl UnwindSafe for DisjointSetForest
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read moresource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.