38     UnannotatedBacktrackTokens.emplace_back(CachedTokens, CachedTokens.size());  in EnableBacktrackAtThisPos()
72     CachedTokens = PopUnannotatedBacktrackTokens();  in Backtrack()
84   if (CachedLexPos < CachedTokens.size()) {  in CachingLex()
85     Result = CachedTokens[CachedLexPos++];  in CachingLex()
96     CachedTokens.push_back(Result);  in CachingLex()
103   if (CachedLexPos < CachedTokens.size()) {  in CachingLex()
107     CachedTokens.clear();  in CachingLex()
136   assert(CachedLexPos + N > CachedTokens.size() && "Confused caching.");  in PeekAhead()
138   for (size_t C = CachedLexPos + N - CachedTokens.size(); C > 0; --C) {  in PeekAhead()
139     CachedTokens.push_back(Token());  in PeekAhead()
140     Lex(CachedTokens.back());  in PeekAhead()
142       UnannotatedBacktrackTokens.back().first.push_back(CachedTokens.back());  in PeekAhead()
145   return CachedTokens.back();  in PeekAhead()
151   assert(CachedTokens[CachedLexPos-1].getLastLoc() == Tok.getAnnotationEndLoc()  in AnnotatePreviousCachedTokens()
157     CachedTokensTy::iterator AnnotBegin = CachedTokens.begin() + i-1;  in AnnotatePreviousCachedTokens()
163         CachedTokens.erase(AnnotBegin + 1, CachedTokens.begin() + CachedLexPos);  in AnnotatePreviousCachedTokens()
176   const Token LastCachedTok = CachedTokens[CachedLexPos - 1];  in IsPreviousCachedToken()
191   CachedTokens.insert(CachedTokens.begin() + CachedLexPos - 1, NewToks.begin(),  in ReplacePreviousCachedToken()
193   CachedTokens.erase(CachedTokens.begin() + CachedLexPos - 1 + NewToks.size());  in ReplacePreviousCachedToken()