tests/bidi_tests/bidi_test.mbt1///|2/// Unicode Bidirectional Algorithm conformance tests, read directly from3/// BidiTest.txt (Unicode 18.0.0).4/// Source: https://www.unicode.org/Public/18.0.0/ucd/BidiTest.txt5///6/// Each test case declares a sequence of bidi classes and a bitset of7/// paragraph levels; the implementation must resolve embedding levels and8/// visual reordering exactly as listed in the `@Levels`/`@Reorder` sections.910///|11/// Representative code point for each bidi class used by BidiTest.txt.12fn class_code_point(class : StringView) -> Int32 raise {13 match class {14 "L" => 0x006115 "R" => 0x05D016 "AL" => 0x062717 "EN" => 0x003018 "ES" => 0x002B19 "ET" => 0x002420 "AN" => 0x066021 "CS" => 0x002C22 "NSM" => 0x030023 "BN" => 0x200B24 "B" => 0x000A25 "S" => 0x000926 "WS" => 0x002027 "ON" => 0x002128 "LRE" => 0x202A29 "LRO" => 0x202D30 "RLE" => 0x202B31 "RLO" => 0x202E32 "PDF" => 0x202C33 "LRI" => 0x206634 "RLI" => 0x206735 "FSI" => 0x206836 "PDI" => 0x206937 _ => fail("Unknown bidi class: \{class}")38 }39}4041///|42fn parse_classes(text : StringView) -> Array[String] {43 let classes : Array[String] = []44 for class in text.trim().split(" ") {45 let class = class.trim()46 if !class.is_empty() {47 classes.push(class.to_owned())48 }49 }50 classes51}5253///|54fn classes_to_string(classes : ArrayView[String]) -> String raise {55 let out = StringBuilder()56 for class in classes {57 out.write_char(class_code_point(class).unsafe_to_char())58 }59 out.to_string()60}6162///|63/// Paragraph direction implied by a BidiTest.txt bitset bit:64/// 1 = auto, 2 = LTR, 4 = RTL.65fn bit_paragraph_direction(bit : Int32) -> @bidi.Direction? {66 match bit {67 1 => None68 2 => Some(@bidi.Direction::LTR)69 _ => Some(@bidi.Direction::RTL)70 }71}7273///|74fn check_case(75 input : String,76 direction : @bidi.Direction?,77 expected_levels : Array[Int32],78 expected_reorder : Array[Int32],79 line : Int32,80) -> Unit raise {81 let result = @bidi.process(input, direction?)82 for index, expected_level in expected_levels {83 if expected_level >= 0 {84 @debug.assert_eq(85 result.levels[index],86 expected_level,87 msg="BidiTest.txt line \{line}: resolved level at index \{index}",88 )89 }90 }91 @debug.assert_eq(92 @bidi.reorder(result),93 expected_reorder,94 msg="BidiTest.txt line \{line}: visual reorder",95 )96}9798///|99async test "BidiTest.txt conformance" {100 let content = @support.read_data_file("BidiTest.txt")101 let mut current_levels : Array[Int32] = []102 let mut current_reorder : Array[Int32] = []103 for line_number, raw_line in content.split("\n") {104 let line = raw_line.trim()105 if line.is_empty() || line.has_prefix("#") {106 continue107 }108 if line.strip_prefix("@Levels:") is Some(levels) {109 current_levels = @support.parse_levels(levels)110 continue111 }112 if line.strip_prefix("@Reorder:") is Some(reorder) {113 current_reorder = @support.parse_reorder(reorder)114 continue115 }116 if line.has_prefix("@") {117 continue118 }119 guard line.split(";").collect() is [classes_text, bitset_text, ..] else {120 continue121 }122 let classes = parse_classes(classes_text)123 if classes.is_empty() {124 continue125 }126 let bitset = @support.parse_decimal_int(bitset_text)127 let input = classes_to_string(classes)128 for bit in [1, 2, 4] {129 if (bitset & bit) != 0 {130 check_case(131 input,132 bit_paragraph_direction(bit),133 current_levels,134 current_reorder,135 line_number + 1,136 )137 }138 }139 }140}141
///|
/// Unicode Bidirectional Algorithm conformance tests, read directly from
/// BidiTest.txt (Unicode 18.0.0).
/// Source: https://www.unicode.org/Public/18.0.0/ucd/BidiTest.txt
///
/// Each test case declares a sequence of bidi classes and a bitset of
/// paragraph levels; the implementation must resolve embedding levels and
/// visual reordering exactly as listed in the `@Levels`/`@Reorder` sections.
///|
/// Representative code point for each bidi class used by BidiTest.txt.
fn class_code_point(class : StringView) -> Int32 raise {
match class {
"L" => 0x0061
"R" => 0x05D0
"AL" => 0x0627
"EN" => 0x0030
"ES" => 0x002B
"ET" => 0x0024
"AN" => 0x0660
"CS" => 0x002C
"NSM" => 0x0300
"BN" => 0x200B
"B" => 0x000A
"S" => 0x0009
"WS" => 0x0020
"ON" => 0x0021
"LRE" => 0x202A
"LRO" => 0x202D
"RLE" => 0x202B
"RLO" => 0x202E
"PDF" => 0x202C
"LRI" => 0x2066
"RLI" => 0x2067
"FSI" => 0x2068
"PDI" => 0x2069
_ => fail("Unknown bidi class: \{class}")
}
}
///|
fn parse_classes(text : StringView) -> Array[String] {
let classes : Array[String] = []
for class in text.trim().split(" ") {
let class = class.trim()
if !class.is_empty() {
classes.push(class.to_owned())
}
}
classes
}
///|
fn classes_to_string(classes : ArrayView[String]) -> String raise {
let out = StringBuilder()
for class in classes {
out.write_char(class_code_point(class).unsafe_to_char())
}
out.to_string()
}
///|
/// Paragraph direction implied by a BidiTest.txt bitset bit:
/// 1 = auto, 2 = LTR, 4 = RTL.
fn bit_paragraph_direction(bit : Int32) -> @bidi.Direction? {
match bit {
1 => None
2 => Some(@bidi.Direction::LTR)
_ => Some(@bidi.Direction::RTL)
}
}
///|
fn check_case(
input : String,
direction : @bidi.Direction?,
expected_levels : Array[Int32],
expected_reorder : Array[Int32],
line : Int32,
) -> Unit raise {
let result = @bidi.process(input, direction?)
for index, expected_level in expected_levels {
if expected_level >= 0 {
@debug.assert_eq(
result.levels[index],
expected_level,
msg="BidiTest.txt line \{line}: resolved level at index \{index}",
)
}
}
@debug.assert_eq(
@bidi.reorder(result),
expected_reorder,
msg="BidiTest.txt line \{line}: visual reorder",
)
}
///|
async test "BidiTest.txt conformance" {
let content = @support.read_data_file("BidiTest.txt")
let mut current_levels : Array[Int32] = []
let mut current_reorder : Array[Int32] = []
for line_number, raw_line in content.split("\n") {
let line = raw_line.trim()
if line.is_empty() || line.has_prefix("#") {
continue
}
if line.strip_prefix("@Levels:") is Some(levels) {
current_levels = @support.parse_levels(levels)
continue
}
if line.strip_prefix("@Reorder:") is Some(reorder) {
current_reorder = @support.parse_reorder(reorder)
continue
}
if line.has_prefix("@") {
continue
}
guard line.split(";").collect() is [classes_text, bitset_text, ..] else {
continue
}
let classes = parse_classes(classes_text)
if classes.is_empty() {
continue
}
let bitset = @support.parse_decimal_int(bitset_text)
let input = classes_to_string(classes)
for bit in [1, 2, 4] {
if (bitset & bit) != 0 {
check_case(
input,
bit_paragraph_direction(bit),
current_levels,
current_reorder,
line_number + 1,
)
}
}
}
}