---

yaml
---
r: 52349
b: refs/heads/dist-snap
c: 2b17e2f
h: refs/heads/master
i:
  52347: 150d162
v: v3

Author: thestinger

[refs]

@@ -7,7 +7,7 @@ refs/tags/release-0.1: 1f5c5126e96c79d22cb7862f75304136e204f105
 refs/heads/ndm: f3868061cd7988080c30d6d5bf352a5a5fe2460b
 refs/heads/try2: 147ecfdd8221e4a4d4e090486829a06da1e0ca3c
 refs/heads/incoming: 44d4d6de762f3f9aae1fedcf454c66b79b3ad58d
-refs/heads/dist-snap: 3df183e7abd3c4d24b6b989474fd5d855bbf9c11
+refs/heads/dist-snap: 2b17e2fc18caaeb83b2a18ba9cbb9d53b92cfd54
 refs/tags/release-0.2: c870d2dffb391e14efb05aa27898f1f6333a9596
 refs/tags/release-0.3: b5f0d0f648d9a6153664837026ba1be43d3e2503
 refs/heads/try3: 9387340aab40a73e8424c48fd42f0c521a4875c0

branches/dist-snap/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 {