Function test_get_independent_headers_circular

src/analysis/header.rs:478–513

()

#[test]
fn test_get_independent_headers_circular() {
    // Create circular dependency test data
    // A -> B -> C -> A (circular dependency)
    // D -> E (independent chain)
    
    let mut node_a = TreeNode::new("A.h".to_string());
    let mut node_b = TreeNode::new("B.h".to_string());
    let mut node_c = TreeNode::new("C.h".to_string());
    
    // Simulate cycle: A includes B, B includes C, C includes A
    // Note: Due to TreeNode structure limitations, we cannot directly create true circular references
    // But we can create a scenario where all nodes are included by other nodes
    node_c.add_child(TreeNode::new("A.h".to_string())); // C includes A
    node_b.add_child(node_c); // B includes C  
    node_a.add_child(node_b); // A includes B
    
    // Add an independent chain to verify mixed scenarios
    let mut node_d = TreeNode::new("D.h".to_string());
    let node_e = TreeNode::new("E.h".to_string());
    node_d.add_child(node_e);
    
    let trees = vec![node_a, node_d];
    
    // Test the function
    let result = get_independent_headers(&trees).unwrap();
    
    // In this case, should find results containing at least A.h and D.h
    // D.h is independent, A.h is a representative from the cycle
    assert!(!result.is_empty());
    
    // D.h should be in the results since it's independent
    assert!(result.contains(&"D.h"));
    
    // Results should contain the minimum set that covers all nodes
    println!("Circular dependency test result: {:?}", result);
}

#[test]
fn test_get_independent_headers_all_circular() {