Newsgroups: comp.lang.lisp
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!oitnews.harvard.edu!purdue!lerc.nasa.gov!magnus.acs.ohio-state.edu!math.ohio-state.edu!howland.reston.ans.net!tank.news.pipex.net!pipex!news.mathworks.com!news.kei.com!simtel!news.sprintlink.net!in2.uu.net!netnews.jhuapl.edu!aplcenmp!hall
From: hall@aplcenmp.apl.jhu.edu (Marty Hall)
Subject: Re: assoc or binary search?
Message-ID: <DF7Fo8.57o@aplcenmp.apl.jhu.edu>
Organization: JHU/APL AI Lab, Hopkins P/T CS Faculty
References: <MANIN.95Sep19170953@pendragon.rockefeller.edu> <19950920T005924Z@naggum.no> <TFB.95Sep20091106@scarp.ed.ac.uk>
Date: Wed, 20 Sep 1995 12:50:32 GMT
Lines: 14

In article <TFB.95Sep20091106@scarp.ed.ac.uk> tfb@ed.ac.uk (Tim Bradshaw) writes:
>* Erik Naggum wrote:
>> Emacs Lisp actually has a sort of hash table, but it only works on symbols,
>> and is not really space-efficient; it's the obarray.  since you have
>> strings for keys, this is probably going to win big.
>
>XEmacs has native hashtables which hash on eqlness (I think), and even
>weak hashtables.

And I think that the CL-style hashing functions in cl.el (really
cl-extra.el) check to see if these tables are available and use them
if they are.
						- Marty
(proclaim '(inline skates))
