Struct InvalidationDetector 

pub struct InvalidationDetector { /* private fields */ }

Detects invalidation scope and computes reanalysis order.

Wraps DependencyGraph to provide:

• Propagation of invalidation through dependency edges
• Topological sorting for correct reanalysis order
• Comprehensive cycle detection using Tarjan’s algorithm

Examples

use thread_flow::incremental::invalidation::InvalidationDetector;
use thread_flow::incremental::DependencyGraph;
use thread_flow::incremental::types::{DependencyEdge, DependencyType};
use std::path::PathBuf;

let mut graph = DependencyGraph::new();
graph.add_edge(DependencyEdge::new(
    PathBuf::from("main.rs"),
    PathBuf::from("lib.rs"),
    DependencyType::Import,
));

let detector = InvalidationDetector::new(graph);
let result = detector.compute_invalidation_set(&[PathBuf::from("lib.rs")]);

assert!(result.invalidated_files.contains(&PathBuf::from("main.rs")));

Implementations

impl InvalidationDetector

pub fn new(graph: DependencyGraph) -> Self

Creates a new invalidation detector wrapping the given dependency graph.

Arguments

• graph - The dependency graph to use for invalidation detection.

Examples

use thread_flow::incremental::invalidation::InvalidationDetector;
use thread_flow::incremental::DependencyGraph;

let graph = DependencyGraph::new();
let detector = InvalidationDetector::new(graph);

pub fn compute_invalidation_set( &self, changed_files: &[PathBuf], ) -> InvalidationResult

Computes the complete invalidation set for the given changed files.

This is the primary high-level API for invalidation detection. It:

1. Finds all files transitively affected by changes
2. Attempts topological sort for reanalysis order
3. Detects and reports any circular dependencies

Always returns a result (never fails). If cycles are detected, they are reported in circular_dependencies and analysis_order may be empty or partial.

Arguments

• changed_files - Files that have been modified or added.

Returns

An InvalidationResult with:

• All affected files
• Topological order for reanalysis (if no cycles)
• Detected circular dependencies (if any)

Examples

use thread_flow::incremental::invalidation::InvalidationDetector;
use thread_flow::incremental::DependencyGraph;
use std::path::PathBuf;

let graph = DependencyGraph::new();
let detector = InvalidationDetector::new(graph);

let result = detector.compute_invalidation_set(&[
    PathBuf::from("src/utils.rs"),
]);

println!("Files to reanalyze: {}", result.invalidated_files.len());

pub fn topological_sort( &self, files: &[PathBuf], ) -> Result<Vec<PathBuf>, InvalidationError>

Performs topological sort on the given subset of files.

Returns files in dependency order: dependencies appear before their dependents. This is a lower-level API that directly exposes sort failures as errors.

Arguments

• files - The subset of files to sort.

Errors

Returns InvalidationError::CircularDependency if a cycle is detected.

Examples

use thread_flow::incremental::invalidation::InvalidationDetector;
use thread_flow::incremental::DependencyGraph;
use std::path::PathBuf;

let graph = DependencyGraph::new();
let detector = InvalidationDetector::new(graph);

let sorted = detector.topological_sort(&[
    PathBuf::from("a.rs"),
    PathBuf::from("b.rs"),
]);

match sorted {
    Ok(order) => println!("Analysis order: {:?}", order),
    Err(e) => eprintln!("Cycle detected: {}", e),
}

pub fn propagate_invalidation(&self, root: &Path) -> Vec<PathBuf>

Propagates invalidation from a single root file.

Finds all files transitively affected by changes to the given root. Uses BFS traversal following reverse dependency edges (dependents).

Arguments

• root - The changed file to propagate from.

Returns

All files affected by the change, including the root itself.

Examples

use thread_flow::incremental::invalidation::InvalidationDetector;
use thread_flow::incremental::DependencyGraph;
use std::path::PathBuf;

let graph = DependencyGraph::new();
let detector = InvalidationDetector::new(graph);

let affected = detector.propagate_invalidation(&PathBuf::from("core.rs"));
println!("Files affected: {}", affected.len());

Trait Implementations

impl Clone for InvalidationDetector

fn clone(&self) -> InvalidationDetector

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for InvalidationDetector

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

Formats the value using the given formatter.