diff options
| author | Niko Matsakis <niko@alum.mit.edu> | 2016-03-05 06:54:24 -0500 |
|---|---|---|
| committer | Niko Matsakis <niko@alum.mit.edu> | 2016-03-05 08:40:37 -0500 |
| commit | 2529b730874985cc2d8d97032d9790ae6c5bcbae (patch) | |
| tree | 0a34155613cce8f9745c965def677c4b19adb763 /src/librustc_data_structures/graph | |
| parent | 43dc48c7ffb45c714b33b1e47f23f6d711c89596 (diff) | |
| download | rust-2529b730874985cc2d8d97032d9790ae6c5bcbae.tar.gz rust-2529b730874985cc2d8d97032d9790ae6c5bcbae.zip | |
adopt new header style to sidestep rust-lang-nursery/rustfmt#836
Diffstat (limited to 'src/librustc_data_structures/graph')
| -rw-r--r-- | src/librustc_data_structures/graph/mod.rs | 18 |
1 files changed, 6 insertions, 12 deletions
diff --git a/src/librustc_data_structures/graph/mod.rs b/src/librustc_data_structures/graph/mod.rs index f33769f39e8..99a87d1e760 100644 --- a/src/librustc_data_structures/graph/mod.rs +++ b/src/librustc_data_structures/graph/mod.rs @@ -121,8 +121,7 @@ impl<N: Debug, E: Debug> Graph<N, E> { } } - /////////////////////////////////////////////////////////////////////////// - // Simple accessors + // # Simple accessors #[inline] pub fn all_nodes(&self) -> &[Node<N>] { @@ -144,8 +143,7 @@ impl<N: Debug, E: Debug> Graph<N, E> { self.edges.len() } - /////////////////////////////////////////////////////////////////////////// - // Node construction + // # Node construction pub fn next_node_index(&self) -> NodeIndex { NodeIndex(self.nodes.len()) @@ -172,8 +170,7 @@ impl<N: Debug, E: Debug> Graph<N, E> { &self.nodes[idx.0] } - /////////////////////////////////////////////////////////////////////////// - // Edge construction and queries + // # Edge construction and queries pub fn next_edge_index(&self) -> EdgeIndex { EdgeIndex(self.edges.len()) @@ -232,8 +229,7 @@ impl<N: Debug, E: Debug> Graph<N, E> { self.edges[edge.0].next_edge[dir.repr] } - /////////////////////////////////////////////////////////////////////////// - // Iterating over nodes, edges + // # Iterating over nodes, edges pub fn each_node<'a, F>(&'a self, mut f: F) -> bool where F: FnMut(NodeIndex, &'a Node<N>) -> bool @@ -274,8 +270,7 @@ impl<N: Debug, E: Debug> Graph<N, E> { self.incoming_edges(target).sources() } - /////////////////////////////////////////////////////////////////////////// - // Fixed-point iteration + // # Fixed-point iteration // // A common use for graphs in our compiler is to perform // fixed-point iteration. In this case, each edge represents a @@ -306,8 +301,7 @@ impl<N: Debug, E: Debug> Graph<N, E> { } } -/////////////////////////////////////////////////////////////////////////// -// Iterators +// # Iterators pub struct AdjacentEdges<'g, N, E> where N: 'g, |