Organisationsbacktrackingbitv0e42d4

faster tanimoto implementation Hi Jean-Christophe, This implementation should be faster (two pop calls instead of three) and more robust (no div by 0). Results should be unchanged. Thanks to @rogersayle from the excellent https://nextmovesoftware.com/ for the heads up. Regards, Francois.

May 05 14:40 +00:00
5h46m
*Variants labelled (experimental) are still undergoing testing; if they have failed it may be a bug in OCaml-CI.