> For complicated chords, I'm guessing that it is often the case that
> LilyPond's current algorithm will miss the optimum result in some
> subtle way. Given n accidentals (where accidental is the whole
> group of things next to a note, including cautionaries, parentheses
> etc.), there are n! orders in which the most complete algorithm
> possible can place them. So once we're in 6-accidental territory,
> we're talking about 720 possible orders. It is possible to do
> accidental configuration "scoring" with a priority queue, very much
> how we do slurs. But I have no clue how much this would slow the
> program down.
Precomputing and hard-coding all values for up to, say, three
accidentals?
Werner
_______________________________________________
lilypond-devel mailing list
lilypond-devel@gnu.org
https://lists.gnu.org/mailman/listinfo/lilypond-devel
