Function test_get_independent_headers_complex

src/analysis/header.rs:443–475

()

#[test]
fn test_get_independent_headers_complex() {
    // Create more complex test data, simulating cross-reference scenarios
    let mut root1 = TreeNode::new("main.h".to_string());
    let mut common = TreeNode::new("common.h".to_string());
    let util1 = TreeNode::new("util1.h".to_string());
    let util2 = TreeNode::new("util2.h".to_string());
    common.add_child(util1);
    common.add_child(util2);
    root1.add_child(common);
    
    let mut root2 = TreeNode::new("secondary.h".to_string());
    let mut helper = TreeNode::new("helper.h".to_string());
    let base = TreeNode::new("base.h".to_string());
    helper.add_child(base);
    root2.add_child(helper);
    
    let trees = vec![root1, root2];
    
    // Test the function
    let result = get_independent_headers(&trees).unwrap();
    
    // Verify results - should only return top-level independent headers
    assert_eq!(result.len(), 2);
    assert!(result.contains(&"main.h"));
    assert!(result.contains(&"secondary.h"));
    
    // These should not be in the results since they are included by other headers
    assert!(!result.contains(&"common.h"));
    assert!(!result.contains(&"util1.h"));
    assert!(!result.contains(&"util2.h"));
    assert!(!result.contains(&"helper.h"));
    assert!(!result.contains(&"base.h"));
}

#[test]
fn test_get_independent_headers_circular() {