ultralisp VS cl-permutation

If it reduces your pain, you can add it to https://ultralisp.org without any hussle.

- as a dockerized daemon (here is my Dockerfile describing a few microservices: https://github.com/ultralisp/ultralisp/blob/master/Dockerfile)

Other options are:

- Quicklisp -really slick, libraries in there are curated. (with https support here: https://github.com/rudolfochrist/ql-https and here: https://github.com/snmsts/quicklisp-https.git)

- for project-local dependencies like virtualenv: https://github.com/fukamachi/qlot

- a new, more traditional one: https://www.clpm.dev (CLPM comes as a pre-built binary, supports HTTPS by default, supports installing multiple package versions, supports versioned systems, and more)

For recent Quicklisp upgrades: http://ultralisp.org/

Ocicl is very new (5 days) and tries a new approach, building "on tools from the world of containers".

I'm the author and I'm using Emacs + SLY. Happily switched to Emacs from VIM about 10 years ago when decided to invest all my free time into Common Lisp.

And yes, I have real project experience – a lot of Commmon Lisp libraries at https://github.com/40ants and also I'm developing a hosting for CL library distributions: https://ultralisp.org

So far openapi-generator is mostly tested on linux/sbcl and it should work for most spec files. It would be great to have some criticism/feedback/improvement ideas. You can download it from Ultralisp via (ql:quickload :openapi-generator)(you may need to update first (ql:update-dist "ultralisp"))

See also Ultralisp, a Quicklisp distribution that builds every 5 minutes: https://ultralisp.org/ where you can publish packages.

There is also a repository behind Ultralisp.org: https://github.com/ultralisp/ultralisp

Quicklisp ships releases once a month, so it is very possible it didn't pick the latest release yet.

Your solution is to clone the repository into ~/quicklisp/local-projects/.

Another one would be to use the Ultralisp distribution, that ships every five minutes. https://ultralisp.org/

(ql-dist:install-dist "http://dist.ultralisp.org/"

Here is Lisp code [1] that maps all sorts of combinatorial objects—permutations, bit sets, base-B integers, multi-set permutations, etc.—perfectly into the smallest set of integers [0, n-1] and back. (In a sense, it's a perfect hash.) This is used to efficiently solve combinatorial puzzles.

[1] https://github.com/stylewarning/cl-permutation/blob/master/s...

Note that in the unlikely event anyone wants to run the code in the post, the algorithm presented is still in an open PR, APIs change until merged, etc.

CL-PERMUTATION has random-perm to produce a random permutation of even, odd, or any parity.