236 a rule is total at its installation point

✓ Passing This code compiles and runs correctly.

Code

input.k

Actual

rule saw 1
rule saw 2
rule saw 3
rule saw 4

Expected output

✓ Zig✓ C#
rule saw 1
rule saw 2
rule saw 3
rule saw 4
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: usize = 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 += 1;
    }
    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 -= 1;
    }
}
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 == 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;
            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 'seen' created (SoA cell + insert/query/write/take/stripe units); fields n: i64
    // >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_236_a_rule_is_total_at_its_installation_point/input.k:26  ~input:__store_insertf_seen()
    pub fn flow0() void {
        const result_0 = main_module.__store_insertf_seen_event.handler(.{ .n = 1, .__site_line = 26 });
        switch (result_0) {
            // >>> BRANCH: tests/regression/600_STDLIB/690_STORE/690_236_a_rule_is_total_at_its_installation_point/input.k:27  | row _auto_6 |>
            .row => |_| {
            },
            // >>> BRANCH: tests/regression/600_STDLIB/690_STORE/690_236_a_rule_is_total_at_its_installation_point/input.k:28  | full |>
            .full => {
            },
        }
    }
    // >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_236_a_rule_is_total_at_its_installation_point/input.k:30  ~input:__store_insertf_seen()
    pub fn flow1() void {
        const result_0 = main_module.__store_insertf_seen_event.handler(.{ .n = 2, .__site_line = 30 });
        switch (result_0) {
            // >>> BRANCH: tests/regression/600_STDLIB/690_STORE/690_236_a_rule_is_total_at_its_installation_point/input.k:31  | row _auto_7 |>
            .row => |_| {
            },
            // >>> BRANCH: tests/regression/600_STDLIB/690_STORE/690_236_a_rule_is_total_at_its_installation_point/input.k:32  | full |>
            .full => {
            },
        }
    }
    // >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_236_a_rule_is_total_at_its_installation_point/input.k:34  ~input:__store_qsweep_seen_L34_690_236_a_rule_is_total_at_its_installation_point_input_bfe003()
    pub fn flow2() void {
        _ = main_module.__store_qsweep_seen_L34_690_236_a_rule_is_total_at_its_installation_point_input_bfe003_event.handler(.{  });
    }
    // >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_236_a_rule_is_total_at_its_installation_point/input.k:37  ~input:__store_insertf_seen()
    pub fn flow3() void {
        const result_0 = main_module.__store_insertf_seen_event.handler(.{ .n = 3, .__site_line = 37 });
        switch (result_0) {
            // >>> BRANCH: tests/regression/600_STDLIB/690_STORE/690_236_a_rule_is_total_at_its_installation_point/input.k:38  | row _auto_8 |>
            .row => |_| {
            },
            // >>> BRANCH: tests/regression/600_STDLIB/690_STORE/690_236_a_rule_is_total_at_its_installation_point/input.k:39  | full |>
            .full => {
            },
        }
    }
    // >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_236_a_rule_is_total_at_its_installation_point/input.k:41  ~input:__store_insertf_seen()
    pub fn flow4() void {
        const result_0 = main_module.__store_insertf_seen_event.handler(.{ .n = 4, .__site_line = 41 });
        switch (result_0) {
            // >>> BRANCH: tests/regression/600_STDLIB/690_STORE/690_236_a_rule_is_total_at_its_installation_point/input.k:42  | row _auto_9 |>
            .row => |_| {
            },
            // >>> BRANCH: tests/regression/600_STDLIB/690_STORE/690_236_a_rule_is_total_at_its_installation_point/input.k:43  | full |>
            .full => {
            },
        }
    }
    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_seen = struct {
    n: [8]i64 = undefined,
    len: usize = 0,
};
var __koru_store_seen: __KoruStoreT_seen = .{};
const __KoruStoreRow_seen = struct { n: i64 };
    pub const __store_insertf_seen_event = struct {
        pub const Input = struct {
            n: i64,
            __site_line: i64,
        };
        pub const Output = union(enum(u8)) {
            row: i64,
            full: struct {
            },
        };
        pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
            return __koru_handler_impl(__koru_event_input.n, __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 = .{ .n = __koru_p_0, .__site_line = __koru_p_1 };
            // >>> PROC: __store_insertf_seen  [tests/regression/600_STDLIB/690_STORE/690_236_a_rule_is_total_at_its_installation_point/input.k:24]
            const n = __koru_event_input.n;
            const __site_line = __koru_event_input.__site_line;
            _ = &n;
            _ = &__site_line;
            _ = &__koru_event_input;
            if (__koru_store_seen.len >= 8) return .{ .full = .{} };
            if (__koru_store_seen.len >= 8) @panic("std/store: store 'seen' is full (capacity 8) - declared capacity and the `| full` branch are pinned at 690_011");
            const __koru_new_row = __koru_store_seen.len;
            __koru_store_seen.n[__koru_new_row] = n;
            __koru_store_seen.len += 1;
            if (__site_line > 34) {
                main_module.__store_qrow_seen_L34_690_236_a_rule_is_total_at_its_installation_point_input_bfe003_event.handler(.{ .row = __koru_new_row });
            }
            return .{ .row = @as(i64, @intCast(__koru_new_row)) };

        }
    };
    pub const __store_apply_seen_event = struct {
        pub const Input = struct {
            row: usize,
            field: i64,
            value_0: i64,
        };
        pub const Output = union(enum(u8)) {
            n: i64,
        };
        pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
            return __koru_handler_impl(__koru_event_input.row, __koru_event_input.field, __koru_event_input.value_0);
        }
        fn __koru_handler_impl(__koru_p_0: usize, __koru_p_1: i64, __koru_p_2: i64) @This().Output {
            const __koru_event_input: @This().Input = .{ .row = __koru_p_0, .field = __koru_p_1, .value_0 = __koru_p_2 };
            // >>> PROC: __store_apply_seen  [tests/regression/600_STDLIB/690_STORE/690_236_a_rule_is_total_at_its_installation_point/input.k:24]
            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_seen.n[__koru_r] = value_0; break :blk .{ .n = value_0 }; },
                else => unreachable,
            };

        }
    };
    pub const __store_qrow_seen_L34_690_236_a_rule_is_total_at_its_installation_point_input_bfe003_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_seen_L34_690_236_a_rule_is_total_at_its_installation_point_input_bfe003  [tests/regression/600_STDLIB/690_STORE/690_236_a_rule_is_total_at_its_installation_point/input.k:24]
            const row = __koru_event_input.row;
            _ = &row;
            _ = &__koru_event_input;
            const __koru_r: usize = row;
            main_module.__store_qbody_seen_L34_690_236_a_rule_is_total_at_its_installation_point_input_bfe003_event.handler(.{ .__koru_sdix_rule_L34 = __koru_r });
            return;

        }
    };
    pub const __store_qbody_seen_L34_690_236_a_rule_is_total_at_its_installation_point_input_bfe003_event = struct {
        pub const Input = struct {
            __koru_sdix_rule_L34: usize,
        };
        pub const Output = void;
        pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
            return __koru_handler_impl(__koru_event_input.__koru_sdix_rule_L34);
        }
        fn __koru_handler_impl(__koru_p_0: usize) @This().Output {
            const __koru_event_input: @This().Input = .{ .__koru_sdix_rule_L34 = __koru_p_0 };
            // >>> SUBFLOW: tests/regression/600_STDLIB/690_STORE/690_236_a_rule_is_total_at_its_installation_point/input.k:24
            const __koru_sdix_rule_L34 = __koru_event_input.__koru_sdix_rule_L34;
            _ = &__koru_sdix_rule_L34;
            _ = &__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("rule saw {d}\n", .{(&__koru_store_seen.n)[@as(usize, @intCast(__koru_sdix_rule_L34))]});
        }
    };
    pub const __store_qsweep_seen_L34_690_236_a_rule_is_total_at_its_installation_point_input_bfe003_event = struct {
        pub const Input = struct {
        };
        pub const Output = void;
        pub fn handler(__koru_event_input: @This().Input) @This().Output {
            // >>> PROC: __store_qsweep_seen_L34_690_236_a_rule_is_total_at_its_installation_point_input_bfe003  [tests/regression/600_STDLIB/690_STORE/690_236_a_rule_is_total_at_its_installation_point/input.k:24]
            _ = &__koru_event_input;
            for (0..__koru_store_seen.len) |__koru_i| {
                main_module.__store_qrow_seen_L34_690_236_a_rule_is_total_at_its_installation_point_input_bfe003_event.handler(.{ .row = __koru_i });
            }
            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.flow2();
    main_module.flow3();
    main_module.flow4();
    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(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 'seen' created (SoA cell + insert/query/write/take/stripe units); fields n: i64
  static class __koru_store_seen {
    public static long[] n = new long[8];
    public static long len = 0;
    public static long __koru_brand = -1;
}

  public static class __store_insertf_seen_event {
    public struct Input {
      public long n;
      public long __site_line;
    }
    public struct Output {
      public string tag;
      public long row;
      public dynamic full;
    }
    public static Output handler(Input __koru_input) {
      var n = __koru_input.n;
      var __site_line = __koru_input.__site_line;
      if (__koru_store_seen.len >= 8) return new Output { tag = "full", full = new { } };
      if (__koru_store_seen.len >= 8) throw new global::System.Exception("std/store: store 'seen' is full (capacity 8) - declared capacity and the `| full` branch are pinned at 690_011");
      long __koru_new_row = __koru_store_seen.len;
      __koru_store_seen.n[__koru_new_row] = n;
      __koru_store_seen.len += 1;
      if (__site_line > 34) {
      main_module.__store_qrow_seen_L34_690_236_a_rule_is_total_at_its_installation_point_input_bfe003_event.handler(new main_module.__store_qrow_seen_L34_690_236_a_rule_is_total_at_its_installation_point_input_bfe003_event.Input { row = __koru_new_row });
      }
      return new Output { tag = "row", row = __koru_new_row };

      return default;

    }
  }
  public static class __store_apply_seen_event {
    public struct Input {
      public long row;
      public long field;
      public long value_0;
    }
    public struct Output {
      public string tag;
      public long n;
    }
    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_seen.n[__koru_r] = value_0; return new Output { tag = "n", n = value_0 }; }
      }
      throw new global::System.Exception("__store_apply_seen: field index " + field + " is not a column of store 'seen'");

      return default;

    }
  }
  public static class __store_qrow_seen_L34_690_236_a_rule_is_total_at_its_installation_point_input_bfe003_event {
    public struct Input {
      public long row;
    }
    public static dynamic handler(Input __koru_input) {
      var row = __koru_input.row;
      var __koru_r = row;
      main_module.__store_qbody_seen_L34_690_236_a_rule_is_total_at_its_installation_point_input_bfe003_event.handler(new main_module.__store_qbody_seen_L34_690_236_a_rule_is_total_at_its_installation_point_input_bfe003_event.Input { __koru_sdix_rule_L34 = __koru_r });

      return default;

    }
  }
  public static class __store_qbody_seen_L34_690_236_a_rule_is_total_at_its_installation_point_input_bfe003_event {
    public struct Input {
      public long __koru_sdix_rule_L34;
    }
    public static dynamic handler(Input __koru_input) {
      var __koru_sdix_rule_L34 = __koru_input.__koru_sdix_rule_L34;
__koru_stdout_write("rule saw " + __koru_str(__koru_store_seen.n[(__koru_sdix_rule_L34)]) + "\n");

      return default;

    }
  }
  public static class __store_qsweep_seen_L34_690_236_a_rule_is_total_at_its_installation_point_input_bfe003_event {
    public struct Input {
    }
    public static dynamic handler(Input __koru_input) {
      for (long __koru_i = 0; __koru_i < __koru_store_seen.len; __koru_i++) {
      main_module.__store_qrow_seen_L34_690_236_a_rule_is_total_at_its_installation_point_input_bfe003_event.handler(new main_module.__store_qrow_seen_L34_690_236_a_rule_is_total_at_its_installation_point_input_bfe003_event.Input { row = __koru_i });
      }

      return default;

    }
  }
  public static class std_io_print_ln_event {
    public struct Input {
      public dynamic expr;
      public dynamic invocation;
      public dynamic item;
      public dynamic program;
      public dynamic reporter;
      public dynamic allocator;
    }
    public static dynamic handler(Input __koru_input) {
      var expr = __koru_input.expr;
      var invocation = __koru_input.invocation;
      var item = __koru_input.item;
      var program = __koru_input.program;
      var reporter = __koru_input.reporter;
      var allocator = __koru_input.allocator;
      throw new global::System.Exception("ln: [transform] tor is lowered at compile time and must never be called");

    }
  }
  public static void flow0() {
    var result_0 = main_module.__store_insertf_seen_event.handler(new __store_insertf_seen_event.Input { n = (long)(1), __site_line = (long)(26)});
    if (result_0.tag == "row") {
      var _auto_6 = result_0.row;
    }
    if (result_0.tag == "full") {
    }
  }
  public static void flow1() {
    var result_1 = main_module.__store_insertf_seen_event.handler(new __store_insertf_seen_event.Input { n = (long)(2), __site_line = (long)(30)});
    if (result_1.tag == "row") {
      var _auto_7 = result_1.row;
    }
    if (result_1.tag == "full") {
    }
  }
  public static void flow2() {
    {
      for (long __koru_i = 0; __koru_i < __koru_store_seen.len; __koru_i++) {
      main_module.__store_qrow_seen_L34_690_236_a_rule_is_total_at_its_installation_point_input_bfe003_event.handler(new main_module.__store_qrow_seen_L34_690_236_a_rule_is_total_at_its_installation_point_input_bfe003_event.Input { row = __koru_i });
      }
    }
  }
  public static void flow3() {
    var result_2 = main_module.__store_insertf_seen_event.handler(new __store_insertf_seen_event.Input { n = (long)(3), __site_line = (long)(37)});
    if (result_2.tag == "row") {
      var _auto_8 = result_2.row;
    }
    if (result_2.tag == "full") {
    }
  }
  public static void flow4() {
    var result_3 = main_module.__store_insertf_seen_event.handler(new __store_insertf_seen_event.Input { n = (long)(4), __site_line = (long)(41)});
    if (result_3.tag == "row") {
      var _auto_9 = result_3.row;
    }
    if (result_3.tag == "full") {
    }
  }
}

static class Program {
  static void Main() {
    main_module.flow0();
    main_module.flow1();
    main_module.flow2();
    main_module.flow3();
    main_module.flow4();
  }
}

Flows

flow ~new click a branch to expand · @labels scroll to their anchor
new (seen, capacity: 8, source: n: 0[i64])
flow ~insert click a branch to expand · @labels scroll to their anchor
insert (seen, source: n: 1)
flow ~insert click a branch to expand · @labels scroll to their anchor
insert (seen, source: n: 2)
flow ~rule click a branch to expand · @labels scroll to their anchor
rule (seen)
flow ~insert click a branch to expand · @labels scroll to their anchor
insert (seen, source: n: 3)
flow ~insert click a branch to expand · @labels scroll to their anchor
insert (seen, source: n: 4)

Test Configuration

MUST_RUN LANGUAGES: zig cs