[Lispweb] IMHO: popup-list

Marco Antoniotti marcoxa at cs.nyu.edu
Tue Feb 26 17:33:51 CST 2002


> Sender: craig at piracy.red-bean.com
> Cc: lispweb at red-bean.com
> From: Craig Brozefsky <craig at red-bean.com>
> Date: 26 Feb 2002 14:00:19 -0600
> User-Agent: Gnus/5.09 (Gnus v5.9.0) Emacs/21.1
> Content-Type: text/plain; charset=us-ascii
> Content-Length: 905
> 
> Marco Antoniotti <marcoxa at cs.nyu.edu> writes:
> 
> > I.e. an a-list is always to be thought as
> > 
> >      ((item1 . content1) (item2 . content2) ...)
> > 
> > Anyway, this begs the question: why a-lists and not HASH-TABLEs?
> 
> When was the last time a sane hacker drew a popup list that was big
> enough to warrant a hash table to store it's key value pairs, and even
> then you're normally massaging you're data in such hash tables into
> values suitable for display, so you might as well just build an alist
> with a maphash.
> 
> I don't think our business insurance would cover the encouragment of
> such user abuse.

Well, I guess I just went in the autopilot responding mode: whenever
somebody suggests an a-list, propose a hash table :)  Sorry.

Cheers


-- 
Marco Antoniotti ========================================================
NYU Courant Bioinformatics Group        tel. +1 - 212 - 998 3488
719 Broadway 12th Floor                 fax  +1 - 212 - 995 4122
New York, NY 10003, USA                 http://bioinformatics.cat.nyu.edu
                    "Hello New York! We'll do what we can!"
                           Bill Murray in `Ghostbusters'.



More information about the lispweb mailing list