lib: ';' to ',' in enums in more places

src/libcore/either.rs

@@ -12,9 +12,9 @@ The either type
 */
 enum t<T, U> {
     /* Variant: left */
-    left(T);
+    left(T),
     /* Variant: right */
-    right(U);
+    right(U),
 }
 
 /* Section: Operations */

src/libcore/result.rs

@@ -17,13 +17,13 @@ enum t<T, U> {
 
     Contains the result value
     */
-    ok(T);
+    ok(T),
     /*
     Variant: err
 
     Contains the error value
     */
-    err(U);
+    err(U),
 }
 
 /* Section: Operations */

src/libstd/fun_treemap.rs

@@ -32,8 +32,8 @@ type treemap<K, V> = @tree_node<K, V>;
 Tag: tree_node
 */
 enum tree_node<K, V> {
-    empty;
-    node(@K, @V, @tree_node<K, V>, @tree_node<K, V>);
+    empty,
+    node(@K, @V, @tree_node<K, V>, @tree_node<K, V>),
 }
 
 /* Section: Operations */

src/libstd/map.rs

@@ -113,8 +113,8 @@ mod chained {
     };
 
     enum chain<K, V> {
-        present(@entry<K, V>);
-        absent;
+        present(@entry<K, V>),
+        absent,
     }
 
     type t<K, V> = {
@@ -125,9 +125,9 @@ mod chained {
     };
 
     enum search_result<K, V> {
-        not_found;
-        found_first(uint, @entry<K,V>);
-        found_after(@entry<K,V>, @entry<K,V>);
+        not_found,
+        found_first(uint, @entry<K,V>),
+        found_after(@entry<K,V>, @entry<K,V>),
     }
 
     fn search_rem<K: copy, V: copy>(

src/libstd/treemap.rs

@@ -28,7 +28,7 @@ type treemap<K, V> = @mutable tree_node<K, V>;
 /*
 Tag: tree_node
 */
-enum tree_node<K, V> { empty; node(@K, @V, treemap<K, V>, treemap<K, V>); }
+enum tree_node<K, V> { empty, node(@K, @V, treemap<K, V>, treemap<K, V>), }
 
 /* Section: Operations */