- // a pagebreak here. The standard bsearch() function is appropriate
- // because the array of pagebreaks through known_pagebreaks[number_of_pages]
- // is known to be sorted in strictly increasing order. '1 + number_of_pages'
- // is used as a bsearch() argument because the array contains a leading
- // zero plus one element for each page.
- int* where = (int*) bsearch(&total_height, known_pagebreaks,
- 1 + number_of_pages, sizeof(int),
- wxInteger_compare);