✓
Passing This code compiles and runs correctly.
Code
// BULK APPEND — counted `for` whose `! each` body is a single insert
// into an observation-free store lowers to one hoisted capacity check,
// indexed column writes at `base + j`, and a single `len += n` after
// the loop. The per-row path's `len += 1` is a loop-carried store that
// blocks the optimizer; measured ~294us -> ~89us on a 100k-row fill by
// hand-editing the emitted loop before the lowering existed.
//
// `marks` qualifies on every clause — no handles, no watch, no rule,
// no lifecycle arms, no `| row`/`| full` on the insert. Its `| done`
// arm carries a real body (the notes write): the bulk block hands off
// to it through the same `__koru_continue` marker the template's own
// `{{ continuations["done"].continue }}` renders to, so post-loop work
// still runs once, after the fill.
//
// `kept` declines twice over — the insert binds `| row k` (handle
// machinery stays) and an armed insert inside `! each` is not the bare
// single-insert shape. Its rows land one event call at a time, with
// the row arm firing per insert. One program, both halves of the
// recognizer's decision.
import std/io
import std/store
import std/control
std/store:new(marks, capacity: 8) { on: i64 }
std/store:new(kept, capacity: 8) { hp: i64 }
std/store:new(notes) { n: 0[i64] }
for(0..5)
! each i |> std/store:insert(marks) { on: @intCast(i * 2) }
| done |> std/store:stored { notes.n: 5 }
for(0..3)
! each i |> std/store:insert(kept) { hp: @intCast(i * 10) }
| row k |> std/io:print.ln("row {{ k:d }}")
std/store:query(marks)
! query e |> std/io:print.ln("mark {{ e.on:d }}")
std/store:query(kept)
! query e |> std/io:print.ln("kept {{ e.hp:d }}")
std/io:print.ln("notes {{ notes.n:d }}")
Actual
row 33554432
row 33554433
row 33554434
mark 0
mark 2
mark 4
mark 6
mark 8
kept 0
kept 10
kept 20
notes 5
Expected output
✓ Zig✓ JavaScript✓ C#row 33554432
row 33554433
row 33554434
mark 0
mark 2
mark 4
mark 6
mark 8
kept 0
kept 10
kept 20
notes 5
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) __koru_bare.allocator else @import("std").heap.page_allocator;
var __koru_leak_count: @import("std").atomic.Value(usize) = .init(0);
fn __koru_alloc(ctx: *anyopaque, len: usize, alignment: @import("std").mem.Alignment, ret_addr: usize) ?[*]u8 {
_ = ctx;
const r = __koru_backing.rawAlloc(len, alignment, ret_addr);
if (comptime @import("builtin").mode == .Debug) {
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 __koru_backing.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 __koru_backing.rawRemap(memory, alignment, new_len, ret_addr);
}
fn __koru_free(ctx: *anyopaque, memory: []u8, alignment: @import("std").mem.Alignment, ret_addr: usize) void {
_ = ctx;
__koru_backing.rawFree(memory, alignment, ret_addr);
if (comptime @import("builtin").mode == .Debug) {
_ = __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));
}
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 {
// std/store: plural store 'marks' created (SoA cell + insert/query/write/take/stripe units); fields on: i64
// std/store: plural store 'kept' created (SoA cell + insert/query/write/take/stripe units); fields hp: i64
// std/store: 'notes' created (cell + write-subflow at module scope); fields n: i64
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_334_counted_for_insert_lowers_to_bulk_append/input.k:29 ~std.control:for()
pub fn flow0() void {
{
const __koru_bulk_lo = (0);
const __koru_bulk_hi = (5);
const __koru_bulk_n = __koru_bulk_hi - __koru_bulk_lo;
if (__koru_bulk_n > 8 - __koru_store_marks.len) @panic("std/store: store 'marks' is full (capacity 8) - declared capacity and the `| full` branch are pinned at 690_011");
const __koru_bulk_base = __koru_store_marks.len;
for (0..__koru_bulk_n) |__koru_bulk_j| {
const i = __koru_bulk_lo + __koru_bulk_j;
__koru_store_marks.on[__koru_bulk_base + __koru_bulk_j] = @intCast(i * 2);
}
__koru_store_marks.len += __koru_bulk_n;
}
{ _ = main_module.__store_write_notes_event.handler(.{ .field = 0, .value = 5 });
}
}
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_334_counted_for_insert_lowers_to_bulk_append/input.k:33 ~std.control:for()
pub fn flow1() void {
for (0..3) |__koru_item3| {
{ const i = __koru_item3; _ = &i; const result_e0_0 = main_module.__store_inserth_kept_event.handler(.{ .hp = @intCast(i * 10), .__site_line = 34 });
_ = &result_e0_0;
const k = result_e0_0.row;
(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("row {d}\n", .{k});
}
}
{ }
}
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_334_counted_for_insert_lowers_to_bulk_append/input.k:37 ~input:__store_sweeprun_marks_L38_690_334_counted_for_insert_lowers_to_bulk_append_input_3f6c5f()
pub fn flow2() void {
_ = main_module.__store_sweeprun_marks_L38_690_334_counted_for_insert_lowers_to_bulk_append_input_3f6c5f_event.handler(.{ });
}
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_334_counted_for_insert_lowers_to_bulk_append/input.k:40 ~input:__store_sweeprun_kept_L41_690_334_counted_for_insert_lowers_to_bulk_append_input_3f6c5f()
pub fn flow3() void {
_ = main_module.__store_sweeprun_kept_L41_690_334_counted_for_insert_lowers_to_bulk_append_input_3f6c5f_event.handler(.{ });
}
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_334_counted_for_insert_lowers_to_bulk_append/input.k:43 ~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("notes {d}\n", .{__koru_store_notes.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_marks = struct {
on: [8]i64 = undefined,
len: usize = 0,
};
var __koru_store_marks: __KoruStoreT_marks = .{};
const __KoruStoreRow_marks = struct { on: i64 };
pub const __store_insert_marks_event = struct {
pub const Input = struct {
on: i64,
__site_line: i64,
};
pub const Output = void;
pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
return __koru_handler_impl(__koru_event_input.on, __koru_event_input.__site_line);
}
fn __koru_handler_impl(__koru_p_0: i64, __koru_p_1: i64) @This().Output {
const __koru_event_input: @This().Input = .{ .on = __koru_p_0, .__site_line = __koru_p_1 };
// >>> PROC: __store_insert_marks [tests/regression/600_STDLIB/690_STORE/690_334_counted_for_insert_lowers_to_bulk_append/input.k:25]
const on = __koru_event_input.on;
const __site_line = __koru_event_input.__site_line;
_ = &on;
_ = &__site_line;
_ = &__koru_event_input;
if (__koru_store_marks.len >= 8) @panic("std/store: store 'marks' is full (capacity 8) - declared capacity and the `| full` branch are pinned at 690_011");
const __koru_new_row = __koru_store_marks.len;
__koru_store_marks.on[__koru_new_row] = on;
__koru_store_marks.len += 1;
return;
}
};
pub const __store_apply_marks_event = struct {
pub const Input = struct {
row: usize,
field: i64,
value_0: i64,
};
pub const Output = union(enum(u8)) {
on: i64,
};
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> PROC: __store_apply_marks [tests/regression/600_STDLIB/690_STORE/690_334_counted_for_insert_lowers_to_bulk_append/input.k:25]
const row = __koru_event_input.row;
const field = __koru_event_input.field;
const value_0 = __koru_event_input.value_0;
_ = &row;
_ = &field;
_ = &value_0;
_ = &__koru_event_input;
const __koru_r: usize = row;
return switch (field) {
0 => blk: { __koru_store_marks.on[__koru_r] = value_0; break :blk .{ .on = value_0 }; },
else => unreachable,
};
}
};
const __KoruStoreT_kept = struct {
hp: [8]i64 = undefined,
len: usize = 0,
__koru_hslot_row: [8]usize = undefined,
__koru_hslot_gen: [8]u32 = [_]u32{0} ** 8,
__koru_row_hslot: [8]usize = undefined,
__koru_hslot_free: [8]usize = undefined,
__koru_hslot_free_len: usize = 0,
__koru_hslot_next: usize = 0,
// `__koru_ident` — no removal has run, so slot == dense row
// for every live row; mint/resolve skip both table loads, the
// first take materialises and flips it, drain and clear
// re-arm it by resetting the slot space. `__koru_gen0` — no gen
// bump has ever run; it implies slot == row for every minted
// slot, so resolve sheds the gen load entirely.
__koru_ident: bool = true, __koru_gen0: bool = true,
const __koru_brand: u32 = 2;
fn __koru_materialize(self: *@This()) void {
if (!self.__koru_ident) return;
for (0..self.len) |i| { self.__koru_hslot_row[i] = i; self.__koru_row_hslot[i] = i; }
self.__koru_ident = false;
}
fn __koru_row_of(self: *const @This(), h: i64) ?usize {
if (h < 0) return null;
const u = @as(u64, @bitCast(h));
const slot32 = @as(u32, @truncate(u));
if ((slot32 >> 24) != __koru_brand) return null;
const slot = @as(usize, @intCast(slot32 & 0xFFFFFF));
if (slot >= self.__koru_hslot_next) return null;
if (self.__koru_gen0) { if (u >> 32 != 0) return null; return slot; }
if (@as(u32, @truncate(u >> 32)) != self.__koru_hslot_gen[slot]) return null;
if (self.__koru_ident) return slot;
const __koru_r = self.__koru_hslot_row[slot];
if (__koru_r >= self.len) return null;
return __koru_r;
}
// DO NOT "simplify" into one pass — pre-check + row_of tail
// call keeps resolve under the inline threshold; callers
// inline BOTH and LLVM CSEs the duplicate checks into one
// validation in machine code. A flat single pass crossed
// the threshold: +57% read_handle, +2.6x write_handle
// (007 board, 2026-09-26). Shape, not count.
fn __koru_resolve(self: *const @This(), h: i64) usize {
if (h >= 0) {
const u = @as(u64, @bitCast(h));
const slot32 = @as(u32, @truncate(u));
if ((slot32 >> 24) != __koru_brand) @panic("std/store: 'kept[...]' does not address a row - the value is not a handle this store issued (handles come from `| row` and row cursors)");
const slot = @as(usize, @intCast(slot32 & 0xFFFFFF));
if (self.__koru_gen0) {
if (u >> 32 != 0 and slot < self.__koru_hslot_next) @panic("std/store: stale row handle into store 'kept' - the row it addressed was removed (stale-handle trap pinned at 690_115)");
} else if (slot < self.__koru_hslot_next and @as(u32, @truncate(u >> 32)) != self.__koru_hslot_gen[slot]) @panic("std/store: stale row handle into store 'kept' - the row it addressed was removed (stale-handle trap pinned at 690_115)");
}
return self.__koru_row_of(h) orelse @panic("std/store: 'kept[...]' does not address a row - the value is not a handle this store issued (handles come from `| row` and row cursors)");
}
fn __koru_handle_of(self: *const @This(), dense: usize) i64 {
if (self.__koru_gen0) return @as(i64, @intCast(dense | (@as(usize, __koru_brand) << 24)));
var slot = dense;
if (!self.__koru_ident) slot = self.__koru_row_hslot[dense];
return @as(i64, @intCast(slot | (@as(usize, __koru_brand) << 24))) | (@as(i64, @intCast(self.__koru_hslot_gen[slot])) << 32);
}
};
var __koru_store_kept: __KoruStoreT_kept = .{};
const __KoruStoreRow_kept = struct { hp: i64 };
pub const __store_inserth_kept_event = struct {
pub const Input = struct {
hp: i64,
__site_line: i64,
};
pub const Output = union(enum(u8)) {
row: i64,
};
pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
return __koru_handler_impl(__koru_event_input.hp, __koru_event_input.__site_line);
}
fn __koru_handler_impl(__koru_p_0: i64, __koru_p_1: i64) @This().Output {
const __koru_event_input: @This().Input = .{ .hp = __koru_p_0, .__site_line = __koru_p_1 };
// >>> PROC: __store_inserth_kept [tests/regression/600_STDLIB/690_STORE/690_334_counted_for_insert_lowers_to_bulk_append/input.k:26]
const hp = __koru_event_input.hp;
const __site_line = __koru_event_input.__site_line;
_ = &hp;
_ = &__site_line;
_ = &__koru_event_input;
if (__koru_store_kept.len >= 8) @panic("std/store: store 'kept' is full (capacity 8) - declared capacity and the `| full` branch are pinned at 690_011");
const __koru_new_row = __koru_store_kept.len;
const __koru_hslot = if (__koru_store_kept.__koru_hslot_free_len > 0) blk_hs: {
__koru_store_kept.__koru_hslot_free_len -= 1;
break :blk_hs __koru_store_kept.__koru_hslot_free[__koru_store_kept.__koru_hslot_free_len];
} else blk_hs: {
const __koru_hn = __koru_store_kept.__koru_hslot_next;
__koru_store_kept.__koru_hslot_next += 1;
break :blk_hs __koru_hn;
};
if (!__koru_store_kept.__koru_ident) {
__koru_store_kept.__koru_hslot_row[__koru_hslot] = __koru_new_row;
__koru_store_kept.__koru_row_hslot[__koru_new_row] = __koru_hslot;
}
__koru_store_kept.hp[__koru_new_row] = hp;
__koru_store_kept.len += 1;
return .{ .row = __koru_store_kept.__koru_handle_of(__koru_new_row) };
}
};
pub const __store_apply_kept_event = struct {
pub const Input = struct {
row: usize,
field: i64,
value_0: i64,
};
pub const Output = union(enum(u8)) {
hp: i64,
};
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> PROC: __store_apply_kept [tests/regression/600_STDLIB/690_STORE/690_334_counted_for_insert_lowers_to_bulk_append/input.k:26]
const row = __koru_event_input.row;
const field = __koru_event_input.field;
const value_0 = __koru_event_input.value_0;
_ = &row;
_ = &field;
_ = &value_0;
_ = &__koru_event_input;
const __koru_r: usize = row;
return switch (field) {
0 => blk: { __koru_store_kept.hp[__koru_r] = value_0; break :blk .{ .hp = value_0 }; },
else => unreachable,
};
}
};
const __KoruStoreT_notes = 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_notes: __KoruStoreT_notes = .{ .n = @as(i64, 0) };
pub const __store_apply_notes_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_notes [tests/regression/600_STDLIB/690_STORE/690_334_counted_for_insert_lowers_to_bulk_append/input.k:27]
const field = __ko
... [truncated - 28KB total]Emitted C# source
static class main_module {
public static void __koru_stdout_write(dynamic s) => global::System.Console.Out.Write(s);
public static void __koru_stderr_write(dynamic s) => global::System.Console.Error.Write(s);
// The mutable handle carrier — `*String`-style resources are
// `new __KoruBox { data = … }` because C# anonymous types are
// read-only: `s.data = …` (std/string append/clear, handle
// mutation generally) needs a settable member.
public class __KoruBox { public dynamic data; }
// Textification for `{{ … }}` operands: C# bool ToStrings as
// `True` where Koru prints `true`, and the operand's static type
// is unknown at this boundary — a `(x) is bool` inline test would
// be a compile error on statically-typed operands instead. Generic
// on purpose: `dynamic` boxed every value-type operand — measured
// ~1s/10M elements on 012_threat_scanner — while T specializes to
// the operand's own ToString() with no box.
public static string __koru_str<T>(T v) => v is bool b ? (b ? "true" : "false") : v?.ToString();
// std/store: plural store 'marks' created (SoA cell + insert/query/write/take/stripe units); fields on: i64
// std/store: plural store 'kept' created (SoA cell + insert/query/write/take/stripe units); fields hp: i64
// std/store: 'notes' created (cell + write-subflow at module scope); fields n: i64
static class __koru_store_marks {
public static long[] on = new long[8];
public static long len = 0;
public static long __koru_brand = -1;
}
static class __koru_store_kept {
public static long[] hp = new long[8];
public static dynamic __koru_read_hp(long __h) { long __r = __koru_resolve(__h); return hp[(int)__r]; }
public static long len = 0;
public static long[] __koru_hslot_row = new long[8];
public static long[] __koru_hslot_gen = new long[8];
public static long[] __koru_row_hslot = new long[8];
public static long[] __koru_hslot_free = new long[8];
public static long __koru_hslot_free_len = 0;
public static long __koru_hslot_next = 0;
public static long __koru_brand = 2;
public static bool __koru_ident = true;
public static bool __koru_gen0 = true;
public static void __koru_materialize() {
if (!__koru_ident) return;
for (long __i = 0; __i < len; __i++) { __koru_hslot_row[__i] = __i; __koru_row_hslot[__i] = __i; }
__koru_ident = false;
}
public static long __koru_row_of(long h) {
if (h < 0) return -1;
ulong __u = (ulong)h;
long __slot32 = (long)(__u & 0xFFFFFFFFUL);
if ((__slot32 >> 24) != __koru_brand) return -1;
long __slot = __slot32 & 0xFFFFFF;
if (__slot >= __koru_hslot_next) return -1;
if (__koru_gen0) { if ((__u >> 32) != 0) return -1; return __slot; }
if ((long)(__u >> 32) != __koru_hslot_gen[__slot]) return -1;
if (__koru_ident) return __slot;
long __r = __koru_hslot_row[__slot];
if (__r >= len) return -1;
return __r;
}
public static long __koru_resolve(long h) {
if (h >= 0) {
ulong __u = (ulong)h;
long __slot32 = (long)(__u & 0xFFFFFFFFUL);
if ((__slot32 >> 24) != __koru_brand) throw new global::System.Exception("std/store: 'kept[...]' does not address a row - the value is not a handle this store issued (handles come from `| row` and row cursors)");
long __slot = __slot32 & 0xFFFFFF;
if (__koru_gen0) {
if ((__u >> 32) != 0 && __slot < __koru_hslot_next) throw new global::System.Exception("std/store: stale row handle into store 'kept' - the row it addressed was removed (stale-handle trap pinned at 690_115)");
} else if (__slot < __koru_hslot_next && (long)(__u >> 32) != __koru_hslot_gen[__slot]) throw new global::System.Exception("std/store: stale row handle into store 'kept' - the row it addressed was removed (stale-handle trap pinned at 690_115)");
}
long __r = __koru_row_of(h);
if (__r < 0) throw new global::System.Exception("std/store: 'kept[...]' does not address a row - the value is not a handle this store issued (handles come from `| row` and row cursors)");
return __r;
}
public static long __koru_handle_of(long dense) {
if (__koru_gen0) return dense | (__koru_brand << 24);
long __slot = dense;
if (!__koru_ident) __slot = __koru_row_hslot[dense];
return (__slot | (__koru_brand << 24)) | (__koru_hslot_gen[__slot] << 32);
}
}
static class __koru_store_notes {
public static long n = 0;
public static long __koru_brand = -1;
}
public static class __store_insert_marks_event {
public struct Input {
public long on;
public long __site_line;
}
public static dynamic handler(Input __koru_input) {
var on = __koru_input.on;
var __site_line = __koru_input.__site_line;
if (__koru_store_marks.len >= 8) throw new global::System.Exception("std/store: store 'marks' is full (capacity 8) - declared capacity and the `| full` branch are pinned at 690_011");
long __koru_new_row = __koru_store_marks.len;
__koru_store_marks.on[__koru_new_row] = on;
__koru_store_marks.len += 1;
return default;
}
}
public static class __store_apply_marks_event {
public struct Input {
public long row;
public long field;
public long value_0;
}
public struct Output {
public string tag;
public long on;
}
public static Output handler(Input __koru_input) {
var row = __koru_input.row;
var field = __koru_input.field;
var value_0 = __koru_input.value_0;
var __koru_r = row;
switch (field) {
case 0: { __koru_store_marks.on[__koru_r] = value_0; return new Output { tag = "on", on = value_0 }; }
}
throw new global::System.Exception("__store_apply_marks: field index " + field + " is not a column of store 'marks'");
return default;
}
}
public static class __store_inserth_kept_event {
public struct Input {
public long hp;
public long __site_line;
}
public struct Output {
public string tag;
public long row;
}
public static Output handler(Input __koru_input) {
var hp = __koru_input.hp;
var __site_line = __koru_input.__site_line;
if (__koru_store_kept.len >= 8) throw new global::System.Exception("std/store: store 'kept' is full (capacity 8) - declared capacity and the `| full` branch are pinned at 690_011");
long __koru_new_row = __koru_store_kept.len;
long __koru_hslot;
if (__koru_store_kept.__koru_hslot_free_len > 0) {
__koru_store_kept.__koru_hslot_free_len -= 1;
__koru_hslot = __koru_store_kept.__koru_hslot_free[__koru_store_kept.__koru_hslot_free_len];
} else {
__koru_hslot = __koru_store_kept.__koru_hslot_next;
__koru_store_kept.__koru_hslot_next += 1;
}
if (!__koru_store_kept.__koru_ident) {
__koru_store_kept.__koru_hslot_row[__koru_hslot] = __koru_new_row;
__koru_store_kept.__koru_row_hslot[__koru_new_row] = __koru_hslot;
}
__koru_store_kept.hp[__koru_new_row] = hp;
__koru_store_kept.len += 1;
return new Output { tag = "row", row = __koru_store_kept.__koru_handle_of(__koru_new_row) };
return default;
}
}
public static class __store_apply_kept_event {
public struct Input {
public long row;
public long field;
public long value_0;
}
public struct Output {
public string tag;
public long hp;
}
public static Output handler(Input __koru_input) {
var row = __koru_input.row;
var field = __koru_input.field;
var value_0 = __koru_input.value_0;
var __koru_r = row;
switch (field) {
case 0: { __koru_store_kept.hp[__koru_r] = value_0; return new Output { tag = "hp", hp = value_0 }; }
}
throw new global::System.Exception("__store_apply_kept: field index " + field + " is not a column of store 'kept'");
return default;
}
}
public static class __store_apply_notes_event {
public struct Input {
public long field;
public long value;
}
public struct Output {
public string tag;
public long n;
}
public static Output handler(Input __koru_input) {
var field = __koru_input.field;
var value = __koru_input.value;
switch (field) {
case 0: { __koru_store_notes.n = value; return new Output { tag = "n", n = value }; }
}
throw new global::System.Exception("__store_apply_notes: field index " + field + " is not a column of store 'notes'");
return default;
}
}
public static class __store_write_notes_event {
public struct Input {
public long field;
public long value;
}
public static dynamic handler(Input __koru_input) {
var field = __koru_input.field;
var value = __koru_input.value;
var result_0 = main_module.__store_apply_notes_event.handler(new __store_apply_notes_event.Input { field = (long)(field), value = (long)(value)});
var _auto_9 = result_0.n;
return default;
}
}
public static class __store_announce_notes_event {
public struct Input {
public long field;
}
public static dynamic handler(Input __koru_input) {
var field = __koru_input.field;
return default;
}
}
public static class __store_sweepbody_marks_L38_690_334_counted_for_insert_lowers_to_bulk_append_input_3f6c5f_event {
public struct Input {
public long __koru_srf_e_L38_on;
public long __koru_sdix_e_L38;
}
public static dynamic handler(Input __koru_input) {
var __koru_srf_e_L38_on = __koru_input.__koru_srf_e_L38_on;
var __koru_sdix_e_L38 = __koru_input.__koru_sdix_e_L38;
__koru_stdout_write("mark " + __koru_str(__koru_srf_e_L38_on) + "\n");
return default;
}
}
public static class __store_sweeprun_marks_L38_690_334_counted_for_insert_lowers_to_bulk_append_input_3f6c5f_event {
public struct Input {
}
public static dynamic handler(Input __koru_input) {
{
for (var __koru_si = 0; __koru_si < __koru_store_marks.len; __koru_si++) {
var __koru_srf_e_L38_on = __koru_store_marks.on[__koru_si];
main_module.__store_sweepbody_marks_L38_690_334_counted_for_insert_lowers_to_bulk_append_input_3f6c5f_event.handler(new main_module.__store_sweepbody_marks_L38_690_334_counted_for_insert_lowers_to_bulk_append_input_3f6c5f_event.Input { __koru_srf_e_L38_on = __koru_srf_e_L38_on, __koru_sdix_e_L38 = __koru_si });
}
}
return default;
}
}
public static class __store_sweepbody_kept_L41_690_334_counted_for_insert_lowers_to_bulk_append_input_3f6c5f_event {
public struct Input {
public long __koru_srf_e_L41_hp;
public long __koru_sdix_e_L41;
}
public static dynamic handler(Input __koru_input) {
var __koru_srf_e_L41_hp = __koru_input.__koru_srf_e_L41_hp;
var __koru_sdix_e_L41 = __koru_input.__koru_sdix_e_L41;
__koru_stdout_write("kept " + __koru_str(__koru_srf_e_L41_hp) + "\n");
return default;
}
}
public static class __store_sweeprun_kept_L41_690_334_counted_for_insert_lowers_to_bulk_append_input_3f6c5f_event {
public struct Input {
}
public static dynamic handler(Input __koru_input) {
{
for (var __koru_si = 0; __koru_si < __koru_store_kept.len; __koru_si++) {
var __koru_srf_e_L41_hp = __koru_store_kept.hp[__koru_si];
main_module.__store_sweepbody_kept_L41_690_334_counted_for_insert_lowers_to_bulk_append_input_3f6c5f_event.handler(new main_module.__store_sweepbody_kept_L41_690_334_counted_for_insert_lowers_to_bulk_append_input_3f6c5f_event.Input { __koru_srf_e_L41_hp = __koru_srf_e_L41_hp, __koru_sdix_e_L41 = __koru_si });
}
}
return default;
}
}
public static class std_io_print_impl_event {
public struct Input {
public dynamic expr;
}
public static dynamic handler(dynamic __koru_input) {
throw new global::System.Exception("std.io:impl has no C# implementation — its body resolves only to a non-cs target (|zig / [comptime]), directly or through a callee");
}
}
public static class std_control_for_event {
public struct Input {
public dynamic expr;
public dynamic keep;
}
public struct Output {
public string tag;
public dynamic done;
}
public interface IOps {
void each(dynamic __koru_arg);
}
public static Output handler<H>(Input __koru_input, H ops) where H : struct, IOps {
void each(dynamic __koru_arg) => ops.each(__koru_arg);
var expr = __koru_input.expr;
var keep = __koru_input.keep;
throw new global::System.Exception("for: |template| proc is inlined at call sites and must never be called");
}
}
public static class koru_start_event {
public struct Input {
}
public struct Output {
public string tag;
public dynamic done;
}
public static Output handler(Input __koru_input) => new Output { tag = "done" };
}
public static class koru_end_event {
public struct Input {
}
public struct Output {
public string tag;
public dynamic done;
}
public static Output handler(Input __koru_input) => new Output { tag = "done" };
}
public static void flow0() {
{
var __koru_bulk_lo = (0);
var __koru_bulk_hi = (5);
var __koru_bulk_n = __koru_bulk_hi - __koru_bulk_lo;
if (__koru_bulk_n > 8 - __koru_store_marks.len) throw new global::System.Exception("std/store: store 'marks' is full (capacity 8) - declared capacity and the `| full` branch are pinned at 690_011");
var __koru_bulk_base = __koru_store_marks.len;
for (var __koru_bulk_j = 0L; __koru_bulk_j < __koru_bulk_n; __koru_bulk_j++) {
var i = __koru_bulk_lo + __koru_bulk_j;
__koru_store_marks.on[__koru_bulk_base + __koru_bulk_j] = (i * 2);
}
__koru_store_marks.len += __koru_bulk_n;
}
{ main_module.__store_write_notes_event.handler(new __store_write_notes_event.Input { field = (long)(0), value = (long)(5)});
}
}
public static void flow1() {
for (long __koru_item3 = 0; __koru_item3 < 3; __koru_item3++) {
{ var i = __koru_item3; var result_1 = main_module.__store_inserth_kept_event.handler(new __store_inserth_kept_event.Input { hp = (long)((i * 10)), __site_line = (long)(34)});
var k = result_1.row;
__koru_stdout_write("row " + __koru_str(k) + "\n");
}
}
{ }
}
public static void flow2() {
{
{
for (var __koru_si = 0; __koru_si < __koru_store_marks.len; __koru_si++) {
var __koru_srf_e_L38_on = __koru_store_marks.on[__koru_si];
main_module.__store_sweepbody_marks_L38_690_334_counted_for_insert_lowers_to_bulk_append_input_3f6c5f_event.handler(new main_module.__store_sweepbody_marks_L38_690_334_counted_for_insert_lowers_to_bulk_append_input_3f6c5f_event.Input { __koru_srf_e_L38_on = __koru_srf_e_L38_on, __koru_sdix_e_L38 = __koru_si });
}
}
}
}
public static void flow3() {
{
{
for (var __koru_si = 0; __koru_si < __koru_store_kept.len; __koru_si++) {
var __koru_srf_e_L41_hp = __koru_store_kept.hp[__koru_si];
main_module.__store_sweepbody_kept_L41_690_334_counted_for_insert_lowers_to_bulk_append_input_3f6c5f_event.handler(new main_module.__store_sweepbody_kept_L41_690_334_counted_for_insert_lowers_to_bulk_append_input_3f6c5f_event.Input { __koru_srf_e_L41_hp = __koru_srf_e_L41_hp, __koru_sdix_e_L41 = __koru_si });
}
}
}
}
public static void flow4() {
__koru_stdout_write("notes " + __koru_str(__koru_store_notes.n) + "\n");
}
public static void flow5() {
main_module.koru_start_event.handler(new koru_start_event.Input { });
}
public static void flow6() {
main_module.koru_end_event.handler(new koru_end_event.Input { });
}
}
static class Program {
static void Main() {
main_module.flow5();
main_module.flow0();
main_module.flow1();
main_module.flow2();
main_module.flow3();
main_module.flow4();
main_module.flow6();
}
}
Flows
flow ~new click a branch to expand · @labels scroll to their anchor
new (marks, capacity: 8, source: on: i64)
flow ~new click a branch to expand · @labels scroll to their anchor
new (kept, capacity: 8, source: hp: i64)
flow ~new click a branch to expand · @labels scroll to their anchor
new (notes, source: n: 0[i64])
flow ~for click a branch to expand · @labels scroll to their anchor
for (0..5)
flow ~for click a branch to expand · @labels scroll to their anchor
for (0..3)
flow ~query click a branch to expand · @labels scroll to their anchor
query (marks)
flow ~query click a branch to expand · @labels scroll to their anchor
query (kept)
flow ~print.ln click a branch to expand · @labels scroll to their anchor
print.ln (expr: "notes {{ notes.n:d }}")
Test Configuration
MUST_RUN LANGUAGES: zig cs
Post-validation Script:
#!/bin/bash
# Emitted-shape oracle for counted-for bulk append. `marks` is
# observation-free (no handles, watch, rules, lifecycle, or armed
# insert), so its `for(0..5) ! each i |> insert` lowers to a hoisted
# capacity check + `col[base + j]` writes + one `len += n` — and the
# per-row insert event is never CALLED (its proc still emits; the site
# transformed before the rewrite consumed the arm). `kept` binds
# `| row k`, so it keeps handles AND stays per-row: the
# `__store_inserth_kept` call must still sit inside a per-item `for`.
set -u
if [ ! -f output_emitted.zig ]; then
echo "FAIL: no output_emitted.zig"
exit 1
fi
# --- the bulk block is there, in the probed shape ---
if ! grep -q '__koru_bulk_base = __koru_store_marks.len' output_emitted.zig; then
echo "FAIL: no bulk base captured for marks"
exit 1
fi
if ! grep -q 'for (0..__koru_bulk_n)' output_emitted.zig; then
echo "FAIL: no bulk counted loop emitted"
exit 1
fi
if ! grep -q '__koru_store_marks.on\[__koru_bulk_base + __koru_bulk_j\]' output_emitted.zig; then
echo "FAIL: no indexed column write at base + j"
exit 1
fi
if ! grep -q '__koru_store_marks.len += __koru_bulk_n' output_emitted.zig; then
echo "FAIL: no single len += n after the loop"
exit 1
fi
if ! grep -q '__koru_bulk_n > 8 - __koru_store_marks.len' output_emitted.zig; then
echo "FAIL: capacity check was not hoisted out of the loop"
exit 1
fi
# --- the per-row insert event is dead code: emitted, never called ---
if grep -q '__store_insert_marks_event.handler(' output_emitted.zig; then
echo "FAIL: marks insert still called per row"
exit 1
fi
# --- the done arm's body still runs, once, after the fill ---
if ! grep -q '__store_write_notes_event.handler' output_emitted.zig; then
echo "FAIL: done arm body dropped — the continue splice did not fire"
exit 1
fi
# --- kept declined: per-row handle-returning insert inside the loop ---
if ! grep -q '__store_inserth_kept_event.handler(' output_emitted.zig; then
echo "FAIL: kept lost its per-row handle insert"
exit 1
fi
KEPT_LOOP=$(awk '/FLOW: .*for\(\)$/,/^ }$/' output_emitted.zig | grep -c 'inserth_kept')
if [ "$KEPT_LOOP" -lt 1 ]; then
echo "FAIL: kept's insert is not inside a for flow"
exit 1
fi
# --- JS target: never bulk — the event call stays per row ---
if [ -f output_emitted.js ]; then
if grep -q '__koru_bulk' output_emitted.js; then
echo "FAIL: JS lane emitted bulk append text"
exit 1
fi
if ! grep -q '__store_insert_marks_event.handler' output_emitted.js; then
echo "FAIL: JS lost the per-row insert call for marks"
exit 1
fi
fi
echo "PASS: counted-for insert lowers to bulk append; observed store stays per-row"
exit 0