@scriptc/compiler 0.2.7 → 0.2.9

package/dist/frontend/lowering/construction-escapes.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"construction-escapes.js","sourceRoot":"","sources":["../../../src/frontend/lowering/construction-escapes.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAExC;;+DAE+D;AAC/D,MAAM,UAAU,gBAAgB,CAAC,IAAa;IAC5C,IAAI,KAAK,GAAG,KAAK,CAAC;IAClB,MAAM,KAAK,GAAG,CAAC,KAAc,EAAQ,EAAE;QACrC,IAAI,KAAK;YAAE,OAAO;QAClB,IACE,EAAE,CAAC,oBAAoB,CAAC,KAAK,CAAC;YAC9B,EAAE,CAAC,qBAAqB,CAAC,KAAK,CAAC;YAC/B,EAAE,CAAC,mBAAmB,CAAC,KAAK,CAAC;YAC7B,EAAE,CAAC,wBAAwB,CAAC,KAAK,CAAC;YAClC,EAAE,CAAC,aAAa,CAAC,KAAK,CAAC;YACvB,EAAE,CAAC,aAAa,CAAC,KAAK,CAAC;YACvB,EAAE,CAAC,kBAAkB,CAAC,KAAK,CAAC;YAC5B,EAAE,CAAC,iBAAiB,CAAC,KAAK,CAAC,EAC3B,CAAC;YACD,OAAO;QACT,CAAC;QACD,IAAI,KAAK,CAAC,IAAI,KAAK,EAAE,CAAC,UAAU,CAAC,WAAW,IAAI,KAAK,CAAC,IAAI,KAAK,EAAE,CAAC,UAAU,CAAC,YAAY,EAAE,CAAC;YAC1F,KAAK,GAAG,IAAI,CAAC;YACb,OAAO;QACT,CAAC;QACD,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC,CAAC;IACF,KAAK,CAAC,IAAI,CAAC,CAAC;IACZ,OAAO,KAAK,CAAC;AACf,CAAC;AA8BD,oDAAoD;AACpD,MAAM,YAAY,GAAG,CAAC,CAAC;AAEvB,SAAS,cAAc,CAAC,IAAa;IACnC,IAAI,KAAK,GAAG,KAAK,CAAC;IAClB,MAAM,KAAK,GAAG,CAAC,KAAc,EAAQ,EAAE;QACrC,IAAI,KAAK,IAAI,EAAE,CAAC,cAAc,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,sBAAsB,CAAC,KAAK,CAAC;YAAE,OAAO;QAClF,IAAI,EAAE,CAAC,iBAAiB,CAAC,KAAK,CAAC,EAAE,CAAC;YAChC,KAAK,GAAG,IAAI,CAAC;YACb,OAAO;QACT,CAAC;QACD,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC,CAAC;IACF,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;IACzB,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;8DAE8D;AAC9D,MAAM,UAAU,kBAAkB,CAAC,MAA0B;IAC3D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,IAAI,GAAG,GAAuB,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;IACrE,MAAM,UAAU,GAAG,CAAC,IAAa,EAAuC,EAAE,CACxE,EAAE,CAAC,0BAA0B,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,KAAK,EAAE,CAAC,UAAU,CAAC,WAAW,CAAC;IAC5F,0EAA0E;IAC1E,sEAAsE;IACtE,8DAA8D;IAC9D,MAAM,OAAO,GAAG,CAAC,IAAa,EAAE,KAAa,EAAW,EAAE;QACxD,IAAI,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC,UAAU,CAAC,WAAW,IAAI,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC,UAAU,CAAC,YAAY;YACrF,OAAO,IAAI,CAAC;QACd,IAAI,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;YAC7D,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;gBAAE,OAAO,IAAI,CAAC;YAC5F,MAAM,IAAI,GAAG,KAAK,GAAG,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YAC1E,IAAI,CAAC,IAAI;gBAAE,OAAO,IAAI,CAAC;YACvB,OAAO,CAAC,gBAAgB,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QACvD,CAAC;QACD,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;YACrB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;YAC5B,OAAO,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;QACrF,CAAC;QACD,IAAI,KAAK,GAAG,KAAK,CAAC;QAClB,IAAI,CAAC,YAAY,CAAC,CAAC,KAAK,EAAE,EAAE;YAC1B,IAAI,CAAC,KAAK,IAAI,gBAAgB,CAAC,KAAK,CAAC;gBAAE,KAAK,GAAG,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACvE,CAAC,CAAC,CAAC;QACH,OAAO,KAAK,CAAC;IACf,CAAC,CAAC;IACF,kEAAkE;IAClE,MAAM,gBAAgB,GAAG,CAAC,UAAmC,EAAE,KAAa,EAAW,EAAE;QACvF,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;YAC9B,iEAAiE;YACjE,IAAI,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,cAAc,CAAC,IAAI,CAAC;gBAAE,OAAO,KAAK,CAAC;YACrE,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC;gBAAE,SAAS;YACtC,IACE,EAAE,CAAC,qBAAqB,CAAC,IAAI,CAAC;gBAC9B,EAAE,CAAC,kBAAkB,CAAC,IAAI,CAAC,UAAU,CAAC;gBACtC,IAAI,CAAC,UAAU,CAAC,aAAa,CAAC,IAAI,KAAK,EAAE,CAAC,UAAU,CAAC,WAAW;gBAChE,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;gBAChC,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC;gBAC1C,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAC9C,CAAC;gBACD,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC;gBACpC,IAAI,gBAAgB,CAAC,KAAK,CAAC,IAAI,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC;oBAAE,OAAO,KAAK,CAAC;gBACnE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC7C,SAAS;YACX,CAAC;YACD,IAAI,EAAE,CAAC,qBAAqB,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC;gBAAE,SAAS;YACjF,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IACF,MAAM,eAAe,GAAG,GAAY,EAAE;QACpC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,UAAU;YAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACzD,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;YAClC,IAAI,CAAC,KAAK,CAAC,WAAW;gBAAE,SAAS;YACjC,IAAI,gBAAgB,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,OAAO,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACvF,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IACF,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,UAAU,IAAI,EAAE,CAAC;IACvD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;QACnB,sEAAsE;QACtE,oEAAoE;QACpE,OAAO,KAAK,GAAG,UAAU,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;YAC1C,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAE,CAAC;YAChC,MAAM,OAAO,GACX,EAAE,CAAC,qBAAqB,CAAC,IAAI,CAAC;gBAC9B,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,UAAU,CAAC;gBACpC,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,IAAI,KAAK,EAAE,CAAC,UAAU,CAAC,YAAY,CAAC;YACjE,IAAI,OAAO,EAAE,CAAC;gBACZ,IAAI,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;oBAAE,OAAO,IAAI,EAAE,CAAC;gBAClF,MAAM;YACR,CAAC;YACD,oEAAoE;YACpE,IAAI,gBAAgB,CAAC,IAAI,CAAC;gBAAE,OAAO,IAAI,EAAE,CAAC;QAC5C,CAAC;QACD,IAAI,MAAM,CAAC,IAAI,EAAE,IAAI,IAAI,KAAK,IAAI,UAAU,CAAC,MAAM;YAAE,OAAO,IAAI,EAAE,CAAC;QACnE,IAAI,MAAM,CAAC,WAAW;YAAE,OAAO,IAAI,EAAE,CAAC;QACtC,KAAK,EAAE,CAAC;IACV,CAAC;IACD,IAAI,CAAC,eAAe,EAAE;QAAE,OAAO,IAAI,EAAE,CAAC;IACtC,IAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAAE,OAAO,IAAI,EAAE,CAAC;IACjE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;AACtC,CAAC"}

