771                    std::vector<Range> Indexed, const LangOptions &LangOpts) {  in adjustRenameRanges()  argument
773   assert(!Indexed.empty());  in adjustRenameRanges()
774   assert(std::is_sorted(Indexed.begin(), Indexed.end()));  in adjustRenameRanges()
778   return getMappedRanges(Indexed, Lexed);  in adjustRenameRanges()
781 llvm::Optional<std::vector<Range>> getMappedRanges(ArrayRef<Range> Indexed,  in getMappedRanges()  argument
784   assert(!Indexed.empty());  in getMappedRanges()
785   assert(std::is_sorted(Indexed.begin(), Indexed.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()
797     return Indexed.vec();  in getMappedRanges()
804   findNearMiss(ResultStorage, Indexed, Lexed, 0, Fuel,  in getMappedRanges()
807                      renameRangeAdjustmentCost(Indexed, Lexed, Matched);  in getMappedRanges()
849 size_t renameRangeAdjustmentCost(ArrayRef<Range> Indexed, ArrayRef<Range> Lexed,  in renameRangeAdjustmentCost()  argument
851   assert(Indexed.size() == MappedIndex.size());  in renameRangeAdjustmentCost()
852   assert(std::is_sorted(Indexed.begin(), Indexed.end()));  in renameRangeAdjustmentCost()
858   for (size_t I = 0; I < Indexed.size(); ++I) {  in renameRangeAdjustmentCost()
859     int DLine = Indexed[I].start.line - Lexed[MappedIndex[I]].start.line;  in renameRangeAdjustmentCost()
861         Indexed[I].start.character - Lexed[MappedIndex[I]].start.character;  in renameRangeAdjustmentCost()
862     int Line = Indexed[I].start.line;  in renameRangeAdjustmentCost()