static Rational find_shortest (Grob *, Link_array<Grob> const &);
static void breakable_column_spacing (Grob*, Item* l, Item *r, Moment);
static void find_loose_columns () {}
- static void prune_loose_colunms (Grob*,Link_array<Grob> *cols, Rational);
+ static void prune_loose_columns (Grob*,Link_array<Grob> *cols, Rational);
static void find_loose_columns (Link_array<Grob> cols);
static void set_explicit_neighbor_columns (Link_array<Grob> cols);
static void set_implicit_neighbor_columns (Link_array<Grob> cols);
between.
*/
void
-Spacing_spanner::prune_loose_colunms (Grob*me,Link_array<Grob> *cols, Rational shortest)
+Spacing_spanner::prune_loose_columns (Grob*me,Link_array<Grob> *cols, Rational shortest)
{
Link_array<Grob> newcols;
Real increment = gh_scm2double (me->get_grob_property ("spacing-increment"));
progress_indication (_f("Global shortest duration is %s\n", global_shortest.to_string ()));
}
}
- prune_loose_colunms (me, &all, global_shortest);
+ prune_loose_columns (me, &all, global_shortest);
set_implicit_neighbor_columns (all);
max_fixed_note_space = increment;
}
- bool ragged = to_boolean (me->get_paper ()->get_scmvar ("raggedright"));
-
/*
Whatever we do, the fixed space is smaller than the real
space.
TODO: this criterion is discontinuous in the derivative.
Maybe it should be continuous?
*/
- max_fixed_note_space = max_fixed_note_space <? max_note_space;
-
+ max_fixed_note_space = max_fixed_note_space <? max_note_space;
#if 0
/*
#else
/*
- TODO: make sure that the space doesn't exceed the right margin.
+ TODO: make sure that the space doesn't exceed the right margin.
*/
Real strength = 1 / (max_note_space - max_fixed_note_space);
Real distance = max_note_space;