Struct UnionFind 

pub struct UnionFind { /* private fields */ }

Union-Find data structure for tracking connected components in a call graph.

Invariant: parent.len() == rank.len() == nodes.len() Invariant: parent[i] < parent.len() for all valid i

Implementations

impl UnionFind

pub fn new() -> Self

pub fn add_node(&mut self, file_index: u16, name: &str, kind: NodeKind) -> u32

Add a node. Returns existing ID if (file_index, name) already present.

pub fn find(&mut self, x: u32) -> u32

Find root with path compression.

Postcondition

find(find(x)) == find(x) (idempotent)

pub fn merge(&mut self, a: u32, b: u32)

Union by rank.

Postcondition

After merge(a, b): find(a) == find(b)

pub fn component_count(&mut self) -> usize

Count distinct connected components among file-kind nodes only.

pub fn get_components(&mut self) -> Vec<Vec<u16>>

Return file indices grouped by component.

pub fn get_node(&self, id: u32) -> Option<&NodeDescriptor>

Get the node descriptor for a given ID.

pub fn len(&self) -> usize

Number of nodes in the graph.

pub fn is_empty(&self) -> bool

Returns true if the graph has no nodes.

Trait Implementations

impl Debug for UnionFind

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

Formats the value using the given formatter.

impl Default for UnionFind

fn default() -> Self

Returns the “default value” for a type.