version 1.41, 2014/10/12 15:34:44 |
version 1.42, 2014/10/12 15:48:42 |
Line 917 pnode_printmath(struct parse *p, struct pnode *pn) |
|
Line 917 pnode_printmath(struct parse *p, struct pnode *pn) |
|
|
|
switch (pn->node) { |
switch (pn->node) { |
case (NODE_MML_MSUP): |
case (NODE_MML_MSUP): |
printf(" sup "); |
fputs(" sup ", stdout); |
break; |
break; |
case (NODE_MML_MFRAC): |
case (NODE_MML_MFRAC): |
printf(" over "); |
fputs(" over ", stdout); |
break; |
break; |
case (NODE_MML_MSUB): |
case (NODE_MML_MSUB): |
printf(" sub "); |
fputs(" sub ", stdout); |
break; |
break; |
default: |
default: |
break; |
break; |
Line 1068 pnode_printprologue(struct parse *p, struct pnode *pn) |
|
Line 1068 pnode_printprologue(struct parse *p, struct pnode *pn) |
|
} |
} |
} |
} |
|
|
|
/* |
|
* We can have multiple <term> elements within a <varlistentry>, which |
|
* we should comma-separate as list headers. |
|
*/ |
static void |
static void |
pnode_printvarlistentry(struct parse *p, struct pnode *pn) |
pnode_printvarlistentry(struct parse *p, struct pnode *pn) |
{ |
{ |
struct pnode *pp; |
struct pnode *pp; |
|
int first = 1; |
|
|
assert(p->newln); |
assert(p->newln); |
|
fputs(".It", stdout); |
|
p->newln = 0; |
|
|
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH(pp, &pn->childq, child) |
if (NODE_TERM == pp->node) { |
if (NODE_TERM == pp->node) { |
assert(p->newln); |
if ( ! first) |
fputs(".It", stdout); |
putchar(','); |
p->newln = 0; |
|
pnode_print(p, pp); |
pnode_print(p, pp); |
pnode_unlink(pp); |
pnode_unlink(pp); |
pnode_printmclose(p, 1); |
first = 0; |
return; |
} else |
} |
break; |
|
|
puts(".It"); |
putchar('\n'); |
p->newln = 1; |
p->newln = 1; |
} |
} |
|
|