@aigne/afs-did-space 1.12.0-beta.5

package/dist/sqlite-tree-index.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"sqlite-tree-index.mjs","names":["result","hasMore","rows","countRes"],"sources":["../src/sqlite-tree-index.ts"],"sourcesContent":["/**\n * SQLiteTreeIndex — a `TreeIndex` over MetadataDB's libsql client.\n *\n * Implements the full `TreeIndex` contract on the SAME `entries` + `changelog`\n * tables D1TreeIndex uses (shared `changelog-schema.ts` DDL), so Node and\n * Cloudflare run identical sync semantics with only the storage primitive\n * swapped. Row-for-row aligned with `d1-tree-index.ts`; the only differences are\n * the libsql client API (`execute({sql,args})` / `batch(stmts,\"write\")`) vs the\n * D1 API (`prepare().bind().all()` / `batch([...])`).\n *\n * Why not delegate to `MetadataDB.upsertEntry`: that returns `void` and drops\n * the prior cid (`oldCid`) — the GC enqueue input. So `put`/`delete` here own\n * the atomic changelog batch + oldCid/ctime contract directly.\n */\n\nimport type { InValue, Client as LibsqlClient } from \"@libsql/client\";\nimport {\n  PREFIX_WATERMARK_BUMP_SQL,\n  PREFIX_WATERMARK_READ_SQL,\n  watermarkPrefix,\n  watermarkWritePrefix,\n} from \"./changelog-schema.js\";\nimport { validateDeviceId } from \"./changelog-write.js\";\nimport {\n  ancestorDirs,\n  buildDirChainStmt,\n  MAX_ENTRIES_PER_SCOPE,\n  nameOf,\n  parentOf,\n  prefixRange,\n} from \"./d1-tree-index.js\";\nimport type { DirtyPathRow, ListDirtyPathOptions } from \"./dirty-path-queue.js\";\nimport {\n  DIRTY_PATH_ACK_SQL,\n  DIRTY_PATH_LIST_SQL,\n  DIRTY_PATH_MARK_ERROR_SQL,\n} from \"./dirty-path-schema.js\";\nimport {\n  type InlineContentOptions,\n  type ResolvedInlineConfig,\n  resolveInlineConfig,\n  resolveInlineContent,\n} from \"./inline-content.js\";\nimport type { MetadataDB } from \"./metadata-db.js\";\nimport { resolveParentDirStamp } from \"./timestamp.js\";\nimport {\n  type BatchDeleteEntry,\n  type BatchDeleteEntryResult,\n  type BatchIndexContext,\n  type BatchPutEntry,\n  type BatchPutEntryResult,\n  buildKeysetCursor,\n  buildOrderedQueryParts,\n  type ChangelogEntry,\n  loopBatchDeleteEntries,\n  loopBatchPutEntries,\n  type PutOpts,\n  parseTreeCursor,\n  parseTreeEntryMetadata,\n  serializeTreeEntryMetadata,\n  storageQuotaError,\n  type TreeEntry,\n  type TreeIndex,\n  type TreeIndexListEntriesResult,\n  type TreeIndexListOptions,\n  type TreeIndexListResult,\n  treeEntryMetadataEqual,\n} from \"./tree-index.js\";\nimport {\n  buildChildrenFrom,\n  buildTreeQueryResultFromSql,\n  buildTreeQueryStatements,\n  mapAggregateRows,\n  type TreeQueryResult,\n  type TreeQuerySpec,\n} from \"./tree-query.js\";\n\n/**\n * `isReferencedMany` IN-shard size for libsql/SQLite (design §7.2). SQLite's\n * default bound-param cap is ~999; the three-way UNION binds each cid 3×, so\n * 300 cids ⇒ ≤ ~906 params — comfortably under the cap on both branches.\n */\nexport const SQLITE_MANY_SHARD_SIZE = 300;\n\nconst VALID_ORDER_BY: Record<string, string> = {\n  path: \"path\",\n  mtime: \"mtime\",\n  size: \"size\",\n  ctime: \"ctime\",\n  mimeType: \"mime_type\",\n  name: \"name\",\n};\n\n/** The only nullable sortable column — NULLs must sort last (see tree-index.ts). */\nconst NULLABLE_ORDER_COLUMNS = new Set([\"mime_type\"]);\n\n/** libsql returns INTEGER columns as number|bigint; coerce to a JS number. */\nfunction num(v: unknown): number {\n  return typeof v === \"bigint\" ? Number(v) : ((v as number | null) ?? 0);\n}\n\n/** Raw sort-column value of a row for the keyset cursor (NULL stays null). */\nfunction sortValueOf(row: Record<string, unknown>, col: string): string | number | null {\n  const v = row[col];\n  if (v == null) return null;\n  if (typeof v === \"bigint\") return Number(v);\n  return v as string | number;\n}\n\nfunction mapChildRow(r: Record<string, unknown>): {\n  path: string;\n  cid: string;\n  size: number;\n  mtime: number;\n  ctime: number;\n  mimeType?: string;\n  content?: string;\n} {\n  const e: ReturnType<typeof mapChildRow> = {\n    path: r.path as string,\n    cid: (r.cid as string | null) ?? \"\",\n    size: num(r.size),\n    mtime: num(r.mtime),\n    ctime: num(r.ctime),\n    mimeType: (r.mime_type as string | null) ?? undefined,\n  };\n  // Present only when the SELECT projected it (includeContent) AND non-NULL.\n  if (r.content != null) e.content = r.content as string;\n  return e;\n}\n\nexport class SQLiteTreeIndex implements TreeIndex {\n  private readonly client: LibsqlClient;\n  private readonly maxEntriesPerScope: number;\n  /** upload-limits Phase 5 byte quota (0 = disabled, the opt-in default). */\n  private readonly maxBytesPerScope: number;\n  private readonly inline: ResolvedInlineConfig;\n\n  constructor(\n    db: MetadataDB,\n    private readonly scope: string,\n    opts?: { maxEntriesPerScope?: number; maxBytesPerScope?: number } & InlineContentOptions,\n  ) {\n    this.client = db.rawClient;\n    this.maxEntriesPerScope = opts?.maxEntriesPerScope ?? MAX_ENTRIES_PER_SCOPE;\n    this.maxBytesPerScope =\n      typeof opts?.maxBytesPerScope === \"number\" && opts.maxBytesPerScope > 0\n        ? opts.maxBytesPerScope\n        : 0;\n    this.inline = resolveInlineConfig(opts);\n  }\n\n  /**\n   * Current Σ size of this scope's file rows (upload-limits Phase 5 byte quota).\n   * SQLite (local Node) has no D1 rows_read billing, so a direct `SUM(size)` is\n   * fine here — same pattern as the file-count quota's `count(\"\")` scan (the\n   * trigger-maintained `scope_meta.total_bytes` is a D1-only optimization).\n   */\n  private async scopeTotalBytes(): Promise<number> {\n    const r = await this.client.execute({\n      sql: \"SELECT COALESCE(SUM(size), 0) as total FROM ds_entries WHERE scope = ? AND kind = 'file'\",\n      args: [this.scope],\n    });\n    return Number((r.rows[0] as { total?: number } | undefined)?.total ?? 0);\n  }\n\n  async get(path: string, opts?: { includeContent?: boolean }): Promise<TreeEntry | null> {\n    // Content column projected ONLY for inline-enabled indexes — a default-off\n    // index keeps issuing byte-identical legacy SQL (see d1-tree-index.ts).\n    // `includeContent` (default true) lets metadata-only callers skip the\n    // inline copy.\n    const contentCol =\n      (opts?.includeContent ?? true) && this.inline.inlineCache === \"on\" ? \", content\" : \"\";\n    const result = await this.client.execute({\n      sql: `SELECT cid, size, mtime, ctime, mime_type, metadata${contentCol} FROM ds_entries WHERE scope = ? AND path = ?`,\n      args: [this.scope, path],\n    });\n    const row = result.rows[0];\n    if (!row || row.cid == null) return null;\n    const entry: TreeEntry = {\n      cid: row.cid as string,\n      size: num(row.size),\n      mtime: num(row.mtime),\n      ctime: num(row.ctime),\n      mimeType: (row.mime_type as string | null) ?? undefined,\n    };\n    if (row.content != null) entry.content = row.content as string;\n    const meta = parseTreeEntryMetadata(row.metadata);\n    if (meta) entry.metadata = meta;\n    return entry;\n  }\n\n  async getDirTimes(dirPath: string): Promise<{ ctime: number; mtime: number } | null> {\n    // No `cid` filter (dir rows are cid-less, unlike get()); the trailing-slash\n    // dirPath is the scaffolded directory row key (ancestorDirs form).\n    const result = await this.client.execute({\n      sql: \"SELECT ctime, mtime FROM ds_entries WHERE scope = ? AND path = ?\",\n      args: [this.scope, dirPath],\n    });\n    const row = result.rows[0];\n    return row ? { ctime: num(row.ctime), mtime: num(row.mtime) } : null;\n  }\n\n  async put(path: string, entry: TreeEntry, opts: PutOpts): Promise<{ oldCid?: string }> {\n    validateDeviceId(opts.deviceId);\n\n    const existing = await this.get(path);\n    // Skip-if-unchanged: re-writing identical content at an existing path is a\n    // no-op (cid IS the content hash + the optimistic-concurrency version).\n    // Matching cid+mimeType ⇒ nothing changed, so skip the changelog row +\n    // UPSERT. Same contract as D1TreeIndex.put / MemoryTreeIndex.put.\n    //\n    // EXCEPTION (inline write-through re-fill): when inline caching is on, the\n    // skip MUST also confirm the inline `content` column already matches what\n    // this write would store. A row whose cid matches but whose inline copy was\n    // lost (legacy/unfilled row, or an externally voided copy) would otherwise\n    // stay missing forever — the write-through never re-fills it. Recompute the\n    // would-be inline content and skip only when the stored column already\n    // equals it.\n    if (\n      existing &&\n      existing.cid === entry.cid &&\n      existing.mimeType === entry.mimeType &&\n      treeEntryMetadataEqual(existing.metadata, entry.metadata)\n    ) {\n      // Metadata-aware skip (did-space-metadata G4): a metadata-only change\n      // keeps the same cid — fall through to the UPSERT so it lands.\n      if (this.inline.inlineCache !== \"on\") return { oldCid: existing.cid };\n      const wouldBeInline = await resolveInlineContent(entry, this.inline);\n      if ((existing.content ?? null) === wouldBeInline) return { oldCid: existing.cid };\n      // Inline copy is out of sync with the desired state — fall through to the\n      // UPSERT so the content column is re-filled (or cleared) to match the cid.\n    }\n    if (!existing) {\n      const currentCount = await this.count(\"\");\n      if (currentCount >= this.maxEntriesPerScope) {\n        throw storageQuotaError(\n          `Storage quota exceeded: scope \"${this.scope}\" has reached the ${this.maxEntriesPerScope} file limit`,\n        );\n      }\n    }\n    // upload-limits Phase 5 byte quota (opt-in; OFF when maxBytesPerScope===0).\n    // Guard the NET byte delta (overwrite-aware) so a grow-past-quota overwrite\n    // is also rejected. Direct SUM is fine on local SQLite (no D1 rows_read tax).\n    if (this.maxBytesPerScope > 0) {\n      const newBytes = entry.size - (existing?.size ?? 0);\n      if (newBytes > 0) {\n        const total = await this.scopeTotalBytes();\n        if (total + newBytes > this.maxBytesPerScope) {\n          throw storageQuotaError(\n            `Storage quota exceeded: scope \"${this.scope}\" has reached the ${this.maxBytesPerScope}-byte limit`,\n          );\n        }\n      }\n    }\n\n    const now = Date.now();\n    const stmts: Array<{ sql: string; args: InValue[] }> = [];\n\n    // Parent directory chain — preserves any existing dir row. Rule R2\n    // (feed-sort §5.2): the DIRECT parent's ctime/mtime are stamped from this\n    // write's application createdAt (when present); ancestors stay scaffold-\n    // only INSERT OR IGNORE.\n    const dirStamp = resolveParentDirStamp(entry.metadata);\n    const directParent = parentOf(path);\n    for (const dirPath of ancestorDirs(path)) {\n      stmts.push(\n        buildDirChainStmt(\n          this.scope,\n          dirPath,\n          dirStamp && dirPath === directParent ? dirStamp : null,\n          now,\n        ),\n      );\n    }\n\n    // Changelog row FIRST, with a correlated subquery for old_cid so the prior\n    // cid is read INSIDE the atomic batch (before the UPSERT below overwrites\n    // it). Same ordering invariant as D1TreeIndex.put.\n    if (!opts.skipChangelog) {\n      stmts.push({\n        sql: CHANGELOG_INSERT_SQL_WITH_SUBQUERY,\n        args: [\n          this.scope,\n          path,\n          entry.cid,\n          this.scope,\n          path,\n          entry.size,\n          entry.mtime,\n          opts.deviceId,\n        ],\n      });\n    }\n\n    // File UPSERT — ctime is set ONLY on first insert; ON CONFLICT preserves it.\n    stmts.push(await this.buildFileUpsert(path, entry));\n\n    // prefix_watermark bump (Live Update Resilience §11.4) — same atomic batch.\n    if (!opts.skipChangelog) {\n      const wmPrefix = watermarkWritePrefix(path);\n      if (wmPrefix !== null) {\n        stmts.push({ sql: PREFIX_WATERMARK_BUMP_SQL, args: [this.scope, wmPrefix] });\n      }\n    }\n\n    await this.client.batch(stmts, \"write\");\n    return { oldCid: existing?.cid };\n  }\n\n  /** Inline content this entry would store — drives loopBatchPutEntries' content-aware skip. */\n  inlineForEntry(entry: TreeEntry): Promise<string | null> {\n    return resolveInlineContent(entry, this.inline);\n  }\n\n  // ========== Dedup-on-write secondary index (#1159) ==========\n\n  /** Point seek on the `(scope, dedup_scope, dedup_key)` partial UNIQUE index. */\n  async findByDedupKey(\n    dedupScope: string,\n    dedupKey: string,\n  ): Promise<({ path: string } & TreeEntry) | null> {\n    const result = await this.client.execute({\n      sql: `SELECT path, cid, size, mtime, ctime, mime_type, metadata\n            FROM ds_entries WHERE scope = ? AND dedup_scope = ? AND dedup_key = ? LIMIT 1`,\n      args: [this.scope, dedupScope, dedupKey],\n    });\n    const row = result.rows[0];\n    if (!row || row.cid == null) return null;\n    const entry: { path: string } & TreeEntry = {\n      path: row.path as string,\n      cid: row.cid as string,\n      size: num(row.size),\n      mtime: num(row.mtime),\n      ctime: num(row.ctime),\n      mimeType: (row.mime_type as string | null) ?? undefined,\n    };\n    const meta = parseTreeEntryMetadata(row.metadata);\n    if (meta) entry.metadata = meta;\n    return entry;\n  }\n\n  /** Index-only backfill: set the dedup columns without touching content/changelog. */\n  async setDedupKey(\n    path: string,\n    dedupScope: string,\n    dedupKey: string,\n    opts: PutOpts,\n  ): Promise<void> {\n    validateDeviceId(opts.deviceId);\n    await this.client.execute({\n      sql: \"UPDATE ds_entries SET dedup_scope = ?, dedup_key = ? WHERE scope = ? AND path = ?\",\n      args: [dedupScope, dedupKey, this.scope, path],\n    });\n  }\n\n  async getPrefixWatermark(prefix: string): Promise<number | null> {\n    const wmPrefix = watermarkPrefix(prefix);\n    if (wmPrefix === null) return null;\n    const result = await this.client.execute({\n      sql: PREFIX_WATERMARK_READ_SQL,\n      args: [this.scope, wmPrefix],\n    });\n    return num(result.rows[0]?.version);\n  }\n\n  /**\n   * Build the file-row UPSERT. Inline-enabled indexes always write the\n   * content column (inline copy or NULL — an overwrite without inline content\n   * MUST clear any prior copy so the column never goes stale relative to the\n   * new cid); default-off indexes keep the byte-identical legacy statement\n   * (and never touch a not-yet-migrated database's missing column).\n   */\n  private async buildFileUpsert(\n    path: string,\n    entry: TreeEntry,\n  ): Promise<{ sql: string; args: InValue[] }> {\n    const base: InValue[] = [\n      this.scope,\n      path,\n      parentOf(path),\n      nameOf(path),\n      entry.cid,\n      entry.size,\n      entry.mimeType ?? null,\n      entry.ctime,\n      entry.mtime,\n    ];\n    const metadataValue = serializeTreeEntryMetadata(entry.metadata);\n    // Dedup-on-write columns (#1159). COALESCE on overwrite so a plain edit\n    // (which carries no dedup fields) never drops a dedup row out of the index;\n    // a dedup write / reindex supplies them and they win.\n    const dedupScopeValue = entry.dedupScope ?? null;\n    const dedupKeyValue = entry.dedupKey ?? null;\n    if (this.inline.inlineCache !== \"on\") {\n      return {\n        sql: `INSERT INTO ds_entries (scope, path, parent, name, kind, cid, size, mime_type, ctime, mtime, metadata, dedup_scope, dedup_key)\n              VALUES (?, ?, ?, ?, 'file', ?, ?, ?, ?, ?, ?, ?, ?)\n              ON CONFLICT(scope, path) DO UPDATE SET\n                cid = excluded.cid,\n                size = excluded.size,\n                mtime = excluded.mtime,\n                mime_type = excluded.mime_type,\n                metadata = excluded.metadata,\n                dedup_scope = COALESCE(excluded.dedup_scope, ds_entries.dedup_scope),\n                dedup_key = COALESCE(excluded.dedup_key, ds_entries.dedup_key)`,\n        args: [...base, metadataValue, dedupScopeValue, dedupKeyValue],\n      };\n    }\n    const inlineContent = await resolveInlineContent(entry, this.inline);\n    return {\n      sql: `INSERT INTO ds_entries (scope, path, parent, name, kind, cid, size, mime_type, ctime, mtime, content, metadata, dedup_scope, dedup_key)\n            VALUES (?, ?, ?, ?, 'file', ?, ?, ?, ?, ?, ?, ?, ?, ?)\n            ON CONFLICT(scope, path) DO UPDATE SET\n              cid = excluded.cid,\n              size = excluded.size,\n              mtime = excluded.mtime,\n              mime_type = excluded.mime_type,\n              content = excluded.content,\n              metadata = excluded.metadata,\n              dedup_scope = COALESCE(excluded.dedup_scope, ds_entries.dedup_scope),\n              dedup_key = COALESCE(excluded.dedup_key, ds_entries.dedup_key)`,\n      args: [...base, inlineContent, metadataValue, dedupScopeValue, dedupKeyValue],\n    };\n  }\n\n  async delete(path: string, opts: PutOpts): Promise<void> {\n    validateDeviceId(opts.deviceId);\n\n    const stmts: Array<{ sql: string; args: InValue[] }> = [];\n    if (!opts.skipChangelog) {\n      // INSERT...SELECT logs the delete ONLY when a file row with a non-null cid\n      // exists (no phantom delete rows for dirs or missing paths).\n      stmts.push({\n        sql: `INSERT INTO ds_changelog (scope, path, op, cid, old_cid, size, mtime, device_id)\n              SELECT ?, ?, 'delete', NULL, cid, NULL, ?, ?\n              FROM ds_entries WHERE scope = ? AND path = ? AND cid IS NOT NULL`,\n        // T1.5: client mtime when supplied (echo prevention + LWW), else server clock.\n        args: [this.scope, path, opts.mtime ?? Date.now(), opts.deviceId, this.scope, path],\n      });\n    }\n    stmts.push({\n      sql: \"DELETE FROM ds_entries WHERE scope = ? AND path = ?\",\n      args: [this.scope, path],\n    });\n    if (!opts.skipChangelog) {\n      const wmPrefix = watermarkWritePrefix(path);\n      if (wmPrefix !== null) {\n        stmts.push({ sql: PREFIX_WATERMARK_BUMP_SQL, args: [this.scope, wmPrefix] });\n      }\n    }\n    await this.client.batch(stmts, \"write\");\n\n    await this.cleanEmptyParents(path);\n  }\n\n  private async cleanEmptyParents(path: string): Promise<void> {\n    for (const dirPath of ancestorDirs(path)) {\n      const res = await this.client.execute({\n        sql: \"SELECT 1 FROM ds_entries WHERE scope = ? AND parent = ? LIMIT 1\",\n        args: [this.scope, dirPath],\n      });\n      if (res.rows.length > 0) break;\n      await this.client.execute({\n        sql: \"DELETE FROM ds_entries WHERE scope = ? AND path = ?\",\n        args: [this.scope, dirPath],\n      });\n    }\n  }\n\n  async list(prefix: string, options?: TreeIndexListOptions): Promise<TreeIndexListResult> {\n    const limit = options?.limit ?? 1000;\n    const col = VALID_ORDER_BY[options?.orderBy ?? \"path\"];\n    if (!col) throw new Error(`Invalid orderBy: ${options?.orderBy}`);\n    const order = options?.order ?? \"asc\";\n    if (limit === 0) return { entries: [], hasMore: false };\n\n    const [lo, hi] = prefixRange(prefix);\n    const args: InValue[] = [this.scope, lo, hi];\n    let sql = `SELECT path, ${col} as _sort FROM ds_entries WHERE scope = ? AND path >= ? AND path < ? AND kind = 'file'`;\n    if (options?.cursor) {\n      sql += ` AND ${col} ${order === \"asc\" ? \">\" : \"<\"} ?`;\n      args.push(options.cursor);\n    }\n    sql += ` ORDER BY ${col} ${order} LIMIT ?`;\n    args.push(limit + 1);\n\n    const result = await this.client.execute({ sql, args });\n    const hasMore = result.rows.length > limit;\n    const rows = hasMore ? result.rows.slice(0, limit) : result.rows;\n    return {\n      entries: rows.map((r) => ({ path: r.path as string })),\n      hasMore,\n      cursor: hasMore && rows.length > 0 ? String(rows[rows.length - 1]!._sort) : undefined,\n    };\n  }\n\n  async listEntries(\n    prefix: string,\n    options?: TreeIndexListOptions,\n  ): Promise<TreeIndexListEntriesResult> {\n    const limit = options?.limit ?? 1000;\n    const hasOrderBy = options?.orderBy !== undefined;\n    const col = VALID_ORDER_BY[options?.orderBy ?? \"path\"];\n    if (!col) throw new Error(`Invalid orderBy: ${options?.orderBy}`);\n    const order = options?.order === \"desc\" ? \"desc\" : \"asc\";\n    if (limit === 0) return { entries: [], hasMore: false };\n\n    const parsed = parseTreeCursor(options?.cursor, hasOrderBy);\n    const [lo, hi] = prefixRange(prefix);\n    const args: InValue[] = [this.scope, lo, hi];\n    // includeContent is opt-in projection — the default SELECT never touches\n    // the content column (zero-regression for every existing list path).\n    const contentCol = options?.includeContent ? \", content\" : \"\";\n    // Projecting non-indexed columns (cid/size/mtime/...) makes the planner\n    // default to the PRIMARY KEY path-range scan instead of idx_entries_kind\n    // (scope, kind, path) — reading every dir row in the range too (same\n    // planner behavior confirmed on libsql as on D1, see d1-tree-index.ts).\n    // Only force the hint when the sort column is `path` itself, matching the\n    // index's own order — other orderBy columns still need a manual sort.\n    const indexHint = col === \"path\" ? \" INDEXED BY idx_entries_kind\" : \"\";\n    let sql = `SELECT path, cid, size, mtime, ctime, mime_type${contentCol} FROM ds_entries${indexHint} WHERE scope = ? AND path >= ? AND path < ? AND kind = 'file'`;\n\n    if (hasOrderBy) {\n      // Keyset resume on (col, path) — path is the unique tiebreak. NULL\n      // mime_type sorts last in both directions. See tree-index.ts helpers.\n      const parts = buildOrderedQueryParts({\n        col,\n        nullable: NULLABLE_ORDER_COLUMNS.has(col),\n        order,\n        tieCol: \"path\",\n        cursor: parsed.kind === \"v2\" ? parsed.cursor : undefined,\n      });\n      if (parts.cursorWhereSql) {\n        sql += ` AND ${parts.cursorWhereSql}`;\n        args.push(...parts.cursorArgs);\n      }\n      sql += ` ORDER BY ${parts.orderSql} LIMIT ?`;\n    } else {\n      // Legacy path — byte-identical to the pre-orderBy behavior.\n      if (parsed.kind === \"legacy\") {\n        sql += ` AND ${col} ${order === \"asc\" ? \">\" : \"<\"} ?`;\n        args.push(parsed.value);\n      }\n      sql += ` ORDER BY ${col} ${order} LIMIT ?`;\n    }\n    args.push(limit + 1);\n\n    const result = await this.client.execute({ sql, args });\n    const hasMore = result.rows.length > limit;\n    const rows = hasMore ? result.rows.slice(0, limit) : result.rows;\n    const last = rows[rows.length - 1];\n    const cursor =\n      !hasMore || !last\n        ? undefined\n        : hasOrderBy\n          ? buildKeysetCursor(sortValueOf(last, col), last.path as string)\n          : String(last.path); // legacy default order is path — same value `_sort` held\n    return {\n      entries: rows.map((r) => {\n        const e: { path: string } & TreeEntry = {\n          path: r.path as string,\n          cid: r.cid as string,\n          size: num(r.size),\n          mtime: num(r.mtime),\n          ctime: num(r.ctime),\n          mimeType: (r.mime_type as string | null) ?? undefined,\n        };\n        if (options?.includeContent && r.content != null) e.content = r.content as string;\n        return e;\n      }),\n      hasMore,\n      cursor,\n    };\n  }\n\n  async hasChildren(prefix: string): Promise<boolean> {\n    const [lo, hi] = prefixRange(prefix);\n    const result = await this.client.execute({\n      sql: \"SELECT 1 FROM ds_entries WHERE scope = ? AND path >= ? AND path < ? AND kind = 'file' LIMIT 1\",\n      args: [this.scope, lo, hi],\n    });\n    return result.rows.length > 0;\n  }\n\n  async count(prefix: string): Promise<number> {\n    const [lo, hi] = prefixRange(prefix);\n    const result = await this.client.execute({\n      sql: \"SELECT COUNT(*) as cnt FROM ds_entries WHERE scope = ? AND path >= ? AND path < ? AND kind = 'file'\",\n      args: [this.scope, lo, hi],\n    });\n    return num(result.rows[0]?.cnt);\n  }\n\n  async deleteByPrefix(prefix: string, opts: PutOpts): Promise<number> {\n    validateDeviceId(opts.deviceId);\n    const [lo, hi] = prefixRange(prefix);\n\n    const stmts: Array<{ sql: string; args: InValue[] }> = [];\n    if (!opts.skipChangelog) {\n      stmts.push({\n        sql: `INSERT INTO ds_changelog (scope, path, op, cid, old_cid, size, mtime, device_id)\n              SELECT ?, path, 'delete', NULL, cid, NULL, ?, ?\n              FROM ds_entries INDEXED BY idx_entries_kind WHERE scope = ? AND path >= ? AND path < ? AND kind = 'file' AND cid IS NOT NULL`,\n        // T1.5: client mtime when supplied (echo prevention + LWW), else server clock.\n        args: [this.scope, opts.mtime ?? Date.now(), opts.deviceId, this.scope, lo, hi],\n      });\n    }\n    // Watermark bump BEFORE the DELETE so the DELETE stays the last statement\n    // (rowsAffected read below). First segment of the prefix (subtree delete).\n    if (!opts.skipChangelog) {\n      const wmPrefix = watermarkPrefix(prefix);\n      if (wmPrefix !== null) {\n        stmts.push({ sql: PREFIX_WATERMARK_BUMP_SQL, args: [this.scope, wmPrefix] });\n      }\n    }\n    stmts.push({\n      sql: \"DELETE FROM ds_entries WHERE scope = ? AND path >= ? AND path < ?\",\n      args: [this.scope, lo, hi],\n    });\n\n    const results = await this.client.batch(stmts, \"write\");\n    // Last stmt is the DELETE; rowsAffected includes dir rows (matches D1).\n    return num(results[results.length - 1]?.rowsAffected);\n  }\n\n  async listChildren(\n    parent: string,\n    options?: TreeIndexListOptions,\n  ): Promise<TreeIndexListEntriesResult> {\n    const limit = options?.limit ?? 1000;\n    const order = options?.order === \"desc\" ? \"desc\" : \"asc\";\n    if (limit === 0) return { entries: [], hasMore: false };\n\n    const hasOrderBy = options?.orderBy !== undefined;\n    const parsed = parseTreeCursor(options?.cursor, hasOrderBy);\n    const includeContent = options?.includeContent === true;\n    // Candidates FROM clause comes from the SHARED builder (tree-query.ts).\n    // Dir-per-record joins moved to the query engine's doc form (T4.3) —\n    // listChildren is always join-free now.\n    const t = \"e.\";\n    const from = buildChildrenFrom(undefined);\n    const args: InValue[] = [...from.args, this.scope, parent];\n    const contentCol = includeContent ? `, ${t}content` : \"\";\n    let sql = `SELECT ${t}path, ${t}cid, ${t}size, ${t}mtime, ${t}ctime, ${t}mime_type, ${t}name${contentCol} ${from.sql} WHERE ${t}scope = ? AND ${t}parent = ?`;\n\n    if (hasOrderBy) {\n      const col = VALID_ORDER_BY[options!.orderBy!];\n      if (!col) throw new Error(`Invalid orderBy: ${options?.orderBy}`);\n      // Keyset resume on (col, name) — name is unique within a parent.\n      const parts = buildOrderedQueryParts({\n        col: `${t}${col}`,\n        nullable: NULLABLE_ORDER_COLUMNS.has(col),\n        order,\n        tieCol: `${t}name`,\n        cursor: parsed.kind === \"v2\" ? parsed.cursor : undefined,\n      });\n      if (parts.cursorWhereSql) {\n        sql += ` AND ${parts.cursorWhereSql}`;\n        args.push(...parts.cursorArgs);\n      }\n      sql += ` ORDER BY ${parts.orderSql} LIMIT ?`;\n      args.push(limit + 1);\n\n      const result = await this.client.execute({ sql, args });\n      const hasMore = result.rows.length > limit;\n      const rows = hasMore ? result.rows.slice(0, limit) : result.rows;\n      const last = rows[rows.length - 1];\n      return {\n        entries: rows.map((r) => mapChildRow(r)),\n        hasMore,\n        cursor:\n          hasMore && last\n            ? buildKeysetCursor(sortValueOf(last, col), last.name as string)\n            : undefined,\n      };\n    }\n\n    // Legacy default path — byte-identical: ORDER BY name, plain name cursor.\n    if (parsed.kind === \"legacy\") {\n      sql += ` AND ${t}name ${order === \"asc\" ? \">\" : \"<\"} ?`;\n      args.push(parsed.value);\n    }\n    sql += ` ORDER BY ${t}name ${order} LIMIT ?`;\n    args.push(limit + 1);\n\n    const result = await this.client.execute({ sql, args });\n    const hasMore = result.rows.length > limit;\n    const rows = hasMore ? result.rows.slice(0, limit) : result.rows;\n    return {\n      entries: rows.map((r) => mapChildRow(r)),\n      hasMore,\n      cursor: hasMore && rows.length > 0 ? String(rows[rows.length - 1]!.name) : undefined,\n    };\n  }\n\n  async countChildren(parent: string): Promise<number> {\n    const result = await this.client.execute({\n      sql: \"SELECT COUNT(*) as cnt FROM ds_entries WHERE scope = ? AND parent = ?\",\n      args: [this.scope, parent],\n    });\n    return num(result.rows[0]?.cnt);\n  }\n\n  /** Collection query (afs-collection-query Phase 1) — see tree-query.ts. */\n  async query(parent: string, spec: TreeQuerySpec): Promise<TreeQueryResult> {\n    const statements = buildTreeQueryStatements({ scope: this.scope, parent, spec });\n\n    // Aggregate-mode (Phase 2 / G2.D): swaps the rows+count SQL for the\n    // single aggregate SELECT + a group-cardinality counter.\n    if (statements.aggregate) {\n      const [aggRes, countRes] = await Promise.all([\n        this.client.execute({\n          sql: statements.aggregate.select.sql,\n          args: statements.aggregate.select.args,\n        }),\n        this.client.execute({\n          sql: statements.aggregate.countGroups.sql,\n          args: statements.aggregate.countGroups.args,\n        }),\n      ]);\n      // Zero-dim groupBy with empty input: SQL gives one row (because\n      // `SELECT count(*)` always returns one) but the values are 0 — that\n      // matches the reference behavior; no special handling needed.\n      const aggregateGroups = mapAggregateRows(\n        aggRes.rows as unknown as Array<Record<string, unknown>>,\n        statements.aggregate.groupKeys,\n        statements.aggregate.aggregations,\n      );\n      // total = number of distinct group rows; zero-dim path returns 1 (one\n      // forced row, matching the reference's zero-dim exception).\n      const total = statements.aggregate.groupKeys.length === 0 ? 1 : num(countRes.rows[0]?.cnt);\n      return { rows: [], total, aggregateGroups };\n    }\n\n    const [rowsRes, countRes, groupsRes, seekRes] = await Promise.all([\n      this.client.execute({ sql: statements.rows.sql, args: statements.rows.args }),\n      // skipTotal: no count statement was built — skip the full-directory scan\n      // and report total: -1 below.\n      statements.count\n        ? this.client.execute({ sql: statements.count.sql, args: statements.count.args })\n        : Promise.resolve(undefined),\n      statements.groups\n        ? this.client.execute({ sql: statements.groups.sql, args: statements.groups.args })\n        : Promise.resolve(undefined),\n      statements.seek\n        ? this.client.execute({ sql: statements.seek.sql, args: statements.seek.args })\n        : Promise.resolve(undefined),\n    ]);\n\n    const seekOffset = statements.seek\n      ? seekRes && seekRes.rows.length > 0\n        ? num(seekRes.rows[0]?.rn)\n        : -1\n      : undefined;\n\n    return buildTreeQueryResultFromSql({\n      rawRows: rowsRes.rows as unknown as Array<Record<string, unknown>>,\n      total: countRes ? num(countRes.rows[0]?.cnt) : -1,\n      groupRows: groupsRes?.rows.map((r) => ({ t: r.t, v: r.v, cnt: r.cnt })),\n      spec,\n      orderField: statements.order.field,\n      seekOffset,\n    });\n  }\n\n  /** Page-bounded grouped child counts — see D1TreeIndex.countChildrenMany\n   *  (same ≤90-per-chunk shape kept for cross-backend statement parity). */\n  async countChildrenMany(parents: string[]): Promise<Map<string, number>> {\n    const map = new Map<string, number>();\n    for (let offset = 0; offset < parents.length; offset += 90) {\n      const chunk = parents.slice(offset, offset + 90);\n      const result = await this.client.execute({\n        sql: `SELECT parent, COUNT(*) as cnt FROM ds_entries WHERE scope = ? AND parent IN (${chunk.map(() => \"?\").join(\",\")}) GROUP BY parent`,\n        args: [this.scope, ...chunk],\n      });\n      for (const r of result.rows) map.set(r.parent as string, num(r.cnt));\n    }\n    return map;\n  }\n\n  async aggregate(prefix: string): Promise<{ fileCount: number; totalSize: number }> {\n    const [lo, hi] = prefixRange(prefix);\n    const result = await this.client.execute({\n      sql: `SELECT COUNT(*) as file_count, COALESCE(SUM(size), 0) as total_size\n            FROM ds_entries INDEXED BY idx_entries_kind WHERE scope = ? AND path >= ? AND path < ? AND kind = 'file'`,\n      args: [this.scope, lo, hi],\n    });\n    const row = result.rows[0];\n    return { fileCount: num(row?.file_count), totalSize: num(row?.total_size) };\n  }\n\n  /** Batch metadata read — loop over get (no IN-merge needed off-CF). */\n  async getMany(paths: string[]): Promise<Map<string, TreeEntry | null>> {\n    const map = new Map<string, TreeEntry | null>();\n    for (const path of paths) map.set(path, await this.get(path));\n    return map;\n  }\n\n  /** Batch sync fast path — loop reference semantics (conformance-pinned\n   *  equivalent of the merged D1 implementation). */\n  async batchPutEntries(\n    entries: BatchPutEntry[],\n    ctx?: BatchIndexContext,\n  ): Promise<BatchPutEntryResult[]> {\n    return loopBatchPutEntries(this, entries, ctx);\n  }\n\n  /** Delete twin of {@link batchPutEntries} (loop reference semantics). */\n  async batchDeleteEntries(\n    entries: BatchDeleteEntry[],\n    ctx?: BatchIndexContext,\n  ): Promise<BatchDeleteEntryResult[]> {\n    return loopBatchDeleteEntries(this, entries, ctx);\n  }\n\n  async putBatch(entries: Array<{ path: string; entry: TreeEntry }>, opts: PutOpts): Promise<void> {\n    if (entries.length === 0) return;\n    validateDeviceId(opts.deviceId);\n\n    const now = Date.now();\n    const stmts: Array<{ sql: string; args: InValue[] }> = [];\n\n    // Rule R2 (feed-sort §5.2): stamp each direct parent of a createdAt-bearing\n    // write (LWW by entry order); ancestors stay scaffold-only INSERT OR IGNORE.\n    const dirStamps = new Map<string, { ctime: number; mtime: number }>();\n    const allDirs = new Set<string>();\n    for (const { path, entry } of entries) {\n      const stamp = resolveParentDirStamp(entry.metadata);\n      if (stamp) dirStamps.set(parentOf(path), stamp);\n      for (const dirPath of ancestorDirs(path)) {\n        if (allDirs.has(dirPath)) break;\n        allDirs.add(dirPath);\n      }\n    }\n    for (const dirPath of allDirs) {\n      stmts.push(buildDirChainStmt(this.scope, dirPath, dirStamps.get(dirPath) ?? null, now));\n    }\n\n    for (const { path, entry } of entries) {\n      if (!opts.skipChangelog) {\n        stmts.push({\n          sql: CHANGELOG_INSERT_SQL_WITH_SUBQUERY,\n          args: [\n            this.scope,\n            path,\n            entry.cid,\n            this.scope,\n            path,\n            entry.size,\n            entry.mtime,\n            opts.deviceId,\n          ],\n        });\n      }\n      stmts.push(await this.buildFileUpsert(path, entry));\n    }\n\n    // One watermark bump per DISTINCT collection root touched (matches D1).\n    if (!opts.skipChangelog) {\n      const wmPrefixes = new Set<string>();\n      for (const { path } of entries) {\n        const wmPrefix = watermarkWritePrefix(path);\n        if (wmPrefix !== null) wmPrefixes.add(wmPrefix);\n      }\n      for (const wmPrefix of wmPrefixes) {\n        stmts.push({ sql: PREFIX_WATERMARK_BUMP_SQL, args: [this.scope, wmPrefix] });\n      }\n    }\n\n    await this.client.batch(stmts, \"write\");\n  }\n\n  async listModifiedSince(\n    prefix: string,\n    since: number,\n    options?: TreeIndexListOptions,\n  ): Promise<TreeIndexListEntriesResult> {\n    const limit = options?.limit ?? 1000;\n    const order = options?.order ?? \"asc\";\n    if (limit === 0) return { entries: [], hasMore: false };\n\n    const [lo, hi] = prefixRange(prefix);\n    const args: InValue[] = [this.scope, lo, hi, since];\n    let sql = `SELECT path, cid, size, mtime, ctime, mime_type FROM ds_entries INDEXED BY idx_entries_kind\n               WHERE scope = ? AND path >= ? AND path < ? AND mtime > ? AND kind = 'file'`;\n    if (options?.cursor) {\n      sql += ` AND path ${order === \"asc\" ? \">\" : \"<\"} ?`;\n      args.push(options.cursor);\n    }\n    sql += ` ORDER BY path ${order} LIMIT ?`;\n    args.push(limit + 1);\n\n    const result = await this.client.execute({ sql, args });\n    const hasMore = result.rows.length > limit;\n    const rows = hasMore ? result.rows.slice(0, limit) : result.rows;\n    return {\n      entries: rows.map((r) => ({\n        path: r.path as string,\n        cid: r.cid as string,\n        size: num(r.size),\n        mtime: num(r.mtime),\n        ctime: num(r.ctime),\n        mimeType: (r.mime_type as string | null) ?? undefined,\n      })),\n      hasMore,\n      cursor: hasMore && rows.length > 0 ? String(rows[rows.length - 1]!.path) : undefined,\n    };\n  }\n\n  async getMaxSeq(): Promise<number> {\n    const [result, compactedBelow] = await Promise.all([\n      this.client.execute({\n        sql: \"SELECT MAX(seq) as maxSeq FROM ds_changelog WHERE scope = ?\",\n        args: [this.scope],\n      }),\n      this.getCompactedBelowSeq(),\n    ]);\n    return Math.max(num(result.rows[0]?.maxSeq), compactedBelow);\n  }\n\n  /**\n   * Read-auth reference check (design §4.1) — three-way, scoped, optionally\n   * prefix-local. See {@link TreeIndex.isReferenced}.\n   */\n  async isReferenced(cid: string, pathPrefix = \"\"): Promise<boolean> {\n    if (!cid) return false;\n    // Whole-scope (pathPrefix \"\") applies NO path filter — see the matching\n    // comment in D1TreeIndex.isReferenced (the `prefixRange(\"\")` `\\xff` sentinel\n    // mis-sorts multibyte UTF-8 paths).\n    if (pathPrefix === \"\") {\n      const result = await this.client.execute({\n        sql: `SELECT 1 FROM (\n                SELECT 1 FROM ds_entries   WHERE scope = ? AND cid     = ?\n                UNION ALL\n                SELECT 1 FROM ds_changelog WHERE scope = ? AND cid     = ?\n                UNION ALL\n                SELECT 1 FROM ds_changelog WHERE scope = ? AND old_cid = ?\n              ) LIMIT 1`,\n        args: [this.scope, cid, this.scope, cid, this.scope, cid],\n      });\n      return result.rows.length > 0;\n    }\n    const [lo, hi] = prefixRange(pathPrefix);\n    const result = await this.client.execute({\n      sql: `SELECT 1 FROM (\n              SELECT 1 FROM ds_entries   WHERE scope = ? AND cid     = ? AND path >= ? AND path < ?\n              UNION ALL\n              SELECT 1 FROM ds_changelog WHERE scope = ? AND cid     = ? AND path >= ? AND path < ?\n              UNION ALL\n              SELECT 1 FROM ds_changelog WHERE scope = ? AND old_cid = ? AND path >= ? AND path < ?\n            ) LIMIT 1`,\n      args: [this.scope, cid, lo, hi, this.scope, cid, lo, hi, this.scope, cid, lo, hi],\n    });\n    return result.rows.length > 0;\n  }\n\n  /**\n   * Batch read-auth (design §7.2 / §14) — three-way-equivalent to per-cid\n   * {@link isReferenced}, sharded (see {@link SQLITE_MANY_SHARD_SIZE}). Returns\n   * the referenced subset of `cids`.\n   */\n  async isReferencedMany(cids: string[], pathPrefix = \"\"): Promise<Set<string>> {\n    const referenced = new Set<string>();\n    const unique = [...new Set(cids.filter((c) => c))];\n    if (unique.length === 0) return referenced;\n    const usePrefix = pathPrefix !== \"\";\n    const [lo, hi] = usePrefix ? prefixRange(pathPrefix) : [\"\", \"\"];\n    for (let i = 0; i < unique.length; i += SQLITE_MANY_SHARD_SIZE) {\n      const shard = unique.slice(i, i + SQLITE_MANY_SHARD_SIZE);\n      const ph = shard.map(() => \"?\").join(\",\");\n      const tail = usePrefix ? \"AND path >= ? AND path < ?\" : \"\";\n      const sql = `SELECT cid     AS c FROM ds_entries   WHERE scope = ? AND cid     IN (${ph}) ${tail}\n                   UNION\n                   SELECT cid     AS c FROM ds_changelog WHERE scope = ? AND cid     IN (${ph}) ${tail}\n                   UNION\n                   SELECT old_cid AS c FROM ds_changelog WHERE scope = ? AND old_cid IN (${ph}) ${tail}`;\n      const args: InValue[] = [];\n      for (let b = 0; b < 3; b++) {\n        args.push(this.scope, ...shard);\n        if (usePrefix) args.push(lo, hi);\n      }\n      const result = await this.client.execute({ sql, args });\n      for (const row of result.rows) {\n        const c = row.c as string | null;\n        if (c) referenced.add(c);\n      }\n    }\n    return referenced;\n  }\n\n  async getChangelogSince(\n    sinceSeq: number,\n    limit: number,\n  ): Promise<{ entries: ChangelogEntry[]; hasMore: boolean; cursor: number }> {\n    const safeLimit = limit > 0 ? limit : 0;\n    if (safeLimit === 0) return { entries: [], hasMore: false, cursor: sinceSeq };\n\n    const result = await this.client.execute({\n      sql: `SELECT seq, scope, path, op, cid, old_cid, size, mtime, device_id\n            FROM ds_changelog WHERE scope = ? AND seq > ? ORDER BY seq ASC LIMIT ?`,\n      args: [this.scope, sinceSeq, safeLimit + 1],\n    });\n    const hasMore = result.rows.length > safeLimit;\n    const rows = hasMore ? result.rows.slice(0, safeLimit) : result.rows;\n    const entries: ChangelogEntry[] = rows.map((r) => ({\n      seq: num(r.seq),\n      scope: r.scope as string,\n      path: r.path as string,\n      op: r.op as \"put\" | \"delete\",\n      cid: (r.cid as string | null) ?? null,\n      old_cid: (r.old_cid as string | null) ?? null,\n      size: r.size == null ? null : num(r.size),\n      mtime: num(r.mtime),\n      device_id: r.device_id as string,\n    }));\n    const cursor = entries.length > 0 ? entries[entries.length - 1]!.seq : sinceSeq;\n    return { entries, hasMore, cursor };\n  }\n\n  async getCompactedBelowSeq(): Promise<number> {\n    // Node/SQLite has no compaction job yet (Phase 2). Return 0 (permissive).\n    return 0;\n  }\n\n  // ========== Source-side dirty queue (index-follower-dirty-path §7) ==========\n  //\n  // Row-for-row aligned with D1TreeIndex's queue methods; only the client API\n  // differs (libsql `execute({sql,args})` + `rowsAffected` vs D1\n  // `prepare().bind().run()` + `meta.changes`). The `ds_dirty_path` table +\n  // trigger live in the same `_metadata.db` (created by MetadataDB.open), so\n  // these operate on the SAME DB that holds `ds_changelog`.\n\n  async listDirtyPaths(options: ListDirtyPathOptions): Promise<DirtyPathRow[]> {\n    const now = options.now ?? Date.now();\n    const limit = options.limit > 0 ? options.limit : 0;\n    if (limit === 0) return [];\n    const [lo, hi] = prefixRange(options.prefix);\n    const { rows } = await this.client.execute({\n      sql: DIRTY_PATH_LIST_SQL,\n      args: [this.scope, lo, hi, now, limit],\n    });\n    return rows.map((r) => ({\n      path: String(r.path),\n      latestSeq: Number(r.latest_seq),\n      op: String(r.op) as \"put\" | \"delete\",\n      cid: r.cid == null ? null : String(r.cid),\n      mtime: Number(r.mtime),\n      attempts: Number(r.attempts),\n    }));\n  }\n\n  async ackDirtyPath(path: string, latestSeq: number): Promise<boolean> {\n    const res = await this.client.execute({\n      sql: DIRTY_PATH_ACK_SQL,\n      args: [this.scope, path, latestSeq],\n    });\n    return (res.rowsAffected ?? 0) > 0;\n  }\n\n  async markDirtyPathError(\n    path: string,\n    latestSeq: number,\n    error: string,\n    nextAttemptAt: number,\n  ): Promise<boolean> {\n    const res = await this.client.execute({\n      sql: DIRTY_PATH_MARK_ERROR_SQL,\n      args: [error, nextAttemptAt, this.scope, path, latestSeq],\n    });\n    return (res.rowsAffected ?? 0) > 0;\n  }\n}\n\n/**\n * Put-path changelog INSERT with a correlated subquery reading the pre-write\n * cid as old_cid (mirrors D1TreeIndex). Distinct from the plain\n * `CHANGELOG_INSERT_SQL` in changelog-write.ts which takes old_cid as a bound\n * param (used by MetadataDB.upsertEntry, which pre-reads old_cid separately).\n */\nconst CHANGELOG_INSERT_SQL_WITH_SUBQUERY = `INSERT INTO ds_changelog (scope, path, op, cid, old_cid, size, mtime, device_id)\n   VALUES (?, ?, 'put', ?, (SELECT cid FROM ds_entries WHERE scope = ? AND path = ?), ?, ?, ?)`;\n"],"mappings":";;;;;;;;;;;;;;;;AAkFA,MAAa,yBAAyB;AAEtC,MAAM,iBAAyC;CAC7C,MAAM;CACN,OAAO;CACP,MAAM;CACN,OAAO;CACP,UAAU;CACV,MAAM;CACP;;AAGD,MAAM,yBAAyB,IAAI,IAAI,CAAC,YAAY,CAAC;;AAGrD,SAAS,IAAI,GAAoB;AAC/B,QAAO,OAAO,MAAM,WAAW,OAAO,EAAE,GAAK,KAAuB;;;AAItE,SAAS,YAAY,KAA8B,KAAqC;CACtF,MAAM,IAAI,IAAI;AACd,KAAI,KAAK,KAAM,QAAO;AACtB,KAAI,OAAO,MAAM,SAAU,QAAO,OAAO,EAAE;AAC3C,QAAO;;AAGT,SAAS,YAAY,GAQnB;CACA,MAAM,IAAoC;EACxC,MAAM,EAAE;EACR,KAAM,EAAE,OAAyB;EACjC,MAAM,IAAI,EAAE,KAAK;EACjB,OAAO,IAAI,EAAE,MAAM;EACnB,OAAO,IAAI,EAAE,MAAM;EACnB,UAAW,EAAE,aAA+B;EAC7C;AAED,KAAI,EAAE,WAAW,KAAM,GAAE,UAAU,EAAE;AACrC,QAAO;;AAGT,IAAa,kBAAb,MAAkD;CAChD,AAAiB;CACjB,AAAiB;;CAEjB,AAAiB;CACjB,AAAiB;CAEjB,YACE,IACA,AAAiB,OACjB,MACA;EAFiB;AAGjB,OAAK,SAAS,GAAG;AACjB,OAAK,qBAAqB,MAAM,sBAAsB;AACtD,OAAK,mBACH,OAAO,MAAM,qBAAqB,YAAY,KAAK,mBAAmB,IAClE,KAAK,mBACL;AACN,OAAK,SAAS,oBAAoB,KAAK;;;;;;;;CASzC,MAAc,kBAAmC;EAC/C,MAAM,IAAI,MAAM,KAAK,OAAO,QAAQ;GAClC,KAAK;GACL,MAAM,CAAC,KAAK,MAAM;GACnB,CAAC;AACF,SAAO,OAAQ,EAAE,KAAK,IAAuC,SAAS,EAAE;;CAG1E,MAAM,IAAI,MAAc,MAAgE;EAKtF,MAAM,cACH,MAAM,kBAAkB,SAAS,KAAK,OAAO,gBAAgB,OAAO,cAAc;EAKrF,MAAM,OAJS,MAAM,KAAK,OAAO,QAAQ;GACvC,KAAK,sDAAsD,WAAW;GACtE,MAAM,CAAC,KAAK,OAAO,KAAK;GACzB,CAAC,EACiB,KAAK;AACxB,MAAI,CAAC,OAAO,IAAI,OAAO,KAAM,QAAO;EACpC,MAAM,QAAmB;GACvB,KAAK,IAAI;GACT,MAAM,IAAI,IAAI,KAAK;GACnB,OAAO,IAAI,IAAI,MAAM;GACrB,OAAO,IAAI,IAAI,MAAM;GACrB,UAAW,IAAI,aAA+B;GAC/C;AACD,MAAI,IAAI,WAAW,KAAM,OAAM,UAAU,IAAI;EAC7C,MAAM,OAAO,uBAAuB,IAAI,SAAS;AACjD,MAAI,KAAM,OAAM,WAAW;AAC3B,SAAO;;CAGT,MAAM,YAAY,SAAmE;EAOnF,MAAM,OAJS,MAAM,KAAK,OAAO,QAAQ;GACvC,KAAK;GACL,MAAM,CAAC,KAAK,OAAO,QAAQ;GAC5B,CAAC,EACiB,KAAK;AACxB,SAAO,MAAM;GAAE,OAAO,IAAI,IAAI,MAAM;GAAE,OAAO,IAAI,IAAI,MAAM;GAAE,GAAG;;CAGlE,MAAM,IAAI,MAAc,OAAkB,MAA6C;AACrF,mBAAiB,KAAK,SAAS;EAE/B,MAAM,WAAW,MAAM,KAAK,IAAI,KAAK;AAarC,MACE,YACA,SAAS,QAAQ,MAAM,OACvB,SAAS,aAAa,MAAM,YAC5B,uBAAuB,SAAS,UAAU,MAAM,SAAS,EACzD;AAGA,OAAI,KAAK,OAAO,gBAAgB,KAAM,QAAO,EAAE,QAAQ,SAAS,KAAK;GACrE,MAAM,gBAAgB,MAAM,qBAAqB,OAAO,KAAK,OAAO;AACpE,QAAK,SAAS,WAAW,UAAU,cAAe,QAAO,EAAE,QAAQ,SAAS,KAAK;;AAInF,MAAI,CAAC,UAEH;OADqB,MAAM,KAAK,MAAM,GAAG,IACrB,KAAK,mBACvB,OAAM,kBACJ,kCAAkC,KAAK,MAAM,oBAAoB,KAAK,mBAAmB,aAC1F;;AAML,MAAI,KAAK,mBAAmB,GAAG;GAC7B,MAAM,WAAW,MAAM,QAAQ,UAAU,QAAQ;AACjD,OAAI,WAAW,GAEb;QADc,MAAM,KAAK,iBAAiB,GAC9B,WAAW,KAAK,iBAC1B,OAAM,kBACJ,kCAAkC,KAAK,MAAM,oBAAoB,KAAK,iBAAiB,aACxF;;;EAKP,MAAM,MAAM,KAAK,KAAK;EACtB,MAAM,QAAiD,EAAE;EAMzD,MAAM,WAAW,sBAAsB,MAAM,SAAS;EACtD,MAAM,eAAe,SAAS,KAAK;AACnC,OAAK,MAAM,WAAW,aAAa,KAAK,CACtC,OAAM,KACJ,kBACE,KAAK,OACL,SACA,YAAY,YAAY,eAAe,WAAW,MAClD,IACD,CACF;AAMH,MAAI,CAAC,KAAK,cACR,OAAM,KAAK;GACT,KAAK;GACL,MAAM;IACJ,KAAK;IACL;IACA,MAAM;IACN,KAAK;IACL;IACA,MAAM;IACN,MAAM;IACN,KAAK;IACN;GACF,CAAC;AAIJ,QAAM,KAAK,MAAM,KAAK,gBAAgB,MAAM,MAAM,CAAC;AAGnD,MAAI,CAAC,KAAK,eAAe;GACvB,MAAM,WAAW,qBAAqB,KAAK;AAC3C,OAAI,aAAa,KACf,OAAM,KAAK;IAAE,KAAK;IAA2B,MAAM,CAAC,KAAK,OAAO,SAAS;IAAE,CAAC;;AAIhF,QAAM,KAAK,OAAO,MAAM,OAAO,QAAQ;AACvC,SAAO,EAAE,QAAQ,UAAU,KAAK;;;CAIlC,eAAe,OAA0C;AACvD,SAAO,qBAAqB,OAAO,KAAK,OAAO;;;CAMjD,MAAM,eACJ,YACA,UACgD;EAMhD,MAAM,OALS,MAAM,KAAK,OAAO,QAAQ;GACvC,KAAK;;GAEL,MAAM;IAAC,KAAK;IAAO;IAAY;IAAS;GACzC,CAAC,EACiB,KAAK;AACxB,MAAI,CAAC,OAAO,IAAI,OAAO,KAAM,QAAO;EACpC,MAAM,QAAsC;GAC1C,MAAM,IAAI;GACV,KAAK,IAAI;GACT,MAAM,IAAI,IAAI,KAAK;GACnB,OAAO,IAAI,IAAI,MAAM;GACrB,OAAO,IAAI,IAAI,MAAM;GACrB,UAAW,IAAI,aAA+B;GAC/C;EACD,MAAM,OAAO,uBAAuB,IAAI,SAAS;AACjD,MAAI,KAAM,OAAM,WAAW;AAC3B,SAAO;;;CAIT,MAAM,YACJ,MACA,YACA,UACA,MACe;AACf,mBAAiB,KAAK,SAAS;AAC/B,QAAM,KAAK,OAAO,QAAQ;GACxB,KAAK;GACL,MAAM;IAAC;IAAY;IAAU,KAAK;IAAO;IAAK;GAC/C,CAAC;;CAGJ,MAAM,mBAAmB,QAAwC;EAC/D,MAAM,WAAW,gBAAgB,OAAO;AACxC,MAAI,aAAa,KAAM,QAAO;AAK9B,SAAO,KAJQ,MAAM,KAAK,OAAO,QAAQ;GACvC,KAAK;GACL,MAAM,CAAC,KAAK,OAAO,SAAS;GAC7B,CAAC,EACgB,KAAK,IAAI,QAAQ;;;;;;;;;CAUrC,MAAc,gBACZ,MACA,OAC2C;EAC3C,MAAM,OAAkB;GACtB,KAAK;GACL;GACA,SAAS,KAAK;GACd,OAAO,KAAK;GACZ,MAAM;GACN,MAAM;GACN,MAAM,YAAY;GAClB,MAAM;GACN,MAAM;GACP;EACD,MAAM,gBAAgB,2BAA2B,MAAM,SAAS;EAIhE,MAAM,kBAAkB,MAAM,cAAc;EAC5C,MAAM,gBAAgB,MAAM,YAAY;AACxC,MAAI,KAAK,OAAO,gBAAgB,KAC9B,QAAO;GACL,KAAK;;;;;;;;;;GAUL,MAAM;IAAC,GAAG;IAAM;IAAe;IAAiB;IAAc;GAC/D;EAEH,MAAM,gBAAgB,MAAM,qBAAqB,OAAO,KAAK,OAAO;AACpE,SAAO;GACL,KAAK;;;;;;;;;;;GAWL,MAAM;IAAC,GAAG;IAAM;IAAe;IAAe;IAAiB;IAAc;GAC9E;;CAGH,MAAM,OAAO,MAAc,MAA8B;AACvD,mBAAiB,KAAK,SAAS;EAE/B,MAAM,QAAiD,EAAE;AACzD,MAAI,CAAC,KAAK,cAGR,OAAM,KAAK;GACT,KAAK;;;GAIL,MAAM;IAAC,KAAK;IAAO;IAAM,KAAK,SAAS,KAAK,KAAK;IAAE,KAAK;IAAU,KAAK;IAAO;IAAK;GACpF,CAAC;AAEJ,QAAM,KAAK;GACT,KAAK;GACL,MAAM,CAAC,KAAK,OAAO,KAAK;GACzB,CAAC;AACF,MAAI,CAAC,KAAK,eAAe;GACvB,MAAM,WAAW,qBAAqB,KAAK;AAC3C,OAAI,aAAa,KACf,OAAM,KAAK;IAAE,KAAK;IAA2B,MAAM,CAAC,KAAK,OAAO,SAAS;IAAE,CAAC;;AAGhF,QAAM,KAAK,OAAO,MAAM,OAAO,QAAQ;AAEvC,QAAM,KAAK,kBAAkB,KAAK;;CAGpC,MAAc,kBAAkB,MAA6B;AAC3D,OAAK,MAAM,WAAW,aAAa,KAAK,EAAE;AAKxC,QAJY,MAAM,KAAK,OAAO,QAAQ;IACpC,KAAK;IACL,MAAM,CAAC,KAAK,OAAO,QAAQ;IAC5B,CAAC,EACM,KAAK,SAAS,EAAG;AACzB,SAAM,KAAK,OAAO,QAAQ;IACxB,KAAK;IACL,MAAM,CAAC,KAAK,OAAO,QAAQ;IAC5B,CAAC;;;CAIN,MAAM,KAAK,QAAgB,SAA8D;EACvF,MAAM,QAAQ,SAAS,SAAS;EAChC,MAAM,MAAM,eAAe,SAAS,WAAW;AAC/C,MAAI,CAAC,IAAK,OAAM,IAAI,MAAM,oBAAoB,SAAS,UAAU;EACjE,MAAM,QAAQ,SAAS,SAAS;AAChC,MAAI,UAAU,EAAG,QAAO;GAAE,SAAS,EAAE;GAAE,SAAS;GAAO;EAEvD,MAAM,CAAC,IAAI,MAAM,YAAY,OAAO;EACpC,MAAM,OAAkB;GAAC,KAAK;GAAO;GAAI;GAAG;EAC5C,IAAI,MAAM,gBAAgB,IAAI;AAC9B,MAAI,SAAS,QAAQ;AACnB,UAAO,QAAQ,IAAI,GAAG,UAAU,QAAQ,MAAM,IAAI;AAClD,QAAK,KAAK,QAAQ,OAAO;;AAE3B,SAAO,aAAa,IAAI,GAAG,MAAM;AACjC,OAAK,KAAK,QAAQ,EAAE;EAEpB,MAAM,SAAS,MAAM,KAAK,OAAO,QAAQ;GAAE;GAAK;GAAM,CAAC;EACvD,MAAM,UAAU,OAAO,KAAK,SAAS;EACrC,MAAM,OAAO,UAAU,OAAO,KAAK,MAAM,GAAG,MAAM,GAAG,OAAO;AAC5D,SAAO;GACL,SAAS,KAAK,KAAK,OAAO,EAAE,MAAM,EAAE,MAAgB,EAAE;GACtD;GACA,QAAQ,WAAW,KAAK,SAAS,IAAI,OAAO,KAAK,KAAK,SAAS,GAAI,MAAM,GAAG;GAC7E;;CAGH,MAAM,YACJ,QACA,SACqC;EACrC,MAAM,QAAQ,SAAS,SAAS;EAChC,MAAM,aAAa,SAAS,YAAY;EACxC,MAAM,MAAM,eAAe,SAAS,WAAW;AAC/C,MAAI,CAAC,IAAK,OAAM,IAAI,MAAM,oBAAoB,SAAS,UAAU;EACjE,MAAM,QAAQ,SAAS,UAAU,SAAS,SAAS;AACnD,MAAI,UAAU,EAAG,QAAO;GAAE,SAAS,EAAE;GAAE,SAAS;GAAO;EAEvD,MAAM,SAAS,gBAAgB,SAAS,QAAQ,WAAW;EAC3D,MAAM,CAAC,IAAI,MAAM,YAAY,OAAO;EACpC,MAAM,OAAkB;GAAC,KAAK;GAAO;GAAI;GAAG;EAW5C,IAAI,MAAM,kDARS,SAAS,iBAAiB,cAAc,GAQY,kBADrD,QAAQ,SAAS,iCAAiC,GAC+B;AAEnG,MAAI,YAAY;GAGd,MAAM,QAAQ,uBAAuB;IACnC;IACA,UAAU,uBAAuB,IAAI,IAAI;IACzC;IACA,QAAQ;IACR,QAAQ,OAAO,SAAS,OAAO,OAAO,SAAS;IAChD,CAAC;AACF,OAAI,MAAM,gBAAgB;AACxB,WAAO,QAAQ,MAAM;AACrB,SAAK,KAAK,GAAG,MAAM,WAAW;;AAEhC,UAAO,aAAa,MAAM,SAAS;SAC9B;AAEL,OAAI,OAAO,SAAS,UAAU;AAC5B,WAAO,QAAQ,IAAI,GAAG,UAAU,QAAQ,MAAM,IAAI;AAClD,SAAK,KAAK,OAAO,MAAM;;AAEzB,UAAO,aAAa,IAAI,GAAG,MAAM;;AAEnC,OAAK,KAAK,QAAQ,EAAE;EAEpB,MAAM,SAAS,MAAM,KAAK,OAAO,QAAQ;GAAE;GAAK;GAAM,CAAC;EACvD,MAAM,UAAU,OAAO,KAAK,SAAS;EACrC,MAAM,OAAO,UAAU,OAAO,KAAK,MAAM,GAAG,MAAM,GAAG,OAAO;EAC5D,MAAM,OAAO,KAAK,KAAK,SAAS;EAChC,MAAM,SACJ,CAAC,WAAW,CAAC,OACT,SACA,aACE,kBAAkB,YAAY,MAAM,IAAI,EAAE,KAAK,KAAe,GAC9D,OAAO,KAAK,KAAK;AACzB,SAAO;GACL,SAAS,KAAK,KAAK,MAAM;IACvB,MAAM,IAAkC;KACtC,MAAM,EAAE;KACR,KAAK,EAAE;KACP,MAAM,IAAI,EAAE,KAAK;KACjB,OAAO,IAAI,EAAE,MAAM;KACnB,OAAO,IAAI,EAAE,MAAM;KACnB,UAAW,EAAE,aAA+B;KAC7C;AACD,QAAI,SAAS,kBAAkB,EAAE,WAAW,KAAM,GAAE,UAAU,EAAE;AAChE,WAAO;KACP;GACF;GACA;GACD;;CAGH,MAAM,YAAY,QAAkC;EAClD,MAAM,CAAC,IAAI,MAAM,YAAY,OAAO;AAKpC,UAJe,MAAM,KAAK,OAAO,QAAQ;GACvC,KAAK;GACL,MAAM;IAAC,KAAK;IAAO;IAAI;IAAG;GAC3B,CAAC,EACY,KAAK,SAAS;;CAG9B,MAAM,MAAM,QAAiC;EAC3C,MAAM,CAAC,IAAI,MAAM,YAAY,OAAO;AAKpC,SAAO,KAJQ,MAAM,KAAK,OAAO,QAAQ;GACvC,KAAK;GACL,MAAM;IAAC,KAAK;IAAO;IAAI;IAAG;GAC3B,CAAC,EACgB,KAAK,IAAI,IAAI;;CAGjC,MAAM,eAAe,QAAgB,MAAgC;AACnE,mBAAiB,KAAK,SAAS;EAC/B,MAAM,CAAC,IAAI,MAAM,YAAY,OAAO;EAEpC,MAAM,QAAiD,EAAE;AACzD,MAAI,CAAC,KAAK,cACR,OAAM,KAAK;GACT,KAAK;;;GAIL,MAAM;IAAC,KAAK;IAAO,KAAK,SAAS,KAAK,KAAK;IAAE,KAAK;IAAU,KAAK;IAAO;IAAI;IAAG;GAChF,CAAC;AAIJ,MAAI,CAAC,KAAK,eAAe;GACvB,MAAM,WAAW,gBAAgB,OAAO;AACxC,OAAI,aAAa,KACf,OAAM,KAAK;IAAE,KAAK;IAA2B,MAAM,CAAC,KAAK,OAAO,SAAS;IAAE,CAAC;;AAGhF,QAAM,KAAK;GACT,KAAK;GACL,MAAM;IAAC,KAAK;IAAO;IAAI;IAAG;GAC3B,CAAC;EAEF,MAAM,UAAU,MAAM,KAAK,OAAO,MAAM,OAAO,QAAQ;AAEvD,SAAO,IAAI,QAAQ,QAAQ,SAAS,IAAI,aAAa;;CAGvD,MAAM,aACJ,QACA,SACqC;EACrC,MAAM,QAAQ,SAAS,SAAS;EAChC,MAAM,QAAQ,SAAS,UAAU,SAAS,SAAS;AACnD,MAAI,UAAU,EAAG,QAAO;GAAE,SAAS,EAAE;GAAE,SAAS;GAAO;EAEvD,MAAM,aAAa,SAAS,YAAY;EACxC,MAAM,SAAS,gBAAgB,SAAS,QAAQ,WAAW;EAC3D,MAAM,iBAAiB,SAAS,mBAAmB;EAInD,MAAM,IAAI;EACV,MAAM,OAAO,kBAAkB,OAAU;EACzC,MAAM,OAAkB;GAAC,GAAG,KAAK;GAAM,KAAK;GAAO;GAAO;EAE1D,IAAI,MAAM,UAAU,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE,aAAa,EAAE,MADrE,iBAAiB,KAAK,EAAE,WAAW,GACmD,GAAG,KAAK,IAAI,SAAS,EAAE,gBAAgB,EAAE;AAElJ,MAAI,YAAY;GACd,MAAM,MAAM,eAAe,QAAS;AACpC,OAAI,CAAC,IAAK,OAAM,IAAI,MAAM,oBAAoB,SAAS,UAAU;GAEjE,MAAM,QAAQ,uBAAuB;IACnC,KAAK,GAAG,IAAI;IACZ,UAAU,uBAAuB,IAAI,IAAI;IACzC;IACA,QAAQ,GAAG,EAAE;IACb,QAAQ,OAAO,SAAS,OAAO,OAAO,SAAS;IAChD,CAAC;AACF,OAAI,MAAM,gBAAgB;AACxB,WAAO,QAAQ,MAAM;AACrB,SAAK,KAAK,GAAG,MAAM,WAAW;;AAEhC,UAAO,aAAa,MAAM,SAAS;AACnC,QAAK,KAAK,QAAQ,EAAE;GAEpB,MAAMA,WAAS,MAAM,KAAK,OAAO,QAAQ;IAAE;IAAK;IAAM,CAAC;GACvD,MAAMC,YAAUD,SAAO,KAAK,SAAS;GACrC,MAAME,SAAOD,YAAUD,SAAO,KAAK,MAAM,GAAG,MAAM,GAAGA,SAAO;GAC5D,MAAM,OAAOE,OAAKA,OAAK,SAAS;AAChC,UAAO;IACL,SAASA,OAAK,KAAK,MAAM,YAAY,EAAE,CAAC;IACxC;IACA,QACED,aAAW,OACP,kBAAkB,YAAY,MAAM,IAAI,EAAE,KAAK,KAAe,GAC9D;IACP;;AAIH,MAAI,OAAO,SAAS,UAAU;AAC5B,UAAO,QAAQ,EAAE,OAAO,UAAU,QAAQ,MAAM,IAAI;AACpD,QAAK,KAAK,OAAO,MAAM;;AAEzB,SAAO,aAAa,EAAE,OAAO,MAAM;AACnC,OAAK,KAAK,QAAQ,EAAE;EAEpB,MAAM,SAAS,MAAM,KAAK,OAAO,QAAQ;GAAE;GAAK;GAAM,CAAC;EACvD,MAAM,UAAU,OAAO,KAAK,SAAS;EACrC,MAAM,OAAO,UAAU,OAAO,KAAK,MAAM,GAAG,MAAM,GAAG,OAAO;AAC5D,SAAO;GACL,SAAS,KAAK,KAAK,MAAM,YAAY,EAAE,CAAC;GACxC;GACA,QAAQ,WAAW,KAAK,SAAS,IAAI,OAAO,KAAK,KAAK,SAAS,GAAI,KAAK,GAAG;GAC5E;;CAGH,MAAM,cAAc,QAAiC;AAKnD,SAAO,KAJQ,MAAM,KAAK,OAAO,QAAQ;GACvC,KAAK;GACL,MAAM,CAAC,KAAK,OAAO,OAAO;GAC3B,CAAC,EACgB,KAAK,IAAI,IAAI;;;CAIjC,MAAM,MAAM,QAAgB,MAA+C;EACzE,MAAM,aAAa,yBAAyB;GAAE,OAAO,KAAK;GAAO;GAAQ;GAAM,CAAC;AAIhF,MAAI,WAAW,WAAW;GACxB,MAAM,CAAC,QAAQE,cAAY,MAAM,QAAQ,IAAI,CAC3C,KAAK,OAAO,QAAQ;IAClB,KAAK,WAAW,UAAU,OAAO;IACjC,MAAM,WAAW,UAAU,OAAO;IACnC,CAAC,EACF,KAAK,OAAO,QAAQ;IAClB,KAAK,WAAW,UAAU,YAAY;IACtC,MAAM,WAAW,UAAU,YAAY;IACxC,CAAC,CACH,CAAC;GAIF,MAAM,kBAAkB,iBACtB,OAAO,MACP,WAAW,UAAU,WACrB,WAAW,UAAU,aACtB;AAID,UAAO;IAAE,MAAM,EAAE;IAAE,OADL,WAAW,UAAU,UAAU,WAAW,IAAI,IAAI,IAAIA,WAAS,KAAK,IAAI,IAAI;IAChE;IAAiB;;EAG7C,MAAM,CAAC,SAAS,UAAU,WAAW,WAAW,MAAM,QAAQ,IAAI;GAChE,KAAK,OAAO,QAAQ;IAAE,KAAK,WAAW,KAAK;IAAK,MAAM,WAAW,KAAK;IAAM,CAAC;GAG7E,WAAW,QACP,KAAK,OAAO,QAAQ;IAAE,KAAK,WAAW,MAAM;IAAK,MAAM,WAAW,MAAM;IAAM,CAAC,GAC/E,QAAQ,QAAQ,OAAU;GAC9B,WAAW,SACP,KAAK,OAAO,QAAQ;IAAE,KAAK,WAAW,OAAO;IAAK,MAAM,WAAW,OAAO;IAAM,CAAC,GACjF,QAAQ,QAAQ,OAAU;GAC9B,WAAW,OACP,KAAK,OAAO,QAAQ;IAAE,KAAK,WAAW,KAAK;IAAK,MAAM,WAAW,KAAK;IAAM,CAAC,GAC7E,QAAQ,QAAQ,OAAU;GAC/B,CAAC;EAEF,MAAM,aAAa,WAAW,OAC1B,WAAW,QAAQ,KAAK,SAAS,IAC/B,IAAI,QAAQ,KAAK,IAAI,GAAG,GACxB,KACF;AAEJ,SAAO,4BAA4B;GACjC,SAAS,QAAQ;GACjB,OAAO,WAAW,IAAI,SAAS,KAAK,IAAI,IAAI,GAAG;GAC/C,WAAW,WAAW,KAAK,KAAK,OAAO;IAAE,GAAG,EAAE;IAAG,GAAG,EAAE;IAAG,KAAK,EAAE;IAAK,EAAE;GACvE;GACA,YAAY,WAAW,MAAM;GAC7B;GACD,CAAC;;;;CAKJ,MAAM,kBAAkB,SAAiD;EACvE,MAAM,sBAAM,IAAI,KAAqB;AACrC,OAAK,IAAI,SAAS,GAAG,SAAS,QAAQ,QAAQ,UAAU,IAAI;GAC1D,MAAM,QAAQ,QAAQ,MAAM,QAAQ,SAAS,GAAG;GAChD,MAAM,SAAS,MAAM,KAAK,OAAO,QAAQ;IACvC,KAAK,iFAAiF,MAAM,UAAU,IAAI,CAAC,KAAK,IAAI,CAAC;IACrH,MAAM,CAAC,KAAK,OAAO,GAAG,MAAM;IAC7B,CAAC;AACF,QAAK,MAAM,KAAK,OAAO,KAAM,KAAI,IAAI,EAAE,QAAkB,IAAI,EAAE,IAAI,CAAC;;AAEtE,SAAO;;CAGT,MAAM,UAAU,QAAmE;EACjF,MAAM,CAAC,IAAI,MAAM,YAAY,OAAO;EAMpC,MAAM,OALS,MAAM,KAAK,OAAO,QAAQ;GACvC,KAAK;;GAEL,MAAM;IAAC,KAAK;IAAO;IAAI;IAAG;GAC3B,CAAC,EACiB,KAAK;AACxB,SAAO;GAAE,WAAW,IAAI,KAAK,WAAW;GAAE,WAAW,IAAI,KAAK,WAAW;GAAE;;;CAI7E,MAAM,QAAQ,OAAyD;EACrE,MAAM,sBAAM,IAAI,KAA+B;AAC/C,OAAK,MAAM,QAAQ,MAAO,KAAI,IAAI,MAAM,MAAM,KAAK,IAAI,KAAK,CAAC;AAC7D,SAAO;;;;CAKT,MAAM,gBACJ,SACA,KACgC;AAChC,SAAO,oBAAoB,MAAM,SAAS,IAAI;;;CAIhD,MAAM,mBACJ,SACA,KACmC;AACnC,SAAO,uBAAuB,MAAM,SAAS,IAAI;;CAGnD,MAAM,SAAS,SAAoD,MAA8B;AAC/F,MAAI,QAAQ,WAAW,EAAG;AAC1B,mBAAiB,KAAK,SAAS;EAE/B,MAAM,MAAM,KAAK,KAAK;EACtB,MAAM,QAAiD,EAAE;EAIzD,MAAM,4BAAY,IAAI,KAA+C;EACrE,MAAM,0BAAU,IAAI,KAAa;AACjC,OAAK,MAAM,EAAE,MAAM,WAAW,SAAS;GACrC,MAAM,QAAQ,sBAAsB,MAAM,SAAS;AACnD,OAAI,MAAO,WAAU,IAAI,SAAS,KAAK,EAAE,MAAM;AAC/C,QAAK,MAAM,WAAW,aAAa,KAAK,EAAE;AACxC,QAAI,QAAQ,IAAI,QAAQ,CAAE;AAC1B,YAAQ,IAAI,QAAQ;;;AAGxB,OAAK,MAAM,WAAW,QACpB,OAAM,KAAK,kBAAkB,KAAK,OAAO,SAAS,UAAU,IAAI,QAAQ,IAAI,MAAM,IAAI,CAAC;AAGzF,OAAK,MAAM,EAAE,MAAM,WAAW,SAAS;AACrC,OAAI,CAAC,KAAK,cACR,OAAM,KAAK;IACT,KAAK;IACL,MAAM;KACJ,KAAK;KACL;KACA,MAAM;KACN,KAAK;KACL;KACA,MAAM;KACN,MAAM;KACN,KAAK;KACN;IACF,CAAC;AAEJ,SAAM,KAAK,MAAM,KAAK,gBAAgB,MAAM,MAAM,CAAC;;AAIrD,MAAI,CAAC,KAAK,eAAe;GACvB,MAAM,6BAAa,IAAI,KAAa;AACpC,QAAK,MAAM,EAAE,UAAU,SAAS;IAC9B,MAAM,WAAW,qBAAqB,KAAK;AAC3C,QAAI,aAAa,KAAM,YAAW,IAAI,SAAS;;AAEjD,QAAK,MAAM,YAAY,WACrB,OAAM,KAAK;IAAE,KAAK;IAA2B,MAAM,CAAC,KAAK,OAAO,SAAS;IAAE,CAAC;;AAIhF,QAAM,KAAK,OAAO,MAAM,OAAO,QAAQ;;CAGzC,MAAM,kBACJ,QACA,OACA,SACqC;EACrC,MAAM,QAAQ,SAAS,SAAS;EAChC,MAAM,QAAQ,SAAS,SAAS;AAChC,MAAI,UAAU,EAAG,QAAO;GAAE,SAAS,EAAE;GAAE,SAAS;GAAO;EAEvD,MAAM,CAAC,IAAI,MAAM,YAAY,OAAO;EACpC,MAAM,OAAkB;GAAC,KAAK;GAAO;GAAI;GAAI;GAAM;EACnD,IAAI,MAAM;;AAEV,MAAI,SAAS,QAAQ;AACnB,UAAO,aAAa,UAAU,QAAQ,MAAM,IAAI;AAChD,QAAK,KAAK,QAAQ,OAAO;;AAE3B,SAAO,kBAAkB,MAAM;AAC/B,OAAK,KAAK,QAAQ,EAAE;EAEpB,MAAM,SAAS,MAAM,KAAK,OAAO,QAAQ;GAAE;GAAK;GAAM,CAAC;EACvD,MAAM,UAAU,OAAO,KAAK,SAAS;EACrC,MAAM,OAAO,UAAU,OAAO,KAAK,MAAM,GAAG,MAAM,GAAG,OAAO;AAC5D,SAAO;GACL,SAAS,KAAK,KAAK,OAAO;IACxB,MAAM,EAAE;IACR,KAAK,EAAE;IACP,MAAM,IAAI,EAAE,KAAK;IACjB,OAAO,IAAI,EAAE,MAAM;IACnB,OAAO,IAAI,EAAE,MAAM;IACnB,UAAW,EAAE,aAA+B;IAC7C,EAAE;GACH;GACA,QAAQ,WAAW,KAAK,SAAS,IAAI,OAAO,KAAK,KAAK,SAAS,GAAI,KAAK,GAAG;GAC5E;;CAGH,MAAM,YAA6B;EACjC,MAAM,CAAC,QAAQ,kBAAkB,MAAM,QAAQ,IAAI,CACjD,KAAK,OAAO,QAAQ;GAClB,KAAK;GACL,MAAM,CAAC,KAAK,MAAM;GACnB,CAAC,EACF,KAAK,sBAAsB,CAC5B,CAAC;AACF,SAAO,KAAK,IAAI,IAAI,OAAO,KAAK,IAAI,OAAO,EAAE,eAAe;;;;;;CAO9D,MAAM,aAAa,KAAa,aAAa,IAAsB;AACjE,MAAI,CAAC,IAAK,QAAO;AAIjB,MAAI,eAAe,GAWjB,SAVe,MAAM,KAAK,OAAO,QAAQ;GACvC,KAAK;;;;;;;GAOL,MAAM;IAAC,KAAK;IAAO;IAAK,KAAK;IAAO;IAAK,KAAK;IAAO;IAAI;GAC1D,CAAC,EACY,KAAK,SAAS;EAE9B,MAAM,CAAC,IAAI,MAAM,YAAY,WAAW;AAWxC,UAVe,MAAM,KAAK,OAAO,QAAQ;GACvC,KAAK;;;;;;;GAOL,MAAM;IAAC,KAAK;IAAO;IAAK;IAAI;IAAI,KAAK;IAAO;IAAK;IAAI;IAAI,KAAK;IAAO;IAAK;IAAI;IAAG;GAClF,CAAC,EACY,KAAK,SAAS;;;;;;;CAQ9B,MAAM,iBAAiB,MAAgB,aAAa,IAA0B;EAC5E,MAAM,6BAAa,IAAI,KAAa;EACpC,MAAM,SAAS,CAAC,GAAG,IAAI,IAAI,KAAK,QAAQ,MAAM,EAAE,CAAC,CAAC;AAClD,MAAI,OAAO,WAAW,EAAG,QAAO;EAChC,MAAM,YAAY,eAAe;EACjC,MAAM,CAAC,IAAI,MAAM,YAAY,YAAY,WAAW,GAAG,CAAC,IAAI,GAAG;AAC/D,OAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,wBAAwB;GAC9D,MAAM,QAAQ,OAAO,MAAM,GAAG,IAAI,uBAAuB;GACzD,MAAM,KAAK,MAAM,UAAU,IAAI,CAAC,KAAK,IAAI;GACzC,MAAM,OAAO,YAAY,+BAA+B;GACxD,MAAM,MAAM,yEAAyE,GAAG,IAAI,KAAK;;2FAEZ,GAAG,IAAI,KAAK;;2FAEZ,GAAG,IAAI;GAC5F,MAAM,OAAkB,EAAE;AAC1B,QAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,SAAK,KAAK,KAAK,OAAO,GAAG,MAAM;AAC/B,QAAI,UAAW,MAAK,KAAK,IAAI,GAAG;;GAElC,MAAM,SAAS,MAAM,KAAK,OAAO,QAAQ;IAAE;IAAK;IAAM,CAAC;AACvD,QAAK,MAAM,OAAO,OAAO,MAAM;IAC7B,MAAM,IAAI,IAAI;AACd,QAAI,EAAG,YAAW,IAAI,EAAE;;;AAG5B,SAAO;;CAGT,MAAM,kBACJ,UACA,OAC0E;EAC1E,MAAM,YAAY,QAAQ,IAAI,QAAQ;AACtC,MAAI,cAAc,EAAG,QAAO;GAAE,SAAS,EAAE;GAAE,SAAS;GAAO,QAAQ;GAAU;EAE7E,MAAM,SAAS,MAAM,KAAK,OAAO,QAAQ;GACvC,KAAK;;GAEL,MAAM;IAAC,KAAK;IAAO;IAAU,YAAY;IAAE;GAC5C,CAAC;EACF,MAAM,UAAU,OAAO,KAAK,SAAS;EAErC,MAAM,WADO,UAAU,OAAO,KAAK,MAAM,GAAG,UAAU,GAAG,OAAO,MACzB,KAAK,OAAO;GACjD,KAAK,IAAI,EAAE,IAAI;GACf,OAAO,EAAE;GACT,MAAM,EAAE;GACR,IAAI,EAAE;GACN,KAAM,EAAE,OAAyB;GACjC,SAAU,EAAE,WAA6B;GACzC,MAAM,EAAE,QAAQ,OAAO,OAAO,IAAI,EAAE,KAAK;GACzC,OAAO,IAAI,EAAE,MAAM;GACnB,WAAW,EAAE;GACd,EAAE;AAEH,SAAO;GAAE;GAAS;GAAS,QADZ,QAAQ,SAAS,IAAI,QAAQ,QAAQ,SAAS,GAAI,MAAM;GACpC;;CAGrC,MAAM,uBAAwC;AAE5C,SAAO;;CAWT,MAAM,eAAe,SAAwD;EAC3E,MAAM,MAAM,QAAQ,OAAO,KAAK,KAAK;EACrC,MAAM,QAAQ,QAAQ,QAAQ,IAAI,QAAQ,QAAQ;AAClD,MAAI,UAAU,EAAG,QAAO,EAAE;EAC1B,MAAM,CAAC,IAAI,MAAM,YAAY,QAAQ,OAAO;EAC5C,MAAM,EAAE,SAAS,MAAM,KAAK,OAAO,QAAQ;GACzC,KAAK;GACL,MAAM;IAAC,KAAK;IAAO;IAAI;IAAI;IAAK;IAAM;GACvC,CAAC;AACF,SAAO,KAAK,KAAK,OAAO;GACtB,MAAM,OAAO,EAAE,KAAK;GACpB,WAAW,OAAO,EAAE,WAAW;GAC/B,IAAI,OAAO,EAAE,GAAG;GAChB,KAAK,EAAE,OAAO,OAAO,OAAO,OAAO,EAAE,IAAI;GACzC,OAAO,OAAO,EAAE,MAAM;GACtB,UAAU,OAAO,EAAE,SAAS;GAC7B,EAAE;;CAGL,MAAM,aAAa,MAAc,WAAqC;AAKpE,WAJY,MAAM,KAAK,OAAO,QAAQ;GACpC,KAAK;GACL,MAAM;IAAC,KAAK;IAAO;IAAM;IAAU;GACpC,CAAC,EACU,gBAAgB,KAAK;;CAGnC,MAAM,mBACJ,MACA,WACA,OACA,eACkB;AAKlB,WAJY,MAAM,KAAK,OAAO,QAAQ;GACpC,KAAK;GACL,MAAM;IAAC;IAAO;IAAe,KAAK;IAAO;IAAM;IAAU;GAC1D,CAAC,EACU,gBAAgB,KAAK;;;;;;;;;AAUrC,MAAM,qCAAqC"}