On Sat, 2006-08-05 at 12:07 +0200, Nicolas Sceaux wrote: > Joe Neeman <[EMAIL PROTECTED]> writes: > > > The problem is that the two page-breaking problems may not be > > independent. In the page-turn-page-breaker, a page break after an even > > page is different from a page break after an odd page. The wrapper > > function wouldn't be able to make this distinction without > > re-implementing most of the algorithm anyway. > > > Would it be possible to > > - divide the functionality of the unified wrapper function into several > > functions > > - define a small wrapper function for each individual page-breaking > > algorithm > > > > that is, optimal-breaking (and probably most other breakers) will > > 1) split the problem up depending on inter-score page breaks > > 2) send each sub-problem to actual-optimal-breaking > > 3) do post-processing stuff > > > > and page-turn-page-breaking can just skip the first step: > > 1) send the entire problem to actual-page-turn-breaking > > 2) do post-processing stuff > > > > That way you can get the code reuse without forcing each algorithm to > > reuse exactly the same code. > > You're right on all these points. > > Isn't you patch mature enough to be commited?
I don't know, I sent it to the list a while ago. Nudge, nudge, Han-Wen? _______________________________________________ lilypond-devel mailing list [email protected] http://lists.gnu.org/mailman/listinfo/lilypond-devel
