55   CachedTokens.erase(CachedTokens.begin() + TokenRange.Begin,  in EraseCachedTokens()
56                      CachedTokens.begin() + TokenRange.End);  in EraseCachedTokens()
75   if (CachedLexPos < CachedTokens.size()) {  in CachingLex()
76     Result = CachedTokens[CachedLexPos++];  in CachingLex()
93     CachedTokens.push_back(Result);  in CachingLex()
98   if (CachedLexPos < CachedTokens.size()) {  in CachingLex()
102     CachedTokens.clear();  in CachingLex()
119   assert(CachedLexPos + N > CachedTokens.size() && "Confused caching.");  in PeekAhead()
121   for (size_t C = CachedLexPos + N - CachedTokens.size(); C > 0; --C) {  in PeekAhead()
122     CachedTokens.push_back(Token());  in PeekAhead()
123     Lex(CachedTokens.back());  in PeekAhead()
126   return CachedTokens.back();  in PeekAhead()
132   assert(CachedTokens[CachedLexPos-1].getLastLoc() == Tok.getAnnotationEndLoc()  in AnnotatePreviousCachedTokens()
138     CachedTokensTy::iterator AnnotBegin = CachedTokens.begin() + i-1;  in AnnotatePreviousCachedTokens()
144         CachedTokens.erase(AnnotBegin + 1, CachedTokens.begin() + CachedLexPos);  in AnnotatePreviousCachedTokens()
157   const Token LastCachedTok = CachedTokens[CachedLexPos - 1];  in IsPreviousCachedToken()
172   CachedTokens.insert(CachedTokens.begin() + CachedLexPos - 1, NewToks.begin(),  in ReplacePreviousCachedToken()
174   CachedTokens.erase(CachedTokens.begin() + CachedLexPos - 1 + NewToks.size());  in ReplacePreviousCachedToken()