preproc/tbl/table.cpp

148   int end_row;
332   start_row(-1), end_row(-1), start_col(-1), end_col(-1), mod(m)
402   if (start_row != end_row)
629   if (start_row != end_row)
1093   int end_row;
1106 : next(p), start_row(sr), end_row(er), col(c), is_double(dbl)
1118   if (end_row != tbl->get_nrows() - 1)
1120 	    as_string(end_row));
1348     assert(e->start_row <= r && r <= e->end_row
1350 	   && e->end_row - e->start_row > 0
1379     assert(e->start_row <= r && r <= e->end_row
1381 	   && e->end_row - e->start_row > 0
1399     e->end_row = r;
1593       e->start_row = e->end_row = r;
1616     for (i = p->start_row; i <= p->end_row; i++)
1654 	if (e->start_row == e->end_row) {
1988   // Now sort span_list primarily by order of end_row, and secondarily
2273     if (e && e->start_row == e->end_row) {
2283     if (e && e->start_row == e->end_row) {
2307 void table::compute_vrule_bot_adjust(int end_row, int col, string &result)
2309   if (row_is_all_lines[end_row] && end_row > 0) {
2310     end_row--;
2315     for (p = stuff_list; p && p->row < end_row + 1; p = p->next)
2317     if (p && p->row == end_row + 1 && p->is_double_line()) {
2321     if ((p != 0 && p->row == end_row + 1)
2322 	|| end_row == nrows - 1) {
2326     if (row_is_all_lines[end_row+1] == 1)
2328     else if (row_is_all_lines[end_row+1] == 2)
2335     table_entry *e = entry[end_row+1][col-1];
2336     if (e && e->start_row == e->end_row) {
2345     table_entry *e = entry[end_row+1][col];
2346     if (e && e->start_row == e->end_row) {
2353   if (row_is_all_lines[end_row+1] == 0) {
2362   else if (row_is_all_lines[end_row+1] == 2) {
2370 void table::add_vertical_rule(int start_row, int end_row, int col, int is_double)
2372   vrule_list = new vertical_rule(start_row, end_row, col, is_double,
2375   compute_vrule_bot_adjust(end_row, col, vrule_list->bot_adjust);
2389 	int end_row = start_row;
2390 	while (end_row < nrows && !vline_spanned(end_row, col))
2391 	  end_row++;
2392 	end_row--;
2393 	add_vertical_rule(start_row, end_row, col, 0);
2394 	start_row = end_row + 1;
2402   for (int end_row = 0; end_row < nrows; end_row++)
2404       if (vline[end_row][col] > 0
2405 	  && !vline_spanned(end_row, col)
2406 	  && (end_row == nrows - 1
2407 	      || vline[end_row+1][col] != vline[end_row][col]
2408 	      || vline_spanned(end_row+1, col))) {
2410 	for (start_row = end_row - 1;
2412 	     && vline[start_row][col] == vline[end_row][col]
2417 	add_vertical_rule(start_row, end_row, col, vline[end_row][col] > 1);
2421       for (int r = p->start_row; r <= p->end_row; r++) {
2424 	  int is_corner = r == p->start_row || r == p->end_row;
2429 	  int is_corner = r == p->start_row || r == p->end_row;
2498     if (entry[r][i] && entry[r][i]->end_row != r)
2544       if (e->end_row == r) {
2568 	if (e->end_row == e->start_row)
2586 	if (e->end_row == r && e->start_row == i) {
2608 	  if (e->end_row == r && e->start_row == i) {
2611 	      if (e->end_row != e->start_row) {
2630       if (e->end_row == r && e->to_simple_entry() == 0) {
2655       if (vr->end_row == r) {