37   StringRef Name;  member
41     return !Name.empty() || Value == 0xFFFFFFFF;  in isValid()
53       std::reverse_copy(N->Name.begin(), N->Name.end(), std::back_inserter(S));  in fullName()
86     N.Name = StringRef(UnicodeNameToCodepointDict + NameOffset, Size);  in readNode()
88     N.Name = StringRef(UnicodeNameToCodepointDict + Size, 1);  in readNode()
120 static bool startsWith(StringRef Name, StringRef Needle, bool Strict,  in startsWith()  argument
126     if (!Name.starts_with(Needle))  in startsWith()
134   auto NamePos = Name.begin();  in startsWith()
159     NamePos = IgnoreSpaces(NamePos, Name.end(), PreviousCharInName);  in startsWith()
164     if (NamePos == Name.end())  in startsWith()
171   Consummed = std::distance(Name.begin(), NamePos);  in startsWith()
179 compareNode(uint32_t Offset, StringRef Name, bool Strict,  in compareNode()  argument
184   bool DoesStartWith = N.IsRoot || startsWith(Name, N.Name, Strict, Consummed,  in compareNode()
189   if (Name.size() - Consummed == 0 && N.Value != 0xFFFFFFFF)  in compareNode()
199           compareNode(ChildOffset, Name.substr(Consummed), Strict,  in compareNode()
202         std::reverse_copy(C.Name.begin(), C.Name.end(),  in compareNode()
215 compareNode(uint32_t Offset, StringRef Name, bool Strict, BufferType &Buffer) {  in compareNode()  argument
216   return compareNode(Offset, Name, Strict, 0, Buffer);  in compareNode()
259 static std::size_t findSyllable(StringRef Name, bool Strict,  in findSyllable()  argument
272         startsWith(Name, Syllable, Strict, Consummed, PreviousInNameCopy);  in findSyllable()
286 nameToHangulCodePoint(StringRef Name, bool Strict, BufferType &Buffer) {  in nameToHangulCodePoint()  argument
292       startsWith(Name, "HANGUL SYLLABLE ", Strict, Consummed, NameStart);  in nameToHangulCodePoint()
295   Name = Name.substr(Consummed);  in nameToHangulCodePoint()
297   Name = Name.substr(findSyllable(Name, Strict, NameStart, L, 0));  in nameToHangulCodePoint()
298   Name = Name.substr(findSyllable(Name, Strict, NameStart, V, 1));  in nameToHangulCodePoint()
299   Name = Name.substr(findSyllable(Name, Strict, NameStart, T, 2));  in nameToHangulCodePoint()
300   if (L != -1 && V != -1 && T != -1 && Name.empty()) {  in nameToHangulCodePoint()
345 nameToGeneratedCodePoint(StringRef Name, bool Strict, BufferType &Buffer) {  in nameToGeneratedCodePoint()  argument
350     bool DoesStartWith = startsWith(Name, Item.Prefix, Strict, Consummed,  in nameToGeneratedCodePoint()
354     auto Number = Name.substr(Consummed);  in nameToGeneratedCodePoint()
371 static std::optional<char32_t> nameToCodepoint(StringRef Name, bool Strict,  in nameToCodepoint()  argument
373   if (Name.empty())  in nameToCodepoint()
376   std::optional<char32_t> Res = nameToHangulCodePoint(Name, Strict, Buffer);  in nameToCodepoint()
378     Res = nameToGeneratedCodePoint(Name, Strict, Buffer);  in nameToCodepoint()
386   std::tie(Node, Matches, Value) = compareNode(0, Name, Strict, Buffer);  in nameToCodepoint()
391     if (!Strict && Value == 0x116c && Name.contains_insensitive("O-E")) {  in nameToCodepoint()
400 std::optional<char32_t> nameToCodepointStrict(StringRef Name) {  in nameToCodepointStrict()  argument
403   auto Opt = nameToCodepoint(Name, true, Buffer);  in nameToCodepointStrict()
408 nameToCodepointLooseMatching(StringRef Name) {  in nameToCodepointLooseMatching()  argument
410   auto Opt = nameToCodepoint(Name, false, Buffer);  in nameToCodepointLooseMatching()
437     std::string Name;  in nearestMatchesForCodepointName()  local
439       if (Name.empty())  in nearestMatchesForCodepointName()
440         Name = Node.fullName();  in nearestMatchesForCodepointName()
441       return Name;  in nearestMatchesForCodepointName()
448             return a.Name < GetName();  in nearestMatchesForCodepointName()
463   auto Normalize = [](StringRef Name) {  in nearestMatchesForCodepointName()  argument
465     Out.reserve(Name.size());  in nearestMatchesForCodepointName()
466     for (char C : Name) {  in nearestMatchesForCodepointName()
501     for (; J < N.Name.size(); J++) {  in nearestMatchesForCodepointName()
502       if (!isAlnum(N.Name[J]))  in nearestMatchesForCodepointName()
512             Get(I - 1, Row - 1) + (NormalizedName[I - 1] != N.Name[J] ? 1 : 0);  in nearestMatchesForCodepointName()