@aglyn/aglyn 1.0.0-beta.219 → 1.0.0-beta.221

package/src/lib/app-utils/email-text.js

@@ -0,0 +1,189 @@
+/**
+ * @license
+ * Copyright 2026 Aglyn LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */ import { normalizeContactEmail } from "./contacts.js";
+/**
+ * READING A RECEIVED EMAIL (AGL-2657): the address in a header value, the
+ * thread a subject belongs to, the words of an HTML part, the message a
+ * forward carries and the reply above the quoted history.
+ *
+ * Pure, and the platform's: every surface that receives mail — a capture
+ * address filing a message on a record, a sequence reading a prospect's
+ * reply — reads a message the same way, so two of them can never disagree
+ * about who wrote it or what they said.
+ */ /** The most a subject keeps, which is also what a one-to-one email may send. */ export const EMAIL_SUBJECT_MAX = 200;
+/** The most an excerpt keeps: a letter, not a thread. */ export const EMAIL_EXCERPT_MAX = 4000;
+/**
+ * The bare address in a header value — `Ada <ada@example.com>` and
+ * `ada@example.com` both answer `ada@example.com` — normalized as every
+ * contact address is, or `null` for anything that is not one.
+ */ export function emailAddressOf(value) {
+    const raw = String(value != null ? value : '').trim();
+    const angled = /<([^<>]+)>\s*$/.exec(raw);
+    return normalizeContactEmail(angled ? angled[1] : raw);
+}
+/** The part after the `@`, or `null` — what an unmatched message is logged by. */ export function emailDomainOf(value) {
+    const address = emailAddressOf(value);
+    if (!address) return null;
+    const at = address.lastIndexOf('@');
+    return at > 0 ? address.slice(at + 1) : null;
+}
+/**
+ * The subject with its reply and forward prefixes removed, however many
+ * were stacked — `Re: Fwd: RE: Renewal` is the `Renewal` thread — and
+ * whitespace collapsed, so two rows of one conversation carry one value.
+ */ export function threadSubject(subject) {
+    let value = String(subject != null ? subject : '').replace(/\s+/g, ' ').trim();
+    const prefix = /^(re|fwd?|aw|wg|tr|sv|vs)\s*(\[\d+\])?\s*:\s*/i;
+    while(prefix.test(value))value = value.replace(prefix, '');
+    return value.slice(0, EMAIL_SUBJECT_MAX);
+}
+const ENTITIES = {
+    amp: '&',
+    lt: '<',
+    gt: '>',
+    quot: '"',
+    apos: "'",
+    nbsp: ' '
+};
+/**
+ * The words in an HTML part, for a message that carried no text part.
+ * Block boundaries become line breaks, tags go, the common entities are
+ * read back — a best effort over a bounded slice, never a renderer.
+ */ export function htmlToPlainText(html) {
+    return String(html != null ? html : '').slice(0, 200000).replace(/<(script|style)[\s\S]*?<\/\1>/gi, '').replace(/<br\s*\/?>/gi, '\n').replace(/<\/(p|div|li|tr|h[1-6]|blockquote|pre)>/gi, '\n').replace(/<[^>]+>/g, '').replace(/&(#\d+|#x[0-9a-f]+|[a-z]+);/gi, (whole, code)=>{
+        var _ENTITIES_code_toLowerCase;
+        if (code.startsWith('#x') || code.startsWith('#X')) {
+            return String.fromCodePoint(parseInt(code.slice(2), 16));
+        }
+        if (code.startsWith('#')) return String.fromCodePoint(parseInt(code.slice(1), 10));
+        return (_ENTITIES_code_toLowerCase = ENTITIES[code.toLowerCase()]) != null ? _ENTITIES_code_toLowerCase : whole;
+    });
+}
+const FORWARD_MARKER = /^\s*(-{2,}\s*Forwarded message\s*-{2,}|Begin forwarded message:)\s*$/i;
+const HEADER_LINE = /^\s*\*?(From|Sent|Date|To|Cc|Subject|Reply-To)\s*:\*?\s*(.*)$/i;
+/**
+ * The forwarded message inside a forward — the block a mail client puts
+ * under "Forwarded message" or, with no marker, a run of `From:` … `Subject:`
+ * header lines — or `null` when the text carries none. The `From:` line is
+ * where the correspondent of a forwarded reply is named, since the forward's
+ * own headers name only the teammate who forwarded it.
+ */ export function forwardedSection(text) {
+    const lines = text.split('\n');
+    let start = -1;
+    for(let index = 0; index < lines.length; index += 1){
+        if (FORWARD_MARKER.test(lines[index])) {
+            start = index + 1;
+            break;
+        }
+        if (/^\s*\*?From\s*:/i.test(lines[index]) && !lines[index].trimStart().startsWith('>')) {
+            const window = lines.slice(index, index + 8);
+            if (window.some((line)=>/^\s*\*?Subject\s*:/i.test(line))) {
+                start = index;
+                break;
+            }
+        }
+    }
+    if (start < 0) return null;
+    let from = null;
+    let cursor = start;
+    // The header block: header lines, blank lines between them allowed, up to
+    // the first line that is neither.
+    let sawHeader = false;
+    while(cursor < lines.length){
+        const line = lines[cursor];
+        const header = HEADER_LINE.exec(line);
+        if (header) {
+            sawHeader = true;
+            if (header[1].toLowerCase() === 'from') from = from != null ? from : emailAddressOf(header[2]);
+            cursor += 1;
+            continue;
+        }
+        if (!line.trim() && !sawHeader) {
+            cursor += 1;
+            continue;
+        }
+        if (!line.trim() && sawHeader) {
+            var _lines_;
+            // A blank line after a header run may precede more headers (Apple
+            // Mail) or the body; look past it.
+            const next = (_lines_ = lines[cursor + 1]) != null ? _lines_ : '';
+            if (HEADER_LINE.test(next)) {
+                cursor += 1;
+                continue;
+            }
+            cursor += 1;
+            break;
+        }
+        break;
+    }
+    return {
+        from,
+        body: lines.slice(cursor).join('\n')
+    };
+}
+const QUOTE_INTRO = /^\s*On\b.{0,300}$/;
+const QUOTE_END = /wrote:\s*$/i;
+const HISTORY_MARKERS = [
+    /^\s*>/,
+    /^\s*-{2,}\s*Original Message\s*-{2,}\s*$/i,
+    /^\s*_{5,}\s*$/,
+    /^\s*From:\s.+$/,
+    /^\s*Sent from my\b/i,
+    /^\s*Le .{0,200} a écrit\s*:\s*$/i,
+    /^\s*Am .{0,200} schrieb .{0,100}:\s*$/i
+];
+/**
+ * The words above the quoted history: everything before the first `On …
+ * wrote:` line, quote mark, "Original Message" rule or reply header block.
+ * The intro may wrap onto a second line, so a line that begins `On` is
+ * read together with the one after it.
+ */ export function stripQuotedHistory(text) {
+    const lines = text.split('\n');
+    let end = lines.length;
+    for(let index = 0; index < lines.length; index += 1){
+        const line = lines[index];
+        if (HISTORY_MARKERS.some((marker)=>marker.test(line))) {
+            end = index;
+            break;
+        }
+        if (QUOTE_INTRO.test(line)) {
+            var _lines_;
+            const joined = `${line} ${(_lines_ = lines[index + 1]) != null ? _lines_ : ''}`;
+            if (QUOTE_END.test(line) || QUOTE_END.test(joined)) {
+                end = index;
+                break;
+            }
+        }
+    }
+    return lines.slice(0, end).join('\n');
+}
+/**
+ * What is worth keeping of a received message: the text part — or the
+ * words of the HTML part when there is none — with a forward's header
+ * block and the quoted history below the reply removed, whitespace
+ * settled, bounded. Never the whole thread: the thread is in the mailbox,
+ * and a record of the message is a note that this exchange happened.
+ */ export function emailExcerpt(text, html) {
+    let body = String(text != null ? text : '');
+    if (!body.trim() && html) body = htmlToPlainText(html);
+    body = body.replace(/\r\n?/g, '\n').replace(/\u00a0/g, ' ');
+    const forwarded = forwardedSection(body);
+    if (forwarded) body = forwarded.body;
+    body = stripQuotedHistory(body);
+    return body.split('\n').map((line)=>line.replace(/[ \t]+$/g, '')).join('\n').replace(/\n{3,}/g, '\n\n').trim().slice(0, EMAIL_EXCERPT_MAX);
+}
+
+//# sourceMappingURL=email-text.js.map

