On Sat, Apr 25, 2009 at 11:20 AM, Patrick McCarty wrote:
> On Sat, Apr 25, 2009 at 8:31 AM, Andrew Hawryluk wrote:
>> My latest LilyPond build (2.13.1, 24 Apr 2009) produces different
>> beaming than my last build.
>>
>> e.g. {c''8 c'' c'' c''}
>> used to produce |_|_|_|
>> and now it gives me
On Sat, Apr 25, 2009 at 8:31 AM, Andrew Hawryluk wrote:
> My latest LilyPond build (2.13.1, 24 Apr 2009) produces different
> beaming than my last build.
>
> e.g. {c''8 c'' c'' c''}
> used to produce |_|_|_|
> and now it gives me |_| |_|
>
> Was this intentional?
Yes, this was changed recen
Resending including lily-devel. Sorry, Neil, for the noise.
On 4/25/09 9:27 AM, "Neil Puttock" wrote:
> 2009/4/25 Carl D. Sorensen :
>>
>>
>>
>> On 4/25/09 8:24 AM, "Neil Puttock" wrote:
>>
>>> 2009/4/22 Carl D. Sorensen :
>>>
Does this help clarify what I'm thinking?
>>>
>>> Yes,
2009/4/25 Carl D. Sorensen :
> There is a binary search routine for scheme vectors in
> lily/quote-iterator.cc. Would it preferable to export that function call
> and use it?
I don't know... is there a way of using such an exported function with
other scheme types?
Regards,
Neil
_
On 4/25/09 9:43 AM, "Neil Puttock" wrote:
> 2009/4/23 Jan Nieuwenhuizen :
>> Op donderdag 23-04-2009 om 07:19 uur [tijdzone +0200], schreef Werner
>> LEMBERG:
>>
>>> I'm not a good lisp programmer, but isn't the standard method for
>>> searching like that to not use a loop but recursive calls
2009/4/24 Mats Bengtsson :
> I haven't looked at your patch or the implementation, but suddenly
> remembered about
> http://lists.gnu.org/archive/html/lilypond-devel/2008-11/msg00405.html
> which seems to indicate that a binary search was already done.
Yes, it's in System_start_delimiter::staff_br
2009/4/23 Jan Nieuwenhuizen :
> Op donderdag 23-04-2009 om 07:19 uur [tijdzone +0200], schreef Werner
> LEMBERG:
>
>> I'm not a good lisp programmer, but isn't the standard method for
>> searching like that to not use a loop but recursive calls?
>
> I don't really care about that, but it would be n
2009/4/23 Werner LEMBERG :
>
>>> Please review this patch here:
>>>
>>> http://codereview.appspot.com/8874/show
>>
>> Looks good!
>
> I'm not a good lisp programmer, but isn't the standard method for
> searching like that to not use a loop but recursive calls? It doesn't
> really matter, but Han-W
My latest LilyPond build (2.13.1, 24 Apr 2009) produces different
beaming than my last build.
e.g. {c''8 c'' c'' c''}
used to produce |_|_|_|
and now it gives me|_| |_|
Was this intentional?
Andrew
___
lilypond-devel mailing list
lilypond-deve
2009/4/25 Carl D. Sorensen :
>
>
>
> On 4/25/09 8:24 AM, "Neil Puttock" wrote:
>
>> 2009/4/22 Carl D. Sorensen :
>>
>>> Does this help clarify what I'm thinking?
>>
>> Yes, thank you.
>>
>> To be honest, I'm not convinced by the idea of using a fake grob just
>> for the convenience of easy overrid
On 4/24/09 11:37 PM, "John Mandereau" wrote:
> Hi Carl,
> Carl D. Sorensen a écrit :
>> Some time ago I proposed adding a section to the documentation on the
>> lilypond parser grammar. I didn't know how to follow up on it then, but I
>> still think it's useful, even if it's not perfect. And
On 4/25/09 8:24 AM, "Neil Puttock" wrote:
> 2009/4/22 Carl D. Sorensen :
>
>> Does this help clarify what I'm thinking?
>
> Yes, thank you.
>
> To be honest, I'm not convinced by the idea of using a fake grob just
> for the convenience of easy overriding and reverting.
Why would we not wan
2009/4/22 Carl D. Sorensen :
> Does this help clarify what I'm thinking?
Yes, thank you.
To be honest, I'm not convinced by the idea of using a fake grob just
for the convenience of easy overriding and reverting.
Regards,
Neil
___
lilypond-devel mai
13 matches
Mail list logo
