@open-mercato/core 0.9.1-develop.7473.1.de5b22888f → 0.9.1-develop.7475.1.28ca93ed97

package/dist/modules/ecommerce/lib/storefrontProductScope.js

@@ -0,0 +1,107 @@
+import {
+  PRODUCT_SCOPE_KEYS_DOC_KEY,
+  categoryScopeKey,
+  compareCodeUnits,
+  tagScopeKey
+} from "@open-mercato/core/modules/catalog/lib/productScopeKeys";
+function sortedUnique(values) {
+  return Array.from(new Set(values)).sort(compareCodeUnits);
+}
+function nonEmptyIds(ids) {
+  return (ids ?? []).filter((id) => typeof id === "string" && id.length > 0);
+}
+function collectBranchConditions(scope, into) {
+  const categoryIds = nonEmptyIds(scope.categoryIds);
+  if (categoryIds.length > 0) into.inclusions.push(sortedUnique(categoryIds.map(categoryScopeKey)));
+  const tagIds = nonEmptyIds(scope.tagIds);
+  if (tagIds.length > 0) into.inclusions.push(sortedUnique(tagIds.map(tagScopeKey)));
+  for (const id of nonEmptyIds(scope.excludeCategoryIds)) into.exclusions.add(categoryScopeKey(id));
+  for (const id of nonEmptyIds(scope.excludeTagIds)) into.exclusions.add(tagScopeKey(id));
+  for (const id of nonEmptyIds(scope.excludeProductIds)) into.excludedProductIds.add(id);
+  for (const nested of scope.allOf ?? []) collectBranchConditions(nested, into);
+}
+function branchLeaves(scope) {
+  const conditions = { inclusions: [], exclusions: /* @__PURE__ */ new Set(), excludedProductIds: /* @__PURE__ */ new Set() };
+  collectBranchConditions(scope, conditions);
+  const leaves = /* @__PURE__ */ new Map();
+  const key = PRODUCT_SCOPE_KEYS_DOC_KEY;
+  leaves.set("indexed", { where: { [key]: { $exists: true } }, condition: { op: "exists", key } });
+  for (const keys of conditions.inclusions) {
+    leaves.set(`overlap:${JSON.stringify(keys)}`, {
+      where: { [key]: { $overlap: keys } },
+      condition: { op: "overlap", key, values: keys }
+    });
+  }
+  if (conditions.exclusions.size > 0) {
+    const keys = sortedUnique(conditions.exclusions);
+    leaves.set(`noverlap:${JSON.stringify(keys)}`, {
+      where: { [key]: { $noverlap: keys } },
+      condition: { op: "noverlap", key, values: keys }
+    });
+  }
+  if (conditions.excludedProductIds.size > 0) {
+    const ids = sortedUnique(conditions.excludedProductIds);
+    leaves.set(`nin:${JSON.stringify(ids)}`, { where: { id: { $nin: ids } }, condition: { op: "recordIdNotIn", values: ids } });
+  }
+  return leaves;
+}
+function scopeBranches(scope) {
+  return absorbBranches(scope.map(branchLeaves)).map((leaves) => Array.from(leaves.values()));
+}
+function isSubset(smaller, larger) {
+  if (smaller.size > larger.size) return false;
+  for (const key of smaller.keys()) if (!larger.has(key)) return false;
+  return true;
+}
+function absorbBranches(branches) {
+  return branches.filter(
+    (branch, index) => !branches.some((other, otherIndex) => {
+      if (otherIndex === index || !isSubset(other, branch)) return false;
+      return other.size < branch.size || otherIndex < index;
+    })
+  );
+}
+function buildAssortmentScopeFilter(scope) {
+  if (scope === null) return null;
+  if (scope.length === 0) return { [PRODUCT_SCOPE_KEYS_DOC_KEY]: { $overlap: [] } };
+  const conjunctions = scopeBranches(scope).map((leaves) => ({ $and: leaves.map((leaf) => leaf.where) }));
+  return conjunctions.length === 1 ? conjunctions[0] : { $or: conjunctions };
+}
+const ACTIVE_PRODUCT_CONDITION = { op: "eq", key: "is_active", value: true };
+function buildStorefrontSearchIndexDocFilter(ctx) {
+  const scope = ctx.buyer.assortmentScope;
+  if (scope === null) return { anyOf: [[ACTIVE_PRODUCT_CONDITION]] };
+  return {
+    anyOf: scopeBranches(scope).map((leaves) => [ACTIVE_PRODUCT_CONDITION, ...leaves.map((leaf) => leaf.condition)])
+  };
+}
+function buildStorefrontProductScope(ctx) {
+  const { tenantId, organizationId } = ctx;
+  if (!tenantId || !organizationId) {
+    throw new Error("[internal] buildStorefrontProductScope requires tenantId and organizationId");
+  }
+  const invariant = {
+    tenant_id: tenantId,
+    organization_id: organizationId,
+    deleted_at: null,
+    is_active: true
+  };
+  const scopeFilter = buildAssortmentScopeFilter(ctx.buyer.assortmentScope);
+  return {
+    tenantId,
+    organizationId,
+    withDeleted: false,
+    filters: scopeFilter ? { ...invariant, $and: [scopeFilter] } : invariant
+  };
+}
+function composeStorefrontProductFilters(scope, extra) {
+  if (!extra || Object.keys(extra).length === 0) return scope.filters;
+  return { $and: [scope.filters, extra] };
+}
+export {
+  buildAssortmentScopeFilter,
+  buildStorefrontProductScope,
+  buildStorefrontSearchIndexDocFilter,
+  composeStorefrontProductFilters
+};
+//# sourceMappingURL=storefrontProductScope.js.map

