069 store sweep row ordinal

✓ Passing This code compiles and runs correctly.

Code

// PINS (RED, awaiting implementation): a query arm's destructure block is a
// REQUEST, and its entries carry PREFIX ANNOTATIONS naming what the visit
// should synthesize. Here: the row itself, and the 0-based layout cursor a
// retained renderer needs.
//
// RULED 2026-08-03 by Lars, after this pin sat unspellable for a week:
//
//   1. The block is a REQUEST — the transform synthesizes what is asked for,
//      and ONLY what is asked for. An unrequested ordinal materializes no
//      cursor, the same way an unread aggregate materializes no column.
//   2. Entries are annotated with the language's normal PREFIX form —
//      `[comptime]tor`, `[keyword]`, `[global(name)]`. `r[mutable]` is postfix
//      only because it hangs off a binding; prefix is the convention.
//   3. LOCAL TO query/store. This is deliberately NOT a language-wide loop
//      counter: `for` has the same missing-index hole and does NOT get this.
//      The store's query is special because it already drives codegen.
//   4. Honored or REFUSED — never silently ignored. Same law as declared
//      reductions ("must refuse to compile, never fall back to serial"). An
//      annotation that cannot be satisfied at a site is a diagnostic naming
//      the site and the reason, not a decoration.
//
// WHY THE BLOCK IS LEGAL AGAIN, when `690_089` refuses a projection block.
// Three separate things were collapsed under one word, "retired":
//
//   - `entity.v` — an UNSCOPED MAGIC TOKEN. Killed because the rewrite matched
//     the literal word across a subtree with no scope, so nested sweeps read
//     the inner store and wrote the outer one in one arm (690_087). Bindings
//     are distinct tokens per nesting level, so this never applied to them.
//   - A COLUMN LIST (`{ v, w }`). Killed because "the projection block said the
//     same thing twice and let the two halves disagree" (store.kz, at the
//     refusal): which columns a site touches is DERIVED from `<row>.<field>`
//     references, never listed.
//   - The BRACES THEMSELVES. Never had an argument against them. The wall is
//     written `if (sc.destructure.len > 0)` — a syntactic ban on brackets
//     standing in for an argument about column lists.
//
// This form is untouched by all three: nothing here is a column, so nothing is
// stated twice and the columns stay derived from `e.v` below. Every entry is a
// binding, so nesting stays unambiguous.
//
// NO PARSE AMBIGUITY. A destructure field accepts an identifier, a dotted path,
// or `_` (parser.zig, the PARSE001 site) — there is no bracket production, so a
// LEADING `[` is unclaimed. It cannot collide with `stored { tree[a].parent }`
// handle addressing, where `[` FOLLOWS an identifier and is parsed by the
// store's lvalue grammar. Position tells them apart.
//
// `! query e` stays legal as the shorthand for `! query { [row]e }` — 149
// green sites depend on it and rule 1 of 690_086 still governs the row.
//
// STILL OPEN, deliberately not pinned here: whether the block may ALSO name
// columns. If it may, the two killed arguments above come back with them, so
// this pin keeps columns on `e.v` and lets the block carry only what the VISIT
// knows and the row does not. The vocabulary beyond `[row]`/`[ordinal]`
// (`[id]` for the handle, density and write-intent markers that would let the
// dense-cursor codegen be DECLARED rather than inferred) wants one gating
// principle before it grows — the way fusibility has one.
import std/io
import std/store
std/store:new(items, capacity: 8) { v: i64 }
std/store:insert(items) { v: 10 }
std/store:insert(items) { v: 20 }
std/store:insert(items) { v: 30 }
std/store:query(items)
! query { [row]e, [ordinal]n } |> std/io:print.ln("row {{ n:d }} = {{ e.v:d }}")

input.k

Actual

row 0 = 10
row 1 = 20
row 2 = 30

Expected output

✓ Zig✓ C#

