trybeacon 0.1.0

package/.next/server/chunks/[root-of-the-server]__1d9wmd_._.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../node_modules/src/sql/functions/aggregate.ts","../../../lib/endpoint-layout.ts","../../../lib/endpoint-reconcile.ts","../../../lib/table-layout.ts","../../../lib/ingest.ts","../../../lib/project.ts","../../../lib/embeddings.ts"],"sourcesContent":["import { type AnyColumn, Column } from '~/column.ts';\nimport { is } from '~/entity.ts';\nimport { type SQL, sql, type SQLWrapper } from '../sql.ts';\n\n/**\n * Returns the number of values in `expression`.\n *\n * ## Examples\n *\n * ```ts\n * // Number employees with null values\n * db.select({ value: count() }).from(employees)\n * // Number of employees where `name` is not null\n * db.select({ value: count(employees.name) }).from(employees)\n * ```\n *\n * @see countDistinct to get the number of non-duplicate values in `expression`\n */\nexport function count(expression?: SQLWrapper): SQL<number> {\n\treturn sql`count(${expression || sql.raw('*')})`.mapWith(Number);\n}\n\n/**\n * Returns the number of non-duplicate values in `expression`.\n *\n * ## Examples\n *\n * ```ts\n * // Number of employees where `name` is distinct\n * db.select({ value: countDistinct(employees.name) }).from(employees)\n * ```\n *\n * @see count to get the number of values in `expression`, including duplicates\n */\nexport function countDistinct(expression: SQLWrapper): SQL<number> {\n\treturn sql`count(distinct ${expression})`.mapWith(Number);\n}\n\n/**\n * Returns the average (arithmetic mean) of all non-null values in `expression`.\n *\n * ## Examples\n *\n * ```ts\n * // Average salary of an employee\n * db.select({ value: avg(employees.salary) }).from(employees)\n * ```\n *\n * @see avgDistinct to get the average of all non-null and non-duplicate values in `expression`\n */\nexport function avg(expression: SQLWrapper): SQL<string | null> {\n\treturn sql`avg(${expression})`.mapWith(String);\n}\n\n/**\n * Returns the average (arithmetic mean) of all non-null and non-duplicate values in `expression`.\n *\n * ## Examples\n *\n * ```ts\n * // Average salary of an employee where `salary` is distinct\n * db.select({ value: avgDistinct(employees.salary) }).from(employees)\n * ```\n *\n * @see avg to get the average of all non-null values in `expression`, including duplicates\n */\nexport function avgDistinct(expression: SQLWrapper): SQL<string | null> {\n\treturn sql`avg(distinct ${expression})`.mapWith(String);\n}\n\n/**\n * Returns the sum of all non-null values in `expression`.\n *\n * ## Examples\n *\n * ```ts\n * // Sum of every employee's salary\n * db.select({ value: sum(employees.salary) }).from(employees)\n * ```\n *\n * @see sumDistinct to get the sum of all non-null and non-duplicate values in `expression`\n */\nexport function sum(expression: SQLWrapper): SQL<string | null> {\n\treturn sql`sum(${expression})`.mapWith(String);\n}\n\n/**\n * Returns the sum of all non-null and non-duplicate values in `expression`.\n *\n * ## Examples\n *\n * ```ts\n * // Sum of every employee's salary where `salary` is distinct (no duplicates)\n * db.select({ value: sumDistinct(employees.salary) }).from(employees)\n * ```\n *\n * @see sum to get the sum of all non-null values in `expression`, including duplicates\n */\nexport function sumDistinct(expression: SQLWrapper): SQL<string | null> {\n\treturn sql`sum(distinct ${expression})`.mapWith(String);\n}\n\n/**\n * Returns the maximum value in `expression`.\n *\n * ## Examples\n *\n * ```ts\n * // The employee with the highest salary\n * db.select({ value: max(employees.salary) }).from(employees)\n * ```\n */\nexport function max<T extends SQLWrapper>(expression: T): SQL<(T extends AnyColumn ? T['_']['data'] : string) | null> {\n\treturn sql`max(${expression})`.mapWith(is(expression, Column) ? expression : String) as any;\n}\n\n/**\n * Returns the minimum value in `expression`.\n *\n * ## Examples\n *\n * ```ts\n * // The employee with the lowest salary\n * db.select({ value: min(employees.salary) }).from(employees)\n * ```\n */\nexport function min<T extends SQLWrapper>(expression: T): SQL<(T extends AnyColumn ? T['_']['data'] : string) | null> {\n\treturn sql`min(${expression})`.mapWith(is(expression, Column) ? expression : String) as any;\n}\n","import { count, eq } from \"drizzle-orm\";\nimport { db, type DB } from \"@/lib/db-drizzle\";\nimport { endpoint } from \"@/lib/drizzle/schema\";\n\n// Endpoints are uniform 240px-wide pill cards on /db, kept to the left of the table\n// gutter (negative x). The previous layout stacked every endpoint in one column at\n// y = i * 110, so a real backend like Beacon ended up with a 4000px-tall stack the\n// user had to scroll past. We now wrap into a multi-column grid that grows leftward,\n// so the canvas reads as a compact block instead of a fence.\n\nconst EP_ROW_HEIGHT = 60;\nconst EP_COL_WIDTH = 280;\nconst EP_BASE_X = -300; // closest column to the tables on the right\nconst EP_ROWS_PER_COL = 12;\nconst EP_CARD_WIDTH = 240;\nconst EP_CARD_HEIGHT = 50;\n\n/**\n * Bounding-box overlap check ingest uses to decide whether to self-heal the column.\n * Endpoint cards are uniform 240px wide × ~40px tall pills — anything overlapping\n * means an old single-column ingest left a stack behind, or two ingest runs collided.\n */\nexport function endpointsOverlap(\n  eps: ReadonlyArray<{ x: number; y: number }>,\n): boolean {\n  for (let i = 0; i < eps.length; i++) {\n    for (let j = i + 1; j < eps.length; j++) {\n      const a = eps[i];\n      const b = eps[j];\n      if (\n        a.x < b.x + EP_CARD_WIDTH &&\n        a.x + EP_CARD_WIDTH > b.x &&\n        a.y < b.y + EP_CARD_HEIGHT &&\n        a.y + EP_CARD_HEIGHT > b.y\n      ) {\n        return true;\n      }\n    }\n  }\n  return false;\n}\n\nexport function gridPositionForEndpoint(index: number): { x: number; y: number } {\n  const col = Math.floor(index / EP_ROWS_PER_COL);\n  const row = index % EP_ROWS_PER_COL;\n  return { x: EP_BASE_X - col * EP_COL_WIDTH, y: row * EP_ROW_HEIGHT };\n}\n\n/**\n * One-off repair: re-pack every endpoint into a clean grid. Stable order — sorts by\n * current (y, x) so the user's visual ordering carries over across the change, then by\n * id as a tiebreaker.\n */\nexport async function relayoutEndpoints(prisma: DB = db): Promise<number> {\n  const eps = await prisma.query.endpoint.findMany({\n    orderBy: (t, { asc, desc }) => [asc(t.y), desc(t.x), asc(t.id)],\n  });\n  if (eps.length === 0) return 0;\n  let moved = 0;\n  for (let i = 0; i < eps.length; i++) {\n    const { x, y } = gridPositionForEndpoint(i);\n    const e = eps[i];\n    if (e.x === x && e.y === y) continue;\n    await prisma.update(endpoint).set({ x, y }).where(eq(endpoint.id, e.id));\n    moved++;\n  }\n  return moved;\n}\n\n/**\n * Where to drop the next NEW endpoint so it lands in the first unfilled grid slot.\n * Used by ingest to keep code-derived endpoints from re-stacking the old single column.\n */\nexport async function nextEndpointSlot(prisma: DB = db): Promise<{ x: number; y: number }> {\n  const [{ n }] = await prisma.select({ n: count() }).from(endpoint);\n  return gridPositionForEndpoint(n);\n}\n\n/**\n * Where to drop a freshly-proposed draft on the /db canvas so it doesn't land on top of\n * the existing tables/endpoints. Returns the largest y in use plus a margin, or 0 if the\n * canvas is empty.\n */\nconst DRAFT_MARGIN = 280;\nexport async function computeDraftOriginY(prisma: DB = db): Promise<number> {\n  const [topTbl, topEp] = await Promise.all([\n    prisma.query.dbTable.findFirst({ orderBy: (t, { desc }) => desc(t.y) }),\n    prisma.query.endpoint.findFirst({ orderBy: (t, { desc }) => desc(t.y) }),\n  ]);\n  const maxY = Math.max(topTbl?.y ?? 0, topEp?.y ?? 0);\n  return maxY > 0 ? maxY + DRAFT_MARGIN : 0;\n}\n","import { eq } from \"drizzle-orm\";\nimport { db, type DB } from \"@/lib/db-drizzle\";\nimport { endpoint } from \"@/lib/drizzle/schema\";\n\n// Plans and code rarely share a path prefix: a feature designed as `/orgs` ships at\n// `/api/v1/orgs`. We collapse a planned (MANUAL) endpoint into its code-derived\n// (INTROSPECTION) twin when the verbs match and the code path ends with the planned path\n// on a segment boundary, ignoring path-param names.\n\nconst normalize = (path: string) => path.replace(/\\{[^}]*\\}/g, \"{}\");\n\nexport function isImplementedBy(\n  planned: { method: string; path: string },\n  code: { method: string; path: string },\n): boolean {\n  if (planned.method.toUpperCase() !== code.method.toUpperCase()) return false;\n  const p = normalize(planned.path);\n  const c = normalize(code.path);\n  // planned paths start with \"/\", so endsWith() already lands on a segment boundary.\n  return c === p || c.endsWith(p);\n}\n\nexport interface ReconcileReport {\n  collapsed: number;\n  mappings: { planned: string; code: string }[];\n}\n\n/**\n * Deletes planned endpoints (anything not code-derived — drafts approved as MANUAL, init/\n * session scaffolds) once they have an INTROSPECTION twin, so the canvas shows reality\n * instead of duplicates. Unbuilt plans are left intact. Returns what was collapsed (also\n * surfaces the planned→code path discrepancy to the caller).\n */\nexport async function reconcilePlannedEndpoints(prisma: DB = db): Promise<ReconcileReport> {\n  const [planned, code] = await Promise.all([\n    prisma.query.endpoint.findMany({ where: (t, { ne }) => ne(t.source, \"INTROSPECTION\") }),\n    prisma.query.endpoint.findMany({ where: (t, { eq }) => eq(t.source, \"INTROSPECTION\") }),\n  ]);\n\n  const report: ReconcileReport = { collapsed: 0, mappings: [] };\n  for (const m of planned) {\n    const twin = code.find((c) => isImplementedBy(m, c));\n    if (!twin) continue;\n    await prisma.delete(endpoint).where(eq(endpoint.id, m.id));\n    report.collapsed++;\n    report.mappings.push({ planned: `${m.method} ${m.path}`, code: `${twin.method} ${twin.path}` });\n  }\n  return report;\n}\n","import { eq } from \"drizzle-orm\";\nimport { db, type DB } from \"@/lib/db-drizzle\";\nimport { dbTable } from \"@/lib/drizzle/schema\";\n\n// Layout constants for /db. Tables are 232px wide cards whose height is dominated by\n// their column count; the previous fixed grid (`y = floor(i/4) * 260`) silently stacked\n// tall tables on top of their neighbours. We pack into four columns masonry-style: each\n// column tracks its cumulative bottom and the next table goes into whichever column has\n// the most room. Same shape ingest seeds use, same shape `relayoutTables` uses to repair.\n\nexport const TABLE_COL_WIDTH = 320;\nexport const TABLE_COL_COUNT = 4;\nexport const TABLE_GAP_PX = 50;\nconst TABLE_HEADER_PX = 36;\nconst TABLE_ROW_PX = 30;\nconst TABLE_PADDING_PX = 16;\n\nexport function estimateTableHeight(columnCount: number): number {\n  return TABLE_HEADER_PX + Math.max(0, columnCount) * TABLE_ROW_PX + TABLE_PADDING_PX;\n}\n\nexport interface NewTable {\n  key: string;\n  columnCount: number;\n}\nexport interface PlacedTable {\n  x: number;\n  y: number;\n  columnCount: number;\n}\n\n/**\n * Assigns (x, y) to each `newTables` entry using a masonry pack across `TABLE_COL_COUNT`\n * columns, treating `existing` as already-occupied slots so we never land on top of a\n * persisted table. Returns a Map keyed by the entry's `key` (id or name — caller's choice).\n */\nexport function packTablesMasonry(\n  newTables: NewTable[],\n  existing: PlacedTable[] = [],\n): Map<string, { x: number; y: number }> {\n  const bottoms = new Array<number>(TABLE_COL_COUNT).fill(0);\n  for (const e of existing) {\n    const col = Math.max(\n      0,\n      Math.min(TABLE_COL_COUNT - 1, Math.round(e.x / TABLE_COL_WIDTH)),\n    );\n    const bottom = e.y + estimateTableHeight(e.columnCount) + TABLE_GAP_PX;\n    if (bottom > bottoms[col]) bottoms[col] = bottom;\n  }\n  const out = new Map<string, { x: number; y: number }>();\n  for (const t of newTables) {\n    let col = 0;\n    for (let i = 1; i < TABLE_COL_COUNT; i++) if (bottoms[i] < bottoms[col]) col = i;\n    const x = col * TABLE_COL_WIDTH;\n    const y = bottoms[col];\n    out.set(t.key, { x, y });\n    bottoms[col] = y + estimateTableHeight(t.columnCount) + TABLE_GAP_PX;\n  }\n  return out;\n}\n\n/**\n * Bounding-box overlap check used by ingest to decide whether to self-heal the layout.\n * Card width is `TABLE_COL_WIDTH - 20` (the visible card sits inside its column slot).\n */\nexport function tablesOverlap(\n  placed: ReadonlyArray<{ x: number; y: number; columnCount: number }>,\n): boolean {\n  const w = TABLE_COL_WIDTH - 20;\n  for (let i = 0; i < placed.length; i++) {\n    for (let j = i + 1; j < placed.length; j++) {\n      const a = placed[i];\n      const b = placed[j];\n      const ah = estimateTableHeight(a.columnCount);\n      const bh = estimateTableHeight(b.columnCount);\n      if (a.x < b.x + w && a.x + w > b.x && a.y < b.y + bh && a.y + ah > b.y) {\n        return true;\n      }\n    }\n  }\n  return false;\n}\n\n/**\n * Self-heal for the /db canvas: re-packs all INTROSPECTION tables into a masonry\n * layout sized to each table's actual column count. Called automatically by ingest\n * when the post-upsert positions still overlap (a stale layout from before the\n * masonry formula, or a hand-placement that drifted into a neighbour). Manual\n * (non-introspection) tables keep their positions — they're drafts the user is\n * composing or hand-placed. Ordering by name keeps the result stable across re-syncs.\n */\nexport async function relayoutTables(prisma: DB = db): Promise<number> {\n  const tables = await prisma.query.dbTable.findMany({\n    where: (t, { eq }) => eq(t.source, \"INTROSPECTION\"),\n    with: { columns: { columns: { id: true } } },\n    orderBy: (t, { asc }) => asc(t.name),\n  });\n  if (tables.length === 0) return 0;\n  const positions = packTablesMasonry(\n    tables.map((t) => ({ key: t.id, columnCount: t.columns.length })),\n  );\n  let moved = 0;\n  for (const t of tables) {\n    const p = positions.get(t.id);\n    if (!p) continue;\n    if (Math.round(p.x) === Math.round(t.x) && Math.round(p.y) === Math.round(t.y)) continue;\n    await prisma.update(dbTable).set({ x: p.x, y: p.y }).where(eq(dbTable.id, t.id));\n    moved++;\n  }\n  return moved;\n}\n","import { z } from \"zod\";\nimport { and, count, eq, inArray, notInArray, or, sql } from \"drizzle-orm\";\nimport { db, type DB } from \"@/lib/db-drizzle\";\nimport { dbTable, dbColumn, dbRelation, endpoint, endpointTable, syncState } from \"@/lib/drizzle/schema\";\nimport {\n  endpointsOverlap,\n  gridPositionForEndpoint,\n  relayoutEndpoints,\n} from \"@/lib/endpoint-layout\";\nimport { reconcilePlannedEndpoints } from \"@/lib/endpoint-reconcile\";\nimport { packTablesMasonry, relayoutTables, tablesOverlap } from \"@/lib/table-layout\";\n\n// ── Snapshot contract (what the intel daemon POSTs) ─────────────────────────\n\nexport const snapshotSchema = z.object({\n  tables: z\n    .array(\n      z.object({\n        name: z.string().trim().min(1),\n        domain: z.string().nullish(),\n        description: z.string().nullish(),\n        columns: z\n          .array(\n            z.object({\n              name: z.string().trim().min(1),\n              type: z.string().trim().min(1),\n              isPk: z.boolean().optional(),\n              isFk: z.boolean().optional(),\n              nullable: z.boolean().optional(),\n              note: z.string().nullish(),\n            }),\n          )\n          .default([]),\n      }),\n    )\n    .default([]),\n  relations: z\n    .array(\n      z.object({\n        fromTable: z.string(),\n        fromColumn: z.string(),\n        toTable: z.string(),\n        toColumn: z.string(),\n        label: z.string().nullish(),\n      }),\n    )\n    .default([]),\n  endpoints: z\n    .array(\n      z.object({\n        method: z.string().trim().min(1),\n        path: z.string().trim().min(1),\n        domain: z.string().nullish(),\n        description: z.string().nullish(),\n        uses: z\n          .array(\n            z.object({\n              table: z.string(),\n              access: z.string().default(\"read\"),\n            }),\n          )\n          .default([]),\n      }),\n    )\n    .default([]),\n});\nexport type Snapshot = z.input<typeof snapshotSchema>;\n\ntype Prisma = DB;\n\nexport async function getVersion(prisma: Prisma = db): Promise<number> {\n  const s = await prisma.query.syncState.findFirst({ where: (t, { eq }) => eq(t.id, \"singleton\") });\n  return s?.version ?? 0;\n}\n\nexport async function bumpVersion(prisma: Prisma = db): Promise<number> {\n  const [s] = await prisma\n    .insert(syncState)\n    .values({ id: \"singleton\", version: 1 })\n    .onConflictDoUpdate({\n      target: syncState.id,\n      set: { version: sql`${syncState.version} + 1` },\n    })\n    .returning();\n  return s.version;\n}\n\n/**\n * Upserts a code-derived snapshot. Full-replace of `source=INTROSPECTION`\n * entities: upsert by stable key (name / method+path) preserving manual x/y,\n * delete introspected entities absent from the snapshot. Manual entities and\n * the roadmap are never touched. Bumps the sync version.\n */\nexport async function ingestSnapshot(input: unknown, prisma: Prisma = db) {\n  const snap = snapshotSchema.parse(input);\n\n  // tables ----------------------------------------------------------------\n  const keepTables = snap.tables.map((t) => t.name);\n  await prisma\n    .delete(dbTable)\n    .where(\n      keepTables.length\n        ? and(eq(dbTable.source, \"INTROSPECTION\"), notInArray(dbTable.name, keepTables))\n        : eq(dbTable.source, \"INTROSPECTION\"),\n    );\n\n  // Position NEW tables with a masonry pack sized to each table's column count, anchored\n  // against whatever tables are already on the canvas. The old `(i%4)*320, floor(i/4)*260`\n  // grid silently stacked tall tables (Node, DbColumn) on top of their neighbours.\n  const allExisting = await prisma.query.dbTable.findMany({\n    columns: { name: true, x: true, y: true },\n    with: { columns: { columns: { id: true } } },\n  });\n  const existingByName = new Map(allExisting.map((t) => [t.name, t]));\n  const newTablePositions = packTablesMasonry(\n    snap.tables\n      .filter((t) => !existingByName.has(t.name))\n      .map((t) => ({ key: t.name, columnCount: t.columns.length })),\n    allExisting.map((t) => ({ x: t.x, y: t.y, columnCount: t.columns.length })),\n  );\n\n  const tableIdByName = new Map<string, string>();\n  for (const t of snap.tables) {\n    const existing = existingByName.get(t.name);\n    const pos = newTablePositions.get(t.name);\n    const x = existing?.x ?? pos?.x ?? 0;\n    const y = existing?.y ?? pos?.y ?? 0;\n    const [saved] = await prisma\n      .insert(dbTable)\n      .values({\n        name: t.name,\n        domain: t.domain ?? null,\n        description: t.description ?? null,\n        source: \"INTROSPECTION\",\n        x,\n        y,\n      })\n      .onConflictDoUpdate({\n        target: dbTable.name,\n        set: {\n          domain: t.domain ?? null,\n          description: t.description ?? null,\n          source: \"INTROSPECTION\",\n        },\n      })\n      .returning();\n    tableIdByName.set(t.name, saved.id);\n    await prisma.delete(dbColumn).where(eq(dbColumn.tableId, saved.id));\n    if (t.columns.length) {\n      await prisma.insert(dbColumn).values(\n        t.columns.map((c, i) => ({\n          tableId: saved.id,\n          name: c.name,\n          type: c.type,\n          isPk: c.isPk ?? false,\n          isFk: c.isFk ?? false,\n          nullable: c.nullable ?? true,\n          note: c.note ?? null,\n          ord: i,\n        })),\n      );\n    }\n  }\n\n  // relations (rebuild those touching an introspected table) ---------------\n  const introTableIds = [...tableIdByName.values()];\n  if (introTableIds.length) {\n    await prisma\n      .delete(dbRelation)\n      .where(\n        or(\n          inArray(dbRelation.fromTableId, introTableIds),\n          inArray(dbRelation.toTableId, introTableIds),\n        ),\n      );\n  }\n  for (const r of snap.relations) {\n    const fromId = tableIdByName.get(r.fromTable);\n    const toId = tableIdByName.get(r.toTable);\n    if (!fromId || !toId) continue;\n    await prisma.insert(dbRelation).values({\n      fromTableId: fromId,\n      toTableId: toId,\n      fromColumn: r.fromColumn,\n      toColumn: r.toColumn,\n      label: r.label ?? `${r.fromColumn} → ${r.toTable}.${r.toColumn}`,\n    });\n  }\n\n  // endpoints --------------------------------------------------------------\n  const keepEp = new Set(snap.endpoints.map((e) => `${e.method} ${e.path}`));\n  const introEps = await prisma.query.endpoint.findMany({\n    where: (t, { eq }) => eq(t.source, \"INTROSPECTION\"),\n  });\n  const stale = introEps.filter((e) => !keepEp.has(`${e.method} ${e.path}`)).map((e) => e.id);\n  if (stale.length) await prisma.delete(endpoint).where(inArray(endpoint.id, stale));\n\n  // For NEW endpoints we drop into the next free slot of the multi-column grid (the\n  // single-column stack made a real backend's endpoints into a 4000px-tall fence).\n  let nextSlotIndex = (await prisma.select({ n: count() }).from(endpoint))[0].n;\n  for (const e of snap.endpoints) {\n    const existing = await prisma.query.endpoint.findFirst({\n      where: (t, { and, eq }) => and(eq(t.method, e.method), eq(t.path, e.path)),\n    });\n    let x: number, y: number;\n    if (existing) {\n      x = existing.x;\n      y = existing.y;\n    } else {\n      const slot = gridPositionForEndpoint(nextSlotIndex);\n      x = slot.x;\n      y = slot.y;\n      nextSlotIndex++;\n    }\n    const [saved] = await prisma\n      .insert(endpoint)\n      .values({\n        method: e.method,\n        path: e.path,\n        domain: e.domain ?? null,\n        description: e.description ?? null,\n        source: \"INTROSPECTION\",\n        x,\n        y,\n      })\n      .onConflictDoUpdate({\n        target: [endpoint.method, endpoint.path],\n        set: {\n          domain: e.domain ?? null,\n          description: e.description ?? null,\n          source: \"INTROSPECTION\",\n        },\n      })\n      .returning();\n    await prisma.delete(endpointTable).where(eq(endpointTable.endpointId, saved.id));\n    for (const u of e.uses) {\n      const tid =\n        tableIdByName.get(u.table) ??\n        (\n          await prisma.query.dbTable.findFirst({ where: (t, { eq }) => eq(t.name, u.table) })\n        )?.id;\n      if (!tid) continue;\n      await prisma.insert(endpointTable).values({\n        endpointId: saved.id,\n        tableId: tid,\n        access: u.access,\n      });\n    }\n  }\n\n  // Collapse planned endpoints that this scan just proved are implemented in code.\n  await reconcilePlannedEndpoints(prisma);\n\n  // Self-heal layout: if any pair of tables or endpoints overlaps after the upserts\n  // (a stale layout from before the masonry/grid formulas, or a hand-placement that\n  // drifted into a neighbour), repack them. Drag-and-drop positions that don't\n  // collide are preserved — the heal only fires when the canvas is actually broken.\n  const placedTables = await prisma.query.dbTable.findMany({\n    where: (t, { eq }) => eq(t.source, \"INTROSPECTION\"),\n    columns: { x: true, y: true },\n    with: { columns: { columns: { id: true } } },\n  });\n  if (\n    tablesOverlap(\n      placedTables.map((t) => ({ x: t.x, y: t.y, columnCount: t.columns.length })),\n    )\n  ) {\n    await relayoutTables(prisma);\n  }\n  const placedEps = await prisma.select({ x: endpoint.x, y: endpoint.y }).from(endpoint);\n  if (endpointsOverlap(placedEps)) await relayoutEndpoints(prisma);\n\n  const version = await bumpVersion(prisma);\n  return {\n    tables: snap.tables.length,\n    relations: snap.relations.length,\n    endpoints: snap.endpoints.length,\n    version,\n  };\n}\n","import { execSync } from \"node:child_process\";\nimport { createHash } from \"node:crypto\";\nimport { homedir } from \"node:os\";\nimport { basename, join, resolve } from \"node:path\";\nimport { activeWorkspace, dataDirFor, getPinnedWorkspaceId, getWorkspace } from \"@/lib/workspaces\";\n\n// Beacon targets whatever repo the CLI was launched in. The CLI passes BEACON_REPO\n// (the repo root) and BEACON_DATA_DIR (the per-repo store). In dev (running the app\n// directly) we fall back to the surrounding git repo / parent dir. When the server has\n// an active workspace selected, that wins (multi-workspace server).\n\nlet cachedRoot: string | null = null;\n\nexport function repoRoot(): string {\n  // A pinned process (CLI / watcher / init) targets its own repo, ignoring the server's\n  // active workspace. The unpinned daemon follows the active workspace.\n  if (process.env.BEACON_REPO) return process.env.BEACON_REPO;\n  // A per-request pin (runWithWorkspace, set by MCP routes) wins over the active\n  // workspace so AGENTS.md is written into the agent's repo, not the dropdown's.\n  const pinnedId = getPinnedWorkspaceId();\n  if (pinnedId) {\n    const pinned = getWorkspace(pinnedId);\n    if (pinned) return pinned.path;\n  }\n  const ws = activeWorkspace();\n  if (ws) return ws.path;\n  if (cachedRoot) return cachedRoot;\n  try {\n    const top = execSync(\"git rev-parse --show-toplevel\", {\n      cwd: process.cwd(),\n      stdio: [\"ignore\", \"pipe\", \"ignore\"],\n    })\n      .toString()\n      .trim();\n    if (top) return (cachedRoot = top);\n  } catch {\n    /* not a git repo */\n  }\n  return (cachedRoot = resolve(process.cwd(), \"../..\"));\n}\n\nexport function repoName(): string {\n  return basename(repoRoot());\n}\n\nexport function repoId(): string {\n  return createHash(\"sha256\").update(repoRoot()).digest(\"hex\").slice(0, 12);\n}\n\nexport function dataDir(): string {\n  if (process.env.BEACON_DATA_DIR) return process.env.BEACON_DATA_DIR;\n  // Honor a per-request pin (MCP routes) so the disk-backed draft/plan store lands in\n  // the agent's repo dir, not the browser's active one.\n  const pinnedId = getPinnedWorkspaceId();\n  if (pinnedId && getWorkspace(pinnedId)) return dataDirFor(pinnedId);\n  const ws = activeWorkspace();\n  if (ws) return dataDirFor(ws.id);\n  return join(homedir(), \".beacon\", repoId());\n}\n","// Local semantic-search embedder. Loads Xenova/all-MiniLM-L6-v2 in-process\n// (~22MB cached on first use, ~50-100ms per text after that). Stays local so\n// the Beacon panel has no API-key dependency and no per-query network hop.\n// Vectors live in `Node.embedding` as JSON strings; cosine is computed in JS\n// at query time — at hundreds of nodes per workspace, sqlite-vec is overkill.\n\ntype FeatureExtractionPipeline = (\n  text: string | string[],\n  opts?: { pooling?: \"mean\" | \"cls\"; normalize?: boolean },\n) => Promise<{ data: Float32Array | number[] }>;\n\nlet pipelinePromise: Promise<FeatureExtractionPipeline> | null = null;\n\nasync function getEmbedder(): Promise<FeatureExtractionPipeline> {\n  if (!pipelinePromise) {\n    pipelinePromise = (async () => {\n      const { pipeline } = await import(\"@huggingface/transformers\");\n      // 384-dim sentence embeddings. The \"feature-extraction\" task with\n      // mean-pooled + normalized output is the canonical sentence-encoder shape.\n      return (await pipeline(\n        \"feature-extraction\",\n        \"Xenova/all-MiniLM-L6-v2\",\n      )) as unknown as FeatureExtractionPipeline;\n    })().catch((e) => {\n      pipelinePromise = null; // let the next call retry on transient failure\n      throw e;\n    });\n  }\n  return pipelinePromise;\n}\n\n/** Compute a 384-dim sentence embedding. Returns null on failure (caller falls back to lexical). */\nexport async function embedText(text: string): Promise<number[] | null> {\n  const trimmed = text.trim();\n  if (!trimmed) return null;\n  try {\n    const embedder = await getEmbedder();\n    const out = await embedder(trimmed, { pooling: \"mean\", normalize: true });\n    return Array.from(out.data);\n  } catch (e) {\n    console.error(\"[embeddings] failed:\", e instanceof Error ? e.message : e);\n    return null;\n  }\n}\n\n/** Build the embedding input text from a node's queryable fields. */\nexport function nodeEmbeddingInput(node: {\n  title: string;\n  role?: string | null;\n  plain?: string | null;\n  cluster?: string | null;\n}): string {\n  return [node.title, node.role, node.plain, node.cluster].filter(Boolean).join(\". \");\n}\n\n/** Cosine similarity, defensive against zero vectors and dimension mismatch. */\nexport function cosineSimilarity(a: number[], b: number[]): number {\n  if (a.length !== b.length) return 0;\n  let dot = 0;\n  let normA = 0;\n  let normB = 0;\n  for (let i = 0; i < a.length; i++) {\n    dot += a[i] * b[i];\n    normA += a[i] * a[i];\n    normB += b[i] * b[i];\n  }\n  if (normA === 0 || normB === 0) return 0;\n  return dot / (Math.sqrt(normA) * Math.sqrt(normB));\n}\n\nexport function encodeVector(v: number[]): string {\n  return JSON.stringify(v);\n}\n\nexport function decodeVector(raw: string | null | undefined): number[] | null {\n  if (!raw) return null;\n  try {\n    const parsed = JSON.parse(raw);\n    if (!Array.isArray(parsed)) return null;\n    if (parsed.some((x) => typeof x !== \"number\" || !Number.isFinite(x))) return null;\n    return parsed as number[];\n  } catch {\n    return null;\n  }\n}\n\n/**\n * Re-embed a Node from its current title/plain/role/cluster. Idempotent; swallows\n * errors so a failed embed never breaks the write that triggered it.\n */\nexport async function reembedNode(id: string): Promise<void> {\n  try {\n    const { db } = await import(\"@/lib/db\");\n    const { node } = await import(\"@/lib/drizzle/schema\");\n    const { eq } = await import(\"drizzle-orm\");\n    const row = await db.query.node.findFirst({\n      where: (t, { eq: eqf }) => eqf(t.id, id),\n      columns: { title: true, role: true, plain: true, cluster: true },\n    });\n    if (!row) return;\n    const vec = await embedText(nodeEmbeddingInput(row));\n    if (!vec) return;\n    await db.update(node).set({ embedding: encodeVector(vec) }).where(eq(node.id, id));\n  } catch (e) {\n    console.error(\"[embeddings] reembed failed:\", id, e instanceof Error ? e.message : e);\n  }\n}\n\n/** Rank candidates by cosine. Returns null when the query embedding fails. */\nexport async function rankByQuery<T extends { embedding: string | null }>(\n  query: string,\n  candidates: T[],\n): Promise<Array<{ item: T; score: number }> | null> {\n  const queryVec = await embedText(query);\n  if (!queryVec) return null;\n  const scored: Array<{ item: T; score: number }> = [];\n  for (const item of candidates) {\n    const v = decodeVector(item.embedding);\n    if (!v) continue;\n    scored.push({ item, score: cosineSimilarity(queryVec, v) });\n  }\n  scored.sort((a, b) => b.score - a.score);\n  return scored;\n}\n"],"names":["EP_ROW_HEIGHT","EP_COL_WIDTH","EP_BASE_X","EP_ROWS_PER_COL","EP_CARD_WIDTH","EP_CARD_HEIGHT","endpointsOverlap","eps","i","length","j","a","b","x","y","gridPositionForEndpoint","index","col","Math","floor","row","relayoutEndpoints","prisma","query","endpoint","findMany","orderBy","t","asc","desc","id","moved","e","update","set","where","nextEndpointSlot","n","select","from","DRAFT_MARGIN","computeDraftOriginY","topTbl","topEp","Promise","all","dbTable","findFirst","maxY","max","normalize","path","replace","isImplementedBy","planned","code","method","toUpperCase","p","c","endsWith","reconcilePlannedEndpoints","ne","source","eq","report","collapsed","mappings","m","twin","find","delete","push","TABLE_COL_WIDTH","TABLE_COL_COUNT","TABLE_GAP_PX","TABLE_HEADER_PX","TABLE_ROW_PX","TABLE_PADDING_PX","estimateTableHeight","columnCount","packTablesMasonry","newTables","existing","bottoms","Array","fill","min","round","bottom","out","Map","key","tablesOverlap","placed","w","ah","bh","relayoutTables","tables","with","columns","name","positions","map","get","snapshotSchema","object","array","string","trim","domain","nullish","description","type","isPk","boolean","optional","isFk","nullable","note","default","relations","fromTable","fromColumn","toTable","toColumn","label","endpoints","uses","table","access","getVersion","s","syncState","version","bumpVersion","insert","values","onConflictDoUpdate","target","returning","ingestSnapshot","input","snap","parse","keepTables","allExisting","existingByName","newTablePositions","filter","has","tableIdByName","pos","saved","tableId","ord","introTableIds","fromTableId","toTableId","r","fromId","toId","keepEp","Set","introEps","stale","nextSlotIndex","and","slot","endpointId","u","tid","placedTables","placedEps","cachedRoot","repoRoot","process","env","BEACON_REPO","pinnedId","pinned","ws","top","cwd","stdio","toString","repoName","repoId","digest","slice","dataDir","BEACON_DATA_DIR","pipelinePromise","getEmbedder","pipeline","catch","embedText","text","trimmed","embedder","pooling","data","console","error","Error","message","nodeEmbeddingInput","node","title","role","plain","cluster","Boolean","join","cosineSimilarity","dot","normA","normB","sqrt","encodeVector","v","JSON","stringify","decodeVector","raw","parsed","isArray","some","Number","isFinite","reembedNode","db","eqf","vec","embedding","rankByQuery","candidates","queryVec","scored","item","score","sort"],"mappings":"g0BAAA,IAAA,EAAuC,EAAA,CAAA,AAAd,CAAc,OACvC,EAAmB,EAAA,CAAV,AAAU,CADoB,AACpB,OACnB,EADmB,AAC4B,EAAA,CAAA,AAA5B,CAA4B,UAAA,UAgDxC,SAAS,AAAI,CAAA,EAA4C,AAC/D,OAAO,EAAA,GAAA,CAAA,IAAA,EAAU,EAAU,CAAA,CAAA,CAAI,KAAJ,EAAI,CAAQ,MAAM,CAC9C,kBAcO,SAAS,AAAY,CAAA,EAA4C,AACvE,OAAO,EAAA,GAAA,CAAA,aAAA,EAAmB,EAAU,CAAA,CAAA,CAAI,KAAJ,EAAI,CAAQ,MAAM,CACvD,YAlDO,SAAS,AAAM,CAAA,EAAsC,AAC3D,OAAO,EAAA,GAAA,CAAA,MAAA,EAAY,GAAc,EAAA,GAAA,CAAI,GAAA,CAAI,GAAG,CAAC,CAAA,CAAA,CAAA,CAAI,OAAA,CAAQ,MAAM,CAChE,oBAcO,SAAuB,AAAd,CAAc,EAAqC,AAClE,OAAO,EAAA,GAAA,CAAA,eAAA,EAAqB,EAAU,CAAA,CAAA,CAAI,KAAJ,EAAI,CAAQ,MAAM,CACzD,UA4EO,SAAmC,AAA1B,CAA0B,EAA4E,AACrH,OAAO,EAAA,GAAA,CAAA,IAAA,EAAU,EAAU,CAAA,CAAA,CAAI,KAAJ,EAAI,CAAA,CAAA,EAAQ,EAAA,EAAA,EAAG,EAAY,EAAA,MAAM,EAAI,EAAa,MAAM,CACpF,UAYO,SAAS,AAA0B,CAAA,EAA4E,AACrH,OAAO,EAAA,GAAA,CAAA,IAAA,EAAU,EAAU,CAAA,CAAA,CAAI,KAAJ,EAAI,CAAA,CAAA,EAAQ,EAAA,EAAA,EAAG,EAAY,EAAA,MAAM,EAAI,EAAa,MAAM,CACpF,UA9CO,SAAS,AAAI,CAAA,EAA4C,AAC/D,OAAO,EAAA,GAAA,CAAA,IAAA,EAAU,EAAU,CAAA,CAAA,CAAI,KAAJ,EAAI,CAAQ,MAAM,CAC9C,kBAcO,SAAqB,AAAZ,CAAY,EAA4C,AACvE,OAAO,EAAA,GAAA,CAAA,aAAA,EAAmB,EAAU,CAAA,CAAA,CAAI,KAAJ,EAAI,CAAQ,MAAM,CACvD,kCCpGA,IAAA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,gBAwCO,SAASe,EAAwBC,CAAa,EACnD,IAAMC,EAAMC,KAAKC,KAAK,CAACH,EA9BD,IAgCtB,EAF+Bb,IAExB,CAAEU,EAAGX,AAjCI,CAAC,IADE,CACG,GAiCEe,EAAoBH,EADhCE,AACmCI,EAAjBnB,GAnCV,CAmCiCD,CAAc,CAD/CG,AAEtB,CAOO,eAAekB,EAAkBC,EAAa,EAAA,EAAE,EACrD,GA1CkE,CA0C5Df,EAAM,MAAMe,EAAOC,KAAK,CAACC,QAAQ,CAACC,QAAQ,CAAC,CAC/CC,QAAS,CAACC,EAAG,KAAEC,CAAG,MAAEC,CAAI,CAAE,GAAK,CAACD,EAAID,EAAEb,CAAC,EAAGe,EAAKF,EAAEd,CAAC,EAAGe,EAAID,EAAEG,EAAE,EAAE,AACjE,GACA,GAAmB,IAAfvB,EAAIE,MAAM,CAAQ,OAAO,EAC7B,IAAIsB,EAAQ,EACZ,IAAK,IAAIvB,EAAI,EAAGA,EAAID,EAAIE,MAAM,CAAED,IAAK,CACnC,GAAM,GAAEK,CAAC,GAAEC,CAAC,CAAE,CAAGC,EAAwBP,GACnCwB,EAAIzB,CAAG,CAACC,EAAE,EACZwB,EAAEnB,CAAC,GAAKA,GAAKmB,EAAElB,CAAC,IAAKA,GAAG,CAC5B,MAAMQ,EAAOW,MAAM,CAAC,EAAA,QAAQ,EAAEC,GAAG,CAAC,GAAErB,IAAGC,CAAE,GAAGqB,KAAK,CAAC,CAAA,EAAA,EAAA,EAAA,AAAE,EAAC,EAAA,QAAQ,CAACL,EAAE,CAAEE,EAAEF,EAAE,GACtEC,IACF,CACA,OAAOA,CACT,CAiBO,eAAeU,EAAoBnB,EAAa,EAAA,EAAE,EACvD,GAAM,CAACoB,EAAQC,EAAM,CAAG,MAAMC,QAAQC,GAAG,CAAC,CACxCvB,EAAOC,KAAK,CAACuB,OAAO,CAACC,SAAS,CAAC,CAAErB,QAAS,CAACC,EAAG,MAAEE,CAAI,CAAE,GAAKA,EAAKF,EAAEb,CAAC,CAAE,GACrEQ,EAAOC,KAAK,CAACC,QAAQ,CAACuB,SAAS,CAAC,CAAErB,QAAS,CAACC,EAAG,MAAEE,CAAI,CAAE,GAAKA,EAAKF,EAAEb,CAAC,CAAE,GACvE,EACKkC,EAAO9B,KAAK+B,GAAG,CAACP,GAAQ5B,GAAK,EAAG6B,GAAO7B,GAAK,GAClD,OAAOkC,EAAO,EAAIA,EAPC,IAOqB,CAC1C,AAD2BR,8EApEpB,SAASlC,AACdC,CAA4C,EAE5C,IAAK,IAAIC,EAAI,EAAGA,EAAID,EAAIE,MAAM,CAAED,IAAK,AACnC,IAAK,IAAIE,EAAIF,EAAI,EAAGE,EAAIH,EAAIE,MAAM,CAAEC,IAAK,CACvC,IAAMC,EAAIJ,CAAG,CAACC,EAAE,CACVI,EAAIL,CAAG,CAACG,EAAE,CAChB,GACEC,EAAEE,CAAC,CAAGD,EAAEC,CAAC,GAAGT,GACZO,EAAEE,CAAC,CAjBW,EAiBRT,EAAgBQ,EAAEC,CAAC,EACzBF,EAAEG,CAAC,CAAGF,EAAEE,CAAC,GAAGT,EACZM,EAAEG,CAAC,CAlBY,EAkBTT,CAAiBO,EAAEE,CAAC,CAE1B,CADA,MACO,CAEX,CAEF,OAAO,CACT,gHCxCA,IAAA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,gBA+BO,eAAe+C,EAA0BvC,EAAa,EAAA,EAAE,EAC7D,GAAM,CAACgC,EAASC,EAAK,CAAG,MAAMX,QAAQC,GAAG,CAAC,CACxCvB,EAAOC,KAAK,CAACC,QAAQ,CAACC,QAAQ,CAAC,CAAEU,MAAO,CAACR,EAAG,CAAEmC,IAAE,CAAE,GAAKA,EAAGnC,EAAEoC,MAAM,CAAE,gBAAiB,GACrFzC,EAAOC,KAAK,CAACC,QAAQ,CAACC,QAAQ,CAAC,CAAEU,MAAO,CAACR,EAAG,IAAEqC,CAAE,CAAE,GAAKA,EAAGrC,EAAEoC,MAAM,CAAE,gBAAiB,GACtF,EAEKE,EAA0B,CAAEC,UAAW,EAAGC,SAAU,EAAE,AAAC,EAC7D,IAAK,IAAMC,KAAKd,EAAS,CACvB,IAAMe,EAAOd,EAAKe,IAAI,CAAC,AAACX,GA9BrB,AA8B2BN,SA9BlBA,CACdC,CAAyC,CACzCC,CAAsC,EAEtC,GAAID,EAAQE,MAAM,CAACC,WAAW,KAAOF,EAAKC,MAAM,CAACC,WAAW,GAAI,OAAO,EACvE,IAAMC,EAP4BP,AAOdG,EAAVJ,AAAkBC,IAAI,CAPOC,2BAQjCO,EAAcJ,EAAVL,AAAeC,IAAI,QARiB,CAAC,aAAc,MAU7D,OAAOQ,IAAMD,GAAKC,EAAEC,QAAQ,CAACF,GAC/B,EAqBkDU,EAAGT,IAC5CU,IACL,EADW,IACL/C,EAAOiD,MAAM,CAAC,EAAA,QAAQ,EAAEpC,KAAK,CAAC,CAAA,EAAA,EAAA,EAAA,AAAE,EAAC,EAAA,QAAQ,CAACL,EAAE,CAAEsC,EAAEtC,EAAE,GACxDmC,EAAOC,SAAS,GAChBD,EAAOE,QAAQ,CAACK,IAAI,CAAC,CAAElB,QAAS,CAAA,EAAGc,EAAEZ,MAAM,CAAC,CAAC,EAAEY,EAAEjB,IAAI,CAAA,CAAE,CAAEI,KAAM,CAAA,EAAGc,EAAKb,MAAM,CAAC,CAAC,EAAEa,EAAKlB,IAAI,CAAA,CAAE,AAAC,GAC/F,CACA,OAAOc,CACT,uHChDA,IAAA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,gBAeO,SAASc,EAAoBC,CAAmB,EACrD,OAAOJ,AALe,GACH,GAIM1D,KAAK+B,GAAG,CAAC,EAAG+B,GAHd,EAIzB,CAiBO,SAlB+CH,AAkBtCI,EACdC,CAAqB,CACrBC,EAA0B,EAAE,EAE5B,IAAMC,CAtB6DN,CAsBnD,IAAIO,EAAcX,CAAiBY,GAAjBZ,CAAqB,CAAC,GACxD,IAAK,IAAM1C,KAAKmD,EAAU,CACxB,IAAMlE,EAAMC,KAAK+B,GAAG,CAClB,EACA/B,KAAKqE,GAAG,CAACb,EAAqBxD,KAAKsE,KAAK,CAACxD,EAAEnB,CAAC,EAAjB,CAAoB4D,KAE3CgB,EAASzD,EAAElB,CAAC,CAAGiE,EAAoB/C,EAAEgD,WAAW,EAlC9B,EAkCkCL,CACtDc,EAASL,CAAO,CAACnE,EAAI,GAAEmE,CAAO,CAACnE,EAAI,CAAGwE,CAAAA,CAC5C,CACA,IAAMC,EAAM,IAAIC,IAChB,IAAK,IAAMhE,KAAKuD,EAAW,CACzB,IAAIjE,EAAM,EACV,IAAK,IAAIT,EAAI,EAAGA,EAzCW,EAyCPkE,AAAiBlE,IAAK,AAAI4E,CAAO,CAAC5E,EAAE,CAAG4E,CAAO,CAACnE,EAAI,GAAEA,GAAMT,EAC/E,IAAMK,EA3CqB,IA2CjBI,EACJH,EAAIsE,CAAO,CADDX,AACExD,EAAI,CACtByE,EAAIxD,GAAG,CAACP,EAAEiE,GAAG,CAAE,GAAE/E,IAAGC,CAAE,GACtBsE,CAAO,CAACnE,EAAI,CAAGH,EAAIiE,EAAoBpD,EAAEqD,WAAW,IAAIL,AAC1D,CACA,OAAOe,CACT,CAgCO,eAAeQ,EAAe5E,EAAa,EAAA,EAAE,EAClD,IAAM6E,EAAS,MAAM7E,EAAOC,KAAK,CAACuB,OAAO,CAACrB,QAAQ,CAAC,CACjDU,MAAO,CAACR,EAAG,IAAEqC,CAAE,CAAE,GAAKA,EAAGrC,EAAEoC,MAAM,CAAE,iBACnCqC,KAAM,CAAEC,QAAS,CAAEA,QAAS,CAAEvE,IAAI,CAAK,CAAE,CAAE,EAC3CJ,QAAS,CAACC,EAAG,CAAEC,KAAG,CAAE,GAAKA,EAAID,EAAE2E,IAAI,CACrC,GACA,GAAsB,IAAlBH,EAAO1F,MAAM,CAAQ,OAAO,EAChC,IAAM8F,EAAYtB,EAChBkB,EAAOK,GAAG,CAAE7E,AAAD,IAAO,AAAC,CAAEiE,IAAKjE,EAAEG,EAAE,CAAEkD,YAAarD,EAAE0E,OAAO,CAAC5F,MAAM,CAAC,CAAC,GAE7DsB,EAAQ,EACZ,IAAK,IAAMJ,KAAKwE,EAAQ,CACtB,IAAMzC,EAAI6C,EAAUE,GAAG,CAAC9E,EAAEG,EAAE,EACvB4B,GAAG,AACJxC,MAAKsE,KAAK,CAAC9B,EAAE7C,CAAC,IAAMK,KAAKsE,KAAK,CAAC7D,EAAEd,CAAC,GAAKK,KAAKsE,KAAK,CAAC9B,EAAE5C,CAAC,IAAMI,KAAKsE,KAAK,CAAC7D,EAAEb,EAAC,GAAG,CAChF,MAAMQ,EAAOW,MAAM,CAAC,EAAA,OAAO,EAAEC,GAAG,CAAC,CAAErB,EAAG6C,EAAE7C,CAAC,CAAEC,EAAG4C,EAAE5C,CAAC,AAAC,GAAGqB,KAAK,CAAC,CAAA,EAAA,EAAA,EAAA,AAAE,EAAC,EAAA,OAAO,CAACL,EAAE,CAAEH,EAAEG,EAAE,GAC9EC,IACF,CACA,OAAOA,CACT,wHA7CO,SACL+D,AADcD,CACsD,EAGpE,IAAK,IAAIrF,EAAI,EAAGA,EAAIsF,EAAOrF,MAAM,CAAED,IAAK,AACtC,IAAK,IAAIE,EAAIF,EAAI,EAAGE,EAAIoF,EAAOrF,MAAM,CAAEC,IAAK,CAC1C,IAAMC,EAAImF,CAAM,CAACtF,EAAE,CACbI,EAAIkF,CAAM,CAACpF,EAAE,CACbsF,EAAKjB,EAAoBpE,EAAEqE,WAAW,EACtCiB,EAAKlB,EAAoBnE,EAAEoE,WAAW,EAC5C,GAAIrE,EAAEE,CAAC,CAAGD,EAAEC,CAAC,GAAGkF,GAAKpF,EAAEE,CAAC,CAPlB4D,EAOqBsB,EAAInF,EAAEC,CAAC,EAAIF,EAAEG,CAAC,CAAGF,EAAEE,CAAC,CAAGmF,CAP1B,EAOgCtF,EAAEG,CAAC,CAAGkF,EAAKpF,EAAEE,CAAC,CACpE,CADsE,MAC/D,CAEX,CAEF,OAAO,CACT,yDCjFA,IAAA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,OAAA,EAAA,EAAA,CAAA,CAAA,OAAA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,MAKA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,qDAIO,IAAM4F,EAAiB,EAAA,CAAC,CAACC,MAAM,CAAC,CACrCR,OAAQ,EAAA,CAAC,CACNS,KAAK,CACJ,EAAA,CAAC,CAACD,MAAM,CAAC,CACPL,KAAM,EAAA,CAAC,CAACO,MAAM,GAAGC,IAAI,GAAGvB,GAAG,CAAC,GAC5BwB,OAAQ,EAAA,CAAC,CAACF,MAAM,GAAGG,OAAO,GAC1BC,YAAa,EAAA,CAAC,CAACJ,MAAM,GAAGG,OAAO,GAC/BX,QAAS,EAAA,CAAC,CACPO,KAAK,CACJ,EAAA,CAAC,CAACD,MAAM,CAAC,CACPL,KAAM,EAAA,CAAC,CAACO,MAAM,GAAGC,IAAI,GAAGvB,GAAG,CAAC,GAC5B2B,KAAM,EAAA,CAAC,CAACL,MAAM,GAAGC,IAAI,GAAGvB,GAAG,CAAC,GAC5B4B,KAAM,EAAA,CAAC,CAACC,OAAO,GAAGC,QAAQ,GAC1BC,KAAM,EAAA,CAAC,CAACF,OAAO,GAAGC,QAAQ,GAC1BE,SAAU,EAAA,CAAC,CAACH,OAAO,GAAGC,QAAQ,GAC9BG,KAAM,EAAA,CAAC,CAACX,MAAM,GAAGG,OAAO,EAC1B,IAEDS,OAAO,CAAC,EAAE,CACf,IAEDA,OAAO,CAAC,EAAE,EACbC,UAAW,EAAA,CAAC,CACTd,KAAK,CACJ,EAAA,CAAC,CAACD,MAAM,CAAC,CACPgB,UAAW,EAAA,CAAC,CAACd,MAAM,GACnBe,WAAY,EAAA,CAAC,CAACf,MAAM,GACpBgB,QAAS,EAAA,CAAC,CAAChB,MAAM,GACjBiB,SAAU,EAAA,CAAC,CAACjB,MAAM,GAClBkB,MAAO,EAAA,CAAC,CAAClB,MAAM,GAAGG,OAAO,EAC3B,IAEDS,OAAO,CAAC,EAAE,EACbO,UAAW,EAAA,CAAC,CACTpB,KAAK,CACJ,EAAA,CAAC,CAACD,MAAM,CAAC,CACPnD,OAAQ,EAAA,CAAC,CAACqD,MAAM,GAAGC,IAAI,GAAGvB,GAAG,CAAC,GAC9BpC,KAAM,EAAA,CAAC,CAAC0D,MAAM,GAAGC,IAAI,GAAGvB,GAAG,CAAC,GAC5BwB,OAAQ,EAAA,CAAC,CAACF,MAAM,GAAGG,OAAO,GAC1BC,YAAa,EAAA,CAAC,CAACJ,MAAM,GAAGG,OAAO,GAC/BiB,KAAM,EAAA,CAAC,CACJrB,KAAK,CACJ,EAAA,CAAC,CAACD,MAAM,CAAC,CACPuB,MAAO,EAAA,CAAC,CAACrB,MAAM,GACfsB,OAAQ,EAAA,CAAC,CAACtB,MAAM,GAAGY,OAAO,CAAC,OAC7B,IAEDA,OAAO,CAAC,EAAE,CACf,IAEDA,OAAO,CAAC,EAAE,CACf,GAKO,eAAeW,EAAW9G,EAAiB,EAAA,EAAE,EAClD,IAAM+G,EAAI,MAAM/G,EAAOC,KAAK,CAAC+G,SAAS,CAACvF,SAAS,CAAC,CAAEZ,MAAO,CAACR,EAAG,IAAEqC,CAAE,CAAE,GAAKA,EAAGrC,EAAEG,EAAE,CAAE,YAAa,GAC/F,OAAOuG,GAAGE,SAAW,CACvB,CAEO,eAAeC,EAAYlH,EAAiB,EAAA,EAAE,EACnD,GAAM,CAAC+G,EAAE,CAAG,MAAM/G,EACfmH,MAAM,CAAC,EAAA,SAAS,EAChBC,MAAM,CAAC,CAAE5G,GAAI,YAAayG,QAAS,CAAE,GACrCI,kBAAkB,CAAC,CAClBC,OAAQ,EAAA,SAAS,CAAC9G,EAAE,CACpBI,IAAK,CAAEqG,QAAS,EAAA,GAAG,CAAC,EAAE,EAAA,SAAS,CAACA,OAAO,CAAC,IAAI,CAAC,AAAC,CAChD,GACCM,SAAS,GACZ,OAAOR,EAAEE,OAAO,AAClB,CAQO,eAAeO,EAAeC,CAAc,CAAEzH,EAAiB,EAAA,EAAE,EACtE,IAAM0H,EAAOtC,EAAeuC,KAAK,CAACF,GAG5BG,EAAaF,EAAK7C,MAAM,CAACK,GAAG,CAAC,AAAC7E,GAAMA,EAAE2E,IAAI,CAChD,OAAMhF,EACHiD,MAAM,CAAC,EAAA,OAAO,EACdpC,KAAK,CACJ+G,EAAWzI,MAAM,CACb,CAAA,EAAA,EAAA,GAAA,AAAG,EAAC,CAAA,EAAA,EAAA,EAAA,AAAE,EAAC,EAAA,OAAO,CAACsD,MAAM,CAAE,iBAAkB,CAAA,EAAA,EAAA,UAAA,AAAU,EAAC,EAAA,OAAO,CAACuC,IAAI,CAAE4C,IAClE,CAAA,EAAA,EAAA,EAAE,AAAF,EAAG,EAAA,OAAO,CAACnF,MAAM,CAAE,kBAM3B,IAAMoF,EAAc,MAAM7H,EAAOC,KAAK,CAACuB,OAAO,CAACrB,QAAQ,CAAC,CACtD4E,QAAS,CAAEC,KAAM,GAAMzF,GAAG,EAAMC,GAAG,CAAK,EACxCsF,KAAM,CAAEC,QAAS,CAAEA,QAAS,CAAEvE,IAAI,CAAK,CAAE,CAAE,CAC7C,GACMsH,EAAiB,IAAIzD,IAAIwD,EAAY3C,GAAG,CAAE7E,AAAD,GAAO,CAACA,EAAE2E,IAAI,CAAE3E,EAAE,GAC3D0H,EAAoB,CAAA,EAAA,EAAA,iBAAA,AAAiB,EACzCL,EAAK7C,MAAM,CACRmD,MAAM,CAAE3H,AAAD,GAAO,CAACyH,EAAeG,GAAG,CAAC5H,EAAE2E,IAAI,GACxCE,GAAG,CAAC,AAAC7E,IAAM,AAAC,CAAEiE,IAAKjE,EAAE2E,IAAI,CAAEtB,YAAarD,EAAE0E,OAAO,CAAC5F,MAAM,CAAC,CAAC,EAC7D0I,EAAY3C,GAAG,CAAC,AAAC7E,IAAM,AAAC,CAAEd,EAAGc,EAAEd,CAAC,CAAEC,EAAGa,EAAEb,CAAC,CAAEkE,YAAarD,EAAE0E,OAAO,CAAC5F,MAAM,CAAC,CAAC,GAGrE+I,EAAgB,IAAI7D,IAC1B,IAAK,IAAMhE,KAAKqH,EAAK7C,MAAM,CAAE,CAC3B,IAAMhB,EAAWiE,EAAe3C,GAAG,CAAC9E,EAAE2E,IAAI,EACpCmD,EAAMJ,EAAkB5C,GAAG,CAAC9E,EAAE2E,IAAI,EAClCzF,EAAIsE,GAAUtE,GAAK4I,GAAK5I,GAAK,EAC7BC,EAAIqE,GAAUrE,GAAK2I,GAAK3I,GAAK,EAC7B,CAAC4I,EAAM,CAAG,MAAMpI,EACnBmH,MAAM,CAAC,EAAA,OAAO,EACdC,MAAM,CAAC,CACNpC,KAAM3E,EAAE2E,IAAI,CACZS,OAAQpF,EAAEoF,MAAM,EAAI,KACpBE,YAAatF,EAAEsF,WAAW,EAAI,KAC9BlD,OAAQ,kBACRlD,IACAC,CACF,GACC6H,kBAAkB,CAAC,CAClBC,OAAQ,EAAA,OAAO,CAACtC,IAAI,CACpBpE,IAAK,CACH6E,OAAQpF,EAAEoF,MAAM,EAAI,KACpBE,YAAatF,EAAEsF,WAAW,EAAI,KAC9BlD,OAAQ,eACV,CACF,GACC8E,SAAS,GACZW,EAActH,GAAG,CAACP,EAAE2E,IAAI,CAAEoD,EAAM5H,EAAE,EAClC,MAAMR,EAAOiD,MAAM,CAAC,EAAA,QAAQ,EAAEpC,KAAK,CAAC,CAAA,EAAA,EAAA,EAAA,AAAE,EAAC,EAAA,QAAQ,CAACwH,OAAO,CAAED,EAAM5H,EAAE,GAC7DH,EAAE0E,OAAO,CAAC5F,MAAM,EAAE,AACpB,MAAMa,EAAOmH,MAAM,CAAC,EAAA,QAAQ,EAAEC,MAAM,CAClC/G,EAAE0E,OAAO,CAACG,GAAG,CAAC,CAAC7C,EAAGnD,IAAM,CAAC,CACvBmJ,QAASD,EAAM5H,EAAE,CACjBwE,KAAM3C,EAAE2C,IAAI,CACZY,KAAMvD,EAAEuD,IAAI,CACZC,KAAMxD,EAAEwD,IAAI,GAAI,EAChBG,KAAM3D,EAAE2D,IAAI,GAAI,EAChBC,SAAU5D,EAAE4D,QAAQ,GAAI,EACxBC,KAAM7D,EAAE6D,IAAI,EAAI,KAChBoC,IAAKpJ,EACP,CAAC,EAGP,CAGA,IAAMqJ,EAAgB,IAAIL,EAAcd,MAAM,GAAG,CAWjD,IAAK,IAAMsB,KAVPH,EAAcpJ,MAAM,EAAE,AACxB,MAAMa,EACHiD,MAAM,CAAC,EAAA,UAAU,EACjBpC,KAAK,CACJ,CAAA,EAAA,EAAA,EAAA,AAAE,EACA,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,EAAA,UAAU,CAAC2H,WAAW,CAAED,GAChC,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,EAAA,UAAU,CAACE,SAAS,CAAEF,KAItBb,EAAKtB,SAAS,EAAE,CAC9B,IAAMuC,EAAST,EAAc/C,GAAG,CAACuD,EAAErC,SAAS,EACtCuC,EAAOV,EAAc/C,GAAG,CAACuD,EAAEnC,OAAO,EACnCoC,GAAWC,GAChB,GADsB,CAAP,EACT5I,EAAOmH,MAAM,CAAC,EAAA,UAAU,EAAEC,MAAM,CAAC,CACrCoB,YAAaG,EACbF,UAAWG,EACXtC,WAAYoC,EAAEpC,UAAU,CACxBE,SAAUkC,EAAElC,QAAQ,CACpBC,MAAOiC,EAAEjC,KAAK,EAAI,CAAA,EAAGiC,EAAEpC,UAAU,CAAC,GAAG,EAAEoC,EAAEnC,OAAO,CAAC,CAAC,EAAEmC,EAAElC,QAAQ,CAAA,CAAE,AAClE,EACF,CAGA,IAAMqC,EAAS,IAAIC,IAAIpB,EAAKhB,SAAS,CAACxB,GAAG,CAAC,AAACxE,GAAM,CAAA,EAAGA,EAAEwB,MAAM,CAAC,CAAC,EAAExB,EAAEmB,IAAI,CAAA,CAAE,GAIlEmH,EAAQD,CAHG,MAAM/I,EAAOC,KAAK,CAACC,QAAQ,CAACC,QAAQ,CAAC,CACpDU,MAAO,CAACR,EAAG,IAAEqC,CAAE,CAAE,GAAKA,EAAGrC,EAAEoC,MAAM,CAAE,gBACrC,EAAA,EACuBuF,MAAM,CAAC,AAACtH,GAAM,CAACmI,EAAOZ,GAAG,CAAC,CAAA,EAAGvH,EAAEwB,MAAM,CAAC,CAAC,EAAExB,EAAEmB,IAAI,CAAA,CAAE,GAAGqD,GAAG,CAAC,AAACxE,GAAMA,EAAEF,EAAE,EACtFwI,EAAM7J,MAAM,EAAE,MAAMa,EAAOiD,MAAM,CAAC,EAAA,QAAQ,EAAEpC,KAAK,CAAC,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,EAAA,QAAQ,CAACL,EAAE,CAAEwI,IAI3E,IAAIC,EAAgB,CAAC,MAAMjJ,EAAOgB,MAAM,CAAC,CAAED,EAAG,CAAA,EAAA,EAAA,KAAA,AAAK,GAAG,GAAGE,IAAI,CAAC,EAAA,SAAQ,CAAE,AAAD,CAAE,EAAE,CAACF,CAAC,CAC7E,IAAK,IAAML,KAAKgH,EAAKhB,SAAS,CAAE,CAC9B,IAGInH,EAAWC,EAHTqE,EAAW,MAAM7D,EAAOC,KAAK,CAACC,QAAQ,CAACuB,SAAS,CAAC,CACrDZ,MAAO,CAACR,EAAG,KAAE6I,CAAG,IAAExG,CAAE,CAAE,GAAKwG,EAAIxG,EAAGrC,EAAE6B,MAAM,CAAExB,EAAEwB,MAAM,EAAGQ,EAAGrC,EAAEwB,IAAI,CAAEnB,EAAEmB,IAAI,EAC1E,GAEA,GAAIgC,EACFtE,EAAIsE,EAAStE,CAAC,CACdC,EAAIqE,AAFQ,EAECrE,CAAC,KACT,CACL,IAAM2J,EAAO,CAAA,EAAA,EAAA,uBAAA,AAAuB,EAACF,GACrC1J,EAAI4J,EAAK5J,CAAC,CACVC,EAAI2J,EAAK3J,CAAC,CACVyJ,GACF,CACA,GAAM,CAACb,EAAM,CAAG,MAAMpI,EACnBmH,MAAM,CAAC,EAAA,QAAQ,EACfC,MAAM,CAAC,CACNlF,OAAQxB,EAAEwB,MAAM,CAChBL,KAAMnB,EAAEmB,IAAI,CACZ4D,OAAQ/E,EAAE+E,MAAM,EAAI,KACpBE,YAAajF,EAAEiF,WAAW,EAAI,KAC9BlD,OAAQ,gBACRlD,MACAC,CACF,GACC6H,kBAAkB,CAAC,CAClBC,OAAQ,CAAC,EAAA,QAAQ,CAACpF,MAAM,CAAE,EAAA,QAAQ,CAACL,IAAI,CAAC,CACxCjB,IAAK,CACH6E,OAAQ/E,EAAE+E,MAAM,EAAI,KACpBE,YAAajF,EAAEiF,WAAW,EAAI,KAC9BlD,OAAQ,eACV,CACF,GACC8E,SAAS,GAEZ,IAAK,IAAM8B,KADX,MAAMrJ,EAAOiD,MAAM,CAAC,EAAA,aAAa,EAAEpC,KAAK,CAAC,CAAA,EAAA,EAAA,EAAE,AAAF,EAAG,EAAA,aAAa,CAACuI,UAAU,CAAEhB,EAAM5H,EAAE,GAC9DE,EAAEiG,IAAI,EAAE,CACtB,IAAM2C,EACJpB,EAAc/C,GAAG,CAACkE,EAAEzC,KAAK,IAEvB,CADF,KACQ5G,EAAOC,KAAK,CAACuB,OAAO,CAACC,SAAS,CAAC,CAAEZ,MAAO,CAACR,EAAG,IAAEqC,CAAE,CAAE,GAAKA,EAAGrC,EAAE2E,IAAI,CAAEqE,EAAEzC,KAAK,CAAE,EAAA,CACnF,EAAGpG,GACA8I,GACL,EADU,IACJtJ,EAAOmH,MAAM,CAAC,EAAA,aAAa,EAAEC,MAAM,CAAC,CACxCgC,WAAYhB,EAAM5H,EAAE,CACpB6H,QAASiB,EACTzC,OAAQwC,EAAExC,MAAM,AAClB,EACF,CACF,CAGA,MAAM,CAAA,EAAA,EAAA,yBAAA,AAAyB,EAAC7G,GAMhC,IAAMuJ,EAAe,MAAMvJ,EAAOC,KAAK,CAACuB,OAAO,CAACrB,QAAQ,CAAC,CACvDU,MAAO,CAACR,EAAG,IAAEqC,CAAE,CAAE,GAAKA,EAAGrC,EAAEoC,MAAM,CAAE,iBACnCsC,QAAS,CAAExF,GAAG,EAAMC,GAAG,CAAK,EAC5BsF,KAAM,CAAEC,QAAS,CAAEA,QAAS,CAAEvE,IAAI,CAAK,CAAE,CAAE,CAC7C,GAEE,CAAA,EAAA,EAAA,aAAA,AAAa,EACX+I,EAAarE,GAAG,CAAC,AAAC7E,IAAM,AAAC,CAAEd,EAAGc,EAAEd,CAAC,CAAEC,EAAGa,EAAEb,CAAC,CAAEkE,YAAarD,EAAE0E,OAAO,CAAC5F,MAAM,AAAC,CAAC,KAE5E,AACA,MAAM,CAAA,EAAA,EAAA,cAAA,AAAc,EAACa,GAEvB,IAAMwJ,EAAY,MAAMxJ,EAAOgB,MAAM,CAAC,CAAEzB,EAAG,EAAA,QAAQ,CAACA,CAAC,CAAEC,EAAG,EAAA,QAAQ,CAACA,CAAC,AAAC,GAAGyB,IAAI,CAAC,EAAA,QAAQ,EACjF,CAAA,EAAA,EAAA,gBAAA,AAAgB,EAACuI,IAAY,MAAM,CAAA,EAAA,EAAA,iBAAA,AAAiB,EAACxJ,GAEzD,IAAMiH,EAAU,MAAMC,EAAYlH,GAClC,MAAO,CACL6E,OAAQ6C,EAAK7C,MAAM,CAAC1F,MAAM,CAC1BiH,UAAWsB,EAAKtB,SAAS,CAACjH,MAAM,CAChCuH,UAAWgB,EAAKhB,SAAS,CAACvH,MAAM,SAChC8H,CACF,CACF,oICvRA,IAAA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,OAOA,IAAIwC,EAA4B,KAEzB,SAASC,IAGd,GAAIC,QAAQC,GAAG,CAACC,WAAW,CAAE,OAAOF,QAAQC,GAAG,CAACC,WAAW,CAG3D,IAAMC,EAAW,CAAA,EAAA,EAAA,oBAAA,AAAoB,IACrC,GAAIA,EAAU,CACZ,IAAMC,EAAS,CAAA,EAAA,EAAA,YAAY,AAAZ,EAAaD,GAC5B,GAAIC,EAAQ,OAAOA,EAAOlI,IAAI,AAChC,CACA,IAAMmI,EAAK,CAAA,EAAA,EAAA,eAAe,AAAf,IACX,GAAIA,EAAI,OAAOA,EAAGnI,IAAI,CACtB,GAAI4H,EAAY,OAAOA,EACvB,GAAI,CACF,IAAMQ,EAAM,CAAA,EAAA,EAAA,QAAA,AAAQ,EAAC,gCAAiC,CACpDC,IAAKP,QAAQO,GAAG,GAChBC,MAAO,CAAC,SAAU,OAAQ,SAAS,AACrC,GACGC,QAAQ,GACR5E,IAAI,GACP,GAAIyE,EAAK,OAAQR,EAAaQ,CAChC,CAAE,KAAM,CAER,CACA,OAAQR,EAAa,CAAA,EAAA,EAAA,OAAA,AAAO,EAACE,QAAQO,GAAG,GAAI,QAC9C,kBAUO,SAASO,EACd,GAAId,QAAQC,GAAG,CAACc,eAAe,CAAE,OAAOf,QAAQC,GAAG,CAACc,eAAe,CAGnE,IAAMZ,EAAW,CAAA,EAAA,EAAA,oBAAA,AAAoB,IACrC,GAAIA,GAAY,CAAA,EAAA,EAAA,YAAA,AAAY,EAACA,GAAW,MAAO,CAAA,EAAA,EAAA,UAAA,AAAU,EAACA,GAC1D,IAAME,EAAK,CAAA,EAAA,EAAA,eAAA,AAAe,WAC1B,AAAIA,EAAW,CAAA,CAAP,CAAO,EAAA,UAAA,AAAU,EAACA,EAAGxJ,EAAE,EACxB,CAAA,EAAA,EAAA,IAAA,AAAI,EAAC,CAAA,EAAA,EAAA,OAAA,AAAO,IAAI,UAXhB,CAW2B8J,AAX3B,EAAA,EAAA,UAAU,AAAV,EAAW,UAAU3J,MAAM,CAAC+I,KAAYa,MAAM,CAAC,OAAOC,KAAK,CAAC,EAAG,IAYxE,eAjBO,SAASH,EACd,MAAO,CAAA,EAAA,EAAA,QAAA,AAAQ,EAACX,IAClB,2CChCA,IAAIiB,EAA6D,KAEjE,eAAeC,IAeb,OAdI,AAACD,IACHA,EAAkB,CAAC,UADC,AAElB,GAAM,UAAEE,CAAQ,CAAE,CAAG,MAAA,EAAA,CAAA,CAAA,OAGrB,OAAQ,MAAMA,EACZ,qBACA,2BAEJ,CAAC,GAAIC,KAAK,CAAC,AAACpK,IAEV,MADAiK,EAAkB,KACZjK,CADkB,AAE1B,EAAA,EAEKiK,CACT,CAGO,eAAeI,EAAUC,CAAY,EAC1C,IAAMC,EAAUD,EAAKxF,IAAI,GACzB,GAAI,CAACyF,EAAS,AAV6D,OAUtD,KACrB,GAAI,CACF,IAAMC,EAAW,MAAMN,IACjBxG,EAAM,MAAM8G,EAASD,EAAS,CAAEE,QAAS,OAAQvJ,WAAW,CAAK,GACvE,OAAOmC,MAAM9C,IAAI,CAACmD,EAAIgH,IAAI,CAC5B,CAAE,MAAO1K,EAAG,CAEV,OADA2K,QAAQC,KAAK,CAAC,uBAAwB5K,aAAa6K,MAAQ7K,EAAE8K,OAAO,CAAG9K,GAChE,IACT,CACF,CAGO,SAAS+K,EAAmBC,CAKlC,EACC,MAAO,CAACA,EAAKC,KAAK,CAAED,EAAKE,IAAI,CAAEF,EAAKG,KAAK,CAAEH,EAAKI,OAAO,CAAC,CAAC9D,MAAM,CAAC+D,SAASC,IAAI,CAAC,KAChF,CAiBO,SAASM,EAAaC,CAAW,EACtC,OAAOC,KAAKC,SAAS,CAACF,EACxB,CAkBO,eAAeU,EAAYzM,CAAU,EAC1C,GAAI,CACF,GAAM,IAAE0M,CAAE,CAAE,CAAG,MAAA,EAAA,CAAA,CAAA,OACT,MAAExB,CAAI,CAAE,CAAG,MAAA,EAAA,CAAA,CAAA,OACX,IAAEhJ,CAAE,CAAE,CAAG,MAAA,EAAA,CAAA,CAAA,OACT5C,EAAM,MAAMoN,EAAGjN,KAAK,CAACyL,IAAI,CAACjK,SAAS,CAAC,CACxCZ,MAAO,CAACR,EAAG,CAAEqC,GAAIyK,CAAG,CAAE,GAAKA,EAAI9M,EAAEG,EAAE,CAAEA,GACrCuE,QAAS,CAAE4G,MAAO,GAAMC,MAAM,EAAMC,OAAO,EAAMC,SAAS,CAAK,CACjE,GACA,GAAI,CAAChM,EAAK,OACV,IAAMsN,EAAM,MAAMrC,EAAUU,EAAmB3L,IAC/C,GAAI,CAACsN,EAAK,MACV,OAAMF,EAAGvM,MAAM,CAAC+K,GAAM9K,GAAG,CAAC,CAAEyM,UAAWf,EAAac,EAAK,GAAGvM,KAAK,CAAC6B,EAAGgJ,EAAKlL,EAAE,CAAEA,GAChF,CAAE,MAAOE,EAAG,CACV2K,QAAQC,KAAK,CAAC,+BAAgC9K,EAAIE,aAAa6K,MAAQ7K,EAAE8K,OAAO,CAAG9K,EACrF,CACF,CAGO,eAAe4M,EACpBrN,CAAa,CACbsN,CAAe,EAEf,IAAMC,EAAW,MAAMzC,EAAU9K,GACjC,GAAI,CAACuN,EAAU,OAAO,KACtB,IAAMC,EAA4C,EAAE,CACpD,IAAK,IAAMC,KAAQH,EAAY,CAC7B,IAAMhB,EA3CH,AA2COG,SA3CeC,AAAbD,CAA2C,EACzD,GAAI,CAACC,EAAK,OAAO,KACjB,GAAI,CACF,IAAMC,EAASJ,KAAK7E,KAAK,CAACgF,GAC1B,GAAI,CAAC5I,MAAM8I,OAAO,CAACD,IACfA,EAAOE,IAAI,CAAC,AAACvN,GAAmB,UAAb,OAAOA,GAAkB,CAACwN,OAAOC,QAAQ,CAACzN,IADrC,CAC0C,MADnC,CAC0C,IAC7E,OAAOqN,CACT,CAAE,KAAM,CACN,OAAO,IACT,CACF,EAiC2Bc,EAAKL,SAAS,EAChCd,GAAG,AACRkB,EAAOvK,IAAI,CAAC,MAAEwK,EAAMC,MA/DjB,AA+DwB1B,SA/DfA,AAAiB5M,CAAW,CAAEC,CAAW,EACvD,GAAID,EAAEF,MAAM,GAAKG,EAAEH,MAAM,CAAE,OAAO,EAClC,IAAI+M,EAAM,EACNC,EAAQ,EACRC,EAAQ,EACZ,IAAK,IAAIlN,EAAI,EAAGA,EAAIG,EAAEF,MAAM,CAAED,IAAK,AACjCgN,GAAO7M,CAAC,CAACH,EAAE,CAAGI,CAAC,CAACJ,EAAE,CAClBiN,GAAS9M,CAAC,CAACH,EAAE,CAAGG,CAAC,CAACH,EAAE,CACpBkN,GAAS9M,CAAC,CAACJ,EAAE,CAAGI,CAAC,CAACJ,EAAE,QAER,AAAd,IAAIiN,GAAyB,GAAG,CAAbC,EAAoB,EAChCF,GAAOtM,GAAD,EAAMyM,IAAI,CAACF,GAASvM,KAAKyM,IAAI,CAACD,EAAAA,CAAM,AACnD,EAmDgDoB,EAAUjB,EAAG,EAC3D,CAEA,OADAkB,EAAOG,IAAI,CAAC,CAACvO,EAAGC,IAAMA,EAAEqO,KAAK,CAAGtO,EAAEsO,KAAK,EAChCF,CACT"}

