@rudra-js/core 0.1.0

package/dist/signal-digest.js

@@ -0,0 +1,224 @@
+/**
+ * How much of each signal category survives into the digest. Chosen to keep the
+ * per-shopper part of a prompt in the low hundreds of tokens.
+ */
+export const DIGEST_LIMITS = {
+    liked: 12,
+    disliked: 12,
+    purchased: 8,
+    cart: 8,
+    viewed: 10,
+    searches: 5,
+    affinity: 6,
+    interactionTypes: 8,
+};
+/**
+ * How much intent each kind of signal implies. A purchase says more about a
+ * shopper than a view; an explicit dislike says the most, and says it in the
+ * opposite direction.
+ */
+const SIGNAL_WEIGHTS = {
+    purchase: 5,
+    like: 4,
+    cart: 3,
+    view: 1,
+    dislike: -6,
+};
+/**
+ * A signal that does not state a weight counts at full strength. This lives in
+ * one place on purpose: when the default was written out at each call site, the
+ * merge step defaulted to 0 while scoring defaulted to 1, and an unweighted view
+ * merged with a `weight: 0.2` view scored as though both were 0.2.
+ */
+const effectiveWeight = (signal) => signal.weight ?? 1;
+/** Most recent first. A signal with no timestamp sorts last. */
+function byMostRecent(left, right) {
+    return (right.at ?? 0) - (left.at ?? 0);
+}
+/** The most recent `limit` SKUs, each appearing once. */
+function recentUniqueSkus(signals, limit) {
+    const skus = [];
+    const alreadySeen = new Set();
+    for (const signal of signals.toSorted(byMostRecent)) {
+        if (alreadySeen.has(signal.sku))
+            continue;
+        alreadySeen.add(signal.sku);
+        skus.push(signal.sku);
+        if (skus.length >= limit)
+            break;
+    }
+    return skus;
+}
+/**
+ * A signal may name its own category; otherwise we look the SKU up in the
+ * candidate set. A signal for a product that is not a candidate today and
+ * carries no category simply contributes nothing.
+ */
+function categoryOf(signal, candidatesBySku) {
+    return signal.category ?? candidatesBySku.get(signal.sku)?.category;
+}
+function computeCategoryAffinity(input, candidatesBySku) {
+    const scoreByCategory = new Map();
+    const addScore = (category, score) => {
+        if (!category)
+            return;
+        scoreByCategory.set(category, (scoreByCategory.get(category) ?? 0) + score);
+    };
+    const { signals } = input;
+    for (const purchase of signals.lastPurchased) {
+        addScore(categoryOf(purchase, candidatesBySku), SIGNAL_WEIGHTS.purchase * effectiveWeight(purchase));
+    }
+    for (const like of signals.likes) {
+        addScore(categoryOf(like, candidatesBySku), SIGNAL_WEIGHTS.like * effectiveWeight(like));
+    }
+    for (const inCart of signals.cart) {
+        addScore(categoryOf(inCart, candidatesBySku), SIGNAL_WEIGHTS.cart * effectiveWeight(inCart));
+    }
+    // Merged first, deliberately — see `mergeViewsBySku`. Views are noisy and
+    // repeat cheaply, so the tenth view counts for far less than the second, and
+    // log scaling keeps a single obsessive session from drowning out a purchase.
+    for (const view of mergeViewsBySku(signals.mostViewed)) {
+        const scaledViews = Math.log2(1 + view.views);
+        addScore(categoryOf(view, candidatesBySku), SIGNAL_WEIGHTS.view * scaledViews * view.weight);
+    }
+    for (const dislike of signals.dislikes) {
+        addScore(categoryOf(dislike, candidatesBySku), SIGNAL_WEIGHTS.dislike * effectiveWeight(dislike));
+    }
+    // The category the shopper is standing in right now is itself evidence.
+    addScore(input.context.currentCategory, SIGNAL_WEIGHTS.like);
+    return [...scoreByCategory.entries()]
+        .map(([category, score]) => ({
+        category,
+        score: Math.round(score * 100) / 100,
+    }))
+        .filter((affinity) => affinity.score > 0)
+        .toSorted((left, right) => right.score - left.score)
+        .slice(0, DIGEST_LIMITS.affinity);
+}
+/**
+ * Collapses every view record for one SKU into a single running total.
+ *
+ * This has to happen before any scoring. A host is free to emit one record per
+ * page view rather than a running count, and scoring each record separately
+ * would let thirty `views: 1` records outweigh one `views: 30` record six times
+ * over, defeating the sub-linear scaling in `computeCategoryAffinity` entirely.
+ * Merging first makes the score depend on how much someone looked, not on how
+ * their tracking pipeline happens to batch.
+ *
+ * Where records disagree on `weight`, the strongest wins.
+ */
+function mergeViewsBySku(views) {
+    const totalsBySku = new Map();
+    for (const view of views) {
+        const running = totalsBySku.get(view.sku);
+        if (running) {
+            running.views += view.views;
+            if (view.dwellMs !== undefined)
+                running.dwellMs = (running.dwellMs ?? 0) + view.dwellMs;
+            if (view.category !== undefined)
+                running.category ??= view.category;
+            running.weight = Math.max(running.weight, effectiveWeight(view));
+            continue;
+        }
+        totalsBySku.set(view.sku, {
+            sku: view.sku,
+            views: view.views,
+            ...(view.dwellMs !== undefined ? { dwellMs: view.dwellMs } : {}),
+            ...(view.category !== undefined ? { category: view.category } : {}),
+            weight: effectiveWeight(view),
+        });
+    }
+    return [...totalsBySku.values()];
+}
+/** The most-viewed few, as the digest reports them. */
+function mostViewedProducts(views) {
+    return mergeViewsBySku(views)
+        .toSorted((left, right) => right.views - left.views)
+        .slice(0, DIGEST_LIMITS.viewed)
+        .map(({ sku, views: viewCount, dwellMs }) => ({
+        sku,
+        views: viewCount,
+        ...(dwellMs !== undefined ? { dwellMs } : {}),
+    }));
+}
+/** The open-vocabulary long tail, reduced to "which kinds, and how often". */
+function countByInteractionType(interactions) {
+    const countByType = new Map();
+    for (const interaction of interactions) {
+        countByType.set(interaction.type, (countByType.get(interaction.type) ?? 0) + 1);
+    }
+    return [...countByType.entries()]
+        .map(([type, count]) => ({ type, count }))
+        .toSorted((left, right) => right.count - left.count)
+        .slice(0, DIGEST_LIMITS.interactionTypes);
+}
+function recentPurchasedSkus(purchases) {
+    return recentUniqueSkus(purchases, DIGEST_LIMITS.purchased);
+}
+export function buildDigest(input) {
+    const candidatesBySku = new Map(input.candidates.map((product) => [product.sku, product]));
+    const { signals, context, user } = input;
+    const likedSkus = recentUniqueSkus(signals.likes, DIGEST_LIMITS.liked);
+    const dislikedSkus = recentUniqueSkus(signals.dislikes, DIGEST_LIMITS.disliked);
+    const purchasedSkus = recentPurchasedSkus(signals.lastPurchased);
+    const cartSkus = recentUniqueSkus(signals.cart, DIGEST_LIMITS.cart);
+    const topViewed = mostViewedProducts(signals.mostViewed);
+    // Searches say what a shopper wants; they do not say they engaged with any
+    // product, so they do not lift a shopper out of cold start on their own.
+    const evidenceCount = likedSkus.length +
+        dislikedSkus.length +
+        purchasedSkus.length +
+        cartSkus.length +
+        topViewed.length;
+    return {
+        userId: user.id,
+        ...(user.segment !== undefined ? { segment: user.segment } : {}),
+        isReturning: user.isReturning ?? purchasedSkus.length > 0,
+        surface: context.surface,
+        slot: context.slot,
+        locale: context.locale,
+        maxItems: context.maxItems,
+        ...(context.currentSku !== undefined ? { currentSku: context.currentSku } : {}),
+        ...(context.currentCategory !== undefined ? { currentCategory: context.currentCategory } : {}),
+        ...(context.searchQuery !== undefined ? { searchQuery: context.searchQuery } : {}),
+        likedSkus,
+        dislikedSkus,
+        purchasedSkus,
+        cartSkus,
+        topViewed,
+        recentSearches: signals.recentSearches.slice(0, DIGEST_LIMITS.searches),
+        categoryAffinity: computeCategoryAffinity(input, candidatesBySku),
+        interactionCounts: countByInteractionType(signals.interactions),
+        isColdStart: evidenceCount === 0,
+    };
+}
+// Everything the cohort key leaves out has to leave the prompt too, or the
+// first shopper's searches and history end up shaping copy that is cached and
+// served to everyone else in their cohort.
+export function toCohortDigest(digest) {
+    const top = digest.categoryAffinity[0];
+    // Listed rather than spread, so what survives is the thing you read.
+    const cohort = {
+        userId: 'cohort',
+        isReturning: false,
+        surface: digest.surface,
+        slot: digest.slot,
+        locale: digest.locale,
+        maxItems: digest.maxItems,
+        likedSkus: [],
+        dislikedSkus: [],
+        purchasedSkus: [],
+        cartSkus: [],
+        topViewed: [],
+        recentSearches: [],
+        categoryAffinity: top ? [{ category: top.category, score: 0 }] : [],
+        interactionCounts: [],
+        isColdStart: digest.isColdStart,
+    };
+    if (digest.segment !== undefined)
+        cohort.segment = digest.segment;
+    if (digest.currentCategory !== undefined)
+        cohort.currentCategory = digest.currentCategory;
+    return cohort;
+}
+//# sourceMappingURL=signal-digest.js.map