row 0 = 10
row 1 = 20
row 2 = 30

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_069_store_sweep_row_ordinal/input.k:61  ~input:__store_insert_items()
    pub fn flow0() void {
        _ = main_module.__store_insert_items_event.handler(.{ .v = 10, .__site_line = 61 });
    }
    // >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_069_store_sweep_row_ordinal/input.k:62  ~input:__store_insert_items()
    pub fn flow1() void {
        _ = main_module.__store_insert_items_event.handler(.{ .v = 20, .__site_line = 62 });
    }
    // >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_069_store_sweep_row_ordinal/input.k:63  ~input:__store_insert_items()
    pub fn flow2() void {
        _ = main_module.__store_insert_items_event.handler(.{ .v = 30, .__site_line = 63 });
    }
    // >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_069_store_sweep_row_ordinal/input.k:64  ~input:__store_sweeprun_items_L65_690_069_store_sweep_row_ordinal_input_5dffb6()
    pub fn flow3() void {
        _ = main_module.__store_sweeprun_items_L65_690_069_store_sweep_row_ordinal_input_5dffb6_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_items = struct {
    v: [8]i64 = undefined,
    len: usize = 0,
};
var __koru_store_items: __KoruStoreT_items = .{};
const __KoruStoreRow_items = struct { v: i64 };
    pub const __store_insert_items_event = struct {
        pub const Input = struct {
            v: i64,
            __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.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_insert_items  [tests/regression/600_STDLIB/690_STORE/690_069_store_sweep_row_ordinal/input.k:60]
            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 >= 8) @panic("std/store: store 'items' is full (capacity 8) - declared capacity and the `| full` branch are pinned at 690_011");
            const __koru_new_row = __koru_store_items.len;
            __koru_store_items.v[__koru_new_row] = v;
            __koru_store_items.len += 1;
            return;

        }
    };
    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_069_store_sweep_row_ordinal/input.k:60]
            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_sweepbody_items_L65_690_069_store_sweep_row_ordinal_input_5dffb6_event = struct {
        pub const Input = struct {
            __koru_srf_e_L65_v: i64,
            n: i64,
            __koru_sdix_e_L65: 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_e_L65_v, __koru_event_input.n, __koru_event_input.__koru_sdix_e_L65);
        }
        fn __koru_handler_impl(__koru_p_0: i64, __koru_p_1: i64, __koru_p_2: usize) @This().Output {
            const __koru_event_input: @This().Input = .{ .__koru_srf_e_L65_v = __koru_p_0, .n = __koru_p_1, .__koru_sdix_e_L65 = __koru_p_2 };
            // >>> SUBFLOW: tests/regression/600_STDLIB/690_STORE/690_069_store_sweep_row_ordinal/input.k:64
            const __koru_srf_e_L65_v = __koru_event_input.__koru_srf_e_L65_v;
            const n = __koru_event_input.n;
            const __koru_sdix_e_L65 = __koru_event_input.__koru_sdix_e_L65;
            _ = &__koru_srf_e_L65_v;
            _ = &n;
            _ = &__koru_sdix_e_L65;
            _ = &__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("row {d} = {d}\n", .{n, __koru_srf_e_L65_v});
        }
    };
    pub const __store_sweeprun_items_L65_690_069_store_sweep_row_ordinal_input_5dffb6_event = struct {
        pub const Input = struct {
        };
        pub const Output = void;
        pub fn handler(__koru_event_input: @This().Input) @This().Output {
            // >>> PROC: __store_sweeprun_items_L65_690_069_store_sweep_row_ordinal_input_5dffb6  [tests/regression/600_STDLIB/690_STORE/690_069_store_sweep_row_ordinal/input.k:64]
            _ = &__koru_event_input;
            {
            for (0..main_module.__koru_store_items.len) |__koru_si| {
            const __koru_srf_e_L65_v = main_module.__koru_store_items.v[__koru_si];
            _ = &__koru_srf_e_L65_v;
            main_module.__store_sweepbody_items_L65_690_069_store_sweep_row_ordinal_input_5dffb6_event.handler(.{ .__koru_srf_e_L65_v = __koru_srf_e_L65_v, .n = @as(i64, @intCast(__koru_si)), .__koru_sdix_e_L65 = __koru_si });
            }
            }
            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.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 'items' created (SoA cell + insert/query/write/take/stripe units); fields v: i64
  static class __koru_store_items {
    public static long[] v = new long[8];
    public static long len = 0;
    public static long __koru_brand = -1;
}

  public static class __store_insert_items_event {
    public struct Input {
      public long v;
      public long __site_line;
    }
    public static dynamic handler(Input __koru_input) {
      var v = __koru_input.v;
      var __site_line = __koru_input.__site_line;
      if (__koru_store_items.len >= 8) throw new global::System.Exception("std/store: store 'items' is full (capacity 8) - declared capacity and the `| full` branch are pinned at 690_011");
      long __koru_new_row = __koru_store_items.len;
      __koru_store_items.v[__koru_new_row] = v;
      __koru_store_items.len += 1;

      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_sweepbody_items_L65_690_069_store_sweep_row_ordinal_input_5dffb6_event {
    public struct Input {
      public long __koru_srf_e_L65_v;
      public long n;
      public long __koru_sdix_e_L65;
    }
    public static dynamic handler(Input __koru_input) {
      var __koru_srf_e_L65_v = __koru_input.__koru_srf_e_L65_v;
      var n = __koru_input.n;
      var __koru_sdix_e_L65 = __koru_input.__koru_sdix_e_L65;
__koru_stdout_write("row " + __koru_str(n) + " = " + __koru_str(__koru_srf_e_L65_v) + "\n");

      return default;

    }
  }
  public static class __store_sweeprun_items_L65_690_069_store_sweep_row_ordinal_input_5dffb6_event {
    public struct Input {
    }
    public static dynamic handler(Input __koru_input) {
      {
      for (var __koru_si = 0; __koru_si < __koru_store_items.len; __koru_si++) {
      var __koru_srf_e_L65_v = __koru_store_items.v[__koru_si];
      main_module.__store_sweepbody_items_L65_690_069_store_sweep_row_ordinal_input_5dffb6_event.handler(new main_module.__store_sweepbody_items_L65_690_069_store_sweep_row_ordinal_input_5dffb6_event.Input { __koru_srf_e_L65_v = __koru_srf_e_L65_v, n = (long)(__koru_si), __koru_sdix_e_L65 = __koru_si });
      }
      }

      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 __koru_p_v = (long)(10);
      var __koru_p___site_line = (long)(61);
      if (__koru_store_items.len >= 8) throw new global::System.Exception("std/store: store 'items' is full (capacity 8) - declared capacity and the `| full` branch are pinned at 690_011");
      long __koru_new_row = __koru_store_items.len;
      __koru_store_items.v[__koru_new_row] = __koru_p_v;
      __koru_store_items.len += 1;
    }
  }
  public static void flow1() {
    {
      var __koru_p_v = (long)(20);
      var __koru_p___site_line = (long)(62);
      if (__koru_store_items.len >= 8) throw new global::System.Exception("std/store: store 'items' is full (capacity 8) - declared capacity and the `| full` branch are pinned at 690_011");
      long __koru_new_row = __koru_store_items.len;
      __koru_store_items.v[__koru_new_row] = __koru_p_v;
      __koru_store_items.len += 1;
    }
  }
  public static void flow2() {
    {
      var __koru_p_v = (long)(30);
      var __koru_p___site_line = (long)(63);
      if (__koru_store_items.len >= 8) throw new global::System.Exception("std/store: store 'items' is full (capacity 8) - declared capacity and the `| full` branch are pinned at 690_011");
      long __koru_new_row = __koru_store_items.len;
      __koru_store_items.v[__koru_new_row] = __koru_p_v;
      __koru_store_items.len += 1;
    }
  }
  public static void flow3() {
    {
      {
      for (var __koru_si = 0; __koru_si < __koru_store_items.len; __koru_si++) {
      var __koru_srf_e_L65_v = __koru_store_items.v[__koru_si];
      main_module.__store_sweepbody_items_L65_690_069_store_sweep_row_ordinal_input_5dffb6_event.handler(new main_module.__store_sweepbody_items_L65_690_069_store_sweep_row_ordinal_input_5dffb6_event.Input { __koru_srf_e_L65_v = __koru_srf_e_L65_v, n = (long)(__koru_si), __koru_sdix_e_L65 = __koru_si });
      }
      }
    }
  }
  public static void flow4() {
    main_module.koru_start_event.handler(new koru_start_event.Input { });
  }
  public static void flow5() {
    main_module.koru_end_event.handler(new koru_end_event.Input { });
  }
}

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

Flows

flow ~new click a branch to expand · @labels scroll to their anchor

new (items, capacity: 8, source: v: i64)

flow ~insert click a branch to expand · @labels scroll to their anchor

insert (items, source: v: 10)

flow ~insert click a branch to expand · @labels scroll to their anchor

insert (items, source: v: 20)

flow ~insert click a branch to expand · @labels scroll to their anchor

insert (items, source: v: 30)

flow ~query click a branch to expand · @labels scroll to their anchor

query (items)

Test Configuration

MUST_RUN LANGUAGES: zig cs

← 068 store sweep owned string nested 070 store take empty branch →