Messages.messageLog is Messages.at: the ring's i-th record, read as p.messages.at(i)

The rename deferred from the file split; no behaviour changes. Output.zig's one call follows.

Co-Authored-By: Claude Opus 5.5 <[email protected]>

1 files changed, 12 insertions, 12 deletions

diff --git a/src/Messages.zig b/src/Messages.zig
index 42200863..7dcb22ed 100644
--- a/src/Messages.zig
+++ b/src/Messages.zig
@@ -51,13 +51,13 @@ pub const LoggedMessage = struct {
 fn leaderText(p: *const Pardes, buf: *[16]u8) []const u8 {
     buf.* = @splat(' ');
     @memcpy(buf[0..3], "SPC");
-    var at: usize = 3;
+    var end: usize = 3;
     for (p.leader_keys[0..p.leader_n]) |ch| {
-        if (at + 2 > buf.len) break;
-        buf[at + 1] = ch;
-        at += 2;
+        if (end + 2 > buf.len) break;
+        buf[end + 1] = ch;
+        end += 2;
     }
-    return buf[0..at];
+    return buf[0..end];
 }
 
 /// How wide a notice chip is, in grid columns: its own text plus a blank
@@ -437,7 +437,7 @@ fn logMessage(p: *Pardes, id: usize, text: []const u8) void {
 }
 
 /// The log oldest-first, which is reading order.
-pub fn messageLog(m: *const Messages, i: usize) ?*const LoggedMessage {
+pub fn at(m: *const Messages, i: usize) ?*const LoggedMessage {
     if (i >= m.len) return null;
     const first = (m.head + limits.message_log - m.len) % limits.message_log;
     return &m.log[(first + i) % limits.message_log];
@@ -580,13 +580,13 @@ test "the message log keeps what the row forgets, and collapses repeats" {
     setMessage(p, 0, "save: AccessDenied");
 
     try std.testing.expectEqual(@as(usize, 2), p.messages.len);
-    const first = p.messages.messageLog(0).?;
+    const first = p.messages.at(0).?;
     try std.testing.expectEqual(@as(u16, 2), first.repeats);
     // ...and the NEWEST wording is what survives, so the row carries the last
     // time it happened rather than the first.
     try std.testing.expectEqualStrings("14:32:09  saved /x.zig", first.slice());
-    try std.testing.expectEqualStrings("save: AccessDenied", p.messages.messageLog(1).?.slice());
-    try std.testing.expect(p.messages.messageLog(2) == null);
+    try std.testing.expectEqualStrings("save: AccessDenied", p.messages.at(1).?.slice());
+    try std.testing.expect(p.messages.at(2) == null);
 
     // The same text from a DIFFERENT pane is a different event: one pane's
     // failure must not be recorded as another's.
@@ -594,7 +594,7 @@ test "the message log keeps what the row forgets, and collapses repeats" {
     const other = p.active;
     setMessage(p, other, "save: AccessDenied");
     try std.testing.expectEqual(@as(usize, 3), p.messages.len);
-    try std.testing.expectEqual(p.panes[other].?.serial, p.messages.messageLog(2).?.serial);
+    try std.testing.expectEqual(p.panes[other].?.serial, p.messages.at(2).?.serial);
 
     // Progress is NOT logged: it arrives several times a second for a whole
     // index and would push everything else out (`setStatus`).
@@ -607,10 +607,10 @@ test "the message log keeps what the row forgets, and collapses repeats" {
         setMessage(p, 0, std.fmt.bufPrint(&buf, "line {d}", .{i}) catch unreachable);
     }
     try std.testing.expectEqual(@as(usize, limits.message_log), p.messages.len);
-    try std.testing.expectEqualStrings("line 5", p.messages.messageLog(0).?.slice());
+    try std.testing.expectEqualStrings("line 5", p.messages.at(0).?.slice());
     var last_buf: [32]u8 = undefined;
     const want_last = std.fmt.bufPrint(&last_buf, "line {d}", .{limits.message_log + 4}) catch unreachable;
-    try std.testing.expectEqualStrings(want_last, p.messages.messageLog(limits.message_log - 1).?.slice());
+    try std.testing.expectEqualStrings(want_last, p.messages.at(limits.message_log - 1).?.slice());
 }
 
 test "Msg writes the transient row by hand, bare or with text, and input ends it" {