summaryrefslogtreecommitdiff
path: root/lib/hash.c
AgeCommit message (Collapse)Author
2000-01-11(hash_initialize): Fix typo in comment.Jim Meyering
1999-03-17(is_prime): Return bool rather than int.Jim Meyering
1999-03-15tweak commentsJim Meyering
add curlies use assert(0) in place of abort
1999-03-15Revamp to allow fine-tuning to control when and by howJim Meyering
much the table grows and shrinks. (next_prime): Don't assert. (hash_reset_tuning): New function. (check_tuning): New function. (hash_initialize): Accept and use new tuning parameter. (hash_rehash): Rewrite, updating for tuning. (hash_insert): Honor tuning semantics. (hash_delete): Likewise. From François Pinard.
1999-03-15(hash_insert): Remove last parameter and change semantics.Jim Meyering
(hash_insert): Don't increment n_entries unconditionally -- otherwise, we'd do so even when the insertion failed. From François Pinard.
1998-05-16(is_prime): Ansideclify.Jim Meyering
(next_prime): Ansideclify. Add an assertion.
1998-04-11split a couple long linesJim Meyering
1998-04-11Add curly braces around statements in if/else/while/do/etc. thatJim Meyering
span more than a line -- even around multiline simple statements or single-line simple statements preceded by a comment line.
1998-04-06Lots of minor spec and name changes, and new comments.Jim Meyering
(hash_rehash): Rewritten to be easier on the allocator. From François Pinard.
1997-09-21(hash_free_0): Remove prototype.Jim Meyering
Move function to precede first use.
1997-09-20(ZALLOC): Take Ht parameter instead of relying on one being in scope.Jim Meyering
1997-09-20*** empty log message ***Jim Meyering
1997-09-20*** empty log message ***Jim Meyering
1997-09-20*** empty log message ***Jim Meyering
1997-09-17use malloc, not xmalloc in obstack #defineJim Meyering
use Uli's prime code, not near-prime (hash_initialize): don't require prime table size as input (hash_insert_if_absent): When rehashing, choose new size that is 2N+1, not 2N.
1997-09-17from ti/hdlsvJim Meyering