Lines Matching refs:Includes

2212 FindCursorIndex(const SmallVectorImpl<IncludeDirective> &Includes,
2216 for (int i = 0, e = Includes.size(); i != e; ++i) {
2217 unsigned Start = Includes[Indices[i]].Offset;
2218 unsigned End = Start + Includes[Indices[i]].Text.size();
2225 while (--i >= 0 && Includes[CursorIndex].Text == Includes[Indices[i]].Text)
2254 // Sorts and deduplicate a block of includes given by 'Includes' alphabetically
2255 // adding the necessary replacement to 'Replaces'. 'Includes' must be in strict
2262 const SmallVectorImpl<IncludeDirective> &Includes,
2267 unsigned IncludesBeginOffset = Includes.front().Offset;
2269 Includes.back().Offset + Includes.back().Text.size();
2274 for (unsigned i = 0, e = Includes.size(); i != e; ++i) {
2280 const auto LHSFilenameLower = Includes[LHSI].Filename.lower();
2281 const auto RHSFilenameLower = Includes[RHSI].Filename.lower();
2282 return std::tie(Includes[LHSI].Priority, LHSFilenameLower,
2283 Includes[LHSI].Filename) <
2284 std::tie(Includes[RHSI].Priority, RHSFilenameLower,
2285 Includes[RHSI].Filename);
2289 return std::tie(Includes[LHSI].Priority, Includes[LHSI].Filename) <
2290 std::tie(Includes[RHSI].Priority, Includes[RHSI].Filename);
2301 FindCursorIndex(Includes, Indices, *Cursor);
2306 return Includes[LHSI].Text.trim() ==
2307 Includes[RHSI].Text.trim();
2311 int CurrentCategory = Includes.front().Category;
2319 if (Indices.size() == Includes.size() && llvm::is_sorted(Indices) &&
2329 CurrentCategory != Includes[Index].Category)
2332 result += Includes[Index].Text;
2335 CurrentCategory = Includes[Index].Category;
2345 FileName, Includes.front().Offset, IncludesBlockSize, result));
2709 tooling::HeaderIncludes Includes(FileName, Code, Style.IncludeStyle);
2713 Includes.remove(Header.trim("\"<>"), Header.startswith("<"));
2735 Includes.insert(IncludeName.trim("\"<>"), IncludeName.startswith("<"));