package/dist/frontend/lowering/construction-escapes.test.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/frontend/lowering/construction-escapes.test.js

@@ -0,0 +1,150 @@
+import { afterAll, expect, test } from "vitest";
+import * as ts from "../ts7/adapter.js";
+import { closeSourceParser, parseSourceFile } from "../ts7/source-parser-node.js";
+import { constructionEscape, mentionsReceiver } from "./construction-escapes.js";
+afterAll(closeSourceParser);
+function analyze(source, options = {}) {
+    const file = parseSourceFile("classes.ts", source, "ts");
+    let decl;
+    ts.walkPreorder(file, (node) => {
+        if (!decl && ts.isClassDeclaration(node))
+            decl = node;
+    });
+    if (!decl)
+        throw new Error("fixture has no class");
+    const cls = decl;
+    const ctor = cls.members.find(ts.isConstructorDeclaration) ?? null;
+    const fields = cls.members
+        .filter(ts.isPropertyDeclaration)
+        .map((member) => ({ name: member.name.getText(), initializer: member.initializer }));
+    const fieldNames = new Set(fields.map((field) => field.name));
+    return constructionEscape({
+        ctor,
+        fields,
+        paramProps: [],
+        derived: options.derived ?? false,
+        baseEscapes: options.baseEscapes ?? false,
+        isField: (name) => fieldNames.has(name),
+        privateMethodBody: (call) => {
+            if (!ts.isPropertyAccessExpression(call.expression))
+                return null;
+            const name = call.expression.name.text;
+            const method = cls.members.find((member) => ts.isMethodDeclaration(member) && member.name.getText() === name);
+            const isPrivate = method !== undefined &&
+                (ts.isPrivateIdentifier(method.name) ||
+                    (ts.getModifiers(method)?.some((m) => m.kind === ts.SyntaxKind.PrivateKeyword) ?? false));
+            return isPrivate ? (method.body ?? null) : null;
+        },
+    });
+}
+const sorted = (set) => [...set].sort();
+test("assignments before any exposure are proven", () => {
+    const result = analyze(`
+    class A {
+      a: B; b: B; c: B;
+      constructor() {
+        this.a = new B();
+        this.b = make(this.a);
+        log("no receiver here");
+        this.c = new B();
+        this.report();
+      }
+    }`);
+    expect(result.escapes).toBe(true);
+    expect(sorted(result.assigned)).toEqual(["a", "b", "c"]);
+});
+test("a call that receives the instance stops the proof", () => {
+    const result = analyze(`
+    class A {
+      seen: boolean; box: B;
+      constructor() {
+        this.seen = check(this);
+        this.box = new B();
+      }
+    }`);
+    expect(result.escapes).toBe(true);
+    expect(sorted(result.assigned)).toEqual([]);
+});
+test("method calls, callbacks and reads of unassigned fields expose the instance", () => {
+    for (const body of [
+        "this.describe(); this.box = new B();",
+        "const f = () => this.box; this.box = new B();",
+        "this.other = this.box; this.box = new B();",
+        "if (flag) this.box = new B(); this.box = new B();",
+    ]) {
+        const result = analyze(`class A { box: B; other: B; constructor() { ${body} } }`);
+        expect(result.escapes, body).toBe(true);
+        expect(result.assigned.has("box"), body).toBe(false);
+    }
+});
+test("initializers run in order before the constructor body", () => {
+    const result = analyze(`
+    class A {
+      first = new B();
+      second = this.first;
+      third = this.compute();
+      fourth = new B();
+      constructor() { this.fifth = new B(); }
+    }`);
+    expect(result.escapes).toBe(true);
+    expect(sorted(result.assigned)).toEqual(["first", "second"]);
+});
+test("private helpers that only assign fields are followed", () => {
+    const result = analyze(`
+    class A {
+      a!: B; b!: B; c: B;
+      constructor() {
+        this.setup();
+        this.c = new B();
+      }
+      private setup(): void {
+        this.a = new B();
+        this.#more();
+      }
+      #more(): void {
+        this.b = this.a;
+      }
+    }`);
+    expect(result.escapes).toBe(false);
+    expect(sorted(result.assigned)).toEqual(["a", "b", "c"]);
+});
+test("public helpers, helpers that return early, and early returns stop the proof", () => {
+    for (const source of [
+        "class A { a!: B; constructor() { this.setup(); } setup(): void { this.a = new B(); } }",
+        "class A { a!: B; constructor() { this.setup(); } private setup(): void { if (x) return; this.a = new B(); } }",
+        "class A { a!: B; constructor() { if (x) return; this.a = new B(); } }",
+    ]) {
+        const result = analyze(source);
+        expect(result.escapes, source).toBe(true);
+        expect(result.assigned.has("a"), source).toBe(false);
+    }
+});
+test("derived classes inherit the base constructor's exposure", () => {
+    const source = `
+    class D {
+      box: B;
+      constructor() {
+        super();
+        this.box = new B();
+      }
+    }`;
+    expect(analyze(source, { derived: true }).escapes).toBe(false);
+    const exposed = analyze(source, { derived: true, baseEscapes: true });
+    expect(exposed.escapes).toBe(true);
+    expect(sorted(exposed.assigned)).toEqual([]);
+    // Without a constructor, construction is the implicit super call.
+    expect(analyze("class D { box = new B(); }", { derived: true, baseEscapes: true }).escapes).toBe(true);
+    expect(sorted(analyze("class D { box = new B(); }", { derived: true }).assigned)).toEqual([
+        "box",
+    ]);
+});
+test("nested functions with their own receiver are opaque", () => {
+    const file = parseSourceFile("nested.ts", "const f = function () { return this; }; const g = () => this;", "ts");
+    const found = [];
+    ts.walkPreorder(file, (node) => {
+        if (ts.isVariableDeclaration(node) && node.initializer)
+            found.push(mentionsReceiver(node.initializer));
+    });
+    expect(found).toEqual([false, true]);
+});
+//# sourceMappingURL=construction-escapes.test.js.map