package/dist/signal-digest.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"signal-digest.js","sourceRoot":"","sources":["../src/signal-digest.ts"],"names":[],"mappings":"AAiEA;;;GAGG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG;IAC3B,KAAK,EAAE,EAAE;IACT,QAAQ,EAAE,EAAE;IACZ,SAAS,EAAE,CAAC;IACZ,IAAI,EAAE,CAAC;IACP,MAAM,EAAE,EAAE;IACV,QAAQ,EAAE,CAAC;IACX,QAAQ,EAAE,CAAC;IACX,gBAAgB,EAAE,CAAC;CACX,CAAC;AAEX;;;;GAIG;AACH,MAAM,cAAc,GAAG;IACrB,QAAQ,EAAE,CAAC;IACX,IAAI,EAAE,CAAC;IACP,IAAI,EAAE,CAAC;IACP,IAAI,EAAE,CAAC;IACP,OAAO,EAAE,CAAC,CAAC;CACH,CAAC;AAEX;;;;;GAKG;AACH,MAAM,eAAe,GAAG,CAAC,MAAuC,EAAU,EAAE,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC;AAEhG,gEAAgE;AAChE,SAAS,YAAY,CACnB,IAAiC,EACjC,KAAkC;IAElC,OAAO,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAC1C,CAAC;AAED,yDAAyD;AACzD,SAAS,gBAAgB,CAAC,OAAoB,EAAE,KAAa;IAC3D,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IAEtC,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC,EAAE,CAAC;QACpD,IAAI,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC;YAAE,SAAS;QAC1C,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACtB,IAAI,IAAI,CAAC,MAAM,IAAI,KAAK;YAAE,MAAM;IAClC,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,SAAS,UAAU,CACjB,MAAsD,EACtD,eAAqC;IAErC,OAAO,MAAM,CAAC,QAAQ,IAAI,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC;AACtE,CAAC;AAED,SAAS,uBAAuB,CAC9B,KAAoB,EACpB,eAAqC;IAErC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAkB,CAAC;IAElD,MAAM,QAAQ,GAAG,CAAC,QAA4B,EAAE,KAAa,EAAQ,EAAE;QACrE,IAAI,CAAC,QAAQ;YAAE,OAAO;QACtB,eAAe,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;IAC9E,CAAC,CAAC;IAEF,MAAM,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC;IAE1B,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,aAAa,EAAE,CAAC;QAC7C,QAAQ,CACN,UAAU,CAAC,QAAQ,EAAE,eAAe,CAAC,EACrC,cAAc,CAAC,QAAQ,GAAG,eAAe,CAAC,QAAQ,CAAC,CACpD,CAAC;IACJ,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;QACjC,QAAQ,CAAC,UAAU,CAAC,IAAI,EAAE,eAAe,CAAC,EAAE,cAAc,CAAC,IAAI,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;IAC3F,CAAC;IACD,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC;QAClC,QAAQ,CAAC,UAAU,CAAC,MAAM,EAAE,eAAe,CAAC,EAAE,cAAc,CAAC,IAAI,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC;IAC/F,CAAC;IACD,0EAA0E;IAC1E,6EAA6E;IAC7E,6EAA6E;IAC7E,KAAK,MAAM,IAAI,IAAI,eAAe,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;QACvD,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9C,QAAQ,CAAC,UAAU,CAAC,IAAI,EAAE,eAAe,CAAC,EAAE,cAAc,CAAC,IAAI,GAAG,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;IAC/F,CAAC;IACD,KAAK,MAAM,OAAO,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;QACvC,QAAQ,CACN,UAAU,CAAC,OAAO,EAAE,eAAe,CAAC,EACpC,cAAc,CAAC,OAAO,GAAG,eAAe,CAAC,OAAO,CAAC,CAClD,CAAC;IACJ,CAAC;IAED,wEAAwE;IACxE,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,eAAe,EAAE,cAAc,CAAC,IAAI,CAAC,CAAC;IAE7D,OAAO,CAAC,GAAG,eAAe,CAAC,OAAO,EAAE,CAAC;SAClC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;QAC3B,QAAQ;QACR,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,GAAG;KACrC,CAAC,CAAC;SACF,MAAM,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC;SACxC,QAAQ,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;SACnD,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC,QAAQ,CAAC,CAAC;AACtC,CAAC;AAQD;;;;;;;;;;;GAWG;AACH,SAAS,eAAe,CAAC,KAAmB;IAC1C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAsB,CAAC;IAElD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC1C,IAAI,OAAO,EAAE,CAAC;YACZ,OAAO,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC;YAC5B,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS;gBAAE,OAAO,CAAC,OAAO,GAAG,CAAC,OAAO,CAAC,OAAO,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC;YACxF,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS;gBAAE,OAAO,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ,CAAC;YACpE,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;YACjE,SAAS;QACX,CAAC;QACD,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE;YACxB,GAAG,EAAE,IAAI,CAAC,GAAG;YACb,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,GAAG,CAAC,IAAI,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAChE,GAAG,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACnE,MAAM,EAAE,eAAe,CAAC,IAAI,CAAC;SAC9B,CAAC,CAAC;IACL,CAAC;IAED,OAAO,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;AACnC,CAAC;AAED,uDAAuD;AACvD,SAAS,kBAAkB,CAAC,KAAmB;IAC7C,OAAO,eAAe,CAAC,KAAK,CAAC;SAC1B,QAAQ,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;SACnD,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC,MAAM,CAAC;SAC9B,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;QAC5C,GAAG;QACH,KAAK,EAAE,SAAS;QAChB,GAAG,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC9C,CAAC,CAAC,CAAC;AACR,CAAC;AAED,8EAA8E;AAC9E,SAAS,sBAAsB,CAAC,YAA2B;IACzD,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE9C,KAAK,MAAM,WAAW,IAAI,YAAY,EAAE,CAAC;QACvC,WAAW,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAClF,CAAC;IAED,OAAO,CAAC,GAAG,WAAW,CAAC,OAAO,EAAE,CAAC;SAC9B,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;SACzC,QAAQ,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;SACnD,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC,gBAAgB,CAAC,CAAC;AAC9C,CAAC;AAED,SAAS,mBAAmB,CAAC,SAA2B;IACtD,OAAO,gBAAgB,CAAC,SAAS,EAAE,aAAa,CAAC,SAAS,CAAC,CAAC;AAC9D,CAAC;AAED,MAAM,UAAU,WAAW,CAAC,KAAoB;IAC9C,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;IAC3F,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC;IAEzC,MAAM,SAAS,GAAG,gBAAgB,CAAC,OAAO,CAAC,KAAK,EAAE,aAAa,CAAC,KAAK,CAAC,CAAC;IACvE,MAAM,YAAY,GAAG,gBAAgB,CAAC,OAAO,CAAC,QAAQ,EAAE,aAAa,CAAC,QAAQ,CAAC,CAAC;IAChF,MAAM,aAAa,GAAG,mBAAmB,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;IACjE,MAAM,QAAQ,GAAG,gBAAgB,CAAC,OAAO,CAAC,IAAI,EAAE,aAAa,CAAC,IAAI,CAAC,CAAC;IACpE,MAAM,SAAS,GAAG,kBAAkB,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;IAEzD,2EAA2E;IAC3E,yEAAyE;IACzE,MAAM,aAAa,GACjB,SAAS,CAAC,MAAM;QAChB,YAAY,CAAC,MAAM;QACnB,aAAa,CAAC,MAAM;QACpB,QAAQ,CAAC,MAAM;QACf,SAAS,CAAC,MAAM,CAAC;IAEnB,OAAO;QACL,MAAM,EAAE,IAAI,CAAC,EAAE;QACf,GAAG,CAAC,IAAI,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAChE,WAAW,EAAE,IAAI,CAAC,WAAW,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC;QAEzD,OAAO,EAAE,OAAO,CAAC,OAAO;QACxB,IAAI,EAAE,OAAO,CAAC,IAAI;QAClB,MAAM,EAAE,OAAO,CAAC,MAAM;QACtB,QAAQ,EAAE,OAAO,CAAC,QAAQ;QAC1B,GAAG,CAAC,OAAO,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC/E,GAAG,CAAC,OAAO,CAAC,eAAe,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,eAAe,EAAE,OAAO,CAAC,eAAe,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9F,GAAG,CAAC,OAAO,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAElF,SAAS;QACT,YAAY;QACZ,aAAa;QACb,QAAQ;QACR,SAAS;QACT,cAAc,EAAE,OAAO,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC,QAAQ,CAAC;QACvE,gBAAgB,EAAE,uBAAuB,CAAC,KAAK,EAAE,eAAe,CAAC;QACjE,iBAAiB,EAAE,sBAAsB,CAAC,OAAO,CAAC,YAAY,CAAC;QAE/D,WAAW,EAAE,aAAa,KAAK,CAAC;KACjC,CAAC;AACJ,CAAC;AAED,2EAA2E;AAC3E,8EAA8E;AAC9E,2CAA2C;AAC3C,MAAM,UAAU,cAAc,CAAC,MAAoB;IACjD,MAAM,GAAG,GAAG,MAAM,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;IAEvC,qEAAqE;IACrE,MAAM,MAAM,GAAiB;QAC3B,MAAM,EAAE,QAAQ;QAChB,WAAW,EAAE,KAAK;QAClB,OAAO,EAAE,MAAM,CAAC,OAAO;QACvB,IAAI,EAAE,MAAM,CAAC,IAAI;QACjB,MAAM,EAAE,MAAM,CAAC,MAAM;QACrB,QAAQ,EAAE,MAAM,CAAC,QAAQ;QACzB,SAAS,EAAE,EAAE;QACb,YAAY,EAAE,EAAE;QAChB,aAAa,EAAE,EAAE;QACjB,QAAQ,EAAE,EAAE;QACZ,SAAS,EAAE,EAAE;QACb,cAAc,EAAE,EAAE;QAClB,gBAAgB,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE;QACnE,iBAAiB,EAAE,EAAE;QACrB,WAAW,EAAE,MAAM,CAAC,WAAW;KAChC,CAAC;IAEF,IAAI,MAAM,CAAC,OAAO,KAAK,SAAS;QAAE,MAAM,CAAC,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC;IAClE,IAAI,MAAM,CAAC,eAAe,KAAK,SAAS;QAAE,MAAM,CAAC,eAAe,GAAG,MAAM,CAAC,eAAe,CAAC;IAE1F,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/spec-cache.d.ts

