unicode

Branch: main

Switch branches or tags

Branch: main
Go to file t

413 files indexed

History
Code

ucd/decomposition/decomposition_test.mbt
1///|2test "decomposition kinds stay distinct" {3  assert_eq(4    @decomposition.get_canonical_decomposition('\u{00C0}'),5    Some(['A', '\u{0300}']),6  )7  assert_eq(@decomposition.get_compat_decomposition('\u{00C0}'), None)8  // The first mapping is compatibility-only.9  assert_eq(@decomposition.get_compat_decomposition('\u{00A0}'), Some([' ']))10  assert_eq(@decomposition.get_canonical_decomposition('\u{00A0}'), None)11}1213///|14test "decomposition lookup boundaries and missing mappings" {15  // The last mapping needs the final offset sentinel and has a non-BMP result.16  assert_eq(17    @decomposition.get_canonical_decomposition('\u{2FA1D}'),18    Some(['\u{2A600}']),19  )20  assert_eq(@decomposition.get_compat_decomposition('\u{2FA1D}'), None)21  for c in ['\u{0000}', 'A', '\u{00A1}', '\u{2FA1E}', '\u{10FFFF}'] {22    assert_eq(@decomposition.get_canonical_decomposition(c), None)23    assert_eq(@decomposition.get_compat_decomposition(c), None)24  }25}2627///|28test "long compatibility decomposition" {29  assert_eq(30    @decomposition.get_compat_decomposition('\u{FDFA}'),31    Some([32      '\u{0635}', '\u{0644}', '\u{0649}', ' ', '\u{0627}', '\u{0644}', '\u{0644}',33      '\u{0647}', ' ', '\u{0639}', '\u{0644}', '\u{064A}', '\u{0647}', ' ', '\u{0648}',34      '\u{0633}', '\u{0644}', '\u{0645}',35    ]),36  )37  assert_eq(@decomposition.get_canonical_decomposition('\u{FDFA}'), None)38}3940///|41/// The full decomposition of one character.42fn decompose(c : Char, compatibility~ : Bool) -> Array[Char] {43  let dest : Array[Char] = []44  @decomposition.append_decomposition(c, dest, compatibility~)45  dest46}4748///|49test "append_decomposition: characters without a mapping are appended as they are" {50  for c in ['\u{0000}', 'A', '\u{009F}', '\u{00A1}', '\u{4E2D}', '\u{10FFFF}'] {51    assert_eq(decompose(c, compatibility=false), [c])52    assert_eq(decompose(c, compatibility=true), [c])53  }54  // Hangul syllables are decomposed algorithmically, not from this table.55  assert_eq(decompose('\u{AC00}', compatibility=false), ['\u{AC00}'])56}5758///|59test "append_decomposition: canonical and compatibility mappings" {60  assert_eq(decompose('\u{00C0}', compatibility=false), ['A', '\u{0300}'])61  // Without a compatibility mapping, the canonical one applies.62  assert_eq(decompose('\u{00C0}', compatibility=true), ['A', '\u{0300}'])63  // U+00A0 is the first character with a mapping; it is compatibility-only.64  assert_eq(decompose('\u{00A0}', compatibility=false), ['\u{00A0}'])65  assert_eq(decompose('\u{00A0}', compatibility=true), [' '])66  assert_eq(decompose('\u{FB03}', compatibility=true), ['f', 'f', 'i'])67  assert_eq(decompose('\u{2FA1D}', compatibility=false), ['\u{2A600}'])68}6970///|71test "append_decomposition: mappings apply recursively" {72  // U+1EC7 maps to U+1EB9 U+0302, and U+1EB9 to U+0065 U+0323.73  assert_eq(decompose('\u{1EC7}', compatibility=false), [74    'e', '\u{0323}', '\u{0302}',75  ])76  // U+01C4 maps to U+0044 U+017D under compatibility, and U+017D77  // canonically to U+005A U+030C.78  assert_eq(decompose('\u{01C4}', compatibility=true), ['D', 'Z', '\u{030C}'])79  assert_eq(decompose('\u{01C4}', compatibility=false), ['\u{01C4}'])80}8182///|83test "append_decomposition: appends after existing elements" {84  let dest = ['x']85  @decomposition.append_decomposition('\u{00E9}', dest, compatibility=false)86  @decomposition.append_decomposition('y', dest, compatibility=false)87  assert_eq(dest, ['x', 'e', '\u{0301}', 'y'])88}89