================
@@ -214,11 +214,11 @@ int \N{Λ} = 0;
// expected-error@-2 {{expected unqualified-id}}
const char* emoji = "\N{🤡}";
// expected-error@-1 {{'🤡' is not a valid Unicode character name}}
-// expected-note@-2 {{did you mean OX ('🐂' U+1F402)?}}
-// expected-note@-3 {{did you mean ANT ('🐜' U+1F41C)?}}
-// expected-note@-4 {{did you mean ARC ('⌒' U+2312)?}}
-// expected-note@-5 {{did you mean AXE ('🪓' U+1FA93)?}}
-// expected-note@-6 {{did you mean BAT ('🦇' U+1F987)?}}
+// expected-note@-2 {{did you mean BS (U+0008)?}}
+// expected-note@-3 {{did you mean CR (U+000D)?}}
+// expected-note@-4 {{did you mean EM (U+0019)?}}
+// expected-note@-5 {{did you mean FF (U+000C)?}}
+// expected-note@-6 {{did you mean FS (U+001C)?}}
----------------
cor3ntin wrote:
Here is an idea - there are about 350 abbreviation. Including `VS1-VS256`.
The VSXXX can be generated, everything else can be stored in a naive map, I
think.
And we can then only look at that when doing a strict match, like we already do
for other generated names
https://github.com/llvm/llvm-project/pull/203944
_______________________________________________
cfe-commits mailing list
[email protected]
https://lists.llvm.org/cgi-bin/mailman/listinfo/cfe-commits
