Chris Tate 6cc5345a41 Key Sets and Maps of identity-arm unions by their pointer representation ...

A union that is a Set element or a Map key was a tagged box in the whole
program, because the C map hashes and compares union keys by tag and
payload. One `Set<Node | undefined>` made every `Node | undefined` value
of the program a box, at every read.

A union whose arms all compare by identity (records, class instances,
arrays, functions), beside at most one undefined and one null arm, now
keeps its pointer representation in collections too. The map keys such a
union by reference: the pointer carries the identity, and NULL and the
null sentinel are two more distinct keys. Unions with a string or another
value arm keep their boxes, and library builds keep the earlier rule.

The tests of the box paths keep their unions boxed through a new
`boxedUnions` emission option instead of a Set of each union.

2026-10-28 16:22:38 -05:00

..

builds

Make native installs portable and smaller (#599)

2026-10-01 10:46:16 -05:00

regions

Carry lifetime regions across await and reuse freed region chunks

2026-10-17 11:26:12 -07:00

runtime

Key Sets and Maps of identity-arm unions by their pointer representation

2026-10-28 16:22:38 -05:00

scaling

Keep each runtime benchmark workload in its own file

2026-10-20 18:08:10 -05:00