@@ -0,0 +1,88 @@
+import { type GeneratedSpec } from './component-spec.js';
+import type { SignalDigest } from './signal-digest.js';
+/**
+ * Where a generated component is kept between requests.
+ *
+ * A generation is stable for as long as the shopper's signals are, so asking a
+ * model again on the next page view buys nothing and costs a round trip on the
+ * render path — which is the latency this whole design exists to avoid.
+ *
+ * The store is a port rather than an implementation. A single process can use
+ * the in-memory one; anything running more than one instance needs a shared
+ * store, or each instance keeps its own copy and the hit rate divides by the
+ * instance count.
+ */
+/**
+ * Asynchronous on purpose. A synchronous `get` would look simpler and would
+ * make the shared store the docs recommend impossible to write, since no Redis
+ * or Memcached client can return a value without awaiting.
+ */
+/**
+ * A stored generation, with the moment it was produced.
+ *
+ * The timestamp travels with the spec because it cannot be recovered later: a
+ * component served from cache is not newly generated, and `generatedAt` is the
+ * only way anything downstream can tell how stale what it is showing has become.
+ */
+export interface CachedSpec {
+    spec: GeneratedSpec;
+    /** Epoch milliseconds at which the model produced this. */
+    generatedAt: number;
+}
+export interface SpecCache {
+    get(key: string): Promise<CachedSpec | undefined>;
+    set(key: string, cached: CachedSpec): Promise<void>;
+}
+export interface MemorySpecCacheOptions {
+    /** How long an entry stays valid. Defaults to 60 seconds. */
+    ttlMs?: number;
+    /** Hard ceiling on entries. Least recently read is evicted first. */
+    maxEntries?: number;
+    /** Injectable clock, so tests do not have to wait. */
+    now?: () => number;
+}
+/**
+ * A bounded in-process cache.
+ *
+ * `maxEntries` is generous relative to the default TTL for a reason: a ceiling
+ * low enough to evict entries before they expire silently turns a longer TTL
+ * into a setting that does nothing, and the person who raised it has no way to
+ * tell.
+ */
+export declare function createMemorySpecCache(options?: MemorySpecCacheOptions): SpecCache;
+/**
+ * A cache that stores nothing, so every request generates.
+ *
+ * This is not a stub. It is the control for any measurement of generation cost
+ * or latency: with a cache in front, a benchmark reports how often it hit, not
+ * what generating costs.
+ */
+export declare function createNullSpecCache(): SpecCache;
+/**
+ * Derives the cache key.
+ *
+ * The digest goes in **whole**, rather than as a hand-picked list of fields.
+ * That is the entire point of this function. The previous implementation listed
+ * the fields it thought mattered, and four of them drifted: they reached the
+ * model but not the key, so two shoppers with genuinely different histories
+ * collided and were served each other's component. Hashing the whole digest
+ * makes that class of bug unreachable — a field cannot be forgotten here,
+ * because nothing is named here.
+ *
+ * The cost is a lower hit rate than a hand-tuned key would give, since every
+ * signal now moves the key. That is the right way round: a key that is too
+ * specific wastes money, and a key that is too loose shows one shopper another
+ * shopper's page. Raising the hit rate means deliberately coarsening the digest
+ * itself, which is a decision to make against measurements rather than by
+ * guessing here.
+ *
+ * Candidates enter as SKUs only. Their titles, prices and ratings reach the
+ * model too, but including them would churn the key on every price change for
+ * copy that would almost always come back the same. The consequence is bounded
+ * and worth stating: within one TTL, a price change does not refresh the
+ * generated copy. It cannot show a stale price — prices are read from the live
+ * catalog at render time, never from the model.
+ */
+export declare function specCacheKey(digest: SignalDigest, candidateSkus: readonly string[], providerId: string): string;
+export declare function cohortCacheKey(digest: SignalDigest, candidateSkus: readonly string[], providerId: string): string;
+//# sourceMappingURL=spec-cache.d.ts.map

