min_p_count has that evenness. (For example, if PAGE-NUMBER is even and
min_p_count is even, we don't even consider the blank page option). */
- Spacing_result result;
+ Page_spacing_result result;
if (start == 0 && auto_first)
{
if (min_p_count % 2)
return ret;
}
-/* "final page" meaning the number of the final right-hand page,
- which always has an odd page number */
+/* The number of pages taken up by a Break_node, including
+ the blank page if there is one */
vsize
-Page_turn_page_breaking::final_page_num (Break_node const &b)
+Page_turn_page_breaking::total_page_count (Break_node const &b)
{
vsize end = b.first_page_number_ + b.page_count_;
- return end - 1 + (end % 2);
+ return end - 1 + (end % 2) - b.first_page_number_;
}
extern bool debug_page_breaking_scoring;
if (isinf (cur.demerits_)
|| (cur.page_count_ + (p_num % 2) > 2
&& (!isinf (this_start_best.demerits_))
- && final_page_num (cur) > final_page_num (this_start_best)))
+ && total_page_count (cur) > total_page_count (this_start_best)))
{
ok_page = false;
break;
{
state_.clear ();
message (_f ("Calculating page and line breaks (%d possible page breaks)...",
- (int)breaks_.size () - 1) + " ");
- for (vsize i = 0; i + 1 < breaks_.size (); i++)
+ (int) last_break_position ()));
+ for (vsize i = 0; i < last_break_position (); i++)
{
calc_subproblem (i);
progress_indication (string ("[") + to_string (i + 1) + "]");