Files
rust/compiler/rustc_data_structures/src
Stuart Cook 76b769c8ad Rollup merge of #152621 - petrochenkov:graph2, r=Zalathar
LinkedGraph: support adding nodes and edges in arbitrary order

If an edge uses some not-yet-known node, we just leave the node's data empty, that data can be added later.

Use this support to avoid skipping edges in RetainedDepGraph.

This is continuation of https://github.com/rust-lang/rust/pull/152590, that PR just fixes the ICE, this PR also preserves all the edges in debug dumps.
This is also a minimized version of https://github.com/rust-lang/rust/pull/151821 with a smaller amount of data structure hacks.
2026-03-14 17:30:22 +11:00
..
2023-12-10 10:56:22 +08:00
2023-12-10 10:56:22 +08:00
2025-04-09 12:29:59 +01:00
2024-07-29 08:26:52 +10:00
2026-02-25 08:09:43 -08:00
2025-06-12 15:26:06 +10:00
2025-07-01 10:55:49 -07:00
2025-07-01 10:55:49 -07:00
2026-01-23 23:16:15 +01:00
2025-02-17 21:35:52 -05:00
2025-11-04 17:49:00 +01:00
2026-02-22 21:01:27 +01:00
2026-03-12 14:37:51 +01:00
2025-05-15 19:55:43 +02:00
2024-10-12 15:17:03 +01:00
2026-01-23 23:16:15 +01:00
2025-01-11 11:34:01 +00:00