Something went wrong. Try again.
My version of https://github.com/vercel-labs/fx
Something went wrong. Try again.
Zig
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778const std = @import("std");const unicode_data = @import("unicode_display_data.zig");
const RgiNode = packed struct(u32) { edge_start: u13, edge_len: u8, terminal: bool, padding: u10 = 0,};
const rgi_codepoint_count: usize = blk: { @setEvalBranchQuota(2_000_000); var unique: [unicode_data.rgi_trie_edges.len]u21 = undefined; var count: usize = 0; for (unicode_data.rgi_trie_edges) |edge| { var seen = false; for (unique[0..count]) |codepoint| { if (codepoint == edge.codepoint) { seen = true; break; } } if (!seen) { unique[count] = edge.codepoint; count += 1; } } break :blk count;};
const RgiData = struct { nodes: [unicode_data.rgi_trie_nodes.len]RgiNode, edge_codepoint_ids: [unicode_data.rgi_trie_edges.len]u8, codepoints: [rgi_codepoint_count]u21,};
const rgi_data: RgiData = blk: { @setEvalBranchQuota(2_000_000); if (rgi_codepoint_count > std.math.maxInt(u8) + 1) { @compileError("RGI trie edge alphabet no longer fits in u8"); }
var data: RgiData = undefined; var codepoint_count: usize = 0; for (unicode_data.rgi_trie_edges, 0..) |edge, edge_index| { if (edge.child != edge_index + 1) { @compileError("RGI trie child numbering is no longer implicit"); }
var codepoint_id: ?u8 = null; for (data.codepoints[0..codepoint_count], 0..) |codepoint, index| { if (codepoint == edge.codepoint) { codepoint_id = @intCast(index); break; } } if (codepoint_id == null) { codepoint_id = @intCast(codepoint_count); data.codepoints[codepoint_count] = edge.codepoint; codepoint_count += 1; } data.edge_codepoint_ids[edge_index] = codepoint_id.?; } if (codepoint_count != rgi_codepoint_count) { @compileError("RGI trie edge alphabet count mismatch"); }
for (unicode_data.rgi_trie_nodes, 0..) |node, index| { data.nodes[index] = .{ .edge_start = @intCast(node.edge_start), .edge_len = @intCast(node.edge_len), .terminal = node.terminal, }; } break :blk data;};
pub const DecodedRune = struct { len: usize, codepoint: u21,};
pub const DisplayUnit = struct { byte_len: usize, cell_width: usize,};
pub noinline fn visibleWidth(text: []const u8) usize { var width: usize = 0; var i: usize = 0; while (i < text.len) { const unit = displayUnitAt(text, i); width +|= unit.cell_width; i += unit.byte_len; } return width;}
// Same as visibleWidth, but skips over ANSI escape sequences so callers can// measure the rendered cell width of text that already contains styling.pub noinline fn visibleWidthIgnoringAnsi(text: []const u8) usize { var width: usize = 0; var i: usize = 0; while (i < text.len) { if (text[i] == 0x1b) { i = ansiSequenceEnd(text, i); continue; } const unit = displayUnitAt(text, i); width +|= unit.cell_width; i += unit.byte_len; } return width;}
// Returns the first variant whose visible width fits max_width, falling back// to the last (shortest) variant so callers always get something to clip.pub noinline fn widestFitting(variants: []const []const u8, max_width: usize) []const u8 { std.debug.assert(variants.len > 0); for (variants) |variant| { if (visibleWidth(variant) <= max_width) return variant; } return variants[variants.len - 1];}
pub noinline fn prefixByWidth(text: []const u8, max_width: usize) []const u8 { if (max_width == 0) return "";
var width: usize = 0; var i: usize = 0; while (i < text.len) { const unit = displayUnitAt(text, i); if (unit.cell_width > max_width - width) break; width += unit.cell_width; i += unit.byte_len; } return text[0..i];}
// Same as prefixByWidth, but skips ANSI escape sequences so callers can clip// text that already carries styling bytes without the escape sequences eating// into the width budget.pub noinline fn prefixByWidthIgnoringAnsi(text: []const u8, max_width: usize) []const u8 { if (max_width == 0) return "";
var width: usize = 0; var i: usize = 0; while (i < text.len) { if (text[i] == 0x1b) { i = ansiSequenceEnd(text, i); continue; } const unit = displayUnitAt(text, i); if (unit.cell_width > max_width - width) break; width += unit.cell_width; i += unit.byte_len; } return text[0..i];}
pub noinline fn suffixByWidth(text: []const u8, max_width: usize) []const u8 { if (max_width == 0) return text[text.len..];
var remaining = visibleWidth(text); if (remaining <= max_width) return text;
var i: usize = 0; while (i < text.len and remaining > max_width) { const unit = displayUnitAt(text, i); remaining -= unit.cell_width; i += unit.byte_len; } return text[i..];}
// Same as suffixByWidth, but ANSI-aware. Walks forward so escape sequences// stay attached to the visible rune that follows them; splitting an OSC-8// open/close pair would leak a dangling hyperlink into the terminal.pub noinline fn suffixByWidthIgnoringAnsi(text: []const u8, max_width: usize) []const u8 { if (max_width == 0) return text[text.len..];
const total = visibleWidthIgnoringAnsi(text); if (total <= max_width) return text;
var remaining = total; var i: usize = 0; while (i < text.len and remaining > max_width) { if (text[i] == 0x1b) { i = ansiSequenceEnd(text, i); continue; } const unit = displayUnitAt(text, i); remaining -= unit.cell_width; i += unit.byte_len; } return text[i..];}
pub noinline fn displayUnitAt(text: []const u8, index: usize) DisplayUnit { if (index >= text.len) return .{ .byte_len = 0, .cell_width = 0 };
const first_byte = text[index]; const may_start_keycap = (first_byte == '#' or first_byte == '*' or (first_byte >= '0' and first_byte <= '9')) and hasRgiKeycapSuffix(text, index + 1); if (first_byte < 0x80 and !may_start_keycap) { const cell_width: usize = if (first_byte == 0 or first_byte < 32 or first_byte == 0x7f) 0 else 1; return .{ .byte_len = 1, .cell_width = cell_width }; }
const rgi_len = matchRgiSequence(text, index); if (rgi_len != 0) return .{ .byte_len = rgi_len, .cell_width = 2 };
const first = decodeNextRune(text, index); const next_index = index + first.len; if (next_index < text.len and isInRanges(first.codepoint, unicode_data.variation_bases[0..])) { const selector = decodeNextRune(text, next_index); if (selector.codepoint == 0xfe0e) { const cell_width: usize = if (isInRanges(first.codepoint, unicode_data.wide_ranges[0..])) 2 else 1; return .{ .byte_len = first.len + selector.len, .cell_width = cell_width }; } if (selector.codepoint == 0xfe0f) { return .{ .byte_len = first.len + selector.len, .cell_width = 2 }; } }
return .{ .byte_len = first.len, .cell_width = runeWidth(first.codepoint) };}
fn hasRgiKeycapSuffix(text: []const u8, suffix_start: usize) bool { const variation_selector_16 = "\xef\xb8\x8f"; const combining_keycap = "\xe2\x83\xa3"; var index = suffix_start; if (std.mem.startsWith(u8, text[index..], variation_selector_16)) { index += variation_selector_16.len; } return std.mem.startsWith(u8, text[index..], combining_keycap);}
noinline fn runeWidth(codepoint: u21) usize { if (codepoint == 0) return 0; if (codepoint < 32 or (codepoint >= 0x7f and codepoint < 0xa0)) return 0; if (isZeroWidthContinuation(codepoint)) return 0; if (isInRanges(codepoint, unicode_data.wide_ranges[0..]) or isInRanges(codepoint, unicode_data.emoji_presentation_ranges[0..])) return 2; return 1;}
/// Returns whether width `w` at one-based `col` exceeds `cols` under DECAWM-OFF./// Requires non-zero inputs and widens arithmetic to avoid `u16` overflow.pub fn shouldWrapAt(col: u16, w: u16, cols: u16) bool { return @as(u32, col) + @as(u32, w) - 1 > @as(u32, cols);}
/// Returns the next fixed eight-column tab stop, clamped to the right margin./// Columns are one-based. Callers must provide non-zero `col` and `cols`.pub fn nextTabStopColumn(col: u16, cols: u16) u16 { std.debug.assert(col > 0); std.debug.assert(cols > 0); if (col >= cols) return cols;
const zero_based: u32 = @as(u32, col) - 1; const next_stop = ((zero_based / 8) + 1) * 8 + 1; return @intCast(@min(next_stop, @as(u32, cols)));}
pub noinline fn decodeNextRune(text: []const u8, index: usize) DecodedRune { if (index >= text.len) return .{ .len = 0, .codepoint = 0 }; const first = text[index]; if (first < 0x80) return .{ .len = 1, .codepoint = first };
const len = std.unicode.utf8ByteSequenceLength(first) catch return .{ .len = 1, .codepoint = 0xfffd }; if (index + len > text.len) return .{ .len = 1, .codepoint = 0xfffd };
const codepoint = std.unicode.utf8Decode(text[index .. index + len]) catch return .{ .len = 1, .codepoint = 0xfffd }; return .{ .len = len, .codepoint = codepoint };}
pub noinline fn ansiSequenceEnd(text: []const u8, index: usize) usize { if (index >= text.len or text[index] != 0x1b) return index; if (index + 1 >= text.len) return text.len;
const kind = text[index + 1]; if (kind == '[') { var i = index + 2; while (i < text.len) : (i += 1) { const b = text[i]; if (b >= '@' and b <= '~') return i + 1; } return text.len; }
if (kind == ']') { var i = index + 2; while (i < text.len) : (i += 1) { if (text[i] == 0x07) return i + 1; if (text[i] == 0x1b and i + 1 < text.len and text[i + 1] == '\\') return i + 2; } return text.len; }
return @min(index + 2, text.len);}
pub noinline fn previousRuneStart(text: []const u8, end: usize) usize { if (end == 0) return 0; var i = end - 1; while (i > 0 and (text[i] & 0b1100_0000) == 0b1000_0000) : (i -= 1) {} return i;}
pub noinline fn statusPrefixEnd(label: []const u8) usize { if (label.len == 0) return 0; const first = displayUnitAt(label, 0); if (first.byte_len == 0 or first.byte_len >= label.len) return 0; return if (label[first.byte_len] == ' ') first.byte_len + 1 else 0;}
pub noinline fn wrapCutIgnoringAnsi(text: []const u8, max_width: usize) []const u8 { const prefix = prefixByWidthIgnoringAnsi(text, max_width); if (prefix.len == text.len) return prefix;
var last_space: ?usize = null; var index: usize = 0; while (index < prefix.len) { const unit = displayUnitAt(prefix, index); if (prefix[index] == ' ' or prefix[index] == '\t') last_space = index; index += unit.byte_len; } if (last_space) |space_index| { if (space_index > 0) return text[0..space_index]; } return prefix;}
pub noinline fn trimBreakWhitespace(text: []const u8) []const u8 { var index: usize = 0; while (index < text.len and (text[index] == ' ' or text[index] == '\t')) : (index += 1) {} return text[index..];}
fn isCombining(codepoint: u21) bool { return (codepoint >= 0x0300 and codepoint <= 0x036f) or (codepoint >= 0x1ab0 and codepoint <= 0x1aff) or (codepoint >= 0x1dc0 and codepoint <= 0x1dff) or (codepoint >= 0x20d0 and codepoint <= 0x20ff) or (codepoint >= 0xfe20 and codepoint <= 0xfe2f) or (codepoint >= 0xfe00 and codepoint <= 0xfe0f);}
fn isZeroWidthContinuation(codepoint: u21) bool { return isCombining(codepoint) or isInRanges(codepoint, unicode_data.emoji_modifier_ranges[0..]) or codepoint == 0x200c or codepoint == 0x200d or (codepoint >= 0x200b and codepoint <= 0x200f) or (codepoint >= 0x202a and codepoint <= 0x202e) or (codepoint >= 0x2060 and codepoint <= 0x206f) or codepoint == 0xfeff or (codepoint >= 0xe0001 and codepoint <= 0xe007f) or (codepoint >= 0xe0100 and codepoint <= 0xe01ef);}
fn isInRanges(codepoint: u21, ranges: []const unicode_data.Range) bool { var low: usize = 0; var high = ranges.len; while (low < high) { const middle = low + (high - low) / 2; const range = ranges[middle]; if (codepoint < range.first) { high = middle; } else if (codepoint > range.last) { low = middle + 1; } else { return true; } } return false;}
fn matchRgiSequence(text: []const u8, index: usize) usize { var node_index: u32 = 0; var cursor = index; var longest: usize = 0; var depth: usize = 0;
while (cursor < text.len and depth < unicode_data.max_rgi_sequence_codepoints) : (depth += 1) { const rune = decodeNextRune(text, cursor); node_index = findTrieChild(node_index, rune.codepoint) orelse break; cursor += rune.len; const node = rgi_data.nodes[node_index]; if (node.terminal) longest = cursor - index; }
return longest;}
fn findTrieChild(node_index: u32, codepoint: u21) ?u32 { const node = rgi_data.nodes[node_index]; const edge_start: usize = node.edge_start; var low = edge_start; var high = edge_start + node.edge_len; while (low < high) { const middle = low + (high - low) / 2; const edge_codepoint = rgi_data.codepoints[rgi_data.edge_codepoint_ids[middle]]; if (codepoint < edge_codepoint) { high = middle; } else if (codepoint > edge_codepoint) { low = middle + 1; } else { return @intCast(middle + 1); } } return null;}
test "RGI runtime lookup data stays within the measured size budget" { try std.testing.expect(@sizeOf(RgiData) <= 22_272);}
test "prefixByWidth avoids cutting emoji bytes" { const text = "a\xf0\x9f\x98\x80b"; try std.testing.expectEqualStrings("a", prefixByWidth(text, 2)); try std.testing.expectEqualStrings("a\xf0\x9f\x98\x80", prefixByWidth(text, 3));}
test "suffixByWidth keeps whole runes" { try std.testing.expectEqualStrings("\xf0\x9f\x98\x80cd", suffixByWidth("ab\xf0\x9f\x98\x80cd", 4));}
test "visibleWidth counts emoji as two cells" { try std.testing.expectEqual(@as(usize, 4), visibleWidth("a\xf0\x9f\x98\x80b"));}
test "visibleWidthIgnoringAnsi skips CSI sequences" { try std.testing.expectEqual(@as(usize, 5), visibleWidthIgnoringAnsi("\x1b[1mhello\x1b[22m")); try std.testing.expectEqual(@as(usize, 3), visibleWidthIgnoringAnsi("\x1b[48;5;236mfoo\x1b[49m")); try std.testing.expectEqual(@as(usize, 7), visibleWidthIgnoringAnsi("\x1b[1mEnfoque\x1b[22m"));}
test "shouldWrapAt is strictly overflow-based" { try std.testing.expect(!shouldWrapAt(10, 1, 10)); try std.testing.expect(shouldWrapAt(10, 2, 10)); try std.testing.expect(!shouldWrapAt(1, 1, 1));
// Start at c = 2 so c - 1 stays >= 1; cols = 0 is excluded by the // helper precondition and guarded by current callers. var c: u16 = 2; while (c <= 256) : (c += 1) { try std.testing.expect(!shouldWrapAt(c, 1, c)); try std.testing.expect(shouldWrapAt(c, 1, c - 1)); }
try std.testing.expect(shouldWrapAt(65535, 2, 65535));}
test "nextTabStopColumn uses absolute stops and clamps safely" { try std.testing.expectEqual(@as(u16, 9), nextTabStopColumn(1, 80)); try std.testing.expectEqual(@as(u16, 9), nextTabStopColumn(8, 80)); try std.testing.expectEqual(@as(u16, 17), nextTabStopColumn(9, 80)); try std.testing.expectEqual(@as(u16, 8), nextTabStopColumn(1, 8)); try std.testing.expectEqual(@as(u16, 10), nextTabStopColumn(10, 10)); try std.testing.expectEqual(@as(u16, 10), nextTabStopColumn(11, 10)); try std.testing.expectEqual(@as(u16, 65535), nextTabStopColumn(65535, 65535));}
test "prefixByWidthIgnoringAnsi keeps opening OSC-8 attached to visible bytes" { // OSC-8 open does not consume any visible cells; the first two bytes of // the hyperlink body do. Budget of 2 keeps the open + 2 cells. const text = "\x1b]8;;file:///x\x1b\\ab\x1b]8;;\x1b\\"; const out = prefixByWidthIgnoringAnsi(text, 2); try std.testing.expectEqual(@as(usize, 2), visibleWidthIgnoringAnsi(out)); try std.testing.expect(std.mem.find(u8, out, "\x1b]8;;file:///x\x1b\\") != null);}
test "prefixByWidthIgnoringAnsi returns empty on zero budget" { try std.testing.expectEqualStrings("", prefixByWidthIgnoringAnsi("\x1b[31mhello\x1b[0m", 0));}
test "suffixByWidthIgnoringAnsi tolerates ANSI around multibyte runes" { const text = "a\x1b]8;;file:///\xc2\xa0.png\x1b\\[Image 1]\x1b]8;;\x1b\\"; const out = suffixByWidthIgnoringAnsi(text, 9); try std.testing.expectEqual(@as(usize, 9), visibleWidthIgnoringAnsi(out));}
test "suffixByWidthIgnoringAnsi returns full text when it fits" { const text = "\x1b[31mhi\x1b[0m"; try std.testing.expectEqualStrings(text, suffixByWidthIgnoringAnsi(text, 5));}
test "decodeNextRune advances through invalid UTF-8" { const text = "\xf0\x28\x8c\x28"; const first = decodeNextRune(text, 0); try std.testing.expectEqual(@as(usize, 1), first.len); try std.testing.expectEqual(@as(u21, 0xfffd), first.codepoint);
const second = decodeNextRune(text, first.len); try std.testing.expectEqual(@as(usize, 1), second.len); try std.testing.expectEqual(@as(u21, '('), second.codepoint);}
test "ansiSequenceEnd handles OSC terminated by ESC backslash" { const text = "\x1b]8;;file:///x\x1b\\body"; try std.testing.expectEqual(@as(usize, 16), ansiSequenceEnd(text, 0)); try std.testing.expectEqual(@as(usize, 4), visibleWidthIgnoringAnsi(text));}
test "runeWidth preserves current width table semantics" { try std.testing.expectEqual(@as(usize, 0), runeWidth(0)); try std.testing.expectEqual(@as(usize, 0), runeWidth(0x07)); try std.testing.expectEqual(@as(usize, 0), runeWidth(0x1b)); try std.testing.expectEqual(@as(usize, 0), runeWidth(0x80)); try std.testing.expectEqual(@as(usize, 0), runeWidth(0x9f)); try std.testing.expectEqual(@as(usize, 0), runeWidth(0x0301)); try std.testing.expectEqual(@as(usize, 0), runeWidth(0x1ab0)); try std.testing.expectEqual(@as(usize, 2), runeWidth(0x4e00)); try std.testing.expectEqual(@as(usize, 2), runeWidth(0x1f600)); try std.testing.expectEqual(@as(usize, 1), runeWidth(0xff66)); try std.testing.expectEqual(@as(usize, 1), runeWidth('a')); try std.testing.expectEqual(@as(usize, 1), runeWidth(' ')); try std.testing.expectEqual(@as(usize, 0), runeWidth(0x09));}
test "decodeNextRune preserves boundary and invalid-byte behavior" { try std.testing.expectEqual(DecodedRune{ .len = 0, .codepoint = 0 }, decodeNextRune("", 0)); try std.testing.expectEqual(DecodedRune{ .len = 0, .codepoint = 0 }, decodeNextRune("a", 1)); try std.testing.expectEqual(DecodedRune{ .len = 1, .codepoint = 0xfffd }, decodeNextRune("\xff", 0)); try std.testing.expectEqual(DecodedRune{ .len = 1, .codepoint = 0xfffd }, decodeNextRune("\xf0", 0)); try std.testing.expectEqual(DecodedRune{ .len = 1, .codepoint = 0xfffd }, decodeNextRune("\xc0\x80", 0));}
test "ansiSequenceEnd preserves current CSI OSC and ESC boundaries" { try std.testing.expectEqual(@as(usize, 3), ansiSequenceEnd("\x1b[m", 0)); try std.testing.expectEqual(@as(usize, 7), ansiSequenceEnd("\x1b[1;31m", 0)); try std.testing.expectEqual(@as(usize, 3), ansiSequenceEnd("\x1b[K", 0));
const unterminated_csi = "\x1b["; try std.testing.expectEqual(unterminated_csi.len, ansiSequenceEnd(unterminated_csi, 0));
try std.testing.expectEqual(@as(usize, 9), ansiSequenceEnd("\x1b]8;;url\x07", 0)); try std.testing.expectEqual(@as(usize, 10), ansiSequenceEnd("\x1b]8;;url\x1b\\", 0));
const unterminated_osc = "\x1b]8;;url"; try std.testing.expectEqual(unterminated_osc.len, ansiSequenceEnd(unterminated_osc, 0));
try std.testing.expectEqual(@as(usize, 2), ansiSequenceEnd("\x1bA", 0));
const bare_escape = "\x1b"; try std.testing.expectEqual(bare_escape.len, ansiSequenceEnd(bare_escape, 0));}
test "previousRuneStart preserves byte-boundary behavior" { try std.testing.expectEqual(@as(usize, 4), previousRuneStart("hello", 5)); try std.testing.expectEqual(@as(usize, 1), previousRuneStart("a\xf0\x9f\x98\x80b", 5)); try std.testing.expectEqual(@as(usize, 0), previousRuneStart("", 0)); try std.testing.expectEqual(@as(usize, 0), previousRuneStart("a", 1));}
test "prefixByWidth and suffixByWidth preserve boundary behavior" { try std.testing.expectEqualStrings("", prefixByWidth("ab", 0)); try std.testing.expectEqualStrings("a", prefixByWidth("ab", 1)); try std.testing.expectEqualStrings("ab", prefixByWidth("ab", 2)); try std.testing.expectEqualStrings("ab", prefixByWidth("ab", 100));
const suffix_zero = suffixByWidth("ab", 0); try std.testing.expectEqual(@as(usize, 0), suffix_zero.len); try std.testing.expectEqualStrings("b", suffixByWidth("ab", 1)); try std.testing.expectEqualStrings("\xf0\x9f\x98\x80b", suffixByWidth("a\xf0\x9f\x98\x80b", 3));}
test "shouldWrapAt preserves documented edge behavior" { try std.testing.expect(shouldWrapAt(1, 2, 1)); try std.testing.expect(!shouldWrapAt(1, 1, 80)); try std.testing.expect(!shouldWrapAt(80, 1, 80)); try std.testing.expect(shouldWrapAt(80, 2, 80));}
test "statusPrefixEnd detects a leading status rune and space" { try std.testing.expectEqual(@as(usize, 4), statusPrefixEnd("▲ error")); try std.testing.expectEqual(@as(usize, 2), statusPrefixEnd("x error")); try std.testing.expectEqual(@as(usize, 0), statusPrefixEnd("error text")); try std.testing.expectEqual(@as(usize, 0), statusPrefixEnd("▲")); try std.testing.expectEqual(@as(usize, 0), statusPrefixEnd(""));}
test "wrapCutIgnoringAnsi prefers the last space inside the budget" { try std.testing.expectEqualStrings("aaaa bbbb", wrapCutIgnoringAnsi("aaaa bbbb cccc", 10)); try std.testing.expectEqualStrings("aaaaa", wrapCutIgnoringAnsi("aaaaabbbbbcc", 5)); try std.testing.expectEqualStrings(" a", wrapCutIgnoringAnsi(" abcd", 2)); try std.testing.expectEqualStrings("aaaa bbbb cccc", wrapCutIgnoringAnsi("aaaa bbbb cccc", 20)); try std.testing.expectEqualStrings("\x1b[31maaaa", wrapCutIgnoringAnsi("\x1b[31maaaa bbbb\x1b[0m", 6));}
test "trimBreakWhitespace strips leading spaces and tabs" { try std.testing.expectEqualStrings("abc", trimBreakWhitespace(" \t abc")); try std.testing.expectEqualStrings("abc ", trimBreakWhitespace("abc ")); try std.testing.expectEqualStrings("", trimBreakWhitespace(" "));}
test "widestFitting picks the first variant that fits and falls back to the last" { const variants = [_][]const u8{ "long variant here", "medium one", "short" }; try std.testing.expectEqualStrings("long variant here", widestFitting(&variants, 40)); try std.testing.expectEqualStrings("long variant here", widestFitting(&variants, 17)); try std.testing.expectEqualStrings("medium one", widestFitting(&variants, 16)); try std.testing.expectEqualStrings("short", widestFitting(&variants, 9)); try std.testing.expectEqualStrings("short", widestFitting(&variants, 2)); const wide = [_][]const u8{ "漢漢漢", "漢" }; try std.testing.expectEqualStrings("漢", widestFitting(&wide, 5));}
test "display unit widths cover presentation and RGI sequences" { const Case = struct { text: []const u8, width: usize, }; const cases = [_]Case{ .{ .text = "A", .width = 1 }, .{ .text = "\u{754C}", .width = 2 }, .{ .text = "a\u{0301}", .width = 1 }, .{ .text = "\xff", .width = 1 }, .{ .text = "\u{2705}", .width = 2 }, .{ .text = "\u{274C}", .width = 2 }, .{ .text = "\u{2600}\u{FE0E}", .width = 1 }, .{ .text = "\u{231A}\u{FE0E}", .width = 2 }, .{ .text = "\u{26A1}\u{FE0E}", .width = 2 }, .{ .text = "\u{2600}\u{FE0F}", .width = 2 }, .{ .text = "\u{1F44D}\u{1F3FD}", .width = 2 }, .{ .text = "\u{1F1FA}\u{1F1F8}", .width = 2 }, .{ .text = "#\u{FE0F}\u{20E3}", .width = 2 }, .{ .text = "\u{1F3F4}\u{E0067}\u{E0062}\u{E0065}\u{E006E}\u{E0067}\u{E007F}", .width = 2 }, .{ .text = "\u{1F469}\u{200D}\u{1F4BB}", .width = 2 }, };
for (cases) |case| { try std.testing.expectEqual(case.width, visibleWidth(case.text)); }}
test "display unit scanner returns exact sequence byte spans" { const Case = struct { text: []const u8, cell_width: usize, }; const cases = [_]Case{ .{ .text = "A", .cell_width = 1 }, .{ .text = "\u{754C}", .cell_width = 2 }, .{ .text = "\xff", .cell_width = 1 }, .{ .text = "\u{2705}", .cell_width = 2 }, .{ .text = "\u{2600}\u{FE0E}", .cell_width = 1 }, .{ .text = "\u{231A}\u{FE0E}", .cell_width = 2 }, .{ .text = "\u{26A1}\u{FE0E}", .cell_width = 2 }, .{ .text = "\u{2600}\u{FE0F}", .cell_width = 2 }, .{ .text = "\u{1F44D}\u{1F3FD}", .cell_width = 2 }, .{ .text = "\u{1F1FA}\u{1F1F8}", .cell_width = 2 }, .{ .text = "#\u{FE0F}\u{20E3}", .cell_width = 2 }, .{ .text = "\u{1F3F4}\u{E0067}\u{E0062}\u{E0065}\u{E006E}\u{E0067}\u{E007F}", .cell_width = 2 }, .{ .text = "\u{1F469}\u{200D}\u{1F4BB}", .cell_width = 2 }, };
for (cases) |case| { try std.testing.expectEqual( DisplayUnit{ .byte_len = case.text.len, .cell_width = case.cell_width }, displayUnitAt(case.text, 0), ); }
try std.testing.expectEqual( DisplayUnit{ .byte_len = 0, .cell_width = 0 }, displayUnitAt("", 0), );}
test "display unit scanner rejects sequence lookalikes" { const stray_selector = "A\u{FE0F}"; try std.testing.expectEqual( DisplayUnit{ .byte_len = 1, .cell_width = 1 }, displayUnitAt(stray_selector, 0), ); try std.testing.expectEqual(@as(usize, 1), visibleWidth(stray_selector));
const invalid_flag = "\u{1F1E6}\u{1F1E6}"; try std.testing.expectEqual(@as(usize, 4), visibleWidth(invalid_flag)); try std.testing.expectEqual(@as(usize, 4), displayUnitAt(invalid_flag, 0).byte_len);
const incomplete_keycap = "#\u{20E3}"; try std.testing.expectEqual(@as(usize, 1), displayUnitAt(incomplete_keycap, 0).byte_len); try std.testing.expectEqual(@as(usize, 1), visibleWidth(incomplete_keycap));
const incomplete_tag = "\u{1F3F4}\u{E0067}\u{E0062}\u{E0065}\u{E006E}\u{E0067}"; try std.testing.expectEqual(@as(usize, 4), displayUnitAt(incomplete_tag, 0).byte_len);
const invalid_zwj = "\u{1F469}\u{200D}A"; try std.testing.expectEqual(@as(usize, 4), displayUnitAt(invalid_zwj, 0).byte_len); try std.testing.expectEqual(@as(usize, 3), visibleWidth(invalid_zwj));}
test "ordinary ascii keycap candidates stay on the single-byte path" { const text = "0123456789#*"; for (text, 0..) |_, index| { try std.testing.expectEqual( DisplayUnit{ .byte_len = 1, .cell_width = 1 }, displayUnitAt(text, index), ); }}
test "display unit clipping preserves sequence boundaries" { const sequence = "\u{1F44D}\u{1F3FD}"; const text = "a" ++ sequence ++ "b"; try std.testing.expectEqualStrings("a", prefixByWidth(text, 2)); try std.testing.expectEqualStrings("a" ++ sequence, prefixByWidth(text, 3)); try std.testing.expectEqualStrings("b", suffixByWidth(text, 1)); try std.testing.expectEqualStrings(sequence ++ "b", suffixByWidth(text, 3));
const styled = "\x1b[31m" ++ sequence ++ "\x1b[0m"; try std.testing.expectEqualStrings(styled, prefixByWidthIgnoringAnsi(styled, 2)); try std.testing.expectEqualStrings(styled, suffixByWidthIgnoringAnsi(styled, 2)); try std.testing.expectEqual(sequence.len + 1, statusPrefixEnd(sequence ++ " active"));}
test "fuzz display unit boundaries" { try std.testing.fuzz({}, fuzzDisplayUnitBoundaries, .{ .corpus = &.{ "", "plain text", "\xff\xf0\x28\x8c\x28", "\u{2600}\u{FE0E}\u{2600}\u{FE0F}", "\u{1F44D}\u{1F3FD}\u{1F1FA}\u{1F1F8}", "#\u{FE0F}\u{20E3}\u{1F469}\u{200D}\u{1F4BB}", }, });}
fn fuzzDisplayUnitBoundaries(_: void, smith: *std.testing.Smith) !void { var buffer: [256]u8 = undefined; const len: usize = @intCast(smith.slice(&buffer)); const text = buffer[0..len];
var expected_width: usize = 0; var index: usize = 0; while (index < text.len) { const unit = displayUnitAt(text, index); try std.testing.expect(unit.byte_len > 0); try std.testing.expect(unit.byte_len <= text.len - index); try std.testing.expect(unit.cell_width <= 2); try std.testing.expectEqual(unit, displayUnitAt(text, index)); expected_width +|= unit.cell_width; index += unit.byte_len; } try std.testing.expectEqual(text.len, index); try std.testing.expectEqual(expected_width, visibleWidth(text));
const budgets = [_]usize{ 0, @min(expected_width / 2, 16), @min(expected_width +| 2, 16), }; for (budgets) |budget| { const prefix = prefixByWidth(text, budget); const suffix = suffixByWidth(text, budget); try std.testing.expect(isDisplayUnitBoundary(text, prefix.len)); try std.testing.expect(isDisplayUnitBoundary(text, text.len - suffix.len)); try std.testing.expect(visibleWidth(prefix) <= budget); try std.testing.expect(visibleWidth(suffix) <= budget); }}
fn isDisplayUnitBoundary(text: []const u8, target: usize) bool { if (target > text.len) return false; var index: usize = 0; while (index < target) { const unit = displayUnitAt(text, index); if (unit.byte_len == 0 or unit.byte_len > target - index) return false; index += unit.byte_len; } return index == target;}