Searched refs:Lexed (Results 1 – 3 of 3) sorted by relevance
| /external/llvm-project/clang-tools-extra/clangd/refactor/ |
| D | Rename.cpp | 775 std::vector<Range> Lexed = in adjustRenameRanges() local
777 llvm::sort(Lexed); in adjustRenameRanges()
778 return getMappedRanges(Indexed, Lexed); in adjustRenameRanges()
782 ArrayRef<Range> Lexed) { in getMappedRanges() argument
786 assert(std::is_sorted(Lexed.begin(), Lexed.end())); in getMappedRanges()
788 if (Indexed.size() > Lexed.size()) { in getMappedRanges()
796 if (std::includes(Indexed.begin(), Indexed.end(), Lexed.begin(), Lexed.end())) in getMappedRanges()
804 findNearMiss(ResultStorage, Indexed, Lexed, 0, Fuel, in getMappedRanges()
807 renameRangeAdjustmentCost(Indexed, Lexed, Matched); in getMappedRanges()
829 Mapped.push_back(Lexed[I]); in getMappedRanges()
[all …]
|
| D | Rename.h | 103 ArrayRef<Range> Lexed);
110 size_t renameRangeAdjustmentCost(ArrayRef<Range> Indexed, ArrayRef<Range> Lexed,
|
| /external/llvm-project/clang-tools-extra/clangd/unittests/ |
| D | RenameTests.cpp | 1718 auto Lexed = Annotations(T.LexedCode); in TEST() local
1719 auto LexedRanges = Lexed.ranges(); in TEST()
1721 for (auto P : Lexed.points()) { in TEST()
|