@aglyn/plugins-marketing 1.0.0-beta.218 → 1.0.0-beta.219

package/src/lib/components/use-marketing-hub-path.d.ts

@@ -15,10 +15,23 @@
  * limitations under the License.
  */
 /**
- * The Marketing console's URL, re-exported under the name the cards import.
+ * The MARKETING console's URL: under the site being read, or the
+ * organization's own Marketing hub on a page that names no site.
  *
- * One implementation lives beside the Emails hub's in `use-emails-hub-path`;
- * this module is the address the Marketing cards have always imported it
- * from, kept so neither name can drift into a second copy of the rule.
+ * A converted record — a form submission in the Inbox, a contact in
+ * Contacts — links to the campaign it came from, and the surfaces that draw
+ * those records are handed their own hub's `basePath`, not this one's.
+ *
+ * Free, deliberately: the org slug and the subdomain are already in the URL
+ * the console is on, so this reads the route rather than resolving the host
+ * document — the two `getDoc`s that resolution costs would be paid on every
+ * open of a card, to render a link. `null` before the params resolve, so
+ * callers render plain text rather than a link to nowhere.
+ *
+ * Campaigns belong to the organization, so the org-level CRM and the org
+ * Marketing hub itself link a campaign to `/[orgSlug]/marketing/campaigns/{id}`.
  */
-export { useMarketingHubPath, useMarketingHubPath as default } from './use-emails-hub-path';
+export declare function useMarketingHubPath(): string | null;
+/** The organization's own Marketing hub, `/[orgSlug]/marketing`. */
+export declare function orgMarketingHubPath(orgSlug: string): string;
+export default useMarketingHubPath;

package/src/lib/components/use-marketing-hub-path.js

@@ -13,12 +13,42 @@
  * 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.
- */ /**
- * The Marketing console's URL, re-exported under the name the cards import.
+ */ 'use client';
+import { buildRoute, Route } from "@aglyn/aglyn";
+import { useParams } from "next/navigation";
+/**
+ * The MARKETING console's URL: under the site being read, or the
+ * organization's own Marketing hub on a page that names no site.
+ *
+ * A converted record — a form submission in the Inbox, a contact in
+ * Contacts — links to the campaign it came from, and the surfaces that draw
+ * those records are handed their own hub's `basePath`, not this one's.
+ *
+ * Free, deliberately: the org slug and the subdomain are already in the URL
+ * the console is on, so this reads the route rather than resolving the host
+ * document — the two `getDoc`s that resolution costs would be paid on every
+ * open of a card, to render a link. `null` before the params resolve, so
+ * callers render plain text rather than a link to nowhere.
  *
- * One implementation lives beside the Emails hub's in `use-emails-hub-path`;
- * this module is the address the Marketing cards have always imported it
- * from, kept so neither name can drift into a second copy of the rule.
- */ export { useMarketingHubPath, useMarketingHubPath as default } from "./use-emails-hub-path.js";
+ * Campaigns belong to the organization, so the org-level CRM and the org
+ * Marketing hub itself link a campaign to `/[orgSlug]/marketing/campaigns/{id}`.
+ */ export function useMarketingHubPath() {
+    const params = useParams();
+    const orgSlug = params == null ? void 0 : params.orgSlug;
+    if (!orgSlug) return null;
+    return (params == null ? void 0 : params.host) ? buildRoute(Route.HOST_PLUGIN, {
+        orgSlug,
+        host: params.host,
+        pluginSlug: MARKETING_SLUG
+    }) : orgMarketingHubPath(orgSlug);
+}
+/** The Marketing hub's URL slug, under a site and under the org alike. */ const MARKETING_SLUG = 'marketing';
+/** The organization's own Marketing hub, `/[orgSlug]/marketing`. */ export function orgMarketingHubPath(orgSlug) {
+    return buildRoute(Route.ORG_PLUGIN, {
+        orgSlug,
+        pluginSlug: MARKETING_SLUG
+    });
+}
+export default useMarketingHubPath;
 
 //# sourceMappingURL=use-marketing-hub-path.js.map

package/src/lib/components/use-marketing-hub-path.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../../../../../libs/plugins/marketing/src/lib/components/use-marketing-hub-path.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 * The Marketing console's URL, re-exported under the name the cards import.\n *\n * One implementation lives beside the Emails hub's in `use-emails-hub-path`;\n * this module is the address the Marketing cards have always imported it\n * from, kept so neither name can drift into a second copy of the rule.\n */\nexport { useMarketingHubPath, useMarketingHubPath as default } from './use-emails-hub-path'\n"],"names":["useMarketingHubPath","default"],"mappings":"AAAA;;;;;;;;;;;;;;;CAeC,GACD;;;;;;CAMC,GACD,SAASA,mBAAmB,EAAEA,uBAAuBC,OAAO,QAAQ,2BAAuB"}
+{"version":3,"sources":["../../../../../../../libs/plugins/marketing/src/lib/components/use-marketing-hub-path.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'use client'\n\nimport { buildRoute, Route } from '@aglyn/aglyn'\nimport { useParams } from 'next/navigation'\n\n/**\n * The MARKETING console's URL: under the site being read, or the\n * organization's own Marketing hub on a page that names no site.\n *\n * A converted record — a form submission in the Inbox, a contact in\n * Contacts — links to the campaign it came from, and the surfaces that draw\n * those records are handed their own hub's `basePath`, not this one's.\n *\n * Free, deliberately: the org slug and the subdomain are already in the URL\n * the console is on, so this reads the route rather than resolving the host\n * document — the two `getDoc`s that resolution costs would be paid on every\n * open of a card, to render a link. `null` before the params resolve, so\n * callers render plain text rather than a link to nowhere.\n *\n * Campaigns belong to the organization, so the org-level CRM and the org\n * Marketing hub itself link a campaign to `/[orgSlug]/marketing/campaigns/{id}`.\n */\nexport function useMarketingHubPath(): string | null {\n  const params = useParams<{ orgSlug: string; host: string }>()\n  const orgSlug = params?.orgSlug\n  if (!orgSlug) return null\n  return params?.host\n    ? buildRoute(Route.HOST_PLUGIN, {\n        orgSlug,\n        host: params.host,\n        pluginSlug: MARKETING_SLUG,\n      })\n    : orgMarketingHubPath(orgSlug)\n}\n\n/** The Marketing hub's URL slug, under a site and under the org alike. */\nconst MARKETING_SLUG = 'marketing'\n\n/** The organization's own Marketing hub, `/[orgSlug]/marketing`. */\nexport function orgMarketingHubPath(orgSlug: string): string {\n  return buildRoute(Route.ORG_PLUGIN, { orgSlug, pluginSlug: MARKETING_SLUG })\n}\n\nexport default useMarketingHubPath\n"],"names":["buildRoute","Route","useParams","useMarketingHubPath","params","orgSlug","host","HOST_PLUGIN","pluginSlug","MARKETING_SLUG","orgMarketingHubPath","ORG_PLUGIN"],"mappings":"AAAA;;;;;;;;;;;;;;;CAeC,GAED;AAEA,SAASA,UAAU,EAAEC,KAAK,QAAQ,eAAc;AAChD,SAASC,SAAS,QAAQ,kBAAiB;AAE3C;;;;;;;;;;;;;;;;CAgBC,GACD,OAAO,SAASC;IACd,MAAMC,SAASF;IACf,MAAMG,UAAUD,0BAAAA,OAAQC,OAAO;IAC/B,IAAI,CAACA,SAAS,OAAO;IACrB,OAAOD,CAAAA,0BAAAA,OAAQE,IAAI,IACfN,WAAWC,MAAMM,WAAW,EAAE;QAC5BF;QACAC,MAAMF,OAAOE,IAAI;QACjBE,YAAYC;IACd,KACAC,oBAAoBL;AAC1B;AAEA,wEAAwE,GACxE,MAAMI,iBAAiB;AAEvB,kEAAkE,GAClE,OAAO,SAASC,oBAAoBL,OAAe;IACjD,OAAOL,WAAWC,MAAMU,UAAU,EAAE;QAAEN;QAASG,YAAYC;IAAe;AAC5E;AAEA,eAAeN,oBAAmB"}

package/src/lib/model/campaign-send-time.d.ts

@@ -0,0 +1,74 @@
+/**
+ * @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.
+ */
+/**
+ * WHEN A LIST READS ITS MAIL: a suggested send time, taken from the sends that
+ * already went to it.
+ *
+ * A rule and not a guess. Each past send is put in the slot it went out in —
+ * its weekday and hour, in one named time zone — and the slot whose sends were
+ * opened by the largest share of the people they reached is the suggestion.
+ * The share is POOLED across a slot's sends (every unique open over every
+ * delivered message) rather than averaged, so one small send that happened to
+ * be opened by all nine of its recipients does not outrank a slot that reached
+ * thousands.
+ *
+ * Only sends that can be measured are counted: a send with no delivered count
+ * large enough to say anything is left out, and so is one whose opens exceed
+ * its deliveries, which is a record that disagrees with itself. With fewer
+ * measured sends than the minimum there is no suggestion at all — "not enough
+ * history" is an answer a composer can say, and a slot picked from one send is
+ * not.
+ *
+ * Pure, with the reads left to the caller that holds the credentials.
+ */
+/** One past send to the list, as the suggestion needs it. */
+export interface CampaignSendTimeSample {
+    /** When the send went out. */
+    sentAtMs: number;
+    /** Messages the provider delivered. */
+    delivered: number;
+    /** Distinct recipients who opened it. */
+    uniqueOpens: number;
+}
+export interface CampaignSendTimeSuggestion {
+    /** 0 for Sunday through 6 for Saturday, in `timeZone`. */
+    weekday: number;
+    /** 0 to 23, in `timeZone`. */
+    hour: number;
+    /** The IANA zone the slot is stated in. */
+    timeZone: string;
+    /** The pooled unique-open rate of the sends in the slot, 0 to 1. */
+    openRate: number;
+    /** Measured sends that went out in the slot. */
+    sends: number;
+    /** Measured sends the slot was chosen among. */
+    measured: number;
+}
+/** The fewest measured sends a suggestion is taken from. */
+export declare const CAMPAIGN_SEND_TIME_MIN_SENDS = 3;
+/** The fewest delivered messages that make a send measurable. */
+export declare const CAMPAIGN_SEND_TIME_MIN_DELIVERED = 20;
+/**
+ * The slot the list's past sends were opened most in, or `null` when too few
+ * sends can be measured. An unknown time zone is read as UTC, and the answer
+ * says so.
+ */
+export declare function suggestCampaignSendTime(samples: ReadonlyArray<CampaignSendTimeSample>, options?: {
+    timeZone?: string;
+}): CampaignSendTimeSuggestion | null;
+/** The slot as a person reads it: "Tuesdays around 9 AM (UTC)". */
+export declare function campaignSendTimeLabel(suggestion: Pick<CampaignSendTimeSuggestion, 'weekday' | 'hour' | 'timeZone'>): string;

package/src/lib/model/campaign-send-time.js

