From 2b17e2fc18caaeb83b2a18ba9cbb9d53b92cfd54 Mon Sep 17 00:00:00 2001
From: Daniel Micay <danielmicay@gmail.com>
Date: Tue, 15 Jan 2013 12:44:43 -0500
Subject: [PATCH] docstring/comment fixes

---
 src/libstd/treemap.rs | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/libstd/treemap.rs b/src/libstd/treemap.rs
index 6b0acaecaae..81e5aa17928 100644
--- a/src/libstd/treemap.rs
+++ b/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 {