On Thu, Sep 25, 2025 at 09:54:23PM +0200, Dr. Arne Babenhauserheide wrote: > Hi, > > While optimizing an implementation of levenshtein distance, I found that > (min ...) took up a significant part of the profile (16%), so I tried > replacing it with a simple implementation in Scheme. That worked out > surprisingly well (shaved off about 25% of the total runtime) and when I > benchmarked it directly it turned out to be between 1.5 and 3 times > faster than the min in numbers.c.
Fascinating. Guile's implementation has changed a lot since back then. Thanks to all involved, especially Andy! > Would it be a good idea to move min and max from C to Scheme? And what > would be needed? Mostly from the peanut gallery here, but I'd think yes! Cheers & thanks for the find -- t
signature.asc
Description: PGP signature