@@ -0,0 +1,120 @@
+import { _ as _extends } from "@swc/helpers/_/_extends";
+/**
+ * @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 { campaignRate } from "@aglyn/shared-ui-email-campaigns/model/campaign-report";
+/** The fewest measured sends a suggestion is taken from. */ export const CAMPAIGN_SEND_TIME_MIN_SENDS = 3;
+/** The fewest delivered messages that make a send measurable. */ export const CAMPAIGN_SEND_TIME_MIN_DELIVERED = 20;
+const WEEKDAYS = {
+    Sun: 0,
+    Mon: 1,
+    Tue: 2,
+    Wed: 3,
+    Thu: 4,
+    Fri: 5,
+    Sat: 6
+};
+const WEEKDAY_NAMES = [
+    'Sunday',
+    'Monday',
+    'Tuesday',
+    'Wednesday',
+    'Thursday',
+    'Friday',
+    'Saturday'
+];
+function slotFormatter(timeZone) {
+    try {
+        return new Intl.DateTimeFormat('en-US', {
+            timeZone,
+            weekday: 'short',
+            hour: 'numeric',
+            hourCycle: 'h23'
+        });
+    } catch (unused) {
+        return null;
+    }
+}
+/** The weekday and hour an instant falls in, in a zone. */ function slotOf(formatter, atMs) {
+    let weekday;
+    let hour;
+    for (const part of formatter.formatToParts(new Date(atMs))){
+        if (part.type === 'weekday') weekday = WEEKDAYS[part.value];
+        if (part.type === 'hour') hour = Number(part.value) % 24;
+    }
+    return weekday === undefined || hour === undefined || !Number.isFinite(hour) ? null : {
+        weekday,
+        hour
+    };
+}
+/**
+ * The slot the list's past sends were opened most in, or `null` when too few
+ * sends can be measured. An unknown time zone is read as UTC, and the answer
+ * says so.
+ */ export function suggestCampaignSendTime(samples, options = {}) {
+    var _slotFormatter;
+    var _options_timeZone;
+    const requested = ((_options_timeZone = options.timeZone) == null ? void 0 : _options_timeZone.trim()) || 'UTC';
+    const formatter = (_slotFormatter = slotFormatter(requested)) != null ? _slotFormatter : slotFormatter('UTC');
+    const timeZone = slotFormatter(requested) ? requested : 'UTC';
+    if (!formatter) return null;
+    const slots = new Map();
+    let measured = 0;
+    for (const sample of samples){
+        var _slots_get;
+        const delivered = Number(sample.delivered);
+        const opens = Number(sample.uniqueOpens);
+        if (!Number.isFinite(sample.sentAtMs) || sample.sentAtMs <= 0) continue;
+        if (!Number.isFinite(delivered) || delivered < CAMPAIGN_SEND_TIME_MIN_DELIVERED) continue;
+        if (!Number.isFinite(opens) || opens < 0 || opens > delivered) continue;
+        const slot = slotOf(formatter, sample.sentAtMs);
+        if (!slot) continue;
+        measured += 1;
+        const key = `${slot.weekday}:${slot.hour}`;
+        const held = (_slots_get = slots.get(key)) != null ? _slots_get : _extends({}, slot, {
+            delivered: 0,
+            opens: 0,
+            sends: 0
+        });
+        held.delivered += delivered;
+        held.opens += opens;
+        held.sends += 1;
+        slots.set(key, held);
+    }
+    if (measured < CAMPAIGN_SEND_TIME_MIN_SENDS) return null;
+    let best = null;
+    for (const slot of slots.values()){
+        const rate = campaignRate(slot.opens, slot.delivered, 'delivered');
+        if (!rate) continue;
+        const candidate = {
+            weekday: slot.weekday,
+            hour: slot.hour,
+            timeZone,
+            openRate: rate.value,
+            sends: slot.sends,
+            measured
+        };
+        const better = !best || candidate.openRate > best.openRate || candidate.openRate === best.openRate && (candidate.sends > best.sends || candidate.sends === best.sends && candidate.weekday * 24 + candidate.hour < best.weekday * 24 + best.hour);
+        if (better) best = candidate;
+    }
+    return best;
+}
+/** The slot as a person reads it: "Tuesdays around 9 AM (UTC)". */ export function campaignSendTimeLabel(suggestion) {
+    const hour12 = suggestion.hour % 12 === 0 ? 12 : suggestion.hour % 12;
+    const meridiem = suggestion.hour < 12 ? 'AM' : 'PM';
+    return `${WEEKDAY_NAMES[suggestion.weekday]}s around ${hour12} ${meridiem} (${suggestion.timeZone})`;
+}
+
+//# sourceMappingURL=campaign-send-time.js.map

package/src/lib/model/campaign-send-time.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../../../libs/plugins/marketing/src/lib/model/campaign-send-time.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 { campaignRate } from '@aglyn/shared-ui-email-campaigns/model/campaign-report'\n\n/**\n * WHEN A LIST READS ITS MAIL: a suggested send time, taken from the sends that\n * already went to it.\n *\n * A rule and not a guess. Each past send is put in the slot it went out in —\n * its weekday and hour, in one named time zone — and the slot whose sends were\n * opened by the largest share of the people they reached is the suggestion.\n * The share is POOLED across a slot's sends (every unique open over every\n * delivered message) rather than averaged, so one small send that happened to\n * be opened by all nine of its recipients does not outrank a slot that reached\n * thousands.\n *\n * Only sends that can be measured are counted: a send with no delivered count\n * large enough to say anything is left out, and so is one whose opens exceed\n * its deliveries, which is a record that disagrees with itself. With fewer\n * measured sends than the minimum there is no suggestion at all — \"not enough\n * history\" is an answer a composer can say, and a slot picked from one send is\n * not.\n *\n * Pure, with the reads left to the caller that holds the credentials.\n */\n\n/** One past send to the list, as the suggestion needs it. */\nexport interface CampaignSendTimeSample {\n  /** When the send went out. */\n  sentAtMs: number\n  /** Messages the provider delivered. */\n  delivered: number\n  /** Distinct recipients who opened it. */\n  uniqueOpens: number\n}\n\nexport interface CampaignSendTimeSuggestion {\n  /** 0 for Sunday through 6 for Saturday, in `timeZone`. */\n  weekday: number\n  /** 0 to 23, in `timeZone`. */\n  hour: number\n  /** The IANA zone the slot is stated in. */\n  timeZone: string\n  /** The pooled unique-open rate of the sends in the slot, 0 to 1. */\n  openRate: number\n  /** Measured sends that went out in the slot. */\n  sends: number\n  /** Measured sends the slot was chosen among. */\n  measured: number\n}\n\n/** The fewest measured sends a suggestion is taken from. */\nexport const CAMPAIGN_SEND_TIME_MIN_SENDS = 3\n\n/** The fewest delivered messages that make a send measurable. */\nexport const CAMPAIGN_SEND_TIME_MIN_DELIVERED = 20\n\nconst WEEKDAYS: Record<string, number> = {\n  Sun: 0,\n  Mon: 1,\n  Tue: 2,\n  Wed: 3,\n  Thu: 4,\n  Fri: 5,\n  Sat: 6,\n}\n\nconst WEEKDAY_NAMES = [\n  'Sunday',\n  'Monday',\n  'Tuesday',\n  'Wednesday',\n  'Thursday',\n  'Friday',\n  'Saturday',\n]\n\nfunction slotFormatter(timeZone: string): Intl.DateTimeFormat | null {\n  try {\n    return new Intl.DateTimeFormat('en-US', {\n      timeZone,\n      weekday: 'short',\n      hour: 'numeric',\n      hourCycle: 'h23',\n    })\n  } catch {\n    return null\n  }\n}\n\n/** The weekday and hour an instant falls in, in a zone. */\nfunction slotOf(\n  formatter: Intl.DateTimeFormat,\n  atMs: number,\n): { weekday: number; hour: number } | null {\n  let weekday: number | undefined\n  let hour: number | undefined\n  for (const part of formatter.formatToParts(new Date(atMs))) {\n    if (part.type === 'weekday') weekday = WEEKDAYS[part.value]\n    if (part.type === 'hour') hour = Number(part.value) % 24\n  }\n  return weekday === undefined || hour === undefined || !Number.isFinite(hour)\n    ? null\n    : { weekday, hour }\n}\n\n/**\n * The slot the list's past sends were opened most in, or `null` when too few\n * sends can be measured. An unknown time zone is read as UTC, and the answer\n * says so.\n */\nexport function suggestCampaignSendTime(\n  samples: ReadonlyArray<CampaignSendTimeSample>,\n  options: { timeZone?: string } = {},\n): CampaignSendTimeSuggestion | null {\n  const requested = options.timeZone?.trim() || 'UTC'\n  const formatter = slotFormatter(requested) ?? slotFormatter('UTC')\n  const timeZone = slotFormatter(requested) ? requested : 'UTC'\n  if (!formatter) return null\n  const slots = new Map<string, { weekday: number; hour: number; delivered: number; opens: number; sends: number }>()\n  let measured = 0\n  for (const sample of samples) {\n    const delivered = Number(sample.delivered)\n    const opens = Number(sample.uniqueOpens)\n    if (!Number.isFinite(sample.sentAtMs) || sample.sentAtMs <= 0) continue\n    if (!Number.isFinite(delivered) || delivered < CAMPAIGN_SEND_TIME_MIN_DELIVERED) continue\n    if (!Number.isFinite(opens) || opens < 0 || opens > delivered) continue\n    const slot = slotOf(formatter, sample.sentAtMs)\n    if (!slot) continue\n    measured += 1\n    const key = `${slot.weekday}:${slot.hour}`\n    const held = slots.get(key) ?? { ...slot, delivered: 0, opens: 0, sends: 0 }\n    held.delivered += delivered\n    held.opens += opens\n    held.sends += 1\n    slots.set(key, held)\n  }\n  if (measured < CAMPAIGN_SEND_TIME_MIN_SENDS) return null\n  let best: CampaignSendTimeSuggestion | null = null\n  for (const slot of slots.values()) {\n    const rate = campaignRate(slot.opens, slot.delivered, 'delivered')\n    if (!rate) continue\n    const candidate: CampaignSendTimeSuggestion = {\n      weekday: slot.weekday,\n      hour: slot.hour,\n      timeZone,\n      openRate: rate.value,\n      sends: slot.sends,\n      measured,\n    }\n    const better =\n      !best ||\n      candidate.openRate > best.openRate ||\n      (candidate.openRate === best.openRate &&\n        (candidate.sends > best.sends ||\n          (candidate.sends === best.sends &&\n            candidate.weekday * 24 + candidate.hour < best.weekday * 24 + best.hour)))\n    if (better) best = candidate\n  }\n  return best\n}\n\n/** The slot as a person reads it: \"Tuesdays around 9 AM (UTC)\". */\nexport function campaignSendTimeLabel(\n  suggestion: Pick<CampaignSendTimeSuggestion, 'weekday' | 'hour' | 'timeZone'>,\n): string {\n  const hour12 = suggestion.hour % 12 === 0 ? 12 : suggestion.hour % 12\n  const meridiem = suggestion.hour < 12 ? 'AM' : 'PM'\n  return `${WEEKDAY_NAMES[suggestion.weekday]}s around ${hour12} ${meridiem} (${suggestion.timeZone})`\n}\n"],"names":["campaignRate","CAMPAIGN_SEND_TIME_MIN_SENDS","CAMPAIGN_SEND_TIME_MIN_DELIVERED","WEEKDAYS","Sun","Mon","Tue","Wed","Thu","Fri","Sat","WEEKDAY_NAMES","slotFormatter","timeZone","Intl","DateTimeFormat","weekday","hour","hourCycle","slotOf","formatter","atMs","part","formatToParts","Date","type","value","Number","undefined","isFinite","suggestCampaignSendTime","samples","options","requested","trim","slots","Map","measured","sample","delivered","opens","uniqueOpens","sentAtMs","slot","key","held","get","sends","set","best","values","rate","candidate","openRate","better","campaignSendTimeLabel","suggestion","hour12","meridiem"],"mappings":";AAAA;;;;;;;;;;;;;;;CAeC,GAED,SAASA,YAAY,QAAQ,yDAAwD;AAiDrF,0DAA0D,GAC1D,OAAO,MAAMC,+BAA+B,EAAC;AAE7C,+DAA+D,GAC/D,OAAO,MAAMC,mCAAmC,GAAE;AAElD,MAAMC,WAAmC;IACvCC,KAAK;IACLC,KAAK;IACLC,KAAK;IACLC,KAAK;IACLC,KAAK;IACLC,KAAK;IACLC,KAAK;AACP;AAEA,MAAMC,gBAAgB;IACpB;IACA;IACA;IACA;IACA;IACA;IACA;CACD;AAED,SAASC,cAAcC,QAAgB;IACrC,IAAI;QACF,OAAO,IAAIC,KAAKC,cAAc,CAAC,SAAS;YACtCF;YACAG,SAAS;YACTC,MAAM;YACNC,WAAW;QACb;IACF,EAAE,eAAM;QACN,OAAO;IACT;AACF;AAEA,yDAAyD,GACzD,SAASC,OACPC,SAA8B,EAC9BC,IAAY;IAEZ,IAAIL;IACJ,IAAIC;IACJ,KAAK,MAAMK,QAAQF,UAAUG,aAAa,CAAC,IAAIC,KAAKH,OAAQ;QAC1D,IAAIC,KAAKG,IAAI,KAAK,WAAWT,UAAUb,QAAQ,CAACmB,KAAKI,KAAK,CAAC;QAC3D,IAAIJ,KAAKG,IAAI,KAAK,QAAQR,OAAOU,OAAOL,KAAKI,KAAK,IAAI;IACxD;IACA,OAAOV,YAAYY,aAAaX,SAASW,aAAa,CAACD,OAAOE,QAAQ,CAACZ,QACnE,OACA;QAAED;QAASC;IAAK;AACtB;AAEA;;;;CAIC,GACD,OAAO,SAASa,wBACdC,OAA8C,EAC9CC,UAAiC,CAAC,CAAC;QAGjBpB;QADAoB;IAAlB,MAAMC,YAAYD,EAAAA,oBAAAA,QAAQnB,QAAQ,qBAAhBmB,kBAAkBE,IAAI,OAAM;IAC9C,MAAMd,aAAYR,iBAAAA,cAAcqB,sBAAdrB,iBAA4BA,cAAc;IAC5D,MAAMC,WAAWD,cAAcqB,aAAaA,YAAY;IACxD,IAAI,CAACb,WAAW,OAAO;IACvB,MAAMe,QAAQ,IAAIC;IAClB,IAAIC,WAAW;IACf,KAAK,MAAMC,UAAUP,QAAS;YAUfI;QATb,MAAMI,YAAYZ,OAAOW,OAAOC,SAAS;QACzC,MAAMC,QAAQb,OAAOW,OAAOG,WAAW;QACvC,IAAI,CAACd,OAAOE,QAAQ,CAACS,OAAOI,QAAQ,KAAKJ,OAAOI,QAAQ,IAAI,GAAG;QAC/D,IAAI,CAACf,OAAOE,QAAQ,CAACU,cAAcA,YAAYrC,kCAAkC;QACjF,IAAI,CAACyB,OAAOE,QAAQ,CAACW,UAAUA,QAAQ,KAAKA,QAAQD,WAAW;QAC/D,MAAMI,OAAOxB,OAAOC,WAAWkB,OAAOI,QAAQ;QAC9C,IAAI,CAACC,MAAM;QACXN,YAAY;QACZ,MAAMO,MAAM,GAAGD,KAAK3B,OAAO,CAAC,CAAC,EAAE2B,KAAK1B,IAAI,EAAE;QAC1C,MAAM4B,QAAOV,aAAAA,MAAMW,GAAG,CAACF,gBAAVT,aAAkB,aAAKQ;YAAMJ,WAAW;YAAGC,OAAO;YAAGO,OAAO;;QACzEF,KAAKN,SAAS,IAAIA;QAClBM,KAAKL,KAAK,IAAIA;QACdK,KAAKE,KAAK,IAAI;QACdZ,MAAMa,GAAG,CAACJ,KAAKC;IACjB;IACA,IAAIR,WAAWpC,8BAA8B,OAAO;IACpD,IAAIgD,OAA0C;IAC9C,KAAK,MAAMN,QAAQR,MAAMe,MAAM,GAAI;QACjC,MAAMC,OAAOnD,aAAa2C,KAAKH,KAAK,EAAEG,KAAKJ,SAAS,EAAE;QACtD,IAAI,CAACY,MAAM;QACX,MAAMC,YAAwC;YAC5CpC,SAAS2B,KAAK3B,OAAO;YACrBC,MAAM0B,KAAK1B,IAAI;YACfJ;YACAwC,UAAUF,KAAKzB,KAAK;YACpBqB,OAAOJ,KAAKI,KAAK;YACjBV;QACF;QACA,MAAMiB,SACJ,CAACL,QACDG,UAAUC,QAAQ,GAAGJ,KAAKI,QAAQ,IACjCD,UAAUC,QAAQ,KAAKJ,KAAKI,QAAQ,IAClCD,CAAAA,UAAUL,KAAK,GAAGE,KAAKF,KAAK,IAC1BK,UAAUL,KAAK,KAAKE,KAAKF,KAAK,IAC7BK,UAAUpC,OAAO,GAAG,KAAKoC,UAAUnC,IAAI,GAAGgC,KAAKjC,OAAO,GAAG,KAAKiC,KAAKhC,IAAI;QAC/E,IAAIqC,QAAQL,OAAOG;IACrB;IACA,OAAOH;AACT;AAEA,iEAAiE,GACjE,OAAO,SAASM,sBACdC,UAA6E;IAE7E,MAAMC,SAASD,WAAWvC,IAAI,GAAG,OAAO,IAAI,KAAKuC,WAAWvC,IAAI,GAAG;IACnE,MAAMyC,WAAWF,WAAWvC,IAAI,GAAG,KAAK,OAAO;IAC/C,OAAO,GAAGN,aAAa,CAAC6C,WAAWxC,OAAO,CAAC,CAAC,SAAS,EAAEyC,OAAO,CAAC,EAAEC,SAAS,EAAE,EAAEF,WAAW3C,QAAQ,CAAC,CAAC,CAAC;AACtG"}

