Lines Matching +full:0 +full:xac00
4 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
33 char32_t Value = 0xFFFFFFFF;
34 uint32_t ChildrenOffset = 0;
36 uint32_t Size = 0;
41 return !Name.empty() || Value == 0xFFFFFFFF;
43 constexpr bool hasChildren() const { return ChildrenOffset != 0 || IsRoot; }
70 if (Offset == 0)
80 bool LongName = NameInfo & 0x40;
81 bool HasValue = NameInfo & 0x80;
82 std::size_t Size = NameInfo & ~0xC0;
96 bool HasChildren = L & 0x02;
97 N.HasSibling = L & 0x01;
106 N.HasSibling = H & 0x80;
107 bool HasChildren = H & 0x40;
108 H &= uint8_t(~0xC0);
124 Consummed = 0;
183 std::size_t Consummed = 0;
187 return std::make_tuple(N, false, 0);
189 if (Name.size() - Consummed == 0 && N.Value != 0xFFFFFFFF)
211 return std::make_tuple(N, false, 0);
216 return compareNode(Offset, Name, Strict, 0, Buffer);
240 { 0, "YI", "S" },
241 { 0, "I", "SS" },
242 { 0, 0, "NG" },
243 { 0, 0, "J" },
244 { 0, 0, "C" },
245 { 0, 0, "K" },
246 { 0, 0, "T" },
247 { 0, 0, "P" },
248 { 0, 0, "H" }
254 constexpr const char32_t SBase = 0xAC00;
261 assert(Column == 0 || Column == 1 || Column == 2);
265 for (std::size_t I = 0; I < CountPerColumn[Column]; I++) {
269 std::size_t Consummed = 0;
280 return 0;
289 std::size_t Consummed = 0;
290 char NameStart = 0;
297 Name = Name.substr(findSyllable(Name, Strict, NameStart, L, 0));
304 Buffer.append(HangulSyllables[L][0]);
325 {"CJK UNIFIED IDEOGRAPH-", 0x3400, 0x4DBF},
326 {"CJK UNIFIED IDEOGRAPH-", 0x4E00, 0x9FFF},
327 {"CJK UNIFIED IDEOGRAPH-", 0x20000, 0x2A6DF},
328 {"CJK UNIFIED IDEOGRAPH-", 0x2A700, 0x2B739},
329 {"CJK UNIFIED IDEOGRAPH-", 0x2B740, 0x2B81D},
330 {"CJK UNIFIED IDEOGRAPH-", 0x2B820, 0x2CEA1},
331 {"CJK UNIFIED IDEOGRAPH-", 0x2CEB0, 0x2EBE0},
332 {"CJK UNIFIED IDEOGRAPH-", 0x2EBF0, 0x2EE5D},
333 {"CJK UNIFIED IDEOGRAPH-", 0x30000, 0x3134A},
334 {"CJK UNIFIED IDEOGRAPH-", 0x31350, 0x323AF},
335 {"TANGUT IDEOGRAPH-", 0x17000, 0x187F7},
336 {"TANGUT IDEOGRAPH-", 0x18D00, 0x18D08},
337 {"KHITAN SMALL SCRIPT CHARACTER-", 0x18B00, 0x18CD5},
338 {"NUSHU CHARACTER-", 0x1B170, 0x1B2FB},
339 {"CJK COMPATIBILITY IDEOGRAPH-", 0xF900, 0xFA6D},
340 {"CJK COMPATIBILITY IDEOGRAPH-", 0xFA70, 0xFAD9},
341 {"CJK COMPATIBILITY IDEOGRAPH-", 0x2F800, 0x2FA1D},
348 std::size_t Consummed = 0;
349 char NameStart = 0;
355 unsigned long long V = 0;
386 std::tie(Node, Matches, Value) = compareNode(0, Name, Strict, Buffer);
391 if (!Strict && Value == 0x116c && Name.contains_insensitive("O-E")) {
393 Value = 0x1180;
424 std::size_t LargestEditDistance = 0;
483 Columns * (UnicodeNameToCodepointLargestNameSize + 1), 0);
491 for (std::size_t I = 0; I < Columns; I++)
492 Get(I, 0) = I;
500 std::size_t J = 0;
505 Get(0, Row) = Row;
512 Get(I - 1, Row - 1) + (NormalizedName[I - 1] != N.Name[J] ? 1 : 0);
521 if (N.Value != 0xFFFFFFFF) {