package/.next/server/chunks/[root-of-the-server]__1j25n4-._.js

@@ -0,0 +1,5 @@
+module.exports=[18622,(e,t,n)=>{t.exports=e.x("next/dist/compiled/next-server/app-page-turbo.runtime.prod.js",()=>require("next/dist/compiled/next-server/app-page-turbo.runtime.prod.js"))},56704,(e,t,n)=>{t.exports=e.x("next/dist/server/app-render/work-async-storage.external.js",()=>require("next/dist/server/app-render/work-async-storage.external.js"))},32319,(e,t,n)=>{t.exports=e.x("next/dist/server/app-render/work-unit-async-storage.external.js",()=>require("next/dist/server/app-render/work-unit-async-storage.external.js"))},70406,(e,t,n)=>{t.exports=e.x("next/dist/compiled/@opentelemetry/api",()=>require("next/dist/compiled/@opentelemetry/api"))},93695,(e,t,n)=>{t.exports=e.x("next/dist/shared/lib/no-fallback-error.external.js",()=>require("next/dist/shared/lib/no-fallback-error.external.js"))},60338,e=>{"use strict";var t=e.i(56325),n=e.i(44988),a=e.i(18899);e.s(["avg",0,function(e){return a.sql`avg(${e})`.mapWith(String)},"avgDistinct",0,function(e){return a.sql`avg(distinct ${e})`.mapWith(String)},"count",0,function(e){return a.sql`count(${e||a.sql.raw("*")})`.mapWith(Number)},"countDistinct",0,function(e){return a.sql`count(distinct ${e})`.mapWith(Number)},"max",0,function(e){return a.sql`max(${e})`.mapWith((0,n.is)(e,t.Column)?e:String)},"min",0,function(e){return a.sql`min(${e})`.mapWith((0,n.is)(e,t.Column)?e:String)},"sum",0,function(e){return a.sql`sum(${e})`.mapWith(String)},"sumDistinct",0,function(e){return a.sql`sum(distinct ${e})`.mapWith(String)}])},3723,e=>e.a(async(t,n)=>{try{var a=e.i(75225),r=e.i(91426),i=e.i(34700),o=t([r]);function l(e){let t=Math.floor(e/12);return{x:-300-280*t,y:e%12*60}}async function s(e=r.db){let t=await e.query.endpoint.findMany({orderBy:(e,{asc:t,desc:n})=>[t(e.y),n(e.x),t(e.id)]});if(0===t.length)return 0;let n=0;for(let r=0;r<t.length;r++){let{x:o,y:s}=l(r),d=t[r];(d.x!==o||d.y!==s)&&(await e.update(i.endpoint).set({x:o,y:s}).where((0,a.eq)(i.endpoint.id,d.id)),n++)}return n}async function d(e=r.db){let[t,n]=await Promise.all([e.query.dbTable.findFirst({orderBy:(e,{desc:t})=>t(e.y)}),e.query.endpoint.findFirst({orderBy:(e,{desc:t})=>t(e.y)})]),a=Math.max(t?.y??0,n?.y??0);return a>0?a+280:0}[r]=o.then?(await o)():o,e.s(["computeDraftOriginY",0,d,"endpointsOverlap",0,function(e){for(let t=0;t<e.length;t++)for(let n=t+1;n<e.length;n++){let a=e[t],r=e[n];if(a.x<r.x+240&&a.x+240>r.x&&a.y<r.y+50&&a.y+50>r.y)return!0}return!1},"gridPositionForEndpoint",0,l,"relayoutEndpoints",0,s]),n()}catch(e){n(e)}},!1),46409,e=>e.a(async(t,n)=>{try{var a=e.i(75225),r=e.i(91426),i=e.i(34700),o=t([r]);async function l(e=r.db){let[t,n]=await Promise.all([e.query.endpoint.findMany({where:(e,{ne:t})=>t(e.source,"INTROSPECTION")}),e.query.endpoint.findMany({where:(e,{eq:t})=>t(e.source,"INTROSPECTION")})]),o={collapsed:0,mappings:[]};for(let r of t){let t=n.find(e=>(function(e,t){if(e.method.toUpperCase()!==t.method.toUpperCase())return!1;let n=e.path.replace(/\{[^}]*\}/g,"{}"),a=t.path.replace(/\{[^}]*\}/g,"{}");return a===n||a.endsWith(n)})(r,e));t&&(await e.delete(i.endpoint).where((0,a.eq)(i.endpoint.id,r.id)),o.collapsed++,o.mappings.push({planned:`${r.method} ${r.path}`,code:`${t.method} ${t.path}`}))}return o}[r]=o.then?(await o)():o,e.s(["reconcilePlannedEndpoints",0,l]),n()}catch(e){n(e)}},!1),96902,e=>e.a(async(t,n)=>{try{var a=e.i(75225),r=e.i(91426),i=e.i(34700),o=t([r]);function l(e){return 36+30*Math.max(0,e)+16}function s(e,t=[]){let n=[,,,,].fill(0);for(let e of t){let t=Math.max(0,Math.min(3,Math.round(e.x/320))),a=e.y+l(e.columnCount)+50;a>n[t]&&(n[t]=a)}let a=new Map;for(let t of e){let e=0;for(let t=1;t<4;t++)n[t]<n[e]&&(e=t);let r=320*e,i=n[e];a.set(t.key,{x:r,y:i}),n[e]=i+l(t.columnCount)+50}return a}async function d(e=r.db){let t=await e.query.dbTable.findMany({where:(e,{eq:t})=>t(e.source,"INTROSPECTION"),with:{columns:{columns:{id:!0}}},orderBy:(e,{asc:t})=>t(e.name)});if(0===t.length)return 0;let n=s(t.map(e=>({key:e.id,columnCount:e.columns.length}))),o=0;for(let r of t){let t=n.get(r.id);t&&(Math.round(t.x)!==Math.round(r.x)||Math.round(t.y)!==Math.round(r.y))&&(await e.update(i.dbTable).set({x:t.x,y:t.y}).where((0,a.eq)(i.dbTable.id,r.id)),o++)}return o}[r]=o.then?(await o)():o,e.s(["estimateTableHeight",0,l,"packTablesMasonry",0,s,"relayoutTables",0,d,"tablesOverlap",0,function(e){for(let t=0;t<e.length;t++)for(let n=t+1;n<e.length;n++){let a=e[t],r=e[n],i=l(a.columnCount),o=l(r.columnCount);if(a.x<r.x+300&&a.x+300>r.x&&a.y<r.y+o&&a.y+i>r.y)return!0}return!1}]),n()}catch(e){n(e)}},!1),6659,e=>e.a(async(t,n)=>{try{var a=e.i(69719),r=e.i(75225),i=e.i(60338),o=e.i(18899),l=e.i(91426),s=e.i(34700),d=e.i(3723),u=e.i(46409),c=e.i(96902),p=t([l,d,u,c]);[l,d,u,c]=p.then?(await p)():p;let f=a.z.object({tables:a.z.array(a.z.object({name:a.z.string().trim().min(1),domain:a.z.string().nullish(),description:a.z.string().nullish(),columns:a.z.array(a.z.object({name:a.z.string().trim().min(1),type:a.z.string().trim().min(1),isPk:a.z.boolean().optional(),isFk:a.z.boolean().optional(),nullable:a.z.boolean().optional(),note:a.z.string().nullish()})).default([])})).default([]),relations:a.z.array(a.z.object({fromTable:a.z.string(),fromColumn:a.z.string(),toTable:a.z.string(),toColumn:a.z.string(),label:a.z.string().nullish()})).default([]),endpoints:a.z.array(a.z.object({method:a.z.string().trim().min(1),path:a.z.string().trim().min(1),domain:a.z.string().nullish(),description:a.z.string().nullish(),uses:a.z.array(a.z.object({table:a.z.string(),access:a.z.string().default("read")})).default([])})).default([])});async function m(e=l.db){let t=await e.query.syncState.findFirst({where:(e,{eq:t})=>t(e.id,"singleton")});return t?.version??0}async function h(e=l.db){let[t]=await e.insert(s.syncState).values({id:"singleton",version:1}).onConflictDoUpdate({target:s.syncState.id,set:{version:o.sql`${s.syncState.version} + 1`}}).returning();return t.version}async function y(e,t=l.db){let n=f.parse(e),a=n.tables.map(e=>e.name);await t.delete(s.dbTable).where(a.length?(0,r.and)((0,r.eq)(s.dbTable.source,"INTROSPECTION"),(0,r.notInArray)(s.dbTable.name,a)):(0,r.eq)(s.dbTable.source,"INTROSPECTION"));let o=await t.query.dbTable.findMany({columns:{name:!0,x:!0,y:!0},with:{columns:{columns:{id:!0}}}}),p=new Map(o.map(e=>[e.name,e])),m=(0,c.packTablesMasonry)(n.tables.filter(e=>!p.has(e.name)).map(e=>({key:e.name,columnCount:e.columns.length})),o.map(e=>({x:e.x,y:e.y,columnCount:e.columns.length}))),b=new Map;for(let e of n.tables){let n=p.get(e.name),a=m.get(e.name),i=n?.x??a?.x??0,o=n?.y??a?.y??0,[l]=await t.insert(s.dbTable).values({name:e.name,domain:e.domain??null,description:e.description??null,source:"INTROSPECTION",x:i,y:o}).onConflictDoUpdate({target:s.dbTable.name,set:{domain:e.domain??null,description:e.description??null,source:"INTROSPECTION"}}).returning();b.set(e.name,l.id),await t.delete(s.dbColumn).where((0,r.eq)(s.dbColumn.tableId,l.id)),e.columns.length&&await t.insert(s.dbColumn).values(e.columns.map((e,t)=>({tableId:l.id,name:e.name,type:e.type,isPk:e.isPk??!1,isFk:e.isFk??!1,nullable:e.nullable??!0,note:e.note??null,ord:t})))}let g=[...b.values()];for(let e of(g.length&&await t.delete(s.dbRelation).where((0,r.or)((0,r.inArray)(s.dbRelation.fromTableId,g),(0,r.inArray)(s.dbRelation.toTableId,g))),n.relations)){let n=b.get(e.fromTable),a=b.get(e.toTable);n&&a&&await t.insert(s.dbRelation).values({fromTableId:n,toTableId:a,fromColumn:e.fromColumn,toColumn:e.toColumn,label:e.label??`${e.fromColumn} → ${e.toTable}.${e.toColumn}`})}let w=new Set(n.endpoints.map(e=>`${e.method} ${e.path}`)),x=(await t.query.endpoint.findMany({where:(e,{eq:t})=>t(e.source,"INTROSPECTION")})).filter(e=>!w.has(`${e.method} ${e.path}`)).map(e=>e.id);x.length&&await t.delete(s.endpoint).where((0,r.inArray)(s.endpoint.id,x));let v=(await t.select({n:(0,i.count)()}).from(s.endpoint))[0].n;for(let e of n.endpoints){let n,a,i=await t.query.endpoint.findFirst({where:(t,{and:n,eq:a})=>n(a(t.method,e.method),a(t.path,e.path))});if(i)n=i.x,a=i.y;else{let e=(0,d.gridPositionForEndpoint)(v);n=e.x,a=e.y,v++}let[o]=await t.insert(s.endpoint).values({method:e.method,path:e.path,domain:e.domain??null,description:e.description??null,source:"INTROSPECTION",x:n,y:a}).onConflictDoUpdate({target:[s.endpoint.method,s.endpoint.path],set:{domain:e.domain??null,description:e.description??null,source:"INTROSPECTION"}}).returning();for(let n of(await t.delete(s.endpointTable).where((0,r.eq)(s.endpointTable.endpointId,o.id)),e.uses)){let e=b.get(n.table)??(await t.query.dbTable.findFirst({where:(e,{eq:t})=>t(e.name,n.table)}))?.id;e&&await t.insert(s.endpointTable).values({endpointId:o.id,tableId:e,access:n.access})}}await (0,u.reconcilePlannedEndpoints)(t);let T=await t.query.dbTable.findMany({where:(e,{eq:t})=>t(e.source,"INTROSPECTION"),columns:{x:!0,y:!0},with:{columns:{columns:{id:!0}}}});(0,c.tablesOverlap)(T.map(e=>({x:e.x,y:e.y,columnCount:e.columns.length})))&&await (0,c.relayoutTables)(t);let C=await t.select({x:s.endpoint.x,y:s.endpoint.y}).from(s.endpoint);(0,d.endpointsOverlap)(C)&&await (0,d.relayoutEndpoints)(t);let R=await h(t);return{tables:n.tables.length,relations:n.relations.length,endpoints:n.endpoints.length,version:R}}e.s(["bumpVersion",0,h,"getVersion",0,m,"ingestSnapshot",0,y,"snapshotSchema",0,f]),n()}catch(e){n(e)}},!1),39449,e=>e.a(async(t,n)=>{try{var a=e.i(6659),r=e.i(91426),i=e.i(14859),o=t([a,r]);async function l(e){let t=new TextEncoder,n=!1,r=(0,i.workspaceIdFromRequest)(e),o=new ReadableStream({async start(e){let o=-1;e.enqueue(t.encode("retry: 2000\n\n"));let l=async()=>{if(!n){try{let n=await (0,i.runWithWorkspace)(r,()=>(0,a.getVersion)());n!==o&&(o=n,e.enqueue(t.encode(`data: ${n}
+
+`)))}catch{}n||setTimeout(l,1e3)}};l()},cancel(){n=!0}});return new Response(o,{headers:{"Content-Type":"text/event-stream","Cache-Control":"no-cache, no-transform",Connection:"keep-alive"}})}[a,r]=o.then?(await o)():o,e.s(["GET",0,l,"dynamic",0,"force-dynamic"]),n()}catch(e){n(e)}},!1),99203,e=>e.a(async(t,n)=>{try{var a=e.i(47909),r=e.i(74017),i=e.i(96250),o=e.i(59756),l=e.i(61916),s=e.i(74677),d=e.i(69741),u=e.i(16795),c=e.i(87718),p=e.i(95169),m=e.i(47587),h=e.i(66012),y=e.i(70101),f=e.i(26937),b=e.i(10372),g=e.i(93695);e.i(20232);var w=e.i(220),x=e.i(39449),v=t([x]);[x]=v.then?(await v)():v;let C=new a.AppRouteRouteModule({definition:{kind:r.RouteKind.APP_ROUTE,page:"/api/stream/route",pathname:"/api/stream",filename:"route",bundlePath:""},distDir:".next",relativeProjectDir:"",resolvedPagePath:"[project]/app/api/stream/route.ts",nextConfigOutput:"",userland:x,...{}}),{workAsyncStorage:R,workUnitAsyncStorage:E,serverHooks:q}=C;async function T(e,t,n){n.requestMeta&&(0,o.setRequestMeta)(e,n.requestMeta),C.isDev&&(0,o.addRequestMeta)(e,"devRequestTimingInternalsEnd",process.hrtime.bigint());let a="/api/stream/route";a=a.replace(/\/index$/,"")||"/";let i=await C.prepare(e,t,{srcPage:a,multiZoneDraftMode:!1});if(!i)return t.statusCode=400,t.end("Bad Request"),null==n.waitUntil||n.waitUntil.call(n,Promise.resolve()),null;let{buildId:x,deploymentId:v,params:T,nextConfig:R,parsedUrl:E,isDraftMode:q,prerenderManifest:I,routerServerContext:N,isOnDemandRevalidate:O,revalidateOnlyGenerated:S,resolvedPathname:P,clientReferenceManifest:M,serverActionsManifest:A}=i,k=(0,d.normalizeAppPath)(a),z=!!(I.dynamicRoutes[k]||I.routes[P]),$=async()=>((null==N?void 0:N.render404)?await N.render404(e,t,E,!1):t.end("This page could not be found"),null);if(z&&!q){let e=!!I.routes[P],t=I.dynamicRoutes[k];if(t&&!1===t.fallback&&!e){if(R.adapterPath)return await $();throw new g.NoFallbackError}}let _=null;!z||C.isDev||q||(_=P,_="/index"===_?"/":_);let j=!0===C.isDev||!z,U=z&&!j;A&&M&&(0,s.setManifestsSingleton)({page:a,clientReferenceManifest:M,serverActionsManifest:A});let D=e.method||"GET",F=(0,l.getTracer)(),H=F.getActiveScopeSpan(),W=!!(null==N?void 0:N.isWrappedByNextServer),B=!!(0,o.getRequestMeta)(e,"minimalMode"),K=(0,o.getRequestMeta)(e,"incrementalCache")||await C.getIncrementalCache(e,R,I,B);null==K||K.resetRequestCache(),globalThis.__incrementalCache=K;let V={params:T,previewProps:I.preview,renderOpts:{experimental:{authInterrupts:!!R.experimental.authInterrupts},cacheComponents:!!R.cacheComponents,supportsDynamicResponse:j,incrementalCache:K,cacheLifeProfiles:R.cacheLife,waitUntil:n.waitUntil,onClose:e=>{t.on("close",e)},onAfterTaskError:void 0,onInstrumentationRequestError:(t,n,a,r)=>C.onRequestError(e,t,a,r,N)},sharedContext:{buildId:x,deploymentId:v}},L=new u.NodeNextRequest(e),G=new u.NodeNextResponse(t),X=c.NextRequestAdapter.fromNodeNextRequest(L,(0,c.signalFromNodeResponse)(t));try{let i,o=async e=>C.handle(X,V).finally(()=>{if(!e)return;e.setAttributes({"http.status_code":t.statusCode,"next.rsc":!1});let n=F.getRootSpanAttributes();if(!n)return;if(n.get("next.span_type")!==p.BaseServerSpan.handleRequest)return void console.warn(`Unexpected root span type '${n.get("next.span_type")}'. Please report this Next.js issue https://github.com/vercel/next.js`);let r=n.get("next.route");if(r){let t=`${D} ${r}`;e.setAttributes({"next.route":r,"http.route":r,"next.span_name":t}),e.updateName(t),i&&i!==e&&(i.setAttribute("http.route",r),i.updateName(t))}else e.updateName(`${D} ${a}`)}),s=async i=>{var l,s;let d=async({previousCacheEntry:r})=>{try{if(!B&&O&&S&&!r)return t.statusCode=404,t.setHeader("x-nextjs-cache","REVALIDATED"),t.end("This page could not be found"),null;let a=await o(i);e.fetchMetrics=V.renderOpts.fetchMetrics;let l=V.renderOpts.pendingWaitUntil;l&&n.waitUntil&&(n.waitUntil(l),l=void 0);let s=V.renderOpts.collectedTags;if(!z)return await (0,h.sendResponse)(L,G,a,V.renderOpts.pendingWaitUntil),null;{let e=await a.blob(),t=(0,y.toNodeOutgoingHttpHeaders)(a.headers);s&&(t[b.NEXT_CACHE_TAGS_HEADER]=s),!t["content-type"]&&e.type&&(t["content-type"]=e.type);let n=void 0!==V.renderOpts.collectedRevalidate&&!(V.renderOpts.collectedRevalidate>=b.INFINITE_CACHE)&&V.renderOpts.collectedRevalidate,r=void 0===V.renderOpts.collectedExpire||V.renderOpts.collectedExpire>=b.INFINITE_CACHE?void 0:V.renderOpts.collectedExpire;return{value:{kind:w.CachedRouteKind.APP_ROUTE,status:a.status,body:Buffer.from(await e.arrayBuffer()),headers:t},cacheControl:{revalidate:n,expire:r}}}}catch(t){throw(null==r?void 0:r.isStale)&&await C.onRequestError(e,t,{routerKind:"App Router",routePath:a,routeType:"route",revalidateReason:(0,m.getRevalidateReason)({isStaticGeneration:U,isOnDemandRevalidate:O})},!1,N),t}},u=await C.handleResponse({req:e,nextConfig:R,cacheKey:_,routeKind:r.RouteKind.APP_ROUTE,isFallback:!1,prerenderManifest:I,isRoutePPREnabled:!1,isOnDemandRevalidate:O,revalidateOnlyGenerated:S,responseGenerator:d,waitUntil:n.waitUntil,isMinimalMode:B});if(!z)return null;if((null==u||null==(l=u.value)?void 0:l.kind)!==w.CachedRouteKind.APP_ROUTE)throw Object.defineProperty(Error(`Invariant: app-route received invalid cache entry ${null==u||null==(s=u.value)?void 0:s.kind}`),"__NEXT_ERROR_CODE",{value:"E701",enumerable:!1,configurable:!0});B||t.setHeader("x-nextjs-cache",O?"REVALIDATED":u.isMiss?"MISS":u.isStale?"STALE":"HIT"),q&&t.setHeader("Cache-Control","private, no-cache, no-store, max-age=0, must-revalidate");let c=(0,y.fromNodeOutgoingHttpHeaders)(u.value.headers);return B&&z||c.delete(b.NEXT_CACHE_TAGS_HEADER),!u.cacheControl||t.getHeader("Cache-Control")||c.get("Cache-Control")||c.set("Cache-Control",(0,f.getCacheControlHeader)(u.cacheControl)),await (0,h.sendResponse)(L,G,new Response(u.value.body,{headers:c,status:u.value.status||200})),null};W&&H?await s(H):(i=F.getActiveScopeSpan(),await F.withPropagatedContext(e.headers,()=>F.trace(p.BaseServerSpan.handleRequest,{spanName:`${D} ${a}`,kind:l.SpanKind.SERVER,attributes:{"http.method":D,"http.target":e.url}},s),void 0,!W))}catch(t){if(t instanceof g.NoFallbackError||await C.onRequestError(e,t,{routerKind:"App Router",routePath:k,routeType:"route",revalidateReason:(0,m.getRevalidateReason)({isStaticGeneration:U,isOnDemandRevalidate:O})},!1,N),z)throw t;return await (0,h.sendResponse)(L,G,new Response(null,{status:500})),null}}e.s(["handler",0,T,"patchFetch",0,function(){return(0,i.patchFetch)({workAsyncStorage:R,workUnitAsyncStorage:E})},"routeModule",0,C,"serverHooks",0,q,"workAsyncStorage",0,R,"workUnitAsyncStorage",0,E]),n()}catch(e){n(e)}},!1),58502,e=>{e.v(t=>Promise.all(["server/chunks/[root-of-the-server]__1t2egm-._.js"].map(t=>e.l(t))).then(()=>t(51514)))}];
+
+//# sourceMappingURL=%5Broot-of-the-server%5D__1j25n4-._.js.map