package/src/lib/model/experiments.js

@@ -81,7 +81,7 @@
         return 'Section experiments need the canvas element id';
     }
     if ((experiment.target === 'screen' || experiment.target === 'section') && !((_experiment_screenId = experiment.screenId) == null ? void 0 : _experiment_screenId.trim())) {
-        return 'Pick the screen under test';
+        return 'Pick the page under test';
     }
     if (experiment.autoWinner) {
         const { minExposures, confidence } = experiment.autoWinner;

package/src/lib/model/experiments.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../../../../../libs/plugins/marketing/src/lib/model/experiments.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 * A/B experiments (AGL-252): docs at `hosts/{hostId}/experiments/{id}`.\n * Assignment is deterministic — hash(visitorId + experimentId) buckets a\n * visitor into a weighted variant, so the same visitor always sees the\n * same variant with no server state. Exposures/conversions accumulate on\n * per-variant stats counters via the track API. Business tier\n * (`abTesting` flag).\n */\nexport type ExperimentStatus = 'draft' | 'running' | 'paused' | 'done'\n\n/** What the experiment varies. */\nexport type ExperimentTarget = 'screen' | 'section' | 'email'\n\nexport interface ExperimentVariant {\n  id: string\n  name?: string\n  /** Relative traffic weight; defaults to 1. */\n  weight?: number\n  /** Screen experiments: the screen version this variant serves. */\n  versionId?: string\n  /** Email experiments (AGL-255): subject/body overrides. */\n  subject?: string\n  body?: string\n}\n\nexport interface HostExperiment {\n  name: string\n  status: ExperimentStatus\n  target: ExperimentTarget\n  /** Screen/section experiments: the screen under test. */\n  screenId?: string\n  /** Section experiments: canvas node id the variants swap. */\n  nodeId?: string\n  variants: ExperimentVariant[]\n  /** Conversion goal: a host/site event, optionally filtered. */\n  goal?: { event: string; filter?: string }\n  /** Set when finished; the renderer then serves only the winner. */\n  winnerVariantId?: string\n  /**\n   * Epoch millis (AGL-273): past this a running experiment stops serving\n   * variants (visitors get the default) until someone declares a winner.\n   */\n  endAtMs?: number\n  /**\n   * Opt-in auto-completion (AGL-273): once every variant has\n   * `minExposures` and a challenger clears `confidence` (0..1) against\n   * the control, the track pipeline promotes it and finishes the\n   * experiment. Control wins when every challenger is confidently worse.\n   */\n  autoWinner?: { minExposures: number; confidence: number }\n  /** Set by the pipeline when `autoWinner` decided the experiment. */\n  autoCompleted?: boolean\n}\n\nexport const EXPERIMENT_MAX_VARIANTS = 4\n\n/** FNV-1a over the visitor+experiment key — stable, dependency-free. */\nfunction bucketHash(value: string): number {\n  let hash = 0x811c9dc5\n  for (let index = 0; index < value.length; index += 1) {\n    hash ^= value.charCodeAt(index)\n    hash = Math.imul(hash, 0x01000193)\n  }\n  return hash >>> 0\n}\n\n/**\n * Deterministic weighted assignment: the same visitor always lands in the\n * same variant of an experiment. Finished experiments return the winner;\n * non-running experiments without a winner return null (serve default).\n */\nexport function assignExperimentVariant(\n  experiment: Pick<\n    HostExperiment,\n    'status' | 'variants' | 'winnerVariantId' | 'endAtMs'\n  > & {\n    $id?: string\n  },\n  experimentId: string,\n  visitorId: string,\n  nowMs: number = Date.now(),\n): ExperimentVariant | null {\n  const variants = (experiment.variants ?? []).slice(\n    0,\n    EXPERIMENT_MAX_VARIANTS,\n  )\n  if (!variants.length) return null\n  if (experiment.winnerVariantId) {\n    return (\n      variants.find((variant) => variant.id === experiment.winnerVariantId) ??\n      null\n    )\n  }\n  if (experiment.status !== 'running') return null\n  // Past the end date (AGL-273) visitors get the default until a winner\n  // is declared — stats stop accruing rather than drifting post-test.\n  if (experiment.endAtMs && nowMs > experiment.endAtMs) return null\n  const totalWeight = variants.reduce(\n    (sum, variant) => sum + Math.max(0, variant.weight ?? 1),\n    0,\n  )\n  if (totalWeight <= 0) return null\n  const bucket = bucketHash(`${visitorId}:${experimentId}`) % totalWeight\n  let cursor = 0\n  for (const variant of variants) {\n    cursor += Math.max(0, variant.weight ?? 1)\n    if (bucket < cursor) return variant\n  }\n  return variants[variants.length - 1]\n}\n\n/** Validates an experiment doc shape; human-readable error or null. */\nexport function validateExperiment(\n  experiment: HostExperiment,\n): string | null {\n  if (!experiment.name?.trim()) return 'Name the experiment'\n  if (!['screen', 'section', 'email'].includes(experiment.target)) {\n    return 'Pick what the experiment tests'\n  }\n  const variants = experiment.variants ?? []\n  if (variants.length < 2) return 'Add at least two variants'\n  if (variants.length > EXPERIMENT_MAX_VARIANTS) {\n    return `Experiments are capped at ${EXPERIMENT_MAX_VARIANTS} variants`\n  }\n  const ids = new Set(variants.map((variant) => variant.id))\n  if (ids.size !== variants.length) return 'Variant ids must be unique'\n  if (experiment.target === 'section' && !experiment.nodeId?.trim()) {\n    return 'Section experiments need the canvas element id'\n  }\n  if (\n    (experiment.target === 'screen' || experiment.target === 'section') &&\n    !experiment.screenId?.trim()\n  ) {\n    return 'Pick the screen under test'\n  }\n  if (experiment.autoWinner) {\n    const { minExposures, confidence } = experiment.autoWinner\n    if (!Number.isFinite(minExposures) || minExposures < 1) {\n      return 'Auto-winner needs a minimum exposure count of at least 1'\n    }\n    if (!Number.isFinite(confidence) || confidence <= 0.5 || confidence >= 1) {\n      return 'Auto-winner confidence must be between 0.5 and 1'\n    }\n  }\n  return null\n}\n\n/** Naive conversion-rate summary the results table renders. */\nexport function summarizeVariantStats(stats: {\n  exposures?: number\n  conversions?: number\n}): { exposures: number; conversions: number; rate: number } {\n  const exposures = Math.max(0, stats.exposures ?? 0)\n  const conversions = Math.max(0, stats.conversions ?? 0)\n  return {\n    exposures,\n    conversions,\n    rate: exposures > 0 ? conversions / exposures : 0,\n  }\n}\n\nexport interface VariantComparison {\n  /** Relative conversion-rate lift vs the control; null when unmeasurable. */\n  lift: number | null\n  /**\n   * One-sided confidence (0..1) that the challenger genuinely beats the\n   * control — a two-proportion z-test through the normal CDF. Null until\n   * both variants have exposures and at least one conversion exists.\n   */\n  confidence: number | null\n}\n\n/** Abramowitz–Stegun erf approximation (max error ~1.5e-7). */\nfunction erf(x: number): number {\n  const sign = x < 0 ? -1 : 1\n  const t = 1 / (1 + 0.3275911 * Math.abs(x))\n  const y =\n    1 -\n    (((((1.061405429 * t - 1.453152027) * t) + 1.421413741) * t -\n      0.284496736) *\n      t +\n      0.254829592) *\n      t *\n      Math.exp(-x * x)\n  return sign * y\n}\n\n/** Standard normal CDF. */\nfunction normalCdf(z: number): number {\n  return 0.5 * (1 + erf(z / Math.SQRT2))\n}\n\n/**\n * Compares a challenger variant against the control (AGL-265): lift =\n * relative rate change; confidence = P(challenger > control) from a\n * pooled two-proportion z-test. Small samples return null confidence\n * rather than a misleading number.\n */\nexport function compareVariants(\n  control: { exposures?: number; conversions?: number },\n  challenger: { exposures?: number; conversions?: number },\n): VariantComparison {\n  const a = summarizeVariantStats(control)\n  const b = summarizeVariantStats(challenger)\n  const lift = a.rate > 0 ? (b.rate - a.rate) / a.rate : null\n  if (\n    a.exposures < 1 ||\n    b.exposures < 1 ||\n    a.conversions + b.conversions < 1\n  ) {\n    return { lift, confidence: null }\n  }\n  const pooled =\n    (a.conversions + b.conversions) / (a.exposures + b.exposures)\n  const standardError = Math.sqrt(\n    pooled * (1 - pooled) * (1 / a.exposures + 1 / b.exposures),\n  )\n  if (!Number.isFinite(standardError) || standardError === 0) {\n    return { lift, confidence: null }\n  }\n  const z = (b.rate - a.rate) / standardError\n  return { lift, confidence: normalCdf(z) }\n}\n\n/** Per-variant counters, keyed by variant id, as `experiments/{id}/stats` holds them. */\nexport type ExperimentStatsByVariant = Record<\n  string,\n  { exposures?: number; conversions?: number } | undefined\n>\n\n/** One variant's line in the results table. */\nexport interface ExperimentResultRow {\n  variant: ExperimentVariant\n  summary: { exposures: number; conversions: number; rate: number }\n  /**\n   * Lift and confidence against the control — the FIRST variant, which is\n   * compared against nothing and so carries `null` here.\n   */\n  comparison: VariantComparison | null\n  /** It has exposures and no variant converts at a higher rate. Ties all lead. */\n  leader: boolean\n  /** The variant the experiment finished on. */\n  winner: boolean\n}\n\n/**\n * The results table's rows, in variant order: each variant's figures, its\n * comparison with the control (AGL-265), and whether it leads or won.\n */\nexport function experimentResultRows(\n  experiment: Pick<HostExperiment, 'variants' | 'winnerVariantId'>,\n  stats: ExperimentStatsByVariant,\n): ExperimentResultRow[] {\n  const variants = experiment.variants ?? []\n  const summaries = variants.map((variant) =>\n    summarizeVariantStats(stats[variant.id] ?? {}),\n  )\n  const control = variants[0]\n  return variants.map((variant, index) => {\n    const summary = summaries[index]\n    return {\n      variant,\n      summary,\n      comparison:\n        index > 0 && control\n          ? compareVariants(stats[control.id] ?? {}, stats[variant.id] ?? {})\n          : null,\n      leader:\n        summary.exposures > 0 &&\n        summaries.every((other) => summary.rate >= other.rate),\n      winner: experiment.winnerVariantId === variant.id,\n    }\n  })\n}\n\n/**\n * A comparison as the results table prints it: `+12% · 97% conf.`, a dash\n * for a lift the control's zero rate cannot express, `needs data` until the\n * z-test has something to test, and `control` for the variant everything is\n * measured against.\n */\nexport function describeVariantComparison(\n  comparison: VariantComparison | null,\n): string {\n  if (!comparison) return 'control'\n  const lift =\n    comparison.lift != null\n      ? `${comparison.lift >= 0 ? '+' : ''}${(comparison.lift * 100).toFixed(0)}%`\n      : '—'\n  const confidence =\n    comparison.confidence != null\n      ? ` · ${(comparison.confidence * 100).toFixed(0)}% conf.`\n      : ' · needs data'\n  return `${lift}${confidence}`\n}\n\n/**\n * Auto-winner evaluation (AGL-273): decides a running experiment from\n * per-variant stats once thresholds are met. The first variant is the\n * control. Undecidable states return null: any arm still under\n * `minExposures`, or no challenger confidently better while some remain\n * in the uncertain middle. Control wins only when every challenger is\n * confidently worse (its win probability is below `1 - confidence`).\n */\nexport function evaluateAutoWinner(\n  experiment: Pick<HostExperiment, 'status' | 'variants' | 'autoWinner'>,\n  statsByVariant: Record<\n    string,\n    { exposures?: number; conversions?: number } | undefined\n  >,\n): { variantId: string; confidence: number } | null {\n  const config = experiment.autoWinner\n  if (!config || experiment.status !== 'running') return null\n  const variants = (experiment.variants ?? []).slice(\n    0,\n    EXPERIMENT_MAX_VARIANTS,\n  )\n  if (variants.length < 2) return null\n  const controlStats = statsByVariant[variants[0].id] ?? {}\n  if ((controlStats.exposures ?? 0) < config.minExposures) return null\n  let best: { variantId: string; confidence: number } | null = null\n  let everyLoses = true\n  for (const challenger of variants.slice(1)) {\n    const challengerStats = statsByVariant[challenger.id] ?? {}\n    if ((challengerStats.exposures ?? 0) < config.minExposures) return null\n    const { confidence } = compareVariants(controlStats, challengerStats)\n    if (confidence === null) return null\n    if (\n      confidence >= config.confidence &&\n      (!best || confidence > best.confidence)\n    ) {\n      best = { variantId: challenger.id, confidence }\n    }\n    if (confidence > 1 - config.confidence) everyLoses = false\n  }\n  if (best) return best\n  if (everyLoses) {\n    return { variantId: variants[0].id, confidence: config.confidence }\n  }\n  return null\n}\n"],"names":["EXPERIMENT_MAX_VARIANTS","bucketHash","value","hash","index","length","charCodeAt","Math","imul","assignExperimentVariant","experiment","experimentId","visitorId","nowMs","Date","now","variants","slice","winnerVariantId","find","variant","id","status","endAtMs","totalWeight","reduce","sum","max","weight","bucket","cursor","validateExperiment","name","trim","includes","target","ids","Set","map","size","nodeId","screenId","autoWinner","minExposures","confidence","Number","isFinite","summarizeVariantStats","stats","exposures","conversions","rate","erf","x","sign","t","abs","y","exp","normalCdf","z","SQRT2","compareVariants","control","challenger","a","b","lift","pooled","standardError","sqrt","experimentResultRows","summaries","summary","comparison","leader","every","other","winner","describeVariantComparison","toFixed","evaluateAutoWinner","statsByVariant","controlStats","config","best","everyLoses","challengerStats","variantId"],"mappings":"AAAA;;;;;;;;;;;;;;;CAeC,GAED;;;;;;;CAOC,GA+CD,OAAO,MAAMA,0BAA0B,EAAC;AAExC,sEAAsE,GACtE,SAASC,WAAWC,KAAa;IAC/B,IAAIC,OAAO;IACX,IAAK,IAAIC,QAAQ,GAAGA,QAAQF,MAAMG,MAAM,EAAED,SAAS,EAAG;QACpDD,QAAQD,MAAMI,UAAU,CAACF;QACzBD,OAAOI,KAAKC,IAAI,CAACL,MAAM;IACzB;IACA,OAAOA,SAAS;AAClB;AAEA;;;;CAIC,GACD,OAAO,SAASM,wBACdC,UAKC,EACDC,YAAoB,EACpBC,SAAiB,EACjBC,QAAgBC,KAAKC,GAAG,EAAE;QAERL;IAAlB,MAAMM,WAAW,EAACN,uBAAAA,WAAWM,QAAQ,YAAnBN,uBAAuB,EAAE,EAAEO,KAAK,CAChD,GACAjB;IAEF,IAAI,CAACgB,SAASX,MAAM,EAAE,OAAO;IAC7B,IAAIK,WAAWQ,eAAe,EAAE;YAE5BF;QADF,QACEA,iBAAAA,SAASG,IAAI,CAAC,CAACC,UAAYA,QAAQC,EAAE,KAAKX,WAAWQ,eAAe,aAApEF,iBACA;IAEJ;IACA,IAAIN,WAAWY,MAAM,KAAK,WAAW,OAAO;IAC5C,sEAAsE;IACtE,oEAAoE;IACpE,IAAIZ,WAAWa,OAAO,IAAIV,QAAQH,WAAWa,OAAO,EAAE,OAAO;IAC7D,MAAMC,cAAcR,SAASS,MAAM,CACjC,CAACC,KAAKN;YAA8BA;eAAlBM,MAAMnB,KAAKoB,GAAG,CAAC,IAAGP,kBAAAA,QAAQQ,MAAM,YAAdR,kBAAkB;OACtD;IAEF,IAAII,eAAe,GAAG,OAAO;IAC7B,MAAMK,SAAS5B,WAAW,GAAGW,UAAU,CAAC,EAAED,cAAc,IAAIa;IAC5D,IAAIM,SAAS;IACb,KAAK,MAAMV,WAAWJ,SAAU;YACRI;QAAtBU,UAAUvB,KAAKoB,GAAG,CAAC,IAAGP,kBAAAA,QAAQQ,MAAM,YAAdR,kBAAkB;QACxC,IAAIS,SAASC,QAAQ,OAAOV;IAC9B;IACA,OAAOJ,QAAQ,CAACA,SAASX,MAAM,GAAG,EAAE;AACtC;AAEA,qEAAqE,GACrE,OAAO,SAAS0B,mBACdrB,UAA0B;QAMTA;QAJZA,kBAWmCA,oBAKrCA;IAhBH,IAAI,GAACA,mBAAAA,WAAWsB,IAAI,qBAAftB,iBAAiBuB,IAAI,KAAI,OAAO;IACrC,IAAI,CAAC;QAAC;QAAU;QAAW;KAAQ,CAACC,QAAQ,CAACxB,WAAWyB,MAAM,GAAG;QAC/D,OAAO;IACT;IACA,MAAMnB,YAAWN,uBAAAA,WAAWM,QAAQ,YAAnBN,uBAAuB,EAAE;IAC1C,IAAIM,SAASX,MAAM,GAAG,GAAG,OAAO;IAChC,IAAIW,SAASX,MAAM,GAAGL,yBAAyB;QAC7C,OAAO,CAAC,0BAA0B,EAAEA,wBAAwB,SAAS,CAAC;IACxE;IACA,MAAMoC,MAAM,IAAIC,IAAIrB,SAASsB,GAAG,CAAC,CAAClB,UAAYA,QAAQC,EAAE;IACxD,IAAIe,IAAIG,IAAI,KAAKvB,SAASX,MAAM,EAAE,OAAO;IACzC,IAAIK,WAAWyB,MAAM,KAAK,aAAa,GAACzB,qBAAAA,WAAW8B,MAAM,qBAAjB9B,mBAAmBuB,IAAI,KAAI;QACjE,OAAO;IACT;IACA,IACE,AAACvB,CAAAA,WAAWyB,MAAM,KAAK,YAAYzB,WAAWyB,MAAM,KAAK,SAAQ,KACjE,GAACzB,uBAAAA,WAAW+B,QAAQ,qBAAnB/B,qBAAqBuB,IAAI,KAC1B;QACA,OAAO;IACT;IACA,IAAIvB,WAAWgC,UAAU,EAAE;QACzB,MAAM,EAAEC,YAAY,EAAEC,UAAU,EAAE,GAAGlC,WAAWgC,UAAU;QAC1D,IAAI,CAACG,OAAOC,QAAQ,CAACH,iBAAiBA,eAAe,GAAG;YACtD,OAAO;QACT;QACA,IAAI,CAACE,OAAOC,QAAQ,CAACF,eAAeA,cAAc,OAAOA,cAAc,GAAG;YACxE,OAAO;QACT;IACF;IACA,OAAO;AACT;AAEA,6DAA6D,GAC7D,OAAO,SAASG,sBAAsBC,KAGrC;QAC+BA,kBACEA;IADhC,MAAMC,YAAY1C,KAAKoB,GAAG,CAAC,IAAGqB,mBAAAA,MAAMC,SAAS,YAAfD,mBAAmB;IACjD,MAAME,cAAc3C,KAAKoB,GAAG,CAAC,IAAGqB,qBAAAA,MAAME,WAAW,YAAjBF,qBAAqB;IACrD,OAAO;QACLC;QACAC;QACAC,MAAMF,YAAY,IAAIC,cAAcD,YAAY;IAClD;AACF;AAaA,6DAA6D,GAC7D,SAASG,IAAIC,CAAS;IACpB,MAAMC,OAAOD,IAAI,IAAI,CAAC,IAAI;IAC1B,MAAME,IAAI,IAAK,CAAA,IAAI,YAAYhD,KAAKiD,GAAG,CAACH,EAAC;IACzC,MAAMI,IACJ,IACA,AAAC,CAAA,AAAC,CAAA,AAAC,CAAA,AAAE,CAAA,cAAcF,IAAI,WAAU,IAAKA,IAAK,WAAU,IAAKA,IACxD,WAAU,IACVA,IACA,WAAU,IACVA,IACAhD,KAAKmD,GAAG,CAAC,CAACL,IAAIA;IAClB,OAAOC,OAAOG;AAChB;AAEA,yBAAyB,GACzB,SAASE,UAAUC,CAAS;IAC1B,OAAO,MAAO,CAAA,IAAIR,IAAIQ,IAAIrD,KAAKsD,KAAK,CAAA;AACtC;AAEA;;;;;CAKC,GACD,OAAO,SAASC,gBACdC,OAAqD,EACrDC,UAAwD;IAExD,MAAMC,IAAIlB,sBAAsBgB;IAChC,MAAMG,IAAInB,sBAAsBiB;IAChC,MAAMG,OAAOF,EAAEd,IAAI,GAAG,IAAI,AAACe,CAAAA,EAAEf,IAAI,GAAGc,EAAEd,IAAI,AAAD,IAAKc,EAAEd,IAAI,GAAG;IACvD,IACEc,EAAEhB,SAAS,GAAG,KACdiB,EAAEjB,SAAS,GAAG,KACdgB,EAAEf,WAAW,GAAGgB,EAAEhB,WAAW,GAAG,GAChC;QACA,OAAO;YAAEiB;YAAMvB,YAAY;QAAK;IAClC;IACA,MAAMwB,SACJ,AAACH,CAAAA,EAAEf,WAAW,GAAGgB,EAAEhB,WAAW,AAAD,IAAMe,CAAAA,EAAEhB,SAAS,GAAGiB,EAAEjB,SAAS,AAAD;IAC7D,MAAMoB,gBAAgB9D,KAAK+D,IAAI,CAC7BF,SAAU,CAAA,IAAIA,MAAK,IAAM,CAAA,IAAIH,EAAEhB,SAAS,GAAG,IAAIiB,EAAEjB,SAAS,AAAD;IAE3D,IAAI,CAACJ,OAAOC,QAAQ,CAACuB,kBAAkBA,kBAAkB,GAAG;QAC1D,OAAO;YAAEF;YAAMvB,YAAY;QAAK;IAClC;IACA,MAAMgB,IAAI,AAACM,CAAAA,EAAEf,IAAI,GAAGc,EAAEd,IAAI,AAAD,IAAKkB;IAC9B,OAAO;QAAEF;QAAMvB,YAAYe,UAAUC;IAAG;AAC1C;AAuBA;;;CAGC,GACD,OAAO,SAASW,qBACd7D,UAAgE,EAChEsC,KAA+B;QAEdtC;IAAjB,MAAMM,YAAWN,uBAAAA,WAAWM,QAAQ,YAAnBN,uBAAuB,EAAE;IAC1C,MAAM8D,YAAYxD,SAASsB,GAAG,CAAC,CAAClB;YACR4B;eAAtBD,uBAAsBC,oBAAAA,KAAK,CAAC5B,QAAQC,EAAE,CAAC,YAAjB2B,oBAAqB,CAAC;;IAE9C,MAAMe,UAAU/C,QAAQ,CAAC,EAAE;IAC3B,OAAOA,SAASsB,GAAG,CAAC,CAAClB,SAAShB;YAOJ4C,mBAAyBA;QANjD,MAAMyB,UAAUD,SAAS,CAACpE,MAAM;QAChC,OAAO;YACLgB;YACAqD;YACAC,YACEtE,QAAQ,KAAK2D,UACTD,iBAAgBd,oBAAAA,KAAK,CAACe,QAAQ1C,EAAE,CAAC,YAAjB2B,oBAAqB,CAAC,IAAGA,oBAAAA,KAAK,CAAC5B,QAAQC,EAAE,CAAC,YAAjB2B,oBAAqB,CAAC,KAC/D;YACN2B,QACEF,QAAQxB,SAAS,GAAG,KACpBuB,UAAUI,KAAK,CAAC,CAACC,QAAUJ,QAAQtB,IAAI,IAAI0B,MAAM1B,IAAI;YACvD2B,QAAQpE,WAAWQ,eAAe,KAAKE,QAAQC,EAAE;QACnD;IACF;AACF;AAEA;;;;;CAKC,GACD,OAAO,SAAS0D,0BACdL,UAAoC;IAEpC,IAAI,CAACA,YAAY,OAAO;IACxB,MAAMP,OACJO,WAAWP,IAAI,IAAI,OACf,GAAGO,WAAWP,IAAI,IAAI,IAAI,MAAM,KAAK,AAACO,CAAAA,WAAWP,IAAI,GAAG,GAAE,EAAGa,OAAO,CAAC,GAAG,CAAC,CAAC,GAC1E;IACN,MAAMpC,aACJ8B,WAAW9B,UAAU,IAAI,OACrB,CAAC,GAAG,EAAE,AAAC8B,CAAAA,WAAW9B,UAAU,GAAG,GAAE,EAAGoC,OAAO,CAAC,GAAG,OAAO,CAAC,GACvD;IACN,OAAO,GAAGb,OAAOvB,YAAY;AAC/B;AAEA;;;;;;;CAOC,GACD,OAAO,SAASqC,mBACdvE,UAAsE,EACtEwE,cAGC;QAIiBxE,sBAKGwE,8BAChBC;IARL,MAAMC,SAAS1E,WAAWgC,UAAU;IACpC,IAAI,CAAC0C,UAAU1E,WAAWY,MAAM,KAAK,WAAW,OAAO;IACvD,MAAMN,WAAW,EAACN,uBAAAA,WAAWM,QAAQ,YAAnBN,uBAAuB,EAAE,EAAEO,KAAK,CAChD,GACAjB;IAEF,IAAIgB,SAASX,MAAM,GAAG,GAAG,OAAO;IAChC,MAAM8E,gBAAeD,+BAAAA,cAAc,CAAClE,QAAQ,CAAC,EAAE,CAACK,EAAE,CAAC,YAA9B6D,+BAAkC,CAAC;IACxD,IAAI,EAACC,0BAAAA,aAAalC,SAAS,YAAtBkC,0BAA0B,KAAKC,OAAOzC,YAAY,EAAE,OAAO;IAChE,IAAI0C,OAAyD;IAC7D,IAAIC,aAAa;IACjB,KAAK,MAAMtB,cAAchD,SAASC,KAAK,CAAC,GAAI;YAClBiE,+BACnBK;QADL,MAAMA,mBAAkBL,gCAAAA,cAAc,CAAClB,WAAW3C,EAAE,CAAC,YAA7B6D,gCAAiC,CAAC;QAC1D,IAAI,EAACK,6BAAAA,gBAAgBtC,SAAS,YAAzBsC,6BAA6B,KAAKH,OAAOzC,YAAY,EAAE,OAAO;QACnE,MAAM,EAAEC,UAAU,EAAE,GAAGkB,gBAAgBqB,cAAcI;QACrD,IAAI3C,eAAe,MAAM,OAAO;QAChC,IACEA,cAAcwC,OAAOxC,UAAU,IAC9B,CAAA,CAACyC,QAAQzC,aAAayC,KAAKzC,UAAU,AAAD,GACrC;YACAyC,OAAO;gBAAEG,WAAWxB,WAAW3C,EAAE;gBAAEuB;YAAW;QAChD;QACA,IAAIA,aAAa,IAAIwC,OAAOxC,UAAU,EAAE0C,aAAa;IACvD;IACA,IAAID,MAAM,OAAOA;IACjB,IAAIC,YAAY;QACd,OAAO;YAAEE,WAAWxE,QAAQ,CAAC,EAAE,CAACK,EAAE;YAAEuB,YAAYwC,OAAOxC,UAAU;QAAC;IACpE;IACA,OAAO;AACT"}
+{"version":3,"sources":["../../../../../../../libs/plugins/marketing/src/lib/model/experiments.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 * A/B experiments (AGL-252): docs at `hosts/{hostId}/experiments/{id}`.\n * Assignment is deterministic — hash(visitorId + experimentId) buckets a\n * visitor into a weighted variant, so the same visitor always sees the\n * same variant with no server state. Exposures/conversions accumulate on\n * per-variant stats counters via the track API. Business tier\n * (`abTesting` flag).\n */\nexport type ExperimentStatus = 'draft' | 'running' | 'paused' | 'done'\n\n/** What the experiment varies. */\nexport type ExperimentTarget = 'screen' | 'section' | 'email'\n\nexport interface ExperimentVariant {\n  id: string\n  name?: string\n  /** Relative traffic weight; defaults to 1. */\n  weight?: number\n  /** Screen experiments: the screen version this variant serves. */\n  versionId?: string\n  /** Email experiments (AGL-255): subject/body overrides. */\n  subject?: string\n  body?: string\n}\n\nexport interface HostExperiment {\n  name: string\n  status: ExperimentStatus\n  target: ExperimentTarget\n  /** Screen/section experiments: the screen under test. */\n  screenId?: string\n  /** Section experiments: canvas node id the variants swap. */\n  nodeId?: string\n  variants: ExperimentVariant[]\n  /** Conversion goal: a host/site event, optionally filtered. */\n  goal?: { event: string; filter?: string }\n  /** Set when finished; the renderer then serves only the winner. */\n  winnerVariantId?: string\n  /**\n   * Epoch millis (AGL-273): past this a running experiment stops serving\n   * variants (visitors get the default) until someone declares a winner.\n   */\n  endAtMs?: number\n  /**\n   * Opt-in auto-completion (AGL-273): once every variant has\n   * `minExposures` and a challenger clears `confidence` (0..1) against\n   * the control, the track pipeline promotes it and finishes the\n   * experiment. Control wins when every challenger is confidently worse.\n   */\n  autoWinner?: { minExposures: number; confidence: number }\n  /** Set by the pipeline when `autoWinner` decided the experiment. */\n  autoCompleted?: boolean\n}\n\nexport const EXPERIMENT_MAX_VARIANTS = 4\n\n/** FNV-1a over the visitor+experiment key — stable, dependency-free. */\nfunction bucketHash(value: string): number {\n  let hash = 0x811c9dc5\n  for (let index = 0; index < value.length; index += 1) {\n    hash ^= value.charCodeAt(index)\n    hash = Math.imul(hash, 0x01000193)\n  }\n  return hash >>> 0\n}\n\n/**\n * Deterministic weighted assignment: the same visitor always lands in the\n * same variant of an experiment. Finished experiments return the winner;\n * non-running experiments without a winner return null (serve default).\n */\nexport function assignExperimentVariant(\n  experiment: Pick<\n    HostExperiment,\n    'status' | 'variants' | 'winnerVariantId' | 'endAtMs'\n  > & {\n    $id?: string\n  },\n  experimentId: string,\n  visitorId: string,\n  nowMs: number = Date.now(),\n): ExperimentVariant | null {\n  const variants = (experiment.variants ?? []).slice(\n    0,\n    EXPERIMENT_MAX_VARIANTS,\n  )\n  if (!variants.length) return null\n  if (experiment.winnerVariantId) {\n    return (\n      variants.find((variant) => variant.id === experiment.winnerVariantId) ??\n      null\n    )\n  }\n  if (experiment.status !== 'running') return null\n  // Past the end date (AGL-273) visitors get the default until a winner\n  // is declared — stats stop accruing rather than drifting post-test.\n  if (experiment.endAtMs && nowMs > experiment.endAtMs) return null\n  const totalWeight = variants.reduce(\n    (sum, variant) => sum + Math.max(0, variant.weight ?? 1),\n    0,\n  )\n  if (totalWeight <= 0) return null\n  const bucket = bucketHash(`${visitorId}:${experimentId}`) % totalWeight\n  let cursor = 0\n  for (const variant of variants) {\n    cursor += Math.max(0, variant.weight ?? 1)\n    if (bucket < cursor) return variant\n  }\n  return variants[variants.length - 1]\n}\n\n/** Validates an experiment doc shape; human-readable error or null. */\nexport function validateExperiment(\n  experiment: HostExperiment,\n): string | null {\n  if (!experiment.name?.trim()) return 'Name the experiment'\n  if (!['screen', 'section', 'email'].includes(experiment.target)) {\n    return 'Pick what the experiment tests'\n  }\n  const variants = experiment.variants ?? []\n  if (variants.length < 2) return 'Add at least two variants'\n  if (variants.length > EXPERIMENT_MAX_VARIANTS) {\n    return `Experiments are capped at ${EXPERIMENT_MAX_VARIANTS} variants`\n  }\n  const ids = new Set(variants.map((variant) => variant.id))\n  if (ids.size !== variants.length) return 'Variant ids must be unique'\n  if (experiment.target === 'section' && !experiment.nodeId?.trim()) {\n    return 'Section experiments need the canvas element id'\n  }\n  if (\n    (experiment.target === 'screen' || experiment.target === 'section') &&\n    !experiment.screenId?.trim()\n  ) {\n    return 'Pick the page under test'\n  }\n  if (experiment.autoWinner) {\n    const { minExposures, confidence } = experiment.autoWinner\n    if (!Number.isFinite(minExposures) || minExposures < 1) {\n      return 'Auto-winner needs a minimum exposure count of at least 1'\n    }\n    if (!Number.isFinite(confidence) || confidence <= 0.5 || confidence >= 1) {\n      return 'Auto-winner confidence must be between 0.5 and 1'\n    }\n  }\n  return null\n}\n\n/** Naive conversion-rate summary the results table renders. */\nexport function summarizeVariantStats(stats: {\n  exposures?: number\n  conversions?: number\n}): { exposures: number; conversions: number; rate: number } {\n  const exposures = Math.max(0, stats.exposures ?? 0)\n  const conversions = Math.max(0, stats.conversions ?? 0)\n  return {\n    exposures,\n    conversions,\n    rate: exposures > 0 ? conversions / exposures : 0,\n  }\n}\n\nexport interface VariantComparison {\n  /** Relative conversion-rate lift vs the control; null when unmeasurable. */\n  lift: number | null\n  /**\n   * One-sided confidence (0..1) that the challenger genuinely beats the\n   * control — a two-proportion z-test through the normal CDF. Null until\n   * both variants have exposures and at least one conversion exists.\n   */\n  confidence: number | null\n}\n\n/** Abramowitz–Stegun erf approximation (max error ~1.5e-7). */\nfunction erf(x: number): number {\n  const sign = x < 0 ? -1 : 1\n  const t = 1 / (1 + 0.3275911 * Math.abs(x))\n  const y =\n    1 -\n    (((((1.061405429 * t - 1.453152027) * t) + 1.421413741) * t -\n      0.284496736) *\n      t +\n      0.254829592) *\n      t *\n      Math.exp(-x * x)\n  return sign * y\n}\n\n/** Standard normal CDF. */\nfunction normalCdf(z: number): number {\n  return 0.5 * (1 + erf(z / Math.SQRT2))\n}\n\n/**\n * Compares a challenger variant against the control (AGL-265): lift =\n * relative rate change; confidence = P(challenger > control) from a\n * pooled two-proportion z-test. Small samples return null confidence\n * rather than a misleading number.\n */\nexport function compareVariants(\n  control: { exposures?: number; conversions?: number },\n  challenger: { exposures?: number; conversions?: number },\n): VariantComparison {\n  const a = summarizeVariantStats(control)\n  const b = summarizeVariantStats(challenger)\n  const lift = a.rate > 0 ? (b.rate - a.rate) / a.rate : null\n  if (\n    a.exposures < 1 ||\n    b.exposures < 1 ||\n    a.conversions + b.conversions < 1\n  ) {\n    return { lift, confidence: null }\n  }\n  const pooled =\n    (a.conversions + b.conversions) / (a.exposures + b.exposures)\n  const standardError = Math.sqrt(\n    pooled * (1 - pooled) * (1 / a.exposures + 1 / b.exposures),\n  )\n  if (!Number.isFinite(standardError) || standardError === 0) {\n    return { lift, confidence: null }\n  }\n  const z = (b.rate - a.rate) / standardError\n  return { lift, confidence: normalCdf(z) }\n}\n\n/** Per-variant counters, keyed by variant id, as `experiments/{id}/stats` holds them. */\nexport type ExperimentStatsByVariant = Record<\n  string,\n  { exposures?: number; conversions?: number } | undefined\n>\n\n/** One variant's line in the results table. */\nexport interface ExperimentResultRow {\n  variant: ExperimentVariant\n  summary: { exposures: number; conversions: number; rate: number }\n  /**\n   * Lift and confidence against the control — the FIRST variant, which is\n   * compared against nothing and so carries `null` here.\n   */\n  comparison: VariantComparison | null\n  /** It has exposures and no variant converts at a higher rate. Ties all lead. */\n  leader: boolean\n  /** The variant the experiment finished on. */\n  winner: boolean\n}\n\n/**\n * The results table's rows, in variant order: each variant's figures, its\n * comparison with the control (AGL-265), and whether it leads or won.\n */\nexport function experimentResultRows(\n  experiment: Pick<HostExperiment, 'variants' | 'winnerVariantId'>,\n  stats: ExperimentStatsByVariant,\n): ExperimentResultRow[] {\n  const variants = experiment.variants ?? []\n  const summaries = variants.map((variant) =>\n    summarizeVariantStats(stats[variant.id] ?? {}),\n  )\n  const control = variants[0]\n  return variants.map((variant, index) => {\n    const summary = summaries[index]\n    return {\n      variant,\n      summary,\n      comparison:\n        index > 0 && control\n          ? compareVariants(stats[control.id] ?? {}, stats[variant.id] ?? {})\n          : null,\n      leader:\n        summary.exposures > 0 &&\n        summaries.every((other) => summary.rate >= other.rate),\n      winner: experiment.winnerVariantId === variant.id,\n    }\n  })\n}\n\n/**\n * A comparison as the results table prints it: `+12% · 97% conf.`, a dash\n * for a lift the control's zero rate cannot express, `needs data` until the\n * z-test has something to test, and `control` for the variant everything is\n * measured against.\n */\nexport function describeVariantComparison(\n  comparison: VariantComparison | null,\n): string {\n  if (!comparison) return 'control'\n  const lift =\n    comparison.lift != null\n      ? `${comparison.lift >= 0 ? '+' : ''}${(comparison.lift * 100).toFixed(0)}%`\n      : '—'\n  const confidence =\n    comparison.confidence != null\n      ? ` · ${(comparison.confidence * 100).toFixed(0)}% conf.`\n      : ' · needs data'\n  return `${lift}${confidence}`\n}\n\n/**\n * Auto-winner evaluation (AGL-273): decides a running experiment from\n * per-variant stats once thresholds are met. The first variant is the\n * control. Undecidable states return null: any arm still under\n * `minExposures`, or no challenger confidently better while some remain\n * in the uncertain middle. Control wins only when every challenger is\n * confidently worse (its win probability is below `1 - confidence`).\n */\nexport function evaluateAutoWinner(\n  experiment: Pick<HostExperiment, 'status' | 'variants' | 'autoWinner'>,\n  statsByVariant: Record<\n    string,\n    { exposures?: number; conversions?: number } | undefined\n  >,\n): { variantId: string; confidence: number } | null {\n  const config = experiment.autoWinner\n  if (!config || experiment.status !== 'running') return null\n  const variants = (experiment.variants ?? []).slice(\n    0,\n    EXPERIMENT_MAX_VARIANTS,\n  )\n  if (variants.length < 2) return null\n  const controlStats = statsByVariant[variants[0].id] ?? {}\n  if ((controlStats.exposures ?? 0) < config.minExposures) return null\n  let best: { variantId: string; confidence: number } | null = null\n  let everyLoses = true\n  for (const challenger of variants.slice(1)) {\n    const challengerStats = statsByVariant[challenger.id] ?? {}\n    if ((challengerStats.exposures ?? 0) < config.minExposures) return null\n    const { confidence } = compareVariants(controlStats, challengerStats)\n    if (confidence === null) return null\n    if (\n      confidence >= config.confidence &&\n      (!best || confidence > best.confidence)\n    ) {\n      best = { variantId: challenger.id, confidence }\n    }\n    if (confidence > 1 - config.confidence) everyLoses = false\n  }\n  if (best) return best\n  if (everyLoses) {\n    return { variantId: variants[0].id, confidence: config.confidence }\n  }\n  return null\n}\n"],"names":["EXPERIMENT_MAX_VARIANTS","bucketHash","value","hash","index","length","charCodeAt","Math","imul","assignExperimentVariant","experiment","experimentId","visitorId","nowMs","Date","now","variants","slice","winnerVariantId","find","variant","id","status","endAtMs","totalWeight","reduce","sum","max","weight","bucket","cursor","validateExperiment","name","trim","includes","target","ids","Set","map","size","nodeId","screenId","autoWinner","minExposures","confidence","Number","isFinite","summarizeVariantStats","stats","exposures","conversions","rate","erf","x","sign","t","abs","y","exp","normalCdf","z","SQRT2","compareVariants","control","challenger","a","b","lift","pooled","standardError","sqrt","experimentResultRows","summaries","summary","comparison","leader","every","other","winner","describeVariantComparison","toFixed","evaluateAutoWinner","statsByVariant","controlStats","config","best","everyLoses","challengerStats","variantId"],"mappings":"AAAA;;;;;;;;;;;;;;;CAeC,GAED;;;;;;;CAOC,GA+CD,OAAO,MAAMA,0BAA0B,EAAC;AAExC,sEAAsE,GACtE,SAASC,WAAWC,KAAa;IAC/B,IAAIC,OAAO;IACX,IAAK,IAAIC,QAAQ,GAAGA,QAAQF,MAAMG,MAAM,EAAED,SAAS,EAAG;QACpDD,QAAQD,MAAMI,UAAU,CAACF;QACzBD,OAAOI,KAAKC,IAAI,CAACL,MAAM;IACzB;IACA,OAAOA,SAAS;AAClB;AAEA;;;;CAIC,GACD,OAAO,SAASM,wBACdC,UAKC,EACDC,YAAoB,EACpBC,SAAiB,EACjBC,QAAgBC,KAAKC,GAAG,EAAE;QAERL;IAAlB,MAAMM,WAAW,EAACN,uBAAAA,WAAWM,QAAQ,YAAnBN,uBAAuB,EAAE,EAAEO,KAAK,CAChD,GACAjB;IAEF,IAAI,CAACgB,SAASX,MAAM,EAAE,OAAO;IAC7B,IAAIK,WAAWQ,eAAe,EAAE;YAE5BF;QADF,QACEA,iBAAAA,SAASG,IAAI,CAAC,CAACC,UAAYA,QAAQC,EAAE,KAAKX,WAAWQ,eAAe,aAApEF,iBACA;IAEJ;IACA,IAAIN,WAAWY,MAAM,KAAK,WAAW,OAAO;IAC5C,sEAAsE;IACtE,oEAAoE;IACpE,IAAIZ,WAAWa,OAAO,IAAIV,QAAQH,WAAWa,OAAO,EAAE,OAAO;IAC7D,MAAMC,cAAcR,SAASS,MAAM,CACjC,CAACC,KAAKN;YAA8BA;eAAlBM,MAAMnB,KAAKoB,GAAG,CAAC,IAAGP,kBAAAA,QAAQQ,MAAM,YAAdR,kBAAkB;OACtD;IAEF,IAAII,eAAe,GAAG,OAAO;IAC7B,MAAMK,SAAS5B,WAAW,GAAGW,UAAU,CAAC,EAAED,cAAc,IAAIa;IAC5D,IAAIM,SAAS;IACb,KAAK,MAAMV,WAAWJ,SAAU;YACRI;QAAtBU,UAAUvB,KAAKoB,GAAG,CAAC,IAAGP,kBAAAA,QAAQQ,MAAM,YAAdR,kBAAkB;QACxC,IAAIS,SAASC,QAAQ,OAAOV;IAC9B;IACA,OAAOJ,QAAQ,CAACA,SAASX,MAAM,GAAG,EAAE;AACtC;AAEA,qEAAqE,GACrE,OAAO,SAAS0B,mBACdrB,UAA0B;QAMTA;QAJZA,kBAWmCA,oBAKrCA;IAhBH,IAAI,GAACA,mBAAAA,WAAWsB,IAAI,qBAAftB,iBAAiBuB,IAAI,KAAI,OAAO;IACrC,IAAI,CAAC;QAAC;QAAU;QAAW;KAAQ,CAACC,QAAQ,CAACxB,WAAWyB,MAAM,GAAG;QAC/D,OAAO;IACT;IACA,MAAMnB,YAAWN,uBAAAA,WAAWM,QAAQ,YAAnBN,uBAAuB,EAAE;IAC1C,IAAIM,SAASX,MAAM,GAAG,GAAG,OAAO;IAChC,IAAIW,SAASX,MAAM,GAAGL,yBAAyB;QAC7C,OAAO,CAAC,0BAA0B,EAAEA,wBAAwB,SAAS,CAAC;IACxE;IACA,MAAMoC,MAAM,IAAIC,IAAIrB,SAASsB,GAAG,CAAC,CAAClB,UAAYA,QAAQC,EAAE;IACxD,IAAIe,IAAIG,IAAI,KAAKvB,SAASX,MAAM,EAAE,OAAO;IACzC,IAAIK,WAAWyB,MAAM,KAAK,aAAa,GAACzB,qBAAAA,WAAW8B,MAAM,qBAAjB9B,mBAAmBuB,IAAI,KAAI;QACjE,OAAO;IACT;IACA,IACE,AAACvB,CAAAA,WAAWyB,MAAM,KAAK,YAAYzB,WAAWyB,MAAM,KAAK,SAAQ,KACjE,GAACzB,uBAAAA,WAAW+B,QAAQ,qBAAnB/B,qBAAqBuB,IAAI,KAC1B;QACA,OAAO;IACT;IACA,IAAIvB,WAAWgC,UAAU,EAAE;QACzB,MAAM,EAAEC,YAAY,EAAEC,UAAU,EAAE,GAAGlC,WAAWgC,UAAU;QAC1D,IAAI,CAACG,OAAOC,QAAQ,CAACH,iBAAiBA,eAAe,GAAG;YACtD,OAAO;QACT;QACA,IAAI,CAACE,OAAOC,QAAQ,CAACF,eAAeA,cAAc,OAAOA,cAAc,GAAG;YACxE,OAAO;QACT;IACF;IACA,OAAO;AACT;AAEA,6DAA6D,GAC7D,OAAO,SAASG,sBAAsBC,KAGrC;QAC+BA,kBACEA;IADhC,MAAMC,YAAY1C,KAAKoB,GAAG,CAAC,IAAGqB,mBAAAA,MAAMC,SAAS,YAAfD,mBAAmB;IACjD,MAAME,cAAc3C,KAAKoB,GAAG,CAAC,IAAGqB,qBAAAA,MAAME,WAAW,YAAjBF,qBAAqB;IACrD,OAAO;QACLC;QACAC;QACAC,MAAMF,YAAY,IAAIC,cAAcD,YAAY;IAClD;AACF;AAaA,6DAA6D,GAC7D,SAASG,IAAIC,CAAS;IACpB,MAAMC,OAAOD,IAAI,IAAI,CAAC,IAAI;IAC1B,MAAME,IAAI,IAAK,CAAA,IAAI,YAAYhD,KAAKiD,GAAG,CAACH,EAAC;IACzC,MAAMI,IACJ,IACA,AAAC,CAAA,AAAC,CAAA,AAAC,CAAA,AAAE,CAAA,cAAcF,IAAI,WAAU,IAAKA,IAAK,WAAU,IAAKA,IACxD,WAAU,IACVA,IACA,WAAU,IACVA,IACAhD,KAAKmD,GAAG,CAAC,CAACL,IAAIA;IAClB,OAAOC,OAAOG;AAChB;AAEA,yBAAyB,GACzB,SAASE,UAAUC,CAAS;IAC1B,OAAO,MAAO,CAAA,IAAIR,IAAIQ,IAAIrD,KAAKsD,KAAK,CAAA;AACtC;AAEA;;;;;CAKC,GACD,OAAO,SAASC,gBACdC,OAAqD,EACrDC,UAAwD;IAExD,MAAMC,IAAIlB,sBAAsBgB;IAChC,MAAMG,IAAInB,sBAAsBiB;IAChC,MAAMG,OAAOF,EAAEd,IAAI,GAAG,IAAI,AAACe,CAAAA,EAAEf,IAAI,GAAGc,EAAEd,IAAI,AAAD,IAAKc,EAAEd,IAAI,GAAG;IACvD,IACEc,EAAEhB,SAAS,GAAG,KACdiB,EAAEjB,SAAS,GAAG,KACdgB,EAAEf,WAAW,GAAGgB,EAAEhB,WAAW,GAAG,GAChC;QACA,OAAO;YAAEiB;YAAMvB,YAAY;QAAK;IAClC;IACA,MAAMwB,SACJ,AAACH,CAAAA,EAAEf,WAAW,GAAGgB,EAAEhB,WAAW,AAAD,IAAMe,CAAAA,EAAEhB,SAAS,GAAGiB,EAAEjB,SAAS,AAAD;IAC7D,MAAMoB,gBAAgB9D,KAAK+D,IAAI,CAC7BF,SAAU,CAAA,IAAIA,MAAK,IAAM,CAAA,IAAIH,EAAEhB,SAAS,GAAG,IAAIiB,EAAEjB,SAAS,AAAD;IAE3D,IAAI,CAACJ,OAAOC,QAAQ,CAACuB,kBAAkBA,kBAAkB,GAAG;QAC1D,OAAO;YAAEF;YAAMvB,YAAY;QAAK;IAClC;IACA,MAAMgB,IAAI,AAACM,CAAAA,EAAEf,IAAI,GAAGc,EAAEd,IAAI,AAAD,IAAKkB;IAC9B,OAAO;QAAEF;QAAMvB,YAAYe,UAAUC;IAAG;AAC1C;AAuBA;;;CAGC,GACD,OAAO,SAASW,qBACd7D,UAAgE,EAChEsC,KAA+B;QAEdtC;IAAjB,MAAMM,YAAWN,uBAAAA,WAAWM,QAAQ,YAAnBN,uBAAuB,EAAE;IAC1C,MAAM8D,YAAYxD,SAASsB,GAAG,CAAC,CAAClB;YACR4B;eAAtBD,uBAAsBC,oBAAAA,KAAK,CAAC5B,QAAQC,EAAE,CAAC,YAAjB2B,oBAAqB,CAAC;;IAE9C,MAAMe,UAAU/C,QAAQ,CAAC,EAAE;IAC3B,OAAOA,SAASsB,GAAG,CAAC,CAAClB,SAAShB;YAOJ4C,mBAAyBA;QANjD,MAAMyB,UAAUD,SAAS,CAACpE,MAAM;QAChC,OAAO;YACLgB;YACAqD;YACAC,YACEtE,QAAQ,KAAK2D,UACTD,iBAAgBd,oBAAAA,KAAK,CAACe,QAAQ1C,EAAE,CAAC,YAAjB2B,oBAAqB,CAAC,IAAGA,oBAAAA,KAAK,CAAC5B,QAAQC,EAAE,CAAC,YAAjB2B,oBAAqB,CAAC,KAC/D;YACN2B,QACEF,QAAQxB,SAAS,GAAG,KACpBuB,UAAUI,KAAK,CAAC,CAACC,QAAUJ,QAAQtB,IAAI,IAAI0B,MAAM1B,IAAI;YACvD2B,QAAQpE,WAAWQ,eAAe,KAAKE,QAAQC,EAAE;QACnD;IACF;AACF;AAEA;;;;;CAKC,GACD,OAAO,SAAS0D,0BACdL,UAAoC;IAEpC,IAAI,CAACA,YAAY,OAAO;IACxB,MAAMP,OACJO,WAAWP,IAAI,IAAI,OACf,GAAGO,WAAWP,IAAI,IAAI,IAAI,MAAM,KAAK,AAACO,CAAAA,WAAWP,IAAI,GAAG,GAAE,EAAGa,OAAO,CAAC,GAAG,CAAC,CAAC,GAC1E;IACN,MAAMpC,aACJ8B,WAAW9B,UAAU,IAAI,OACrB,CAAC,GAAG,EAAE,AAAC8B,CAAAA,WAAW9B,UAAU,GAAG,GAAE,EAAGoC,OAAO,CAAC,GAAG,OAAO,CAAC,GACvD;IACN,OAAO,GAAGb,OAAOvB,YAAY;AAC/B;AAEA;;;;;;;CAOC,GACD,OAAO,SAASqC,mBACdvE,UAAsE,EACtEwE,cAGC;QAIiBxE,sBAKGwE,8BAChBC;IARL,MAAMC,SAAS1E,WAAWgC,UAAU;IACpC,IAAI,CAAC0C,UAAU1E,WAAWY,MAAM,KAAK,WAAW,OAAO;IACvD,MAAMN,WAAW,EAACN,uBAAAA,WAAWM,QAAQ,YAAnBN,uBAAuB,EAAE,EAAEO,KAAK,CAChD,GACAjB;IAEF,IAAIgB,SAASX,MAAM,GAAG,GAAG,OAAO;IAChC,MAAM8E,gBAAeD,+BAAAA,cAAc,CAAClE,QAAQ,CAAC,EAAE,CAACK,EAAE,CAAC,YAA9B6D,+BAAkC,CAAC;IACxD,IAAI,EAACC,0BAAAA,aAAalC,SAAS,YAAtBkC,0BAA0B,KAAKC,OAAOzC,YAAY,EAAE,OAAO;IAChE,IAAI0C,OAAyD;IAC7D,IAAIC,aAAa;IACjB,KAAK,MAAMtB,cAAchD,SAASC,KAAK,CAAC,GAAI;YAClBiE,+BACnBK;QADL,MAAMA,mBAAkBL,gCAAAA,cAAc,CAAClB,WAAW3C,EAAE,CAAC,YAA7B6D,gCAAiC,CAAC;QAC1D,IAAI,EAACK,6BAAAA,gBAAgBtC,SAAS,YAAzBsC,6BAA6B,KAAKH,OAAOzC,YAAY,EAAE,OAAO;QACnE,MAAM,EAAEC,UAAU,EAAE,GAAGkB,gBAAgBqB,cAAcI;QACrD,IAAI3C,eAAe,MAAM,OAAO;QAChC,IACEA,cAAcwC,OAAOxC,UAAU,IAC9B,CAAA,CAACyC,QAAQzC,aAAayC,KAAKzC,UAAU,AAAD,GACrC;YACAyC,OAAO;gBAAEG,WAAWxB,WAAW3C,EAAE;gBAAEuB;YAAW;QAChD;QACA,IAAIA,aAAa,IAAIwC,OAAOxC,UAAU,EAAE0C,aAAa;IACvD;IACA,IAAID,MAAM,OAAOA;IACjB,IAAIC,YAAY;QACd,OAAO;YAAEE,WAAWxE,QAAQ,CAAC,EAAE,CAACK,EAAE;YAAEuB,YAAYwC,OAAOxC,UAAU;QAAC;IACpE;IACA,OAAO;AACT"}

package/src/lib/server/campaign-batch-plan.d.ts

@@ -0,0 +1,73 @@
+/**
+ * @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.
+ */
+/** Why a partly-delivered email will not run another batch. */
+export type CampaignBatchStop = 
+/** Nothing is left to address. */
+'complete'
+/** {@link EMAIL_MAX_SEND_BATCHES} reached. */
+ | 'batch-limit'
+/** The batch settled nobody, so another one would settle nobody either. */
+ | 'no-progress';
+/** What happens to an email after one batch of it has been delivered. */
+export interface CampaignBatchPlan {
+    /** People this email has resolved and not yet addressed. */
+    remaining: number;
+    /** Batches this email has now run, including the one just finished. */
+    batch: number;
+    /** True when another batch will run. */
+    resuming: boolean;
+    /**
+     * Why no further batch will run. Null while {@link resuming} is true —
+     * a reason for a state that has not happened is a reason a surface would
+     * show.
+     */
+    stop: CampaignBatchStop | null;
+}
+export interface CampaignBatchPlanInput {
+    /** People this batch could have addressed, before the per-send cap. */
+    mailable: number;
+    /** People it did address — `min(mailable, perSend)`. */
+    addressed: number;
+    /**
+     * Of those it addressed, how many are left for a later batch to try again:
+     * the tail an hourly deferral cut off, and nothing else. A recipient the
+     * send SETTLED — delivered, suppressed or off-topic — is not retryable and
+     * is not counted here.
+     */
+    retryable: number;
+    /**
+     * People this batch settled: delivered plus permanently excluded. Zero is
+     * what {@link CampaignBatchStop} `no-progress` is, and it is the reason
+     * this is an input rather than a derivation — a batch that addressed 500
+     * people and settled none of them will address the same 500 next time.
+     */
+    settled: number;
+    /** Batches run before this one. */
+    batchesSoFar: number;
+    /** Injectable for tests; defaults to the shipped guard. */
+    maxBatches?: number;
+}
+/**
+ * Whether a partly-delivered email runs again, and how much is left.
+ *
+ * Pure, so the termination rule can be read and tested without a send. The
+ * one property it exists to hold is that a campaign always terminates:
+ * `resuming` is false whenever there is nothing left, whenever the batch
+ * guard is reached, and whenever a batch settled nobody — the last of which
+ * is the only way a self-rescheduling job can loop.
+ */
+export declare function campaignBatchPlan(input: CampaignBatchPlanInput): CampaignBatchPlan;

package/src/lib/server/campaign-batch-plan.js

@@ -0,0 +1,79 @@
+/**
+ * @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 { EMAIL_MAX_SEND_BATCHES } from "@aglyn/shared-util-email";
+/**
+ * Whether a campaign that has delivered one batch runs another.
+ *
+ * A campaign larger than one send's recipient cap goes out in batches: the
+ * sender addresses what it may, and reschedules itself for the rest. This is
+ * the rule that decides whether it does, pure so it can be read and tested
+ * without a send. The one property it exists to hold is that a campaign always
+ * terminates. The ceiling on how many batches any bulk send may take,
+ * {@link EMAIL_MAX_SEND_BATCHES}, is the mail rail's; the rule for this sender
+ * is the campaign's own.
+ */ /** Clamps a raw count to a positive integer, or returns `fallback`. */ function positiveInt(raw, fallback) {
+    const value = Number(raw);
+    return Number.isFinite(value) && value > 0 ? Math.floor(value) : fallback;
+}
+/**
+ * Whether a partly-delivered email runs again, and how much is left.
+ *
+ * Pure, so the termination rule can be read and tested without a send. The
+ * one property it exists to hold is that a campaign always terminates:
+ * `resuming` is false whenever there is nothing left, whenever the batch
+ * guard is reached, and whenever a batch settled nobody — the last of which
+ * is the only way a self-rescheduling job can loop.
+ */ export function campaignBatchPlan(input) {
+    const mailable = positiveInt(input.mailable, 0);
+    const addressed = Math.min(mailable, positiveInt(input.addressed, 0));
+    const retryable = Math.min(addressed, positiveInt(input.retryable, 0));
+    const settled = positiveInt(input.settled, 0);
+    const batch = positiveInt(input.batchesSoFar, 0) + 1;
+    const maxBatches = positiveInt(input.maxBatches, EMAIL_MAX_SEND_BATCHES);
+    const remaining = Math.max(0, mailable - addressed) + retryable;
+    if (remaining <= 0) {
+        return {
+            remaining: 0,
+            batch,
+            resuming: false,
+            stop: 'complete'
+        };
+    }
+    if (batch >= maxBatches) {
+        return {
+            remaining,
+            batch,
+            resuming: false,
+            stop: 'batch-limit'
+        };
+    }
+    if (settled <= 0) {
+        return {
+            remaining,
+            batch,
+            resuming: false,
+            stop: 'no-progress'
+        };
+    }
+    return {
+        remaining,
+        batch,
+        resuming: true,
+        stop: null
+    };
+}
+
+//# sourceMappingURL=campaign-batch-plan.js.map

package/src/lib/server/campaign-batch-plan.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../../../libs/plugins/marketing/src/lib/server/campaign-batch-plan.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 { EMAIL_MAX_SEND_BATCHES } from '@aglyn/shared-util-email'\n\n/**\n * Whether a campaign that has delivered one batch runs another.\n *\n * A campaign larger than one send's recipient cap goes out in batches: the\n * sender addresses what it may, and reschedules itself for the rest. This is\n * the rule that decides whether it does, pure so it can be read and tested\n * without a send. The one property it exists to hold is that a campaign always\n * terminates. The ceiling on how many batches any bulk send may take,\n * {@link EMAIL_MAX_SEND_BATCHES}, is the mail rail's; the rule for this sender\n * is the campaign's own.\n */\n\n/** Clamps a raw count to a positive integer, or returns `fallback`. */\nfunction positiveInt(raw: unknown, fallback: number): number {\n  const value = Number(raw)\n  return Number.isFinite(value) && value > 0 ? Math.floor(value) : fallback\n}\n\n/** Why a partly-delivered email will not run another batch. */\nexport type CampaignBatchStop =\n  /** Nothing is left to address. */\n  | 'complete'\n  /** {@link EMAIL_MAX_SEND_BATCHES} reached. */\n  | 'batch-limit'\n  /** The batch settled nobody, so another one would settle nobody either. */\n  | 'no-progress'\n\n/** What happens to an email after one batch of it has been delivered. */\nexport interface CampaignBatchPlan {\n  /** People this email has resolved and not yet addressed. */\n  remaining: number\n  /** Batches this email has now run, including the one just finished. */\n  batch: number\n  /** True when another batch will run. */\n  resuming: boolean\n  /**\n   * Why no further batch will run. Null while {@link resuming} is true —\n   * a reason for a state that has not happened is a reason a surface would\n   * show.\n   */\n  stop: CampaignBatchStop | null\n}\n\nexport interface CampaignBatchPlanInput {\n  /** People this batch could have addressed, before the per-send cap. */\n  mailable: number\n  /** People it did address — `min(mailable, perSend)`. */\n  addressed: number\n  /**\n   * Of those it addressed, how many are left for a later batch to try again:\n   * the tail an hourly deferral cut off, and nothing else. A recipient the\n   * send SETTLED — delivered, suppressed or off-topic — is not retryable and\n   * is not counted here.\n   */\n  retryable: number\n  /**\n   * People this batch settled: delivered plus permanently excluded. Zero is\n   * what {@link CampaignBatchStop} `no-progress` is, and it is the reason\n   * this is an input rather than a derivation — a batch that addressed 500\n   * people and settled none of them will address the same 500 next time.\n   */\n  settled: number\n  /** Batches run before this one. */\n  batchesSoFar: number\n  /** Injectable for tests; defaults to the shipped guard. */\n  maxBatches?: number\n}\n\n/**\n * Whether a partly-delivered email runs again, and how much is left.\n *\n * Pure, so the termination rule can be read and tested without a send. The\n * one property it exists to hold is that a campaign always terminates:\n * `resuming` is false whenever there is nothing left, whenever the batch\n * guard is reached, and whenever a batch settled nobody — the last of which\n * is the only way a self-rescheduling job can loop.\n */\nexport function campaignBatchPlan(\n  input: CampaignBatchPlanInput,\n): CampaignBatchPlan {\n  const mailable = positiveInt(input.mailable, 0)\n  const addressed = Math.min(mailable, positiveInt(input.addressed, 0))\n  const retryable = Math.min(addressed, positiveInt(input.retryable, 0))\n  const settled = positiveInt(input.settled, 0)\n  const batch = positiveInt(input.batchesSoFar, 0) + 1\n  const maxBatches = positiveInt(input.maxBatches, EMAIL_MAX_SEND_BATCHES)\n  const remaining = Math.max(0, mailable - addressed) + retryable\n\n  if (remaining <= 0) {\n    return { remaining: 0, batch, resuming: false, stop: 'complete' }\n  }\n  if (batch >= maxBatches) {\n    return { remaining, batch, resuming: false, stop: 'batch-limit' }\n  }\n  if (settled <= 0) {\n    return { remaining, batch, resuming: false, stop: 'no-progress' }\n  }\n  return { remaining, batch, resuming: true, stop: null }\n}\n"],"names":["EMAIL_MAX_SEND_BATCHES","positiveInt","raw","fallback","value","Number","isFinite","Math","floor","campaignBatchPlan","input","mailable","addressed","min","retryable","settled","batch","batchesSoFar","maxBatches","remaining","max","resuming","stop"],"mappings":"AAAA;;;;;;;;;;;;;;;CAeC,GAED,SAASA,sBAAsB,QAAQ,2BAA0B;AAEjE;;;;;;;;;;CAUC,GAED,qEAAqE,GACrE,SAASC,YAAYC,GAAY,EAAEC,QAAgB;IACjD,MAAMC,QAAQC,OAAOH;IACrB,OAAOG,OAAOC,QAAQ,CAACF,UAAUA,QAAQ,IAAIG,KAAKC,KAAK,CAACJ,SAASD;AACnE;AAoDA;;;;;;;;CAQC,GACD,OAAO,SAASM,kBACdC,KAA6B;IAE7B,MAAMC,WAAWV,YAAYS,MAAMC,QAAQ,EAAE;IAC7C,MAAMC,YAAYL,KAAKM,GAAG,CAACF,UAAUV,YAAYS,MAAME,SAAS,EAAE;IAClE,MAAME,YAAYP,KAAKM,GAAG,CAACD,WAAWX,YAAYS,MAAMI,SAAS,EAAE;IACnE,MAAMC,UAAUd,YAAYS,MAAMK,OAAO,EAAE;IAC3C,MAAMC,QAAQf,YAAYS,MAAMO,YAAY,EAAE,KAAK;IACnD,MAAMC,aAAajB,YAAYS,MAAMQ,UAAU,EAAElB;IACjD,MAAMmB,YAAYZ,KAAKa,GAAG,CAAC,GAAGT,WAAWC,aAAaE;IAEtD,IAAIK,aAAa,GAAG;QAClB,OAAO;YAAEA,WAAW;YAAGH;YAAOK,UAAU;YAAOC,MAAM;QAAW;IAClE;IACA,IAAIN,SAASE,YAAY;QACvB,OAAO;YAAEC;YAAWH;YAAOK,UAAU;YAAOC,MAAM;QAAc;IAClE;IACA,IAAIP,WAAW,GAAG;QAChB,OAAO;YAAEI;YAAWH;YAAOK,UAAU;YAAOC,MAAM;QAAc;IAClE;IACA,OAAO;QAAEH;QAAWH;QAAOK,UAAU;QAAMC,MAAM;IAAK;AACxD"}