@open-mercato/documents 0.6.8-develop.7016.1.4ed7b1e49d

package/dist/modules/documents/lib/visibility.js

@@ -0,0 +1,422 @@
+import { raw } from "@mikro-orm/core";
+import { escapeLikePattern } from "@open-mercato/shared/lib/db/escapeLikePattern";
+import { findOneWithDecryption, findWithDecryption } from "@open-mercato/shared/lib/encryption/find";
+import { Document, DocumentFolder } from "../data/entities.js";
+import { DOCUMENTS_MAX_FOLDER_DEPTH, DOCUMENTS_MAX_LISTED_FOLDERS } from "./constants.js";
+function normalizeRoleIds(roleIds) {
+  return Array.from(new Set(roleIds.map((roleId) => roleId.trim()).filter(Boolean)));
+}
+function principalPredicate(shareAlias, userId, roleIds) {
+  const normalizedRoleIds = normalizeRoleIds(roleIds);
+  if (normalizedRoleIds.length === 0) {
+    return {
+      sql: `(${shareAlias}.principal_type = 'user' and ${shareAlias}.principal_id = ?)`,
+      params: [userId]
+    };
+  }
+  const rolePlaceholders = normalizedRoleIds.map(() => "?").join(", ");
+  return {
+    sql: `(
+      (${shareAlias}.principal_type = 'user' and ${shareAlias}.principal_id = ?)
+      or (${shareAlias}.principal_type = 'role' and ${shareAlias}.principal_id in (${rolePlaceholders}))
+    )`,
+    params: [userId, ...normalizedRoleIds]
+  };
+}
+function activeSharePredicate(shareAlias, documentAlias, input) {
+  const principal = principalPredicate(shareAlias, input.userId, input.roleIds);
+  return {
+    sql: `
+      ${shareAlias}.document_id = ${documentAlias}.id
+      and ${shareAlias}.tenant_id = ?
+      and ${shareAlias}.organization_id = ?
+      and ${shareAlias}.deleted_at is null
+      and ${principal.sql}
+    `,
+    params: [input.tenantId, input.organizationId, ...principal.params]
+  };
+}
+function relationshipTierSelection(input) {
+  const share = activeSharePredicate("tier_share", "document", input);
+  return raw(`
+    case
+      when document.owner_user_id = ? then 'owner'
+      else (
+        select tier_share.permission
+        from document_shares as tier_share
+        where ${share.sql}
+        order by case tier_share.permission
+          when 'editor' then 3
+          when 'commenter' then 2
+          when 'viewer' then 1
+          else 0
+        end desc
+        limit 1
+      )
+    end as "relationshipTier"
+  `, [input.userId, ...share.params]);
+}
+function addDocumentVisibilityPredicate(query, input) {
+  if (input.managerOverride) return;
+  const share = activeSharePredicate("visible_share", "document", input);
+  query.andWhere(`(
+    document.owner_user_id = ?
+    or exists (
+      select 1
+      from document_shares as visible_share
+      where ${share.sql}
+    )
+  )`, [input.userId, ...share.params]);
+}
+const RELATION_TARGET_COLUMNS = {
+  "customer-person": "customer_entity_id",
+  "customer-company": "customer_entity_id",
+  deal: "deal_id",
+  product: "product_id",
+  "catalog-offer": "catalog_offer_id",
+  quote: "quote_id",
+  "sales-order": "sales_order_id",
+  document: "linked_document_id"
+};
+function addDocumentRelationPredicate(query, input) {
+  if (!input.relationFilter) return;
+  const column = RELATION_TARGET_COLUMNS[input.relationFilter.entityType];
+  const customerKind = input.relationFilter.entityType === "customer-person" ? "person" : input.relationFilter.entityType === "customer-company" ? "company" : null;
+  query.andWhere(`exists (
+    select 1
+    from document_entity_links as relation_link
+    where relation_link.document_id = document.id
+      and relation_link.tenant_id = ?
+      and relation_link.organization_id = ?
+      and relation_link.deleted_at is null
+      and relation_link.${column} = ?
+      ${customerKind ? "and relation_link.customer_kind = ?" : ""}
+  )`, [
+    input.tenantId,
+    input.organizationId,
+    input.relationFilter.entityId,
+    ...customerKind ? [customerKind] : []
+  ]);
+}
+function addDocumentFavoritePredicate(query, input) {
+  if (!input.favoriteUserId) return;
+  query.andWhere(`exists (
+    select 1
+    from document_favorites as document_favorite
+    where document_favorite.document_id = document.id
+      and document_favorite.tenant_id = ?
+      and document_favorite.organization_id = ?
+      and document_favorite.user_id = ?
+      and document_favorite.deleted_at is null
+  )`, [input.tenantId, input.organizationId, input.favoriteUserId]);
+}
+function normalizeTier(value) {
+  return value === "owner" || value === "editor" || value === "commenter" || value === "viewer" ? value : null;
+}
+function normalizeTotal(value) {
+  const parsed = typeof value === "bigint" ? Number(value) : Number(value ?? 0);
+  return Number.isFinite(parsed) && parsed >= 0 ? parsed : 0;
+}
+function assertPageInput(page, pageSize) {
+  if (!Number.isInteger(page) || page < 1 || !Number.isInteger(pageSize) || pageSize < 1 || pageSize > 100) {
+    throw new Error("[internal] Invalid visible document page request");
+  }
+}
+function buildVisibleDocumentQuery(input) {
+  const archived = input.archived ?? "exclude";
+  const query = input.em.createQueryBuilder(Document, "document").where({
+    tenantId: input.tenantId,
+    organizationId: input.organizationId,
+    deletedAt: null,
+    ...input.id ? { id: input.id } : {},
+    ...!input.id && archived === "exclude" ? { archivedAt: null } : {},
+    ...!input.id && archived === "only" ? { archivedAt: { $ne: null } } : {}
+  });
+  addDocumentVisibilityPredicate(query, input);
+  addDocumentRelationPredicate(query, input);
+  addDocumentFavoritePredicate(query, input);
+  if (input.search?.trim()) {
+    query.andWhere("document.title ilike ?", [`%${escapeLikePattern(input.search.trim())}%`]);
+  }
+  if (input.folderId) {
+    query.andWhere({ folderId: input.folderId });
+  }
+  return query;
+}
+async function getVisibleDocumentPage(input) {
+  assertPageInput(input.page, input.pageSize);
+  const query = buildVisibleDocumentQuery(input).select([
+    "document.id",
+    relationshipTierSelection(input),
+    raw('count(*) over() as "total"')
+  ]);
+  const rawRows = await query.orderBy({ updatedAt: "DESC", id: "ASC" }).limit(input.pageSize).offset((input.page - 1) * input.pageSize).execute("all", false);
+  const rows = rawRows.flatMap((row) => {
+    if (typeof row.id !== "string" || row.id.length === 0) return [];
+    return [{
+      id: row.id,
+      relationshipTier: normalizeTier(row.relationshipTier ?? row.relationship_tier),
+      total: normalizeTotal(row.total)
+    }];
+  });
+  if (rows.length > 0 || input.page === 1) {
+    return { rows, total: rows[0]?.total ?? 0 };
+  }
+  const total = await buildVisibleDocumentQuery(input).getCount("document.id");
+  return { rows, total: normalizeTotal(total) };
+}
+async function getDirectVisibleFolderIds(input) {
+  const query = input.em.createQueryBuilder(Document, "document").select("document.folderId", true).where({
+    tenantId: input.tenantId,
+    organizationId: input.organizationId,
+    deletedAt: null,
+    folderId: { $ne: null }
+  });
+  addDocumentVisibilityPredicate(query, input);
+  const rows = await query.execute("all");
+  return new Set(rows.flatMap((row) => {
+    const folderId = row.folderId ?? row.folder_id;
+    return typeof folderId === "string" && folderId.length > 0 ? [folderId] : [];
+  }));
+}
+function assertFolderHierarchyContract(foldersById, requiredFolderIds) {
+  if (requiredFolderIds) {
+    for (const folderId of requiredFolderIds) {
+      if (!foldersById.has(folderId)) {
+        throw new Error("[internal] Visible folder hierarchy contains an unresolved folder");
+      }
+    }
+  }
+  for (const folder of foldersById.values()) {
+    const visited = /* @__PURE__ */ new Set();
+    let current = folder;
+    let depth = 0;
+    while (current) {
+      if (visited.has(current.id)) {
+        throw new Error("[internal] Folder hierarchy contains a cycle");
+      }
+      visited.add(current.id);
+      depth += 1;
+      if (depth > DOCUMENTS_MAX_FOLDER_DEPTH) {
+        throw new Error("[internal] Folder hierarchy exceeds the supported depth");
+      }
+      if (!current.parentFolderId) break;
+      current = foldersById.get(current.parentFolderId);
+      if (!current) {
+        throw new Error("[internal] Folder hierarchy contains an unresolved ancestor");
+      }
+    }
+  }
+}
+function retainFoldersReachableFromRoots(folders) {
+  const childrenByParentId = /* @__PURE__ */ new Map();
+  for (const folder of folders) {
+    if (!folder.parentFolderId) continue;
+    const siblings = childrenByParentId.get(folder.parentFolderId);
+    if (siblings) siblings.push(folder);
+    else childrenByParentId.set(folder.parentFolderId, [folder]);
+  }
+  const reachableIds = /* @__PURE__ */ new Set();
+  const pending = folders.filter((folder) => !folder.parentFolderId);
+  for (let index = 0; index < pending.length; index += 1) {
+    const folder = pending[index];
+    reachableIds.add(folder.id);
+    const children = childrenByParentId.get(folder.id);
+    if (children) pending.push(...children);
+  }
+  return folders.filter((folder) => reachableIds.has(folder.id));
+}
+async function getVisibleFolders(input) {
+  const scope = {
+    tenantId: input.tenantId,
+    organizationId: input.organizationId,
+    deletedAt: null
+  };
+  if (input.managerOverride) {
+    const folders = await findWithDecryption(
+      input.em,
+      DocumentFolder,
+      scope,
+      { orderBy: { name: "ASC" }, limit: DOCUMENTS_MAX_LISTED_FOLDERS + 1 },
+      { tenantId: input.tenantId, organizationId: input.organizationId }
+    );
+    const listed = folders.length > DOCUMENTS_MAX_LISTED_FOLDERS ? retainFoldersReachableFromRoots(folders.slice(0, DOCUMENTS_MAX_LISTED_FOLDERS)) : folders;
+    assertFolderHierarchyContract(new Map(listed.map((folder) => [folder.id, folder])));
+    return listed.map((folder) => ({
+      folder,
+      canEdit: input.canEditAction,
+      visibility: "owned"
+    }));
+  }
+  const [ownedFolders, directlyVisibleFolderIds] = await Promise.all([
+    findWithDecryption(
+      input.em,
+      DocumentFolder,
+      { ...scope, ownerUserId: input.userId },
+      void 0,
+      { tenantId: input.tenantId, organizationId: input.organizationId }
+    ),
+    getDirectVisibleFolderIds(input)
+  ]);
+  const foldersById = new Map(ownedFolders.map((folder) => [folder.id, folder]));
+  const visibilityById = /* @__PURE__ */ new Map();
+  for (const folder of ownedFolders) visibilityById.set(folder.id, "owned");
+  for (const folderId of directlyVisibleFolderIds) {
+    if (!visibilityById.has(folderId)) visibilityById.set(folderId, "contains-visible");
+  }
+  let pendingIds = new Set([
+    ...directlyVisibleFolderIds,
+    ...ownedFolders.flatMap((folder) => folder.parentFolderId ? [folder.parentFolderId] : [])
+  ].filter((folderId) => !foldersById.has(folderId)));
+  for (let depth = 0; pendingIds.size > 0 && depth < DOCUMENTS_MAX_FOLDER_DEPTH; depth += 1) {
+    const batchIds = Array.from(pendingIds);
+    pendingIds = /* @__PURE__ */ new Set();
+    const folders = await findWithDecryption(
+      input.em,
+      DocumentFolder,
+      {
+        ...scope,
+        id: { $in: batchIds }
+      },
+      void 0,
+      { tenantId: input.tenantId, organizationId: input.organizationId }
+    );
+    for (const folder of folders) {
+      foldersById.set(folder.id, folder);
+      if (!visibilityById.has(folder.id)) visibilityById.set(folder.id, "ancestor");
+      if (folder.parentFolderId && !foldersById.has(folder.parentFolderId)) {
+        pendingIds.add(folder.parentFolderId);
+      }
+    }
+  }
+  if (pendingIds.size > 0) {
+    throw new Error("[internal] Folder hierarchy exceeds the supported depth");
+  }
+  assertFolderHierarchyContract(foldersById, visibilityById.keys());
+  return Array.from(foldersById.values()).sort((left, right) => left.name.localeCompare(right.name)).map((folder) => ({
+    folder,
+    canEdit: input.canEditAction && folder.ownerUserId === input.userId,
+    visibility: visibilityById.get(folder.id) ?? "ancestor"
+  }));
+}
+async function inspectFolderAncestors(input) {
+  const scope = {
+    tenantId: input.tenantId,
+    organizationId: input.organizationId,
+    deletedAt: null
+  };
+  const visited = /* @__PURE__ */ new Set();
+  let ancestorId = input.parentFolderId;
+  let depth = 0;
+  while (ancestorId) {
+    if (ancestorId === input.folderId || visited.has(ancestorId)) {
+      return { depth, issue: "cycle" };
+    }
+    if (depth >= DOCUMENTS_MAX_FOLDER_DEPTH) {
+      return { depth, issue: "depth" };
+    }
+    visited.add(ancestorId);
+    const ancestor = await findOneWithDecryption(
+      input.em,
+      DocumentFolder,
+      {
+        ...scope,
+        id: ancestorId
+      },
+      void 0,
+      { tenantId: input.tenantId, organizationId: input.organizationId }
+    );
+    if (!ancestor) return { depth, issue: "missing-parent" };
+    depth += 1;
+    ancestorId = ancestor.parentFolderId ?? null;
+  }
+  return { depth, issue: null };
+}
+async function inspectFolderSubtree(input, parentDepth) {
+  const scope = {
+    tenantId: input.tenantId,
+    organizationId: input.organizationId,
+    deletedAt: null
+  };
+  const visited = /* @__PURE__ */ new Set([input.folderId]);
+  let frontier = [input.folderId];
+  let subtreeDepth = 1;
+  while (frontier.length > 0) {
+    if (parentDepth + subtreeDepth > DOCUMENTS_MAX_FOLDER_DEPTH) return "depth";
+    const children = await findWithDecryption(
+      input.em,
+      DocumentFolder,
+      {
+        ...scope,
+        parentFolderId: { $in: frontier }
+      },
+      { fields: ["id", "parentFolderId"] },
+      { tenantId: input.tenantId, organizationId: input.organizationId }
+    );
+    if (children.length === 0) return null;
+    const nextFrontier = [];
+    for (const child of children) {
+      if (visited.has(child.id)) return "cycle";
+      visited.add(child.id);
+      nextFrontier.push(child.id);
+    }
+    frontier = nextFrontier;
+    subtreeDepth += 1;
+  }
+  return null;
+}
+async function getFolderPlacementIssue(input) {
+  const ancestors = await inspectFolderAncestors(input);
+  if (ancestors.issue) return ancestors.issue;
+  if (!input.folderId) {
+    return ancestors.depth + 1 > DOCUMENTS_MAX_FOLDER_DEPTH ? "depth" : null;
+  }
+  return inspectFolderSubtree({
+    em: input.em,
+    tenantId: input.tenantId,
+    organizationId: input.organizationId,
+    folderId: input.folderId
+  }, ancestors.depth);
+}
+async function wouldCreateFolderCycle(input) {
+  const inspection = await inspectFolderAncestors(input);
+  return inspection.issue === "cycle" || inspection.issue === "depth";
+}
+async function hasActiveFolderContents(input) {
+  const scope = {
+    tenantId: input.tenantId,
+    organizationId: input.organizationId,
+    deletedAt: null
+  };
+  const [childFolder, document] = await Promise.all([
+    findOneWithDecryption(
+      input.em,
+      DocumentFolder,
+      {
+        ...scope,
+        parentFolderId: input.folderId
+      },
+      { fields: ["id"] },
+      { tenantId: input.tenantId, organizationId: input.organizationId }
+    ),
+    findOneWithDecryption(
+      input.em,
+      Document,
+      {
+        ...scope,
+        folderId: input.folderId
+      },
+      { fields: ["id"] },
+      { tenantId: input.tenantId, organizationId: input.organizationId }
+    )
+  ]);
+  return Boolean(childFolder || document);
+}
+export {
+  getFolderPlacementIssue,
+  getVisibleDocumentPage,
+  getVisibleFolders,
+  hasActiveFolderContents,
+  wouldCreateFolderCycle
+};
+//# sourceMappingURL=visibility.js.map

