*/
enum t<T, U> {
/* Variant: left */
- left(T);
+ left(T),
/* Variant: right */
- right(U);
+ right(U),
}
/* Section: Operations */
Contains the result value
*/
- ok(T);
+ ok(T),
/*
Variant: err
Contains the error value
*/
- err(U);
+ err(U),
}
/* Section: Operations */
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 */
};
enum chain<K, V> {
- present(@entry<K, V>);
- absent;
+ present(@entry<K, V>),
+ absent,
}
type t<K, V> = {
};
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>(
/*
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 */