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-01-23 01:41:56 +0000
committerbors <bors@rust-lang.org>2023-01-23 01:41:56 +0000
commit20180540e6065fc9331247beb5794cdc2d7e2810 (patch)
tree5c70e7ac6f8df274ef2fee968f9e8b3fecf76c9f /compiler/rustc_data_structures/src/graph/implementation
parent59d3572bd6514e38ec5d2dfc3b524274074653d3 (diff)
parente0df0429c49bce88e9d81ead810804047ea26631 (diff)
downloadrust-20180540e6065fc9331247beb5794cdc2d7e2810.tar.gz
rust-20180540e6065fc9331247beb5794cdc2d7e2810.zip
Auto merge of #2762 - RalfJung:rustup, r=RalfJung
Rustup
Diffstat (limited to 'compiler/rustc_data_structures/src/graph/implementation')
-rw-r--r--compiler/rustc_data_structures/src/graph/implementation/tests.rs8
1 files changed, 4 insertions, 4 deletions
diff --git a/compiler/rustc_data_structures/src/graph/implementation/tests.rs b/compiler/rustc_data_structures/src/graph/implementation/tests.rs
index e4e4d0d44ba..dc1ce1747bf 100644
--- a/compiler/rustc_data_structures/src/graph/implementation/tests.rs
+++ b/compiler/rustc_data_structures/src/graph/implementation/tests.rs
@@ -70,8 +70,8 @@ fn test_adjacent_edges<N: PartialEq + Debug, E: PartialEq + Debug>(
             "counter={:?} expected={:?} edge_index={:?} edge={:?}",
             counter, expected_incoming[counter], edge_index, edge
         );
-        match expected_incoming[counter] {
-            (ref e, ref n) => {
+        match &expected_incoming[counter] {
+            (e, n) => {
                 assert!(e == &edge.data);
                 assert!(n == graph.node_data(edge.source()));
                 assert!(start_index == edge.target);
@@ -88,8 +88,8 @@ fn test_adjacent_edges<N: PartialEq + Debug, E: PartialEq + Debug>(
             "counter={:?} expected={:?} edge_index={:?} edge={:?}",
             counter, expected_outgoing[counter], edge_index, edge
         );
-        match expected_outgoing[counter] {
-            (ref e, ref n) => {
+        match &expected_outgoing[counter] {
+            (e, n) => {
                 assert!(e == &edge.data);
                 assert!(start_index == edge.source);
                 assert!(n == graph.node_data(edge.target));