From e3b7fedc20fcfe54e0ddb285fc6e6c6e862b3279 Mon Sep 17 00:00:00 2001 From: Joseph Crail Date: Tue, 6 Jan 2015 20:53:18 -0500 Subject: Fix misspelled comments. I cleaned up comments prior to the 1.0 alpha release. --- src/libstd/collections/hash/map.rs | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'src/libstd/collections') diff --git a/src/libstd/collections/hash/map.rs b/src/libstd/collections/hash/map.rs index a3fc38c34e8..f9c7d10d40e 100644 --- a/src/libstd/collections/hash/map.rs +++ b/src/libstd/collections/hash/map.rs @@ -184,7 +184,7 @@ fn test_resize_policy() { // simply introduce a new bit to the front of the hash. Therefore, if an // elements has ideal index i in the old table, it can have one of two ideal // locations in the new table. If the new bit is 0, then the new ideal index -// is i. If the new bit is 1, then the new ideal index is n + i. Intutively, +// is i. If the new bit is 1, then the new ideal index is n + i. Intuitively, // we are producing two independent tables of size n, and for each element we // independently choose which table to insert it into with equal probability. // However the rather than wrapping around themselves on overflowing their -- cgit 1.4.1-3-g733a5