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()
849 size_t renameRangeAdjustmentCost(ArrayRef<Range> Indexed, ArrayRef<Range> Lexed,  in renameRangeAdjustmentCost()  argument
853   assert(std::is_sorted(Lexed.begin(), Lexed.end()));  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()