lib/hash.c


Log

Author Commit Date CI Message
Paul Eggert 4a105521 2002-11-28T00:34:24 (hash_lookup, hash_get_first, hash_get_next, hash_find_entry, hash_rehash): Replace `if (limit <= value) abort ();' with `if (! (value < limit)) abort ();', for readability.
Paul Eggert dda6605f 2002-11-23T07:02:40 Avoid use of <assert.h>, as the GNU Coding Standards hint that one should use `if (! x) abort ();' rather than `assert (x);', and anyway it's one less thing to worry about configuring. (hash_lookup, hash_get_first, hash_get_next, hash_find_entry, hash_rehash, hash_insert): Use abort rather than assert.
Jim Meyering 279745ad 2001-11-23T08:09:14 (struct hash_table): Define it here instead.
Jim Meyering 6a0b30c1 2001-11-03T08:23:54 (hash_clear): Fix a bug that could lead to an infloop or e.g., a fault due to an attempt to free a NULL pointer.
Jim Meyering 623af67c 2001-11-01T15:55:53 (hash_print) [TESTING]: Clean up.
Jim Meyering ce64c0b2 2001-08-31T07:49:39 Remove '2001' from copyright notice.
Jim Meyering 6e22c000 2001-01-20T09:36:19 whoops. revert last change
Jim Meyering dabd3d82 2001-01-20T09:34:20 Fix typo: s/false/0/.
Jim Meyering 51f49a8c 2000-12-25T18:51:58 add omitted semicolon
Jim Meyering 71b2adb4 2000-12-24T07:12:21 (is_prime): Return explicit boolean values. (hash_get_first): Return NULL to appease Irix5.6's 89.
Jim Meyering a0a18dea 2000-11-04T21:38:55 (hash_get_next): Fix a thinko: when ENTRY is the last one in a bucket, advance to the next bucket. From Alexandre Duret-Lutz.
Jim Meyering 9a884a50 2000-05-18T11:06:39 (hash_rehash): Fix a nasty bug: copy the free entry list back, too, since it may have been modified by allocate_entry. (hash_delete): Rewrite not to use both(!) the assignment operator and the comma operator in an if-expression.
Jim Meyering de1b0c61 2000-02-27T17:54:25 use double quotes, not single quotes around syntax-error-evoking string
Jim Meyering 92065733 2000-02-27T17:40:53 Arrange for cpp to fail if the configure-time declaration check was not run.
Jim Meyering b19c419e 2000-01-11T07:48:23 (hash_initialize): Fix typo in comment.
Jim Meyering b6044c6a 1999-03-17T14:07:34 (is_prime): Return bool rather than int.
Jim Meyering 9166d49f 1999-03-15T16:52:22 tweak comments add curlies use assert(0) in place of abort
Jim Meyering 6ad0acb4 1999-03-15T15:50:31 Revamp to allow fine-tuning to control when and by how 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.
Jim Meyering 21382cf3 1999-03-15T15:33:01 (hash_insert): Remove last parameter and change semantics. (hash_insert): Don't increment n_entries unconditionally -- otherwise, we'd do so even when the insertion failed. From François Pinard.
Jim Meyering bc44d402 1998-05-16T04:39:24 (is_prime): Ansideclify. (next_prime): Ansideclify. Add an assertion.
Jim Meyering 0e9de31e 1998-04-11T15:37:35 split a couple long lines
Jim Meyering 6845df70 1998-04-11T15:35:06 Add curly braces around statements in if/else/while/do/etc. that span more than a line -- even around multiline simple statements or single-line simple statements preceded by a comment line.
Jim Meyering ecdc5485 1998-04-06T08:09:11 Lots of minor spec and name changes, and new comments. (hash_rehash): Rewritten to be easier on the allocator. From François Pinard.
Jim Meyering 076487dd 1997-09-21T04:41:19 (hash_free_0): Remove prototype. Move function to precede first use.
Jim Meyering c3666f54 1997-09-20T19:38:29 (ZALLOC): Take Ht parameter instead of relying on one being in scope.
Jim Meyering 22a37aa3 1997-09-20T19:33:46 *** empty log message ***
Jim Meyering de081c65 1997-09-20T19:33:05 *** empty log message ***
Jim Meyering 188544a4 1997-09-20T18:32:40 *** empty log message ***
Jim Meyering 25e82030 1997-09-17T17:06:26 use malloc, not xmalloc in obstack #define 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.
Jim Meyering 553bf6a0 1997-09-17T16:03:32 from ti/hdlsv