package/.next/server/chunks/[root-of-the-server]__1j25n4-._.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../node_modules/src/sql/functions/aggregate.ts","../../../lib/endpoint-layout.ts","../../../lib/endpoint-reconcile.ts","../../../lib/table-layout.ts","../../../lib/ingest.ts","../../../app/api/stream/route.ts","../../../node_modules/next/src/build/templates/app-route.ts"],"sourcesContent":["import { type AnyColumn, Column } from '~/column.ts';\nimport { is } from '~/entity.ts';\nimport { type SQL, sql, type SQLWrapper } from '../sql.ts';\n\n/**\n * Returns the number of values in `expression`.\n *\n * ## Examples\n *\n * ```ts\n * // Number employees with null values\n * db.select({ value: count() }).from(employees)\n * // Number of employees where `name` is not null\n * db.select({ value: count(employees.name) }).from(employees)\n * ```\n *\n * @see countDistinct to get the number of non-duplicate values in `expression`\n */\nexport function count(expression?: SQLWrapper): SQL<number> {\n\treturn sql`count(${expression || sql.raw('*')})`.mapWith(Number);\n}\n\n/**\n * Returns the number of non-duplicate values in `expression`.\n *\n * ## Examples\n *\n * ```ts\n * // Number of employees where `name` is distinct\n * db.select({ value: countDistinct(employees.name) }).from(employees)\n * ```\n *\n * @see count to get the number of values in `expression`, including duplicates\n */\nexport function countDistinct(expression: SQLWrapper): SQL<number> {\n\treturn sql`count(distinct ${expression})`.mapWith(Number);\n}\n\n/**\n * Returns the average (arithmetic mean) of all non-null values in `expression`.\n *\n * ## Examples\n *\n * ```ts\n * // Average salary of an employee\n * db.select({ value: avg(employees.salary) }).from(employees)\n * ```\n *\n * @see avgDistinct to get the average of all non-null and non-duplicate values in `expression`\n */\nexport function avg(expression: SQLWrapper): SQL<string | null> {\n\treturn sql`avg(${expression})`.mapWith(String);\n}\n\n/**\n * Returns the average (arithmetic mean) of all non-null and non-duplicate values in `expression`.\n *\n * ## Examples\n *\n * ```ts\n * // Average salary of an employee where `salary` is distinct\n * db.select({ value: avgDistinct(employees.salary) }).from(employees)\n * ```\n *\n * @see avg to get the average of all non-null values in `expression`, including duplicates\n */\nexport function avgDistinct(expression: SQLWrapper): SQL<string | null> {\n\treturn sql`avg(distinct ${expression})`.mapWith(String);\n}\n\n/**\n * Returns the sum of all non-null values in `expression`.\n *\n * ## Examples\n *\n * ```ts\n * // Sum of every employee's salary\n * db.select({ value: sum(employees.salary) }).from(employees)\n * ```\n *\n * @see sumDistinct to get the sum of all non-null and non-duplicate values in `expression`\n */\nexport function sum(expression: SQLWrapper): SQL<string | null> {\n\treturn sql`sum(${expression})`.mapWith(String);\n}\n\n/**\n * Returns the sum of all non-null and non-duplicate values in `expression`.\n *\n * ## Examples\n *\n * ```ts\n * // Sum of every employee's salary where `salary` is distinct (no duplicates)\n * db.select({ value: sumDistinct(employees.salary) }).from(employees)\n * ```\n *\n * @see sum to get the sum of all non-null values in `expression`, including duplicates\n */\nexport function sumDistinct(expression: SQLWrapper): SQL<string | null> {\n\treturn sql`sum(distinct ${expression})`.mapWith(String);\n}\n\n/**\n * Returns the maximum value in `expression`.\n *\n * ## Examples\n *\n * ```ts\n * // The employee with the highest salary\n * db.select({ value: max(employees.salary) }).from(employees)\n * ```\n */\nexport function max<T extends SQLWrapper>(expression: T): SQL<(T extends AnyColumn ? T['_']['data'] : string) | null> {\n\treturn sql`max(${expression})`.mapWith(is(expression, Column) ? expression : String) as any;\n}\n\n/**\n * Returns the minimum value in `expression`.\n *\n * ## Examples\n *\n * ```ts\n * // The employee with the lowest salary\n * db.select({ value: min(employees.salary) }).from(employees)\n * ```\n */\nexport function min<T extends SQLWrapper>(expression: T): SQL<(T extends AnyColumn ? T['_']['data'] : string) | null> {\n\treturn sql`min(${expression})`.mapWith(is(expression, Column) ? expression : String) as any;\n}\n","import { count, eq } from \"drizzle-orm\";\nimport { db, type DB } from \"@/lib/db-drizzle\";\nimport { endpoint } from \"@/lib/drizzle/schema\";\n\n// Endpoints are uniform 240px-wide pill cards on /db, kept to the left of the table\n// gutter (negative x). The previous layout stacked every endpoint in one column at\n// y = i * 110, so a real backend like Beacon ended up with a 4000px-tall stack the\n// user had to scroll past. We now wrap into a multi-column grid that grows leftward,\n// so the canvas reads as a compact block instead of a fence.\n\nconst EP_ROW_HEIGHT = 60;\nconst EP_COL_WIDTH = 280;\nconst EP_BASE_X = -300; // closest column to the tables on the right\nconst EP_ROWS_PER_COL = 12;\nconst EP_CARD_WIDTH = 240;\nconst EP_CARD_HEIGHT = 50;\n\n/**\n * Bounding-box overlap check ingest uses to decide whether to self-heal the column.\n * Endpoint cards are uniform 240px wide × ~40px tall pills — anything overlapping\n * means an old single-column ingest left a stack behind, or two ingest runs collided.\n */\nexport function endpointsOverlap(\n  eps: ReadonlyArray<{ x: number; y: number }>,\n): boolean {\n  for (let i = 0; i < eps.length; i++) {\n    for (let j = i + 1; j < eps.length; j++) {\n      const a = eps[i];\n      const b = eps[j];\n      if (\n        a.x < b.x + EP_CARD_WIDTH &&\n        a.x + EP_CARD_WIDTH > b.x &&\n        a.y < b.y + EP_CARD_HEIGHT &&\n        a.y + EP_CARD_HEIGHT > b.y\n      ) {\n        return true;\n      }\n    }\n  }\n  return false;\n}\n\nexport function gridPositionForEndpoint(index: number): { x: number; y: number } {\n  const col = Math.floor(index / EP_ROWS_PER_COL);\n  const row = index % EP_ROWS_PER_COL;\n  return { x: EP_BASE_X - col * EP_COL_WIDTH, y: row * EP_ROW_HEIGHT };\n}\n\n/**\n * One-off repair: re-pack every endpoint into a clean grid. Stable order — sorts by\n * current (y, x) so the user's visual ordering carries over across the change, then by\n * id as a tiebreaker.\n */\nexport async function relayoutEndpoints(prisma: DB = db): Promise<number> {\n  const eps = await prisma.query.endpoint.findMany({\n    orderBy: (t, { asc, desc }) => [asc(t.y), desc(t.x), asc(t.id)],\n  });\n  if (eps.length === 0) return 0;\n  let moved = 0;\n  for (let i = 0; i < eps.length; i++) {\n    const { x, y } = gridPositionForEndpoint(i);\n    const e = eps[i];\n    if (e.x === x && e.y === y) continue;\n    await prisma.update(endpoint).set({ x, y }).where(eq(endpoint.id, e.id));\n    moved++;\n  }\n  return moved;\n}\n\n/**\n * Where to drop the next NEW endpoint so it lands in the first unfilled grid slot.\n * Used by ingest to keep code-derived endpoints from re-stacking the old single column.\n */\nexport async function nextEndpointSlot(prisma: DB = db): Promise<{ x: number; y: number }> {\n  const [{ n }] = await prisma.select({ n: count() }).from(endpoint);\n  return gridPositionForEndpoint(n);\n}\n\n/**\n * Where to drop a freshly-proposed draft on the /db canvas so it doesn't land on top of\n * the existing tables/endpoints. Returns the largest y in use plus a margin, or 0 if the\n * canvas is empty.\n */\nconst DRAFT_MARGIN = 280;\nexport async function computeDraftOriginY(prisma: DB = db): Promise<number> {\n  const [topTbl, topEp] = await Promise.all([\n    prisma.query.dbTable.findFirst({ orderBy: (t, { desc }) => desc(t.y) }),\n    prisma.query.endpoint.findFirst({ orderBy: (t, { desc }) => desc(t.y) }),\n  ]);\n  const maxY = Math.max(topTbl?.y ?? 0, topEp?.y ?? 0);\n  return maxY > 0 ? maxY + DRAFT_MARGIN : 0;\n}\n","import { eq } from \"drizzle-orm\";\nimport { db, type DB } from \"@/lib/db-drizzle\";\nimport { endpoint } from \"@/lib/drizzle/schema\";\n\n// Plans and code rarely share a path prefix: a feature designed as `/orgs` ships at\n// `/api/v1/orgs`. We collapse a planned (MANUAL) endpoint into its code-derived\n// (INTROSPECTION) twin when the verbs match and the code path ends with the planned path\n// on a segment boundary, ignoring path-param names.\n\nconst normalize = (path: string) => path.replace(/\\{[^}]*\\}/g, \"{}\");\n\nexport function isImplementedBy(\n  planned: { method: string; path: string },\n  code: { method: string; path: string },\n): boolean {\n  if (planned.method.toUpperCase() !== code.method.toUpperCase()) return false;\n  const p = normalize(planned.path);\n  const c = normalize(code.path);\n  // planned paths start with \"/\", so endsWith() already lands on a segment boundary.\n  return c === p || c.endsWith(p);\n}\n\nexport interface ReconcileReport {\n  collapsed: number;\n  mappings: { planned: string; code: string }[];\n}\n\n/**\n * Deletes planned endpoints (anything not code-derived — drafts approved as MANUAL, init/\n * session scaffolds) once they have an INTROSPECTION twin, so the canvas shows reality\n * instead of duplicates. Unbuilt plans are left intact. Returns what was collapsed (also\n * surfaces the planned→code path discrepancy to the caller).\n */\nexport async function reconcilePlannedEndpoints(prisma: DB = db): Promise<ReconcileReport> {\n  const [planned, code] = await Promise.all([\n    prisma.query.endpoint.findMany({ where: (t, { ne }) => ne(t.source, \"INTROSPECTION\") }),\n    prisma.query.endpoint.findMany({ where: (t, { eq }) => eq(t.source, \"INTROSPECTION\") }),\n  ]);\n\n  const report: ReconcileReport = { collapsed: 0, mappings: [] };\n  for (const m of planned) {\n    const twin = code.find((c) => isImplementedBy(m, c));\n    if (!twin) continue;\n    await prisma.delete(endpoint).where(eq(endpoint.id, m.id));\n    report.collapsed++;\n    report.mappings.push({ planned: `${m.method} ${m.path}`, code: `${twin.method} ${twin.path}` });\n  }\n  return report;\n}\n","import { eq } from \"drizzle-orm\";\nimport { db, type DB } from \"@/lib/db-drizzle\";\nimport { dbTable } from \"@/lib/drizzle/schema\";\n\n// Layout constants for /db. Tables are 232px wide cards whose height is dominated by\n// their column count; the previous fixed grid (`y = floor(i/4) * 260`) silently stacked\n// tall tables on top of their neighbours. We pack into four columns masonry-style: each\n// column tracks its cumulative bottom and the next table goes into whichever column has\n// the most room. Same shape ingest seeds use, same shape `relayoutTables` uses to repair.\n\nexport const TABLE_COL_WIDTH = 320;\nexport const TABLE_COL_COUNT = 4;\nexport const TABLE_GAP_PX = 50;\nconst TABLE_HEADER_PX = 36;\nconst TABLE_ROW_PX = 30;\nconst TABLE_PADDING_PX = 16;\n\nexport function estimateTableHeight(columnCount: number): number {\n  return TABLE_HEADER_PX + Math.max(0, columnCount) * TABLE_ROW_PX + TABLE_PADDING_PX;\n}\n\nexport interface NewTable {\n  key: string;\n  columnCount: number;\n}\nexport interface PlacedTable {\n  x: number;\n  y: number;\n  columnCount: number;\n}\n\n/**\n * Assigns (x, y) to each `newTables` entry using a masonry pack across `TABLE_COL_COUNT`\n * columns, treating `existing` as already-occupied slots so we never land on top of a\n * persisted table. Returns a Map keyed by the entry's `key` (id or name — caller's choice).\n */\nexport function packTablesMasonry(\n  newTables: NewTable[],\n  existing: PlacedTable[] = [],\n): Map<string, { x: number; y: number }> {\n  const bottoms = new Array<number>(TABLE_COL_COUNT).fill(0);\n  for (const e of existing) {\n    const col = Math.max(\n      0,\n      Math.min(TABLE_COL_COUNT - 1, Math.round(e.x / TABLE_COL_WIDTH)),\n    );\n    const bottom = e.y + estimateTableHeight(e.columnCount) + TABLE_GAP_PX;\n    if (bottom > bottoms[col]) bottoms[col] = bottom;\n  }\n  const out = new Map<string, { x: number; y: number }>();\n  for (const t of newTables) {\n    let col = 0;\n    for (let i = 1; i < TABLE_COL_COUNT; i++) if (bottoms[i] < bottoms[col]) col = i;\n    const x = col * TABLE_COL_WIDTH;\n    const y = bottoms[col];\n    out.set(t.key, { x, y });\n    bottoms[col] = y + estimateTableHeight(t.columnCount) + TABLE_GAP_PX;\n  }\n  return out;\n}\n\n/**\n * Bounding-box overlap check used by ingest to decide whether to self-heal the layout.\n * Card width is `TABLE_COL_WIDTH - 20` (the visible card sits inside its column slot).\n */\nexport function tablesOverlap(\n  placed: ReadonlyArray<{ x: number; y: number; columnCount: number }>,\n): boolean {\n  const w = TABLE_COL_WIDTH - 20;\n  for (let i = 0; i < placed.length; i++) {\n    for (let j = i + 1; j < placed.length; j++) {\n      const a = placed[i];\n      const b = placed[j];\n      const ah = estimateTableHeight(a.columnCount);\n      const bh = estimateTableHeight(b.columnCount);\n      if (a.x < b.x + w && a.x + w > b.x && a.y < b.y + bh && a.y + ah > b.y) {\n        return true;\n      }\n    }\n  }\n  return false;\n}\n\n/**\n * Self-heal for the /db canvas: re-packs all INTROSPECTION tables into a masonry\n * layout sized to each table's actual column count. Called automatically by ingest\n * when the post-upsert positions still overlap (a stale layout from before the\n * masonry formula, or a hand-placement that drifted into a neighbour). Manual\n * (non-introspection) tables keep their positions — they're drafts the user is\n * composing or hand-placed. Ordering by name keeps the result stable across re-syncs.\n */\nexport async function relayoutTables(prisma: DB = db): Promise<number> {\n  const tables = await prisma.query.dbTable.findMany({\n    where: (t, { eq }) => eq(t.source, \"INTROSPECTION\"),\n    with: { columns: { columns: { id: true } } },\n    orderBy: (t, { asc }) => asc(t.name),\n  });\n  if (tables.length === 0) return 0;\n  const positions = packTablesMasonry(\n    tables.map((t) => ({ key: t.id, columnCount: t.columns.length })),\n  );\n  let moved = 0;\n  for (const t of tables) {\n    const p = positions.get(t.id);\n    if (!p) continue;\n    if (Math.round(p.x) === Math.round(t.x) && Math.round(p.y) === Math.round(t.y)) continue;\n    await prisma.update(dbTable).set({ x: p.x, y: p.y }).where(eq(dbTable.id, t.id));\n    moved++;\n  }\n  return moved;\n}\n","import { z } from \"zod\";\nimport { and, count, eq, inArray, notInArray, or, sql } from \"drizzle-orm\";\nimport { db, type DB } from \"@/lib/db-drizzle\";\nimport { dbTable, dbColumn, dbRelation, endpoint, endpointTable, syncState } from \"@/lib/drizzle/schema\";\nimport {\n  endpointsOverlap,\n  gridPositionForEndpoint,\n  relayoutEndpoints,\n} from \"@/lib/endpoint-layout\";\nimport { reconcilePlannedEndpoints } from \"@/lib/endpoint-reconcile\";\nimport { packTablesMasonry, relayoutTables, tablesOverlap } from \"@/lib/table-layout\";\n\n// ── Snapshot contract (what the intel daemon POSTs) ─────────────────────────\n\nexport const snapshotSchema = z.object({\n  tables: z\n    .array(\n      z.object({\n        name: z.string().trim().min(1),\n        domain: z.string().nullish(),\n        description: z.string().nullish(),\n        columns: z\n          .array(\n            z.object({\n              name: z.string().trim().min(1),\n              type: z.string().trim().min(1),\n              isPk: z.boolean().optional(),\n              isFk: z.boolean().optional(),\n              nullable: z.boolean().optional(),\n              note: z.string().nullish(),\n            }),\n          )\n          .default([]),\n      }),\n    )\n    .default([]),\n  relations: z\n    .array(\n      z.object({\n        fromTable: z.string(),\n        fromColumn: z.string(),\n        toTable: z.string(),\n        toColumn: z.string(),\n        label: z.string().nullish(),\n      }),\n    )\n    .default([]),\n  endpoints: z\n    .array(\n      z.object({\n        method: z.string().trim().min(1),\n        path: z.string().trim().min(1),\n        domain: z.string().nullish(),\n        description: z.string().nullish(),\n        uses: z\n          .array(\n            z.object({\n              table: z.string(),\n              access: z.string().default(\"read\"),\n            }),\n          )\n          .default([]),\n      }),\n    )\n    .default([]),\n});\nexport type Snapshot = z.input<typeof snapshotSchema>;\n\ntype Prisma = DB;\n\nexport async function getVersion(prisma: Prisma = db): Promise<number> {\n  const s = await prisma.query.syncState.findFirst({ where: (t, { eq }) => eq(t.id, \"singleton\") });\n  return s?.version ?? 0;\n}\n\nexport async function bumpVersion(prisma: Prisma = db): Promise<number> {\n  const [s] = await prisma\n    .insert(syncState)\n    .values({ id: \"singleton\", version: 1 })\n    .onConflictDoUpdate({\n      target: syncState.id,\n      set: { version: sql`${syncState.version} + 1` },\n    })\n    .returning();\n  return s.version;\n}\n\n/**\n * Upserts a code-derived snapshot. Full-replace of `source=INTROSPECTION`\n * entities: upsert by stable key (name / method+path) preserving manual x/y,\n * delete introspected entities absent from the snapshot. Manual entities and\n * the roadmap are never touched. Bumps the sync version.\n */\nexport async function ingestSnapshot(input: unknown, prisma: Prisma = db) {\n  const snap = snapshotSchema.parse(input);\n\n  // tables ----------------------------------------------------------------\n  const keepTables = snap.tables.map((t) => t.name);\n  await prisma\n    .delete(dbTable)\n    .where(\n      keepTables.length\n        ? and(eq(dbTable.source, \"INTROSPECTION\"), notInArray(dbTable.name, keepTables))\n        : eq(dbTable.source, \"INTROSPECTION\"),\n    );\n\n  // Position NEW tables with a masonry pack sized to each table's column count, anchored\n  // against whatever tables are already on the canvas. The old `(i%4)*320, floor(i/4)*260`\n  // grid silently stacked tall tables (Node, DbColumn) on top of their neighbours.\n  const allExisting = await prisma.query.dbTable.findMany({\n    columns: { name: true, x: true, y: true },\n    with: { columns: { columns: { id: true } } },\n  });\n  const existingByName = new Map(allExisting.map((t) => [t.name, t]));\n  const newTablePositions = packTablesMasonry(\n    snap.tables\n      .filter((t) => !existingByName.has(t.name))\n      .map((t) => ({ key: t.name, columnCount: t.columns.length })),\n    allExisting.map((t) => ({ x: t.x, y: t.y, columnCount: t.columns.length })),\n  );\n\n  const tableIdByName = new Map<string, string>();\n  for (const t of snap.tables) {\n    const existing = existingByName.get(t.name);\n    const pos = newTablePositions.get(t.name);\n    const x = existing?.x ?? pos?.x ?? 0;\n    const y = existing?.y ?? pos?.y ?? 0;\n    const [saved] = await prisma\n      .insert(dbTable)\n      .values({\n        name: t.name,\n        domain: t.domain ?? null,\n        description: t.description ?? null,\n        source: \"INTROSPECTION\",\n        x,\n        y,\n      })\n      .onConflictDoUpdate({\n        target: dbTable.name,\n        set: {\n          domain: t.domain ?? null,\n          description: t.description ?? null,\n          source: \"INTROSPECTION\",\n        },\n      })\n      .returning();\n    tableIdByName.set(t.name, saved.id);\n    await prisma.delete(dbColumn).where(eq(dbColumn.tableId, saved.id));\n    if (t.columns.length) {\n      await prisma.insert(dbColumn).values(\n        t.columns.map((c, i) => ({\n          tableId: saved.id,\n          name: c.name,\n          type: c.type,\n          isPk: c.isPk ?? false,\n          isFk: c.isFk ?? false,\n          nullable: c.nullable ?? true,\n          note: c.note ?? null,\n          ord: i,\n        })),\n      );\n    }\n  }\n\n  // relations (rebuild those touching an introspected table) ---------------\n  const introTableIds = [...tableIdByName.values()];\n  if (introTableIds.length) {\n    await prisma\n      .delete(dbRelation)\n      .where(\n        or(\n          inArray(dbRelation.fromTableId, introTableIds),\n          inArray(dbRelation.toTableId, introTableIds),\n        ),\n      );\n  }\n  for (const r of snap.relations) {\n    const fromId = tableIdByName.get(r.fromTable);\n    const toId = tableIdByName.get(r.toTable);\n    if (!fromId || !toId) continue;\n    await prisma.insert(dbRelation).values({\n      fromTableId: fromId,\n      toTableId: toId,\n      fromColumn: r.fromColumn,\n      toColumn: r.toColumn,\n      label: r.label ?? `${r.fromColumn} → ${r.toTable}.${r.toColumn}`,\n    });\n  }\n\n  // endpoints --------------------------------------------------------------\n  const keepEp = new Set(snap.endpoints.map((e) => `${e.method} ${e.path}`));\n  const introEps = await prisma.query.endpoint.findMany({\n    where: (t, { eq }) => eq(t.source, \"INTROSPECTION\"),\n  });\n  const stale = introEps.filter((e) => !keepEp.has(`${e.method} ${e.path}`)).map((e) => e.id);\n  if (stale.length) await prisma.delete(endpoint).where(inArray(endpoint.id, stale));\n\n  // For NEW endpoints we drop into the next free slot of the multi-column grid (the\n  // single-column stack made a real backend's endpoints into a 4000px-tall fence).\n  let nextSlotIndex = (await prisma.select({ n: count() }).from(endpoint))[0].n;\n  for (const e of snap.endpoints) {\n    const existing = await prisma.query.endpoint.findFirst({\n      where: (t, { and, eq }) => and(eq(t.method, e.method), eq(t.path, e.path)),\n    });\n    let x: number, y: number;\n    if (existing) {\n      x = existing.x;\n      y = existing.y;\n    } else {\n      const slot = gridPositionForEndpoint(nextSlotIndex);\n      x = slot.x;\n      y = slot.y;\n      nextSlotIndex++;\n    }\n    const [saved] = await prisma\n      .insert(endpoint)\n      .values({\n        method: e.method,\n        path: e.path,\n        domain: e.domain ?? null,\n        description: e.description ?? null,\n        source: \"INTROSPECTION\",\n        x,\n        y,\n      })\n      .onConflictDoUpdate({\n        target: [endpoint.method, endpoint.path],\n        set: {\n          domain: e.domain ?? null,\n          description: e.description ?? null,\n          source: \"INTROSPECTION\",\n        },\n      })\n      .returning();\n    await prisma.delete(endpointTable).where(eq(endpointTable.endpointId, saved.id));\n    for (const u of e.uses) {\n      const tid =\n        tableIdByName.get(u.table) ??\n        (\n          await prisma.query.dbTable.findFirst({ where: (t, { eq }) => eq(t.name, u.table) })\n        )?.id;\n      if (!tid) continue;\n      await prisma.insert(endpointTable).values({\n        endpointId: saved.id,\n        tableId: tid,\n        access: u.access,\n      });\n    }\n  }\n\n  // Collapse planned endpoints that this scan just proved are implemented in code.\n  await reconcilePlannedEndpoints(prisma);\n\n  // Self-heal layout: if any pair of tables or endpoints overlaps after the upserts\n  // (a stale layout from before the masonry/grid formulas, or a hand-placement that\n  // drifted into a neighbour), repack them. Drag-and-drop positions that don't\n  // collide are preserved — the heal only fires when the canvas is actually broken.\n  const placedTables = await prisma.query.dbTable.findMany({\n    where: (t, { eq }) => eq(t.source, \"INTROSPECTION\"),\n    columns: { x: true, y: true },\n    with: { columns: { columns: { id: true } } },\n  });\n  if (\n    tablesOverlap(\n      placedTables.map((t) => ({ x: t.x, y: t.y, columnCount: t.columns.length })),\n    )\n  ) {\n    await relayoutTables(prisma);\n  }\n  const placedEps = await prisma.select({ x: endpoint.x, y: endpoint.y }).from(endpoint);\n  if (endpointsOverlap(placedEps)) await relayoutEndpoints(prisma);\n\n  const version = await bumpVersion(prisma);\n  return {\n    tables: snap.tables.length,\n    relations: snap.relations.length,\n    endpoints: snap.endpoints.length,\n    version,\n  };\n}\n","import { getVersion } from \"@/lib/ingest\";\nimport { runWithWorkspace } from \"@/lib/db-drizzle\";\nimport { workspaceIdFromRequest } from \"@/lib/workspaces\";\n\nexport const dynamic = \"force-dynamic\";\n\n// Server-Sent Events: emits the sync version whenever it changes (server-side\n// poll feeding a client push). The client refreshes the open map on change.\nexport async function GET(req: Request) {\n  const encoder = new TextEncoder();\n  let closed = false;\n  // Pin every poll to THIS client's workspace (browser cookie / agent header) so the stream\n  // tracks the open canvas's repo, not the global active one. Captured here and re-applied\n  // per tick — the setTimeout loop outlives the request's async context.\n  const wsId = workspaceIdFromRequest(req);\n\n  const stream = new ReadableStream({\n    async start(controller) {\n      let last = -1;\n      controller.enqueue(encoder.encode(\"retry: 2000\\n\\n\"));\n      const tick = async () => {\n        if (closed) return;\n        try {\n          const v = await runWithWorkspace(wsId, () => getVersion());\n          if (v !== last) {\n            last = v;\n            controller.enqueue(encoder.encode(`data: ${v}\\n\\n`));\n          }\n        } catch {\n          // ignore transient DB errors; keep the stream alive\n        }\n        if (!closed) setTimeout(tick, 1000);\n      };\n      void tick();\n    },\n    cancel() {\n      closed = true;\n    },\n  });\n\n  return new Response(stream, {\n    headers: {\n      \"Content-Type\": \"text/event-stream\",\n      \"Cache-Control\": \"no-cache, no-transform\",\n      Connection: \"keep-alive\",\n    },\n  });\n}\n","import {\n  AppRouteRouteModule,\n  type AppRouteRouteHandlerContext,\n  type AppRouteRouteModuleOptions,\n  type AppRouteUserlandModule,\n} from '../../server/route-modules/app-route/module.compiled'\nimport { RouteKind } from '../../server/route-kind'\nimport { patchFetch as _patchFetch } from '../../server/lib/patch-fetch'\nimport type { IncomingMessage, ServerResponse } from 'node:http'\nimport {\n  addRequestMeta,\n  getRequestMeta,\n  setRequestMeta,\n  type RequestMeta,\n} from '../../server/request-meta'\nimport { getTracer, type Span, SpanKind } from '../../server/lib/trace/tracer'\nimport { setManifestsSingleton } from '../../server/app-render/manifests-singleton'\nimport { normalizeAppPath } from '../../shared/lib/router/utils/app-paths'\nimport { NodeNextRequest, NodeNextResponse } from '../../server/base-http/node'\nimport {\n  NextRequestAdapter,\n  signalFromNodeResponse,\n} from '../../server/web/spec-extension/adapters/next-request'\nimport { BaseServerSpan } from '../../server/lib/trace/constants'\nimport { getRevalidateReason } from '../../server/instrumentation/utils'\nimport { sendResponse } from '../../server/send-response'\nimport {\n  fromNodeOutgoingHttpHeaders,\n  toNodeOutgoingHttpHeaders,\n} from '../../server/web/utils'\nimport { getCacheControlHeader } from '../../server/lib/cache-control'\nimport { INFINITE_CACHE, NEXT_CACHE_TAGS_HEADER } from '../../lib/constants'\nimport { NoFallbackError } from '../../shared/lib/no-fallback-error.external'\nimport {\n  CachedRouteKind,\n  type ResponseCacheEntry,\n  type ResponseGenerator,\n} from '../../server/response-cache'\nimport * as userland from 'VAR_USERLAND'\n\n// These are injected by the loader afterwards. This is injected as a variable\n// instead of a replacement because this could also be `undefined` instead of\n// an empty string.\ndeclare const nextConfigOutput: AppRouteRouteModuleOptions['nextConfigOutput']\n\n// We inject the nextConfigOutput here so that we can use them in the route\n// module.\n// INJECT:nextConfigOutput\n\nconst routeModule = new AppRouteRouteModule({\n  definition: {\n    kind: RouteKind.APP_ROUTE,\n    page: 'VAR_DEFINITION_PAGE',\n    pathname: 'VAR_DEFINITION_PATHNAME',\n    filename: 'VAR_DEFINITION_FILENAME',\n    bundlePath: 'VAR_DEFINITION_BUNDLE_PATH',\n  },\n  distDir: process.env.__NEXT_RELATIVE_DIST_DIR || '',\n  relativeProjectDir: process.env.__NEXT_RELATIVE_PROJECT_DIR || '',\n  resolvedPagePath: 'VAR_RESOLVED_PAGE_PATH',\n  nextConfigOutput,\n  // The static import is used for initialization (methods, dynamic, etc.).\n  userland: userland as AppRouteUserlandModule,\n  // In Turbopack dev mode, also provide a getter that calls require() on every\n  // request. This re-reads from devModuleCache so HMR updates are picked up,\n  // and the async wrapper unwraps async-module Promises (ESM-only\n  // serverExternalPackages) automatically.\n  ...(process.env.TURBOPACK && process.env.__NEXT_DEV_SERVER\n    ? {\n        getUserland: () => import('VAR_USERLAND'),\n      }\n    : {}),\n})\n\n// Pull out the exports that we need to expose from the module. This should\n// be eliminated when we've moved the other routes to the new format. These\n// are used to hook into the route.\nconst { workAsyncStorage, workUnitAsyncStorage, serverHooks } = routeModule\n\nfunction patchFetch() {\n  return _patchFetch({\n    workAsyncStorage,\n    workUnitAsyncStorage,\n  })\n}\n\nexport {\n  routeModule,\n  workAsyncStorage,\n  workUnitAsyncStorage,\n  serverHooks,\n  patchFetch,\n}\n\nexport async function handler(\n  req: IncomingMessage,\n  res: ServerResponse,\n  ctx: {\n    waitUntil?: (prom: Promise<void>) => void\n    requestMeta?: RequestMeta\n  }\n) {\n  if (ctx.requestMeta) {\n    setRequestMeta(req, ctx.requestMeta)\n  }\n  if (routeModule.isDev) {\n    addRequestMeta(req, 'devRequestTimingInternalsEnd', process.hrtime.bigint())\n  }\n  let srcPage = 'VAR_DEFINITION_PAGE'\n\n  // turbopack doesn't normalize `/index` in the page name\n  // so we need to to process dynamic routes properly\n  // TODO: fix turbopack providing differing value from webpack\n  if (process.env.TURBOPACK) {\n    srcPage = srcPage.replace(/\\/index$/, '') || '/'\n  } else if (srcPage === '/index') {\n    // we always normalize /index specifically\n    srcPage = '/'\n  }\n  const multiZoneDraftMode = process.env\n    .__NEXT_MULTI_ZONE_DRAFT_MODE as any as boolean\n\n  const prepareResult = await routeModule.prepare(req, res, {\n    srcPage,\n    multiZoneDraftMode,\n  })\n\n  if (!prepareResult) {\n    res.statusCode = 400\n    res.end('Bad Request')\n    ctx.waitUntil?.(Promise.resolve())\n    return null\n  }\n\n  const {\n    buildId,\n    deploymentId,\n    params,\n    nextConfig,\n    parsedUrl,\n    isDraftMode,\n    prerenderManifest,\n    routerServerContext,\n    isOnDemandRevalidate,\n    revalidateOnlyGenerated,\n    resolvedPathname,\n    clientReferenceManifest,\n    serverActionsManifest,\n  } = prepareResult\n\n  const normalizedSrcPage = normalizeAppPath(srcPage)\n\n  let isIsr = Boolean(\n    prerenderManifest.dynamicRoutes[normalizedSrcPage] ||\n      prerenderManifest.routes[resolvedPathname]\n  )\n\n  const render404 = async () => {\n    // TODO: should route-module itself handle rendering the 404\n    if (routerServerContext?.render404) {\n      await routerServerContext.render404(req, res, parsedUrl, false)\n    } else {\n      res.end('This page could not be found')\n    }\n    return null\n  }\n\n  if (isIsr && !isDraftMode) {\n    const isPrerendered = Boolean(prerenderManifest.routes[resolvedPathname])\n    const prerenderInfo = prerenderManifest.dynamicRoutes[normalizedSrcPage]\n\n    if (prerenderInfo) {\n      if (prerenderInfo.fallback === false && !isPrerendered) {\n        if (nextConfig.adapterPath) {\n          return await render404()\n        }\n        throw new NoFallbackError()\n      }\n    }\n  }\n\n  let cacheKey: string | null = null\n\n  if (isIsr && !routeModule.isDev && !isDraftMode) {\n    cacheKey = resolvedPathname\n    // ensure /index and / is normalized to one key\n    cacheKey = cacheKey === '/index' ? '/' : cacheKey\n  }\n\n  const supportsDynamicResponse: boolean =\n    // If we're in development, we always support dynamic HTML\n    routeModule.isDev === true ||\n    // If this is not SSG or does not have static paths, then it supports\n    // dynamic HTML.\n    !isIsr\n\n  // This is a revalidation request if the request is for a static\n  // page and it is not being resumed from a postponed render and\n  // it is not a dynamic RSC request then it is a revalidation\n  // request.\n  const isStaticGeneration = isIsr && !supportsDynamicResponse\n\n  // Before rendering (which initializes component tree modules), we have to\n  // set the reference manifests to our global store so Server Action's\n  // encryption util can access to them at the top level of the page module.\n  if (serverActionsManifest && clientReferenceManifest) {\n    setManifestsSingleton({\n      page: srcPage,\n      clientReferenceManifest,\n      serverActionsManifest,\n    })\n  }\n\n  const method = req.method || 'GET'\n  const tracer = getTracer()\n  const activeSpan = tracer.getActiveScopeSpan()\n  const isWrappedByNextServer = Boolean(\n    routerServerContext?.isWrappedByNextServer\n  )\n  const isMinimalMode = Boolean(getRequestMeta(req, 'minimalMode'))\n\n  const incrementalCache =\n    getRequestMeta(req, 'incrementalCache') ||\n    (await routeModule.getIncrementalCache(\n      req,\n      nextConfig,\n      prerenderManifest,\n      isMinimalMode\n    ))\n\n  incrementalCache?.resetRequestCache()\n  ;(globalThis as any).__incrementalCache = incrementalCache\n\n  const context: AppRouteRouteHandlerContext = {\n    params,\n    previewProps: prerenderManifest.preview,\n    renderOpts: {\n      experimental: {\n        authInterrupts: Boolean(nextConfig.experimental.authInterrupts),\n      },\n      cacheComponents: Boolean(nextConfig.cacheComponents),\n      supportsDynamicResponse,\n      incrementalCache,\n      cacheLifeProfiles: nextConfig.cacheLife,\n      waitUntil: ctx.waitUntil,\n      onClose: (cb) => {\n        res.on('close', cb)\n      },\n      onAfterTaskError: undefined,\n      onInstrumentationRequestError: (\n        error,\n        _request,\n        errorContext,\n        silenceLog\n      ) =>\n        routeModule.onRequestError(\n          req,\n          error,\n          errorContext,\n          silenceLog,\n          routerServerContext\n        ),\n    },\n    sharedContext: {\n      buildId,\n      deploymentId,\n    },\n  }\n  const nodeNextReq = new NodeNextRequest(req)\n  const nodeNextRes = new NodeNextResponse(res)\n\n  const nextReq = NextRequestAdapter.fromNodeNextRequest(\n    nodeNextReq,\n    signalFromNodeResponse(res)\n  )\n\n  try {\n    let parentSpan: Span | undefined\n    const invokeRouteModule = async (span?: Span) => {\n      return routeModule.handle(nextReq, context).finally(() => {\n        if (!span) return\n\n        span.setAttributes({\n          'http.status_code': res.statusCode,\n          'next.rsc': false,\n        })\n\n        const rootSpanAttributes = tracer.getRootSpanAttributes()\n        // We were unable to get attributes, probably OTEL is not enabled\n        if (!rootSpanAttributes) {\n          return\n        }\n\n        if (\n          rootSpanAttributes.get('next.span_type') !==\n          BaseServerSpan.handleRequest\n        ) {\n          console.warn(\n            `Unexpected root span type '${rootSpanAttributes.get(\n              'next.span_type'\n            )}'. Please report this Next.js issue https://github.com/vercel/next.js`\n          )\n          return\n        }\n\n        const route = rootSpanAttributes.get('next.route')\n        if (route) {\n          const name = `${method} ${route}`\n\n          span.setAttributes({\n            'next.route': route,\n            'http.route': route,\n            'next.span_name': name,\n          })\n          span.updateName(name)\n\n          // Propagate http.route to the parent span if one exists (e.g.\n          // a platform-created HTTP span in adapter deployments).\n          if (parentSpan && parentSpan !== span) {\n            parentSpan.setAttribute('http.route', route)\n            parentSpan.updateName(name)\n          }\n        } else {\n          span.updateName(`${method} ${srcPage}`)\n        }\n      })\n    }\n\n    const handleResponse = async (currentSpan?: Span) => {\n      const responseGenerator: ResponseGenerator = async ({\n        previousCacheEntry,\n      }) => {\n        try {\n          if (\n            !isMinimalMode &&\n            isOnDemandRevalidate &&\n            revalidateOnlyGenerated &&\n            !previousCacheEntry\n          ) {\n            res.statusCode = 404\n            // on-demand revalidate always sets this header\n            res.setHeader('x-nextjs-cache', 'REVALIDATED')\n            res.end('This page could not be found')\n            return null\n          }\n\n          const response = await invokeRouteModule(currentSpan)\n\n          ;(req as any).fetchMetrics = (context.renderOpts as any).fetchMetrics\n          let pendingWaitUntil = context.renderOpts.pendingWaitUntil\n\n          // Attempt using provided waitUntil if available\n          // if it's not we fallback to sendResponse's handling\n          if (pendingWaitUntil) {\n            if (ctx.waitUntil) {\n              ctx.waitUntil(pendingWaitUntil)\n              pendingWaitUntil = undefined\n            }\n          }\n          const cacheTags = context.renderOpts.collectedTags\n\n          // If the request is for a static response, we can cache it so long\n          // as it's not edge.\n          if (isIsr) {\n            const blob = await response.blob()\n\n            // Copy the headers from the response.\n            const headers = toNodeOutgoingHttpHeaders(response.headers)\n\n            if (cacheTags) {\n              headers[NEXT_CACHE_TAGS_HEADER] = cacheTags\n            }\n\n            if (!headers['content-type'] && blob.type) {\n              headers['content-type'] = blob.type\n            }\n\n            const revalidate =\n              typeof context.renderOpts.collectedRevalidate === 'undefined' ||\n              context.renderOpts.collectedRevalidate >= INFINITE_CACHE\n                ? false\n                : context.renderOpts.collectedRevalidate\n\n            const expire =\n              typeof context.renderOpts.collectedExpire === 'undefined' ||\n              context.renderOpts.collectedExpire >= INFINITE_CACHE\n                ? undefined\n                : context.renderOpts.collectedExpire\n\n            // Create the cache entry for the response.\n            const cacheEntry: ResponseCacheEntry = {\n              value: {\n                kind: CachedRouteKind.APP_ROUTE,\n                status: response.status,\n                body: Buffer.from(await blob.arrayBuffer()),\n                headers,\n              },\n              cacheControl: { revalidate, expire },\n            }\n\n            return cacheEntry\n          } else {\n            // send response without caching if not ISR\n            await sendResponse(\n              nodeNextReq,\n              nodeNextRes,\n              response,\n              context.renderOpts.pendingWaitUntil\n            )\n            return null\n          }\n        } catch (err) {\n          // if this is a background revalidate we need to report\n          // the request error here as it won't be bubbled\n          if (previousCacheEntry?.isStale) {\n            const silenceLog = false\n            await routeModule.onRequestError(\n              req,\n              err,\n              {\n                routerKind: 'App Router',\n                routePath: srcPage,\n                routeType: 'route',\n                revalidateReason: getRevalidateReason({\n                  isStaticGeneration,\n                  isOnDemandRevalidate,\n                }),\n              },\n              silenceLog,\n              routerServerContext\n            )\n          }\n          throw err\n        }\n      }\n\n      const cacheEntry = await routeModule.handleResponse({\n        req,\n        nextConfig,\n        cacheKey,\n        routeKind: RouteKind.APP_ROUTE,\n        isFallback: false,\n        prerenderManifest,\n        isRoutePPREnabled: false,\n        isOnDemandRevalidate,\n        revalidateOnlyGenerated,\n        responseGenerator,\n        waitUntil: ctx.waitUntil,\n        isMinimalMode,\n      })\n\n      // we don't create a cacheEntry for ISR\n      if (!isIsr) {\n        return null\n      }\n\n      if (cacheEntry?.value?.kind !== CachedRouteKind.APP_ROUTE) {\n        throw new Error(\n          `Invariant: app-route received invalid cache entry ${cacheEntry?.value?.kind}`\n        )\n      }\n\n      if (!isMinimalMode) {\n        res.setHeader(\n          'x-nextjs-cache',\n          isOnDemandRevalidate\n            ? 'REVALIDATED'\n            : cacheEntry.isMiss\n              ? 'MISS'\n              : cacheEntry.isStale\n                ? 'STALE'\n                : 'HIT'\n        )\n      }\n\n      // Draft mode should never be cached\n      if (isDraftMode) {\n        res.setHeader(\n          'Cache-Control',\n          'private, no-cache, no-store, max-age=0, must-revalidate'\n        )\n      }\n\n      const headers = fromNodeOutgoingHttpHeaders(cacheEntry.value.headers)\n\n      if (!(isMinimalMode && isIsr)) {\n        headers.delete(NEXT_CACHE_TAGS_HEADER)\n      }\n\n      // If cache control is already set on the response we don't\n      // override it to allow users to customize it via next.config\n      if (\n        cacheEntry.cacheControl &&\n        !res.getHeader('Cache-Control') &&\n        !headers.get('Cache-Control')\n      ) {\n        headers.set(\n          'Cache-Control',\n          getCacheControlHeader(cacheEntry.cacheControl)\n        )\n      }\n\n      await sendResponse(\n        nodeNextReq,\n        nodeNextRes,\n        // @ts-expect-error - Argument of type 'Buffer<ArrayBufferLike>' is not assignable to parameter of type 'BodyInit | null | undefined'.\n        new Response(cacheEntry.value.body, {\n          headers,\n          status: cacheEntry.value.status || 200,\n        })\n      )\n      return null\n    }\n\n    // TODO: activeSpan code path is for when wrapped by\n    // next-server can be removed when this is no longer used\n    if (isWrappedByNextServer && activeSpan) {\n      await handleResponse(activeSpan)\n    } else {\n      parentSpan = tracer.getActiveScopeSpan()\n      await tracer.withPropagatedContext(\n        req.headers,\n        () =>\n          tracer.trace(\n            BaseServerSpan.handleRequest,\n            {\n              spanName: `${method} ${srcPage}`,\n              kind: SpanKind.SERVER,\n              attributes: {\n                'http.method': method,\n                'http.target': req.url,\n              },\n            },\n            handleResponse\n          ),\n        undefined,\n        !isWrappedByNextServer\n      )\n    }\n  } catch (err) {\n    if (!(err instanceof NoFallbackError)) {\n      const silenceLog = false\n      await routeModule.onRequestError(\n        req,\n        err,\n        {\n          routerKind: 'App Router',\n          routePath: normalizedSrcPage,\n          routeType: 'route',\n          revalidateReason: getRevalidateReason({\n            isStaticGeneration,\n            isOnDemandRevalidate,\n          }),\n        },\n        silenceLog,\n        routerServerContext\n      )\n    }\n\n    // rethrow so that we can handle serving error page\n\n    // If this is during static generation, throw the error again.\n    if (isIsr) throw err\n\n    // Otherwise, send a 500 response.\n    await sendResponse(\n      nodeNextReq,\n      nodeNextRes,\n      new Response(null, { status: 500 })\n    )\n    return null\n  }\n}\n"],"names":["EP_ROW_HEIGHT","EP_COL_WIDTH","EP_BASE_X","EP_ROWS_PER_COL","EP_CARD_WIDTH","EP_CARD_HEIGHT","endpointsOverlap","eps","i","length","j","a","b","x","y","gridPositionForEndpoint","index","col","Math","floor","row","relayoutEndpoints","prisma","query","endpoint","findMany","orderBy","t","asc","desc","id","moved","e","update","set","where","nextEndpointSlot","n","select","from","DRAFT_MARGIN","computeDraftOriginY","topTbl","topEp","Promise","all","dbTable","findFirst","maxY","max","normalize","path","replace","isImplementedBy","planned","code","method","toUpperCase","p","c","endsWith","reconcilePlannedEndpoints","ne","source","eq","report","collapsed","mappings","m","twin","find","delete","push","TABLE_COL_WIDTH","TABLE_COL_COUNT","TABLE_GAP_PX","TABLE_HEADER_PX","TABLE_ROW_PX","TABLE_PADDING_PX","estimateTableHeight","columnCount","packTablesMasonry","newTables","existing","bottoms","Array","fill","min","round","bottom","out","Map","key","tablesOverlap","placed","w","ah","bh","relayoutTables","tables","with","columns","name","positions","map","get","snapshotSchema","object","array","string","trim","domain","nullish","description","type","isPk","boolean","optional","isFk","nullable","note","default","relations","fromTable","fromColumn","toTable","toColumn","label","endpoints","uses","table","access","getVersion","s","syncState","version","bumpVersion","insert","values","onConflictDoUpdate","target","returning","ingestSnapshot","input","snap","parse","keepTables","allExisting","existingByName","newTablePositions","filter","has","tableIdByName","pos","saved","tableId","ord","introTableIds","fromTableId","toTableId","r","fromId","toId","keepEp","Set","introEps","stale","nextSlotIndex","and","slot","endpointId","u","tid","placedTables","placedEps","dynamic","GET","req","encoder","TextEncoder","closed","wsId","stream","ReadableStream","start","controller","last","enqueue","encode","tick","v","setTimeout","cancel","Response","headers","Connection","AppRouteRouteModule","RouteKind","patchFetch","_patchFetch","addRequestMeta","getRequestMeta","setRequestMeta","getTracer","SpanKind","setManifestsSingleton","normalizeAppPath","NodeNextRequest","NodeNextResponse","NextRequestAdapter","signalFromNodeResponse","BaseServerSpan","getRevalidateReason","sendResponse","fromNodeOutgoingHttpHeaders","toNodeOutgoingHttpHeaders","getCacheControlHeader","INFINITE_CACHE","NEXT_CACHE_TAGS_HEADER","NoFallbackError","CachedRouteKind","userland","routeModule","definition","kind","APP_ROUTE","page","pathname","filename","bundlePath","distDir","process","env","__NEXT_RELATIVE_DIST_DIR","relativeProjectDir","__NEXT_RELATIVE_PROJECT_DIR","resolvedPagePath","nextConfigOutput","TURBOPACK","__NEXT_DEV_SERVER","getUserland","workAsyncStorage","workUnitAsyncStorage","serverHooks","handler","res","ctx","requestMeta","isDev","hrtime","bigint","srcPage","multiZoneDraftMode","__NEXT_MULTI_ZONE_DRAFT_MODE","prepareResult","prepare","statusCode","end","waitUntil","resolve","buildId","deploymentId","params","nextConfig","parsedUrl","isDraftMode","prerenderManifest","routerServerContext","isOnDemandRevalidate","revalidateOnlyGenerated","resolvedPathname","clientReferenceManifest","serverActionsManifest","normalizedSrcPage","isIsr","Boolean","dynamicRoutes","routes","render404","isPrerendered","prerenderInfo","fallback","adapterPath","cacheKey","supportsDynamicResponse","isStaticGeneration","tracer","activeSpan","getActiveScopeSpan","isWrappedByNextServer","isMinimalMode","incrementalCache","getIncrementalCache","resetRequestCache","globalThis","__incrementalCache","context","previewProps","preview","renderOpts","experimental","authInterrupts","cacheComponents","cacheLifeProfiles","cacheLife","onClose","cb","on","onAfterTaskError","undefined","onInstrumentationRequestError","error","_request","errorContext","silenceLog","onRequestError","sharedContext","nodeNextReq","nodeNextRes","nextReq","fromNodeNextRequest","parentSpan","invokeRouteModule","span","handle","finally","setAttributes","rootSpanAttributes","getRootSpanAttributes","handleRequest","console","warn","route","updateName","setAttribute","handleResponse","currentSpan","cacheEntry","responseGenerator","previousCacheEntry","setHeader","response","fetchMetrics","pendingWaitUntil","cacheTags","collectedTags","blob","revalidate","collectedRevalidate","expire","collectedExpire","value","status","body","Buffer","arrayBuffer","cacheControl","err","isStale","routerKind","routePath","routeType","revalidateReason","routeKind","isFallback","isRoutePPREnabled","Error","isMiss","getHeader","withPropagatedContext","trace","spanName","SERVER","attributes","url"],"mappings":"g0BAAA,IAAA,EAAuC,EAAA,CAAA,AAAd,CAAc,OACvC,EAAmB,EAAA,CAAV,AAAU,CAAA,AADoB,OAEvC,EADmB,AAC4B,EAAA,CAA5B,AAA4B,CAAA,UAAA,UAgDxC,SAAS,AAAI,CAAA,EAA4C,AAC/D,OAAO,EAAA,GAAA,CAAA,IAAA,EAAU,EAAU,CAAA,CAAA,CAAI,KAAJ,EAAI,CAAQ,MAAM,CAC9C,kBAcO,SAAS,AAAY,CAAA,EAA4C,AACvE,OAAO,EAAA,GAAA,CAAA,aAAA,EAAmB,EAAU,CAAA,CAAA,CAAI,KAAJ,EAAI,CAAQ,MAAM,CACvD,YAlDO,SAAS,AAAM,CAAA,EAAsC,AAC3D,OAAO,EAAA,GAAA,CAAA,MAAA,EAAY,GAAc,EAAA,GAAA,CAAI,GAAA,CAAI,GAAG,CAAC,CAAA,CAAA,CAAA,CAAI,OAAA,CAAQ,MAAM,CAChE,oBAcO,SAAuB,AAAd,CAAc,EAAqC,AAClE,OAAO,EAAA,GAAA,CAAA,eAAA,EAAqB,EAAU,CAAA,CAAA,CAAI,KAAJ,EAAI,CAAQ,MAAM,CACzD,UA4EO,SAAS,AAA0B,CAAA,EAA4E,AACrH,OAAO,EAAA,GAAA,CAAA,IAAA,EAAU,EAAU,CAAA,CAAA,CAAI,KAAJ,EAAI,CAAA,CAAA,EAAQ,EAAA,EAAA,EAAG,EAAY,EAAA,MAAM,EAAI,EAAa,MAAM,CACpF,UAYO,SAAmC,AAA1B,CAA0B,EAA4E,AACrH,OAAO,EAAA,GAAA,CAAA,IAAA,EAAU,EAAU,CAAA,CAAA,CAAI,KAAJ,EAAI,CAAA,CAAA,EAAQ,EAAA,EAAA,EAAG,EAAY,EAAA,MAAM,EAAI,EAAa,MAAM,CACpF,UA9CO,SAAS,AAAI,CAAA,EAA4C,AAC/D,OAAO,EAAA,GAAA,CAAA,IAAA,EAAU,EAAU,CAAA,CAAA,CAAI,KAAJ,EAAI,CAAQ,MAAM,CAC9C,kBAcO,SAAqB,AAAZ,CAAY,EAA4C,AACvE,OAAO,EAAA,GAAA,CAAA,aAAA,EAAmB,EAAU,CAAA,CAAA,CAAI,KAAJ,EAAI,CAAQ,MAAM,CACvD,kCCpGA,IAAA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,gBAwCO,SAASe,EAAwBC,CAAa,EACnD,IAAMC,EAAMC,KAAKC,KAAK,CAACH,EA9BD,IAgCtB,EAF+Bb,IAExB,CAAEU,EAAGX,AAjCI,CAAC,IADE,CACG,GAiCEe,EAAoBH,EAAGM,AADnCJ,EACkBf,GAnCV,CAmCiCD,CAAc,CACrE,AAFsBG,CASf,eAAekB,EAAkBC,EAAa,EAAA,EAAE,EACrD,GA1CkE,CA0C5Df,EAAM,MAAMe,EAAOC,KAAK,CAACC,QAAQ,CAACC,QAAQ,CAAC,CAC/CC,QAAS,CAACC,EAAG,KAAEC,CAAG,MAAEC,CAAI,CAAE,GAAK,CAACD,EAAID,EAAEb,CAAC,EAAGe,EAAKF,EAAEd,CAAC,EAAGe,EAAID,EAAEG,EAAE,EAAE,AACjE,GACA,GAAIvB,AAAe,MAAXE,MAAM,CAAQ,OAAO,EAC7B,IAAIsB,EAAQ,EACZ,IAAK,IAAIvB,EAAI,EAAGA,EAAID,EAAIE,MAAM,CAAED,IAAK,CACnC,GAAM,GAAEK,CAAC,GAAEC,CAAC,CAAE,CAAGC,EAAwBP,GACnCwB,EAAIzB,CAAG,CAACC,EAAE,EACZwB,EAAEnB,CAAC,GAAKA,GAAKmB,EAAElB,CAAC,IAAKA,GAAG,CAC5B,MAAMQ,EAAOW,MAAM,CAAC,EAAA,QAAQ,EAAEC,GAAG,CAAC,GAAErB,IAAGC,CAAE,GAAGqB,KAAK,CAAC,CAAA,EAAA,EAAA,EAAA,AAAE,EAAC,EAAA,QAAQ,CAACL,EAAE,CAAEE,EAAEF,EAAE,GACtEC,IACF,CACA,OAAOA,CACT,CAiBO,eAAeU,EAAoBnB,EAAa,EAAA,EAAE,EACvD,GAAM,CAACoB,EAAQC,EAAM,CAAG,MAAMC,QAAQC,GAAG,CAAC,CACxCvB,EAAOC,KAAK,CAACuB,OAAO,CAACC,SAAS,CAAC,CAAErB,QAAS,CAACC,EAAG,MAAEE,CAAI,CAAE,GAAKA,EAAKF,EAAEb,CAAC,CAAE,GACrEQ,EAAOC,KAAK,CAACC,QAAQ,CAACuB,SAAS,CAAC,CAAErB,QAAS,CAACC,EAAG,MAAEE,CAAI,CAAE,GAAKA,EAAKF,EAAEb,CAAC,CAAE,GACvE,EACKkC,EAAO9B,KAAK+B,GAAG,CAACP,GAAQ5B,GAAK,EAAG6B,GAAO7B,GAAK,GAClD,OAAOkC,EAAO,EAAIA,EAPC,IAOqB,CAC1C,AAD2BR,8EApEpB,SAASlC,AACdC,CAA4C,EAE5C,IAAK,IAAIC,EAAI,EAAGA,EAAID,EAAIE,MAAM,CAAED,IAAK,AACnC,IAAK,IAAIE,EAAIF,EAAI,EAAGE,EAAIH,EAAIE,MAAM,CAAEC,IAAK,CACvC,IAAMC,EAAIJ,CAAG,CAACC,EAAE,CACVI,EAAIL,CAAG,CAACG,EAAE,CAChB,GACEC,EAAEE,CAAC,CAAGD,EAAEC,CAAC,GAAGT,GACZO,EAAEE,CAAC,CAjBW,EAiBRT,EAAgBQ,EAAEC,CAAC,EACzBF,EAAEG,CAAC,CAAGF,EAAEE,CAAC,GAAGT,EACZM,EAAEG,CAAC,CAlBY,EAkBTT,CAAiBO,EAAEE,CAAC,CAE1B,CADA,MACO,CAEX,CAEF,MAAO,EACT,gHCxCA,IAAA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,gBA+BO,eAAe+C,EAA0BvC,EAAa,EAAA,EAAE,EAC7D,GAAM,CAACgC,EAASC,EAAK,CAAG,MAAMX,QAAQC,GAAG,CAAC,CACxCvB,EAAOC,KAAK,CAACC,QAAQ,CAACC,QAAQ,CAAC,CAAEU,MAAO,CAACR,EAAG,CAAEmC,IAAE,CAAE,GAAKA,EAAGnC,EAAEoC,MAAM,CAAE,gBAAiB,GACrFzC,EAAOC,KAAK,CAACC,QAAQ,CAACC,QAAQ,CAAC,CAAEU,MAAO,CAACR,EAAG,IAAEqC,CAAE,CAAE,GAAKA,EAAGrC,EAAEoC,MAAM,CAAE,gBAAiB,GACtF,EAEKE,EAA0B,CAAEC,UAAW,EAAGC,SAAU,EAAE,AAAC,EAC7D,IAAK,IAAMC,KAAKd,EAAS,CACvB,IAAMe,EAAOd,EAAKe,IAAI,CAAC,AAACX,GAAMN,CA9B3B,SAASA,AACdC,CAAyC,CACzCC,CAAsC,EAEtC,GAAID,EAAQE,MAAM,CAACC,WAAW,KAAOF,EAAKC,MAAM,CAACC,WAAW,GAAI,OAAO,EACvE,IAAMC,EAAcJ,EAAVJ,AAAkBC,IAAI,4BAC1BQ,EAR4BR,AAQdI,EAAVL,AAAeC,IAAI,CARUC,OAAO,CAAC,aAAc,MAU7D,OAAOO,IAAMD,GAAKC,EAAEC,QAAQ,CAACF,GAC/B,EAqBkDU,EAAGT,IAC5CU,IACL,EADW,IACL/C,EAAOiD,MAAM,CAAC,EAAA,QAAQ,EAAEpC,KAAK,CAAC,CAAA,EAAA,EAAA,EAAA,AAAE,EAAC,EAAA,QAAQ,CAACL,EAAE,CAAEsC,EAAEtC,EAAE,GACxDmC,EAAOC,SAAS,GAChBD,EAAOE,QAAQ,CAACK,IAAI,CAAC,CAAElB,QAAS,CAAA,EAAGc,EAAEZ,MAAM,CAAC,CAAC,EAAEY,EAAEjB,IAAI,CAAA,CAAE,CAAEI,KAAM,CAAA,EAAGc,EAAKb,MAAM,CAAC,CAAC,EAAEa,EAAKlB,IAAI,CAAA,CAAE,AAAC,GAC/F,CACA,OAAOc,CACT,uHChDA,IAAA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,gBAeO,SAASc,EAAoBC,CAAmB,EACrD,OAAOJ,AALe,GACH,AAIM1D,QAAK+B,GAAG,CAAC,EAAG+B,GAHd,EAIzB,CAiBO,SAlB+CH,AAkBtCI,EACdC,CAAqB,CACrBC,EAA0B,EAAE,EAE5B,IAAMC,CAtB6DN,CAsBnD,IAAIO,EAAcX,CAAiBY,GAAjBZ,CAAqB,CAAC,GACxD,IAAK,IAAM1C,KAAKmD,EAAU,CACxB,IAAMlE,EAAMC,KAAK+B,GAAG,CAClB,EACA/B,KAAKqE,GAAG,CAACb,EAAqBxD,KAAKsE,KAAK,CAACxD,EAAEnB,CAAC,EAAjB,CAAoB4D,KAE3CgB,EAASzD,EAAElB,CAAC,CAAGiE,EAAoB/C,EAAEgD,WAAW,IAAIL,CACtDc,EAASL,CAAO,CAACnE,EAAI,GAAEmE,CAAO,CAACnE,EAAI,CAAGwE,CAAAA,CAC5C,CACA,IAAMC,EAAM,IAAIC,IAChB,IAAK,IAAMhE,KAAKuD,EAAW,CACzB,IAAIjE,EAAM,EACV,IAAK,IAAIT,EAAI,EAAGA,EAzCW,EAyCPkE,AAAiBlE,IAAK,AAAI4E,CAAO,CAAC5E,EAAE,CAAG4E,CAAO,CAACnE,EAAI,GAAEA,GAAMT,EAC/E,IAAMK,EA3CqB,IA2CjBI,EACJH,EAAIsE,CAAO,CADDX,AACExD,EAAI,CACtByE,EAAIxD,GAAG,CAACP,EAAEiE,GAAG,CAAE,GAAE/E,IAAGC,CAAE,GACtBsE,CAAO,CAACnE,EAAI,CAAGH,EAAIiE,EAAoBpD,EAAEqD,WAAW,EA5C5B,EA4CgCL,AAC1D,CACA,OAAOe,CACT,CAgCO,eAAeQ,EAAe5E,EAAa,EAAA,EAAE,EAClD,IAAM6E,EAAS,MAAM7E,EAAOC,KAAK,CAACuB,OAAO,CAACrB,QAAQ,CAAC,CACjDU,MAAO,CAACR,EAAG,IAAEqC,CAAE,CAAE,GAAKA,EAAGrC,EAAEoC,MAAM,CAAE,iBACnCqC,KAAM,CAAEC,QAAS,CAAEA,QAAS,CAAEvE,IAAI,CAAK,CAAE,CAAE,EAC3CJ,QAAS,CAACC,EAAG,KAAEC,CAAG,CAAE,GAAKA,EAAID,EAAE2E,IAAI,CACrC,GACA,GAAsB,IAAlBH,EAAO1F,MAAM,CAAQ,OAAO,EAChC,IAAM8F,EAAYtB,EAChBkB,EAAOK,GAAG,CAAC,AAAC7E,IAAM,AAAC,CAAEiE,IAAKjE,EAAEG,EAAE,CAAEkD,YAAarD,EAAE0E,OAAO,CAAC5F,MAAM,CAAC,CAAC,GAE7DsB,EAAQ,EACZ,IAAK,IAAMJ,KAAKwE,EAAQ,CACtB,IAAMzC,EAAI6C,EAAUE,GAAG,CAAC9E,EAAEG,EAAE,EACvB4B,GAAG,CACJxC,KAAKsE,KAAK,CAAC9B,EAAE7C,CAAC,IAAMK,KAAKsE,KAAK,CAAC7D,EAAEd,CAAC,GAAKK,KAAKsE,KAAK,CAAC9B,EAAE5C,CAAC,IAAMI,KAAKsE,KAAK,CAAC7D,EAAEb,EAAC,GAAG,CAChF,MAAMQ,EAAOW,MAAM,CAAC,EAAA,OAAO,EAAEC,GAAG,CAAC,CAAErB,EAAG6C,EAAE7C,CAAC,CAAEC,EAAG4C,EAAE5C,CAAC,AAAC,GAAGqB,KAAK,CAAC,CAAA,EAAA,EAAA,EAAA,AAAE,EAAC,EAAA,OAAO,CAACL,EAAE,CAAEH,EAAEG,EAAE,GAC9EC,IACF,CACA,OAAOA,CACT,wHA7CO,SAAS8D,AACdC,CAAoE,EAGpE,IAAK,IAAItF,EAAI,EAAGA,EAAIsF,EAAOrF,MAAM,CAAED,IAAK,AACtC,IAAK,IAAIE,EAAIF,EAAI,EAAGE,EAAIoF,EAAOrF,MAAM,CAAEC,IAAK,CAC1C,IAAMC,EAAImF,CAAM,CAACtF,EAAE,CACbI,EAAIkF,CAAM,CAACpF,EAAE,CACbsF,EAAKjB,EAAoBpE,EAAEqE,WAAW,EACtCiB,EAAKlB,EAAoBnE,EAAEoE,WAAW,EAC5C,GAAIrE,EAAEE,CAAC,CAAGD,EAAEC,CAAC,GAAGkF,GAAKpF,EAAEE,CAAC,CAPlB4D,EAOqBsB,EAAInF,EAAEC,CAAC,EAAIF,EAAEG,CAAC,CAAGF,EAAEE,CAAC,CAAGmF,CAP1B,EAOgCtF,EAAEG,CAAC,CAAGkF,EAAKpF,EAAEE,CAAC,CACpE,CADsE,MAC/D,CAEX,CAEF,OAAO,CACT,yDCjFA,IAAA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,OAAA,EAAA,EAAA,CAAA,CAAA,OAAA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,MAKA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,qDAIO,IAAM4F,EAAiB,EAAA,CAAC,CAACC,MAAM,CAAC,CACrCR,OAAQ,EAAA,CAAC,CACNS,KAAK,CACJ,EAAA,CAAC,CAACD,MAAM,CAAC,CACPL,KAAM,EAAA,CAAC,CAACO,MAAM,GAAGC,IAAI,GAAGvB,GAAG,CAAC,GAC5BwB,OAAQ,EAAA,CAAC,CAACF,MAAM,GAAGG,OAAO,GAC1BC,YAAa,EAAA,CAAC,CAACJ,MAAM,GAAGG,OAAO,GAC/BX,QAAS,EAAA,CAAC,CACPO,KAAK,CACJ,EAAA,CAAC,CAACD,MAAM,CAAC,CACPL,KAAM,EAAA,CAAC,CAACO,MAAM,GAAGC,IAAI,GAAGvB,GAAG,CAAC,GAC5B2B,KAAM,EAAA,CAAC,CAACL,MAAM,GAAGC,IAAI,GAAGvB,GAAG,CAAC,GAC5B4B,KAAM,EAAA,CAAC,CAACC,OAAO,GAAGC,QAAQ,GAC1BC,KAAM,EAAA,CAAC,CAACF,OAAO,GAAGC,QAAQ,GAC1BE,SAAU,EAAA,CAAC,CAACH,OAAO,GAAGC,QAAQ,GAC9BG,KAAM,EAAA,CAAC,CAACX,MAAM,GAAGG,OAAO,EAC1B,IAEDS,OAAO,CAAC,EAAE,CACf,IAEDA,OAAO,CAAC,EAAE,EACbC,UAAW,EAAA,CAAC,CACTd,KAAK,CACJ,EAAA,CAAC,CAACD,MAAM,CAAC,CACPgB,UAAW,EAAA,CAAC,CAACd,MAAM,GACnBe,WAAY,EAAA,CAAC,CAACf,MAAM,GACpBgB,QAAS,EAAA,CAAC,CAAChB,MAAM,GACjBiB,SAAU,EAAA,CAAC,CAACjB,MAAM,GAClBkB,MAAO,EAAA,CAAC,CAAClB,MAAM,GAAGG,OAAO,EAC3B,IAEDS,OAAO,CAAC,EAAE,EACbO,UAAW,EAAA,CAAC,CACTpB,KAAK,CACJ,EAAA,CAAC,CAACD,MAAM,CAAC,CACPnD,OAAQ,EAAA,CAAC,CAACqD,MAAM,GAAGC,IAAI,GAAGvB,GAAG,CAAC,GAC9BpC,KAAM,EAAA,CAAC,CAAC0D,MAAM,GAAGC,IAAI,GAAGvB,GAAG,CAAC,GAC5BwB,OAAQ,EAAA,CAAC,CAACF,MAAM,GAAGG,OAAO,GAC1BC,YAAa,EAAA,CAAC,CAACJ,MAAM,GAAGG,OAAO,GAC/BiB,KAAM,EAAA,CAAC,CACJrB,KAAK,CACJ,EAAA,CAAC,CAACD,MAAM,CAAC,CACPuB,MAAO,EAAA,CAAC,CAACrB,MAAM,GACfsB,OAAQ,EAAA,CAAC,CAACtB,MAAM,GAAGY,OAAO,CAAC,OAC7B,IAEDA,OAAO,CAAC,EAAE,CACf,IAEDA,OAAO,CAAC,EAAE,CACf,GAKO,eAAeW,EAAW9G,EAAiB,EAAA,EAAE,EAClD,IAAM+G,EAAI,MAAM/G,EAAOC,KAAK,CAAC+G,SAAS,CAACvF,SAAS,CAAC,CAAEZ,MAAO,CAACR,EAAG,IAAEqC,CAAE,CAAE,GAAKA,EAAGrC,EAAEG,EAAE,CAAE,YAAa,GAC/F,OAAOuG,GAAGE,SAAW,CACvB,CAEO,eAAeC,EAAYlH,EAAiB,EAAA,EAAE,EACnD,GAAM,CAAC+G,EAAE,CAAG,MAAM/G,EACfmH,MAAM,CAAC,EAAA,SAAS,EAChBC,MAAM,CAAC,CAAE5G,GAAI,YAAayG,QAAS,CAAE,GACrCI,kBAAkB,CAAC,CAClBC,OAAQ,EAAA,SAAS,CAAC9G,EAAE,CACpBI,IAAK,CAAEqG,QAAS,EAAA,GAAG,CAAC,EAAE,EAAA,SAAS,CAACA,OAAO,CAAC,IAAI,CAAC,AAAC,CAChD,GACCM,SAAS,GACZ,OAAOR,EAAEE,OAAO,AAClB,CAQO,eAAeO,EAAeC,CAAc,CAAEzH,EAAiB,EAAA,EAAE,EACtE,IAAM0H,EAAOtC,EAAeuC,KAAK,CAACF,GAG5BG,EAAaF,EAAK7C,MAAM,CAACK,GAAG,CAAC,AAAC7E,GAAMA,EAAE2E,IAAI,CAChD,OAAMhF,EACHiD,MAAM,CAAC,EAAA,OAAO,EACdpC,KAAK,CACJ+G,EAAWzI,MAAM,CACb,CAAA,EAAA,EAAA,GAAA,AAAG,EAAC,CAAA,EAAA,EAAA,EAAA,AAAE,EAAC,EAAA,OAAO,CAACsD,MAAM,CAAE,iBAAkB,CAAA,EAAA,EAAA,UAAA,AAAU,EAAC,EAAA,OAAO,CAACuC,IAAI,CAAE4C,IAClE,CAAA,EAAA,EAAA,EAAA,AAAE,EAAC,EAAA,OAAO,CAACnF,MAAM,CAAE,kBAM3B,IAAMoF,EAAc,MAAM7H,EAAOC,KAAK,CAACuB,OAAO,CAACrB,QAAQ,CAAC,CACtD4E,QAAS,CAAEC,MAAM,EAAMzF,GAAG,EAAMC,GAAG,CAAK,EACxCsF,KAAM,CAAEC,QAAS,CAAEA,QAAS,CAAEvE,IAAI,CAAK,CAAE,CAAE,CAC7C,GACMsH,EAAiB,IAAIzD,IAAIwD,EAAY3C,GAAG,CAAC,AAAC7E,GAAM,CAACA,EAAE2E,IAAI,CAAE3E,EAAE,GAC3D0H,EAAoB,CAAA,EAAA,EAAA,iBAAA,AAAiB,EACzCL,EAAK7C,MAAM,CACRmD,MAAM,CAAC,AAAC3H,GAAM,CAACyH,EAAeG,GAAG,CAAC5H,EAAE2E,IAAI,GACxCE,GAAG,CAAC,AAAC7E,IAAM,AAAC,CAAEiE,IAAKjE,EAAE2E,IAAI,CAAEtB,YAAarD,EAAE0E,OAAO,CAAC5F,MAAM,CAAC,CAAC,EAC7D0I,EAAY3C,GAAG,CAAC,AAAC7E,IAAM,AAAC,CAAEd,EAAGc,EAAEd,CAAC,CAAEC,EAAGa,EAAEb,CAAC,CAAEkE,YAAarD,EAAE0E,OAAO,CAAC5F,MAAM,CAAC,CAAC,GAGrE+I,EAAgB,IAAI7D,IAC1B,IAAK,IAAMhE,KAAKqH,EAAK7C,MAAM,CAAE,CAC3B,IAAMhB,EAAWiE,EAAe3C,GAAG,CAAC9E,EAAE2E,IAAI,EACpCmD,EAAMJ,EAAkB5C,GAAG,CAAC9E,EAAE2E,IAAI,EAClCzF,EAAIsE,GAAUtE,GAAK4I,GAAK5I,GAAK,EAC7BC,EAAIqE,GAAUrE,GAAK2I,GAAK3I,GAAK,EAC7B,CAAC4I,EAAM,CAAG,MAAMpI,EACnBmH,MAAM,CAAC,EAAA,OAAO,EACdC,MAAM,CAAC,CACNpC,KAAM3E,EAAE2E,IAAI,CACZS,OAAQpF,EAAEoF,MAAM,EAAI,KACpBE,YAAatF,EAAEsF,WAAW,EAAI,KAC9BlD,OAAQ,kBACRlD,IACAC,CACF,GACC6H,kBAAkB,CAAC,CAClBC,OAAQ,EAAA,OAAO,CAACtC,IAAI,CACpBpE,IAAK,CACH6E,OAAQpF,EAAEoF,MAAM,EAAI,KACpBE,YAAatF,EAAEsF,WAAW,EAAI,KAC9BlD,OAAQ,eACV,CACF,GACC8E,SAAS,GACZW,EAActH,GAAG,CAACP,EAAE2E,IAAI,CAAEoD,EAAM5H,EAAE,EAClC,MAAMR,EAAOiD,MAAM,CAAC,EAAA,QAAQ,EAAEpC,KAAK,CAAC,CAAA,EAAA,EAAA,EAAA,AAAE,EAAC,EAAA,QAAQ,CAACwH,OAAO,CAAED,EAAM5H,EAAE,GAC7DH,EAAE0E,OAAO,CAAC5F,MAAM,EAAE,AACpB,MAAMa,EAAOmH,MAAM,CAAC,EAAA,QAAQ,EAAEC,MAAM,CAClC/G,EAAE0E,OAAO,CAACG,GAAG,CAAC,CAAC7C,EAAGnD,IAAM,CAAC,CACvBmJ,QAASD,EAAM5H,EAAE,CACjBwE,KAAM3C,EAAE2C,IAAI,CACZY,KAAMvD,EAAEuD,IAAI,CACZC,KAAMxD,EAAEwD,IAAI,GAAI,EAChBG,KAAM3D,EAAE2D,IAAI,GAAI,EAChBC,SAAU5D,EAAE4D,QAAQ,GAAI,EACxBC,KAAM7D,EAAE6D,IAAI,EAAI,KAChBoC,IAAKpJ,EACP,CAAC,EAGP,CAGA,IAAMqJ,EAAgB,IAAIL,EAAcd,MAAM,GAAG,CAWjD,IAAK,IAAMsB,KAVPH,EAAcpJ,MAAM,EAAE,AACxB,MAAMa,EACHiD,MAAM,CAAC,EAAA,UAAU,EACjBpC,KAAK,CACJ,CAAA,EAAA,EAAA,EAAA,AAAE,EACA,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,EAAA,UAAU,CAAC2H,WAAW,CAAED,GAChC,CAAA,EAAA,EAAA,OAAO,AAAP,EAAQ,EAAA,UAAU,CAACE,SAAS,CAAEF,KAItBb,EAAKtB,SAAS,EAAE,CAC9B,IAAMuC,EAAST,EAAc/C,GAAG,CAACuD,EAAErC,SAAS,EACtCuC,EAAOV,EAAc/C,GAAG,CAACuD,EAAEnC,OAAO,EACnCoC,GAAWC,GAChB,GADsB,CAAP,EACT5I,EAAOmH,MAAM,CAAC,EAAA,UAAU,EAAEC,MAAM,CAAC,CACrCoB,YAAaG,EACbF,UAAWG,EACXtC,WAAYoC,EAAEpC,UAAU,CACxBE,SAAUkC,EAAElC,QAAQ,CACpBC,MAAOiC,EAAEjC,KAAK,EAAI,CAAA,EAAGiC,EAAEpC,UAAU,CAAC,GAAG,EAAEoC,EAAEnC,OAAO,CAAC,CAAC,EAAEmC,EAAElC,QAAQ,CAAA,CAAE,AAClE,EACF,CAGA,IAAMqC,EAAS,IAAIC,IAAIpB,EAAKhB,SAAS,CAACxB,GAAG,CAAC,AAACxE,GAAM,CAAA,EAAGA,EAAEwB,MAAM,CAAC,CAAC,EAAExB,EAAEmB,IAAI,CAAA,CAAE,GAIlEmH,EAHW,AAGHD,OAHS/I,EAAOC,KAAK,CAACC,QAAQ,CAACC,QAAQ,CAAC,CACpDU,MAAO,CAACR,EAAG,IAAEqC,CAAE,CAAE,GAAKA,EAAGrC,EAAEoC,MAAM,CAAE,gBACrC,EAAA,EACuBuF,MAAM,CAAC,AAACtH,GAAM,CAACmI,EAAOZ,GAAG,CAAC,CAAA,EAAGvH,EAAEwB,MAAM,CAAC,CAAC,EAAExB,EAAEmB,IAAI,CAAA,CAAE,GAAGqD,GAAG,CAAC,AAACxE,GAAMA,EAAEF,EAAE,EACtFwI,EAAM7J,MAAM,EAAE,MAAMa,EAAOiD,MAAM,CAAC,EAAA,QAAQ,EAAEpC,KAAK,CAAC,CAAA,EAAA,EAAA,OAAO,AAAP,EAAQ,EAAA,QAAQ,CAACL,EAAE,CAAEwI,IAI3E,IAAIC,EAAgB,CAAC,MAAMjJ,EAAOgB,MAAM,CAAC,CAAED,EAAG,CAAA,EAAA,EAAA,KAAA,AAAK,GAAG,GAAGE,IAAI,CAAC,EAAA,SAAQ,CAAC,AAAC,CAAC,EAAE,CAACF,CAAC,CAC7E,IAAK,IAAML,KAAKgH,EAAKhB,SAAS,CAAE,CAC9B,IAGInH,EAAWC,EAHTqE,EAAW,MAAM7D,EAAOC,KAAK,CAACC,QAAQ,CAACuB,SAAS,CAAC,CACrDZ,MAAO,CAACR,EAAG,KAAE6I,CAAG,IAAExG,CAAE,CAAE,GAAKwG,EAAIxG,EAAGrC,EAAE6B,MAAM,CAAExB,EAAEwB,MAAM,EAAGQ,EAAGrC,EAAEwB,IAAI,CAAEnB,EAAEmB,IAAI,EAC1E,GAEA,GAAIgC,EACFtE,EAAIsE,EAAStE,CAAC,CACdC,EAFY,AAERqE,EAASrE,CAAC,KACT,CACL,IAAM2J,EAAO,CAAA,EAAA,EAAA,uBAAA,AAAuB,EAACF,GACrC1J,EAAI4J,EAAK5J,CAAC,CACVC,EAAI2J,EAAK3J,CAAC,CACVyJ,GACF,CACA,GAAM,CAACb,EAAM,CAAG,MAAMpI,EACnBmH,MAAM,CAAC,EAAA,QAAQ,EACfC,MAAM,CAAC,CACNlF,OAAQxB,EAAEwB,MAAM,CAChBL,KAAMnB,EAAEmB,IAAI,CACZ4D,OAAQ/E,EAAE+E,MAAM,EAAI,KACpBE,YAAajF,EAAEiF,WAAW,EAAI,KAC9BlD,OAAQ,gBACRlD,MACAC,CACF,GACC6H,kBAAkB,CAAC,CAClBC,OAAQ,CAAC,EAAA,QAAQ,CAACpF,MAAM,CAAE,EAAA,QAAQ,CAACL,IAAI,CAAC,CACxCjB,IAAK,CACH6E,OAAQ/E,EAAE+E,MAAM,EAAI,KACpBE,YAAajF,EAAEiF,WAAW,EAAI,KAC9BlD,OAAQ,eACV,CACF,GACC8E,SAAS,GAEZ,IAAK,IAAM8B,KADX,MAAMrJ,EAAOiD,MAAM,CAAC,EAAA,aAAa,EAAEpC,KAAK,CAAC,CAAA,EAAA,EAAA,EAAA,AAAE,EAAC,EAAA,aAAa,CAACuI,UAAU,CAAEhB,EAAM5H,EAAE,GAC9DE,EAAEiG,IAAI,EAAE,CACtB,IAAM2C,EACJpB,EAAc/C,GAAG,CAACkE,EAAEzC,KAAK,IAEvB,CADF,KACQ5G,EAAOC,KAAK,CAACuB,OAAO,CAACC,SAAS,CAAC,CAAEZ,MAAO,CAACR,EAAG,IAAEqC,CAAE,CAAE,GAAKA,EAAGrC,EAAE2E,IAAI,CAAEqE,EAAEzC,KAAK,CAAE,EAAA,CACnF,EAAGpG,GACA8I,GACL,EADU,IACJtJ,EAAOmH,MAAM,CAAC,EAAA,aAAa,EAAEC,MAAM,CAAC,CACxCgC,WAAYhB,EAAM5H,EAAE,CACpB6H,QAASiB,EACTzC,OAAQwC,EAAExC,MAAM,AAClB,EACF,CACF,CAGA,MAAM,CAAA,EAAA,EAAA,yBAAA,AAAyB,EAAC7G,GAMhC,IAAMuJ,EAAe,MAAMvJ,EAAOC,KAAK,CAACuB,OAAO,CAACrB,QAAQ,CAAC,CACvDU,MAAO,CAACR,EAAG,CAAEqC,IAAE,CAAE,GAAKA,EAAGrC,EAAEoC,MAAM,CAAE,iBACnCsC,QAAS,CAAExF,GAAG,EAAMC,GAAG,CAAK,EAC5BsF,KAAM,CAAEC,QAAS,CAAEA,QAAS,CAAEvE,GAAI,EAAK,CAAE,CAAE,CAC7C,GAEE,CAAA,EAAA,EAAA,aAAA,AAAa,EACX+I,EAAarE,GAAG,CAAC,AAAC7E,GAAO,CAAD,CAAGd,EAAGc,EAAEd,CAAC,CAAEC,EAAGa,EAAEb,CAAC,CAAEkE,YAAarD,EAAE0E,OAAO,CAAC5F,MAAM,CAAC,CAAC,IAG5E,CADA,KACM,CAAA,EAAA,EAAA,cAAA,AAAc,EAACa,GAEvB,IAAMwJ,EAAY,MAAMxJ,EAAOgB,MAAM,CAAC,CAAEzB,EAAG,EAAA,QAAQ,CAACA,CAAC,CAAEC,EAAG,EAAA,QAAQ,CAACA,CAAC,AAAC,GAAGyB,IAAI,CAAC,EAAA,QAAQ,EACjF,CAAA,EAAA,EAAA,gBAAA,AAAgB,EAACuI,IAAY,MAAM,CAAA,EAAA,EAAA,iBAAiB,AAAjB,EAAkBxJ,GAEzD,IAAMiH,EAAU,MAAMC,EAAYlH,GAClC,MAAO,CACL6E,OAAQ6C,EAAK7C,MAAM,CAAC1F,MAAM,CAC1BiH,UAAWsB,EAAKtB,SAAS,CAACjH,MAAM,CAChCuH,UAAWgB,EAAKhB,SAAS,CAACvH,MAAM,SAChC8H,CACF,CACF,2ICvRA,IAAA,EAAA,EAAA,CAAA,CAAA,MACA,EAAA,EAAA,CAAA,CAAA,OAAA,EAAA,EAAA,CAAA,CAAA,kBAOO,eAAeyC,EAAIC,CAAY,EACpC,IAAMC,EAAU,IAAIC,YAChBC,GAAS,EAIPC,EAAO,CAAA,EAAA,EAAA,sBAAA,AAAsB,EAACJ,GAE9BK,EAAS,IAAIC,eAAe,CAChC,MAAMC,MAAMC,CAAU,EACpB,IAAIC,EAAO,CAAC,EACZD,EAAWE,OAAO,CAACT,EAAQU,MAAM,CAAC,oBAClC,IAAMC,EAAO,UACX,IAAIT,GACJ,GAAI,CACF,CAFU,GAEJU,EAAI,MAAM,CAAA,EAAA,EAAA,gBAAA,AAAgB,EAACT,EAAM,IAAM,CAAA,EAAA,EAAA,UAAU,AAAV,KACzCS,IAAMJ,IACRA,EADc,AACPI,EACPL,EAAWE,OAAO,CAACT,EAAQU,MAAM,CAAC,CAAC,MAAM,EAAEE,EAAE;AAAA;AAAI,CAAC,GAEtD,CAAE,KAAM,CAER,CACI,AAACV,GAAQW,WAAWF,EAAM,KAChC,EACKA,GACP,EACAG,SACEZ,GAAS,CACX,CACF,GAEA,OAAO,IAAIa,SAASX,EAAQ,CAC1BY,QAAS,CACP,eAAgB,oBAChB,gBAAiB,yBACjBC,WAAY,YACd,CACF,EACF,uDA3CuB,wECJvB,IAAA,EAKO,EAAA,CAJLC,AAIK,CAAA,OACP,EAA0B,EAAyB,CAAA,AAA1CC,CAA0C,GAAA,EAL9B,EAMrB,CADkB,CACwB,AAFmB,EAEnB,CAAjCC,AAAiC,CAAA,AAFnC,GACmB,CAC8C,GAExE,EAGEI,EAEK,CAAA,AAJLF,CAHqBD,AAOhB,MAFS,CAGhB,EAA+C,EARb,AAQa,CAAtCI,AAAqE,CAAA,AAL9D,CAIT,CAHLF,IAJwC,CAS1C,CADkB,CADgB,AAEI,CADPG,CACO,CAA7BC,AAA6B,CAAA,GALtB,EACdH,AAGqC,EAEvC,EAAiC,EAAA,CAAxBI,AAAwB,CAAA,AAFc,EACoC,IACT,CAC1E,AAF8B,EAEY,EAAQ,CAAA,AAAzCC,CAAyC,CAAA,CAFZ,AACb,KAEzB,EAEEG,CAJ+B,CAC8C,AAIxE,CAFLD,AAEK,CAAA,CAJiB,CAGA,CAHED,IAK1B,EAA+B,CADxB,CAC0D,CAAxDG,AAAwD,CAAA,IAH7C,EAFsB,AAGxCD,CAGF,EAAoC,EAAA,CAA3BE,AAA2B,CAAA,AADb,IAA0C,AACO,GACxE,CAF+B,CAEF,EAA4B,CAAhDC,AAAgD,CAAA,KAD7B,EAE5B,AAJ8D,EAGL,AAGvDE,EAHmB,AAGM,CADzBD,AACyB,CAJS,AAIT,EACpB,IAJsB,CAK7B,EAAsC,EAAA,CAAA,AAA7BE,CAA6B,CAFX,CAE2C,KACtE,EAAyBE,EAAsB,AAAQ,CAA9CD,AAA8C,CAAA,AAJ1B,CAEE,CAD7BF,IAGqD,CADzB,AAE9B,CAD4E,CAC5C,EAAA,CAAA,AAAvBI,CAAuB,AADT,EAAED,AADa,OAEuC,KAArD,IACxB,IADgC,AAChC,EAIO,EAA6B,CAHlCE,AAGkC,CAAA,KACpC,EAAwC,EAAA,CAAA,CAAA,EAA5BC,CAJK,CAGmB,OAA7B,KACmB,eAAc,UAWxC,IAAMC,EAAc,IAAI1B,EAAAA,mBAAAA,CAAoB,CAC1C2B,WAAY,CACVC,KAAM3B,EAAAA,SAAAA,CAAU4B,SAAS,CACzBC,KAAM,oBACNC,SAAU,cACVC,SAAU,QACVC,WAAY,EACd,EACAC,QAAqBG,CAAZF,EAAoC,KAC7CG,CADiBF,GAAG,AAA6B,CAA5BC,cAC0C,CAA3CF,EACpBK,MAD4BJ,GAAG,CAACG,OACd,oBADyC,gBAE3DE,iBAbF,CAA0B,EAexBhB,SAAUA,EAKV,GAAIU,AAIA,CAAC,CAAC,AACR,GAKM,GAVQC,GAAG,CAACM,SAAS,EAUnBG,CAAgB,CAVOV,QAAQC,GAAG,CAACO,CACrC,QASoBG,CAAoB,OAVc,MAUZC,CAAW,CAAE,CAAGrB,EAiBzD,eAAesB,EACpBnE,CAAoB,CACpBoE,CAAmB,CACnBC,CAGC,EAEGA,EAAIC,WAAW,EAAE,GACnB7C,EAAAA,cAAAA,EAAezB,EAAKqE,EAAIC,WAAW,EAEjCzB,EAAY0B,KAAK,EAAE,GACrBhD,EAAAA,cAAAA,EAAevB,EAAK,+BAAgCsD,QAAQkB,MAAM,CAACC,MAAM,IAE3E,IAAIC,EAAU,oBAMZA,EAAUA,EAAQvM,OAAO,CAAC,WAAY,KAAO,IAQ/C,IAAM0M,EAAgB,MAAMhC,EAAYiC,OAAO,CAAC9E,EAAKoE,EAAK,CACxDM,UACAC,mBAJCC,CAAAA,CAKH,GAEA,GAP+B,AAO3B,CAACC,EAIH,OAHAT,EAAIW,IADc,MACJ,CAAG,IACjBX,EAAIY,GAAG,CAAC,eACK,AAAbX,OAAa,CAATY,IAAS,KAAA,EAAbZ,EAAIY,SAAS,CAAA,IAAA,CAAbZ,EAAgB1M,QAAQuN,OAAO,IACxB,KAGT,GAAM,SACJC,CAAO,cACPC,CAAY,QACZC,CAAM,CACNC,YAAU,WACVC,CAAS,aACTC,CAAW,mBACXC,CAAiB,qBACjBC,CAAmB,sBACnBC,CAAoB,CACpBC,yBAAuB,kBACvBC,CAAgB,yBAChBC,CAAuB,uBACvBC,CAAqB,CACtB,CAAGlB,EAEEmB,EAAAA,CAAAA,EAAoBnE,EAAAA,gBAAAA,EAAiB6C,GAEvCuB,EAAQC,GACVT,EAAkBU,aAAa,CAACH,EAAkB,EAChDP,EAAkBW,MAAM,CAACP,EAAAA,AAAiB,EAGxCQ,EAAY,WAEZX,MAAAA,EAAAA,KAAAA,EAAAA,EAAqBW,SAAS,AAATA,EACvB,AADkC,MAC5BX,EAAoBW,SAAS,CAACrG,EAAKoE,EAAKmB,GAAW,GAEzDnB,EAAIY,GAAG,CAAC,gCAEH,MAGT,GAAIiB,GAAS,CAACT,EAAa,CACzB,IAAMc,GAAgBJ,CAAQT,EAAkBW,MAAM,CAACP,EAAiB,CAClEU,EAAgBd,EAAkBU,aAAa,CAACH,EAAkB,CAExE,GAAIO,IAC6B,IAA3BA,EAAcC,KADD,GACS,EAAc,CAACF,EAAe,CACtD,GAAIhB,EAAWmB,WAAW,CACxB,CAD0B,MACnB,MAAMJ,GAEf,OAAM,IAAI3D,EAAAA,eAAAA,AACZ,CAEJ,CAEA,IAAIgE,EAA0B,MAE1BT,GAAUpD,EAAY0B,IAAb,CAAkB,EAAKiB,EAAD,EACjCkB,EAAWb,EAEXa,EAAwB,GAHuB,QAGpCA,EAAwB,IAAMA,GAG3C,IAAMC,GAEkB,IAAtB9D,EAAY0B,EACZ,GADiB,EAGjB,CAAC0B,EAMGW,EAAqBX,GAAS,CAACU,EAKjCZ,GAAyBD,MAC3BlE,EAAAA,CAhB0D,gBAeN,IACpDA,EAAsB,CACpBqB,KAAMyB,aAf6D,aAgBnEoB,wBACAC,CACF,GAGF,IAAMxN,EAASyH,EAAIzH,MAAM,EAAI,MACvBsO,EAAAA,CAAAA,EAASnF,EAAAA,SAAAA,IACToF,EAAaD,EAAOE,kBAAkB,GACtCC,GAAwBd,EAC5BR,MAAAA,EAAAA,KAAAA,EAAAA,EAAqBsB,qBAAAA,AAAqB,EAEtCC,EAAgBf,EAAAA,CAAAA,EAAQ1E,EAAAA,cAAAA,EAAexB,EAAK,eAE5CkH,EAAAA,CAAAA,EACJ1F,EAAAA,cAAAA,EAAexB,EAAK,qBACnB,MAAM6C,EAAYsE,mBAAmB,CACpCnH,EACAsF,EACAG,EACAwB,EAGJC,OAAAA,GAAAA,EAAAA,AAAkBE,iBAAiB,GACjCC,WAAmBC,kBAAkB,CAAGJ,EAE1C,IAAMK,EAAuC,QAC3ClC,EACAmC,aAAc/B,EAAkBgC,OAAO,CACvCC,WAAY,CACVC,aAAc,CACZC,gBAAgB1B,CAAQZ,EAAWqC,YAAY,CAACC,cAAc,AAChE,EACAC,iBAAiB3B,CAAQZ,EAAWuC,eAAe,yBACnDlB,mBACAO,EACAY,kBAAmBxC,EAAWyC,SAAS,CACvC9C,UAAWZ,EAAIY,SAAS,CACxB+C,QAAS,AAACC,IACR7D,EAAI8D,EAAE,CAAC,QAASD,EAClB,EACAE,iBAAkBC,OAClBC,8BAA+B,CAC7BC,EACAC,EACAC,EACAC,IAEA5F,EAAY6F,cAAc,CACxB1I,EACAsI,EACAE,EACAC,EACA/C,EAEN,EACAiD,cAAe,SACbxD,eACAC,CACF,CACF,EACMwD,EAAc,IAAI9G,EAAAA,eAAAA,CAAgB9B,GAClC6I,EAAc,IAAI9G,EAAAA,gBAAAA,CAAiBqC,GAEnC0E,EAAU9G,EAAAA,kBAAAA,CAAmB+G,mBAAmB,CACpDH,EAAAA,CAAAA,EACA3G,EAAAA,sBAAAA,EAAuBmC,IAGzB,GAAI,CAEF,IADI4E,EACEC,EAAoB,MAAOC,GACxBrG,EAAYsG,MAAM,CAACL,EAASvB,GAAS6B,OAAO,CAAC,KAClD,GAAI,CAACF,EAAM,OAEXA,EAAKG,aAAa,CAAC,CACjB,mBAAoBjF,EAAIW,UAAU,CAClC,YAAY,CACd,GAEA,IAAMuE,EAAqBzC,EAAO0C,qBAAqB,GAEvD,GAAI,CAACD,EACH,OAGF,GACEA,EAAmB9N,GAAG,CAAC,EALA,kBAMvB0G,EAAAA,cAAAA,CAAesH,aAAa,CAC5B,YACAC,QAAQC,IAAI,CACV,CAAC,2BAA2B,EAAEJ,EAAmB9N,GAAG,CAClD,kBACA,qEAAqE,CAAC,EAK5E,IAAMmO,EAAQL,EAAmB9N,GAAG,CAAC,cACrC,GAAImO,EAAO,CACT,IAAMtO,EAAO,CAAA,EAAG9C,EAAO,CAAC,EAAEoR,EAAAA,CAAO,CAEjCT,EAAKG,aAAa,CAAC,CACjB,aAAcM,EACd,aAAcA,EACd,iBAAkBtO,CACpB,GACA6N,EAAKU,UAAU,CAACvO,GAIZ2N,GAAcA,IAAeE,IAC/BF,EADqC,AAC1Ba,YAAY,CAAC,aAAcF,GACtCX,EAAWY,UAAU,CAACvO,GAE1B,MACE6N,CADK,CACAU,UAAU,CAAC,CAAA,EAAGrR,EAAO,CAAC,EAAEmM,EAAAA,CAAS,CAE1C,GAGIoF,EAAiB,MAAOC,QAgIxBC,EAEqDA,EAjIzD,IAAMC,EAAuC,MAAO,oBAClDC,CAAkB,CACnB,IACC,GAAI,CACF,GACE,CAACjD,GACDtB,GACAC,GACA,CAACsE,EAMD,OAJA9F,EAAIW,SADJ,CACc,CAAG,IAEjBX,EAAI+F,SAAS,CAAC,iBAAkB,eAChC/F,EAAIY,GAAG,CAAC,gCACD,KAGT,IAAMoF,EAAW,MAAMnB,EAAkBc,GAEvC/J,EAAYqK,YAAY,CAAI9C,EAAQG,UAAU,CAAS2C,YAAY,CACrE,IAAIC,EAAmB/C,EAAQG,UAAU,CAAC4C,gBAAgB,CAItDA,GACEjG,EAAIY,SAAS,EAAE,CACjBZ,CAFkB,CAEdY,SAAS,CAACqF,GACdA,OAAmBlC,GAGvB,IAAMmC,EAAYhD,EAAQG,UAAU,CAAC8C,aAAa,CAIlD,IAAIvE,EA8CF,OANA,MAAA,CAAA,EAAM7D,EAAAA,YAAAA,EACJwG,EACAC,EACAuB,EACA7C,EAAQG,UAAU,CAAC4C,gBAAgB,EAE9B,IA9CE,EACT,IAAMG,EAAO,MAAML,EAASK,IAAI,GAG1BxJ,EAAAA,CAAAA,EAAUqB,EAAAA,yBAAAA,EAA0B8H,EAASnJ,OAAO,CAEtDsJ,IACFtJ,EAAO,CAACwB,EAAAA,EADK,oBACLA,CAAuB,CAAG8H,CAAAA,EAGhC,CAACtJ,CAAO,CAAC,eAAe,EAAIwJ,EAAKxO,IAAI,EAAE,CACzCgF,CAAO,CAAC,eAAe,CAAGwJ,EAAKxO,IAAAA,AAAI,EAGrC,IAAMyO,EACJ,KAAkD,IAA3CnD,EAAQG,UAAU,CAACiD,mBAAmB,IAC7CpD,EAAQG,UAAU,CAACiD,mBAAmB,EAAInI,EAAAA,cAAAA,GACtC,AACA+E,EAAQG,UAAU,CAACiD,mBAAmB,CAEtCC,EACJ,AAA8C,SAAvCrD,EAAQG,UAAU,CAACmD,eAAe,EACzCtD,EAAQG,UAAU,CAACmD,eAAe,EAAIrI,EAAAA,cAAAA,MAClC4F,EACAb,EAAQG,UAAU,CAACmD,eAAe,CAaxC,MAVuC,CAUhCb,AATLc,MAAO,CACL/H,KAAMJ,EAAAA,eAAAA,CAAgBK,SAAS,CAC/B+H,OAAQX,EAASW,MAAM,CACvBC,KAAMC,OAAO3T,IAAI,CAAC,MAAMmT,EAAKS,WAAW,YACxCjK,CACF,EACAkK,aAAc,YAAET,SAAYE,CAAO,CACrC,CAGF,CAUF,CAAE,KAVO,CAUAQ,EAAK,CAqBZ,MAlBIlB,MAAAA,EAAAA,KAAAA,EAAAA,EAAoBmB,OAAAA,AAAO,EAAE,CAE/B,MAAMxI,EAAY6F,cAAc,CAC9B1I,EACAoL,EACA,CACEE,WAAY,aACZC,UAAW7G,EACX8G,UAAW,QACXC,iBAAAA,CAAAA,EAAkBtJ,EAAAA,mBAAAA,EAAoB,oBACpCyE,EACAjB,sBACF,EACF,GACA8C,AAbiB,EAcjB/C,GAGE0F,CACR,CACF,EAEMpB,EAAa,MAAMnH,EAAYiH,cAAc,CAAC,KAClD9J,aACAsF,WACAoB,EACAgF,UAAWtK,EAAAA,SAAAA,CAAU4B,SAAS,CAC9B2I,YAAY,oBACZlG,EACAmG,mBAAmB,uBACnBjG,0BACAC,oBACAqE,EACAhF,UAAWZ,EAAIY,SAAS,eACxBgC,CACF,GAGA,GAAI,CAAChB,EACH,KADU,EACH,KAGT,GAAI+D,CAAAA,MAAAA,CAAAA,EAAAA,AAAiB,GAAjBA,IAAAA,EAAAA,EAAYc,KAAAA,AAAK,EAAA,KAAA,EAAjBd,EAAmBjH,IAAI,IAAKJ,EAAAA,eAAAA,CAAgBK,SAAS,CACvD,CADyD,KACnD,OAAA,cAEL,CAFK,AAAI6I,MACR,CAAC,kDAAkD,EAAE7B,MAAAA,CAAAA,EAAAA,AAAiB,GAAjBA,IAAAA,EAAAA,EAAYc,KAAAA,AAAK,EAAA,KAAA,EAAjBd,EAAmBjH,IAAI,CAAA,CAAE,EAD1E,oBAAA,OAAA,mBAAA,gBAAA,CAEN,EAGE,CAACkE,GACH7C,EAAI+F,SAAS,CADK,AAEhB,iBACAxE,EACI,cACAqE,EAAW8B,MAAM,CACf,OACA9B,EAAWqB,OAAO,CAChB,QACA,OAKR7F,GACFpB,EAAI+F,QADW,CACF,CACX,gBACA,2DAIJ,IAAMlJ,EAAAA,CAAAA,EAAUoB,EAAAA,2BAAAA,EAA4B2H,EAAWc,KAAK,CAAC7J,OAAO,EA4BpE,OA1BI,AAAEgG,CAAAA,EAAiBhB,GACrBhF,EADyB,AACjB3H,GADqB,GACf,CAACmJ,EAAAA,sBAAAA,GAMfuH,EAAWmB,YAAY,EACtB/G,EAAD,AAAK2H,SAAS,CAAC,kBACd9K,EAAD,AAASzF,GAAG,CAAC,kBACb,AACAyF,EAAQhK,GAAG,CACT,gBAAA,CAAA,EACAsL,EAAAA,qBAAAA,EAAsByH,EAAWmB,YAAY,GAIjD,MAAA,CAAA,EAAM/I,EAAAA,YAAAA,EACJwG,EACAC,EAEA,IAAI7H,SAASgJ,EAAWc,KAAK,CAACE,IAAI,CAAE,SAClC/J,EACA8J,OAAQf,EAAWc,KAAK,CAACC,MAAM,EAAI,GACrC,IAEK,IACT,CAII/D,IAAyBF,EAC3B,MAAMgD,EAAehD,EADkB,EAGvCkC,EAAanC,EAAOE,kBAAkB,GACtC,MAAMF,EAAOmF,CAf2H,oBAetG,CAChChM,EAAIiB,OAAO,CACX,IACE4F,EAAOoF,KAAK,CACV/J,EAAAA,cAAAA,CAAesH,aAAa,CAC5B,CACE0C,SAAU,CAAA,EAAG3T,EAAO,CAAC,EAAEmM,EAAAA,CAAS,CAChC3B,KAAMpB,EAAAA,QAAAA,CAASwK,MAAM,CACrBC,WAAY,CACV,cAAe7T,EACf,cAAeyH,EAAIqM,GAAG,AACxB,CACF,EACAvC,QAEJ1B,EACA,CAACpB,GAGP,CAAE,MAAOoE,EAAK,CAuBZ,GAtBMA,aAAe1I,EAAAA,eAAc,EAEjC,CAFqC,KAE/BG,EAAY6F,cAAc,CAC9B1I,EACAoL,EACA,CACEE,WAAY,aACZC,UAAWvF,EACXwF,UAAW,QACXC,iBAAAA,CAAAA,EAAkBtJ,EAAAA,mBAAAA,EAAoB,CACpCyE,qBACAjB,sBACF,EACF,GACA8C,AAbiB,EAcjB/C,GAOAO,EAAO,MAAMmF,EAQjB,OALA,MAAA,CAAA,EAAMhJ,EAAAA,YAAAA,EACJwG,EACAC,EACA,IAAI7H,SAAS,KAAM,CAAE+J,OAAQ,GAAI,IAE5B,IACT,CACF,mCA7eA,SAAS1J,EACP,MAAA,CAAA,EAAOC,EAAAA,UAAAA,EAAY,kBACjB0C,uBACAC,CACF,EACF","ignoreList":[6]}

