Hi, I don’t know the internals enough, but isn’t it plausible that things like finding the optimal line break etc. have a n² complexity ("squared"). That fits quite well to your data points ("Simon"). Fortunately it does not seem to be exponential ("exp")...

## Advertising

Joram

_______________________________________________ bug-lilypond mailing list bug-lilypond@gnu.org https://lists.gnu.org/mailman/listinfo/bug-lilypond