Lines Matching defs:Replaces

195   for (const auto &R : Replaces) {
217 // `R` and `Replaces` are order-independent if applying them in either order
224   // the code after the existing replacements `Replaces` are applied.
226   // A Replacements set that is `Replaces` referring to the code after `R` is
229   for (const auto &Replace : Replaces)
230     ReplacesShiftedByRs.Replaces.insert(
232   // This is equivalent to applying `Replaces` first and then `R`.
234   // This is equivalent to applying `R` first and then `Replaces`.
243                                             R, *Replaces.begin());
248   if (!Replaces.empty() && R.getFilePath() != Replaces.begin()->getFilePath())
250         replacement_error::wrong_file_path, R, *Replaces.begin());
254     Replaces.insert(R);
268   auto I = Replaces.lower_bound(AtEnd);
270   if (I != Replaces.end() && R.getOffset() == I->getOffset()) {
284       Replaces.erase(I);
285       Replaces.insert(std::move(NewR));
295     Replaces.insert(R);
301   if (I == Replaces.begin()) {
302     Replaces.insert(R);
320     Replaces.insert(R);
327     while (I != Replaces.begin()) {
339     Replaces.erase(MergeBegin, MergeEnd);
340     Replaces.insert(Merged->begin(), Merged->end());
448   auto &First = Replaces;
449   auto &Second = ReplacesToMerge.Replaces;
511 calculateRangesAfterReplacements(const Replacements &Replaces,
516   //   - Merge with \p Replaces.
519   if (Replaces.empty())
524         FakeReplaces.add(Replacement(Replaces.begin()->getFilePath(),
529   return FakeReplaces.merge(Replaces).getAffectedRanges();
538   for (const auto &R : Replaces) {
549   for (const auto &R : Replaces) {
568 bool applyAllReplacements(const Replacements &Replaces, Rewriter &Rewrite) {
570   for (auto I = Replaces.rbegin(), E = Replaces.rend(); I != E; ++I) {
581                                                 const Replacements &Replaces) {
582   if (Replaces.empty())
598   for (auto I = Replaces.rbegin(), E = Replaces.rend(); I != E; ++I) {