Lines Matching refs:term
634 Term* term = this;
640 while (term != NULL && status == MATCH_OK) {
641 Operator* parent = (Operator*)term->Parent();
648 if (other == term)
662 term = (Term*)parent;
925 // choose the term with the better score for OP_OR
1006 Term* term = new(std::nothrow) Term(equation);
1007 if (term == NULL)
1010 return term;
1023 Term* term = new(std::nothrow) Term(left, fOp, right);
1024 if (term == NULL) {
1029 return term;
1127 Term* term = ParseOr(expr);
1132 delete term;
1136 // If the term is negated, we just complement the tree, to get
1139 term->Complement();
1143 return term;
1281 Term* term;
1282 while (stack.Pop(&term)) {
1283 if (term->Op() < OP_EQUATION) {
1284 Operator* op = (Operator*)term;
1297 } else if (term->Op() == OP_EQUATION
1298 || fStack.Push((Equation*)term) != B_OK)
1299 FATAL(("Unknown term on stack or stack error"));