From mboxrd@z Thu Jan 1 00:00:00 1970 Path: main.gmane.org!not-for-mail From: Florian von Savigny Newsgroups: gmane.emacs.help Subject: fastest data structure for a hash-like lookup Date: 04 Jun 2003 21:10:02 +0200 Organization: Linux Private Site Sender: help-gnu-emacs-bounces+gnu-help-gnu-emacs=m.gmane.org@gnu.org Message-ID: NNTP-Posting-Host: main.gmane.org X-Trace: main.gmane.org 1054751759 24111 80.91.224.249 (4 Jun 2003 18:35:59 GMT) X-Complaints-To: usenet@main.gmane.org NNTP-Posting-Date: Wed, 4 Jun 2003 18:35:59 +0000 (UTC) Original-X-From: help-gnu-emacs-bounces+gnu-help-gnu-emacs=m.gmane.org@gnu.org Wed Jun 04 20:35:58 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 19Nd3K-0005sX-00 for ; Wed, 04 Jun 2003 20:32:02 +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 19Ncx1-0005uo-Ct for gnu-help-gnu-emacs@m.gmane.org; Wed, 04 Jun 2003 14:25:31 -0400 Original-Path: shelby.stanford.edu!newsfeed.stanford.edu!headwall.stanford.edu!fu-berlin.de!news.uni-stuttgart.de!rz.uni-karlsruhe.de!feed.news.schlund.de!schlund.de!news.online.de!not-for-mail Original-Newsgroups: gnu.emacs.help Original-Lines: 34 Original-NNTP-Posting-Host: pd9506f6e.dip0.t-ipconnect.de Original-X-Trace: online.de 1054750820 17235 217.80.111.110 (4 Jun 2003 18:20:20 GMT) Original-X-Complaints-To: abuse@einsundeins.com Original-NNTP-Posting-Date: Wed, 4 Jun 2003 18:20:20 +0000 (UTC) X-Newsreader: Gnus v5.7/Emacs 20.6 Original-Xref: shelby.stanford.edu gnu.emacs.help:114122 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:10616 X-Report-Spam: http://spam.gmane.org/gmane.emacs.help:10616 Hi folks, I need a data structure that can be accessed via a key (the keys are unique), which points to a value that is a list (in the general sense, not in the elisp sense) of three elements. [In Perl, I would implement this as a hash where the values are references to lists.]. It may also be thought of as a structure with keys that point to "a set of three values" each. The structure would be quite large and not be manipulated by the elisp program, but merely serve as a lookup table. I think I've read something that sounded like a vector would be the right thing to use (is not changed, is fast), but I haven't found any advice on that. Or is it an obarray? A property list? An alist? An array? A combination of two? And how would that look like? Sorry I wasn't able to find any useful documentation (the manual is as terse as ever). Neither an archive nor an FAQ seems to be available for this group, and though there is plenty of interesting elisp code available, there seems to be no discussion of elisp programming but here. Thanks a lot in advance, Florian v. Savigny If you are going to reply in private, please be patient, as I only check for mail something like once a week. - Si vous allez répondre personellement, patientez s.v.p., car je ne lis les courriels qu'environ une fois par semaine.