version 1.8, 2015/01/01 15:36:08 |
version 1.9, 2017/02/12 14:19:01 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2011 Kristaps Dzonsons <kristaps@bsd.lv> |
* Copyright (c) 2011 Kristaps Dzonsons <kristaps@bsd.lv> |
* Copyright (c) 2014, 2015 Ingo Schwarze <schwarze@openbsd.org> |
* Copyright (c) 2014, 2015, 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 |
Line 68 eqn_box(struct termp *p, const struct eqn_box *bp) |
|
Line 68 eqn_box(struct termp *p, const struct eqn_box *bp) |
|
|
|
if (bp->pos == EQNPOS_SQRT) { |
if (bp->pos == EQNPOS_SQRT) { |
term_word(p, "sqrt"); |
term_word(p, "sqrt"); |
p->flags |= TERMP_NOSPACE; |
if (bp->first != NULL) { |
eqn_box(p, bp->first); |
p->flags |= TERMP_NOSPACE; |
|
eqn_box(p, bp->first); |
|
} |
} else if (bp->type == EQN_SUBEXPR) { |
} else if (bp->type == EQN_SUBEXPR) { |
child = bp->first; |
child = bp->first; |
eqn_box(p, child); |
eqn_box(p, child); |
Line 93 eqn_box(struct termp *p, const struct eqn_box *bp) |
|
Line 95 eqn_box(struct termp *p, const struct eqn_box *bp) |
|
} |
} |
} else { |
} else { |
child = bp->first; |
child = bp->first; |
if (bp->type == EQN_MATRIX && child->type == EQN_LIST) |
if (bp->type == EQN_MATRIX && |
|
child != NULL && child->type == EQN_LIST) |
child = child->first; |
child = child->first; |
while (child != NULL) { |
while (child != NULL) { |
eqn_box(p, |
eqn_box(p, |