diff options
| author | Jim Meyering <jim@meyering.net> | 2000-01-11 07:48:23 +0000 |
|---|---|---|
| committer | Jim Meyering <jim@meyering.net> | 2000-01-11 07:48:23 +0000 |
| commit | 126e14b16103ab122178a4a7358e391341c10a14 (patch) | |
| tree | 9bc4482ec47d3086a3eba3b99875edcd0489b97f /lib/hash.c | |
| parent | 80fd95a91d2732256f82c05bceac530c8b90feab (diff) | |
| download | coreutils-126e14b16103ab122178a4a7358e391341c10a14.tar.xz | |
(hash_initialize): Fix typo in comment.
Diffstat (limited to 'lib/hash.c')
| -rw-r--r-- | lib/hash.c | 25 |
1 files changed, 12 insertions, 13 deletions
diff --git a/lib/hash.c b/lib/hash.c index e26d0d047..e3e5f6bdc 100644 --- a/lib/hash.c +++ b/lib/hash.c @@ -445,8 +445,8 @@ hash_reset_tuning (Hash_tuning *tuning) /* For the given hash TABLE, check the user supplied tuning structure for reasonable values, and return true if there is no gross error with it. - Otherwise, definitvely reset the TUNING field to some acceptable default in - the hash table (that is, the user loses the right of further modifying + Otherwise, definitively reset the TUNING field to some acceptable default + in the hash table (that is, the user loses the right of further modifying tuning arguments), and return false. */ static bool @@ -468,15 +468,14 @@ check_tuning (Hash_table *table) return false; } -/* Allocate and return a new hash table, or NULL upon failure. The - initial number of buckets is automatically selected so as to _guarantee_ that - you may insert at least CANDIDATE different user entries before any growth - of the hash table size occurs. So, if have a reasonably tight a-priori - upper bound on the - number of entries you intend to insert in the hash table, you may save some - table memory and insertion time, by specifying it here. If the - IS_N_BUCKETS field of the TUNING structure is true, the CANDIDATE argument - has its meaning changed to the wanted number of buckets. +/* Allocate and return a new hash table, or NULL upon failure. The initial + number of buckets is automatically selected so as to _guarantee_ that you + may insert at least CANDIDATE different user entries before any growth of + the hash table size occurs. So, if have a reasonably tight a-priori upper + bound on the number of entries you intend to insert in the hash table, you + may save some table memory and insertion time, by specifying it here. If + the IS_N_BUCKETS field of the TUNING structure is true, the CANDIDATE + argument has its meaning changed to the wanted number of buckets. TUNING points to a structure of user-supplied values, in case some fine tuning is wanted over the default behavior of the hasher. If TUNING is @@ -769,8 +768,8 @@ hash_find_entry (Hash_table *table, const void *entry, /* For an already existing hash table, change the number of buckets through specifying CANDIDATE. The contents of the hash table are preserved. The - new number of buckets is automatically selected so as to _guarantee_ that the - table may receive at least CANDIDATE different user entries, including + new number of buckets is automatically selected so as to _guarantee_ that + the table may receive at least CANDIDATE different user entries, including those already in the table, before any other growth of the hash table size occurs. If TUNING->IS_N_BUCKETS is true, then CANDIDATE specifies the exact number of buckets desired. */ |