package/dist/modules/ecommerce/lib/storefrontProductScope.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../src/modules/ecommerce/lib/storefrontProductScope.ts"],
+  "sourcesContent": ["import type { AssortmentScope, EffectiveAssortmentScope } from '@open-mercato/shared/lib/catalog-visibility'\nimport type { Where } from '@open-mercato/shared/lib/query/types'\nimport type { SearchIndexDocCondition, SearchIndexDocFilter } from '@open-mercato/shared/modules/search'\nimport {\n  PRODUCT_SCOPE_KEYS_DOC_KEY,\n  categoryScopeKey,\n  compareCodeUnits,\n  tagScopeKey,\n} from '@open-mercato/core/modules/catalog/lib/productScopeKeys'\nimport type { BuyerContext, StoreContext } from './types'\n\n/**\n * The query-engine inputs every storefront product query composes (Storefront Public API \u00A73.3).\n * Spread it into the `QueryOptions` of a `catalog:catalog_product` query and combine any further\n * filters through `composeStorefrontProductFilters` \u2014 never by spreading `filters`, which would let\n * a caller's key replace a clause of the invariant.\n */\nexport type StorefrontProductScope = {\n  tenantId: string\n  organizationId: string\n  withDeleted: false\n  filters: Where\n}\n\nexport type StorefrontProductScopeContext = Pick<StoreContext, 'tenantId' | 'organizationId'> & {\n  buyer: Pick<BuyerContext, 'assortmentScope'>\n}\n\ntype ScopeLeaf = { where: Where; condition: SearchIndexDocCondition }\n\ntype BranchConditions = {\n  inclusions: string[][]\n  exclusions: Set<string>\n  excludedProductIds: Set<string>\n}\n\nfunction sortedUnique(values: Iterable<string>): string[] {\n  return Array.from(new Set(values)).sort(compareCodeUnits)\n}\n\nfunction nonEmptyIds(ids: string[] | undefined): string[] {\n  return (ids ?? []).filter((id) => typeof id === 'string' && id.length > 0)\n}\n\nfunction collectBranchConditions(scope: AssortmentScope, into: BranchConditions): void {\n  const categoryIds = nonEmptyIds(scope.categoryIds)\n  if (categoryIds.length > 0) into.inclusions.push(sortedUnique(categoryIds.map(categoryScopeKey)))\n  const tagIds = nonEmptyIds(scope.tagIds)\n  if (tagIds.length > 0) into.inclusions.push(sortedUnique(tagIds.map(tagScopeKey)))\n  for (const id of nonEmptyIds(scope.excludeCategoryIds)) into.exclusions.add(categoryScopeKey(id))\n  for (const id of nonEmptyIds(scope.excludeTagIds)) into.exclusions.add(tagScopeKey(id))\n  for (const id of nonEmptyIds(scope.excludeProductIds)) into.excludedProductIds.add(id)\n  for (const nested of scope.allOf ?? []) collectBranchConditions(nested, into)\n}\n\n/**\n * One AND-scope as a deduplicated leaf map keyed by a canonical form. Every branch requires the\n * product to be scope-indexed (`scope_keys` present), so a document that was never enriched or\n * whose enrichment failed cannot match any restricted scope (fail closed, \u00A73.3 backfill rule).\n * Category and tag exclusions share one `noverlap` leaf: their keys live in disjoint `cat:`/`tag:`\n * namespaces, so `NOT overlap(cats) AND NOT overlap(tags)` equals `NOT overlap(cats \u222A tags)`.\n */\nfunction branchLeaves(scope: AssortmentScope): Map<string, ScopeLeaf> {\n  const conditions: BranchConditions = { inclusions: [], exclusions: new Set(), excludedProductIds: new Set() }\n  collectBranchConditions(scope, conditions)\n  const leaves = new Map<string, ScopeLeaf>()\n  const key = PRODUCT_SCOPE_KEYS_DOC_KEY\n  leaves.set('indexed', { where: { [key]: { $exists: true } }, condition: { op: 'exists', key } })\n  for (const keys of conditions.inclusions) {\n    leaves.set(`overlap:${JSON.stringify(keys)}`, {\n      where: { [key]: { $overlap: keys } },\n      condition: { op: 'overlap', key, values: keys },\n    })\n  }\n  if (conditions.exclusions.size > 0) {\n    const keys = sortedUnique(conditions.exclusions)\n    leaves.set(`noverlap:${JSON.stringify(keys)}`, {\n      where: { [key]: { $noverlap: keys } },\n      condition: { op: 'noverlap', key, values: keys },\n    })\n  }\n  if (conditions.excludedProductIds.size > 0) {\n    const ids = sortedUnique(conditions.excludedProductIds)\n    leaves.set(`nin:${JSON.stringify(ids)}`, { where: { id: { $nin: ids } }, condition: { op: 'recordIdNotIn', values: ids } })\n  }\n  return leaves\n}\n\nfunction scopeBranches(scope: AssortmentScope[]): ScopeLeaf[][] {\n  return absorbBranches(scope.map(branchLeaves)).map((leaves) => Array.from(leaves.values()))\n}\n\nfunction isSubset(smaller: Map<string, ScopeLeaf>, larger: Map<string, ScopeLeaf>): boolean {\n  if (smaller.size > larger.size) return false\n  for (const key of smaller.keys()) if (!larger.has(key)) return false\n  return true\n}\n\n/**\n * Absorption (`A OR (A AND B) = A`): a branch whose leaves are a superset of another branch's is\n * implied by it and dropped, as is any repeat of an identical branch. Besides keeping the SQL\n * small, this guarantees no disjunct becomes empty when `normalizeFilters` lifts the clauses all\n * disjuncts share \u2014 it treats such an emptied disjunct as absent instead of as TRUE.\n */\nfunction absorbBranches(branches: Map<string, ScopeLeaf>[]): Map<string, ScopeLeaf>[] {\n  return branches.filter((branch, index) =>\n    !branches.some((other, otherIndex) => {\n      if (otherIndex === index || !isSubset(other, branch)) return false\n      return other.size < branch.size || otherIndex < index\n    }),\n  )\n}\n\n/**\n * Translates a resolved `EffectiveAssortmentScope` into a query-engine `Where` over the product's\n * index document (`buyer-scoped-catalog-visibility.md` \u00A73.3 DNF): branches are OR'd; within a branch\n * `categoryIds` and `tagIds` each become `scope_keys overlap`, the exclusions `scope_keys noverlap`\n * and `id nin`, and every `allOf` entry is AND'ed in recursively.\n *\n * `null` (unrestricted) yields `null` \u2014 no scope clause, so not-yet-indexed products stay visible.\n * `[]` (deny-all) yields an empty `overlap`, which the engine compiles to `false`; it is never an\n * empty `$or`, which the filter normalizer would drop and thereby widen the query.\n *\n * `scope_keys` carries each assigned category's ancestors, so a scope granting category X matches\n * products assigned to any descendant of X \u2014 the \"includes descendants\" rule (\u00A74.1).\n */\nexport function buildAssortmentScopeFilter(scope: EffectiveAssortmentScope): Where | null {\n  if (scope === null) return null\n  if (scope.length === 0) return { [PRODUCT_SCOPE_KEYS_DOC_KEY]: { $overlap: [] } }\n  const conjunctions = scopeBranches(scope).map((leaves) => ({ $and: leaves.map((leaf) => leaf.where) }))\n  return conjunctions.length === 1 ? conjunctions[0] : { $or: conjunctions }\n}\n\nconst ACTIVE_PRODUCT_CONDITION: SearchIndexDocCondition = { op: 'eq', key: 'is_active', value: true }\n\n/**\n * The storefront invariant as a search-strategy predicate over the product's index document\n * (Storefront Public API \u00A78.2, D19): the same DNF branches as `buildAssortmentScopeFilter`, each\n * AND'ed with `is_active`, so the `tokens` and `pgvector` strategies evaluate scope inside the\n * ranking query. Tenant and organization travel as `SearchOptions` scoping; deleted products have\n * no live index row. `null` scope keeps only the active condition; `[]` yields an empty\n * disjunction, which matches nothing.\n */\nexport function buildStorefrontSearchIndexDocFilter(ctx: StorefrontProductScopeContext): SearchIndexDocFilter {\n  const scope = ctx.buyer.assortmentScope\n  if (scope === null) return { anyOf: [[ACTIVE_PRODUCT_CONDITION]] }\n  return {\n    anyOf: scopeBranches(scope).map((leaves) => [ACTIVE_PRODUCT_CONDITION, ...leaves.map((leaf) => leaf.condition)]),\n  }\n}\n\n/**\n * The assortment invariant (\u00A73.3): tenant and organization of the store context, not deleted,\n * active, and inside the buyer's effective assortment (`channel \u2229 buyer`, already intersected\n * into `ctx.buyer.assortmentScope`). Throws when the context lacks a tenant or organization.\n */\nexport function buildStorefrontProductScope(ctx: StorefrontProductScopeContext): StorefrontProductScope {\n  const { tenantId, organizationId } = ctx\n  if (!tenantId || !organizationId) {\n    throw new Error('[internal] buildStorefrontProductScope requires tenantId and organizationId')\n  }\n  const invariant: Where = {\n    tenant_id: tenantId,\n    organization_id: organizationId,\n    deleted_at: null,\n    is_active: true,\n  }\n  const scopeFilter = buildAssortmentScopeFilter(ctx.buyer.assortmentScope)\n  return {\n    tenantId,\n    organizationId,\n    withDeleted: false,\n    filters: scopeFilter ? { ...invariant, $and: [scopeFilter] } : invariant,\n  }\n}\n\n/** AND-combines the storefront scope with endpoint filters without letting either replace the other's clauses. */\nexport function composeStorefrontProductFilters(scope: StorefrontProductScope, extra?: Where | null): Where {\n  if (!extra || Object.keys(extra).length === 0) return scope.filters\n  return { $and: [scope.filters, extra] }\n}\n"],
+  "mappings": "AAGA;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AA4BP,SAAS,aAAa,QAAoC;AACxD,SAAO,MAAM,KAAK,IAAI,IAAI,MAAM,CAAC,EAAE,KAAK,gBAAgB;AAC1D;AAEA,SAAS,YAAY,KAAqC;AACxD,UAAQ,OAAO,CAAC,GAAG,OAAO,CAAC,OAAO,OAAO,OAAO,YAAY,GAAG,SAAS,CAAC;AAC3E;AAEA,SAAS,wBAAwB,OAAwB,MAA8B;AACrF,QAAM,cAAc,YAAY,MAAM,WAAW;AACjD,MAAI,YAAY,SAAS,EAAG,MAAK,WAAW,KAAK,aAAa,YAAY,IAAI,gBAAgB,CAAC,CAAC;AAChG,QAAM,SAAS,YAAY,MAAM,MAAM;AACvC,MAAI,OAAO,SAAS,EAAG,MAAK,WAAW,KAAK,aAAa,OAAO,IAAI,WAAW,CAAC,CAAC;AACjF,aAAW,MAAM,YAAY,MAAM,kBAAkB,EAAG,MAAK,WAAW,IAAI,iBAAiB,EAAE,CAAC;AAChG,aAAW,MAAM,YAAY,MAAM,aAAa,EAAG,MAAK,WAAW,IAAI,YAAY,EAAE,CAAC;AACtF,aAAW,MAAM,YAAY,MAAM,iBAAiB,EAAG,MAAK,mBAAmB,IAAI,EAAE;AACrF,aAAW,UAAU,MAAM,SAAS,CAAC,EAAG,yBAAwB,QAAQ,IAAI;AAC9E;AASA,SAAS,aAAa,OAAgD;AACpE,QAAM,aAA+B,EAAE,YAAY,CAAC,GAAG,YAAY,oBAAI,IAAI,GAAG,oBAAoB,oBAAI,IAAI,EAAE;AAC5G,0BAAwB,OAAO,UAAU;AACzC,QAAM,SAAS,oBAAI,IAAuB;AAC1C,QAAM,MAAM;AACZ,SAAO,IAAI,WAAW,EAAE,OAAO,EAAE,CAAC,GAAG,GAAG,EAAE,SAAS,KAAK,EAAE,GAAG,WAAW,EAAE,IAAI,UAAU,IAAI,EAAE,CAAC;AAC/F,aAAW,QAAQ,WAAW,YAAY;AACxC,WAAO,IAAI,WAAW,KAAK,UAAU,IAAI,CAAC,IAAI;AAAA,MAC5C,OAAO,EAAE,CAAC,GAAG,GAAG,EAAE,UAAU,KAAK,EAAE;AAAA,MACnC,WAAW,EAAE,IAAI,WAAW,KAAK,QAAQ,KAAK;AAAA,IAChD,CAAC;AAAA,EACH;AACA,MAAI,WAAW,WAAW,OAAO,GAAG;AAClC,UAAM,OAAO,aAAa,WAAW,UAAU;AAC/C,WAAO,IAAI,YAAY,KAAK,UAAU,IAAI,CAAC,IAAI;AAAA,MAC7C,OAAO,EAAE,CAAC,GAAG,GAAG,EAAE,WAAW,KAAK,EAAE;AAAA,MACpC,WAAW,EAAE,IAAI,YAAY,KAAK,QAAQ,KAAK;AAAA,IACjD,CAAC;AAAA,EACH;AACA,MAAI,WAAW,mBAAmB,OAAO,GAAG;AAC1C,UAAM,MAAM,aAAa,WAAW,kBAAkB;AACtD,WAAO,IAAI,OAAO,KAAK,UAAU,GAAG,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,IAAI,EAAE,GAAG,WAAW,EAAE,IAAI,iBAAiB,QAAQ,IAAI,EAAE,CAAC;AAAA,EAC5H;AACA,SAAO;AACT;AAEA,SAAS,cAAc,OAAyC;AAC9D,SAAO,eAAe,MAAM,IAAI,YAAY,CAAC,EAAE,IAAI,CAAC,WAAW,MAAM,KAAK,OAAO,OAAO,CAAC,CAAC;AAC5F;AAEA,SAAS,SAAS,SAAiC,QAAyC;AAC1F,MAAI,QAAQ,OAAO,OAAO,KAAM,QAAO;AACvC,aAAW,OAAO,QAAQ,KAAK,EAAG,KAAI,CAAC,OAAO,IAAI,GAAG,EAAG,QAAO;AAC/D,SAAO;AACT;AAQA,SAAS,eAAe,UAA8D;AACpF,SAAO,SAAS;AAAA,IAAO,CAAC,QAAQ,UAC9B,CAAC,SAAS,KAAK,CAAC,OAAO,eAAe;AACpC,UAAI,eAAe,SAAS,CAAC,SAAS,OAAO,MAAM,EAAG,QAAO;AAC7D,aAAO,MAAM,OAAO,OAAO,QAAQ,aAAa;AAAA,IAClD,CAAC;AAAA,EACH;AACF;AAeO,SAAS,2BAA2B,OAA+C;AACxF,MAAI,UAAU,KAAM,QAAO;AAC3B,MAAI,MAAM,WAAW,EAAG,QAAO,EAAE,CAAC,0BAA0B,GAAG,EAAE,UAAU,CAAC,EAAE,EAAE;AAChF,QAAM,eAAe,cAAc,KAAK,EAAE,IAAI,CAAC,YAAY,EAAE,MAAM,OAAO,IAAI,CAAC,SAAS,KAAK,KAAK,EAAE,EAAE;AACtG,SAAO,aAAa,WAAW,IAAI,aAAa,CAAC,IAAI,EAAE,KAAK,aAAa;AAC3E;AAEA,MAAM,2BAAoD,EAAE,IAAI,MAAM,KAAK,aAAa,OAAO,KAAK;AAU7F,SAAS,oCAAoC,KAA0D;AAC5G,QAAM,QAAQ,IAAI,MAAM;AACxB,MAAI,UAAU,KAAM,QAAO,EAAE,OAAO,CAAC,CAAC,wBAAwB,CAAC,EAAE;AACjE,SAAO;AAAA,IACL,OAAO,cAAc,KAAK,EAAE,IAAI,CAAC,WAAW,CAAC,0BAA0B,GAAG,OAAO,IAAI,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC;AAAA,EACjH;AACF;AAOO,SAAS,4BAA4B,KAA4D;AACtG,QAAM,EAAE,UAAU,eAAe,IAAI;AACrC,MAAI,CAAC,YAAY,CAAC,gBAAgB;AAChC,UAAM,IAAI,MAAM,6EAA6E;AAAA,EAC/F;AACA,QAAM,YAAmB;AAAA,IACvB,WAAW;AAAA,IACX,iBAAiB;AAAA,IACjB,YAAY;AAAA,IACZ,WAAW;AAAA,EACb;AACA,QAAM,cAAc,2BAA2B,IAAI,MAAM,eAAe;AACxE,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,aAAa;AAAA,IACb,SAAS,cAAc,EAAE,GAAG,WAAW,MAAM,CAAC,WAAW,EAAE,IAAI;AAAA,EACjE;AACF;AAGO,SAAS,gCAAgC,OAA+B,OAA6B;AAC1G,MAAI,CAAC,SAAS,OAAO,KAAK,KAAK,EAAE,WAAW,EAAG,QAAO,MAAM;AAC5D,SAAO,EAAE,MAAM,CAAC,MAAM,SAAS,KAAK,EAAE;AACxC;",
+  "names": []
+}