X-Git-Url: https://pintos-os.org/cgi-bin/gitweb.cgi?a=blobdiff_plain;f=src%2Foutput%2Frender.c;h=c178839a0bfd1d7f79348f371b4d15cead9b3daf;hb=refs%2Fbuilds%2F20140106033045%2Fpspp;hp=8332b85d98ecb51e1ad3849eb6072eab5ceec130;hpb=17ddf48da2b2cf5fdd58d687d4564ac81b496d52;p=pspp diff --git a/src/output/render.c b/src/output/render.c index 8332b85d98..c178839a0b 100644 --- a/src/output/render.c +++ b/src/output/render.c @@ -1,5 +1,5 @@ /* PSPP - a program for statistical analysis. - Copyright (C) 2009, 2010, 2011 Free Software Foundation, Inc. + Copyright (C) 2009, 2010, 2011, 2013 Free Software Foundation, Inc. This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by @@ -384,7 +384,7 @@ distribute_spanned_width (int width, w += width * unspanned * d0; } - rows[x].width = w / d; + rows[x].width = MAX (rows[x].width, w / d); w -= rows[x].width * d; } } @@ -958,69 +958,6 @@ render_page_draw (const struct render_page *page) render_page_draw_cells (page, bb); } -/* Returns the greatest value i, 0 <= i < n, such that cp[i] <= x0. */ -static int -get_clip_min_extent (int x0, const int cp[], int n) -{ - int low, high, best; - - low = 0; - high = n; - best = 0; - while (low < high) - { - int middle = low + (high - low) / 2; - - if (cp[middle] <= x0) - { - best = middle; - low = middle + 1; - } - else - high = middle; - } - - return best; -} - -/* Returns the least value i, 0 <= i < n, such that cp[i + 1] >= x1. */ -static int -get_clip_max_extent (int x1, const int cp[], int n) -{ - int low, high, best; - - low = 0; - high = n; - best = n; - while (low < high) - { - int middle = low + (high - low) / 2; - - if (cp[middle] >= x1) - best = high = middle; - else - low = middle + 1; - } - - return best; -} - -/* Renders the cells of PAGE that intersect (X,Y)-(X+W,Y+H), by calling the - 'draw_line' and 'draw_cell' functions from the render_params provided to - render_page_create(). */ -void -render_page_draw_region (const struct render_page *page, - int x, int y, int w, int h) -{ - int bb[TABLE_N_AXES][2]; - - bb[H][0] = get_clip_min_extent (x, page->cp[H], page->n[H] * 2 + 1); - bb[H][1] = get_clip_max_extent (x + w, page->cp[H], page->n[H] * 2 + 1); - bb[V][0] = get_clip_min_extent (y, page->cp[V], page->n[V] * 2 + 1); - bb[V][1] = get_clip_max_extent (y + h, page->cp[V], page->n[V] * 2 + 1); - - render_page_draw_cells (page, bb); -} /* Breaking up tables to fit on a page. */