|data structures firstname.lastname@example.org (meson) (2000-05-04)|
|Date:||4 May 2000 17:19:17 -0400|
|Organization:||Deja.com - Before you buy.|
I want a data structure that efficiently stores arbitrary strings
and allows fast lookup and deletion. By efficient storage i mean that
it should help remove redundant storage of strings by returning the
same key when two strings are similar. As u can guess this sounds the
recipe for a symbol table :) Any ideas??
[Sure sounds like a symbol table to me. See any compiler book for the
usual hash schemes to maintain one. -John]
Return to the
Search the comp.compilers archives again.