Guile Mailing List Archive
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: avl-trees vs. hashes
- To: guile@cygnus.com
- Subject: Re: avl-trees vs. hashes
- From: Sascha Ziemann <szi@aibon.ping.de>
- Date: 23 Oct 1998 15:22:05 +0200
- Content-Transfer-Encoding: 8bit
- Content-Transfer-Encoding: 8bit
- Content-Type: text/plain; charset=iso-8859-1
- In-Reply-To: Jay Glascoe's message of Tue, 20 Oct 1998 16:20:20 -0400 (EDT)
- Message-ID: <7uu30v2z2a.fsf@olivia.aibon.ping.de>
- References: <Pine.A32.3.96.981020161711.23864C-100000@jay.giss.nasa.gov>
- Sender: owner-guile@cygnus.com
Jay Glascoe <jglascoe@jay.giss.nasa.gov> writes:
| Just a thought: how about a hash table with avl-trees for buckets?
Trees are only worth to be used, when used with a big number of
elements, because of the O(log(n)). The bigger the number the better
they are.
--
/* In the beginning was the Word: */
typedef long SCM;
Guile Home |
Main Index |
Thread Index