Link edges after adding a node too

zetanumbers · zetanumbers · commit 264aa3acdb4a · 2026-02-05T13:34:04.000+03:00
diff --git a/compiler/rustc_data_structures/src/graph/linked_graph/mod.rs b/compiler/rustc_data_structures/src/graph/linked_graph/mod.rs
@@ -130,6 +130,7 @@ impl<I: Idx, N, E> LinkedGraph<I, N, E> {
     pub fn add_node(&mut self, idx: I, data: N) {
         let old = self.nodes.insert(idx, Node::new(data));
         debug_assert!(old.is_none());
+        self.link_edges();
     }
 
     pub fn mut_node_data(&mut self, idx: I) -> &mut N {

Original file line number	Diff line number	Diff line change
`@@ -130,6 +130,7 @@ impl<I: Idx, N, E> LinkedGraph<I, N, E> {`
`130`	`130`	`pub fn add_node(&mut self, idx: I, data: N) {`
`131`	`131`	`let old = self.nodes.insert(idx, Node::new(data));`
`132`	`132`	`debug_assert!(old.is_none());`
	`133`	`+ self.link_edges();`
`133`	`134`	`}`
`134`	`135`
`135`	`136`	`pub fn mut_node_data(&mut self, idx: I) -> &mut N {`