package/dist/spec-cache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"spec-cache.d.ts","sourceRoot":"","sources":["../src/spec-cache.ts"],"names":[],"mappings":"AACA,OAAO,EAAgB,KAAK,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACvE,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAEvD;;;;;;;;;;;GAWG;AAEH;;;;GAIG;AACH;;;;;;GAMG;AACH,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,aAAa,CAAC;IACpB,2DAA2D;IAC3D,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,SAAS;IACxB,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,GAAG,SAAS,CAAC,CAAC;IAClD,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;CACrD;AAED,MAAM,WAAW,sBAAsB;IACrC,6DAA6D;IAC7D,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,qEAAqE;IACrE,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,sDAAsD;IACtD,GAAG,CAAC,EAAE,MAAM,MAAM,CAAC;CACpB;AAgBD;;;;;;;GAOG;AACH,wBAAgB,qBAAqB,CAAC,OAAO,GAAE,sBAA2B,GAAG,SAAS,CA+CrF;AAED;;;;;;GAMG;AACH,wBAAgB,mBAAmB,IAAI,SAAS,CAS/C;AAcD;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,wBAAgB,YAAY,CAC1B,MAAM,EAAE,YAAY,EACpB,aAAa,EAAE,SAAS,MAAM,EAAE,EAChC,UAAU,EAAE,MAAM,GACjB,MAAM,CAWR;AAMD,wBAAgB,cAAc,CAC5B,MAAM,EAAE,YAAY,EACpB,aAAa,EAAE,SAAS,MAAM,EAAE,EAChC,UAAU,EAAE,MAAM,GACjB,MAAM,CAsBR"}

