pull/8757/head
Jacob Sandlund 2025-08-17 19:05:40 -04:00
parent 0979ea3371
commit 1abc9b5e41
2 changed files with 5 additions and 6 deletions

View File

@ -42,8 +42,8 @@
.lazy = true,
},
.uucode = .{
.url = "https://github.com/jacobsandlund/uucode/archive/c7421d97dbdaa8aa176a87eb6dd7dcc3baab12d1.tar.gz",
.hash = "uucode-0.0.0-ZZjBPkh9PAAR34asa24LSw5i5TNKE1B3hohDkZL5iT8J",
.url = "https://github.com/jacobsandlund/uucode/archive/a50e106b57f406ada41d380ec59b6b33cdb77667.tar.gz",
.hash = "uucode-0.0.0-ZZjBPoF_PADS8lyIfgw-C-j5lM-CznP5808p9OMSxytN",
},
.uucode_x = .{
.url = "https://github.com/jacobsandlund/uucode.x/archive/ca9a9a4560307a30319d206b1ac68a7fc2f2fce9.tar.gz",

View File

@ -1574,7 +1574,8 @@ pub const Trigger = struct {
.unicode => |cp| std.hash.autoHash(
hasher,
foldedCodepoint(cp),
// Alternative, just use simple case folding:
// Alternative, just use simple case folding, and delete
// `foldedCodepoint` below:
// uucode.get(.case_folding_simple, cp),
),
}
@ -1593,9 +1594,7 @@ pub const Trigger = struct {
// If more codepoints are produced then we return the codepoint
// as-is which isn't correct but until we have a failing test
// then I don't want to handle this.
var folded: [3]u21 = .{ 0, 0, 0 };
_ = uucode.get(.case_folding_full, cp).copy(&folded, cp);
return folded;
return uucode.get(.case_folding_full, cp).array(cp);
}
/// Convert the trigger to a C API compatible trigger.