Ethereal-dev: [Ethereal-dev] Re: [Ethereal-cvs] rev 17485: /trunk/epan/: emem.c emem.h

Note: This archive is from the project's previous web site, ethereal.com. This list is no longer active.

From: "ronnie sahlberg" <ronniesahlberg@xxxxxxxxx>
Date: Tue, 7 Mar 2006 14:31:51 +1100
Do we really want hashtables ?

Hashtables very quickly degenerate to becoming a very slow linear search.
Usually they do not provide any savings in memory usage either  
So their only benefit is that they are so conceptually simple that one can hack them up from memory in 5 minutes.   



I belive binary trees are superior in every single respect (now that we already have them and implementation is not an issue)
* they are as memory efficient as hash tables
* they are infinitely faster than hashtables.



Do you really really want to have hashtables here?
I think we should not implement hashtables.




On 3/7/06, lego@xxxxxxxxxxxx <lego@xxxxxxxxxxxx> wrote:
User: lego
Date: 2006/03/06 07:15 PM

Log:
Add a hash table with string keys based on the red/black tree.

Directory: /trunk/epan/
  Changes    Path          Action
  +70 -0     emem.c        Modified
  +15 -0     emem.h        Modified



http://anonsvn.ethereal.com/viewcvs/viewcvs.py?rev=17485&view=rev
_______________________________________________
Ethereal-cvs mailing list
Ethereal-cvs@xxxxxxxxxxxx
http://www.ethereal.com/mailman/listinfo/ethereal-cvs