package/dist/modules/documents/lib/visibility.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../src/modules/documents/lib/visibility.ts"],
+  "sourcesContent": ["import { raw } from '@mikro-orm/core'\nimport type { EntityManager } from '@mikro-orm/postgresql'\nimport { escapeLikePattern } from '@open-mercato/shared/lib/db/escapeLikePattern'\nimport { findOneWithDecryption, findWithDecryption } from '@open-mercato/shared/lib/encryption/find'\nimport { Document, DocumentFolder } from '../data/entities'\nimport type { DocumentEntityType } from '../data/validators'\nimport { DOCUMENTS_MAX_FOLDER_DEPTH, DOCUMENTS_MAX_LISTED_FOLDERS } from './constants'\nimport type { DocumentTier } from './permissions'\n\nexport type VisibleDocumentPageRow = {\n  id: string\n  relationshipTier: DocumentTier | null\n  total: number\n}\n\nexport type VisibleDocumentPage = {\n  rows: VisibleDocumentPageRow[]\n  total: number\n}\n\nexport type GetVisibleDocumentPageInput = {\n  em: EntityManager\n  tenantId: string\n  organizationId: string\n  userId: string\n  roleIds: readonly string[]\n  managerOverride: boolean\n  page: number\n  pageSize: number\n  id?: string | null\n  archived?: 'exclude' | 'include' | 'only'\n  favoriteUserId?: string | null\n  search?: string | null\n  folderId?: string | null\n  relationFilter?: { entityType: DocumentEntityType; entityId: string } | null\n}\n\nexport type FolderVisibility = 'owned' | 'contains-visible' | 'ancestor'\n\nexport type VisibleFolderRow = {\n  folder: DocumentFolder\n  canEdit: boolean\n  visibility: FolderVisibility\n}\n\nexport type GetVisibleFoldersInput = Pick<\n  GetVisibleDocumentPageInput,\n  'em' | 'tenantId' | 'organizationId' | 'userId' | 'roleIds' | 'managerOverride'\n> & {\n  canEditAction: boolean\n}\n\nexport type FolderMutationScope = Pick<\n  GetVisibleFoldersInput,\n  'em' | 'tenantId' | 'organizationId'\n>\n\nexport type FolderPlacementIssue = 'cycle' | 'depth' | 'missing-parent'\n\ntype RawVisibleDocumentRow = {\n  id?: unknown\n  relationshipTier?: unknown\n  relationship_tier?: unknown\n  total?: unknown\n}\n\ntype RawFolderIdRow = {\n  folderId?: unknown\n  folder_id?: unknown\n}\n\ntype PrincipalPredicate = {\n  sql: string\n  params: string[]\n}\n\ntype VisibilityPredicateQuery = {\n  andWhere(condition: string, params?: string[]): unknown\n}\n\nfunction normalizeRoleIds(roleIds: readonly string[]): string[] {\n  return Array.from(new Set(roleIds.map((roleId) => roleId.trim()).filter(Boolean)))\n}\n\nfunction principalPredicate(\n  shareAlias: string,\n  userId: string,\n  roleIds: readonly string[],\n): PrincipalPredicate {\n  const normalizedRoleIds = normalizeRoleIds(roleIds)\n  if (normalizedRoleIds.length === 0) {\n    return {\n      sql: `(${shareAlias}.principal_type = 'user' and ${shareAlias}.principal_id = ?)`,\n      params: [userId],\n    }\n  }\n\n  const rolePlaceholders = normalizedRoleIds.map(() => '?').join(', ')\n  return {\n    sql: `(\n      (${shareAlias}.principal_type = 'user' and ${shareAlias}.principal_id = ?)\n      or (${shareAlias}.principal_type = 'role' and ${shareAlias}.principal_id in (${rolePlaceholders}))\n    )`,\n    params: [userId, ...normalizedRoleIds],\n  }\n}\n\nfunction activeSharePredicate(\n  shareAlias: string,\n  documentAlias: string,\n  input: Pick<GetVisibleDocumentPageInput, 'tenantId' | 'organizationId' | 'userId' | 'roleIds'>,\n): PrincipalPredicate {\n  const principal = principalPredicate(shareAlias, input.userId, input.roleIds)\n  return {\n    sql: `\n      ${shareAlias}.document_id = ${documentAlias}.id\n      and ${shareAlias}.tenant_id = ?\n      and ${shareAlias}.organization_id = ?\n      and ${shareAlias}.deleted_at is null\n      and ${principal.sql}\n    `,\n    params: [input.tenantId, input.organizationId, ...principal.params],\n  }\n}\n\nfunction relationshipTierSelection(input: GetVisibleDocumentPageInput) {\n  const share = activeSharePredicate('tier_share', 'document', input)\n  return raw(`\n    case\n      when document.owner_user_id = ? then 'owner'\n      else (\n        select tier_share.permission\n        from document_shares as tier_share\n        where ${share.sql}\n        order by case tier_share.permission\n          when 'editor' then 3\n          when 'commenter' then 2\n          when 'viewer' then 1\n          else 0\n        end desc\n        limit 1\n      )\n    end as \"relationshipTier\"\n  `, [input.userId, ...share.params])\n}\n\nfunction addDocumentVisibilityPredicate(\n  query: VisibilityPredicateQuery,\n  input: Pick<\n    GetVisibleDocumentPageInput,\n    'tenantId' | 'organizationId' | 'userId' | 'roleIds' | 'managerOverride'\n  >,\n): void {\n  if (input.managerOverride) return\n  const share = activeSharePredicate('visible_share', 'document', input)\n  query.andWhere(`(\n    document.owner_user_id = ?\n    or exists (\n      select 1\n      from document_shares as visible_share\n      where ${share.sql}\n    )\n  )`, [input.userId, ...share.params])\n}\n\nconst RELATION_TARGET_COLUMNS: Record<DocumentEntityType, string> = {\n  'customer-person': 'customer_entity_id',\n  'customer-company': 'customer_entity_id',\n  deal: 'deal_id',\n  product: 'product_id',\n  'catalog-offer': 'catalog_offer_id',\n  quote: 'quote_id',\n  'sales-order': 'sales_order_id',\n  document: 'linked_document_id',\n}\n\nfunction addDocumentRelationPredicate(\n  query: VisibilityPredicateQuery,\n  input: Pick<GetVisibleDocumentPageInput, 'tenantId' | 'organizationId' | 'relationFilter'>,\n): void {\n  if (!input.relationFilter) return\n  const column = RELATION_TARGET_COLUMNS[input.relationFilter.entityType]\n  const customerKind = input.relationFilter.entityType === 'customer-person'\n    ? 'person'\n    : input.relationFilter.entityType === 'customer-company'\n      ? 'company'\n      : null\n  query.andWhere(`exists (\n    select 1\n    from document_entity_links as relation_link\n    where relation_link.document_id = document.id\n      and relation_link.tenant_id = ?\n      and relation_link.organization_id = ?\n      and relation_link.deleted_at is null\n      and relation_link.${column} = ?\n      ${customerKind ? 'and relation_link.customer_kind = ?' : ''}\n  )`, [\n    input.tenantId,\n    input.organizationId,\n    input.relationFilter.entityId,\n    ...(customerKind ? [customerKind] : []),\n  ])\n}\n\nfunction addDocumentFavoritePredicate(\n  query: VisibilityPredicateQuery,\n  input: Pick<\n    GetVisibleDocumentPageInput,\n    'tenantId' | 'organizationId' | 'favoriteUserId'\n  >,\n): void {\n  if (!input.favoriteUserId) return\n  query.andWhere(`exists (\n    select 1\n    from document_favorites as document_favorite\n    where document_favorite.document_id = document.id\n      and document_favorite.tenant_id = ?\n      and document_favorite.organization_id = ?\n      and document_favorite.user_id = ?\n      and document_favorite.deleted_at is null\n  )`, [input.tenantId, input.organizationId, input.favoriteUserId])\n}\n\nfunction normalizeTier(value: unknown): DocumentTier | null {\n  return value === 'owner' || value === 'editor' || value === 'commenter' || value === 'viewer'\n    ? value\n    : null\n}\n\nfunction normalizeTotal(value: unknown): number {\n  const parsed = typeof value === 'bigint' ? Number(value) : Number(value ?? 0)\n  return Number.isFinite(parsed) && parsed >= 0 ? parsed : 0\n}\n\nfunction assertPageInput(page: number, pageSize: number): void {\n  if (!Number.isInteger(page) || page < 1 || !Number.isInteger(pageSize) || pageSize < 1 || pageSize > 100) {\n    throw new Error('[internal] Invalid visible document page request')\n  }\n}\n\nfunction buildVisibleDocumentQuery(input: GetVisibleDocumentPageInput) {\n  const archived = input.archived ?? 'exclude'\n  const query = input.em\n    .createQueryBuilder(Document, 'document')\n    .where({\n      tenantId: input.tenantId,\n      organizationId: input.organizationId,\n      deletedAt: null,\n      ...(input.id ? { id: input.id } : {}),\n      ...(!input.id && archived === 'exclude' ? { archivedAt: null } : {}),\n      ...(!input.id && archived === 'only' ? { archivedAt: { $ne: null } } : {}),\n    })\n\n  addDocumentVisibilityPredicate(query, input)\n  addDocumentRelationPredicate(query, input)\n  addDocumentFavoritePredicate(query, input)\n  if (input.search?.trim()) {\n    query.andWhere('document.title ilike ?', [`%${escapeLikePattern(input.search.trim())}%`])\n  }\n  if (input.folderId) {\n    query.andWhere({ folderId: input.folderId })\n  }\n  return query\n}\n\nexport async function getVisibleDocumentPage(\n  input: GetVisibleDocumentPageInput,\n): Promise<VisibleDocumentPage> {\n  assertPageInput(input.page, input.pageSize)\n\n  const query = buildVisibleDocumentQuery(input)\n    .select([\n      'document.id',\n      relationshipTierSelection(input),\n      raw('count(*) over() as \"total\"'),\n    ])\n  const rawRows = await query\n    .orderBy({ updatedAt: 'DESC', id: 'ASC' })\n    .limit(input.pageSize)\n    .offset((input.page - 1) * input.pageSize)\n    .execute<RawVisibleDocumentRow[]>('all', false)\n\n  const rows = rawRows.flatMap((row): VisibleDocumentPageRow[] => {\n    if (typeof row.id !== 'string' || row.id.length === 0) return []\n    return [{\n      id: row.id,\n      relationshipTier: normalizeTier(row.relationshipTier ?? row.relationship_tier),\n      total: normalizeTotal(row.total),\n    }]\n  })\n  if (rows.length > 0 || input.page === 1) {\n    return { rows, total: rows[0]?.total ?? 0 }\n  }\n\n  // A window count has no carrier row when the requested offset is beyond the\n  // last page. Keep the fast one-query path for normal pages and issue one\n  // bounded fallback count only for an empty out-of-range page.\n  const total = await buildVisibleDocumentQuery(input).getCount('document.id')\n  return { rows, total: normalizeTotal(total) }\n}\n\nasync function getDirectVisibleFolderIds(input: GetVisibleFoldersInput): Promise<Set<string>> {\n  const query = input.em\n    .createQueryBuilder(Document, 'document')\n    .select('document.folderId', true)\n    .where({\n      tenantId: input.tenantId,\n      organizationId: input.organizationId,\n      deletedAt: null,\n      folderId: { $ne: null },\n    })\n  addDocumentVisibilityPredicate(query, input)\n\n  const rows = await query.execute<RawFolderIdRow[]>('all')\n  return new Set(rows.flatMap((row) => {\n    const folderId = row.folderId ?? row.folder_id\n    return typeof folderId === 'string' && folderId.length > 0 ? [folderId] : []\n  }))\n}\n\nfunction assertFolderHierarchyContract(\n  foldersById: ReadonlyMap<string, DocumentFolder>,\n  requiredFolderIds?: Iterable<string>,\n): void {\n  if (requiredFolderIds) {\n    for (const folderId of requiredFolderIds) {\n      if (!foldersById.has(folderId)) {\n        throw new Error('[internal] Visible folder hierarchy contains an unresolved folder')\n      }\n    }\n  }\n\n  for (const folder of foldersById.values()) {\n    const visited = new Set<string>()\n    let current: DocumentFolder | undefined = folder\n    let depth = 0\n    while (current) {\n      if (visited.has(current.id)) {\n        throw new Error('[internal] Folder hierarchy contains a cycle')\n      }\n      visited.add(current.id)\n      depth += 1\n      if (depth > DOCUMENTS_MAX_FOLDER_DEPTH) {\n        throw new Error('[internal] Folder hierarchy exceeds the supported depth')\n      }\n      if (!current.parentFolderId) break\n      current = foldersById.get(current.parentFolderId)\n      if (!current) {\n        throw new Error('[internal] Folder hierarchy contains an unresolved ancestor')\n      }\n    }\n  }\n}\n\n/**\n * Truncating a name-ordered listing can cut a parent while keeping its\n * children. Retaining only what a root still reaches leaves a coherent tree the\n * organization can prune back under the cap, instead of failing the whole\n * listing on an ancestor the bound removed.\n */\nfunction retainFoldersReachableFromRoots(folders: readonly DocumentFolder[]): DocumentFolder[] {\n  const childrenByParentId = new Map<string, DocumentFolder[]>()\n  for (const folder of folders) {\n    if (!folder.parentFolderId) continue\n    const siblings = childrenByParentId.get(folder.parentFolderId)\n    if (siblings) siblings.push(folder)\n    else childrenByParentId.set(folder.parentFolderId, [folder])\n  }\n\n  const reachableIds = new Set<string>()\n  const pending = folders.filter((folder) => !folder.parentFolderId)\n  for (let index = 0; index < pending.length; index += 1) {\n    const folder = pending[index]\n    reachableIds.add(folder.id)\n    const children = childrenByParentId.get(folder.id)\n    if (children) pending.push(...children)\n  }\n  return folders.filter((folder) => reachableIds.has(folder.id))\n}\n\nexport async function getVisibleFolders(input: GetVisibleFoldersInput): Promise<VisibleFolderRow[]> {\n  const scope = {\n    tenantId: input.tenantId,\n    organizationId: input.organizationId,\n    deletedAt: null,\n  }\n  if (input.managerOverride) {\n    const folders = await findWithDecryption(\n      input.em,\n      DocumentFolder,\n      scope,\n      { orderBy: { name: 'ASC' }, limit: DOCUMENTS_MAX_LISTED_FOLDERS + 1 },\n      { tenantId: input.tenantId, organizationId: input.organizationId },\n    )\n    // Creation is capped well below this bound, so only an organization that\n    // predates the cap can overflow. Degrade that one to a listable subtree\n    // rather than letting the hierarchy contract reject the whole listing.\n    const listed = folders.length > DOCUMENTS_MAX_LISTED_FOLDERS\n      ? retainFoldersReachableFromRoots(folders.slice(0, DOCUMENTS_MAX_LISTED_FOLDERS))\n      : folders\n    assertFolderHierarchyContract(new Map(listed.map((folder) => [folder.id, folder])))\n    return listed.map((folder) => ({\n      folder,\n      canEdit: input.canEditAction,\n      visibility: 'owned',\n    }))\n  }\n\n  const [ownedFolders, directlyVisibleFolderIds] = await Promise.all([\n    findWithDecryption(\n      input.em,\n      DocumentFolder,\n      { ...scope, ownerUserId: input.userId },\n      undefined,\n      { tenantId: input.tenantId, organizationId: input.organizationId },\n    ),\n    getDirectVisibleFolderIds(input),\n  ])\n  const foldersById = new Map(ownedFolders.map((folder) => [folder.id, folder]))\n  const visibilityById = new Map<string, FolderVisibility>()\n  for (const folder of ownedFolders) visibilityById.set(folder.id, 'owned')\n  for (const folderId of directlyVisibleFolderIds) {\n    if (!visibilityById.has(folderId)) visibilityById.set(folderId, 'contains-visible')\n  }\n\n  let pendingIds = new Set<string>([\n    ...directlyVisibleFolderIds,\n    ...ownedFolders.flatMap((folder) => folder.parentFolderId ? [folder.parentFolderId] : []),\n  ].filter((folderId) => !foldersById.has(folderId)))\n\n  for (let depth = 0; pendingIds.size > 0 && depth < DOCUMENTS_MAX_FOLDER_DEPTH; depth += 1) {\n    const batchIds = Array.from(pendingIds)\n    pendingIds = new Set()\n    const folders = await findWithDecryption(\n      input.em,\n      DocumentFolder,\n      {\n        ...scope,\n        id: { $in: batchIds },\n      },\n      undefined,\n      { tenantId: input.tenantId, organizationId: input.organizationId },\n    )\n    for (const folder of folders) {\n      foldersById.set(folder.id, folder)\n      if (!visibilityById.has(folder.id)) visibilityById.set(folder.id, 'ancestor')\n      if (folder.parentFolderId && !foldersById.has(folder.parentFolderId)) {\n        pendingIds.add(folder.parentFolderId)\n      }\n    }\n  }\n\n  if (pendingIds.size > 0) {\n    throw new Error('[internal] Folder hierarchy exceeds the supported depth')\n  }\n  assertFolderHierarchyContract(foldersById, visibilityById.keys())\n\n  return Array.from(foldersById.values())\n    .sort((left, right) => left.name.localeCompare(right.name))\n    .map((folder) => ({\n      folder,\n      canEdit: input.canEditAction && folder.ownerUserId === input.userId,\n      visibility: visibilityById.get(folder.id) ?? 'ancestor',\n    }))\n}\n\ntype AncestorInspection = {\n  depth: number\n  issue: FolderPlacementIssue | null\n}\n\nasync function inspectFolderAncestors(\n  input: FolderMutationScope & { folderId?: string | null; parentFolderId: string | null },\n): Promise<AncestorInspection> {\n  const scope = {\n    tenantId: input.tenantId,\n    organizationId: input.organizationId,\n    deletedAt: null,\n  }\n  const visited = new Set<string>()\n  let ancestorId = input.parentFolderId\n  let depth = 0\n\n  while (ancestorId) {\n    if (ancestorId === input.folderId || visited.has(ancestorId)) {\n      return { depth, issue: 'cycle' }\n    }\n    if (depth >= DOCUMENTS_MAX_FOLDER_DEPTH) {\n      return { depth, issue: 'depth' }\n    }\n    visited.add(ancestorId)\n    const ancestor = await findOneWithDecryption(\n      input.em,\n      DocumentFolder,\n      {\n        ...scope,\n        id: ancestorId,\n      },\n      undefined,\n      { tenantId: input.tenantId, organizationId: input.organizationId },\n    )\n    if (!ancestor) return { depth, issue: 'missing-parent' }\n    depth += 1\n    ancestorId = ancestor.parentFolderId ?? null\n  }\n\n  return { depth, issue: null }\n}\n\nasync function inspectFolderSubtree(\n  input: FolderMutationScope & { folderId: string },\n  parentDepth: number,\n): Promise<FolderPlacementIssue | null> {\n  const scope = {\n    tenantId: input.tenantId,\n    organizationId: input.organizationId,\n    deletedAt: null,\n  }\n  const visited = new Set([input.folderId])\n  let frontier = [input.folderId]\n  let subtreeDepth = 1\n\n  while (frontier.length > 0) {\n    if (parentDepth + subtreeDepth > DOCUMENTS_MAX_FOLDER_DEPTH) return 'depth'\n    const children = await findWithDecryption(\n      input.em,\n      DocumentFolder,\n      {\n        ...scope,\n        parentFolderId: { $in: frontier },\n      },\n      { fields: ['id', 'parentFolderId'] as const },\n      { tenantId: input.tenantId, organizationId: input.organizationId },\n    )\n    if (children.length === 0) return null\n\n    const nextFrontier: string[] = []\n    for (const child of children) {\n      if (visited.has(child.id)) return 'cycle'\n      visited.add(child.id)\n      nextFrontier.push(child.id)\n    }\n    frontier = nextFrontier\n    subtreeDepth += 1\n  }\n\n  return null\n}\n\n/**\n * Validates a proposed create/move against the same depth contract used by\n * folder visibility. A move includes the deepest descendant of the moved\n * subtree, so relocating a shallow parent cannot push hidden descendants past\n * the supported depth.\n */\nexport async function getFolderPlacementIssue(\n  input: FolderMutationScope & { folderId?: string | null; parentFolderId: string | null },\n): Promise<FolderPlacementIssue | null> {\n  const ancestors = await inspectFolderAncestors(input)\n  if (ancestors.issue) return ancestors.issue\n  if (!input.folderId) {\n    return ancestors.depth + 1 > DOCUMENTS_MAX_FOLDER_DEPTH ? 'depth' : null\n  }\n  return inspectFolderSubtree({\n    em: input.em,\n    tenantId: input.tenantId,\n    organizationId: input.organizationId,\n    folderId: input.folderId,\n  }, ancestors.depth)\n}\n\nexport async function wouldCreateFolderCycle(\n  input: FolderMutationScope & { folderId: string; parentFolderId: string },\n): Promise<boolean> {\n  const inspection = await inspectFolderAncestors(input)\n  return inspection.issue === 'cycle' || inspection.issue === 'depth'\n}\n\nexport async function hasActiveFolderContents(\n  input: FolderMutationScope & { folderId: string },\n): Promise<boolean> {\n  const scope = {\n    tenantId: input.tenantId,\n    organizationId: input.organizationId,\n    deletedAt: null,\n  }\n  const [childFolder, document] = await Promise.all([\n    findOneWithDecryption(\n      input.em,\n      DocumentFolder,\n      {\n        ...scope,\n        parentFolderId: input.folderId,\n      },\n      { fields: ['id'] as const },\n      { tenantId: input.tenantId, organizationId: input.organizationId },\n    ),\n    findOneWithDecryption(\n      input.em,\n      Document,\n      {\n        ...scope,\n        folderId: input.folderId,\n      },\n      { fields: ['id'] as const },\n      { tenantId: input.tenantId, organizationId: input.organizationId },\n    ),\n  ])\n  return Boolean(childFolder || document)\n}\n"],
+  "mappings": "AAAA,SAAS,WAAW;AAEpB,SAAS,yBAAyB;AAClC,SAAS,uBAAuB,0BAA0B;AAC1D,SAAS,UAAU,sBAAsB;AAEzC,SAAS,4BAA4B,oCAAoC;AA0EzE,SAAS,iBAAiB,SAAsC;AAC9D,SAAO,MAAM,KAAK,IAAI,IAAI,QAAQ,IAAI,CAAC,WAAW,OAAO,KAAK,CAAC,EAAE,OAAO,OAAO,CAAC,CAAC;AACnF;AAEA,SAAS,mBACP,YACA,QACA,SACoB;AACpB,QAAM,oBAAoB,iBAAiB,OAAO;AAClD,MAAI,kBAAkB,WAAW,GAAG;AAClC,WAAO;AAAA,MACL,KAAK,IAAI,UAAU,gCAAgC,UAAU;AAAA,MAC7D,QAAQ,CAAC,MAAM;AAAA,IACjB;AAAA,EACF;AAEA,QAAM,mBAAmB,kBAAkB,IAAI,MAAM,GAAG,EAAE,KAAK,IAAI;AACnE,SAAO;AAAA,IACL,KAAK;AAAA,SACA,UAAU,gCAAgC,UAAU;AAAA,YACjD,UAAU,gCAAgC,UAAU,qBAAqB,gBAAgB;AAAA;AAAA,IAEjG,QAAQ,CAAC,QAAQ,GAAG,iBAAiB;AAAA,EACvC;AACF;AAEA,SAAS,qBACP,YACA,eACA,OACoB;AACpB,QAAM,YAAY,mBAAmB,YAAY,MAAM,QAAQ,MAAM,OAAO;AAC5E,SAAO;AAAA,IACL,KAAK;AAAA,QACD,UAAU,kBAAkB,aAAa;AAAA,YACrC,UAAU;AAAA,YACV,UAAU;AAAA,YACV,UAAU;AAAA,YACV,UAAU,GAAG;AAAA;AAAA,IAErB,QAAQ,CAAC,MAAM,UAAU,MAAM,gBAAgB,GAAG,UAAU,MAAM;AAAA,EACpE;AACF;AAEA,SAAS,0BAA0B,OAAoC;AACrE,QAAM,QAAQ,qBAAqB,cAAc,YAAY,KAAK;AAClE,SAAO,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,gBAMG,MAAM,GAAG;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAUpB,CAAC,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC;AACpC;AAEA,SAAS,+BACP,OACA,OAIM;AACN,MAAI,MAAM,gBAAiB;AAC3B,QAAM,QAAQ,qBAAqB,iBAAiB,YAAY,KAAK;AACrE,QAAM,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA,cAKH,MAAM,GAAG;AAAA;AAAA,MAEjB,CAAC,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC;AACrC;AAEA,MAAM,0BAA8D;AAAA,EAClE,mBAAmB;AAAA,EACnB,oBAAoB;AAAA,EACpB,MAAM;AAAA,EACN,SAAS;AAAA,EACT,iBAAiB;AAAA,EACjB,OAAO;AAAA,EACP,eAAe;AAAA,EACf,UAAU;AACZ;AAEA,SAAS,6BACP,OACA,OACM;AACN,MAAI,CAAC,MAAM,eAAgB;AAC3B,QAAM,SAAS,wBAAwB,MAAM,eAAe,UAAU;AACtE,QAAM,eAAe,MAAM,eAAe,eAAe,oBACrD,WACA,MAAM,eAAe,eAAe,qBAClC,YACA;AACN,QAAM,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,0BAOS,MAAM;AAAA,QACxB,eAAe,wCAAwC,EAAE;AAAA,MAC3D;AAAA,IACF,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM,eAAe;AAAA,IACrB,GAAI,eAAe,CAAC,YAAY,IAAI,CAAC;AAAA,EACvC,CAAC;AACH;AAEA,SAAS,6BACP,OACA,OAIM;AACN,MAAI,CAAC,MAAM,eAAgB;AAC3B,QAAM,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQX,CAAC,MAAM,UAAU,MAAM,gBAAgB,MAAM,cAAc,CAAC;AAClE;AAEA,SAAS,cAAc,OAAqC;AAC1D,SAAO,UAAU,WAAW,UAAU,YAAY,UAAU,eAAe,UAAU,WACjF,QACA;AACN;AAEA,SAAS,eAAe,OAAwB;AAC9C,QAAM,SAAS,OAAO,UAAU,WAAW,OAAO,KAAK,IAAI,OAAO,SAAS,CAAC;AAC5E,SAAO,OAAO,SAAS,MAAM,KAAK,UAAU,IAAI,SAAS;AAC3D;AAEA,SAAS,gBAAgB,MAAc,UAAwB;AAC7D,MAAI,CAAC,OAAO,UAAU,IAAI,KAAK,OAAO,KAAK,CAAC,OAAO,UAAU,QAAQ,KAAK,WAAW,KAAK,WAAW,KAAK;AACxG,UAAM,IAAI,MAAM,kDAAkD;AAAA,EACpE;AACF;AAEA,SAAS,0BAA0B,OAAoC;AACrE,QAAM,WAAW,MAAM,YAAY;AACnC,QAAM,QAAQ,MAAM,GACjB,mBAAmB,UAAU,UAAU,EACvC,MAAM;AAAA,IACL,UAAU,MAAM;AAAA,IAChB,gBAAgB,MAAM;AAAA,IACtB,WAAW;AAAA,IACX,GAAI,MAAM,KAAK,EAAE,IAAI,MAAM,GAAG,IAAI,CAAC;AAAA,IACnC,GAAI,CAAC,MAAM,MAAM,aAAa,YAAY,EAAE,YAAY,KAAK,IAAI,CAAC;AAAA,IAClE,GAAI,CAAC,MAAM,MAAM,aAAa,SAAS,EAAE,YAAY,EAAE,KAAK,KAAK,EAAE,IAAI,CAAC;AAAA,EAC1E,CAAC;AAEH,iCAA+B,OAAO,KAAK;AAC3C,+BAA6B,OAAO,KAAK;AACzC,+BAA6B,OAAO,KAAK;AACzC,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,UAAM,SAAS,0BAA0B,CAAC,IAAI,kBAAkB,MAAM,OAAO,KAAK,CAAC,CAAC,GAAG,CAAC;AAAA,EAC1F;AACA,MAAI,MAAM,UAAU;AAClB,UAAM,SAAS,EAAE,UAAU,MAAM,SAAS,CAAC;AAAA,EAC7C;AACA,SAAO;AACT;AAEA,eAAsB,uBACpB,OAC8B;AAC9B,kBAAgB,MAAM,MAAM,MAAM,QAAQ;AAE1C,QAAM,QAAQ,0BAA0B,KAAK,EAC1C,OAAO;AAAA,IACN;AAAA,IACA,0BAA0B,KAAK;AAAA,IAC/B,IAAI,4BAA4B;AAAA,EAClC,CAAC;AACH,QAAM,UAAU,MAAM,MACnB,QAAQ,EAAE,WAAW,QAAQ,IAAI,MAAM,CAAC,EACxC,MAAM,MAAM,QAAQ,EACpB,QAAQ,MAAM,OAAO,KAAK,MAAM,QAAQ,EACxC,QAAiC,OAAO,KAAK;AAEhD,QAAM,OAAO,QAAQ,QAAQ,CAAC,QAAkC;AAC9D,QAAI,OAAO,IAAI,OAAO,YAAY,IAAI,GAAG,WAAW,EAAG,QAAO,CAAC;AAC/D,WAAO,CAAC;AAAA,MACN,IAAI,IAAI;AAAA,MACR,kBAAkB,cAAc,IAAI,oBAAoB,IAAI,iBAAiB;AAAA,MAC7E,OAAO,eAAe,IAAI,KAAK;AAAA,IACjC,CAAC;AAAA,EACH,CAAC;AACD,MAAI,KAAK,SAAS,KAAK,MAAM,SAAS,GAAG;AACvC,WAAO,EAAE,MAAM,OAAO,KAAK,CAAC,GAAG,SAAS,EAAE;AAAA,EAC5C;AAKA,QAAM,QAAQ,MAAM,0BAA0B,KAAK,EAAE,SAAS,aAAa;AAC3E,SAAO,EAAE,MAAM,OAAO,eAAe,KAAK,EAAE;AAC9C;AAEA,eAAe,0BAA0B,OAAqD;AAC5F,QAAM,QAAQ,MAAM,GACjB,mBAAmB,UAAU,UAAU,EACvC,OAAO,qBAAqB,IAAI,EAChC,MAAM;AAAA,IACL,UAAU,MAAM;AAAA,IAChB,gBAAgB,MAAM;AAAA,IACtB,WAAW;AAAA,IACX,UAAU,EAAE,KAAK,KAAK;AAAA,EACxB,CAAC;AACH,iCAA+B,OAAO,KAAK;AAE3C,QAAM,OAAO,MAAM,MAAM,QAA0B,KAAK;AACxD,SAAO,IAAI,IAAI,KAAK,QAAQ,CAAC,QAAQ;AACnC,UAAM,WAAW,IAAI,YAAY,IAAI;AACrC,WAAO,OAAO,aAAa,YAAY,SAAS,SAAS,IAAI,CAAC,QAAQ,IAAI,CAAC;AAAA,EAC7E,CAAC,CAAC;AACJ;AAEA,SAAS,8BACP,aACA,mBACM;AACN,MAAI,mBAAmB;AACrB,eAAW,YAAY,mBAAmB;AACxC,UAAI,CAAC,YAAY,IAAI,QAAQ,GAAG;AAC9B,cAAM,IAAI,MAAM,mEAAmE;AAAA,MACrF;AAAA,IACF;AAAA,EACF;AAEA,aAAW,UAAU,YAAY,OAAO,GAAG;AACzC,UAAM,UAAU,oBAAI,IAAY;AAChC,QAAI,UAAsC;AAC1C,QAAI,QAAQ;AACZ,WAAO,SAAS;AACd,UAAI,QAAQ,IAAI,QAAQ,EAAE,GAAG;AAC3B,cAAM,IAAI,MAAM,8CAA8C;AAAA,MAChE;AACA,cAAQ,IAAI,QAAQ,EAAE;AACtB,eAAS;AACT,UAAI,QAAQ,4BAA4B;AACtC,cAAM,IAAI,MAAM,yDAAyD;AAAA,MAC3E;AACA,UAAI,CAAC,QAAQ,eAAgB;AAC7B,gBAAU,YAAY,IAAI,QAAQ,cAAc;AAChD,UAAI,CAAC,SAAS;AACZ,cAAM,IAAI,MAAM,6DAA6D;AAAA,MAC/E;AAAA,IACF;AAAA,EACF;AACF;AAQA,SAAS,gCAAgC,SAAsD;AAC7F,QAAM,qBAAqB,oBAAI,IAA8B;AAC7D,aAAW,UAAU,SAAS;AAC5B,QAAI,CAAC,OAAO,eAAgB;AAC5B,UAAM,WAAW,mBAAmB,IAAI,OAAO,cAAc;AAC7D,QAAI,SAAU,UAAS,KAAK,MAAM;AAAA,QAC7B,oBAAmB,IAAI,OAAO,gBAAgB,CAAC,MAAM,CAAC;AAAA,EAC7D;AAEA,QAAM,eAAe,oBAAI,IAAY;AACrC,QAAM,UAAU,QAAQ,OAAO,CAAC,WAAW,CAAC,OAAO,cAAc;AACjE,WAAS,QAAQ,GAAG,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AACtD,UAAM,SAAS,QAAQ,KAAK;AAC5B,iBAAa,IAAI,OAAO,EAAE;AAC1B,UAAM,WAAW,mBAAmB,IAAI,OAAO,EAAE;AACjD,QAAI,SAAU,SAAQ,KAAK,GAAG,QAAQ;AAAA,EACxC;AACA,SAAO,QAAQ,OAAO,CAAC,WAAW,aAAa,IAAI,OAAO,EAAE,CAAC;AAC/D;AAEA,eAAsB,kBAAkB,OAA4D;AAClG,QAAM,QAAQ;AAAA,IACZ,UAAU,MAAM;AAAA,IAChB,gBAAgB,MAAM;AAAA,IACtB,WAAW;AAAA,EACb;AACA,MAAI,MAAM,iBAAiB;AACzB,UAAM,UAAU,MAAM;AAAA,MACpB,MAAM;AAAA,MACN;AAAA,MACA;AAAA,MACA,EAAE,SAAS,EAAE,MAAM,MAAM,GAAG,OAAO,+BAA+B,EAAE;AAAA,MACpE,EAAE,UAAU,MAAM,UAAU,gBAAgB,MAAM,eAAe;AAAA,IACnE;AAIA,UAAM,SAAS,QAAQ,SAAS,+BAC5B,gCAAgC,QAAQ,MAAM,GAAG,4BAA4B,CAAC,IAC9E;AACJ,kCAA8B,IAAI,IAAI,OAAO,IAAI,CAAC,WAAW,CAAC,OAAO,IAAI,MAAM,CAAC,CAAC,CAAC;AAClF,WAAO,OAAO,IAAI,CAAC,YAAY;AAAA,MAC7B;AAAA,MACA,SAAS,MAAM;AAAA,MACf,YAAY;AAAA,IACd,EAAE;AAAA,EACJ;AAEA,QAAM,CAAC,cAAc,wBAAwB,IAAI,MAAM,QAAQ,IAAI;AAAA,IACjE;AAAA,MACE,MAAM;AAAA,MACN;AAAA,MACA,EAAE,GAAG,OAAO,aAAa,MAAM,OAAO;AAAA,MACtC;AAAA,MACA,EAAE,UAAU,MAAM,UAAU,gBAAgB,MAAM,eAAe;AAAA,IACnE;AAAA,IACA,0BAA0B,KAAK;AAAA,EACjC,CAAC;AACD,QAAM,cAAc,IAAI,IAAI,aAAa,IAAI,CAAC,WAAW,CAAC,OAAO,IAAI,MAAM,CAAC,CAAC;AAC7E,QAAM,iBAAiB,oBAAI,IAA8B;AACzD,aAAW,UAAU,aAAc,gBAAe,IAAI,OAAO,IAAI,OAAO;AACxE,aAAW,YAAY,0BAA0B;AAC/C,QAAI,CAAC,eAAe,IAAI,QAAQ,EAAG,gBAAe,IAAI,UAAU,kBAAkB;AAAA,EACpF;AAEA,MAAI,aAAa,IAAI,IAAY;AAAA,IAC/B,GAAG;AAAA,IACH,GAAG,aAAa,QAAQ,CAAC,WAAW,OAAO,iBAAiB,CAAC,OAAO,cAAc,IAAI,CAAC,CAAC;AAAA,EAC1F,EAAE,OAAO,CAAC,aAAa,CAAC,YAAY,IAAI,QAAQ,CAAC,CAAC;AAElD,WAAS,QAAQ,GAAG,WAAW,OAAO,KAAK,QAAQ,4BAA4B,SAAS,GAAG;AACzF,UAAM,WAAW,MAAM,KAAK,UAAU;AACtC,iBAAa,oBAAI,IAAI;AACrB,UAAM,UAAU,MAAM;AAAA,MACpB,MAAM;AAAA,MACN;AAAA,MACA;AAAA,QACE,GAAG;AAAA,QACH,IAAI,EAAE,KAAK,SAAS;AAAA,MACtB;AAAA,MACA;AAAA,MACA,EAAE,UAAU,MAAM,UAAU,gBAAgB,MAAM,eAAe;AAAA,IACnE;AACA,eAAW,UAAU,SAAS;AAC5B,kBAAY,IAAI,OAAO,IAAI,MAAM;AACjC,UAAI,CAAC,eAAe,IAAI,OAAO,EAAE,EAAG,gBAAe,IAAI,OAAO,IAAI,UAAU;AAC5E,UAAI,OAAO,kBAAkB,CAAC,YAAY,IAAI,OAAO,cAAc,GAAG;AACpE,mBAAW,IAAI,OAAO,cAAc;AAAA,MACtC;AAAA,IACF;AAAA,EACF;AAEA,MAAI,WAAW,OAAO,GAAG;AACvB,UAAM,IAAI,MAAM,yDAAyD;AAAA,EAC3E;AACA,gCAA8B,aAAa,eAAe,KAAK,CAAC;AAEhE,SAAO,MAAM,KAAK,YAAY,OAAO,CAAC,EACnC,KAAK,CAAC,MAAM,UAAU,KAAK,KAAK,cAAc,MAAM,IAAI,CAAC,EACzD,IAAI,CAAC,YAAY;AAAA,IAChB;AAAA,IACA,SAAS,MAAM,iBAAiB,OAAO,gBAAgB,MAAM;AAAA,IAC7D,YAAY,eAAe,IAAI,OAAO,EAAE,KAAK;AAAA,EAC/C,EAAE;AACN;AAOA,eAAe,uBACb,OAC6B;AAC7B,QAAM,QAAQ;AAAA,IACZ,UAAU,MAAM;AAAA,IAChB,gBAAgB,MAAM;AAAA,IACtB,WAAW;AAAA,EACb;AACA,QAAM,UAAU,oBAAI,IAAY;AAChC,MAAI,aAAa,MAAM;AACvB,MAAI,QAAQ;AAEZ,SAAO,YAAY;AACjB,QAAI,eAAe,MAAM,YAAY,QAAQ,IAAI,UAAU,GAAG;AAC5D,aAAO,EAAE,OAAO,OAAO,QAAQ;AAAA,IACjC;AACA,QAAI,SAAS,4BAA4B;AACvC,aAAO,EAAE,OAAO,OAAO,QAAQ;AAAA,IACjC;AACA,YAAQ,IAAI,UAAU;AACtB,UAAM,WAAW,MAAM;AAAA,MACrB,MAAM;AAAA,MACN;AAAA,MACA;AAAA,QACE,GAAG;AAAA,QACH,IAAI;AAAA,MACN;AAAA,MACA;AAAA,MACA,EAAE,UAAU,MAAM,UAAU,gBAAgB,MAAM,eAAe;AAAA,IACnE;AACA,QAAI,CAAC,SAAU,QAAO,EAAE,OAAO,OAAO,iBAAiB;AACvD,aAAS;AACT,iBAAa,SAAS,kBAAkB;AAAA,EAC1C;AAEA,SAAO,EAAE,OAAO,OAAO,KAAK;AAC9B;AAEA,eAAe,qBACb,OACA,aACsC;AACtC,QAAM,QAAQ;AAAA,IACZ,UAAU,MAAM;AAAA,IAChB,gBAAgB,MAAM;AAAA,IACtB,WAAW;AAAA,EACb;AACA,QAAM,UAAU,oBAAI,IAAI,CAAC,MAAM,QAAQ,CAAC;AACxC,MAAI,WAAW,CAAC,MAAM,QAAQ;AAC9B,MAAI,eAAe;AAEnB,SAAO,SAAS,SAAS,GAAG;AAC1B,QAAI,cAAc,eAAe,2BAA4B,QAAO;AACpE,UAAM,WAAW,MAAM;AAAA,MACrB,MAAM;AAAA,MACN;AAAA,MACA;AAAA,QACE,GAAG;AAAA,QACH,gBAAgB,EAAE,KAAK,SAAS;AAAA,MAClC;AAAA,MACA,EAAE,QAAQ,CAAC,MAAM,gBAAgB,EAAW;AAAA,MAC5C,EAAE,UAAU,MAAM,UAAU,gBAAgB,MAAM,eAAe;AAAA,IACnE;AACA,QAAI,SAAS,WAAW,EAAG,QAAO;AAElC,UAAM,eAAyB,CAAC;AAChC,eAAW,SAAS,UAAU;AAC5B,UAAI,QAAQ,IAAI,MAAM,EAAE,EAAG,QAAO;AAClC,cAAQ,IAAI,MAAM,EAAE;AACpB,mBAAa,KAAK,MAAM,EAAE;AAAA,IAC5B;AACA,eAAW;AACX,oBAAgB;AAAA,EAClB;AAEA,SAAO;AACT;AAQA,eAAsB,wBACpB,OACsC;AACtC,QAAM,YAAY,MAAM,uBAAuB,KAAK;AACpD,MAAI,UAAU,MAAO,QAAO,UAAU;AACtC,MAAI,CAAC,MAAM,UAAU;AACnB,WAAO,UAAU,QAAQ,IAAI,6BAA6B,UAAU;AAAA,EACtE;AACA,SAAO,qBAAqB;AAAA,IAC1B,IAAI,MAAM;AAAA,IACV,UAAU,MAAM;AAAA,IAChB,gBAAgB,MAAM;AAAA,IACtB,UAAU,MAAM;AAAA,EAClB,GAAG,UAAU,KAAK;AACpB;AAEA,eAAsB,uBACpB,OACkB;AAClB,QAAM,aAAa,MAAM,uBAAuB,KAAK;AACrD,SAAO,WAAW,UAAU,WAAW,WAAW,UAAU;AAC9D;AAEA,eAAsB,wBACpB,OACkB;AAClB,QAAM,QAAQ;AAAA,IACZ,UAAU,MAAM;AAAA,IAChB,gBAAgB,MAAM;AAAA,IACtB,WAAW;AAAA,EACb;AACA,QAAM,CAAC,aAAa,QAAQ,IAAI,MAAM,QAAQ,IAAI;AAAA,IAChD;AAAA,MACE,MAAM;AAAA,MACN;AAAA,MACA;AAAA,QACE,GAAG;AAAA,QACH,gBAAgB,MAAM;AAAA,MACxB;AAAA,MACA,EAAE,QAAQ,CAAC,IAAI,EAAW;AAAA,MAC1B,EAAE,UAAU,MAAM,UAAU,gBAAgB,MAAM,eAAe;AAAA,IACnE;AAAA,IACA;AAAA,MACE,MAAM;AAAA,MACN;AAAA,MACA;AAAA,QACE,GAAG;AAAA,QACH,UAAU,MAAM;AAAA,MAClB;AAAA,MACA,EAAE,QAAQ,CAAC,IAAI,EAAW;AAAA,MAC1B,EAAE,UAAU,MAAM,UAAU,gBAAgB,MAAM,eAAe;AAAA,IACnE;AAAA,EACF,CAAC;AACD,SAAO,QAAQ,eAAe,QAAQ;AACxC;",
+  "names": []
+}