package/src/lib/app-utils/email-text.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../../libs/aglyn/src/lib/app-utils/email-text.ts"],"sourcesContent":["/**\n * @license\n * Copyright 2026 Aglyn LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { normalizeContactEmail } from './contacts'\n\n/**\n * READING A RECEIVED EMAIL (AGL-2657): the address in a header value, the\n * thread a subject belongs to, the words of an HTML part, the message a\n * forward carries and the reply above the quoted history.\n *\n * Pure, and the platform's: every surface that receives mail — a capture\n * address filing a message on a record, a sequence reading a prospect's\n * reply — reads a message the same way, so two of them can never disagree\n * about who wrote it or what they said.\n */\n\n/** The most a subject keeps, which is also what a one-to-one email may send. */\nexport const EMAIL_SUBJECT_MAX = 200\n\n/** The most an excerpt keeps: a letter, not a thread. */\nexport const EMAIL_EXCERPT_MAX = 4_000\n\n/**\n * The bare address in a header value — `Ada <ada@example.com>` and\n * `ada@example.com` both answer `ada@example.com` — normalized as every\n * contact address is, or `null` for anything that is not one.\n */\nexport function emailAddressOf(value: unknown): string | null {\n  const raw = String(value ?? '').trim()\n  const angled = /<([^<>]+)>\\s*$/.exec(raw)\n  return normalizeContactEmail(angled ? angled[1] : raw)\n}\n\n/** The part after the `@`, or `null` — what an unmatched message is logged by. */\nexport function emailDomainOf(value: unknown): string | null {\n  const address = emailAddressOf(value)\n  if (!address) return null\n  const at = address.lastIndexOf('@')\n  return at > 0 ? address.slice(at + 1) : null\n}\n\n/**\n * The subject with its reply and forward prefixes removed, however many\n * were stacked — `Re: Fwd: RE: Renewal` is the `Renewal` thread — and\n * whitespace collapsed, so two rows of one conversation carry one value.\n */\nexport function threadSubject(subject: unknown): string {\n  let value = String(subject ?? '')\n    .replace(/\\s+/g, ' ')\n    .trim()\n  const prefix = /^(re|fwd?|aw|wg|tr|sv|vs)\\s*(\\[\\d+\\])?\\s*:\\s*/i\n  while (prefix.test(value)) value = value.replace(prefix, '')\n  return value.slice(0, EMAIL_SUBJECT_MAX)\n}\n\nconst ENTITIES: Record<string, string> = {\n  amp: '&',\n  lt: '<',\n  gt: '>',\n  quot: '\"',\n  apos: \"'\",\n  nbsp: ' ',\n}\n\n/**\n * The words in an HTML part, for a message that carried no text part.\n * Block boundaries become line breaks, tags go, the common entities are\n * read back — a best effort over a bounded slice, never a renderer.\n */\nexport function htmlToPlainText(html: unknown): string {\n  return String(html ?? '')\n    .slice(0, 200_000)\n    .replace(/<(script|style)[\\s\\S]*?<\\/\\1>/gi, '')\n    .replace(/<br\\s*\\/?>/gi, '\\n')\n    .replace(/<\\/(p|div|li|tr|h[1-6]|blockquote|pre)>/gi, '\\n')\n    .replace(/<[^>]+>/g, '')\n    .replace(/&(#\\d+|#x[0-9a-f]+|[a-z]+);/gi, (whole, code: string) => {\n      if (code.startsWith('#x') || code.startsWith('#X')) {\n        return String.fromCodePoint(parseInt(code.slice(2), 16))\n      }\n      if (code.startsWith('#')) return String.fromCodePoint(parseInt(code.slice(1), 10))\n      return ENTITIES[code.toLowerCase()] ?? whole\n    })\n}\n\n/** What a forwarded message's header block says, and the words after it. */\nexport interface ForwardedSection {\n  /** The address on the block's `From:` line, or `null` when it carried none. */\n  from: string | null\n  /** The forwarded message's own text, header block removed. */\n  body: string\n}\n\nconst FORWARD_MARKER = /^\\s*(-{2,}\\s*Forwarded message\\s*-{2,}|Begin forwarded message:)\\s*$/i\nconst HEADER_LINE = /^\\s*\\*?(From|Sent|Date|To|Cc|Subject|Reply-To)\\s*:\\*?\\s*(.*)$/i\n\n/**\n * The forwarded message inside a forward — the block a mail client puts\n * under \"Forwarded message\" or, with no marker, a run of `From:` … `Subject:`\n * header lines — or `null` when the text carries none. The `From:` line is\n * where the correspondent of a forwarded reply is named, since the forward's\n * own headers name only the teammate who forwarded it.\n */\nexport function forwardedSection(text: string): ForwardedSection | null {\n  const lines = text.split('\\n')\n  let start = -1\n  for (let index = 0; index < lines.length; index += 1) {\n    if (FORWARD_MARKER.test(lines[index])) {\n      start = index + 1\n      break\n    }\n    if (/^\\s*\\*?From\\s*:/i.test(lines[index]) && !lines[index].trimStart().startsWith('>')) {\n      const window = lines.slice(index, index + 8)\n      if (window.some((line) => /^\\s*\\*?Subject\\s*:/i.test(line))) {\n        start = index\n        break\n      }\n    }\n  }\n  if (start < 0) return null\n  let from: string | null = null\n  let cursor = start\n  // The header block: header lines, blank lines between them allowed, up to\n  // the first line that is neither.\n  let sawHeader = false\n  while (cursor < lines.length) {\n    const line = lines[cursor]\n    const header = HEADER_LINE.exec(line)\n    if (header) {\n      sawHeader = true\n      if (header[1].toLowerCase() === 'from') from = from ?? emailAddressOf(header[2])\n      cursor += 1\n      continue\n    }\n    if (!line.trim() && !sawHeader) {\n      cursor += 1\n      continue\n    }\n    if (!line.trim() && sawHeader) {\n      // A blank line after a header run may precede more headers (Apple\n      // Mail) or the body; look past it.\n      const next = lines[cursor + 1] ?? ''\n      if (HEADER_LINE.test(next)) {\n        cursor += 1\n        continue\n      }\n      cursor += 1\n      break\n    }\n    break\n  }\n  return { from, body: lines.slice(cursor).join('\\n') }\n}\n\nconst QUOTE_INTRO = /^\\s*On\\b.{0,300}$/\nconst QUOTE_END = /wrote:\\s*$/i\nconst HISTORY_MARKERS = [\n  /^\\s*>/,\n  /^\\s*-{2,}\\s*Original Message\\s*-{2,}\\s*$/i,\n  /^\\s*_{5,}\\s*$/,\n  /^\\s*From:\\s.+$/,\n  /^\\s*Sent from my\\b/i,\n  /^\\s*Le .{0,200} a écrit\\s*:\\s*$/i,\n  /^\\s*Am .{0,200} schrieb .{0,100}:\\s*$/i,\n]\n\n/**\n * The words above the quoted history: everything before the first `On …\n * wrote:` line, quote mark, \"Original Message\" rule or reply header block.\n * The intro may wrap onto a second line, so a line that begins `On` is\n * read together with the one after it.\n */\nexport function stripQuotedHistory(text: string): string {\n  const lines = text.split('\\n')\n  let end = lines.length\n  for (let index = 0; index < lines.length; index += 1) {\n    const line = lines[index]\n    if (HISTORY_MARKERS.some((marker) => marker.test(line))) {\n      end = index\n      break\n    }\n    if (QUOTE_INTRO.test(line)) {\n      const joined = `${line} ${lines[index + 1] ?? ''}`\n      if (QUOTE_END.test(line) || QUOTE_END.test(joined)) {\n        end = index\n        break\n      }\n    }\n  }\n  return lines.slice(0, end).join('\\n')\n}\n\n/**\n * What is worth keeping of a received message: the text part — or the\n * words of the HTML part when there is none — with a forward's header\n * block and the quoted history below the reply removed, whitespace\n * settled, bounded. Never the whole thread: the thread is in the mailbox,\n * and a record of the message is a note that this exchange happened.\n */\nexport function emailExcerpt(text: unknown, html?: unknown): string {\n  let body = String(text ?? '')\n  if (!body.trim() && html) body = htmlToPlainText(html)\n  body = body.replace(/\\r\\n?/g, '\\n').replace(/\\u00a0/g, ' ')\n  const forwarded = forwardedSection(body)\n  if (forwarded) body = forwarded.body\n  body = stripQuotedHistory(body)\n  return body\n    .split('\\n')\n    .map((line) => line.replace(/[ \\t]+$/g, ''))\n    .join('\\n')\n    .replace(/\\n{3,}/g, '\\n\\n')\n    .trim()\n    .slice(0, EMAIL_EXCERPT_MAX)\n}\n"],"names":["normalizeContactEmail","EMAIL_SUBJECT_MAX","EMAIL_EXCERPT_MAX","emailAddressOf","value","raw","String","trim","angled","exec","emailDomainOf","address","at","lastIndexOf","slice","threadSubject","subject","replace","prefix","test","ENTITIES","amp","lt","gt","quot","apos","nbsp","htmlToPlainText","html","whole","code","startsWith","fromCodePoint","parseInt","toLowerCase","FORWARD_MARKER","HEADER_LINE","forwardedSection","text","lines","split","start","index","length","trimStart","window","some","line","from","cursor","sawHeader","header","next","body","join","QUOTE_INTRO","QUOTE_END","HISTORY_MARKERS","stripQuotedHistory","end","marker","joined","emailExcerpt","forwarded","map"],"mappings":"AAAA;;;;;;;;;;;;;;;CAeC,GAED,SAASA,qBAAqB,QAAQ,gBAAY;AAElD;;;;;;;;;CASC,GAED,8EAA8E,GAC9E,OAAO,MAAMC,oBAAoB,IAAG;AAEpC,uDAAuD,GACvD,OAAO,MAAMC,oBAAoB,KAAK;AAEtC;;;;CAIC,GACD,OAAO,SAASC,eAAeC,KAAc;IAC3C,MAAMC,MAAMC,OAAOF,gBAAAA,QAAS,IAAIG,IAAI;IACpC,MAAMC,SAAS,iBAAiBC,IAAI,CAACJ;IACrC,OAAOL,sBAAsBQ,SAASA,MAAM,CAAC,EAAE,GAAGH;AACpD;AAEA,gFAAgF,GAChF,OAAO,SAASK,cAAcN,KAAc;IAC1C,MAAMO,UAAUR,eAAeC;IAC/B,IAAI,CAACO,SAAS,OAAO;IACrB,MAAMC,KAAKD,QAAQE,WAAW,CAAC;IAC/B,OAAOD,KAAK,IAAID,QAAQG,KAAK,CAACF,KAAK,KAAK;AAC1C;AAEA;;;;CAIC,GACD,OAAO,SAASG,cAAcC,OAAgB;IAC5C,IAAIZ,QAAQE,OAAOU,kBAAAA,UAAW,IAC3BC,OAAO,CAAC,QAAQ,KAChBV,IAAI;IACP,MAAMW,SAAS;IACf,MAAOA,OAAOC,IAAI,CAACf,OAAQA,QAAQA,MAAMa,OAAO,CAACC,QAAQ;IACzD,OAAOd,MAAMU,KAAK,CAAC,GAAGb;AACxB;AAEA,MAAMmB,WAAmC;IACvCC,KAAK;IACLC,IAAI;IACJC,IAAI;IACJC,MAAM;IACNC,MAAM;IACNC,MAAM;AACR;AAEA;;;;CAIC,GACD,OAAO,SAASC,gBAAgBC,IAAa;IAC3C,OAAOtB,OAAOsB,eAAAA,OAAQ,IACnBd,KAAK,CAAC,GAAG,QACTG,OAAO,CAAC,mCAAmC,IAC3CA,OAAO,CAAC,gBAAgB,MACxBA,OAAO,CAAC,6CAA6C,MACrDA,OAAO,CAAC,YAAY,IACpBA,OAAO,CAAC,iCAAiC,CAACY,OAAOC;YAKzCV;QAJP,IAAIU,KAAKC,UAAU,CAAC,SAASD,KAAKC,UAAU,CAAC,OAAO;YAClD,OAAOzB,OAAO0B,aAAa,CAACC,SAASH,KAAKhB,KAAK,CAAC,IAAI;QACtD;QACA,IAAIgB,KAAKC,UAAU,CAAC,MAAM,OAAOzB,OAAO0B,aAAa,CAACC,SAASH,KAAKhB,KAAK,CAAC,IAAI;QAC9E,QAAOM,6BAAAA,QAAQ,CAACU,KAAKI,WAAW,GAAG,YAA5Bd,6BAAgCS;IACzC;AACJ;AAUA,MAAMM,iBAAiB;AACvB,MAAMC,cAAc;AAEpB;;;;;;CAMC,GACD,OAAO,SAASC,iBAAiBC,IAAY;IAC3C,MAAMC,QAAQD,KAAKE,KAAK,CAAC;IACzB,IAAIC,QAAQ,CAAC;IACb,IAAK,IAAIC,QAAQ,GAAGA,QAAQH,MAAMI,MAAM,EAAED,SAAS,EAAG;QACpD,IAAIP,eAAehB,IAAI,CAACoB,KAAK,CAACG,MAAM,GAAG;YACrCD,QAAQC,QAAQ;YAChB;QACF;QACA,IAAI,mBAAmBvB,IAAI,CAACoB,KAAK,CAACG,MAAM,KAAK,CAACH,KAAK,CAACG,MAAM,CAACE,SAAS,GAAGb,UAAU,CAAC,MAAM;YACtF,MAAMc,SAASN,MAAMzB,KAAK,CAAC4B,OAAOA,QAAQ;YAC1C,IAAIG,OAAOC,IAAI,CAAC,CAACC,OAAS,sBAAsB5B,IAAI,CAAC4B,QAAQ;gBAC3DN,QAAQC;gBACR;YACF;QACF;IACF;IACA,IAAID,QAAQ,GAAG,OAAO;IACtB,IAAIO,OAAsB;IAC1B,IAAIC,SAASR;IACb,0EAA0E;IAC1E,kCAAkC;IAClC,IAAIS,YAAY;IAChB,MAAOD,SAASV,MAAMI,MAAM,CAAE;QAC5B,MAAMI,OAAOR,KAAK,CAACU,OAAO;QAC1B,MAAME,SAASf,YAAY3B,IAAI,CAACsC;QAChC,IAAII,QAAQ;YACVD,YAAY;YACZ,IAAIC,MAAM,CAAC,EAAE,CAACjB,WAAW,OAAO,QAAQc,OAAOA,eAAAA,OAAQ7C,eAAegD,MAAM,CAAC,EAAE;YAC/EF,UAAU;YACV;QACF;QACA,IAAI,CAACF,KAAKxC,IAAI,MAAM,CAAC2C,WAAW;YAC9BD,UAAU;YACV;QACF;QACA,IAAI,CAACF,KAAKxC,IAAI,MAAM2C,WAAW;gBAGhBX;YAFb,kEAAkE;YAClE,mCAAmC;YACnC,MAAMa,QAAOb,UAAAA,KAAK,CAACU,SAAS,EAAE,YAAjBV,UAAqB;YAClC,IAAIH,YAAYjB,IAAI,CAACiC,OAAO;gBAC1BH,UAAU;gBACV;YACF;YACAA,UAAU;YACV;QACF;QACA;IACF;IACA,OAAO;QAAED;QAAMK,MAAMd,MAAMzB,KAAK,CAACmC,QAAQK,IAAI,CAAC;IAAM;AACtD;AAEA,MAAMC,cAAc;AACpB,MAAMC,YAAY;AAClB,MAAMC,kBAAkB;IACtB;IACA;IACA;IACA;IACA;IACA;IACA;CACD;AAED;;;;;CAKC,GACD,OAAO,SAASC,mBAAmBpB,IAAY;IAC7C,MAAMC,QAAQD,KAAKE,KAAK,CAAC;IACzB,IAAImB,MAAMpB,MAAMI,MAAM;IACtB,IAAK,IAAID,QAAQ,GAAGA,QAAQH,MAAMI,MAAM,EAAED,SAAS,EAAG;QACpD,MAAMK,OAAOR,KAAK,CAACG,MAAM;QACzB,IAAIe,gBAAgBX,IAAI,CAAC,CAACc,SAAWA,OAAOzC,IAAI,CAAC4B,QAAQ;YACvDY,MAAMjB;YACN;QACF;QACA,IAAIa,YAAYpC,IAAI,CAAC4B,OAAO;gBACAR;YAA1B,MAAMsB,SAAS,GAAGd,KAAK,CAAC,GAAER,UAAAA,KAAK,CAACG,QAAQ,EAAE,YAAhBH,UAAoB,IAAI;YAClD,IAAIiB,UAAUrC,IAAI,CAAC4B,SAASS,UAAUrC,IAAI,CAAC0C,SAAS;gBAClDF,MAAMjB;gBACN;YACF;QACF;IACF;IACA,OAAOH,MAAMzB,KAAK,CAAC,GAAG6C,KAAKL,IAAI,CAAC;AAClC;AAEA;;;;;;CAMC,GACD,OAAO,SAASQ,aAAaxB,IAAa,EAAEV,IAAc;IACxD,IAAIyB,OAAO/C,OAAOgC,eAAAA,OAAQ;IAC1B,IAAI,CAACe,KAAK9C,IAAI,MAAMqB,MAAMyB,OAAO1B,gBAAgBC;IACjDyB,OAAOA,KAAKpC,OAAO,CAAC,UAAU,MAAMA,OAAO,CAAC,WAAW;IACvD,MAAM8C,YAAY1B,iBAAiBgB;IACnC,IAAIU,WAAWV,OAAOU,UAAUV,IAAI;IACpCA,OAAOK,mBAAmBL;IAC1B,OAAOA,KACJb,KAAK,CAAC,MACNwB,GAAG,CAAC,CAACjB,OAASA,KAAK9B,OAAO,CAAC,YAAY,KACvCqC,IAAI,CAAC,MACLrC,OAAO,CAAC,WAAW,QACnBV,IAAI,GACJO,KAAK,CAAC,GAAGZ;AACd"}

