✓
Passing This code compiles and runs correctly.
Code
// PINS the grid's READ where it is not a write block's value: in a guard, in
// an interpolation, under a loop, and with a loop binding as the index.
//
// The declaration owns a whole-program read pass, the mirror of the one
// `std/store:new` runs for singleton cell paths. Before it, `stored`'s value
// was the ONLY position a `<grid>[<i>].<field>` lowered, so `if(cells[3].on ==
// 6)` compiled to a Zig undeclared identifier — which meant no grid program
// could branch on what a cell holds, which is most of what a table is for. The
// prime sieve's primality guard and day 06's clamped decrement are the two real
// programs that could not be written; this is the small one that says why.
//
// FOUR POSITIONS, and the third is the one that got away:
// (1) a top-level guard;
// (2) an interpolation inside a string — masked, so only text between `{{ }}`
// is treated as an expression and prose is left alone;
// (3) a guard UNDER A LOOP, which is a different code path and not obviously
// so: `if`/`for` bake their Expression argument into
// `Invocation.inline_body` at template-expansion time, BEFORE any
// declaration's pass runs, so rewriting `inv.args` alone updates a copy
// nobody emits. store.kz has carried a comment about this since 690_074
// and it was still worth an hour to rediscover — (1) and (2) were green
// while (3) was broken;
// (4) a WRITE whose index and value are both the loop's binding, which is the
// operand-threading half: a write unit with no inputs cannot see `i`, so
// the index and value are evaluated at the site and passed in.
//
// The oracle is arithmetic that could not come out right by accident: cell 3
// holds 3*2=6 from the loop, and 6 is only reachable if the write saw the
// binding and the read saw the write.
import std/io
import std/store
import std/grid
std/grid:new(cells, size: 8) { on: 0[i64] }
std/store:new(acc) { n: 0[i64] }
for(0..4)
! each i |> std/grid:stored { cells[i].on: @as(i64, @intCast(i)) * 2 }
| done |> if(cells[3].on == 6)
| then |> std/io:print.ln("under-loop guard sees the write")
| else |> std/io:print.ln("BAD under-loop guard")
if(cells[2].on == 4)
| then |> std/io:print.ln("top-level guard ok")
| else |> std/io:print.ln("BAD top-level guard")
// cells[1] in the prose is NOT an expression; the interpolated one is.
std/io:print.ln("cells[1].on reads {{ cells[1].on:d }}")
std/grid:sweep(cells)
! sweep c when c.on > 0 |> std/store:stored { acc.n: acc.n + c.on }
std/io:print.ln("sum {{ acc.n:d }}")
Actual
under-loop guard sees the write
top-level guard ok
cells[1].on reads 2
sum 12
Expected output
✓ Zig✓ JavaScriptunder-loop guard sees the write
top-level guard ok
cells[1].on reads 2
sum 12
Emitted Zig source
// Access compiler flags via the per-user compiler_env module
const CompilerEnv = @import("compiler_env").CompilerEnv;
pub const panic = if (@import("builtin").mode == .Debug)
@import("std").debug.FullPanic(@import("std").debug.defaultPanic)
else
@import("std").debug.simple_panic;
const __koru_bare = struct {
extern fn posix_memalign(memptr: *?*anyopaque, alignment: usize, size: usize) c_int;
extern fn free(ptr: ?*anyopaque) void;
fn bareAlloc(_: *anyopaque, len: usize, alignment: @import("std").mem.Alignment, _: usize) ?[*]u8 {
var p: ?*anyopaque = null;
const a = @max(alignment.toByteUnits(), @sizeOf(usize));
if (posix_memalign(&p, a, len) != 0) return null;
return @ptrCast(p);
}
fn bareResize(_: *anyopaque, _: []u8, _: @import("std").mem.Alignment, _: usize, _: usize) bool { return false; }
fn bareRemap(_: *anyopaque, _: []u8, _: @import("std").mem.Alignment, _: usize, _: usize) ?[*]u8 { return null; }
fn bareFree(_: *anyopaque, memory: []u8, _: @import("std").mem.Alignment, _: usize) void { free(@ptrCast(memory.ptr)); }
const vtable = @import("std").mem.Allocator.VTable{ .alloc = bareAlloc, .resize = bareResize, .remap = bareRemap, .free = bareFree };
const allocator = @import("std").mem.Allocator{ .ptr = undefined, .vtable = &vtable };
};
const __koru_backing = if (@import("builtin").link_libc) @import("std").heap.c_allocator else if (@import("builtin").os.tag == .freestanding and !@import("builtin").cpu.arch.isWasm()) __koru_bare.allocator else @import("std").heap.page_allocator;
const __koru_leak_mode = false;
var __koru_gpa: @import("std").heap.DebugAllocator(.{ .stack_trace_frames = 16 }) = .init;
fn __koruBacking() @import("std").mem.Allocator {
if (comptime __koru_leak_mode) return __koru_gpa.allocator();
return __koru_backing;
}
var __koru_leak_watch_started: @import("std").atomic.Value(bool) = .init(false);
fn __koru_leak_watch_maybe_start() void {
if (comptime !__koru_leak_mode) return;
if (__koru_leak_watch_started.swap(true, .acq_rel)) return;
_ = @import("std").Thread.spawn(.{}, __koru_leak_watch, .{}) catch {};
}
fn __koru_leak_watch() void {
var tick: usize = 0;
while (true) : (tick += 1) {
@import("std").Thread.sleep(5 * @import("std").time.ns_per_s);
@import("std").debug.print("[koru-leak] outstanding allocs: {}\n", .{__koru_leak_count.load(.acquire)});
if (tick % 12 == 11) {
@import("std").debug.print("[koru-leak] GPA scan — sites still holding allocs:\n", .{});
_ = __koru_gpa.detectLeaks();
}
}
}
var __koru_leak_count: @import("std").atomic.Value(usize) = .init(0);
var __koru_par_tasks: @import("std").atomic.Value(usize) = .init(0);
const __koru_par_CAP: usize = 128;
threadlocal var __koru_par_depth: usize = 0;
const __koru_par_DEPTH_CAP: usize = 7;
var __koru_par_pool: @import("std").Thread.Pool = undefined;
var __koru_par_pool_ready: bool = false;
var __koru_par_pool_mtx: @import("std").Thread.Mutex = .{};
fn __koru_par_pool_ensure() *@import("std").Thread.Pool {
__koru_par_pool_mtx.lock();
defer __koru_par_pool_mtx.unlock();
if (!__koru_par_pool_ready) {
@import("std").Thread.Pool.init(&__koru_par_pool, .{ .allocator = @import("std").heap.smp_allocator }) catch @panic("koru: thread pool init failed");
__koru_par_pool_ready = true;
}
return &__koru_par_pool;
}
fn __koru_alloc(ctx: *anyopaque, len: usize, alignment: @import("std").mem.Alignment, ret_addr: usize) ?[*]u8 {
_ = ctx;
__koru_leak_watch_maybe_start();
const r = __koruBacking().rawAlloc(len, alignment, ret_addr);
if (comptime @import("builtin").mode == .Debug or __koru_leak_mode) {
if (r != null) _ = __koru_leak_count.fetchAdd(1, .monotonic);
}
return r;
}
fn __koru_resize(ctx: *anyopaque, memory: []u8, alignment: @import("std").mem.Alignment, new_len: usize, ret_addr: usize) bool {
_ = ctx;
return __koruBacking().rawResize(memory, alignment, new_len, ret_addr);
}
fn __koru_remap(ctx: *anyopaque, memory: []u8, alignment: @import("std").mem.Alignment, new_len: usize, ret_addr: usize) ?[*]u8 {
_ = ctx;
return __koruBacking().rawRemap(memory, alignment, new_len, ret_addr);
}
fn __koru_free(ctx: *anyopaque, memory: []u8, alignment: @import("std").mem.Alignment, ret_addr: usize) void {
_ = ctx;
__koruBacking().rawFree(memory, alignment, ret_addr);
if (comptime @import("builtin").mode == .Debug or __koru_leak_mode) {
_ = __koru_leak_count.fetchSub(1, .monotonic);
}
}
const __koru_vtable = @import("std").mem.Allocator.VTable{ .alloc = __koru_alloc, .resize = __koru_resize, .remap = __koru_remap, .free = __koru_free };
pub fn koru_allocator() @import("std").mem.Allocator {
return .{ .ptr = undefined, .vtable = &__koru_vtable };
}
pub inline fn __koru_intcast(comptime T: type, x: anytype) T {
if (comptime (@import("builtin").mode == .Debug or @import("builtin").mode == .ReleaseSafe))
return @as(T, @intCast(x));
const dst = @typeInfo(T);
const src = @typeInfo(@TypeOf(x));
if (comptime (dst == .int and src == .int and dst.int.bits == src.int.bits and dst.int.signedness != src.int.signedness))
return @as(T, @bitCast(x));
return @as(T, @intCast(x));
}
fn __KoruPadI(comptime T: type) type {
const V = switch (@typeInfo(T)) { .comptime_int => i64, .comptime_float => f64, else => T };
return struct {
v: V,
width: usize,
pub fn format(self: @This(), w: *@import("std").Io.Writer) @import("std").Io.Writer.Error!void {
const rendered = @import("std").fmt.count("{d}", .{self.v});
const pad = self.width -| rendered;
for (0..pad) |_| try w.writeByte(' ');
try w.print("{d}", .{self.v});
}
};
}
pub fn __koru_pad_i(width: usize, value: anytype) __KoruPadI(@TypeOf(value)) {
return .{ .v = value, .width = width };
}
pub fn koru_leak_check() void {
if (comptime @import("builtin").mode != .Debug) return;
if (__koru_leak_count.load(.acquire) == 0) return;
if (comptime @import("builtin").target.os.tag == .freestanding) {
if (comptime @import("builtin").cpu.arch == .wasm32 or @import("builtin").cpu.arch == .wasm64) {
@panic("KORU LEAK CHECK FAILED: the produced program leaked");
} else {
const __klc = struct { extern var stdout: ?*anyopaque; extern fn fputs(__s: [*:0]const u8, __st: ?*anyopaque) c_int; };
var __lb: [128]u8 = undefined;
const __lm = "KORU LEAK CHECK FAILED: allocations still outstanding at end of run: ";
@memcpy(__lb[0..__lm.len], __lm);
var __ln: usize = __lm.len;
var __lv = __koru_leak_count.load(.acquire);
var __ld: [20]u8 = undefined;
var __lk: usize = 0;
while (__lv > 0) : (__lk += 1) { __ld[__lk] = @intCast('0' + __lv % 10); __lv /= 10; }
for (0..__lk) |__li| { __lb[__ln] = __ld[__lk - 1 - __li]; __ln += 1; }
__lb[__ln] = '\n'; __ln += 1; __lb[__ln] = 0;
_ = __klc.fputs(@as([*:0]const u8, @ptrCast(&__lb)), __klc.stdout);
@trap();
}
} else {
@import("std").debug.print("KORU LEAK CHECK FAILED: the produced program leaked (trace above)\n", .{});
@import("std").process.exit(1);
}
}
pub const main_module = struct {
const __KoruGridT_cells = struct {
on: [8]i64 = [_]i64{0} ** 8,
const __koru_size: usize = 8;
fn __koru_wide(v: anytype) i64 {
return if (@TypeOf(v) == comptime_int) v else @intCast(v);
}
fn __koru_at(i_raw: anytype) usize {
const i = __koru_wide(i_raw);
if (i < 0 or @as(usize, @intCast(i)) >= 8) @panic("std/grid: index out of range for grid 'cells' (size 8) - a grid is addressed by position, and wrapping is the program's to write as `% 8`");
return @as(usize, @intCast(i));
}
};
var __koru_grid_cells: __KoruGridT_cells = .{};
// std/store: 'acc' created (cell + write-subflow at module scope); fields n: i64
// >>> FLOW: tests/regression/600_STDLIB/697_GRID/697_005_grid_read_outside_a_write_block/input.k:38 ~std.control:for()
pub fn flow0() void {
for (0..4) |__koru_item1| {
{ const i = __koru_item1; _ = &i; _ = main_module.__grid_write_L39_baa6_event.handler(.{ .__koru_gwx0 = main_module.__KoruGridT_cells.__koru_wide(i), .__koru_gwv0 = __koru_intcast(i64, i) * 2 });
}
}
{
if ((&main_module.__koru_grid_cells.on)[main_module.__KoruGridT_cells.__koru_at(3)] == 6) {
{ (struct { fn __kout(__fd: i32, __b: []const u8) void { if (@import("builtin").os.tag == .freestanding) { const __kc = struct { extern var stdout: ?*anyopaque; extern var stderr: ?*anyopaque; extern fn fputs(__s: [*:0]const u8, __st: ?*anyopaque) c_int; }; var __kt: [4096]u8 = undefined; for (0..(__b.len + __kt.len - 2) / (__kt.len - 1)) |__ki| { const __kn = @min(__kt.len - 1, __b.len - __ki * (__kt.len - 1)); @memcpy(__kt[0..__kn], __b[__ki * (__kt.len - 1)..][0..__kn]); __kt[__kn] = 0; @import("std").mem.doNotOptimizeAway(__kc.fputs(@as([*:0]const u8, @ptrCast(&__kt)), if (__fd == 2) __kc.stderr else __kc.stdout)); } } else { @import("std").mem.doNotOptimizeAway(@import("std").posix.write(__fd, __b) catch @as(usize, 0)); } } fn __kw(comptime __f: []const u8, __a: anytype) void { var __kb: [65536]u8 = undefined; const __ks = @import("std").fmt.bufPrint(&__kb, __f, __a) catch __kb[0..0]; __kout(1, __ks); } }).__kw("under-loop guard sees the write\n", .{});
}
} else {
{ (struct { fn __kout(__fd: i32, __b: []const u8) void { if (@import("builtin").os.tag == .freestanding) { const __kc = struct { extern var stdout: ?*anyopaque; extern var stderr: ?*anyopaque; extern fn fputs(__s: [*:0]const u8, __st: ?*anyopaque) c_int; }; var __kt: [4096]u8 = undefined; for (0..(__b.len + __kt.len - 2) / (__kt.len - 1)) |__ki| { const __kn = @min(__kt.len - 1, __b.len - __ki * (__kt.len - 1)); @memcpy(__kt[0..__kn], __b[__ki * (__kt.len - 1)..][0..__kn]); __kt[__kn] = 0; @import("std").mem.doNotOptimizeAway(__kc.fputs(@as([*:0]const u8, @ptrCast(&__kt)), if (__fd == 2) __kc.stderr else __kc.stdout)); } } else { @import("std").mem.doNotOptimizeAway(@import("std").posix.write(__fd, __b) catch @as(usize, 0)); } } fn __kw(comptime __f: []const u8, __a: anytype) void { var __kb: [65536]u8 = undefined; const __ks = @import("std").fmt.bufPrint(&__kb, __f, __a) catch __kb[0..0]; __kout(1, __ks); } }).__kw("BAD under-loop guard\n", .{});
}
}
}
}
// >>> FLOW: tests/regression/600_STDLIB/697_GRID/697_005_grid_read_outside_a_write_block/input.k:44 ~std.control:if()
pub fn flow1() void {
if ((&main_module.__koru_grid_cells.on)[main_module.__KoruGridT_cells.__koru_at(2)] == 4) {
{ (struct { fn __kout(__fd: i32, __b: []const u8) void { if (@import("builtin").os.tag == .freestanding) { const __kc = struct { extern var stdout: ?*anyopaque; extern var stderr: ?*anyopaque; extern fn fputs(__s: [*:0]const u8, __st: ?*anyopaque) c_int; }; var __kt: [4096]u8 = undefined; for (0..(__b.len + __kt.len - 2) / (__kt.len - 1)) |__ki| { const __kn = @min(__kt.len - 1, __b.len - __ki * (__kt.len - 1)); @memcpy(__kt[0..__kn], __b[__ki * (__kt.len - 1)..][0..__kn]); __kt[__kn] = 0; @import("std").mem.doNotOptimizeAway(__kc.fputs(@as([*:0]const u8, @ptrCast(&__kt)), if (__fd == 2) __kc.stderr else __kc.stdout)); } } else { @import("std").mem.doNotOptimizeAway(@import("std").posix.write(__fd, __b) catch @as(usize, 0)); } } fn __kw(comptime __f: []const u8, __a: anytype) void { var __kb: [65536]u8 = undefined; const __ks = @import("std").fmt.bufPrint(&__kb, __f, __a) catch __kb[0..0]; __kout(1, __ks); } }).__kw("top-level guard ok\n", .{});
}
} else {
{ (struct { fn __kout(__fd: i32, __b: []const u8) void { if (@import("builtin").os.tag == .freestanding) { const __kc = struct { extern var stdout: ?*anyopaque; extern var stderr: ?*anyopaque; extern fn fputs(__s: [*:0]const u8, __st: ?*anyopaque) c_int; }; var __kt: [4096]u8 = undefined; for (0..(__b.len + __kt.len - 2) / (__kt.len - 1)) |__ki| { const __kn = @min(__kt.len - 1, __b.len - __ki * (__kt.len - 1)); @memcpy(__kt[0..__kn], __b[__ki * (__kt.len - 1)..][0..__kn]); __kt[__kn] = 0; @import("std").mem.doNotOptimizeAway(__kc.fputs(@as([*:0]const u8, @ptrCast(&__kt)), if (__fd == 2) __kc.stderr else __kc.stdout)); } } else { @import("std").mem.doNotOptimizeAway(@import("std").posix.write(__fd, __b) catch @as(usize, 0)); } } fn __kw(comptime __f: []const u8, __a: anytype) void { var __kb: [65536]u8 = undefined; const __ks = @import("std").fmt.bufPrint(&__kb, __f, __a) catch __kb[0..0]; __kout(1, __ks); } }).__kw("BAD top-level guard\n", .{});
}
}
}
// >>> FLOW: tests/regression/600_STDLIB/697_GRID/697_005_grid_read_outside_a_write_block/input.k:49 ~std.io:print.impl()
pub fn flow2() void {
(struct { fn __kout(__fd: i32, __b: []const u8) void { if (@import("builtin").os.tag == .freestanding) { const __kc = struct { extern var stdout: ?*anyopaque; extern var stderr: ?*anyopaque; extern fn fputs(__s: [*:0]const u8, __st: ?*anyopaque) c_int; }; var __kt: [4096]u8 = undefined; for (0..(__b.len + __kt.len - 2) / (__kt.len - 1)) |__ki| { const __kn = @min(__kt.len - 1, __b.len - __ki * (__kt.len - 1)); @memcpy(__kt[0..__kn], __b[__ki * (__kt.len - 1)..][0..__kn]); __kt[__kn] = 0; @import("std").mem.doNotOptimizeAway(__kc.fputs(@as([*:0]const u8, @ptrCast(&__kt)), if (__fd == 2) __kc.stderr else __kc.stdout)); } } else { @import("std").mem.doNotOptimizeAway(@import("std").posix.write(__fd, __b) catch @as(usize, 0)); } } fn __kw(comptime __f: []const u8, __a: anytype) void { var __kb: [65536]u8 = undefined; const __ks = @import("std").fmt.bufPrint(&__kb, __f, __a) catch __kb[0..0]; __kout(1, __ks); } }).__kw("cells[1].on reads {d}\n", .{(&main_module.__koru_grid_cells.on)[main_module.__KoruGridT_cells.__koru_at(1)]});
}
// >>> FLOW: tests/regression/600_STDLIB/697_GRID/697_005_grid_read_outside_a_write_block/input.k:51 ~input:__grid_sweep_L51()
pub fn flow3() void {
_ = main_module.__grid_sweep_L51_event.handler(.{ });
}
// >>> FLOW: tests/regression/600_STDLIB/697_GRID/697_005_grid_read_outside_a_write_block/input.k:54 ~std.io:print.impl()
pub fn flow4() void {
(struct { fn __kout(__fd: i32, __b: []const u8) void { if (@import("builtin").os.tag == .freestanding) { const __kc = struct { extern var stdout: ?*anyopaque; extern var stderr: ?*anyopaque; extern fn fputs(__s: [*:0]const u8, __st: ?*anyopaque) c_int; }; var __kt: [4096]u8 = undefined; for (0..(__b.len + __kt.len - 2) / (__kt.len - 1)) |__ki| { const __kn = @min(__kt.len - 1, __b.len - __ki * (__kt.len - 1)); @memcpy(__kt[0..__kn], __b[__ki * (__kt.len - 1)..][0..__kn]); __kt[__kn] = 0; @import("std").mem.doNotOptimizeAway(__kc.fputs(@as([*:0]const u8, @ptrCast(&__kt)), if (__fd == 2) __kc.stderr else __kc.stdout)); } } else { @import("std").mem.doNotOptimizeAway(@import("std").posix.write(__fd, __b) catch @as(usize, 0)); } } fn __kw(comptime __f: []const u8, __a: anytype) void { var __kb: [65536]u8 = undefined; const __ks = @import("std").fmt.bufPrint(&__kb, __f, __a) catch __kb[0..0]; __kout(1, __ks); } }).__kw("sum {d}\n", .{__koru_store_acc.n});
}
pub fn koru_start_flow() void {
const result_0 = koru_koru.start_event.handler(.{ });
const result_0_done = result_0.done;
_ = &result_0_done;
}
pub fn koru_end_flow() void {
const result_0 = koru_koru.end_event.handler(.{ });
const result_0_done = result_0.done;
_ = &result_0_done;
}
const __KoruStoreT_acc = blk: {
const __info = @typeInfo(@TypeOf(.{ .n = @as(i64, 0) }));
var __fields: [__info.@"struct".fields.len]@import("std").builtin.Type.StructField = undefined;
for (__info.@"struct".fields, 0..) |__f, __i| {
__fields[__i] = .{ .name = __f.name, .type = __f.type, .default_value_ptr = null, .is_comptime = false, .alignment = __f.alignment };
}
break :blk @Type(.{ .@"struct" = .{ .layout = .auto, .fields = &__fields, .decls = &.{}, .is_tuple = false } });
};
var __koru_store_acc: __KoruStoreT_acc = .{ .n = @as(i64, 0) };
pub const __store_apply_acc_event = struct {
pub const Input = struct {
field: i64,
value: i64,
};
pub const Output = union(enum(u8)) {
n: i64,
};
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> PROC: __store_apply_acc [tests/regression/600_STDLIB/697_GRID/697_005_grid_read_outside_a_write_block/input.k:36]
const field = __koru_event_input.field;
const value = __koru_event_input.value;
_ = &field;
_ = &value;
_ = &__koru_event_input;
return switch (field) {
0 => blk: { __koru_store_acc.n = value; break :blk .{ .n = value }; },
else => unreachable,
};
}
};
pub const __store_write_acc_event = struct {
pub const Input = struct {
field: i64,
value: i64,
};
pub const Output = void;
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> SUBFLOW: tests/regression/600_STDLIB/697_GRID/697_005_grid_read_outside_a_write_block/input.k:36
const field = __koru_event_input.field;
const value = __koru_event_input.value;
_ = &field;
_ = &value;
_ = &__koru_event_input;
const result = main_module.__store_apply_acc_event.handler(.{ .field = field, .value = value });
return switch (result) {
.n => {},
};
}
};
pub const __store_announce_acc_event = struct {
pub const Input = struct {
field: i64,
};
pub const Output = void;
pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
return __koru_handler_impl(__koru_event_input.field);
}
fn __koru_handler_impl(__koru_p_0: i64) @This().Output {
const __koru_event_input: @This().Input = .{ .field = __koru_p_0 };
// >>> PROC: __store_announce_acc [tests/regression/600_STDLIB/697_GRID/697_005_grid_read_outside_a_write_block/input.k:36]
const field = __koru_event_input.field;
_ = &field;
_ = &__koru_event_input;
return;
}
};
pub const __grid_write_L39_baa6_event = struct {
pub const Input = struct {
__koru_gwx0: i64,
__koru_gwv0: i64,
};
pub const Output = void;
pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
return __koru_handler_impl(__koru_event_input.__koru_gwx0, __koru_event_input.__koru_gwv0);
}
fn __koru_handler_impl(__koru_p_0: i64, __koru_p_1: i64) @This().Output {
const __koru_event_input: @This().Input = .{ .__koru_gwx0 = __koru_p_0, .__koru_gwv0 = __koru_p_1 };
// >>> PROC: __grid_write_L39_baa6 [tests/regression/600_STDLIB/697_GRID/697_005_grid_read_outside_a_write_block/input.k:39]
const __koru_gwx0 = __koru_event_input.__koru_gwx0;
const __koru_gwv0 = __koru_event_input.__koru_gwv0;
_ = &__koru_gwx0;
_ = &__koru_gwv0;
_ = &__koru_event_input;
(&main_module.__koru_grid_cells.on)[main_module.__KoruGridT_cells.__koru_at(__koru_gwx0)] = __koru_gwv0;
}
};
pub const __grid_body_L51_event = struct {
pub const Input = struct {
__koru_gi_cells_L51: i64,
};
pub const Output = void;
pub inline fn handler(__k
... [truncated - 22KB total]Flows
flow ~new click a branch to expand · @labels scroll to their anchor
new (cells, size: 8, source: on: 0[i64])
flow ~new click a branch to expand · @labels scroll to their anchor
new (acc, source: n: 0[i64])
flow ~for click a branch to expand · @labels scroll to their anchor
for (0..4)
flow ~if click a branch to expand · @labels scroll to their anchor
if (cells[2].on == 4)
flow ~print.ln click a branch to expand · @labels scroll to their anchor
print.ln (expr: "cells[1].on reads {{ cells[1].on:d }}")
flow ~sweep click a branch to expand · @labels scroll to their anchor
sweep (cells)
flow ~print.ln click a branch to expand · @labels scroll to their anchor
print.ln (expr: "sum {{ acc.n:d }}")
Test Configuration
MUST_RUN LANGUAGES: zig js