Author: nicholas
Date: Fri Aug 19 04:21:25 2005
New Revision: 9001
Modified:
trunk/src/hash.c
Log:
Fix spelling and POD errors
Modified: trunk/src/hash.c
==============================================================================
--- trunk/src/hash.c (original)
+++ trunk/src/hash.c Fri Aug 19 04:21:25 2005
@@ -14,7 +14,7 @@ creation the types of key and value as w
hashing functions can be set.
This hash implementation uses just one piece of malloced memory. The
-C<hash->bu> union points into this regions. At positive indices are
+C<< hash->bu >> union points into this regions. At positive indices are
bucket pointers, at negative indices is the bucket store itself.
This hash doesn't move during GC, therefore a lot of the old caveats
@@ -573,7 +573,7 @@ init_hash(Interp *interpreter, Hash *has
bp->key = bp->value = NULL;
hash->free_list = bp;
}
- /* see the grafic in expand_hash */
+ /* see the graphic in expand_hash */
hash->bu.bs = bp;
for (i = 0; i < INITIAL_BUCKETS; ++i) {
hash->bu.bi[i] = NULL;
@@ -683,7 +683,7 @@ hash_get_idx(Interp *interpreter, Hash *
void *res;
/* idx directly in the bucket store, which is at negative
- * addressess from the data pointer
+ * address from the data pointer
*/
/* locate initial */
if (bi == INITBucketIndex) {
@@ -972,7 +972,7 @@ Future optimizations:
=item * Stop reallocating the bucket pool, and instead add chunks on.
(Saves pointer fixups and copying during C<realloc>.)
-=item * Hash contraction (dunno if it's worth it)
+=item * Hash contraction (don't if it's worth it)
=back
