We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 46b09f5 commit 62ab21dCopy full SHA for 62ab21d
[refs]
@@ -1,5 +1,5 @@
1
---
2
-refs/heads/master: bf430b70320ef04b983ed5ee53e234a87c27343c
+refs/heads/master: b06599a7a8001914d64ec191a073684362f5b9b2
3
refs/heads/snap-stage1: e33de59e47c5076a89eadeb38f4934f58a3618a6
4
refs/heads/snap-stage3: cd6f24f9d14ac90d167386a56e7a6ac1f0318195
5
refs/heads/try: ffbe0e0e00374358b789b0037bcb3a577cd218be
trunk/src/libstd/fun_treemap.rs
@@ -1,4 +1,6 @@
#[deny(non_camel_case_types)];
+#[forbid(deprecated_mode)];
+#[forbid(deprecated_pattern)];
/*!
6
* A functional key,value store that works on anything.
@@ -32,8 +34,8 @@ enum TreeNode<K, V> {
32
34
fn init<K, V>() -> Treemap<K, V> { @Empty }
33
35
36
/// 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> {
37
+fn insert<K: copy Eq Ord, V: copy>(m: Treemap<K, V>, +k: K, +v: V)
38
+ -> Treemap<K, V> {
39
@match m {
40
@Empty => Node(@k, @v, @Empty, @Empty),
41
@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)
47
49
}
48
50
51
/// Find a value based on the key
-fn find<K: Eq Ord, V: copy>(m: Treemap<K, V>, k: K) -> Option<V> {
52
+fn find<K: Eq Ord, V: copy>(m: Treemap<K, V>, +k: K) -> Option<V> {
53
match *m {
54
Empty => None,
55
Node(@kk, @v, left, right) => {
0 commit comments