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 | daf67727a3b6c0ca340a9e9f17923c2eceb8b090 (patch) | |
| tree | eb04347eb4e8b64bb9ef047182a3468c01e9a9a7 /llvm/docs/ProgrammersManual.html | |
| parent | ea3813fbc9fb0bd4de1108d566580c604094bd69 (diff) | |
| download | bcm5719-llvm-daf67727a3b6c0ca340a9e9f17923c2eceb8b090.tar.gz bcm5719-llvm-daf67727a3b6c0ca340a9e9f17923c2eceb8b090.zip | |
Fix word choice.
llvm-svn: 109995
Diffstat (limited to 'llvm/docs/ProgrammersManual.html')
| -rw-r--r-- | llvm/docs/ProgrammersManual.html | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/llvm/docs/ProgrammersManual.html b/llvm/docs/ProgrammersManual.html index 2d3c56555f0..77774467f8c 100644 --- a/llvm/docs/ProgrammersManual.html +++ b/llvm/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 |
