|Hashtable alternatives firstname.lastname@example.org (Gwynfa) (2000-07-27)|
|Re: Hashtable alternatives email@example.com (Bruce Ediger) (2000-07-29)|
|Re: Hashtable alternatives firstname.lastname@example.org (2000-08-04)|
|perfect hashing email@example.com (Preston Briggs) (2000-08-04)|
|Re: perfect hashing firstname.lastname@example.org (Tzvetan Mikov) (2000-08-05)|
|Re: perfect hashing email@example.com (Jan Gray) (2000-08-09)|
|Re: perfect hashing firstname.lastname@example.org (2000-08-10)|
|[8 later articles]|
|Date:||27 Jul 2000 21:31:42 -0400|
Can anyone point me to resources that discuss the use of hashtables and what
alternative methods there may be for the storage and lookup of symbolic
information (variable names etc) in a compiler or similar ?
Some comment on the relative performance of different methods would be
Do any of the C++ STL containers offer similar capability and performance ?
[I suppose you could use something like a b-tree, but unless your symbol
table is so huge that its paging performance is an issue, hashing is hard
to beat. -John]
Return to the
Search the comp.compilers archives again.