Struct CochangeGraph 

pub struct CochangeGraph { /* private fields */ }

Available on crate feature vcs-git only.

A sparse, undirected, weighted co-change graph built incrementally across a history walk.

Paths are interned to FileIds and adjacency is stored sparsely (Vec<HashMap<FileId, u32>> indexed by node), so memory scales with the number of observed co-change pairs, not with files². Two graphs are tracked in lock-step — the full long-window graph and the recent-window subgraph — so both entropy variants come from one walk.

Implementations

impl CochangeGraph

pub fn new() -> Self

An empty graph.

pub fn record_commit<P: AsRef<Path>>(&mut self, paths: &[P], in_recent: bool)

Record that every file in paths changed together in one commit, adding (or strengthening) an edge between each unordered pair.

Commits touching more than MAX_COCHANGE_COMMIT_FILES files are skipped to bound the O(width²) edge growth of bulk imports. When in_recent is set, the edges are added to the recent subgraph too.

pub fn entropy(&self, path: &Path) -> (f64, f64)

Co-change entropy (long, recent) for path, in bits.

Returns (0.0, 0.0) for a path that was never recorded or that only ever appeared in single-file commits — by definition it has no co-change neighbours. That zero is computed, not “missing”: every file in a VCS walk receives a value.

Trait Implementations

impl Clone for CochangeGraph

fn clone(&self) -> CochangeGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CochangeGraph

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

Formats the value using the given formatter.

impl Default for CochangeGraph

fn default() -> CochangeGraph

Returns the “default value” for a type.