X-Git-Url: https://pintos-os.org/cgi-bin/gitweb.cgi?a=blobdiff_plain;f=src%2Foutput%2Ftable.c;h=09ed509e35bfac726be760d9e2210db17f89144e;hb=c4bc3574d974d3aaf4d291097c995a31515a308a;hp=dd73839990a609fce1050667cf6b1d7049144a74;hpb=d5399f4b8b87f187b70747ec548b971272e1f878;p=pspp diff --git a/src/output/table.c b/src/output/table.c index dd73839990..09ed509e35 100644 --- a/src/output/table.c +++ b/src/output/table.c @@ -29,10 +29,16 @@ #include "libpspp/compiler.h" #include "libpspp/pool.h" #include "libpspp/str.h" -#include "output/table-item.h" +#include "output/output-item.h" +#include "output/pivot-table.h" +#include "output/table.h" #include "gl/xalloc.h" +/* This file uses TABLE_HORZ and TABLE_VERT enough to warrant abbreviating. */ +#define H TABLE_HORZ +#define V TABLE_VERT + /* Increases TABLE's reference count, indicating that it has an additional owner. An table that is shared among multiple owners must not be modified. */ @@ -53,7 +59,7 @@ table_unref (struct table *table) { assert (table->ref_cnt > 0); if (--table->ref_cnt == 0) - table->klass->destroy (table); + pool_destroy (table->container); } } @@ -64,79 +70,11 @@ table_is_shared (const struct table *table) { return table->ref_cnt > 1; } - -/* Sets the number of left header columns in TABLE to HL. */ -void -table_set_hl (struct table *table, int hl) -{ - assert (!table_is_shared (table)); - table->h[TABLE_HORZ][0] = hl; -} - -/* Sets the number of right header columns in TABLE to HR. */ -void -table_set_hr (struct table *table, int hr) -{ - assert (!table_is_shared (table)); - table->h[TABLE_HORZ][1] = hr; -} - -/* Sets the number of top header rows in TABLE to HT. */ -void -table_set_ht (struct table *table, int ht) -{ - assert (!table_is_shared (table)); - table->h[TABLE_VERT][0] = ht; -} - -/* Sets the number of top header rows in TABLE to HB. */ -void -table_set_hb (struct table *table, int hb) -{ - assert (!table_is_shared (table)); - table->h[TABLE_VERT][1] = hb; -} -/* Initializes TABLE as a table of the specified CLASS, initially with a - reference count of 1. - - TABLE initially has 0 rows and columns and no headers. The table - implementation should update the numbers of rows and columns. The table - implementation (or its client) may update the header rows and columns. - - A table is an abstract class, that is, a plain struct table is not useful on - its own. Thus, this function is normally called from the initialization - function of some subclass of table. */ -void -table_init (struct table *table, const struct table_class *class) +struct table_area_style * +table_area_style_clone (struct pool *pool, const struct table_area_style *old) { - table->klass = class; - table->n[TABLE_HORZ] = table->n[TABLE_VERT] = 0; - table->h[TABLE_HORZ][0] = table->h[TABLE_HORZ][1] = 0; - table->h[TABLE_VERT][0] = table->h[TABLE_VERT][1] = 0; - table->ref_cnt = 1; -} - -/* Sets the number of columns in TABLE to NC. */ -void -table_set_nc (struct table *table, int nc) -{ - assert (!table_is_shared (table)); - table->n[TABLE_HORZ] = nc; -} - -/* Sets the number of rows in TABLE to NR. */ -void -table_set_nr (struct table *table, int nr) -{ - assert (!table_is_shared (table)); - table->n[TABLE_VERT] = nr; -} - -struct area_style * -area_style_clone (struct pool *pool, const struct area_style *old) -{ - struct area_style *new = pool_malloc (pool, sizeof *new); + struct table_area_style *new = pool_malloc (pool, sizeof *new); *new = *old; if (new->font_style.typeface) new->font_style.typeface = pool_strdup (pool, new->font_style.typeface); @@ -144,7 +82,7 @@ area_style_clone (struct pool *pool, const struct area_style *old) } void -area_style_free (struct area_style *style) +table_area_style_free (struct table_area_style *style) { if (style) { @@ -152,301 +90,6 @@ area_style_free (struct area_style *style) free (style); } } - -/* Initializes CELL with the contents of the table cell at column X and row Y - within TABLE. When CELL is no longer needed, the caller is responsible for - freeing it by calling table_cell_free(CELL). - - The caller must ensure that CELL is destroyed before TABLE is unref'ed. */ -void -table_get_cell (const struct table *table, int x, int y, - struct table_cell *cell) -{ - assert (x >= 0 && x < table->n[TABLE_HORZ]); - assert (y >= 0 && y < table->n[TABLE_VERT]); - - static const struct area_style default_style = AREA_STYLE_INITIALIZER; - cell->style = &default_style; - - table->klass->get_cell (table, x, y, cell); -} - -/* Frees CELL, which should have been initialized by calling - table_get_cell(). */ -void -table_cell_free (struct table_cell *cell) -{ - if (cell->destructor != NULL) - cell->destructor (cell->destructor_aux); -} - -/* Returns one of the TAL_* enumeration constants (declared in output/table.h) - representing a rule running alongside one of the cells in TABLE. - - Suppose NC is the number of columns in TABLE and NR is the number of rows. - Then, if AXIS is TABLE_HORZ, then 0 <= X <= NC and 0 <= Y < NR. If (X,Y) = - (0,0), the return value is the rule that runs vertically on the left side of - cell (0,0); if (X,Y) = (1,0), it is the vertical rule between that cell and - cell (1,0); and so on, up to (NC,0), which runs vertically on the right of - cell (NC-1,0). - - The following diagram illustrates the meaning of (X,Y) for AXIS = TABLE_HORZ - within a 7x7 table. The '|' characters at the intersection of the X labels - and Y labels show the rule whose style would be returned by calling - table_get_rule with those X and Y values: - - 0 1 2 3 4 5 6 7 - +--+--+--+--+--+--+--+ - 0 | | | | | | | | - +--+--+--+--+--+--+--+ - 1 | | | | | | | | - +--+--+--+--+--+--+--+ - 2 | | | | | | | | - +--+--+--+--+--+--+--+ - 3 | | | | | | | | - +--+--+--+--+--+--+--+ - 4 | | | | | | | | - +--+--+--+--+--+--+--+ - 5 | | | | | | | | - +--+--+--+--+--+--+--+ - 6 | | | | | | | | - +--+--+--+--+--+--+--+ - - Similarly, if AXIS is TABLE_VERT, then 0 <= X < NC and 0 <= Y <= NR. If - (X,Y) = (0,0), the return value is the rule that runs horizontally above - the top of cell (0,0); if (X,Y) = (0,1), it is the horizontal rule - between that cell and cell (0,1); and so on, up to (0,NR), which runs - horizontally below cell (0,NR-1). */ -int -table_get_rule (const struct table *table, enum table_axis axis, int x, int y, - struct cell_color *color) -{ - assert (x >= 0 && x < table->n[TABLE_HORZ] + (axis == TABLE_HORZ)); - assert (y >= 0 && y < table->n[TABLE_VERT] + (axis == TABLE_VERT)); - *color = (struct cell_color) CELL_COLOR_BLACK; - return table->klass->get_rule (table, axis, x, y, color); -} - -void -table_cell_format_footnote_markers (const struct table_cell *cell, - struct string *s) -{ - for (size_t i = 0; i < cell->n_footnotes; i++) - { - if (i) - ds_put_byte (s, ','); - ds_put_cstr (s, cell->footnotes[i]->marker); - } -} - -static const struct footnote ** -add_footnotes (const struct footnote **refs, size_t n_refs, - const struct footnote **footnotes, size_t *allocated, size_t *n) -{ - for (size_t i = 0; i < n_refs; i++) - { - const struct footnote *f = refs[i]; - if (f->idx >= *allocated) - { - size_t new_allocated = (f->idx + 1) * 2; - footnotes = xrealloc (footnotes, new_allocated * sizeof *footnotes); - while (*allocated < new_allocated) - footnotes[(*allocated)++] = NULL; - } - footnotes[f->idx] = f; - if (f->idx >= *n) - *n = f->idx + 1; - } - return footnotes; -} - -size_t -table_collect_footnotes (const struct table_item *item, - const struct footnote ***footnotesp) -{ - const struct footnote **footnotes = NULL; - size_t allocated = 0; - size_t n = 0; - - struct table *t = item->table; - for (int y = 0; y < table_nr (t); y++) - { - struct table_cell cell; - for (int x = 0; x < table_nc (t); x = cell.d[TABLE_HORZ][1]) - { - table_get_cell (t, x, y, &cell); - - if (x == cell.d[TABLE_HORZ][0] && y == cell.d[TABLE_VERT][0]) - footnotes = add_footnotes (cell.footnotes, cell.n_footnotes, - footnotes, &allocated, &n); - table_cell_free (&cell); - } - } - - const struct table_item_text *title = table_item_get_title (item); - if (title) - footnotes = add_footnotes (title->footnotes, title->n_footnotes, - footnotes, &allocated, &n); - - const struct table_item_text *caption = table_item_get_caption (item); - if (caption) - footnotes = add_footnotes (caption->footnotes, caption->n_footnotes, - footnotes, &allocated, &n); - - *footnotesp = footnotes; - return n; -} - -struct table_unshared - { - struct table table; - struct table *subtable; - }; - -static const struct table_class table_unshared_class; - -/* Takes ownership of TABLE and returns a table with the same contents but - which is guaranteed not to be shared (as returned by table_is_shared()). - - If TABLE is unshared, just returns TABLE. - - The only real use for this function is to create a copy of TABLE in which - the headers can be adjusted, which is a pretty specialized use case. */ -struct table * -table_unshare (struct table *table) -{ - if (!table_is_shared (table)) - return table; - else - { - struct table_unshared *tiu = xmalloc (sizeof *tiu); - table_init (&tiu->table, &table_unshared_class); - table_set_nc (&tiu->table, table_nc (table)); - table_set_nr (&tiu->table, table_nr (table)); - table_set_hl (&tiu->table, table_hl (table)); - table_set_hr (&tiu->table, table_hr (table)); - table_set_ht (&tiu->table, table_ht (table)); - table_set_hb (&tiu->table, table_hb (table)); - tiu->subtable = table; - return &tiu->table; - } -} - -static struct table_unshared * -table_unshared_cast (const struct table *table) -{ - assert (table->klass == &table_unshared_class); - return UP_CAST (table, struct table_unshared, table); -} - -static void -table_unshared_destroy (struct table *tiu_) -{ - struct table_unshared *tiu = table_unshared_cast (tiu_); - table_unref (tiu->subtable); - free (tiu); -} - -static void -table_unshared_get_cell (const struct table *tiu_, int x, int y, - struct table_cell *cell) -{ - struct table_unshared *tiu = table_unshared_cast (tiu_); - table_get_cell (tiu->subtable, x, y, cell); -} - -static int -table_unshared_get_rule (const struct table *tiu_, - enum table_axis axis, int x, int y, - struct cell_color *color) -{ - struct table_unshared *tiu = table_unshared_cast (tiu_); - return table_get_rule (tiu->subtable, axis, x, y, color); -} - -static const struct table_class table_unshared_class = - { - table_unshared_destroy, - table_unshared_get_cell, - table_unshared_get_rule, - }; - -struct table_string - { - struct table table; - char *string; - enum table_halign halign; - }; - -static const struct table_class table_string_class; - -/* Returns a table that contains a single cell, whose contents are S with - options OPTIONS (a combination of TAB_* values). */ -struct table * -table_from_string (enum table_halign halign, const char *s) -{ - struct table_string *ts = xmalloc (sizeof *ts); - table_init (&ts->table, &table_string_class); - ts->table.n[TABLE_HORZ] = ts->table.n[TABLE_VERT] = 1; - ts->string = xstrdup (s); - ts->halign = halign; - return &ts->table; -} - -static struct table_string * -table_string_cast (const struct table *table) -{ - assert (table->klass == &table_string_class); - return UP_CAST (table, struct table_string, table); -} - -static void -table_string_destroy (struct table *ts_) -{ - struct table_string *ts = table_string_cast (ts_); - free (ts->string); - free (ts); -} - -static void -table_string_get_cell (const struct table *ts_, int x UNUSED, int y UNUSED, - struct table_cell *cell) -{ - static const struct area_style styles[] = { -#define S(H) [H] = { AREA_STYLE_INITIALIZER__, .cell_style.halign = H } - S(TABLE_HALIGN_LEFT), - S(TABLE_HALIGN_CENTER), - S(TABLE_HALIGN_RIGHT), - S(TABLE_HALIGN_MIXED), - S(TABLE_HALIGN_DECIMAL), - }; - struct table_string *ts = table_string_cast (ts_); - cell->d[TABLE_HORZ][0] = 0; - cell->d[TABLE_HORZ][1] = 1; - cell->d[TABLE_VERT][0] = 0; - cell->d[TABLE_VERT][1] = 1; - cell->options = 0; - cell->style = &styles[table_halign_interpret (ts->halign, false)]; - cell->text = ts->string; - cell->n_footnotes = 0; - cell->destructor = NULL; -} - - -static int -table_string_get_rule (const struct table *ts UNUSED, - enum table_axis axis UNUSED, int x UNUSED, int y UNUSED, - struct cell_color *color UNUSED) -{ - return TAL_0; -} - -static const struct table_class table_string_class = - { - table_string_destroy, - table_string_get_cell, - table_string_get_rule, - }; const char * table_halign_to_string (enum table_halign halign) @@ -496,11 +139,12 @@ table_halign_interpret (enum table_halign halign, bool numeric) } void -font_style_copy (struct font_style *dst, const struct font_style *src) +font_style_copy (struct pool *container, + struct font_style *dst, const struct font_style *src) { *dst = *src; if (dst->typeface) - dst->typeface = xstrdup (dst->typeface); + dst->typeface = pool_strdup (container, dst->typeface); } void @@ -511,14 +155,15 @@ font_style_uninit (struct font_style *font) } void -area_style_copy (struct area_style *dst, const struct area_style *src) +table_area_style_copy (struct pool *container, struct table_area_style *dst, + const struct table_area_style *src) { - font_style_copy (&dst->font_style, &src->font_style); + font_style_copy (container, &dst->font_style, &src->font_style); dst->cell_style = src->cell_style; } void -area_style_uninit (struct area_style *area) +table_area_style_uninit (struct table_area_style *area) { if (area) font_style_uninit (&area->font_style); @@ -572,6 +217,22 @@ font_style_dump (const struct font_style *f) fputs (" underline", stdout); } +bool +font_style_equal (const struct font_style *a, const struct font_style *b) +{ + return (a->bold == b->bold + && a->italic == b->italic + && a->underline == b->underline + && a->markup == b->markup + && cell_color_equal (&a->fg[0], &b->fg[0]) + && cell_color_equal (&a->fg[1], &b->fg[1]) + && cell_color_equal (&a->bg[0], &b->bg[0]) + && cell_color_equal (&a->bg[1], &b->bg[1]) + && !strcmp (a->typeface ? a->typeface : "", + b->typeface ? b->typeface : "") + && a->size == b->size); +} + void cell_style_dump (const struct cell_style *c) { @@ -583,3 +244,352 @@ cell_style_dump (const struct cell_style *c) c->margin[TABLE_HORZ][0], c->margin[TABLE_HORZ][1], c->margin[TABLE_VERT][0], c->margin[TABLE_VERT][1]); } + + +static const bool debugging = true; + +/* Creates and returns a new table with NC columns and NR rows and initially no + header rows or columns. + + Sets the number of header rows on each side of TABLE to HL on the + left, HR on the right, HT on the top, HB on the bottom. Header rows + are repeated when a table is broken across multiple columns or + multiple pages. + + The table's cells are initially empty. */ +struct table * +table_create (int nc, int nr, int hl, int hr, int ht, int hb) +{ + struct table *t; + + t = pool_create_container (struct table, container); + t->n[TABLE_HORZ] = nc; + t->n[TABLE_VERT] = nr; + t->h[TABLE_HORZ][0] = hl; + t->h[TABLE_HORZ][1] = hr; + t->h[TABLE_VERT][0] = ht; + t->h[TABLE_VERT][1] = hb; + t->ref_cnt = 1; + + t->cc = pool_calloc (t->container, nr * nc, sizeof *t->cc); + t->ct = pool_calloc (t->container, nr * nc, sizeof *t->ct); + + t->rh = pool_nmalloc (t->container, nc, nr + 1); + memset (t->rh, TABLE_STROKE_NONE, nc * (nr + 1)); + + t->rv = pool_nmalloc (t->container, nr, nc + 1); + memset (t->rv, TABLE_STROKE_NONE, nr * (nc + 1)); + + memset (t->styles, 0, sizeof t->styles); + memset (t->rule_colors, 0, sizeof t->rule_colors); + + return t; +} + +/* Rules. */ + +/* Draws a vertical line to the left of cells at horizontal position X + from Y1 to Y2 inclusive in style STYLE, if style is not -1. */ +void +table_vline (struct table *t, int style, int x, int y1, int y2) +{ + if (debugging) + { + if (x < 0 || x > t->n[H] + || y1 < 0 || y1 >= t->n[V] + || y2 < 0 || y2 >= t->n[V]) + { + printf ("bad vline: x=%d y=(%d,%d) in table size (%d,%d)\n", + x, y1, y2, t->n[H], t->n[V]); + return; + } + } + + assert (x >= 0); + assert (x <= t->n[H]); + assert (y1 >= 0); + assert (y2 >= y1); + assert (y2 <= t->n[V]); + + if (style != -1) + { + int y; + for (y = y1; y <= y2; y++) + t->rv[x + (t->n[H] + 1) * y] = style; + } +} + +/* Draws a horizontal line above cells at vertical position Y from X1 + to X2 inclusive in style STYLE, if style is not -1. */ +void +table_hline (struct table *t, int style, int x1, int x2, int y) +{ + if (debugging) + { + if (y < 0 || y > t->n[V] + || x1 < 0 || x1 >= t->n[H] + || x2 < 0 || x2 >= t->n[H]) + { + printf ("bad hline: x=(%d,%d) y=%d in table size (%d,%d)\n", + x1, x2, y, t->n[H], t->n[V]); + return; + } + } + + assert (y >= 0); + assert (y <= t->n[V]); + assert (x2 >= x1); + assert (x1 >= 0); + assert (x2 < t->n[H]); + + if (style != -1) + { + int x; + for (x = x1; x <= x2; x++) + t->rh[x + t->n[H] * y] = style; + } +} + +/* Draws a box around cells (X1,Y1)-(X2,Y2) inclusive with horizontal + lines of style F_H and vertical lines of style F_V. Fills the + interior of the box with horizontal lines of style I_H and vertical + lines of style I_V. Any of the line styles may be -1 to avoid + drawing those lines. This is distinct from 0, which draws a null + line. */ +void +table_box (struct table *t, int f_h, int f_v, int i_h, int i_v, + int x1, int y1, int x2, int y2) +{ + if (debugging) + { + if (x1 < 0 || x1 >= t->n[H] + || x2 < 0 || x2 >= t->n[H] + || y1 < 0 || y1 >= t->n[V] + || y2 < 0 || y2 >= t->n[V]) + { + printf ("bad box: (%d,%d)-(%d,%d) in table size (%d,%d)\n", + x1, y1, x2, y2, t->n[H], t->n[V]); + NOT_REACHED (); + } + } + + assert (x2 >= x1); + assert (y2 >= y1); + assert (x1 >= 0); + assert (y1 >= 0); + assert (x2 < t->n[H]); + assert (y2 < t->n[V]); + + if (f_h != -1) + { + int x; + for (x = x1; x <= x2; x++) + { + t->rh[x + t->n[H] * y1] = f_h; + t->rh[x + t->n[H] * (y2 + 1)] = f_h; + } + } + if (f_v != -1) + { + int y; + for (y = y1; y <= y2; y++) + { + t->rv[x1 + (t->n[H] + 1) * y] = f_v; + t->rv[(x2 + 1) + (t->n[H] + 1) * y] = f_v; + } + } + + if (i_h != -1) + { + int y; + + for (y = y1 + 1; y <= y2; y++) + { + int x; + + for (x = x1; x <= x2; x++) + t->rh[x + t->n[H] * y] = i_h; + } + } + if (i_v != -1) + { + int x; + + for (x = x1 + 1; x <= x2; x++) + { + int y; + + for (y = y1; y <= y2; y++) + t->rv[x + (t->n[H] + 1) * y] = i_v; + } + } +} + +/* Cells. */ + +/* Fill TABLE cells (X1,X2)-(Y1,Y2), inclusive, with VALUE and OPT. */ +void +table_put (struct table *table, int x1, int y1, int x2, int y2, + unsigned opt, const struct pivot_value *value) +{ + assert (0 <= x1 && x1 <= x2 && x2 < table->n[H]); + assert (0 <= y1 && y1 <= y2 && y2 < table->n[V]); + + if (x1 == x2 && y1 == y2) + { + table->cc[x1 + y1 * table->n[H]] = CONST_CAST (struct pivot_value *, value); + table->ct[x1 + y1 * table->n[H]] = opt; + } + else + { + table_box (table, -1, -1, TABLE_STROKE_NONE, TABLE_STROKE_NONE, + x1, y1, x2, y2); + + struct table_cell *cell = pool_alloc (table->container, sizeof *cell); + *cell = (struct table_cell) { + .d = { [H] = { x1, x2 + 1 }, [V] = { y1, y2 + 1 } }, + .options = opt, + .value = value, + }; + + for (int y = y1; y <= y2; y++) + { + size_t ofs = x1 + y * table->n[H]; + void **cc = &table->cc[ofs]; + unsigned short *ct = &table->ct[ofs]; + for (int x = x1; x <= x2; x++) + { + *cc++ = cell; + *ct++ = opt | TAB_JOIN; + } + } + } +} + +static void +free_value (void *value_) +{ + struct pivot_value *value = value_; + pivot_value_destroy (value); +} + +void +table_put_owned (struct table *table, int x1, int y1, int x2, int y2, + unsigned opt, struct pivot_value *value) +{ + table_put (table, x1, y1, x2, y2, opt, value); + pool_register (table->container, free_value, value); +} + +/* Returns true if column C, row R has no contents, otherwise false. */ +bool +table_cell_is_empty (const struct table *table, int c, int r) +{ + return table->cc[c + r * table->n[H]] == NULL; +} + +/* Initializes CELL with the contents of the table cell at column X and row Y + within TABLE. */ +void +table_get_cell (const struct table *t, int x, int y, struct table_cell *cell) +{ + assert (x >= 0 && x < t->n[TABLE_HORZ]); + assert (y >= 0 && y < t->n[TABLE_VERT]); + + int index = x + y * t->n[H]; + unsigned short opt = t->ct[index]; + const void *cc = t->cc[index]; + + struct table_area_style *style + = t->styles[(opt & TAB_STYLE_MASK) >> TAB_STYLE_SHIFT]; + + static const struct pivot_value empty_value = { + .text = { + .type = PIVOT_VALUE_TEXT, + .local = (char *) "", + .c = (char *) "", + .id = (char *) "", + .user_provided = true, + }, + }; + + if (opt & TAB_JOIN) + { + const struct table_cell *jc = cc; + *cell = *jc; + if (!cell->value) + cell->value = &empty_value; + if (!cell->font_style) + cell->font_style = &style->font_style; + if (!cell->cell_style) + cell->cell_style = &style->cell_style; + } + else + { + const struct pivot_value *v = cc ? cc : &empty_value; + const struct pivot_value_ex *ex = pivot_value_ex (v); + *cell = (struct table_cell) { + .d = { [H] = { x, x + 1 }, [V] = { y, y + 1 } }, + .options = opt, + .value = v, + .font_style = ex->font_style ? ex->font_style : &style->font_style, + .cell_style = ex->cell_style ? ex->cell_style : &style->cell_style, + }; + } + + assert (cell->font_style); + assert (cell->cell_style); +} + +/* Returns one of the TAL_* enumeration constants (declared in output/table.h) + representing a rule running alongside one of the cells in TABLE. + + Suppose NC is the number of columns in TABLE and NR is the number of rows. + Then, if AXIS is TABLE_HORZ, then 0 <= X <= NC and 0 <= Y < NR. If (X,Y) = + (0,0), the return value is the rule that runs vertically on the left side of + cell (0,0); if (X,Y) = (1,0), it is the vertical rule between that cell and + cell (1,0); and so on, up to (NC,0), which runs vertically on the right of + cell (NC-1,0). + + The following diagram illustrates the meaning of (X,Y) for AXIS = TABLE_HORZ + within a 7x7 table. The '|' characters at the intersection of the X labels + and Y labels show the rule whose style would be returned by calling + table_get_rule with those X and Y values: + + 0 1 2 3 4 5 6 7 + +--+--+--+--+--+--+--+ + 0 | | | | | | | | + +--+--+--+--+--+--+--+ + 1 | | | | | | | | + +--+--+--+--+--+--+--+ + 2 | | | | | | | | + +--+--+--+--+--+--+--+ + 3 | | | | | | | | + +--+--+--+--+--+--+--+ + 4 | | | | | | | | + +--+--+--+--+--+--+--+ + 5 | | | | | | | | + +--+--+--+--+--+--+--+ + 6 | | | | | | | | + +--+--+--+--+--+--+--+ + + Similarly, if AXIS is TABLE_VERT, then 0 <= X < NC and 0 <= Y <= NR. If + (X,Y) = (0,0), the return value is the rule that runs horizontally above + the top of cell (0,0); if (X,Y) = (0,1), it is the horizontal rule + between that cell and cell (0,1); and so on, up to (0,NR), which runs + horizontally below cell (0,NR-1). */ +int +table_get_rule (const struct table *table, enum table_axis axis, int x, int y, + struct cell_color *color) +{ + assert (x >= 0 && x < table->n[TABLE_HORZ] + (axis == TABLE_HORZ)); + assert (y >= 0 && y < table->n[TABLE_VERT] + (axis == TABLE_VERT)); + + uint8_t raw = (axis == TABLE_VERT + ? table->rh[x + table->n[H] * y] + : table->rv[x + (table->n[H] + 1) * y]); + struct cell_color *p = table->rule_colors[(raw & TAB_RULE_STYLE_MASK) + >> TAB_RULE_STYLE_SHIFT]; + *color = p ? *p : (struct cell_color) CELL_COLOR_BLACK; + return (raw & TAB_RULE_TYPE_MASK) >> TAB_RULE_TYPE_SHIFT; +}