 One more reason why it's hard to use alists as associative data structure: There is no built-in destructuring capabilities for it. It seems (ice-9 match) is no help here. Situation becomes even worse if we have a nested data structure. Going to stack a bunch of let+assoc-ref's I guess. 16 comments
 @fosskers Yep, it's possible to use plists in Scheme, but it doesn't solve the problem of lack of destructuring. And the tooling for plists probably is even more lacking. There are a few pattern matching libs, and one of them maybe can do the job. The built in one doesn't AFAIK. Managing external dependencies in Guile is a pain at the moment. Want this functionality OOTB π @shegeley Nice util! Probably doesn't solve my problem, because with this macro I can't destructure a vector inside alist value and will need to make nested lets anyway :(  @mykhaylo Thank you for the idea. Probably I forgot to mention: at the moment I write a Guile Scheme code :) And ideally it should be dependency free. @mykhaylo It's nice and we have the package manager and the whole operating system built on top of it :) but the ecosystem is kinda fragmented and tooling is a little lacking. @abcdw I was playing with guix package manager on Asahi Linux the other day and I really liked the idea.  @abcdw An βalist-let*β macro should help: @civodul @link2xt shared one almost satisfying solution with pattern matching: However, I went with let* + assoc-ref and a few alist- helpers. More verbose, but flexible and usually doesn't require nesting. |
Gregory's Server
@abcdw Why not plists?