Implement suggestions from Chris:   - Use a more accurate heuristic for the size of the hashtable.   - Use bitwise and instead of modulo since the size is a power of two.   - Use new[] instead of malloc().
Implement suggestions from Chris:
  - Use a more accurate heuristic for the size of the hashtable.
  - Use bitwise and instead of modulo since the size is a power of two.
  - Use new[] instead of malloc().


git-svn-id: a4a6f32337ebd29ad4763b423022f00f68d1c7b7@52951 91177308-0d34-0410-b5e6-96231b3b80d8

lodyagin/bare_cxx,lodyagin/bare_cxx,lodyagin/bare_cxx,lodyagin/bare_cxx,lodyagin/bare_cxx