diff options
| author | Joseph Crail <jbcrail@gmail.com> | 2015-01-06 20:53:18 -0500 |
|---|---|---|
| committer | Joseph Crail <jbcrail@gmail.com> | 2015-01-06 20:53:18 -0500 |
| commit | e3b7fedc20fcfe54e0ddb285fc6e6c6e862b3279 (patch) | |
| tree | ca1ece110a6f8dc31f5c30b595687829c08f5e82 /src/libstd/collections | |
| parent | ea6f65c5f1a3f84e010d2cef02a0160804e9567a (diff) | |
| download | rust-e3b7fedc20fcfe54e0ddb285fc6e6c6e862b3279.tar.gz rust-e3b7fedc20fcfe54e0ddb285fc6e6c6e862b3279.zip | |
Fix misspelled comments.
I cleaned up comments prior to the 1.0 alpha release.
Diffstat (limited to 'src/libstd/collections')
| -rw-r--r-- | src/libstd/collections/hash/map.rs | 2 |
1 files changed, 1 insertions, 1 deletions
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 |