|
From: | lilypond |
Subject: | Re: Issue 2034 in lilypond: Patch: grob.cc: rewrite O(n^2) algorithm in Grob::common_refpoint algorithm to O(n) |
Date: | Sun, 13 Nov 2011 09:34:27 +0000 |
Updates: Status: Fixed Labels: -Patch-countdown Fixed_2_5_19Comment #4 on issue 2034 by address@hidden: Patch: grob.cc: rewrite O(n^2) algorithm in Grob::common_refpoint algorithm to O(n)
http://code.google.com/p/lilypond/issues/detail?id=2034 Pushed as 0722babbea9d5a6b26c4872cbb7ba41ba55cb7bcHow to verify: conceivably increases performance with documents containing complex grob arrangements.
Code is called often, so if regtests don't break, that's enough of a verification.
[Prev in Thread] | Current Thread | [Next in Thread] |