Re: [RFC] alist-let: let-like alist destructuring syntax Marc Nieper-Wißkirchen (03 Jun 2022 15:08 UTC)
Re: [RFC] alist-let: let-like alist destructuring syntax Marc Nieper-Wißkirchen (03 Jun 2022 15:33 UTC)
Re: [RFC] alist-let: let-like alist destructuring syntax Wolfgang Corcoran-Mathe (03 Jun 2022 18:53 UTC)
Re: [RFC] alist-let: let-like alist destructuring syntax Marc Nieper-Wißkirchen (03 Jun 2022 19:08 UTC)
Re: [RFC] alist-let: let-like alist destructuring syntax Marc Nieper-Wißkirchen (30 Jun 2022 16:40 UTC)
Re: [RFC] alist-let: let-like alist destructuring syntax siiky (14 Aug 2022 09:11 UTC)

Re: [RFC] alist-let: let-like alist destructuring syntax siiky 14 Aug 2022 09:11 UTC

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!