diff options
| author | Kevin Cantu <me@kevincantu.org> | 2012-08-31 15:54:01 -0700 |
|---|---|---|
| committer | Kevin Cantu <me@kevincantu.org> | 2012-09-01 13:08:20 -0700 |
| commit | b06599a7a8001914d64ec191a073684362f5b9b2 (patch) | |
| tree | 2a56739b40a3f6506dc662edcddf032ec35fcd44 /src/libstd | |
| parent | bf430b70320ef04b983ed5ee53e234a87c27343c (diff) | |
Demode fun_treemap.rs
Diffstat (limited to 'src/libstd')
| -rw-r--r-- | src/libstd/fun_treemap.rs | 8 |
1 files changed, 5 insertions, 3 deletions
diff --git a/src/libstd/fun_treemap.rs b/src/libstd/fun_treemap.rs index e7780c51826..2cd5f8e24d1 100644 --- a/src/libstd/fun_treemap.rs +++ b/src/libstd/fun_treemap.rs @@ -1,4 +1,6 @@ #[deny(non_camel_case_types)]; +#[forbid(deprecated_mode)]; +#[forbid(deprecated_pattern)]; /*! * A functional key,value store that works on anything. @@ -32,8 +34,8 @@ enum TreeNode<K, V> { fn init<K, V>() -> Treemap<K, V> { @Empty } /// Insert a value into the map -fn insert<K: copy Eq Ord, V: copy>(m: Treemap<K, V>, k: K, v: V) - -> Treemap<K, V> { +fn insert<K: copy Eq Ord, V: copy>(m: Treemap<K, V>, +k: K, +v: V) + -> Treemap<K, V> { @match m { @Empty => Node(@k, @v, @Empty, @Empty), @Node(@kk, vv, left, right) => { @@ -47,7 +49,7 @@ fn insert<K: copy Eq Ord, V: copy>(m: Treemap<K, V>, k: K, v: V) } /// Find a value based on the key -fn find<K: Eq Ord, V: copy>(m: Treemap<K, V>, k: K) -> Option<V> { +fn find<K: Eq Ord, V: copy>(m: Treemap<K, V>, +k: K) -> Option<V> { match *m { Empty => None, Node(@kk, @v, left, right) => { |
