Hi Harm,
Am 14.02.2017 um 22:03 schrieb thomasmorle...@gmail.com: > To throw in my own 2cts. > > Why not compare strings, looks more straight forward to me. > > Indeed your code looks simpler, and your measurement indicates that the computational cost is very similar. However, David's last comment(s) made me think that this can be quite useful beyond mere LilyPond version comparison, namely a generic list-compare? or so. Although our handling of missing trailing elements is pretty specific to *version* comparison. I think I'll stick to the recursive list comparison and make it more generic using David's suggestion. Urs > > > Cheers, > Harm > > https://codereview.appspot.com/317270043/ > > _______________________________________________ > lilypond-devel mailing list > lilypond-devel@gnu.org > https://lists.gnu.org/mailman/listinfo/lilypond-devel -- u...@openlilylib.org https://openlilylib.org http://lilypondblog.org _______________________________________________ lilypond-devel mailing list lilypond-devel@gnu.org https://lists.gnu.org/mailman/listinfo/lilypond-devel
