"Valentin Villenave" <v.villen...@gmail.com> wrote in message news:aanlkti=g-fc4pwacvog0owgb79mbacoms-18rcwbj...@mail.gmail.com...
On Wed, Oct 6, 2010 at 11:30 AM, Arno Waschk <hamama...@gmx.de> wrote:
well, i came across this problem while creating a *real-world* score, having
1600+ bars and using GBs of memory. it also showed horrible "compiling"
times before Joe created his patches as well. while experimenting a bit with it, i could not find a significant difference between the real-world score,
and a \repeat unfold 1600+ fake score.

[I take it you forgot to include the list]

Interesting. What operating system were you using? How much RAM?

Also, one thing I probably should have mentioned is that the
ly:minimal-breaking algorithm is often mandatory in such demanding
compilations.

Cheers,
Valentin.

Does anyone know what's the biggest single score compiled with LilyPond? I've done the first half of my Mikado score and am currently at about 1600 bars and 90-odd pages at a Global staff size of 16. It currently takes about 940 seconds to compile, with peak memory of 900 Megs.

--
Phil Holmes
Bug Squad




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

Reply via email to