package/dist/modules/documents/lib/watchers.js

@@ -0,0 +1,106 @@
+import { findOneWithDecryption, findWithDecryption } from "@open-mercato/shared/lib/encryption/find";
+import { createLogger } from "@open-mercato/shared/lib/logger";
+import { DocumentWatcher } from "../data/entities.js";
+import { loadScopedDocument, resolveLoadedDocumentUserAccess } from "./permissions.js";
+const logger = createLogger("documents").child({ component: "watchers" });
+const DOCUMENTS_MAX_ACTIVE_WATCHERS = 100;
+const WATCHER_ACCESS_RESOLUTION_CONCURRENCY = 4;
+async function resolveWatcherRecipients(input) {
+  let watchers;
+  try {
+    watchers = await findWithDecryption(
+      input.em,
+      DocumentWatcher,
+      {
+        documentId: input.documentId,
+        tenantId: input.scope.tenantId,
+        organizationId: input.scope.organizationId,
+        deletedAt: null
+      },
+      {
+        fields: ["userId"],
+        orderBy: { createdAt: "ASC", id: "ASC" },
+        limit: DOCUMENTS_MAX_ACTIVE_WATCHERS
+      },
+      input.scope
+    );
+  } catch (error) {
+    logger.error("Watcher recipient lookup failed", {
+      documentId: input.documentId,
+      err: error
+    });
+    return [];
+  }
+  const excludedUserIds = /* @__PURE__ */ new Set([
+    input.actorUserId.toLowerCase(),
+    ...(input.excludeUserIds ?? []).map((userId) => userId.toLowerCase())
+  ]);
+  const candidates = watchers.filter(
+    (watcher) => !excludedUserIds.has(watcher.userId.toLowerCase())
+  );
+  if (candidates.length === 0) return [];
+  const scopedDocument = await loadScopedDocument(
+    input.em,
+    input.documentId,
+    input.scope
+  ).catch((error) => {
+    logger.error("Watcher document lookup failed", {
+      documentId: input.documentId,
+      err: error
+    });
+    return null;
+  });
+  if (!scopedDocument) return [];
+  const permitted = new Array(candidates.length).fill(null);
+  let nextIndex = 0;
+  const workers = Array.from(
+    { length: Math.min(WATCHER_ACCESS_RESOLUTION_CONCURRENCY, candidates.length) },
+    async () => {
+      while (nextIndex < candidates.length) {
+        const index = nextIndex;
+        nextIndex += 1;
+        const watcher = candidates[index];
+        try {
+          const tier = await resolveLoadedDocumentUserAccess(
+            input.em,
+            scopedDocument,
+            input.scope,
+            watcher.userId,
+            input.container
+          );
+          if (tier) permitted[index] = watcher.userId;
+        } catch (error) {
+          logger.error("Watcher access resolution failed", {
+            documentId: input.documentId,
+            recipientUserId: watcher.userId,
+            err: error
+          });
+        }
+      }
+    }
+  );
+  await Promise.all(workers);
+  return permitted.filter((userId) => userId !== null);
+}
+async function isDocumentWatched(em, scope, documentId) {
+  const watcher = await findOneWithDecryption(
+    em,
+    DocumentWatcher,
+    {
+      documentId,
+      userId: scope.userId,
+      tenantId: scope.tenantId,
+      organizationId: scope.organizationId,
+      deletedAt: null
+    },
+    { fields: ["id"] },
+    scope
+  );
+  return watcher !== null;
+}
+export {
+  DOCUMENTS_MAX_ACTIVE_WATCHERS,
+  isDocumentWatched,
+  resolveWatcherRecipients
+};
+//# sourceMappingURL=watchers.js.map

