bool Triangle::containsEdge(const Edge & e) const { try { if (e == getE0() || e == getE1() || e == getE2()) return true; } catch (std::exception &e) { std::cout << e.what() << std::endl; } return false; }
EPNODE * getE1(void) /* E1 -> E1 ADDOP E2 */ /* E2 */ { EPNODE *ep1, *ep2; ep1 = getE2(); while (nextc == '+' || nextc == '-') { ep2 = newnode(); ep2->type = nextc; scan(); addekid(ep2, ep1); addekid(ep2, getE2()); if (esupport&E_RCONST && ep1->type == NUM && ep1->sibling->type == NUM) ep2 = rconst(ep2); ep1 = ep2; } return(ep1); }