Trevor Bača wrote:
Criterion 1: There's a *complete* enumeration of acceptable values for each property, and Criterion 2: There's a working, one-line example of each value for each property of each grob
I guess you haven't studied combinatorics. If so, you would quickly realize that the resulting number of examples would be so huge that it's is completely impossible, especially if you want to cover all cases where different settings interact with eachother. Also, as has already been pointed out, many properties can take an arbitrary Scheme function as the value. /Mats _______________________________________________ lilypond-devel mailing list lilypond-devel@gnu.org http://lists.gnu.org/mailman/listinfo/lilypond-devel
