Files
sx/examples/probes/tuple-baseline.sx
agra d8076b9333 lang: rename signed integer types sN -> iN
Surface rename of the signed integer family: s1..s64 become i1..i64
(u1..u64, usize, isize unchanged). 'string' keeps the s-prefix arm in
name classification; width parsing moves to the i-prefix arm next to
isize.

Internal TypeId tags follow the surface (.s8/.s16/.s32/.s64 ->
.i8/.i16/.i32/.i64), as do mono-key mangle fragments (ptr_i64,
tu_i64_bool) and all display/diagnostic formatting (i{d}).

Migrated in the same sweep: stdlib + examples + issue repros + FFI C
companions (shared symbol names like ffi_id_i64), expected
stdout/stderr/ir snapshots, specs.md, readme.md, CLAUDE.md/AGENTS.md,
implementation_plan.md, docs/, issue writeups. Vendored stb_image and
historical flow state left untouched.

zig build test: 426/426; examples suite: 595/595.
2026-06-12 09:31:53 +03:00

63 lines
2.8 KiB
Plaintext

// Feature 1 / Step 0.4 — tuple baseline probe (gate for Decision 2:
// "tuples are first-class for pack storage").
//
// This file is the audit artifact: it exercises every tuple operation the
// canonical `Combined`/`map` body relies on, EXCEPT the two pack/tuple
// projection+spread sugars that are themselves Feature 1 work (documented
// as gaps at the bottom). Everything here RUNS today.
//
// Run: ./zig-out/bin/sx run examples/probes/tuple-baseline.sx
#import "modules/std.sx";
Listenable :: struct { value: i64; } // stand-in element struct
Combined :: struct { sources: (i32, i32); } // tuple-typed field (Decision 2)
swap :: (a: i64, b: i64) -> (i64, i64) { (b, a) }
fst :: (t: (i64, i64)) -> i64 { t.0 }
main :: () -> i32 {
// ── Block A — primitives (WORKS) ───────────────────────────────
pair := (40, 2); // inferred positional
print("A.idx {} {}\n", pair.0, pair.1);
named := (x: 10, y: 20); // named + numeric access
print("A.named {} {} {}\n", named.x, named.0, named.1);
one := (42,); // 1-tuple
print("A.one {}\n", one.0);
a : i64 = pair.0; // element into typed local
print("A.local {}\n", a);
// ── Block B — storage in a struct field (WORKS; core of Decision 2)
c : Combined = ---;
c.sources = (7, 9); // assign tuple value to field
print("B.field {} {}\n", c.sources.0, c.sources.1);
// ── Block C — return / pass / operators (WORKS) ────────────────
s := swap(1, 2);
print("C.ret {} {}\n", s.0, s.1);
print("C.pass {}\n", fst((11, 22)));
print("C.eq {}\n", (1, 2) == (1, 2));
cc := (1, 2) + (3, 4);
print("C.concat {} {}\n", cc.0, cc.3);
print("C.mem {}\n", 3 in (1, 2, 3));
0
}
// ── GAPS (Feature 1 work — intentionally NOT exercised above) ──────
//
// G1. Tuple field projection across elements:
// t := (Listenable.{value=1}, Listenable.{value=2});
// v := t.value; // expected: (1, 2) — Decision 3 "tuple.field"
// Today: `error: field 'value' not found on type 'tuple'`.
// Needed by canonical `self.sources.value`.
//
// G2. Tuple spread into call args:
// p := (10, 20);
// add(..p); // expected: add(10, 20) — Decision 3 "..tuple"
// Today: lowers to one `undef` arg → LLVM arity verification failure.
// Needed by canonical `mapper(..sources.value)` and `(..sources)`.
//
// Both are already scheduled: parsing in Phase 1.2 (PackExpansion node covers
// `(..pack)` / `..pack.field`), sema in Phase 2.3 ("tuple-spread parallels").
// No separate Feature 1.5 needed — see Step 0.4 triage in CHECKPOINT-LANG.md.