@@ -413,8 +413,7 @@ impl<'a> Id<'a> {
413
413
{
414
414
let mut chars = name. chars ( ) ;
415
415
match chars. next ( ) {
416
- Some ( c) if is_letter_or_underscore ( c) => { ;
417
- }
416
+ Some ( c) if is_letter_or_underscore ( c) => { }
418
417
_ => return Err ( ( ) ) ,
419
418
}
420
419
if !chars. all ( is_constituent) {
@@ -781,8 +780,7 @@ mod tests {
781
780
fn to_opt_strs ( self ) -> Vec < Option < & ' static str > > {
782
781
match self {
783
782
UnlabelledNodes ( len) => vec ! [ None ; len] ,
784
- AllNodesLabelled ( lbls) => lbls. into_iter ( ) . map (
785
- |l|Some ( l) ) . collect ( ) ,
783
+ AllNodesLabelled ( lbls) => lbls. into_iter ( ) . map ( |l| Some ( l) ) . collect ( ) ,
786
784
SomeNodesLabelled ( lbls) => lbls. into_iter ( ) . collect ( ) ,
787
785
}
788
786
}
@@ -1015,8 +1013,10 @@ r#"digraph single_cyclic_node {
1015
1013
let labels = AllNodesLabelled ( vec ! ( "{x,y}" , "{x}" , "{y}" , "{}" ) ) ;
1016
1014
let r = test_input ( LabelledGraph :: new ( "hasse_diagram" ,
1017
1015
labels,
1018
- vec ! [ edge( 0 , 1 , "" , Style :: None ) , edge( 0 , 2 , "" , Style :: None ) ,
1019
- edge( 1 , 3 , "" , Style :: None ) , edge( 2 , 3 , "" , Style :: None ) ] ,
1016
+ vec ! [ edge( 0 , 1 , "" , Style :: None ) ,
1017
+ edge( 0 , 2 , "" , Style :: None ) ,
1018
+ edge( 1 , 3 , "" , Style :: None ) ,
1019
+ edge( 2 , 3 , "" , Style :: None ) ] ,
1020
1020
None ) ) ;
1021
1021
assert_eq ! ( r. unwrap( ) ,
1022
1022
r#"digraph hasse_diagram {
@@ -1050,8 +1050,10 @@ r#"digraph hasse_diagram {
1050
1050
1051
1051
let g = LabelledGraphWithEscStrs :: new ( "syntax_tree" ,
1052
1052
labels,
1053
- vec ! [ edge( 0 , 1 , "then" , Style :: None ) , edge( 0 , 2 , "else" , Style :: None ) ,
1054
- edge( 1 , 3 , ";" , Style :: None ) , edge( 2 , 3 , ";" , Style :: None ) ] ) ;
1053
+ vec ! [ edge( 0 , 1 , "then" , Style :: None ) ,
1054
+ edge( 0 , 2 , "else" , Style :: None ) ,
1055
+ edge( 1 , 3 , ";" , Style :: None ) ,
1056
+ edge( 2 , 3 , ";" , Style :: None ) ] ) ;
1055
1057
1056
1058
render ( & g, & mut writer) . unwrap ( ) ;
1057
1059
let mut r = String :: new ( ) ;
@@ -1075,8 +1077,7 @@ r#"digraph syntax_tree {
1075
1077
fn simple_id_construction ( ) {
1076
1078
let id1 = Id :: new ( "hello" ) ;
1077
1079
match id1 {
1078
- Ok ( _) => { ;
1079
- }
1080
+ Ok ( _) => { }
1080
1081
Err ( ..) => panic ! ( "'hello' is not a valid value for id anymore" ) ,
1081
1082
}
1082
1083
}
@@ -1086,8 +1087,7 @@ r#"digraph syntax_tree {
1086
1087
let id2 = Id :: new ( "Weird { struct : ure } !!!" ) ;
1087
1088
match id2 {
1088
1089
Ok ( _) => panic ! ( "graphviz id suddenly allows spaces, brackets and stuff" ) ,
1089
- Err ( ..) => { ;
1090
- }
1090
+ Err ( ..) => { }
1091
1091
}
1092
1092
}
1093
1093
}
0 commit comments