diff options
| author | Guillaume Gomez <guillaume1.gomez@gmail.com> | 2025-01-27 15:38:28 +0100 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2025-01-27 15:38:28 +0100 |
| commit | f29979aebed00aead8dc37f7dd0d891127974aad (patch) | |
| tree | e1bf3a4e03ed0c0c7c2088b6d06b7d1e26b629d3 /compiler/rustc_llvm/llvm-wrapper/RustWrapper.cpp | |
| parent | 06df5cddc2c354886fae05a84dc95299648e5dc7 (diff) | |
| parent | d36e2b88d643b3d712c6e2d22b4b0d77fea07209 (diff) | |
| download | rust-f29979aebed00aead8dc37f7dd0d891127974aad.tar.gz rust-f29979aebed00aead8dc37f7dd0d891127974aad.zip | |
Rollup merge of #136082 - Zalathar:iter-nodes, r=oli-obk
Incorporate `iter_nodes` into `graph::DirectedGraph` This helper method iterates over all node IDs in the dense range `0..num_nodes`. In practice, we have a lot of graph-algorithm code that already assumes that nodes are densely numbered, by using `num_nodes` to allocate per-node indexed data structures. So I don't think this is actually a substantial change to the de-facto semantics of `graph::DirectedGraph`. --- Resolves a FIXME from #135481.
Diffstat (limited to 'compiler/rustc_llvm/llvm-wrapper/RustWrapper.cpp')
0 files changed, 0 insertions, 0 deletions