✓
Passing This code compiles and runs correctly.
Code
// BULK INSERT WITH HANDLES — a counted `for` insert into a store that
// carries generational handles still lowers to the batched fill. The
// emitted loop mints the SAME slot sequence the per-row path would —
// freelist pops in LIFO order (`free[frem-1-j]`), then bump allocations
// (`next+k`) — so refilled rows carry bit-identical handles and the
// freelist drains in the same order. The only per-row cost that cannot
// be batched is a reactive enter, and that is positional: a rule fires
// for insert sites BELOW its declaration (`__site_line > qs.line`), so
// sites declared ABOVE every rule are provably safe to batch.
//
// `units` carries handles because `snap` names them with `[id]`.
// `fill` and `refill` sit above every rule's declaration — both bulk.
// `tallyfill` sits below `counter`, so it stays per-row and the rule
// fires on each of its inserts: tally lands at 2, proving the reactive
// enters the batch path would have skipped still happen.
//
// The freelist-order pin: cull takes slot 1 (hp 10), cull2 takes slot 3
// (hp 30) — freelist [1, 3]. `refill` pops LIFO: hp 100 mints slot 3,
// hp 200 mints slot 1. `snap` then records each live row's packed handle
// beside its hp; the printed pairs prove which slot each refilled row
// took (generation 1 sits in the high bits of both refilled handles).
import std/io
import std/store
import std/control
std/store:new(units, capacity: 64) { hp: i64 }
std/store:new(seen, capacity: 16) { h: 0[i64], hp: 0[i64] }
std/store:new(tally) { n: 0[i64] }
tor fill {}
fill = for(0..4)
! each i |> std/store:insert(units) { hp: @intCast(i * 10) }
tor refill {}
refill = for(0..2)
! each i |> std/store:insert(units) { hp: @intCast(100 + i * 100) }
tor counter {}
counter = std/store:rule(units)
! row e when e.hp == 999 |> std/store:stored { tally.n: tally.n + 1 }
tor tallyfill {}
tallyfill = for(0..2)
! each _ |> std/store:insert(units) { hp: 999 }
tor cull {}
cull = std/store:rule(units)
! row e when e.hp == 10 |> std/store:take(units[e])
| item _ |> _
tor cull2 {}
cull2 = std/store:rule(units)
! row e when e.hp == 30 |> std/store:take(units[e])
| item _ |> _
tor snap {}
snap = std/store:rule(units)
! row { [row]e, [id]h } |> std/store:insert(seen) { h, hp: e.hp }
| full |> _
fill()
tallyfill()
cull()
cull2()
refill()
snap()
std/io:print.ln("tally {{ tally.n:d }}")
std/io:print.ln("units {{ units.len:d }}")
std/store:query(seen)
! query s |> std/io:print.ln("h {{ s.h:d }} hp {{ s.hp:d }}")
Actual
tally 2
units 6
h 16777216 hp 0
h 16777221 hp 999
h 16777218 hp 20
h 16777220 hp 999
h 4311744515 hp 100
h 4311744513 hp 200
Expected output
✓ Zig✓ C#tally 2
units 6
h 16777216 hp 0
h 16777221 hp 999
h 16777218 hp 20
h 16777220 hp 999
h 4311744515 hp 100
h 4311744513 hp 200
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 'units' created (SoA cell + insert/query/write/take/stripe units); fields hp: i64
// std/store: plural store 'seen' created (SoA cell + insert/query/write/take/stripe units); fields h: i64, hp: i64
// std/store: 'tally' created (cell + write-subflow at module scope); fields n: i64
pub const fill_event = struct {
pub const Input = struct {
};
pub const Output = void;
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> SUBFLOW: tests/regression/600_STDLIB/690_STORE/690_338_bulk_insert_mints_handles_freelist_order/input.k:32
_ = &__koru_event_input;
{
const __koru_bulk_lo = (0);
const __koru_bulk_hi = (4);
const __koru_bulk_n = __koru_bulk_hi - __koru_bulk_lo;
if (__koru_bulk_n > 64 - __koru_store_units.len) @panic("std/store: store 'units' is full (capacity 64) - declared capacity and the `| full` branch are pinned at 690_011");
const __koru_bulk_base = __koru_store_units.len;
const __koru_bulk_frem = __koru_store_units.__koru_hslot_free_len;
var __koru_bulk_fresh = __koru_store_units.__koru_hslot_next;
const __koru_bulk_idt = __koru_store_units.__koru_ident;
for (0..__koru_bulk_n) |__koru_bulk_j| {
const __koru_bulk_slot = if (__koru_bulk_j < __koru_bulk_frem) __koru_store_units.__koru_hslot_free[__koru_bulk_frem - 1 - __koru_bulk_j] else blk_hm: { const __koru_s2 = __koru_bulk_fresh; __koru_bulk_fresh += 1; break :blk_hm __koru_s2; };
if (!__koru_bulk_idt) {
__koru_store_units.__koru_row_hslot[__koru_bulk_base + __koru_bulk_j] = __koru_bulk_slot;
__koru_store_units.__koru_hslot_row[__koru_bulk_slot] = __koru_bulk_base + __koru_bulk_j;
}
const i = __koru_bulk_lo + __koru_bulk_j;
__koru_store_units.hp[__koru_bulk_base + __koru_bulk_j] = @intCast(i * 10);
}
__koru_store_units.__koru_hslot_free_len = __koru_bulk_frem -| __koru_bulk_n;
__koru_store_units.__koru_hslot_next = __koru_bulk_fresh;
__koru_store_units.len += __koru_bulk_n;
}
{ }
}
};
pub const refill_event = struct {
pub const Input = struct {
};
pub const Output = void;
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> SUBFLOW: tests/regression/600_STDLIB/690_STORE/690_338_bulk_insert_mints_handles_freelist_order/input.k:36
_ = &__koru_event_input;
{
const __koru_bulk_lo = (0);
const __koru_bulk_hi = (2);
const __koru_bulk_n = __koru_bulk_hi - __koru_bulk_lo;
if (__koru_bulk_n > 64 - __koru_store_units.len) @panic("std/store: store 'units' is full (capacity 64) - declared capacity and the `| full` branch are pinned at 690_011");
const __koru_bulk_base = __koru_store_units.len;
const __koru_bulk_frem = __koru_store_units.__koru_hslot_free_len;
var __koru_bulk_fresh = __koru_store_units.__koru_hslot_next;
const __koru_bulk_idt = __koru_store_units.__koru_ident;
for (0..__koru_bulk_n) |__koru_bulk_j| {
const __koru_bulk_slot = if (__koru_bulk_j < __koru_bulk_frem) __koru_store_units.__koru_hslot_free[__koru_bulk_frem - 1 - __koru_bulk_j] else blk_hm: { const __koru_s2 = __koru_bulk_fresh; __koru_bulk_fresh += 1; break :blk_hm __koru_s2; };
if (!__koru_bulk_idt) {
__koru_store_units.__koru_row_hslot[__koru_bulk_base + __koru_bulk_j] = __koru_bulk_slot;
__koru_store_units.__koru_hslot_row[__koru_bulk_slot] = __koru_bulk_base + __koru_bulk_j;
}
const i = __koru_bulk_lo + __koru_bulk_j;
__koru_store_units.hp[__koru_bulk_base + __koru_bulk_j] = @intCast(100 + i * 100);
}
__koru_store_units.__koru_hslot_free_len = __koru_bulk_frem -| __koru_bulk_n;
__koru_store_units.__koru_hslot_next = __koru_bulk_fresh;
__koru_store_units.len += __koru_bulk_n;
}
{ }
}
};
pub const tallyfill_event = struct {
pub const Input = struct {
};
pub const Output = void;
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> SUBFLOW: tests/regression/600_STDLIB/690_STORE/690_338_bulk_insert_mints_handles_freelist_order/input.k:44
_ = &__koru_event_input;
for (0..2) |__koru_item4| {
{ const _auto_6 = __koru_item4; _ = &_auto_6; _ = main_module.__store_insert_units_event.handler(.{ .hp = 999, .__site_line = 45 });
}
}
{ }
}
};
pub const cull_event = struct {
pub const Input = struct {
};
pub const Output = void;
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> SUBFLOW: tests/regression/600_STDLIB/690_STORE/690_338_bulk_insert_mints_handles_freelist_order/input.k:48
_ = &__koru_event_input;
const result = main_module.__store_qsweep_units_L48_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.handler(.{ });
_ = &result;
}
};
pub const cull2_event = struct {
pub const Input = struct {
};
pub const Output = void;
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> SUBFLOW: tests/regression/600_STDLIB/690_STORE/690_338_bulk_insert_mints_handles_freelist_order/input.k:53
_ = &__koru_event_input;
const result = main_module.__store_qsweep_units_L53_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.handler(.{ });
_ = &result;
}
};
pub const snap_event = struct {
pub const Input = struct {
};
pub const Output = void;
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> SUBFLOW: tests/regression/600_STDLIB/690_STORE/690_338_bulk_insert_mints_handles_freelist_order/input.k:58
_ = &__koru_event_input;
const result = main_module.__store_qsweep_units_L58_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.handler(.{ });
_ = &result;
}
};
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_338_bulk_insert_mints_handles_freelist_order/input.k:62 ~input:fill()
pub fn flow0() void {
_ = main_module.fill_event.handler(.{ });
}
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_338_bulk_insert_mints_handles_freelist_order/input.k:63 ~input:tallyfill()
pub fn flow1() void {
_ = main_module.tallyfill_event.handler(.{ });
}
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_338_bulk_insert_mints_handles_freelist_order/input.k:64 ~input:cull()
pub fn flow2() void {
_ = main_module.cull_event.handler(.{ });
}
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_338_bulk_insert_mints_handles_freelist_order/input.k:65 ~input:cull2()
pub fn flow3() void {
_ = main_module.cull2_event.handler(.{ });
}
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_338_bulk_insert_mints_handles_freelist_order/input.k:66 ~input:refill()
pub fn flow4() void {
_ = main_module.refill_event.handler(.{ });
}
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_338_bulk_insert_mints_handles_freelist_order/input.k:67 ~input:snap()
pub fn flow5() void {
_ = main_module.snap_event.handler(.{ });
}
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_338_bulk_insert_mints_handles_freelist_order/input.k:69 ~std.io:print.impl()
pub fn flow6() 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("tally {d}\n", .{__koru_store_tally.n});
}
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_338_bulk_insert_mints_handles_freelist_order/input.k:70 ~std.io:print.impl()
pub fn flow7() 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("units {d}\n", .{__koru_store_units.len});
}
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_338_bulk_insert_mints_handles_freelist_order/input.k:71 ~input:__store_sweeprun_seen_L72_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed()
pub fn flow8() void {
_ = main_module.__store_sweeprun_seen_L72_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.handler(.{ });
}
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_units = struct {
hp: [64]i64 = undefined,
len: usize = 0,
__koru_hslot_row: [64]usize = undefined,
__koru_hslot_gen: [64]u32 = [_]u32{0} ** 64,
__koru_row_hslot: [64]usize = undefined,
__koru_hslot_free: [64]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 = 1;
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: 'units[...]' 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 'units' - 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 'units' - the row it addressed was removed (stale-handle trap pinned at 690_115)");
}
return self.__koru_row_of(h) orelse @panic("std/store: 'units[...]' 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_units: __KoruStoreT_units = .{};
const __KoruStoreRow_units = struct { hp: i64 };
pub const __store_insert_units_event = struct {
pub const Input = struct {
hp: 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.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_insert_units [tests/regression/600_STDLIB/690_STORE/690_338_bulk_insert_mints_handles_freelist_order/input.k:27]
const hp = __koru_event_input.hp;
const __site_line = __koru_event_input.__site_line;
_ = &hp;
_ = &__site_line;
_ =
... [truncated - 49KB 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 'units' created (SoA cell + insert/query/write/take/stripe units); fields hp: i64
// std/store: plural store 'seen' created (SoA cell + insert/query/write/take/stripe units); fields h: i64, hp: i64
// std/store: 'tally' created (cell + write-subflow at module scope); fields n: i64
static class __koru_store_units {
public static long[] hp = new long[64];
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[64];
public static long[] __koru_hslot_gen = new long[64];
public static long[] __koru_row_hslot = new long[64];
public static long[] __koru_hslot_free = new long[64];
public static long __koru_hslot_free_len = 0;
public static long __koru_hslot_next = 0;
public static long __koru_brand = 1;
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: 'units[...]' 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 'units' - 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 'units' - 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: 'units[...]' 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_seen {
public static long[] h = new long[16];
public static long[] hp = new long[16];
public static long len = 0;
public static long __koru_brand = -1;
}
static class __koru_store_tally {
public static long n = 0;
public static long __koru_brand = -1;
}
public static class fill_event {
public struct Input {
}
public static dynamic handler(Input __koru_input) {
{
var __koru_bulk_lo = (0);
var __koru_bulk_hi = (4);
var __koru_bulk_n = __koru_bulk_hi - __koru_bulk_lo;
if (__koru_bulk_n > 64 - __koru_store_units.len) throw new global::System.Exception("std/store: store 'units' is full (capacity 64) - declared capacity and the `| full` branch are pinned at 690_011");
var __koru_bulk_base = __koru_store_units.len;
var __koru_bulk_frem = __koru_store_units.__koru_hslot_free_len;
var __koru_bulk_fresh = __koru_store_units.__koru_hslot_next;
var __koru_bulk_idt = __koru_store_units.__koru_ident;
for (var __koru_bulk_j = 0L; __koru_bulk_j < __koru_bulk_n; __koru_bulk_j++) {
long __koru_bulk_slot;
if (__koru_bulk_j < __koru_bulk_frem) { __koru_bulk_slot = __koru_store_units.__koru_hslot_free[__koru_bulk_frem - 1 - __koru_bulk_j]; } else { __koru_bulk_slot = __koru_bulk_fresh; __koru_bulk_fresh += 1; }
if (!__koru_bulk_idt) {
__koru_store_units.__koru_row_hslot[__koru_bulk_base + __koru_bulk_j] = __koru_bulk_slot;
__koru_store_units.__koru_hslot_row[__koru_bulk_slot] = __koru_bulk_base + __koru_bulk_j;
}
var i = __koru_bulk_lo + __koru_bulk_j;
__koru_store_units.hp[__koru_bulk_base + __koru_bulk_j] = (i * 10);
}
__koru_store_units.__koru_hslot_free_len = global::System.Math.Max(0, __koru_bulk_frem - __koru_bulk_n);
__koru_store_units.__koru_hslot_next = __koru_bulk_fresh;
__koru_store_units.len += __koru_bulk_n;
}
{ }
return default;
}
}
public static class refill_event {
public struct Input {
}
public static dynamic handler(Input __koru_input) {
{
var __koru_bulk_lo = (0);
var __koru_bulk_hi = (2);
var __koru_bulk_n = __koru_bulk_hi - __koru_bulk_lo;
if (__koru_bulk_n > 64 - __koru_store_units.len) throw new global::System.Exception("std/store: store 'units' is full (capacity 64) - declared capacity and the `| full` branch are pinned at 690_011");
var __koru_bulk_base = __koru_store_units.len;
var __koru_bulk_frem = __koru_store_units.__koru_hslot_free_len;
var __koru_bulk_fresh = __koru_store_units.__koru_hslot_next;
var __koru_bulk_idt = __koru_store_units.__koru_ident;
for (var __koru_bulk_j = 0L; __koru_bulk_j < __koru_bulk_n; __koru_bulk_j++) {
long __koru_bulk_slot;
if (__koru_bulk_j < __koru_bulk_frem) { __koru_bulk_slot = __koru_store_units.__koru_hslot_free[__koru_bulk_frem - 1 - __koru_bulk_j]; } else { __koru_bulk_slot = __koru_bulk_fresh; __koru_bulk_fresh += 1; }
if (!__koru_bulk_idt) {
__koru_store_units.__koru_row_hslot[__koru_bulk_base + __koru_bulk_j] = __koru_bulk_slot;
__koru_store_units.__koru_hslot_row[__koru_bulk_slot] = __koru_bulk_base + __koru_bulk_j;
}
var i = __koru_bulk_lo + __koru_bulk_j;
__koru_store_units.hp[__koru_bulk_base + __koru_bulk_j] = (100 + i * 100);
}
__koru_store_units.__koru_hslot_free_len = global::System.Math.Max(0, __koru_bulk_frem - __koru_bulk_n);
__koru_store_units.__koru_hslot_next = __koru_bulk_fresh;
__koru_store_units.len += __koru_bulk_n;
}
{ }
return default;
}
}
public static class tallyfill_event {
public struct Input {
}
public static dynamic handler(Input __koru_input) {
for (long __koru_item4 = 0; __koru_item4 < 2; __koru_item4++) {
{ var _auto_6 = __koru_item4; {
var __koru_p_hp = (long)(999);
var __koru_p___site_line = (long)(45);
if (__koru_store_units.len >= 64) throw new global::System.Exception("std/store: store 'units' is full (capacity 64) - declared capacity and the `| full` branch are pinned at 690_011");
long __koru_new_row = __koru_store_units.len;
long __koru_hslot;
if (__koru_store_units.__koru_hslot_free_len > 0) {
__koru_store_units.__koru_hslot_free_len -= 1;
__koru_hslot = __koru_store_units.__koru_hslot_free[__koru_store_units.__koru_hslot_free_len];
} else {
__koru_hslot = __koru_store_units.__koru_hslot_next;
__koru_store_units.__koru_hslot_next += 1;
}
if (!__koru_store_units.__koru_ident) {
__koru_store_units.__koru_hslot_row[__koru_hslot] = __koru_new_row;
__koru_store_units.__koru_row_hslot[__koru_new_row] = __koru_hslot;
}
__koru_store_units.hp[__koru_new_row] = __koru_p_hp;
__koru_store_units.len += 1;
if (__koru_p___site_line > 40) {
main_module.__store_qrow_units_L40_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.handler(new main_module.__store_qrow_units_L40_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.Input { row = __koru_new_row });
}
if (__koru_p___site_line > 48) {
main_module.__store_qrow_units_L48_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.handler(new main_module.__store_qrow_units_L48_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.Input { row = __koru_new_row });
}
if (__koru_p___site_line > 53) {
main_module.__store_qrow_units_L53_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.handler(new main_module.__store_qrow_units_L53_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.Input { row = __koru_new_row });
}
if (__koru_p___site_line > 58) {
main_module.__store_qrow_units_L58_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.handler(new main_module.__store_qrow_units_L58_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.Input { row = __koru_new_row });
}
}
}
}
{ }
return default;
}
}
public static class cull_event {
public struct Input {
}
public static dynamic handler(Input __koru_input) {
{
long __koru_i = 0;
while (__koru_i < __koru_store_units.len) {
long __koru_len_before = __koru_store_units.len;
main_module.__store_qrow_units_L48_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.handler(new main_module.__store_qrow_units_L48_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.Input { row = __koru_i });
if (__koru_store_units.len >= __koru_len_before) __koru_i += 1;
}
}
return default;
}
}
public static class cull2_event {
public struct Input {
}
public static dynamic handler(Input __koru_input) {
{
long __koru_i = 0;
while (__koru_i < __koru_store_units.len) {
long __koru_len_before = __koru_store_units.len;
main_module.__store_qrow_units_L53_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.handler(new main_module.__store_qrow_units_L53_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.Input { row = __koru_i });
if (__koru_store_units.len >= __koru_len_before) __koru_i += 1;
}
}
return default;
}
}
public static class snap_event {
public struct Input {
}
public static dynamic handler(Input __koru_input) {
{
for (long __koru_i = 0; __koru_i < __koru_store_units.len; __koru_i++) {
main_module.__store_qrow_units_L58_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.handler(new main_module.__store_qrow_units_L58_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.Input { row = __koru_i });
}
}
return default;
}
}
public static class __store_insert_units_event {
public struct Input {
public long hp;
public long __site_line;
}
public static dynamic handler(Input __koru_input) {
var hp = __koru_input.hp;
var __site_line = __koru_input.__site_line;
if (__koru_store_units.len >= 64) throw new global::System.Exception("std/store: store 'units' is full (capacity 64) - declared capacity and the `| full` branch are pinned at 690_011");
long __koru_new_row = __koru_store_units.len;
long __koru_hslot;
if (__koru_store_units.__koru_hslot_free_len > 0) {
__koru_store_units.__koru_hslot_free_len -= 1;
__koru_hslot = __koru_store_units.__koru_hslot_free[__koru_store_units.__koru_hslot_free_len];
} else {
__koru_hslot = __koru_store_units.__koru_hslot_next;
__koru_store_units.__koru_hslot_next += 1;
}
if (!__koru_store_units.__koru_ident) {
__koru_store_units.__koru_hslot_row[__koru_hslot] = __koru_new_row;
__koru_store_units.__koru_row_hslot[__koru_new_row] = __koru_hslot;
}
__koru_store_units.hp[__koru_new_row] = hp;
__koru_store_units.len += 1;
if (__site_line > 40) {
main_module.__store_qrow_units_L40_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.handler(new main_module.__store_qrow_units_L40_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.Input { row = __koru_new_row });
}
if (__site_line > 48) {
main_module.__store_qrow_units_L48_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.handler(new main_module.__store_qrow_units_L48_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.Input { row = __koru_new_row });
}
if (__site_line > 53) {
main_module.__store_qrow_units_L53_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.handler(new main_module.__store_qrow_units_L53_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.Input { row = __koru_new_row });
}
if (__site_line > 58) {
main_module.__store_qrow_units_L58_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.handler(new main_module.__store_qrow_units_L58_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.Input { row = __koru_new_row });
}
return default;
}
}
public static class __store_apply_units_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_units.hp[__koru_r] = value_0; return new Output { tag = "hp", hp = value_0 }; }
}
throw new global::System.Exception("__store_apply_units: field index " + field + " is not a column of store 'units'");
return default;
}
}
public static class __store_qrow_units_L40_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event {
public struct Input {
public long row;
}
public static dynamic handler(Input __koru_input) {
var row = __koru_input.row;
var __koru_r = row;
var hp = __koru_store_units.hp[__koru_r];
if (!(hp == 999)) return default;
main_module.__store_qbody_units_L40_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.handler(new main_module.__store_qbody_units_L40_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.Input { hp = hp, __koru_sdix_rule_L40 = __koru_r });
return default;
}
}
public static class __store_qbody_units_L40_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event {
public struct Input {
public long hp;
public long __koru_sdix_rule_L40;
}
public static dynamic handler(Input __koru_input) {
var hp = __koru_input.hp;
var __koru_sdix_rule_L40 = __koru_input.__koru_sdix_rule_L40;
main_module.__store_write_tally_event.handler(new __store_write_tally_event.Input { field = (long)(0), value = (long)(__koru_store_tally.n + 1)});
return default;
}
}
public static class __store_qsweep_units_L40_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event {
public struct Input {
}
public static dynamic handler(Input __koru_input) {
for (long __koru_i = 0; __koru_i < __koru_store_units.len; __koru_i++) {
main_module.__store_qrow_units_L40_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.handler(new main_module.__store_qrow_units_L40_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.Input { row = __koru_i });
}
return default;
}
}
public static class __store_qrow_units_L48_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event {
public struct Input {
public long row;
}
public static dynamic handler(Input __koru_input) {
var row = __koru_input.row;
var __koru_r = row;
var hp = __koru_store_units.hp[__koru_r];
if (!(hp == 10)) return default;
main_module.__store_qbody_units_L48_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.handler(new main_module.__store_qbody_units_L48_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.Input { hp = hp, __koru_qrow = __koru_store_units.__koru_handle_of(__koru_r) });
return default;
}
}
public static class __store_qbody_units_L48_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event {
public struct Input {
public long hp;
public long __koru_qrow;
}
public static dynamic handler(Input __koru_input) {
var hp = __koru_input.hp;
var __koru_qrow = __koru_input.__koru_qrow;
var result_0 = main_module.__store_take_units_event.handler(new __store_take_units_event.Input { row = (long)(__koru_qrow)});
if (result_0.tag == "item") {
var _auto_9 = result_0.item;
}
if (result_0.tag == "empty") {
var _auto_10 = result_0.empty;
throw new global::System.Exception("__store_take_units: unhandled panic branch 'empty' fired at runtime");
}
return default;
}
}
public static class __store_qsweep_units_L48_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event {
public struct Input {
}
public static dynamic handler(Input __koru_input) {
long __koru_i = 0;
while (__koru_i < __koru_store_units.len) {
long __koru_len_before = __koru_store_units.len;
main_module.__store_qrow_units_L48_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.handler(new main_module.__store_qrow_units_L48_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event.Input { row = __koru_i });
if (__koru_store_units.len >= __koru_len_before) __koru_i += 1;
}
return default;
}
}
public static class __store_qrow_units_L53_690_338_bulk_insert_mints_handles_freelist_order_input_6c44ed_event {
public struct Input {
public long row;
}
public static dynamic handler(Input __koru_input) {
var row = __koru_input.row;
var __koru_r = row;
var hp = __koru_store_units.hp[__koru_r];
if (!(hp == 30)) return default;
main_module.__store_
... [truncated - 33KB total]Flows
flow ~new click a branch to expand · @labels scroll to their anchor
new (units, capacity: 64, source: hp: i64)
flow ~new click a branch to expand · @labels scroll to their anchor
new (seen, capacity: 16, source: h: 0[i64], hp: 0[i64])
flow ~new click a branch to expand · @labels scroll to their anchor
new (tally, source: n: 0[i64])
subflow ~fill click a branch to expand · @labels scroll to their anchor
for (0..4)
subflow ~refill click a branch to expand · @labels scroll to their anchor
for (0..2)
subflow ~counter click a branch to expand · @labels scroll to their anchor
rule (units)
subflow ~tallyfill click a branch to expand · @labels scroll to their anchor
for (0..2)
subflow ~cull click a branch to expand · @labels scroll to their anchor
rule (units)
subflow ~cull2 click a branch to expand · @labels scroll to their anchor
rule (units)
subflow ~snap click a branch to expand · @labels scroll to their anchor
rule (units)
flow ~fill click a branch to expand · @labels scroll to their anchor
fill
flow ~tallyfill click a branch to expand · @labels scroll to their anchor
tallyfill
flow ~cull click a branch to expand · @labels scroll to their anchor
cull
flow ~cull2 click a branch to expand · @labels scroll to their anchor
cull2
flow ~refill click a branch to expand · @labels scroll to their anchor
refill
flow ~snap click a branch to expand · @labels scroll to their anchor
snap
flow ~print.ln click a branch to expand · @labels scroll to their anchor
print.ln (expr: "tally {{ tally.n:d }}")
flow ~print.ln click a branch to expand · @labels scroll to their anchor
print.ln (expr: "units {{ units.len:d }}")
flow ~query click a branch to expand · @labels scroll to their anchor
query (seen)
Test Configuration
MUST_RUN LANGUAGES: zig cs
Post-validation Script:
#!/bin/bash
# Emitted-shape oracle for bulk insert with handles. `units` carries
# generational handles (`snap` names them via `[id]`), so its counted
# `for` fills lower to the bulk block WITH slot minting: LIFO freelist
# pops (`free[frem-1-j]`), bump-fresh for the rest, both map writes,
# and the free_len/next writeback after the loop. `tallyfill` sits below
# the `counter` rule's declaration, so it declines — the per-row insert
# call and its reactive `__site_line` gate must still be in the emit.
set -u
if [ ! -f output_emitted.zig ]; then
echo "FAIL: no output_emitted.zig"
exit 1
fi
# --- the bulk block mints handles: freelist-pop-then-bump ---
if ! grep -q '__koru_bulk_frem = __koru_store_units.__koru_hslot_free_len' output_emitted.zig; then
echo "FAIL: no freelist length captured for units"
exit 1
fi
if ! grep -q '__koru_bulk_fresh = __koru_store_units.__koru_hslot_next' output_emitted.zig; then
echo "FAIL: no bump-alloc cursor captured for units"
exit 1
fi
if ! grep -q '__koru_store_units.__koru_hslot_free\[__koru_bulk_frem - 1 - __koru_bulk_j\]' output_emitted.zig; then
echo "FAIL: freelist pops are not LIFO-ordered"
exit 1
fi
if ! grep -q '__koru_store_units.__koru_row_hslot\[__koru_bulk_base + __koru_bulk_j\] = __koru_bulk_slot' output_emitted.zig; then
echo "FAIL: row->slot map write missing"
exit 1
fi
if ! grep -q '__koru_store_units.__koru_hslot_row\[__koru_bulk_slot\] = __koru_bulk_base + __koru_bulk_j' output_emitted.zig; then
echo "FAIL: slot->row map write missing"
exit 1
fi
if ! grep -q '__koru_store_units.__koru_hslot_free_len = __koru_bulk_frem -| __koru_bulk_n' output_emitted.zig; then
echo "FAIL: freelist writeback missing"
exit 1
fi
if ! grep -q '__koru_store_units.__koru_hslot_next = __koru_bulk_fresh' output_emitted.zig; then
echo "FAIL: bump-alloc writeback missing"
exit 1
fi
# --- tallyfill declined: per-row insert call + reactive enter gate ---
if ! grep -q '__store_insert_units_event.handler(' output_emitted.zig; then
echo "FAIL: declined site lost its per-row insert call"
exit 1
fi
if ! grep -q 'if (__site_line >' output_emitted.zig; then
echo "FAIL: declined site lost its reactive enter gate"
exit 1
fi
echo "PASS: counted-for insert into a handle store bulks with exact mint order; below-rule site stays per-row"
exit 0