---

yaml
---
r: 42467
b: refs/heads/try
c: 2b17e2f
h: refs/heads/master
i:
  42465: af97f61
  42463: dca9d33
v: v3

Author: thestinger

[refs]

@@ -2,7 +2,7 @@
 refs/heads/master: 19dfec2aaf746535de1521f68421f9980dbf25de
 refs/heads/snap-stage1: e33de59e47c5076a89eadeb38f4934f58a3618a6
 refs/heads/snap-stage3: 2f46b763da2c098913884f101b6d71d69af41b49
-refs/heads/try: 3df183e7abd3c4d24b6b989474fd5d855bbf9c11
+refs/heads/try: 2b17e2fc18caaeb83b2a18ba9cbb9d53b92cfd54
 refs/tags/release-0.1: 1f5c5126e96c79d22cb7862f75304136e204f105
 refs/heads/ndm: f3868061cd7988080c30d6d5bf352a5a5fe2460b
 refs/heads/try2: a810c03263670238bccd64cabb12a23a46e3a278

branches/try/src/libstd/treemap.rs

@@ -36,7 +36,7 @@ use core::prelude::*;
 //   * intersection: &
 //   * difference: -
 //   * symmetric difference: ^
-// These would be convenient since the methods will work like `each`
+// These would be convenient since the methods work like `each`
 
 pub struct TreeMap<K: Ord, V> {
     priv root: Option<~TreeNode<K, V>>,
@@ -163,7 +163,7 @@ pub struct TreeMapIterator<K: Ord, V> {
 impl <K: Ord, V> TreeMapIterator<K, V> {
     /// Advance the iterator to the next node (in order) and return a
     /// tuple with a reference to the key and value. If there are no
-    /// more nodes, return None.
+    /// more nodes, return `None`.
     fn next(&mut self) -> Option<(&self/K, &self/V)> {
         while self.stack.is_not_empty() || self.node.is_some() {
             match *self.node {