X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=docs%2FProgrammersManual.html;h=e8d81a25061daa2db8d873767113226f2c1b5b2e;hb=2bf4b54a800c2dd44c0a5939fe629ea120bee2ad;hp=2d3c56555f0e0589131e07acc5eb226ddf7211af;hpb=38e59891ee4417a9be2f8146ce0ba3269e38ac21;p=oota-llvm.git diff --git a/docs/ProgrammersManual.html b/docs/ProgrammersManual.html index 2d3c56555f0..e8d81a25061 100644 --- a/docs/ProgrammersManual.html +++ b/docs/ProgrammersManual.html @@ -269,9 +269,9 @@ can get, so it will not be discussed in this document.

    -
  1. Dinkumware C++ Library -reference - an excellent reference for the STL and other parts of the -standard C++ library.
  2. +
  3. Dinkumware +C++ Library reference - an excellent reference for the STL and other parts +of the standard C++ library.
  4. C++ In a Nutshell - This is an O'Reilly book in the making. It has a decent Standard Library @@ -309,8 +309,6 @@ to write maintainable code more than where to put your curly braces.

      -
    1. CVS -Branch and Tag Primer
    2. Using static and shared libraries across platforms
    @@ -1436,7 +1434,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