|
From: Nicholas N. <nj...@cs...> - 2007-07-21 01:26:58
|
On Fri, 20 Jul 2007, Christoph Bartoschek wrote: > Yes, I am currently working on a m_hashtable.c that uses open adressing with > linear probing. Each table entry stores a pointer to the item. I would recommend that you look at the interface in pub_tool_oset.h. I designed it pretty carefully, and made it quite generic. Eg. you can even use an OSet to represent ranges. If you could make the hash table implementation use the same interface we could even consider removing the AVL tree implementation and use the hash table as the OSet. Nick |