✓
Passing This code compiles and runs correctly.
Code
// PINS O10.iii ACROSS A REMOVAL in the [tree] substrate: parent handles keep
// naming the same rows after a take swap-relocates one. Taking leaf b (30)
// moves c (40) into b's old dense position; c's stored `parent` still names a,
// and the preorder walk resolves it there — the forest topology is unchanged
// by where rows physically sit.
//
// root(10) ── a(20) ── c(40) b(30) taken; c relocated by the swap
//
// Preorder after the take: 10, 20, 40. A position-based parent column would
// have orphaned or rewired c the moment the swap moved it.
import std/io
import std/store
[tree]std/store:new(tree, capacity: 64) { val: i64 }
std/store:insert(tree) { val: 10 }
| row root |> std/store:insert(tree) { val: 20 }
| row a |> std/store:insert(tree) { val: 30 }
| row b |> std/store:insert(tree) { val: 40 }
| row c |> std/store:stored { tree[a].parent: root }
|> std/store:stored { tree[b].parent: root }
|> std/store:stored { tree[c].parent: a }
|> std/store:take(tree[b])
| item gone |> std/io:print.ln("took {{ gone.val:d }}")
std/store:preorder(tree)
! preorder e |> std/io:print.ln("{{ e.val:d }}")
Actual
took 30
10
20
40
Expected output
✓ Zig✓ C#took 30
10
20
40
Emitted Zig source
// Access compiler flags via the per-user compiler_env module
const CompilerEnv = @import("compiler_env").CompilerEnv;
pub const panic = if (@import("builtin").mode == .Debug)
@import("std").debug.FullPanic(@import("std").debug.defaultPanic)
else
@import("std").debug.simple_panic;
const __koru_bare = struct {
extern fn posix_memalign(memptr: *?*anyopaque, alignment: usize, size: usize) c_int;
extern fn free(ptr: ?*anyopaque) void;
fn bareAlloc(_: *anyopaque, len: usize, alignment: @import("std").mem.Alignment, _: usize) ?[*]u8 {
var p: ?*anyopaque = null;
const a = @max(alignment.toByteUnits(), @sizeOf(usize));
if (posix_memalign(&p, a, len) != 0) return null;
return @ptrCast(p);
}
fn bareResize(_: *anyopaque, _: []u8, _: @import("std").mem.Alignment, _: usize, _: usize) bool { return false; }
fn bareRemap(_: *anyopaque, _: []u8, _: @import("std").mem.Alignment, _: usize, _: usize) ?[*]u8 { return null; }
fn bareFree(_: *anyopaque, memory: []u8, _: @import("std").mem.Alignment, _: usize) void { free(@ptrCast(memory.ptr)); }
const vtable = @import("std").mem.Allocator.VTable{ .alloc = bareAlloc, .resize = bareResize, .remap = bareRemap, .free = bareFree };
const allocator = @import("std").mem.Allocator{ .ptr = undefined, .vtable = &vtable };
};
const __koru_backing = if (@import("builtin").link_libc) @import("std").heap.c_allocator else if (@import("builtin").os.tag == .freestanding and !@import("builtin").cpu.arch.isWasm()) __koru_bare.allocator else @import("std").heap.page_allocator;
var __koru_leak_count: @import("std").atomic.Value(usize) = .init(0);
var __koru_par_tasks: @import("std").atomic.Value(usize) = .init(0);
const __koru_par_CAP: usize = 128;
threadlocal var __koru_par_depth: usize = 0;
const __koru_par_DEPTH_CAP: usize = 7;
var __koru_par_pool: @import("std").Thread.Pool = undefined;
var __koru_par_pool_ready: bool = false;
var __koru_par_pool_mtx: @import("std").Thread.Mutex = .{};
fn __koru_par_pool_ensure() *@import("std").Thread.Pool {
__koru_par_pool_mtx.lock();
defer __koru_par_pool_mtx.unlock();
if (!__koru_par_pool_ready) {
@import("std").Thread.Pool.init(&__koru_par_pool, .{ .allocator = @import("std").heap.smp_allocator }) catch @panic("koru: thread pool init failed");
__koru_par_pool_ready = true;
}
return &__koru_par_pool;
}
fn __koru_alloc(ctx: *anyopaque, len: usize, alignment: @import("std").mem.Alignment, ret_addr: usize) ?[*]u8 {
_ = ctx;
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));
}
fn __KoruPadI(comptime T: type) type {
const V = switch (@typeInfo(T)) { .comptime_int => i64, .comptime_float => f64, else => T };
return struct {
v: V,
width: usize,
pub fn format(self: @This(), w: *@import("std").Io.Writer) @import("std").Io.Writer.Error!void {
const rendered = @import("std").fmt.count("{d}", .{self.v});
const pad = self.width -| rendered;
for (0..pad) |_| try w.writeByte(' ');
try w.print("{d}", .{self.v});
}
};
}
pub fn __koru_pad_i(width: usize, value: anytype) __KoruPadI(@TypeOf(value)) {
return .{ .v = value, .width = width };
}
pub fn koru_leak_check() void {
if (comptime @import("builtin").mode != .Debug) return;
if (__koru_leak_count.load(.acquire) == 0) return;
if (comptime @import("builtin").target.os.tag == .freestanding) {
if (comptime @import("builtin").cpu.arch == .wasm32 or @import("builtin").cpu.arch == .wasm64) {
@panic("KORU LEAK CHECK FAILED: the produced program leaked");
} else {
const __klc = struct { extern var stdout: ?*anyopaque; extern fn fputs(__s: [*:0]const u8, __st: ?*anyopaque) c_int; };
var __lb: [128]u8 = undefined;
const __lm = "KORU LEAK CHECK FAILED: allocations still outstanding at end of run: ";
@memcpy(__lb[0..__lm.len], __lm);
var __ln: usize = __lm.len;
var __lv = __koru_leak_count.load(.acquire);
var __ld: [20]u8 = undefined;
var __lk: usize = 0;
while (__lv > 0) : (__lk += 1) { __ld[__lk] = @intCast('0' + __lv % 10); __lv /= 10; }
for (0..__lk) |__li| { __lb[__ln] = __ld[__lk - 1 - __li]; __ln += 1; }
__lb[__ln] = '\n'; __ln += 1; __lb[__ln] = 0;
_ = __klc.fputs(@as([*:0]const u8, @ptrCast(&__lb)), __klc.stdout);
@trap();
}
} else {
@import("std").debug.print("KORU LEAK CHECK FAILED: the produced program leaked (trace above)\n", .{});
@import("std").process.exit(1);
}
}
pub const main_module = struct {
// std/store: plural store 'tree' created (SoA cell + insert/query/write/take/stripe units); fields val: i64
// >>> FLOW: tests/regression/600_STDLIB/695_STORE_TREE/695_004_preorder_after_leaf_take/input.k:17 ~input:__store_inserth_tree()
pub fn flow0() void {
const result_0 = main_module.__store_inserth_tree_event.handler(.{ .val = 10, .__site_line = 17 });
const root = result_0.row;
const result_1 = main_module.__store_inserth_tree_event.handler(.{ .val = 20, .__site_line = 18 });
_ = &result_1;
const a = result_1.row;
const result_2 = main_module.__store_inserth_tree_event.handler(.{ .val = 30, .__site_line = 19 });
_ = &result_2;
const b = result_2.row;
const result_3 = main_module.__store_inserth_tree_event.handler(.{ .val = 40, .__site_line = 20 });
_ = &result_3;
const c = result_3.row;
const result_4 = main_module.__store_write_tree_event.handler(.{ .row = __koru_store_tree.__koru_resolve(a), .field = 1, .value_0 = 0, .value_1 = root });
_ = &result_4;
const result_5 = main_module.__store_write_tree_event.handler(.{ .row = __koru_store_tree.__koru_resolve(b), .field = 1, .value_0 = 0, .value_1 = root });
_ = &result_5;
const result_6 = main_module.__store_write_tree_event.handler(.{ .row = __koru_store_tree.__koru_resolve(c), .field = 1, .value_0 = 0, .value_1 = a });
_ = &result_6;
const result_7 = main_module.__store_take_tree_event.handler(.{ .row = b });
_ = &result_7;
switch (result_7) {
// >>> BRANCH: tests/regression/600_STDLIB/695_STORE_TREE/695_004_preorder_after_leaf_take/input.k:25 | item gone |>
.item => |gone| {
(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("took {d}\n", .{gone.val});
},
// >>> BRANCH: tests/regression/600_STDLIB/695_STORE_TREE/695_004_preorder_after_leaf_take/input.k:24 | empty _auto_6 |>
.empty => {
@panic("input:__store_take_tree: unhandled panic branch 'empty' fired at runtime");
},
}
}
// >>> FLOW: tests/regression/600_STDLIB/695_STORE_TREE/695_004_preorder_after_leaf_take/input.k:27 ~input:__store_qsweep_tree_L27_695_004_preorder_after_leaf_take_input_61a418()
pub fn flow1() void {
_ = main_module.__store_qsweep_tree_L27_695_004_preorder_after_leaf_take_input_61a418_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_tree = struct {
val: [64]i64 = undefined,
parent: [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: 'tree[...]' 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 'tree' - 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 'tree' - the row it addressed was removed (stale-handle trap pinned at 690_115)");
}
return self.__koru_row_of(h) orelse @panic("std/store: 'tree[...]' 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_tree: __KoruStoreT_tree = .{};
const __KoruStoreRow_tree = struct { val: i64, parent: i64 };
pub const __store_inserth_tree_event = struct {
pub const Input = struct {
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.val, __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 = .{ .val = __koru_p_0, .__site_line = __koru_p_1 };
// >>> PROC: __store_inserth_tree [tests/regression/600_STDLIB/695_STORE_TREE/695_004_preorder_after_leaf_take/input.k:15]
const val = __koru_event_input.val;
const __site_line = __koru_event_input.__site_line;
_ = &val;
_ = &__site_line;
_ = &__koru_event_input;
if (__koru_store_tree.len >= 64) @panic("std/store: store 'tree' is full (capacity 64) - declared capacity and the `| full` branch are pinned at 690_011");
const __koru_new_row = __koru_store_tree.len;
const __koru_hslot = if (__koru_store_tree.__koru_hslot_free_len > 0) blk_hs: {
__koru_store_tree.__koru_hslot_free_len -= 1;
break :blk_hs __koru_store_tree.__koru_hslot_free[__koru_store_tree.__koru_hslot_free_len];
} else blk_hs: {
const __koru_hn = __koru_store_tree.__koru_hslot_next;
__koru_store_tree.__koru_hslot_next += 1;
break :blk_hs __koru_hn;
};
if (!__koru_store_tree.__koru_ident) {
__koru_store_tree.__koru_hslot_row[__koru_hslot] = __koru_new_row;
__koru_store_tree.__koru_row_hslot[__koru_new_row] = __koru_hslot;
}
__koru_store_tree.val[__koru_new_row] = val;
__koru_store_tree.parent[__koru_new_row] = -1;
__koru_store_tree.len += 1;
return .{ .row = __koru_store_tree.__koru_handle_of(__koru_new_row) };
}
};
pub const __store_apply_tree_event = struct {
pub const Input = struct {
row: usize,
field: i64,
value_0: i64,
value_1: i64,
};
pub const Output = union(enum(u8)) {
val: i64,
parent: i64,
};
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> PROC: __store_apply_tree [tests/regression/600_STDLIB/695_STORE_TREE/695_004_preorder_after_leaf_take/input.k:15]
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: { __koru_store_tree.val[__koru_r] = value_0; break :blk .{ .val = value_0 }; },
1 => blk: { const __koru_self = __koru_store_tree.__koru_handle_of(__koru_r); var __koru_cyc = value_1; while (__koru_cyc != -1) { if (__koru_cyc == __koru_self) @panic("std/store:stored: reparent in [tree] store 'tree' would make the row its own ancestor (cycle) - the write is rejected; handle it with a `| cycle` branch (default-on guard and branch are pinned at 695_002)"); const __koru_cycr = __koru_store_tree.__koru_resolve(__koru_cyc); __koru_cyc = __koru_store_tree.parent[__koru_cycr]; } __koru_store_tree.parent[__koru_r] = value_1; break :blk .{ .parent = value_1 }; },
else => unreachable,
};
}
};
pub const __store_write_tree_event = struct {
pub const Input = struct {
row: usize,
field: i64,
value_0: i64,
value_1: i64,
};
pub const Output = void;
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> SUBFLOW: tests/regression/600_STDLIB/695_STORE_TREE/695_004_preorder_after_leaf_take/input.k:15
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 result = main_module.__store_apply_tree_event.handler(.{ .row = row, .field = field, .value_0 = value_0, .value_1 = value_1 });
return switch (result) {
.parent => {},
.val => {},
};
}
};
pub const __store_qrow_tree_L27_695_004_preorder_after_leaf_take_input_61a418_event = struct {
pub const Input = struct {
row: usize,
};
pub const Output = void;
pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
return __koru_handler_impl(__koru_event_input.row);
}
fn __koru_handler_impl(__koru_p_0: usize) @This().Output {
const __koru_event_input: @This().Input = .{ .row = __koru_p_0 };
// >>> PROC: __store_qrow_tree_L27_695_004_preorder_after_leaf_take_input_61a418 [tests/regression/600_STDLIB/695_STORE_TREE/695_004_preorder_after_leaf_take/input.k:15]
const row = __koru_event_input.row;
_ = &row;
_ = &__koru_event_input;
const __koru_r: usize = row;
main_module.__store_qbody_tree_L27_695_004_preorder_after_leaf_take_input_61a418_event.handler(.{ .__koru_sdix_rule_L27 = __koru_r });
return;
}
};
pub const __store_qbody_tree_L27_695_004_preorder_after_leaf_take_input_61a418_event = struct {
pub const Input = struct {
__koru_sdix_rule_L27: usize,
};
pub const Output = void;
pub inline fn handler(__koru_event_input: @This().In
... [truncated - 26KB total]Emitted C# source
static class main_module {
public static void __koru_stdout_write(object s) => global::System.Console.Out.Write(s);
public static void __koru_stderr_write(object 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. `object`, not
// `dynamic`: the field is storage — every `x.data` read reaches
// it through a dynamic-typed handle (`*T` Input fields, the
// `dynamic` borrow locals below), so the member itself only
// needs to hold the value, and `object` keeps the DLR out of
// the store/load path.
public class __KoruBox { public object 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 'tree' created (SoA cell + insert/query/write/take/stripe units); fields val: i64
static class __koru_store_tree {
public static long[] val = new long[64];
public static dynamic __koru_read_val(long __h) { long __r = __koru_resolve(__h); return val[(int)__r]; }
public static long[] parent = new long[64];
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[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: '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_inserth_tree_event {
public struct Input {
public long val;
public long __site_line;
}
public struct Output {
public string tag;
public long row;
}
public static Output handler(Input __koru_input) {
var val = __koru_input.val;
var __site_line = __koru_input.__site_line;
if (__koru_store_tree.len >= 64) throw new global::System.Exception("std/store: store 'tree' is full (capacity 64) - declared capacity and the `| full` branch are pinned at 690_011");
long __koru_new_row = __koru_store_tree.len;
long __koru_hslot;
if (__koru_store_tree.__koru_hslot_free_len > 0) {
__koru_store_tree.__koru_hslot_free_len -= 1;
__koru_hslot = __koru_store_tree.__koru_hslot_free[__koru_store_tree.__koru_hslot_free_len];
} else {
__koru_hslot = __koru_store_tree.__koru_hslot_next;
__koru_store_tree.__koru_hslot_next += 1;
}
if (!__koru_store_tree.__koru_ident) {
__koru_store_tree.__koru_hslot_row[__koru_hslot] = __koru_new_row;
__koru_store_tree.__koru_row_hslot[__koru_new_row] = __koru_hslot;
}
__koru_store_tree.val[__koru_new_row] = val;
__koru_store_tree.parent[__koru_new_row] = -1;
__koru_store_tree.len += 1;
return new Output { tag = "row", row = __koru_store_tree.__koru_handle_of(__koru_new_row) };
return default;
}
}
public static class __store_apply_tree_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 val;
public long parent;
}
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: { __koru_store_tree.val[__koru_r] = value_0; return new Output { tag = "val", val = value_0 }; }
case 1: { var __koru_self = __koru_store_tree.__koru_handle_of(__koru_r); var __koru_cyc = value_1; while (__koru_cyc != -1) { if (__koru_cyc == __koru_self) throw new global::System.Exception("std/store:stored: reparent in [tree] store 'tree' would make the row its own ancestor (cycle) - the write is rejected; handle it with a `| cycle` branch (default-on guard and branch are pinned at 695_002)"); var __koru_cycr = __koru_store_tree.__koru_resolve(__koru_cyc); __koru_cyc = __koru_store_tree.parent[__koru_cycr]; } __koru_store_tree.parent[__koru_r] = value_1; return new Output { tag = "parent", parent = value_1 }; }
}
throw new global::System.Exception("__store_apply_tree: field index " + field + " is not a column of store 'tree'");
return default;
}
}
public static class __store_write_tree_event {
public struct Input {
public long row;
public long field;
public long value_0;
public long value_1;
}
public static object 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 result_0 = main_module.__store_apply_tree_event.handler(new __store_apply_tree_event.Input { row = (long)(row), field = (long)(field), value_0 = (long)(value_0), value_1 = (long)(value_1)});
if (result_0.tag == "val") {
var _auto_7 = result_0.val;
}
if (result_0.tag == "parent") {
var _auto_8 = result_0.parent;
}
return default;
}
}
public static class __store_qrow_tree_L27_695_004_preorder_after_leaf_take_input_61a418_event {
public struct Input {
public long row;
}
public static object handler(Input __koru_input) {
var row = __koru_input.row;
var __koru_r = row;
main_module.__store_qbody_tree_L27_695_004_preorder_after_leaf_take_input_61a418_event.handler(new main_module.__store_qbody_tree_L27_695_004_preorder_after_leaf_take_input_61a418_event.Input { __koru_sdix_rule_L27 = __koru_r });
return default;
}
}
public static class __store_qbody_tree_L27_695_004_preorder_after_leaf_take_input_61a418_event {
public struct Input {
public long __koru_sdix_rule_L27;
}
public static object handler(Input __koru_input) {
var __koru_sdix_rule_L27 = __koru_input.__koru_sdix_rule_L27;
__koru_stdout_write("" + __koru_str(__koru_store_tree.val[(__koru_sdix_rule_L27)]) + "\n");
return default;
}
}
public static class __store_qsweep_tree_L27_695_004_preorder_after_leaf_take_input_61a418_event {
public struct Input {
}
public static object handler(Input __koru_input) {
long[] __koru_stack = new long[64];
long __koru_sp = 0;
for (long __koru_ri = 0; __koru_ri < __koru_store_tree.len; __koru_ri++) {
long __koru_i = __koru_store_tree.len - 1 - __koru_ri;
if (__koru_store_tree.parent[__koru_i] == -1) {
__koru_stack[__koru_sp] = __koru_i;
__koru_sp += 1;
}
}
while (__koru_sp > 0) {
__koru_sp -= 1;
long __koru_cur = __koru_stack[__koru_sp];
main_module.__store_qrow_tree_L27_695_004_preorder_after_leaf_take_input_61a418_event.handler(new main_module.__store_qrow_tree_L27_695_004_preorder_after_leaf_take_input_61a418_event.Input { row = __koru_cur });
for (long __koru_rj = 0; __koru_rj < __koru_store_tree.len; __koru_rj++) {
long __koru_j = __koru_store_tree.len - 1 - __koru_rj;
if (__koru_store_tree.parent[__koru_j] == __koru_store_tree.__koru_handle_of(__koru_cur)) {
__koru_stack[__koru_sp] = __koru_j;
__koru_sp += 1;
}
}
}
return default;
}
}
public static class __store_take_tree_event {
public struct Input {
public long row;
}
public struct Output {
public string tag;
public dynamic item;
public object empty;
}
public static Output handler(Input __koru_input) {
var row = __koru_input.row;
__koru_store_tree.__koru_materialize();
long __koru_r = __koru_store_tree.__koru_row_of(row);
if (__koru_r < 0) return new Output { tag = "empty", empty = new { } };
long __koru_gone_slot = __koru_store_tree.__koru_row_hslot[__koru_r];
var __koru_out_val = __koru_store_tree.val[__koru_r];
var __koru_out_parent = __koru_store_tree.parent[__koru_r];
var __koru_last = __koru_store_tree.len - 1;
if (__koru_r != __koru_last) {
__koru_store_tree.val[__koru_r] = __koru_store_tree.val[__koru_last];
__koru_store_tree.parent[__koru_r] = __koru_store_tree.parent[__koru_last];
var __koru_mv_slot = __koru_store_tree.__koru_row_hslot[__koru_last];
__koru_store_tree.__koru_hslot_row[__koru_mv_slot] = __koru_r;
__koru_store_tree.__koru_row_hslot[__koru_r] = __koru_mv_slot;
}
__koru_store_tree.__koru_hslot_row[__koru_gone_slot] = -1;
__koru_store_tree.len = __koru_last;
__koru_store_tree.__koru_hslot_gen[__koru_gone_slot] = ((__koru_store_tree.__koru_hslot_gen[__koru_gone_slot] + 1) & 4294967295L);
__koru_store_tree.__koru_hslot_free[__koru_store_tree.__koru_hslot_free_len] = __koru_gone_slot;
__koru_store_tree.__koru_hslot_free_len += 1;
__koru_store_tree.__koru_gen0 = false;
return new Output { tag = "item", item = new { val = __koru_out_val, parent = __koru_out_parent } };
return default;
}
}
public static class koru_start_event {
public struct Input {
}
public struct Output {
public string tag;
public object 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 object done;
}
public static Output handler(Input __koru_input) => new Output { tag = "done" };
}
public static void flow0() {
var result_1 = main_module.__store_inserth_tree_event.handler(new __store_inserth_tree_event.Input { val = (long)(10), __site_line = (long)(17)});
var root = result_1.row;
var result_2 = main_module.__store_inserth_tree_event.handler(new __store_inserth_tree_event.Input { val = (long)(20), __site_line = (long)(18)});
var a = result_2.row;
var result_3 = main_module.__store_inserth_tree_event.handler(new __store_inserth_tree_event.Input { val = (long)(30), __site_line = (long)(19)});
var b = result_3.row;
var result_4 = main_module.__store_inserth_tree_event.handler(new __store_inserth_tree_event.Input { val = (long)(40), __site_line = (long)(20)});
var c = result_4.row;
main_module.__store_write_tree_event.handler(new __store_write_tree_event.Input { row = (long)(__koru_store_tree.__koru_resolve(a)), field = (long)(1), value_0 = (long)(0), value_1 = (long)(root)});
main_module.__store_write_tree_event.handler(new __store_write_tree_event.Input { row = (long)(__koru_store_tree.__koru_resolve(b)), field = (long)(1), value_0 = (long)(0), value_1 = (long)(root)});
main_module.__store_write_tree_event.handler(new __store_write_tree_event.Input { row = (long)(__koru_store_tree.__koru_resolve(c)), field = (long)(1), value_0 = (long)(0), value_1 = (long)(a)});
var result_5 = main_module.__store_take_tree_event.handler(new __store_take_tree_event.Input { row = (long)(b)});
if (result_5.tag == "item") {
var gone = result_5.item;
__koru_stdout_write("took " + __koru_str(gone.val) + "\n");
}
if (result_5.tag == "empty") {
var _auto_6 = result_5.empty;
throw new global::System.Exception("input:__store_take_tree: unhandled panic branch 'empty' fired at runtime");
}
}
public static void flow1() {
{
long[] __koru_stack = new long[64];
long __koru_sp = 0;
for (long __koru_ri = 0; __koru_ri < __koru_store_tree.len; __koru_ri++) {
long __koru_i = __koru_store_tree.len - 1 - __koru_ri;
if (__koru_store_tree.parent[__koru_i] == -1) {
__koru_stack[__koru_sp] = __koru_i;
__koru_sp += 1;
}
}
while (__koru_sp > 0) {
__koru_sp -= 1;
long __koru_cur = __koru_stack[__koru_sp];
main_module.__store_qrow_tree_L27_695_004_preorder_after_leaf_take_input_61a418_event.handler(new main_module.__store_qrow_tree_L27_695_004_preorder_after_leaf_take_input_61a418_event.Input { row = __koru_cur });
for (long __koru_rj = 0; __koru_rj < __koru_store_tree.len; __koru_rj++) {
long __koru_j = __koru_store_tree.len - 1 - __koru_rj;
if (__koru_store_tree.parent[__koru_j] == __koru_store_tree.__koru_handle_of(__koru_cur)) {
__koru_stack[__koru_sp] = __koru_j;
__koru_sp += 1;
}
}
}
}
}
public static void flow2() {
main_module.koru_start_event.handler(new koru_start_event.Input { });
}
public static void flow3() {
main_module.koru_end_event.handler(new koru_end_event.Input { });
}
}
static class Program {
static void Main() {
main_module.flow2();
main_module.flow0();
main_module.flow1();
main_module.flow3();
}
}
Flows
flow ~new click a branch to expand · @labels scroll to their anchor
new (tree, capacity: 64, source: val: i64)
flow ~insert click a branch to expand · @labels scroll to their anchor
insert (tree, source: val: 10)
flow ~preorder click a branch to expand · @labels scroll to their anchor
preorder (tree)
Test Configuration
MUST_RUN LANGUAGES: cs