From mboxrd@z Thu Jan 1 00:00:00 1970 Path: main.gmane.org!not-for-mail From: "Stefan Monnier" Newsgroups: gmane.emacs.help Subject: Re: fastest data structure for a hash-like lookup Date: 04 Jun 2003 19:09:32 -0400 Organization: Yale University Sender: help-gnu-emacs-bounces+gnu-help-gnu-emacs=m.gmane.org@gnu.org Message-ID: <5lfzmph237.fsf@rum.cs.yale.edu> References: <5lwug1h86f.fsf@rum.cs.yale.edu> NNTP-Posting-Host: main.gmane.org Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Trace: main.gmane.org 1054771669 22070 80.91.224.249 (5 Jun 2003 00:07:49 GMT) X-Complaints-To: usenet@main.gmane.org NNTP-Posting-Date: Thu, 5 Jun 2003 00:07:49 +0000 (UTC) Original-X-From: help-gnu-emacs-bounces+gnu-help-gnu-emacs=m.gmane.org@gnu.org Thu Jun 05 02:07:48 2003 Return-path: Original-Received: from monty-python.gnu.org ([199.232.76.173]) by main.gmane.org with esmtp (Exim 3.35 #1 (Debian)) id 19NiIG-0005ji-00 for ; Thu, 05 Jun 2003 02:07:48 +0200 Original-Received: from localhost ([127.0.0.1] helo=monty-python.gnu.org) by monty-python.gnu.org with esmtp (Exim 4.20) id 19NiGK-0005Ht-4S for gnu-help-gnu-emacs@m.gmane.org; Wed, 04 Jun 2003 20:05:48 -0400 Original-Path: shelby.stanford.edu!newsfeed.stanford.edu!logbridge.uoregon.edu!canoe.uoregon.edu!news.wss.yale.edu!rum.cs.yale.edu!rum.cs.yale.edu Original-Newsgroups: gnu.emacs.help Original-Lines: 28 Original-NNTP-Posting-Host: rum.cs.yale.edu Original-X-Trace: news.wss.yale.edu 1054768176 28934 128.36.229.169 (4 Jun 2003 23:09:36 GMT) Original-X-Complaints-To: news@news.wss.yale.edu Original-NNTP-Posting-Date: Wed, 4 Jun 2003 23:09:36 +0000 (UTC) User-Agent: Gnus/5.09 (Gnus v5.9.0) Emacs/21.3.50 X-Original-NNTP-Posting-Host: rum.cs.yale.edu X-Original-Trace: 4 Jun 2003 19:09:33 -0400, rum.cs.yale.edu Original-Xref: shelby.stanford.edu gnu.emacs.help:114153 Original-To: help-gnu-emacs@gnu.org X-BeenThere: help-gnu-emacs@gnu.org X-Mailman-Version: 2.1b5 Precedence: list List-Id: Users list for the GNU Emacs text editor List-Help: List-Post: List-Subscribe: , List-Archive: List-Unsubscribe: , Errors-To: help-gnu-emacs-bounces+gnu-help-gnu-emacs=m.gmane.org@gnu.org Xref: main.gmane.org gmane.emacs.help:10647 X-Report-Spam: http://spam.gmane.org/gmane.emacs.help:10647 >> In elisp, it seems you could use a hash table of lisp lists, >> vectors, or structures. See `defstruct' in the CL manual for >> structure. > CL means "common lisp"? C-h i m cl RET CL is an elisp package that provides some of the functionality of Common-Lisp, so no it's not Common-Lisp, but yet, it's got something to do with it. >> See `make-hash-table' in the elisp manual. > That seems to be Emacs 21, which I'm trying to do without. It's also available in Emacs-20 if you use CL (which internally uses obarrays, then). > I tried to find advice on nested data structures in the chapters about All data structures can nest, just like in most languages. > fastest such structure (and I doubted an alist was fast, since "keys" > are not unique there). There was no hint in the section about vectors Alists are pretty fast as long as they're not too long. Stefan