[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: How to extract bindings from `pcase-let*`?
From: |
Okam |
Subject: |
Re: How to extract bindings from `pcase-let*`? |
Date: |
Wed, 17 Mar 2021 01:33:46 +0000 |
On 3/15/21 10:45 PM, Stefan Monnier wrote:
>
>> (pcase-let* ((`(let* ,temp-vars (let ,true-vars . ,_))
>> (macroexpand `(pcase-let* ((,var ,val)) ,var))))
>> (list temp-vars true-vars)))
>
> Indeed it's not reliable: for a case like
>
> (pcase-let (((or `(inorder ,x ,y) `(reverse ,y ,x)) FOO))
> (cons x y))
>
> it will generate code comparable to
>
> (if (eq (car FOO) 'inorder)
> (cons (nth 1 FOO) (nth 2 FOO))
> (cons (nth 2 FOO) (nth 1 FOO))
>
> [ Just obfuscated with gensym'd vars and such ]
>
> And if you replace the trivial (cons x y) with something less trivial it
> will turn into something comparable to:
>
> (let ((body (lambda (x y) <something-less-trivial>)))
> (if (eq (car FOO) 'inorder)
> (funcall body (nth 1 FOO) (nth 2 FOO))
> (funcall body (nth 2 FOO) (nth 1 FOO))))
>
> so it's far from clear how to represent this kind of code in the form of
> "a list of bindings that can be substituted into forms like `setq` or
> `let*`"
>
> OTOH, I think `pcase.el` could offer a function which could take
> a "buildbody" function as argument, where that buildbody would receive
> something like the list (x y) and would be expected to return the
> (lambda (x y) <something-less-trivial>) to use. So you could pass it a
> "buildbody"
> function which takes the list (x y) and returns something like
> (lambda (tmp1 tmp2) (setq x tmp1 y tmp2)), which I expect would do more
> or less what you want.
>
>> I am doing this to attempt to optionally use Pcase for destructuring in
>> a macro that I am writing.
>
> `pcase-let` already does destructuring, so could you explain in a bit
> more detail what kind of destructuring you're looking for (and why)?
>
>
> Stefan
>
>
I am writing a looping macro similar to `cl-loop`, and have allowed for
destructuring in accumulation clauses. Here are some examples:
;; Summing the nth elements of arrays:
;; => (8 10 12 14 16 18)
(loopy (list (list-elem1 list-elem2)
'(([1 2 3] [4 5 6])
([7 8 9] [10 11 12])))
(sum [sum1 sum2 sum3] list-elem1)
(sum [sum4 sum5 sum6] list-elem2))
;; Or, more simply:
;; => (8 10 12 14 16 18)
(loopy (list list-elem '(([1 2 3] [4 5 6])
([7 8 9] [10 11 12])))
(sum ([sum1 sum2 sum3] [sum4 sum5 sum6])
list-elem))
;; Separate the elements of sub-list:
;; => ((1 3) (2 4))
(loopy (list i '((1 2) (3 4)))
(collect (elem1 elem2) i))
There is a built-in destructuring system for this in the macro, but a
user requested a way to use other destructuring systems, such as Dash,
Pcase, or `seq-let`.
To do this for accumulation, I don't want to actually assign the values
determined by Dash or Pcase to the variables named by the user.
Instead, I want to accumulate those values into the named variables.
Here is an example of the macro that I tested with Pcase (before I
realized my mistake)
;; => ((1 4) (3 6))
(loopy (flag pcase)
(list elem '((1 (2 3)) (4 (5 6))))
(collect `(,a (,_ ,b)) elem))
in which the `collect` expression expands into something like
(setq a (append a (list some-value-from-elem)))
(setq b (append b (list some-other-value-from-elem)))
where `some-value-from-elem` and `some-other-value-from-elem` are
determined by Pcase, Dash, or other destructuring systems.
Do you think that this is doable using Pcase?
A link to the macro:
https://github.com/okamsn/loopy