Module disjoint_set 

Accumulate candidate values found during a subdivision search into a minimal set of merged, mutually-disjoint solutions.

A geometric subdivision search (curve/curve, curve/surface, or a plain point projection) converges on many small candidate values near each genuine solution, not just one — DisjointSet::insert folds each new candidate into whichever existing entries it could_be_equal, transitively (a candidate can bridge two previously-separate entries into one), so the result never contains two entries describing the same physical solution.

Structs

DisjointSet

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

Traits

Mergeable

A value that can be tested for approximate equality against another of the same type and combined into the smallest value definitely containing both — the building block DisjointSet merges on.