package/.next/server/chunks/[root-of-the-server]__1jtw_i1._.js

@@ -0,0 +1,3 @@
+module.exports=[89122,e=>{"use strict";var t=e.i(14859);e.s(["pinned",0,function(e){return async(n,...r)=>{let a=await (0,t.resolveRequestWorkspaceId)(n);return a&&await (0,t.ensureWorkspaceDb)(a),(0,t.runWithWorkspace)(a,async()=>e(n,...r))}}])},58708,e=>{"use strict";let t=null;async function n(){return t||(t=(async()=>{let{pipeline:t}=await e.A(46128);return await t("feature-extraction","Xenova/all-MiniLM-L6-v2")})().catch(e=>{throw t=null,e})),t}async function r(e){let t=e.trim();if(!t)return null;try{let e=await n(),r=await e(t,{pooling:"mean",normalize:!0});return Array.from(r.data)}catch(e){return console.error("[embeddings] failed:",e instanceof Error?e.message:e),null}}function a(e){return[e.title,e.role,e.plain,e.cluster].filter(Boolean).join(". ")}function i(e){return JSON.stringify(e)}async function s(t){try{let{db:n}=await e.A(35914),{node:s}=await e.A(29363),{eq:o}=await e.A(96359),l=await n.query.node.findFirst({where:(e,{eq:n})=>n(e.id,t),columns:{title:!0,role:!0,plain:!0,cluster:!0}});if(!l)return;let u=await r(a(l));if(!u)return;await n.update(s).set({embedding:i(u)}).where(o(s.id,t))}catch(e){console.error("[embeddings] reembed failed:",t,e instanceof Error?e.message:e)}}async function o(e,t){let n=await r(e);if(!n)return null;let a=[];for(let e of t){let t=function(e){if(!e)return null;try{let t=JSON.parse(e);if(!Array.isArray(t)||t.some(e=>"number"!=typeof e||!Number.isFinite(e)))return null;return t}catch{return null}}(e.embedding);t&&a.push({item:e,score:function(e,t){if(e.length!==t.length)return 0;let n=0,r=0,a=0;for(let i=0;i<e.length;i++)n+=e[i]*t[i],r+=e[i]*e[i],a+=t[i]*t[i];return 0===r||0===a?0:n/(Math.sqrt(r)*Math.sqrt(a))}(n,t)})}return a.sort((e,t)=>t.score-e.score),a}e.s(["embedText",0,r,"encodeVector",0,i,"nodeEmbeddingInput",0,a,"rankByQuery",0,o,"reembedNode",0,s])},53828,e=>e.a(async(t,n)=>{try{var r=e.i(91426),a=e.i(34700),i=t([r]);async function s(e=r.db){let[t]=await e.insert(a.appSetting).values({id:"singleton"}).onConflictDoUpdate({target:a.appSetting.id,set:{id:"singleton"}}).returning();return t}async function o(e,t=r.db){let[n]=await t.insert(a.appSetting).values({id:"singleton",...e}).onConflictDoUpdate({target:a.appSetting.id,set:e}).returning();return n}[r]=i.then?(await i)():i,e.s(["getAppSettings",0,s,"setAppSettings",0,o]),n()}catch(e){n(e)}},!1),91153,e=>{"use strict";let t=new Set(["a","an","the","of","for","to","and","or","in","on","with","via","by","using","use","add","adds","support","implement","implementation","feature","new","build","create","o","os","as","um","uma","de","da","do","das","dos","para","por","com","e","ou","no","na","nos","nas","ao","aos","adicionar","implementar","suporte","suportar","nova","novo","funcionalidade","usar","usando","criar"]);function n(e){return e.normalize("NFD").replace(/[̀-ͯ]/g,"").toLowerCase().replace(/[^a-z0-9]+/g," ").trim().replace(/\s+/g," ")}function r(e){return n(e).split(" ").filter(e=>e&&!t.has(e))}function a(e,t){if(!e.size||!t.size)return 0;let n=0;for(let r of e)t.has(r)&&n++;return 2*n/(e.size+t.size)}function i(e){let t=n(e).replace(/ /g,""),r=new Set;for(let e=0;e<t.length-1;e++)r.add(t.slice(e,e+2));return r}e.s(["matchFeature",0,function(e,t,s={}){let o=s.confident??.72,l=s.consider??.5,u=s.margin??.1,d=t.map(t=>{var s,o;let l,u;return{...t,score:Math.round(100*(s=e,o=t.title,l=n(s),u=n(o),l&&u?l===u?1:Math.min(1,.7*a(new Set(r(s)),new Set(r(o)))+.4*a(i(s),i(o))):0))/100}}).sort((e,t)=>t.score-e.score),c=d[0];if(!c||c.score<l)return{best:null,candidates:[]};let p=d[1]?.score??0,h=1===d.length||c.score-p>=u;return c.score>=o&&h?{best:c,candidates:[]}:{best:null,candidates:d.filter(e=>e.score>=l).slice(0,4)}}])},32665,e=>{"use strict";var t=e.i(91153);e.s(["validateFeatureCreation",0,function(e){let n=(e.title??"").trim();if(!n)return"⛔ A feature needs a non-empty title.";if(!(e.category??"").trim()){let t=function(e){let t=new Set;for(let n of e){let e=(n.cluster??"").trim();e&&t.add(e)}return[...t].sort()}(e.existing),r=t.length?` Reuse an existing category where it fits: ${t.join(", ")}.`:"";return`⛔ Feature "${n}" has no category. Every roadmap feature needs one — it drives grouping and color on the board.${r} Pass it as \`category\` (e.g. AUTH, SEARCH, DATA, INTEL, BILLING, INFRA …); don't rely on a default.`}let r=(0,t.matchFeature)(n,e.existing.map(e=>({id:e.id,title:e.title})));if(r.best){let t=e.existing.find(e=>e.id===r.best.id),a=t?.status?` (${t.status})`:"";return`⛔ "${n}" already exists as the feature "${t?.title??r.best.title}"${a}. Don't create a duplicate — mark progress on it with \`beacon_start_feature({ id })\`, add sub-tasks with \`beacon_add_subtasks\`, or finish it with \`beacon_describe_feature\`.`}return null},"validateFront",0,function(e,n){let r=(e??"").trim();if(!r)return null;let a=(0,t.matchFeature)(r,n);if(a.best)return null;let i=a.candidates.length?` Did you mean: ${a.candidates.map(e=>`"${e.title}"`).join(", ")}?`:"";return`⛔ front "${r}" doesn't match an existing feature.${i} \`front\` nests a feature UNDER an existing parent feature — it is NOT a domain tag. If "${r}" is a domain, pass it as \`category\` instead. If it's a real umbrella feature, create it first via beacon_propose_plan.`},"validateNoDuplicateFeatures",0,function(e,n){let r=n.map(e=>({id:e.id,title:e.title})),a=e.map(e=>{let a=(0,t.matchFeature)(e.title??"",r);return a.best?{title:e.title,hit:n.find(e=>e.id===a.best.id)}:null}).filter(e=>null!==e);return a.length?"⛔ These proposed features already exist on the roadmap — reuse them instead of creating duplicates:\n"+a.map(e=>`  • "${e.title}" → existing "${e.hit.title}"${e.hit.status?` (${e.hit.status})`:""}`).join("\n")+"\n\nDrop the duplicate(s) from the plan; to add work to an existing feature, ship sub-tasks or update it via beacon_describe_feature. Keep only genuinely new features in the proposal.":null},"validateProposedFeatures",0,function(e){let t=e.map(e=>{let t=[],n=e.cluster??e.category??e.domain??null;return n&&n.trim()||t.push("category"),null==e.priority&&t.push("priority"),t.length?`  • "${e.title?.trim()||"(untitled)"}" — missing ${t.join(" + ")}`:null}).filter(e=>null!==e);return 0===t.length?null:"⛔ Every roadmap feature needs a category AND a priority — they drive grouping and ordering on the board, and the user shouldn't have to add them by hand. Missing:\n"+t.join("\n")+"\n\nRe-present with each feature carrying its category as `category` (or `cluster` — both work; e.g. AUTH, SEARCH, DATA, INTEL, BILLING …) and `priority` (0 = P0 critical, 1 = P1 high, 2 = P2 medium, 3 = P3 low). Set BOTH on EVERY feature; don't rely on defaults."}])},3261,e=>e.a(async(t,n)=>{try{var r=e.i(85336),a=e.i(89122),i=t([r]);[r]=i.then?(await i)():i;let s=(0,a.pinned)(async(e,{params:t})=>{let{id:n}=await t;try{let{x:t,y:a}=await e.json();return await (0,r.updateNodePosition)(n,t,a),new Response(null,{status:204})}catch{return new Response("Invalid position",{status:400})}});e.s(["POST",0,s]),n()}catch(e){n(e)}},!1),42343,e=>e.a(async(t,n)=>{try{var r=e.i(47909),a=e.i(74017),i=e.i(96250),s=e.i(59756),o=e.i(61916),l=e.i(74677),u=e.i(69741),d=e.i(16795),c=e.i(87718),p=e.i(95169),h=e.i(47587),f=e.i(66012),g=e.i(70101),m=e.i(26937),v=e.i(10372),y=e.i(93695);e.i(20232);var w=e.i(220),R=e.i(3261),b=t([R]);[R]=b.then?(await b)():b;let A=new r.AppRouteRouteModule({definition:{kind:a.RouteKind.APP_ROUTE,page:"/api/nodes/[id]/position/route",pathname:"/api/nodes/[id]/position",filename:"route",bundlePath:""},distDir:".next",relativeProjectDir:"",resolvedPagePath:"[project]/app/api/nodes/[id]/position/route.ts",nextConfigOutput:"",userland:R,...{}}),{workAsyncStorage:_,workUnitAsyncStorage:x,serverHooks:C}=A;async function E(e,t,n){n.requestMeta&&(0,s.setRequestMeta)(e,n.requestMeta),A.isDev&&(0,s.addRequestMeta)(e,"devRequestTimingInternalsEnd",process.hrtime.bigint());let r="/api/nodes/[id]/position/route";r=r.replace(/\/index$/,"")||"/";let i=await A.prepare(e,t,{srcPage:r,multiZoneDraftMode:!1});if(!i)return t.statusCode=400,t.end("Bad Request"),null==n.waitUntil||n.waitUntil.call(n,Promise.resolve()),null;let{buildId:R,deploymentId:b,params:E,nextConfig:_,parsedUrl:x,isDraftMode:C,prerenderManifest:N,routerServerContext:S,isOnDemandRevalidate:P,revalidateOnlyGenerated:T,resolvedPathname:I,clientReferenceManifest:k,serverActionsManifest:$}=i,O=(0,u.normalizeAppPath)(r),D=!!(N.dynamicRoutes[O]||N.routes[I]),q=async()=>((null==S?void 0:S.render404)?await S.render404(e,t,x,!1):t.end("This page could not be found"),null);if(D&&!C){let e=!!N.routes[I],t=N.dynamicRoutes[O];if(t&&!1===t.fallback&&!e){if(_.adapterPath)return await q();throw new y.NoFallbackError}}let H=null;!D||A.isDev||C||(H=I,H="/index"===H?"/":H);let M=!0===A.isDev||!D,F=D&&!M;$&&k&&(0,l.setManifestsSingleton)({page:r,clientReferenceManifest:k,serverActionsManifest:$});let U=e.method||"GET",j=(0,o.getTracer)(),L=j.getActiveScopeSpan(),z=!!(null==S?void 0:S.isWrappedByNextServer),B=!!(0,s.getRequestMeta)(e,"minimalMode"),K=(0,s.getRequestMeta)(e,"incrementalCache")||await A.getIncrementalCache(e,_,N,B);null==K||K.resetRequestCache(),globalThis.__incrementalCache=K;let W={params:E,previewProps:N.preview,renderOpts:{experimental:{authInterrupts:!!_.experimental.authInterrupts},cacheComponents:!!_.cacheComponents,supportsDynamicResponse:M,incrementalCache:K,cacheLifeProfiles:_.cacheLife,waitUntil:n.waitUntil,onClose:e=>{t.on("close",e)},onAfterTaskError:void 0,onInstrumentationRequestError:(t,n,r,a)=>A.onRequestError(e,t,r,a,S)},sharedContext:{buildId:R,deploymentId:b}},G=new d.NodeNextRequest(e),V=new d.NodeNextResponse(t),X=c.NextRequestAdapter.fromNodeNextRequest(G,(0,c.signalFromNodeResponse)(t));try{let i,s=async e=>A.handle(X,W).finally(()=>{if(!e)return;e.setAttributes({"http.status_code":t.statusCode,"next.rsc":!1});let n=j.getRootSpanAttributes();if(!n)return;if(n.get("next.span_type")!==p.BaseServerSpan.handleRequest)return void console.warn(`Unexpected root span type '${n.get("next.span_type")}'. Please report this Next.js issue https://github.com/vercel/next.js`);let a=n.get("next.route");if(a){let t=`${U} ${a}`;e.setAttributes({"next.route":a,"http.route":a,"next.span_name":t}),e.updateName(t),i&&i!==e&&(i.setAttribute("http.route",a),i.updateName(t))}else e.updateName(`${U} ${r}`)}),l=async i=>{var o,l;let u=async({previousCacheEntry:a})=>{try{if(!B&&P&&T&&!a)return t.statusCode=404,t.setHeader("x-nextjs-cache","REVALIDATED"),t.end("This page could not be found"),null;let r=await s(i);e.fetchMetrics=W.renderOpts.fetchMetrics;let o=W.renderOpts.pendingWaitUntil;o&&n.waitUntil&&(n.waitUntil(o),o=void 0);let l=W.renderOpts.collectedTags;if(!D)return await (0,f.sendResponse)(G,V,r,W.renderOpts.pendingWaitUntil),null;{let e=await r.blob(),t=(0,g.toNodeOutgoingHttpHeaders)(r.headers);l&&(t[v.NEXT_CACHE_TAGS_HEADER]=l),!t["content-type"]&&e.type&&(t["content-type"]=e.type);let n=void 0!==W.renderOpts.collectedRevalidate&&!(W.renderOpts.collectedRevalidate>=v.INFINITE_CACHE)&&W.renderOpts.collectedRevalidate,a=void 0===W.renderOpts.collectedExpire||W.renderOpts.collectedExpire>=v.INFINITE_CACHE?void 0:W.renderOpts.collectedExpire;return{value:{kind:w.CachedRouteKind.APP_ROUTE,status:r.status,body:Buffer.from(await e.arrayBuffer()),headers:t},cacheControl:{revalidate:n,expire:a}}}}catch(t){throw(null==a?void 0:a.isStale)&&await A.onRequestError(e,t,{routerKind:"App Router",routePath:r,routeType:"route",revalidateReason:(0,h.getRevalidateReason)({isStaticGeneration:F,isOnDemandRevalidate:P})},!1,S),t}},d=await A.handleResponse({req:e,nextConfig:_,cacheKey:H,routeKind:a.RouteKind.APP_ROUTE,isFallback:!1,prerenderManifest:N,isRoutePPREnabled:!1,isOnDemandRevalidate:P,revalidateOnlyGenerated:T,responseGenerator:u,waitUntil:n.waitUntil,isMinimalMode:B});if(!D)return null;if((null==d||null==(o=d.value)?void 0:o.kind)!==w.CachedRouteKind.APP_ROUTE)throw Object.defineProperty(Error(`Invariant: app-route received invalid cache entry ${null==d||null==(l=d.value)?void 0:l.kind}`),"__NEXT_ERROR_CODE",{value:"E701",enumerable:!1,configurable:!0});B||t.setHeader("x-nextjs-cache",P?"REVALIDATED":d.isMiss?"MISS":d.isStale?"STALE":"HIT"),C&&t.setHeader("Cache-Control","private, no-cache, no-store, max-age=0, must-revalidate");let c=(0,g.fromNodeOutgoingHttpHeaders)(d.value.headers);return B&&D||c.delete(v.NEXT_CACHE_TAGS_HEADER),!d.cacheControl||t.getHeader("Cache-Control")||c.get("Cache-Control")||c.set("Cache-Control",(0,m.getCacheControlHeader)(d.cacheControl)),await (0,f.sendResponse)(G,V,new Response(d.value.body,{headers:c,status:d.value.status||200})),null};z&&L?await l(L):(i=j.getActiveScopeSpan(),await j.withPropagatedContext(e.headers,()=>j.trace(p.BaseServerSpan.handleRequest,{spanName:`${U} ${r}`,kind:o.SpanKind.SERVER,attributes:{"http.method":U,"http.target":e.url}},l),void 0,!z))}catch(t){if(t instanceof y.NoFallbackError||await A.onRequestError(e,t,{routerKind:"App Router",routePath:O,routeType:"route",revalidateReason:(0,h.getRevalidateReason)({isStaticGeneration:F,isOnDemandRevalidate:P})},!1,S),D)throw t;return await (0,f.sendResponse)(G,V,new Response(null,{status:500})),null}}e.s(["handler",0,E,"patchFetch",0,function(){return(0,i.patchFetch)({workAsyncStorage:_,workUnitAsyncStorage:x})},"routeModule",0,A,"serverHooks",0,C,"workAsyncStorage",0,_,"workUnitAsyncStorage",0,x]),n()}catch(e){n(e)}},!1),58502,e=>{e.v(t=>Promise.all(["server/chunks/[root-of-the-server]__1t2egm-._.js"].map(t=>e.l(t))).then(()=>t(51514)))},46128,e=>{e.v(t=>Promise.all(["server/chunks/[externals]_@huggingface_transformers_05bd-zz._.js"].map(t=>e.l(t))).then(()=>t(99732)))},35914,e=>{e.v(t=>Promise.all(["server/chunks/lib_db_ts_0h_yn5m._.js"].map(t=>e.l(t))).then(()=>t(62294)))},29363,e=>{e.v(e=>Promise.resolve().then(()=>e(34700)))},96359,e=>{e.v(t=>Promise.all(["server/chunks/node_modules_drizzle-orm_index_1qnscv7.js"].map(t=>e.l(t))).then(()=>t(32628)))}];
+
+//# sourceMappingURL=%5Broot-of-the-server%5D__1jtw_i1._.js.map

