about summary refs log tree commit diff
path: root/compiler/rustc_data_structures/src/graph/reference.rs
diff options
context:
space:
mode:
authorJon Gjengset <jon@thesquareplanet.com>2020-09-01 09:49:42 -0400
committerJon Gjengset <jon@thesquareplanet.com>2020-09-01 09:49:42 -0400
commit010891f8b83d0795d8d92770755f0a0cc1d0a91d (patch)
tree62e5619a7dbcd0f1ca3df8863803c9bce980fcad /compiler/rustc_data_structures/src/graph/reference.rs
parent2f96ce89d03b248c269513b011d328bff2c8dc21 (diff)
parente88e908e66cd1e6e30d789b37bcd774951d01856 (diff)
downloadrust-010891f8b83d0795d8d92770755f0a0cc1d0a91d.tar.gz
rust-010891f8b83d0795d8d92770755f0a0cc1d0a91d.zip
Merge branch 'master' into stabilize-vecdeque-make_contiguous
Diffstat (limited to 'compiler/rustc_data_structures/src/graph/reference.rs')
-rw-r--r--compiler/rustc_data_structures/src/graph/reference.rs39
1 files changed, 39 insertions, 0 deletions
diff --git a/compiler/rustc_data_structures/src/graph/reference.rs b/compiler/rustc_data_structures/src/graph/reference.rs
new file mode 100644
index 00000000000..c259fe56c15
--- /dev/null
+++ b/compiler/rustc_data_structures/src/graph/reference.rs
@@ -0,0 +1,39 @@
+use super::*;
+
+impl<'graph, G: DirectedGraph> DirectedGraph for &'graph G {
+    type Node = G::Node;
+}
+
+impl<'graph, G: WithNumNodes> WithNumNodes for &'graph G {
+    fn num_nodes(&self) -> usize {
+        (**self).num_nodes()
+    }
+}
+
+impl<'graph, G: WithStartNode> WithStartNode for &'graph G {
+    fn start_node(&self) -> Self::Node {
+        (**self).start_node()
+    }
+}
+
+impl<'graph, G: WithSuccessors> WithSuccessors for &'graph G {
+    fn successors(&self, node: Self::Node) -> <Self as GraphSuccessors<'_>>::Iter {
+        (**self).successors(node)
+    }
+}
+
+impl<'graph, G: WithPredecessors> WithPredecessors for &'graph G {
+    fn predecessors(&self, node: Self::Node) -> <Self as GraphPredecessors<'_>>::Iter {
+        (**self).predecessors(node)
+    }
+}
+
+impl<'iter, 'graph, G: WithPredecessors> GraphPredecessors<'iter> for &'graph G {
+    type Item = G::Node;
+    type Iter = <G as GraphPredecessors<'iter>>::Iter;
+}
+
+impl<'iter, 'graph, G: WithSuccessors> GraphSuccessors<'iter> for &'graph G {
+    type Item = G::Node;
+    type Iter = <G as GraphSuccessors<'iter>>::Iter;
+}