MR.BaseUnionFind_MRVertId Class Reference

base of union-find data structures: stores only the parent forest and the operations that depend on it alone, so it is shared by the sequential UnionFind and the ParallelUnionFind More...

Inheritance diagram for MR.BaseUnionFind_MRVertId:

Public Member Functions
unsafe	BaseUnionFind_MRVertId ()
	Constructs an empty (default-constructed) instance.
unsafe	BaseUnionFind_MRVertId (MR._ByValue_BaseUnionFind_MRVertId _other)
	Generated from constructor MR::BaseUnionFind<MR.VertId>::BaseUnionFind.
	BaseUnionFind_MRVertId (Const_BaseUnionFind_MRVertId _other)
	Generated from constructor MR::BaseUnionFind<MR.VertId>::BaseUnionFind.
	BaseUnionFind_MRVertId (BaseUnionFind_MRVertId _other)
	Generated from constructor MR::BaseUnionFind<MR.VertId>::BaseUnionFind.
unsafe MR.BaseUnionFind_MRVertId	assign (MR._ByValue_BaseUnionFind_MRVertId _other)
	Generated from method MR::BaseUnionFind<MR.VertId>::operator=.
unsafe void	reset (nuint size)
	resets union-find to represent given number of elements, each element is the only one in its disjoint set Generated from method MR::BaseUnionFind<MR.VertId>reset.
unsafe MR.Std.Pair_MRVertId_Bool	uniteUnbalanced (MR.VertId first, MR.VertId second)
	unites the two sets containing given elements WITHOUT balancing by set size (BaseUnionFind keeps no sizes): it simply attaches one set's root under the other's, so chained calls can build taller trees. Prefer UnionFind::unite, which selects the new root by set size, when many unions follow one another.
unsafe bool	united (MR.VertId first, MR.VertId second)
	returns true if given two elements are from one set Generated from method MR::BaseUnionFind<MR.VertId>united.
unsafe MR.VertId	find (MR.VertId a)
	finds the root of the set containing given element with optimizing data structure updates Generated from method MR::BaseUnionFind<MR.VertId>find.
unsafe MR.VertId	findUpdateRange (MR.VertId a, MR.VertId begin, MR.VertId end)
	finds the root of the set containing given element with optimizing data structure in the range [begin, end) Generated from method MR::BaseUnionFind<MR.VertId>findUpdateRange.
unsafe MR.Const_VertMap	roots ()
	sets the root of corresponding set as the parent of each element, then returns the vector Generated from method MR::BaseUnionFind<MR.VertId>roots.
Public Member Functions inherited from MR.Const_BaseUnionFind_MRVertId
virtual void	Dispose ()
unsafe	Const_BaseUnionFind_MRVertId ()
	Constructs an empty (default-constructed) instance.
unsafe	Const_BaseUnionFind_MRVertId (MR._ByValue_BaseUnionFind_MRVertId _other)
	Generated from constructor MR::BaseUnionFind<MR.VertId>::BaseUnionFind.
	Const_BaseUnionFind_MRVertId (Const_BaseUnionFind_MRVertId _other)
	Generated from constructor MR::BaseUnionFind<MR.VertId>::BaseUnionFind.
	Const_BaseUnionFind_MRVertId (BaseUnionFind_MRVertId _other)
	Generated from constructor MR::BaseUnionFind<MR.VertId>::BaseUnionFind.
unsafe nuint	size ()
	returns the number of elements in union-find Generated from method MR::BaseUnionFind<MR.VertId>size.
unsafe bool	isRoot (MR.VertId a)
	returns true if given element is the root of some set Generated from method MR::BaseUnionFind<MR.VertId>isRoot.
unsafe MR.VertId	parent (MR.VertId a)
	return parent element of this element, which is equal to given element only for set's root Generated from method MR::BaseUnionFind<MR.VertId>parent.
unsafe MR.Const_VertMap	parents ()
	gets the parents of all elements as is Generated from method MR::BaseUnionFind<MR.VertId>parents.