package/.next/server/chunks/[root-of-the-server]__1jtw_i1._.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../lib/api-workspace.ts","../../../lib/embeddings.ts","../../../lib/settings.ts","../../../lib/match.ts","../../../lib/feature-rules.ts","../../../app/api/nodes/%5Bid%5D/position/route.ts","../../../node_modules/next/src/build/templates/app-route.ts"],"sourcesContent":["import { ensureWorkspaceDb, resolveRequestWorkspaceId, runWithWorkspace } from \"@/lib/workspaces\";\n\n// Wrap a route handler so its whole execution is pinned to the request's workspace —\n// the `x-beacon-workspace` header (agent) or the `beacon_ws` cookie (browser selection),\n// falling back to the global active when neither is present. Use on every browser-facing\n// data route (canvas reads/writes) so an edit lands in the workspace the user is VIEWING,\n// not the global active one a background agent may have flipped.\n//\n// `db` / `dataDir()` / `repoRoot()` all consult the pin first, so wrapping the handler is\n// enough — nothing inside needs to know about workspaces.\n//\n// We `await ensureWorkspaceDb` BEFORE running the handler: the sync `db` Proxy getter no longer\n// self-heals (the libSQL migrator is async), so this request boundary is where a missing/behind\n// db gets provisioned + migrated. It short-circuits once the file is known-current this process,\n// so it's cheap on the hot path.\nexport function pinned<A extends unknown[]>(\n  handler: (req: Request, ...rest: A) => Response | Promise<Response>,\n): (req: Request, ...rest: A) => Promise<Response> {\n  return async (req, ...rest) => {\n    const id = await resolveRequestWorkspaceId(req);\n    if (id) await ensureWorkspaceDb(id);\n    return runWithWorkspace(id, async () => handler(req, ...rest));\n  };\n}\n","// Local semantic-search embedder. Loads Xenova/all-MiniLM-L6-v2 in-process\n// (~22MB cached on first use, ~50-100ms per text after that). Stays local so\n// the Beacon panel has no API-key dependency and no per-query network hop.\n// Vectors live in `Node.embedding` as JSON strings; cosine is computed in JS\n// at query time — at hundreds of nodes per workspace, sqlite-vec is overkill.\n\ntype FeatureExtractionPipeline = (\n  text: string | string[],\n  opts?: { pooling?: \"mean\" | \"cls\"; normalize?: boolean },\n) => Promise<{ data: Float32Array | number[] }>;\n\nlet pipelinePromise: Promise<FeatureExtractionPipeline> | null = null;\n\nasync function getEmbedder(): Promise<FeatureExtractionPipeline> {\n  if (!pipelinePromise) {\n    pipelinePromise = (async () => {\n      const { pipeline } = await import(\"@huggingface/transformers\");\n      // 384-dim sentence embeddings. The \"feature-extraction\" task with\n      // mean-pooled + normalized output is the canonical sentence-encoder shape.\n      return (await pipeline(\n        \"feature-extraction\",\n        \"Xenova/all-MiniLM-L6-v2\",\n      )) as unknown as FeatureExtractionPipeline;\n    })().catch((e) => {\n      pipelinePromise = null; // let the next call retry on transient failure\n      throw e;\n    });\n  }\n  return pipelinePromise;\n}\n\n/** Compute a 384-dim sentence embedding. Returns null on failure (caller falls back to lexical). */\nexport async function embedText(text: string): Promise<number[] | null> {\n  const trimmed = text.trim();\n  if (!trimmed) return null;\n  try {\n    const embedder = await getEmbedder();\n    const out = await embedder(trimmed, { pooling: \"mean\", normalize: true });\n    return Array.from(out.data);\n  } catch (e) {\n    console.error(\"[embeddings] failed:\", e instanceof Error ? e.message : e);\n    return null;\n  }\n}\n\n/** Build the embedding input text from a node's queryable fields. */\nexport function nodeEmbeddingInput(node: {\n  title: string;\n  role?: string | null;\n  plain?: string | null;\n  cluster?: string | null;\n}): string {\n  return [node.title, node.role, node.plain, node.cluster].filter(Boolean).join(\". \");\n}\n\n/** Cosine similarity, defensive against zero vectors and dimension mismatch. */\nexport function cosineSimilarity(a: number[], b: number[]): number {\n  if (a.length !== b.length) return 0;\n  let dot = 0;\n  let normA = 0;\n  let normB = 0;\n  for (let i = 0; i < a.length; i++) {\n    dot += a[i] * b[i];\n    normA += a[i] * a[i];\n    normB += b[i] * b[i];\n  }\n  if (normA === 0 || normB === 0) return 0;\n  return dot / (Math.sqrt(normA) * Math.sqrt(normB));\n}\n\nexport function encodeVector(v: number[]): string {\n  return JSON.stringify(v);\n}\n\nexport function decodeVector(raw: string | null | undefined): number[] | null {\n  if (!raw) return null;\n  try {\n    const parsed = JSON.parse(raw);\n    if (!Array.isArray(parsed)) return null;\n    if (parsed.some((x) => typeof x !== \"number\" || !Number.isFinite(x))) return null;\n    return parsed as number[];\n  } catch {\n    return null;\n  }\n}\n\n/**\n * Re-embed a Node from its current title/plain/role/cluster. Idempotent; swallows\n * errors so a failed embed never breaks the write that triggered it.\n */\nexport async function reembedNode(id: string): Promise<void> {\n  try {\n    const { db } = await import(\"@/lib/db\");\n    const { node } = await import(\"@/lib/drizzle/schema\");\n    const { eq } = await import(\"drizzle-orm\");\n    const row = await db.query.node.findFirst({\n      where: (t, { eq: eqf }) => eqf(t.id, id),\n      columns: { title: true, role: true, plain: true, cluster: true },\n    });\n    if (!row) return;\n    const vec = await embedText(nodeEmbeddingInput(row));\n    if (!vec) return;\n    await db.update(node).set({ embedding: encodeVector(vec) }).where(eq(node.id, id));\n  } catch (e) {\n    console.error(\"[embeddings] reembed failed:\", id, e instanceof Error ? e.message : e);\n  }\n}\n\n/** Rank candidates by cosine. Returns null when the query embedding fails. */\nexport async function rankByQuery<T extends { embedding: string | null }>(\n  query: string,\n  candidates: T[],\n): Promise<Array<{ item: T; score: number }> | null> {\n  const queryVec = await embedText(query);\n  if (!queryVec) return null;\n  const scored: Array<{ item: T; score: number }> = [];\n  for (const item of candidates) {\n    const v = decodeVector(item.embedding);\n    if (!v) continue;\n    scored.push({ item, score: cosineSimilarity(queryVec, v) });\n  }\n  scored.sort((a, b) => b.score - a.score);\n  return scored;\n}\n","import { db, type DB } from \"@/lib/db-drizzle\";\nimport { appSetting } from \"@/lib/drizzle/schema\";\n\nexport async function getAppSettings(prisma: DB = db) {\n  const [row] = await prisma\n    .insert(appSetting)\n    .values({ id: \"singleton\" })\n    .onConflictDoUpdate({ target: appSetting.id, set: { id: \"singleton\" } })\n    .returning();\n  return row;\n}\n\nexport async function setAppSettings(\n  data: {\n    intelModel?: string;\n    intelProvider?: string;\n    editor?: string;\n    currentFeatureId?: string | null;\n  },\n  prisma: DB = db,\n) {\n  const [row] = await prisma\n    .insert(appSetting)\n    .values({ id: \"singleton\", ...data })\n    .onConflictDoUpdate({ target: appSetting.id, set: data })\n    .returning();\n  return row;\n}\n","// Reliable feature matching for the map. Combines accent-folding, content-token\n// overlap (handles word reordering + filler words) and character-bigram similarity\n// (handles stems/typos/substrings), with confidence tiers so we only auto-flag on a\n// high-confidence unambiguous match and otherwise return candidates to disambiguate.\n\n// Filler words stripped before matching. The Portuguese set is intentional and functional —\n// it lets the matcher line up feature titles written in Portuguese (e.g. juriscan), NOT leftover\n// UI cruft, so don't \"clean it up\" as part of an English-only pass.\nconst STOP = new Set([\n  // English filler\n  \"a\", \"an\", \"the\", \"of\", \"for\", \"to\", \"and\", \"or\", \"in\", \"on\", \"with\", \"via\", \"by\",\n  \"using\", \"use\", \"add\", \"adds\", \"support\", \"implement\", \"implementation\", \"feature\",\n  \"new\", \"build\", \"create\",\n  // Portuguese filler\n  \"o\", \"os\", \"as\", \"um\", \"uma\", \"de\", \"da\", \"do\", \"das\", \"dos\", \"para\", \"por\", \"com\",\n  \"e\", \"ou\", \"no\", \"na\", \"nos\", \"nas\", \"ao\", \"aos\", \"adicionar\", \"implementar\",\n  \"suporte\", \"suportar\", \"nova\", \"novo\", \"funcionalidade\", \"usar\", \"usando\", \"criar\",\n]);\n\nfunction fold(s: string): string {\n  return s.normalize(\"NFD\").replace(/[̀-ͯ]/g, \"\");\n}\n\nfunction normExact(s: string): string {\n  return fold(s)\n    .toLowerCase()\n    .replace(/[^a-z0-9]+/g, \" \")\n    .trim()\n    .replace(/\\s+/g, \" \");\n}\n\nexport function contentTokens(s: string): string[] {\n  return normExact(s)\n    .split(\" \")\n    .filter((t) => t && !STOP.has(t));\n}\n\nfunction diceSets(a: Set<string>, b: Set<string>): number {\n  if (!a.size || !b.size) return 0;\n  let inter = 0;\n  for (const t of a) if (b.has(t)) inter++;\n  return (2 * inter) / (a.size + b.size);\n}\n\nfunction charBigrams(s: string): Set<string> {\n  const x = normExact(s).replace(/ /g, \"\");\n  const set = new Set<string>();\n  for (let i = 0; i < x.length - 1; i++) set.add(x.slice(i, i + 2));\n  return set;\n}\n\n/** 0..1 similarity between two feature titles. */\nexport function similarity(a: string, b: string): number {\n  const na = normExact(a);\n  const nb = normExact(b);\n  if (!na || !nb) return 0;\n  if (na === nb) return 1;\n  const tokenDice = diceSets(new Set(contentTokens(a)), new Set(contentTokens(b)));\n  const bigramDice = diceSets(charBigrams(a), charBigrams(b));\n  return Math.min(1, 0.7 * tokenDice + 0.4 * bigramDice);\n}\n\nexport interface Candidate {\n  id: string;\n  title: string;\n}\nexport interface Scored extends Candidate {\n  score: number;\n}\n\nexport function rankMatches(query: string, candidates: Candidate[]): Scored[] {\n  return candidates\n    .map((c) => ({ ...c, score: Math.round(similarity(query, c.title) * 100) / 100 }))\n    .sort((a, b) => b.score - a.score);\n}\n\nexport interface MatchOutcome {\n  /** A confident, unambiguous match — safe to act on automatically. */\n  best: Scored | null;\n  /** Plausible candidates to disambiguate (caller should pick one by id). */\n  candidates: Scored[];\n}\n\nexport function matchFeature(\n  query: string,\n  candidates: Candidate[],\n  opts: { confident?: number; consider?: number; margin?: number } = {},\n): MatchOutcome {\n  const confident = opts.confident ?? 0.72;\n  const consider = opts.consider ?? 0.5;\n  const margin = opts.margin ?? 0.1;\n\n  const ranked = rankMatches(query, candidates);\n  const top = ranked[0];\n  if (!top || top.score < consider) return { best: null, candidates: [] };\n\n  const runnerUp = ranked[1]?.score ?? 0;\n  const unambiguous = ranked.length === 1 || top.score - runnerUp >= margin;\n\n  if (top.score >= confident && unambiguous) return { best: top, candidates: [] };\n  return { best: null, candidates: ranked.filter((r) => r.score >= consider).slice(0, 4) };\n}\n","// Shared rule for proposed roadmap features: a feature node is only useful on the board if it\n// carries a category (cluster) and a priority — they drive grouping + ordering, and the user\n// shouldn't have to add them by hand every time. The propose-plan flow therefore REQUIRES both\n// and rejects a plan missing either, the same gate idea as \"a DB plan must ship structured\n// tables\". Pure (no db / no fs import) so BOTH the MCP server process and the /api/plan route\n// can call it.\n\nimport { matchFeature, type Candidate } from \"@/lib/match\";\n\nexport interface FeatureLike {\n  title: string;\n  cluster?: string | null;\n  // The agent + UI both call this \"category\", and \"domain\" is the adjacent word it reaches for.\n  // Accept all three as the same thing so a plan written with `category` isn't falsely rejected.\n  category?: string | null;\n  domain?: string | null;\n  priority?: number | null;\n}\n\n// The feature's category, accepting the `cluster` / `category` / `domain` aliases.\nexport function featureCategory(f: FeatureLike): string | null {\n  return f.cluster ?? f.category ?? f.domain ?? null;\n}\n\n// Returns an agent-facing rejection message when any feature is missing its category/priority,\n// or null when every feature is complete.\nexport function validateProposedFeatures(features: FeatureLike[]): string | null {\n  const gaps = features\n    .map((f) => {\n      const missing: string[] = [];\n      const category = featureCategory(f);\n      if (!category || !category.trim()) missing.push(\"category\");\n      if (f.priority == null) missing.push(\"priority\");\n      return missing.length\n        ? `  • \"${f.title?.trim() || \"(untitled)\"}\" — missing ${missing.join(\" + \")}`\n        : null;\n    })\n    .filter((x): x is string => x !== null);\n  if (gaps.length === 0) return null;\n  return (\n    \"⛔ Every roadmap feature needs a category AND a priority — they drive grouping and ordering \" +\n    \"on the board, and the user shouldn't have to add them by hand. Missing:\\n\" +\n    gaps.join(\"\\n\") +\n    \"\\n\\nRe-present with each feature carrying its category as `category` (or `cluster` — both \" +\n    \"work; e.g. AUTH, SEARCH, DATA, INTEL, BILLING …) and `priority` (0 = P0 critical, 1 = P1 \" +\n    \"high, 2 = P2 medium, 3 = P3 low). Set BOTH on EVERY feature; don't rely on defaults.\"\n  );\n}\n\nexport interface ExistingFeature {\n  id: string;\n  title: string;\n  cluster?: string | null;\n  status?: string | null;\n}\n\n/** Sorted, unique, non-empty category (cluster) names already on the roadmap — surfaced to the\n *  agent so it reuses an existing category instead of inventing a near-synonym. */\nexport function existingCategories(features: ExistingFeature[]): string[] {\n  const set = new Set<string>();\n  for (const f of features) {\n    const c = (f.cluster ?? \"\").trim();\n    if (c) set.add(c);\n  }\n  return [...set].sort();\n}\n\n/** Guard for creating a SINGLE roadmap feature on the loose paths (start_feature / add_subtasks),\n *  mirroring the propose_plan gate: a feature must carry a category and must not duplicate an\n *  existing one. Returns an agent-facing rejection message, or null when it's safe to create.\n *  Pure (no db) so the route + the MCP process share one rule. */\nexport function validateFeatureCreation(input: {\n  title: string;\n  category?: string | null;\n  existing: ExistingFeature[];\n}): string | null {\n  const title = (input.title ?? \"\").trim();\n  if (!title) return \"⛔ A feature needs a non-empty title.\";\n\n  const category = (input.category ?? \"\").trim();\n  if (!category) {\n    const cats = existingCategories(input.existing);\n    const reuse = cats.length\n      ? ` Reuse an existing category where it fits: ${cats.join(\", \")}.`\n      : \"\";\n    return (\n      `⛔ Feature \"${title}\" has no category. Every roadmap feature needs one — it drives grouping ` +\n      `and color on the board.${reuse} Pass it as \\`category\\` (e.g. AUTH, SEARCH, DATA, INTEL, ` +\n      `BILLING, INFRA …); don't rely on a default.`\n    );\n  }\n\n  const dup = matchFeature(\n    title,\n    input.existing.map((f) => ({ id: f.id, title: f.title })),\n  );\n  if (dup.best) {\n    const f = input.existing.find((e) => e.id === dup.best!.id);\n    const status = f?.status ? ` (${f.status})` : \"\";\n    return (\n      `⛔ \"${title}\" already exists as the feature \"${f?.title ?? dup.best.title}\"${status}. Don't ` +\n      `create a duplicate — mark progress on it with \\`beacon_start_feature({ id })\\`, add sub-tasks ` +\n      `with \\`beacon_add_subtasks\\`, or finish it with \\`beacon_describe_feature\\`.`\n    );\n  }\n  return null;\n}\n\n/** Dedup guard for a multi-feature plan (propose_plan / ExitPlanMode block): flags any proposed\n *  feature whose title confidently matches an EXISTING (non-draft) roadmap feature, so the agent\n *  reuses it instead of shadowing it. Returns a rejection message, or null when all are new. */\nexport function validateNoDuplicateFeatures(\n  features: { title: string }[],\n  existing: ExistingFeature[],\n): string | null {\n  const cands = existing.map((e) => ({ id: e.id, title: e.title }));\n  const dups = features\n    .map((f) => {\n      const m = matchFeature(f.title ?? \"\", cands);\n      return m.best ? { title: f.title, hit: existing.find((e) => e.id === m.best!.id)! } : null;\n    })\n    .filter((x): x is { title: string; hit: ExistingFeature } => x !== null);\n  if (!dups.length) return null;\n  return (\n    \"⛔ These proposed features already exist on the roadmap — reuse them instead of creating \" +\n    \"duplicates:\\n\" +\n    dups\n      .map((d) => `  • \"${d.title}\" → existing \"${d.hit.title}\"${d.hit.status ? ` (${d.hit.status})` : \"\"}`)\n      .join(\"\\n\") +\n    \"\\n\\nDrop the duplicate(s) from the plan; to add work to an existing feature, ship sub-tasks \" +\n    \"or update it via beacon_describe_feature. Keep only genuinely new features in the proposal.\"\n  );\n}\n\n/** Guard for the `front` param of beacon_start_feature: it must reference an EXISTING parent\n *  feature, NOT a domain label. Returns a rejection message, or null when front matches (or is\n *  empty — no front means the feature lands top-level, which is fine). */\nexport function validateFront(front: string, existingFronts: Candidate[]): string | null {\n  const f = (front ?? \"\").trim();\n  if (!f) return null;\n  const m = matchFeature(f, existingFronts);\n  if (m.best) return null;\n  const hint = m.candidates.length\n    ? ` Did you mean: ${m.candidates.map((c) => `\"${c.title}\"`).join(\", \")}?`\n    : \"\";\n  return (\n    `⛔ front \"${f}\" doesn't match an existing feature.${hint} \\`front\\` nests a feature UNDER an ` +\n    `existing parent feature — it is NOT a domain tag. If \"${f}\" is a domain, pass it as \\`category\\` ` +\n    `instead. If it's a real umbrella feature, create it first via beacon_propose_plan.`\n  );\n}\n","import { updateNodePosition } from \"@/lib/mutations\";\nimport { pinned } from \"@/lib/api-workspace\";\n\n// Lightweight, high-frequency endpoint for drag persistence. Writes x/y only and\n// returns 204 with no cache revalidation (positions don't change rendered data).\n// Pinned so the drag persists into the workspace the browser is viewing.\nexport const POST = pinned(\n  async (req: Request, { params }: { params: Promise<{ id: string }> }) => {\n    const { id } = await params;\n    try {\n      const { x, y } = await req.json();\n      await updateNodePosition(id, x, y);\n      return new Response(null, { status: 204 });\n    } catch {\n      return new Response(\"Invalid position\", { status: 400 });\n    }\n  },\n);\n","import {\n  AppRouteRouteModule,\n  type AppRouteRouteHandlerContext,\n  type AppRouteRouteModuleOptions,\n  type AppRouteUserlandModule,\n} from '../../server/route-modules/app-route/module.compiled'\nimport { RouteKind } from '../../server/route-kind'\nimport { patchFetch as _patchFetch } from '../../server/lib/patch-fetch'\nimport type { IncomingMessage, ServerResponse } from 'node:http'\nimport {\n  addRequestMeta,\n  getRequestMeta,\n  setRequestMeta,\n  type RequestMeta,\n} from '../../server/request-meta'\nimport { getTracer, type Span, SpanKind } from '../../server/lib/trace/tracer'\nimport { setManifestsSingleton } from '../../server/app-render/manifests-singleton'\nimport { normalizeAppPath } from '../../shared/lib/router/utils/app-paths'\nimport { NodeNextRequest, NodeNextResponse } from '../../server/base-http/node'\nimport {\n  NextRequestAdapter,\n  signalFromNodeResponse,\n} from '../../server/web/spec-extension/adapters/next-request'\nimport { BaseServerSpan } from '../../server/lib/trace/constants'\nimport { getRevalidateReason } from '../../server/instrumentation/utils'\nimport { sendResponse } from '../../server/send-response'\nimport {\n  fromNodeOutgoingHttpHeaders,\n  toNodeOutgoingHttpHeaders,\n} from '../../server/web/utils'\nimport { getCacheControlHeader } from '../../server/lib/cache-control'\nimport { INFINITE_CACHE, NEXT_CACHE_TAGS_HEADER } from '../../lib/constants'\nimport { NoFallbackError } from '../../shared/lib/no-fallback-error.external'\nimport {\n  CachedRouteKind,\n  type ResponseCacheEntry,\n  type ResponseGenerator,\n} from '../../server/response-cache'\nimport * as userland from 'VAR_USERLAND'\n\n// These are injected by the loader afterwards. This is injected as a variable\n// instead of a replacement because this could also be `undefined` instead of\n// an empty string.\ndeclare const nextConfigOutput: AppRouteRouteModuleOptions['nextConfigOutput']\n\n// We inject the nextConfigOutput here so that we can use them in the route\n// module.\n// INJECT:nextConfigOutput\n\nconst routeModule = new AppRouteRouteModule({\n  definition: {\n    kind: RouteKind.APP_ROUTE,\n    page: 'VAR_DEFINITION_PAGE',\n    pathname: 'VAR_DEFINITION_PATHNAME',\n    filename: 'VAR_DEFINITION_FILENAME',\n    bundlePath: 'VAR_DEFINITION_BUNDLE_PATH',\n  },\n  distDir: process.env.__NEXT_RELATIVE_DIST_DIR || '',\n  relativeProjectDir: process.env.__NEXT_RELATIVE_PROJECT_DIR || '',\n  resolvedPagePath: 'VAR_RESOLVED_PAGE_PATH',\n  nextConfigOutput,\n  // The static import is used for initialization (methods, dynamic, etc.).\n  userland: userland as AppRouteUserlandModule,\n  // In Turbopack dev mode, also provide a getter that calls require() on every\n  // request. This re-reads from devModuleCache so HMR updates are picked up,\n  // and the async wrapper unwraps async-module Promises (ESM-only\n  // serverExternalPackages) automatically.\n  ...(process.env.TURBOPACK && process.env.__NEXT_DEV_SERVER\n    ? {\n        getUserland: () => import('VAR_USERLAND'),\n      }\n    : {}),\n})\n\n// Pull out the exports that we need to expose from the module. This should\n// be eliminated when we've moved the other routes to the new format. These\n// are used to hook into the route.\nconst { workAsyncStorage, workUnitAsyncStorage, serverHooks } = routeModule\n\nfunction patchFetch() {\n  return _patchFetch({\n    workAsyncStorage,\n    workUnitAsyncStorage,\n  })\n}\n\nexport {\n  routeModule,\n  workAsyncStorage,\n  workUnitAsyncStorage,\n  serverHooks,\n  patchFetch,\n}\n\nexport async function handler(\n  req: IncomingMessage,\n  res: ServerResponse,\n  ctx: {\n    waitUntil?: (prom: Promise<void>) => void\n    requestMeta?: RequestMeta\n  }\n) {\n  if (ctx.requestMeta) {\n    setRequestMeta(req, ctx.requestMeta)\n  }\n  if (routeModule.isDev) {\n    addRequestMeta(req, 'devRequestTimingInternalsEnd', process.hrtime.bigint())\n  }\n  let srcPage = 'VAR_DEFINITION_PAGE'\n\n  // turbopack doesn't normalize `/index` in the page name\n  // so we need to to process dynamic routes properly\n  // TODO: fix turbopack providing differing value from webpack\n  if (process.env.TURBOPACK) {\n    srcPage = srcPage.replace(/\\/index$/, '') || '/'\n  } else if (srcPage === '/index') {\n    // we always normalize /index specifically\n    srcPage = '/'\n  }\n  const multiZoneDraftMode = process.env\n    .__NEXT_MULTI_ZONE_DRAFT_MODE as any as boolean\n\n  const prepareResult = await routeModule.prepare(req, res, {\n    srcPage,\n    multiZoneDraftMode,\n  })\n\n  if (!prepareResult) {\n    res.statusCode = 400\n    res.end('Bad Request')\n    ctx.waitUntil?.(Promise.resolve())\n    return null\n  }\n\n  const {\n    buildId,\n    deploymentId,\n    params,\n    nextConfig,\n    parsedUrl,\n    isDraftMode,\n    prerenderManifest,\n    routerServerContext,\n    isOnDemandRevalidate,\n    revalidateOnlyGenerated,\n    resolvedPathname,\n    clientReferenceManifest,\n    serverActionsManifest,\n  } = prepareResult\n\n  const normalizedSrcPage = normalizeAppPath(srcPage)\n\n  let isIsr = Boolean(\n    prerenderManifest.dynamicRoutes[normalizedSrcPage] ||\n      prerenderManifest.routes[resolvedPathname]\n  )\n\n  const render404 = async () => {\n    // TODO: should route-module itself handle rendering the 404\n    if (routerServerContext?.render404) {\n      await routerServerContext.render404(req, res, parsedUrl, false)\n    } else {\n      res.end('This page could not be found')\n    }\n    return null\n  }\n\n  if (isIsr && !isDraftMode) {\n    const isPrerendered = Boolean(prerenderManifest.routes[resolvedPathname])\n    const prerenderInfo = prerenderManifest.dynamicRoutes[normalizedSrcPage]\n\n    if (prerenderInfo) {\n      if (prerenderInfo.fallback === false && !isPrerendered) {\n        if (nextConfig.adapterPath) {\n          return await render404()\n        }\n        throw new NoFallbackError()\n      }\n    }\n  }\n\n  let cacheKey: string | null = null\n\n  if (isIsr && !routeModule.isDev && !isDraftMode) {\n    cacheKey = resolvedPathname\n    // ensure /index and / is normalized to one key\n    cacheKey = cacheKey === '/index' ? '/' : cacheKey\n  }\n\n  const supportsDynamicResponse: boolean =\n    // If we're in development, we always support dynamic HTML\n    routeModule.isDev === true ||\n    // If this is not SSG or does not have static paths, then it supports\n    // dynamic HTML.\n    !isIsr\n\n  // This is a revalidation request if the request is for a static\n  // page and it is not being resumed from a postponed render and\n  // it is not a dynamic RSC request then it is a revalidation\n  // request.\n  const isStaticGeneration = isIsr && !supportsDynamicResponse\n\n  // Before rendering (which initializes component tree modules), we have to\n  // set the reference manifests to our global store so Server Action's\n  // encryption util can access to them at the top level of the page module.\n  if (serverActionsManifest && clientReferenceManifest) {\n    setManifestsSingleton({\n      page: srcPage,\n      clientReferenceManifest,\n      serverActionsManifest,\n    })\n  }\n\n  const method = req.method || 'GET'\n  const tracer = getTracer()\n  const activeSpan = tracer.getActiveScopeSpan()\n  const isWrappedByNextServer = Boolean(\n    routerServerContext?.isWrappedByNextServer\n  )\n  const isMinimalMode = Boolean(getRequestMeta(req, 'minimalMode'))\n\n  const incrementalCache =\n    getRequestMeta(req, 'incrementalCache') ||\n    (await routeModule.getIncrementalCache(\n      req,\n      nextConfig,\n      prerenderManifest,\n      isMinimalMode\n    ))\n\n  incrementalCache?.resetRequestCache()\n  ;(globalThis as any).__incrementalCache = incrementalCache\n\n  const context: AppRouteRouteHandlerContext = {\n    params,\n    previewProps: prerenderManifest.preview,\n    renderOpts: {\n      experimental: {\n        authInterrupts: Boolean(nextConfig.experimental.authInterrupts),\n      },\n      cacheComponents: Boolean(nextConfig.cacheComponents),\n      supportsDynamicResponse,\n      incrementalCache,\n      cacheLifeProfiles: nextConfig.cacheLife,\n      waitUntil: ctx.waitUntil,\n      onClose: (cb) => {\n        res.on('close', cb)\n      },\n      onAfterTaskError: undefined,\n      onInstrumentationRequestError: (\n        error,\n        _request,\n        errorContext,\n        silenceLog\n      ) =>\n        routeModule.onRequestError(\n          req,\n          error,\n          errorContext,\n          silenceLog,\n          routerServerContext\n        ),\n    },\n    sharedContext: {\n      buildId,\n      deploymentId,\n    },\n  }\n  const nodeNextReq = new NodeNextRequest(req)\n  const nodeNextRes = new NodeNextResponse(res)\n\n  const nextReq = NextRequestAdapter.fromNodeNextRequest(\n    nodeNextReq,\n    signalFromNodeResponse(res)\n  )\n\n  try {\n    let parentSpan: Span | undefined\n    const invokeRouteModule = async (span?: Span) => {\n      return routeModule.handle(nextReq, context).finally(() => {\n        if (!span) return\n\n        span.setAttributes({\n          'http.status_code': res.statusCode,\n          'next.rsc': false,\n        })\n\n        const rootSpanAttributes = tracer.getRootSpanAttributes()\n        // We were unable to get attributes, probably OTEL is not enabled\n        if (!rootSpanAttributes) {\n          return\n        }\n\n        if (\n          rootSpanAttributes.get('next.span_type') !==\n          BaseServerSpan.handleRequest\n        ) {\n          console.warn(\n            `Unexpected root span type '${rootSpanAttributes.get(\n              'next.span_type'\n            )}'. Please report this Next.js issue https://github.com/vercel/next.js`\n          )\n          return\n        }\n\n        const route = rootSpanAttributes.get('next.route')\n        if (route) {\n          const name = `${method} ${route}`\n\n          span.setAttributes({\n            'next.route': route,\n            'http.route': route,\n            'next.span_name': name,\n          })\n          span.updateName(name)\n\n          // Propagate http.route to the parent span if one exists (e.g.\n          // a platform-created HTTP span in adapter deployments).\n          if (parentSpan && parentSpan !== span) {\n            parentSpan.setAttribute('http.route', route)\n            parentSpan.updateName(name)\n          }\n        } else {\n          span.updateName(`${method} ${srcPage}`)\n        }\n      })\n    }\n\n    const handleResponse = async (currentSpan?: Span) => {\n      const responseGenerator: ResponseGenerator = async ({\n        previousCacheEntry,\n      }) => {\n        try {\n          if (\n            !isMinimalMode &&\n            isOnDemandRevalidate &&\n            revalidateOnlyGenerated &&\n            !previousCacheEntry\n          ) {\n            res.statusCode = 404\n            // on-demand revalidate always sets this header\n            res.setHeader('x-nextjs-cache', 'REVALIDATED')\n            res.end('This page could not be found')\n            return null\n          }\n\n          const response = await invokeRouteModule(currentSpan)\n\n          ;(req as any).fetchMetrics = (context.renderOpts as any).fetchMetrics\n          let pendingWaitUntil = context.renderOpts.pendingWaitUntil\n\n          // Attempt using provided waitUntil if available\n          // if it's not we fallback to sendResponse's handling\n          if (pendingWaitUntil) {\n            if (ctx.waitUntil) {\n              ctx.waitUntil(pendingWaitUntil)\n              pendingWaitUntil = undefined\n            }\n          }\n          const cacheTags = context.renderOpts.collectedTags\n\n          // If the request is for a static response, we can cache it so long\n          // as it's not edge.\n          if (isIsr) {\n            const blob = await response.blob()\n\n            // Copy the headers from the response.\n            const headers = toNodeOutgoingHttpHeaders(response.headers)\n\n            if (cacheTags) {\n              headers[NEXT_CACHE_TAGS_HEADER] = cacheTags\n            }\n\n            if (!headers['content-type'] && blob.type) {\n              headers['content-type'] = blob.type\n            }\n\n            const revalidate =\n              typeof context.renderOpts.collectedRevalidate === 'undefined' ||\n              context.renderOpts.collectedRevalidate >= INFINITE_CACHE\n                ? false\n                : context.renderOpts.collectedRevalidate\n\n            const expire =\n              typeof context.renderOpts.collectedExpire === 'undefined' ||\n              context.renderOpts.collectedExpire >= INFINITE_CACHE\n                ? undefined\n                : context.renderOpts.collectedExpire\n\n            // Create the cache entry for the response.\n            const cacheEntry: ResponseCacheEntry = {\n              value: {\n                kind: CachedRouteKind.APP_ROUTE,\n                status: response.status,\n                body: Buffer.from(await blob.arrayBuffer()),\n                headers,\n              },\n              cacheControl: { revalidate, expire },\n            }\n\n            return cacheEntry\n          } else {\n            // send response without caching if not ISR\n            await sendResponse(\n              nodeNextReq,\n              nodeNextRes,\n              response,\n              context.renderOpts.pendingWaitUntil\n            )\n            return null\n          }\n        } catch (err) {\n          // if this is a background revalidate we need to report\n          // the request error here as it won't be bubbled\n          if (previousCacheEntry?.isStale) {\n            const silenceLog = false\n            await routeModule.onRequestError(\n              req,\n              err,\n              {\n                routerKind: 'App Router',\n                routePath: srcPage,\n                routeType: 'route',\n                revalidateReason: getRevalidateReason({\n                  isStaticGeneration,\n                  isOnDemandRevalidate,\n                }),\n              },\n              silenceLog,\n              routerServerContext\n            )\n          }\n          throw err\n        }\n      }\n\n      const cacheEntry = await routeModule.handleResponse({\n        req,\n        nextConfig,\n        cacheKey,\n        routeKind: RouteKind.APP_ROUTE,\n        isFallback: false,\n        prerenderManifest,\n        isRoutePPREnabled: false,\n        isOnDemandRevalidate,\n        revalidateOnlyGenerated,\n        responseGenerator,\n        waitUntil: ctx.waitUntil,\n        isMinimalMode,\n      })\n\n      // we don't create a cacheEntry for ISR\n      if (!isIsr) {\n        return null\n      }\n\n      if (cacheEntry?.value?.kind !== CachedRouteKind.APP_ROUTE) {\n        throw new Error(\n          `Invariant: app-route received invalid cache entry ${cacheEntry?.value?.kind}`\n        )\n      }\n\n      if (!isMinimalMode) {\n        res.setHeader(\n          'x-nextjs-cache',\n          isOnDemandRevalidate\n            ? 'REVALIDATED'\n            : cacheEntry.isMiss\n              ? 'MISS'\n              : cacheEntry.isStale\n                ? 'STALE'\n                : 'HIT'\n        )\n      }\n\n      // Draft mode should never be cached\n      if (isDraftMode) {\n        res.setHeader(\n          'Cache-Control',\n          'private, no-cache, no-store, max-age=0, must-revalidate'\n        )\n      }\n\n      const headers = fromNodeOutgoingHttpHeaders(cacheEntry.value.headers)\n\n      if (!(isMinimalMode && isIsr)) {\n        headers.delete(NEXT_CACHE_TAGS_HEADER)\n      }\n\n      // If cache control is already set on the response we don't\n      // override it to allow users to customize it via next.config\n      if (\n        cacheEntry.cacheControl &&\n        !res.getHeader('Cache-Control') &&\n        !headers.get('Cache-Control')\n      ) {\n        headers.set(\n          'Cache-Control',\n          getCacheControlHeader(cacheEntry.cacheControl)\n        )\n      }\n\n      await sendResponse(\n        nodeNextReq,\n        nodeNextRes,\n        // @ts-expect-error - Argument of type 'Buffer<ArrayBufferLike>' is not assignable to parameter of type 'BodyInit | null | undefined'.\n        new Response(cacheEntry.value.body, {\n          headers,\n          status: cacheEntry.value.status || 200,\n        })\n      )\n      return null\n    }\n\n    // TODO: activeSpan code path is for when wrapped by\n    // next-server can be removed when this is no longer used\n    if (isWrappedByNextServer && activeSpan) {\n      await handleResponse(activeSpan)\n    } else {\n      parentSpan = tracer.getActiveScopeSpan()\n      await tracer.withPropagatedContext(\n        req.headers,\n        () =>\n          tracer.trace(\n            BaseServerSpan.handleRequest,\n            {\n              spanName: `${method} ${srcPage}`,\n              kind: SpanKind.SERVER,\n              attributes: {\n                'http.method': method,\n                'http.target': req.url,\n              },\n            },\n            handleResponse\n          ),\n        undefined,\n        !isWrappedByNextServer\n      )\n    }\n  } catch (err) {\n    if (!(err instanceof NoFallbackError)) {\n      const silenceLog = false\n      await routeModule.onRequestError(\n        req,\n        err,\n        {\n          routerKind: 'App Router',\n          routePath: normalizedSrcPage,\n          routeType: 'route',\n          revalidateReason: getRevalidateReason({\n            isStaticGeneration,\n            isOnDemandRevalidate,\n          }),\n        },\n        silenceLog,\n        routerServerContext\n      )\n    }\n\n    // rethrow so that we can handle serving error page\n\n    // If this is during static generation, throw the error again.\n    if (isIsr) throw err\n\n    // Otherwise, send a 500 response.\n    await sendResponse(\n      nodeNextReq,\n      nodeNextRes,\n      new Response(null, { status: 500 })\n    )\n    return null\n  }\n}\n"],"names":["pinned","handler","req","rest","id","pipelinePromise","getEmbedder","pipeline","catch","e","embedText","text","trimmed","trim","embedder","out","pooling","normalize","Array","from","data","console","error","Error","message","nodeEmbeddingInput","node","title","role","plain","cluster","filter","Boolean","join","cosineSimilarity","a","b","length","dot","normA","normB","i","Math","sqrt","encodeVector","v","JSON","stringify","decodeVector","raw","parsed","parse","isArray","some","x","Number","isFinite","reembedNode","db","eq","row","query","findFirst","where","t","eqf","columns","vec","update","set","embedding","rankByQuery","candidates","queryVec","scored","item","push","score","sort","getAppSettings","prisma","insert","values","onConflictDoUpdate","target","returning","setAppSettings","STOP","Set","fold","s","replace","normExact","toLowerCase","contentTokens","split","has","diceSets","size","inter","charBigrams","add","slice","similarity","na","nb","tokenDice","bigramDice","min","rankMatches","map","c","round","matchFeature","opts","confident","consider","margin","ranked","top","best","runnerUp","unambiguous","r","featureCategory","f","category","domain","validateProposedFeatures","features","gaps","missing","priority","existingCategories","validateFeatureCreation","input","cats","existing","reuse","dup","find","status","validateNoDuplicateFeatures","cands","dups","m","hit","d","validateFront","front","existingFronts","hint","POST","params","y","json","Response","AppRouteRouteModule","RouteKind","patchFetch","_patchFetch","addRequestMeta","getRequestMeta","setRequestMeta","getTracer","SpanKind","setManifestsSingleton","normalizeAppPath","NodeNextRequest","NodeNextResponse","NextRequestAdapter","signalFromNodeResponse","BaseServerSpan","getRevalidateReason","sendResponse","fromNodeOutgoingHttpHeaders","toNodeOutgoingHttpHeaders","getCacheControlHeader","INFINITE_CACHE","NEXT_CACHE_TAGS_HEADER","NoFallbackError","CachedRouteKind","userland","routeModule","definition","kind","APP_ROUTE","page","pathname","filename","bundlePath","distDir","process","env","__NEXT_RELATIVE_DIST_DIR","relativeProjectDir","__NEXT_RELATIVE_PROJECT_DIR","resolvedPagePath","nextConfigOutput","TURBOPACK","__NEXT_DEV_SERVER","getUserland","workAsyncStorage","workUnitAsyncStorage","serverHooks","res","ctx","requestMeta","isDev","hrtime","bigint","srcPage","multiZoneDraftMode","__NEXT_MULTI_ZONE_DRAFT_MODE","prepareResult","prepare","statusCode","end","waitUntil","Promise","resolve","buildId","deploymentId","nextConfig","parsedUrl","isDraftMode","prerenderManifest","routerServerContext","isOnDemandRevalidate","revalidateOnlyGenerated","resolvedPathname","clientReferenceManifest","serverActionsManifest","normalizedSrcPage","isIsr","dynamicRoutes","routes","render404","isPrerendered","prerenderInfo","fallback","adapterPath","cacheKey","supportsDynamicResponse","isStaticGeneration","method","tracer","activeSpan","getActiveScopeSpan","isWrappedByNextServer","isMinimalMode","incrementalCache","getIncrementalCache","resetRequestCache","globalThis","__incrementalCache","context","previewProps","preview","renderOpts","experimental","authInterrupts","cacheComponents","cacheLifeProfiles","cacheLife","onClose","cb","on","onAfterTaskError","undefined","onInstrumentationRequestError","_request","errorContext","silenceLog","onRequestError","sharedContext","nodeNextReq","nodeNextRes","nextReq","fromNodeNextRequest","parentSpan","invokeRouteModule","span","handle","finally","setAttributes","rootSpanAttributes","getRootSpanAttributes","get","handleRequest","warn","route","name","updateName","setAttribute","handleResponse","currentSpan","cacheEntry","responseGenerator","previousCacheEntry","setHeader","response","fetchMetrics","pendingWaitUntil","cacheTags","collectedTags","blob","headers","type","revalidate","collectedRevalidate","expire","collectedExpire","value","body","Buffer","arrayBuffer","cacheControl","err","isStale","routerKind","routePath","routeType","revalidateReason","routeKind","isFallback","isRoutePPREnabled","isMiss","delete","getHeader","withPropagatedContext","trace","spanName","SERVER","attributes","url"],"mappings":"uCAAA,IAAA,EAAA,EAAA,CAAA,CAAA,uBAeO,SACLC,AADcD,CACqD,EAEnE,OAAO,MAAOE,EAAK,GAAGC,KACpB,IAAMC,EAAK,MAAM,CAAA,EAAA,EAAA,yBAAA,AAAyB,EAACF,GAE3C,OADIE,GAAI,MAAM,CAAA,EAAA,EAAA,iBAAA,AAAiB,EAACA,GACzB,CAAA,EAAA,EAAA,gBAAgB,AAAhB,EAAiBA,EAAI,SAAYH,EAAQC,KAAQC,GAC1D,CACF,4BCZA,IAAIE,EAA6D,KAEjE,eAAeC,IAeb,OAdI,AAACD,IACHA,EAAkB,CAAC,UADC,AAElB,GAAM,UAAEE,CAAQ,CAAE,CAAG,MAAA,EAAA,CAAA,CAAA,OAGrB,OAAQ,MAAMA,EACZ,qBACA,2BAEJ,CAAC,GAAIC,KAAK,CAAC,AAACC,IAEV,MADAJ,EAAkB,KACZI,CADkB,AAE1B,EAAA,EAEKJ,CACT,CAGO,eAAeK,EAAUC,CAAY,EAC1C,IAAMC,EAAUD,EAAKE,IAAI,GACzB,GAAI,CAACD,EAAS,AAV6D,OAUtD,KACrB,GAAI,CACF,IAAME,EAAW,MAAMR,IACjBS,EAAM,MAAMD,EAASF,EAAS,CAAEI,QAAS,OAAQC,WAAW,CAAK,GACvE,OAAOC,MAAMC,IAAI,CAACJ,EAAIK,IAAI,CAC5B,CAAE,MAAOX,EAAG,CAEV,OADAY,QAAQC,KAAK,CAAC,uBAAwBb,aAAac,MAAQd,EAAEe,OAAO,CAAGf,GAChE,IACT,CACF,CAGO,SAASgB,EAAmBC,CAKlC,EACC,MAAO,CAACA,EAAKC,KAAK,CAAED,EAAKE,IAAI,CAAEF,EAAKG,KAAK,CAAEH,EAAKI,OAAO,CAAC,CAACC,MAAM,CAACC,SAASC,IAAI,CAAC,KAChF,CAiBO,SAASW,EAAaC,CAAW,EACtC,OAAOC,KAAKC,SAAS,CAACF,EACxB,CAkBO,eAAeY,EAAYrD,CAAU,EAC1C,GAAI,CACF,GAAM,IAAEsD,CAAE,CAAE,CAAG,MAAA,EAAA,CAAA,CAAA,OACT,MAAEhC,CAAI,CAAE,CAAG,MAAA,EAAA,CAAA,CAAA,OACX,IAAEiC,CAAE,CAAE,CAAG,MAAA,EAAA,CAAA,CAAA,OACTC,EAAM,MAAMF,EAAGG,KAAK,CAACnC,IAAI,CAACoC,SAAS,CAAC,CACxCC,MAAO,CAACC,EAAG,CAAEL,GAAIM,CAAG,CAAE,GAAKA,EAAID,EAAE5D,EAAE,CAAEA,GACrC8D,QAAS,CAAEvC,OAAO,EAAMC,KAAM,GAAMC,OAAO,EAAMC,SAAS,CAAK,CACjE,GACA,GAAI,CAAC8B,EAAK,OACV,IAAMO,EAAM,MAAMzD,EAAUe,EAAmBmC,IAC/C,GAAI,CAACO,EAAK,MACV,OAAMT,EAAGU,MAAM,CAAC1C,GAAM2C,GAAG,CAAC,CAAEC,UAAW1B,EAAauB,EAAK,GAAGJ,KAAK,CAACJ,EAAGjC,EAAKtB,EAAE,CAAEA,GAChF,CAAE,MAAOK,EAAG,CACVY,QAAQC,KAAK,CAAC,+BAAgClB,EAAIK,aAAac,MAAQd,EAAEe,OAAO,CAAGf,EACrF,CACF,CAGO,eAAe8D,EACpBV,CAAa,CACbW,CAAe,EAEf,IAAMC,EAAW,MAAM/D,EAAUmD,GACjC,GAAI,CAACY,EAAU,OAAO,KACtB,IAAMC,EAA4C,EAAE,CACpD,IAAK,IAAMC,KAAQH,EAAY,CAC7B,IAAM3B,EA3CH,AA2COG,SA3CEA,AAAaC,CAA8B,EACzD,GAAI,CAACA,EAAK,OAAO,KACjB,GAAI,CACF,IAAMC,EAASJ,KAAKK,KAAK,CAACF,GAC1B,GAAI,CAAC/B,MAAMkC,OAAO,CAACF,IACfA,EAAOG,IAAI,CAAC,AAACC,GAAmB,UAAb,OAAOA,GAAkB,CAACC,OAAOC,QAAQ,CAACF,IADrC,CAC0C,MADnC,CAC0C,IAC7E,OAAOJ,CACT,CAAE,KAAM,CACN,OAAO,IACT,CACF,EAiC2ByB,EAAKL,SAAS,EAChCzB,GAAG,AACR6B,EAAOE,IAAI,CAAC,MAAED,EAAME,MA/DjB,AA+DwB3C,SA/DfA,AAAiBC,CAAW,CAAEC,CAAW,EACvD,GAAID,EAAEE,MAAM,GAAKD,EAAEC,MAAM,CAAE,OAAO,EAClC,IAAIC,EAAM,EACNC,EAAQ,EACRC,EAAQ,EACZ,IAAK,IAAIC,EAAI,EAAGA,EAAIN,EAAEE,MAAM,CAAEI,IAAK,AACjCH,GAAOH,CAAC,CAACM,EAAE,CAAGL,CAAC,CAACK,EAAE,CAClBF,GAASJ,CAAC,CAACM,EAAE,CAAGN,CAAC,CAACM,EAAE,CACpBD,GAASJ,CAAC,CAACK,EAAE,CAAGL,CAAC,CAACK,EAAE,QAER,AAAd,IAAIF,GAAyB,GAAG,CAAbC,EAAoB,EAChCF,GAAOI,GAAD,EAAMC,IAAI,CAACJ,GAASG,KAAKC,IAAI,CAACH,EAAAA,CAAM,AACnD,EAmDgDiC,EAAU5B,EAAG,EAC3D,CAEA,OADA6B,EAAOI,IAAI,CAAC,CAAC3C,EAAGC,IAAMA,EAAEyC,KAAK,CAAG1C,EAAE0C,KAAK,EAChCH,CACT,uIC3HA,IAAA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,gBAEO,eAAeK,EAAeC,EAAa,EAAA,EAAE,EAClD,GAAM,CAACpB,EAAI,CAAG,MAAMoB,EACjBC,MAAM,CAAC,EAAA,UAAU,EACjBC,MAAM,CAAC,CAAE9E,GAAI,WAAY,GACzB+E,kBAAkB,CAAC,CAAEC,OAAQ,EAAA,UAAU,CAAChF,EAAE,CAAEiE,IAAK,CAAEjE,GAAI,WAAY,CAAE,GACrEiF,SAAS,GACZ,OAAOzB,CACT,CAEO,eAAe0B,EACpBlE,CAKC,CACD4D,EAAa,EAAA,EAAE,EAEf,GAAM,CAACpB,EAAI,CAAG,MAAMoB,EACjBC,MAAM,CAAC,EAAA,UAAU,EACjBC,MAAM,CAAC,CAAE9E,GAAI,YAAa,GAAGgB,CAAI,AAAC,GAClC+D,kBAAkB,CAAC,CAAEC,OAAQ,EAAA,UAAU,CAAChF,EAAE,CAAEiE,IAAKjD,CAAK,GACtDiE,SAAS,GACZ,OAAOzB,CACT,0HCnBA,IAAM2B,EAAO,IAAIC,IAAI,CAEnB,IAAK,KAAM,MAAO,KAAM,MAAO,KAAM,MAAO,KAAM,KAAM,KAAM,OAAQ,MAAO,KAC7E,QAAS,MAAO,MAAO,OAAQ,UAAW,YAAa,iBAAkB,UACzE,MAAO,QAAS,SAEhB,IAAK,KAAM,KAAM,KAAM,MAAO,KAAM,KAAM,KAAM,MAAO,MAAO,OAAQ,MAAO,MAC7E,IAAK,KAAM,KAAM,KAAM,MAAO,MAAO,KAAM,MAAO,YAAa,cAC/D,UAAW,WAAY,OAAQ,OAAQ,iBAAkB,OAAQ,SAAU,QAC5E,EAMD,SAASI,EAAUF,CAAS,EAC1B,OAJOA,AAIAD,AAAKC,EAJHzE,SAAS,CAAC,OAAO0E,OAAO,CAAC,SAAU,IAKzCE,WAAW,GACXF,OAAO,CAAC,cAAe,KACvB9E,IAAI,GACJ8E,OAAO,CAAC,OAAQ,IACrB,CAEO,SAASG,EAAcJ,CAAS,EACrC,OAAOE,EAAUF,GACdK,KAAK,CAAC,KACNhE,MAAM,CAAC,AAACiC,GAAMA,GAAK,CAACuB,EAAKS,GAAG,CAAChC,GAClC,CAEA,SAASiC,EAAS9D,CAAc,CAAEC,CAAc,EAC9C,GAAI,CAACD,EAAE+D,IAAI,EAAI,CAAC9D,EAAE8D,IAAI,CAAE,OAAO,EAC/B,IAAIC,EAAQ,EACZ,IAAK,IAAMnC,KAAK7B,EAAG,AAAIC,EAAE4D,GAAG,CAAChC,IAAImC,IACjC,OAAQ,EAAIA,GAAUhE,EAAE+D,GAAH,CAAO,CAAG9D,EAAE8D,IAAAA,AAAI,CACvC,CAEA,SAASE,EAAYV,CAAS,EAC5B,IAAMpC,EAAIsC,EAAUF,GAAGC,OAAO,CAAC,KAAM,IAC/BtB,EAAM,IAAImB,IAChB,IAAK,IAAI/C,EAAI,EAAGA,EAAIa,EAAEjB,MAAM,CAAG,EAAGI,IAAK4B,EAAIgC,GAAG,CAAC/C,EAAEgD,KAAK,CAAC7D,EAAGA,EAAI,IAC9D,OAAO4B,CACT,uBAkCO,SAAS4C,AACdpD,CAAa,CACbW,CAAuB,CACvB0C,EAAmE,CAAC,CAAC,EAErE,IAAMC,EAAYD,EAAKC,SAAS,EAAI,IAC9BC,EAAWF,EAAKE,QAAQ,EAAI,GAC5BC,EAASH,EAAKG,MAAM,EAAI,GAExBC,EAA4B9C,AArB3BA,EACJsC,GAAG,CAAC,AAACC,CAoBOF,GApBD,IApBW1E,CAAS,iBAoBnB,CAAE,GAAG4E,CAAC,CAAElC,MAAOnC,KAAKsE,KAAK,CAACT,AAA6B,OAoB3C1C,EAxCSzB,CAAS,CAoBOyB,AAAOkD,EAAEpF,KAAK,CAnB5D6E,EAAKZ,EAAUzD,GACfsE,EAAKb,EAAUxD,GACrB,AAAI,AAACoE,GAAOC,EACRD,CADO,CAAK,EACLC,EAAW,EAAP,AAGR/D,KAAKkE,GAAG,CAAC,EAAG,GAFDX,EAAS,CAEFS,GAFMlB,IAAIM,EAAc3D,IAAK,IAAIqD,IAAIM,EAAc1D,KAEvC,GADlB6D,EAASG,CACeO,CADHxE,GAAIiE,EAAYhE,KAHjC,IAiBsD,GAAI,CAAC,GAC/E0C,IAAI,CAAC,CAAC3C,EAAGC,IAAMA,EAAEyC,KAAK,CAAG1C,EAAE0C,KAAK,EAoB7B0C,EAAMD,CAAM,CAAC,EAAE,CACrB,GAAI,CAACC,GAAOA,EAAI1C,KAAK,CAAGuC,EAAU,MAAO,CAAEI,KAAM,KAAMhD,WAAY,EAAE,AAAC,EAEtE,IAAMiD,EAAWH,CAAM,CAAC,EAAE,EAAEzC,OAAS,EAC/B6C,EAAgC,IAAlBJ,EAAOjF,MAAM,EAAUkF,EAAI1C,KAAK,CAAG4C,GAAYJ,SAE/DE,AAAJ,EAAQ1C,KAAK,EAAIsC,GAAaO,EAAoB,CAAEF,KAAMD,EAAK/C,GAApB,QAAgC,EAAE,AAAC,EACvE,CAAEgD,KAAM,KAAMhD,WAAY8C,EAAOvF,MAAM,CAAC,AAAC4F,GAAMA,EAAE9C,KAAK,EAAIuC,GAAUd,KAAK,CAAC,EAAG,EAAG,CACzF,4BC9FA,IAAA,EAAA,EAAA,CAAA,CAAA,wCAgEO,SAASgC,AAAwBC,CAIvC,EACC,IAAM5G,EAAQ,CAAC4G,EAAM5G,KAAK,EAAI,EAAA,CAAE,CAAEd,IAAI,GACtC,GAAI,CAACc,EAAO,MAAO,uCAGnB,GAAI,CAACmG,AADY,CAACS,EAAMT,QAAQ,EAAI,EAAA,CAAE,CAAEjH,IAAI,GAC7B,CACb,IAAM2H,EAvBH,AAuBUH,SAvBDA,AAAmBJ,CAA2B,EAC5D,IAAM5D,EAAM,IAAImB,IAChB,IAAK,IAAMqC,KAAKI,EAAU,CACxB,IAAMlB,EAAI,AAACc,GAAE/F,OAAO,EAAI,EAAA,CAAE,CAAEjB,IAAI,GAC5BkG,GAAG1C,EAAIgC,GAAG,CAACU,EACjB,CACA,MAAO,IAAI1C,EAAI,CAACS,IAAI,EACtB,EAgBoCyD,EAAME,QAAQ,EACxCC,EAAQF,EAAKnG,MAAM,CACrB,CAAC,2CAA2C,EAAEmG,EAAKvG,IAAI,CAAC,MAAM,CAAC,CAAC,CAChE,GACJ,MACE,CAAC,WAAW,EAAEN,EACb,IADmB,wEAAwE,mBACpE,EAAE+G,EAAM,qGAA0D,CADG,AACF,AAG/F,CAEA,EALI,AACA,CAAC,CAICC,EAAM,CAAA,EAAA,EAAA,YAAA,AAAY,EACtBhH,EACA4G,EAAME,QAAQ,CAAC3B,GAAG,CAAC,AAACe,IAAM,AAAC,AANmB,CAMjBzH,AANkB,GAMdyH,EAAEzH,EAAE,CAAEuB,MAAOkG,EAAElG,KAAK,CAAC,CAAC,GAEzD,GAAIgH,EAAInB,IAAI,CAAE,CACZ,IAAMK,EAAIU,EAAME,QAAQ,CAACG,IAAI,CAAEnI,AAAD,GAAOA,EAAEL,EAAE,GAAKuI,EAAInB,IAAI,CAAEpH,EAAE,EACpDyI,EAAShB,GAAGgB,OAAS,CAAC,EAAE,EAAEhB,EAAEgB,MAAM,CAAC,CAAC,CAAC,CAAG,GAC9C,MACE,CAAC,GAAG,EAAElH,EAAM,iCAAiC,EAAEkG,GAAGlG,OAASgH,EAAInB,IAAI,CAAC7F,KAAK,CAAC,CAAC,EAAEkH,EAAO,kLAAQ,CAIhG,AAJiG,CAKjG,EAJI,CAAC,IAIE,IACT,oBA+BO,SAASO,AAAcC,CAAa,CAAEC,CAA2B,EACtE,IAAMzB,EAAI,CAACwB,GAAS,EAAA,CAAE,CAAExI,IAAI,GAC5B,GAAI,CAACgH,EAAG,OAAO,KACf,IAAMoB,EAAI,CAAA,EAAA,EAAA,EAvCyF,CAAC,GAChG,CAAC,KAsCK,AAAY,EAACpB,EAAGyB,GAC1B,GAAIL,EAAEzB,IAAI,CAAE,OAAO,KACnB,IAAM+B,EAAON,EAAEzE,UAAU,CAACnC,MAAM,CAC5B,CAAC,eAzC4E,AAyC7D,CAzC8D,CAyC5D4G,EAAEzE,UAAU,CAACsC,GAAG,CAAC,AAACC,GAAM,CAAC,CAAC,EAAEA,EAAEpF,KAAK,CAAC,CAAC,CAAC,EAAEM,IAAI,CAAC,MAAM,CAAC,CAAC,CACvE,GACJ,MACE,CAAC,SAAS,EAAE4F,EAAE,oCAAoC,EAAE0B,EACnD,GADwD,oCAAoC,mDACtC,EAAE1B,EAAE,yHAAuC,CAAC,AADL,AAIlG,GAHI,AACA,CAAC,8BArCE,SAASiB,AACdb,CAA6B,CAC7BQ,CAA2B,EAE3B,IAAMM,EAAQN,EAAS3B,GAAG,CAAC,AAACrG,IAAM,AAAC,CAAEL,GAAIK,EAAEL,EAAE,CAAEuB,MAAOlB,EAAEkB,KAAK,AAiCwB,CAjCvB,AAiCwB,CAjCvB,EACzDqH,EAAOf,EACVnB,GAAG,CAAC,AAACe,IACJ,IAAMoB,EAAI,CAAA,EAAA,EAAA,YAAA,AAAY,EAACpB,EAAElG,KAAK,EAAI,GAAIoH,GACtC,OAAOE,EAAEzB,IAAI,CAAG,CAAE7F,MAAOkG,EAAElG,KAAK,CAAEuH,IAAKT,EAASG,IAAI,CAAC,AAACnI,GAAMA,EAAEL,EAAE,GAAK6I,EAAEzB,IAAI,CAAEpH,EAAE,CAAG,EAAI,IACxF,GACC2B,MAAM,CAAC,AAACuB,GAAoDA,AAAM,iBACrE,AAAK0F,EAAK3G,EAAN,IAAY,CAEd,CAFgB,4FAGhB,WACA2G,EACGlC,GAAG,CAAC,AAACqC,GAAM,CAAC,KAAK,EAAEA,EAAExH,KAAK,CAAC,cAAc,EAAEwH,EAAED,GAAG,CAACvH,KAAK,CAAC,CAAC,EAAEwH,EAAED,GAAG,CAACL,MAAM,CAAG,CAAC,EAAE,EAAEM,EAAED,GAAG,CAACL,MAAM,CAAC,CAAC,CAAC,CAAG,GAAA,CAAI,EACpG5G,IAAI,CAAC,QACR,iGACA,uFARuB,IAU3B,+BA1GO,SAAS+F,AAAyBC,CAAuB,EAC9D,IAAMC,EAAOD,EACVnB,GAAG,CAAC,AAACe,IACJ,IAAMM,EAAoB,EAAE,CACtBL,EATHD,EAAE/F,OAAO,AASK8F,EATDC,EAAEC,QAAQ,EAAID,AASGA,EATDE,MAAM,EAAI,KAY1C,OAFI,AAACD,GAAaA,EAASjH,IAAI,GAAd,CAAkBsH,EAAQvD,IAAI,CAAC,YAC9B,MAAdiD,EAAEO,QAAQ,EAAUD,EAAQvD,IAAI,CAAC,YAC9BuD,EAAQ9F,MAAM,CACjB,CAAC,KAAK,EAAEwF,EAAElG,KAAK,EAAEd,QAAU,aAAa,YAAY,EAAEsH,EAAQlG,IAAI,CAAC,OAAA,CAAQ,CAC3E,IACN,GACCF,MAAM,CAAC,AAACuB,GAAyB,OAANA,UAC9B,AAAoB,GAAG,CAAnB4E,EAAK7F,MAAM,CAAe,4KAI5B6F,EAAKjG,IAAI,CAAC,MAFV,EAGA,8FAFA,CAGA,8FACA,0EAEJ,kCC/CA,IAAA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,yCAKO,IAAMuH,EAAO,CAAA,EAAA,EAAA,MAAM,AAAN,EAClB,MAAOtJ,EAAc,QAAEuJ,CAAM,CAAuC,IAClE,GAAM,IAAErJ,CAAE,CAAE,CAAG,MAAMqJ,EACrB,GAAI,CACF,GAAM,CAAEnG,GAAC,GAAEoG,CAAC,CAAE,CAAG,MAAMxJ,EAAIyJ,IAAI,GAE/B,OADA,MAAM,CAAA,EAAA,EAAA,kBAAA,AAAkB,EAACvJ,EAAIkD,EAAGoG,GACzB,IAAIE,SAAS,KAAM,CAAEf,OAAQ,GAAI,EAC1C,CAAE,KAAM,CACN,OAAO,IAAIe,SAAS,mBAAoB,CAAEf,OAAQ,GAAI,EACxD,CACF,2EChBF,IAAA,EAKO,EAAA,CAJLgB,AAIK,CAAA,OACP,EAA0B,EAAyB,CAA1CC,AAA0C,CAAA,GAAA,EAL9B,EAMrB,CADkB,CACwB,AAFmB,EAEnB,CAAjCC,AAAiC,CAFnC,AAEmC,GADhB,CAC8C,GAExE,EAGEI,EAEK,CAJLF,AAIK,CAPgBD,AAOhB,MAFS,CAGhB,EAA+C,EARb,AAQa,CAAtCI,AAAqE,CAL9D,AAK8D,CADvE,CAHLF,IAJwC,CAS1C,CADkB,CADgB,AAEI,CADPG,CACO,CAA7BC,AAA6B,CAAA,GALtB,EAIuB,AAHrCH,EAKF,EAAiC,EAAA,CAAxBI,AAAwB,CAFc,AAEd,EADkD,IACT,CAC1E,AAF8B,EAEY,EAAQ,CAAzCC,AAAyC,CAAA,CAAA,CADzB,AADa,KAGtC,EAEEG,CAJ+B,CAC8C,AAIxE,CAFLD,AAEK,CAAA,CAJiB,CAGA,CAHED,IAK1B,EAA+B,CADxB,CAC0D,CAAxDG,AAAwD,CAAA,IAH7C,EAClBD,AAHwC,CAM1C,EAAoC,EAAA,CAA3BE,AAA2B,CADb,AACa,IAD6B,AACO,GACxE,CAF+B,CAEF,EAA4B,CAAA,AAAhDC,CAAgD,KAD7B,EAE5B,AAJ8D,EAM5DE,AAHuD,EAG9B,AAHN,CAEnBD,AACyB,CAAA,AAJS,EAK7B,IAJsB,CAK7B,EAAsC,EAAA,CAAA,AAA7BE,CAA6B,CAFX,CAE2C,KACtE,EAAyBE,EAAsB,AAAQ,CAA9CD,AAA8C,CAAA,AAJ1B,CAEE,CAD7BF,IAGqD,CACvD,AAF8B,CAC8C,CAC5C,EAAA,CAAA,AAAvBI,CAAuB,AADT,EADe,AACbD,OACoD,KAArD,IACxB,IAAA,AADgC,EAKzB,EAA6B,CAHlCE,AAGkC,CAAA,KACpC,EAAwC,EAAA,CAAA,CAAA,EAA5BC,CAJK,CAGmB,OAA7B,KACmB,eAAc,SAWxC,IAAMC,EAAc,IAAI1B,EAAAA,mBAAAA,CAAoB,CAC1C2B,WAAY,CACVC,KAAM3B,EAAAA,SAAAA,CAAU4B,SAAS,CACzBC,KAAM,iCACNC,SAAU,2BACVC,SAAU,QACVC,WAAY,EACd,EACAC,QAAqBG,CAAZF,EAAoC,KAC7CG,CADiBF,GAAG,AAA6B,CAA5BC,cAC0C,CAA3CF,EACpBK,MAD4BJ,GAAG,CAACG,OACd,oBADyC,6BAE3DE,iBAbF,CAA0B,EAexBhB,SAAUA,EAKV,GAAIU,AAIA,CAAC,CAAC,AACR,GAKM,GAVQC,GAAG,CAACM,SAAS,EAUnBG,CAAgB,CAVOV,QAAQC,GAAG,CAACO,CACrC,QASoBG,CAAoB,OAVc,MAUZC,CAAW,CAAE,CAAGrB,EAiBzD,eAAetL,EACpBC,CAAoB,CACpB2M,CAAmB,CACnBC,CAGC,EAEGA,EAAIC,WAAW,EAAE,GACnB5C,EAAAA,cAAAA,EAAejK,EAAK4M,EAAIC,WAAW,EAEjCxB,EAAYyB,KAAK,EAAE,GACrB/C,EAAAA,cAAAA,EAAe/J,EAAK,+BAAgC8L,QAAQiB,MAAM,CAACC,MAAM,IAE3E,IAAIC,EAAU,iCAMZA,EAAUA,EAAQxH,OAAO,CAAC,WAAY,KAAO,IAQ/C,IAAM2H,EAAgB,MAAM/B,EAAYgC,OAAO,CAACrN,EAAK2M,EAAK,SACxDM,EACAC,mBAJCC,CAAAA,CAKH,GAEA,GAAI,AAP2B,CAO1BC,EAIH,OAHAT,EAAIW,IADc,MACJ,CAAG,IACjBX,EAAIY,GAAG,CAAC,eACK,MAAbX,CAAa,CAATY,IAAS,KAAA,EAAbZ,EAAIY,SAAS,CAAA,IAAA,CAAbZ,EAAgBa,QAAQC,OAAO,IACxB,KAGT,GAAM,SACJC,CAAO,cACPC,CAAY,QACZrE,CAAM,YACNsE,CAAU,WACVC,CAAS,CACTC,aAAW,CACXC,mBAAiB,CACjBC,qBAAmB,sBACnBC,CAAoB,yBACpBC,CAAuB,kBACvBC,CAAgB,yBAChBC,CAAuB,CACvBC,uBAAqB,CACtB,CAAGlB,EAEEmB,EAAAA,CAAAA,EAAoBlE,EAAAA,gBAAAA,EAAiB4C,GAEvCuB,GAAQ1M,EACVkM,EAAkBS,aAAa,CAACF,EAAkB,EAChDP,EAAkBU,MAAM,CAACN,EAAAA,AAAiB,EAGxCO,EAAY,WAEZV,MAAAA,EAAAA,KAAAA,EAAAA,EAAqBU,SAAAA,AAAS,EAAE,AAClC,MAAMV,EAAoBU,SAAS,CAAC3O,EAAK2M,EAAKmB,GAAW,GAEzDnB,EAAIY,GAAG,CAAC,gCAEH,MAGT,GAAIiB,GAAS,CAACT,EAAa,CACzB,IAAMa,GAAgB9M,CAAQkM,EAAkBU,MAAM,CAACN,EAAiB,CAClES,EAAgBb,EAAkBS,aAAa,CAACF,EAAkB,CAExE,GAAIM,IAC6B,IAA3BA,EAAcC,KADD,GACS,EAAc,CAACF,EAAe,CACtD,GAAIf,EAAWkB,WAAW,CACxB,CAD0B,MACnB,MAAMJ,GAEf,OAAM,IAAIzD,EAAAA,eAAAA,AACZ,CAEJ,CAEA,IAAI8D,EAA0B,MAE1BR,GAAUnD,EAAYyB,IAAb,CAAkB,EAAKiB,EAAD,EACjCiB,EAAWZ,EAEXY,EAAwB,GAHuB,QAGpCA,EAAwB,IAAMA,GAG3C,IAAMC,GAEkB,IAAtB5D,EAAYyB,EACZ,GADiB,EAGjB,CAAC0B,EAMGU,EAAqBV,GAAS,CAACS,EAKjCX,GAAyBD,MAC3BjE,EAAAA,CAhB0D,gBAeN,IACpDA,EAAsB,CACpBqB,KAAMwB,EACNoB,WAhBmE,qCAiBnEC,CACF,GAGF,IAAMa,EAASnP,EAAImP,MAAM,EAAI,MACvBC,EAAAA,CAAAA,EAASlF,EAAAA,SAAAA,IACTmF,EAAaD,EAAOE,kBAAkB,GACtCC,GAAwBzN,EAC5BmM,MAAAA,EAAAA,KAAAA,EAAAA,EAAqBsB,qBAAAA,AAAqB,EAEtCC,GAAgB1N,CAAAA,CAAAA,EAAQkI,EAAAA,cAAAA,EAAehK,EAAK,eAE5CyP,EAAAA,CAAAA,EACJzF,EAAAA,cAAAA,EAAehK,EAAK,qBACnB,MAAMqL,EAAYqE,mBAAmB,CACpC1P,EACA6N,EACAG,EACAwB,EAGJC,OAAAA,GAAAA,EAAAA,AAAkBE,iBAAiB,GACjCC,WAAmBC,kBAAkB,CAAGJ,EAE1C,IAAMK,EAAuC,QAC3CvG,EACAwG,aAAc/B,EAAkBgC,OAAO,CACvCC,WAAY,CACVC,aAAc,CACZC,gBAAgBrO,CAAQ+L,EAAWqC,YAAY,CAACC,cAAc,AAChE,EACAC,iBAAiBtO,CAAQ+L,EAAWuC,eAAe,yBACnDnB,EACAQ,mBACAY,kBAAmBxC,EAAWyC,SAAS,CACvC9C,UAAWZ,EAAIY,SAAS,CACxB+C,QAAS,AAACC,IACR7D,EAAI8D,EAAE,CAAC,QAASD,EAClB,EACAE,sBAAkBC,EAClBC,8BAA+B,CAC7BxP,EACAyP,EACAC,EACAC,IAEA1F,EAAY2F,cAAc,CACxBhR,EACAoB,EACA0P,EACAC,EACA9C,EAEN,EACAgD,cAAe,SACbtD,eACAC,CACF,CACF,EACMsD,EAAc,IAAI5G,EAAAA,eAAAA,CAAgBtK,GAClCmR,EAAc,IAAI5G,EAAAA,gBAAAA,CAAiBoC,GAEnCyE,EAAU5G,EAAAA,kBAAAA,CAAmB6G,mBAAmB,CACpDH,EAAAA,CAAAA,EACAzG,EAAAA,sBAAAA,EAAuBkC,IAGzB,GAAI,CAEF,IADI2E,EACEC,EAAoB,MAAOC,GACxBnG,EAAYoG,MAAM,CAACL,EAAStB,GAAS4B,OAAO,CAAC,KAClD,GAAI,CAACF,EAAM,OAEXA,EAAKG,aAAa,CAAC,CACjB,mBAAoBhF,EAAIW,UAAU,CAClC,YAAY,CACd,GAEA,IAAMsE,EAAqBxC,EAAOyC,qBAAqB,GAEvD,GAAI,CAACD,EACH,OAGF,GACEA,EAAmBE,GAAG,CAAC,EALA,kBAMvBpH,EAAAA,cAAAA,CAAeqH,aAAa,CAC5B,YACA5Q,QAAQ6Q,IAAI,CACV,CAAC,2BAA2B,EAAEJ,EAAmBE,GAAG,CAClD,kBACA,qEAAqE,CAAC,EAK5E,IAAMG,EAAQL,EAAmBE,GAAG,CAAC,cACrC,GAAIG,EAAO,CACT,IAAMC,EAAO,CAAA,EAAG/C,EAAO,CAAC,EAAE8C,EAAAA,CAAO,CAEjCT,EAAKG,aAAa,CAAC,CACjB,aAAcM,EACd,aAAcA,EACd,iBAAkBC,CACpB,GACAV,EAAKW,UAAU,CAACD,GAIZZ,GAAcA,IAAeE,IAC/BF,EADqC,AAC1Bc,YAAY,CAAC,aAAcH,GACtCX,EAAWa,UAAU,CAACD,GAE1B,MACEV,CADK,CACAW,UAAU,CAAC,CAAA,EAAGhD,EAAO,CAAC,EAAElC,EAAAA,CAAS,CAE1C,GAGIoF,EAAiB,MAAOC,QAgIxBC,EAEqDA,EAjIzD,IAAMC,EAAuC,MAAO,oBAClDC,CAAkB,CACnB,IACC,GAAI,CACF,GACE,CAACjD,GACDtB,GACAC,GACA,CAACsE,EAMD,OAJA9F,EAAIW,SADJ,CACc,CAAG,IAEjBX,EAAI+F,SAAS,CAAC,iBAAkB,eAChC/F,EAAIY,GAAG,CAAC,gCACD,KAGT,IAAMoF,EAAW,MAAMpB,EAAkBe,GAEvCtS,EAAY4S,YAAY,CAAI9C,EAAQG,UAAU,CAAS2C,YAAY,CACrE,IAAIC,EAAmB/C,EAAQG,UAAU,CAAC4C,gBAAgB,CAItDA,GACEjG,EAAIY,SAAS,EAAE,CACjBZ,CAFkB,CAEdY,SAAS,CAACqF,GACdA,OAAmBlC,GAGvB,IAAMmC,EAAYhD,EAAQG,UAAU,CAAC8C,aAAa,CAIlD,IAAIvE,EA8CF,OANA,MAAA,CAAA,EAAM5D,EAAAA,YAAAA,EACJsG,EACAC,EACAwB,EACA7C,EAAQG,UAAU,CAAC4C,gBAAgB,EAE9B,IA9CE,EACT,IAAMG,EAAO,MAAML,EAASK,IAAI,GAG1BC,EAAAA,CAAAA,EAAUnI,EAAAA,yBAAAA,EAA0B6H,EAASM,OAAO,CAEtDH,IACFG,EAAO,CAAChI,EAAAA,EADK,oBACLA,CAAuB,CAAG6H,CAAAA,EAGhC,CAACG,CAAO,CAAC,eAAe,EAAID,EAAKE,IAAI,EAAE,CACzCD,CAAO,CAAC,eAAe,CAAGD,EAAKE,IAAAA,AAAI,EAGrC,IAAMC,EACJ,KAAkD,IAA3CrD,EAAQG,UAAU,CAACmD,mBAAmB,IAC7CtD,EAAQG,UAAU,CAACmD,mBAAmB,EAAIpI,EAAAA,cAAAA,GACtC,AACA8E,EAAQG,UAAU,CAACmD,mBAAmB,CAEtCC,EACJ,KAA8C,IAAvCvD,EAAQG,UAAU,CAACqD,eAAe,EACzCxD,EAAQG,UAAU,CAACqD,eAAe,EAAItI,EAAAA,cAAAA,MAClC2F,EACAb,EAAQG,UAAU,CAACqD,eAAe,CAaxC,MAVuC,CAUhCf,AATLgB,MAAO,CACLhI,KAAMJ,EAAAA,eAAAA,CAAgBK,SAAS,CAC/B7C,OAAQgK,EAAShK,MAAM,CACvB6K,KAAMC,OAAOxS,IAAI,CAAC,MAAM+R,EAAKU,WAAW,YACxCT,CACF,EACAU,aAAc,YAAER,EAAYE,QAAO,CACrC,CAGF,CAUF,CAAE,KAVO,CAUAO,EAAK,CAqBZ,MAlBInB,QAAAA,KAAAA,EAAAA,EAAoBoB,OAAAA,AAAO,EAAE,CAE/B,MAAMxI,EAAY2F,cAAc,CAC9BhR,EACA4T,EACA,CACEE,WAAY,aACZC,UAAW9G,EACX+G,UAAW,QACXC,iBAAAA,CAAAA,EAAkBtJ,EAAAA,mBAAAA,EAAoB,oBACpCuE,uBACAhB,CACF,EACF,GACA6C,AAbiB,EAcjB9C,GAGE2F,CACR,CACF,EAEMrB,EAAa,MAAMlH,EAAYgH,cAAc,CAAC,KAClDrS,aACA6N,WACAmB,EACAkF,UAAWtK,EAAAA,SAAAA,CAAU4B,SAAS,CAC9B2I,YAAY,EACZnG,oBACAoG,mBAAmB,uBACnBlG,0BACAC,oBACAqE,EACAhF,UAAWZ,EAAIY,SAAS,eACxBgC,CACF,GAGA,GAAI,CAAChB,EACH,KADU,EACH,KAGT,GAAI+D,CAAAA,MAAAA,CAAAA,EAAAA,AAAiB,GAAjBA,IAAAA,EAAAA,EAAYgB,KAAAA,AAAK,EAAA,KAAA,EAAjBhB,EAAmBhH,IAAI,IAAKJ,EAAAA,eAAAA,CAAgBK,SAAS,CACvD,CADyD,KACnD,OAAA,cAEL,CAFK,AAAInK,MACR,CAAC,kDAAkD,EAAEkR,MAAAA,CAAAA,EAAAA,AAAiB,GAAjBA,IAAAA,EAAAA,EAAYgB,KAAAA,AAAK,EAAA,KAAA,EAAjBhB,EAAmBhH,IAAI,CAAA,CAAE,EAD1E,oBAAA,OAAA,mBAAA,gBAAA,CAEN,EAGE,CAACiE,GACH7C,EAAI+F,SAAS,CADK,AAEhB,iBACAxE,EACI,cACAqE,EAAW8B,MAAM,CACf,OACA9B,EAAWsB,OAAO,CAChB,QACA,OAKR9F,GACFpB,EAAI+F,QADW,CACF,CACX,gBACA,2DAIJ,IAAMO,EAAAA,CAAAA,EAAUpI,EAAAA,2BAAAA,EAA4B0H,EAAWgB,KAAK,CAACN,OAAO,EA4BpE,OA1BI,AAAEzD,CAAAA,EAAiBhB,GACrByE,EADyB,AACjBqB,GADqB,GACf,CAACrJ,EAAAA,sBAAAA,GAMfsH,EAAWoB,YAAY,EACtBhH,EAAD,AAAK4H,SAAS,CAAC,kBACdtB,EAAD,AAASnB,GAAG,CAAC,kBACb,AACAmB,EAAQ9O,GAAG,CACT,gBAAA,CAAA,EACA4G,EAAAA,qBAAAA,EAAsBwH,EAAWoB,YAAY,GAIjD,MAAA,CAAA,EAAM/I,EAAAA,YAAAA,EACJsG,EACAC,EAEA,IAAIzH,SAAS6I,EAAWgB,KAAK,CAACC,IAAI,CAAE,SAClCP,EACAtK,OAAQ4J,EAAWgB,KAAK,CAAC5K,MAAM,EAAI,GACrC,IAEK,IACT,EAII4G,GAAyBF,EAC3B,MAAMgD,EAAehD,EADkB,EAGvCiC,EAAalC,EAAOE,kBAAkB,GACtC,MAAMF,EAAOoF,CAf2H,oBAetG,CAChCxU,EAAIiT,OAAO,CACX,IACE7D,EAAOqF,KAAK,CACV/J,EAAAA,cAAAA,CAAeqH,aAAa,CAC5B,CACE2C,SAAU,CAAA,EAAGvF,EAAO,CAAC,EAAElC,EAAAA,CAAS,CAChC1B,KAAMpB,EAAAA,QAAAA,CAASwK,MAAM,CACrBC,WAAY,CACV,cAAezF,EACf,cAAenP,EAAI6U,GAAG,AACxB,CACF,EACAxC,QAEJ1B,EACA,CAACpB,GAGP,CAAE,MAAOqE,EAAK,CAuBZ,GAtBMA,aAAe1I,EAAAA,eAAc,EAEjC,CAFqC,KAE/BG,EAAY2F,cAAc,CAC9BhR,EACA4T,EACA,CACEE,WAAY,aACZC,UAAWxF,EACXyF,UAAW,QACXC,iBAAAA,CAAAA,EAAkBtJ,EAAAA,mBAAAA,EAAoB,oBACpCuE,uBACAhB,CACF,EACF,GAZiB,AAajB6C,EACA9C,GAOAO,EAAO,MAAMoF,EAQjB,OALA,MAAA,CAAA,EAAMhJ,EAAAA,YAAAA,EACJsG,EACAC,EACA,IAAIzH,SAAS,KAAM,CAAEf,OAAQ,GAAI,IAE5B,IACT,CACF,mCA7eA,SAASkB,EACP,MAAA,CAAA,EAAOC,EAAAA,UAAAA,EAAY,kBACjB0C,uBACAC,CACF,EACF","ignoreList":[6]}