@typicalday/firegraph 0.8.0 → 0.10.0

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/config.ts","../src/cross-graph.ts","../src/discover.ts","../src/internal/firestore-backend.ts","../src/bulk.ts","../src/internal/firestore-adapter.ts","../src/internal/pipeline-adapter.ts","../src/firestore.ts","../src/id.ts","../src/indexes.ts","../src/record.ts","../src/traverse.ts","../src/views.ts"],"sourcesContent":["/**\n * Firegraph Configuration — project-level config file support.\n *\n * Projects create a `firegraph.config.ts` (or `.js`/`.mjs`) in their root:\n *\n * @example\n * ```ts\n * import { defineConfig } from 'firegraph';\n *\n * export default defineConfig({\n *   entities: './entities',\n *   project: 'my-project',\n *   collection: 'graph',\n * });\n * ```\n */\n\n// ---------------------------------------------------------------------------\n// View Resolution Types\n// ---------------------------------------------------------------------------\n\n/** Display contexts where views can appear. */\nexport type ViewContext = 'listing' | 'detail' | 'inline';\n\n/** View resolution configuration for a single entity type. */\nexport interface ViewResolverConfig {\n  /** Default view name (e.g. 'card'). Falls back to 'json' if unset. */\n  default?: string;\n  /** View to use in NodeBrowser listing rows. */\n  listing?: string;\n  /** View to use on the NodeDetail page. */\n  detail?: string;\n  /** View to use for inline/embedded previews (edge rows, traversal). */\n  inline?: string;\n}\n\n/** Declarative view defaults, keyed by entity type. */\nexport interface ViewDefaultsConfig {\n  /** Node view defaults keyed by aType (e.g. 'user', 'task'). */\n  nodes?: Record<string, ViewResolverConfig>;\n  /** Edge view defaults keyed by axbType (e.g. 'hasDeparture'). */\n  edges?: Record<string, ViewResolverConfig>;\n}\n\n// ---------------------------------------------------------------------------\n// Config Shape\n// ---------------------------------------------------------------------------\n\n/** Project-level firegraph configuration. */\nexport interface FiregraphConfig {\n  /** Path to entities directory (per-entity folder convention). */\n  entities?: string;\n  /** GCP project ID. */\n  project?: string;\n  /** Firestore collection path (default: 'graph'). */\n  collection?: string;\n  /** Firestore emulator address (e.g. '127.0.0.1:8080'). */\n  emulator?: string;\n  /**\n   * Query execution backend.\n   *\n   * - `'pipeline'` (default) — Uses Firestore Pipeline API. Requires Enterprise\n   *   Firestore. Enables indexless queries on `data.*` fields.\n   * - `'standard'` — Uses standard Firestore `.where().get()` queries. Not\n   *   recommended for production. See README for risk details.\n   *\n   * When the emulator is active, always falls back to `'standard'`.\n   */\n  queryMode?: import('./types.js').QueryMode;\n\n  /**\n   * AI chat configuration. Auto-detects `claude` CLI on PATH by default.\n   * Set to `false` to disable chat even if claude is available.\n   */\n  chat?: false | {\n    /** Claude model to use (default: 'sonnet'). */\n    model?: string;\n    /** Maximum concurrent claude processes (default: 2). */\n    maxConcurrency?: number;\n  };\n\n  /** Editor-specific settings. */\n  editor?: {\n    /** Server port (default: 3883). */\n    port?: number;\n    /** Force read-only mode. */\n    readonly?: boolean;\n  };\n\n  /** Declarative view defaults per entity type (overrides per-entity meta.json). */\n  viewDefaults?: ViewDefaultsConfig;\n\n  /**\n   * Dynamic registry mode. When set, the editor loads type definitions\n   * from Firestore meta-nodes in addition to filesystem entities.\n   * Filesystem types take precedence on name conflicts.\n   */\n  registryMode?: import('./types.js').DynamicRegistryConfig;\n}\n\n// ---------------------------------------------------------------------------\n// defineConfig()\n// ---------------------------------------------------------------------------\n\n/**\n * Identity function providing type-checking and autocomplete for config files.\n *\n * @example\n * ```ts\n * import { defineConfig } from 'firegraph';\n * export default defineConfig({ entities: './entities' });\n * ```\n */\nexport function defineConfig(config: FiregraphConfig): FiregraphConfig {\n  return config;\n}\n\n// ---------------------------------------------------------------------------\n// View Resolution (pure — works client-side and server-side)\n// ---------------------------------------------------------------------------\n\n/**\n * Resolve which view to show for a given entity.\n *\n * 1. If `context` is provided and a context-specific default exists, use it.\n * 2. Falls back to `resolverConfig.default`.\n * 3. Ultimate fallback: `'json'`.\n *\n * Only returns view names that exist in `availableViewNames`.\n */\nexport function resolveView(\n  resolverConfig: ViewResolverConfig | undefined,\n  availableViewNames: string[],\n  context?: ViewContext,\n): string {\n  if (!resolverConfig) return 'json';\n\n  const available = new Set(availableViewNames);\n\n  if (context) {\n    const contextDefault = resolverConfig[context];\n    if (contextDefault && available.has(contextDefault)) {\n      return contextDefault;\n    }\n  }\n\n  if (resolverConfig.default && available.has(resolverConfig.default)) {\n    return resolverConfig.default;\n  }\n\n  return 'json';\n}\n","/**\n * Cross-graph edge resolution utilities.\n *\n * Provides path-scanning resolution for determining whether an edge's source\n * (aUid) is an ancestor node by checking if the UID appears in the Firestore\n * collection path.\n *\n * Firestore paths have a rigid alternating structure:\n *   collection / docId / collection / docId / collection\n *\n * Given a path like `graph/A/workspace/B/context`, segments at even indices\n * are collection names and odd indices are document IDs. When we find a UID\n * at an odd index, the collection containing that document is the path up to\n * (and including) the preceding even-index segment.\n */\n\n/**\n * Parse a Firestore collection path and determine the collection path\n * where a given UID's document lives, if that UID is an ancestor in the path.\n *\n * @param collectionPath - The full Firestore collection path of the current client\n * @param uid - The UID to search for in the path\n * @returns The collection path containing the UID, or `null` if not found in the path\n *\n * @example\n * ```ts\n * // Path: graph/A/workspace/B/context\n * resolveAncestorCollection('graph/A/workspace/B/context', 'A')\n * // → 'graph'\n *\n * resolveAncestorCollection('graph/A/workspace/B/context', 'B')\n * // → 'graph/A/workspace'\n *\n * resolveAncestorCollection('graph/A/workspace/B/context', 'unknown')\n * // → null\n * ```\n */\nexport function resolveAncestorCollection(\n  collectionPath: string,\n  uid: string,\n): string | null {\n  const segments = collectionPath.split('/');\n\n  // Walk odd-indexed segments (document IDs in Firestore's alternating path structure)\n  for (let i = 1; i < segments.length; i += 2) {\n    if (segments[i] === uid) {\n      // The collection containing this doc is everything up to index i-1\n      return segments.slice(0, i).join('/');\n    }\n  }\n\n  return null;\n}\n\n/**\n * Check whether a UID belongs to an ancestor node by scanning the collection path.\n *\n * @param collectionPath - The full Firestore collection path of the current client\n * @param uid - The UID to check\n * @returns `true` if the UID appears as a document segment in the path\n */\nexport function isAncestorUid(\n  collectionPath: string,\n  uid: string,\n): boolean {\n  return resolveAncestorCollection(collectionPath, uid) !== null;\n}\n","/**\n * Entity Discovery — convention-based auto-discovery of entities from\n * a per-entity folder structure.\n *\n * Scans `entitiesDir/nodes/` and `entitiesDir/edges/` subdirectories.\n * Each subfolder is treated as an entity type.\n *\n * Schema files can be either `schema.json` (plain JSON Schema) or\n * `schema.ts` / `schema.js` (a module whose default export is a JSON Schema\n * object). When both exist, the TS/JS file takes precedence so that authors\n * can compose schemas programmatically while keeping a JSON fallback.\n *\n * @example\n * ```\n * entities/\n *   nodes/\n *     task/\n *       schema.json | schema.ts   (required — one or both)\n *       views.ts                  (optional)\n *       sample.json               (optional)\n *       meta.json                 (optional)\n *   edges/\n *     hasStep/\n *       schema.json | schema.ts   (required — one or both)\n *       edge.json                 (required — topology)\n *       views.ts                  (optional)\n *       sample.json               (optional)\n *       meta.json                 (optional)\n * ```\n */\n\nimport { readFileSync, readdirSync, existsSync, statSync } from 'node:fs';\nimport { createRequire } from 'node:module';\nimport { join, resolve } from 'node:path';\nimport type { DiscoveredEntity, DiscoveryResult, EdgeTopology, MigrationStep, MigrationWriteBack } from './types.js';\nimport type { ViewResolverConfig } from './config.js';\nimport { FiregraphError } from './errors.js';\n\nexport class DiscoveryError extends FiregraphError {\n  constructor(message: string) {\n    super(message, 'DISCOVERY_ERROR');\n    this.name = 'DiscoveryError';\n  }\n}\n\n// ---------------------------------------------------------------------------\n// JSON parsing helpers\n// ---------------------------------------------------------------------------\n\nfunction readJson(filePath: string): unknown {\n  try {\n    const raw = readFileSync(filePath, 'utf-8');\n    return JSON.parse(raw);\n  } catch (err: unknown) {\n    const msg = err instanceof SyntaxError\n      ? `Invalid JSON in ${filePath}: ${err.message}`\n      : `Cannot read ${filePath}: ${(err as Error).message}`;\n    throw new DiscoveryError(msg);\n  }\n}\n\nfunction readJsonIfExists(filePath: string): unknown | undefined {\n  if (!existsSync(filePath)) return undefined;\n  return readJson(filePath);\n}\n\n// ---------------------------------------------------------------------------\n// Schema file loading (JSON or TS/JS via jiti)\n// ---------------------------------------------------------------------------\n\nconst SCHEMA_SCRIPT_EXTENSIONS = ['.ts', '.js', '.mts', '.mjs'];\n\n/**\n * Attempt to load a schema from a TS/JS module (default export) or fall back\n * to schema.json. Returns the parsed schema object or throws.\n */\nfunction loadSchema(dir: string, entityLabel: string): object {\n  // Prefer TS/JS schema — allows programmatic composition & shared definitions\n  for (const ext of SCHEMA_SCRIPT_EXTENSIONS) {\n    const candidate = join(dir, `schema${ext}`);\n    if (existsSync(candidate)) {\n      return loadSchemaModule(candidate, entityLabel);\n    }\n  }\n\n  // Fall back to schema.json\n  const jsonPath = join(dir, 'schema.json');\n  if (existsSync(jsonPath)) {\n    return readJson(jsonPath) as object;\n  }\n\n  throw new DiscoveryError(\n    `Missing schema for ${entityLabel} in ${dir}. ` +\n      'Provide a schema.ts (or .js/.mts/.mjs) or schema.json file.',\n  );\n}\n\nlet _jiti: ((id: string) => unknown) | undefined;\n\nfunction getJiti(): (id: string) => unknown {\n  if (!_jiti) {\n    const base = typeof __filename !== 'undefined' ? __filename : import.meta.url;\n    const esmRequire = createRequire(base);\n    const { createJiti } = esmRequire('jiti') as typeof import('jiti');\n    _jiti = createJiti(base, { interopDefault: true });\n  }\n  return _jiti;\n}\n\nfunction loadSchemaModule(filePath: string, entityLabel: string): object {\n  try {\n    const jiti = getJiti();\n    const mod = jiti(filePath) as { default?: unknown } | unknown;\n    const schema = (mod && typeof mod === 'object' && 'default' in mod)\n      ? (mod as { default: unknown }).default\n      : mod;\n\n    if (!schema || typeof schema !== 'object') {\n      throw new DiscoveryError(\n        `Schema file ${filePath} for ${entityLabel} must default-export a JSON Schema object.`,\n      );\n    }\n    return schema as object;\n  } catch (err: unknown) {\n    if (err instanceof DiscoveryError) throw err;\n    throw new DiscoveryError(\n      `Failed to load schema module ${filePath} for ${entityLabel}: ${(err as Error).message}`,\n    );\n  }\n}\n\n// ---------------------------------------------------------------------------\n// View file detection\n// ---------------------------------------------------------------------------\n\nconst VIEW_EXTENSIONS = ['.ts', '.js', '.mts', '.mjs'];\n\nfunction findViewsFile(dir: string): string | undefined {\n  for (const ext of VIEW_EXTENSIONS) {\n    const candidate = join(dir, `views${ext}`);\n    if (existsSync(candidate)) return candidate;\n  }\n  return undefined;\n}\n\n// ---------------------------------------------------------------------------\n// Migration file detection & loading\n// ---------------------------------------------------------------------------\n\nconst MIGRATION_EXTENSIONS = ['.ts', '.js', '.mts', '.mjs'];\n\nfunction findMigrationsFile(dir: string): string | undefined {\n  for (const ext of MIGRATION_EXTENSIONS) {\n    const candidate = join(dir, `migrations${ext}`);\n    if (existsSync(candidate)) return candidate;\n  }\n  return undefined;\n}\n\nfunction loadMigrations(filePath: string, entityLabel: string): MigrationStep[] {\n  try {\n    const jiti = getJiti();\n    const mod = jiti(filePath) as { default?: unknown } | unknown;\n    const migrations = (mod && typeof mod === 'object' && 'default' in mod)\n      ? (mod as { default: unknown }).default\n      : mod;\n\n    if (!Array.isArray(migrations)) {\n      throw new DiscoveryError(\n        `Migrations file ${filePath} for ${entityLabel} must default-export an array of MigrationStep.`,\n      );\n    }\n    return migrations as MigrationStep[];\n  } catch (err: unknown) {\n    if (err instanceof DiscoveryError) throw err;\n    throw new DiscoveryError(\n      `Failed to load migrations ${filePath} for ${entityLabel}: ${(err as Error).message}`,\n    );\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Entity loaders\n// ---------------------------------------------------------------------------\n\nfunction loadNodeEntity(dir: string, name: string): DiscoveredEntity {\n  const schema = loadSchema(dir, `node type \"${name}\"`);\n  const meta = readJsonIfExists(join(dir, 'meta.json')) as\n    | { description?: string; titleField?: string; subtitleField?: string; viewDefaults?: ViewResolverConfig; allowedIn?: string[]; migrationWriteBack?: MigrationWriteBack }\n    | undefined;\n  const sampleData = readJsonIfExists(join(dir, 'sample.json')) as\n    | Record<string, unknown>\n    | undefined;\n  const viewsPath = findViewsFile(dir);\n  const migrationsPath = findMigrationsFile(dir);\n  const migrations = migrationsPath\n    ? loadMigrations(migrationsPath, `node type \"${name}\"`)\n    : undefined;\n\n  return {\n    kind: 'node',\n    name,\n    schema,\n    description: meta?.description,\n    titleField: meta?.titleField,\n    subtitleField: meta?.subtitleField,\n    viewDefaults: meta?.viewDefaults,\n    viewsPath,\n    sampleData,\n    allowedIn: meta?.allowedIn,\n    migrations,\n    migrationWriteBack: meta?.migrationWriteBack,\n  };\n}\n\nfunction loadEdgeEntity(dir: string, name: string): DiscoveredEntity {\n  const schema = loadSchema(dir, `edge type \"${name}\"`);\n\n  const edgePath = join(dir, 'edge.json');\n  if (!existsSync(edgePath)) {\n    throw new DiscoveryError(\n      `Missing edge.json for edge type \"${name}\" in ${dir}. ` +\n        'Edge entities must declare topology (from/to node types).',\n    );\n  }\n  const topology = readJson(edgePath) as EdgeTopology;\n\n  // Validate topology shape\n  if (!topology.from) {\n    throw new DiscoveryError(\n      `edge.json for \"${name}\" is missing required \"from\" field`,\n    );\n  }\n  if (!topology.to) {\n    throw new DiscoveryError(\n      `edge.json for \"${name}\" is missing required \"to\" field`,\n    );\n  }\n\n  const meta = readJsonIfExists(join(dir, 'meta.json')) as\n    | { description?: string; titleField?: string; subtitleField?: string; viewDefaults?: ViewResolverConfig; allowedIn?: string[]; targetGraph?: string; migrationWriteBack?: MigrationWriteBack }\n    | undefined;\n  const sampleData = readJsonIfExists(join(dir, 'sample.json')) as\n    | Record<string, unknown>\n    | undefined;\n  const viewsPath = findViewsFile(dir);\n  const migrationsPath = findMigrationsFile(dir);\n  const migrations = migrationsPath\n    ? loadMigrations(migrationsPath, `edge type \"${name}\"`)\n    : undefined;\n\n  return {\n    kind: 'edge',\n    name,\n    schema,\n    topology,\n    description: meta?.description,\n    titleField: meta?.titleField,\n    subtitleField: meta?.subtitleField,\n    viewDefaults: meta?.viewDefaults,\n    viewsPath,\n    sampleData,\n    allowedIn: meta?.allowedIn,\n    targetGraph: topology.targetGraph ?? (meta as { targetGraph?: string } | undefined)?.targetGraph,\n    migrations,\n    migrationWriteBack: meta?.migrationWriteBack,\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Directory scanner\n// ---------------------------------------------------------------------------\n\nfunction getSubdirectories(dir: string): string[] {\n  if (!existsSync(dir)) return [];\n  return readdirSync(dir, { withFileTypes: true })\n    .filter((d) => d.isDirectory())\n    .map((d) => d.name);\n}\n\n// ---------------------------------------------------------------------------\n// Public API\n// ---------------------------------------------------------------------------\n\nexport interface DiscoveryWarning {\n  code: 'DANGLING_TOPOLOGY_REF';\n  message: string;\n}\n\nexport interface DiscoverResult {\n  result: DiscoveryResult;\n  warnings: DiscoveryWarning[];\n}\n\n/**\n * Scan an entities directory and return all discovered nodes and edges.\n *\n * @param entitiesDir - Path to the entities directory (absolute or relative to cwd)\n * @returns Discovery result with nodes and edges maps, plus any warnings\n */\nexport function discoverEntities(entitiesDir: string): DiscoverResult {\n  const absDir = resolve(entitiesDir);\n\n  if (!existsSync(absDir) || !statSync(absDir).isDirectory()) {\n    throw new DiscoveryError(`Entities directory not found: ${entitiesDir}`);\n  }\n\n  const nodes = new Map<string, DiscoveredEntity>();\n  const edges = new Map<string, DiscoveredEntity>();\n  const warnings: DiscoveryWarning[] = [];\n\n  // Discover nodes\n  const nodesDir = join(absDir, 'nodes');\n  for (const name of getSubdirectories(nodesDir)) {\n    nodes.set(name, loadNodeEntity(join(nodesDir, name), name));\n  }\n\n  // Discover edges\n  const edgesDir = join(absDir, 'edges');\n  for (const name of getSubdirectories(edgesDir)) {\n    edges.set(name, loadEdgeEntity(join(edgesDir, name), name));\n  }\n\n  // Validate topology references\n  const nodeNames = new Set(nodes.keys());\n  for (const [axbType, entity] of edges) {\n    const topology = entity.topology!;\n    const fromTypes = Array.isArray(topology.from) ? topology.from : [topology.from];\n    const toTypes = Array.isArray(topology.to) ? topology.to : [topology.to];\n\n    for (const ref of [...fromTypes, ...toTypes]) {\n      if (!nodeNames.has(ref)) {\n        warnings.push({\n          code: 'DANGLING_TOPOLOGY_REF',\n          message: `Edge \"${axbType}\" references node type \"${ref}\" which was not found in the nodes directory`,\n        });\n      }\n    }\n  }\n\n  return {\n    result: { nodes, edges },\n    warnings,\n  };\n}\n","/**\n * Firestore implementation of `StorageBackend`.\n *\n * Wraps the existing `FirestoreAdapter`, `TransactionAdapter`, and\n * `BatchAdapter` so the Firestore code path keeps the exact behavior it\n * had before the backend abstraction landed.\n */\n\nimport type { Firestore, Query, Transaction } from '@google-cloud/firestore';\nimport { FieldValue } from '@google-cloud/firestore';\n\nimport {\n  bulkRemoveEdges as bulkRemoveEdgesImpl,\n  removeNodeCascade as removeNodeCascadeImpl,\n} from '../bulk.js';\nimport { FiregraphError } from '../errors.js';\nimport { buildEdgeQueryPlan } from '../query.js';\nimport { deserializeFirestoreTypes } from '../serialization.js';\nimport type {\n  BulkOptions,\n  BulkResult,\n  CascadeResult,\n  FindEdgesParams,\n  GraphReader,\n  QueryFilter,\n  QueryMode,\n  QueryOptions,\n  StoredGraphRecord,\n} from '../types.js';\nimport type {\n  BatchBackend,\n  StorageBackend,\n  TransactionBackend,\n  UpdatePayload,\n  WritableRecord,\n} from './backend.js';\nimport type { BatchAdapter, FirestoreAdapter, TransactionAdapter } from './firestore-adapter.js';\nimport {\n  createBatchAdapter,\n  createFirestoreAdapter,\n  createTransactionAdapter,\n} from './firestore-adapter.js';\nimport type { PipelineQueryAdapter } from './pipeline-adapter.js';\nimport { createPipelineQueryAdapter } from './pipeline-adapter.js';\n\nexport interface FirestoreBackendOptions {\n  queryMode?: QueryMode;\n  scopePath?: string;\n}\n\n/**\n * Build the patch payload Firestore expects from an `UpdatePayload`.\n *\n * - `replaceData` sets the whole `data` field at once. Tagged Firestore\n *   types from the migration sandbox are reconstructed here.\n * - `dataFields` uses Firestore's `data.<key>` dotted-path syntax.\n * - `updatedAt` is always stamped with `FieldValue.serverTimestamp()`.\n * - `v` is stamped at the root when provided.\n */\nfunction buildFirestoreUpdate(update: UpdatePayload, db: Firestore): Record<string, unknown> {\n  const out: Record<string, unknown> = {\n    updatedAt: FieldValue.serverTimestamp(),\n  };\n  if (update.replaceData) {\n    out.data = deserializeFirestoreTypes(update.replaceData, db);\n  }\n  if (update.dataFields) {\n    for (const [k, v] of Object.entries(update.dataFields)) {\n      out[`data.${k}`] = v;\n    }\n  }\n  if (update.v !== undefined) {\n    out.v = update.v;\n  }\n  return out;\n}\n\n/**\n * Stamp `createdAt`/`updatedAt` server-timestamp sentinels on a\n * timestampless record. Used for `setDoc`.\n */\nfunction stampWritableRecord(record: WritableRecord): Record<string, unknown> {\n  const now = FieldValue.serverTimestamp();\n  const out: Record<string, unknown> = {\n    aType: record.aType,\n    aUid: record.aUid,\n    axbType: record.axbType,\n    bType: record.bType,\n    bUid: record.bUid,\n    data: record.data,\n    createdAt: now,\n    updatedAt: now,\n  };\n  if (record.v !== undefined) out.v = record.v;\n  return out;\n}\n\nclass FirestoreTransactionBackend implements TransactionBackend {\n  constructor(\n    private readonly adapter: TransactionAdapter,\n    private readonly db: Firestore,\n  ) {}\n\n  getDoc(docId: string): Promise<StoredGraphRecord | null> {\n    return this.adapter.getDoc(docId);\n  }\n\n  query(filters: QueryFilter[], options?: QueryOptions): Promise<StoredGraphRecord[]> {\n    return this.adapter.query(filters, options);\n  }\n\n  async setDoc(docId: string, record: WritableRecord): Promise<void> {\n    this.adapter.setDoc(docId, stampWritableRecord(record));\n  }\n\n  async updateDoc(docId: string, update: UpdatePayload): Promise<void> {\n    this.adapter.updateDoc(docId, buildFirestoreUpdate(update, this.db));\n  }\n\n  async deleteDoc(docId: string): Promise<void> {\n    this.adapter.deleteDoc(docId);\n  }\n}\n\nclass FirestoreBatchBackend implements BatchBackend {\n  constructor(\n    private readonly adapter: BatchAdapter,\n    private readonly db: Firestore,\n  ) {}\n\n  setDoc(docId: string, record: WritableRecord): void {\n    this.adapter.setDoc(docId, stampWritableRecord(record));\n  }\n\n  updateDoc(docId: string, update: UpdatePayload): void {\n    this.adapter.updateDoc(docId, buildFirestoreUpdate(update, this.db));\n  }\n\n  deleteDoc(docId: string): void {\n    this.adapter.deleteDoc(docId);\n  }\n\n  commit(): Promise<void> {\n    return this.adapter.commit();\n  }\n}\n\nclass FirestoreBackendImpl implements StorageBackend {\n  readonly collectionPath: string;\n  readonly scopePath: string;\n  private readonly adapter: FirestoreAdapter;\n  private readonly pipelineAdapter?: PipelineQueryAdapter;\n\n  constructor(\n    private readonly db: Firestore,\n    collectionPath: string,\n    private readonly queryMode: QueryMode,\n    scopePath: string,\n  ) {\n    this.collectionPath = collectionPath;\n    this.scopePath = scopePath;\n    this.adapter = createFirestoreAdapter(db, collectionPath);\n    if (queryMode === 'pipeline') {\n      this.pipelineAdapter = createPipelineQueryAdapter(db, collectionPath);\n    }\n  }\n\n  // --- Reads ---\n\n  getDoc(docId: string): Promise<StoredGraphRecord | null> {\n    return this.adapter.getDoc(docId);\n  }\n\n  query(filters: QueryFilter[], options?: QueryOptions): Promise<StoredGraphRecord[]> {\n    if (this.pipelineAdapter) {\n      return this.pipelineAdapter.query(filters, options);\n    }\n    return this.adapter.query(filters, options);\n  }\n\n  // --- Writes ---\n\n  setDoc(docId: string, record: WritableRecord): Promise<void> {\n    return this.adapter.setDoc(docId, stampWritableRecord(record));\n  }\n\n  updateDoc(docId: string, update: UpdatePayload): Promise<void> {\n    return this.adapter.updateDoc(docId, buildFirestoreUpdate(update, this.db));\n  }\n\n  deleteDoc(docId: string): Promise<void> {\n    return this.adapter.deleteDoc(docId);\n  }\n\n  // --- Transactions / Batches ---\n\n  runTransaction<T>(fn: (tx: TransactionBackend) => Promise<T>): Promise<T> {\n    return this.db.runTransaction(async (firestoreTx: Transaction) => {\n      const txAdapter = createTransactionAdapter(this.db, this.collectionPath, firestoreTx);\n      return fn(new FirestoreTransactionBackend(txAdapter, this.db));\n    });\n  }\n\n  createBatch(): BatchBackend {\n    const batchAdapter = createBatchAdapter(this.db, this.collectionPath);\n    return new FirestoreBatchBackend(batchAdapter, this.db);\n  }\n\n  // --- Subgraphs ---\n\n  subgraph(parentNodeUid: string, name: string): StorageBackend {\n    const subPath = `${this.collectionPath}/${parentNodeUid}/${name}`;\n    const newScope = this.scopePath ? `${this.scopePath}/${name}` : name;\n    return new FirestoreBackendImpl(this.db, subPath, this.queryMode, newScope);\n  }\n\n  // --- Cascade & bulk ---\n\n  removeNodeCascade(\n    uid: string,\n    reader: GraphReader,\n    options?: BulkOptions,\n  ): Promise<CascadeResult> {\n    return removeNodeCascadeImpl(this.db, this.collectionPath, reader, uid, options);\n  }\n\n  bulkRemoveEdges(\n    params: FindEdgesParams,\n    reader: GraphReader,\n    options?: BulkOptions,\n  ): Promise<BulkResult> {\n    return bulkRemoveEdgesImpl(this.db, this.collectionPath, reader, params, options);\n  }\n\n  // --- Cross-collection ---\n\n  async findEdgesGlobal(\n    params: FindEdgesParams,\n    collectionName?: string,\n  ): Promise<StoredGraphRecord[]> {\n    const name = collectionName ?? this.collectionPath.split('/').pop()!;\n    const plan = buildEdgeQueryPlan(params);\n\n    if (plan.strategy === 'get') {\n      throw new FiregraphError(\n        'findEdgesGlobal() requires a query, not a direct document lookup. ' +\n          'Omit one of aUid/axbType/bUid to force a query strategy.',\n        'INVALID_QUERY',\n      );\n    }\n\n    const collectionGroupRef = this.db.collectionGroup(name);\n    let q: Query = collectionGroupRef;\n    for (const f of plan.filters) {\n      q = q.where(f.field, f.op, f.value);\n    }\n    if (plan.options?.orderBy) {\n      q = q.orderBy(plan.options.orderBy.field, plan.options.orderBy.direction ?? 'asc');\n    }\n    if (plan.options?.limit !== undefined) {\n      q = q.limit(plan.options.limit);\n    }\n    const snap = await q.get();\n    return snap.docs.map((doc) => doc.data() as StoredGraphRecord);\n  }\n}\n\n/**\n * Create a Firestore-backed `StorageBackend`.\n *\n * The query-mode auto-fallback for the emulator (`FIRESTORE_EMULATOR_HOST`)\n * is performed at the call site (`createGraphClient`) so that the backend\n * itself doesn't reach into `process.env`.\n */\nexport function createFirestoreBackend(\n  db: Firestore,\n  collectionPath: string,\n  options: FirestoreBackendOptions = {},\n): StorageBackend {\n  const queryMode = options.queryMode ?? 'pipeline';\n  const scopePath = options.scopePath ?? '';\n  return new FirestoreBackendImpl(db, collectionPath, queryMode, scopePath);\n}\n","import type { Firestore } from '@google-cloud/firestore';\nimport { computeEdgeDocId, computeNodeDocId } from './docid.js';\nimport { NODE_RELATION } from './internal/constants.js';\nimport type {\n  StoredGraphRecord,\n  FindEdgesParams,\n  BulkOptions,\n  BulkResult,\n  BulkBatchError,\n  CascadeResult,\n  GraphReader,\n} from './types.js';\n\nconst MAX_BATCH_SIZE = 500;\nconst DEFAULT_MAX_RETRIES = 3;\nconst BASE_DELAY_MS = 200;\n\nfunction sleep(ms: number): Promise<void> {\n  return new Promise((resolve) => setTimeout(resolve, ms));\n}\n\n/**\n * Splits an array into chunks of at most `size` elements.\n */\nfunction chunk<T>(arr: T[], size: number): T[][] {\n  const chunks: T[][] = [];\n  for (let i = 0; i < arr.length; i += size) {\n    chunks.push(arr.slice(i, i + size));\n  }\n  return chunks;\n}\n\n/**\n * Deletes a list of document IDs in chunked Firestore batches with retries.\n */\nexport async function bulkDeleteDocIds(\n  db: Firestore,\n  collectionPath: string,\n  docIds: string[],\n  options?: BulkOptions,\n): Promise<BulkResult> {\n  if (docIds.length === 0) {\n    return { deleted: 0, batches: 0, errors: [] };\n  }\n\n  const batchSize = Math.min(options?.batchSize ?? MAX_BATCH_SIZE, MAX_BATCH_SIZE);\n  const maxRetries = options?.maxRetries ?? DEFAULT_MAX_RETRIES;\n  const onProgress = options?.onProgress;\n\n  const chunks = chunk(docIds, batchSize);\n  const errors: BulkBatchError[] = [];\n  let deleted = 0;\n  let completedBatches = 0;\n\n  for (let i = 0; i < chunks.length; i++) {\n    const ids = chunks[i];\n    let committed = false;\n\n    for (let attempt = 0; attempt <= maxRetries; attempt++) {\n      try {\n        const batch = db.batch();\n        const collectionRef = db.collection(collectionPath);\n        for (const id of ids) {\n          batch.delete(collectionRef.doc(id));\n        }\n        await batch.commit();\n        committed = true;\n        deleted += ids.length;\n        break;\n      } catch (err) {\n        if (attempt < maxRetries) {\n          const delay = BASE_DELAY_MS * Math.pow(2, attempt);\n          await sleep(delay);\n        } else {\n          errors.push({\n            batchIndex: i,\n            error: err instanceof Error ? err : new Error(String(err)),\n            operationCount: ids.length,\n          });\n        }\n      }\n    }\n\n    if (committed) {\n      completedBatches++;\n    }\n\n    if (onProgress) {\n      onProgress({\n        completedBatches,\n        totalBatches: chunks.length,\n        deletedSoFar: deleted,\n      });\n    }\n  }\n\n  return { deleted, batches: completedBatches, errors };\n}\n\n/**\n * Finds all edges matching `params`, then deletes them in chunked batches.\n */\nexport async function bulkRemoveEdges(\n  db: Firestore,\n  collectionPath: string,\n  reader: GraphReader,\n  params: FindEdgesParams,\n  options?: BulkOptions,\n): Promise<BulkResult> {\n  // Override default query limit for bulk deletion — we need all matching edges.\n  // limit: 0 bypasses DEFAULT_QUERY_LIMIT; an explicit user limit is preserved.\n  // allowCollectionScan: true — bulk deletion inherently implies scanning.\n  const effectiveParams = params.limit !== undefined\n    ? { ...params, allowCollectionScan: params.allowCollectionScan ?? true }\n    : { ...params, limit: 0, allowCollectionScan: params.allowCollectionScan ?? true };\n  const edges = await reader.findEdges(effectiveParams);\n  const docIds = edges.map((e) => computeEdgeDocId(e.aUid, e.axbType, e.bUid));\n  return bulkDeleteDocIds(db, collectionPath, docIds, options);\n}\n\n/** Result from recursive subcollection deletion. */\ninterface SubcollectionDeleteResult {\n  deleted: number;\n  errors: BulkBatchError[];\n}\n\n/**\n * Recursively delete all documents in all subcollections under a given document.\n * Uses `listCollections()` (Admin SDK) to discover subcollections, then for each\n * subcollection: recurse into each document's subcollections first (depth-first),\n * then bulk delete all documents in the subcollection.\n *\n * The `onProgress` callback is intentionally NOT forwarded to subcollection\n * deletes to avoid confusing callers with interleaved progress from different\n * collection depths.\n */\nasync function deleteSubcollectionsRecursive(\n  db: Firestore,\n  collectionPath: string,\n  docId: string,\n  options?: BulkOptions,\n): Promise<SubcollectionDeleteResult> {\n  const docRef = db.collection(collectionPath).doc(docId);\n  const subcollections = await docRef.listCollections();\n\n  if (subcollections.length === 0) return { deleted: 0, errors: [] };\n\n  let totalDeleted = 0;\n  const allErrors: BulkBatchError[] = [];\n\n  // Strip onProgress for subcollection deletes — callers should only see\n  // top-level progress, not interleaved reports from nested depths.\n  const subOptions: BulkOptions | undefined = options\n    ? { batchSize: options.batchSize, maxRetries: options.maxRetries }\n    : undefined;\n\n  for (const subCollRef of subcollections) {\n    const subCollPath = subCollRef.path;\n    // List all documents in this subcollection\n    const snapshot = await subCollRef.select().get();\n    const subDocIds = snapshot.docs.map((d) => d.id);\n\n    // Depth-first: recurse into each document's subcollections\n    for (const subDocId of subDocIds) {\n      const subResult = await deleteSubcollectionsRecursive(db, subCollPath, subDocId, subOptions);\n      totalDeleted += subResult.deleted;\n      allErrors.push(...subResult.errors);\n    }\n\n    // Now delete all documents in this subcollection\n    if (subDocIds.length > 0) {\n      const result = await bulkDeleteDocIds(db, subCollPath, subDocIds, subOptions);\n      totalDeleted += result.deleted;\n      allErrors.push(...result.errors);\n    }\n  }\n\n  return { deleted: totalDeleted, errors: allErrors };\n}\n\n/**\n * Deletes a node and all of its outgoing and incoming edges.\n *\n * Edges are deleted first in chunked batches, then the node document\n * is deleted in the final batch. This is NOT atomic across batches —\n * if a batch fails after retries, remaining batches still execute.\n *\n * By default, subcollections (subgraphs) under the node's document are\n * recursively deleted. Set `options.deleteSubcollections` to `false` to skip.\n */\nexport async function removeNodeCascade(\n  db: Firestore,\n  collectionPath: string,\n  reader: GraphReader,\n  uid: string,\n  options?: BulkOptions,\n): Promise<CascadeResult> {\n  // Find all edges touching this node (outgoing + incoming).\n  // Filter out the node's own self-loop record (axbType === 'is').\n  // These queries intentionally scan broadly — allowCollectionScan bypasses safety checks.\n  // limit: 0 bypasses the DEFAULT_QUERY_LIMIT to ensure we find all edges.\n  const [outgoingRaw, incomingRaw] = await Promise.all([\n    reader.findEdges({ aUid: uid, allowCollectionScan: true, limit: 0 }),\n    reader.findEdges({ bUid: uid, allowCollectionScan: true, limit: 0 }),\n  ]);\n  const outgoing = outgoingRaw.filter((e) => e.axbType !== NODE_RELATION);\n  const incoming = incomingRaw.filter((e) => e.axbType !== NODE_RELATION);\n\n  // Deduplicate: a self-referencing edge could appear in both lists.\n  const edgeDocIdSet = new Set<string>();\n  const allEdges: StoredGraphRecord[] = [];\n  for (const edge of [...outgoing, ...incoming]) {\n    const docId = computeEdgeDocId(edge.aUid, edge.axbType, edge.bUid);\n    if (!edgeDocIdSet.has(docId)) {\n      edgeDocIdSet.add(docId);\n      allEdges.push(edge);\n    }\n  }\n\n  // Delete subcollections (subgraphs) under this node's document (depth-first).\n  const shouldDeleteSubcollections = options?.deleteSubcollections !== false;\n  const nodeDocId = computeNodeDocId(uid);\n  let subcollectionResult: SubcollectionDeleteResult = { deleted: 0, errors: [] };\n\n  if (shouldDeleteSubcollections) {\n    subcollectionResult = await deleteSubcollectionsRecursive(\n      db, collectionPath, nodeDocId, options,\n    );\n  }\n\n  // Build doc IDs: edges first, then the node last.\n  const edgeDocIds = allEdges.map((e) => computeEdgeDocId(e.aUid, e.axbType, e.bUid));\n  const allDocIds = [...edgeDocIds, nodeDocId];\n\n  // Wrap the progress callback to track overall progress.\n  const batchSize = Math.min(options?.batchSize ?? MAX_BATCH_SIZE, MAX_BATCH_SIZE);\n  const result = await bulkDeleteDocIds(db, collectionPath, allDocIds, {\n    ...options,\n    batchSize,\n  });\n\n  // Determine if the node doc was in a failed batch.\n  // The node is always in the last doc ID. If the last batch errored, node wasn't deleted.\n  const totalChunks = Math.ceil(allDocIds.length / batchSize);\n  const nodeChunkIndex = totalChunks - 1;\n  const nodeDeleted = !result.errors.some((e) => e.batchIndex === nodeChunkIndex);\n\n  // edgesDeleted counts only top-level edges (not subcollection docs).\n  // deleted includes everything: top-level edges + node + subcollection docs.\n  const topLevelEdgesDeleted = nodeDeleted ? result.deleted - 1 : result.deleted;\n\n  return {\n    deleted: result.deleted + subcollectionResult.deleted,\n    batches: result.batches,\n    errors: [...result.errors, ...subcollectionResult.errors],\n    edgesDeleted: topLevelEdgesDeleted,\n    nodeDeleted,\n  };\n}\n","import type { Firestore, Query, Transaction } from '@google-cloud/firestore';\nimport type { StoredGraphRecord, QueryFilter, QueryOptions } from '../types.js';\n\nexport interface FirestoreAdapter {\n  collectionPath: string;\n  getDoc(docId: string): Promise<StoredGraphRecord | null>;\n  setDoc(docId: string, data: Record<string, unknown>): Promise<void>;\n  updateDoc(docId: string, data: Record<string, unknown>): Promise<void>;\n  deleteDoc(docId: string): Promise<void>;\n  query(filters: QueryFilter[], options?: QueryOptions): Promise<StoredGraphRecord[]>;\n}\n\nexport function createFirestoreAdapter(\n  db: Firestore,\n  collectionPath: string,\n): FirestoreAdapter {\n  const collectionRef = db.collection(collectionPath);\n\n  return {\n    collectionPath,\n\n    async getDoc(docId: string): Promise<StoredGraphRecord | null> {\n      const snap = await collectionRef.doc(docId).get();\n      if (!snap.exists) return null;\n      return snap.data() as StoredGraphRecord;\n    },\n\n    async setDoc(docId: string, data: Record<string, unknown>): Promise<void> {\n      await collectionRef.doc(docId).set(data);\n    },\n\n    async updateDoc(docId: string, data: Record<string, unknown>): Promise<void> {\n      await collectionRef.doc(docId).update(data);\n    },\n\n    async deleteDoc(docId: string): Promise<void> {\n      await collectionRef.doc(docId).delete();\n    },\n\n    async query(filters: QueryFilter[], options?: QueryOptions): Promise<StoredGraphRecord[]> {\n      let q: Query = collectionRef;\n      for (const f of filters) {\n        q = q.where(f.field, f.op, f.value);\n      }\n      if (options?.orderBy) {\n        q = q.orderBy(options.orderBy.field, options.orderBy.direction ?? 'asc');\n      }\n      if (options?.limit !== undefined) {\n        q = q.limit(options.limit);\n      }\n      const snap = await q.get();\n      return snap.docs.map((doc) => doc.data() as StoredGraphRecord);\n    },\n  };\n}\n\nexport interface TransactionAdapter {\n  getDoc(docId: string): Promise<StoredGraphRecord | null>;\n  setDoc(docId: string, data: Record<string, unknown>): void;\n  updateDoc(docId: string, data: Record<string, unknown>): void;\n  deleteDoc(docId: string): void;\n  query(filters: QueryFilter[], options?: QueryOptions): Promise<StoredGraphRecord[]>;\n}\n\nexport function createTransactionAdapter(\n  db: Firestore,\n  collectionPath: string,\n  tx: Transaction,\n): TransactionAdapter {\n  const collectionRef = db.collection(collectionPath);\n\n  return {\n    async getDoc(docId: string): Promise<StoredGraphRecord | null> {\n      const snap = await tx.get(collectionRef.doc(docId));\n      if (!snap.exists) return null;\n      return snap.data() as StoredGraphRecord;\n    },\n\n    setDoc(docId: string, data: Record<string, unknown>): void {\n      tx.set(collectionRef.doc(docId), data);\n    },\n\n    updateDoc(docId: string, data: Record<string, unknown>): void {\n      tx.update(collectionRef.doc(docId), data);\n    },\n\n    deleteDoc(docId: string): void {\n      tx.delete(collectionRef.doc(docId));\n    },\n\n    async query(filters: QueryFilter[], options?: QueryOptions): Promise<StoredGraphRecord[]> {\n      let q: Query = collectionRef;\n      for (const f of filters) {\n        q = q.where(f.field, f.op, f.value);\n      }\n      if (options?.orderBy) {\n        q = q.orderBy(options.orderBy.field, options.orderBy.direction ?? 'asc');\n      }\n      if (options?.limit !== undefined) {\n        q = q.limit(options.limit);\n      }\n      const snap = await tx.get(q);\n      return snap.docs.map((doc) => doc.data() as StoredGraphRecord);\n    },\n  };\n}\n\nexport interface BatchAdapter {\n  setDoc(docId: string, data: Record<string, unknown>): void;\n  updateDoc(docId: string, data: Record<string, unknown>): void;\n  deleteDoc(docId: string): void;\n  commit(): Promise<void>;\n}\n\nexport function createBatchAdapter(\n  db: Firestore,\n  collectionPath: string,\n): BatchAdapter {\n  const collectionRef = db.collection(collectionPath);\n  const batch = db.batch();\n\n  return {\n    setDoc(docId: string, data: Record<string, unknown>): void {\n      batch.set(collectionRef.doc(docId), data);\n    },\n\n    updateDoc(docId: string, data: Record<string, unknown>): void {\n      batch.update(collectionRef.doc(docId), data);\n    },\n\n    deleteDoc(docId: string): void {\n      batch.delete(collectionRef.doc(docId));\n    },\n\n    async commit(): Promise<void> {\n      await batch.commit();\n    },\n  };\n}\n","/**\n * Pipeline query adapter — translates QueryFilter[] to Firestore Pipeline\n * expressions and executes them via db.pipeline().\n *\n * Only handles query() — doc-level operations (get/set/update/delete) stay\n * on the standard FirestoreAdapter.\n */\nimport type { Firestore } from '@google-cloud/firestore';\nimport type { StoredGraphRecord, QueryFilter, QueryOptions } from '../types.js';\n\n/**\n * Minimal interface for the Pipeline query adapter.\n * Only implements the query path — doc operations are handled by FirestoreAdapter.\n */\nexport interface PipelineQueryAdapter {\n  query(filters: QueryFilter[], options?: QueryOptions): Promise<StoredGraphRecord[]>;\n}\n\n/**\n * Lazily loaded Pipelines module. We use dynamic import so that standard-mode\n * users (and the emulator) don't pull in pipeline-related code at module load.\n */\nlet _Pipelines: typeof import('@google-cloud/firestore').Pipelines | null = null;\n\nasync function getPipelines(): Promise<typeof import('@google-cloud/firestore').Pipelines> {\n  if (!_Pipelines) {\n    const mod = await import('@google-cloud/firestore');\n    _Pipelines = mod.Pipelines;\n  }\n  return _Pipelines;\n}\n\ntype PipelinesType = typeof import('@google-cloud/firestore').Pipelines;\ntype BooleanExpr = import('@google-cloud/firestore').Pipelines.BooleanExpression;\n\n/**\n * Maps a QueryFilter to a Pipeline BooleanExpression.\n *\n * Uses the string-based overloads (e.g. `equal(fieldName, value)`) which\n * accept `unknown` values, avoiding type issues with `constant()` overloads.\n */\nfunction buildFilterExpression(\n  P: PipelinesType,\n  filter: QueryFilter,\n): BooleanExpr {\n  const { field: fieldName, op, value } = filter;\n\n  switch (op) {\n    case '==':\n      return P.equal(fieldName, value);\n    case '!=':\n      return P.notEqual(fieldName, value);\n    case '<':\n      return P.lessThan(fieldName, value);\n    case '<=':\n      return P.lessThanOrEqual(fieldName, value);\n    case '>':\n      return P.greaterThan(fieldName, value);\n    case '>=':\n      return P.greaterThanOrEqual(fieldName, value);\n    case 'in':\n      return P.equalAny(fieldName, value as Array<unknown>);\n    case 'not-in':\n      return P.notEqualAny(fieldName, value as Array<unknown>);\n    case 'array-contains':\n      return P.arrayContains(fieldName, value);\n    case 'array-contains-any':\n      return P.arrayContainsAny(fieldName, value as Array<unknown>);\n    default:\n      throw new Error(`Unsupported filter op for pipeline mode: ${op}`);\n  }\n}\n\nexport function createPipelineQueryAdapter(\n  db: Firestore,\n  collectionPath: string,\n): PipelineQueryAdapter {\n  return {\n    async query(filters: QueryFilter[], options?: QueryOptions): Promise<StoredGraphRecord[]> {\n      const P = await getPipelines();\n\n      // Build pipeline\n      let pipeline = db.pipeline().collection(collectionPath);\n\n      // Apply filters\n      if (filters.length === 1) {\n        pipeline = pipeline.where(buildFilterExpression(P, filters[0]));\n      } else if (filters.length > 1) {\n        const [first, second, ...rest] = filters.map(f => buildFilterExpression(P, f));\n        pipeline = pipeline.where(P.and(first, second, ...rest));\n      }\n\n      // Apply sort\n      if (options?.orderBy) {\n        const f = P.field(options.orderBy.field);\n        const ordering = options.orderBy.direction === 'desc'\n          ? f.descending()\n          : f.ascending();\n        pipeline = pipeline.sort(ordering);\n      }\n\n      // Apply limit\n      if (options?.limit !== undefined) {\n        pipeline = pipeline.limit(options.limit);\n      }\n\n      const snap = await pipeline.execute();\n      return snap.results.map(r => r.data() as StoredGraphRecord);\n    },\n  };\n}\n","/**\n * Firestore-specific client factory.\n *\n * Kept in its own module so that bundlers don't pull\n * `@google-cloud/firestore` into SQLite-only entry points\n * (`firegraph/d1`, `firegraph/do-sqlite`).\n */\n\nimport type { Firestore } from '@google-cloud/firestore';\n\nimport { GraphClientImpl } from './client.js';\nimport type { StorageBackend } from './internal/backend.js';\nimport { createFirestoreBackend } from './internal/firestore-backend.js';\nimport type {\n  DynamicGraphClient,\n  DynamicRegistryConfig,\n  GraphClient,\n  GraphClientOptions,\n  QueryMode,\n} from './types.js';\n\nlet _standardModeWarned = false;\n\nexport function createGraphClient(\n  db: Firestore,\n  collectionPath: string,\n  options: GraphClientOptions & { registryMode: DynamicRegistryConfig },\n): DynamicGraphClient;\nexport function createGraphClient(\n  db: Firestore,\n  collectionPath: string,\n  options?: GraphClientOptions,\n): GraphClient;\nexport function createGraphClient(\n  db: Firestore,\n  collectionPath: string,\n  options?: GraphClientOptions,\n): GraphClient | DynamicGraphClient {\n  const requestedMode = options?.queryMode ?? 'pipeline';\n  const isEmulator = !!process.env.FIRESTORE_EMULATOR_HOST;\n  const effectiveMode: QueryMode = isEmulator ? 'standard' : requestedMode;\n\n  if (\n    effectiveMode === 'standard' &&\n    !isEmulator &&\n    requestedMode === 'standard' &&\n    !_standardModeWarned\n  ) {\n    _standardModeWarned = true;\n    console.warn(\n      '[firegraph] Standard query mode enabled. This is NOT recommended for production:\\n' +\n        '  - Enterprise Firestore: data.* filters cause full collection scans (high billing)\\n' +\n        '  - Standard Firestore: data.* filters without composite indexes will fail\\n' +\n        '  See: https://github.com/typicalday/firegraph#query-modes',\n    );\n  }\n\n  const backend = createFirestoreBackend(db, collectionPath, { queryMode: effectiveMode });\n\n  let metaBackend: StorageBackend | undefined;\n  if (options?.registryMode?.collection && options.registryMode.collection !== collectionPath) {\n    metaBackend = createFirestoreBackend(db, options.registryMode.collection, {\n      queryMode: effectiveMode,\n    });\n  }\n\n  return new GraphClientImpl(backend, options, metaBackend) as GraphClient | DynamicGraphClient;\n}\n","import { nanoid } from 'nanoid';\n\nexport function generateId(): string {\n  return nanoid();\n}\n","import type { DiscoveryResult, RegistryEntry } from './types.js';\n\nexport interface FirestoreIndexField {\n  fieldPath: string;\n  order: 'ASCENDING' | 'DESCENDING';\n}\n\nexport interface FirestoreIndex {\n  collectionGroup: string;\n  queryScope: 'COLLECTION' | 'COLLECTION_GROUP';\n  fields: FirestoreIndexField[];\n}\n\nexport interface FirestoreIndexConfig {\n  indexes: FirestoreIndex[];\n  fieldOverrides: unknown[];\n}\n\n/**\n * Base composite indexes required for all firegraph collections.\n * These cover the standard query patterns:\n *   - Forward edge lookup:   (aUid, axbType)\n *   - Reverse edge lookup:   (axbType, bUid)\n *   - Type-scoped queries:   (aType, axbType)  — also covers findNodes\n *   - Edge type + target:    (axbType, bType)\n */\nfunction baseIndexes(collection: string): FirestoreIndex[] {\n  return [\n    {\n      collectionGroup: collection,\n      queryScope: 'COLLECTION',\n      fields: [\n        { fieldPath: 'aUid', order: 'ASCENDING' },\n        { fieldPath: 'axbType', order: 'ASCENDING' },\n      ],\n    },\n    {\n      collectionGroup: collection,\n      queryScope: 'COLLECTION',\n      fields: [\n        { fieldPath: 'axbType', order: 'ASCENDING' },\n        { fieldPath: 'bUid', order: 'ASCENDING' },\n      ],\n    },\n    {\n      collectionGroup: collection,\n      queryScope: 'COLLECTION',\n      fields: [\n        { fieldPath: 'aType', order: 'ASCENDING' },\n        { fieldPath: 'axbType', order: 'ASCENDING' },\n      ],\n    },\n    {\n      collectionGroup: collection,\n      queryScope: 'COLLECTION',\n      fields: [\n        { fieldPath: 'axbType', order: 'ASCENDING' },\n        { fieldPath: 'bType', order: 'ASCENDING' },\n      ],\n    },\n  ];\n}\n\n/**\n * Extracts top-level field names from a JSON Schema object.\n * Only returns fields from schemas with type: \"object\" and properties.\n */\nfunction extractSchemaFields(schema: object): string[] {\n  const s = schema as Record<string, unknown>;\n  if (s.type !== 'object' || !s.properties) return [];\n  return Object.keys(s.properties as Record<string, unknown>);\n}\n\n/**\n * Collection group indexes for `findEdgesGlobal()` queries.\n *\n * These mirror the base collection indexes but with `COLLECTION_GROUP` scope,\n * which allows querying across all subcollections with the given name.\n * Only generated when the registry has edge types with `targetGraph` set,\n * indicating cross-graph edges exist and global queries are likely.\n */\nfunction collectionGroupIndexes(collectionName: string): FirestoreIndex[] {\n  return [\n    {\n      collectionGroup: collectionName,\n      queryScope: 'COLLECTION_GROUP',\n      fields: [\n        { fieldPath: 'aUid', order: 'ASCENDING' },\n        { fieldPath: 'axbType', order: 'ASCENDING' },\n      ],\n    },\n    {\n      collectionGroup: collectionName,\n      queryScope: 'COLLECTION_GROUP',\n      fields: [\n        { fieldPath: 'axbType', order: 'ASCENDING' },\n        { fieldPath: 'bUid', order: 'ASCENDING' },\n      ],\n    },\n    {\n      collectionGroup: collectionName,\n      queryScope: 'COLLECTION_GROUP',\n      fields: [\n        { fieldPath: 'aType', order: 'ASCENDING' },\n        { fieldPath: 'axbType', order: 'ASCENDING' },\n      ],\n    },\n    {\n      collectionGroup: collectionName,\n      queryScope: 'COLLECTION_GROUP',\n      fields: [\n        { fieldPath: 'axbType', order: 'ASCENDING' },\n        { fieldPath: 'bType', order: 'ASCENDING' },\n      ],\n    },\n  ];\n}\n\n/**\n * Generates a Firestore index configuration for a firegraph collection.\n *\n * Always includes the 4 base composite indexes. If an entity discovery result\n * is provided, generates additional data-field indexes for common query\n * patterns on node data fields:\n *   (aType, axbType, data.{field})\n *\n * When registry entries with `targetGraph` are provided, also generates\n * collection group indexes for `findEdgesGlobal()` queries. The collection\n * group name defaults to `'graph'` (the standard subgraph name) but can be\n * overridden per `targetGraph` value.\n *\n * @param collection - Firestore collection name (e.g. 'graph')\n * @param entities - Optional discovery result for per-entity data field indexes\n * @param registryEntries - Optional registry entries; when any have `targetGraph`,\n *   collection group indexes are generated for the distinct subgraph names\n */\nexport function generateIndexConfig(\n  collection: string,\n  entities?: DiscoveryResult,\n  registryEntries?: ReadonlyArray<RegistryEntry>,\n): FirestoreIndexConfig {\n  const indexes = baseIndexes(collection);\n\n  if (entities) {\n    // Generate data-field indexes for node types.\n    // Pattern: (aType, axbType, data.{field}) — covers findNodes with where clauses\n    // and findEdges scoped by aType + axbType + data filter.\n    for (const [, entity] of entities.nodes) {\n      const fields = extractSchemaFields(entity.schema);\n      for (const field of fields) {\n        indexes.push({\n          collectionGroup: collection,\n          queryScope: 'COLLECTION',\n          fields: [\n            { fieldPath: 'aType', order: 'ASCENDING' },\n            { fieldPath: 'axbType', order: 'ASCENDING' },\n            { fieldPath: `data.${field}`, order: 'ASCENDING' },\n          ],\n        });\n      }\n    }\n\n    // Generate data-field indexes for edge types.\n    // Pattern: (aUid, axbType, data.{field}) — covers forward edge lookups with data filters.\n    for (const [, entity] of entities.edges) {\n      const fields = extractSchemaFields(entity.schema);\n      for (const field of fields) {\n        indexes.push({\n          collectionGroup: collection,\n          queryScope: 'COLLECTION',\n          fields: [\n            { fieldPath: 'aUid', order: 'ASCENDING' },\n            { fieldPath: 'axbType', order: 'ASCENDING' },\n            { fieldPath: `data.${field}`, order: 'ASCENDING' },\n          ],\n        });\n      }\n    }\n  }\n\n  // Generate collection group indexes when cross-graph edges exist.\n  // Each distinct targetGraph value gets its own set of collection group indexes.\n  if (registryEntries) {\n    const targetGraphNames = new Set<string>();\n    for (const entry of registryEntries) {\n      if (entry.targetGraph) {\n        targetGraphNames.add(entry.targetGraph);\n      }\n    }\n    for (const name of targetGraphNames) {\n      indexes.push(...collectionGroupIndexes(name));\n    }\n  }\n\n  return { indexes, fieldOverrides: [] };\n}\n","import { FieldValue } from '@google-cloud/firestore';\nimport { NODE_RELATION } from './internal/constants.js';\nimport type { GraphRecord } from './types.js';\n\nexport function buildNodeRecord(\n  aType: string,\n  uid: string,\n  data: Record<string, unknown>,\n): GraphRecord {\n  const now = FieldValue.serverTimestamp();\n  return {\n    aType,\n    aUid: uid,\n    axbType: NODE_RELATION,\n    bType: aType,\n    bUid: uid,\n    data,\n    createdAt: now,\n    updatedAt: now,\n  };\n}\n\nexport function buildEdgeRecord(\n  aType: string,\n  aUid: string,\n  axbType: string,\n  bType: string,\n  bUid: string,\n  data: Record<string, unknown>,\n): GraphRecord {\n  const now = FieldValue.serverTimestamp();\n  return {\n    aType,\n    aUid,\n    axbType,\n    bType,\n    bUid,\n    data,\n    createdAt: now,\n    updatedAt: now,\n  };\n}\n","import { TraversalError } from './errors.js';\nimport type {\n  GraphReader,\n  GraphClient,\n  GraphRegistry,\n  StoredGraphRecord,\n  FindEdgesParams,\n  HopDefinition,\n  TraversalOptions,\n  HopResult,\n  TraversalResult,\n  TraversalBuilder,\n} from './types.js';\n\nconst DEFAULT_LIMIT = 10;\nconst DEFAULT_MAX_READS = 100;\nconst DEFAULT_CONCURRENCY = 5;\n\n/** One-time warning flag: emitted when cross-graph hop is silently skipped. */\nlet _crossGraphWarned = false;\n\n/** Type guard to check if a reader is a GraphClient (has subgraph method). */\nfunction isGraphClient(reader: GraphReader): reader is GraphClient {\n  return 'subgraph' in reader && typeof (reader as GraphClient).subgraph === 'function';\n}\n\nclass Semaphore {\n  private queue: Array<() => void> = [];\n  private active = 0;\n\n  constructor(private readonly slots: number) {}\n\n  async acquire(): Promise<void> {\n    if (this.active < this.slots) {\n      this.active++;\n      return;\n    }\n    return new Promise<void>((resolve) => {\n      this.queue.push(resolve);\n    });\n  }\n\n  release(): void {\n    this.active--;\n    const next = this.queue.shift();\n    if (next) {\n      this.active++;\n      next();\n    }\n  }\n}\n\nclass TraversalBuilderImpl implements TraversalBuilder {\n  private readonly hops: HopDefinition[] = [];\n\n  constructor(\n    private readonly reader: GraphReader,\n    private readonly startUid: string,\n    private readonly registry?: GraphRegistry,\n  ) {}\n\n  follow(axbType: string, options?: Omit<HopDefinition, 'axbType'>): TraversalBuilder {\n    this.hops.push({ axbType, ...options });\n    return this;\n  }\n\n  async run(options?: TraversalOptions): Promise<TraversalResult> {\n    if (this.hops.length === 0) {\n      throw new TraversalError('Traversal requires at least one follow() hop');\n    }\n\n    const maxReads = options?.maxReads ?? DEFAULT_MAX_READS;\n    const concurrency = options?.concurrency ?? DEFAULT_CONCURRENCY;\n    const returnIntermediates = options?.returnIntermediates ?? false;\n    const semaphore = new Semaphore(concurrency);\n\n    let totalReads = 0;\n    let truncated = false;\n    // Track (uid, reader) pairs to support context carry-forward across hops.\n    // When a hop crosses into a subgraph, the resulting UIDs carry the subgraph\n    // reader so subsequent hops without targetGraph stay in that subgraph.\n    let sources: Array<{ uid: string; reader: GraphReader }> = [\n      { uid: this.startUid, reader: this.reader },\n    ];\n    const hopResults: HopResult[] = [];\n\n    for (let depth = 0; depth < this.hops.length; depth++) {\n      const hop = this.hops[depth];\n\n      if (sources.length === 0) {\n        hopResults.push({\n          axbType: hop.axbType,\n          depth,\n          edges: [],\n          sourceCount: 0,\n          truncated: false,\n        });\n        continue;\n      }\n\n      const hopEdges: Array<{ edge: StoredGraphRecord; reader: GraphReader }> = [];\n      const sourceCount = sources.length;\n      let hopTruncated = false;\n\n      // Resolve targetGraph for this hop:\n      // 1. Explicit on the hop definition takes precedence\n      // 2. Otherwise check the registry for the axbType\n      const resolvedTargetGraph = this.resolveTargetGraph(hop);\n      const direction = hop.direction ?? 'forward';\n      const isCrossGraph = direction === 'forward' && !!resolvedTargetGraph;\n\n      const tasks = sources.map(({ uid, reader: sourceReader }) => async () => {\n        if (totalReads >= maxReads) {\n          hopTruncated = true;\n          return;\n        }\n\n        await semaphore.acquire();\n        try {\n          if (totalReads >= maxReads) {\n            hopTruncated = true;\n            return;\n          }\n\n          totalReads++;\n\n          const params: FindEdgesParams = { axbType: hop.axbType };\n\n          if (direction === 'forward') {\n            params.aUid = uid;\n            if (hop.bType) params.bType = hop.bType;\n          } else {\n            params.bUid = uid;\n            if (hop.aType) params.aType = hop.aType;\n          }\n\n          if (direction === 'forward' && hop.aType) {\n            params.aType = hop.aType;\n          }\n          if (direction === 'reverse' && hop.bType) {\n            params.bType = hop.bType;\n          }\n\n          if (hop.orderBy) params.orderBy = hop.orderBy;\n\n          const limit = hop.limit ?? DEFAULT_LIMIT;\n          if (hop.filter) {\n            params.limit = 0;\n          } else {\n            params.limit = limit;\n          }\n\n          // Choose the reader for this hop:\n          // - Cross-graph hop: create a subgraph reader from the ROOT client\n          //   (targetGraph is always relative to root)\n          // - No cross-graph: use the carried-forward reader from previous hop\n          //   (context tracking — stay in whatever subgraph we're already in)\n          let hopReader: GraphReader;\n          let nextReader: GraphReader;\n          if (isCrossGraph) {\n            if (isGraphClient(this.reader)) {\n              hopReader = this.reader.subgraph(uid, resolvedTargetGraph!);\n              nextReader = hopReader;\n            } else {\n              hopReader = sourceReader;\n              nextReader = sourceReader;\n              if (!_crossGraphWarned) {\n                _crossGraphWarned = true;\n                console.warn(\n                  `[firegraph] Traversal hop \"${hop.axbType}\" has targetGraph \"${resolvedTargetGraph}\" ` +\n                  'but the reader does not support subgraph(). Cross-graph hop will query the current ' +\n                  'collection instead. Pass a GraphClient to createTraversal() to enable cross-graph traversal.',\n                );\n              }\n            }\n          } else {\n            // No targetGraph — carry forward context from previous hop\n            hopReader = sourceReader;\n            nextReader = sourceReader;\n          }\n\n          let edges = await hopReader.findEdges(params);\n\n          if (hop.filter) {\n            edges = edges.filter(hop.filter);\n            edges = edges.slice(0, limit);\n          }\n\n          for (const edge of edges) {\n            hopEdges.push({ edge, reader: nextReader });\n          }\n        } finally {\n          semaphore.release();\n        }\n      });\n\n      await Promise.all(tasks.map((task) => task()));\n\n      const edges = hopEdges.map((h) => h.edge);\n\n      hopResults.push({\n        axbType: hop.axbType,\n        depth,\n        edges: returnIntermediates ? [...edges] : edges,\n        sourceCount,\n        truncated: hopTruncated,\n      });\n\n      if (hopTruncated) {\n        truncated = true;\n      }\n\n      // Build next sources with deduplication by UID.\n      // When the same UID appears from multiple source readers, the first one wins.\n      const seen = new Map<string, GraphReader>();\n      for (const { edge, reader: edgeReader } of hopEdges) {\n        const nextUid = direction === 'forward' ? edge.bUid : edge.aUid;\n        if (!seen.has(nextUid)) {\n          seen.set(nextUid, edgeReader);\n        }\n      }\n      sources = [...seen.entries()].map(([uid, reader]) => ({ uid, reader }));\n    }\n\n    const lastHop = hopResults[hopResults.length - 1];\n\n    return {\n      nodes: lastHop.edges,\n      hops: hopResults,\n      totalReads,\n      truncated,\n    };\n  }\n\n  /**\n   * Resolve the targetGraph for a hop. Priority:\n   * 1. Explicit `hop.targetGraph` (user override)\n   * 2. Registry `targetGraph` for the axbType (if registry available)\n   * 3. undefined (no cross-graph)\n   */\n  private resolveTargetGraph(hop: HopDefinition): string | undefined {\n    if (hop.targetGraph) return hop.targetGraph;\n\n    if (this.registry) {\n      const entries = this.registry.lookupByAxbType(hop.axbType);\n      // All entries for the same axbType should share targetGraph; use the first non-undefined\n      for (const entry of entries) {\n        if (entry.targetGraph) return entry.targetGraph;\n      }\n    }\n\n    return undefined;\n  }\n}\n\n/** @internal Reset the one-time cross-graph warning flag (for testing). */\nexport function _resetCrossGraphWarning(): void {\n  _crossGraphWarned = false;\n}\n\n/**\n * Create a traversal builder for multi-hop graph traversal.\n *\n * Accepts either a `GraphReader` (backwards compatible) or a `GraphClient`.\n * When a `GraphClient` is provided, cross-graph traversal via `targetGraph`\n * is supported — the traversal can follow edges into subgraphs.\n *\n * @param reader - A `GraphClient` or `GraphReader` to execute queries against\n * @param startUid - UID of the starting node\n * @param registry - Optional registry for automatic `targetGraph` resolution\n */\nexport function createTraversal(\n  reader: GraphClient | GraphReader,\n  startUid: string,\n  registry?: GraphRegistry,\n): TraversalBuilder {\n  return new TraversalBuilderImpl(reader, startUid, registry);\n}\n","/**\n * Model Views — framework-agnostic view definitions for graph entities.\n *\n * Projects define Web Components that render entity data in purpose-driven\n * ways. Each view class declares a static `viewName`, and receives the\n * entity's `data` payload via a `data` property setter.\n *\n * @example\n * ```ts\n * import { defineViews } from 'firegraph';\n *\n * class UserCard extends HTMLElement {\n *   static viewName = 'card';\n *   static description = 'Compact user card';\n *   private _data: Record<string, unknown> = {};\n *   set data(v: Record<string, unknown>) { this._data = v; this.render(); }\n *   connectedCallback() { this.render(); }\n *   private render() {\n *     this.innerHTML = `<strong>${this._data.displayName ?? ''}</strong>`;\n *   }\n * }\n *\n * export default defineViews({\n *   nodes: { user: { views: [UserCard] } },\n * });\n * ```\n */\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\n/**\n * A Web Component class used as a view. The class must have a static\n * `viewName` and must be constructable. It will be registered as a custom\n * element via `customElements.define()` in browser environments.\n *\n * Note: this interface avoids referencing `HTMLElement` directly so the\n * library can compile without DOM lib types. Consumer code (which has DOM)\n * will satisfy this constraint naturally.\n */\nexport interface ViewComponentClass {\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  new (...args: any[]): { data: Record<string, unknown> };\n  /** Short identifier for this view (e.g. 'card', 'profile'). */\n  viewName: string;\n  /** Optional human-readable description. */\n  description?: string;\n}\n\n/** Configuration for all views of a single entity type. */\nexport interface EntityViewConfig {\n  /** View component classes to register. */\n  views: ViewComponentClass[];\n  /**\n   * Optional sample data for the gallery. A single object matching\n   * the entity's JSON Schema — shared across all views.\n   */\n  sampleData?: Record<string, unknown>;\n}\n\n/** Input shape accepted by `defineViews()`. */\nexport interface ViewRegistryInput {\n  /** Node views keyed by aType (e.g. 'user', 'tour'). */\n  nodes?: Record<string, EntityViewConfig>;\n  /** Edge views keyed by axbType (e.g. 'hasDeparture'). */\n  edges?: Record<string, EntityViewConfig>;\n}\n\n/** Serialisable metadata for a single view. */\nexport interface ViewMeta {\n  /** Custom element tag name (e.g. 'fg-user-card'). */\n  tagName: string;\n  /** Short identifier matching the component's static viewName. */\n  viewName: string;\n  /** Optional human-readable description. */\n  description?: string;\n}\n\n/** Serialisable metadata for all views of a single entity type. */\nexport interface EntityViewMeta {\n  views: ViewMeta[];\n  sampleData?: Record<string, unknown>;\n}\n\n/** The resolved view registry returned by `defineViews()`. */\nexport interface ViewRegistry {\n  nodes: Record<string, EntityViewMeta>;\n  edges: Record<string, EntityViewMeta>;\n}\n\n// ---------------------------------------------------------------------------\n// Helpers\n// ---------------------------------------------------------------------------\n\n/** Sanitise a string for use as part of a custom element tag name. */\nfunction sanitizeTagPart(s: string): string {\n  return s\n    .toLowerCase()\n    .replace(/[^a-z0-9]/g, '-')\n    .replace(/-+/g, '-')\n    .replace(/^-|-$/g, '');\n}\n\n/** Minimal interface for CustomElementRegistry (avoids depending on DOM lib). */\ninterface CustomElementRegistryLike {\n  get(name: string): unknown;\n  define(name: string, constructor: unknown): void;\n}\n\n/**\n * Try to access the browser's `customElements` registry.\n * Returns `null` in Node.js or environments without Web Components support.\n */\nfunction getCustomElements(): CustomElementRegistryLike | null {\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  const g = globalThis as any;\n  if (g.customElements && typeof g.customElements.define === 'function') {\n    return g.customElements as CustomElementRegistryLike;\n  }\n  return null;\n}\n\n/**\n * Wrap a view class so that errors in connectedCallback, disconnectedCallback,\n * and the data setter are caught and logged rather than crashing the page.\n * Shows an inline error message when the view fails to render.\n */\nfunction resilientView(ViewClass: ViewComponentClass, tagName: string): ViewComponentClass {\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  const g = globalThis as any;\n  if (!g.HTMLElement) return ViewClass; // Node.js — no wrapping needed\n\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  const Base = g.HTMLElement as any;\n\n  const Wrapped = class extends (ViewClass as unknown as typeof Base) {\n    connectedCallback() {\n      try {\n        super.connectedCallback?.();\n      } catch (err) {\n        console.warn(`[firegraph] <${tagName}> connectedCallback error:`, err);\n        this._showError(err);\n      }\n    }\n\n    disconnectedCallback() {\n      try {\n        super.disconnectedCallback?.();\n      } catch (err) {\n        console.warn(`[firegraph] <${tagName}> disconnectedCallback error:`, err);\n      }\n    }\n\n    set data(v: Record<string, unknown>) {\n      try {\n        super.data = v;\n      } catch (err) {\n        console.warn(`[firegraph] <${tagName}> data setter error:`, err);\n        this._showError(err);\n      }\n    }\n\n    get data(): Record<string, unknown> {\n      try {\n        return super.data;\n      } catch {\n        return {};\n      }\n    }\n\n    _showError(err: unknown) {\n      try {\n        this.innerHTML = `<div style=\"padding:6px;color:#f87171;font-size:11px;font-family:monospace;\">` +\n          `View error in &lt;${tagName}&gt;: ${err instanceof Error ? err.message : String(err)}</div>`;\n      } catch { /* last resort — don't throw from error handler */ }\n    }\n  };\n\n  // Preserve static metadata\n  (Wrapped as unknown as ViewComponentClass).viewName = ViewClass.viewName;\n  (Wrapped as unknown as ViewComponentClass).description = ViewClass.description;\n\n  return Wrapped as unknown as ViewComponentClass;\n}\n\n// ---------------------------------------------------------------------------\n// defineViews()\n// ---------------------------------------------------------------------------\n\n/**\n * Build a `ViewRegistry` from component classes.\n *\n * In the browser the components are registered as custom elements with\n * deterministic tag names (`fg-{entityType}-{viewName}`). On the server\n * (Node.js) only metadata is returned — no custom element registration.\n */\nexport function defineViews(input: ViewRegistryInput): ViewRegistry {\n  const nodes: Record<string, EntityViewMeta> = {};\n  const edges: Record<string, EntityViewMeta> = {};\n  const registry = getCustomElements();\n\n  // --- nodes ---\n  for (const [entityType, config] of Object.entries(input.nodes ?? {})) {\n    const viewMetas: ViewMeta[] = [];\n    for (const ViewClass of config.views) {\n      const tagName = `fg-${sanitizeTagPart(entityType)}-${sanitizeTagPart(ViewClass.viewName)}`;\n      viewMetas.push({\n        tagName,\n        viewName: ViewClass.viewName,\n        description: ViewClass.description,\n      });\n      if (registry && !registry.get(tagName)) {\n        registry.define(tagName, resilientView(ViewClass, tagName));\n      }\n    }\n    nodes[entityType] = {\n      views: viewMetas,\n      sampleData: config.sampleData,\n    };\n  }\n\n  // --- edges ---\n  for (const [axbType, config] of Object.entries(input.edges ?? {})) {\n    const viewMetas: ViewMeta[] = [];\n    for (const ViewClass of config.views) {\n      const tagName = `fg-edge-${sanitizeTagPart(axbType)}-${sanitizeTagPart(ViewClass.viewName)}`;\n      viewMetas.push({\n        tagName,\n        viewName: ViewClass.viewName,\n        description: ViewClass.description,\n      });\n      if (registry && !registry.get(tagName)) {\n        registry.define(tagName, resilientView(ViewClass, tagName));\n      }\n    }\n    edges[axbType] = {\n      views: viewMetas,\n      sampleData: config.sampleData,\n    };\n  }\n\n  return { nodes, edges };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiHO,SAAS,aAAa,QAA0C;AACrE,SAAO;AACT;AAeO,SAAS,YACd,gBACA,oBACA,SACQ;AACR,MAAI,CAAC,eAAgB,QAAO;AAE5B,QAAM,YAAY,IAAI,IAAI,kBAAkB;AAE5C,MAAI,SAAS;AACX,UAAM,iBAAiB,eAAe,OAAO;AAC7C,QAAI,kBAAkB,UAAU,IAAI,cAAc,GAAG;AACnD,aAAO;AAAA,IACT;AAAA,EACF;AAEA,MAAI,eAAe,WAAW,UAAU,IAAI,eAAe,OAAO,GAAG;AACnE,WAAO,eAAe;AAAA,EACxB;AAEA,SAAO;AACT;;;AClHO,SAAS,0BACd,gBACA,KACe;AACf,QAAM,WAAW,eAAe,MAAM,GAAG;AAGzC,WAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK,GAAG;AAC3C,QAAI,SAAS,CAAC,MAAM,KAAK;AAEvB,aAAO,SAAS,MAAM,GAAG,CAAC,EAAE,KAAK,GAAG;AAAA,IACtC;AAAA,EACF;AAEA,SAAO;AACT;AASO,SAAS,cACd,gBACA,KACS;AACT,SAAO,0BAA0B,gBAAgB,GAAG,MAAM;AAC5D;;;ACnCA,SAAS,cAAc,aAAa,YAAY,gBAAgB;AAChE,SAAS,qBAAqB;AAC9B,SAAS,MAAM,eAAe;AAKvB,IAAM,iBAAN,cAA6B,eAAe;AAAA,EACjD,YAAY,SAAiB;AAC3B,UAAM,SAAS,iBAAiB;AAChC,SAAK,OAAO;AAAA,EACd;AACF;AAMA,SAAS,SAAS,UAA2B;AAC3C,MAAI;AACF,UAAM,MAAM,aAAa,UAAU,OAAO;AAC1C,WAAO,KAAK,MAAM,GAAG;AAAA,EACvB,SAAS,KAAc;AACrB,UAAM,MAAM,eAAe,cACvB,mBAAmB,QAAQ,KAAK,IAAI,OAAO,KAC3C,eAAe,QAAQ,KAAM,IAAc,OAAO;AACtD,UAAM,IAAI,eAAe,GAAG;AAAA,EAC9B;AACF;AAEA,SAAS,iBAAiB,UAAuC;AAC/D,MAAI,CAAC,WAAW,QAAQ,EAAG,QAAO;AAClC,SAAO,SAAS,QAAQ;AAC1B;AAMA,IAAM,2BAA2B,CAAC,OAAO,OAAO,QAAQ,MAAM;AAM9D,SAAS,WAAW,KAAa,aAA6B;AAE5D,aAAW,OAAO,0BAA0B;AAC1C,UAAM,YAAY,KAAK,KAAK,SAAS,GAAG,EAAE;AAC1C,QAAI,WAAW,SAAS,GAAG;AACzB,aAAO,iBAAiB,WAAW,WAAW;AAAA,IAChD;AAAA,EACF;AAGA,QAAM,WAAW,KAAK,KAAK,aAAa;AACxC,MAAI,WAAW,QAAQ,GAAG;AACxB,WAAO,SAAS,QAAQ;AAAA,EAC1B;AAEA,QAAM,IAAI;AAAA,IACR,sBAAsB,WAAW,OAAO,GAAG;AAAA,EAE7C;AACF;AAEA,IAAI;AAEJ,SAAS,UAAmC;AAC1C,MAAI,CAAC,OAAO;AACV,UAAM,OAAO,OAAO,eAAe,cAAc,aAAa,YAAY;AAC1E,UAAM,aAAa,cAAc,IAAI;AACrC,UAAM,EAAE,WAAW,IAAI,WAAW,MAAM;AACxC,YAAQ,WAAW,MAAM,EAAE,gBAAgB,KAAK,CAAC;AAAA,EACnD;AACA,SAAO;AACT;AAEA,SAAS,iBAAiB,UAAkB,aAA6B;AACvE,MAAI;AACF,UAAM,OAAO,QAAQ;AACrB,UAAM,MAAM,KAAK,QAAQ;AACzB,UAAM,SAAU,OAAO,OAAO,QAAQ,YAAY,aAAa,MAC1D,IAA6B,UAC9B;AAEJ,QAAI,CAAC,UAAU,OAAO,WAAW,UAAU;AACzC,YAAM,IAAI;AAAA,QACR,eAAe,QAAQ,QAAQ,WAAW;AAAA,MAC5C;AAAA,IACF;AACA,WAAO;AAAA,EACT,SAAS,KAAc;AACrB,QAAI,eAAe,eAAgB,OAAM;AACzC,UAAM,IAAI;AAAA,MACR,gCAAgC,QAAQ,QAAQ,WAAW,KAAM,IAAc,OAAO;AAAA,IACxF;AAAA,EACF;AACF;AAMA,IAAM,kBAAkB,CAAC,OAAO,OAAO,QAAQ,MAAM;AAErD,SAAS,cAAc,KAAiC;AACtD,aAAW,OAAO,iBAAiB;AACjC,UAAM,YAAY,KAAK,KAAK,QAAQ,GAAG,EAAE;AACzC,QAAI,WAAW,SAAS,EAAG,QAAO;AAAA,EACpC;AACA,SAAO;AACT;AAMA,IAAM,uBAAuB,CAAC,OAAO,OAAO,QAAQ,MAAM;AAE1D,SAAS,mBAAmB,KAAiC;AAC3D,aAAW,OAAO,sBAAsB;AACtC,UAAM,YAAY,KAAK,KAAK,aAAa,GAAG,EAAE;AAC9C,QAAI,WAAW,SAAS,EAAG,QAAO;AAAA,EACpC;AACA,SAAO;AACT;AAEA,SAAS,eAAe,UAAkB,aAAsC;AAC9E,MAAI;AACF,UAAM,OAAO,QAAQ;AACrB,UAAM,MAAM,KAAK,QAAQ;AACzB,UAAM,aAAc,OAAO,OAAO,QAAQ,YAAY,aAAa,MAC9D,IAA6B,UAC9B;AAEJ,QAAI,CAAC,MAAM,QAAQ,UAAU,GAAG;AAC9B,YAAM,IAAI;AAAA,QACR,mBAAmB,QAAQ,QAAQ,WAAW;AAAA,MAChD;AAAA,IACF;AACA,WAAO;AAAA,EACT,SAAS,KAAc;AACrB,QAAI,eAAe,eAAgB,OAAM;AACzC,UAAM,IAAI;AAAA,MACR,6BAA6B,QAAQ,QAAQ,WAAW,KAAM,IAAc,OAAO;AAAA,IACrF;AAAA,EACF;AACF;AAMA,SAAS,eAAe,KAAa,MAAgC;AACnE,QAAM,SAAS,WAAW,KAAK,cAAc,IAAI,GAAG;AACpD,QAAM,OAAO,iBAAiB,KAAK,KAAK,WAAW,CAAC;AAGpD,QAAM,aAAa,iBAAiB,KAAK,KAAK,aAAa,CAAC;AAG5D,QAAM,YAAY,cAAc,GAAG;AACnC,QAAM,iBAAiB,mBAAmB,GAAG;AAC7C,QAAM,aAAa,iBACf,eAAe,gBAAgB,cAAc,IAAI,GAAG,IACpD;AAEJ,SAAO;AAAA,IACL,MAAM;AAAA,IACN;AAAA,IACA;AAAA,IACA,aAAa,MAAM;AAAA,IACnB,YAAY,MAAM;AAAA,IAClB,eAAe,MAAM;AAAA,IACrB,cAAc,MAAM;AAAA,IACpB;AAAA,IACA;AAAA,IACA,WAAW,MAAM;AAAA,IACjB;AAAA,IACA,oBAAoB,MAAM;AAAA,EAC5B;AACF;AAEA,SAAS,eAAe,KAAa,MAAgC;AACnE,QAAM,SAAS,WAAW,KAAK,cAAc,IAAI,GAAG;AAEpD,QAAM,WAAW,KAAK,KAAK,WAAW;AACtC,MAAI,CAAC,WAAW,QAAQ,GAAG;AACzB,UAAM,IAAI;AAAA,MACR,oCAAoC,IAAI,QAAQ,GAAG;AAAA,IAErD;AAAA,EACF;AACA,QAAM,WAAW,SAAS,QAAQ;AAGlC,MAAI,CAAC,SAAS,MAAM;AAClB,UAAM,IAAI;AAAA,MACR,kBAAkB,IAAI;AAAA,IACxB;AAAA,EACF;AACA,MAAI,CAAC,SAAS,IAAI;AAChB,UAAM,IAAI;AAAA,MACR,kBAAkB,IAAI;AAAA,IACxB;AAAA,EACF;AAEA,QAAM,OAAO,iBAAiB,KAAK,KAAK,WAAW,CAAC;AAGpD,QAAM,aAAa,iBAAiB,KAAK,KAAK,aAAa,CAAC;AAG5D,QAAM,YAAY,cAAc,GAAG;AACnC,QAAM,iBAAiB,mBAAmB,GAAG;AAC7C,QAAM,aAAa,iBACf,eAAe,gBAAgB,cAAc,IAAI,GAAG,IACpD;AAEJ,SAAO;AAAA,IACL,MAAM;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA,aAAa,MAAM;AAAA,IACnB,YAAY,MAAM;AAAA,IAClB,eAAe,MAAM;AAAA,IACrB,cAAc,MAAM;AAAA,IACpB;AAAA,IACA;AAAA,IACA,WAAW,MAAM;AAAA,IACjB,aAAa,SAAS,eAAgB,MAA+C;AAAA,IACrF;AAAA,IACA,oBAAoB,MAAM;AAAA,EAC5B;AACF;AAMA,SAAS,kBAAkB,KAAuB;AAChD,MAAI,CAAC,WAAW,GAAG,EAAG,QAAO,CAAC;AAC9B,SAAO,YAAY,KAAK,EAAE,eAAe,KAAK,CAAC,EAC5C,OAAO,CAAC,MAAM,EAAE,YAAY,CAAC,EAC7B,IAAI,CAAC,MAAM,EAAE,IAAI;AACtB;AAsBO,SAAS,iBAAiB,aAAqC;AACpE,QAAM,SAAS,QAAQ,WAAW;AAElC,MAAI,CAAC,WAAW,MAAM,KAAK,CAAC,SAAS,MAAM,EAAE,YAAY,GAAG;AAC1D,UAAM,IAAI,eAAe,iCAAiC,WAAW,EAAE;AAAA,EACzE;AAEA,QAAM,QAAQ,oBAAI,IAA8B;AAChD,QAAM,QAAQ,oBAAI,IAA8B;AAChD,QAAM,WAA+B,CAAC;AAGtC,QAAM,WAAW,KAAK,QAAQ,OAAO;AACrC,aAAW,QAAQ,kBAAkB,QAAQ,GAAG;AAC9C,UAAM,IAAI,MAAM,eAAe,KAAK,UAAU,IAAI,GAAG,IAAI,CAAC;AAAA,EAC5D;AAGA,QAAM,WAAW,KAAK,QAAQ,OAAO;AACrC,aAAW,QAAQ,kBAAkB,QAAQ,GAAG;AAC9C,UAAM,IAAI,MAAM,eAAe,KAAK,UAAU,IAAI,GAAG,IAAI,CAAC;AAAA,EAC5D;AAGA,QAAM,YAAY,IAAI,IAAI,MAAM,KAAK,CAAC;AACtC,aAAW,CAAC,SAAS,MAAM,KAAK,OAAO;AACrC,UAAM,WAAW,OAAO;AACxB,UAAM,YAAY,MAAM,QAAQ,SAAS,IAAI,IAAI,SAAS,OAAO,CAAC,SAAS,IAAI;AAC/E,UAAM,UAAU,MAAM,QAAQ,SAAS,EAAE,IAAI,SAAS,KAAK,CAAC,SAAS,EAAE;AAEvE,eAAW,OAAO,CAAC,GAAG,WAAW,GAAG,OAAO,GAAG;AAC5C,UAAI,CAAC,UAAU,IAAI,GAAG,GAAG;AACvB,iBAAS,KAAK;AAAA,UACZ,MAAM;AAAA,UACN,SAAS,SAAS,OAAO,2BAA2B,GAAG;AAAA,QACzD,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AAAA,IACL,QAAQ,EAAE,OAAO,MAAM;AAAA,IACvB;AAAA,EACF;AACF;;;AC/UA,SAAS,kBAAkB;;;ACI3B,IAAM,iBAAiB;AACvB,IAAM,sBAAsB;AAC5B,IAAM,gBAAgB;AAEtB,SAAS,MAAM,IAA2B;AACxC,SAAO,IAAI,QAAQ,CAACA,aAAY,WAAWA,UAAS,EAAE,CAAC;AACzD;AAKA,SAAS,MAAS,KAAU,MAAqB;AAC/C,QAAM,SAAgB,CAAC;AACvB,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK,MAAM;AACzC,WAAO,KAAK,IAAI,MAAM,GAAG,IAAI,IAAI,CAAC;AAAA,EACpC;AACA,SAAO;AACT;AAKA,eAAsB,iBACpB,IACA,gBACA,QACA,SACqB;AACrB,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO,EAAE,SAAS,GAAG,SAAS,GAAG,QAAQ,CAAC,EAAE;AAAA,EAC9C;AAEA,QAAM,YAAY,KAAK,IAAI,SAAS,aAAa,gBAAgB,cAAc;AAC/E,QAAM,aAAa,SAAS,cAAc;AAC1C,QAAM,aAAa,SAAS;AAE5B,QAAM,SAAS,MAAM,QAAQ,SAAS;AACtC,QAAM,SAA2B,CAAC;AAClC,MAAI,UAAU;AACd,MAAI,mBAAmB;AAEvB,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAM,MAAM,OAAO,CAAC;AACpB,QAAI,YAAY;AAEhB,aAAS,UAAU,GAAG,WAAW,YAAY,WAAW;AACtD,UAAI;AACF,cAAM,QAAQ,GAAG,MAAM;AACvB,cAAM,gBAAgB,GAAG,WAAW,cAAc;AAClD,mBAAW,MAAM,KAAK;AACpB,gBAAM,OAAO,cAAc,IAAI,EAAE,CAAC;AAAA,QACpC;AACA,cAAM,MAAM,OAAO;AACnB,oBAAY;AACZ,mBAAW,IAAI;AACf;AAAA,MACF,SAAS,KAAK;AACZ,YAAI,UAAU,YAAY;AACxB,gBAAM,QAAQ,gBAAgB,KAAK,IAAI,GAAG,OAAO;AACjD,gBAAM,MAAM,KAAK;AAAA,QACnB,OAAO;AACL,iBAAO,KAAK;AAAA,YACV,YAAY;AAAA,YACZ,OAAO,eAAe,QAAQ,MAAM,IAAI,MAAM,OAAO,GAAG,CAAC;AAAA,YACzD,gBAAgB,IAAI;AAAA,UACtB,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAEA,QAAI,WAAW;AACb;AAAA,IACF;AAEA,QAAI,YAAY;AACd,iBAAW;AAAA,QACT;AAAA,QACA,cAAc,OAAO;AAAA,QACrB,cAAc;AAAA,MAChB,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO,EAAE,SAAS,SAAS,kBAAkB,OAAO;AACtD;AAKA,eAAsB,gBACpB,IACA,gBACA,QACA,QACA,SACqB;AAIrB,QAAM,kBAAkB,OAAO,UAAU,SACrC,EAAE,GAAG,QAAQ,qBAAqB,OAAO,uBAAuB,KAAK,IACrE,EAAE,GAAG,QAAQ,OAAO,GAAG,qBAAqB,OAAO,uBAAuB,KAAK;AACnF,QAAM,QAAQ,MAAM,OAAO,UAAU,eAAe;AACpD,QAAM,SAAS,MAAM,IAAI,CAAC,MAAM,iBAAiB,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC;AAC3E,SAAO,iBAAiB,IAAI,gBAAgB,QAAQ,OAAO;AAC7D;AAkBA,eAAe,8BACb,IACA,gBACA,OACA,SACoC;AACpC,QAAM,SAAS,GAAG,WAAW,cAAc,EAAE,IAAI,KAAK;AACtD,QAAM,iBAAiB,MAAM,OAAO,gBAAgB;AAEpD,MAAI,eAAe,WAAW,EAAG,QAAO,EAAE,SAAS,GAAG,QAAQ,CAAC,EAAE;AAEjE,MAAI,eAAe;AACnB,QAAM,YAA8B,CAAC;AAIrC,QAAM,aAAsC,UACxC,EAAE,WAAW,QAAQ,WAAW,YAAY,QAAQ,WAAW,IAC/D;AAEJ,aAAW,cAAc,gBAAgB;AACvC,UAAM,cAAc,WAAW;AAE/B,UAAM,WAAW,MAAM,WAAW,OAAO,EAAE,IAAI;AAC/C,UAAM,YAAY,SAAS,KAAK,IAAI,CAAC,MAAM,EAAE,EAAE;AAG/C,eAAW,YAAY,WAAW;AAChC,YAAM,YAAY,MAAM,8BAA8B,IAAI,aAAa,UAAU,UAAU;AAC3F,sBAAgB,UAAU;AAC1B,gBAAU,KAAK,GAAG,UAAU,MAAM;AAAA,IACpC;AAGA,QAAI,UAAU,SAAS,GAAG;AACxB,YAAM,SAAS,MAAM,iBAAiB,IAAI,aAAa,WAAW,UAAU;AAC5E,sBAAgB,OAAO;AACvB,gBAAU,KAAK,GAAG,OAAO,MAAM;AAAA,IACjC;AAAA,EACF;AAEA,SAAO,EAAE,SAAS,cAAc,QAAQ,UAAU;AACpD;AAYA,eAAsB,kBACpB,IACA,gBACA,QACA,KACA,SACwB;AAKxB,QAAM,CAAC,aAAa,WAAW,IAAI,MAAM,QAAQ,IAAI;AAAA,IACnD,OAAO,UAAU,EAAE,MAAM,KAAK,qBAAqB,MAAM,OAAO,EAAE,CAAC;AAAA,IACnE,OAAO,UAAU,EAAE,MAAM,KAAK,qBAAqB,MAAM,OAAO,EAAE,CAAC;AAAA,EACrE,CAAC;AACD,QAAM,WAAW,YAAY,OAAO,CAAC,MAAM,EAAE,YAAY,aAAa;AACtE,QAAM,WAAW,YAAY,OAAO,CAAC,MAAM,EAAE,YAAY,aAAa;AAGtE,QAAM,eAAe,oBAAI,IAAY;AACrC,QAAM,WAAgC,CAAC;AACvC,aAAW,QAAQ,CAAC,GAAG,UAAU,GAAG,QAAQ,GAAG;AAC7C,UAAM,QAAQ,iBAAiB,KAAK,MAAM,KAAK,SAAS,KAAK,IAAI;AACjE,QAAI,CAAC,aAAa,IAAI,KAAK,GAAG;AAC5B,mBAAa,IAAI,KAAK;AACtB,eAAS,KAAK,IAAI;AAAA,IACpB;AAAA,EACF;AAGA,QAAM,6BAA6B,SAAS,yBAAyB;AACrE,QAAM,YAAY,iBAAiB,GAAG;AACtC,MAAI,sBAAiD,EAAE,SAAS,GAAG,QAAQ,CAAC,EAAE;AAE9E,MAAI,4BAA4B;AAC9B,0BAAsB,MAAM;AAAA,MAC1B;AAAA,MAAI;AAAA,MAAgB;AAAA,MAAW;AAAA,IACjC;AAAA,EACF;AAGA,QAAM,aAAa,SAAS,IAAI,CAAC,MAAM,iBAAiB,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC;AAClF,QAAM,YAAY,CAAC,GAAG,YAAY,SAAS;AAG3C,QAAM,YAAY,KAAK,IAAI,SAAS,aAAa,gBAAgB,cAAc;AAC/E,QAAM,SAAS,MAAM,iBAAiB,IAAI,gBAAgB,WAAW;AAAA,IACnE,GAAG;AAAA,IACH;AAAA,EACF,CAAC;AAID,QAAM,cAAc,KAAK,KAAK,UAAU,SAAS,SAAS;AAC1D,QAAM,iBAAiB,cAAc;AACrC,QAAM,cAAc,CAAC,OAAO,OAAO,KAAK,CAAC,MAAM,EAAE,eAAe,cAAc;AAI9E,QAAM,uBAAuB,cAAc,OAAO,UAAU,IAAI,OAAO;AAEvE,SAAO;AAAA,IACL,SAAS,OAAO,UAAU,oBAAoB;AAAA,IAC9C,SAAS,OAAO;AAAA,IAChB,QAAQ,CAAC,GAAG,OAAO,QAAQ,GAAG,oBAAoB,MAAM;AAAA,IACxD,cAAc;AAAA,IACd;AAAA,EACF;AACF;;;ACtPO,SAAS,uBACd,IACA,gBACkB;AAClB,QAAM,gBAAgB,GAAG,WAAW,cAAc;AAElD,SAAO;AAAA,IACL;AAAA,IAEA,MAAM,OAAO,OAAkD;AAC7D,YAAM,OAAO,MAAM,cAAc,IAAI,KAAK,EAAE,IAAI;AAChD,UAAI,CAAC,KAAK,OAAQ,QAAO;AACzB,aAAO,KAAK,KAAK;AAAA,IACnB;AAAA,IAEA,MAAM,OAAO,OAAe,MAA8C;AACxE,YAAM,cAAc,IAAI,KAAK,EAAE,IAAI,IAAI;AAAA,IACzC;AAAA,IAEA,MAAM,UAAU,OAAe,MAA8C;AAC3E,YAAM,cAAc,IAAI,KAAK,EAAE,OAAO,IAAI;AAAA,IAC5C;AAAA,IAEA,MAAM,UAAU,OAA8B;AAC5C,YAAM,cAAc,IAAI,KAAK,EAAE,OAAO;AAAA,IACxC;AAAA,IAEA,MAAM,MAAM,SAAwB,SAAsD;AACxF,UAAI,IAAW;AACf,iBAAW,KAAK,SAAS;AACvB,YAAI,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK;AAAA,MACpC;AACA,UAAI,SAAS,SAAS;AACpB,YAAI,EAAE,QAAQ,QAAQ,QAAQ,OAAO,QAAQ,QAAQ,aAAa,KAAK;AAAA,MACzE;AACA,UAAI,SAAS,UAAU,QAAW;AAChC,YAAI,EAAE,MAAM,QAAQ,KAAK;AAAA,MAC3B;AACA,YAAM,OAAO,MAAM,EAAE,IAAI;AACzB,aAAO,KAAK,KAAK,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAsB;AAAA,IAC/D;AAAA,EACF;AACF;AAUO,SAAS,yBACd,IACA,gBACA,IACoB;AACpB,QAAM,gBAAgB,GAAG,WAAW,cAAc;AAElD,SAAO;AAAA,IACL,MAAM,OAAO,OAAkD;AAC7D,YAAM,OAAO,MAAM,GAAG,IAAI,cAAc,IAAI,KAAK,CAAC;AAClD,UAAI,CAAC,KAAK,OAAQ,QAAO;AACzB,aAAO,KAAK,KAAK;AAAA,IACnB;AAAA,IAEA,OAAO,OAAe,MAAqC;AACzD,SAAG,IAAI,cAAc,IAAI,KAAK,GAAG,IAAI;AAAA,IACvC;AAAA,IAEA,UAAU,OAAe,MAAqC;AAC5D,SAAG,OAAO,cAAc,IAAI,KAAK,GAAG,IAAI;AAAA,IAC1C;AAAA,IAEA,UAAU,OAAqB;AAC7B,SAAG,OAAO,cAAc,IAAI,KAAK,CAAC;AAAA,IACpC;AAAA,IAEA,MAAM,MAAM,SAAwB,SAAsD;AACxF,UAAI,IAAW;AACf,iBAAW,KAAK,SAAS;AACvB,YAAI,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK;AAAA,MACpC;AACA,UAAI,SAAS,SAAS;AACpB,YAAI,EAAE,QAAQ,QAAQ,QAAQ,OAAO,QAAQ,QAAQ,aAAa,KAAK;AAAA,MACzE;AACA,UAAI,SAAS,UAAU,QAAW;AAChC,YAAI,EAAE,MAAM,QAAQ,KAAK;AAAA,MAC3B;AACA,YAAM,OAAO,MAAM,GAAG,IAAI,CAAC;AAC3B,aAAO,KAAK,KAAK,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAsB;AAAA,IAC/D;AAAA,EACF;AACF;AASO,SAAS,mBACd,IACA,gBACc;AACd,QAAM,gBAAgB,GAAG,WAAW,cAAc;AAClD,QAAM,QAAQ,GAAG,MAAM;AAEvB,SAAO;AAAA,IACL,OAAO,OAAe,MAAqC;AACzD,YAAM,IAAI,cAAc,IAAI,KAAK,GAAG,IAAI;AAAA,IAC1C;AAAA,IAEA,UAAU,OAAe,MAAqC;AAC5D,YAAM,OAAO,cAAc,IAAI,KAAK,GAAG,IAAI;AAAA,IAC7C;AAAA,IAEA,UAAU,OAAqB;AAC7B,YAAM,OAAO,cAAc,IAAI,KAAK,CAAC;AAAA,IACvC;AAAA,IAEA,MAAM,SAAwB;AAC5B,YAAM,MAAM,OAAO;AAAA,IACrB;AAAA,EACF;AACF;;;ACpHA,IAAI,aAAwE;AAE5E,eAAe,eAA4E;AACzF,MAAI,CAAC,YAAY;AACf,UAAM,MAAM,MAAM,OAAO,yBAAyB;AAClD,iBAAa,IAAI;AAAA,EACnB;AACA,SAAO;AACT;AAWA,SAAS,sBACP,GACA,QACa;AACb,QAAM,EAAE,OAAO,WAAW,IAAI,MAAM,IAAI;AAExC,UAAQ,IAAI;AAAA,IACV,KAAK;AACH,aAAO,EAAE,MAAM,WAAW,KAAK;AAAA,IACjC,KAAK;AACH,aAAO,EAAE,SAAS,WAAW,KAAK;AAAA,IACpC,KAAK;AACH,aAAO,EAAE,SAAS,WAAW,KAAK;AAAA,IACpC,KAAK;AACH,aAAO,EAAE,gBAAgB,WAAW,KAAK;AAAA,IAC3C,KAAK;AACH,aAAO,EAAE,YAAY,WAAW,KAAK;AAAA,IACvC,KAAK;AACH,aAAO,EAAE,mBAAmB,WAAW,KAAK;AAAA,IAC9C,KAAK;AACH,aAAO,EAAE,SAAS,WAAW,KAAuB;AAAA,IACtD,KAAK;AACH,aAAO,EAAE,YAAY,WAAW,KAAuB;AAAA,IACzD,KAAK;AACH,aAAO,EAAE,cAAc,WAAW,KAAK;AAAA,IACzC,KAAK;AACH,aAAO,EAAE,iBAAiB,WAAW,KAAuB;AAAA,IAC9D;AACE,YAAM,IAAI,MAAM,4CAA4C,EAAE,EAAE;AAAA,EACpE;AACF;AAEO,SAAS,2BACd,IACA,gBACsB;AACtB,SAAO;AAAA,IACL,MAAM,MAAM,SAAwB,SAAsD;AACxF,YAAM,IAAI,MAAM,aAAa;AAG7B,UAAI,WAAW,GAAG,SAAS,EAAE,WAAW,cAAc;AAGtD,UAAI,QAAQ,WAAW,GAAG;AACxB,mBAAW,SAAS,MAAM,sBAAsB,GAAG,QAAQ,CAAC,CAAC,CAAC;AAAA,MAChE,WAAW,QAAQ,SAAS,GAAG;AAC7B,cAAM,CAAC,OAAO,QAAQ,GAAG,IAAI,IAAI,QAAQ,IAAI,OAAK,sBAAsB,GAAG,CAAC,CAAC;AAC7E,mBAAW,SAAS,MAAM,EAAE,IAAI,OAAO,QAAQ,GAAG,IAAI,CAAC;AAAA,MACzD;AAGA,UAAI,SAAS,SAAS;AACpB,cAAM,IAAI,EAAE,MAAM,QAAQ,QAAQ,KAAK;AACvC,cAAM,WAAW,QAAQ,QAAQ,cAAc,SAC3C,EAAE,WAAW,IACb,EAAE,UAAU;AAChB,mBAAW,SAAS,KAAK,QAAQ;AAAA,MACnC;AAGA,UAAI,SAAS,UAAU,QAAW;AAChC,mBAAW,SAAS,MAAM,QAAQ,KAAK;AAAA,MACzC;AAEA,YAAM,OAAO,MAAM,SAAS,QAAQ;AACpC,aAAO,KAAK,QAAQ,IAAI,OAAK,EAAE,KAAK,CAAsB;AAAA,IAC5D;AAAA,EACF;AACF;;;AHnDA,SAAS,qBAAqB,QAAuB,IAAwC;AAC3F,QAAM,MAA+B;AAAA,IACnC,WAAW,WAAW,gBAAgB;AAAA,EACxC;AACA,MAAI,OAAO,aAAa;AACtB,QAAI,OAAO,0BAA0B,OAAO,aAAa,EAAE;AAAA,EAC7D;AACA,MAAI,OAAO,YAAY;AACrB,eAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,OAAO,UAAU,GAAG;AACtD,UAAI,QAAQ,CAAC,EAAE,IAAI;AAAA,IACrB;AAAA,EACF;AACA,MAAI,OAAO,MAAM,QAAW;AAC1B,QAAI,IAAI,OAAO;AAAA,EACjB;AACA,SAAO;AACT;AAMA,SAAS,oBAAoB,QAAiD;AAC5E,QAAM,MAAM,WAAW,gBAAgB;AACvC,QAAM,MAA+B;AAAA,IACnC,OAAO,OAAO;AAAA,IACd,MAAM,OAAO;AAAA,IACb,SAAS,OAAO;AAAA,IAChB,OAAO,OAAO;AAAA,IACd,MAAM,OAAO;AAAA,IACb,MAAM,OAAO;AAAA,IACb,WAAW;AAAA,IACX,WAAW;AAAA,EACb;AACA,MAAI,OAAO,MAAM,OAAW,KAAI,IAAI,OAAO;AAC3C,SAAO;AACT;AAEA,IAAM,8BAAN,MAAgE;AAAA,EAC9D,YACmB,SACA,IACjB;AAFiB;AACA;AAAA,EAChB;AAAA,EAEH,OAAO,OAAkD;AACvD,WAAO,KAAK,QAAQ,OAAO,KAAK;AAAA,EAClC;AAAA,EAEA,MAAM,SAAwB,SAAsD;AAClF,WAAO,KAAK,QAAQ,MAAM,SAAS,OAAO;AAAA,EAC5C;AAAA,EAEA,MAAM,OAAO,OAAe,QAAuC;AACjE,SAAK,QAAQ,OAAO,OAAO,oBAAoB,MAAM,CAAC;AAAA,EACxD;AAAA,EAEA,MAAM,UAAU,OAAe,QAAsC;AACnE,SAAK,QAAQ,UAAU,OAAO,qBAAqB,QAAQ,KAAK,EAAE,CAAC;AAAA,EACrE;AAAA,EAEA,MAAM,UAAU,OAA8B;AAC5C,SAAK,QAAQ,UAAU,KAAK;AAAA,EAC9B;AACF;AAEA,IAAM,wBAAN,MAAoD;AAAA,EAClD,YACmB,SACA,IACjB;AAFiB;AACA;AAAA,EAChB;AAAA,EAEH,OAAO,OAAe,QAA8B;AAClD,SAAK,QAAQ,OAAO,OAAO,oBAAoB,MAAM,CAAC;AAAA,EACxD;AAAA,EAEA,UAAU,OAAe,QAA6B;AACpD,SAAK,QAAQ,UAAU,OAAO,qBAAqB,QAAQ,KAAK,EAAE,CAAC;AAAA,EACrE;AAAA,EAEA,UAAU,OAAqB;AAC7B,SAAK,QAAQ,UAAU,KAAK;AAAA,EAC9B;AAAA,EAEA,SAAwB;AACtB,WAAO,KAAK,QAAQ,OAAO;AAAA,EAC7B;AACF;AAEA,IAAM,uBAAN,MAAM,sBAA+C;AAAA,EAMnD,YACmB,IACjB,gBACiB,WACjB,WACA;AAJiB;AAEA;AAGjB,SAAK,iBAAiB;AACtB,SAAK,YAAY;AACjB,SAAK,UAAU,uBAAuB,IAAI,cAAc;AACxD,QAAI,cAAc,YAAY;AAC5B,WAAK,kBAAkB,2BAA2B,IAAI,cAAc;AAAA,IACtE;AAAA,EACF;AAAA,EAjBS;AAAA,EACA;AAAA,EACQ;AAAA,EACA;AAAA;AAAA,EAkBjB,OAAO,OAAkD;AACvD,WAAO,KAAK,QAAQ,OAAO,KAAK;AAAA,EAClC;AAAA,EAEA,MAAM,SAAwB,SAAsD;AAClF,QAAI,KAAK,iBAAiB;AACxB,aAAO,KAAK,gBAAgB,MAAM,SAAS,OAAO;AAAA,IACpD;AACA,WAAO,KAAK,QAAQ,MAAM,SAAS,OAAO;AAAA,EAC5C;AAAA;AAAA,EAIA,OAAO,OAAe,QAAuC;AAC3D,WAAO,KAAK,QAAQ,OAAO,OAAO,oBAAoB,MAAM,CAAC;AAAA,EAC/D;AAAA,EAEA,UAAU,OAAe,QAAsC;AAC7D,WAAO,KAAK,QAAQ,UAAU,OAAO,qBAAqB,QAAQ,KAAK,EAAE,CAAC;AAAA,EAC5E;AAAA,EAEA,UAAU,OAA8B;AACtC,WAAO,KAAK,QAAQ,UAAU,KAAK;AAAA,EACrC;AAAA;AAAA,EAIA,eAAkB,IAAwD;AACxE,WAAO,KAAK,GAAG,eAAe,OAAO,gBAA6B;AAChE,YAAM,YAAY,yBAAyB,KAAK,IAAI,KAAK,gBAAgB,WAAW;AACpF,aAAO,GAAG,IAAI,4BAA4B,WAAW,KAAK,EAAE,CAAC;AAAA,IAC/D,CAAC;AAAA,EACH;AAAA,EAEA,cAA4B;AAC1B,UAAM,eAAe,mBAAmB,KAAK,IAAI,KAAK,cAAc;AACpE,WAAO,IAAI,sBAAsB,cAAc,KAAK,EAAE;AAAA,EACxD;AAAA;AAAA,EAIA,SAAS,eAAuB,MAA8B;AAC5D,UAAM,UAAU,GAAG,KAAK,cAAc,IAAI,aAAa,IAAI,IAAI;AAC/D,UAAM,WAAW,KAAK,YAAY,GAAG,KAAK,SAAS,IAAI,IAAI,KAAK;AAChE,WAAO,IAAI,sBAAqB,KAAK,IAAI,SAAS,KAAK,WAAW,QAAQ;AAAA,EAC5E;AAAA;AAAA,EAIA,kBACE,KACA,QACA,SACwB;AACxB,WAAO,kBAAsB,KAAK,IAAI,KAAK,gBAAgB,QAAQ,KAAK,OAAO;AAAA,EACjF;AAAA,EAEA,gBACE,QACA,QACA,SACqB;AACrB,WAAO,gBAAoB,KAAK,IAAI,KAAK,gBAAgB,QAAQ,QAAQ,OAAO;AAAA,EAClF;AAAA;AAAA,EAIA,MAAM,gBACJ,QACA,gBAC8B;AAC9B,UAAM,OAAO,kBAAkB,KAAK,eAAe,MAAM,GAAG,EAAE,IAAI;AAClE,UAAM,OAAO,mBAAmB,MAAM;AAEtC,QAAI,KAAK,aAAa,OAAO;AAC3B,YAAM,IAAI;AAAA,QACR;AAAA,QAEA;AAAA,MACF;AAAA,IACF;AAEA,UAAM,qBAAqB,KAAK,GAAG,gBAAgB,IAAI;AACvD,QAAI,IAAW;AACf,eAAW,KAAK,KAAK,SAAS;AAC5B,UAAI,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK;AAAA,IACpC;AACA,QAAI,KAAK,SAAS,SAAS;AACzB,UAAI,EAAE,QAAQ,KAAK,QAAQ,QAAQ,OAAO,KAAK,QAAQ,QAAQ,aAAa,KAAK;AAAA,IACnF;AACA,QAAI,KAAK,SAAS,UAAU,QAAW;AACrC,UAAI,EAAE,MAAM,KAAK,QAAQ,KAAK;AAAA,IAChC;AACA,UAAM,OAAO,MAAM,EAAE,IAAI;AACzB,WAAO,KAAK,KAAK,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAsB;AAAA,EAC/D;AACF;AASO,SAAS,uBACd,IACA,gBACA,UAAmC,CAAC,GACpB;AAChB,QAAM,YAAY,QAAQ,aAAa;AACvC,QAAM,YAAY,QAAQ,aAAa;AACvC,SAAO,IAAI,qBAAqB,IAAI,gBAAgB,WAAW,SAAS;AAC1E;;;AIrQA,IAAI,sBAAsB;AAYnB,SAAS,kBACd,IACA,gBACA,SACkC;AAClC,QAAM,gBAAgB,SAAS,aAAa;AAC5C,QAAM,aAAa,CAAC,CAAC,QAAQ,IAAI;AACjC,QAAM,gBAA2B,aAAa,aAAa;AAE3D,MACE,kBAAkB,cAClB,CAAC,cACD,kBAAkB,cAClB,CAAC,qBACD;AACA,0BAAsB;AACtB,YAAQ;AAAA,MACN;AAAA,IAIF;AAAA,EACF;AAEA,QAAM,UAAU,uBAAuB,IAAI,gBAAgB,EAAE,WAAW,cAAc,CAAC;AAEvF,MAAI;AACJ,MAAI,SAAS,cAAc,cAAc,QAAQ,aAAa,eAAe,gBAAgB;AAC3F,kBAAc,uBAAuB,IAAI,QAAQ,aAAa,YAAY;AAAA,MACxE,WAAW;AAAA,IACb,CAAC;AAAA,EACH;AAEA,SAAO,IAAI,gBAAgB,SAAS,SAAS,WAAW;AAC1D;;;ACnEA,SAAS,cAAc;AAEhB,SAAS,aAAqB;AACnC,SAAO,OAAO;AAChB;;;ACsBA,SAAS,YAAY,YAAsC;AACzD,SAAO;AAAA,IACL;AAAA,MACE,iBAAiB;AAAA,MACjB,YAAY;AAAA,MACZ,QAAQ;AAAA,QACN,EAAE,WAAW,QAAQ,OAAO,YAAY;AAAA,QACxC,EAAE,WAAW,WAAW,OAAO,YAAY;AAAA,MAC7C;AAAA,IACF;AAAA,IACA;AAAA,MACE,iBAAiB;AAAA,MACjB,YAAY;AAAA,MACZ,QAAQ;AAAA,QACN,EAAE,WAAW,WAAW,OAAO,YAAY;AAAA,QAC3C,EAAE,WAAW,QAAQ,OAAO,YAAY;AAAA,MAC1C;AAAA,IACF;AAAA,IACA;AAAA,MACE,iBAAiB;AAAA,MACjB,YAAY;AAAA,MACZ,QAAQ;AAAA,QACN,EAAE,WAAW,SAAS,OAAO,YAAY;AAAA,QACzC,EAAE,WAAW,WAAW,OAAO,YAAY;AAAA,MAC7C;AAAA,IACF;AAAA,IACA;AAAA,MACE,iBAAiB;AAAA,MACjB,YAAY;AAAA,MACZ,QAAQ;AAAA,QACN,EAAE,WAAW,WAAW,OAAO,YAAY;AAAA,QAC3C,EAAE,WAAW,SAAS,OAAO,YAAY;AAAA,MAC3C;AAAA,IACF;AAAA,EACF;AACF;AAMA,SAAS,oBAAoB,QAA0B;AACrD,QAAM,IAAI;AACV,MAAI,EAAE,SAAS,YAAY,CAAC,EAAE,WAAY,QAAO,CAAC;AAClD,SAAO,OAAO,KAAK,EAAE,UAAqC;AAC5D;AAUA,SAAS,uBAAuB,gBAA0C;AACxE,SAAO;AAAA,IACL;AAAA,MACE,iBAAiB;AAAA,MACjB,YAAY;AAAA,MACZ,QAAQ;AAAA,QACN,EAAE,WAAW,QAAQ,OAAO,YAAY;AAAA,QACxC,EAAE,WAAW,WAAW,OAAO,YAAY;AAAA,MAC7C;AAAA,IACF;AAAA,IACA;AAAA,MACE,iBAAiB;AAAA,MACjB,YAAY;AAAA,MACZ,QAAQ;AAAA,QACN,EAAE,WAAW,WAAW,OAAO,YAAY;AAAA,QAC3C,EAAE,WAAW,QAAQ,OAAO,YAAY;AAAA,MAC1C;AAAA,IACF;AAAA,IACA;AAAA,MACE,iBAAiB;AAAA,MACjB,YAAY;AAAA,MACZ,QAAQ;AAAA,QACN,EAAE,WAAW,SAAS,OAAO,YAAY;AAAA,QACzC,EAAE,WAAW,WAAW,OAAO,YAAY;AAAA,MAC7C;AAAA,IACF;AAAA,IACA;AAAA,MACE,iBAAiB;AAAA,MACjB,YAAY;AAAA,MACZ,QAAQ;AAAA,QACN,EAAE,WAAW,WAAW,OAAO,YAAY;AAAA,QAC3C,EAAE,WAAW,SAAS,OAAO,YAAY;AAAA,MAC3C;AAAA,IACF;AAAA,EACF;AACF;AAoBO,SAAS,oBACd,YACA,UACA,iBACsB;AACtB,QAAM,UAAU,YAAY,UAAU;AAEtC,MAAI,UAAU;AAIZ,eAAW,CAAC,EAAE,MAAM,KAAK,SAAS,OAAO;AACvC,YAAM,SAAS,oBAAoB,OAAO,MAAM;AAChD,iBAAW,SAAS,QAAQ;AAC1B,gBAAQ,KAAK;AAAA,UACX,iBAAiB;AAAA,UACjB,YAAY;AAAA,UACZ,QAAQ;AAAA,YACN,EAAE,WAAW,SAAS,OAAO,YAAY;AAAA,YACzC,EAAE,WAAW,WAAW,OAAO,YAAY;AAAA,YAC3C,EAAE,WAAW,QAAQ,KAAK,IAAI,OAAO,YAAY;AAAA,UACnD;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AAIA,eAAW,CAAC,EAAE,MAAM,KAAK,SAAS,OAAO;AACvC,YAAM,SAAS,oBAAoB,OAAO,MAAM;AAChD,iBAAW,SAAS,QAAQ;AAC1B,gBAAQ,KAAK;AAAA,UACX,iBAAiB;AAAA,UACjB,YAAY;AAAA,UACZ,QAAQ;AAAA,YACN,EAAE,WAAW,QAAQ,OAAO,YAAY;AAAA,YACxC,EAAE,WAAW,WAAW,OAAO,YAAY;AAAA,YAC3C,EAAE,WAAW,QAAQ,KAAK,IAAI,OAAO,YAAY;AAAA,UACnD;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAIA,MAAI,iBAAiB;AACnB,UAAM,mBAAmB,oBAAI,IAAY;AACzC,eAAW,SAAS,iBAAiB;AACnC,UAAI,MAAM,aAAa;AACrB,yBAAiB,IAAI,MAAM,WAAW;AAAA,MACxC;AAAA,IACF;AACA,eAAW,QAAQ,kBAAkB;AACnC,cAAQ,KAAK,GAAG,uBAAuB,IAAI,CAAC;AAAA,IAC9C;AAAA,EACF;AAEA,SAAO,EAAE,SAAS,gBAAgB,CAAC,EAAE;AACvC;;;ACnMA,SAAS,cAAAC,mBAAkB;AAIpB,SAAS,gBACd,OACA,KACA,MACa;AACb,QAAM,MAAMC,YAAW,gBAAgB;AACvC,SAAO;AAAA,IACL;AAAA,IACA,MAAM;AAAA,IACN,SAAS;AAAA,IACT,OAAO;AAAA,IACP,MAAM;AAAA,IACN;AAAA,IACA,WAAW;AAAA,IACX,WAAW;AAAA,EACb;AACF;AAEO,SAAS,gBACd,OACA,MACA,SACA,OACA,MACA,MACa;AACb,QAAM,MAAMA,YAAW,gBAAgB;AACvC,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,WAAW;AAAA,IACX,WAAW;AAAA,EACb;AACF;;;AC3BA,IAAM,gBAAgB;AACtB,IAAM,oBAAoB;AAC1B,IAAM,sBAAsB;AAG5B,IAAI,oBAAoB;AAGxB,SAAS,cAAc,QAA4C;AACjE,SAAO,cAAc,UAAU,OAAQ,OAAuB,aAAa;AAC7E;AAEA,IAAM,YAAN,MAAgB;AAAA,EAId,YAA6B,OAAe;AAAf;AAAA,EAAgB;AAAA,EAHrC,QAA2B,CAAC;AAAA,EAC5B,SAAS;AAAA,EAIjB,MAAM,UAAyB;AAC7B,QAAI,KAAK,SAAS,KAAK,OAAO;AAC5B,WAAK;AACL;AAAA,IACF;AACA,WAAO,IAAI,QAAc,CAACC,aAAY;AACpC,WAAK,MAAM,KAAKA,QAAO;AAAA,IACzB,CAAC;AAAA,EACH;AAAA,EAEA,UAAgB;AACd,SAAK;AACL,UAAM,OAAO,KAAK,MAAM,MAAM;AAC9B,QAAI,MAAM;AACR,WAAK;AACL,WAAK;AAAA,IACP;AAAA,EACF;AACF;AAEA,IAAM,uBAAN,MAAuD;AAAA,EAGrD,YACmB,QACA,UACA,UACjB;AAHiB;AACA;AACA;AAAA,EAChB;AAAA,EANc,OAAwB,CAAC;AAAA,EAQ1C,OAAO,SAAiB,SAA4D;AAClF,SAAK,KAAK,KAAK,EAAE,SAAS,GAAG,QAAQ,CAAC;AACtC,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,IAAI,SAAsD;AAC9D,QAAI,KAAK,KAAK,WAAW,GAAG;AAC1B,YAAM,IAAI,eAAe,8CAA8C;AAAA,IACzE;AAEA,UAAM,WAAW,SAAS,YAAY;AACtC,UAAM,cAAc,SAAS,eAAe;AAC5C,UAAM,sBAAsB,SAAS,uBAAuB;AAC5D,UAAM,YAAY,IAAI,UAAU,WAAW;AAE3C,QAAI,aAAa;AACjB,QAAI,YAAY;AAIhB,QAAI,UAAuD;AAAA,MACzD,EAAE,KAAK,KAAK,UAAU,QAAQ,KAAK,OAAO;AAAA,IAC5C;AACA,UAAM,aAA0B,CAAC;AAEjC,aAAS,QAAQ,GAAG,QAAQ,KAAK,KAAK,QAAQ,SAAS;AACrD,YAAM,MAAM,KAAK,KAAK,KAAK;AAE3B,UAAI,QAAQ,WAAW,GAAG;AACxB,mBAAW,KAAK;AAAA,UACd,SAAS,IAAI;AAAA,UACb;AAAA,UACA,OAAO,CAAC;AAAA,UACR,aAAa;AAAA,UACb,WAAW;AAAA,QACb,CAAC;AACD;AAAA,MACF;AAEA,YAAM,WAAoE,CAAC;AAC3E,YAAM,cAAc,QAAQ;AAC5B,UAAI,eAAe;AAKnB,YAAM,sBAAsB,KAAK,mBAAmB,GAAG;AACvD,YAAM,YAAY,IAAI,aAAa;AACnC,YAAM,eAAe,cAAc,aAAa,CAAC,CAAC;AAElD,YAAM,QAAQ,QAAQ,IAAI,CAAC,EAAE,KAAK,QAAQ,aAAa,MAAM,YAAY;AACvE,YAAI,cAAc,UAAU;AAC1B,yBAAe;AACf;AAAA,QACF;AAEA,cAAM,UAAU,QAAQ;AACxB,YAAI;AACF,cAAI,cAAc,UAAU;AAC1B,2BAAe;AACf;AAAA,UACF;AAEA;AAEA,gBAAM,SAA0B,EAAE,SAAS,IAAI,QAAQ;AAEvD,cAAI,cAAc,WAAW;AAC3B,mBAAO,OAAO;AACd,gBAAI,IAAI,MAAO,QAAO,QAAQ,IAAI;AAAA,UACpC,OAAO;AACL,mBAAO,OAAO;AACd,gBAAI,IAAI,MAAO,QAAO,QAAQ,IAAI;AAAA,UACpC;AAEA,cAAI,cAAc,aAAa,IAAI,OAAO;AACxC,mBAAO,QAAQ,IAAI;AAAA,UACrB;AACA,cAAI,cAAc,aAAa,IAAI,OAAO;AACxC,mBAAO,QAAQ,IAAI;AAAA,UACrB;AAEA,cAAI,IAAI,QAAS,QAAO,UAAU,IAAI;AAEtC,gBAAM,QAAQ,IAAI,SAAS;AAC3B,cAAI,IAAI,QAAQ;AACd,mBAAO,QAAQ;AAAA,UACjB,OAAO;AACL,mBAAO,QAAQ;AAAA,UACjB;AAOA,cAAI;AACJ,cAAI;AACJ,cAAI,cAAc;AAChB,gBAAI,cAAc,KAAK,MAAM,GAAG;AAC9B,0BAAY,KAAK,OAAO,SAAS,KAAK,mBAAoB;AAC1D,2BAAa;AAAA,YACf,OAAO;AACL,0BAAY;AACZ,2BAAa;AACb,kBAAI,CAAC,mBAAmB;AACtB,oCAAoB;AACpB,wBAAQ;AAAA,kBACN,8BAA8B,IAAI,OAAO,sBAAsB,mBAAmB;AAAA,gBAGpF;AAAA,cACF;AAAA,YACF;AAAA,UACF,OAAO;AAEL,wBAAY;AACZ,yBAAa;AAAA,UACf;AAEA,cAAIC,SAAQ,MAAM,UAAU,UAAU,MAAM;AAE5C,cAAI,IAAI,QAAQ;AACd,YAAAA,SAAQA,OAAM,OAAO,IAAI,MAAM;AAC/B,YAAAA,SAAQA,OAAM,MAAM,GAAG,KAAK;AAAA,UAC9B;AAEA,qBAAW,QAAQA,QAAO;AACxB,qBAAS,KAAK,EAAE,MAAM,QAAQ,WAAW,CAAC;AAAA,UAC5C;AAAA,QACF,UAAE;AACA,oBAAU,QAAQ;AAAA,QACpB;AAAA,MACF,CAAC;AAED,YAAM,QAAQ,IAAI,MAAM,IAAI,CAAC,SAAS,KAAK,CAAC,CAAC;AAE7C,YAAM,QAAQ,SAAS,IAAI,CAAC,MAAM,EAAE,IAAI;AAExC,iBAAW,KAAK;AAAA,QACd,SAAS,IAAI;AAAA,QACb;AAAA,QACA,OAAO,sBAAsB,CAAC,GAAG,KAAK,IAAI;AAAA,QAC1C;AAAA,QACA,WAAW;AAAA,MACb,CAAC;AAED,UAAI,cAAc;AAChB,oBAAY;AAAA,MACd;AAIA,YAAM,OAAO,oBAAI,IAAyB;AAC1C,iBAAW,EAAE,MAAM,QAAQ,WAAW,KAAK,UAAU;AACnD,cAAM,UAAU,cAAc,YAAY,KAAK,OAAO,KAAK;AAC3D,YAAI,CAAC,KAAK,IAAI,OAAO,GAAG;AACtB,eAAK,IAAI,SAAS,UAAU;AAAA,QAC9B;AAAA,MACF;AACA,gBAAU,CAAC,GAAG,KAAK,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,MAAM,OAAO,EAAE,KAAK,OAAO,EAAE;AAAA,IACxE;AAEA,UAAM,UAAU,WAAW,WAAW,SAAS,CAAC;AAEhD,WAAO;AAAA,MACL,OAAO,QAAQ;AAAA,MACf,MAAM;AAAA,MACN;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,mBAAmB,KAAwC;AACjE,QAAI,IAAI,YAAa,QAAO,IAAI;AAEhC,QAAI,KAAK,UAAU;AACjB,YAAM,UAAU,KAAK,SAAS,gBAAgB,IAAI,OAAO;AAEzD,iBAAW,SAAS,SAAS;AAC3B,YAAI,MAAM,YAAa,QAAO,MAAM;AAAA,MACtC;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AACF;AAkBO,SAAS,gBACd,QACA,UACA,UACkB;AAClB,SAAO,IAAI,qBAAqB,QAAQ,UAAU,QAAQ;AAC5D;;;ACrLA,SAAS,gBAAgB,GAAmB;AAC1C,SAAO,EACJ,YAAY,EACZ,QAAQ,cAAc,GAAG,EACzB,QAAQ,OAAO,GAAG,EAClB,QAAQ,UAAU,EAAE;AACzB;AAYA,SAAS,oBAAsD;AAE7D,QAAM,IAAI;AACV,MAAI,EAAE,kBAAkB,OAAO,EAAE,eAAe,WAAW,YAAY;AACrE,WAAO,EAAE;AAAA,EACX;AACA,SAAO;AACT;AAOA,SAAS,cAAc,WAA+B,SAAqC;AAEzF,QAAM,IAAI;AACV,MAAI,CAAC,EAAE,YAAa,QAAO;AAG3B,QAAM,OAAO,EAAE;AAEf,QAAM,UAAU,cAAe,UAAqC;AAAA,IAClE,oBAAoB;AAClB,UAAI;AACF,cAAM,oBAAoB;AAAA,MAC5B,SAAS,KAAK;AACZ,gBAAQ,KAAK,gBAAgB,OAAO,8BAA8B,GAAG;AACrE,aAAK,WAAW,GAAG;AAAA,MACrB;AAAA,IACF;AAAA,IAEA,uBAAuB;AACrB,UAAI;AACF,cAAM,uBAAuB;AAAA,MAC/B,SAAS,KAAK;AACZ,gBAAQ,KAAK,gBAAgB,OAAO,iCAAiC,GAAG;AAAA,MAC1E;AAAA,IACF;AAAA,IAEA,IAAI,KAAK,GAA4B;AACnC,UAAI;AACF,cAAM,OAAO;AAAA,MACf,SAAS,KAAK;AACZ,gBAAQ,KAAK,gBAAgB,OAAO,wBAAwB,GAAG;AAC/D,aAAK,WAAW,GAAG;AAAA,MACrB;AAAA,IACF;AAAA,IAEA,IAAI,OAAgC;AAClC,UAAI;AACF,eAAO,MAAM;AAAA,MACf,QAAQ;AACN,eAAO,CAAC;AAAA,MACV;AAAA,IACF;AAAA,IAEA,WAAW,KAAc;AACvB,UAAI;AACF,aAAK,YAAY,kGACM,OAAO,SAAS,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,MACzF,QAAQ;AAAA,MAAqD;AAAA,IAC/D;AAAA,EACF;AAGA,EAAC,QAA0C,WAAW,UAAU;AAChE,EAAC,QAA0C,cAAc,UAAU;AAEnE,SAAO;AACT;AAaO,SAAS,YAAY,OAAwC;AAClE,QAAM,QAAwC,CAAC;AAC/C,QAAM,QAAwC,CAAC;AAC/C,QAAM,WAAW,kBAAkB;AAGnC,aAAW,CAAC,YAAY,MAAM,KAAK,OAAO,QAAQ,MAAM,SAAS,CAAC,CAAC,GAAG;AACpE,UAAM,YAAwB,CAAC;AAC/B,eAAW,aAAa,OAAO,OAAO;AACpC,YAAM,UAAU,MAAM,gBAAgB,UAAU,CAAC,IAAI,gBAAgB,UAAU,QAAQ,CAAC;AACxF,gBAAU,KAAK;AAAA,QACb;AAAA,QACA,UAAU,UAAU;AAAA,QACpB,aAAa,UAAU;AAAA,MACzB,CAAC;AACD,UAAI,YAAY,CAAC,SAAS,IAAI,OAAO,GAAG;AACtC,iBAAS,OAAO,SAAS,cAAc,WAAW,OAAO,CAAC;AAAA,MAC5D;AAAA,IACF;AACA,UAAM,UAAU,IAAI;AAAA,MAClB,OAAO;AAAA,MACP,YAAY,OAAO;AAAA,IACrB;AAAA,EACF;AAGA,aAAW,CAAC,SAAS,MAAM,KAAK,OAAO,QAAQ,MAAM,SAAS,CAAC,CAAC,GAAG;AACjE,UAAM,YAAwB,CAAC;AAC/B,eAAW,aAAa,OAAO,OAAO;AACpC,YAAM,UAAU,WAAW,gBAAgB,OAAO,CAAC,IAAI,gBAAgB,UAAU,QAAQ,CAAC;AAC1F,gBAAU,KAAK;AAAA,QACb;AAAA,QACA,UAAU,UAAU;AAAA,QACpB,aAAa,UAAU;AAAA,MACzB,CAAC;AACD,UAAI,YAAY,CAAC,SAAS,IAAI,OAAO,GAAG;AACtC,iBAAS,OAAO,SAAS,cAAc,WAAW,OAAO,CAAC;AAAA,MAC5D;AAAA,IACF;AACA,UAAM,OAAO,IAAI;AAAA,MACf,OAAO;AAAA,MACP,YAAY,OAAO;AAAA,IACrB;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,MAAM;AACxB;","names":["resolve","FieldValue","FieldValue","resolve","edges"]}
+{"version":3,"sources":["../src/config.ts","../src/cross-graph.ts","../src/discover.ts","../src/internal/firestore-backend.ts","../src/bulk.ts","../src/internal/firestore-adapter.ts","../src/internal/pipeline-adapter.ts","../src/firestore.ts","../src/id.ts","../src/indexes.ts","../src/record.ts","../src/traverse.ts","../src/views.ts"],"sourcesContent":["/**\n * Firegraph Configuration — project-level config file support.\n *\n * Projects create a `firegraph.config.ts` (or `.js`/`.mjs`) in their root:\n *\n * @example\n * ```ts\n * import { defineConfig } from 'firegraph';\n *\n * export default defineConfig({\n *   entities: './entities',\n *   project: 'my-project',\n *   collection: 'graph',\n * });\n * ```\n */\n\nimport type { DynamicRegistryConfig, QueryMode } from './types.js';\n\n// ---------------------------------------------------------------------------\n// View Resolution Types\n// ---------------------------------------------------------------------------\n\n/** Display contexts where views can appear. */\nexport type ViewContext = 'listing' | 'detail' | 'inline';\n\n/** View resolution configuration for a single entity type. */\nexport interface ViewResolverConfig {\n  /** Default view name (e.g. 'card'). Falls back to 'json' if unset. */\n  default?: string;\n  /** View to use in NodeBrowser listing rows. */\n  listing?: string;\n  /** View to use on the NodeDetail page. */\n  detail?: string;\n  /** View to use for inline/embedded previews (edge rows, traversal). */\n  inline?: string;\n}\n\n/** Declarative view defaults, keyed by entity type. */\nexport interface ViewDefaultsConfig {\n  /** Node view defaults keyed by aType (e.g. 'user', 'task'). */\n  nodes?: Record<string, ViewResolverConfig>;\n  /** Edge view defaults keyed by axbType (e.g. 'hasDeparture'). */\n  edges?: Record<string, ViewResolverConfig>;\n}\n\n// ---------------------------------------------------------------------------\n// Config Shape\n// ---------------------------------------------------------------------------\n\n/** Project-level firegraph configuration. */\nexport interface FiregraphConfig {\n  /** Path to entities directory (per-entity folder convention). */\n  entities?: string;\n  /** GCP project ID. */\n  project?: string;\n  /** Firestore collection path (default: 'graph'). */\n  collection?: string;\n  /** Firestore emulator address (e.g. '127.0.0.1:8080'). */\n  emulator?: string;\n  /**\n   * Query execution backend.\n   *\n   * - `'pipeline'` (default) — Uses Firestore Pipeline API. Requires Enterprise\n   *   Firestore. Enables indexless queries on `data.*` fields.\n   * - `'standard'` — Uses standard Firestore `.where().get()` queries. Not\n   *   recommended for production. See README for risk details.\n   *\n   * When the emulator is active, always falls back to `'standard'`.\n   */\n  queryMode?: QueryMode;\n\n  /**\n   * AI chat configuration. Auto-detects `claude` CLI on PATH by default.\n   * Set to `false` to disable chat even if claude is available.\n   */\n  chat?:\n    | false\n    | {\n        /** Claude model to use (default: 'sonnet'). */\n        model?: string;\n        /** Maximum concurrent claude processes (default: 2). */\n        maxConcurrency?: number;\n      };\n\n  /** Editor-specific settings. */\n  editor?: {\n    /** Server port (default: 3883). */\n    port?: number;\n    /** Force read-only mode. */\n    readonly?: boolean;\n  };\n\n  /** Declarative view defaults per entity type (overrides per-entity meta.json). */\n  viewDefaults?: ViewDefaultsConfig;\n\n  /**\n   * Dynamic registry mode. When set, the editor loads type definitions\n   * from Firestore meta-nodes in addition to filesystem entities.\n   * Filesystem types take precedence on name conflicts.\n   */\n  registryMode?: DynamicRegistryConfig;\n}\n\n// ---------------------------------------------------------------------------\n// defineConfig()\n// ---------------------------------------------------------------------------\n\n/**\n * Identity function providing type-checking and autocomplete for config files.\n *\n * @example\n * ```ts\n * import { defineConfig } from 'firegraph';\n * export default defineConfig({ entities: './entities' });\n * ```\n */\nexport function defineConfig(config: FiregraphConfig): FiregraphConfig {\n  return config;\n}\n\n// ---------------------------------------------------------------------------\n// View Resolution (pure — works client-side and server-side)\n// ---------------------------------------------------------------------------\n\n/**\n * Resolve which view to show for a given entity.\n *\n * 1. If `context` is provided and a context-specific default exists, use it.\n * 2. Falls back to `resolverConfig.default`.\n * 3. Ultimate fallback: `'json'`.\n *\n * Only returns view names that exist in `availableViewNames`.\n */\nexport function resolveView(\n  resolverConfig: ViewResolverConfig | undefined,\n  availableViewNames: string[],\n  context?: ViewContext,\n): string {\n  if (!resolverConfig) return 'json';\n\n  const available = new Set(availableViewNames);\n\n  if (context) {\n    const contextDefault = resolverConfig[context];\n    if (contextDefault && available.has(contextDefault)) {\n      return contextDefault;\n    }\n  }\n\n  if (resolverConfig.default && available.has(resolverConfig.default)) {\n    return resolverConfig.default;\n  }\n\n  return 'json';\n}\n","/**\n * Cross-graph edge resolution utilities.\n *\n * Provides path-scanning resolution for determining whether an edge's source\n * (aUid) is an ancestor node by checking if the UID appears in the Firestore\n * collection path.\n *\n * Firestore paths have a rigid alternating structure:\n *   collection / docId / collection / docId / collection\n *\n * Given a path like `graph/A/workspace/B/context`, segments at even indices\n * are collection names and odd indices are document IDs. When we find a UID\n * at an odd index, the collection containing that document is the path up to\n * (and including) the preceding even-index segment.\n */\n\n/**\n * Parse a Firestore collection path and determine the collection path\n * where a given UID's document lives, if that UID is an ancestor in the path.\n *\n * @param collectionPath - The full Firestore collection path of the current client\n * @param uid - The UID to search for in the path\n * @returns The collection path containing the UID, or `null` if not found in the path\n *\n * @example\n * ```ts\n * // Path: graph/A/workspace/B/context\n * resolveAncestorCollection('graph/A/workspace/B/context', 'A')\n * // → 'graph'\n *\n * resolveAncestorCollection('graph/A/workspace/B/context', 'B')\n * // → 'graph/A/workspace'\n *\n * resolveAncestorCollection('graph/A/workspace/B/context', 'unknown')\n * // → null\n * ```\n */\nexport function resolveAncestorCollection(\n  collectionPath: string,\n  uid: string,\n): string | null {\n  const segments = collectionPath.split('/');\n\n  // Walk odd-indexed segments (document IDs in Firestore's alternating path structure)\n  for (let i = 1; i < segments.length; i += 2) {\n    if (segments[i] === uid) {\n      // The collection containing this doc is everything up to index i-1\n      return segments.slice(0, i).join('/');\n    }\n  }\n\n  return null;\n}\n\n/**\n * Check whether a UID belongs to an ancestor node by scanning the collection path.\n *\n * @param collectionPath - The full Firestore collection path of the current client\n * @param uid - The UID to check\n * @returns `true` if the UID appears as a document segment in the path\n */\nexport function isAncestorUid(\n  collectionPath: string,\n  uid: string,\n): boolean {\n  return resolveAncestorCollection(collectionPath, uid) !== null;\n}\n","/**\n * Entity Discovery — convention-based auto-discovery of entities from\n * a per-entity folder structure.\n *\n * Scans `entitiesDir/nodes/` and `entitiesDir/edges/` subdirectories.\n * Each subfolder is treated as an entity type.\n *\n * Schema files can be either `schema.json` (plain JSON Schema) or\n * `schema.ts` / `schema.js` (a module whose default export is a JSON Schema\n * object). When both exist, the TS/JS file takes precedence so that authors\n * can compose schemas programmatically while keeping a JSON fallback.\n *\n * @example\n * ```\n * entities/\n *   nodes/\n *     task/\n *       schema.json | schema.ts   (required — one or both)\n *       views.ts                  (optional)\n *       sample.json               (optional)\n *       meta.json                 (optional)\n *   edges/\n *     hasStep/\n *       schema.json | schema.ts   (required — one or both)\n *       edge.json                 (required — topology)\n *       views.ts                  (optional)\n *       sample.json               (optional)\n *       meta.json                 (optional)\n * ```\n */\n\nimport { existsSync, readdirSync, readFileSync, statSync } from 'node:fs';\nimport { createRequire } from 'node:module';\nimport { join, resolve } from 'node:path';\n\nimport type * as jitiNS from 'jiti';\n\nimport type { ViewResolverConfig } from './config.js';\nimport { FiregraphError } from './errors.js';\nimport type {\n  DiscoveredEntity,\n  DiscoveryResult,\n  EdgeTopology,\n  MigrationStep,\n  MigrationWriteBack,\n} from './types.js';\n\nexport class DiscoveryError extends FiregraphError {\n  constructor(message: string) {\n    super(message, 'DISCOVERY_ERROR');\n    this.name = 'DiscoveryError';\n  }\n}\n\n// ---------------------------------------------------------------------------\n// JSON parsing helpers\n// ---------------------------------------------------------------------------\n\nfunction readJson(filePath: string): unknown {\n  try {\n    const raw = readFileSync(filePath, 'utf-8');\n    return JSON.parse(raw);\n  } catch (err: unknown) {\n    const msg =\n      err instanceof SyntaxError\n        ? `Invalid JSON in ${filePath}: ${err.message}`\n        : `Cannot read ${filePath}: ${(err as Error).message}`;\n    throw new DiscoveryError(msg);\n  }\n}\n\nfunction readJsonIfExists(filePath: string): unknown | undefined {\n  if (!existsSync(filePath)) return undefined;\n  return readJson(filePath);\n}\n\n// ---------------------------------------------------------------------------\n// Schema file loading (JSON or TS/JS via jiti)\n// ---------------------------------------------------------------------------\n\nconst SCHEMA_SCRIPT_EXTENSIONS = ['.ts', '.js', '.mts', '.mjs'];\n\n/**\n * Attempt to load a schema from a TS/JS module (default export) or fall back\n * to schema.json. Returns the parsed schema object or throws.\n */\nfunction loadSchema(dir: string, entityLabel: string): object {\n  // Prefer TS/JS schema — allows programmatic composition & shared definitions\n  for (const ext of SCHEMA_SCRIPT_EXTENSIONS) {\n    const candidate = join(dir, `schema${ext}`);\n    if (existsSync(candidate)) {\n      return loadSchemaModule(candidate, entityLabel);\n    }\n  }\n\n  // Fall back to schema.json\n  const jsonPath = join(dir, 'schema.json');\n  if (existsSync(jsonPath)) {\n    return readJson(jsonPath) as object;\n  }\n\n  throw new DiscoveryError(\n    `Missing schema for ${entityLabel} in ${dir}. ` +\n      'Provide a schema.ts (or .js/.mts/.mjs) or schema.json file.',\n  );\n}\n\nlet _jiti: ((id: string) => unknown) | undefined;\n\nfunction getJiti(): (id: string) => unknown {\n  if (!_jiti) {\n    const base = typeof __filename !== 'undefined' ? __filename : import.meta.url;\n    const esmRequire = createRequire(base);\n    const { createJiti } = esmRequire('jiti') as typeof jitiNS;\n    _jiti = createJiti(base, { interopDefault: true });\n  }\n  return _jiti;\n}\n\nfunction loadSchemaModule(filePath: string, entityLabel: string): object {\n  try {\n    const jiti = getJiti();\n    const mod = jiti(filePath) as { default?: unknown } | unknown;\n    const schema =\n      mod && typeof mod === 'object' && 'default' in mod\n        ? (mod as { default: unknown }).default\n        : mod;\n\n    if (!schema || typeof schema !== 'object') {\n      throw new DiscoveryError(\n        `Schema file ${filePath} for ${entityLabel} must default-export a JSON Schema object.`,\n      );\n    }\n    return schema as object;\n  } catch (err: unknown) {\n    if (err instanceof DiscoveryError) throw err;\n    throw new DiscoveryError(\n      `Failed to load schema module ${filePath} for ${entityLabel}: ${(err as Error).message}`,\n    );\n  }\n}\n\n// ---------------------------------------------------------------------------\n// View file detection\n// ---------------------------------------------------------------------------\n\nconst VIEW_EXTENSIONS = ['.ts', '.js', '.mts', '.mjs'];\n\nfunction findViewsFile(dir: string): string | undefined {\n  for (const ext of VIEW_EXTENSIONS) {\n    const candidate = join(dir, `views${ext}`);\n    if (existsSync(candidate)) return candidate;\n  }\n  return undefined;\n}\n\n// ---------------------------------------------------------------------------\n// Migration file detection & loading\n// ---------------------------------------------------------------------------\n\nconst MIGRATION_EXTENSIONS = ['.ts', '.js', '.mts', '.mjs'];\n\nfunction findMigrationsFile(dir: string): string | undefined {\n  for (const ext of MIGRATION_EXTENSIONS) {\n    const candidate = join(dir, `migrations${ext}`);\n    if (existsSync(candidate)) return candidate;\n  }\n  return undefined;\n}\n\nfunction loadMigrations(filePath: string, entityLabel: string): MigrationStep[] {\n  try {\n    const jiti = getJiti();\n    const mod = jiti(filePath) as { default?: unknown } | unknown;\n    const migrations =\n      mod && typeof mod === 'object' && 'default' in mod\n        ? (mod as { default: unknown }).default\n        : mod;\n\n    if (!Array.isArray(migrations)) {\n      throw new DiscoveryError(\n        `Migrations file ${filePath} for ${entityLabel} must default-export an array of MigrationStep.`,\n      );\n    }\n    return migrations as MigrationStep[];\n  } catch (err: unknown) {\n    if (err instanceof DiscoveryError) throw err;\n    throw new DiscoveryError(\n      `Failed to load migrations ${filePath} for ${entityLabel}: ${(err as Error).message}`,\n    );\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Entity loaders\n// ---------------------------------------------------------------------------\n\nfunction loadNodeEntity(dir: string, name: string): DiscoveredEntity {\n  const schema = loadSchema(dir, `node type \"${name}\"`);\n  const meta = readJsonIfExists(join(dir, 'meta.json')) as\n    | {\n        description?: string;\n        titleField?: string;\n        subtitleField?: string;\n        viewDefaults?: ViewResolverConfig;\n        allowedIn?: string[];\n        migrationWriteBack?: MigrationWriteBack;\n      }\n    | undefined;\n  const sampleData = readJsonIfExists(join(dir, 'sample.json')) as\n    | Record<string, unknown>\n    | undefined;\n  const viewsPath = findViewsFile(dir);\n  const migrationsPath = findMigrationsFile(dir);\n  const migrations = migrationsPath\n    ? loadMigrations(migrationsPath, `node type \"${name}\"`)\n    : undefined;\n\n  return {\n    kind: 'node',\n    name,\n    schema,\n    description: meta?.description,\n    titleField: meta?.titleField,\n    subtitleField: meta?.subtitleField,\n    viewDefaults: meta?.viewDefaults,\n    viewsPath,\n    sampleData,\n    allowedIn: meta?.allowedIn,\n    migrations,\n    migrationWriteBack: meta?.migrationWriteBack,\n  };\n}\n\nfunction loadEdgeEntity(dir: string, name: string): DiscoveredEntity {\n  const schema = loadSchema(dir, `edge type \"${name}\"`);\n\n  const edgePath = join(dir, 'edge.json');\n  if (!existsSync(edgePath)) {\n    throw new DiscoveryError(\n      `Missing edge.json for edge type \"${name}\" in ${dir}. ` +\n        'Edge entities must declare topology (from/to node types).',\n    );\n  }\n  const topology = readJson(edgePath) as EdgeTopology;\n\n  // Validate topology shape\n  if (!topology.from) {\n    throw new DiscoveryError(`edge.json for \"${name}\" is missing required \"from\" field`);\n  }\n  if (!topology.to) {\n    throw new DiscoveryError(`edge.json for \"${name}\" is missing required \"to\" field`);\n  }\n\n  const meta = readJsonIfExists(join(dir, 'meta.json')) as\n    | {\n        description?: string;\n        titleField?: string;\n        subtitleField?: string;\n        viewDefaults?: ViewResolverConfig;\n        allowedIn?: string[];\n        targetGraph?: string;\n        migrationWriteBack?: MigrationWriteBack;\n      }\n    | undefined;\n  const sampleData = readJsonIfExists(join(dir, 'sample.json')) as\n    | Record<string, unknown>\n    | undefined;\n  const viewsPath = findViewsFile(dir);\n  const migrationsPath = findMigrationsFile(dir);\n  const migrations = migrationsPath\n    ? loadMigrations(migrationsPath, `edge type \"${name}\"`)\n    : undefined;\n\n  return {\n    kind: 'edge',\n    name,\n    schema,\n    topology,\n    description: meta?.description,\n    titleField: meta?.titleField,\n    subtitleField: meta?.subtitleField,\n    viewDefaults: meta?.viewDefaults,\n    viewsPath,\n    sampleData,\n    allowedIn: meta?.allowedIn,\n    targetGraph:\n      topology.targetGraph ?? (meta as { targetGraph?: string } | undefined)?.targetGraph,\n    migrations,\n    migrationWriteBack: meta?.migrationWriteBack,\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Directory scanner\n// ---------------------------------------------------------------------------\n\nfunction getSubdirectories(dir: string): string[] {\n  if (!existsSync(dir)) return [];\n  return readdirSync(dir, { withFileTypes: true })\n    .filter((d) => d.isDirectory())\n    .map((d) => d.name);\n}\n\n// ---------------------------------------------------------------------------\n// Public API\n// ---------------------------------------------------------------------------\n\nexport interface DiscoveryWarning {\n  code: 'DANGLING_TOPOLOGY_REF';\n  message: string;\n}\n\nexport interface DiscoverResult {\n  result: DiscoveryResult;\n  warnings: DiscoveryWarning[];\n}\n\n/**\n * Scan an entities directory and return all discovered nodes and edges.\n *\n * @param entitiesDir - Path to the entities directory (absolute or relative to cwd)\n * @returns Discovery result with nodes and edges maps, plus any warnings\n */\nexport function discoverEntities(entitiesDir: string): DiscoverResult {\n  const absDir = resolve(entitiesDir);\n\n  if (!existsSync(absDir) || !statSync(absDir).isDirectory()) {\n    throw new DiscoveryError(`Entities directory not found: ${entitiesDir}`);\n  }\n\n  const nodes = new Map<string, DiscoveredEntity>();\n  const edges = new Map<string, DiscoveredEntity>();\n  const warnings: DiscoveryWarning[] = [];\n\n  // Discover nodes\n  const nodesDir = join(absDir, 'nodes');\n  for (const name of getSubdirectories(nodesDir)) {\n    nodes.set(name, loadNodeEntity(join(nodesDir, name), name));\n  }\n\n  // Discover edges\n  const edgesDir = join(absDir, 'edges');\n  for (const name of getSubdirectories(edgesDir)) {\n    edges.set(name, loadEdgeEntity(join(edgesDir, name), name));\n  }\n\n  // Validate topology references\n  const nodeNames = new Set(nodes.keys());\n  for (const [axbType, entity] of edges) {\n    const topology = entity.topology!;\n    const fromTypes = Array.isArray(topology.from) ? topology.from : [topology.from];\n    const toTypes = Array.isArray(topology.to) ? topology.to : [topology.to];\n\n    for (const ref of [...fromTypes, ...toTypes]) {\n      if (!nodeNames.has(ref)) {\n        warnings.push({\n          code: 'DANGLING_TOPOLOGY_REF',\n          message: `Edge \"${axbType}\" references node type \"${ref}\" which was not found in the nodes directory`,\n        });\n      }\n    }\n  }\n\n  return {\n    result: { nodes, edges },\n    warnings,\n  };\n}\n","/**\n * Firestore implementation of `StorageBackend`.\n *\n * Wraps the existing `FirestoreAdapter`, `TransactionAdapter`, and\n * `BatchAdapter` so the Firestore code path keeps the exact behavior it\n * had before the backend abstraction landed.\n */\n\nimport type { Firestore, Query, Transaction } from '@google-cloud/firestore';\nimport { FieldValue } from '@google-cloud/firestore';\n\nimport {\n  bulkRemoveEdges as bulkRemoveEdgesImpl,\n  removeNodeCascade as removeNodeCascadeImpl,\n} from '../bulk.js';\nimport { FiregraphError } from '../errors.js';\nimport { buildEdgeQueryPlan } from '../query.js';\nimport { deserializeFirestoreTypes } from '../serialization.js';\nimport type {\n  BulkOptions,\n  BulkResult,\n  CascadeResult,\n  FindEdgesParams,\n  GraphReader,\n  QueryFilter,\n  QueryMode,\n  QueryOptions,\n  StoredGraphRecord,\n} from '../types.js';\nimport type {\n  BatchBackend,\n  StorageBackend,\n  TransactionBackend,\n  UpdatePayload,\n  WritableRecord,\n} from './backend.js';\nimport type { BatchAdapter, FirestoreAdapter, TransactionAdapter } from './firestore-adapter.js';\nimport {\n  createBatchAdapter,\n  createFirestoreAdapter,\n  createTransactionAdapter,\n} from './firestore-adapter.js';\nimport type { PipelineQueryAdapter } from './pipeline-adapter.js';\nimport { createPipelineQueryAdapter } from './pipeline-adapter.js';\n\nexport interface FirestoreBackendOptions {\n  queryMode?: QueryMode;\n  scopePath?: string;\n}\n\n/**\n * Build the patch payload Firestore expects from an `UpdatePayload`.\n *\n * - `replaceData` sets the whole `data` field at once. Tagged Firestore\n *   types from the migration sandbox are reconstructed here.\n * - `dataFields` uses Firestore's `data.<key>` dotted-path syntax.\n * - `updatedAt` is always stamped with `FieldValue.serverTimestamp()`.\n * - `v` is stamped at the root when provided.\n */\nfunction buildFirestoreUpdate(update: UpdatePayload, db: Firestore): Record<string, unknown> {\n  const out: Record<string, unknown> = {\n    updatedAt: FieldValue.serverTimestamp(),\n  };\n  if (update.replaceData) {\n    out.data = deserializeFirestoreTypes(update.replaceData, db);\n  }\n  if (update.dataFields) {\n    for (const [k, v] of Object.entries(update.dataFields)) {\n      out[`data.${k}`] = v;\n    }\n  }\n  if (update.v !== undefined) {\n    out.v = update.v;\n  }\n  return out;\n}\n\n/**\n * Stamp `createdAt`/`updatedAt` server-timestamp sentinels on a\n * timestampless record. Used for `setDoc`.\n */\nfunction stampWritableRecord(record: WritableRecord): Record<string, unknown> {\n  const now = FieldValue.serverTimestamp();\n  const out: Record<string, unknown> = {\n    aType: record.aType,\n    aUid: record.aUid,\n    axbType: record.axbType,\n    bType: record.bType,\n    bUid: record.bUid,\n    data: record.data,\n    createdAt: now,\n    updatedAt: now,\n  };\n  if (record.v !== undefined) out.v = record.v;\n  return out;\n}\n\nclass FirestoreTransactionBackend implements TransactionBackend {\n  constructor(\n    private readonly adapter: TransactionAdapter,\n    private readonly db: Firestore,\n  ) {}\n\n  getDoc(docId: string): Promise<StoredGraphRecord | null> {\n    return this.adapter.getDoc(docId);\n  }\n\n  query(filters: QueryFilter[], options?: QueryOptions): Promise<StoredGraphRecord[]> {\n    return this.adapter.query(filters, options);\n  }\n\n  async setDoc(docId: string, record: WritableRecord): Promise<void> {\n    this.adapter.setDoc(docId, stampWritableRecord(record));\n  }\n\n  async updateDoc(docId: string, update: UpdatePayload): Promise<void> {\n    this.adapter.updateDoc(docId, buildFirestoreUpdate(update, this.db));\n  }\n\n  async deleteDoc(docId: string): Promise<void> {\n    this.adapter.deleteDoc(docId);\n  }\n}\n\nclass FirestoreBatchBackend implements BatchBackend {\n  constructor(\n    private readonly adapter: BatchAdapter,\n    private readonly db: Firestore,\n  ) {}\n\n  setDoc(docId: string, record: WritableRecord): void {\n    this.adapter.setDoc(docId, stampWritableRecord(record));\n  }\n\n  updateDoc(docId: string, update: UpdatePayload): void {\n    this.adapter.updateDoc(docId, buildFirestoreUpdate(update, this.db));\n  }\n\n  deleteDoc(docId: string): void {\n    this.adapter.deleteDoc(docId);\n  }\n\n  commit(): Promise<void> {\n    return this.adapter.commit();\n  }\n}\n\nclass FirestoreBackendImpl implements StorageBackend {\n  readonly collectionPath: string;\n  readonly scopePath: string;\n  private readonly adapter: FirestoreAdapter;\n  private readonly pipelineAdapter?: PipelineQueryAdapter;\n\n  constructor(\n    private readonly db: Firestore,\n    collectionPath: string,\n    private readonly queryMode: QueryMode,\n    scopePath: string,\n  ) {\n    this.collectionPath = collectionPath;\n    this.scopePath = scopePath;\n    this.adapter = createFirestoreAdapter(db, collectionPath);\n    if (queryMode === 'pipeline') {\n      this.pipelineAdapter = createPipelineQueryAdapter(db, collectionPath);\n    }\n  }\n\n  // --- Reads ---\n\n  getDoc(docId: string): Promise<StoredGraphRecord | null> {\n    return this.adapter.getDoc(docId);\n  }\n\n  query(filters: QueryFilter[], options?: QueryOptions): Promise<StoredGraphRecord[]> {\n    if (this.pipelineAdapter) {\n      return this.pipelineAdapter.query(filters, options);\n    }\n    return this.adapter.query(filters, options);\n  }\n\n  // --- Writes ---\n\n  setDoc(docId: string, record: WritableRecord): Promise<void> {\n    return this.adapter.setDoc(docId, stampWritableRecord(record));\n  }\n\n  updateDoc(docId: string, update: UpdatePayload): Promise<void> {\n    return this.adapter.updateDoc(docId, buildFirestoreUpdate(update, this.db));\n  }\n\n  deleteDoc(docId: string): Promise<void> {\n    return this.adapter.deleteDoc(docId);\n  }\n\n  // --- Transactions / Batches ---\n\n  runTransaction<T>(fn: (tx: TransactionBackend) => Promise<T>): Promise<T> {\n    return this.db.runTransaction(async (firestoreTx: Transaction) => {\n      const txAdapter = createTransactionAdapter(this.db, this.collectionPath, firestoreTx);\n      return fn(new FirestoreTransactionBackend(txAdapter, this.db));\n    });\n  }\n\n  createBatch(): BatchBackend {\n    const batchAdapter = createBatchAdapter(this.db, this.collectionPath);\n    return new FirestoreBatchBackend(batchAdapter, this.db);\n  }\n\n  // --- Subgraphs ---\n\n  subgraph(parentNodeUid: string, name: string): StorageBackend {\n    const subPath = `${this.collectionPath}/${parentNodeUid}/${name}`;\n    const newScope = this.scopePath ? `${this.scopePath}/${name}` : name;\n    return new FirestoreBackendImpl(this.db, subPath, this.queryMode, newScope);\n  }\n\n  // --- Cascade & bulk ---\n\n  removeNodeCascade(\n    uid: string,\n    reader: GraphReader,\n    options?: BulkOptions,\n  ): Promise<CascadeResult> {\n    return removeNodeCascadeImpl(this.db, this.collectionPath, reader, uid, options);\n  }\n\n  bulkRemoveEdges(\n    params: FindEdgesParams,\n    reader: GraphReader,\n    options?: BulkOptions,\n  ): Promise<BulkResult> {\n    return bulkRemoveEdgesImpl(this.db, this.collectionPath, reader, params, options);\n  }\n\n  // --- Cross-collection ---\n\n  async findEdgesGlobal(\n    params: FindEdgesParams,\n    collectionName?: string,\n  ): Promise<StoredGraphRecord[]> {\n    const name = collectionName ?? this.collectionPath.split('/').pop()!;\n    const plan = buildEdgeQueryPlan(params);\n\n    if (plan.strategy === 'get') {\n      throw new FiregraphError(\n        'findEdgesGlobal() requires a query, not a direct document lookup. ' +\n          'Omit one of aUid/axbType/bUid to force a query strategy.',\n        'INVALID_QUERY',\n      );\n    }\n\n    const collectionGroupRef = this.db.collectionGroup(name);\n    let q: Query = collectionGroupRef;\n    for (const f of plan.filters) {\n      q = q.where(f.field, f.op, f.value);\n    }\n    if (plan.options?.orderBy) {\n      q = q.orderBy(plan.options.orderBy.field, plan.options.orderBy.direction ?? 'asc');\n    }\n    if (plan.options?.limit !== undefined) {\n      q = q.limit(plan.options.limit);\n    }\n    const snap = await q.get();\n    return snap.docs.map((doc) => doc.data() as StoredGraphRecord);\n  }\n}\n\n/**\n * Create a Firestore-backed `StorageBackend`.\n *\n * The query-mode auto-fallback for the emulator (`FIRESTORE_EMULATOR_HOST`)\n * is performed at the call site (`createGraphClient`) so that the backend\n * itself doesn't reach into `process.env`.\n */\nexport function createFirestoreBackend(\n  db: Firestore,\n  collectionPath: string,\n  options: FirestoreBackendOptions = {},\n): StorageBackend {\n  const queryMode = options.queryMode ?? 'pipeline';\n  const scopePath = options.scopePath ?? '';\n  return new FirestoreBackendImpl(db, collectionPath, queryMode, scopePath);\n}\n","import type { Firestore } from '@google-cloud/firestore';\n\nimport { computeEdgeDocId, computeNodeDocId } from './docid.js';\nimport { NODE_RELATION } from './internal/constants.js';\nimport type {\n  BulkBatchError,\n  BulkOptions,\n  BulkResult,\n  CascadeResult,\n  FindEdgesParams,\n  GraphReader,\n  StoredGraphRecord,\n} from './types.js';\n\nconst MAX_BATCH_SIZE = 500;\nconst DEFAULT_MAX_RETRIES = 3;\nconst BASE_DELAY_MS = 200;\n\nfunction sleep(ms: number): Promise<void> {\n  return new Promise((resolve) => setTimeout(resolve, ms));\n}\n\n/**\n * Splits an array into chunks of at most `size` elements.\n */\nfunction chunk<T>(arr: T[], size: number): T[][] {\n  const chunks: T[][] = [];\n  for (let i = 0; i < arr.length; i += size) {\n    chunks.push(arr.slice(i, i + size));\n  }\n  return chunks;\n}\n\n/**\n * Deletes a list of document IDs in chunked Firestore batches with retries.\n */\nexport async function bulkDeleteDocIds(\n  db: Firestore,\n  collectionPath: string,\n  docIds: string[],\n  options?: BulkOptions,\n): Promise<BulkResult> {\n  if (docIds.length === 0) {\n    return { deleted: 0, batches: 0, errors: [] };\n  }\n\n  const batchSize = Math.min(options?.batchSize ?? MAX_BATCH_SIZE, MAX_BATCH_SIZE);\n  const maxRetries = options?.maxRetries ?? DEFAULT_MAX_RETRIES;\n  const onProgress = options?.onProgress;\n\n  const chunks = chunk(docIds, batchSize);\n  const errors: BulkBatchError[] = [];\n  let deleted = 0;\n  let completedBatches = 0;\n\n  for (let i = 0; i < chunks.length; i++) {\n    const ids = chunks[i];\n    let committed = false;\n\n    for (let attempt = 0; attempt <= maxRetries; attempt++) {\n      try {\n        const batch = db.batch();\n        const collectionRef = db.collection(collectionPath);\n        for (const id of ids) {\n          batch.delete(collectionRef.doc(id));\n        }\n        await batch.commit();\n        committed = true;\n        deleted += ids.length;\n        break;\n      } catch (err) {\n        if (attempt < maxRetries) {\n          const delay = BASE_DELAY_MS * Math.pow(2, attempt);\n          await sleep(delay);\n        } else {\n          errors.push({\n            batchIndex: i,\n            error: err instanceof Error ? err : new Error(String(err)),\n            operationCount: ids.length,\n          });\n        }\n      }\n    }\n\n    if (committed) {\n      completedBatches++;\n    }\n\n    if (onProgress) {\n      onProgress({\n        completedBatches,\n        totalBatches: chunks.length,\n        deletedSoFar: deleted,\n      });\n    }\n  }\n\n  return { deleted, batches: completedBatches, errors };\n}\n\n/**\n * Finds all edges matching `params`, then deletes them in chunked batches.\n */\nexport async function bulkRemoveEdges(\n  db: Firestore,\n  collectionPath: string,\n  reader: GraphReader,\n  params: FindEdgesParams,\n  options?: BulkOptions,\n): Promise<BulkResult> {\n  // Override default query limit for bulk deletion — we need all matching edges.\n  // limit: 0 bypasses DEFAULT_QUERY_LIMIT; an explicit user limit is preserved.\n  // allowCollectionScan: true — bulk deletion inherently implies scanning.\n  const effectiveParams =\n    params.limit !== undefined\n      ? { ...params, allowCollectionScan: params.allowCollectionScan ?? true }\n      : { ...params, limit: 0, allowCollectionScan: params.allowCollectionScan ?? true };\n  const edges = await reader.findEdges(effectiveParams);\n  const docIds = edges.map((e) => computeEdgeDocId(e.aUid, e.axbType, e.bUid));\n  return bulkDeleteDocIds(db, collectionPath, docIds, options);\n}\n\n/** Result from recursive subcollection deletion. */\ninterface SubcollectionDeleteResult {\n  deleted: number;\n  errors: BulkBatchError[];\n}\n\n/**\n * Recursively delete all documents in all subcollections under a given document.\n * Uses `listCollections()` (Admin SDK) to discover subcollections, then for each\n * subcollection: recurse into each document's subcollections first (depth-first),\n * then bulk delete all documents in the subcollection.\n *\n * The `onProgress` callback is intentionally NOT forwarded to subcollection\n * deletes to avoid confusing callers with interleaved progress from different\n * collection depths.\n */\nasync function deleteSubcollectionsRecursive(\n  db: Firestore,\n  collectionPath: string,\n  docId: string,\n  options?: BulkOptions,\n): Promise<SubcollectionDeleteResult> {\n  const docRef = db.collection(collectionPath).doc(docId);\n  const subcollections = await docRef.listCollections();\n\n  if (subcollections.length === 0) return { deleted: 0, errors: [] };\n\n  let totalDeleted = 0;\n  const allErrors: BulkBatchError[] = [];\n\n  // Strip onProgress for subcollection deletes — callers should only see\n  // top-level progress, not interleaved reports from nested depths.\n  const subOptions: BulkOptions | undefined = options\n    ? { batchSize: options.batchSize, maxRetries: options.maxRetries }\n    : undefined;\n\n  for (const subCollRef of subcollections) {\n    const subCollPath = subCollRef.path;\n    // List all documents in this subcollection\n    const snapshot = await subCollRef.select().get();\n    const subDocIds = snapshot.docs.map((d) => d.id);\n\n    // Depth-first: recurse into each document's subcollections\n    for (const subDocId of subDocIds) {\n      const subResult = await deleteSubcollectionsRecursive(db, subCollPath, subDocId, subOptions);\n      totalDeleted += subResult.deleted;\n      allErrors.push(...subResult.errors);\n    }\n\n    // Now delete all documents in this subcollection\n    if (subDocIds.length > 0) {\n      const result = await bulkDeleteDocIds(db, subCollPath, subDocIds, subOptions);\n      totalDeleted += result.deleted;\n      allErrors.push(...result.errors);\n    }\n  }\n\n  return { deleted: totalDeleted, errors: allErrors };\n}\n\n/**\n * Deletes a node and all of its outgoing and incoming edges.\n *\n * Edges are deleted first in chunked batches, then the node document\n * is deleted in the final batch. This is NOT atomic across batches —\n * if a batch fails after retries, remaining batches still execute.\n *\n * By default, subcollections (subgraphs) under the node's document are\n * recursively deleted. Set `options.deleteSubcollections` to `false` to skip.\n */\nexport async function removeNodeCascade(\n  db: Firestore,\n  collectionPath: string,\n  reader: GraphReader,\n  uid: string,\n  options?: BulkOptions,\n): Promise<CascadeResult> {\n  // Find all edges touching this node (outgoing + incoming).\n  // Filter out the node's own self-loop record (axbType === 'is').\n  // These queries intentionally scan broadly — allowCollectionScan bypasses safety checks.\n  // limit: 0 bypasses the DEFAULT_QUERY_LIMIT to ensure we find all edges.\n  const [outgoingRaw, incomingRaw] = await Promise.all([\n    reader.findEdges({ aUid: uid, allowCollectionScan: true, limit: 0 }),\n    reader.findEdges({ bUid: uid, allowCollectionScan: true, limit: 0 }),\n  ]);\n  const outgoing = outgoingRaw.filter((e) => e.axbType !== NODE_RELATION);\n  const incoming = incomingRaw.filter((e) => e.axbType !== NODE_RELATION);\n\n  // Deduplicate: a self-referencing edge could appear in both lists.\n  const edgeDocIdSet = new Set<string>();\n  const allEdges: StoredGraphRecord[] = [];\n  for (const edge of [...outgoing, ...incoming]) {\n    const docId = computeEdgeDocId(edge.aUid, edge.axbType, edge.bUid);\n    if (!edgeDocIdSet.has(docId)) {\n      edgeDocIdSet.add(docId);\n      allEdges.push(edge);\n    }\n  }\n\n  // Delete subcollections (subgraphs) under this node's document (depth-first).\n  const shouldDeleteSubcollections = options?.deleteSubcollections !== false;\n  const nodeDocId = computeNodeDocId(uid);\n  let subcollectionResult: SubcollectionDeleteResult = { deleted: 0, errors: [] };\n\n  if (shouldDeleteSubcollections) {\n    subcollectionResult = await deleteSubcollectionsRecursive(\n      db,\n      collectionPath,\n      nodeDocId,\n      options,\n    );\n  }\n\n  // Build doc IDs: edges first, then the node last.\n  const edgeDocIds = allEdges.map((e) => computeEdgeDocId(e.aUid, e.axbType, e.bUid));\n  const allDocIds = [...edgeDocIds, nodeDocId];\n\n  // Wrap the progress callback to track overall progress.\n  const batchSize = Math.min(options?.batchSize ?? MAX_BATCH_SIZE, MAX_BATCH_SIZE);\n  const result = await bulkDeleteDocIds(db, collectionPath, allDocIds, {\n    ...options,\n    batchSize,\n  });\n\n  // Determine if the node doc was in a failed batch.\n  // The node is always in the last doc ID. If the last batch errored, node wasn't deleted.\n  const totalChunks = Math.ceil(allDocIds.length / batchSize);\n  const nodeChunkIndex = totalChunks - 1;\n  const nodeDeleted = !result.errors.some((e) => e.batchIndex === nodeChunkIndex);\n\n  // edgesDeleted counts only top-level edges (not subcollection docs).\n  // deleted includes everything: top-level edges + node + subcollection docs.\n  const topLevelEdgesDeleted = nodeDeleted ? result.deleted - 1 : result.deleted;\n\n  return {\n    deleted: result.deleted + subcollectionResult.deleted,\n    batches: result.batches,\n    errors: [...result.errors, ...subcollectionResult.errors],\n    edgesDeleted: topLevelEdgesDeleted,\n    nodeDeleted,\n  };\n}\n","import type { Firestore, Query, Transaction } from '@google-cloud/firestore';\n\nimport type { QueryFilter, QueryOptions, StoredGraphRecord } from '../types.js';\n\nexport interface FirestoreAdapter {\n  collectionPath: string;\n  getDoc(docId: string): Promise<StoredGraphRecord | null>;\n  setDoc(docId: string, data: Record<string, unknown>): Promise<void>;\n  updateDoc(docId: string, data: Record<string, unknown>): Promise<void>;\n  deleteDoc(docId: string): Promise<void>;\n  query(filters: QueryFilter[], options?: QueryOptions): Promise<StoredGraphRecord[]>;\n}\n\nexport function createFirestoreAdapter(db: Firestore, collectionPath: string): FirestoreAdapter {\n  const collectionRef = db.collection(collectionPath);\n\n  return {\n    collectionPath,\n\n    async getDoc(docId: string): Promise<StoredGraphRecord | null> {\n      const snap = await collectionRef.doc(docId).get();\n      if (!snap.exists) return null;\n      return snap.data() as StoredGraphRecord;\n    },\n\n    async setDoc(docId: string, data: Record<string, unknown>): Promise<void> {\n      await collectionRef.doc(docId).set(data);\n    },\n\n    async updateDoc(docId: string, data: Record<string, unknown>): Promise<void> {\n      await collectionRef.doc(docId).update(data);\n    },\n\n    async deleteDoc(docId: string): Promise<void> {\n      await collectionRef.doc(docId).delete();\n    },\n\n    async query(filters: QueryFilter[], options?: QueryOptions): Promise<StoredGraphRecord[]> {\n      let q: Query = collectionRef;\n      for (const f of filters) {\n        q = q.where(f.field, f.op, f.value);\n      }\n      if (options?.orderBy) {\n        q = q.orderBy(options.orderBy.field, options.orderBy.direction ?? 'asc');\n      }\n      if (options?.limit !== undefined) {\n        q = q.limit(options.limit);\n      }\n      const snap = await q.get();\n      return snap.docs.map((doc) => doc.data() as StoredGraphRecord);\n    },\n  };\n}\n\nexport interface TransactionAdapter {\n  getDoc(docId: string): Promise<StoredGraphRecord | null>;\n  setDoc(docId: string, data: Record<string, unknown>): void;\n  updateDoc(docId: string, data: Record<string, unknown>): void;\n  deleteDoc(docId: string): void;\n  query(filters: QueryFilter[], options?: QueryOptions): Promise<StoredGraphRecord[]>;\n}\n\nexport function createTransactionAdapter(\n  db: Firestore,\n  collectionPath: string,\n  tx: Transaction,\n): TransactionAdapter {\n  const collectionRef = db.collection(collectionPath);\n\n  return {\n    async getDoc(docId: string): Promise<StoredGraphRecord | null> {\n      const snap = await tx.get(collectionRef.doc(docId));\n      if (!snap.exists) return null;\n      return snap.data() as StoredGraphRecord;\n    },\n\n    setDoc(docId: string, data: Record<string, unknown>): void {\n      tx.set(collectionRef.doc(docId), data);\n    },\n\n    updateDoc(docId: string, data: Record<string, unknown>): void {\n      tx.update(collectionRef.doc(docId), data);\n    },\n\n    deleteDoc(docId: string): void {\n      tx.delete(collectionRef.doc(docId));\n    },\n\n    async query(filters: QueryFilter[], options?: QueryOptions): Promise<StoredGraphRecord[]> {\n      let q: Query = collectionRef;\n      for (const f of filters) {\n        q = q.where(f.field, f.op, f.value);\n      }\n      if (options?.orderBy) {\n        q = q.orderBy(options.orderBy.field, options.orderBy.direction ?? 'asc');\n      }\n      if (options?.limit !== undefined) {\n        q = q.limit(options.limit);\n      }\n      const snap = await tx.get(q);\n      return snap.docs.map((doc) => doc.data() as StoredGraphRecord);\n    },\n  };\n}\n\nexport interface BatchAdapter {\n  setDoc(docId: string, data: Record<string, unknown>): void;\n  updateDoc(docId: string, data: Record<string, unknown>): void;\n  deleteDoc(docId: string): void;\n  commit(): Promise<void>;\n}\n\nexport function createBatchAdapter(db: Firestore, collectionPath: string): BatchAdapter {\n  const collectionRef = db.collection(collectionPath);\n  const batch = db.batch();\n\n  return {\n    setDoc(docId: string, data: Record<string, unknown>): void {\n      batch.set(collectionRef.doc(docId), data);\n    },\n\n    updateDoc(docId: string, data: Record<string, unknown>): void {\n      batch.update(collectionRef.doc(docId), data);\n    },\n\n    deleteDoc(docId: string): void {\n      batch.delete(collectionRef.doc(docId));\n    },\n\n    async commit(): Promise<void> {\n      await batch.commit();\n    },\n  };\n}\n","/**\n * Pipeline query adapter — translates QueryFilter[] to Firestore Pipeline\n * expressions and executes them via db.pipeline().\n *\n * Only handles query() — doc-level operations (get/set/update/delete) stay\n * on the standard FirestoreAdapter.\n */\nimport type { Firestore, Pipelines } from '@google-cloud/firestore';\n\nimport type { QueryFilter, QueryOptions, StoredGraphRecord } from '../types.js';\n\n/**\n * Minimal interface for the Pipeline query adapter.\n * Only implements the query path — doc operations are handled by FirestoreAdapter.\n */\nexport interface PipelineQueryAdapter {\n  query(filters: QueryFilter[], options?: QueryOptions): Promise<StoredGraphRecord[]>;\n}\n\n/**\n * Lazily loaded Pipelines module. We use dynamic import so that standard-mode\n * users (and the emulator) don't pull in pipeline-related code at module load.\n */\nlet _Pipelines: typeof Pipelines | null = null;\n\nasync function getPipelines(): Promise<typeof Pipelines> {\n  if (!_Pipelines) {\n    const mod = await import('@google-cloud/firestore');\n    _Pipelines = mod.Pipelines;\n  }\n  return _Pipelines;\n}\n\ntype PipelinesType = typeof Pipelines;\ntype BooleanExpr = Pipelines.BooleanExpression;\n\n/**\n * Maps a QueryFilter to a Pipeline BooleanExpression.\n *\n * Uses the string-based overloads (e.g. `equal(fieldName, value)`) which\n * accept `unknown` values, avoiding type issues with `constant()` overloads.\n */\nfunction buildFilterExpression(P: PipelinesType, filter: QueryFilter): BooleanExpr {\n  const { field: fieldName, op, value } = filter;\n\n  switch (op) {\n    case '==':\n      return P.equal(fieldName, value);\n    case '!=':\n      return P.notEqual(fieldName, value);\n    case '<':\n      return P.lessThan(fieldName, value);\n    case '<=':\n      return P.lessThanOrEqual(fieldName, value);\n    case '>':\n      return P.greaterThan(fieldName, value);\n    case '>=':\n      return P.greaterThanOrEqual(fieldName, value);\n    case 'in':\n      return P.equalAny(fieldName, value as Array<unknown>);\n    case 'not-in':\n      return P.notEqualAny(fieldName, value as Array<unknown>);\n    case 'array-contains':\n      return P.arrayContains(fieldName, value);\n    case 'array-contains-any':\n      return P.arrayContainsAny(fieldName, value as Array<unknown>);\n    default:\n      throw new Error(`Unsupported filter op for pipeline mode: ${op}`);\n  }\n}\n\nexport function createPipelineQueryAdapter(\n  db: Firestore,\n  collectionPath: string,\n): PipelineQueryAdapter {\n  return {\n    async query(filters: QueryFilter[], options?: QueryOptions): Promise<StoredGraphRecord[]> {\n      const P = await getPipelines();\n\n      // Build pipeline\n      let pipeline = db.pipeline().collection(collectionPath);\n\n      // Apply filters\n      if (filters.length === 1) {\n        pipeline = pipeline.where(buildFilterExpression(P, filters[0]));\n      } else if (filters.length > 1) {\n        const [first, second, ...rest] = filters.map((f) => buildFilterExpression(P, f));\n        pipeline = pipeline.where(P.and(first, second, ...rest));\n      }\n\n      // Apply sort\n      if (options?.orderBy) {\n        const f = P.field(options.orderBy.field);\n        const ordering = options.orderBy.direction === 'desc' ? f.descending() : f.ascending();\n        pipeline = pipeline.sort(ordering);\n      }\n\n      // Apply limit\n      if (options?.limit !== undefined) {\n        pipeline = pipeline.limit(options.limit);\n      }\n\n      const snap = await pipeline.execute();\n      return snap.results.map((r) => r.data() as StoredGraphRecord);\n    },\n  };\n}\n","/**\n * Firestore-specific client factory.\n *\n * Kept in its own module so that bundlers don't pull\n * `@google-cloud/firestore` into non-Firestore entry points — most\n * importantly the Cloudflare DO backend (`firegraph/cloudflare`) and the\n * routing primitive (`firegraph/backend`), both of which must load cleanly\n * in a Workers environment where the Node Firestore SDK is unavailable.\n */\n\nimport type { Firestore } from '@google-cloud/firestore';\n\nimport { GraphClientImpl } from './client.js';\nimport type { StorageBackend } from './internal/backend.js';\nimport { createFirestoreBackend } from './internal/firestore-backend.js';\nimport type {\n  DynamicGraphClient,\n  DynamicRegistryConfig,\n  GraphClient,\n  GraphClientOptions,\n  QueryMode,\n} from './types.js';\n\nlet _standardModeWarned = false;\n\nexport function createGraphClient(\n  db: Firestore,\n  collectionPath: string,\n  options: GraphClientOptions & { registryMode: DynamicRegistryConfig },\n): DynamicGraphClient;\nexport function createGraphClient(\n  db: Firestore,\n  collectionPath: string,\n  options?: GraphClientOptions,\n): GraphClient;\nexport function createGraphClient(\n  db: Firestore,\n  collectionPath: string,\n  options?: GraphClientOptions,\n): GraphClient | DynamicGraphClient {\n  const requestedMode = options?.queryMode ?? 'pipeline';\n  const isEmulator = !!process.env.FIRESTORE_EMULATOR_HOST;\n  const effectiveMode: QueryMode = isEmulator ? 'standard' : requestedMode;\n\n  if (\n    effectiveMode === 'standard' &&\n    !isEmulator &&\n    requestedMode === 'standard' &&\n    !_standardModeWarned\n  ) {\n    _standardModeWarned = true;\n    console.warn(\n      '[firegraph] Standard query mode enabled. This is NOT recommended for production:\\n' +\n        '  - Enterprise Firestore: data.* filters cause full collection scans (high billing)\\n' +\n        '  - Standard Firestore: data.* filters without composite indexes will fail\\n' +\n        '  See: https://github.com/typicalday/firegraph#query-modes',\n    );\n  }\n\n  const backend = createFirestoreBackend(db, collectionPath, { queryMode: effectiveMode });\n\n  let metaBackend: StorageBackend | undefined;\n  if (options?.registryMode?.collection && options.registryMode.collection !== collectionPath) {\n    metaBackend = createFirestoreBackend(db, options.registryMode.collection, {\n      queryMode: effectiveMode,\n    });\n  }\n\n  return new GraphClientImpl(backend, options, metaBackend) as GraphClient | DynamicGraphClient;\n}\n","import { nanoid } from 'nanoid';\n\nexport function generateId(): string {\n  return nanoid();\n}\n","import type { DiscoveryResult, RegistryEntry } from './types.js';\n\nexport interface FirestoreIndexField {\n  fieldPath: string;\n  order: 'ASCENDING' | 'DESCENDING';\n}\n\nexport interface FirestoreIndex {\n  collectionGroup: string;\n  queryScope: 'COLLECTION' | 'COLLECTION_GROUP';\n  fields: FirestoreIndexField[];\n}\n\nexport interface FirestoreIndexConfig {\n  indexes: FirestoreIndex[];\n  fieldOverrides: unknown[];\n}\n\n/**\n * Base composite indexes required for all firegraph collections.\n * These cover the standard query patterns:\n *   - Forward edge lookup:   (aUid, axbType)\n *   - Reverse edge lookup:   (axbType, bUid)\n *   - Type-scoped queries:   (aType, axbType)  — also covers findNodes\n *   - Edge type + target:    (axbType, bType)\n */\nfunction baseIndexes(collection: string): FirestoreIndex[] {\n  return [\n    {\n      collectionGroup: collection,\n      queryScope: 'COLLECTION',\n      fields: [\n        { fieldPath: 'aUid', order: 'ASCENDING' },\n        { fieldPath: 'axbType', order: 'ASCENDING' },\n      ],\n    },\n    {\n      collectionGroup: collection,\n      queryScope: 'COLLECTION',\n      fields: [\n        { fieldPath: 'axbType', order: 'ASCENDING' },\n        { fieldPath: 'bUid', order: 'ASCENDING' },\n      ],\n    },\n    {\n      collectionGroup: collection,\n      queryScope: 'COLLECTION',\n      fields: [\n        { fieldPath: 'aType', order: 'ASCENDING' },\n        { fieldPath: 'axbType', order: 'ASCENDING' },\n      ],\n    },\n    {\n      collectionGroup: collection,\n      queryScope: 'COLLECTION',\n      fields: [\n        { fieldPath: 'axbType', order: 'ASCENDING' },\n        { fieldPath: 'bType', order: 'ASCENDING' },\n      ],\n    },\n  ];\n}\n\n/**\n * Extracts top-level field names from a JSON Schema object.\n * Only returns fields from schemas with type: \"object\" and properties.\n */\nfunction extractSchemaFields(schema: object): string[] {\n  const s = schema as Record<string, unknown>;\n  if (s.type !== 'object' || !s.properties) return [];\n  return Object.keys(s.properties as Record<string, unknown>);\n}\n\n/**\n * Collection group indexes for `findEdgesGlobal()` queries.\n *\n * These mirror the base collection indexes but with `COLLECTION_GROUP` scope,\n * which allows querying across all subcollections with the given name.\n * Only generated when the registry has edge types with `targetGraph` set,\n * indicating cross-graph edges exist and global queries are likely.\n */\nfunction collectionGroupIndexes(collectionName: string): FirestoreIndex[] {\n  return [\n    {\n      collectionGroup: collectionName,\n      queryScope: 'COLLECTION_GROUP',\n      fields: [\n        { fieldPath: 'aUid', order: 'ASCENDING' },\n        { fieldPath: 'axbType', order: 'ASCENDING' },\n      ],\n    },\n    {\n      collectionGroup: collectionName,\n      queryScope: 'COLLECTION_GROUP',\n      fields: [\n        { fieldPath: 'axbType', order: 'ASCENDING' },\n        { fieldPath: 'bUid', order: 'ASCENDING' },\n      ],\n    },\n    {\n      collectionGroup: collectionName,\n      queryScope: 'COLLECTION_GROUP',\n      fields: [\n        { fieldPath: 'aType', order: 'ASCENDING' },\n        { fieldPath: 'axbType', order: 'ASCENDING' },\n      ],\n    },\n    {\n      collectionGroup: collectionName,\n      queryScope: 'COLLECTION_GROUP',\n      fields: [\n        { fieldPath: 'axbType', order: 'ASCENDING' },\n        { fieldPath: 'bType', order: 'ASCENDING' },\n      ],\n    },\n  ];\n}\n\n/**\n * Generates a Firestore index configuration for a firegraph collection.\n *\n * Always includes the 4 base composite indexes. If an entity discovery result\n * is provided, generates additional data-field indexes for common query\n * patterns on node data fields:\n *   (aType, axbType, data.{field})\n *\n * When registry entries with `targetGraph` are provided, also generates\n * collection group indexes for `findEdgesGlobal()` queries. The collection\n * group name defaults to `'graph'` (the standard subgraph name) but can be\n * overridden per `targetGraph` value.\n *\n * @param collection - Firestore collection name (e.g. 'graph')\n * @param entities - Optional discovery result for per-entity data field indexes\n * @param registryEntries - Optional registry entries; when any have `targetGraph`,\n *   collection group indexes are generated for the distinct subgraph names\n */\nexport function generateIndexConfig(\n  collection: string,\n  entities?: DiscoveryResult,\n  registryEntries?: ReadonlyArray<RegistryEntry>,\n): FirestoreIndexConfig {\n  const indexes = baseIndexes(collection);\n\n  if (entities) {\n    // Generate data-field indexes for node types.\n    // Pattern: (aType, axbType, data.{field}) — covers findNodes with where clauses\n    // and findEdges scoped by aType + axbType + data filter.\n    for (const [, entity] of entities.nodes) {\n      const fields = extractSchemaFields(entity.schema);\n      for (const field of fields) {\n        indexes.push({\n          collectionGroup: collection,\n          queryScope: 'COLLECTION',\n          fields: [\n            { fieldPath: 'aType', order: 'ASCENDING' },\n            { fieldPath: 'axbType', order: 'ASCENDING' },\n            { fieldPath: `data.${field}`, order: 'ASCENDING' },\n          ],\n        });\n      }\n    }\n\n    // Generate data-field indexes for edge types.\n    // Pattern: (aUid, axbType, data.{field}) — covers forward edge lookups with data filters.\n    for (const [, entity] of entities.edges) {\n      const fields = extractSchemaFields(entity.schema);\n      for (const field of fields) {\n        indexes.push({\n          collectionGroup: collection,\n          queryScope: 'COLLECTION',\n          fields: [\n            { fieldPath: 'aUid', order: 'ASCENDING' },\n            { fieldPath: 'axbType', order: 'ASCENDING' },\n            { fieldPath: `data.${field}`, order: 'ASCENDING' },\n          ],\n        });\n      }\n    }\n  }\n\n  // Generate collection group indexes when cross-graph edges exist.\n  // Each distinct targetGraph value gets its own set of collection group indexes.\n  if (registryEntries) {\n    const targetGraphNames = new Set<string>();\n    for (const entry of registryEntries) {\n      if (entry.targetGraph) {\n        targetGraphNames.add(entry.targetGraph);\n      }\n    }\n    for (const name of targetGraphNames) {\n      indexes.push(...collectionGroupIndexes(name));\n    }\n  }\n\n  return { indexes, fieldOverrides: [] };\n}\n","import { FieldValue } from '@google-cloud/firestore';\n\nimport { NODE_RELATION } from './internal/constants.js';\nimport type { GraphRecord } from './types.js';\n\nexport function buildNodeRecord(\n  aType: string,\n  uid: string,\n  data: Record<string, unknown>,\n): GraphRecord {\n  const now = FieldValue.serverTimestamp();\n  return {\n    aType,\n    aUid: uid,\n    axbType: NODE_RELATION,\n    bType: aType,\n    bUid: uid,\n    data,\n    createdAt: now,\n    updatedAt: now,\n  };\n}\n\nexport function buildEdgeRecord(\n  aType: string,\n  aUid: string,\n  axbType: string,\n  bType: string,\n  bUid: string,\n  data: Record<string, unknown>,\n): GraphRecord {\n  const now = FieldValue.serverTimestamp();\n  return {\n    aType,\n    aUid,\n    axbType,\n    bType,\n    bUid,\n    data,\n    createdAt: now,\n    updatedAt: now,\n  };\n}\n","import { TraversalError } from './errors.js';\nimport type {\n  FindEdgesParams,\n  GraphClient,\n  GraphReader,\n  GraphRegistry,\n  HopDefinition,\n  HopResult,\n  StoredGraphRecord,\n  TraversalBuilder,\n  TraversalOptions,\n  TraversalResult,\n} from './types.js';\n\nconst DEFAULT_LIMIT = 10;\nconst DEFAULT_MAX_READS = 100;\nconst DEFAULT_CONCURRENCY = 5;\n\n/** One-time warning flag: emitted when cross-graph hop is silently skipped. */\nlet _crossGraphWarned = false;\n\n/** Type guard to check if a reader is a GraphClient (has subgraph method). */\nfunction isGraphClient(reader: GraphReader): reader is GraphClient {\n  return 'subgraph' in reader && typeof (reader as GraphClient).subgraph === 'function';\n}\n\nclass Semaphore {\n  private queue: Array<() => void> = [];\n  private active = 0;\n\n  constructor(private readonly slots: number) {}\n\n  async acquire(): Promise<void> {\n    if (this.active < this.slots) {\n      this.active++;\n      return;\n    }\n    return new Promise<void>((resolve) => {\n      this.queue.push(resolve);\n    });\n  }\n\n  release(): void {\n    this.active--;\n    const next = this.queue.shift();\n    if (next) {\n      this.active++;\n      next();\n    }\n  }\n}\n\nclass TraversalBuilderImpl implements TraversalBuilder {\n  private readonly hops: HopDefinition[] = [];\n\n  constructor(\n    private readonly reader: GraphReader,\n    private readonly startUid: string,\n    private readonly registry?: GraphRegistry,\n  ) {}\n\n  follow(axbType: string, options?: Omit<HopDefinition, 'axbType'>): TraversalBuilder {\n    this.hops.push({ axbType, ...options });\n    return this;\n  }\n\n  async run(options?: TraversalOptions): Promise<TraversalResult> {\n    if (this.hops.length === 0) {\n      throw new TraversalError('Traversal requires at least one follow() hop');\n    }\n\n    const maxReads = options?.maxReads ?? DEFAULT_MAX_READS;\n    const concurrency = options?.concurrency ?? DEFAULT_CONCURRENCY;\n    const returnIntermediates = options?.returnIntermediates ?? false;\n    const semaphore = new Semaphore(concurrency);\n\n    let totalReads = 0;\n    let truncated = false;\n    // Track (uid, reader) pairs to support context carry-forward across hops.\n    // When a hop crosses into a subgraph, the resulting UIDs carry the subgraph\n    // reader so subsequent hops without targetGraph stay in that subgraph.\n    let sources: Array<{ uid: string; reader: GraphReader }> = [\n      { uid: this.startUid, reader: this.reader },\n    ];\n    const hopResults: HopResult[] = [];\n\n    for (let depth = 0; depth < this.hops.length; depth++) {\n      const hop = this.hops[depth];\n\n      if (sources.length === 0) {\n        hopResults.push({\n          axbType: hop.axbType,\n          depth,\n          edges: [],\n          sourceCount: 0,\n          truncated: false,\n        });\n        continue;\n      }\n\n      const hopEdges: Array<{ edge: StoredGraphRecord; reader: GraphReader }> = [];\n      const sourceCount = sources.length;\n      let hopTruncated = false;\n\n      // Resolve targetGraph for this hop:\n      // 1. Explicit on the hop definition takes precedence\n      // 2. Otherwise check the registry for the axbType\n      const resolvedTargetGraph = this.resolveTargetGraph(hop);\n      const direction = hop.direction ?? 'forward';\n      const isCrossGraph = direction === 'forward' && !!resolvedTargetGraph;\n\n      const tasks = sources.map(({ uid, reader: sourceReader }) => async () => {\n        if (totalReads >= maxReads) {\n          hopTruncated = true;\n          return;\n        }\n\n        await semaphore.acquire();\n        try {\n          if (totalReads >= maxReads) {\n            hopTruncated = true;\n            return;\n          }\n\n          totalReads++;\n\n          const params: FindEdgesParams = { axbType: hop.axbType };\n\n          if (direction === 'forward') {\n            params.aUid = uid;\n            if (hop.bType) params.bType = hop.bType;\n          } else {\n            params.bUid = uid;\n            if (hop.aType) params.aType = hop.aType;\n          }\n\n          if (direction === 'forward' && hop.aType) {\n            params.aType = hop.aType;\n          }\n          if (direction === 'reverse' && hop.bType) {\n            params.bType = hop.bType;\n          }\n\n          if (hop.orderBy) params.orderBy = hop.orderBy;\n\n          const limit = hop.limit ?? DEFAULT_LIMIT;\n          if (hop.filter) {\n            params.limit = 0;\n          } else {\n            params.limit = limit;\n          }\n\n          // Choose the reader for this hop:\n          // - Cross-graph hop: create a subgraph reader from the ROOT client\n          //   (targetGraph is always relative to root)\n          // - No cross-graph: use the carried-forward reader from previous hop\n          //   (context tracking — stay in whatever subgraph we're already in)\n          let hopReader: GraphReader;\n          let nextReader: GraphReader;\n          if (isCrossGraph) {\n            if (isGraphClient(this.reader)) {\n              hopReader = this.reader.subgraph(uid, resolvedTargetGraph!);\n              nextReader = hopReader;\n            } else {\n              hopReader = sourceReader;\n              nextReader = sourceReader;\n              if (!_crossGraphWarned) {\n                _crossGraphWarned = true;\n                console.warn(\n                  `[firegraph] Traversal hop \"${hop.axbType}\" has targetGraph \"${resolvedTargetGraph}\" ` +\n                    'but the reader does not support subgraph(). Cross-graph hop will query the current ' +\n                    'collection instead. Pass a GraphClient to createTraversal() to enable cross-graph traversal.',\n                );\n              }\n            }\n          } else {\n            // No targetGraph — carry forward context from previous hop\n            hopReader = sourceReader;\n            nextReader = sourceReader;\n          }\n\n          let edges = await hopReader.findEdges(params);\n\n          if (hop.filter) {\n            edges = edges.filter(hop.filter);\n            edges = edges.slice(0, limit);\n          }\n\n          for (const edge of edges) {\n            hopEdges.push({ edge, reader: nextReader });\n          }\n        } finally {\n          semaphore.release();\n        }\n      });\n\n      await Promise.all(tasks.map((task) => task()));\n\n      const edges = hopEdges.map((h) => h.edge);\n\n      hopResults.push({\n        axbType: hop.axbType,\n        depth,\n        edges: returnIntermediates ? [...edges] : edges,\n        sourceCount,\n        truncated: hopTruncated,\n      });\n\n      if (hopTruncated) {\n        truncated = true;\n      }\n\n      // Build next sources with deduplication by UID.\n      // When the same UID appears from multiple source readers, the first one wins.\n      const seen = new Map<string, GraphReader>();\n      for (const { edge, reader: edgeReader } of hopEdges) {\n        const nextUid = direction === 'forward' ? edge.bUid : edge.aUid;\n        if (!seen.has(nextUid)) {\n          seen.set(nextUid, edgeReader);\n        }\n      }\n      sources = [...seen.entries()].map(([uid, reader]) => ({ uid, reader }));\n    }\n\n    const lastHop = hopResults[hopResults.length - 1];\n\n    return {\n      nodes: lastHop.edges,\n      hops: hopResults,\n      totalReads,\n      truncated,\n    };\n  }\n\n  /**\n   * Resolve the targetGraph for a hop. Priority:\n   * 1. Explicit `hop.targetGraph` (user override)\n   * 2. Registry `targetGraph` for the axbType (if registry available)\n   * 3. undefined (no cross-graph)\n   */\n  private resolveTargetGraph(hop: HopDefinition): string | undefined {\n    if (hop.targetGraph) return hop.targetGraph;\n\n    if (this.registry) {\n      const entries = this.registry.lookupByAxbType(hop.axbType);\n      // All entries for the same axbType should share targetGraph; use the first non-undefined\n      for (const entry of entries) {\n        if (entry.targetGraph) return entry.targetGraph;\n      }\n    }\n\n    return undefined;\n  }\n}\n\n/** @internal Reset the one-time cross-graph warning flag (for testing). */\nexport function _resetCrossGraphWarning(): void {\n  _crossGraphWarned = false;\n}\n\n/**\n * Create a traversal builder for multi-hop graph traversal.\n *\n * Accepts either a `GraphReader` (backwards compatible) or a `GraphClient`.\n * When a `GraphClient` is provided, cross-graph traversal via `targetGraph`\n * is supported — the traversal can follow edges into subgraphs.\n *\n * @param reader - A `GraphClient` or `GraphReader` to execute queries against\n * @param startUid - UID of the starting node\n * @param registry - Optional registry for automatic `targetGraph` resolution\n */\nexport function createTraversal(\n  reader: GraphClient | GraphReader,\n  startUid: string,\n  registry?: GraphRegistry,\n): TraversalBuilder {\n  return new TraversalBuilderImpl(reader, startUid, registry);\n}\n","/**\n * Model Views — framework-agnostic view definitions for graph entities.\n *\n * Projects define Web Components that render entity data in purpose-driven\n * ways. Each view class declares a static `viewName`, and receives the\n * entity's `data` payload via a `data` property setter.\n *\n * @example\n * ```ts\n * import { defineViews } from 'firegraph';\n *\n * class UserCard extends HTMLElement {\n *   static viewName = 'card';\n *   static description = 'Compact user card';\n *   private _data: Record<string, unknown> = {};\n *   set data(v: Record<string, unknown>) { this._data = v; this.render(); }\n *   connectedCallback() { this.render(); }\n *   private render() {\n *     this.innerHTML = `<strong>${this._data.displayName ?? ''}</strong>`;\n *   }\n * }\n *\n * export default defineViews({\n *   nodes: { user: { views: [UserCard] } },\n * });\n * ```\n */\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\n/**\n * A Web Component class used as a view. The class must have a static\n * `viewName` and must be constructable. It will be registered as a custom\n * element via `customElements.define()` in browser environments.\n *\n * Note: this interface avoids referencing `HTMLElement` directly so the\n * library can compile without DOM lib types. Consumer code (which has DOM)\n * will satisfy this constraint naturally.\n */\nexport interface ViewComponentClass {\n  new (...args: any[]): { data: Record<string, unknown> };\n  /** Short identifier for this view (e.g. 'card', 'profile'). */\n  viewName: string;\n  /** Optional human-readable description. */\n  description?: string;\n}\n\n/** Configuration for all views of a single entity type. */\nexport interface EntityViewConfig {\n  /** View component classes to register. */\n  views: ViewComponentClass[];\n  /**\n   * Optional sample data for the gallery. A single object matching\n   * the entity's JSON Schema — shared across all views.\n   */\n  sampleData?: Record<string, unknown>;\n}\n\n/** Input shape accepted by `defineViews()`. */\nexport interface ViewRegistryInput {\n  /** Node views keyed by aType (e.g. 'user', 'tour'). */\n  nodes?: Record<string, EntityViewConfig>;\n  /** Edge views keyed by axbType (e.g. 'hasDeparture'). */\n  edges?: Record<string, EntityViewConfig>;\n}\n\n/** Serialisable metadata for a single view. */\nexport interface ViewMeta {\n  /** Custom element tag name (e.g. 'fg-user-card'). */\n  tagName: string;\n  /** Short identifier matching the component's static viewName. */\n  viewName: string;\n  /** Optional human-readable description. */\n  description?: string;\n}\n\n/** Serialisable metadata for all views of a single entity type. */\nexport interface EntityViewMeta {\n  views: ViewMeta[];\n  sampleData?: Record<string, unknown>;\n}\n\n/** The resolved view registry returned by `defineViews()`. */\nexport interface ViewRegistry {\n  nodes: Record<string, EntityViewMeta>;\n  edges: Record<string, EntityViewMeta>;\n}\n\n// ---------------------------------------------------------------------------\n// Helpers\n// ---------------------------------------------------------------------------\n\n/** Sanitise a string for use as part of a custom element tag name. */\nfunction sanitizeTagPart(s: string): string {\n  return s\n    .toLowerCase()\n    .replace(/[^a-z0-9]/g, '-')\n    .replace(/-+/g, '-')\n    .replace(/^-|-$/g, '');\n}\n\n/** Minimal interface for CustomElementRegistry (avoids depending on DOM lib). */\ninterface CustomElementRegistryLike {\n  get(name: string): unknown;\n  define(name: string, constructor: unknown): void;\n}\n\n/**\n * Try to access the browser's `customElements` registry.\n * Returns `null` in Node.js or environments without Web Components support.\n */\nfunction getCustomElements(): CustomElementRegistryLike | null {\n  const g = globalThis as any;\n  if (g.customElements && typeof g.customElements.define === 'function') {\n    return g.customElements as CustomElementRegistryLike;\n  }\n  return null;\n}\n\n/**\n * Wrap a view class so that errors in connectedCallback, disconnectedCallback,\n * and the data setter are caught and logged rather than crashing the page.\n * Shows an inline error message when the view fails to render.\n */\nfunction resilientView(ViewClass: ViewComponentClass, tagName: string): ViewComponentClass {\n  const g = globalThis as any;\n  if (!g.HTMLElement) return ViewClass; // Node.js — no wrapping needed\n\n  const Wrapped = class extends (ViewClass as unknown as new (...args: any[]) => any) {\n    connectedCallback() {\n      try {\n        super.connectedCallback?.();\n      } catch (err) {\n        console.warn(`[firegraph] <${tagName}> connectedCallback error:`, err);\n        this._showError(err);\n      }\n    }\n\n    disconnectedCallback() {\n      try {\n        super.disconnectedCallback?.();\n      } catch (err) {\n        console.warn(`[firegraph] <${tagName}> disconnectedCallback error:`, err);\n      }\n    }\n\n    set data(v: Record<string, unknown>) {\n      try {\n        super.data = v;\n      } catch (err) {\n        console.warn(`[firegraph] <${tagName}> data setter error:`, err);\n        this._showError(err);\n      }\n    }\n\n    get data(): Record<string, unknown> {\n      try {\n        return super.data;\n      } catch {\n        return {};\n      }\n    }\n\n    _showError(err: unknown) {\n      try {\n        this.innerHTML =\n          `<div style=\"padding:6px;color:#f87171;font-size:11px;font-family:monospace;\">` +\n          `View error in &lt;${tagName}&gt;: ${err instanceof Error ? err.message : String(err)}</div>`;\n      } catch {\n        /* last resort — don't throw from error handler */\n      }\n    }\n  };\n\n  // Preserve static metadata\n  (Wrapped as unknown as ViewComponentClass).viewName = ViewClass.viewName;\n  (Wrapped as unknown as ViewComponentClass).description = ViewClass.description;\n\n  return Wrapped as unknown as ViewComponentClass;\n}\n\n// ---------------------------------------------------------------------------\n// defineViews()\n// ---------------------------------------------------------------------------\n\n/**\n * Build a `ViewRegistry` from component classes.\n *\n * In the browser the components are registered as custom elements with\n * deterministic tag names (`fg-{entityType}-{viewName}`). On the server\n * (Node.js) only metadata is returned — no custom element registration.\n */\nexport function defineViews(input: ViewRegistryInput): ViewRegistry {\n  const nodes: Record<string, EntityViewMeta> = {};\n  const edges: Record<string, EntityViewMeta> = {};\n  const registry = getCustomElements();\n\n  // --- nodes ---\n  for (const [entityType, config] of Object.entries(input.nodes ?? {})) {\n    const viewMetas: ViewMeta[] = [];\n    for (const ViewClass of config.views) {\n      const tagName = `fg-${sanitizeTagPart(entityType)}-${sanitizeTagPart(ViewClass.viewName)}`;\n      viewMetas.push({\n        tagName,\n        viewName: ViewClass.viewName,\n        description: ViewClass.description,\n      });\n      if (registry && !registry.get(tagName)) {\n        registry.define(tagName, resilientView(ViewClass, tagName));\n      }\n    }\n    nodes[entityType] = {\n      views: viewMetas,\n      sampleData: config.sampleData,\n    };\n  }\n\n  // --- edges ---\n  for (const [axbType, config] of Object.entries(input.edges ?? {})) {\n    const viewMetas: ViewMeta[] = [];\n    for (const ViewClass of config.views) {\n      const tagName = `fg-edge-${sanitizeTagPart(axbType)}-${sanitizeTagPart(ViewClass.viewName)}`;\n      viewMetas.push({\n        tagName,\n        viewName: ViewClass.viewName,\n        description: ViewClass.description,\n      });\n      if (registry && !registry.get(tagName)) {\n        registry.define(tagName, resilientView(ViewClass, tagName));\n      }\n    }\n    edges[axbType] = {\n      views: viewMetas,\n      sampleData: config.sampleData,\n    };\n  }\n\n  return { nodes, edges };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAqHO,SAAS,aAAa,QAA0C;AACrE,SAAO;AACT;AAeO,SAAS,YACd,gBACA,oBACA,SACQ;AACR,MAAI,CAAC,eAAgB,QAAO;AAE5B,QAAM,YAAY,IAAI,IAAI,kBAAkB;AAE5C,MAAI,SAAS;AACX,UAAM,iBAAiB,eAAe,OAAO;AAC7C,QAAI,kBAAkB,UAAU,IAAI,cAAc,GAAG;AACnD,aAAO;AAAA,IACT;AAAA,EACF;AAEA,MAAI,eAAe,WAAW,UAAU,IAAI,eAAe,OAAO,GAAG;AACnE,WAAO,eAAe;AAAA,EACxB;AAEA,SAAO;AACT;;;ACtHO,SAAS,0BACd,gBACA,KACe;AACf,QAAM,WAAW,eAAe,MAAM,GAAG;AAGzC,WAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK,GAAG;AAC3C,QAAI,SAAS,CAAC,MAAM,KAAK;AAEvB,aAAO,SAAS,MAAM,GAAG,CAAC,EAAE,KAAK,GAAG;AAAA,IACtC;AAAA,EACF;AAEA,SAAO;AACT;AASO,SAAS,cACd,gBACA,KACS;AACT,SAAO,0BAA0B,gBAAgB,GAAG,MAAM;AAC5D;;;ACnCA,SAAS,YAAY,aAAa,cAAc,gBAAgB;AAChE,SAAS,qBAAqB;AAC9B,SAAS,MAAM,eAAe;AAcvB,IAAM,iBAAN,cAA6B,eAAe;AAAA,EACjD,YAAY,SAAiB;AAC3B,UAAM,SAAS,iBAAiB;AAChC,SAAK,OAAO;AAAA,EACd;AACF;AAMA,SAAS,SAAS,UAA2B;AAC3C,MAAI;AACF,UAAM,MAAM,aAAa,UAAU,OAAO;AAC1C,WAAO,KAAK,MAAM,GAAG;AAAA,EACvB,SAAS,KAAc;AACrB,UAAM,MACJ,eAAe,cACX,mBAAmB,QAAQ,KAAK,IAAI,OAAO,KAC3C,eAAe,QAAQ,KAAM,IAAc,OAAO;AACxD,UAAM,IAAI,eAAe,GAAG;AAAA,EAC9B;AACF;AAEA,SAAS,iBAAiB,UAAuC;AAC/D,MAAI,CAAC,WAAW,QAAQ,EAAG,QAAO;AAClC,SAAO,SAAS,QAAQ;AAC1B;AAMA,IAAM,2BAA2B,CAAC,OAAO,OAAO,QAAQ,MAAM;AAM9D,SAAS,WAAW,KAAa,aAA6B;AAE5D,aAAW,OAAO,0BAA0B;AAC1C,UAAM,YAAY,KAAK,KAAK,SAAS,GAAG,EAAE;AAC1C,QAAI,WAAW,SAAS,GAAG;AACzB,aAAO,iBAAiB,WAAW,WAAW;AAAA,IAChD;AAAA,EACF;AAGA,QAAM,WAAW,KAAK,KAAK,aAAa;AACxC,MAAI,WAAW,QAAQ,GAAG;AACxB,WAAO,SAAS,QAAQ;AAAA,EAC1B;AAEA,QAAM,IAAI;AAAA,IACR,sBAAsB,WAAW,OAAO,GAAG;AAAA,EAE7C;AACF;AAEA,IAAI;AAEJ,SAAS,UAAmC;AAC1C,MAAI,CAAC,OAAO;AACV,UAAM,OAAO,OAAO,eAAe,cAAc,aAAa,YAAY;AAC1E,UAAM,aAAa,cAAc,IAAI;AACrC,UAAM,EAAE,WAAW,IAAI,WAAW,MAAM;AACxC,YAAQ,WAAW,MAAM,EAAE,gBAAgB,KAAK,CAAC;AAAA,EACnD;AACA,SAAO;AACT;AAEA,SAAS,iBAAiB,UAAkB,aAA6B;AACvE,MAAI;AACF,UAAM,OAAO,QAAQ;AACrB,UAAM,MAAM,KAAK,QAAQ;AACzB,UAAM,SACJ,OAAO,OAAO,QAAQ,YAAY,aAAa,MAC1C,IAA6B,UAC9B;AAEN,QAAI,CAAC,UAAU,OAAO,WAAW,UAAU;AACzC,YAAM,IAAI;AAAA,QACR,eAAe,QAAQ,QAAQ,WAAW;AAAA,MAC5C;AAAA,IACF;AACA,WAAO;AAAA,EACT,SAAS,KAAc;AACrB,QAAI,eAAe,eAAgB,OAAM;AACzC,UAAM,IAAI;AAAA,MACR,gCAAgC,QAAQ,QAAQ,WAAW,KAAM,IAAc,OAAO;AAAA,IACxF;AAAA,EACF;AACF;AAMA,IAAM,kBAAkB,CAAC,OAAO,OAAO,QAAQ,MAAM;AAErD,SAAS,cAAc,KAAiC;AACtD,aAAW,OAAO,iBAAiB;AACjC,UAAM,YAAY,KAAK,KAAK,QAAQ,GAAG,EAAE;AACzC,QAAI,WAAW,SAAS,EAAG,QAAO;AAAA,EACpC;AACA,SAAO;AACT;AAMA,IAAM,uBAAuB,CAAC,OAAO,OAAO,QAAQ,MAAM;AAE1D,SAAS,mBAAmB,KAAiC;AAC3D,aAAW,OAAO,sBAAsB;AACtC,UAAM,YAAY,KAAK,KAAK,aAAa,GAAG,EAAE;AAC9C,QAAI,WAAW,SAAS,EAAG,QAAO;AAAA,EACpC;AACA,SAAO;AACT;AAEA,SAAS,eAAe,UAAkB,aAAsC;AAC9E,MAAI;AACF,UAAM,OAAO,QAAQ;AACrB,UAAM,MAAM,KAAK,QAAQ;AACzB,UAAM,aACJ,OAAO,OAAO,QAAQ,YAAY,aAAa,MAC1C,IAA6B,UAC9B;AAEN,QAAI,CAAC,MAAM,QAAQ,UAAU,GAAG;AAC9B,YAAM,IAAI;AAAA,QACR,mBAAmB,QAAQ,QAAQ,WAAW;AAAA,MAChD;AAAA,IACF;AACA,WAAO;AAAA,EACT,SAAS,KAAc;AACrB,QAAI,eAAe,eAAgB,OAAM;AACzC,UAAM,IAAI;AAAA,MACR,6BAA6B,QAAQ,QAAQ,WAAW,KAAM,IAAc,OAAO;AAAA,IACrF;AAAA,EACF;AACF;AAMA,SAAS,eAAe,KAAa,MAAgC;AACnE,QAAM,SAAS,WAAW,KAAK,cAAc,IAAI,GAAG;AACpD,QAAM,OAAO,iBAAiB,KAAK,KAAK,WAAW,CAAC;AAUpD,QAAM,aAAa,iBAAiB,KAAK,KAAK,aAAa,CAAC;AAG5D,QAAM,YAAY,cAAc,GAAG;AACnC,QAAM,iBAAiB,mBAAmB,GAAG;AAC7C,QAAM,aAAa,iBACf,eAAe,gBAAgB,cAAc,IAAI,GAAG,IACpD;AAEJ,SAAO;AAAA,IACL,MAAM;AAAA,IACN;AAAA,IACA;AAAA,IACA,aAAa,MAAM;AAAA,IACnB,YAAY,MAAM;AAAA,IAClB,eAAe,MAAM;AAAA,IACrB,cAAc,MAAM;AAAA,IACpB;AAAA,IACA;AAAA,IACA,WAAW,MAAM;AAAA,IACjB;AAAA,IACA,oBAAoB,MAAM;AAAA,EAC5B;AACF;AAEA,SAAS,eAAe,KAAa,MAAgC;AACnE,QAAM,SAAS,WAAW,KAAK,cAAc,IAAI,GAAG;AAEpD,QAAM,WAAW,KAAK,KAAK,WAAW;AACtC,MAAI,CAAC,WAAW,QAAQ,GAAG;AACzB,UAAM,IAAI;AAAA,MACR,oCAAoC,IAAI,QAAQ,GAAG;AAAA,IAErD;AAAA,EACF;AACA,QAAM,WAAW,SAAS,QAAQ;AAGlC,MAAI,CAAC,SAAS,MAAM;AAClB,UAAM,IAAI,eAAe,kBAAkB,IAAI,oCAAoC;AAAA,EACrF;AACA,MAAI,CAAC,SAAS,IAAI;AAChB,UAAM,IAAI,eAAe,kBAAkB,IAAI,kCAAkC;AAAA,EACnF;AAEA,QAAM,OAAO,iBAAiB,KAAK,KAAK,WAAW,CAAC;AAWpD,QAAM,aAAa,iBAAiB,KAAK,KAAK,aAAa,CAAC;AAG5D,QAAM,YAAY,cAAc,GAAG;AACnC,QAAM,iBAAiB,mBAAmB,GAAG;AAC7C,QAAM,aAAa,iBACf,eAAe,gBAAgB,cAAc,IAAI,GAAG,IACpD;AAEJ,SAAO;AAAA,IACL,MAAM;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA,aAAa,MAAM;AAAA,IACnB,YAAY,MAAM;AAAA,IAClB,eAAe,MAAM;AAAA,IACrB,cAAc,MAAM;AAAA,IACpB;AAAA,IACA;AAAA,IACA,WAAW,MAAM;AAAA,IACjB,aACE,SAAS,eAAgB,MAA+C;AAAA,IAC1E;AAAA,IACA,oBAAoB,MAAM;AAAA,EAC5B;AACF;AAMA,SAAS,kBAAkB,KAAuB;AAChD,MAAI,CAAC,WAAW,GAAG,EAAG,QAAO,CAAC;AAC9B,SAAO,YAAY,KAAK,EAAE,eAAe,KAAK,CAAC,EAC5C,OAAO,CAAC,MAAM,EAAE,YAAY,CAAC,EAC7B,IAAI,CAAC,MAAM,EAAE,IAAI;AACtB;AAsBO,SAAS,iBAAiB,aAAqC;AACpE,QAAM,SAAS,QAAQ,WAAW;AAElC,MAAI,CAAC,WAAW,MAAM,KAAK,CAAC,SAAS,MAAM,EAAE,YAAY,GAAG;AAC1D,UAAM,IAAI,eAAe,iCAAiC,WAAW,EAAE;AAAA,EACzE;AAEA,QAAM,QAAQ,oBAAI,IAA8B;AAChD,QAAM,QAAQ,oBAAI,IAA8B;AAChD,QAAM,WAA+B,CAAC;AAGtC,QAAM,WAAW,KAAK,QAAQ,OAAO;AACrC,aAAW,QAAQ,kBAAkB,QAAQ,GAAG;AAC9C,UAAM,IAAI,MAAM,eAAe,KAAK,UAAU,IAAI,GAAG,IAAI,CAAC;AAAA,EAC5D;AAGA,QAAM,WAAW,KAAK,QAAQ,OAAO;AACrC,aAAW,QAAQ,kBAAkB,QAAQ,GAAG;AAC9C,UAAM,IAAI,MAAM,eAAe,KAAK,UAAU,IAAI,GAAG,IAAI,CAAC;AAAA,EAC5D;AAGA,QAAM,YAAY,IAAI,IAAI,MAAM,KAAK,CAAC;AACtC,aAAW,CAAC,SAAS,MAAM,KAAK,OAAO;AACrC,UAAM,WAAW,OAAO;AACxB,UAAM,YAAY,MAAM,QAAQ,SAAS,IAAI,IAAI,SAAS,OAAO,CAAC,SAAS,IAAI;AAC/E,UAAM,UAAU,MAAM,QAAQ,SAAS,EAAE,IAAI,SAAS,KAAK,CAAC,SAAS,EAAE;AAEvE,eAAW,OAAO,CAAC,GAAG,WAAW,GAAG,OAAO,GAAG;AAC5C,UAAI,CAAC,UAAU,IAAI,GAAG,GAAG;AACvB,iBAAS,KAAK;AAAA,UACZ,MAAM;AAAA,UACN,SAAS,SAAS,OAAO,2BAA2B,GAAG;AAAA,QACzD,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AAAA,IACL,QAAQ,EAAE,OAAO,MAAM;AAAA,IACvB;AAAA,EACF;AACF;;;ACvWA,SAAS,kBAAkB;;;ACK3B,IAAM,iBAAiB;AACvB,IAAM,sBAAsB;AAC5B,IAAM,gBAAgB;AAEtB,SAAS,MAAM,IAA2B;AACxC,SAAO,IAAI,QAAQ,CAACA,aAAY,WAAWA,UAAS,EAAE,CAAC;AACzD;AAKA,SAAS,MAAS,KAAU,MAAqB;AAC/C,QAAM,SAAgB,CAAC;AACvB,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK,MAAM;AACzC,WAAO,KAAK,IAAI,MAAM,GAAG,IAAI,IAAI,CAAC;AAAA,EACpC;AACA,SAAO;AACT;AAKA,eAAsB,iBACpB,IACA,gBACA,QACA,SACqB;AACrB,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO,EAAE,SAAS,GAAG,SAAS,GAAG,QAAQ,CAAC,EAAE;AAAA,EAC9C;AAEA,QAAM,YAAY,KAAK,IAAI,SAAS,aAAa,gBAAgB,cAAc;AAC/E,QAAM,aAAa,SAAS,cAAc;AAC1C,QAAM,aAAa,SAAS;AAE5B,QAAM,SAAS,MAAM,QAAQ,SAAS;AACtC,QAAM,SAA2B,CAAC;AAClC,MAAI,UAAU;AACd,MAAI,mBAAmB;AAEvB,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAM,MAAM,OAAO,CAAC;AACpB,QAAI,YAAY;AAEhB,aAAS,UAAU,GAAG,WAAW,YAAY,WAAW;AACtD,UAAI;AACF,cAAM,QAAQ,GAAG,MAAM;AACvB,cAAM,gBAAgB,GAAG,WAAW,cAAc;AAClD,mBAAW,MAAM,KAAK;AACpB,gBAAM,OAAO,cAAc,IAAI,EAAE,CAAC;AAAA,QACpC;AACA,cAAM,MAAM,OAAO;AACnB,oBAAY;AACZ,mBAAW,IAAI;AACf;AAAA,MACF,SAAS,KAAK;AACZ,YAAI,UAAU,YAAY;AACxB,gBAAM,QAAQ,gBAAgB,KAAK,IAAI,GAAG,OAAO;AACjD,gBAAM,MAAM,KAAK;AAAA,QACnB,OAAO;AACL,iBAAO,KAAK;AAAA,YACV,YAAY;AAAA,YACZ,OAAO,eAAe,QAAQ,MAAM,IAAI,MAAM,OAAO,GAAG,CAAC;AAAA,YACzD,gBAAgB,IAAI;AAAA,UACtB,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAEA,QAAI,WAAW;AACb;AAAA,IACF;AAEA,QAAI,YAAY;AACd,iBAAW;AAAA,QACT;AAAA,QACA,cAAc,OAAO;AAAA,QACrB,cAAc;AAAA,MAChB,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO,EAAE,SAAS,SAAS,kBAAkB,OAAO;AACtD;AAKA,eAAsB,gBACpB,IACA,gBACA,QACA,QACA,SACqB;AAIrB,QAAM,kBACJ,OAAO,UAAU,SACb,EAAE,GAAG,QAAQ,qBAAqB,OAAO,uBAAuB,KAAK,IACrE,EAAE,GAAG,QAAQ,OAAO,GAAG,qBAAqB,OAAO,uBAAuB,KAAK;AACrF,QAAM,QAAQ,MAAM,OAAO,UAAU,eAAe;AACpD,QAAM,SAAS,MAAM,IAAI,CAAC,MAAM,iBAAiB,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC;AAC3E,SAAO,iBAAiB,IAAI,gBAAgB,QAAQ,OAAO;AAC7D;AAkBA,eAAe,8BACb,IACA,gBACA,OACA,SACoC;AACpC,QAAM,SAAS,GAAG,WAAW,cAAc,EAAE,IAAI,KAAK;AACtD,QAAM,iBAAiB,MAAM,OAAO,gBAAgB;AAEpD,MAAI,eAAe,WAAW,EAAG,QAAO,EAAE,SAAS,GAAG,QAAQ,CAAC,EAAE;AAEjE,MAAI,eAAe;AACnB,QAAM,YAA8B,CAAC;AAIrC,QAAM,aAAsC,UACxC,EAAE,WAAW,QAAQ,WAAW,YAAY,QAAQ,WAAW,IAC/D;AAEJ,aAAW,cAAc,gBAAgB;AACvC,UAAM,cAAc,WAAW;AAE/B,UAAM,WAAW,MAAM,WAAW,OAAO,EAAE,IAAI;AAC/C,UAAM,YAAY,SAAS,KAAK,IAAI,CAAC,MAAM,EAAE,EAAE;AAG/C,eAAW,YAAY,WAAW;AAChC,YAAM,YAAY,MAAM,8BAA8B,IAAI,aAAa,UAAU,UAAU;AAC3F,sBAAgB,UAAU;AAC1B,gBAAU,KAAK,GAAG,UAAU,MAAM;AAAA,IACpC;AAGA,QAAI,UAAU,SAAS,GAAG;AACxB,YAAM,SAAS,MAAM,iBAAiB,IAAI,aAAa,WAAW,UAAU;AAC5E,sBAAgB,OAAO;AACvB,gBAAU,KAAK,GAAG,OAAO,MAAM;AAAA,IACjC;AAAA,EACF;AAEA,SAAO,EAAE,SAAS,cAAc,QAAQ,UAAU;AACpD;AAYA,eAAsB,kBACpB,IACA,gBACA,QACA,KACA,SACwB;AAKxB,QAAM,CAAC,aAAa,WAAW,IAAI,MAAM,QAAQ,IAAI;AAAA,IACnD,OAAO,UAAU,EAAE,MAAM,KAAK,qBAAqB,MAAM,OAAO,EAAE,CAAC;AAAA,IACnE,OAAO,UAAU,EAAE,MAAM,KAAK,qBAAqB,MAAM,OAAO,EAAE,CAAC;AAAA,EACrE,CAAC;AACD,QAAM,WAAW,YAAY,OAAO,CAAC,MAAM,EAAE,YAAY,aAAa;AACtE,QAAM,WAAW,YAAY,OAAO,CAAC,MAAM,EAAE,YAAY,aAAa;AAGtE,QAAM,eAAe,oBAAI,IAAY;AACrC,QAAM,WAAgC,CAAC;AACvC,aAAW,QAAQ,CAAC,GAAG,UAAU,GAAG,QAAQ,GAAG;AAC7C,UAAM,QAAQ,iBAAiB,KAAK,MAAM,KAAK,SAAS,KAAK,IAAI;AACjE,QAAI,CAAC,aAAa,IAAI,KAAK,GAAG;AAC5B,mBAAa,IAAI,KAAK;AACtB,eAAS,KAAK,IAAI;AAAA,IACpB;AAAA,EACF;AAGA,QAAM,6BAA6B,SAAS,yBAAyB;AACrE,QAAM,YAAY,iBAAiB,GAAG;AACtC,MAAI,sBAAiD,EAAE,SAAS,GAAG,QAAQ,CAAC,EAAE;AAE9E,MAAI,4BAA4B;AAC9B,0BAAsB,MAAM;AAAA,MAC1B;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAGA,QAAM,aAAa,SAAS,IAAI,CAAC,MAAM,iBAAiB,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC;AAClF,QAAM,YAAY,CAAC,GAAG,YAAY,SAAS;AAG3C,QAAM,YAAY,KAAK,IAAI,SAAS,aAAa,gBAAgB,cAAc;AAC/E,QAAM,SAAS,MAAM,iBAAiB,IAAI,gBAAgB,WAAW;AAAA,IACnE,GAAG;AAAA,IACH;AAAA,EACF,CAAC;AAID,QAAM,cAAc,KAAK,KAAK,UAAU,SAAS,SAAS;AAC1D,QAAM,iBAAiB,cAAc;AACrC,QAAM,cAAc,CAAC,OAAO,OAAO,KAAK,CAAC,MAAM,EAAE,eAAe,cAAc;AAI9E,QAAM,uBAAuB,cAAc,OAAO,UAAU,IAAI,OAAO;AAEvE,SAAO;AAAA,IACL,SAAS,OAAO,UAAU,oBAAoB;AAAA,IAC9C,SAAS,OAAO;AAAA,IAChB,QAAQ,CAAC,GAAG,OAAO,QAAQ,GAAG,oBAAoB,MAAM;AAAA,IACxD,cAAc;AAAA,IACd;AAAA,EACF;AACF;;;AC1PO,SAAS,uBAAuB,IAAe,gBAA0C;AAC9F,QAAM,gBAAgB,GAAG,WAAW,cAAc;AAElD,SAAO;AAAA,IACL;AAAA,IAEA,MAAM,OAAO,OAAkD;AAC7D,YAAM,OAAO,MAAM,cAAc,IAAI,KAAK,EAAE,IAAI;AAChD,UAAI,CAAC,KAAK,OAAQ,QAAO;AACzB,aAAO,KAAK,KAAK;AAAA,IACnB;AAAA,IAEA,MAAM,OAAO,OAAe,MAA8C;AACxE,YAAM,cAAc,IAAI,KAAK,EAAE,IAAI,IAAI;AAAA,IACzC;AAAA,IAEA,MAAM,UAAU,OAAe,MAA8C;AAC3E,YAAM,cAAc,IAAI,KAAK,EAAE,OAAO,IAAI;AAAA,IAC5C;AAAA,IAEA,MAAM,UAAU,OAA8B;AAC5C,YAAM,cAAc,IAAI,KAAK,EAAE,OAAO;AAAA,IACxC;AAAA,IAEA,MAAM,MAAM,SAAwB,SAAsD;AACxF,UAAI,IAAW;AACf,iBAAW,KAAK,SAAS;AACvB,YAAI,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK;AAAA,MACpC;AACA,UAAI,SAAS,SAAS;AACpB,YAAI,EAAE,QAAQ,QAAQ,QAAQ,OAAO,QAAQ,QAAQ,aAAa,KAAK;AAAA,MACzE;AACA,UAAI,SAAS,UAAU,QAAW;AAChC,YAAI,EAAE,MAAM,QAAQ,KAAK;AAAA,MAC3B;AACA,YAAM,OAAO,MAAM,EAAE,IAAI;AACzB,aAAO,KAAK,KAAK,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAsB;AAAA,IAC/D;AAAA,EACF;AACF;AAUO,SAAS,yBACd,IACA,gBACA,IACoB;AACpB,QAAM,gBAAgB,GAAG,WAAW,cAAc;AAElD,SAAO;AAAA,IACL,MAAM,OAAO,OAAkD;AAC7D,YAAM,OAAO,MAAM,GAAG,IAAI,cAAc,IAAI,KAAK,CAAC;AAClD,UAAI,CAAC,KAAK,OAAQ,QAAO;AACzB,aAAO,KAAK,KAAK;AAAA,IACnB;AAAA,IAEA,OAAO,OAAe,MAAqC;AACzD,SAAG,IAAI,cAAc,IAAI,KAAK,GAAG,IAAI;AAAA,IACvC;AAAA,IAEA,UAAU,OAAe,MAAqC;AAC5D,SAAG,OAAO,cAAc,IAAI,KAAK,GAAG,IAAI;AAAA,IAC1C;AAAA,IAEA,UAAU,OAAqB;AAC7B,SAAG,OAAO,cAAc,IAAI,KAAK,CAAC;AAAA,IACpC;AAAA,IAEA,MAAM,MAAM,SAAwB,SAAsD;AACxF,UAAI,IAAW;AACf,iBAAW,KAAK,SAAS;AACvB,YAAI,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK;AAAA,MACpC;AACA,UAAI,SAAS,SAAS;AACpB,YAAI,EAAE,QAAQ,QAAQ,QAAQ,OAAO,QAAQ,QAAQ,aAAa,KAAK;AAAA,MACzE;AACA,UAAI,SAAS,UAAU,QAAW;AAChC,YAAI,EAAE,MAAM,QAAQ,KAAK;AAAA,MAC3B;AACA,YAAM,OAAO,MAAM,GAAG,IAAI,CAAC;AAC3B,aAAO,KAAK,KAAK,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAsB;AAAA,IAC/D;AAAA,EACF;AACF;AASO,SAAS,mBAAmB,IAAe,gBAAsC;AACtF,QAAM,gBAAgB,GAAG,WAAW,cAAc;AAClD,QAAM,QAAQ,GAAG,MAAM;AAEvB,SAAO;AAAA,IACL,OAAO,OAAe,MAAqC;AACzD,YAAM,IAAI,cAAc,IAAI,KAAK,GAAG,IAAI;AAAA,IAC1C;AAAA,IAEA,UAAU,OAAe,MAAqC;AAC5D,YAAM,OAAO,cAAc,IAAI,KAAK,GAAG,IAAI;AAAA,IAC7C;AAAA,IAEA,UAAU,OAAqB;AAC7B,YAAM,OAAO,cAAc,IAAI,KAAK,CAAC;AAAA,IACvC;AAAA,IAEA,MAAM,SAAwB;AAC5B,YAAM,MAAM,OAAO;AAAA,IACrB;AAAA,EACF;AACF;;;AC9GA,IAAI,aAAsC;AAE1C,eAAe,eAA0C;AACvD,MAAI,CAAC,YAAY;AACf,UAAM,MAAM,MAAM,OAAO,yBAAyB;AAClD,iBAAa,IAAI;AAAA,EACnB;AACA,SAAO;AACT;AAWA,SAAS,sBAAsB,GAAkB,QAAkC;AACjF,QAAM,EAAE,OAAO,WAAW,IAAI,MAAM,IAAI;AAExC,UAAQ,IAAI;AAAA,IACV,KAAK;AACH,aAAO,EAAE,MAAM,WAAW,KAAK;AAAA,IACjC,KAAK;AACH,aAAO,EAAE,SAAS,WAAW,KAAK;AAAA,IACpC,KAAK;AACH,aAAO,EAAE,SAAS,WAAW,KAAK;AAAA,IACpC,KAAK;AACH,aAAO,EAAE,gBAAgB,WAAW,KAAK;AAAA,IAC3C,KAAK;AACH,aAAO,EAAE,YAAY,WAAW,KAAK;AAAA,IACvC,KAAK;AACH,aAAO,EAAE,mBAAmB,WAAW,KAAK;AAAA,IAC9C,KAAK;AACH,aAAO,EAAE,SAAS,WAAW,KAAuB;AAAA,IACtD,KAAK;AACH,aAAO,EAAE,YAAY,WAAW,KAAuB;AAAA,IACzD,KAAK;AACH,aAAO,EAAE,cAAc,WAAW,KAAK;AAAA,IACzC,KAAK;AACH,aAAO,EAAE,iBAAiB,WAAW,KAAuB;AAAA,IAC9D;AACE,YAAM,IAAI,MAAM,4CAA4C,EAAE,EAAE;AAAA,EACpE;AACF;AAEO,SAAS,2BACd,IACA,gBACsB;AACtB,SAAO;AAAA,IACL,MAAM,MAAM,SAAwB,SAAsD;AACxF,YAAM,IAAI,MAAM,aAAa;AAG7B,UAAI,WAAW,GAAG,SAAS,EAAE,WAAW,cAAc;AAGtD,UAAI,QAAQ,WAAW,GAAG;AACxB,mBAAW,SAAS,MAAM,sBAAsB,GAAG,QAAQ,CAAC,CAAC,CAAC;AAAA,MAChE,WAAW,QAAQ,SAAS,GAAG;AAC7B,cAAM,CAAC,OAAO,QAAQ,GAAG,IAAI,IAAI,QAAQ,IAAI,CAAC,MAAM,sBAAsB,GAAG,CAAC,CAAC;AAC/E,mBAAW,SAAS,MAAM,EAAE,IAAI,OAAO,QAAQ,GAAG,IAAI,CAAC;AAAA,MACzD;AAGA,UAAI,SAAS,SAAS;AACpB,cAAM,IAAI,EAAE,MAAM,QAAQ,QAAQ,KAAK;AACvC,cAAM,WAAW,QAAQ,QAAQ,cAAc,SAAS,EAAE,WAAW,IAAI,EAAE,UAAU;AACrF,mBAAW,SAAS,KAAK,QAAQ;AAAA,MACnC;AAGA,UAAI,SAAS,UAAU,QAAW;AAChC,mBAAW,SAAS,MAAM,QAAQ,KAAK;AAAA,MACzC;AAEA,YAAM,OAAO,MAAM,SAAS,QAAQ;AACpC,aAAO,KAAK,QAAQ,IAAI,CAAC,MAAM,EAAE,KAAK,CAAsB;AAAA,IAC9D;AAAA,EACF;AACF;;;AH/CA,SAAS,qBAAqB,QAAuB,IAAwC;AAC3F,QAAM,MAA+B;AAAA,IACnC,WAAW,WAAW,gBAAgB;AAAA,EACxC;AACA,MAAI,OAAO,aAAa;AACtB,QAAI,OAAO,0BAA0B,OAAO,aAAa,EAAE;AAAA,EAC7D;AACA,MAAI,OAAO,YAAY;AACrB,eAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,OAAO,UAAU,GAAG;AACtD,UAAI,QAAQ,CAAC,EAAE,IAAI;AAAA,IACrB;AAAA,EACF;AACA,MAAI,OAAO,MAAM,QAAW;AAC1B,QAAI,IAAI,OAAO;AAAA,EACjB;AACA,SAAO;AACT;AAMA,SAAS,oBAAoB,QAAiD;AAC5E,QAAM,MAAM,WAAW,gBAAgB;AACvC,QAAM,MAA+B;AAAA,IACnC,OAAO,OAAO;AAAA,IACd,MAAM,OAAO;AAAA,IACb,SAAS,OAAO;AAAA,IAChB,OAAO,OAAO;AAAA,IACd,MAAM,OAAO;AAAA,IACb,MAAM,OAAO;AAAA,IACb,WAAW;AAAA,IACX,WAAW;AAAA,EACb;AACA,MAAI,OAAO,MAAM,OAAW,KAAI,IAAI,OAAO;AAC3C,SAAO;AACT;AAEA,IAAM,8BAAN,MAAgE;AAAA,EAC9D,YACmB,SACA,IACjB;AAFiB;AACA;AAAA,EAChB;AAAA,EAEH,OAAO,OAAkD;AACvD,WAAO,KAAK,QAAQ,OAAO,KAAK;AAAA,EAClC;AAAA,EAEA,MAAM,SAAwB,SAAsD;AAClF,WAAO,KAAK,QAAQ,MAAM,SAAS,OAAO;AAAA,EAC5C;AAAA,EAEA,MAAM,OAAO,OAAe,QAAuC;AACjE,SAAK,QAAQ,OAAO,OAAO,oBAAoB,MAAM,CAAC;AAAA,EACxD;AAAA,EAEA,MAAM,UAAU,OAAe,QAAsC;AACnE,SAAK,QAAQ,UAAU,OAAO,qBAAqB,QAAQ,KAAK,EAAE,CAAC;AAAA,EACrE;AAAA,EAEA,MAAM,UAAU,OAA8B;AAC5C,SAAK,QAAQ,UAAU,KAAK;AAAA,EAC9B;AACF;AAEA,IAAM,wBAAN,MAAoD;AAAA,EAClD,YACmB,SACA,IACjB;AAFiB;AACA;AAAA,EAChB;AAAA,EAEH,OAAO,OAAe,QAA8B;AAClD,SAAK,QAAQ,OAAO,OAAO,oBAAoB,MAAM,CAAC;AAAA,EACxD;AAAA,EAEA,UAAU,OAAe,QAA6B;AACpD,SAAK,QAAQ,UAAU,OAAO,qBAAqB,QAAQ,KAAK,EAAE,CAAC;AAAA,EACrE;AAAA,EAEA,UAAU,OAAqB;AAC7B,SAAK,QAAQ,UAAU,KAAK;AAAA,EAC9B;AAAA,EAEA,SAAwB;AACtB,WAAO,KAAK,QAAQ,OAAO;AAAA,EAC7B;AACF;AAEA,IAAM,uBAAN,MAAM,sBAA+C;AAAA,EAMnD,YACmB,IACjB,gBACiB,WACjB,WACA;AAJiB;AAEA;AAGjB,SAAK,iBAAiB;AACtB,SAAK,YAAY;AACjB,SAAK,UAAU,uBAAuB,IAAI,cAAc;AACxD,QAAI,cAAc,YAAY;AAC5B,WAAK,kBAAkB,2BAA2B,IAAI,cAAc;AAAA,IACtE;AAAA,EACF;AAAA,EAjBS;AAAA,EACA;AAAA,EACQ;AAAA,EACA;AAAA;AAAA,EAkBjB,OAAO,OAAkD;AACvD,WAAO,KAAK,QAAQ,OAAO,KAAK;AAAA,EAClC;AAAA,EAEA,MAAM,SAAwB,SAAsD;AAClF,QAAI,KAAK,iBAAiB;AACxB,aAAO,KAAK,gBAAgB,MAAM,SAAS,OAAO;AAAA,IACpD;AACA,WAAO,KAAK,QAAQ,MAAM,SAAS,OAAO;AAAA,EAC5C;AAAA;AAAA,EAIA,OAAO,OAAe,QAAuC;AAC3D,WAAO,KAAK,QAAQ,OAAO,OAAO,oBAAoB,MAAM,CAAC;AAAA,EAC/D;AAAA,EAEA,UAAU,OAAe,QAAsC;AAC7D,WAAO,KAAK,QAAQ,UAAU,OAAO,qBAAqB,QAAQ,KAAK,EAAE,CAAC;AAAA,EAC5E;AAAA,EAEA,UAAU,OAA8B;AACtC,WAAO,KAAK,QAAQ,UAAU,KAAK;AAAA,EACrC;AAAA;AAAA,EAIA,eAAkB,IAAwD;AACxE,WAAO,KAAK,GAAG,eAAe,OAAO,gBAA6B;AAChE,YAAM,YAAY,yBAAyB,KAAK,IAAI,KAAK,gBAAgB,WAAW;AACpF,aAAO,GAAG,IAAI,4BAA4B,WAAW,KAAK,EAAE,CAAC;AAAA,IAC/D,CAAC;AAAA,EACH;AAAA,EAEA,cAA4B;AAC1B,UAAM,eAAe,mBAAmB,KAAK,IAAI,KAAK,cAAc;AACpE,WAAO,IAAI,sBAAsB,cAAc,KAAK,EAAE;AAAA,EACxD;AAAA;AAAA,EAIA,SAAS,eAAuB,MAA8B;AAC5D,UAAM,UAAU,GAAG,KAAK,cAAc,IAAI,aAAa,IAAI,IAAI;AAC/D,UAAM,WAAW,KAAK,YAAY,GAAG,KAAK,SAAS,IAAI,IAAI,KAAK;AAChE,WAAO,IAAI,sBAAqB,KAAK,IAAI,SAAS,KAAK,WAAW,QAAQ;AAAA,EAC5E;AAAA;AAAA,EAIA,kBACE,KACA,QACA,SACwB;AACxB,WAAO,kBAAsB,KAAK,IAAI,KAAK,gBAAgB,QAAQ,KAAK,OAAO;AAAA,EACjF;AAAA,EAEA,gBACE,QACA,QACA,SACqB;AACrB,WAAO,gBAAoB,KAAK,IAAI,KAAK,gBAAgB,QAAQ,QAAQ,OAAO;AAAA,EAClF;AAAA;AAAA,EAIA,MAAM,gBACJ,QACA,gBAC8B;AAC9B,UAAM,OAAO,kBAAkB,KAAK,eAAe,MAAM,GAAG,EAAE,IAAI;AAClE,UAAM,OAAO,mBAAmB,MAAM;AAEtC,QAAI,KAAK,aAAa,OAAO;AAC3B,YAAM,IAAI;AAAA,QACR;AAAA,QAEA;AAAA,MACF;AAAA,IACF;AAEA,UAAM,qBAAqB,KAAK,GAAG,gBAAgB,IAAI;AACvD,QAAI,IAAW;AACf,eAAW,KAAK,KAAK,SAAS;AAC5B,UAAI,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK;AAAA,IACpC;AACA,QAAI,KAAK,SAAS,SAAS;AACzB,UAAI,EAAE,QAAQ,KAAK,QAAQ,QAAQ,OAAO,KAAK,QAAQ,QAAQ,aAAa,KAAK;AAAA,IACnF;AACA,QAAI,KAAK,SAAS,UAAU,QAAW;AACrC,UAAI,EAAE,MAAM,KAAK,QAAQ,KAAK;AAAA,IAChC;AACA,UAAM,OAAO,MAAM,EAAE,IAAI;AACzB,WAAO,KAAK,KAAK,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAsB;AAAA,EAC/D;AACF;AASO,SAAS,uBACd,IACA,gBACA,UAAmC,CAAC,GACpB;AAChB,QAAM,YAAY,QAAQ,aAAa;AACvC,QAAM,YAAY,QAAQ,aAAa;AACvC,SAAO,IAAI,qBAAqB,IAAI,gBAAgB,WAAW,SAAS;AAC1E;;;AInQA,IAAI,sBAAsB;AAYnB,SAAS,kBACd,IACA,gBACA,SACkC;AAClC,QAAM,gBAAgB,SAAS,aAAa;AAC5C,QAAM,aAAa,CAAC,CAAC,QAAQ,IAAI;AACjC,QAAM,gBAA2B,aAAa,aAAa;AAE3D,MACE,kBAAkB,cAClB,CAAC,cACD,kBAAkB,cAClB,CAAC,qBACD;AACA,0BAAsB;AACtB,YAAQ;AAAA,MACN;AAAA,IAIF;AAAA,EACF;AAEA,QAAM,UAAU,uBAAuB,IAAI,gBAAgB,EAAE,WAAW,cAAc,CAAC;AAEvF,MAAI;AACJ,MAAI,SAAS,cAAc,cAAc,QAAQ,aAAa,eAAe,gBAAgB;AAC3F,kBAAc,uBAAuB,IAAI,QAAQ,aAAa,YAAY;AAAA,MACxE,WAAW;AAAA,IACb,CAAC;AAAA,EACH;AAEA,SAAO,IAAI,gBAAgB,SAAS,SAAS,WAAW;AAC1D;;;ACrEA,SAAS,cAAc;AAEhB,SAAS,aAAqB;AACnC,SAAO,OAAO;AAChB;;;ACsBA,SAAS,YAAY,YAAsC;AACzD,SAAO;AAAA,IACL;AAAA,MACE,iBAAiB;AAAA,MACjB,YAAY;AAAA,MACZ,QAAQ;AAAA,QACN,EAAE,WAAW,QAAQ,OAAO,YAAY;AAAA,QACxC,EAAE,WAAW,WAAW,OAAO,YAAY;AAAA,MAC7C;AAAA,IACF;AAAA,IACA;AAAA,MACE,iBAAiB;AAAA,MACjB,YAAY;AAAA,MACZ,QAAQ;AAAA,QACN,EAAE,WAAW,WAAW,OAAO,YAAY;AAAA,QAC3C,EAAE,WAAW,QAAQ,OAAO,YAAY;AAAA,MAC1C;AAAA,IACF;AAAA,IACA;AAAA,MACE,iBAAiB;AAAA,MACjB,YAAY;AAAA,MACZ,QAAQ;AAAA,QACN,EAAE,WAAW,SAAS,OAAO,YAAY;AAAA,QACzC,EAAE,WAAW,WAAW,OAAO,YAAY;AAAA,MAC7C;AAAA,IACF;AAAA,IACA;AAAA,MACE,iBAAiB;AAAA,MACjB,YAAY;AAAA,MACZ,QAAQ;AAAA,QACN,EAAE,WAAW,WAAW,OAAO,YAAY;AAAA,QAC3C,EAAE,WAAW,SAAS,OAAO,YAAY;AAAA,MAC3C;AAAA,IACF;AAAA,EACF;AACF;AAMA,SAAS,oBAAoB,QAA0B;AACrD,QAAM,IAAI;AACV,MAAI,EAAE,SAAS,YAAY,CAAC,EAAE,WAAY,QAAO,CAAC;AAClD,SAAO,OAAO,KAAK,EAAE,UAAqC;AAC5D;AAUA,SAAS,uBAAuB,gBAA0C;AACxE,SAAO;AAAA,IACL;AAAA,MACE,iBAAiB;AAAA,MACjB,YAAY;AAAA,MACZ,QAAQ;AAAA,QACN,EAAE,WAAW,QAAQ,OAAO,YAAY;AAAA,QACxC,EAAE,WAAW,WAAW,OAAO,YAAY;AAAA,MAC7C;AAAA,IACF;AAAA,IACA;AAAA,MACE,iBAAiB;AAAA,MACjB,YAAY;AAAA,MACZ,QAAQ;AAAA,QACN,EAAE,WAAW,WAAW,OAAO,YAAY;AAAA,QAC3C,EAAE,WAAW,QAAQ,OAAO,YAAY;AAAA,MAC1C;AAAA,IACF;AAAA,IACA;AAAA,MACE,iBAAiB;AAAA,MACjB,YAAY;AAAA,MACZ,QAAQ;AAAA,QACN,EAAE,WAAW,SAAS,OAAO,YAAY;AAAA,QACzC,EAAE,WAAW,WAAW,OAAO,YAAY;AAAA,MAC7C;AAAA,IACF;AAAA,IACA;AAAA,MACE,iBAAiB;AAAA,MACjB,YAAY;AAAA,MACZ,QAAQ;AAAA,QACN,EAAE,WAAW,WAAW,OAAO,YAAY;AAAA,QAC3C,EAAE,WAAW,SAAS,OAAO,YAAY;AAAA,MAC3C;AAAA,IACF;AAAA,EACF;AACF;AAoBO,SAAS,oBACd,YACA,UACA,iBACsB;AACtB,QAAM,UAAU,YAAY,UAAU;AAEtC,MAAI,UAAU;AAIZ,eAAW,CAAC,EAAE,MAAM,KAAK,SAAS,OAAO;AACvC,YAAM,SAAS,oBAAoB,OAAO,MAAM;AAChD,iBAAW,SAAS,QAAQ;AAC1B,gBAAQ,KAAK;AAAA,UACX,iBAAiB;AAAA,UACjB,YAAY;AAAA,UACZ,QAAQ;AAAA,YACN,EAAE,WAAW,SAAS,OAAO,YAAY;AAAA,YACzC,EAAE,WAAW,WAAW,OAAO,YAAY;AAAA,YAC3C,EAAE,WAAW,QAAQ,KAAK,IAAI,OAAO,YAAY;AAAA,UACnD;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AAIA,eAAW,CAAC,EAAE,MAAM,KAAK,SAAS,OAAO;AACvC,YAAM,SAAS,oBAAoB,OAAO,MAAM;AAChD,iBAAW,SAAS,QAAQ;AAC1B,gBAAQ,KAAK;AAAA,UACX,iBAAiB;AAAA,UACjB,YAAY;AAAA,UACZ,QAAQ;AAAA,YACN,EAAE,WAAW,QAAQ,OAAO,YAAY;AAAA,YACxC,EAAE,WAAW,WAAW,OAAO,YAAY;AAAA,YAC3C,EAAE,WAAW,QAAQ,KAAK,IAAI,OAAO,YAAY;AAAA,UACnD;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAIA,MAAI,iBAAiB;AACnB,UAAM,mBAAmB,oBAAI,IAAY;AACzC,eAAW,SAAS,iBAAiB;AACnC,UAAI,MAAM,aAAa;AACrB,yBAAiB,IAAI,MAAM,WAAW;AAAA,MACxC;AAAA,IACF;AACA,eAAW,QAAQ,kBAAkB;AACnC,cAAQ,KAAK,GAAG,uBAAuB,IAAI,CAAC;AAAA,IAC9C;AAAA,EACF;AAEA,SAAO,EAAE,SAAS,gBAAgB,CAAC,EAAE;AACvC;;;ACnMA,SAAS,cAAAC,mBAAkB;AAKpB,SAAS,gBACd,OACA,KACA,MACa;AACb,QAAM,MAAMC,YAAW,gBAAgB;AACvC,SAAO;AAAA,IACL;AAAA,IACA,MAAM;AAAA,IACN,SAAS;AAAA,IACT,OAAO;AAAA,IACP,MAAM;AAAA,IACN;AAAA,IACA,WAAW;AAAA,IACX,WAAW;AAAA,EACb;AACF;AAEO,SAAS,gBACd,OACA,MACA,SACA,OACA,MACA,MACa;AACb,QAAM,MAAMA,YAAW,gBAAgB;AACvC,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,WAAW;AAAA,IACX,WAAW;AAAA,EACb;AACF;;;AC5BA,IAAM,gBAAgB;AACtB,IAAM,oBAAoB;AAC1B,IAAM,sBAAsB;AAG5B,IAAI,oBAAoB;AAGxB,SAAS,cAAc,QAA4C;AACjE,SAAO,cAAc,UAAU,OAAQ,OAAuB,aAAa;AAC7E;AAEA,IAAM,YAAN,MAAgB;AAAA,EAId,YAA6B,OAAe;AAAf;AAAA,EAAgB;AAAA,EAHrC,QAA2B,CAAC;AAAA,EAC5B,SAAS;AAAA,EAIjB,MAAM,UAAyB;AAC7B,QAAI,KAAK,SAAS,KAAK,OAAO;AAC5B,WAAK;AACL;AAAA,IACF;AACA,WAAO,IAAI,QAAc,CAACC,aAAY;AACpC,WAAK,MAAM,KAAKA,QAAO;AAAA,IACzB,CAAC;AAAA,EACH;AAAA,EAEA,UAAgB;AACd,SAAK;AACL,UAAM,OAAO,KAAK,MAAM,MAAM;AAC9B,QAAI,MAAM;AACR,WAAK;AACL,WAAK;AAAA,IACP;AAAA,EACF;AACF;AAEA,IAAM,uBAAN,MAAuD;AAAA,EAGrD,YACmB,QACA,UACA,UACjB;AAHiB;AACA;AACA;AAAA,EAChB;AAAA,EANc,OAAwB,CAAC;AAAA,EAQ1C,OAAO,SAAiB,SAA4D;AAClF,SAAK,KAAK,KAAK,EAAE,SAAS,GAAG,QAAQ,CAAC;AACtC,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,IAAI,SAAsD;AAC9D,QAAI,KAAK,KAAK,WAAW,GAAG;AAC1B,YAAM,IAAI,eAAe,8CAA8C;AAAA,IACzE;AAEA,UAAM,WAAW,SAAS,YAAY;AACtC,UAAM,cAAc,SAAS,eAAe;AAC5C,UAAM,sBAAsB,SAAS,uBAAuB;AAC5D,UAAM,YAAY,IAAI,UAAU,WAAW;AAE3C,QAAI,aAAa;AACjB,QAAI,YAAY;AAIhB,QAAI,UAAuD;AAAA,MACzD,EAAE,KAAK,KAAK,UAAU,QAAQ,KAAK,OAAO;AAAA,IAC5C;AACA,UAAM,aAA0B,CAAC;AAEjC,aAAS,QAAQ,GAAG,QAAQ,KAAK,KAAK,QAAQ,SAAS;AACrD,YAAM,MAAM,KAAK,KAAK,KAAK;AAE3B,UAAI,QAAQ,WAAW,GAAG;AACxB,mBAAW,KAAK;AAAA,UACd,SAAS,IAAI;AAAA,UACb;AAAA,UACA,OAAO,CAAC;AAAA,UACR,aAAa;AAAA,UACb,WAAW;AAAA,QACb,CAAC;AACD;AAAA,MACF;AAEA,YAAM,WAAoE,CAAC;AAC3E,YAAM,cAAc,QAAQ;AAC5B,UAAI,eAAe;AAKnB,YAAM,sBAAsB,KAAK,mBAAmB,GAAG;AACvD,YAAM,YAAY,IAAI,aAAa;AACnC,YAAM,eAAe,cAAc,aAAa,CAAC,CAAC;AAElD,YAAM,QAAQ,QAAQ,IAAI,CAAC,EAAE,KAAK,QAAQ,aAAa,MAAM,YAAY;AACvE,YAAI,cAAc,UAAU;AAC1B,yBAAe;AACf;AAAA,QACF;AAEA,cAAM,UAAU,QAAQ;AACxB,YAAI;AACF,cAAI,cAAc,UAAU;AAC1B,2BAAe;AACf;AAAA,UACF;AAEA;AAEA,gBAAM,SAA0B,EAAE,SAAS,IAAI,QAAQ;AAEvD,cAAI,cAAc,WAAW;AAC3B,mBAAO,OAAO;AACd,gBAAI,IAAI,MAAO,QAAO,QAAQ,IAAI;AAAA,UACpC,OAAO;AACL,mBAAO,OAAO;AACd,gBAAI,IAAI,MAAO,QAAO,QAAQ,IAAI;AAAA,UACpC;AAEA,cAAI,cAAc,aAAa,IAAI,OAAO;AACxC,mBAAO,QAAQ,IAAI;AAAA,UACrB;AACA,cAAI,cAAc,aAAa,IAAI,OAAO;AACxC,mBAAO,QAAQ,IAAI;AAAA,UACrB;AAEA,cAAI,IAAI,QAAS,QAAO,UAAU,IAAI;AAEtC,gBAAM,QAAQ,IAAI,SAAS;AAC3B,cAAI,IAAI,QAAQ;AACd,mBAAO,QAAQ;AAAA,UACjB,OAAO;AACL,mBAAO,QAAQ;AAAA,UACjB;AAOA,cAAI;AACJ,cAAI;AACJ,cAAI,cAAc;AAChB,gBAAI,cAAc,KAAK,MAAM,GAAG;AAC9B,0BAAY,KAAK,OAAO,SAAS,KAAK,mBAAoB;AAC1D,2BAAa;AAAA,YACf,OAAO;AACL,0BAAY;AACZ,2BAAa;AACb,kBAAI,CAAC,mBAAmB;AACtB,oCAAoB;AACpB,wBAAQ;AAAA,kBACN,8BAA8B,IAAI,OAAO,sBAAsB,mBAAmB;AAAA,gBAGpF;AAAA,cACF;AAAA,YACF;AAAA,UACF,OAAO;AAEL,wBAAY;AACZ,yBAAa;AAAA,UACf;AAEA,cAAIC,SAAQ,MAAM,UAAU,UAAU,MAAM;AAE5C,cAAI,IAAI,QAAQ;AACd,YAAAA,SAAQA,OAAM,OAAO,IAAI,MAAM;AAC/B,YAAAA,SAAQA,OAAM,MAAM,GAAG,KAAK;AAAA,UAC9B;AAEA,qBAAW,QAAQA,QAAO;AACxB,qBAAS,KAAK,EAAE,MAAM,QAAQ,WAAW,CAAC;AAAA,UAC5C;AAAA,QACF,UAAE;AACA,oBAAU,QAAQ;AAAA,QACpB;AAAA,MACF,CAAC;AAED,YAAM,QAAQ,IAAI,MAAM,IAAI,CAAC,SAAS,KAAK,CAAC,CAAC;AAE7C,YAAM,QAAQ,SAAS,IAAI,CAAC,MAAM,EAAE,IAAI;AAExC,iBAAW,KAAK;AAAA,QACd,SAAS,IAAI;AAAA,QACb;AAAA,QACA,OAAO,sBAAsB,CAAC,GAAG,KAAK,IAAI;AAAA,QAC1C;AAAA,QACA,WAAW;AAAA,MACb,CAAC;AAED,UAAI,cAAc;AAChB,oBAAY;AAAA,MACd;AAIA,YAAM,OAAO,oBAAI,IAAyB;AAC1C,iBAAW,EAAE,MAAM,QAAQ,WAAW,KAAK,UAAU;AACnD,cAAM,UAAU,cAAc,YAAY,KAAK,OAAO,KAAK;AAC3D,YAAI,CAAC,KAAK,IAAI,OAAO,GAAG;AACtB,eAAK,IAAI,SAAS,UAAU;AAAA,QAC9B;AAAA,MACF;AACA,gBAAU,CAAC,GAAG,KAAK,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,MAAM,OAAO,EAAE,KAAK,OAAO,EAAE;AAAA,IACxE;AAEA,UAAM,UAAU,WAAW,WAAW,SAAS,CAAC;AAEhD,WAAO;AAAA,MACL,OAAO,QAAQ;AAAA,MACf,MAAM;AAAA,MACN;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,mBAAmB,KAAwC;AACjE,QAAI,IAAI,YAAa,QAAO,IAAI;AAEhC,QAAI,KAAK,UAAU;AACjB,YAAM,UAAU,KAAK,SAAS,gBAAgB,IAAI,OAAO;AAEzD,iBAAW,SAAS,SAAS;AAC3B,YAAI,MAAM,YAAa,QAAO,MAAM;AAAA,MACtC;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AACF;AAkBO,SAAS,gBACd,QACA,UACA,UACkB;AAClB,SAAO,IAAI,qBAAqB,QAAQ,UAAU,QAAQ;AAC5D;;;ACtLA,SAAS,gBAAgB,GAAmB;AAC1C,SAAO,EACJ,YAAY,EACZ,QAAQ,cAAc,GAAG,EACzB,QAAQ,OAAO,GAAG,EAClB,QAAQ,UAAU,EAAE;AACzB;AAYA,SAAS,oBAAsD;AAC7D,QAAM,IAAI;AACV,MAAI,EAAE,kBAAkB,OAAO,EAAE,eAAe,WAAW,YAAY;AACrE,WAAO,EAAE;AAAA,EACX;AACA,SAAO;AACT;AAOA,SAAS,cAAc,WAA+B,SAAqC;AACzF,QAAM,IAAI;AACV,MAAI,CAAC,EAAE,YAAa,QAAO;AAE3B,QAAM,UAAU,cAAe,UAAqD;AAAA,IAClF,oBAAoB;AAClB,UAAI;AACF,cAAM,oBAAoB;AAAA,MAC5B,SAAS,KAAK;AACZ,gBAAQ,KAAK,gBAAgB,OAAO,8BAA8B,GAAG;AACrE,aAAK,WAAW,GAAG;AAAA,MACrB;AAAA,IACF;AAAA,IAEA,uBAAuB;AACrB,UAAI;AACF,cAAM,uBAAuB;AAAA,MAC/B,SAAS,KAAK;AACZ,gBAAQ,KAAK,gBAAgB,OAAO,iCAAiC,GAAG;AAAA,MAC1E;AAAA,IACF;AAAA,IAEA,IAAI,KAAK,GAA4B;AACnC,UAAI;AACF,cAAM,OAAO;AAAA,MACf,SAAS,KAAK;AACZ,gBAAQ,KAAK,gBAAgB,OAAO,wBAAwB,GAAG;AAC/D,aAAK,WAAW,GAAG;AAAA,MACrB;AAAA,IACF;AAAA,IAEA,IAAI,OAAgC;AAClC,UAAI;AACF,eAAO,MAAM;AAAA,MACf,QAAQ;AACN,eAAO,CAAC;AAAA,MACV;AAAA,IACF;AAAA,IAEA,WAAW,KAAc;AACvB,UAAI;AACF,aAAK,YACH,kGACqB,OAAO,SAAS,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,MACzF,QAAQ;AAAA,MAER;AAAA,IACF;AAAA,EACF;AAGA,EAAC,QAA0C,WAAW,UAAU;AAChE,EAAC,QAA0C,cAAc,UAAU;AAEnE,SAAO;AACT;AAaO,SAAS,YAAY,OAAwC;AAClE,QAAM,QAAwC,CAAC;AAC/C,QAAM,QAAwC,CAAC;AAC/C,QAAM,WAAW,kBAAkB;AAGnC,aAAW,CAAC,YAAY,MAAM,KAAK,OAAO,QAAQ,MAAM,SAAS,CAAC,CAAC,GAAG;AACpE,UAAM,YAAwB,CAAC;AAC/B,eAAW,aAAa,OAAO,OAAO;AACpC,YAAM,UAAU,MAAM,gBAAgB,UAAU,CAAC,IAAI,gBAAgB,UAAU,QAAQ,CAAC;AACxF,gBAAU,KAAK;AAAA,QACb;AAAA,QACA,UAAU,UAAU;AAAA,QACpB,aAAa,UAAU;AAAA,MACzB,CAAC;AACD,UAAI,YAAY,CAAC,SAAS,IAAI,OAAO,GAAG;AACtC,iBAAS,OAAO,SAAS,cAAc,WAAW,OAAO,CAAC;AAAA,MAC5D;AAAA,IACF;AACA,UAAM,UAAU,IAAI;AAAA,MAClB,OAAO;AAAA,MACP,YAAY,OAAO;AAAA,IACrB;AAAA,EACF;AAGA,aAAW,CAAC,SAAS,MAAM,KAAK,OAAO,QAAQ,MAAM,SAAS,CAAC,CAAC,GAAG;AACjE,UAAM,YAAwB,CAAC;AAC/B,eAAW,aAAa,OAAO,OAAO;AACpC,YAAM,UAAU,WAAW,gBAAgB,OAAO,CAAC,IAAI,gBAAgB,UAAU,QAAQ,CAAC;AAC1F,gBAAU,KAAK;AAAA,QACb;AAAA,QACA,UAAU,UAAU;AAAA,QACpB,aAAa,UAAU;AAAA,MACzB,CAAC;AACD,UAAI,YAAY,CAAC,SAAS,IAAI,OAAO,GAAG;AACtC,iBAAS,OAAO,SAAS,cAAc,WAAW,OAAO,CAAC;AAAA,MAC5D;AAAA,IACF;AACA,UAAM,OAAO,IAAI;AAAA,MACf,OAAO;AAAA,MACP,YAAY,OAAO;AAAA,IACrB;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,MAAM;AACxB;","names":["resolve","FieldValue","FieldValue","resolve","edges"]}

package/dist/query-client/index.cjs

@@ -42,6 +42,26 @@ module.exports = __toCommonJS(query_client_exports);
 // src/query-client/client.ts
 var import_node_http = __toESM(require("http"), 1);
 
+// src/query-client/config.ts
+var import_node_fs = require("fs");
+var import_node_path = require("path");
+var CONFIG_FILES = ["firegraph.config.ts", "firegraph.config.js", "firegraph.config.mjs"];
+var DEFAULT_PORT = 3884;
+function readEditorPort(cwd) {
+  const dir = cwd ?? process.cwd();
+  for (const name of CONFIG_FILES) {
+    try {
+      const content = (0, import_node_fs.readFileSync)((0, import_node_path.join)(dir, name), "utf8");
+      const editorBlock = content.match(/editor\s*:\s*\{[^}]*\}/s)?.[0] ?? "";
+      const portMatch = editorBlock.match(/port\s*:\s*(\d+)/);
+      if (portMatch) return parseInt(portMatch[1], 10);
+    } catch {
+      continue;
+    }
+  }
+  return DEFAULT_PORT;
+}
+
 // src/query-client/shaping.ts
 function summarizeRecord(r) {
   if (!r) return null;
@@ -68,26 +88,6 @@ function summarizeEdge(r) {
   return out;
 }
 
-// src/query-client/config.ts
-var import_node_fs = require("fs");
-var import_node_path = require("path");
-var CONFIG_FILES = ["firegraph.config.ts", "firegraph.config.js", "firegraph.config.mjs"];
-var DEFAULT_PORT = 3884;
-function readEditorPort(cwd) {
-  const dir = cwd ?? process.cwd();
-  for (const name of CONFIG_FILES) {
-    try {
-      const content = (0, import_node_fs.readFileSync)((0, import_node_path.join)(dir, name), "utf8");
-      const editorBlock = content.match(/editor\s*:\s*\{[^}]*\}/s)?.[0] ?? "";
-      const portMatch = editorBlock.match(/port\s*:\s*(\d+)/);
-      if (portMatch) return parseInt(portMatch[1], 10);
-    } catch {
-      continue;
-    }
-  }
-  return DEFAULT_PORT;
-}
-
 // src/query-client/client.ts
 var QueryClientError = class extends Error {
   constructor(message, code) {
@@ -286,14 +286,16 @@ var QueryClient = class {
     }
     const data = await this.mutate("traverse", input);
     return {
-      hops: (data.hops ?? []).map((h) => ({
-        relation: h.axbType,
-        direction: h.direction,
-        depth: h.depth,
-        edgeCount: (h.edges ?? []).length,
-        edges: (h.edges ?? []).map(summarizeEdge).filter(Boolean),
-        truncated: h.truncated ?? false
-      })),
+      hops: (data.hops ?? []).map(
+        (h) => ({
+          relation: h.axbType,
+          direction: h.direction,
+          depth: h.depth,
+          edgeCount: (h.edges ?? []).length,
+          edges: (h.edges ?? []).map(summarizeEdge).filter(Boolean),
+          truncated: h.truncated ?? false
+        })
+      ),
       totalReads: data.totalReads ?? 0,
       truncated: data.truncated ?? false
     };