Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!elroy.jpl.nasa.gov!decwrl!pa.dec.com!decprl!decprl!boyd
From: boyd@prl.dec.com (Boyd Roberts)
Newsgroups: comp.lang.c
Subject: Re: What Data Structure?
Keywords: Hash Table Trie Dictionary
Message-ID: <1991Jun25.120424.18955@prl.dec.com>
Date: 25 Jun 91 12:04:24 GMT
References: <1991Jun24.110300.3740@ecsvax.uncecs.edu>
Sender: news@prl.dec.com (USENET News System)
Reply-To: boyd@prl.dec.com (Boyd Roberts)
Organization: Digital Equipment Corporation - Paris Research Laboratory
Lines: 7
Nntp-Posting-Host: prl313.prl.dec.com

Why not use a `hash table of binary trees'?  Each hash table slot has a binary tree hanging off it.  A fast hash and an extensible tree.  Ideal.



Boyd Roberts			boyd@prl.dec.com

``When the going gets wierd, the weird turn pro...''