version 1.5, 2014/09/28 13:34:15 |
version 1.6, 2014/09/28 14:06:09 |
Line 88 eqn_box(struct html *p, const struct eqn_box *bp, int |
|
Line 88 eqn_box(struct html *p, const struct eqn_box *bp, int |
|
pilet = print_otag(p, TAG_MTR, 0, NULL); |
pilet = print_otag(p, TAG_MTR, 0, NULL); |
print_otag(p, TAG_MTD, 0, NULL); |
print_otag(p, TAG_MTD, 0, NULL); |
} |
} |
|
if (NULL != bp->parent && bp->parent->type == EQN_MATRIX) { |
|
pilet = print_otag(p, TAG_MTABLE, 0, NULL); |
|
print_otag(p, TAG_MTR, 0, NULL); |
|
print_otag(p, TAG_MTD, 0, NULL); |
|
} |
|
|
/* |
/* |
* If we're establishing a pile, start the table mode now. |
* If we're establishing a pile, start the table mode now. |
Line 107 eqn_box(struct html *p, const struct eqn_box *bp, int |
|
Line 112 eqn_box(struct html *p, const struct eqn_box *bp, int |
|
* single or double following expression. |
* single or double following expression. |
*/ |
*/ |
switch (bp->pos) { |
switch (bp->pos) { |
|
case (EQNPOS_TO): |
|
/* FALLTHROUGH */ |
case (EQNPOS_SUP): |
case (EQNPOS_SUP): |
post = print_otag(p, TAG_MSUP, 0, NULL); |
post = print_otag(p, TAG_MSUP, 0, NULL); |
break; |
break; |
Line 118 eqn_box(struct html *p, const struct eqn_box *bp, int |
|
Line 125 eqn_box(struct html *p, const struct eqn_box *bp, int |
|
case (EQNPOS_OVER): |
case (EQNPOS_OVER): |
post = print_otag(p, TAG_MFRAC, 0, NULL); |
post = print_otag(p, TAG_MFRAC, 0, NULL); |
break; |
break; |
|
case (EQNPOS_FROMTO): |
|
/* FALLTHROUGH */ |
case (EQNPOS_SUBSUP): |
case (EQNPOS_SUBSUP): |
/* This requires two elements. */ |
/* This requires two elements. */ |
post = print_otag(p, TAG_MSUBSUP, 0, NULL); |
post = print_otag(p, TAG_MSUBSUP, 0, NULL); |