27   BacktrackPositions.push_back(CachedLexPos);  in EnableBacktrackAtThisPos()
43   CachedLexPos = BacktrackPositions.back();  in Backtrack()
56   if (CachedLexPos < CachedTokens.size()) {  in CachingLex()
57     Result = CachedTokens[CachedLexPos++];  in CachingLex()
69     ++CachedLexPos;  in CachingLex()
73   if (CachedLexPos < CachedTokens.size()) {  in CachingLex()
78     CachedLexPos = 0;  in CachingLex()
106   assert(CachedLexPos + N > CachedTokens.size() && "Confused caching.");  in PeekAhead()
108   for (size_t C = CachedLexPos + N - CachedTokens.size(); C > 0; --C) {  in PeekAhead()
118   assert(CachedLexPos != 0 && "Expected to have some cached tokens");  in AnnotatePreviousCachedTokens()
119   assert(CachedTokens[CachedLexPos-1].getLastLoc() == Tok.getAnnotationEndLoc()  in AnnotatePreviousCachedTokens()
124   for (CachedTokensTy::size_type i = CachedLexPos; i != 0; --i) {  in AnnotatePreviousCachedTokens()
130       if (i < CachedLexPos)  in AnnotatePreviousCachedTokens()
131         CachedTokens.erase(AnnotBegin + 1, CachedTokens.begin() + CachedLexPos);  in AnnotatePreviousCachedTokens()
133       CachedLexPos = i;  in AnnotatePreviousCachedTokens()
141   if (!CachedLexPos)  in IsPreviousCachedToken()
144   const Token LastCachedTok = CachedTokens[CachedLexPos - 1];  in IsPreviousCachedToken()
158   assert(CachedLexPos != 0 && "Expected to have some cached tokens");  in ReplacePreviousCachedToken()
159   CachedTokens.insert(CachedTokens.begin() + CachedLexPos - 1, NewToks.begin(),  in ReplacePreviousCachedToken()
161   CachedTokens.erase(CachedTokens.begin() + CachedLexPos - 1 + NewToks.size());  in ReplacePreviousCachedToken()
162   CachedLexPos += NewToks.size() - 1;  in ReplacePreviousCachedToken()