✓
Passing This code compiles and runs correctly.
Code
// Test: `koruc explain` reports index routing — the SQL-EXPLAIN namesake
// rung. A `std/indexes:store(players, key)` declaration shows as an
// `index = key` row witnessed by the declaration's own site hash, and each
// query site gets the plan the transform's own fold decides: a `! first`
// whose `when` names the indexed column is an `index lookup`, a `! query`
// is a `sweep`, and a `! first` on a non-indexed column is a `sweep` that
// stops at first match. A `[tree]` store plans its queries like any other
// — the fold reports the transform's own column surface, so a guard on a
// real column plans a sweep and a guard on the invisible `parent` would
// refuse with the transform's own words, never a guessed plan. Sites
// inside continuations count too — the two `| row`-chained inserts and
// queries nested under `|>` pipelines are folded, not just flow heads,
// and a site nested four invocations deep still carries its witness.
// The program itself still runs — the plans it reports are the routes it
// executes.
import std/io
import std/store
import std/indexes
import std/explain
std/store:new(players, capacity: 8) { key: i64, val: i64 }
std/indexes:store(players, key)
std/store:insert(players) { key: 10, val: 100 }
| row a |> std/store:insert(players) { key: 20, val: 200 }
| row b |> std/store:insert(players) { key: 30, val: 300 }
|> std/io:print.ln("seeded")
|> std/store:query(players)
! first p when p.key == 30 |> std/io:print.ln("nested {{ p.val:d }}")
| none |> std/io:print.ln("nested none")
// routed: the guard's equality is on the indexed column
std/store:query(players)
! first p when p.key == 30 |> std/io:print.ln("first {{ p.val:d }}")
| none |> std/io:print.ln("first none")
// sweep: visits every row
std/store:query(players)
! query q |> std/io:print.ln("row {{ q.key:d }}")
// scan: the predicate names a non-indexed column — same `! first`
// spelling, no index to route through
std/store:query(players)
! first p when p.val == 100 |> std/io:print.ln("scan {{ p.val:d }}")
| none |> std/io:print.ln("scan none")
// a [tree] store: its `parent` self-FK is synthesized by the annotation
// and invisible to the query surface — plans for it read the same column
// list the transform does
[tree]std/store:new(tree, capacity: 4) { val: i64 }
std/store:insert(tree) { val: 10 }
| row r |> std/store:insert(tree) { val: 20 }
|> std/store:query(tree)
! first n when n.val == 20 |> std/io:print.ln("tree nested {{ n.val:d }}")
| none |> std/io:print.ln("tree none")
std/store:query(tree)
! first n when n.val == 10 |> std/io:print.ln("root {{ n.val:d }}")
| none |> std/io:print.ln("no root")
Actual
seeded
nested 300
first 300
row 10
row 20
row 30
scan 100
tree nested 20
root 10
Expected output
✓ Zig✓ C#seeded
nested 300
first 300
row 10
row 20
row 30
scan 100
tree nested 20
root 10
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 'players' created (SoA cell + insert/query/write/take/stripe units); fields key: i64, val: i64
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_330_explain_reports_index_plan/input.k:25 ~input:__store_inserth_players()
pub fn flow0() void {
const result_0 = main_module.__store_inserth_players_event.handler(.{ .key = 10, .val = 100, .__site_line = 25 });
const a = result_0.row;
_ = &a;
const result_1 = main_module.__store_inserth_players_event.handler(.{ .key = 20, .val = 200, .__site_line = 26 });
_ = &result_1;
const b = result_1.row;
_ = &b;
const result_2 = main_module.__store_insert_players_event.handler(.{ .key = 30, .val = 300, .__site_line = 27 });
_ = &result_2;
(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("seeded\n", .{});
_ = main_module.__store_sweeprun_players_L30_690_330_explain_reports_index_plan_input_32129c_event.handler(.{ });
}
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_330_explain_reports_index_plan/input.k:34 ~input:__store_sweeprun_players_L35_690_330_explain_reports_index_plan_input_32129c()
pub fn flow1() void {
_ = main_module.__store_sweeprun_players_L35_690_330_explain_reports_index_plan_input_32129c_event.handler(.{ });
}
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_330_explain_reports_index_plan/input.k:39 ~input:__store_sweeprun_players_L40_690_330_explain_reports_index_plan_input_32129c()
pub fn flow2() void {
_ = main_module.__store_sweeprun_players_L40_690_330_explain_reports_index_plan_input_32129c_event.handler(.{ });
}
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_330_explain_reports_index_plan/input.k:44 ~input:__store_sweeprun_players_L45_690_330_explain_reports_index_plan_input_32129c()
pub fn flow3() void {
_ = main_module.__store_sweeprun_players_L45_690_330_explain_reports_index_plan_input_32129c_event.handler(.{ });
}
// std/store: plural store 'tree' created (SoA cell + insert/query/write/take/stripe units); fields val: i64
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_330_explain_reports_index_plan/input.k:53 ~input:__store_inserth_tree()
pub fn flow4() void {
const result_0 = main_module.__store_inserth_tree_event.handler(.{ .val = 10, .__site_line = 53 });
const r = result_0.row;
_ = &r;
const result_1 = main_module.__store_insert_tree_event.handler(.{ .val = 20, .__site_line = 54 });
_ = &result_1;
_ = main_module.__store_sweeprun_tree_L56_690_330_explain_reports_index_plan_input_32129c_event.handler(.{ });
}
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_330_explain_reports_index_plan/input.k:59 ~input:__store_sweeprun_tree_L60_690_330_explain_reports_index_plan_input_32129c()
pub fn flow5() void {
_ = main_module.__store_sweeprun_tree_L60_690_330_explain_reports_index_plan_input_32129c_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_players = struct {
key: [8]i64 = undefined,
val: [8]i64 = undefined,
len: usize = 0,
__index_key: @import("std").AutoHashMapUnmanaged(i64, @import("std").ArrayListUnmanaged(i64)) = .{},
__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 = 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: 'players[...]' 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 'players' - 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 'players' - the row it addressed was removed (stale-handle trap pinned at 690_115)");
}
return self.__koru_row_of(h) orelse @panic("std/store: 'players[...]' 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_players: __KoruStoreT_players = .{};
const __KoruStoreRow_players = struct { key: i64, val: i64 };
pub const __store_insert_players_event = struct {
pub const Input = struct {
key: i64,
val: 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.key, __koru_event_input.val, __koru_event_input.__site_line);
}
fn __koru_handler_impl(__koru_p_0: i64, __koru_p_1: i64, __koru_p_2: i64) @This().Output {
const __koru_event_input: @This().Input = .{ .key = __koru_p_0, .val = __koru_p_1, .__site_line = __koru_p_2 };
// >>> PROC: __store_insert_players [tests/regression/600_STDLIB/690_STORE/690_330_explain_reports_index_plan/input.k:22]
const key = __koru_event_input.key;
const val = __koru_event_input.val;
const __site_line = __koru_event_input.__site_line;
_ = &key;
_ = &val;
_ = &__site_line;
_ = &__koru_event_input;
if (__koru_store_players.len >= 8) @panic("std/store: store 'players' is full (capacity 8) - declared capacity and the `| full` branch are pinned at 690_011");
const __koru_new_row = __koru_store_players.len;
const __koru_hslot = if (__koru_store_players.__koru_hslot_free_len > 0) blk_hs: {
__koru_store_players.__koru_hslot_free_len -= 1;
break :blk_hs __koru_store_players.__koru_hslot_free[__koru_store_players.__koru_hslot_free_len];
} else blk_hs: {
const __koru_hn = __koru_store_players.__koru_hslot_next;
__koru_store_players.__koru_hslot_next += 1;
break :blk_hs __koru_hn;
};
if (!__koru_store_players.__koru_ident) {
__koru_store_players.__koru_hslot_row[__koru_hslot] = __koru_new_row;
__koru_store_players.__koru_row_hslot[__koru_new_row] = __koru_hslot;
}
__koru_store_players.key[__koru_new_row] = key;
__koru_store_players.val[__koru_new_row] = val;
__koru_store_players.len += 1;
const __koru_ik = __koru_store_players.key[__koru_new_row];
const __koru_ig = __koru_store_players.__index_key.getOrPut(koru_allocator(), __koru_ik) catch @panic("std/indexes: index insert ran out of memory");
if (!__koru_ig.found_existing) __koru_ig.value_ptr.* = .{};
__koru_ig.value_ptr.append(koru_allocator(), __koru_store_players.__koru_handle_of(__koru_new_row)) catch @panic("std/indexes: index insert ran out of memory");
return;
}
};
pub const __store_inserth_players_event = struct {
pub const Input = struct {
key: i64,
val: 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.key, __koru_event_input.val, __koru_event_input.__site_line);
}
fn __koru_handler_impl(__koru_p_0: i64, __koru_p_1: i64, __koru_p_2: i64) @This().Output {
const __koru_event_input: @This().Input = .{ .key = __koru_p_0, .val = __koru_p_1, .__site_line = __koru_p_2 };
// >>> PROC: __store_inserth_players [tests/regression/600_STDLIB/690_STORE/690_330_explain_reports_index_plan/input.k:22]
const key = __koru_event_input.key;
const val = __koru_event_input.val;
const __site_line = __koru_event_input.__site_line;
_ = &key;
_ = &val;
_ = &__site_line;
_ = &__koru_event_input;
if (__koru_store_players.len >= 8) @panic("std/store: store 'players' is full (capacity 8) - declared capacity and the `| full` branch are pinned at 690_011");
const __koru_new_row = __koru_store_players.len;
const __koru_hslot = if (__koru_store_players.__koru_hslot_free_len > 0) blk_hs: {
__koru_store_players.__koru_hslot_free_len -= 1;
break :blk_hs __koru_store_players.__koru_hslot_free[__koru_store_players.__koru_hslot_free_len];
} else blk_hs: {
const __koru_hn = __koru_store_players.__koru_hslot_next;
__koru_store_players.__koru_hslot_next += 1;
break :blk_hs __koru_hn;
};
if (!__koru_store_players.__koru_ident) {
__koru_store_players.__koru_hslot_row[__koru_hslot] = __koru_new_row;
__koru_store_players.__koru_row_hslot[__koru_new_row] = __koru_hslot;
}
__koru_store_players.key[__koru_new_row] = key;
__koru_store_players.val[__koru_new_row] = val;
__koru_store_players.len += 1;
const __koru_ik = __koru_store_players.key[__koru_new_row];
const __koru_ig = __koru_store_players.__index_key.getOrPut(koru_allocator(), __koru_ik) catch @panic("std/indexes: index insert ran out of memory");
if (!__koru_ig.found_existing) __koru_ig.value_ptr.* = .{};
__koru_ig.value_ptr.append(koru_allocator(), __koru_store_players.__koru_handle_of(__koru_new_row)) catch @panic("std/indexes: index insert ran out of memory");
return .{ .row = __koru_store_players.__koru_handle_of(__koru_new_row) };
}
};
pub const __store_apply_players_event = struct {
pub const Input = struct {
row: usize,
field: i64,
value_0: i64,
value_1: i64,
};
pub const Output = union(enum(u8)) {
key: i64,
val: i64,
};
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> PROC: __store_apply_players [tests/regression/600_STDLIB/690_STORE/690_330_explain_reports_index_plan/input.k:22]
const row = __koru_event_input.row;
const field = __koru_event_input.field;
const value_0 = __koru_event_input.value_0;
const value_1 = __koru_event_input.value_1;
_ = &row;
_ = &field;
_ = &value_0;
_ = &value_1;
_ = &__koru_event_input;
const __koru_r: usize = row;
return switch (field) {
0 => blk: { const __koru_iold = __koru_store_players.key[__koru_r];
const __koru_ih = __koru_store_players.__koru_handle_of(__koru_r);
__koru_store_players.key[__koru_r] = value_0; if (__koru_iold != value_0) {
if (__koru_store_players.__index_key.getPtr(__koru_iold)) |__koru_ib| {
for (__koru_ib.items, 0..) |__koru_im, __koru_mi| {
if (__koru_im == __koru_ih) { _ = __koru_ib.orderedRemove(__koru_mi); brea
... [truncated - 60KB 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 'players' created (SoA cell + insert/query/write/take/stripe units); fields key: i64, val: i64
// std/store: plural store 'tree' created (SoA cell + insert/query/write/take/stripe units); fields val: i64
static class __koru_store_players {
public static long[] key = new long[8];
public static dynamic __koru_read_key(long __h) { long __r = __koru_resolve(__h); return key[(int)__r]; }
public static long[] val = new long[8];
public static dynamic __koru_read_val(long __h) { long __r = __koru_resolve(__h); return val[(int)__r]; }
public static global::System.Collections.Generic.Dictionary<long, global::System.Collections.Generic.List<long>> __index_key = new global::System.Collections.Generic.Dictionary<long, global::System.Collections.Generic.List<long>>();
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 = 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: 'players[...]' 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 'players' - 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 'players' - 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: 'players[...]' 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_tree {
public static long[] val = new long[4];
public static dynamic __koru_read_val(long __h) { long __r = __koru_resolve(__h); return val[(int)__r]; }
public static long[] parent = new long[4];
public static dynamic __koru_read_parent(long __h) { long __r = __koru_resolve(__h); return parent[(int)__r]; }
public static long len = 0;
public static long[] __koru_hslot_row = new long[4];
public static long[] __koru_hslot_gen = new long[4];
public static long[] __koru_row_hslot = new long[4];
public static long[] __koru_hslot_free = new long[4];
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: 'tree[...]' 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 'tree' - 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 'tree' - 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: 'tree[...]' 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);
}
}
public static class __store_insert_players_event {
public struct Input {
public long key;
public long val;
public long __site_line;
}
public static dynamic handler(Input __koru_input) {
var key = __koru_input.key;
var val = __koru_input.val;
var __site_line = __koru_input.__site_line;
if (__koru_store_players.len >= 8) throw new global::System.Exception("std/store: store 'players' is full (capacity 8) - declared capacity and the `| full` branch are pinned at 690_011");
long __koru_new_row = __koru_store_players.len;
long __koru_hslot;
if (__koru_store_players.__koru_hslot_free_len > 0) {
__koru_store_players.__koru_hslot_free_len -= 1;
__koru_hslot = __koru_store_players.__koru_hslot_free[__koru_store_players.__koru_hslot_free_len];
} else {
__koru_hslot = __koru_store_players.__koru_hslot_next;
__koru_store_players.__koru_hslot_next += 1;
}
if (!__koru_store_players.__koru_ident) {
__koru_store_players.__koru_hslot_row[__koru_hslot] = __koru_new_row;
__koru_store_players.__koru_row_hslot[__koru_new_row] = __koru_hslot;
}
__koru_store_players.key[__koru_new_row] = key;
__koru_store_players.val[__koru_new_row] = val;
__koru_store_players.len += 1;
long __koru_ik = (long)(__koru_store_players.key[__koru_new_row]);
global::System.Collections.Generic.List<long> __koru_ib;
if (!__koru_store_players.__index_key.TryGetValue(__koru_ik, out __koru_ib)) { __koru_ib = new global::System.Collections.Generic.List<long>(); __koru_store_players.__index_key[__koru_ik] = __koru_ib; }
__koru_ib.Add(__koru_store_players.__koru_handle_of(__koru_new_row));
return default;
}
}
public static class __store_inserth_players_event {
public struct Input {
public long key;
public long val;
public long __site_line;
}
public struct Output {
public string tag;
public long row;
}
public static Output handler(Input __koru_input) {
var key = __koru_input.key;
var val = __koru_input.val;
var __site_line = __koru_input.__site_line;
if (__koru_store_players.len >= 8) throw new global::System.Exception("std/store: store 'players' is full (capacity 8) - declared capacity and the `| full` branch are pinned at 690_011");
long __koru_new_row = __koru_store_players.len;
long __koru_hslot;
if (__koru_store_players.__koru_hslot_free_len > 0) {
__koru_store_players.__koru_hslot_free_len -= 1;
__koru_hslot = __koru_store_players.__koru_hslot_free[__koru_store_players.__koru_hslot_free_len];
} else {
__koru_hslot = __koru_store_players.__koru_hslot_next;
__koru_store_players.__koru_hslot_next += 1;
}
if (!__koru_store_players.__koru_ident) {
__koru_store_players.__koru_hslot_row[__koru_hslot] = __koru_new_row;
__koru_store_players.__koru_row_hslot[__koru_new_row] = __koru_hslot;
}
__koru_store_players.key[__koru_new_row] = key;
__koru_store_players.val[__koru_new_row] = val;
__koru_store_players.len += 1;
long __koru_ik = (long)(__koru_store_players.key[__koru_new_row]);
global::System.Collections.Generic.List<long> __koru_ib;
if (!__koru_store_players.__index_key.TryGetValue(__koru_ik, out __koru_ib)) { __koru_ib = new global::System.Collections.Generic.List<long>(); __koru_store_players.__index_key[__koru_ik] = __koru_ib; }
__koru_ib.Add(__koru_store_players.__koru_handle_of(__koru_new_row));
return new Output { tag = "row", row = __koru_store_players.__koru_handle_of(__koru_new_row) };
return default;
}
}
public static class __store_apply_players_event {
public struct Input {
public long row;
public long field;
public long value_0;
public long value_1;
}
public struct Output {
public string tag;
public long key;
public long val;
}
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 value_1 = __koru_input.value_1;
var __koru_r = row;
switch (field) {
case 0: { long __koru_iold = (long)(__koru_store_players.key[__koru_r]);
long __koru_ih = __koru_store_players.__koru_handle_of(__koru_r);
__koru_store_players.key[__koru_r] = value_0; if (__koru_iold != (long)(value_0)) {
global::System.Collections.Generic.List<long> __koru_ib;
if (__koru_store_players.__index_key.TryGetValue(__koru_iold, out __koru_ib)) {
__koru_ib.Remove(__koru_ih);
if (__koru_ib.Count == 0) __koru_store_players.__index_key.Remove(__koru_iold);
}
global::System.Collections.Generic.List<long> __koru_ib2;
if (!__koru_store_players.__index_key.TryGetValue((long)(value_0), out __koru_ib2)) { __koru_ib2 = new global::System.Collections.Generic.List<long>(); __koru_store_players.__index_key[(long)(value_0)] = __koru_ib2; }
__koru_ib2.Add(__koru_ih);
}
return new Output { tag = "key", key = value_0 }; }
case 1: { __koru_store_players.val[__koru_r] = value_1; return new Output { tag = "val", val = value_1 }; }
}
throw new global::System.Exception("__store_apply_players: field index " + field + " is not a column of store 'players'");
return default;
}
}
public static class __store_teardown_players_event {
public struct Input {
}
public static dynamic handler(Input __koru_input) {
__koru_store_players.__index_key.Clear();
__koru_store_players.len = 0;
return default;
}
}
public static class __store_sweepbody_players_L30_690_330_explain_reports_index_plan_input_32129c_event {
public struct Input {
public long __koru_srf_p_L30_val;
public long __koru_sdix_p_L30;
}
public static dynamic handler(Input __koru_input) {
var __koru_srf_p_L30_val = __koru_input.__koru_srf_p_L30_val;
var __koru_sdix_p_L30 = __koru_input.__koru_sdix_p_L30;
__koru_stdout_write("nested " + __koru_str(__koru_srf_p_L30_val) + "\n");
return default;
}
}
public static class __store_nonebody_players_L31_690_330_explain_reports_index_plan_input_32129c_event {
public struct Input {
}
public static dynamic handler(Input __koru_input) {
__koru_stdout_write("nested none" + "\n");
return default;
}
}
public static class __store_sweeprun_players_L30_690_330_explain_reports_index_plan_input_32129c_event {
public struct Input {
}
public static dynamic handler(Input __koru_input) {
{
var __koru_found = false;
{
global::System.Collections.Generic.List<long> __koru_ib;
if (__koru_store_players.__index_key.TryGetValue((long)(30), out __koru_ib)) {
long __koru_im = -1;
foreach (var __koru_bh in __koru_ib) {
var __koru_cand = __koru_store_players.__koru_row_of(__koru_bh);
if (__koru_cand >= 0 && (__koru_im < 0 || __koru_cand < __koru_im)) __koru_im = __koru_cand;
}
if (__koru_im >= 0) {
var __koru_si = __koru_im;
var __koru_srf_p_L30_val = __koru_store_players.val[__koru_si];
__koru_found = true;
main_module.__store_sweepbody_players_L30_690_330_explain_reports_index_plan_input_32129c_event.handler(new main_module.__store_sweepbody_players_L30_690_330_explain_reports_index_plan_input_32129c_event.Input { __koru_srf_p_L30_val = __koru_srf_p_L30_val, __koru_sdix_p_L30 = __koru_si });
}
}
}
if (!__koru_found) {
main_module.__store_nonebody_players_L31_690_330_explain_reports_index_plan_input_32129c_event.handler(new main_module.__store_nonebody_players_L31_690_330_explain_reports_index_plan_input_32129c_event.Input { });
}
}
return default;
}
}
public static class __store_sweepbody_players_L35_690_330_explain_reports_index_plan_input_32129c_event {
public struct Input {
public long __koru_srf_p_L35_val;
public long __koru_sdix_p_L35;
}
public static dynamic handler(Input __koru_input) {
var __koru_srf_p_L35_val = __koru_input.__koru_srf_p_L35_val;
var __koru_sdix_p_L35 = __koru_input.__koru_sdix_p_L35;
__koru_stdout_write("first " + __koru_str(__koru_srf_p_L35_val) + "\n");
return default;
}
}
public static class __store_nonebody_players_L36_690_330_explain_reports_index_plan_input_32129c_event {
public struct Input {
}
public static dynamic handler(Input __koru_input) {
__koru_stdout_write("first none" + "\n");
return default;
}
}
public static class __store_sweeprun_players_L35_690_330_explain_reports_index_plan_input_32129c_event {
public struct Input {
}
public static dynamic handler(Input __koru_input) {
{
var __koru_found = false;
{
global::System.Collections.Generic.List<long> __koru_ib;
if (__koru_store_players.__index_key.TryGetValue((long)(30), out __koru_ib)) {
long __koru_im = -1;
foreach (var __koru_bh in __koru_ib) {
var __koru_cand = __koru_store_players.__koru_row_of(__koru_bh);
if (__koru_cand >= 0 && (__koru_im < 0 || __koru_cand < __koru_im)) __koru_im = __koru_cand;
}
if (__koru_im >= 0) {
var __koru_si = __koru_im;
var __koru_srf_p_L35_val = __koru_store_players.val[__koru_si];
__koru_found = true;
main_module.__store_sweepbody_players_L35_690_330_explain_reports_index_plan_input_32129c_event.handler(new main_module.__store_sweepbody_players_L35_690_330_explain_reports_index_plan_input_32129c_event.Input { __koru_srf_p_L35_val = __koru_srf_p_L35_val, __koru_sdix_p_L35 = __koru_si });
}
}
}
if (!__koru_found) {
main_module.__store_nonebody_players_L36_690_330_explain_reports_index_plan_input_32129c_event.handler(new main_module.__store_nonebody_players_L36_690_330_explain_reports_index_plan_input_32129c_event.Input { });
}
}
return default;
}
}
public static class __store_sweepbody_players_L40_690_330_explain_reports_index_plan_input_32129c_event {
public struct Input {
public long __koru_srf_q_L40_key;
public long __koru_sdix_q_L40;
}
public static dynamic handler(Input __koru_input) {
var __koru_srf_q_L40_key = __koru_input.__koru_srf_q_L40_key;
var __koru_sdix_q_L40 = __koru_input.__koru_sdix_q_L40;
__koru_stdout_write("row " + __koru_str(__koru_srf_q_L40_key) + "\n");
return default;
}
}
public static class __store_sweeprun_players_L40_690_330_explain_reports_index_plan_input_32129c_event {
public struct Input {
}
public static dynamic handler(Input __koru_input) {
{
for (var __koru_si = 0; __koru_si < __koru_store_players.len; __koru_si++) {
var __koru_srf_q_L40_key = __koru_store_players.key[__koru_si];
main_module.__store_sweepbody_players_L40_690_330_explain_reports_index_plan_input_32129c_event.handler(new main_module.__store_sweepbody_players_L40_690_330_explain_reports_index_plan_input_32129c_event.Input { __koru_srf_q_L40_key = __koru_srf_q_L40_key, __koru_sdix_q_L40 = __koru_si });
}
}
return default;
}
}
public static class __store_sweepbody_players_L45_690_330_explain_reports_index_plan_input_32129c_event {
public struct Input {
public long __koru_srf_p_L45_val;
public long __koru_sdix_p_L45;
}
public static dynamic handler(Input __koru_input) {
var __koru_srf_p_L45_val = __koru_input.__koru_srf_p_L45_val;
var __koru_sdix_p_L45 = __koru_input.__koru_sdix_p_L45;
__koru_stdout_write("scan " + __koru_str(__koru_srf_p_L45_val) + "\n");
return default;
}
}
public static class __store_nonebody_players_L46_690_330_explain_reports_index_plan_input_32129c_event {
public struct Input {
}
public static dynamic handler(Input __koru_input) {
__koru_stdout_write("scan none" + "\n");
return defa
... [truncated - 39KB total]Flows
flow ~new click a branch to expand · @labels scroll to their anchor
new (players, capacity: 8, source: key: i64, val: i64)
flow ~store click a branch to expand · @labels scroll to their anchor
store (expr: players, key, source: <implicit_source>)
flow ~insert click a branch to expand · @labels scroll to their anchor
insert (players, source: key: 10, val: 100)
flow ~query click a branch to expand · @labels scroll to their anchor
query (players)
flow ~query click a branch to expand · @labels scroll to their anchor
query (players)
flow ~query click a branch to expand · @labels scroll to their anchor
query (players)
flow ~new click a branch to expand · @labels scroll to their anchor
new (tree, capacity: 4, source: val: i64)
flow ~insert click a branch to expand · @labels scroll to their anchor
insert (tree, source: val: 10)
flow ~query click a branch to expand · @labels scroll to their anchor
query (tree)
Test Configuration
MUST_RUN LANGUAGES: zig cs
Post-validation Script:
#!/bin/bash
# `koruc explain` on an indexed store: the `index` row names the declared
# column and carries the declaration site's witness hash, and each query
# site reports the plan the transform's fold routes it to — index lookup,
# sweep, or early-exit sweep — with refusals in the transform's own words.
set -e
echo "=== koruc explain (text) ==="
TEXT=$(koruc "$KORU_INPUT" explain 2>&1)
echo "$TEXT"
echo "$TEXT" | grep -q "📖 std/store" || { echo "FAIL: store report missing"; exit 1; }
echo "$TEXT" | grep -qE "index = key \[[0-9a-z]+\]" || { echo "FAIL: index row missing"; exit 1; }
echo "$TEXT" | grep -qE "inserts = 3 \[[0-9a-z]+\] \[[0-9a-z]+\] \[[0-9a-z]+\]" || { echo "FAIL: insert count/witnesses missing"; exit 1; }
echo "$TEXT" | grep -qE "queries = 4( \[[0-9a-z]+\]){4}" || { echo "FAIL: query count/witnesses missing"; exit 1; }
test "$(echo "$TEXT" | grep -c "index lookup on key")" = "2" || { echo "FAIL: nested routed plan missing"; exit 1; }
echo "$TEXT" | grep -q "index lookup on key" || { echo "FAIL: routed plan missing"; exit 1; }
echo "$TEXT" | grep -q "! query q — sweep" || { echo "FAIL: sweep plan missing"; exit 1; }
echo "$TEXT" | grep -q "sweep, stops at first match" || { echo "FAIL: scan plan missing"; exit 1; }
echo "$TEXT" | grep -q "input:tree" || { echo "FAIL: tree section missing"; exit 1; }
echo "$TEXT" | grep -qE "queries = 2 \[[0-9a-z]+\] \[[0-9a-z]+\]" || { echo "FAIL: nested tree query unwitnessed"; exit 1; }
test "$(echo "$TEXT" | grep -c "! first n — sweep, stops at first match")" = "2" || { echo "FAIL: tree plan missing"; exit 1; }
! echo "$TEXT" | grep -q "refused:" || { echo "FAIL: a plan row refused"; exit 1; }
echo "=== second insert witness resolves to the chained insert ==="
IHASH=$(echo "$TEXT" | grep -oE "inserts = 3 \[[0-9a-z]+\] \[[0-9a-z]+\]" | grep -oE "\[[0-9a-z]+\]" | tail -1 | tr -d '[]')
IAT=$(koruc "$KORU_INPUT" at "$IHASH" 2>&1)
echo "$IAT"
echo "$IAT" | grep -q "std.store:insert" || { echo "FAIL: at missed the chained insert"; exit 1; }
echo "$IAT" | grep -q "input.k:25" || { echo "FAIL: arm head not on its own line"; exit 1; }
echo "=== deep-nested query witness resolves and drifts gracefully ==="
QHASH=$(echo "$TEXT" | grep -oE "query\[0\] = ! first p — index lookup on key \[[0-9a-z]+\]" | grep -oE "\[[0-9a-z]+\]" | tail -1 | tr -d '[]')
QAT=$(koruc "$KORU_INPUT" at "$QHASH" 2>&1)
echo "$QAT"
echo "$QAT" | grep -q "std.store:query" || { echo "FAIL: at missed the nested query"; exit 1; }
echo "$QAT" | grep -q "std.store:query.*input.k:28" || { echo "FAIL: |> query link not on line 28"; exit 1; }
echo "$QAT" | grep -q "std.io:print.ln.*input.k:29" || { echo "FAIL: ! first arm not on line 29"; exit 1; }
echo "$QAT" | grep -q "std.io:print.ln.*input.k:30" || { echo "FAIL: | none arm not on line 30"; exit 1; }
koruc "$KORU_INPUT" at "${QHASH}aa" 2>&1 | grep -q "tail drifted" || { echo "FAIL: deep descent did not drift"; exit 1; }
echo "=== index witness resolves to the declaration site ==="
HASH=$(echo "$TEXT" | grep -oE "index = key \[[0-9a-z]+\]" | grep -oE "\[[0-9a-z]+\]" | tr -d '[]')
AT=$(koruc "$KORU_INPUT" at "$HASH" 2>&1)
echo "$AT"
echo "$AT" | grep -q "std.indexes:store" || { echo "FAIL: at missed the index decl"; exit 1; }
echo "$AT" | grep -q "input.k" || { echo "FAIL: at lost the file"; exit 1; }
echo "$AT" | grep -q "input.k:22" || { echo "FAIL: decl line double-subtracted"; exit 1; }
echo "=== koruc explain json (typed) ==="
JSON=$(koruc "$KORU_INPUT" explain json 2>&1)
echo "$JSON"
echo "$JSON" | grep -q '"index":"key"' || { echo "FAIL: index not in json"; exit 1; }
echo "=== PASS: explain reports the index plan ==="