From ... Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!newsfeeds.belnet.be!news.belnet.be!news2.kpn.net!news.kpn.net!nslave.kpnqwest.net!nloc.kpnqwest.net!nmaster.kpnqwest.net!nreader3.kpnqwest.net.POSTED!not-for-mail Newsgroups: comp.lang.lisp Subject: Re: hashtable suggestions (or perhaps a different approach?) References: Mail-Copies-To: never From: Erik Naggum Message-ID: <3223403910932466@naggum.net> Organization: Naggum Software, Oslo, Norway Lines: 14 User-Agent: Gnus/5.09 (Gnus v5.9.0) Emacs/21.1 MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Date: Fri, 22 Feb 2002 21:58:26 GMT X-Complaints-To: newsmaster@KPNQwest.no X-Trace: nreader3.kpnqwest.net 1014415106 193.71.199.50 (Fri, 22 Feb 2002 22:58:26 MET) NNTP-Posting-Date: Fri, 22 Feb 2002 22:58:26 MET Xref: archiver1.google.com comp.lang.lisp:27217 * Tim Lavoie | Anyway, it does happen to work, but profiling in CMUCL shows that nearly | all the work is happening in my gethash calls. Fair enough, I realize | that it's expensive compared to simpler hash keys, but what might be a | better way to do this? It could be that all the keys wind up in the same hash bucket. You have to inspect the hash table internals to see if this is the case or not, but the documentation might also provide important clues. /// -- In a fight against something, the fight has value, victory has none. In a fight for something, the fight is a loss, victory merely relief.