diff options
| author | bors <bors@rust-lang.org> | 2025-02-22 13:32:44 +0000 |
|---|---|---|
| committer | bors <bors@rust-lang.org> | 2025-02-22 13:32:44 +0000 |
| commit | 15469f8f8ae0a77577745cf56d562600fdb6539a (patch) | |
| tree | 30bd0575f3ec4a09dedb0fce9dd9b7e33ba239b1 /compiler/rustc_data_structures/src/graph | |
| parent | 8dac72bb1d12b2649acd0c190e41524f83da5683 (diff) | |
| parent | 4910eb9f97ddf70eb446b3a8e0c4234c39084ce1 (diff) | |
| download | rust-15469f8f8ae0a77577745cf56d562600fdb6539a.tar.gz rust-15469f8f8ae0a77577745cf56d562600fdb6539a.zip | |
Auto merge of #137420 - matthiaskrgr:rollup-rr0q37f, r=matthiaskrgr
Rollup of 9 pull requests Successful merges: - #136910 (Implement feature `isolate_most_least_significant_one` for integer types) - #137183 (Prune dead regionck code) - #137333 (Use `edition = "2024"` in the compiler (redux)) - #137356 (Ferris 🦀 Identifier naming conventions) - #137362 (Add build step log for `run-make-support`) - #137377 (Always allow reusing cratenum in CrateLoader::load) - #137388 (Fix(lib/fs/tests): Disable rename POSIX semantics FS tests under Windows 7) - #137410 (Use StableHasher + Hash64 for dep_tracking_hash) - #137413 (jubilee cleared out the review queue) r? `@ghost` `@rustbot` modify labels: rollup
Diffstat (limited to 'compiler/rustc_data_structures/src/graph')
| -rw-r--r-- | compiler/rustc_data_structures/src/graph/scc/mod.rs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/compiler/rustc_data_structures/src/graph/scc/mod.rs b/compiler/rustc_data_structures/src/graph/scc/mod.rs index 93f6192b10b..2241b538738 100644 --- a/compiler/rustc_data_structures/src/graph/scc/mod.rs +++ b/compiler/rustc_data_structures/src/graph/scc/mod.rs @@ -133,7 +133,7 @@ impl<N: Idx, S: Idx + Ord, A: Annotation> Sccs<N, S, A> { /// meaning that if `S1 -> S2`, we will visit `S2` first and `S1` after. /// This is convenient when the edges represent dependencies: when you visit /// `S1`, the value for `S2` will already have been computed. - pub fn all_sccs(&self) -> impl Iterator<Item = S> { + pub fn all_sccs(&self) -> impl Iterator<Item = S> + use<N, S, A> { (0..self.scc_data.len()).map(S::new) } |