Re: Long compile times with many empty bars

2018-04-07 Thread Noeck
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")... Joram

Re: Long compile times with many empty bars

2018-04-07 Thread David Gustavsson
A bit few data points to make that kind of conclusion, isn't it? However, using For ($x=10; $x -le 1000; $x+=10) { $duration=Measure-Command { echo "\version ""2.18.2"" { \time 3/8 s4.*$x }" | lilypond - } echo $x, $duration.TotalSeconds >> result.txt } I get this figure: Definitely looks quadr

Re: Long compile times with many empty bars

2018-04-07 Thread Noeck
Well, that’s the eye of a data analyst ;) No, seriously, nice plot! I expected a relatively smooth curve, therefore a few data points get you already quite far. My main point was to state that it does not look very exponential. If you really want to do it right, you should probably constrain the

Re: Long compile times with many empty bars

2018-04-07 Thread Torsten Hämmerle
Noeck wrote > 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"). Hi Joram, On the one hand, that sounds plausible, underpinned by David's evaluations. But I find it very interesting that it takes sig

Re: Long compile times with many empty bars

2018-04-07 Thread David Gustavsson
Passing 600, it's actually starting to look more exponential than quadratic, but I'll wait until tonight to make more analysis. A thought would be that an empty bar leaves more freedom for the compiler. It probably has more rules about what it's allowed to do to bars with certain content, but the

Re: Long compile times with many empty bars

2018-04-07 Thread Andrew Bernard
This is an extremely interesting discussion. but given that when there are non-empty objects present it does not appear to arise. is it simply an 'academic' corner case of purely theoretical interest? Or perhaps it matters for engraving 4'33' by John Cage. [I believe one version of the score is av

Re: Long compile times with many empty bars

2018-04-07 Thread David Kastrup
Torsten Hämmerle writes: > Noeck wrote >> 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"). > > Hi Joram, > > On the one hand, that sounds plausible, underpinned by David's evaluations. > But I fi

Re: Long compile times with many empty bars

2018-04-07 Thread Simon Albrecht
On 07.04.2018 13:42, Andrew Bernard wrote: given that when there are non-empty objects present it does not appear to arise. is it simply an 'academic' corner case of purely theoretical interest? It happens in intermediary stages of work. I stumbled upon the problem when I started engraving a n

Re: Long compile times with many empty bars

2018-04-07 Thread Thomas Morley
2018-04-07 14:57 GMT+02:00 Simon Albrecht : > On 07.04.2018 13:42, Andrew Bernard wrote: >> >> given that when there are >> non-empty objects present it does not appear to arise. is it simply an >> 'academic' corner case of purely theoretical interest? > > > It happens in intermediary stages of wor