package/dist/spec-cache.js

@@ -0,0 +1,152 @@
+import { createHash } from 'node:crypto';
+import { SPEC_VERSION } from './component-spec.js';
+function assertFiniteAtLeastZero(name, value) {
+    if (Number.isFinite(value) && value >= 0)
+        return;
+    const hint = Number.isNaN(value)
+        ? ' (a common cause is Number() on an environment variable that is not set)'
+        : '';
+    throw new RangeError(`${name} must be a finite number of at least 0, received ${value}${hint}`);
+}
+/**
+ * A bounded in-process cache.
+ *
+ * `maxEntries` is generous relative to the default TTL for a reason: a ceiling
+ * low enough to evict entries before they expire silently turns a longer TTL
+ * into a setting that does nothing, and the person who raised it has no way to
+ * tell.
+ */
+export function createMemorySpecCache(options = {}) {
+    const ttlMs = options.ttlMs ?? 60_000;
+    const maxEntries = options.maxEntries ?? 10_000;
+    // Checked rather than trusted, because the way these are usually supplied is
+    // `Number(process.env.SOMETHING)`, and an unset or misspelled variable makes
+    // that NaN. Every comparison against NaN is false, so the cache would then
+    // never expire an entry and never evict one — it would grow forever while
+    // serving a shopper the component they were given last week, and nothing
+    // would report it. Failing at construction is the only loud option.
+    assertFiniteAtLeastZero('ttlMs', ttlMs);
+    assertFiniteAtLeastZero('maxEntries', maxEntries);
+    if (!Number.isSafeInteger(maxEntries)) {
+        throw new RangeError(`maxEntries must be a whole number, received ${maxEntries}`);
+    }
+    const now = options.now ?? Date.now;
+    const entries = new Map();
+    return {
+        async get(key) {
+            const entry = entries.get(key);
+            if (!entry)
+                return undefined;
+            if (entry.expiresAt <= now()) {
+                entries.delete(key);
+                return undefined;
+            }
+            // Re-insert so insertion order tracks recency of use, which is what makes
+            // the eviction below least-recently-used rather than oldest-written.
+            entries.delete(key);
+            entries.set(key, entry);
+            return entry.cached;
+        },
+        async set(key, cached) {
+            entries.delete(key);
+            entries.set(key, { cached, expiresAt: now() + ttlMs });
+            while (entries.size > maxEntries) {
+                const oldest = entries.keys().next();
+                if (oldest.done)
+                    break;
+                entries.delete(oldest.value);
+            }
+        },
+    };
+}
+/**
+ * A cache that stores nothing, so every request generates.
+ *
+ * This is not a stub. It is the control for any measurement of generation cost
+ * or latency: with a cache in front, a benchmark reports how often it hit, not
+ * what generating costs.
+ */
+export function createNullSpecCache() {
+    return {
+        async get() {
+            return undefined;
+        },
+        async set() {
+            // Deliberately nothing.
+        },
+    };
+}
+/** Stable JSON: object keys sorted, so key order in a digest cannot matter. */
+function canonicalise(value) {
+    if (value === null || typeof value !== 'object')
+        return JSON.stringify(value) ?? 'null';
+    if (Array.isArray(value))
+        return `[${value.map(canonicalise).join(',')}]`;
+    const entries = Object.entries(value)
+        .filter(([, fieldValue]) => fieldValue !== undefined)
+        .toSorted(([left], [right]) => (left < right ? -1 : 1));
+    return `{${entries.map(([name, fieldValue]) => `${JSON.stringify(name)}:${canonicalise(fieldValue)}`).join(',')}}`;
+}
+/**
+ * Derives the cache key.
+ *
+ * The digest goes in **whole**, rather than as a hand-picked list of fields.
+ * That is the entire point of this function. The previous implementation listed
+ * the fields it thought mattered, and four of them drifted: they reached the
+ * model but not the key, so two shoppers with genuinely different histories
+ * collided and were served each other's component. Hashing the whole digest
+ * makes that class of bug unreachable — a field cannot be forgotten here,
+ * because nothing is named here.
+ *
+ * The cost is a lower hit rate than a hand-tuned key would give, since every
+ * signal now moves the key. That is the right way round: a key that is too
+ * specific wastes money, and a key that is too loose shows one shopper another
+ * shopper's page. Raising the hit rate means deliberately coarsening the digest
+ * itself, which is a decision to make against measurements rather than by
+ * guessing here.
+ *
+ * Candidates enter as SKUs only. Their titles, prices and ratings reach the
+ * model too, but including them would churn the key on every price change for
+ * copy that would almost always come back the same. The consequence is bounded
+ * and worth stating: within one TTL, a price change does not refresh the
+ * generated copy. It cannot show a stale price — prices are read from the live
+ * catalog at render time, never from the model.
+ */
+export function specCacheKey(digest, candidateSkus, providerId) {
+    const material = canonicalise({
+        // The spec's own version, so a shape change cannot read entries written by
+        // the previous shape out of a shared store that outlives a deploy.
+        specVersion: SPEC_VERSION,
+        provider: providerId,
+        digest,
+        candidates: candidateSkus.toSorted(),
+    });
+    return createHash('sha256').update(material).digest('hex').slice(0, 32);
+}
+// Leaves out the fields that make a key personal: who the shopper is, what they
+// liked, viewed or searched for. Candidates go too, because every shopper's list
+// is different — that is safe because the SKUs in a cohort spec get replaced
+// before the page is served.
+export function cohortCacheKey(digest, candidateSkus, providerId) {
+    const material = canonicalise({
+        specVersion: SPEC_VERSION,
+        provider: providerId,
+        segment: digest.segment ?? null,
+        surface: digest.surface,
+        slot: digest.slot,
+        locale: digest.locale,
+        maxItems: digest.maxItems,
+        isColdStart: digest.isColdStart,
+        // The page being looked at, so copy written for a backpack page is not
+        // served on a tent page.
+        currentCategory: digest.currentCategory ?? null,
+        topCategory: digest.categoryAffinity[0]?.category ?? null,
+        // The model is shown these, so they belong in the key. Normally they come
+        // from the page and everyone on it shares them. A shop that picks
+        // candidates per shopper gets smaller cohorts, which is the honest result:
+        // its prompt really is personal.
+        candidates: candidateSkus.toSorted(),
+    });
+    return createHash('sha256').update(material).digest('hex').slice(0, 32);
+}
+//# sourceMappingURL=spec-cache.js.map

