void
Page_spacing::calc_force ()
{
- /* If the first system is a title, we add back in the page-top-space. */
- Real height = first_line_.title_ ? page_height_ + page_top_space_ : page_height_;
+ Real height = page_height_
+ - breaker_->min_whitespace_at_top_of_page (first_line_)
+ - breaker_->min_whitespace_at_bottom_of_page (last_line_);
if (rod_height_ + last_line_.bottom_padding_ >= height)
force_ = infinity_f;
if (extra_systems)
{
ret.systems_per_page_.back () += extra_systems;
- ret.demerits_ += BAD_SPACING_PENALTY;
+ ret.force_.back () = BAD_SPACING_PENALTY;
}
if (extra_pages)
{
ret.force_.insert (ret.force_.end (), extra_pages, BAD_SPACING_PENALTY);
ret.systems_per_page_.insert (ret.systems_per_page_.end (), extra_pages, 0);
- ret.demerits_ += BAD_SPACING_PENALTY;
}
-
- ret.demerits_ += ret.penalty_;
return ret;
}
max_page_count_ = page_count;
}
+// Carries out one step in the dynamic programming algorithm for putting systems
+// on a fixed number of pages. One call to this routine calculates the best
+// configuration for putting lines 0 through LINE-1 on PAGE+1 pages, provided that
+// we have previously called calc_subproblem(page-1, k) for every k < LINE.
+//
+// This algorithm is similar to the constrained-breaking algorithm.
bool
Page_spacer::calc_subproblem (vsize page, vsize line)
{
bool last = line == lines_.size () - 1;
Page_spacing space (breaker_->page_height (page + first_page_num_, last),
- breaker_->page_top_space ());
+ breaker_);
Page_spacing_node &cur = state_.at (line, page);
bool ragged = ragged_ || (ragged_last_ && last);
int line_count = 0;
line_count += lines_[page_start].compressed_nontitle_lines_count_;
if (page > 0 || page_start == 0)
{
+ // If the last page is ragged, set its force to zero. This way, we will leave
+ // the last page half-empty rather than trying to balance things out
+ // (which only makes sense in non-ragged situations).
if (line == lines_.size () - 1 && ragged && last && space.force_ > 0)
space.force_ = 0;