3:22:21xanlshIt returns a list (a generator, really) over all possible combinations of a bunch of iterables: so for example, itertools.product(["a", b"], [1, 2]) = [("a", 1), ("a", 2), ("b", 1), ("b", 2)]
3:23:03xanlshIt wouldn't be hard to implement wit a closure, but I was wondering if there was a more idiomatic way to do it
3:27:13pjbThere's com.informatimago.common-lisp.cesarum.combination which implements combinations arrangement arrangement-sans-repeat and arrangement-with-repeat.
8:17:53MichaelRaskinoni-on-ion — I don't think so, in the Nix project we definitely know about Guix and would probably have known about a Nix-similar package manager in Common Lisp
8:20:56MichaelRaskin(And given that I manage my Nix-built system with a Common Lisp daemon and talk about that, I guess someone would have asked me if I want to switch…)