On Saturday 05 May 2007 02:57, Nicolas Sceaux wrote:
> Joe Neeman <[EMAIL PROTECTED]> writes:
> > I recently discovered that the new page-breaking algorithm is slow when
> > there are many small scores. As a workaround, put
> > \paper {
> > #(define page-breaking optimal-page-breaks)
> > }
> > at the top of the file.
>
> I've recently faced the case where the page breaker (or so it seems)
> actually does not finish its job. That was with a ~100-score book, on a
> machine with 3Gbytes of RAM, with LilyPond 2.11.23. After the last
> "Preprocessing graphical objects...", the lilypond process uses ~1Gbyte
> of memory, then slowly increases up to using all the memory available,
> wthout finishing.
Is this the old page breaker (optimal-page-breaks) or the new one
(ly:optimal-breaking)? There will be some dramatic speed increases in the new
breaker in 2.11.24.
_______________________________________________
bug-lilypond mailing list
bug-lilypond@gnu.org
http://lists.gnu.org/mailman/listinfo/bug-lilypond
