source file of the GNU LilyPond music typesetter
- (c) 1997--2003 Han-Wen Nienhuys <hanwen@cs.uu.nl>
+ (c) 1997--2004 Han-Wen Nienhuys <hanwen@cs.uu.nl>
*/
#include <math.h> // rint
#include <stdio.h>
This algorithms is adapted from the OSU Tech report on breaking lines.
this function is longish, but not very complicated.
-
*/
Array<Column_x_positions>
Gourlay_breaking::do_solve () const
Break_node first_node ;
optimal_paths.push (first_node);
+ bool ragged_right = to_boolean (pscore_->paper_->get_scmvar ("raggedright"));
+ bool ragged_last = to_boolean (pscore_->paper_->get_scmvar ("raggedlast"));
+
Real worst_force = 0.0;
-
- for (int break_idx=1; break_idx< breaks.size (); break_idx++)
+ for (int break_idx = 1; break_idx< breaks.size (); break_idx++)
{
/*
start with a short line, add measures. At some point
Real minimal_demerits = infinity_f;
- bool ragged = to_boolean (pscore_->paper_->get_scmvar ("raggedright"));
-
for (int start_idx = break_idx; start_idx--;)
{
Link_array<Grob> line = all.slice (breaks[start_idx], breaks[break_idx]+1);
- line[0] = dynamic_cast<Item*> (line[0]) ->find_prebroken_piece (RIGHT);
+ line[0] = dynamic_cast<Item*> (line[0])->find_prebroken_piece (RIGHT);
line.top () = dynamic_cast<Item*> (line.top ())->find_prebroken_piece (LEFT);
Column_x_positions cp;
Interval line_dims
= pscore_->paper_->line_dimensions_int (optimal_paths[start_idx].line_);
Simple_spacer * sp = generate_spacing_problem (line, line_dims);
+ bool last_line = break_idx == breaks.size ()-1;
+ bool ragged = ragged_right
+ || (last_line && ragged_last);
+
sp->solve (&cp, ragged);
+
delete sp;
+ if (ragged && last_line)
+ cp.force_ = 0.0;
+
if (fabs (cp.force_) > worst_force)
worst_force = fabs (cp.force_);
we couldn't satisfy the constraints, this won't get better
if we add more columns, so we get on with the next one
*/
- if (!cp.satisfies_constraints_b_)
+ if (!cp.satisfies_constraints_)
break ;
}
/* do the last one */
if (breaks.size () % HAPPY_DOTS_I)
- progress_indication (String ("[") + to_string (breaks.size()) + "]");
+ progress_indication (String ("[") + to_string (breaks.size ()) + "]");
progress_indication ("\n");
Column_x_positions cp (optimal_paths[final_breaks[i]].line_config_);
lines.push (cp);
- if(!cp.satisfies_constraints_b_)
+ if (!cp.satisfies_constraints_)
warning ("Could not find line breaking that satisfies constraints.");
}
return lines;
Grob * pc = this_one.cols_.top ();
if (pc->original_)
{
- SCM pen = pc->get_grob_property ("penalty");
+ SCM pen = pc->get_property ("penalty");
if (gh_number_p (pen) && fabs (gh_scm2double (pen)) < 10000)
{
break_penalties += gh_scm2double (pen);
}
}
+
/*
- Q: do want globally non-cramped lines, or locally equally cramped lines.
+ Q: do we want globally non-cramped lines, or locally equally
+ cramped lines?
+
+ There used to be an example file input/test/uniform-breaking to
+ demonstrate problems with this approach. When music is gradually
+ becoming denser, the uniformity requirement makes lines go from
+ cramped to even more cramped (because going from cramped
+ 3meas/line to relatively loose 2meas/line is such a big step.
+
*/
+
Real demerit = abs (this_one.force_) + abs (prev.force_ - this_one.force_)
+ break_penalties;
-
- /*
- This is rather ugly (not scale free), but we have to put a
- penalty breaking two zero-force lines. Otherwise, we don't get a
- unique solution (i.e.: line-breaks in short raggedright
- fragments.)
- */
- if (!this_one.satisfies_constraints_b_)
+ if (!this_one.satisfies_constraints_)
{
/*
If it doesn't satisfy constraints, we make this one