about summary refs log tree commit diff
path: root/compiler/rustc_data_structures/src/graph/implementation
diff options
context:
space:
mode:
authorbors <bors@rust-lang.org>2023-04-10 09:07:02 +0000
committerbors <bors@rust-lang.org>2023-04-10 09:07:02 +0000
commitd4be8efc6296bace5b1e165f1b34d3c6da76aa8e (patch)
treefa3193661217bb3d2fed15983127eef6eb2c5228 /compiler/rustc_data_structures/src/graph/implementation
parent7f7e8fbc99600eeb662a0321a778c56537ee4889 (diff)
parent97921abc068224b29a5b2305f7e69c702ff9e38f (diff)
downloadrust-d4be8efc6296bace5b1e165f1b34d3c6da76aa8e.tar.gz
rust-d4be8efc6296bace5b1e165f1b34d3c6da76aa8e.zip
Auto merge of #110137 - Dylan-DPC:rollup-fdruvwp, r=Dylan-DPC
Rollup of 6 pull requests

Successful merges:

 - #109724 (prioritize param env candidates if they don't guide type inference)
 - #110021 (Fix a couple ICEs in the new `CastKind::Transmute` code)
 - #110044 (Avoid some manual slice length calculation)
 - #110115 (compiletest: Use remap-path-prefix only in CI)
 - #110121 (Fix `x check --stage 1` when download-rustc is enabled)
 - #110124 (Some clippy fixes in the compiler)

Failed merges:

 - #109752 (Stall auto trait assembly in new solver for int/float vars)

r? `@ghost`
`@rustbot` modify labels: rollup
Diffstat (limited to 'compiler/rustc_data_structures/src/graph/implementation')
-rw-r--r--compiler/rustc_data_structures/src/graph/implementation/mod.rs10
1 files changed, 2 insertions, 8 deletions
diff --git a/compiler/rustc_data_structures/src/graph/implementation/mod.rs b/compiler/rustc_data_structures/src/graph/implementation/mod.rs
index 1aa7ac024d9..9ff401c3c7a 100644
--- a/compiler/rustc_data_structures/src/graph/implementation/mod.rs
+++ b/compiler/rustc_data_structures/src/graph/implementation/mod.rs
@@ -206,17 +206,11 @@ impl<N: Debug, E: Debug> Graph<N, E> {
         AdjacentEdges { graph: self, direction, next: first_edge }
     }
 
-    pub fn successor_nodes<'a>(
-        &'a self,
-        source: NodeIndex,
-    ) -> impl Iterator<Item = NodeIndex> + 'a {
+    pub fn successor_nodes(&self, source: NodeIndex) -> impl Iterator<Item = NodeIndex> + '_ {
         self.outgoing_edges(source).targets()
     }
 
-    pub fn predecessor_nodes<'a>(
-        &'a self,
-        target: NodeIndex,
-    ) -> impl Iterator<Item = NodeIndex> + 'a {
+    pub fn predecessor_nodes(&self, target: NodeIndex) -> impl Iterator<Item = NodeIndex> + '_ {
         self.incoming_edges(target).sources()
     }