about summary refs log tree commit diff
path: root/src/libstd/collections
diff options
context:
space:
mode:
authorBruce Mitchener <bruce.mitchener@gmail.com>2017-07-23 22:06:16 +0700
committerBruce Mitchener <bruce.mitchener@gmail.com>2017-07-23 22:48:01 +0700
commit539df8121bf799526bcb36a1613ac3fd3e255a61 (patch)
treec5296aa81a268ca4ffbab4db99ce27aa5eb981da /src/libstd/collections
parent3cf2c04c799024bbec8e7b7187c2e8d39ace77b6 (diff)
downloadrust-539df8121bf799526bcb36a1613ac3fd3e255a61.tar.gz
rust-539df8121bf799526bcb36a1613ac3fd3e255a61.zip
Fix some doc/comment typos.
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 746e18047f9..12241b3f881 100644
--- a/src/libstd/collections/hash/map.rs
+++ b/src/libstd/collections/hash/map.rs
@@ -203,7 +203,7 @@ const DISPLACEMENT_THRESHOLD: usize = 128;
 // so we round that up to 128.
 //
 // At a load factor of α, the odds of finding the target bucket after exactly n
-// unsuccesful probes[1] are
+// unsuccessful probes[1] are
 //
 // Pr_α{displacement = n} =
 // (1 - α) / α * ∑_{k≥1} e^(-kα) * (kα)^(k+n) / (k + n)! * (1 - kα / (k + n + 1))