Files
sx/examples/memory/0841-memory-list-len-set.sx
agra 9523c29173 feat: #set property accessors (write counterpart of #get)
A method `name :: (self: *T, value: V) #set { ... }` (or `=> expr;`) is the
write counterpart of a `#get` accessor: `obj.name = rhs` dispatches to it as
`obj.name(rhs)` when no real field matches. Plumbed parallel to `#get`:

- lexer/token `#set`; `FnDecl.is_set` + `Function.is_set`; parsed in the same
  marker slot as `#get` (no return type, exactly self + one value param).
- get+set coexistence: a setter registers/mangles/dispatches under an effective
  `name$set` name (`$` is illegal in sx identifiers, so unmistakable), keeping a
  same-name `#get` under the plain `name`. Resolution is declaration-order-
  independent: a plain read query picks the non-setter, a `name$set` write query
  picks the setter (accessorEffName / accessorNameMatches / structMethodFn).
- write dispatch in lowerAssignment via tryLowerPropertyAssignment: plain assign
  synthesizes `obj.name$set(rhs)`; compound `OP=` is get-modify-set and
  evaluates the receiver EXACTLY ONCE (bound to a synthetic local); read-only
  (#get-only) and write-only (#set-only + compound) emit clear diagnostics; a
  real field of the same name still wins. Multi-assign property targets dispatch
  the setter too (tryLowerPropertyStore, via a pre-lowered-Ref binding).

Payoff: List gains a `len` #set, so `xs.len = n` works; the `.items.len = N`
write workarounds in sched.sx + ui/* + platform/* revert to `xs.len = N`.

issues/0160 records an optional-chain interaction surfaced by the review (a
pre-existing `?T` value-optional read miscompile that blocks getter-through-`?.`).
2026-06-22 17:55:18 +03:00

22 lines
852 B
Plaintext

// `List(T).len` is a `#get`/`#set` property pair: `xs.len` reads the live
// element count (delegating to `items.len`), and `xs.len = n` sets it (e.g.
// `xs.len = 0` to clear the list without freeing its buffer — `cap` and the
// backing allocation are untouched, so appends reuse the same storage).
#import "modules/std.sx";
main :: () -> i64 {
xs : List(i64) = .{};
xs.append(10);
xs.append(20);
xs.append(30);
print("len={} cap={}\n", xs.len, xs.cap); // len=3 cap=4
xs.len = 0; // clear via the #set property
print("after clear: len={} cap={}\n", xs.len, xs.cap); // len=0 cap=4
// The buffer survived the clear — re-append reuses it (cap stays 4).
xs.append(99);
print("reused: len={} cap={} first={}\n", xs.len, xs.cap, xs.items[0]); // 1 4 99
return 0;
}