Re: fastest data structure for a hash-like lookup

[Stefan Monnier]

> I need a data structure that can be accessed via a key (the keys are

What do the keys look like ?  Can you choose them freely ?
In elisp, it seems you could use a hash table of
lisp lists, vectors, or structures.
See `defstruct' in the CL manual for structure.
See `make-hash-table' in the elisp manual.

> values" each. The structure would be quite large and not be
> manipulated by the elisp program, but merely serve as a lookup table.

You mean it would be built once and for all and then stay constant.

> Sorry I wasn't able to find any useful documentation (the manual is as
> terse as ever).

Which manual, what did you look for in it, what did you expect to find
and what did you find instead ?


        Stefan