Hey elf o/

I hadn't thought of that, but I wasn't clear when I said I had no idea.
I wanted some macrolicious way (maybe this was why I hadn't thought of
it) with constant key->index lookup time. What you suggest would mean
traversing the key->index list N times (in the worst case, when al has
all the keys).

TBH in the general case N shouldn't be that large (couple of tens at
most?) so it's a great improvement over alist-refs.

Anyhow, maybe what I was thinking doesn't make sense so I'll steal your
idea :)

Thanks!