aboutsummaryrefslogtreecommitdiff
path: root/src/share/vm/libadt
diff options
context:
space:
mode:
authortrims <none@none>2009-03-12 18:16:36 -0700
committertrims <none@none>2009-03-12 18:16:36 -0700
commitbe223741e196a9674309e0ad6f7a6ee80d4a708c (patch)
tree7d1460f138a00c594cb7dd4097b6971a2c686eb4 /src/share/vm/libadt
parent2ccc9bd9f66f568de9d973a2bb916c40058c63fa (diff)
parent31afc3d8e2d634535d9a254cc30e88724e99cb07 (diff)
downloadjdk8u_hotspot-be223741e196a9674309e0ad6f7a6ee80d4a708c.tar.gz
Merge
Diffstat (limited to 'src/share/vm/libadt')
-rw-r--r--src/share/vm/libadt/dict.cpp6
-rw-r--r--src/share/vm/libadt/dict.hpp4
2 files changed, 5 insertions, 5 deletions
diff --git a/src/share/vm/libadt/dict.cpp b/src/share/vm/libadt/dict.cpp
index 5f3637d90..ba0757d0e 100644
--- a/src/share/vm/libadt/dict.cpp
+++ b/src/share/vm/libadt/dict.cpp
@@ -306,7 +306,7 @@ void Dict::print() {
// Convert string to hash key. This algorithm implements a universal hash
// function with the multipliers frozen (ok, so it's not universal). The
// multipliers (and allowable characters) are all odd, so the resultant sum
-// is odd - guarenteed not divisible by any power of two, so the hash tables
+// is odd - guaranteed not divisible by any power of two, so the hash tables
// can be any power of two with good results. Also, I choose multipliers
// that have only 2 bits set (the low is always set to be odd) so
// multiplication requires only shifts and adds. Characters are required to
@@ -326,7 +326,7 @@ int hashstr(const void *t) {
}
//------------------------------hashptr--------------------------------------
-// Slimey cheap hash function; no guarenteed performance. Better than the
+// Slimey cheap hash function; no guaranteed performance. Better than the
// default for pointers, especially on MS-DOS machines.
int hashptr(const void *key) {
#ifdef __TURBOC__
@@ -336,7 +336,7 @@ int hashptr(const void *key) {
#endif
}
-// Slimey cheap hash function; no guarenteed performance.
+// Slimey cheap hash function; no guaranteed performance.
int hashkey(const void *key) {
return (intptr_t)key;
}
diff --git a/src/share/vm/libadt/dict.hpp b/src/share/vm/libadt/dict.hpp
index 93f86829e..a3553ed87 100644
--- a/src/share/vm/libadt/dict.hpp
+++ b/src/share/vm/libadt/dict.hpp
@@ -86,10 +86,10 @@ class Dict : public ResourceObj { // Dictionary structure
// Hashing functions
int hashstr(const void *s); // Nice string hash
-// Slimey cheap hash function; no guarenteed performance. Better than the
+// Slimey cheap hash function; no guaranteed performance. Better than the
// default for pointers, especially on MS-DOS machines.
int hashptr(const void *key);
-// Slimey cheap hash function; no guarenteed performance.
+// Slimey cheap hash function; no guaranteed performance.
int hashkey(const void *key);
// Key comparators