@open-mercato/shared 0.6.6-develop.5757.1.f5cc26cf92 → 0.6.6-develop.5876.1.6a45c370ac

package/.turbo/turbo-build.log

@@ -1,2 +1,2 @@
-[build:shared] found 223 entry points
+[build:shared] found 224 entry points
 [build:shared] built successfully

package/dist/lib/query/bounded-decrypt.js

@@ -0,0 +1,18 @@
+async function mapWithConcurrency(items, concurrency, mapper) {
+  if (concurrency <= 0 || items.length <= concurrency) {
+    return Promise.all(items.map((item, index) => mapper(item, index)));
+  }
+  const results = new Array(items.length);
+  for (let start = 0; start < items.length; start += concurrency) {
+    const chunk = items.slice(start, start + concurrency);
+    const chunkResults = await Promise.all(
+      chunk.map((item, offset) => mapper(item, start + offset))
+    );
+    for (let i = 0; i < chunkResults.length; i++) results[start + i] = chunkResults[i];
+  }
+  return results;
+}
+export {
+  mapWithConcurrency
+};
+//# sourceMappingURL=bounded-decrypt.js.map

package/dist/lib/query/bounded-decrypt.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/lib/query/bounded-decrypt.ts"],
+  "sourcesContent": ["/**\n * Maps `items` through `mapper` with at most `concurrency` calls in flight at\n * once, preserving input order in the output. Chunks are processed\n * sequentially; within a chunk, calls run in parallel via `Promise.all`.\n *\n * When `concurrency` is non-positive or `>= items.length`, this is\n * equivalent to a plain `Promise.all(items.map(mapper))`.\n */\nexport async function mapWithConcurrency<T, R>(\n  items: readonly T[],\n  concurrency: number,\n  mapper: (item: T, index: number) => Promise<R>,\n): Promise<R[]> {\n  if (concurrency <= 0 || items.length <= concurrency) {\n    return Promise.all(items.map((item, index) => mapper(item, index)))\n  }\n  const results: R[] = new Array(items.length)\n  for (let start = 0; start < items.length; start += concurrency) {\n    const chunk = items.slice(start, start + concurrency)\n    const chunkResults = await Promise.all(\n      chunk.map((item, offset) => mapper(item, start + offset)),\n    )\n    for (let i = 0; i < chunkResults.length; i++) results[start + i] = chunkResults[i]\n  }\n  return results\n}\n"],
+  "mappings": "AAQA,eAAsB,mBACpB,OACA,aACA,QACc;AACd,MAAI,eAAe,KAAK,MAAM,UAAU,aAAa;AACnD,WAAO,QAAQ,IAAI,MAAM,IAAI,CAAC,MAAM,UAAU,OAAO,MAAM,KAAK,CAAC,CAAC;AAAA,EACpE;AACA,QAAM,UAAe,IAAI,MAAM,MAAM,MAAM;AAC3C,WAAS,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS,aAAa;AAC9D,UAAM,QAAQ,MAAM,MAAM,OAAO,QAAQ,WAAW;AACpD,UAAM,eAAe,MAAM,QAAQ;AAAA,MACjC,MAAM,IAAI,CAAC,MAAM,WAAW,OAAO,MAAM,QAAQ,MAAM,CAAC;AAAA,IAC1D;AACA,aAAS,IAAI,GAAG,IAAI,aAAa,QAAQ,IAAK,SAAQ,QAAQ,CAAC,IAAI,aAAa,CAAC;AAAA,EACnF;AACA,SAAO;AACT;",
+  "names": []
+}

package/dist/lib/query/encrypted-sort.js

@@ -8,6 +8,13 @@ function fieldNameCandidates(field) {
   if (raw.startsWith("cf:")) candidates.push(raw.replace(/[^a-zA-Z0-9_]/g, "_"));
   return Array.from(new Set(candidates));
 }
