diff options
| author | 2025-04-30 20:30:39 -0400 | |
|---|---|---|
| committer | 2025-04-30 20:30:39 -0400 | |
| commit | 10048b0d31d0db923ae39c6bbd67139ed6252f6f (patch) | |
| tree | 65df1666aacd102f59b4ac0844ccc7f7ddda91db /src/unicode_tests.zig | |
| parent | Setup variants for all allocating modules (diff) | |
| download | zg-10048b0d31d0db923ae39c6bbd67139ed6252f6f.tar.gz zg-10048b0d31d0db923ae39c6bbd67139ed6252f6f.tar.xz zg-10048b0d31d0db923ae39c6bbd67139ed6252f6f.zip | |
Allocation Failure Tests
These turned up an excessive amount of allocations in CanonData and
CompatData, which have been reduced to two through the somewhat
squirrely use of 'magic numbers'.
There are now allocation tests for every allocated structure in the
library, and they run to completion in a reasonable amount of time.
So, that's nice.
Diffstat (limited to 'src/unicode_tests.zig')
| -rw-r--r-- | src/unicode_tests.zig | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/unicode_tests.zig b/src/unicode_tests.zig index 8b9069a..1c4b888 100644 --- a/src/unicode_tests.zig +++ b/src/unicode_tests.zig | |||
| @@ -208,7 +208,7 @@ test "Segmentation GraphemeIterator" { | |||
| 208 | // std.debug.print("\nline {}: {s}\n", .{ line_no, all_bytes.items }); | 208 | // std.debug.print("\nline {}: {s}\n", .{ line_no, all_bytes.items }); |
| 209 | var iter = data.iterator(all_bytes.items); | 209 | var iter = data.iterator(all_bytes.items); |
| 210 | 210 | ||
| 211 | // Chaeck. | 211 | // Check. |
| 212 | for (want.items) |want_gc| { | 212 | for (want.items) |want_gc| { |
| 213 | const got_gc = (iter.next()).?; | 213 | const got_gc = (iter.next()).?; |
| 214 | try std.testing.expectEqualStrings( | 214 | try std.testing.expectEqualStrings( |