about summary refs log tree commit diff
path: root/src/libstd
diff options
context:
space:
mode:
authorPatrick Walton <pcwalton@mimiga.net>2012-01-19 19:08:08 -0800
committerPatrick Walton <pcwalton@mimiga.net>2012-01-19 19:08:49 -0800
commit6222e98dda4bd3abfe2fdf447535111bfda4d518 (patch)
treeac66cf030f3cf9c7110dd4c96a58bb933384291b /src/libstd
parent2d2bdfe84531522e4c0967b1d2c07055f299ce39 (diff)
downloadrust-6222e98dda4bd3abfe2fdf447535111bfda4d518.tar.gz
rust-6222e98dda4bd3abfe2fdf447535111bfda4d518.zip
lib: ';' to ',' in enums in more places
Diffstat (limited to 'src/libstd')
-rw-r--r--src/libstd/fun_treemap.rs4
-rw-r--r--src/libstd/map.rs10
-rw-r--r--src/libstd/treemap.rs2
3 files changed, 8 insertions, 8 deletions
diff --git a/src/libstd/fun_treemap.rs b/src/libstd/fun_treemap.rs
index 8bd4a38d40b..cf39aa2314c 100644
--- a/src/libstd/fun_treemap.rs
+++ b/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 */
diff --git a/src/libstd/map.rs b/src/libstd/map.rs
index f7b3132b86d..37b29f73f45 100644
--- a/src/libstd/map.rs
+++ b/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>(
diff --git a/src/libstd/treemap.rs b/src/libstd/treemap.rs
index e5e6a433e2d..f5841d534c0 100644
--- a/src/libstd/treemap.rs
+++ b/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 */