()
| 263 | |
| 264 | #[test] |
| 265 | fn skips_empty_inode_children() { |
| 266 | let verts = [ |
| 267 | GraphNode::BOTTOM, |
| 268 | make_vertex(1, 0, 10), // parent |
| 269 | make_vertex(2, 5, 5), // empty (inode) |
| 270 | make_vertex(3, 0, 10), // content |
| 271 | ]; |
| 272 | let graph = build_graph(&verts, 1, &[2, 3]); |
| 273 | |
| 274 | let order = OrderResult { |
| 275 | sccs: vec![vec![VertexId(1)], vec![VertexId(2)], vec![VertexId(3)]], |
| 276 | conflict_tree: Default::default(), |
| 277 | cyclic_conflicts: 0, |
| 278 | forward_edges: Vec::new(), |
| 279 | }; |
| 280 | |
| 281 | assert!(detect_fork_conflicts(&graph, &order).is_empty()); |
| 282 | } |
| 283 | |
| 284 | #[test] |
| 285 | fn children_same_scc_no_fork() { |
nothing calls this directly
no test coverage detected