package/src/lib/app-utils/{list-assignment-policy.d.ts → enrollment-basis.d.ts}

@@ -17,6 +17,10 @@
 /**
  * What basis lets somebody be put on a marketing list.
  *
+ * The enrollment-time half of `marketing-consent.ts`: consent to the MARKETING
+ * send purpose, which every surface that enrolls a person in an audience owes
+ * whichever plugin keeps the audience. It names no plugin's lists.
+ *
  * Pure policy, no Firestore and no network, so the rule that decides whether
  * somebody joins a marketing audience can be asserted without an enrollment
  * path.

package/src/lib/app-utils/{list-assignment-policy.js → enrollment-basis.js}

@@ -16,6 +16,10 @@
  */ /**
  * What basis lets somebody be put on a marketing list.
  *
+ * The enrollment-time half of `marketing-consent.ts`: consent to the MARKETING
+ * send purpose, which every surface that enrolls a person in an audience owes
+ * whichever plugin keeps the audience. It names no plugin's lists.
+ *
  * Pure policy, no Firestore and no network, so the rule that decides whether
  * somebody joins a marketing audience can be asserted without an enrollment
  * path.
@@ -167,4 +171,4 @@
     'no-basis': 'This person has no marketing opt-in on record, so they can only be added if you state that you have their permission.'
 };
 
-//# sourceMappingURL=list-assignment-policy.js.map
+//# sourceMappingURL=enrollment-basis.js.map

package/src/lib/app-utils/enrollment-basis.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../../libs/aglyn/src/lib/app-utils/enrollment-basis.ts"],"sourcesContent":["/**\n * @license\n * Copyright 2026 Aglyn LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * What basis lets somebody be put on a marketing list.\n *\n * The enrollment-time half of `marketing-consent.ts`: consent to the MARKETING\n * send purpose, which every surface that enrolls a person in an audience owes\n * whichever plugin keeps the audience. It names no plugin's lists.\n *\n * Pure policy, no Firestore and no network, so the rule that decides whether\n * somebody joins a marketing audience can be asserted without an enrollment\n * path.\n *\n * ## Why it is here and not beside one of its callers\n *\n * There are two enrollment surfaces and neither can own this: the Inbox\n * assignment route (`@aglyn/plugins-inbox`) enrolls the sender of a form\n * submission, and the Emails console's audience card enrolls an address a\n * merchant types or pastes. `plugins-inbox` already depends on\n * `plugins-email`, so the second could not have imported the first, and a\n * copy in each is the shape that ends with one surface honoring a stored\n * refusal and the other not. The basis a membership carries has to be one\n * rule with one set of words, so it lives in the framework both import.\n *\n * ## A reply is transactional; a list is marketing\n *\n * These are two acts and this module exists because they are constantly\n * mistaken for one. Answering a form submission is the transaction the person\n * started, so the Inbox's `reply-policy.ts` requires no consent record.\n * Putting them on a list is a standing invitation to mail them about things\n * they never asked about, and it requires a basis. Nothing in the reply path\n * reaches this module and nothing here sends anything.\n *\n * ## An enrollment is not a license to send\n *\n * Passing this rule writes a membership and nothing else. It meters nothing,\n * sends nothing, and is not a promise the person is still mailable when a\n * campaign eventually runs — suppression is consulted again at send time, in\n * `filterSendableForHost`, because an address can be suppressed the day after\n * it is enrolled. `apps/console/specs/an-enrollment-is-not-a-license-to-send.spec.ts`\n * holds the two halves together end to end.\n *\n * ## A basis is DECLARED, never inferred\n *\n * The act that produced the address is not a basis. Somebody who filled in a\n * contact form asked to be answered; that is the whole of what they asked for,\n * and an address a merchant has in a spreadsheet says less than that. Neither\n * is writing to the merchant, buying, booking or holding an account — the\n * shared `marketing-consent` module makes the same point for the send-time\n * join, and this is the enrollment-time half of it. So there are exactly two\n * ways in:\n *\n * 1. the person's own record already carries a stored opt-in, which is\n *    carried across unchanged, timestamp and all; or\n * 2. the merchant states that they have this person's permission, and THAT\n *    STATEMENT IS ITSELF THE RECORDED BASIS — stored with the account that\n *    made it and the moment they did.\n *\n * There is no third way and, in particular, no unattributed one. The absence\n * of a record is reported to the merchant as an absence rather than resolved\n * quietly in either direction.\n *\n * ## A stored refusal ends it\n *\n * `declined` is checked first and answers before anything else is considered,\n * including an attestation. A merchant cannot attest their way past somebody\n * who said no; that is the one thing an attestation must not be able to buy,\n * because if it could there would be no difference between recording a\n * refusal and discarding it.\n */\n\nimport {\n  OPERATOR_ATTESTED_CONSENT_BASIS,\n  type MarketingConsentRecord,\n} from './marketing-consent'\n\n/**\n * What is wrong with the ADDRESS, before anybody asks what is wrong with the\n * consent.\n *\n * Four failures that are properties of the address rather than of the act, so\n * every surface that touches an address shares them: a form with no email\n * field has nobody to enroll for the same reason it has nobody to answer, and\n * a bounced address is unmailable whichever route reached it. The Inbox's\n * `ReplyRefusal` is this type — one union, aliased there — because a reply\n * and an enrollment refuse an address for the same four reasons and a second\n * copy would eventually list three.\n */\nexport type AddressRefusal =\n  /** No field the resolver recognizes as an email — nothing to enroll. */\n  | 'no-address'\n  /** The value is not a routable address. */\n  | 'unroutable-address'\n  /** The address is on the platform-wide bounce/complaint list. */\n  | 'suppressed-platform'\n  /** The address unsubscribed from, or bounced on, this site. */\n  | 'suppressed-host'\n\n/** Why an address cannot be put on a list. Each maps to one refusal message. */\nexport type AssignmentRefusal =\n  | AddressRefusal\n  /** A stored refusal. Never enrollable, and there is no override. */\n  | 'declined'\n  /** No record either way, and the merchant asserted nothing. */\n  | 'no-basis'\n\n/** The basis an enrollment would carry, resolved server-side. */\nexport interface AssignmentBasisDecision {\n  /*\n   * The attested value is the EXPORTED CONSTANT and not a literal spelled\n   * again here. `readMarketingBasis` recognizes an attestation by comparing\n   * the stored field against that constant, so a second spelling on the\n   * deciding side is a rename away from writing a basis the reader reports as\n   * the person's own act — the one conflation this whole area exists to stop.\n   */\n  basis: 'contact-opt-in' | typeof OPERATOR_ATTESTED_CONSENT_BASIS\n  /** When the basis was recorded — the person's own moment, or the merchant's. */\n  atMs: number\n  /** The account answerable for an attestation; `null` for a pass-through. */\n  byUid: string | null\n}\n\n/**\n * Decides what basis, if any, an enrollment may carry.\n *\n * The client never names the basis. It says only whether the merchant is\n * asserting one, and the pass-through is derived here from the person's own\n * record — a caller that could claim `contact-opt-in` would be a caller that\n * can manufacture an opt-in for anybody by naming it.\n *\n * @param stored   the person's consent facts, read off their own record.\n * @param attested whether the merchant asserted permission in this request.\n */\nexport function assignmentBasis(input: {\n  stored: MarketingConsentRecord\n  attested: boolean\n  actingUid: string\n  nowMs: number\n}): AssignmentBasisDecision | { refusal: AssignmentRefusal } {\n  // First, and above the attestation on purpose. See the module note.\n  if (input.stored.basis === 'declined') return { refusal: 'declined' }\n  if (input.stored.basis === 'granted') {\n    return {\n      basis: 'contact-opt-in',\n      /*\n       * The person's own timestamp, and `nowMs` only when their record\n       * carries none. A pass-through that restamped the moment would report\n       * every historical opt-in as having happened when a merchant pressed a\n       * button, which moves records across the enforcement cutoff the consent\n       * policy grandfathers on and makes the audit answer the wrong question.\n       */\n      atMs: input.stored.basisAtMs ?? input.nowMs,\n      byUid: null,\n    }\n  }\n  if (!input.attested) return { refusal: 'no-basis' }\n  return {\n    basis: OPERATOR_ATTESTED_CONSENT_BASIS,\n    atMs: input.nowMs,\n    // Never optional for this basis: an attestation nobody is named for is\n    // indistinguishable from an opt-in, which is the conflation the whole\n    // module exists to prevent.\n    byUid: input.actingUid,\n  }\n}\n\n/** What the merchant is shown before they decide. */\nexport interface AssignmentReadout {\n  /** Can this person be enrolled at all, by any answer the merchant gives? */\n  enrollable: boolean\n  /**\n   * Must the merchant assert permission for the enrollment to proceed?\n   *\n   * False both when a stored opt-in already carries it and when nothing can\n   * carry it, so the UI reads this alone to decide whether to show the\n   * assertion control — a surface that showed it on a refusal would offer an\n   * override that does not exist.\n   */\n  requiresAttestation: boolean\n  /** One sentence of consent facts, in the merchant's terms. */\n  summary: string\n}\n\n/**\n * The readout for one address, from the same inputs the decision uses.\n *\n * It lives here rather than in the component so the sentence on screen and\n * the rule that runs on the server cannot drift: a UI that computed its own\n * summary would eventually tell a merchant that somebody may be added and\n * then refuse them, or — far worse — say a check was performed that was not.\n *\n * @param suppression a suppression refusal for the address, when there is\n *                    one. It outranks consent in the readout because it is\n *                    the answer regardless of what any consent record says.\n */\nexport function assignmentReadout(input: {\n  stored: MarketingConsentRecord\n  suppression: AddressRefusal | null\n}): AssignmentReadout {\n  if (input.suppression) {\n    return {\n      enrollable: false,\n      requiresAttestation: false,\n      summary: ASSIGNMENT_REFUSAL_MESSAGES[input.suppression],\n    }\n  }\n  if (input.stored.basis === 'declined') {\n    return {\n      enrollable: false,\n      requiresAttestation: false,\n      summary: ASSIGNMENT_REFUSAL_MESSAGES['declined'],\n    }\n  }\n  if (input.stored.basis === 'granted') {\n    const when = input.stored.basisAtMs\n      ? ` on ${new Date(input.stored.basisAtMs).toLocaleDateString()}`\n      : ''\n    return {\n      enrollable: true,\n      requiresAttestation: false,\n      summary: `This person opted in to marketing email${when}. Adding them carries that opt-in across.`,\n    }\n  }\n  return {\n    enrollable: true,\n    requiresAttestation: true,\n    summary:\n      'There is no marketing opt-in on record for this person. Sending this ' +\n      'form does not create one. To add them you have to state that you have ' +\n      'their permission, and that statement is recorded against your account.',\n  }\n}\n\n/** What a refusal says to the merchant. One line, naming the cause. */\nexport const ASSIGNMENT_REFUSAL_MESSAGES: Record<AssignmentRefusal, string> = {\n  'no-address':\n    'This submission has no email field, so there is nobody to add to a list.',\n  'unroutable-address':\n    'The email address on this submission is not a valid address.',\n  'suppressed-platform':\n    'This address bounced or reported a message as spam, so it cannot be mailed or added to a list.',\n  'suppressed-host':\n    'This address unsubscribed from this site, so it cannot be mailed or added to a list.',\n  declined:\n    'This person declined marketing email. They cannot be added to a list, and there is no way to override that.',\n  'no-basis':\n    'This person has no marketing opt-in on record, so they can only be added if you state that you have their permission.',\n}\n"],"names":["OPERATOR_ATTESTED_CONSENT_BASIS","assignmentBasis","input","stored","basis","refusal","atMs","basisAtMs","nowMs","byUid","attested","actingUid","assignmentReadout","suppression","enrollable","requiresAttestation","summary","ASSIGNMENT_REFUSAL_MESSAGES","when","Date","toLocaleDateString","declined"],"mappings":"AAAA;;;;;;;;;;;;;;;CAeC,GAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAmEC,GAED,SACEA,+BAA+B,QAE1B,yBAAqB;AAgD5B;;;;;;;;;;CAUC,GACD,OAAO,SAASC,gBAAgBC,KAK/B;IACC,oEAAoE;IACpE,IAAIA,MAAMC,MAAM,CAACC,KAAK,KAAK,YAAY,OAAO;QAAEC,SAAS;IAAW;IACpE,IAAIH,MAAMC,MAAM,CAACC,KAAK,KAAK,WAAW;YAU5BF;QATR,OAAO;YACLE,OAAO;YACP;;;;;;OAMC,GACDE,IAAI,GAAEJ,0BAAAA,MAAMC,MAAM,CAACI,SAAS,YAAtBL,0BAA0BA,MAAMM,KAAK;YAC3CC,OAAO;QACT;IACF;IACA,IAAI,CAACP,MAAMQ,QAAQ,EAAE,OAAO;QAAEL,SAAS;IAAW;IAClD,OAAO;QACLD,OAAOJ;QACPM,MAAMJ,MAAMM,KAAK;QACjB,uEAAuE;QACvE,sEAAsE;QACtE,4BAA4B;QAC5BC,OAAOP,MAAMS,SAAS;IACxB;AACF;AAmBA;;;;;;;;;;;CAWC,GACD,OAAO,SAASC,kBAAkBV,KAGjC;IACC,IAAIA,MAAMW,WAAW,EAAE;QACrB,OAAO;YACLC,YAAY;YACZC,qBAAqB;YACrBC,SAASC,2BAA2B,CAACf,MAAMW,WAAW,CAAC;QACzD;IACF;IACA,IAAIX,MAAMC,MAAM,CAACC,KAAK,KAAK,YAAY;QACrC,OAAO;YACLU,YAAY;YACZC,qBAAqB;YACrBC,SAASC,2BAA2B,CAAC,WAAW;QAClD;IACF;IACA,IAAIf,MAAMC,MAAM,CAACC,KAAK,KAAK,WAAW;QACpC,MAAMc,OAAOhB,MAAMC,MAAM,CAACI,SAAS,GAC/B,CAAC,IAAI,EAAE,IAAIY,KAAKjB,MAAMC,MAAM,CAACI,SAAS,EAAEa,kBAAkB,IAAI,GAC9D;QACJ,OAAO;YACLN,YAAY;YACZC,qBAAqB;YACrBC,SAAS,CAAC,uCAAuC,EAAEE,KAAK,yCAAyC,CAAC;QACpG;IACF;IACA,OAAO;QACLJ,YAAY;QACZC,qBAAqB;QACrBC,SACE,0EACA,2EACA;IACJ;AACF;AAEA,qEAAqE,GACrE,OAAO,MAAMC,8BAAiE;IAC5E,cACE;IACF,sBACE;IACF,uBACE;IACF,mBACE;IACFI,UACE;IACF,YACE;AACJ,EAAC"}

package/src/lib/app-utils/expand-repeatables.js

@@ -14,7 +14,7 @@
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */ import { _ as _extends } from "@swc/helpers/_/_extends";
-import { applyDatasetQuery, parseDatasetFilter, parseDatasetSort } from "./dataset-query.js";
+import { applyRepeatQuery, parseRepeatFilter, parseRepeatSort } from "./repeat-query.js";
 /** Namespaces cloned template ids per container/record. */ export const REPEAT_NODE_ID_PREFIX = 'rep__';
 /**
  * `{{item.field}}` token, plus an optional single reference hop
@@ -155,10 +155,10 @@ function substituteValue(value, context) {
  */ export function repeatedRecords(node, dataset) {
     var _ref, _props_repeatFilter, _props_repeatSort, _ref1;
     const props = (_ref = node == null ? void 0 : node.props) != null ? _ref : {};
-    const where = parseDatasetFilter(String((_props_repeatFilter = props['repeatFilter']) != null ? _props_repeatFilter : ''));
-    const orderBy = parseDatasetSort(String((_props_repeatSort = props['repeatSort']) != null ? _props_repeatSort : ''));
+    const where = parseRepeatFilter(String((_props_repeatFilter = props['repeatFilter']) != null ? _props_repeatFilter : ''));
+    const orderBy = parseRepeatSort(String((_props_repeatSort = props['repeatSort']) != null ? _props_repeatSort : ''));
     const limit = Number(props['repeatLimit']);
-    return applyDatasetQuery(dataset == null ? void 0 : dataset.model, (_ref1 = dataset == null ? void 0 : dataset.records) != null ? _ref1 : [], _extends({}, where ? {
+    return applyRepeatQuery((_ref1 = dataset == null ? void 0 : dataset.records) != null ? _ref1 : [], _extends({}, where ? {
         where: [
             where
         ]

package/src/lib/app-utils/expand-repeatables.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../../../../libs/aglyn/src/lib/app-utils/expand-repeatables.ts"],"sourcesContent":["/**\n * @license\n * Copyright 2026 Aglyn LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport type { AglynNodeSchema, NodeId } from '../foundation'\nimport {\n  applyDatasetQuery,\n  parseDatasetFilter,\n  parseDatasetSort,\n} from './dataset-query'\n\n/** Namespaces cloned template ids per container/record. */\nexport const REPEAT_NODE_ID_PREFIX = 'rep__'\n\n/**\n * `{{item.field}}` token, plus an optional single reference hop\n * (`{{item.author.name}}`, AGL-180). One hop only — the pattern itself is\n * the depth guard, so cycles can't recurse.\n */\nconst ITEM_TOKEN_PATTERN =\n  /\\{\\{\\s*item\\.([A-Za-z][A-Za-z0-9_]*)(?:\\.([A-Za-z][A-Za-z0-9_]*))?\\s*\\}\\}/g\n\n/** Hard bound on rows a single repeatable renders, before `repeatLimit`. */\nexport const REPEAT_MAX_RECORDS = 100\n\nexport interface RepeatableDataset {\n  /**\n   * Row value maps, in display order. Rows carry `$id` (needed to resolve\n   * incoming references); values may be typed (AGL-177), stringified at\n   * substitution.\n   */\n  records: Array<Record<string, unknown>>\n  /** Typed model (AGL-177); required for reference-hop bindings. */\n  model?: import('./dataset-models').DatasetModel\n}\n\ninterface SubstituteContext {\n  record: Record<string, unknown>\n  /** Model of the repeated dataset (reference hops need field configs). */\n  model?: import('./dataset-models').DatasetModel\n  /** All host datasets keyed by id (and name) for hop resolution. */\n  datasetsByKey?: Record<string, RepeatableDataset | undefined>\n}\n\nconst displayValue = (value: unknown): string =>\n  Array.isArray(value) ? value.join(', ') : String(value)\n\n/** Resolves `{{item.ref.field}}`: FKey(s) → target document field value. */\nfunction resolveReferenceHop(\n  context: SubstituteContext,\n  fieldId: string,\n  targetFieldId: string,\n): string | null {\n  const field = context.model?.fields?.[fieldId]\n  if (field?.type !== 'reference' || !field.reference?.datasetId) return null\n  const target = context.datasetsByKey?.[field.reference.datasetId]\n  if (!target) return null\n  const keys = context.record[fieldId]\n  const ids = Array.isArray(keys) ? keys : keys != null ? [keys] : []\n  const resolved = ids\n    .map((id) => {\n      const match = target.records.find((row) => row['$id'] === id)\n      const value = match?.[targetFieldId]\n      return value != null ? displayValue(value) : null\n    })\n    .filter((value): value is string => value != null)\n  return resolved.length ? resolved.join(', ') : null\n}\n\nfunction substituteValue(\n  value: unknown,\n  context: SubstituteContext,\n): unknown {\n  const { record } = context\n  if (typeof value === 'string') {\n    return value.replace(\n      ITEM_TOKEN_PATTERN,\n      (token, field: string, hop?: string) => {\n        if (hop) {\n          const resolved = resolveReferenceHop(context, field, hop)\n          return resolved != null ? resolved : token\n        }\n        return record[field] != null ? displayValue(record[field]) : token\n      },\n    )\n  }\n  if (Array.isArray(value)) {\n    return value.map((entry) => substituteValue(entry, context))\n  }\n  if (value && typeof value === 'object') {\n    const next: Record<string, unknown> = {}\n    for (const [key, entry] of Object.entries(value)) {\n      next[key] = substituteValue(entry, context)\n    }\n    return next\n  }\n  return value\n}\n\n/**\n * The key a node repeats over, trimmed, or `''` when it repeats over nothing.\n *\n * The one predicate every repeat question is asked through: the expansion, the\n * datasets-read gate below, the reusable-component graft that moves a\n * placement's repeat onto the element it becomes, and the besigner's preview\n * and badge. Two copies of it are how a `.trim()` on one side and not the\n * other becomes an empty list on a customer's page.\n */\nexport const repeatKey = (node: unknown): string => {\n  const key = (node as { props?: { repeatDataset?: unknown } })?.props\n    ?.repeatDataset\n  return typeof key === 'string' ? key.trim() : ''\n}\n\n/**\n * Makes an element that holds children repeat ITSELF, once per record, instead\n * of what is inside it (AGL-3111): a card whose contents are the design, rather\n * than a list whose contents are the item.\n *\n * Persisted in screen, layout and component documents — never rename. `'true'`\n * counts too, because a switch round-tripped through a text-shaped store comes\n * back as the string.\n */\nexport const REPEAT_SELF_PROP = 'repeatSelf'\n\n/**\n * Every prop that directs a repeat. They are instructions to the composition,\n * never attributes of the element: the expansion consumes them from every node\n * it expands and every copy it makes, so a published element never carries\n * one. Persisted — never rename.\n */\nexport const REPEAT_DIRECTIVE_PROPS: readonly string[] = [\n  'repeatDataset',\n  'repeatLimit',\n  'repeatFilter',\n  'repeatSort',\n  REPEAT_SELF_PROP,\n]\n\n/**\n * What a repeating node copies once per record (AGL-3111).\n *\n * - `children` — what is inside it. The node stays one element around the\n *   copies: the list, grid or gallery they fill. This is how a Stack has\n *   always repeated (AGL-103), and a stored Stack names neither scope.\n * - `self` — the node itself, with everything inside it. What a leaf and a\n *   component instance repeat, and what any element carrying\n *   {@link REPEAT_SELF_PROP} repeats.\n */\nexport type RepeatScope = 'self' | 'children'\n\n/**\n * Which scope a repeating node has, read off the node alone so the published\n * page's composition and the besigner decide it identically.\n *\n * {@link REPEAT_SELF_PROP} decides it whenever the node carries one, which is\n * every repeat the Attributes panel writes. Without one the node's own shape\n * decides, and it decides CONSERVATIVELY: anything that holds a child list —\n * a Stack, empty or not — keeps repeating its children, and only a node with\n * no child list at all repeats itself. A stored repeat predates the prop, so\n * this branch is the one that has to render it unchanged, and an author who\n * named a dataset before filling the container in would otherwise come back to\n * a hundred empty copies of it.\n *\n * A component instance never reaches that branch: the graft stamps the prop on\n * the element it becomes, whose children are the component's own.\n */\nexport function repeatScope(node: unknown): RepeatScope {\n  const { props, nodes } = (node ?? {}) as {\n    props?: Record<string, unknown>\n    nodes?: unknown\n  }\n  // `'true'`/`'false'` too: a switch round-tripped through a text-shaped\n  // store comes back as the string it was written as.\n  const self = props?.[REPEAT_SELF_PROP]\n  if (self === true || self === 'true') return 'self'\n  if (self === false || self === 'false') return 'children'\n  return Array.isArray(nodes) ? 'children' : 'self'\n}\n\n/**\n * One record's values put into `{{item.field}}` tokens, anywhere in a props\n * map — the substitution {@link expandRepeatables} makes on every copy it\n * builds, for a caller that already knows which record it is rendering.\n *\n * The besigner's canvas is that caller (AGL-3111): the element an author\n * edits IS the first copy, so it draws with the first record's values while\n * the node it saves keeps the tokens. Exported rather than reimplemented\n * because a canvas that resolved a token differently from the page would be\n * showing the author a page that does not exist.\n */\nexport function substituteRecordTokens<T>(\n  props: T,\n  context: {\n    record: Record<string, unknown>\n    /** Model of the repeated rows; reference hops need field configs. */\n    model?: import('./dataset-models').DatasetModel\n    /** Rows by key, for a one-hop reference (AGL-180). */\n    datasetsByKey?: Record<string, RepeatableDataset | undefined>\n  },\n): T {\n  return substituteValue(props, context) as T\n}\n\n/** The node minus its repeat directives, or the node itself when it has none. */\nexport function withoutRepeatDirective<N>(node: N): N {\n  const props = (node as { props?: Record<string, unknown> })?.props\n  if (!props || !REPEAT_DIRECTIVE_PROPS.some((key) => key in props)) {\n    return node\n  }\n  const kept = { ...props }\n  for (const key of REPEAT_DIRECTIVE_PROPS) delete kept[key]\n  return { ...node, props: kept }\n}\n\n/**\n * The records a repeating node renders, in order (AGL-181): its filter and sort\n * evaluated over the rows, then its limit, never past\n * {@link REPEAT_MAX_RECORDS}. An unparseable filter or sort fails open.\n *\n * Shared by the expansion and the besigner's canvas preview and badge, so the\n * canvas can never show a copy or a count the published page does not.\n */\nexport function repeatedRecords(\n  node: unknown,\n  dataset: RepeatableDataset | undefined,\n): Array<Record<string, unknown>> {\n  const props = ((node as { props?: unknown })?.props ?? {}) as Record<\n    string,\n    unknown\n  >\n  const where = parseDatasetFilter(String(props['repeatFilter'] ?? ''))\n  const orderBy = parseDatasetSort(String(props['repeatSort'] ?? ''))\n  const limit = Number(props['repeatLimit'])\n  return applyDatasetQuery(dataset?.model, dataset?.records ?? [], {\n    ...(where ? { where: [where] } : {}),\n    ...(orderBy ? { orderBy } : {}),\n  }).slice(\n    0,\n    Number.isFinite(limit) && limit > 0\n      ? Math.min(limit, REPEAT_MAX_RECORDS)\n      : REPEAT_MAX_RECORDS,\n  )\n}\n\n/**\n * Does this tree contain anything {@link expandRepeatables} would expand?\n *\n * The rows read is the largest on the render path — up to two pages of\n * {@link REPEAT_MAX_RECORDS} records for every key a page repeats over — and a\n * page that repeats over nothing should pay none of it (AGL-1440).\n *\n * Any gate on that read has to ask EXACTLY the question the expansion asks,\n * which is why this and {@link repeatKeys} share the one predicate\n * `expandRepeatables` looks keys up with, {@link repeatKey}. A gate that is\n * even slightly stricter than the expansion is not a saving: it is a published\n * page that quietly renders one template row where the author put a list.\n */\nexport function hasRepeatableNodes(\n  nodes: Record<NodeId, unknown> | null | undefined,\n): boolean {\n  if (!nodes) return false\n  return Object.values(nodes).some((node) => repeatKey(node) !== '')\n}\n\n/**\n * Every key this tree repeats over, exactly as {@link expandRepeatables} looks\n * it up — sorted and without repeats.\n *\n * What the tenant compose asks the repeat-rows contract for\n * (`plugin-manager/repeat-rows.ts`), so a page loads the rows it renders and\n * not everything its site may see. Built on the same predicate as\n * {@link hasRepeatableNodes} for the reason given there.\n */\nexport function repeatKeys(\n  nodes: Record<NodeId, unknown> | null | undefined,\n): string[] {\n  const keys = new Set<string>()\n  for (const node of Object.values(nodes ?? {})) {\n    const key = repeatKey(node)\n    if (key) keys.add(key)\n  }\n  return [...keys].sort()\n}\n\n/**\n * Repeats (AGL-103, AGL-3111): any node carrying `props.repeatDataset` (a\n * dataset id or display name) renders once per record of that dataset, with\n * `{{item.field}}` tokens in the copied string props replaced by the record's\n * values (unknown fields keep the literal token, like variable bindings).\n *\n * What is copied is the node's {@link repeatScope}:\n *\n * - `children` — its children are the item template. The node stays, and its\n *   child list becomes the copies, record by record. Its own props are not the\n *   template, so no token in them is substituted.\n * - `self` — the node and everything inside it are the template. The copies\n *   take the node's place in its parent's child list, and every prop in the\n *   subtree is substituted, the node's own included.\n *\n * - Copy ids are namespaced `rep__{repeatId}__{index}__…` — the repeat's own\n *   id, then the template node's — so repeats never collide, including inside\n *   grafted reusable components. A self-scoped node's first copy is\n *   `rep__{id}__0__{id}`. Run this AFTER `composeReusableComponentNodes` and\n *   BEFORE binding resolution.\n * - Rows are the node's {@link repeatedRecords}.\n * - The repeat directives ({@link REPEAT_DIRECTIVE_PROPS}) are consumed: every\n *   node this expands, and every copy it makes, comes out without them.\n * - Repeats do not nest. A repeat inside another repeat's template is copied\n *   with its directives consumed, so it renders once in each copy.\n * - An unknown dataset, no matching records, an empty template, or a\n *   self-scoped node its parent does not list (the document root, say) leave\n *   the node rendering once, as written (fail-open: a deleted dataset must\n *   never take a published screen down).\n * - Inputs are never mutated; templates stay in the map unreferenced.\n */\nexport function expandRepeatables<N extends AglynNodeSchema = AglynNodeSchema>(\n  nodes: Record<NodeId, N>,\n  datasetsByKey: Record<string, RepeatableDataset | undefined> | undefined,\n): Record<NodeId, N> {\n  if (!datasetsByKey) return nodes\n  const repeatIds = Object.entries(nodes).filter(\n    ([, node]) => repeatKey(node) !== '',\n  )\n  if (!repeatIds.length) return nodes\n\n  const next: Record<NodeId, N> = { ...nodes }\n  for (const [repeatId, repeated] of repeatIds) {\n    const dataset = datasetsByKey[repeatKey(repeated)]\n    const records = repeatedRecords(repeated, dataset)\n    const self = repeatScope(repeated) === 'self'\n    // The copies' parent: the node itself, or — for a self-scoped node — the\n    // parent whose child list the copies take its place in, read from `next`\n    // so two self-scoped siblings both land in the list the other has left.\n    const parentId = (self ? repeated.parentId : repeatId) as NodeId\n    const siblings = next[parentId]?.nodes\n    const slot = Array.isArray(siblings)\n      ? (siblings as NodeId[]).indexOf(repeatId)\n      : -1\n    const templateIds = self\n      ? [repeatId]\n      : Array.isArray(repeated.nodes)\n        ? (repeated.nodes as NodeId[])\n        : []\n    next[repeatId] = withoutRepeatDirective(next[repeatId])\n    if (!records.length || !templateIds.length || (self && slot < 0)) continue\n\n    const copyIds: NodeId[] = []\n    records.forEach((record, index) => {\n      const prefix = `${REPEAT_NODE_ID_PREFIX}${repeatId}__${index}__`\n      const prefixId = (id: NodeId) => `${prefix}${id}`\n      const cloneSubtree = (id: NodeId, clonedParentId: NodeId) => {\n        const node = nodes[id]\n        if (!node) return\n        const clonedChildren = Array.isArray(node.nodes)\n          ? (node.nodes as NodeId[])\n          : undefined\n        next[prefixId(id)] = withoutRepeatDirective({\n          ...node,\n          $id: prefixId(id),\n          parentId: clonedParentId,\n          props: substituteValue(node.props ?? {}, {\n            record,\n            model: dataset?.model,\n            datasetsByKey,\n          }) as any,\n          ...(clonedChildren && {\n            nodes: clonedChildren.map((childId) => prefixId(childId)),\n          }),\n        })\n        clonedChildren?.forEach((childId) =>\n          cloneSubtree(childId, prefixId(id)),\n        )\n      }\n      for (const templateId of templateIds) {\n        cloneSubtree(templateId, parentId)\n        copyIds.push(prefixId(templateId))\n      }\n    })\n    if (self) {\n      const listed = [...(next[parentId].nodes as NodeId[])]\n      listed.splice(slot, 1, ...copyIds)\n      next[parentId] = { ...next[parentId], nodes: listed }\n    } else {\n      next[repeatId] = { ...next[repeatId], nodes: copyIds }\n    }\n  }\n  return next\n}\n\nexport default expandRepeatables\n"],"names":["applyDatasetQuery","parseDatasetFilter","parseDatasetSort","REPEAT_NODE_ID_PREFIX","ITEM_TOKEN_PATTERN","REPEAT_MAX_RECORDS","displayValue","value","Array","isArray","join","String","resolveReferenceHop","context","fieldId","targetFieldId","field","model","fields","type","reference","datasetId","target","datasetsByKey","keys","record","ids","resolved","map","id","match","records","find","row","filter","length","substituteValue","replace","token","hop","entry","next","key","Object","entries","repeatKey","node","props","repeatDataset","trim","REPEAT_SELF_PROP","REPEAT_DIRECTIVE_PROPS","repeatScope","nodes","self","substituteRecordTokens","withoutRepeatDirective","some","kept","repeatedRecords","dataset","where","orderBy","limit","Number","slice","isFinite","Math","min","hasRepeatableNodes","values","repeatKeys","Set","add","sort","expandRepeatables","repeatIds","repeatId","repeated","parentId","siblings","slot","indexOf","templateIds","copyIds","forEach","index","prefix","prefixId","cloneSubtree","clonedParentId","clonedChildren","undefined","$id","childId","templateId","push","listed","splice"],"mappings":"AAAA;;;;;;;;;;;;;;;CAeC;AAGD,SACEA,iBAAiB,EACjBC,kBAAkB,EAClBC,gBAAgB,QACX,qBAAiB;AAExB,yDAAyD,GACzD,OAAO,MAAMC,wBAAwB,QAAO;AAE5C;;;;CAIC,GACD,MAAMC,qBACJ;AAEF,0EAA0E,GAC1E,OAAO,MAAMC,qBAAqB,IAAG;AAqBrC,MAAMC,eAAe,CAACC,QACpBC,MAAMC,OAAO,CAACF,SAASA,MAAMG,IAAI,CAAC,QAAQC,OAAOJ;AAEnD,0EAA0E,GAC1E,SAASK,oBACPC,OAA0B,EAC1BC,OAAe,EACfC,aAAqB;QAEPF,uBAAAA,gBACsBG,kBACrBH;IAFf,MAAMG,SAAQH,iBAAAA,QAAQI,KAAK,sBAAbJ,wBAAAA,eAAeK,MAAM,qBAArBL,qBAAuB,CAACC,QAAQ;IAC9C,IAAIE,CAAAA,yBAAAA,MAAOG,IAAI,MAAK,eAAe,GAACH,mBAAAA,MAAMI,SAAS,qBAAfJ,iBAAiBK,SAAS,GAAE,OAAO;IACvE,MAAMC,UAAST,yBAAAA,QAAQU,aAAa,qBAArBV,sBAAuB,CAACG,MAAMI,SAAS,CAACC,SAAS,CAAC;IACjE,IAAI,CAACC,QAAQ,OAAO;IACpB,MAAME,OAAOX,QAAQY,MAAM,CAACX,QAAQ;IACpC,MAAMY,MAAMlB,MAAMC,OAAO,CAACe,QAAQA,OAAOA,QAAQ,OAAO;QAACA;KAAK,GAAG,EAAE;IACnE,MAAMG,WAAWD,IACdE,GAAG,CAAC,CAACC;QACJ,MAAMC,QAAQR,OAAOS,OAAO,CAACC,IAAI,CAAC,CAACC,MAAQA,GAAG,CAAC,MAAM,KAAKJ;QAC1D,MAAMtB,QAAQuB,yBAAAA,KAAO,CAACf,cAAc;QACpC,OAAOR,SAAS,OAAOD,aAAaC,SAAS;IAC/C,GACC2B,MAAM,CAAC,CAAC3B,QAA2BA,SAAS;IAC/C,OAAOoB,SAASQ,MAAM,GAAGR,SAASjB,IAAI,CAAC,QAAQ;AACjD;AAEA,SAAS0B,gBACP7B,KAAc,EACdM,OAA0B;IAE1B,MAAM,EAAEY,MAAM,EAAE,GAAGZ;IACnB,IAAI,OAAON,UAAU,UAAU;QAC7B,OAAOA,MAAM8B,OAAO,CAClBjC,oBACA,CAACkC,OAAOtB,OAAeuB;YACrB,IAAIA,KAAK;gBACP,MAAMZ,WAAWf,oBAAoBC,SAASG,OAAOuB;gBACrD,OAAOZ,YAAY,OAAOA,WAAWW;YACvC;YACA,OAAOb,MAAM,CAACT,MAAM,IAAI,OAAOV,aAAamB,MAAM,CAACT,MAAM,IAAIsB;QAC/D;IAEJ;IACA,IAAI9B,MAAMC,OAAO,CAACF,QAAQ;QACxB,OAAOA,MAAMqB,GAAG,CAAC,CAACY,QAAUJ,gBAAgBI,OAAO3B;IACrD;IACA,IAAIN,SAAS,OAAOA,UAAU,UAAU;QACtC,MAAMkC,OAAgC,CAAC;QACvC,KAAK,MAAM,CAACC,KAAKF,MAAM,IAAIG,OAAOC,OAAO,CAACrC,OAAQ;YAChDkC,IAAI,CAACC,IAAI,GAAGN,gBAAgBI,OAAO3B;QACrC;QACA,OAAO4B;IACT;IACA,OAAOlC;AACT;AAEA;;;;;;;;CAQC,GACD,OAAO,MAAMsC,YAAY,CAACC;QACZ;IAAZ,MAAMJ,MAAOI,yBAAD,cAAA,AAACA,KAAkDC,KAAK,qBAAxD,YACRC,aAAa;IACjB,OAAO,OAAON,QAAQ,WAAWA,IAAIO,IAAI,KAAK;AAChD,EAAC;AAED;;;;;;;;CAQC,GACD,OAAO,MAAMC,mBAAmB,aAAY;AAE5C;;;;;CAKC,GACD,OAAO,MAAMC,yBAA4C;IACvD;IACA;IACA;IACA;IACAD;CACD,CAAA;AAcD;;;;;;;;;;;;;;;CAeC,GACD,OAAO,SAASE,YAAYN,IAAa;IACvC,MAAM,EAAEC,KAAK,EAAEM,KAAK,EAAE,GAAIP,eAAAA,OAAQ,CAAC;IAInC,uEAAuE;IACvE,oDAAoD;IACpD,MAAMQ,OAAOP,yBAAAA,KAAO,CAACG,iBAAiB;IACtC,IAAII,SAAS,QAAQA,SAAS,QAAQ,OAAO;IAC7C,IAAIA,SAAS,SAASA,SAAS,SAAS,OAAO;IAC/C,OAAO9C,MAAMC,OAAO,CAAC4C,SAAS,aAAa;AAC7C;AAEA;;;;;;;;;;CAUC,GACD,OAAO,SAASE,uBACdR,KAAQ,EACRlC,OAMC;IAED,OAAOuB,gBAAgBW,OAAOlC;AAChC;AAEA,+EAA+E,GAC/E,OAAO,SAAS2C,uBAA0BV,IAAO;IAC/C,MAAMC,QAASD,wBAAD,AAACA,KAA8CC,KAAK;IAClE,IAAI,CAACA,SAAS,CAACI,uBAAuBM,IAAI,CAAC,CAACf,MAAQA,OAAOK,QAAQ;QACjE,OAAOD;IACT;IACA,MAAMY,OAAO,aAAKX;IAClB,KAAK,MAAML,OAAOS,uBAAwB,OAAOO,IAAI,CAAChB,IAAI;IAC1D,OAAO,aAAKI;QAAMC,OAAOW;;AAC3B;AAEA;;;;;;;CAOC,GACD,OAAO,SAASC,gBACdb,IAAa,EACbc,OAAsC;cAMEb,qBACAA;IALxC,MAAMA,gBAAUD,wBAAD,AAACA,KAA8BC,KAAK,mBAAI,CAAC;IAIxD,MAAMc,QAAQ5D,mBAAmBU,QAAOoC,sBAAAA,KAAK,CAAC,eAAe,YAArBA,sBAAyB;IACjE,MAAMe,UAAU5D,iBAAiBS,QAAOoC,oBAAAA,KAAK,CAAC,aAAa,YAAnBA,oBAAuB;IAC/D,MAAMgB,QAAQC,OAAOjB,KAAK,CAAC,cAAc;IACzC,OAAO/C,kBAAkB4D,2BAAAA,QAAS3C,KAAK,WAAE2C,2BAAAA,QAAS7B,OAAO,oBAAI,EAAE,EAAE,aAC3D8B,QAAQ;QAAEA,OAAO;YAACA;SAAM;IAAC,IAAI,CAAC,GAC9BC,UAAU;QAAEA;IAAQ,IAAI,CAAC,IAC5BG,KAAK,CACN,GACAD,OAAOE,QAAQ,CAACH,UAAUA,QAAQ,IAC9BI,KAAKC,GAAG,CAACL,OAAO1D,sBAChBA;AAER;AAEA;;;;;;;;;;;;CAYC,GACD,OAAO,SAASgE,mBACdhB,KAAiD;IAEjD,IAAI,CAACA,OAAO,OAAO;IACnB,OAAOV,OAAO2B,MAAM,CAACjB,OAAOI,IAAI,CAAC,CAACX,OAASD,UAAUC,UAAU;AACjE;AAEA;;;;;;;;CAQC,GACD,OAAO,SAASyB,WACdlB,KAAiD;IAEjD,MAAM7B,OAAO,IAAIgD;IACjB,KAAK,MAAM1B,QAAQH,OAAO2B,MAAM,CAACjB,gBAAAA,QAAS,CAAC,GAAI;QAC7C,MAAMX,MAAMG,UAAUC;QACtB,IAAIJ,KAAKlB,KAAKiD,GAAG,CAAC/B;IACpB;IACA,OAAO;WAAIlB;KAAK,CAACkD,IAAI;AACvB;AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA8BC,GACD,OAAO,SAASC,kBACdtB,KAAwB,EACxB9B,aAAwE;IAExE,IAAI,CAACA,eAAe,OAAO8B;IAC3B,MAAMuB,YAAYjC,OAAOC,OAAO,CAACS,OAAOnB,MAAM,CAC5C,CAAC,GAAGY,KAAK,GAAKD,UAAUC,UAAU;IAEpC,IAAI,CAAC8B,UAAUzC,MAAM,EAAE,OAAOkB;IAE9B,MAAMZ,OAA0B,aAAKY;IACrC,KAAK,MAAM,CAACwB,UAAUC,SAAS,IAAIF,UAAW;YAQ3BnC;QAPjB,MAAMmB,UAAUrC,aAAa,CAACsB,UAAUiC,UAAU;QAClD,MAAM/C,UAAU4B,gBAAgBmB,UAAUlB;QAC1C,MAAMN,OAAOF,YAAY0B,cAAc;QACvC,yEAAyE;QACzE,yEAAyE;QACzE,wEAAwE;QACxE,MAAMC,WAAYzB,OAAOwB,SAASC,QAAQ,GAAGF;QAC7C,MAAMG,YAAWvC,iBAAAA,IAAI,CAACsC,SAAS,qBAAdtC,eAAgBY,KAAK;QACtC,MAAM4B,OAAOzE,MAAMC,OAAO,CAACuE,YACvB,AAACA,SAAsBE,OAAO,CAACL,YAC/B,CAAC;QACL,MAAMM,cAAc7B,OAChB;YAACuB;SAAS,GACVrE,MAAMC,OAAO,CAACqE,SAASzB,KAAK,IACzByB,SAASzB,KAAK,GACf,EAAE;QACRZ,IAAI,CAACoC,SAAS,GAAGrB,uBAAuBf,IAAI,CAACoC,SAAS;QACtD,IAAI,CAAC9C,QAAQI,MAAM,IAAI,CAACgD,YAAYhD,MAAM,IAAKmB,QAAQ2B,OAAO,GAAI;QAElE,MAAMG,UAAoB,EAAE;QAC5BrD,QAAQsD,OAAO,CAAC,CAAC5D,QAAQ6D;YACvB,MAAMC,SAAS,GAAGpF,wBAAwB0E,SAAS,EAAE,EAAES,MAAM,EAAE,CAAC;YAChE,MAAME,WAAW,CAAC3D,KAAe,GAAG0D,SAAS1D,IAAI;YACjD,MAAM4D,eAAe,CAAC5D,IAAY6D;oBAUP5C;gBATzB,MAAMA,OAAOO,KAAK,CAACxB,GAAG;gBACtB,IAAI,CAACiB,MAAM;gBACX,MAAM6C,iBAAiBnF,MAAMC,OAAO,CAACqC,KAAKO,KAAK,IAC1CP,KAAKO,KAAK,GACXuC;gBACJnD,IAAI,CAAC+C,SAAS3D,IAAI,GAAG2B,uBAAuB,aACvCV;oBACH+C,KAAKL,SAAS3D;oBACdkD,UAAUW;oBACV3C,OAAOX,iBAAgBU,cAAAA,KAAKC,KAAK,YAAVD,cAAc,CAAC,GAAG;wBACvCrB;wBACAR,KAAK,EAAE2C,2BAAAA,QAAS3C,KAAK;wBACrBM;oBACF;mBACIoE,kBAAkB;oBACpBtC,OAAOsC,eAAe/D,GAAG,CAAC,CAACkE,UAAYN,SAASM;gBAClD;gBAEFH,kCAAAA,eAAgBN,OAAO,CAAC,CAACS,UACvBL,aAAaK,SAASN,SAAS3D;YAEnC;YACA,KAAK,MAAMkE,cAAcZ,YAAa;gBACpCM,aAAaM,YAAYhB;gBACzBK,QAAQY,IAAI,CAACR,SAASO;YACxB;QACF;QACA,IAAIzC,MAAM;YACR,MAAM2C,SAAS;mBAAKxD,IAAI,CAACsC,SAAS,CAAC1B,KAAK;aAAc;YACtD4C,OAAOC,MAAM,CAACjB,MAAM,MAAMG;YAC1B3C,IAAI,CAACsC,SAAS,GAAG,aAAKtC,IAAI,CAACsC,SAAS;gBAAE1B,OAAO4C;;QAC/C,OAAO;YACLxD,IAAI,CAACoC,SAAS,GAAG,aAAKpC,IAAI,CAACoC,SAAS;gBAAExB,OAAO+B;;QAC/C;IACF;IACA,OAAO3C;AACT;AAEA,eAAekC,kBAAiB"}
+{"version":3,"sources":["../../../../../../libs/aglyn/src/lib/app-utils/expand-repeatables.ts"],"sourcesContent":["/**\n * @license\n * Copyright 2026 Aglyn LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport type { AglynNodeSchema, NodeId } from '../foundation'\nimport {\n  applyRepeatQuery,\n  parseRepeatFilter,\n  parseRepeatSort,\n} from './repeat-query'\n\n/** Namespaces cloned template ids per container/record. */\nexport const REPEAT_NODE_ID_PREFIX = 'rep__'\n\n/**\n * `{{item.field}}` token, plus an optional single reference hop\n * (`{{item.author.name}}`, AGL-180). One hop only — the pattern itself is\n * the depth guard, so cycles can't recurse.\n */\nconst ITEM_TOKEN_PATTERN =\n  /\\{\\{\\s*item\\.([A-Za-z][A-Za-z0-9_]*)(?:\\.([A-Za-z][A-Za-z0-9_]*))?\\s*\\}\\}/g\n\n/** Hard bound on rows a single repeatable renders, before `repeatLimit`. */\nexport const REPEAT_MAX_RECORDS = 100\n\nexport interface RepeatableDataset {\n  /**\n   * Row value maps, in display order. Rows carry `$id` (needed to resolve\n   * incoming references); values may be typed (AGL-177), stringified at\n   * substitution.\n   */\n  records: Array<Record<string, unknown>>\n  /** Typed model (AGL-177); required for reference-hop bindings. */\n  model?: import('./dataset-models').DatasetModel\n}\n\ninterface SubstituteContext {\n  record: Record<string, unknown>\n  /** Model of the repeated dataset (reference hops need field configs). */\n  model?: import('./dataset-models').DatasetModel\n  /** All host datasets keyed by id (and name) for hop resolution. */\n  datasetsByKey?: Record<string, RepeatableDataset | undefined>\n}\n\nconst displayValue = (value: unknown): string =>\n  Array.isArray(value) ? value.join(', ') : String(value)\n\n/** Resolves `{{item.ref.field}}`: FKey(s) → target document field value. */\nfunction resolveReferenceHop(\n  context: SubstituteContext,\n  fieldId: string,\n  targetFieldId: string,\n): string | null {\n  const field = context.model?.fields?.[fieldId]\n  if (field?.type !== 'reference' || !field.reference?.datasetId) return null\n  const target = context.datasetsByKey?.[field.reference.datasetId]\n  if (!target) return null\n  const keys = context.record[fieldId]\n  const ids = Array.isArray(keys) ? keys : keys != null ? [keys] : []\n  const resolved = ids\n    .map((id) => {\n      const match = target.records.find((row) => row['$id'] === id)\n      const value = match?.[targetFieldId]\n      return value != null ? displayValue(value) : null\n    })\n    .filter((value): value is string => value != null)\n  return resolved.length ? resolved.join(', ') : null\n}\n\nfunction substituteValue(\n  value: unknown,\n  context: SubstituteContext,\n): unknown {\n  const { record } = context\n  if (typeof value === 'string') {\n    return value.replace(\n      ITEM_TOKEN_PATTERN,\n      (token, field: string, hop?: string) => {\n        if (hop) {\n          const resolved = resolveReferenceHop(context, field, hop)\n          return resolved != null ? resolved : token\n        }\n        return record[field] != null ? displayValue(record[field]) : token\n      },\n    )\n  }\n  if (Array.isArray(value)) {\n    return value.map((entry) => substituteValue(entry, context))\n  }\n  if (value && typeof value === 'object') {\n    const next: Record<string, unknown> = {}\n    for (const [key, entry] of Object.entries(value)) {\n      next[key] = substituteValue(entry, context)\n    }\n    return next\n  }\n  return value\n}\n\n/**\n * The key a node repeats over, trimmed, or `''` when it repeats over nothing.\n *\n * The one predicate every repeat question is asked through: the expansion, the\n * datasets-read gate below, the reusable-component graft that moves a\n * placement's repeat onto the element it becomes, and the besigner's preview\n * and badge. Two copies of it are how a `.trim()` on one side and not the\n * other becomes an empty list on a customer's page.\n */\nexport const repeatKey = (node: unknown): string => {\n  const key = (node as { props?: { repeatDataset?: unknown } })?.props\n    ?.repeatDataset\n  return typeof key === 'string' ? key.trim() : ''\n}\n\n/**\n * Makes an element that holds children repeat ITSELF, once per record, instead\n * of what is inside it (AGL-3111): a card whose contents are the design, rather\n * than a list whose contents are the item.\n *\n * Persisted in screen, layout and component documents — never rename. `'true'`\n * counts too, because a switch round-tripped through a text-shaped store comes\n * back as the string.\n */\nexport const REPEAT_SELF_PROP = 'repeatSelf'\n\n/**\n * Every prop that directs a repeat. They are instructions to the composition,\n * never attributes of the element: the expansion consumes them from every node\n * it expands and every copy it makes, so a published element never carries\n * one. Persisted — never rename.\n */\nexport const REPEAT_DIRECTIVE_PROPS: readonly string[] = [\n  'repeatDataset',\n  'repeatLimit',\n  'repeatFilter',\n  'repeatSort',\n  REPEAT_SELF_PROP,\n]\n\n/**\n * What a repeating node copies once per record (AGL-3111).\n *\n * - `children` — what is inside it. The node stays one element around the\n *   copies: the list, grid or gallery they fill. This is how a Stack has\n *   always repeated (AGL-103), and a stored Stack names neither scope.\n * - `self` — the node itself, with everything inside it. What a leaf and a\n *   component instance repeat, and what any element carrying\n *   {@link REPEAT_SELF_PROP} repeats.\n */\nexport type RepeatScope = 'self' | 'children'\n\n/**\n * Which scope a repeating node has, read off the node alone so the published\n * page's composition and the besigner decide it identically.\n *\n * {@link REPEAT_SELF_PROP} decides it whenever the node carries one, which is\n * every repeat the Attributes panel writes. Without one the node's own shape\n * decides, and it decides CONSERVATIVELY: anything that holds a child list —\n * a Stack, empty or not — keeps repeating its children, and only a node with\n * no child list at all repeats itself. A stored repeat predates the prop, so\n * this branch is the one that has to render it unchanged, and an author who\n * named a dataset before filling the container in would otherwise come back to\n * a hundred empty copies of it.\n *\n * A component instance never reaches that branch: the graft stamps the prop on\n * the element it becomes, whose children are the component's own.\n */\nexport function repeatScope(node: unknown): RepeatScope {\n  const { props, nodes } = (node ?? {}) as {\n    props?: Record<string, unknown>\n    nodes?: unknown\n  }\n  // `'true'`/`'false'` too: a switch round-tripped through a text-shaped\n  // store comes back as the string it was written as.\n  const self = props?.[REPEAT_SELF_PROP]\n  if (self === true || self === 'true') return 'self'\n  if (self === false || self === 'false') return 'children'\n  return Array.isArray(nodes) ? 'children' : 'self'\n}\n\n/**\n * One record's values put into `{{item.field}}` tokens, anywhere in a props\n * map — the substitution {@link expandRepeatables} makes on every copy it\n * builds, for a caller that already knows which record it is rendering.\n *\n * The besigner's canvas is that caller (AGL-3111): the element an author\n * edits IS the first copy, so it draws with the first record's values while\n * the node it saves keeps the tokens. Exported rather than reimplemented\n * because a canvas that resolved a token differently from the page would be\n * showing the author a page that does not exist.\n */\nexport function substituteRecordTokens<T>(\n  props: T,\n  context: {\n    record: Record<string, unknown>\n    /** Model of the repeated rows; reference hops need field configs. */\n    model?: import('./dataset-models').DatasetModel\n    /** Rows by key, for a one-hop reference (AGL-180). */\n    datasetsByKey?: Record<string, RepeatableDataset | undefined>\n  },\n): T {\n  return substituteValue(props, context) as T\n}\n\n/** The node minus its repeat directives, or the node itself when it has none. */\nexport function withoutRepeatDirective<N>(node: N): N {\n  const props = (node as { props?: Record<string, unknown> })?.props\n  if (!props || !REPEAT_DIRECTIVE_PROPS.some((key) => key in props)) {\n    return node\n  }\n  const kept = { ...props }\n  for (const key of REPEAT_DIRECTIVE_PROPS) delete kept[key]\n  return { ...node, props: kept }\n}\n\n/**\n * The records a repeating node renders, in order (AGL-181): its filter and sort\n * evaluated over the rows, then its limit, never past\n * {@link REPEAT_MAX_RECORDS}. An unparseable filter or sort fails open.\n *\n * Shared by the expansion and the besigner's canvas preview and badge, so the\n * canvas can never show a copy or a count the published page does not.\n */\nexport function repeatedRecords(\n  node: unknown,\n  dataset: RepeatableDataset | undefined,\n): Array<Record<string, unknown>> {\n  const props = ((node as { props?: unknown })?.props ?? {}) as Record<\n    string,\n    unknown\n  >\n  const where = parseRepeatFilter(String(props['repeatFilter'] ?? ''))\n  const orderBy = parseRepeatSort(String(props['repeatSort'] ?? ''))\n  const limit = Number(props['repeatLimit'])\n  return applyRepeatQuery(dataset?.records ?? [], {\n    ...(where ? { where: [where] } : {}),\n    ...(orderBy ? { orderBy } : {}),\n  }).slice(\n    0,\n    Number.isFinite(limit) && limit > 0\n      ? Math.min(limit, REPEAT_MAX_RECORDS)\n      : REPEAT_MAX_RECORDS,\n  )\n}\n\n/**\n * Does this tree contain anything {@link expandRepeatables} would expand?\n *\n * The rows read is the largest on the render path — up to two pages of\n * {@link REPEAT_MAX_RECORDS} records for every key a page repeats over — and a\n * page that repeats over nothing should pay none of it (AGL-1440).\n *\n * Any gate on that read has to ask EXACTLY the question the expansion asks,\n * which is why this and {@link repeatKeys} share the one predicate\n * `expandRepeatables` looks keys up with, {@link repeatKey}. A gate that is\n * even slightly stricter than the expansion is not a saving: it is a published\n * page that quietly renders one template row where the author put a list.\n */\nexport function hasRepeatableNodes(\n  nodes: Record<NodeId, unknown> | null | undefined,\n): boolean {\n  if (!nodes) return false\n  return Object.values(nodes).some((node) => repeatKey(node) !== '')\n}\n\n/**\n * Every key this tree repeats over, exactly as {@link expandRepeatables} looks\n * it up — sorted and without repeats.\n *\n * What the tenant compose asks the repeat-rows contract for\n * (`plugin-manager/repeat-rows.ts`), so a page loads the rows it renders and\n * not everything its site may see. Built on the same predicate as\n * {@link hasRepeatableNodes} for the reason given there.\n */\nexport function repeatKeys(\n  nodes: Record<NodeId, unknown> | null | undefined,\n): string[] {\n  const keys = new Set<string>()\n  for (const node of Object.values(nodes ?? {})) {\n    const key = repeatKey(node)\n    if (key) keys.add(key)\n  }\n  return [...keys].sort()\n}\n\n/**\n * Repeats (AGL-103, AGL-3111): any node carrying `props.repeatDataset` (a\n * dataset id or display name) renders once per record of that dataset, with\n * `{{item.field}}` tokens in the copied string props replaced by the record's\n * values (unknown fields keep the literal token, like variable bindings).\n *\n * What is copied is the node's {@link repeatScope}:\n *\n * - `children` — its children are the item template. The node stays, and its\n *   child list becomes the copies, record by record. Its own props are not the\n *   template, so no token in them is substituted.\n * - `self` — the node and everything inside it are the template. The copies\n *   take the node's place in its parent's child list, and every prop in the\n *   subtree is substituted, the node's own included.\n *\n * - Copy ids are namespaced `rep__{repeatId}__{index}__…` — the repeat's own\n *   id, then the template node's — so repeats never collide, including inside\n *   grafted reusable components. A self-scoped node's first copy is\n *   `rep__{id}__0__{id}`. Run this AFTER `composeReusableComponentNodes` and\n *   BEFORE binding resolution.\n * - Rows are the node's {@link repeatedRecords}.\n * - The repeat directives ({@link REPEAT_DIRECTIVE_PROPS}) are consumed: every\n *   node this expands, and every copy it makes, comes out without them.\n * - Repeats do not nest. A repeat inside another repeat's template is copied\n *   with its directives consumed, so it renders once in each copy.\n * - An unknown dataset, no matching records, an empty template, or a\n *   self-scoped node its parent does not list (the document root, say) leave\n *   the node rendering once, as written (fail-open: a deleted dataset must\n *   never take a published screen down).\n * - Inputs are never mutated; templates stay in the map unreferenced.\n */\nexport function expandRepeatables<N extends AglynNodeSchema = AglynNodeSchema>(\n  nodes: Record<NodeId, N>,\n  datasetsByKey: Record<string, RepeatableDataset | undefined> | undefined,\n): Record<NodeId, N> {\n  if (!datasetsByKey) return nodes\n  const repeatIds = Object.entries(nodes).filter(\n    ([, node]) => repeatKey(node) !== '',\n  )\n  if (!repeatIds.length) return nodes\n\n  const next: Record<NodeId, N> = { ...nodes }\n  for (const [repeatId, repeated] of repeatIds) {\n    const dataset = datasetsByKey[repeatKey(repeated)]\n    const records = repeatedRecords(repeated, dataset)\n    const self = repeatScope(repeated) === 'self'\n    // The copies' parent: the node itself, or — for a self-scoped node — the\n    // parent whose child list the copies take its place in, read from `next`\n    // so two self-scoped siblings both land in the list the other has left.\n    const parentId = (self ? repeated.parentId : repeatId) as NodeId\n    const siblings = next[parentId]?.nodes\n    const slot = Array.isArray(siblings)\n      ? (siblings as NodeId[]).indexOf(repeatId)\n      : -1\n    const templateIds = self\n      ? [repeatId]\n      : Array.isArray(repeated.nodes)\n        ? (repeated.nodes as NodeId[])\n        : []\n    next[repeatId] = withoutRepeatDirective(next[repeatId])\n    if (!records.length || !templateIds.length || (self && slot < 0)) continue\n\n    const copyIds: NodeId[] = []\n    records.forEach((record, index) => {\n      const prefix = `${REPEAT_NODE_ID_PREFIX}${repeatId}__${index}__`\n      const prefixId = (id: NodeId) => `${prefix}${id}`\n      const cloneSubtree = (id: NodeId, clonedParentId: NodeId) => {\n        const node = nodes[id]\n        if (!node) return\n        const clonedChildren = Array.isArray(node.nodes)\n          ? (node.nodes as NodeId[])\n          : undefined\n        next[prefixId(id)] = withoutRepeatDirective({\n          ...node,\n          $id: prefixId(id),\n          parentId: clonedParentId,\n          props: substituteValue(node.props ?? {}, {\n            record,\n            model: dataset?.model,\n            datasetsByKey,\n          }) as any,\n          ...(clonedChildren && {\n            nodes: clonedChildren.map((childId) => prefixId(childId)),\n          }),\n        })\n        clonedChildren?.forEach((childId) =>\n          cloneSubtree(childId, prefixId(id)),\n        )\n      }\n      for (const templateId of templateIds) {\n        cloneSubtree(templateId, parentId)\n        copyIds.push(prefixId(templateId))\n      }\n    })\n    if (self) {\n      const listed = [...(next[parentId].nodes as NodeId[])]\n      listed.splice(slot, 1, ...copyIds)\n      next[parentId] = { ...next[parentId], nodes: listed }\n    } else {\n      next[repeatId] = { ...next[repeatId], nodes: copyIds }\n    }\n  }\n  return next\n}\n\nexport default expandRepeatables\n"],"names":["applyRepeatQuery","parseRepeatFilter","parseRepeatSort","REPEAT_NODE_ID_PREFIX","ITEM_TOKEN_PATTERN","REPEAT_MAX_RECORDS","displayValue","value","Array","isArray","join","String","resolveReferenceHop","context","fieldId","targetFieldId","field","model","fields","type","reference","datasetId","target","datasetsByKey","keys","record","ids","resolved","map","id","match","records","find","row","filter","length","substituteValue","replace","token","hop","entry","next","key","Object","entries","repeatKey","node","props","repeatDataset","trim","REPEAT_SELF_PROP","REPEAT_DIRECTIVE_PROPS","repeatScope","nodes","self","substituteRecordTokens","withoutRepeatDirective","some","kept","repeatedRecords","dataset","where","orderBy","limit","Number","slice","isFinite","Math","min","hasRepeatableNodes","values","repeatKeys","Set","add","sort","expandRepeatables","repeatIds","repeatId","repeated","parentId","siblings","slot","indexOf","templateIds","copyIds","forEach","index","prefix","prefixId","cloneSubtree","clonedParentId","clonedChildren","undefined","$id","childId","templateId","push","listed","splice"],"mappings":"AAAA;;;;;;;;;;;;;;;CAeC;AAGD,SACEA,gBAAgB,EAChBC,iBAAiB,EACjBC,eAAe,QACV,oBAAgB;AAEvB,yDAAyD,GACzD,OAAO,MAAMC,wBAAwB,QAAO;AAE5C;;;;CAIC,GACD,MAAMC,qBACJ;AAEF,0EAA0E,GAC1E,OAAO,MAAMC,qBAAqB,IAAG;AAqBrC,MAAMC,eAAe,CAACC,QACpBC,MAAMC,OAAO,CAACF,SAASA,MAAMG,IAAI,CAAC,QAAQC,OAAOJ;AAEnD,0EAA0E,GAC1E,SAASK,oBACPC,OAA0B,EAC1BC,OAAe,EACfC,aAAqB;QAEPF,uBAAAA,gBACsBG,kBACrBH;IAFf,MAAMG,SAAQH,iBAAAA,QAAQI,KAAK,sBAAbJ,wBAAAA,eAAeK,MAAM,qBAArBL,qBAAuB,CAACC,QAAQ;IAC9C,IAAIE,CAAAA,yBAAAA,MAAOG,IAAI,MAAK,eAAe,GAACH,mBAAAA,MAAMI,SAAS,qBAAfJ,iBAAiBK,SAAS,GAAE,OAAO;IACvE,MAAMC,UAAST,yBAAAA,QAAQU,aAAa,qBAArBV,sBAAuB,CAACG,MAAMI,SAAS,CAACC,SAAS,CAAC;IACjE,IAAI,CAACC,QAAQ,OAAO;IACpB,MAAME,OAAOX,QAAQY,MAAM,CAACX,QAAQ;IACpC,MAAMY,MAAMlB,MAAMC,OAAO,CAACe,QAAQA,OAAOA,QAAQ,OAAO;QAACA;KAAK,GAAG,EAAE;IACnE,MAAMG,WAAWD,IACdE,GAAG,CAAC,CAACC;QACJ,MAAMC,QAAQR,OAAOS,OAAO,CAACC,IAAI,CAAC,CAACC,MAAQA,GAAG,CAAC,MAAM,KAAKJ;QAC1D,MAAMtB,QAAQuB,yBAAAA,KAAO,CAACf,cAAc;QACpC,OAAOR,SAAS,OAAOD,aAAaC,SAAS;IAC/C,GACC2B,MAAM,CAAC,CAAC3B,QAA2BA,SAAS;IAC/C,OAAOoB,SAASQ,MAAM,GAAGR,SAASjB,IAAI,CAAC,QAAQ;AACjD;AAEA,SAAS0B,gBACP7B,KAAc,EACdM,OAA0B;IAE1B,MAAM,EAAEY,MAAM,EAAE,GAAGZ;IACnB,IAAI,OAAON,UAAU,UAAU;QAC7B,OAAOA,MAAM8B,OAAO,CAClBjC,oBACA,CAACkC,OAAOtB,OAAeuB;YACrB,IAAIA,KAAK;gBACP,MAAMZ,WAAWf,oBAAoBC,SAASG,OAAOuB;gBACrD,OAAOZ,YAAY,OAAOA,WAAWW;YACvC;YACA,OAAOb,MAAM,CAACT,MAAM,IAAI,OAAOV,aAAamB,MAAM,CAACT,MAAM,IAAIsB;QAC/D;IAEJ;IACA,IAAI9B,MAAMC,OAAO,CAACF,QAAQ;QACxB,OAAOA,MAAMqB,GAAG,CAAC,CAACY,QAAUJ,gBAAgBI,OAAO3B;IACrD;IACA,IAAIN,SAAS,OAAOA,UAAU,UAAU;QACtC,MAAMkC,OAAgC,CAAC;QACvC,KAAK,MAAM,CAACC,KAAKF,MAAM,IAAIG,OAAOC,OAAO,CAACrC,OAAQ;YAChDkC,IAAI,CAACC,IAAI,GAAGN,gBAAgBI,OAAO3B;QACrC;QACA,OAAO4B;IACT;IACA,OAAOlC;AACT;AAEA;;;;;;;;CAQC,GACD,OAAO,MAAMsC,YAAY,CAACC;QACZ;IAAZ,MAAMJ,MAAOI,yBAAD,cAAA,AAACA,KAAkDC,KAAK,qBAAxD,YACRC,aAAa;IACjB,OAAO,OAAON,QAAQ,WAAWA,IAAIO,IAAI,KAAK;AAChD,EAAC;AAED;;;;;;;;CAQC,GACD,OAAO,MAAMC,mBAAmB,aAAY;AAE5C;;;;;CAKC,GACD,OAAO,MAAMC,yBAA4C;IACvD;IACA;IACA;IACA;IACAD;CACD,CAAA;AAcD;;;;;;;;;;;;;;;CAeC,GACD,OAAO,SAASE,YAAYN,IAAa;IACvC,MAAM,EAAEC,KAAK,EAAEM,KAAK,EAAE,GAAIP,eAAAA,OAAQ,CAAC;IAInC,uEAAuE;IACvE,oDAAoD;IACpD,MAAMQ,OAAOP,yBAAAA,KAAO,CAACG,iBAAiB;IACtC,IAAII,SAAS,QAAQA,SAAS,QAAQ,OAAO;IAC7C,IAAIA,SAAS,SAASA,SAAS,SAAS,OAAO;IAC/C,OAAO9C,MAAMC,OAAO,CAAC4C,SAAS,aAAa;AAC7C;AAEA;;;;;;;;;;CAUC,GACD,OAAO,SAASE,uBACdR,KAAQ,EACRlC,OAMC;IAED,OAAOuB,gBAAgBW,OAAOlC;AAChC;AAEA,+EAA+E,GAC/E,OAAO,SAAS2C,uBAA0BV,IAAO;IAC/C,MAAMC,QAASD,wBAAD,AAACA,KAA8CC,KAAK;IAClE,IAAI,CAACA,SAAS,CAACI,uBAAuBM,IAAI,CAAC,CAACf,MAAQA,OAAOK,QAAQ;QACjE,OAAOD;IACT;IACA,MAAMY,OAAO,aAAKX;IAClB,KAAK,MAAML,OAAOS,uBAAwB,OAAOO,IAAI,CAAChB,IAAI;IAC1D,OAAO,aAAKI;QAAMC,OAAOW;;AAC3B;AAEA;;;;;;;CAOC,GACD,OAAO,SAASC,gBACdb,IAAa,EACbc,OAAsC;cAMCb,qBACAA;IALvC,MAAMA,gBAAUD,wBAAD,AAACA,KAA8BC,KAAK,mBAAI,CAAC;IAIxD,MAAMc,QAAQ5D,kBAAkBU,QAAOoC,sBAAAA,KAAK,CAAC,eAAe,YAArBA,sBAAyB;IAChE,MAAMe,UAAU5D,gBAAgBS,QAAOoC,oBAAAA,KAAK,CAAC,aAAa,YAAnBA,oBAAuB;IAC9D,MAAMgB,QAAQC,OAAOjB,KAAK,CAAC,cAAc;IACzC,OAAO/C,0BAAiB4D,2BAAAA,QAAS7B,OAAO,oBAAI,EAAE,EAAE,aAC1C8B,QAAQ;QAAEA,OAAO;YAACA;SAAM;IAAC,IAAI,CAAC,GAC9BC,UAAU;QAAEA;IAAQ,IAAI,CAAC,IAC5BG,KAAK,CACN,GACAD,OAAOE,QAAQ,CAACH,UAAUA,QAAQ,IAC9BI,KAAKC,GAAG,CAACL,OAAO1D,sBAChBA;AAER;AAEA;;;;;;;;;;;;CAYC,GACD,OAAO,SAASgE,mBACdhB,KAAiD;IAEjD,IAAI,CAACA,OAAO,OAAO;IACnB,OAAOV,OAAO2B,MAAM,CAACjB,OAAOI,IAAI,CAAC,CAACX,OAASD,UAAUC,UAAU;AACjE;AAEA;;;;;;;;CAQC,GACD,OAAO,SAASyB,WACdlB,KAAiD;IAEjD,MAAM7B,OAAO,IAAIgD;IACjB,KAAK,MAAM1B,QAAQH,OAAO2B,MAAM,CAACjB,gBAAAA,QAAS,CAAC,GAAI;QAC7C,MAAMX,MAAMG,UAAUC;QACtB,IAAIJ,KAAKlB,KAAKiD,GAAG,CAAC/B;IACpB;IACA,OAAO;WAAIlB;KAAK,CAACkD,IAAI;AACvB;AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA8BC,GACD,OAAO,SAASC,kBACdtB,KAAwB,EACxB9B,aAAwE;IAExE,IAAI,CAACA,eAAe,OAAO8B;IAC3B,MAAMuB,YAAYjC,OAAOC,OAAO,CAACS,OAAOnB,MAAM,CAC5C,CAAC,GAAGY,KAAK,GAAKD,UAAUC,UAAU;IAEpC,IAAI,CAAC8B,UAAUzC,MAAM,EAAE,OAAOkB;IAE9B,MAAMZ,OAA0B,aAAKY;IACrC,KAAK,MAAM,CAACwB,UAAUC,SAAS,IAAIF,UAAW;YAQ3BnC;QAPjB,MAAMmB,UAAUrC,aAAa,CAACsB,UAAUiC,UAAU;QAClD,MAAM/C,UAAU4B,gBAAgBmB,UAAUlB;QAC1C,MAAMN,OAAOF,YAAY0B,cAAc;QACvC,yEAAyE;QACzE,yEAAyE;QACzE,wEAAwE;QACxE,MAAMC,WAAYzB,OAAOwB,SAASC,QAAQ,GAAGF;QAC7C,MAAMG,YAAWvC,iBAAAA,IAAI,CAACsC,SAAS,qBAAdtC,eAAgBY,KAAK;QACtC,MAAM4B,OAAOzE,MAAMC,OAAO,CAACuE,YACvB,AAACA,SAAsBE,OAAO,CAACL,YAC/B,CAAC;QACL,MAAMM,cAAc7B,OAChB;YAACuB;SAAS,GACVrE,MAAMC,OAAO,CAACqE,SAASzB,KAAK,IACzByB,SAASzB,KAAK,GACf,EAAE;QACRZ,IAAI,CAACoC,SAAS,GAAGrB,uBAAuBf,IAAI,CAACoC,SAAS;QACtD,IAAI,CAAC9C,QAAQI,MAAM,IAAI,CAACgD,YAAYhD,MAAM,IAAKmB,QAAQ2B,OAAO,GAAI;QAElE,MAAMG,UAAoB,EAAE;QAC5BrD,QAAQsD,OAAO,CAAC,CAAC5D,QAAQ6D;YACvB,MAAMC,SAAS,GAAGpF,wBAAwB0E,SAAS,EAAE,EAAES,MAAM,EAAE,CAAC;YAChE,MAAME,WAAW,CAAC3D,KAAe,GAAG0D,SAAS1D,IAAI;YACjD,MAAM4D,eAAe,CAAC5D,IAAY6D;oBAUP5C;gBATzB,MAAMA,OAAOO,KAAK,CAACxB,GAAG;gBACtB,IAAI,CAACiB,MAAM;gBACX,MAAM6C,iBAAiBnF,MAAMC,OAAO,CAACqC,KAAKO,KAAK,IAC1CP,KAAKO,KAAK,GACXuC;gBACJnD,IAAI,CAAC+C,SAAS3D,IAAI,GAAG2B,uBAAuB,aACvCV;oBACH+C,KAAKL,SAAS3D;oBACdkD,UAAUW;oBACV3C,OAAOX,iBAAgBU,cAAAA,KAAKC,KAAK,YAAVD,cAAc,CAAC,GAAG;wBACvCrB;wBACAR,KAAK,EAAE2C,2BAAAA,QAAS3C,KAAK;wBACrBM;oBACF;mBACIoE,kBAAkB;oBACpBtC,OAAOsC,eAAe/D,GAAG,CAAC,CAACkE,UAAYN,SAASM;gBAClD;gBAEFH,kCAAAA,eAAgBN,OAAO,CAAC,CAACS,UACvBL,aAAaK,SAASN,SAAS3D;YAEnC;YACA,KAAK,MAAMkE,cAAcZ,YAAa;gBACpCM,aAAaM,YAAYhB;gBACzBK,QAAQY,IAAI,CAACR,SAASO;YACxB;QACF;QACA,IAAIzC,MAAM;YACR,MAAM2C,SAAS;mBAAKxD,IAAI,CAACsC,SAAS,CAAC1B,KAAK;aAAc;YACtD4C,OAAOC,MAAM,CAACjB,MAAM,MAAMG;YAC1B3C,IAAI,CAACsC,SAAS,GAAG,aAAKtC,IAAI,CAACsC,SAAS;gBAAE1B,OAAO4C;;QAC/C,OAAO;YACLxD,IAAI,CAACoC,SAAS,GAAG,aAAKpC,IAAI,CAACoC,SAAS;gBAAExB,OAAO+B;;QAC/C;IACF;IACA,OAAO3C;AACT;AAEA,eAAekC,kBAAiB"}

package/src/lib/app-utils/forms.js

@@ -29,7 +29,7 @@
  * Everything that needs Firestore or `node:crypto` lives at the call sites.
  */ import { _ as _extends } from "@swc/helpers/_/_extends";
 import { FORMS_PLUGIN_ID } from "../plugin-manager/enabled-plugins.js";
-import { campaignMembershipValue } from "./campaign-membership.js";
+import { containerMembershipValue } from "./container-membership.js";
 import { submissionMonthKey } from "./form-abuse-ceiling.js";
 import { displayNameSearchFields, nameSearchTokens } from "./name-search.js";
 /**
@@ -168,7 +168,7 @@ export const FORM_FIELD_COMPONENT_ID = 'formField';
  * refuses one. The campaign deletion pass removes an id with `arrayRemove`
  * and restamps `inCampaign` from the form as it then stands.
  */ export function formCampaignFields(selected) {
-    const campaignIds = campaignMembershipValue(Array.isArray(selected) ? selected : []);
+    const campaignIds = containerMembershipValue(Array.isArray(selected) ? selected : []);
     return {
         campaignIds,
         inCampaign: campaignIds.length > 0