data structures

meson <compiler@my-deja.com>
4 May 2000 17:19:17 -0400

          From comp.compilers
Related articles
data structures compiler@my-deja.com (meson) (2000-05-04)
| List of all articles for this month |
From: meson <compiler@my-deja.com>
Newsgroups: comp.compilers
Date: 4 May 2000 17:19:17 -0400
Organization: Deja.com - Before you buy.
Keywords: symbols, comment

  Hello,


      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??


Thanx,
compiler
[Sure sounds like a symbol table to me. See any compiler book for the
usual hash schemes to maintain one. -John]

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.