From 2a80aca1a8c0d97efded8b4e3633b2c36444925d Mon Sep 17 00:00:00 2001 From: Nick Lewycky Date: Sun, 1 Aug 2010 23:18:45 +0000 Subject: [PATCH] Fix word choice. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@109995 91177308-0d34-0410-b5e6-96231b3b80d8 --- docs/ProgrammersManual.html | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/ProgrammersManual.html b/docs/ProgrammersManual.html index 2d3c56555f0..77774467f8c 100644 --- a/docs/ProgrammersManual.html +++ b/docs/ProgrammersManual.html @@ -1436,7 +1436,7 @@ to the key string for a value.

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