✓
Passing This code compiles and runs correctly.
Code
// The pump slice: `! step` on a one-owned-column store + `std/pump`.
//
// `! step s |> lib/srclib:step(s)` declares how a row ADVANCES; the step tor's
// `|` verdicts are the store's to read — `| complete` retires the row in place
// (the `! discharge` arm runs it out), every other verdict keeps it. The
// generated pass steps each row once and never steps a retired row — the
// hand-written version of this (the sweep + handle-slot + deferred `take`
// scheduler of the r3 probe) is the code this slice replaces.
//
// `std/pump:create(name)` declares the pump; `std/pump(name)` is the join
// form — a participant attaches its verbs (`! step`/`! live`) as arms on the
// reference, and joins land in document order = pass order. The store's
// `! step` arm exposes those verbs as the ordinary units `<store>-step` /
// `<store>-live`; the pump composes names, not stores.
// `std/pump:run(name)` loops passes until every participant's `live` answers
// 0, then fires the declaration's `| drained` arm.
//
// `close -> i64` is not unattended-callable, so `! discharge` is required and
// IS the retirement path — the pinned output shows it running from inside the
// pass, not at teardown.
import std/io
import std/store
import std/pump
import lib/srclib
std/store:new(fast, capacity: 2) { *lib/srclib:Src<live!> }
! step s |> lib/srclib:step(s)
! moved i |> std/io:print.ln("fast moved {{ i:d }}")
! discharge s |> lib/srclib:close(s): id |> std/io:print.ln("retired {{ id:d }}")
std/store:new(slow, capacity: 2) { *lib/srclib:Src<live!> }
! step s |> lib/srclib:step(s)
! moved i |> std/io:print.ln("slow moved {{ i:d }}")
! discharge s |> lib/srclib:close(s): id |> std/io:print.ln("retired {{ id:d }}")
lib/srclib:open(id: 1, work: 2): a |> std/store:insert(fast) { a }
| row _ |> _
| full f |> lib/srclib:close(s: f): id |> std/io:print.ln("dropped {{ id:d }}")
lib/srclib:open(id: 2, work: 3): b |> std/store:insert(slow) { b }
| row _ |> _
| full f |> lib/srclib:close(s: f): id |> std/io:print.ln("dropped {{ id:d }}")
std/pump:create(main)
| drained |> std/io:print.ln("all participants retired")
std/pump(main)
! step |> fast-step()
! live |> fast-live()
std/pump(main)
! step |> slow-step()
! live |> slow-live()
std/pump:run(main)
Supporting Files
// A synthetic PARTICIPANT with curl's exact contract, so the pump shape can be
// probed without libcurl or a terminal.
//
// open → mints *Src<live!> (curl: multi.start | started)
// step → BORROWS <live>, `| running` / `| complete` (curl: poll)
// close → CONSUMES <!live>, hands a value back (curl: finish/cancel)
//
// close returning a value is the load-bearing detail: it leaves the column with
// ZERO void dischargers, so a store holding one must be drained by an explicit
// `! discharge` arm rather than auto-discharged (690_109's shape).
const std = @import("std");
pub const Src = struct { id: i64, left: i64 };
~pub tor open { id: i64, work: i64 } -> *Src<live!>
~proc open|zig {
const s = std.heap.page_allocator.create($mod.Src) catch unreachable;
s.* = .{ .id = id, .left = work };
return s;
}
~pub tor step { s: *Src<live> }
! ?moved i64
| running
| complete
~proc step|zig {
if (s.left <= 0) return .{ .complete = .{} };
s.left -= 1;
moved(s.id);
if (s.left == 0) return .{ .complete = .{} };
return .{ .running = .{} };
}
~pub tor close { s: *Src<!live> } -> i64
~proc close|zig {
const id = s.id;
std.heap.page_allocator.destroy(s);
return id;
}
Actual · Zig
✓ passfast moved 1
slow moved 2
fast moved 1
retired 1
slow moved 2
slow moved 2
retired 2
all participants retired
Actual · C#
✗ cs-compileExpected output
✓ Zig✗ C#fast moved 1
slow moved 2
fast moved 1
retired 1
slow moved 2
slow moved 2
retired 2
all participants retired
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 'fast' created (SoA cell + insert/query/write/take/stripe units); fields __koru_value: *lib/srclib:Src<live!>
// std/store: plural store 'slow' created (SoA cell + insert/query/write/take/stripe units); fields __koru_value: *lib/srclib:Src<live!>
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_309_store_step_pump/input.k:37 ~lib.srclib:open()
pub fn flow0() void {
const a = koru_lib.koru_srclib.open_event.handler(.{ .id = 1, .work = 2 });
const result_1 = main_module.__store_insertf_fast_event.handler(.{ .__koru_value = a, .__site_line = 37 });
_ = &result_1;
switch (result_1) {
// >>> BRANCH: tests/regression/600_STDLIB/690_STORE/690_309_store_step_pump/input.k:38 | row _auto_6 |>
.row => |_| {
},
// >>> BRANCH: tests/regression/600_STDLIB/690_STORE/690_309_store_step_pump/input.k:39 | full f |>
.full => |f| {
const id = koru_lib.koru_srclib.close_event.handler(.{ .s = f });
_ = &id;
(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("dropped {d}\n", .{id});
},
}
}
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_309_store_step_pump/input.k:41 ~lib.srclib:open()
pub fn flow1() void {
const b = koru_lib.koru_srclib.open_event.handler(.{ .id = 2, .work = 3 });
const result_1 = main_module.__store_insertf_slow_event.handler(.{ .__koru_value = b, .__site_line = 41 });
_ = &result_1;
switch (result_1) {
// >>> BRANCH: tests/regression/600_STDLIB/690_STORE/690_309_store_step_pump/input.k:42 | row _auto_7 |>
.row => |_| {
},
// >>> BRANCH: tests/regression/600_STDLIB/690_STORE/690_309_store_step_pump/input.k:43 | full f |>
.full => |f| {
const id = koru_lib.koru_srclib.close_event.handler(.{ .s = f });
_ = &id;
(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("dropped {d}\n", .{id});
},
}
}
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_309_store_step_pump/input.k:56 ~input:__pump_run_main()
pub fn flow2() void {
const __koru_eff_disc_0: main_module.__pump_run_main_event.Output = __koru_proc_0: {
while (true) {
var __koru_live: i64 = 0;
__koru_live += main_module.__pump_main_live_0_event.handler(.{});
__koru_live += main_module.__pump_main_live_1_event.handler(.{});
if (__koru_live == 0) break;
var __koru_worked: i64 = 0;
__koru_worked += main_module.__pump_main_step_0_event.handler(.{});
__koru_worked += main_module.__pump_main_step_1_event.handler(.{});
if (__koru_worked == 0) { if (false) { _ = {}; } else {
@import("std").Thread.sleep(1_000_000);
} }
}
main_module.__pump_drained_main_event.handler(.{});
break :__koru_proc_0;
};
_ = __koru_eff_disc_0;
}
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_fast = struct {
__koru_value: [2]*koru_lib.koru_srclib.Src = undefined,
len: usize = 0,
__koru_hslot_row: [2]usize = undefined,
__koru_hslot_gen: [2]u32 = [_]u32{0} ** 2,
__koru_row_hslot: [2]usize = undefined,
__koru_hslot_free: [2]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: 'fast[...]' 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 'fast' - 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 'fast' - the row it addressed was removed (stale-handle trap pinned at 690_115)");
}
return self.__koru_row_of(h) orelse @panic("std/store: 'fast[...]' 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_fast: __KoruStoreT_fast = .{};
const __KoruStoreRow_fast = struct { __koru_value: *koru_lib.koru_srclib.Src };
pub const __store_insertf_fast_event = struct {
pub const Input = struct {
__koru_value: *koru_lib.koru_srclib.Src,
__site_line: i64,
};
pub const Output = union(enum(u8)) {
row: i64,
full: *koru_lib.koru_srclib.Src,
};
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> PROC: __store_insertf_fast [tests/regression/600_STDLIB/690_STORE/690_309_store_step_pump/input.k:27]
const __koru_value = __koru_event_input.__koru_value;
const __site_line = __koru_event_input.__site_line;
_ = &__koru_value;
_ = &__site_line;
_ = &__koru_event_input;
if (__koru_store_fast.len >= 2) return .{ .full = __koru_value };
if (__koru_store_fast.len >= 2) @panic("std/store: store 'fast' is full (capacity 2) - declared capacity and the `| full` branch are pinned at 690_011");
const __koru_new_row = __koru_store_fast.len;
const __koru_hslot = if (__koru_store_fast.__koru_hslot_free_len > 0) blk_hs: {
__koru_store_fast.__koru_hslot_free_len -= 1;
break :blk_hs __koru_store_fast.__koru_hslot_free[__koru_store_fast.__koru_hslot_free_len];
} else blk_hs: {
const __koru_hn = __koru_store_fast.__koru_hslot_next;
__koru_store_fast.__koru_hslot_next += 1;
break :blk_hs __koru_hn;
};
if (!__koru_store_fast.__koru_ident) {
__koru_store_fast.__koru_hslot_row[__koru_hslot] = __koru_new_row;
__koru_store_fast.__koru_row_hslot[__koru_new_row] = __koru_hslot;
}
__koru_store_fast.__koru_value[__koru_new_row] = __koru_value;
__koru_store_fast.len += 1;
return .{ .row = __koru_store_fast.__koru_handle_of(__koru_new_row) };
}
};
pub const __store_stepbody_fast_event = struct {
pub const Input = struct {
s: *koru_lib.koru_srclib.Src,
};
pub const Output = union(enum(u8)) {
running: struct {
},
complete: struct {
},
};
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> SUBFLOW: tests/regression/600_STDLIB/690_STORE/690_309_store_step_pump/input.k:27
const s = __koru_event_input.s;
_ = &s;
_ = &__koru_event_input;
const Handlers_sf = struct {
fn moved(i: i64) void {
_ = &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("fast moved {d}\n", .{i});
}
}
};
const result = koru_lib.koru_srclib.step_event.handler(.{ .s = s }, Handlers_sf);
return switch (result) {
.complete => .{ .complete = .{ } },
.running => .{ .running = .{ } },
};
}
};
pub const __store_dischargeone_fast_event = struct {
pub const Input = struct {
s: *koru_lib.koru_srclib.Src,
};
pub const Output = void;
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> SUBFLOW: tests/regression/600_STDLIB/690_STORE/690_309_store_step_pump/input.k:27
const s = __koru_event_input.s;
_ = &s;
_ = &__koru_event_input;
const result = koru_lib.koru_srclib.close_event.handler(.{ .s = s });
const id = result;
_ = &result;
(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: ?*anyopa
... [truncated - 47KB total]Flows
flow ~new click a branch to expand · @labels scroll to their anchor
new (fast, capacity: 2, source: *lib/srclib:Src<live!>)
flow ~new click a branch to expand · @labels scroll to their anchor
new (slow, capacity: 2, source: *lib/srclib:Src<live!>)
flow ~open click a branch to expand · @labels scroll to their anchor
open (id: 1, work: 2)
flow ~open click a branch to expand · @labels scroll to their anchor
open (id: 2, work: 3)
flow ~create click a branch to expand · @labels scroll to their anchor
create (expr: main)
flow ~std/pump click a branch to expand · @labels scroll to their anchor
std/pump (main)
flow ~std/pump click a branch to expand · @labels scroll to their anchor
std/pump (main)
flow ~run click a branch to expand · @labels scroll to their anchor
run (main)
Test Configuration
MUST_RUN
koru.json:
{
"name": "probe",
"version": "0.1.0"
}