about summary refs log tree commit diff
path: root/src/libstd/collections
diff options
context:
space:
mode:
authorJoseph Crail <jbcrail@gmail.com>2014-08-01 19:40:21 -0400
committerJoseph Crail <jbcrail@gmail.com>2014-08-01 19:42:52 -0400
commitad06dfe496e4e1abbc65268a58275ca2b483def5 (patch)
tree35b592cbfd3eb0b33f1dd07e3a281890f19b6cdd /src/libstd/collections
parent292caefb26c7f99a064a1ed6a8ba37ec5375e88e (diff)
downloadrust-ad06dfe496e4e1abbc65268a58275ca2b483def5.tar.gz
rust-ad06dfe496e4e1abbc65268a58275ca2b483def5.zip
Fix misspelled comments.
Diffstat (limited to 'src/libstd/collections')
-rw-r--r--src/libstd/collections/hashmap.rs2
1 files changed, 1 insertions, 1 deletions
diff --git a/src/libstd/collections/hashmap.rs b/src/libstd/collections/hashmap.rs
index a569ee4a32a..e95a5305bc7 100644
--- a/src/libstd/collections/hashmap.rs
+++ b/src/libstd/collections/hashmap.rs
@@ -1937,7 +1937,7 @@ impl<T: Eq + Hash<S>, S, H: Hasher<S>> HashSet<T, H> {
     /// # Example
     ///
     /// This is a slightly silly example where we define the number's
-    /// parity as the equivilance class. It is important that the
+    /// parity as the equivalence class. It is important that the
     /// values hash the same, which is why we implement `Hash`.
     ///
     /// ```rust