package/dist/spec-cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"spec-cache.js","sourceRoot":"","sources":["../src/spec-cache.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,YAAY,EAAsB,MAAM,qBAAqB,CAAC;AAgDvE,SAAS,uBAAuB,CAAC,IAAY,EAAE,KAAa;IAC1D,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO;IAEjD,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC;QAC9B,CAAC,CAAC,0EAA0E;QAC5E,CAAC,CAAC,EAAE,CAAC;IACP,MAAM,IAAI,UAAU,CAAC,GAAG,IAAI,oDAAoD,KAAK,GAAG,IAAI,EAAE,CAAC,CAAC;AAClG,CAAC;AAOD;;;;;;;GAOG;AACH,MAAM,UAAU,qBAAqB,CAAC,OAAO,GAA2B,EAAE;IACxE,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,MAAM,CAAC;IACtC,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,MAAM,CAAC;IAEhD,6EAA6E;IAC7E,6EAA6E;IAC7E,2EAA2E;IAC3E,0EAA0E;IAC1E,yEAAyE;IACzE,oEAAoE;IACpE,uBAAuB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IACxC,uBAAuB,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC;IAClD,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,UAAU,CAAC,EAAE,CAAC;QACtC,MAAM,IAAI,UAAU,CAAC,+CAA+C,UAAU,EAAE,CAAC,CAAC;IACpF,CAAC;IAED,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC;IACpC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAsB,CAAC;IAE9C,OAAO;QACL,KAAK,CAAC,GAAG,CAAC,GAAG;YACX,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC/B,IAAI,CAAC,KAAK;gBAAE,OAAO,SAAS,CAAC;YAE7B,IAAI,KAAK,CAAC,SAAS,IAAI,GAAG,EAAE,EAAE,CAAC;gBAC7B,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACpB,OAAO,SAAS,CAAC;YACnB,CAAC;YAED,0EAA0E;YAC1E,qEAAqE;YACrE,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACpB,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACxB,OAAO,KAAK,CAAC,MAAM,CAAC;QACtB,CAAC;QAED,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM;YACnB,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACpB,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC;YAEvD,OAAO,OAAO,CAAC,IAAI,GAAG,UAAU,EAAE,CAAC;gBACjC,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;gBACrC,IAAI,MAAM,CAAC,IAAI;oBAAE,MAAM;gBACvB,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;KACF,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,mBAAmB;IACjC,OAAO;QACL,KAAK,CAAC,GAAG;YACP,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,KAAK,CAAC,GAAG;YACP,wBAAwB;QAC1B,CAAC;KACF,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,SAAS,YAAY,CAAC,KAAc;IAClC,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC;IACxF,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;IAE1E,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,KAAgC,CAAC;SAC7D,MAAM,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,EAAE,EAAE,CAAC,UAAU,KAAK,SAAS,CAAC;SACpD,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE1D,OAAO,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,UAAU,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AACrH,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,UAAU,YAAY,CAC1B,MAAoB,EACpB,aAAgC,EAChC,UAAkB;IAElB,MAAM,QAAQ,GAAG,YAAY,CAAC;QAC5B,2EAA2E;QAC3E,mEAAmE;QACnE,WAAW,EAAE,YAAY;QACzB,QAAQ,EAAE,UAAU;QACpB,MAAM;QACN,UAAU,EAAE,aAAa,CAAC,QAAQ,EAAE;KACrC,CAAC,CAAC;IAEH,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AAC1E,CAAC;AAED,gFAAgF;AAChF,iFAAiF;AACjF,6EAA6E;AAC7E,6BAA6B;AAC7B,MAAM,UAAU,cAAc,CAC5B,MAAoB,EACpB,aAAgC,EAChC,UAAkB;IAElB,MAAM,QAAQ,GAAG,YAAY,CAAC;QAC5B,WAAW,EAAE,YAAY;QACzB,QAAQ,EAAE,UAAU;QACpB,OAAO,EAAE,MAAM,CAAC,OAAO,IAAI,IAAI;QAC/B,OAAO,EAAE,MAAM,CAAC,OAAO;QACvB,IAAI,EAAE,MAAM,CAAC,IAAI;QACjB,MAAM,EAAE,MAAM,CAAC,MAAM;QACrB,QAAQ,EAAE,MAAM,CAAC,QAAQ;QACzB,WAAW,EAAE,MAAM,CAAC,WAAW;QAC/B,uEAAuE;QACvE,yBAAyB;QACzB,eAAe,EAAE,MAAM,CAAC,eAAe,IAAI,IAAI;QAC/C,WAAW,EAAE,MAAM,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,QAAQ,IAAI,IAAI;QACzD,0EAA0E;QAC1E,kEAAkE;QAClE,2EAA2E;QAC3E,iCAAiC;QACjC,UAAU,EAAE,aAAa,CAAC,QAAQ,EAAE;KACrC,CAAC,CAAC;IAEH,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AAC1E,CAAC"}