✓
Passing This code compiles and runs correctly.
Code
// PINS: when a chain step's branch arms are written on following lines, each
// arm binds to the step directly above it — not to an earlier step in the
// same chain.
//
// `|> if (g.tick == 0)` and `|> if (g.tick == 1)` are sibling links of one
// chain inside the `! first` arm, and each declares `| then`. Before the fix
// the flat multi-line list [then, if, then, print] was dumped whole under the
// first `|> if`, so the second `if` saw no `then` (KORU022) and the first saw
// two (KORU028). The fold must interleave: arms attach to the current chain
// tail, unnamed `|>` steps extend the chain and become the new tail.
//
// tick = 0: the first `if` fires ("one"), the second does not, and the chain
// continues to "end" — the run pins both the attachment and the order.
import std/io
import std/store
std/store:new(s, capacity: 4) { tick: i32 }
std/store:insert(s) { tick: 0 }
std/store:query(s)
! first g |> std/io:print.ln("a")
|> if (g.tick == 0)
| then |> std/io:print.ln("one")
|> if (g.tick == 1)
| then |> std/io:print.ln("two")
|> std/io:print.ln("end")
Actual
a
one
end
Expected output
✓ Zig✓ C#a
one
end
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);
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 's' created (SoA cell + insert/query/write/take/stripe units); fields tick: i32
// >>> FLOW: tests/regression/200_COMPILER_FEATURES/210_PARSER/210_314_second_chain_step_keeps_its_arms/input.k:20 ~input:__store_insert_s()
pub fn flow0() void {
_ = main_module.__store_insert_s_event.handler(.{ .tick = 0, .__site_line = 20 });
}
// >>> FLOW: tests/regression/200_COMPILER_FEATURES/210_PARSER/210_314_second_chain_step_keeps_its_arms/input.k:22 ~input:__store_sweeprun_s_L23_210_314_second_chain_step_keeps_its_arms_input_4b21cf()
pub fn flow1() void {
_ = main_module.__store_sweeprun_s_L23_210_314_second_chain_step_keeps_its_arms_input_4b21cf_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_s = struct {
tick: [4]i32 = undefined,
len: usize = 0,
};
var __koru_store_s: __KoruStoreT_s = .{};
const __KoruStoreRow_s = struct { tick: i32 };
pub const __store_insert_s_event = struct {
pub const Input = struct {
tick: i32,
__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.tick, __koru_event_input.__site_line);
}
fn __koru_handler_impl(__koru_p_0: i32, __koru_p_1: i64) @This().Output {
const __koru_event_input: @This().Input = .{ .tick = __koru_p_0, .__site_line = __koru_p_1 };
// >>> PROC: __store_insert_s [tests/regression/200_COMPILER_FEATURES/210_PARSER/210_314_second_chain_step_keeps_its_arms/input.k:19]
const tick = __koru_event_input.tick;
const __site_line = __koru_event_input.__site_line;
_ = &tick;
_ = &__site_line;
_ = &__koru_event_input;
if (__koru_store_s.len >= 4) @panic("std/store: store 's' is full (capacity 4) - declared capacity and the `| full` branch are pinned at 690_011");
const __koru_new_row = __koru_store_s.len;
__koru_store_s.tick[__koru_new_row] = tick;
__koru_store_s.len += 1;
return;
}
};
pub const __store_apply_s_event = struct {
pub const Input = struct {
row: usize,
field: i64,
value_0: i32,
};
pub const Output = union(enum(u8)) {
tick: i32,
};
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> PROC: __store_apply_s [tests/regression/200_COMPILER_FEATURES/210_PARSER/210_314_second_chain_step_keeps_its_arms/input.k:19]
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_s.tick[__koru_r] = value_0; break :blk .{ .tick = value_0 }; },
else => unreachable,
};
}
};
pub const __store_sweepbody_s_L23_210_314_second_chain_step_keeps_its_arms_input_4b21cf_event = struct {
pub const Input = struct {
__koru_srf_g_L23_tick: i32,
__koru_sdix_g_L23: usize,
};
pub const Output = void;
pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
return __koru_handler_impl(__koru_event_input.__koru_srf_g_L23_tick, __koru_event_input.__koru_sdix_g_L23);
}
fn __koru_handler_impl(__koru_p_0: i32, __koru_p_1: usize) @This().Output {
const __koru_event_input: @This().Input = .{ .__koru_srf_g_L23_tick = __koru_p_0, .__koru_sdix_g_L23 = __koru_p_1 };
// >>> SUBFLOW: tests/regression/200_COMPILER_FEATURES/210_PARSER/210_314_second_chain_step_keeps_its_arms/input.k:22
const __koru_srf_g_L23_tick = __koru_event_input.__koru_srf_g_L23_tick;
const __koru_sdix_g_L23 = __koru_event_input.__koru_sdix_g_L23;
_ = &__koru_srf_g_L23_tick;
_ = &__koru_sdix_g_L23;
_ = &__koru_event_input;
(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("a\n", .{});
if (__koru_srf_g_L23_tick == 0) {
{ (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("one\n", .{});
}
} else {
{ }
}
if (__koru_srf_g_L23_tick == 1) {
{ (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("two\n", .{});
}
} else {
{ }
}
(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_2| { const __kn = @min(__kt.len - 1, __b.len - __ki_2 * (__kt.len - 1)); @memcpy(__kt[0..__kn], __b[__ki_2 * (__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("end\n", .{});
}
};
pub const __store_sweeprun_s_L23_210_314_second_chain_step_keeps_its_arms_input_4b21cf_event = struct {
pub const Input = struct {
};
pub const Output = void;
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> PROC: __store_sweeprun_s_L23_210_314_second_chain_step_keeps_its_arms_input_4b21cf [tests/regression/200_COMPILER_FEATURES/210_PARSER/210_314_second_chain_step_keeps_its_arms/input.k:22]
_ = &__koru_event_input;
{
for (0..main_module.__koru_store_s.len) |__koru_si| {
const __koru_srf_g_L23_tick = main_module.__koru_store_s.tick[__koru_si];
_ = &__koru_srf_g_L23_tick;
main_module.__store_sweepbody_s_L23_210_314_second_chain_step_keeps_its_arms_input_4b21cf_event.handler(.{ .__koru_srf_g_L23_tick = __koru_srf_g_L23_tick, .__koru_sdix_g_L23 = __koru_si });
break;
}
}
return;
}
};
};
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) @This().Output {
_ = &__koru_event_input;
return .{ .done = .{} };
}
};
};
pub fn main() void {
main_module.koru_start_flow();
main_module.flow0();
main_module.flow1();
main_module.koru_end_flow();
if (comptime @import("builtin").mode == .Debug) koru_leak_check();
}
test {
@import("std").testing.refAllDeclsRecursive(@This());
}
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 's' created (SoA cell + insert/query/write/take/stripe units); fields tick: i32
static class __koru_store_s {
public static int[] tick = new int[4];
public static long len = 0;
public static long __koru_brand = -1;
}
public static class __store_insert_s_event {
public struct Input {
public int tick;
public long __site_line;
}
public static object handler(Input __koru_input) {
var tick = __koru_input.tick;
var __site_line = __koru_input.__site_line;
if (__koru_store_s.len >= 4) throw new global::System.Exception("std/store: store 's' is full (capacity 4) - declared capacity and the `| full` branch are pinned at 690_011");
long __koru_new_row = __koru_store_s.len;
__koru_store_s.tick[__koru_new_row] = tick;
__koru_store_s.len += 1;
return default;
}
}
public static class __store_apply_s_event {
public struct Input {
public long row;
public long field;
public int value_0;
}
public struct Output {
public string tag;
public int tick;
}
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_s.tick[__koru_r] = value_0; return new Output { tag = "tick", tick = value_0 }; }
}
throw new global::System.Exception("__store_apply_s: field index " + field + " is not a column of store 's'");
return default;
}
}
public static class __store_sweepbody_s_L23_210_314_second_chain_step_keeps_its_arms_input_4b21cf_event {
public struct Input {
public int __koru_srf_g_L23_tick;
public long __koru_sdix_g_L23;
}
public static object handler(Input __koru_input) {
var __koru_srf_g_L23_tick = __koru_input.__koru_srf_g_L23_tick;
var __koru_sdix_g_L23 = __koru_input.__koru_sdix_g_L23;
__koru_stdout_write("a" + "\n");
if (__koru_srf_g_L23_tick == 0) {
{ __koru_stdout_write("one" + "\n");
}
} else {
{ }
}
if (__koru_srf_g_L23_tick == 1) {
{ __koru_stdout_write("two" + "\n");
}
} else {
{ }
}
__koru_stdout_write("end" + "\n");
return default;
}
}
public static class __store_sweeprun_s_L23_210_314_second_chain_step_keeps_its_arms_input_4b21cf_event {
public struct Input {
}
public static object handler(Input __koru_input) {
{
for (var __koru_si = 0; __koru_si < __koru_store_s.len; __koru_si++) {
var __koru_srf_g_L23_tick = __koru_store_s.tick[__koru_si];
main_module.__store_sweepbody_s_L23_210_314_second_chain_step_keeps_its_arms_input_4b21cf_event.handler(new main_module.__store_sweepbody_s_L23_210_314_second_chain_step_keeps_its_arms_input_4b21cf_event.Input { __koru_srf_g_L23_tick = __koru_srf_g_L23_tick, __koru_sdix_g_L23 = __koru_si });
break;
}
}
return default;
}
}
public static class std_control_if_event {
public struct Input {
public string expr;
}
public struct Output {
public string tag;
public object then;
public object @else;
}
public static Output handler(Input __koru_input) {
var expr = __koru_input.expr;
throw new global::System.Exception("if: |template| proc is inlined at call sites and must never be called");
}
}
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 __koru_p_tick = (int)(0);
var __koru_p___site_line = (long)(20);
if (__koru_store_s.len >= 4) throw new global::System.Exception("std/store: store 's' is full (capacity 4) - declared capacity and the `| full` branch are pinned at 690_011");
long __koru_new_row = __koru_store_s.len;
__koru_store_s.tick[__koru_new_row] = __koru_p_tick;
__koru_store_s.len += 1;
}
}
public static void flow1() {
{
{
for (var __koru_si = 0; __koru_si < __koru_store_s.len; __koru_si++) {
var __koru_srf_g_L23_tick = __koru_store_s.tick[__koru_si];
main_module.__store_sweepbody_s_L23_210_314_second_chain_step_keeps_its_arms_input_4b21cf_event.handler(new main_module.__store_sweepbody_s_L23_210_314_second_chain_step_keeps_its_arms_input_4b21cf_event.Input { __koru_srf_g_L23_tick = __koru_srf_g_L23_tick, __koru_sdix_g_L23 = __koru_si });
break;
}
}
}
}
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 (s, capacity: 4, source: tick: i32)
flow ~insert click a branch to expand · @labels scroll to their anchor
insert (s, source: tick: 0)
flow ~query click a branch to expand · @labels scroll to their anchor
query (s)
Test Configuration
MUST_RUN LANGUAGES: zig cs