Lines Matching refs:fStack
15 SkASSERT(fStack.size() == 0); in parse()
17 SkASSERT(fStack.size() == 1); in parse()
38 RegexNode result = fStack.top(); in pop()
39 fStack.pop(); in pop()
55 case '*': fStack.push(RegexNode(RegexNode::kStar_Kind, this->pop())); ++fIndex; break; in quantifiedTerm()
56 case '+': fStack.push(RegexNode(RegexNode::kPlus_Kind, this->pop())); ++fIndex; break; in quantifiedTerm()
57 case '?': fStack.push(RegexNode(RegexNode::kQuestion_Kind, this->pop())); ++fIndex; break; in quantifiedTerm()
73 fStack.emplace(RegexNode::kConcat_Kind, std::move(left), std::move(right)); in sequence()
92 fStack.push(this->escapeSequence(peek())); in literal()
96 fStack.push(RegexNode(RegexNode::kChar_Kind, c)); in literal()
103 fStack.push(RegexNode(RegexNode::kDot_Kind)); in dot()
117 fStack.push(RegexNode(RegexNode::kChar_Kind, '-')); in setItem()
125 fStack.push(RegexNode(RegexNode::kRange_Kind, std::move(start), std::move(end))); in setItem()
132 size_t depth = fStack.size(); in set()
145 while (fStack.size() > depth) { in set()
148 fStack.push(std::move(set)); in set()
167 fStack.push(RegexNode(RegexNode::kOr_Kind, left, right)); in regex()