Lines Matching defs:Replaces
194 for (const auto &R : Replaces) {
216 // `R` and `Replaces` are order-independent if applying them in either order
223 // the code after the existing replacements `Replaces` are applied.
225 // A Replacements set that is `Replaces` referring to the code after `R` is
228 for (const auto &Replace : Replaces)
229 ReplacesShiftedByRs.Replaces.insert(
231 // This is equivalent to applying `Replaces` first and then `R`.
233 // This is equivalent to applying `R` first and then `Replaces`.
242 R, *Replaces.begin());
247 if (!Replaces.empty() && R.getFilePath() != Replaces.begin()->getFilePath())
249 replacement_error::wrong_file_path, R, *Replaces.begin());
253 Replaces.insert(R);
267 auto I = Replaces.lower_bound(AtEnd);
269 if (I != Replaces.end() && R.getOffset() == I->getOffset()) {
283 Replaces.erase(I);
284 Replaces.insert(std::move(NewR));
294 Replaces.insert(R);
300 if (I == Replaces.begin()) {
301 Replaces.insert(R);
319 Replaces.insert(R);
326 while (I != Replaces.begin()) {
338 Replaces.erase(MergeBegin, MergeEnd);
339 Replaces.insert(Merged->begin(), Merged->end());
447 auto &First = Replaces;
448 auto &Second = ReplacesToMerge.Replaces;
510 calculateRangesAfterReplacements(const Replacements &Replaces,
515 // - Merge with \p Replaces.
518 if (Replaces.empty())
523 FakeReplaces.add(Replacement(Replaces.begin()->getFilePath(),
528 return FakeReplaces.merge(Replaces).getAffectedRanges();
537 for (const auto &R : Replaces) {
548 for (const auto &R : Replaces) {
567 bool applyAllReplacements(const Replacements &Replaces, Rewriter &Rewrite) {
569 for (auto I = Replaces.rbegin(), E = Replaces.rend(); I != E; ++I) {
580 const Replacements &Replaces) {
581 if (Replaces.empty())
597 for (auto I = Replaces.rbegin(), E = Replaces.rend(); I != E; ++I) {