Additional Inherited Members
Protected Member Functions inherited from MR.Const_BaseUnionFind_MRVertId
virtual unsafe void	Dispose (bool disposing)

Detailed Description

base of union-find data structures: stores only the parent forest and the operations that depend on it alone, so it is shared by the sequential UnionFind and the ParallelUnionFind

Template Parameters

I	is the identifier of a set's element, e.g. FaceId Generated from class MR::BaseUnionFind<MR.VertId>. Derived classes: Direct: (non-virtual) MR::UnionFind<MR.VertId> This is the non-const half of the class.

Constructor & Destructor Documentation

BaseUnionFind_MRVertId() [1/4]

unsafe MR.BaseUnionFind_MRVertId.BaseUnionFind_MRVertId ( )

inline

Constructs an empty (default-constructed) instance.

BaseUnionFind_MRVertId() [2/4]

unsafe MR.BaseUnionFind_MRVertId.BaseUnionFind_MRVertId ( MR._ByValue_BaseUnionFind_MRVertId _other )

inline

Generated from constructor MR::BaseUnionFind<MR.VertId>::BaseUnionFind.

BaseUnionFind_MRVertId() [3/4]

MR.BaseUnionFind_MRVertId.BaseUnionFind_MRVertId ( Const_BaseUnionFind_MRVertId _other )

inline

Generated from constructor MR::BaseUnionFind<MR.VertId>::BaseUnionFind.

BaseUnionFind_MRVertId() [4/4]

MR.BaseUnionFind_MRVertId.BaseUnionFind_MRVertId ( BaseUnionFind_MRVertId _other )

inline

Generated from constructor MR::BaseUnionFind<MR.VertId>::BaseUnionFind.

Member Function Documentation

assign()

unsafe MR.BaseUnionFind_MRVertId MR.BaseUnionFind_MRVertId.assign ( MR._ByValue_BaseUnionFind_MRVertId _other )

inline

Generated from method MR::BaseUnionFind<MR.VertId>::operator=.

find()

unsafe MR.VertId MR.BaseUnionFind_MRVertId.find ( MR.VertId a )

inline

finds the root of the set containing given element with optimizing data structure updates Generated from method MR::BaseUnionFind<MR.VertId>find.

findUpdateRange()

unsafe MR.VertId MR.BaseUnionFind_MRVertId.findUpdateRange ( MR.VertId a, MR.VertId begin, MR.VertId end )

inline

finds the root of the set containing given element with optimizing data structure in the range [begin, end) Generated from method MR::BaseUnionFind<MR.VertId>findUpdateRange.

reset()

unsafe void MR.BaseUnionFind_MRVertId.reset ( nuint size )

inline

resets union-find to represent given number of elements, each element is the only one in its disjoint set Generated from method MR::BaseUnionFind<MR.VertId>reset.

roots()

unsafe MR.Const_VertMap MR.BaseUnionFind_MRVertId.roots ( )

inline

sets the root of corresponding set as the parent of each element, then returns the vector Generated from method MR::BaseUnionFind<MR.VertId>roots.

united()

unsafe bool MR.BaseUnionFind_MRVertId.united ( MR.VertId first, MR.VertId second )

inline

returns true if given two elements are from one set Generated from method MR::BaseUnionFind<MR.VertId>united.

uniteUnbalanced()

unsafe MR.Std.Pair_MRVertId_Bool MR.BaseUnionFind_MRVertId.uniteUnbalanced ( MR.VertId first, MR.VertId second )

inline

unites the two sets containing given elements WITHOUT balancing by set size (BaseUnionFind keeps no sizes): it simply attaches one set's root under the other's, so chained calls can build taller trees. Prefer UnionFind::unite, which selects the new root by set size, when many unions follow one another.

Returns

first: new common root, second: true if the union was done (false if already in one set) Generated from method MR::BaseUnionFind<MR.VertId>uniteUnbalanced.

---

The documentation for this class was generated from the following file:

• MRUnionFind.cs