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 Since you have such unusual and specific requirements for its implementation, I would wager your best shot would be to write such an implementation yourself.
以上就是Looking for an array (vs linked list) hashtable implementation in C的详细内容，更多请关注web前端其它相关文章！