njames93 added inline comments.
================
Comment at: clang/lib/ASTMatchers/Dynamic/Marshallers.cpp:16-17
+ if (Item.equals_lower(Search)) {
+ if (Item.equals(Search))
+ return Item.str();
+ MaxEditDistance = 1;
----------------
aaron.ballman wrote:
> Is this case possible to hit? I would imagine that if the search time matches
> anything in the allowed list, we would have not needed to call
> `getBestGuess()` in the first place?
This one shouldn't be, I put an assert in for sanity though. The one below with
the prefix can be hit though.
Repository:
rG LLVM Github Monorepo
CHANGES SINCE LAST ACTION
https://reviews.llvm.org/D77499/new/
https://reviews.llvm.org/D77499
_______________________________________________
cfe-commits mailing list
cfe-commits@lists.llvm.org
https://lists.llvm.org/cgi-bin/mailman/listinfo/cfe-commits
