src/share/vm/libadt/dict.cpp

changeset 1040
98cb887364d3
parent 997
1580954e694c
child 1063
7bb995fbd3c0
     1.1 --- a/src/share/vm/libadt/dict.cpp	Fri Feb 27 08:34:19 2009 -0800
     1.2 +++ b/src/share/vm/libadt/dict.cpp	Fri Feb 27 13:27:09 2009 -0800
     1.3 @@ -306,7 +306,7 @@
     1.4  // Convert string to hash key.  This algorithm implements a universal hash
     1.5  // function with the multipliers frozen (ok, so it's not universal).  The
     1.6  // multipliers (and allowable characters) are all odd, so the resultant sum
     1.7 -// is odd - guarenteed not divisible by any power of two, so the hash tables
     1.8 +// is odd - guaranteed not divisible by any power of two, so the hash tables
     1.9  // can be any power of two with good results.  Also, I choose multipliers
    1.10  // that have only 2 bits set (the low is always set to be odd) so
    1.11  // multiplication requires only shifts and adds.  Characters are required to
    1.12 @@ -326,7 +326,7 @@
    1.13  }
    1.14  
    1.15  //------------------------------hashptr--------------------------------------
    1.16 -// Slimey cheap hash function; no guarenteed performance.  Better than the
    1.17 +// Slimey cheap hash function; no guaranteed performance.  Better than the
    1.18  // default for pointers, especially on MS-DOS machines.
    1.19  int hashptr(const void *key) {
    1.20  #ifdef __TURBOC__
    1.21 @@ -336,7 +336,7 @@
    1.22  #endif
    1.23  }
    1.24  
    1.25 -// Slimey cheap hash function; no guarenteed performance.
    1.26 +// Slimey cheap hash function; no guaranteed performance.
    1.27  int hashkey(const void *key) {
    1.28    return (intptr_t)key;
    1.29  }

mercurial