✓
Passing This code compiles and runs correctly.
Code
// PINS: the summation ORDER of an f64 fold through the sweep arm — strict
// program order, one row at a time, left to right. No pass may reassociate a
// float sum without a license the program granted; today no such license
// exists, so the order is the insertion order and nothing else.
//
// The column is a cancellation probe: [1e16, 1.0, -1e16, 1.0]. In strict
// order each 1.0 lands next to a running total of magnitude 1e16, where the
// f64 spacing is 2.0, and is absorbed; the 1e16s cancel; the last 1.0
// survives: checksum 1. ANY reassociated order — lane accumulators, pairwise
// trees, fast-math — keeps the 1.0s away from the big values and answers 2.
// There is no print-precision slack: the two orders differ by 1.0, not ulps.
//
// Measured 2026-07-31 (the fold probe): the strict order this test pins costs
// 5-8x against a reassociated sum at 10,000 rows — the reassociated fold
// vectorizes (fadd.2d x4), the strict one is a serial fadd chain. That cost
// is the price of this pin's guarantee, until a surface exists to waive it.
import std/io
import std/store
std/store:new(ents, capacity: 8) { x: f64 }
std/store:new(check) { sum: 0.0[f64] }
std/store:new(out) { v: 0.0[f64] }
std/store:watch(out)
! v x |> std/io:print.ln("checksum {{ x:f }}")
std/store:insert(ents) { x: 10000000000000000.0 }
std/store:insert(ents) { x: 1.0 }
std/store:insert(ents) { x: -10000000000000000.0 }
std/store:insert(ents) { x: 1.0 }
std/store:query(ents)
! query e |> std/store:stored { check.sum: check.sum + e.x }
std/store:stored { out.v: check.sum }
Actual
checksum 1
Expected output
✓ Zig✓ C#checksum 1
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 'ents' created (SoA cell + insert/query/write/take/stripe units); fields x: f64
// std/store: 'check' created (cell + write-subflow at module scope); fields sum: f64
// std/store: 'out' created (cell + write-subflow at module scope); fields v: f64
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_210_fold_summation_order_strict/input.k:28 ~input:__store_insert_ents()
pub fn flow0() void {
_ = main_module.__store_insert_ents_event.handler(.{ .x = 10000000000000000.0, .__site_line = 28 });
}
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_210_fold_summation_order_strict/input.k:29 ~input:__store_insert_ents()
pub fn flow1() void {
_ = main_module.__store_insert_ents_event.handler(.{ .x = 1.0, .__site_line = 29 });
}
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_210_fold_summation_order_strict/input.k:30 ~input:__store_insert_ents()
pub fn flow2() void {
_ = main_module.__store_insert_ents_event.handler(.{ .x = -10000000000000000.0, .__site_line = 30 });
}
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_210_fold_summation_order_strict/input.k:31 ~input:__store_insert_ents()
pub fn flow3() void {
_ = main_module.__store_insert_ents_event.handler(.{ .x = 1.0, .__site_line = 31 });
}
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_210_fold_summation_order_strict/input.k:33 ~input:__store_sweeprun_ents_L34_690_210_fold_summation_order_strict_input_a21bcf()
pub fn flow4() void {
_ = main_module.__store_sweeprun_ents_L34_690_210_fold_summation_order_strict_input_a21bcf_event.handler(.{ });
}
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_210_fold_summation_order_strict/input.k:36 ~input:__store_write_out()
pub fn flow5() void {
_ = main_module.__store_write_out_event.handler(.{ .field = 0, .value = __koru_store_check.sum });
}
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_ents = struct {
x: [8]f64 = undefined,
len: usize = 0,
};
var __koru_store_ents: __KoruStoreT_ents = .{};
const __KoruStoreRow_ents = struct { x: f64 };
pub const __store_insert_ents_event = struct {
pub const Input = struct {
x: f64,
__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.x, __koru_event_input.__site_line);
}
fn __koru_handler_impl(__koru_p_0: f64, __koru_p_1: i64) @This().Output {
const __koru_event_input: @This().Input = .{ .x = __koru_p_0, .__site_line = __koru_p_1 };
// >>> PROC: __store_insert_ents [tests/regression/600_STDLIB/690_STORE/690_210_fold_summation_order_strict/input.k:21]
const x = __koru_event_input.x;
const __site_line = __koru_event_input.__site_line;
_ = &x;
_ = &__site_line;
_ = &__koru_event_input;
if (__koru_store_ents.len >= 8) @panic("std/store: store 'ents' is full (capacity 8) - declared capacity and the `| full` branch are pinned at 690_011");
const __koru_new_row = __koru_store_ents.len;
__koru_store_ents.x[__koru_new_row] = x;
__koru_store_ents.len += 1;
return;
}
};
pub const __store_apply_ents_event = struct {
pub const Input = struct {
row: usize,
field: i64,
value_0: f64,
};
pub const Output = union(enum(u8)) {
x: f64,
};
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: f64) @This().Output {
const __koru_event_input: @This().Input = .{ .row = __koru_p_0, .field = __koru_p_1, .value_0 = __koru_p_2 };
// >>> PROC: __store_apply_ents [tests/regression/600_STDLIB/690_STORE/690_210_fold_summation_order_strict/input.k:21]
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_ents.x[__koru_r] = value_0; break :blk .{ .x = value_0 }; },
else => unreachable,
};
}
};
const __KoruStoreT_check = blk: {
const __info = @typeInfo(@TypeOf(.{ .sum = @as(f64, 0.0) }));
var __fields: [__info.@"struct".fields.len]@import("std").builtin.Type.StructField = undefined;
for (__info.@"struct".fields, 0..) |__f, __i| {
__fields[__i] = .{ .name = __f.name, .type = __f.type, .default_value_ptr = null, .is_comptime = false, .alignment = __f.alignment };
}
break :blk @Type(.{ .@"struct" = .{ .layout = .auto, .fields = &__fields, .decls = &.{}, .is_tuple = false } });
};
var __koru_store_check: __KoruStoreT_check = .{ .sum = @as(f64, 0.0) };
pub const __store_apply_check_event = struct {
pub const Input = struct {
field: i64,
value: f64,
};
pub const Output = union(enum(u8)) {
sum: f64,
};
pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
return __koru_handler_impl(__koru_event_input.field, __koru_event_input.value);
}
fn __koru_handler_impl(__koru_p_0: i64, __koru_p_1: f64) @This().Output {
const __koru_event_input: @This().Input = .{ .field = __koru_p_0, .value = __koru_p_1 };
// >>> PROC: __store_apply_check [tests/regression/600_STDLIB/690_STORE/690_210_fold_summation_order_strict/input.k:22]
const field = __koru_event_input.field;
const value = __koru_event_input.value;
_ = &field;
_ = &value;
_ = &__koru_event_input;
return switch (field) {
0 => blk: { __koru_store_check.sum = value; break :blk .{ .sum = value }; },
else => unreachable,
};
}
};
pub const __store_write_check_event = struct {
pub const Input = struct {
field: i64,
value: f64,
};
pub const Output = void;
pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
return __koru_handler_impl(__koru_event_input.field, __koru_event_input.value);
}
fn __koru_handler_impl(__koru_p_0: i64, __koru_p_1: f64) @This().Output {
const __koru_event_input: @This().Input = .{ .field = __koru_p_0, .value = __koru_p_1 };
// >>> SUBFLOW: tests/regression/600_STDLIB/690_STORE/690_210_fold_summation_order_strict/input.k:22
const field = __koru_event_input.field;
const value = __koru_event_input.value;
_ = &field;
_ = &value;
_ = &__koru_event_input;
const result = main_module.__store_apply_check_event.handler(.{ .field = field, .value = value });
return switch (result) {
.sum => {},
};
}
};
pub const __store_announce_check_event = struct {
pub const Input = struct {
field: i64,
};
pub const Output = void;
pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
return __koru_handler_impl(__koru_event_input.field);
}
fn __koru_handler_impl(__koru_p_0: i64) @This().Output {
const __koru_event_input: @This().Input = .{ .field = __koru_p_0 };
// >>> PROC: __store_announce_check [tests/regression/600_STDLIB/690_STORE/690_210_fold_summation_order_strict/input.k:22]
const field = __koru_event_input.field;
_ = &field;
_ = &__koru_event_input;
return;
}
};
const __KoruStoreT_out = blk: {
const __info = @typeInfo(@TypeOf(.{ .v = @as(f64, 0.0) }));
var __fields: [__info.@"struct".fields.len]@import("std").builtin.Type.StructField = undefined;
for (__info.@"struct".fields, 0..) |__f, __i| {
__fields[__i] = .{ .name = __f.name, .type = __f.type, .default_value_ptr = null, .is_comptime = false, .alignment = __f.alignment };
}
break :blk @Type(.{ .@"struct" = .{ .layout = .auto, .fields = &__fields, .decls = &.{}, .is_tuple = false } });
};
var __koru_store_out: __KoruStoreT_out = .{ .v = @as(f64, 0.0) };
pub const __store_apply_out_event = struct {
pub const Input = struct {
field: i64,
value: f64,
};
pub const Output = union(enum(u8)) {
v: f64,
};
pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
return __koru_handler_impl(__koru_event_input.field, __koru_event_input.value);
}
fn __koru_handler_impl(__koru_p_0: i64, __koru_p_1: f64) @This().Output {
const __koru_event_input: @This().Input = .{ .field = __koru_p_0, .value = __koru_p_1 };
// >>> PROC: __store_apply_out [tests/regression/600_STDLIB/690_STORE/690_210_fold_summation_order_strict/input.k:23]
const field = __koru_event_input.field;
const value = __koru_event_input.value;
_ = &field;
_ = &value;
_ = &__koru_event_input;
return switch (field) {
0 => blk: { __koru_store_out.v = value; break :blk .{ .v = value }; },
else => unreachable,
};
}
};
pub const __store_write_out_event = struct {
pub const Input = struct {
field: i64,
value: f64,
};
pub const Output = void;
pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
return __koru_handler_impl(__koru_event_input.field, __koru_event_input.value);
}
fn __koru_handler_impl(__koru_p_0: i64, __koru_p_1: f64) @This().Output {
const __koru_event_input: @This().Input = .{ .field = __koru_p_0, .value = __koru_p_1 };
// >>> SUBFLOW: tests/regression/600_STDLIB/690_STORE/690_210_fold_summation_order_strict/input.k:23
const field = __koru_event_input.field;
const value = __koru_event_input.value;
_ = &field;
_ = &value;
_ = &__koru_event_input;
const result = main_module.__store_apply_out_event.handler(.{ .field = field, .value = value });
switch (result) {
// >>> BRANCH: tests/regression/600_STDLIB/690_STORE/690_210_fold_summation_order_strict/input.k:26 | v x |>
.v => |x| {
_ = &x;
(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("checksum {}\n", .{x});
},
}
}
};
pub const __store_peek_out_event = struct {
pub const Input = struct {
field: i64,
};
pub const Output = union(enum(u8)) {
v: f64,
};
pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
return __koru_handler_impl(__koru_event_input.field);
}
fn __koru_handler_impl(__koru_p_0: i64) @This().Output {
const __koru_event_input: @This().Input = .{ .field = __koru_p_0 };
// >>> PROC: __store_peek_out [tests/regression/600_STDLIB/690_STORE/690_210_fold_summation_order_strict/input.k:23]
const field = __koru_event_input.field;
_ = &field;
_ = &__koru_event_input;
return switch (field) {
0 => .{ .v = __koru_store_out.v },
else => unreachable,
};
}
};
pub const __store_announce_out_event = struct {
pub const Input = struct {
field: i64,
};
pub const Output = void;
pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
return __koru_handler_impl(__koru_event_input.field);
}
fn __koru_handler_impl(__koru_p_0: i64) @This().Output {
const __koru_event_input: @This().Input = .{ .field = __koru_p_0 };
// >>> SUBFLOW: tests/regression/600_STDLIB/690_STORE/690_210_fold_summation_order_strict/input.k:23
const field = __koru_event_input.field;
_ = &field;
_ = &__koru_event_input;
const result = main_module.__store_peek_out_event.handler(.{ .field = field });
switch (result) {
// >>> BRANCH: tests/regression/600_STDLIB/690_STORE/690_210_fold_summation_order_strict/input.k:26 | v x |>
.v => |x| {
_ = &x;
(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("che
... [truncated - 22KB total]Emitted C# source
static class main_module {
public static void __koru_stdout_write(dynamic s) => global::System.Console.Out.Write(s);
public static void __koru_stderr_write(dynamic s) => global::System.Console.Error.Write(s);
// The mutable handle carrier — `*String`-style resources are
// `new __KoruBox { data = … }` because C# anonymous types are
// read-only: `s.data = …` (std/string append/clear, handle
// mutation generally) needs a settable member.
public class __KoruBox { public dynamic data; }
// Textification for `{{ … }}` operands: C# bool ToStrings as
// `True` where Koru prints `true`, and the operand's static type
// is unknown at this boundary — a `(x) is bool` inline test would
// be a compile error on statically-typed operands instead. Generic
// on purpose: `dynamic` boxed every value-type operand — measured
// ~1s/10M elements on 012_threat_scanner — while T specializes to
// the operand's own ToString() with no box.
public static string __koru_str<T>(T v) => v is bool b ? (b ? "true" : "false") : v?.ToString();
// std/store: plural store 'ents' created (SoA cell + insert/query/write/take/stripe units); fields x: f64
// std/store: 'check' created (cell + write-subflow at module scope); fields sum: f64
// std/store: 'out' created (cell + write-subflow at module scope); fields v: f64
static class __koru_store_ents {
public static double[] x = new double[8];
public static long len = 0;
public static long __koru_brand = -1;
}
static class __koru_store_check {
public static double sum = 0.0;
public static long __koru_brand = -1;
}
static class __koru_store_out {
public static double v = 0.0;
public static long __koru_brand = -1;
}
public static class __store_insert_ents_event {
public struct Input {
public double x;
public long __site_line;
}
public static dynamic handler(Input __koru_input) {
var x = __koru_input.x;
var __site_line = __koru_input.__site_line;
if (__koru_store_ents.len >= 8) throw new global::System.Exception("std/store: store 'ents' is full (capacity 8) - declared capacity and the `| full` branch are pinned at 690_011");
long __koru_new_row = __koru_store_ents.len;
__koru_store_ents.x[__koru_new_row] = x;
__koru_store_ents.len += 1;
return default;
}
}
public static class __store_apply_ents_event {
public struct Input {
public long row;
public long field;
public double value_0;
}
public struct Output {
public string tag;
public double x;
}
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_ents.x[__koru_r] = value_0; return new Output { tag = "x", x = value_0 }; }
}
throw new global::System.Exception("__store_apply_ents: field index " + field + " is not a column of store 'ents'");
return default;
}
}
public static class __store_apply_check_event {
public struct Input {
public long field;
public double value;
}
public struct Output {
public string tag;
public double sum;
}
public static Output handler(Input __koru_input) {
var field = __koru_input.field;
var value = __koru_input.value;
switch (field) {
case 0: { __koru_store_check.sum = value; return new Output { tag = "sum", sum = value }; }
}
throw new global::System.Exception("__store_apply_check: field index " + field + " is not a column of store 'check'");
return default;
}
}
public static class __store_write_check_event {
public struct Input {
public long field;
public double value;
}
public static dynamic handler(Input __koru_input) {
var field = __koru_input.field;
var value = __koru_input.value;
var result_0 = main_module.__store_apply_check_event.handler(new __store_apply_check_event.Input { field = (long)(field), value = (double)(value)});
var _auto_7 = result_0.sum;
return default;
}
}
public static class __store_announce_check_event {
public struct Input {
public long field;
}
public static dynamic handler(Input __koru_input) {
var field = __koru_input.field;
return default;
}
}
public static class __store_apply_out_event {
public struct Input {
public long field;
public double value;
}
public struct Output {
public string tag;
public double v;
}
public static Output handler(Input __koru_input) {
var field = __koru_input.field;
var value = __koru_input.value;
switch (field) {
case 0: { __koru_store_out.v = value; return new Output { tag = "v", v = value }; }
}
throw new global::System.Exception("__store_apply_out: field index " + field + " is not a column of store 'out'");
return default;
}
}
public static class __store_write_out_event {
public struct Input {
public long field;
public double value;
}
public static dynamic handler(Input __koru_input) {
var field = __koru_input.field;
var value = __koru_input.value;
var result_1 = main_module.__store_apply_out_event.handler(new __store_apply_out_event.Input { field = (long)(field), value = (double)(value)});
var x = result_1.v;
__koru_stdout_write("checksum " + __koru_str(x) + "\n");
return default;
}
}
public static class __store_peek_out_event {
public struct Input {
public long field;
}
public struct Output {
public string tag;
public double v;
}
public static Output handler(Input __koru_input) {
var field = __koru_input.field;
switch (field) {
case 0: return new Output { tag = "v", v = __koru_store_out.v };
}
throw new global::System.Exception("__store_peek_out: field index " + field + " is not a column of store 'out'");
return default;
}
}
public static class __store_announce_out_event {
public struct Input {
public long field;
}
public static dynamic handler(Input __koru_input) {
var field = __koru_input.field;
var result_2 = main_module.__store_peek_out_event.handler(new __store_peek_out_event.Input { field = (long)(field)});
var x = result_2.v;
__koru_stdout_write("checksum " + __koru_str(x) + "\n");
return default;
}
}
public static class __store_sweepbody_ents_L34_690_210_fold_summation_order_strict_input_a21bcf_event {
public struct Input {
public long __koru_sdix_e_L34;
}
public static dynamic handler(Input __koru_input) {
var __koru_sdix_e_L34 = __koru_input.__koru_sdix_e_L34;
main_module.__store_write_check_event.handler(new __store_write_check_event.Input { field = (long)(0), value = (double)(__koru_store_check.sum + __koru_store_ents.x[__koru_sdix_e_L34])});
return default;
}
}
public static class __store_sweeprun_ents_L34_690_210_fold_summation_order_strict_input_a21bcf_event {
public struct Input {
}
public static dynamic handler(Input __koru_input) {
{
for (var __koru_si = 0; __koru_si < __koru_store_ents.len; __koru_si++) {
main_module.__store_sweepbody_ents_L34_690_210_fold_summation_order_strict_input_a21bcf_event.handler(new main_module.__store_sweepbody_ents_L34_690_210_fold_summation_order_strict_input_a21bcf_event.Input { __koru_sdix_e_L34 = __koru_si });
}
}
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 __koru_p_x = (double)(10000000000000000.0);
var __koru_p___site_line = (long)(28);
if (__koru_store_ents.len >= 8) throw new global::System.Exception("std/store: store 'ents' is full (capacity 8) - declared capacity and the `| full` branch are pinned at 690_011");
long __koru_new_row = __koru_store_ents.len;
__koru_store_ents.x[__koru_new_row] = __koru_p_x;
__koru_store_ents.len += 1;
}
}
public static void flow1() {
{
var __koru_p_x = (double)(1.0);
var __koru_p___site_line = (long)(29);
if (__koru_store_ents.len >= 8) throw new global::System.Exception("std/store: store 'ents' is full (capacity 8) - declared capacity and the `| full` branch are pinned at 690_011");
long __koru_new_row = __koru_store_ents.len;
__koru_store_ents.x[__koru_new_row] = __koru_p_x;
__koru_store_ents.len += 1;
}
}
public static void flow2() {
{
var __koru_p_x = (double)(-10000000000000000.0);
var __koru_p___site_line = (long)(30);
if (__koru_store_ents.len >= 8) throw new global::System.Exception("std/store: store 'ents' is full (capacity 8) - declared capacity and the `| full` branch are pinned at 690_011");
long __koru_new_row = __koru_store_ents.len;
__koru_store_ents.x[__koru_new_row] = __koru_p_x;
__koru_store_ents.len += 1;
}
}
public static void flow3() {
{
var __koru_p_x = (double)(1.0);
var __koru_p___site_line = (long)(31);
if (__koru_store_ents.len >= 8) throw new global::System.Exception("std/store: store 'ents' is full (capacity 8) - declared capacity and the `| full` branch are pinned at 690_011");
long __koru_new_row = __koru_store_ents.len;
__koru_store_ents.x[__koru_new_row] = __koru_p_x;
__koru_store_ents.len += 1;
}
}
public static void flow4() {
{
{
for (var __koru_si = 0; __koru_si < __koru_store_ents.len; __koru_si++) {
main_module.__store_sweepbody_ents_L34_690_210_fold_summation_order_strict_input_a21bcf_event.handler(new main_module.__store_sweepbody_ents_L34_690_210_fold_summation_order_strict_input_a21bcf_event.Input { __koru_sdix_e_L34 = __koru_si });
}
}
}
}
public static void flow5() {
main_module.__store_write_out_event.handler(new __store_write_out_event.Input { field = (long)(0), value = (double)(__koru_store_check.sum)});
}
}
static class Program {
static void Main() {
main_module.flow0();
main_module.flow1();
main_module.flow2();
main_module.flow3();
main_module.flow4();
main_module.flow5();
}
}
Flows
flow ~new click a branch to expand · @labels scroll to their anchor
new (ents, capacity: 8, source: x: f64)
flow ~new click a branch to expand · @labels scroll to their anchor
new (check, source: sum: 0.0[f64])
flow ~new click a branch to expand · @labels scroll to their anchor
new (out, source: v: 0.0[f64])
flow ~watch click a branch to expand · @labels scroll to their anchor
watch (out)
flow ~insert click a branch to expand · @labels scroll to their anchor
insert (ents, source: x: 10000000000000000.0)
flow ~insert click a branch to expand · @labels scroll to their anchor
insert (ents, source: x: 1.0)
flow ~insert click a branch to expand · @labels scroll to their anchor
insert (ents, source: x: -10000000000000000.0)
flow ~insert click a branch to expand · @labels scroll to their anchor
insert (ents, source: x: 1.0)
flow ~query click a branch to expand · @labels scroll to their anchor
query (ents)
flow ~stored click a branch to expand · @labels scroll to their anchor
stored (source: out.v: check.sum)
Test Configuration
MUST_RUN LANGUAGES: zig cs