---

yaml
---
r: 234158
b: refs/heads/beta
c: 309ee93
h: refs/heads/master
v: v3

Author: nrc

[refs]

@@ -23,7 +23,7 @@ refs/tags/0.9: 36870b185fc5f5486636d4515f0e22677493f225
 refs/tags/0.10: ac33f2b15782272ae348dbd7b14b8257b2148b5a
 refs/tags/0.11.0: e1247cb1d0d681be034adb4b558b5a0c0d5720f9
 refs/tags/0.12.0: f0c419429ef30723ceaf6b42f9b5a2aeb5d2e2d1
-refs/heads/beta: 1831bf8fb565d57b95d1ba6c8694abcaa9e889ea
+refs/heads/beta: 309ee934a6b3044589b0f048d1c6b289254bf2b2
 refs/tags/1.0.0-alpha: e42bd6d93a1d3433c486200587f8f9e12590a4d7
 refs/heads/tmp: 370fe2786109360f7c35b8ba552b83b773dd71d6
 refs/tags/1.0.0-alpha.2: 4c705f6bc559886632d3871b04f58aab093bfa2f

branches/beta/src/libgraphviz/lib.rs

@@ -413,8 +413,7 @@ impl<'a> Id<'a> {
         {
             let mut chars = name.chars();
             match chars.next() {
-                Some(c) if is_letter_or_underscore(c) => { ;
-                }
+                Some(c) if is_letter_or_underscore(c) => {}
                 _ => return Err(()),
             }
             if !chars.all(is_constituent) {
@@ -781,8 +780,7 @@ mod tests {
         fn to_opt_strs(self) -> Vec<Option<&'static str>> {
             match self {
                 UnlabelledNodes(len) => vec![None; len],
-                AllNodesLabelled(lbls) => lbls.into_iter().map(
-                        |l|Some(l)).collect(),
+                AllNodesLabelled(lbls) => lbls.into_iter().map(|l| Some(l)).collect(),
                 SomeNodesLabelled(lbls) => lbls.into_iter().collect(),
             }
         }
@@ -1015,8 +1013,10 @@ r#"digraph single_cyclic_node {
         let labels = AllNodesLabelled(vec!("{x,y}", "{x}", "{y}", "{}"));
         let r = test_input(LabelledGraph::new("hasse_diagram",
                                               labels,
-                                              vec![edge(0, 1, "", Style::None), edge(0, 2, "", Style::None),
-                 edge(1, 3, "", Style::None), edge(2, 3, "", Style::None)],
+                                              vec![edge(0, 1, "", Style::None),
+                                                   edge(0, 2, "", Style::None),
+                                                   edge(1, 3, "", Style::None),
+                                                   edge(2, 3, "", Style::None)],
                                               None));
         assert_eq!(r.unwrap(),
 r#"digraph hasse_diagram {
@@ -1050,8 +1050,10 @@ r#"digraph hasse_diagram {
 
         let g = LabelledGraphWithEscStrs::new("syntax_tree",
                                               labels,
-                                              vec![edge(0, 1, "then", Style::None), edge(0, 2, "else", Style::None),
-                 edge(1, 3, ";", Style::None),    edge(2, 3, ";", Style::None)]);
+                                              vec![edge(0, 1, "then", Style::None),
+                                                   edge(0, 2, "else", Style::None),
+                                                   edge(1, 3, ";", Style::None),
+                                                   edge(2, 3, ";", Style::None)]);
 
         render(&g, &mut writer).unwrap();
         let mut r = String::new();
@@ -1075,8 +1077,7 @@ r#"digraph syntax_tree {
     fn simple_id_construction() {
         let id1 = Id::new("hello");
         match id1 {
-            Ok(_) => {;
-            }
+            Ok(_) => {}
             Err(..) => panic!("'hello' is not a valid value for id anymore"),
         }
     }
@@ -1086,8 +1087,7 @@ r#"digraph syntax_tree {
         let id2 = Id::new("Weird { struct : ure } !!!");
         match id2 {
             Ok(_) => panic!("graphviz id suddenly allows spaces, brackets and stuff"),
-            Err(..) => {;
-            }
+            Err(..) => {}
         }
     }
 }