version 1.8, 2014/10/10 08:44:24 |
version 1.11, 2017/01/17 01:47:51 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2011 Kristaps Dzonsons <kristaps@bsd.lv> |
* Copyright (c) 2011, 2014 Kristaps Dzonsons <kristaps@bsd.lv> |
|
* Copyright (c) 2017 Ingo Schwarze <schwarze@openbsd.org> |
* |
* |
* Permission to use, copy, modify, and distribute this software for any |
* Permission to use, copy, modify, and distribute this software for any |
* purpose with or without fee is hereby granted, provided that the above |
* purpose with or without fee is hereby granted, provided that the above |
|
|
eqn_box(struct html *p, const struct eqn_box *bp) |
eqn_box(struct html *p, const struct eqn_box *bp) |
{ |
{ |
struct tag *post, *row, *cell, *t; |
struct tag *post, *row, *cell, *t; |
struct htmlpair tag[2]; |
|
const struct eqn_box *child, *parent; |
const struct eqn_box *child, *parent; |
size_t i, j, rows; |
size_t i, j, rows; |
|
|
Line 47 eqn_box(struct html *p, const struct eqn_box *bp) |
|
Line 47 eqn_box(struct html *p, const struct eqn_box *bp) |
|
if (EQN_MATRIX == bp->type) { |
if (EQN_MATRIX == bp->type) { |
if (NULL == bp->first) |
if (NULL == bp->first) |
goto out; |
goto out; |
assert(EQN_LIST == bp->first->type); |
if (EQN_LIST != bp->first->type) { |
|
eqn_box(p, bp->first); |
|
goto out; |
|
} |
if (NULL == (parent = bp->first->first)) |
if (NULL == (parent = bp->first->first)) |
goto out; |
goto out; |
assert(EQN_PILE == parent->type); |
|
/* Estimate the number of rows, first. */ |
/* Estimate the number of rows, first. */ |
if (NULL == (child = parent->first)) |
if (NULL == (child = parent->first)) |
goto out; |
goto out; |
for (rows = 0; NULL != child; rows++) |
for (rows = 0; NULL != child; rows++) |
child = child->next; |
child = child->next; |
/* Print row-by-row. */ |
/* Print row-by-row. */ |
post = print_otag(p, TAG_MTABLE, 0, NULL); |
post = print_otag(p, TAG_MTABLE, ""); |
for (i = 0; i < rows; i++) { |
for (i = 0; i < rows; i++) { |
parent = bp->first->first; |
parent = bp->first->first; |
row = print_otag(p, TAG_MTR, 0, NULL); |
row = print_otag(p, TAG_MTR, ""); |
while (NULL != parent) { |
while (NULL != parent) { |
child = parent->first; |
child = parent->first; |
for (j = 0; j < i; j++) { |
for (j = 0; j < i; j++) { |
Line 68 eqn_box(struct html *p, const struct eqn_box *bp) |
|
Line 70 eqn_box(struct html *p, const struct eqn_box *bp) |
|
break; |
break; |
child = child->next; |
child = child->next; |
} |
} |
cell = print_otag |
cell = print_otag(p, TAG_MTD, ""); |
(p, TAG_MTD, 0, NULL); |
/* |
/* |
|
* If we have no data for this |
* If we have no data for this |
* particular cell, then print a |
* particular cell, then print a |
* placeholder and continue--don't puke. |
* placeholder and continue--don't puke. |
*/ |
*/ |
if (NULL != child) |
if (NULL != child) |
eqn_box(p, child->first); |
eqn_box(p, child->first); |
print_tagq(p, cell); |
print_tagq(p, cell); |
parent = parent->next; |
parent = parent->next; |
Line 87 eqn_box(struct html *p, const struct eqn_box *bp) |
|
Line 88 eqn_box(struct html *p, const struct eqn_box *bp) |
|
|
|
switch (bp->pos) { |
switch (bp->pos) { |
case (EQNPOS_TO): |
case (EQNPOS_TO): |
post = print_otag(p, TAG_MOVER, 0, NULL); |
post = print_otag(p, TAG_MOVER, ""); |
break; |
break; |
case (EQNPOS_SUP): |
case (EQNPOS_SUP): |
post = print_otag(p, TAG_MSUP, 0, NULL); |
post = print_otag(p, TAG_MSUP, ""); |
break; |
break; |
case (EQNPOS_FROM): |
case (EQNPOS_FROM): |
post = print_otag(p, TAG_MUNDER, 0, NULL); |
post = print_otag(p, TAG_MUNDER, ""); |
break; |
break; |
case (EQNPOS_SUB): |
case (EQNPOS_SUB): |
post = print_otag(p, TAG_MSUB, 0, NULL); |
post = print_otag(p, TAG_MSUB, ""); |
break; |
break; |
case (EQNPOS_OVER): |
case (EQNPOS_OVER): |
post = print_otag(p, TAG_MFRAC, 0, NULL); |
post = print_otag(p, TAG_MFRAC, ""); |
break; |
break; |
case (EQNPOS_FROMTO): |
case (EQNPOS_FROMTO): |
post = print_otag(p, TAG_MUNDEROVER, 0, NULL); |
post = print_otag(p, TAG_MUNDEROVER, ""); |
break; |
break; |
case (EQNPOS_SUBSUP): |
case (EQNPOS_SUBSUP): |
post = print_otag(p, TAG_MSUBSUP, 0, NULL); |
post = print_otag(p, TAG_MSUBSUP, ""); |
break; |
break; |
case (EQNPOS_SQRT): |
case (EQNPOS_SQRT): |
post = print_otag(p, TAG_MSQRT, 0, NULL); |
post = print_otag(p, TAG_MSQRT, ""); |
break; |
break; |
default: |
default: |
break; |
break; |
Line 117 eqn_box(struct html *p, const struct eqn_box *bp) |
|
Line 118 eqn_box(struct html *p, const struct eqn_box *bp) |
|
if (bp->top || bp->bottom) { |
if (bp->top || bp->bottom) { |
assert(NULL == post); |
assert(NULL == post); |
if (bp->top && NULL == bp->bottom) |
if (bp->top && NULL == bp->bottom) |
post = print_otag(p, TAG_MOVER, 0, NULL); |
post = print_otag(p, TAG_MOVER, ""); |
else if (bp->top && bp->bottom) |
else if (bp->top && bp->bottom) |
post = print_otag(p, TAG_MUNDEROVER, 0, NULL); |
post = print_otag(p, TAG_MUNDEROVER, ""); |
else if (bp->bottom) |
else if (bp->bottom) |
post = print_otag(p, TAG_MUNDER, 0, NULL); |
post = print_otag(p, TAG_MUNDER, ""); |
} |
} |
|
|
if (EQN_PILE == bp->type) { |
if (EQN_PILE == bp->type) { |
assert(NULL == post); |
assert(NULL == post); |
post = print_otag(p, TAG_MTABLE, 0, NULL); |
if (bp->first != NULL && bp->first->type == EQN_LIST) |
} else if (bp->parent && EQN_PILE == bp->parent->type) { |
post = print_otag(p, TAG_MTABLE, ""); |
|
} else if (bp->type == EQN_LIST && |
|
bp->parent && bp->parent->type == EQN_PILE) { |
assert(NULL == post); |
assert(NULL == post); |
post = print_otag(p, TAG_MTR, 0, NULL); |
post = print_otag(p, TAG_MTR, ""); |
print_otag(p, TAG_MTD, 0, NULL); |
print_otag(p, TAG_MTD, ""); |
} |
} |
|
|
if (NULL != bp->text) { |
if (NULL != bp->text) { |
assert(NULL == post); |
assert(NULL == post); |
post = print_otag(p, TAG_MI, 0, NULL); |
post = print_otag(p, TAG_MI, ""); |
print_text(p, bp->text); |
print_text(p, bp->text); |
} else if (NULL == post) { |
} else if (NULL == post) { |
if (NULL != bp->left || NULL != bp->right) { |
if (NULL != bp->left || NULL != bp->right) |
PAIR_INIT(&tag[0], ATTR_OPEN, |
post = print_otag(p, TAG_MFENCED, "??", |
NULL == bp->left ? "" : bp->left); |
"open", bp->left == NULL ? "" : bp->left, |
PAIR_INIT(&tag[1], ATTR_CLOSE, |
"close", bp->right == NULL ? "" : bp->right); |
NULL == bp->right ? "" : bp->right); |
|
post = print_otag(p, TAG_MFENCED, 2, tag); |
|
} |
|
if (NULL == post) |
if (NULL == post) |
post = print_otag(p, TAG_MROW, 0, NULL); |
post = print_otag(p, TAG_MROW, ""); |
else |
else |
print_otag(p, TAG_MROW, 0, NULL); |
print_otag(p, TAG_MROW, ""); |
} |
} |
|
|
eqn_box(p, bp->first); |
eqn_box(p, bp->first); |
|
|
out: |
out: |
if (NULL != bp->bottom) { |
if (NULL != bp->bottom) { |
t = print_otag(p, TAG_MO, 0, NULL); |
t = print_otag(p, TAG_MO, ""); |
print_text(p, bp->bottom); |
print_text(p, bp->bottom); |
print_tagq(p, t); |
print_tagq(p, t); |
} |
} |
if (NULL != bp->top) { |
if (NULL != bp->top) { |
t = print_otag(p, TAG_MO, 0, NULL); |
t = print_otag(p, TAG_MO, ""); |
print_text(p, bp->top); |
print_text(p, bp->top); |
print_tagq(p, t); |
print_tagq(p, t); |
} |
} |
|
|
void |
void |
print_eqn(struct html *p, const struct eqn *ep) |
print_eqn(struct html *p, const struct eqn *ep) |
{ |
{ |
struct htmlpair tag; |
|
struct tag *t; |
struct tag *t; |
|
|
PAIR_CLASS_INIT(&tag, "eqn"); |
t = print_otag(p, TAG_MATH, "c", "eqn"); |
t = print_otag(p, TAG_MATH, 1, &tag); |
|
|
|
p->flags |= HTML_NONOSPACE; |
p->flags |= HTML_NONOSPACE; |
eqn_box(p, ep->root); |
eqn_box(p, ep->root); |