Files
sx/examples/1006-errors-inferred-error-sets.sx
agra 4e942b5373 test: migrate examples to XXXX-category-name layout + split expected streams
Rename all example tests/companions to the XXXX-category-test-name scheme
(per-category 100-blocks: basic 0010, types 0100, ... errors 1000,
diagnostics 1100, ffi 1200, ffi-objc 1300, ffi-jni 1400, vectors 1500,
platform 1600). Companions and dir/C fixtures move in lockstep with their
parent test; #import/#source/#include paths rewritten to match.

Expected output now lives in examples/expected/ (a sibling dir of the
tests) split into three streams per the new convention:
  <name>.exit / <name>.stdout / <name>.stderr  (+ optional <name>.ir)

run_examples.sh rewritten: scans examples/ and issues/ for an
expected/<name>.exit marker, captures stdout and stderr separately (no
more 2>&1), compares each stream + exit + optional IR snapshot.

Behavior validated unchanged: every renamed test reproduces its prior
merged output + exit (diffs limited to file paths/basenames embedded in
diagnostics + traces, which correctly reflect the new names). Suite:
292 passed, 0 failed. 50-smoke.sx split + issue relocation + docs follow
in subsequent commits.
2026-06-01 19:05:15 +03:00

41 lines
1.3 KiB
Plaintext

// Whole-program inferred error sets (ERR step E1.4b). A bare `-> !` function's
// error set is INFERRED: the union of the tags it raises directly plus the
// sets of the failable functions it `try`s, converged across the whole call
// graph by a fix-point pass. Here `leaf` raises {Foo}; `mid` try-propagates
// leaf AND raises Bar, so `mid` converges to {Foo, Bar}; the named caller
// `run :: -> !A` then type-checks because mid's converged set is a subset of
// A. The rejection (a converged tag NOT in the caller's set) lives in
// `examples/224-inferred-widening-reject.sx`.
#import "modules/std.sx";
A :: error { Foo, Bar }
leaf :: (n: s32) -> ! {
if n < 0 { raise error.Foo; }
return;
}
// Inferred set converges to {Foo, Bar}: {Foo} absorbed from `try leaf` plus
// the directly-raised Bar.
mid :: (n: s32) -> ! {
try leaf(n);
if n == 100 { raise error.Bar; }
return;
}
// Named caller: mid's converged {Foo, Bar} is a subset of A -> widening OK.
run :: (n: s32) -> !A {
try mid(n);
return;
}
main :: () -> s32 {
e := run(-1); // leaf raises Foo -> propagates out
r : s32 = 0;
if e == error.Foo { r = r + 7; } // true -> +7
if e == error.Bar { r = r + 1; } // false (Foo escaped, not Bar)
print("inferred result: {}\n", r); // -> 7
return r;
}