14     fIndex = 0;  in parse()
18     SkASSERT(fIndex == source.size());  in parse()
23     if (fIndex >= fSource.size()) {  in peek()
26     return fSource[fIndex];  in peek()
31         printf("expected '%c' at index %d, but found '%c'", c, (int) fIndex, this->peek());  in expect()
34     ++fIndex;  in expect()
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()
91         ++fIndex;  in literal()
93         ++fIndex;  in literal()
97         ++fIndex;  in literal()
115         ++fIndex;  in setItem()
135         ++fIndex;  in set()
144                 ++fIndex;  in set()
163             ++fIndex;  in regex()