Make graph::DepthFirstSearch accept G by value

It's required for the next commit.
Note that you can still have `G = &H`, since there are implementations of all
the graph traits for references.

Author: WaffleLapkin

compiler/rustc_data_structures/src/graph/iterate/mod.rs

@@ -70,21 +70,21 @@ pub fn reverse_post_order<G: DirectedGraph + Successors>(
 }
 
 /// A "depth-first search" iterator for a directed graph.
-pubstructDepthFirstSearch<'graph,G>
+pubstructDepthFirstSearch<G>
 where
-G:?Sized + DirectedGraph + Successors,
+G:DirectedGraph + Successors,
 {
-graph:&'graphG,
+graph:G,
 stack:Vec<G::Node>,
 visited:BitSet<G::Node>,
 }
 
-impl<'graph,G>DepthFirstSearch<'graph,G>
+impl<G>DepthFirstSearch<G>
 where
-G:?Sized + DirectedGraph + Successors,
+G:DirectedGraph + Successors,
 {
-pubfnnew(graph:&'graphG) -> Self{
-Self{graph,stack:vec![],visited:BitSet::new_empty(graph.num_nodes())}
+pubfnnew(graph:G) -> Self{
+Self{stack:vec![],visited:BitSet::new_empty(graph.num_nodes()), graph}
 }
 
 /// Version of `push_start_node` that is convenient for chained
@@ -125,9 +125,9 @@ where
 }
 }
 
-impl<G> std::fmt::DebugforDepthFirstSearch<'_,G>
+impl<G> std::fmt::DebugforDepthFirstSearch<G>
 where
-G:?Sized + DirectedGraph + Successors,
+G:DirectedGraph + Successors,
 {
 fnfmt(&self,fmt:&mut std::fmt::Formatter<'_>) -> std::fmt::Result{
 letmut f = fmt.debug_set();
@@ -138,9 +138,9 @@ where
 }
 }
 
-impl<G>IteratorforDepthFirstSearch<'_,G>
+impl<G>IteratorforDepthFirstSearch<G>
 where
-G:?Sized + DirectedGraph + Successors,
+G:DirectedGraph + Successors,
 {
 typeItem = G::Node;
 

compiler/rustc_data_structures/src/graph/mod.rs

@@ -46,9 +46,9 @@ where
 .is_some()
 }
 
-pubfndepth_first_search<G>(graph:&G,from:G::Node) -> iterate::DepthFirstSearch<'_,G>
+pubfndepth_first_search<G>(graph:G,from:G::Node) -> iterate::DepthFirstSearch<G>
 where
-G:?Sized + Successors,
+G:Successors,
 {
  iterate::DepthFirstSearch::new(graph).with_start_node(from)
 }