package/dist/modules/documents/lib/watchers.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../src/modules/documents/lib/watchers.ts"],
+  "sourcesContent": ["import type { EntityManager } from '@mikro-orm/postgresql'\nimport { findOneWithDecryption, findWithDecryption } from '@open-mercato/shared/lib/encryption/find'\nimport { createLogger } from '@open-mercato/shared/lib/logger'\nimport { DocumentWatcher } from '../data/entities'\nimport { loadScopedDocument, resolveLoadedDocumentUserAccess } from './permissions'\nimport type { DocumentsServiceContainer } from './platformServices'\n\nconst logger = createLogger('documents').child({ component: 'watchers' })\n\nexport const DOCUMENTS_MAX_ACTIVE_WATCHERS = 100\nconst WATCHER_ACCESS_RESOLUTION_CONCURRENCY = 4\n\nexport type DocumentWatcherScope = {\n  tenantId: string\n  organizationId: string\n}\n\nexport async function resolveWatcherRecipients(input: {\n  em: EntityManager\n  container: DocumentsServiceContainer\n  scope: DocumentWatcherScope\n  documentId: string\n  actorUserId: string\n  excludeUserIds?: readonly string[]\n}): Promise<string[]> {\n  let watchers: DocumentWatcher[]\n  try {\n    watchers = await findWithDecryption(\n      input.em,\n      DocumentWatcher,\n      {\n        documentId: input.documentId,\n        tenantId: input.scope.tenantId,\n        organizationId: input.scope.organizationId,\n        deletedAt: null,\n      },\n      {\n        fields: ['userId'],\n        orderBy: { createdAt: 'ASC', id: 'ASC' },\n        limit: DOCUMENTS_MAX_ACTIVE_WATCHERS,\n      },\n      input.scope,\n    )\n  } catch (error) {\n    logger.error('Watcher recipient lookup failed', {\n      documentId: input.documentId,\n      err: error,\n    })\n    return []\n  }\n\n  const excludedUserIds = new Set([\n    input.actorUserId.toLowerCase(),\n    ...(input.excludeUserIds ?? []).map((userId) => userId.toLowerCase()),\n  ])\n  const candidates = watchers.filter(\n    (watcher) => !excludedUserIds.has(watcher.userId.toLowerCase()),\n  )\n  if (candidates.length === 0) return []\n\n  // The document is identical for every candidate, so it is read once instead\n  // of once per watcher. The remaining per-watcher role and share lookups run\n  // through a bounded worker pool that preserves watcher order and keeps a\n  // failed resolution fail-closed for that recipient alone.\n  const scopedDocument = await loadScopedDocument(\n    input.em,\n    input.documentId,\n    input.scope,\n  ).catch((error: unknown) => {\n    logger.error('Watcher document lookup failed', {\n      documentId: input.documentId,\n      err: error,\n    })\n    return null\n  })\n  if (!scopedDocument) return []\n\n  const permitted: Array<string | null> = new Array(candidates.length).fill(null)\n  let nextIndex = 0\n  const workers = Array.from(\n    { length: Math.min(WATCHER_ACCESS_RESOLUTION_CONCURRENCY, candidates.length) },\n    async () => {\n      while (nextIndex < candidates.length) {\n        const index = nextIndex\n        nextIndex += 1\n        const watcher = candidates[index]!\n        try {\n          const tier = await resolveLoadedDocumentUserAccess(\n            input.em,\n            scopedDocument,\n            input.scope,\n            watcher.userId,\n            input.container,\n          )\n          if (tier) permitted[index] = watcher.userId\n        } catch (error) {\n          logger.error('Watcher access resolution failed', {\n            documentId: input.documentId,\n            recipientUserId: watcher.userId,\n            err: error,\n          })\n        }\n      }\n    },\n  )\n  await Promise.all(workers)\n  return permitted.filter((userId): userId is string => userId !== null)\n}\n\nexport async function isDocumentWatched(\n  em: EntityManager,\n  scope: DocumentWatcherScope & { userId: string },\n  documentId: string,\n): Promise<boolean> {\n  const watcher = await findOneWithDecryption(\n    em,\n    DocumentWatcher,\n    {\n      documentId,\n      userId: scope.userId,\n      tenantId: scope.tenantId,\n      organizationId: scope.organizationId,\n      deletedAt: null,\n    },\n    { fields: ['id'] },\n    scope,\n  )\n  return watcher !== null\n}\n"],
+  "mappings": "AACA,SAAS,uBAAuB,0BAA0B;AAC1D,SAAS,oBAAoB;AAC7B,SAAS,uBAAuB;AAChC,SAAS,oBAAoB,uCAAuC;AAGpE,MAAM,SAAS,aAAa,WAAW,EAAE,MAAM,EAAE,WAAW,WAAW,CAAC;AAEjE,MAAM,gCAAgC;AAC7C,MAAM,wCAAwC;AAO9C,eAAsB,yBAAyB,OAOzB;AACpB,MAAI;AACJ,MAAI;AACF,eAAW,MAAM;AAAA,MACf,MAAM;AAAA,MACN;AAAA,MACA;AAAA,QACE,YAAY,MAAM;AAAA,QAClB,UAAU,MAAM,MAAM;AAAA,QACtB,gBAAgB,MAAM,MAAM;AAAA,QAC5B,WAAW;AAAA,MACb;AAAA,MACA;AAAA,QACE,QAAQ,CAAC,QAAQ;AAAA,QACjB,SAAS,EAAE,WAAW,OAAO,IAAI,MAAM;AAAA,QACvC,OAAO;AAAA,MACT;AAAA,MACA,MAAM;AAAA,IACR;AAAA,EACF,SAAS,OAAO;AACd,WAAO,MAAM,mCAAmC;AAAA,MAC9C,YAAY,MAAM;AAAA,MAClB,KAAK;AAAA,IACP,CAAC;AACD,WAAO,CAAC;AAAA,EACV;AAEA,QAAM,kBAAkB,oBAAI,IAAI;AAAA,IAC9B,MAAM,YAAY,YAAY;AAAA,IAC9B,IAAI,MAAM,kBAAkB,CAAC,GAAG,IAAI,CAAC,WAAW,OAAO,YAAY,CAAC;AAAA,EACtE,CAAC;AACD,QAAM,aAAa,SAAS;AAAA,IAC1B,CAAC,YAAY,CAAC,gBAAgB,IAAI,QAAQ,OAAO,YAAY,CAAC;AAAA,EAChE;AACA,MAAI,WAAW,WAAW,EAAG,QAAO,CAAC;AAMrC,QAAM,iBAAiB,MAAM;AAAA,IAC3B,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,EACR,EAAE,MAAM,CAAC,UAAmB;AAC1B,WAAO,MAAM,kCAAkC;AAAA,MAC7C,YAAY,MAAM;AAAA,MAClB,KAAK;AAAA,IACP,CAAC;AACD,WAAO;AAAA,EACT,CAAC;AACD,MAAI,CAAC,eAAgB,QAAO,CAAC;AAE7B,QAAM,YAAkC,IAAI,MAAM,WAAW,MAAM,EAAE,KAAK,IAAI;AAC9E,MAAI,YAAY;AAChB,QAAM,UAAU,MAAM;AAAA,IACpB,EAAE,QAAQ,KAAK,IAAI,uCAAuC,WAAW,MAAM,EAAE;AAAA,IAC7E,YAAY;AACV,aAAO,YAAY,WAAW,QAAQ;AACpC,cAAM,QAAQ;AACd,qBAAa;AACb,cAAM,UAAU,WAAW,KAAK;AAChC,YAAI;AACF,gBAAM,OAAO,MAAM;AAAA,YACjB,MAAM;AAAA,YACN;AAAA,YACA,MAAM;AAAA,YACN,QAAQ;AAAA,YACR,MAAM;AAAA,UACR;AACA,cAAI,KAAM,WAAU,KAAK,IAAI,QAAQ;AAAA,QACvC,SAAS,OAAO;AACd,iBAAO,MAAM,oCAAoC;AAAA,YAC/C,YAAY,MAAM;AAAA,YAClB,iBAAiB,QAAQ;AAAA,YACzB,KAAK;AAAA,UACP,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,QAAM,QAAQ,IAAI,OAAO;AACzB,SAAO,UAAU,OAAO,CAAC,WAA6B,WAAW,IAAI;AACvE;AAEA,eAAsB,kBACpB,IACA,OACA,YACkB;AAClB,QAAM,UAAU,MAAM;AAAA,IACpB;AAAA,IACA;AAAA,IACA;AAAA,MACE;AAAA,MACA,QAAQ,MAAM;AAAA,MACd,UAAU,MAAM;AAAA,MAChB,gBAAgB,MAAM;AAAA,MACtB,WAAW;AAAA,IACb;AAAA,IACA,EAAE,QAAQ,CAAC,IAAI,EAAE;AAAA,IACjB;AAAA,EACF;AACA,SAAO,YAAY;AACrB;",
+  "names": []
+}