[EMAIL PROTECTED] writes: > > ... > > because the result of an acknowledged grob may be a new grob. That new > > grob must be acked, and the result may be another grob. The cycle is > > continued until no new grobs are created. (example: Note head leads > > to stem. Stem leads to beam.) > > Sounds like a typical use case of a fixpoint algorithm. Maybe putting > pending grobs into a queue and working on this queue until it becomes > empty could speed up the whole process (with the acknowledgements being > propagated bottom-up rather than traversing the tree top-down)? > > (This just a quick idea without me having had a deeper look at it; so > don't beat me in case I am just telling pure nonsens. :-))
unless I'm misunderstandig you, this is already how it works :-) -- Han-Wen Nienhuys | [EMAIL PROTECTED] | http://www.cs.uu.nl/~hanwen/ _______________________________________________ Lilypond-devel mailing list [EMAIL PROTECTED] http://mail.gnu.org/mailman/listinfo/lilypond-devel
