| Age | Commit message (Expand) | Author | Files | Lines |
|---|---|---|---|---|
| 2018-03-16 | Use set_foreach instead of rolling our own. | Thomas Helland | 1 | -9/+3 |
| 2017-12-01 | Add asserts that the user doesn't try to add the empty or deleted values. | Eric Anholt | 1 | -0/+8 |
| 2016-03-02 | Do a full search when adding new items | Jason Ekstrand | 1 | -7/+17 |
| 2013-10-25 | Cleanup implementation of set to prefer "set" over "hash table" or "ht"cworth-with-warnings | Carl Worth | 1 | -91/+93 |
| 2013-10-25 | Teach the hash table itself to know its own hash function | Carl Worth | 1 | -9/+38 |
| 2013-10-25 | Add set_contains and int_set_contains functions. | Carl Worth | 1 | -0/+12 |
| 2013-10-25 | Add new convenience function 'remove' (renaming former to 'remove_entry') | Carl Worth | 1 | -1/+18 |
| 2012-11-06 | Make a few function args const. | Eric Anholt | 1 | -3/+3 |
| 2012-11-06 | Make the deleted_key variables static const. | Eric Anholt | 1 | -2/+2 |
| 2011-08-18 | Add a set implementation derived from the hash_table implementation. | Eric Anholt | 1 | -0/+346 |
 |
index : ~anholt/hash_table | |
| Open-addressing, linear probing hash table code for reuse in various projects. | anholt |
| summaryrefslogtreecommitdiff |