about summary refs log tree commit diff
path: root/src/libstd/collections
diff options
context:
space:
mode:
authorAndy Russell <arussell123@gmail.com>2018-11-12 13:05:20 -0500
committerAndy Russell <arussell123@gmail.com>2018-11-13 14:45:31 -0500
commit4e35cbb22eceac145a6f794cde869b3684e0b1d5 (patch)
treeecd0cb5a9d4d5fd320029b88881c4c786b27513b /src/libstd/collections
parent0195812aeafeecaa8760a4ddceae187472db8fe6 (diff)
downloadrust-4e35cbb22eceac145a6f794cde869b3684e0b1d5.tar.gz
rust-4e35cbb22eceac145a6f794cde869b3684e0b1d5.zip
fix various typos in doc comments
Diffstat (limited to 'src/libstd/collections')
-rw-r--r--src/libstd/collections/hash/map.rs2
1 files changed, 1 insertions, 1 deletions
diff --git a/src/libstd/collections/hash/map.rs b/src/libstd/collections/hash/map.rs
index 8de415e8aed..bb2f152edc6 100644
--- a/src/libstd/collections/hash/map.rs
+++ b/src/libstd/collections/hash/map.rs
@@ -1569,7 +1569,7 @@ impl<K, V, S> HashMap<K, V, S>
     /// where the key should go, meaning the keys may become "lost" if their
     /// location does not reflect their state. For instance, if you change a key
     /// so that the map now contains keys which compare equal, search may start
-    /// acting eratically, with two keys randomly masking eachother. Implementations
+    /// acting erratically, with two keys randomly masking each other. Implementations
     /// are free to assume this doesn't happen (within the limits of memory-safety).
     #[unstable(feature = "hash_raw_entry", issue = "54043")]
     pub fn raw_entry_mut(&mut self) -> RawEntryBuilderMut<K, V, S> {