package/dist/frontend/lowering/construction-escapes.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"construction-escapes.test.js","sourceRoot":"","sources":["../../../src/frontend/lowering/construction-escapes.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAChD,OAAO,KAAK,EAAE,MAAM,mBAAmB,CAAC;AACxC,OAAO,EAAE,iBAAiB,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AAClF,OAAO,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAEjF,QAAQ,CAAC,iBAAiB,CAAC,CAAC;AAE5B,SAAS,OAAO,CAAC,MAAc,EAAE,OAAO,GAAiD,EAAE;IACzF,MAAM,IAAI,GAAG,eAAe,CAAC,YAAY,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;IACzD,IAAI,IAAqC,CAAC;IAC1C,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;QAC7B,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC,kBAAkB,CAAC,IAAI,CAAC;YAAE,IAAI,GAAG,IAAI,CAAC;IACxD,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAC;IACnD,MAAM,GAAG,GAAG,IAAI,CAAC;IACjB,MAAM,IAAI,GAAG,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,wBAAwB,CAAC,IAAI,IAAI,CAAC;IACnE,MAAM,MAAM,GAAG,GAAG,CAAC,OAAO;SACvB,MAAM,CAAC,EAAE,CAAC,qBAAqB,CAAC;SAChC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,WAAW,EAAE,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IACvF,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;IAC9D,OAAO,kBAAkB,CAAC;QACxB,IAAI;QACJ,MAAM;QACN,UAAU,EAAE,EAAE;QACd,OAAO,EAAE,OAAO,CAAC,OAAO,IAAI,KAAK;QACjC,WAAW,EAAE,OAAO,CAAC,WAAW,IAAI,KAAK;QACzC,OAAO,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC;QACvC,iBAAiB,EAAE,CAAC,IAAI,EAAE,EAAE;YAC1B,IAAI,CAAC,EAAE,CAAC,0BAA0B,CAAC,IAAI,CAAC,UAAU,CAAC;gBAAE,OAAO,IAAI,CAAC;YACjE,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC;YACvC,MAAM,MAAM,GAAG,GAAG,CAAC,OAAO,CAAC,IAAI,CAC7B,CAAC,MAAM,EAAkC,EAAE,CACzC,EAAE,CAAC,mBAAmB,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,IAAI,CACnE,CAAC;YACF,MAAM,SAAS,GACb,MAAM,KAAK,SAAS;gBACpB,CAAC,EAAE,CAAC,mBAAmB,CAAC,MAAM,CAAC,IAAI,CAAC;oBAClC,CAAC,EAAE,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC,UAAU,CAAC,cAAc,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC;YAC9F,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAClD,CAAC;KACF,CAAC,CAAC;AACL,CAAC;AAED,MAAM,MAAM,GAAG,CAAC,GAAgB,EAAY,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;AAE/D,IAAI,CAAC,4CAA4C,EAAE,GAAG,EAAE;IACtD,MAAM,MAAM,GAAG,OAAO,CAAC;;;;;;;;;;MAUnB,CAAC,CAAC;IACN,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;AAC3D,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,mDAAmD,EAAE,GAAG,EAAE;IAC7D,MAAM,MAAM,GAAG,OAAO,CAAC;;;;;;;MAOnB,CAAC,CAAC;IACN,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;AAC9C,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,4EAA4E,EAAE,GAAG,EAAE;IACtF,KAAK,MAAM,IAAI,IAAI;QACjB,sCAAsC;QACtC,+CAA+C;QAC/C,4CAA4C;QAC5C,mDAAmD;KACpD,EAAE,CAAC;QACF,MAAM,MAAM,GAAG,OAAO,CAAC,+CAA+C,IAAI,MAAM,CAAC,CAAC;QAClF,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACvD,CAAC;AACH,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,uDAAuD,EAAE,GAAG,EAAE;IACjE,MAAM,MAAM,GAAG,OAAO,CAAC;;;;;;;MAOnB,CAAC,CAAC;IACN,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC;AAC/D,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,sDAAsD,EAAE,GAAG,EAAE;IAChE,MAAM,MAAM,GAAG,OAAO,CAAC;;;;;;;;;;;;;;MAcnB,CAAC,CAAC;IACN,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;AAC3D,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,6EAA6E,EAAE,GAAG,EAAE;IACvF,KAAK,MAAM,MAAM,IAAI;QACnB,wFAAwF;QACxF,+GAA+G;QAC/G,uEAAuE;KACxE,EAAE,CAAC;QACF,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;QAC/B,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1C,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACvD,CAAC;AACH,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,yDAAyD,EAAE,GAAG,EAAE;IACnE,MAAM,MAAM,GAAG;;;;;;;MAOX,CAAC;IACL,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/D,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC;IACtE,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAC7C,kEAAkE;IAClE,MAAM,CAAC,OAAO,CAAC,4BAA4B,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAC9F,IAAI,CACL,CAAC;IACF,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,4BAA4B,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC;QACxF,KAAK;KACN,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,qDAAqD,EAAE,GAAG,EAAE;IAC/D,MAAM,IAAI,GAAG,eAAe,CAC1B,WAAW,EACX,+DAA+D,EAC/D,IAAI,CACL,CAAC;IACF,MAAM,KAAK,GAAc,EAAE,CAAC;IAC5B,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;QAC7B,IAAI,EAAE,CAAC,qBAAqB,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,WAAW;YACpD,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IACH,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;AACvC,CAAC,CAAC,CAAC"}

