Hi again,

On Fri, Oct 28, 2011 at 4:31 PM, David Nalesnik <david.nales...@gmail.com>wrote:

>
> I worked on this a bit, and I came up with something which will handle the
> accel./rit. pattern which you've been using with your feathered beam
> function.  It works just like \featherDurations, except you add two
> additional arguments, a number representing the number of notes it takes to
> get to the fastest value and another number representing the number of notes
> left over.  Sort of :)  It's a bit unclear what the numbers mean, so I left
> a line in the function which displays the pattern to the log so you can see
> what's going on.  (What do you think each number should represent?  Also, is
> there an easy way to determine the number of notes in the pattern
> automatically?)
>
> I'm sure there's a lot of room for improvement here.  (For one thing, how
> about starting fast, getting slower, then faster again?)  But this seems to
> work . . . so far :)
>
>
The attached should work with accel./rit. and rit./accel.  There is only one
extra argument now, which represents the position of the "turnaround".  This
can't be larger than the number of notes in the group.   If you notice any
problems or think of a way to make this more effective/less tangled please
let me know!

-David

Attachment: feather-test01.ly
Description: Binary data

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

Reply via email to