[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

fastest data structure for a hash-like lookup

From: Florian von Savigny
Subject: fastest data structure for a hash-like lookup
Date: 04 Jun 2003 21:10:02 +0200

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

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.

reply via email to

[Prev in Thread] Current Thread [Next in Thread]