✓
Passing This code compiles and runs correctly.
Code
// std/store:take gains an `| empty` branch — a take on something that is not a
// live row is a GRACEFUL, handleable outcome, not a panic. `is_panic` (`?!`): a
// site that omits `| empty` still gets the synthesized panic (existing take
// sites unchanged); a site that handles it — an interactive delete off an empty
// list — stays alive. No payload, no obligation on the empty arm.
//
// The re-take is the trigger, and it is an IDENTITY trigger, not a positional
// one. `a` was minted by `| row`; after the first take that handle is stale, so
// `__koru_row_of` finds a generation mismatch, returns null, and the second
// take answers `| empty`. The store's own lowering says this is the intended
// family: never inserted, already taken, or the -1 sentinel.
//
// It was written as `take(items[0])` until 2026-08-02 — a literal integer as a
// row address, which reached `| empty` only by being out of range. That spelling
// died with 690_242 (brands are 1-based, so a bare integer is no longer a
// plausible handle for any store) and it should not come back: position is not
// identity, and `| empty` is about whether a row IS THERE, not about whether an
// offset is in bounds. Note this is why take can be graceful at all while reads
// and writes trap — take is the one verb with a branch surface for absence.
import std/io
import std/store
std/store:new(items, capacity: 4) { v: i64 }
std/store:insert(items) { v: 42 }
| row a |> std/store:take(items[a])
| item i |> std/io:print.ln("took {{ i.v:d }}")
|> std/store:take(items[a])
| item j |> std/io:print.ln("took again {{ j.v:d }}")
| empty |> std/io:print.ln("empty")
| empty |> std/io:print.ln("empty")
Actual
took 42
empty
Expected output
✓ Zig✓ C#took 42
empty
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 'items' created (SoA cell + insert/query/write/take/stripe units); fields v: i64
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_070_store_take_empty_branch/input.k:24 ~input:__store_inserth_items()
pub fn flow0() void {
const result_0 = main_module.__store_inserth_items_event.handler(.{ .v = 42, .__site_line = 24 });
const a = result_0.row;
const result_1 = main_module.__store_take_items_event.handler(.{ .row = a });
_ = &result_1;
switch (result_1) {
// >>> BRANCH: tests/regression/600_STDLIB/690_STORE/690_070_store_take_empty_branch/input.k:26 | item i |>
.item => |i| {
(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", .{i.v});
const result_2 = main_module.__store_take_items_event.handler(.{ .row = a });
_ = &result_2;
switch (result_2) {
// >>> BRANCH: tests/regression/600_STDLIB/690_STORE/690_070_store_take_empty_branch/input.k:28 | item j |>
.item => |j| {
(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_0| { const __kn = @min(__kt.len - 1, __b.len - __ki_0 * (__kt.len - 1)); @memcpy(__kt[0..__kn], __b[__ki_0 * (__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 again {d}\n", .{j.v});
},
// >>> BRANCH: tests/regression/600_STDLIB/690_STORE/690_070_store_take_empty_branch/input.k:29 | empty |>
.empty => {
(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_1| { const __kn = @min(__kt.len - 1, __b.len - __ki_1 * (__kt.len - 1)); @memcpy(__kt[0..__kn], __b[__ki_1 * (__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("empty\n", .{});
},
}
},
// >>> BRANCH: tests/regression/600_STDLIB/690_STORE/690_070_store_take_empty_branch/input.k:30 | empty |>
.empty => {
(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("empty\n", .{});
},
}
}
pub fn koru_start_flow() void {
const result_0 = koru_koru.start_event.handler(.{ });
const result_0_done = result_0.done;
_ = &result_0_done;
}
pub fn koru_end_flow() void {
const result_0 = koru_koru.end_event.handler(.{ });
const result_0_done = result_0.done;
_ = &result_0_done;
}
const __KoruStoreT_items = struct {
v: [4]i64 = undefined,
len: usize = 0,
__koru_hslot_row: [4]usize = undefined,
__koru_hslot_gen: [4]u32 = [_]u32{0} ** 4,
__koru_row_hslot: [4]usize = undefined,
__koru_hslot_free: [4]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: 'items[...]' 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 'items' - 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 'items' - the row it addressed was removed (stale-handle trap pinned at 690_115)");
}
return self.__koru_row_of(h) orelse @panic("std/store: 'items[...]' 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_items: __KoruStoreT_items = .{};
const __KoruStoreRow_items = struct { v: i64 };
pub const __store_inserth_items_event = struct {
pub const Input = struct {
v: 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.v, __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 = .{ .v = __koru_p_0, .__site_line = __koru_p_1 };
// >>> PROC: __store_inserth_items [tests/regression/600_STDLIB/690_STORE/690_070_store_take_empty_branch/input.k:23]
const v = __koru_event_input.v;
const __site_line = __koru_event_input.__site_line;
_ = &v;
_ = &__site_line;
_ = &__koru_event_input;
if (__koru_store_items.len >= 4) @panic("std/store: store 'items' is full (capacity 4) - declared capacity and the `| full` branch are pinned at 690_011");
const __koru_new_row = __koru_store_items.len;
const __koru_hslot = if (__koru_store_items.__koru_hslot_free_len > 0) blk_hs: {
__koru_store_items.__koru_hslot_free_len -= 1;
break :blk_hs __koru_store_items.__koru_hslot_free[__koru_store_items.__koru_hslot_free_len];
} else blk_hs: {
const __koru_hn = __koru_store_items.__koru_hslot_next;
__koru_store_items.__koru_hslot_next += 1;
break :blk_hs __koru_hn;
};
if (!__koru_store_items.__koru_ident) {
__koru_store_items.__koru_hslot_row[__koru_hslot] = __koru_new_row;
__koru_store_items.__koru_row_hslot[__koru_new_row] = __koru_hslot;
}
__koru_store_items.v[__koru_new_row] = v;
__koru_store_items.len += 1;
return .{ .row = __koru_store_items.__koru_handle_of(__koru_new_row) };
}
};
pub const __store_apply_items_event = struct {
pub const Input = struct {
row: usize,
field: i64,
value_0: i64,
};
pub const Output = union(enum(u8)) {
v: i64,
};
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> PROC: __store_apply_items [tests/regression/600_STDLIB/690_STORE/690_070_store_take_empty_branch/input.k:23]
const row = __koru_event_input.row;
const field = __koru_event_input.field;
const value_0 = __koru_event_input.value_0;
_ = &row;
_ = &field;
_ = &value_0;
_ = &__koru_event_input;
const __koru_r: usize = row;
return switch (field) {
0 => blk: { __koru_store_items.v[__koru_r] = value_0; break :blk .{ .v = value_0 }; },
else => unreachable,
};
}
};
pub const __store_take_items_event = struct {
pub const Input = struct {
row: i64,
};
pub const Output = union(enum(u8)) {
item: __KoruStoreRow_items,
empty: struct {
},
};
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: i64) @This().Output {
const __koru_event_input: @This().Input = .{ .row = __koru_p_0 };
// >>> PROC: __store_take_items [tests/regression/600_STDLIB/690_STORE/690_070_store_take_empty_branch/input.k:23]
const row = __koru_event_input.row;
_ = &row;
_ = &__koru_event_input;
__koru_store_items.__koru_materialize();
const __koru_r = __koru_store_items.__koru_row_of(row) orelse return .{ .empty = .{} };
const __koru_gone_slot = __koru_store_items.__koru_row_hslot[__koru_r];
const __koru_out_v = __koru_store_items.v[__koru_r];
const __koru_last = __koru_store_items.len - 1;
if (__koru_r != __koru_last) {
__koru_store_items.v[__koru_r] = __koru_store_items.v[__koru_last];
const __koru_mv_slot = __koru_store_items.__koru_row_hslot[__koru_last];
__koru_store_items.__koru_hslot_row[__koru_mv_slot] = __koru_r;
__koru_store_items.__koru_row_hslot[__koru_r] = __koru_mv_slot;
}
__koru_store_items.__koru_hslot_row[__koru_gone_slot] = @import("std").math.maxInt(usize);
__koru_store_items.len = __koru_last;
__koru_store_items.__koru_hslot_gen[__koru_gone_slot] +%= 1;
__koru_store_items.__koru_hslot_free[__koru_store_items.__koru_hslot_free_len] = __koru_gone_slot;
__koru_store_items.__koru_hslot_free_len += 1;
__koru_store_items.__koru_gen0 = false;
return .{ .item = .{ .v = __koru_out_v } };
}
};
};
pub const koru_koru = struct {
pub const start_event = struct {
pub const Input = struct {
};
pub const Output = union(enum(u8)) {
done: struct {
},
};
pub fn handler(__koru_event_input: @This().Input) @This().Output {
_ = &__koru_event_input;
return .{ .done = .{} };
}
};
pub const end_event = struct {
pub const Input = struct {
};
pub const Output = union(enum(u8)) {
done: struct {
},
};
pub fn handler(__koru_event_input: @This().Input) @T
... [truncated - 20KB 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 'items' created (SoA cell + insert/query/write/take/stripe units); fields v: i64
static class __koru_store_items {
public static long[] v = new long[4];
public static dynamic __koru_read_v(long __h) { long __r = __koru_resolve(__h); return v[(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 = 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: 'items[...]' 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 'items' - 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 'items' - 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: 'items[...]' 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_items_event {
public struct Input {
public long v;
public long __site_line;
}
public struct Output {
public string tag;
public long row;
}
public static Output handler(Input __koru_input) {
var v = __koru_input.v;
var __site_line = __koru_input.__site_line;
if (__koru_store_items.len >= 4) throw new global::System.Exception("std/store: store 'items' is full (capacity 4) - declared capacity and the `| full` branch are pinned at 690_011");
long __koru_new_row = __koru_store_items.len;
long __koru_hslot;
if (__koru_store_items.__koru_hslot_free_len > 0) {
__koru_store_items.__koru_hslot_free_len -= 1;
__koru_hslot = __koru_store_items.__koru_hslot_free[__koru_store_items.__koru_hslot_free_len];
} else {
__koru_hslot = __koru_store_items.__koru_hslot_next;
__koru_store_items.__koru_hslot_next += 1;
}
if (!__koru_store_items.__koru_ident) {
__koru_store_items.__koru_hslot_row[__koru_hslot] = __koru_new_row;
__koru_store_items.__koru_row_hslot[__koru_new_row] = __koru_hslot;
}
__koru_store_items.v[__koru_new_row] = v;
__koru_store_items.len += 1;
return new Output { tag = "row", row = __koru_store_items.__koru_handle_of(__koru_new_row) };
return default;
}
}
public static class __store_apply_items_event {
public struct Input {
public long row;
public long field;
public long value_0;
}
public struct Output {
public string tag;
public long v;
}
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_items.v[__koru_r] = value_0; return new Output { tag = "v", v = value_0 }; }
}
throw new global::System.Exception("__store_apply_items: field index " + field + " is not a column of store 'items'");
return default;
}
}
public static class __store_take_items_event {
public struct Input {
public long row;
}
public struct Output {
public string tag;
public dynamic item;
public dynamic empty;
}
public static Output handler(Input __koru_input) {
var row = __koru_input.row;
__koru_store_items.__koru_materialize();
long __koru_r = __koru_store_items.__koru_row_of(row);
if (__koru_r < 0) return new Output { tag = "empty", empty = new { } };
long __koru_gone_slot = __koru_store_items.__koru_row_hslot[__koru_r];
var __koru_out_v = __koru_store_items.v[__koru_r];
var __koru_last = __koru_store_items.len - 1;
if (__koru_r != __koru_last) {
__koru_store_items.v[__koru_r] = __koru_store_items.v[__koru_last];
var __koru_mv_slot = __koru_store_items.__koru_row_hslot[__koru_last];
__koru_store_items.__koru_hslot_row[__koru_mv_slot] = __koru_r;
__koru_store_items.__koru_row_hslot[__koru_r] = __koru_mv_slot;
}
__koru_store_items.__koru_hslot_row[__koru_gone_slot] = -1;
__koru_store_items.len = __koru_last;
__koru_store_items.__koru_hslot_gen[__koru_gone_slot] = ((__koru_store_items.__koru_hslot_gen[__koru_gone_slot] + 1) & 4294967295L);
__koru_store_items.__koru_hslot_free[__koru_store_items.__koru_hslot_free_len] = __koru_gone_slot;
__koru_store_items.__koru_hslot_free_len += 1;
__koru_store_items.__koru_gen0 = false;
return new Output { tag = "item", item = new { v = __koru_out_v } };
return default;
}
}
public static class koru_start_event {
public struct Input {
}
public struct Output {
public string tag;
public dynamic done;
}
public static Output handler(Input __koru_input) => new Output { tag = "done" };
}
public static class koru_end_event {
public struct Input {
}
public struct Output {
public string tag;
public dynamic done;
}
public static Output handler(Input __koru_input) => new Output { tag = "done" };
}
public static void flow0() {
var result_0 = main_module.__store_inserth_items_event.handler(new __store_inserth_items_event.Input { v = (long)(42), __site_line = (long)(24)});
var a = result_0.row;
var result_1 = main_module.__store_take_items_event.handler(new __store_take_items_event.Input { row = (long)(a)});
if (result_1.tag == "item") {
var i = result_1.item;
__koru_stdout_write("took " + __koru_str(i.v) + "\n");
var result_2 = main_module.__store_take_items_event.handler(new __store_take_items_event.Input { row = (long)(a)});
if (result_2.tag == "item") {
var j = result_2.item;
__koru_stdout_write("took again " + __koru_str(j.v) + "\n");
}
if (result_2.tag == "empty") {
__koru_stdout_write("empty" + "\n");
}
}
if (result_1.tag == "empty") {
__koru_stdout_write("empty" + "\n");
}
}
public static void flow1() {
main_module.koru_start_event.handler(new koru_start_event.Input { });
}
public static void flow2() {
main_module.koru_end_event.handler(new koru_end_event.Input { });
}
}
static class Program {
static void Main() {
main_module.flow1();
main_module.flow0();
main_module.flow2();
}
}
Flows
flow ~new click a branch to expand · @labels scroll to their anchor
new (items, capacity: 4, source: v: i64)
flow ~insert click a branch to expand · @labels scroll to their anchor
insert (items, source: v: 42)
Test Configuration
MUST_RUN LANGUAGES: zig cs