+function resolveEncryptedSortMaxRows() {
+  const raw = process.env.OM_ENCRYPTED_SORT_MAX_ROWS;
+  if (raw === void 0 || raw === "") return null;
+  const parsed = Number(raw);
+  if (!Number.isFinite(parsed) || parsed <= 0) return null;
+  return Math.floor(parsed);
+}
 async function resolveEncryptedSortFields(service, entity, sortFields, tenantId, organizationId) {
   if (!service?.getEncryptedFieldNames) return /* @__PURE__ */ new Set();
   if (service.isEnabled && !service.isEnabled()) return /* @__PURE__ */ new Set();
@@ -59,6 +66,7 @@ function sortRowsInMemory(rows, sorts) {
 export {
   fieldNameCandidates,
   resolveEncryptedSortFields,
+  resolveEncryptedSortMaxRows,
   sortRowsInMemory
 };
 //# sourceMappingURL=encrypted-sort.js.map

package/dist/lib/query/encrypted-sort.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/lib/query/encrypted-sort.ts"],
-  "sourcesContent": ["import type { EntityId } from '@open-mercato/shared/modules/entities'\nimport { SortDir, type Sort } from './types'\n\nexport type QueryEncryptionService = {\n  getEncryptedFieldNames?: (\n    entityId: EntityId,\n    tenantId?: string | null,\n    organizationId?: string | null,\n  ) => Promise<readonly string[]>\n  isEnabled?: () => boolean\n}\n\nconst toSnakeCase = (value: string): string =>\n  value.replace(/([A-Z])/g, '_$1').replace(/__/g, '_').toLowerCase()\n\nconst toCamelCase = (value: string): string =>\n  value.replace(/_([a-z])/g, (_, c) => c.toUpperCase())\n\nexport function fieldNameCandidates(field: string): string[] {\n  const raw = String(field || '').trim()\n  if (!raw) return []\n  const candidates = [raw, toSnakeCase(raw), toCamelCase(raw)]\n  if (raw.startsWith('cf:')) candidates.push(raw.replace(/[^a-zA-Z0-9_]/g, '_'))\n  return Array.from(new Set(candidates))\n}\n\nexport async function resolveEncryptedSortFields(\n  service: QueryEncryptionService | null | undefined,\n  entity: EntityId,\n  sortFields: readonly string[],\n  tenantId?: string | null,\n  organizationId?: string | null,\n): Promise<Set<string>> {\n  if (!service?.getEncryptedFieldNames) return new Set()\n  if (service.isEnabled && !service.isEnabled()) return new Set()\n  const encrypted = await service.getEncryptedFieldNames(entity, tenantId ?? null, organizationId ?? null)\n  const encryptedCandidates = new Set<string>()\n  for (const field of encrypted) {\n    for (const candidate of fieldNameCandidates(field)) encryptedCandidates.add(candidate)\n  }\n  const result = new Set<string>()\n  for (const field of sortFields) {\n    if (field.startsWith('cf:')) continue\n    const matches = fieldNameCandidates(field).some((candidate) => encryptedCandidates.has(candidate))\n    if (matches) result.add(field)\n  }\n  return result\n}\n\nfunction readField(row: Record<string, unknown>, field: string): unknown {\n  for (const candidate of fieldNameCandidates(field)) {\n    if (Object.prototype.hasOwnProperty.call(row, candidate)) return row[candidate]\n  }\n  return undefined\n}\n\nfunction compareValues(left: unknown, right: unknown): number {\n  const leftMissing = left === null || left === undefined\n  const rightMissing = right === null || right === undefined\n  if (leftMissing && rightMissing) return 0\n  if (leftMissing) return 1\n  if (rightMissing) return -1\n  if (left instanceof Date && right instanceof Date) return left.getTime() - right.getTime()\n  if (typeof left === 'number' && typeof right === 'number') return left - right\n  if (typeof left === 'boolean' && typeof right === 'boolean') return Number(left) - Number(right)\n  return String(left).localeCompare(String(right), undefined, {\n    sensitivity: 'base',\n    numeric: true,\n  })\n}\n\nexport function sortRowsInMemory<T extends Record<string, unknown>>(\n  rows: readonly T[],\n  sorts: readonly Sort[],\n): T[] {\n  return [...rows].sort((left, right) => {\n    for (const sort of sorts) {\n      const direction = sort.dir === SortDir.Desc ? -1 : 1\n      const compared = compareValues(readField(left, sort.field), readField(right, sort.field))\n      if (compared !== 0) return compared * direction\n    }\n    const leftId = readField(left, 'id')\n    const rightId = readField(right, 'id')\n    return compareValues(leftId, rightId)\n  })\n}\n"],
-  "mappings": "AACA,SAAS,eAA0B;AAWnC,MAAM,cAAc,CAAC,UACnB,MAAM,QAAQ,YAAY,KAAK,EAAE,QAAQ,OAAO,GAAG,EAAE,YAAY;AAEnE,MAAM,cAAc,CAAC,UACnB,MAAM,QAAQ,aAAa,CAAC,GAAG,MAAM,EAAE,YAAY,CAAC;AAE/C,SAAS,oBAAoB,OAAyB;AAC3D,QAAM,MAAM,OAAO,SAAS,EAAE,EAAE,KAAK;AACrC,MAAI,CAAC,IAAK,QAAO,CAAC;AAClB,QAAM,aAAa,CAAC,KAAK,YAAY,GAAG,GAAG,YAAY,GAAG,CAAC;AAC3D,MAAI,IAAI,WAAW,KAAK,EAAG,YAAW,KAAK,IAAI,QAAQ,kBAAkB,GAAG,CAAC;AAC7E,SAAO,MAAM,KAAK,IAAI,IAAI,UAAU,CAAC;AACvC;AAEA,eAAsB,2BACpB,SACA,QACA,YACA,UACA,gBACsB;AACtB,MAAI,CAAC,SAAS,uBAAwB,QAAO,oBAAI,IAAI;AACrD,MAAI,QAAQ,aAAa,CAAC,QAAQ,UAAU,EAAG,QAAO,oBAAI,IAAI;AAC9D,QAAM,YAAY,MAAM,QAAQ,uBAAuB,QAAQ,YAAY,MAAM,kBAAkB,IAAI;AACvG,QAAM,sBAAsB,oBAAI,IAAY;AAC5C,aAAW,SAAS,WAAW;AAC7B,eAAW,aAAa,oBAAoB,KAAK,EAAG,qBAAoB,IAAI,SAAS;AAAA,EACvF;AACA,QAAM,SAAS,oBAAI,IAAY;AAC/B,aAAW,SAAS,YAAY;AAC9B,QAAI,MAAM,WAAW,KAAK,EAAG;AAC7B,UAAM,UAAU,oBAAoB,KAAK,EAAE,KAAK,CAAC,cAAc,oBAAoB,IAAI,SAAS,CAAC;AACjG,QAAI,QAAS,QAAO,IAAI,KAAK;AAAA,EAC/B;AACA,SAAO;AACT;AAEA,SAAS,UAAU,KAA8B,OAAwB;AACvE,aAAW,aAAa,oBAAoB,KAAK,GAAG;AAClD,QAAI,OAAO,UAAU,eAAe,KAAK,KAAK,SAAS,EAAG,QAAO,IAAI,SAAS;AAAA,EAChF;AACA,SAAO;AACT;AAEA,SAAS,cAAc,MAAe,OAAwB;AAC5D,QAAM,cAAc,SAAS,QAAQ,SAAS;AAC9C,QAAM,eAAe,UAAU,QAAQ,UAAU;AACjD,MAAI,eAAe,aAAc,QAAO;AACxC,MAAI,YAAa,QAAO;AACxB,MAAI,aAAc,QAAO;AACzB,MAAI,gBAAgB,QAAQ,iBAAiB,KAAM,QAAO,KAAK,QAAQ,IAAI,MAAM,QAAQ;AACzF,MAAI,OAAO,SAAS,YAAY,OAAO,UAAU,SAAU,QAAO,OAAO;AACzE,MAAI,OAAO,SAAS,aAAa,OAAO,UAAU,UAAW,QAAO,OAAO,IAAI,IAAI,OAAO,KAAK;AAC/F,SAAO,OAAO,IAAI,EAAE,cAAc,OAAO,KAAK,GAAG,QAAW;AAAA,IAC1D,aAAa;AAAA,IACb,SAAS;AAAA,EACX,CAAC;AACH;AAEO,SAAS,iBACd,MACA,OACK;AACL,SAAO,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,MAAM,UAAU;AACrC,eAAW,QAAQ,OAAO;AACxB,YAAM,YAAY,KAAK,QAAQ,QAAQ,OAAO,KAAK;AACnD,YAAM,WAAW,cAAc,UAAU,MAAM,KAAK,KAAK,GAAG,UAAU,OAAO,KAAK,KAAK,CAAC;AACxF,UAAI,aAAa,EAAG,QAAO,WAAW;AAAA,IACxC;AACA,UAAM,SAAS,UAAU,MAAM,IAAI;AACnC,UAAM,UAAU,UAAU,OAAO,IAAI;AACrC,WAAO,cAAc,QAAQ,OAAO;AAAA,EACtC,CAAC;AACH;",
+  "sourcesContent": ["import type { EntityId } from '@open-mercato/shared/modules/entities'\nimport { SortDir, type Sort } from './types'\n\nexport type QueryEncryptionService = {\n  getEncryptedFieldNames?: (\n    entityId: EntityId,\n    tenantId?: string | null,\n    organizationId?: string | null,\n  ) => Promise<readonly string[]>\n  isEnabled?: () => boolean\n}\n\nconst toSnakeCase = (value: string): string =>\n  value.replace(/([A-Z])/g, '_$1').replace(/__/g, '_').toLowerCase()\n\nconst toCamelCase = (value: string): string =>\n  value.replace(/_([a-z])/g, (_, c) => c.toUpperCase())\n\nexport function fieldNameCandidates(field: string): string[] {\n  const raw = String(field || '').trim()\n  if (!raw) return []\n  const candidates = [raw, toSnakeCase(raw), toCamelCase(raw)]\n  if (raw.startsWith('cf:')) candidates.push(raw.replace(/[^a-zA-Z0-9_]/g, '_'))\n  return Array.from(new Set(candidates))\n}\n\n/**\n * Opt-in cap on how many candidate rows the plaintext-sort path may fetch\n * for sort-column decryption. Unset or invalid input means uncapped \u2014 the\n * default must stay byte-identical to the pre-cap behavior.\n */\nexport function resolveEncryptedSortMaxRows(): number | null {\n  const raw = process.env.OM_ENCRYPTED_SORT_MAX_ROWS\n  if (raw === undefined || raw === '') return null\n  const parsed = Number(raw)\n  if (!Number.isFinite(parsed) || parsed <= 0) return null\n  return Math.floor(parsed)\n}\n\nexport async function resolveEncryptedSortFields(\n  service: QueryEncryptionService | null | undefined,\n  entity: EntityId,\n  sortFields: readonly string[],\n  tenantId?: string | null,\n  organizationId?: string | null,\n): Promise<Set<string>> {\n  if (!service?.getEncryptedFieldNames) return new Set()\n  if (service.isEnabled && !service.isEnabled()) return new Set()\n  const encrypted = await service.getEncryptedFieldNames(entity, tenantId ?? null, organizationId ?? null)\n  const encryptedCandidates = new Set<string>()\n  for (const field of encrypted) {\n    for (const candidate of fieldNameCandidates(field)) encryptedCandidates.add(candidate)\n  }\n  const result = new Set<string>()\n  for (const field of sortFields) {\n    if (field.startsWith('cf:')) continue\n    const matches = fieldNameCandidates(field).some((candidate) => encryptedCandidates.has(candidate))\n    if (matches) result.add(field)\n  }\n  return result\n}\n\nfunction readField(row: Record<string, unknown>, field: string): unknown {\n  for (const candidate of fieldNameCandidates(field)) {\n    if (Object.prototype.hasOwnProperty.call(row, candidate)) return row[candidate]\n  }\n  return undefined\n}\n\nfunction compareValues(left: unknown, right: unknown): number {\n  const leftMissing = left === null || left === undefined\n  const rightMissing = right === null || right === undefined\n  if (leftMissing && rightMissing) return 0\n  if (leftMissing) return 1\n  if (rightMissing) return -1\n  if (left instanceof Date && right instanceof Date) return left.getTime() - right.getTime()\n  if (typeof left === 'number' && typeof right === 'number') return left - right\n  if (typeof left === 'boolean' && typeof right === 'boolean') return Number(left) - Number(right)\n  return String(left).localeCompare(String(right), undefined, {\n    sensitivity: 'base',\n    numeric: true,\n  })\n}\n\nexport function sortRowsInMemory<T extends Record<string, unknown>>(\n  rows: readonly T[],\n  sorts: readonly Sort[],\n): T[] {\n  return [...rows].sort((left, right) => {\n    for (const sort of sorts) {\n      const direction = sort.dir === SortDir.Desc ? -1 : 1\n      const compared = compareValues(readField(left, sort.field), readField(right, sort.field))\n      if (compared !== 0) return compared * direction\n    }\n    const leftId = readField(left, 'id')\n    const rightId = readField(right, 'id')\n    return compareValues(leftId, rightId)\n  })\n}\n"],
+  "mappings": "AACA,SAAS,eAA0B;AAWnC,MAAM,cAAc,CAAC,UACnB,MAAM,QAAQ,YAAY,KAAK,EAAE,QAAQ,OAAO,GAAG,EAAE,YAAY;AAEnE,MAAM,cAAc,CAAC,UACnB,MAAM,QAAQ,aAAa,CAAC,GAAG,MAAM,EAAE,YAAY,CAAC;AAE/C,SAAS,oBAAoB,OAAyB;AAC3D,QAAM,MAAM,OAAO,SAAS,EAAE,EAAE,KAAK;AACrC,MAAI,CAAC,IAAK,QAAO,CAAC;AAClB,QAAM,aAAa,CAAC,KAAK,YAAY,GAAG,GAAG,YAAY,GAAG,CAAC;AAC3D,MAAI,IAAI,WAAW,KAAK,EAAG,YAAW,KAAK,IAAI,QAAQ,kBAAkB,GAAG,CAAC;AAC7E,SAAO,MAAM,KAAK,IAAI,IAAI,UAAU,CAAC;AACvC;AAOO,SAAS,8BAA6C;AAC3D,QAAM,MAAM,QAAQ,IAAI;AACxB,MAAI,QAAQ,UAAa,QAAQ,GAAI,QAAO;AAC5C,QAAM,SAAS,OAAO,GAAG;AACzB,MAAI,CAAC,OAAO,SAAS,MAAM,KAAK,UAAU,EAAG,QAAO;AACpD,SAAO,KAAK,MAAM,MAAM;AAC1B;AAEA,eAAsB,2BACpB,SACA,QACA,YACA,UACA,gBACsB;AACtB,MAAI,CAAC,SAAS,uBAAwB,QAAO,oBAAI,IAAI;AACrD,MAAI,QAAQ,aAAa,CAAC,QAAQ,UAAU,EAAG,QAAO,oBAAI,IAAI;AAC9D,QAAM,YAAY,MAAM,QAAQ,uBAAuB,QAAQ,YAAY,MAAM,kBAAkB,IAAI;AACvG,QAAM,sBAAsB,oBAAI,IAAY;AAC5C,aAAW,SAAS,WAAW;AAC7B,eAAW,aAAa,oBAAoB,KAAK,EAAG,qBAAoB,IAAI,SAAS;AAAA,EACvF;AACA,QAAM,SAAS,oBAAI,IAAY;AAC/B,aAAW,SAAS,YAAY;AAC9B,QAAI,MAAM,WAAW,KAAK,EAAG;AAC7B,UAAM,UAAU,oBAAoB,KAAK,EAAE,KAAK,CAAC,cAAc,oBAAoB,IAAI,SAAS,CAAC;AACjG,QAAI,QAAS,QAAO,IAAI,KAAK;AAAA,EAC/B;AACA,SAAO;AACT;AAEA,SAAS,UAAU,KAA8B,OAAwB;AACvE,aAAW,aAAa,oBAAoB,KAAK,GAAG;AAClD,QAAI,OAAO,UAAU,eAAe,KAAK,KAAK,SAAS,EAAG,QAAO,IAAI,SAAS;AAAA,EAChF;AACA,SAAO;AACT;AAEA,SAAS,cAAc,MAAe,OAAwB;AAC5D,QAAM,cAAc,SAAS,QAAQ,SAAS;AAC9C,QAAM,eAAe,UAAU,QAAQ,UAAU;AACjD,MAAI,eAAe,aAAc,QAAO;AACxC,MAAI,YAAa,QAAO;AACxB,MAAI,aAAc,QAAO;AACzB,MAAI,gBAAgB,QAAQ,iBAAiB,KAAM,QAAO,KAAK,QAAQ,IAAI,MAAM,QAAQ;AACzF,MAAI,OAAO,SAAS,YAAY,OAAO,UAAU,SAAU,QAAO,OAAO;AACzE,MAAI,OAAO,SAAS,aAAa,OAAO,UAAU,UAAW,QAAO,OAAO,IAAI,IAAI,OAAO,KAAK;AAC/F,SAAO,OAAO,IAAI,EAAE,cAAc,OAAO,KAAK,GAAG,QAAW;AAAA,IAC1D,aAAa;AAAA,IACb,SAAS;AAAA,EACX,CAAC;AACH;AAEO,SAAS,iBACd,MACA,OACK;AACL,SAAO,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,MAAM,UAAU;AACrC,eAAW,QAAQ,OAAO;AACxB,YAAM,YAAY,KAAK,QAAQ,QAAQ,OAAO,KAAK;AACnD,YAAM,WAAW,cAAc,UAAU,MAAM,KAAK,KAAK,GAAG,UAAU,OAAO,KAAK,KAAK,CAAC;AACxF,UAAI,aAAa,EAAG,QAAO,WAAW;AAAA,IACxC;AACA,UAAM,SAAS,UAAU,MAAM,IAAI;AACnC,UAAM,UAAU,UAAU,OAAO,IAAI;AACrC,WAAO,cAAc,QAAQ,OAAO;AAAA,EACtC,CAAC;AACH;",
   "names": []
 }