Looking for an array (vs linked list) hashtable implementation in C

Posted by kingusiu on Stack Overflow See other posts from Stack Overflow or by kingusiu
Published on 2010-04-28T15:58:17Z Indexed on 2010/04/28 16:13 UTC
Read the original article Hit count: 175

Filed under:
|
|
|

hi,

I'm looking for a hashtable implementation in C that stores its objects in (twodimensional) arrays rather than linked lists. i.e. if a collision happens, the object that is causing the collision will be stored in the next free row index rather than pushed to the head and first element of a linked list.

plus, the objects themselves must be copied to the hashtable, rather than referenced by pointers. (the objects do not live for the whole lifetime of the program but the table does).

I know that such an implementation might have serious efficiency drawbacks and is not the "standard way of hashing" but as I work on a very special system-architecture i need those characteristics.

thanks

© Stack Overflow or respective owner

Related posts about c

    Related posts about hashtable