Re: [PATCH v5 02/14] add a hashtable implementation that supports O(1) removal

2013-12-18 Thread Karsten Blees
Am 14.12.2013 03:04, schrieb Jonathan Nieder: Hi, Karsten Blees wrote: test-hashmap.c | 340 Here come two small tweaks on top (meant for squashing in or applying to the series, whichever is more convenient). Thanks,

Re: [PATCH v5 02/14] add a hashtable implementation that supports O(1) removal

2013-12-13 Thread Jonathan Nieder
Hi, Karsten Blees wrote: test-hashmap.c | 340 Here come two small tweaks on top (meant for squashing in or applying to the series, whichever is more convenient). Thanks, Jonathan Nieder (2): Add test-hashmap to .gitignore Drop

[PATCH v5 02/14] add a hashtable implementation that supports O(1) removal

2013-11-14 Thread Karsten Blees
The existing hashtable implementation (in hash.[ch]) uses open addressing (i.e. resolve hash collisions by distributing entries across the table). Thus, removal is difficult to implement with less than O(n) complexity. Resolving collisions of entries with identical hashes (e.g. via chaining) is