diff options
| author | Nick Lewycky <nicholas@mxc.ca> | 2010-08-01 23:18:45 +0000 |
|---|---|---|
| committer | Nick Lewycky <nicholas@mxc.ca> | 2010-08-01 23:18:45 +0000 |
| commit | 2a80aca1a8c0d97efded8b4e3633b2c36444925d (patch) | |
| tree | dc4969fe20d7027ae737ce2ac91ddb7571054e03 /docs | |
| parent | 348e02600ef0191b4e0621078fc81f935065c1f7 (diff) | |
| download | llvm-2a80aca1a8c0d97efded8b4e3633b2c36444925d.tar.gz llvm-2a80aca1a8c0d97efded8b4e3633b2c36444925d.tar.bz2 llvm-2a80aca1a8c0d97efded8b4e3633b2c36444925d.tar.xz | |
Fix word choice.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@109995 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'docs')
| -rw-r--r-- | docs/ProgrammersManual.html | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/docs/ProgrammersManual.html b/docs/ProgrammersManual.html index 2d3c56555f..77774467f8 100644 --- a/docs/ProgrammersManual.html +++ b/docs/ProgrammersManual.html @@ -1436,7 +1436,7 @@ to the key string for a value.</p> <p>The StringMap is very fast for several reasons: quadratic probing is very cache efficient for lookups, the hash value of strings in buckets is not -recomputed when lookup up an element, StringMap rarely has to touch the +recomputed when looking up an element, StringMap rarely has to touch the memory for unrelated objects when looking up a value (even when hash collisions happen), hash table growth does not recompute the hash values for strings already in the table, and each pair in the map is store in a single allocation |