package/dist/frontend/lowering/containers/array-callbacks.js

@@ -33,7 +33,8 @@ export function lowerArrayHofCall(lowerer, call, access, method, elem) {
         ts.isIdentifier(argNode) &&
         argNode.text === "Boolean" &&
         lowerer.isStdlibSymbol(lowerer.resolveValueSymbol(argNode) ?? undefined);
-    const valueT = arrayValueType(lowerer, elem);
+    const present = !booleanFilter && presentElements(lowerer, call, elem);
+    const valueT = callbackValueType(lowerer, elem, present);
     if (booleanFilter) {
         if (valueT.kind === "union")
             lowerer.requireTruthyUnion(valueT.unionId, argNode);
@@ -74,10 +75,10 @@ export function lowerArrayHofCall(lowerer, call, access, method, elem) {
         ? filterResultElem(lowerer, call, argNode, elem, valueT, booleanFilter)
         : callbackArrayElement(lowerer, call, fnRet);
     // A filter that re-tags its elements keeps the single union-typed visit.
-    const fast = booleanFilter || (method === "filter" && !typeEquals(outElem, elem))
+    const fast = present || booleanFilter || (method === "filter" && !typeEquals(outElem, elem))
         ? null
         : lowerFastCallback(lowerer, argNode, [valueT], 0, elem, arrayOf(elem), callback);
-    const helper = arrayHofHelper(lowerer, method, elem, fnRet, arity, loc, outElem, callbackSite(fast ?? fnArg), fast?.type ?? null);
+    const helper = arrayHofHelper(lowerer, method, elem, fnRet, arity, loc, outElem, callbackSite(fast ?? fnArg), fast?.type ?? null, present);
     const resultType = method === "map" || method === "filter" ? arrayOf(outElem) : VOID;
     return {
         kind: "call",
@@ -383,18 +384,39 @@ function withFastCallback(fn, fastT, elem) {
 function callbackSite(fnArg) {
     return fnArg.kind === "closure" ? `@${fnArg.fnName}` : "";
 }
+/** The optional-read analysis proved this call's receiver never holds an
+ * explicit undefined (or, for the find family, a hole): its callback takes
+ * the element type itself, read without a state test. A missing value the
+ * proof excluded would make the element read trap instead of producing a
+ * wrong value. */
+function presentElements(lowerer, call, elem) {
+    return (lowerer.presentElementCalls.has(call) &&
+        elem.kind !== "dyn" &&
+        elem.kind !== "jsval" &&
+        elem.kind !== "void" &&
+        !isUnitType(elem));
+}
+/** The value a helper passes its callback for one visited index. */
+function callbackValueType(lowerer, elem, present) {
+    return present ? elem : arrayValueType(lowerer, elem);
+}
+function callbackValueRead(lowerer, arr, index, elem, present, loc) {
+    return present
+        ? { kind: "arrayGet", arr, index, type: elem, loc }
+        : arrayValueRead(lowerer, arr, index, elem, loc);
+}
 /** Interned synthetic loop function for one (method, elem, fnRet, arity)
  * combo. Named `%arr.<method>.<n>` ('%' keeps it out of the user
  * namespace); rides `liftedFns` into the module like a lifted lambda (it
  * is a plain function — no captures). */
-function arrayHofHelper(lowerer, method, elem, fnRet, arity, loc, outElem = fnRet, site = "", fastT = null) {
-    const key = `${method}:${typeKey(elem)}:${typeKey(fnRet)}:${arity}:${typeKey(outElem)}${site}${fastT ? ":split" : ""}`;
+function arrayHofHelper(lowerer, method, elem, fnRet, arity, loc, outElem = fnRet, site = "", fastT = null, present = false) {
+    const key = `${method}:${typeKey(elem)}:${typeKey(fnRet)}:${arity}:${typeKey(outElem)}${site}${fastT ? ":split" : ""}${present ? ":present" : ""}`;
     const existing = lowerer.arrHofHelpers.get(key);
     if (existing)
         return existing;
     const name = `%arr.${method}.${lowerer.arrHofHelpers.size}`;
     lowerer.arrHofHelpers.set(key, name);
-    const fn = buildArrayHofFn(lowerer, name, method, elem, fnRet, arity, loc, outElem, fastT);
+    const fn = buildArrayHofFn(lowerer, name, method, elem, fnRet, arity, loc, outElem, fastT, present);
     lowerer.liftedFns.push(fastT ? withFastCallback(fn, fastT, elem) : fn);
     return name;
 }
@@ -553,14 +575,14 @@ function arrayUnionHofHelper(lowerer, method, receiverT, arrays, callbackT, arit
  * `arity` is the callback's declared parameter count (1–3): the loop
  * passes the index and the receiver itself after the element when the
  * callback names them, exactly the arguments JS supplies. */
-function buildArrayHofFn(lowerer, name, method, elem, fnRet, arity, loc, outElem, fastT = null) {
+function buildArrayHofFn(lowerer, name, method, elem, fnRet, arity, loc, outElem, fastT = null, present = false) {
     const arrT = arrayOf(elem);
-    const valueT = arrayValueType(lowerer, elem);
-    const fnT = funcOf([arrayValueType(lowerer, elem), F64, arrT].slice(0, arity), fnRet);
+    const valueT = callbackValueType(lowerer, elem, present);
+    const fnT = funcOf([valueT, F64, arrT].slice(0, arity), fnRet);
     const locals = arrayCallbackLocals(arrT, fnT);
     const params = arrayCallbackParams(arrT, fnT);
     const callF = (arg) => callArrayCallback(arrT, fnT, fnRet, arity, arg, loc);
-    const getElem = arrayValueRead(lowerer, varRef("a.0", arrT, loc), varRef("i.0", F64, loc), elem, loc);
+    const getElem = callbackValueRead(lowerer, varRef("a.0", arrT, loc), varRef("i.0", F64, loc), elem, present, loc);
     const hasElem = {
         kind: "arrayHas",
         arr: varRef("a.0", arrT, loc),
@@ -798,7 +820,12 @@ export function lowerArrayFindLikeCall(lowerer, call, access, method, elem, bind
     const argNode = call.arguments[0];
     if (!argNode)
         lowerer.unsupported("SC1090", call, "this call form"); // tsc-guarded
-    const { fnArg, arity } = lowerArrayCallback(lowerer, argNode, [arrayValueType(lowerer, elem)], arrT, bindUntyped);
+    // find's result must be reachable from the element itself; a predicate
+    // that narrows to another layout keeps the optional element visit.
+    const present = presentElements(lowerer, call, elem) &&
+        ((method !== "find" && method !== "findLast") ||
+            (!bindUntyped && lowerer.coercibleValue(elem, lowerer.irTypeOf(call))));
+    const { fnArg, arity } = lowerArrayCallback(lowerer, argNode, [callbackValueType(lowerer, elem, present)], arrT, bindUntyped);
     // JS takes the ToBoolean of the predicate's result — allowed wherever
     // that ToBoolean has a static answer (bool passes through; f64/string
     // by value; a truthy-answerable union by its arm — the
@@ -818,11 +845,13 @@ export function lowerArrayFindLikeCall(lowerer, call, access, method, elem, bind
         method === "every" ||
         method === "findIndex" ||
         method === "findLastIndex") {
-        const fast = lowerFastCallback(lowerer, argNode, [arrayValueType(lowerer, elem)], 0, elem, arrT, { fnArg, arity }, bindUntyped);
+        const fast = present
+            ? null
+            : lowerFastCallback(lowerer, argNode, [arrayValueType(lowerer, elem)], 0, elem, arrT, { fnArg, arity }, bindUntyped);
         const fastT = fast?.type ?? null;
         const helper = method === "findIndex" || method === "findLastIndex"
-            ? findIndexHelper(lowerer, elem, fnRet, arity, last, loc, callbackSite(fast ?? fnArg), fastT)
-            : someEveryHelper(lowerer, method, elem, fnRet, arity, loc, callbackSite(fast ?? fnArg), fastT);
+            ? findIndexHelper(lowerer, elem, fnRet, arity, last, loc, callbackSite(fast ?? fnArg), fastT, present)
+            : someEveryHelper(lowerer, method, elem, fnRet, arity, loc, callbackSite(fast ?? fnArg), fastT, present);
         return {
             kind: "call",
             callee: helper,
@@ -836,7 +865,7 @@ export function lowerArrayFindLikeCall(lowerer, call, access, method, elem, bind
     // element inherits that earlier refinement. Otherwise only an inline,
     // inferred predicate proves a new narrowing; explicit assertions keep
     // the same refusal boundary as filter.
-    const valueT = arrayValueType(lowerer, elem);
+    const valueT = callbackValueType(lowerer, elem, present);
     const checkerReceiver = lowerer.mapTypeOf(lowerer.typeOf(access.expression));
     const checkerResult = lowerer.irTypeOf(call);
     const unchangedElement = checkerReceiver?.kind === "array" &&
@@ -867,7 +896,7 @@ export function lowerArrayFindLikeCall(lowerer, call, access, method, elem, bind
             !(present.kind === "object" && canAssertClassValue(lowerer, valueT, present)))
             lowerer.unsupported("SC1090", call, `'.${method}' narrowing to an incompatible result layout`);
     }
-    const helper = findHelper(lowerer, elem, resultT, undefTag, fnRet, arity, last, loc, retag, callbackSite(fnArg));
+    const helper = findHelper(lowerer, elem, resultT, undefTag, fnRet, arity, last, loc, retag, callbackSite(fnArg), present);
     return { kind: "call", callee: helper, args: [receiver, fnArg], type: resultT, loc };
 }
 /** ToBoolean of a predicate result inside a synthesized HOF helper — the
@@ -886,23 +915,23 @@ function predicateToBoolean(e) {
  *   for (i = 0; i < n; i++) { v = a[i]; if (f(v)) return <v as result arm>; }
  *   return <undefined arm>;
  */
-function findHelper(lowerer, elem, resultT, undefTag, fnRet, arity, last, loc, retag, site = "") {
+function findHelper(lowerer, elem, resultT, undefTag, fnRet, arity, last, loc, retag, site = "", present = false) {
     const method = last ? "findLast" : "find";
-    const key = `${method}:${typeKey(elem)}:${typeKey(resultT)}:${typeKey(fnRet)}:${arity}${site}`;
+    const key = `${method}:${typeKey(elem)}:${typeKey(resultT)}:${typeKey(fnRet)}:${arity}${site}${present ? ":present" : ""}`;
     const existing = lowerer.arrHofHelpers.get(key);
     if (existing)
         return existing;
     const name = `%arr.${method}.${lowerer.arrHofHelpers.size}`;
     lowerer.arrHofHelpers.set(key, name);
     const arrT = arrayOf(elem);
-    const fnT = funcOf([arrayValueType(lowerer, elem), F64, arrT].slice(0, arity), fnRet);
-    const valueT = arrayValueType(lowerer, elem);
+    const valueT = callbackValueType(lowerer, elem, present);
+    const fnT = funcOf([valueT, F64, arrT].slice(0, arity), fnRet);
     const v = varRef("v.0", valueT, loc);
-    const present = lowerer.stripUndefinedArm(resultT);
+    const presentArm = lowerer.stripUndefinedArm(resultT);
     // A successful inferred class predicate may select a descendant of a
     // stored base arm. Keep the value read before the callback mutated the array.
-    const classView = retag === null && !lowerer.coercibleValue(valueT, resultT) && present.kind === "object"
-        ? checkedClassAssertion(lowerer, v, present, loc)
+    const classView = retag === null && !lowerer.coercibleValue(valueT, resultT) && presentArm.kind === "object"
+        ? checkedClassAssertion(lowerer, v, presentArm, loc)
         : null;
     const found = retag === null
         ? lowerer.coerceToExpected(classView ?? v, resultT)
@@ -919,7 +948,7 @@ function findHelper(lowerer, elem, resultT, undefTag, fnRet, arity, last, loc, r
         {
             kind: "varDecl",
             localId: "v.0",
-            init: arrayValueRead(lowerer, varRef("a.0", arrT, loc), varRef("i.0", F64, loc), elem, loc),
+            init: callbackValueRead(lowerer, varRef("a.0", arrT, loc), varRef("i.0", F64, loc), elem, present, loc),
             loc,
         },
         {
@@ -957,20 +986,20 @@ function findHelper(lowerer, elem, resultT, undefTag, fnRet, arity, last, loc, r
  *
  *   n = a.length; for (...) if (f(a[i], i, a)) return i;  return -1;
  */
-function findIndexHelper(lowerer, elem, fnRet, arity, last, loc, site = "", fastT = null) {
+function findIndexHelper(lowerer, elem, fnRet, arity, last, loc, site = "", fastT = null, present = false) {
     const method = last ? "findLastIndex" : "findIndex";
-    const key = `${method}:${typeKey(elem)}:${typeKey(fnRet)}:${arity}${site}${fastT ? ":split" : ""}`;
+    const key = `${method}:${typeKey(elem)}:${typeKey(fnRet)}:${arity}${site}${fastT ? ":split" : ""}${present ? ":present" : ""}`;
     const existing = lowerer.arrHofHelpers.get(key);
     if (existing)
         return existing;
     const name = `%arr.${method}.${lowerer.arrHofHelpers.size}`;
     lowerer.arrHofHelpers.set(key, name);
     const arrT = arrayOf(elem);
-    const fnT = funcOf([arrayValueType(lowerer, elem), F64, arrT].slice(0, arity), fnRet);
+    const fnT = funcOf([callbackValueType(lowerer, elem, present), F64, arrT].slice(0, arity), fnRet);
     const visit = [
         {
             kind: "if",
-            cond: predicateToBoolean(callArrayCallback(arrT, fnT, fnRet, arity, arrayValueRead(lowerer, varRef("a.0", arrT, loc), varRef("i.0", F64, loc), elem, loc), loc)),
+            cond: predicateToBoolean(callArrayCallback(arrT, fnT, fnRet, arity, callbackValueRead(lowerer, varRef("a.0", arrT, loc), varRef("i.0", F64, loc), elem, present, loc), loc)),
             then: [{ kind: "return", value: varRef("i.0", F64, loc), loc }],
             else_: null,
             loc,
@@ -999,16 +1028,16 @@ function findIndexHelper(lowerer, elem, fnRet, arity, last, loc, site = "", fast
  *   some:  n = a.length; for (...) if (f(a[i])) return true;  return false;
  *   every: n = a.length; for (...) if (!f(a[i])) return false; return true;
  */
-function someEveryHelper(lowerer, method, elem, fnRet, arity, loc, site = "", fastT = null) {
-    const key = `${method}:${typeKey(elem)}:${typeKey(fnRet)}:${arity}${site}${fastT ? ":split" : ""}`;
+function someEveryHelper(lowerer, method, elem, fnRet, arity, loc, site = "", fastT = null, present = false) {
+    const key = `${method}:${typeKey(elem)}:${typeKey(fnRet)}:${arity}${site}${fastT ? ":split" : ""}${present ? ":present" : ""}`;
     const existing = lowerer.arrHofHelpers.get(key);
     if (existing)
         return existing;
     const name = `%arr.${method}.${lowerer.arrHofHelpers.size}`;
     lowerer.arrHofHelpers.set(key, name);
     const arrT = arrayOf(elem);
-    const fnT = funcOf([arrayValueType(lowerer, elem), F64, arrT].slice(0, arity), fnRet);
-    const callF = predicateToBoolean(callArrayCallback(arrT, fnT, fnRet, arity, arrayValueRead(lowerer, varRef("a.0", arrT, loc), varRef("i.0", F64, loc), elem, loc), loc));
+    const fnT = funcOf([callbackValueType(lowerer, elem, present), F64, arrT].slice(0, arity), fnRet);
+    const callF = predicateToBoolean(callArrayCallback(arrT, fnT, fnRet, arity, callbackValueRead(lowerer, varRef("a.0", arrT, loc), varRef("i.0", F64, loc), elem, present, loc), loc));
     const body = [
         arrayLengthDeclaration(arrT, loc),
         countedFor(loc, varRef("n.0", F64, loc), () => [
@@ -1055,7 +1084,8 @@ export function lowerArrayFlatMapCall(lowerer, call, access, elem) {
     const argNode = call.arguments[0];
     if (!argNode)
         lowerer.unsupported("SC1090", call, "this call form"); // tsc-guarded
-    const { fnArg, arity } = lowerArrayCallback(lowerer, argNode, [arrayValueType(lowerer, elem)], arrT);
+    const present = presentElements(lowerer, call, elem);
+    const { fnArg, arity } = lowerArrayCallback(lowerer, argNode, [callbackValueType(lowerer, elem, present)], arrT);
     const fnRet = fnArg.type.ret;
     if (fnRet.kind === "dyn" ||
         fnRet.kind === "jsval" ||
@@ -1083,8 +1113,13 @@ export function lowerArrayFlatMapCall(lowerer, call, access, elem) {
             lowerer.badType(call, lowerer.typeOf(call));
         requireProducedArrayElement(lowerer, call, "'.flatMap()'", fnRet);
         const outElem = callbackArrayElement(lowerer, call, fnRet);
-        const fast = lowerFastCallback(lowerer, argNode, [arrayValueType(lowerer, elem)], 0, elem, arrT, { fnArg, arity });
-        const helper = arrayHofHelper(lowerer, "flatMap", elem, fnRet, arity, loc, outElem, callbackSite(fast ?? fnArg), fast?.type ?? null);
+        const fast = present
+            ? null
+            : lowerFastCallback(lowerer, argNode, [arrayValueType(lowerer, elem)], 0, elem, arrT, {
+                fnArg,
+                arity,
+            });
+        const helper = arrayHofHelper(lowerer, "flatMap", elem, fnRet, arity, loc, outElem, callbackSite(fast ?? fnArg), fast?.type ?? null, present);
         return {
             kind: "call",
             callee: helper,
@@ -1093,11 +1128,13 @@ export function lowerArrayFlatMapCall(lowerer, call, access, elem) {
             loc,
         };
     }
-    const fast = lowerFastCallback(lowerer, argNode, [arrayValueType(lowerer, elem)], 0, elem, arrT, {
-        fnArg,
-        arity,
-    });
-    const helper = flatMapHelper(lowerer, elem, fnRet, arity, loc, callbackSite(fast ?? fnArg), fast?.type ?? null);
+    const fast = present
+        ? null
+        : lowerFastCallback(lowerer, argNode, [arrayValueType(lowerer, elem)], 0, elem, arrT, {
+            fnArg,
+            arity,
+        });
+    const helper = flatMapHelper(lowerer, elem, fnRet, arity, loc, callbackSite(fast ?? fnArg), fast?.type ?? null, present);
     return {
         kind: "call",
         callee: helper,
@@ -1115,8 +1152,8 @@ export function lowerArrayFlatMapCall(lowerer, call, access, elem) {
  *   }
  *   return out;
  */
-function flatMapHelper(lowerer, elem, fnRet, arity, loc, site = "", fastT = null) {
-    const key = `flatMap:${typeKey(elem)}:${typeKey(fnRet)}:${arity}${site}${fastT ? ":split" : ""}`;
+function flatMapHelper(lowerer, elem, fnRet, arity, loc, site = "", fastT = null, present = false) {
+    const key = `flatMap:${typeKey(elem)}:${typeKey(fnRet)}:${arity}${site}${fastT ? ":split" : ""}${present ? ":present" : ""}`;
     const existing = lowerer.arrHofHelpers.get(key);
     if (existing)
         return existing;
@@ -1124,7 +1161,7 @@ function flatMapHelper(lowerer, elem, fnRet, arity, loc, site = "", fastT = null
     lowerer.arrHofHelpers.set(key, name);
     const arrT = arrayOf(elem);
     const inner = fnRet.elem;
-    const fnT = funcOf([arrayValueType(lowerer, elem), F64, arrT].slice(0, arity), fnRet);
+    const fnT = funcOf([callbackValueType(lowerer, elem, present), F64, arrT].slice(0, arity), fnRet);
     const innerLoop = {
         kind: "for",
         init: { kind: "varDecl", localId: "j.0", init: numLit(0, loc), loc },
@@ -1191,7 +1228,7 @@ function flatMapHelper(lowerer, elem, fnRet, arity, loc, site = "", fastT = null
                     {
                         kind: "varDecl",
                         localId: "r.0",
-                        init: callArrayCallback(arrT, fnT, fnRet, arity, arrayValueRead(lowerer, varRef("a.0", arrT, loc), varRef("i.0", F64, loc), elem, loc), loc),
+                        init: callArrayCallback(arrT, fnT, fnRet, arity, callbackValueRead(lowerer, varRef("a.0", arrT, loc), varRef("i.0", F64, loc), elem, present, loc), loc),
                         loc,
                     },
                     {