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

package/dist/memory-tree-index.d.cts

@@ -0,0 +1,159 @@
+import { TreeQueryResult, TreeQuerySpec } from "./tree-query.cjs";
+import { DirtyPathRow, ListDirtyPathOptions } from "./dirty-path-queue.cjs";
+import { BatchDeleteEntry, BatchDeleteEntryResult, BatchIndexContext, BatchPutEntry, BatchPutEntryResult, ChangelogEntry, PutOpts, TreeEntry, TreeIndex, TreeIndexListEntriesResult, TreeIndexListOptions, TreeIndexListResult } from "./tree-index.cjs";
+import { InlineContentOptions } from "./inline-content.cjs";
+
+//#region src/memory-tree-index.d.ts
+declare class MemoryTreeIndex implements TreeIndex {
+  private entries;
+  /**
+   * DIR rows with their timestamps. Was a `Set<string>` (existence only);
+   * upgraded to a `Map` carrying `{ ctime, mtime }` so Rule R2 (feed-sort
+   * §5.3) can stamp a direct parent's ctime and `collectChildren` can surface
+   * it (the SQL backends sort doc-mode dir rows by `e.ctime`) — keeping the
+   * memory backend in lockstep with D1/SQLite.
+   */
+  private dirEntries;
+  /** Phase 2: in-memory mirror of the `changelog` table. */
+  private changelog;
+  /**
+   * index-follower-dirty-path — in-memory mirror of the `ds_dirty_path` table.
+   * Keyed `${scope}\x00${path}`, updated through {@link applyDirtyUpsert} on
+   * every changelog append so its merge/guard semantics match the SQL trigger
+   * byte-for-byte. There is no DB trigger here, so {@link pushChangelog} is the
+   * single hook every write path funnels through.
+   */
+  private dirtyMap;
+  /** Monotonic seq counter mirroring `AUTOINCREMENT` in the SQL impl. */
+  private nextSeq;
+  /** Live Update Resilience §11.4 — in-memory mirror of `prefix_watermark`. */
+  private watermarks;
+  /**
+   * Dedup-on-write secondary index (#1159) — in-memory mirror of the
+   * `(scope, dedup_scope, dedup_key)` partial UNIQUE index. Keyed
+   * `${dedupScope}\x00${dedupKey}` → path. Maintained on put/delete; enforces
+   * uniqueness (the SQL backends get it from the DB index).
+   */
+  private dedupIndex;
+  /** Logical scope string baked into every changelog row (default ""). */
+  private readonly scope;
+  private readonly inline;
+  constructor(opts?: {
+    scope?: string;
+  } & InlineContentOptions);
+  /**
+   * Return a read-only snapshot of the in-memory changelog.
+   *
+   * Used by unit tests to assert that the correct row shape was appended on
+   * each put/delete. Production code never calls this.
+   */
+  getChangelogSnapshot(): readonly ChangelogEntry[];
+  /**
+   * The single append hook for the in-memory changelog. Mirrors the SQL
+   * `AFTER INSERT ON ds_changelog` trigger: it appends the row AND folds it into
+   * the dirty map via {@link applyDirtyUpsert} (same latest_seq guard + backoff
+   * reset). Every write path (`put` / `delete` / `deleteByPrefix`; `putBatch`
+   * and the batch* methods loop those) funnels through here, so the dirty map
+   * covers all six TreeIndex write methods for free — the Memory-backend twin of
+   * the trigger's "covers every write face by construction".
+   */
+  private pushChangelog;
+  get(path: string, _opts?: {
+    includeContent?: boolean;
+  }): Promise<TreeEntry | null>;
+  getDirTimes(dirPath: string): Promise<{
+    ctime: number;
+    mtime: number;
+  } | null>;
+  put(path: string, entry: TreeEntry, opts: PutOpts): Promise<{
+    oldCid?: string;
+  }>;
+  /** Inline content this entry would store — drives loopBatchPutEntries' content-aware skip. */
+  inlineForEntry(entry: TreeEntry): Promise<string | null>;
+  private dedupMapKey;
+  /** Mirror the `(scope, dedup_scope, dedup_key)` UNIQUE constraint. */
+  private assertDedupUnique;
+  private dropDedupMapping;
+  /** Re-point the dedup map for `path`: drop its stale mapping, set the new one. */
+  private updateDedupMapping;
+  findByDedupKey(dedupScope: string, dedupKey: string): Promise<({
+    path: string;
+  } & TreeEntry) | null>;
+  setDedupKey(path: string, dedupScope: string, dedupKey: string, opts: PutOpts): Promise<void>;
+  /** Bump a collection root's watermark by 1 (lazy-create at 1). No-op for null. */
+  private bumpWatermark;
+  getPrefixWatermark(prefix: string): Promise<number | null>;
+  delete(path: string, opts: PutOpts): Promise<void>;
+  private cleanEmptyParents;
+  private static readonly VALID_ORDER_BY;
+  /**
+   * Ordered + keyset-paged listing shared by listEntries/listChildren when
+   * an explicit orderBy is set — same semantics as the SQL impls (NULL
+   * mimeType last in both directions, unique-tie keyset resume, v2 cursor).
+   */
+  private orderedPage;
+  list(prefix: string, options?: TreeIndexListOptions): Promise<TreeIndexListResult>;
+  listEntries(prefix: string, options?: TreeIndexListOptions): Promise<TreeIndexListEntriesResult>;
+  hasChildren(prefix: string): Promise<boolean>;
+  count(prefix: string): Promise<number>;
+  deleteByPrefix(prefix: string, opts: PutOpts): Promise<number>;
+  /**
+   * THE single source of direct-children candidates — files with their own
+   * entry fields/content plus dir rows with the optional `<dir><docFile>`
+   * sub-file join. Shared by `listChildren` (join-free form post-T4.3) and
+   * `query` (doc surface) so the child-candidate semantics cannot drift —
+   * the in-memory mirror of `buildChildrenFrom` in tree-query.ts.
+   */
+  private collectChildren;
+  listChildren(parent: string, options?: TreeIndexListOptions): Promise<TreeIndexListEntriesResult>;
+  countChildren(parent: string): Promise<number>;
+  /**
+   * Collection query (afs-collection-query Phase 1) — JS executor over the
+   * same candidate set the SQL impls compile (lockstep-tested).
+   */
+  query(parent: string, spec: TreeQuerySpec): Promise<TreeQueryResult>;
+  countChildrenMany(parents: string[]): Promise<Map<string, number>>;
+  aggregate(prefix: string): Promise<{
+    fileCount: number;
+    totalSize: number;
+  }>;
+  /** Batch metadata read — loop over get (no IN-merge needed off-CF). */
+  getMany(paths: string[]): Promise<Map<string, TreeEntry | null>>;
+  /** Batch sync fast path — loop reference semantics (conformance-pinned
+   *  equivalent of the merged D1 implementation). */
+  batchPutEntries(entries: BatchPutEntry[], ctx?: BatchIndexContext): Promise<BatchPutEntryResult[]>;
+  /** Delete twin of {@link batchPutEntries} (loop reference semantics). */
+  batchDeleteEntries(entries: BatchDeleteEntry[], ctx?: BatchIndexContext): Promise<BatchDeleteEntryResult[]>;
+  putBatch(entries: Array<{
+    path: string;
+    entry: TreeEntry;
+  }>, opts: PutOpts): Promise<void>;
+  listModifiedSince(prefix: string, since: number, options?: TreeIndexListOptions): Promise<TreeIndexListEntriesResult>;
+  getMaxSeq(): Promise<number>;
+  /**
+   * Read-auth reference check (design §4.1) — three-way, scoped, optionally
+   * prefix-local. See {@link TreeIndex.isReferenced}. This impl is single-scope
+   * (every row shares `this.scope`), so the scope filter is implicit; only the
+   * path-prefix restriction is applied.
+   */
+  isReferenced(cid: string, pathPrefix?: string): Promise<boolean>;
+  /**
+   * Batch read-auth (design §7.2 / §14) — in-memory three-way equivalent to
+   * per-cid {@link isReferenced}. No bound-param cap (no sharding), but the
+   * result MUST agree cid-for-cid with the SQL backends.
+   */
+  isReferencedMany(cids: string[], pathPrefix?: string): Promise<Set<string>>;
+  getChangelogSince(sinceSeq: number, limit: number): Promise<{
+    entries: ChangelogEntry[];
+    hasMore: boolean;
+    cursor: number;
+  }>;
+  getCompactedBelowSeq(): Promise<number>;
+  listDirtyPaths(options: ListDirtyPathOptions): Promise<DirtyPathRow[]>;
+  ackDirtyPath(path: string, latestSeq: number): Promise<boolean>;
+  markDirtyPathError(path: string, latestSeq: number, error: string, nextAttemptAt: number): Promise<boolean>;
+  private ensureParentDirs;
+}
+//#endregion
+export { MemoryTreeIndex };
+//# sourceMappingURL=memory-tree-index.d.cts.map

package/dist/memory-tree-index.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-tree-index.d.cts","names":[],"sources":["../src/memory-tree-index.ts"],"mappings":";;;;;;cAoGa,eAAA,YAA2B,SAAA;EAAA,QAC9B,OAAA;EAsFwC;;;;;;;EAAA,QA9ExC,UAAA;EAmPkC;EAAA,QAjPlC,SAAA;EAuPmC;;;;;;;EAAA,QA/OnC,QAAA;EA2iBqB;EAAA,QAziBrB,OAAA;EAijB6C;EAAA,QA/iB7C,UAAA;EAqqBG;;;;;;EAAA,QA9pBH,UAAA;EAmvBoC;EAAA,iBAjvB3B,KAAA;EAAA,iBACA,MAAA;cAEL,IAAA;IAAS,KAAA;EAAA,IAAmB,oBAAA;EAmxBhC;;;;;;EAxwBR,oBAAA,CAAA,YAAiC,cAAA;EAqxBoB;;;;;;;;;EAAA,QAxwB7C,aAAA;EAiBF,GAAA,CAAI,IAAA,UAAc,KAAA;IAAU,cAAA;EAAA,IAA6B,OAAA,CAAQ,SAAA;EAMjE,WAAA,CAAY,OAAA,WAAkB,OAAA;IAAU,KAAA;IAAe,KAAA;EAAA;EAKvD,GAAA,CAAI,IAAA,UAAc,KAAA,EAAO,SAAA,EAAW,IAAA,EAAM,OAAA,GAAU,OAAA;IAAU,MAAA;EAAA;EAvFrB;EAsL/C,cAAA,CAAe,KAAA,EAAO,SAAA,GAAY,OAAA;EAAA,QAM1B,WAAA;EA3LA;EAAA,QAgMA,iBAAA;EAAA,QAQA,gBAAA;EAtLA;EAAA,QA4LA,kBAAA;EAcF,cAAA,CACJ,UAAA,UACA,QAAA,WACC,OAAA;IAAW,IAAA;EAAA,IAAiB,SAAA;EAOzB,WAAA,CACJ,IAAA,UACA,UAAA,UACA,QAAA,UACA,IAAA,EAAM,OAAA,GACL,OAAA;;UAWK,aAAA;EAKF,kBAAA,CAAmB,MAAA,WAAiB,OAAA;EAMpC,MAAA,CAAO,IAAA,UAAc,IAAA,EAAM,OAAA,GAAU,OAAA;EAAA,QA8BnC,iBAAA;EAAA,wBA0BgB,cAAA;EA/PhB;;;;;EAAA,QA6QA,WAAA;EA8CF,IAAA,CAAK,MAAA,UAAgB,OAAA,GAAU,oBAAA,GAAuB,OAAA,CAAQ,mBAAA;EAoF9D,WAAA,CACJ,MAAA,UACA,OAAA,GAAU,oBAAA,GACT,OAAA,CAAQ,0BAAA;EA0GL,WAAA,CAAY,MAAA,WAAiB,OAAA;EAO7B,KAAA,CAAM,MAAA,WAAiB,OAAA;EAQvB,cAAA,CAAe,MAAA,UAAgB,IAAA,EAAM,OAAA,GAAU,OAAA;EApfQ;;;;;;;EAAA,QAqjBrD,eAAA;EAkDF,YAAA,CACJ,MAAA,UACA,OAAA,GAAU,oBAAA,GACT,OAAA,CAAQ,0BAAA;EAsDL,aAAA,CAAc,MAAA,WAAiB,OAAA;EA5jBf;;;;EA2kBhB,KAAA,CAAM,MAAA,UAAgB,IAAA,EAAM,aAAA,GAAgB,OAAA,CAAQ,eAAA;EAgBpD,iBAAA,CAAkB,OAAA,aAAoB,OAAA,CAAQ,GAAA;EAc9C,SAAA,CAAU,MAAA,WAAiB,OAAA;IAAU,SAAA;IAAmB,SAAA;EAAA;EA/jB3D;EA4kBG,OAAA,CAAQ,KAAA,aAAkB,OAAA,CAAQ,GAAA,SAAY,SAAA;EA5kBrB;;EAolBzB,eAAA,CACJ,OAAA,EAAS,aAAA,IACT,GAAA,GAAM,iBAAA,GACL,OAAA,CAAQ,mBAAA;EA9kBT;EAmlBI,kBAAA,CACJ,OAAA,EAAS,gBAAA,IACT,GAAA,GAAM,iBAAA,GACL,OAAA,CAAQ,sBAAA;EAIL,QAAA,CAAS,OAAA,EAAS,KAAA;IAAQ,IAAA;IAAc,KAAA,EAAO,SAAA;EAAA,IAAc,IAAA,EAAM,OAAA,GAAU,OAAA;EAM7E,iBAAA,CACJ,MAAA,UACA,KAAA,UACA,OAAA,GAAU,oBAAA,GACT,OAAA,CAAQ,0BAAA;EAyCL,SAAA,CAAA,GAAa,OAAA;EA1nBuB;;;;;;EAsoBpC,YAAA,CAAa,GAAA,UAAa,UAAA,YAAkB,OAAA;EAxkB1B;;;;;EAylBlB,gBAAA,CAAiB,IAAA,YAAgB,UAAA,YAAkB,OAAA,CAAQ,GAAA;EAiB3D,iBAAA,CACJ,QAAA,UACA,KAAA,WACC,OAAA;IAAU,OAAA,EAAS,cAAA;IAAkB,OAAA;IAAkB,MAAA;EAAA;EAUpD,oBAAA,CAAA,GAAwB,OAAA;EAWxB,cAAA,CAAe,OAAA,EAAS,oBAAA,GAAuB,OAAA,CAAQ,YAAA;EAqBvD,YAAA,CAAa,IAAA,UAAc,SAAA,WAAoB,OAAA;EAU/C,kBAAA,CACJ,IAAA,UACA,SAAA,UACA,KAAA,UACA,aAAA,WACC,OAAA;EAAA,QAiBK,gBAAA;AAAA"}

package/dist/memory-tree-index.d.mts

@@ -0,0 +1,159 @@
+import { TreeQueryResult, TreeQuerySpec } from "./tree-query.mjs";
+import { DirtyPathRow, ListDirtyPathOptions } from "./dirty-path-queue.mjs";
+import { BatchDeleteEntry, BatchDeleteEntryResult, BatchIndexContext, BatchPutEntry, BatchPutEntryResult, ChangelogEntry, PutOpts, TreeEntry, TreeIndex, TreeIndexListEntriesResult, TreeIndexListOptions, TreeIndexListResult } from "./tree-index.mjs";
+import { InlineContentOptions } from "./inline-content.mjs";
+
+//#region src/memory-tree-index.d.ts
+declare class MemoryTreeIndex implements TreeIndex {
+  private entries;
+  /**
+   * DIR rows with their timestamps. Was a `Set<string>` (existence only);
+   * upgraded to a `Map` carrying `{ ctime, mtime }` so Rule R2 (feed-sort
+   * §5.3) can stamp a direct parent's ctime and `collectChildren` can surface
+   * it (the SQL backends sort doc-mode dir rows by `e.ctime`) — keeping the
+   * memory backend in lockstep with D1/SQLite.
+   */
+  private dirEntries;
+  /** Phase 2: in-memory mirror of the `changelog` table. */
+  private changelog;
+  /**
+   * index-follower-dirty-path — in-memory mirror of the `ds_dirty_path` table.
+   * Keyed `${scope}\x00${path}`, updated through {@link applyDirtyUpsert} on
+   * every changelog append so its merge/guard semantics match the SQL trigger
+   * byte-for-byte. There is no DB trigger here, so {@link pushChangelog} is the
+   * single hook every write path funnels through.
+   */
+  private dirtyMap;
+  /** Monotonic seq counter mirroring `AUTOINCREMENT` in the SQL impl. */
+  private nextSeq;
+  /** Live Update Resilience §11.4 — in-memory mirror of `prefix_watermark`. */
+  private watermarks;
+  /**
+   * Dedup-on-write secondary index (#1159) — in-memory mirror of the
+   * `(scope, dedup_scope, dedup_key)` partial UNIQUE index. Keyed
+   * `${dedupScope}\x00${dedupKey}` → path. Maintained on put/delete; enforces
+   * uniqueness (the SQL backends get it from the DB index).
+   */
+  private dedupIndex;
+  /** Logical scope string baked into every changelog row (default ""). */
+  private readonly scope;
+  private readonly inline;
+  constructor(opts?: {
+    scope?: string;
+  } & InlineContentOptions);
+  /**
+   * Return a read-only snapshot of the in-memory changelog.
+   *
+   * Used by unit tests to assert that the correct row shape was appended on
+   * each put/delete. Production code never calls this.
+   */
+  getChangelogSnapshot(): readonly ChangelogEntry[];
+  /**
+   * The single append hook for the in-memory changelog. Mirrors the SQL
+   * `AFTER INSERT ON ds_changelog` trigger: it appends the row AND folds it into
+   * the dirty map via {@link applyDirtyUpsert} (same latest_seq guard + backoff
+   * reset). Every write path (`put` / `delete` / `deleteByPrefix`; `putBatch`
+   * and the batch* methods loop those) funnels through here, so the dirty map
+   * covers all six TreeIndex write methods for free — the Memory-backend twin of
+   * the trigger's "covers every write face by construction".
+   */
+  private pushChangelog;
+  get(path: string, _opts?: {
+    includeContent?: boolean;
+  }): Promise<TreeEntry | null>;
+  getDirTimes(dirPath: string): Promise<{
+    ctime: number;
+    mtime: number;
+  } | null>;
+  put(path: string, entry: TreeEntry, opts: PutOpts): Promise<{
+    oldCid?: string;
+  }>;
+  /** Inline content this entry would store — drives loopBatchPutEntries' content-aware skip. */
+  inlineForEntry(entry: TreeEntry): Promise<string | null>;
+  private dedupMapKey;
+  /** Mirror the `(scope, dedup_scope, dedup_key)` UNIQUE constraint. */
+  private assertDedupUnique;
+  private dropDedupMapping;
+  /** Re-point the dedup map for `path`: drop its stale mapping, set the new one. */
+  private updateDedupMapping;
+  findByDedupKey(dedupScope: string, dedupKey: string): Promise<({
+    path: string;
+  } & TreeEntry) | null>;
+  setDedupKey(path: string, dedupScope: string, dedupKey: string, opts: PutOpts): Promise<void>;
+  /** Bump a collection root's watermark by 1 (lazy-create at 1). No-op for null. */
+  private bumpWatermark;
+  getPrefixWatermark(prefix: string): Promise<number | null>;
+  delete(path: string, opts: PutOpts): Promise<void>;
+  private cleanEmptyParents;
+  private static readonly VALID_ORDER_BY;
+  /**
+   * Ordered + keyset-paged listing shared by listEntries/listChildren when
+   * an explicit orderBy is set — same semantics as the SQL impls (NULL
+   * mimeType last in both directions, unique-tie keyset resume, v2 cursor).
+   */
+  private orderedPage;
+  list(prefix: string, options?: TreeIndexListOptions): Promise<TreeIndexListResult>;
+  listEntries(prefix: string, options?: TreeIndexListOptions): Promise<TreeIndexListEntriesResult>;
+  hasChildren(prefix: string): Promise<boolean>;
+  count(prefix: string): Promise<number>;
+  deleteByPrefix(prefix: string, opts: PutOpts): Promise<number>;
+  /**
+   * THE single source of direct-children candidates — files with their own
+   * entry fields/content plus dir rows with the optional `<dir><docFile>`
+   * sub-file join. Shared by `listChildren` (join-free form post-T4.3) and
+   * `query` (doc surface) so the child-candidate semantics cannot drift —
+   * the in-memory mirror of `buildChildrenFrom` in tree-query.ts.
+   */
+  private collectChildren;
+  listChildren(parent: string, options?: TreeIndexListOptions): Promise<TreeIndexListEntriesResult>;
+  countChildren(parent: string): Promise<number>;
+  /**
+   * Collection query (afs-collection-query Phase 1) — JS executor over the
+   * same candidate set the SQL impls compile (lockstep-tested).
+   */
+  query(parent: string, spec: TreeQuerySpec): Promise<TreeQueryResult>;
+  countChildrenMany(parents: string[]): Promise<Map<string, number>>;
+  aggregate(prefix: string): Promise<{
+    fileCount: number;
+    totalSize: number;
+  }>;
+  /** Batch metadata read — loop over get (no IN-merge needed off-CF). */
+  getMany(paths: string[]): Promise<Map<string, TreeEntry | null>>;
+  /** Batch sync fast path — loop reference semantics (conformance-pinned
+   *  equivalent of the merged D1 implementation). */
+  batchPutEntries(entries: BatchPutEntry[], ctx?: BatchIndexContext): Promise<BatchPutEntryResult[]>;
+  /** Delete twin of {@link batchPutEntries} (loop reference semantics). */
+  batchDeleteEntries(entries: BatchDeleteEntry[], ctx?: BatchIndexContext): Promise<BatchDeleteEntryResult[]>;
+  putBatch(entries: Array<{
+    path: string;
+    entry: TreeEntry;
+  }>, opts: PutOpts): Promise<void>;
+  listModifiedSince(prefix: string, since: number, options?: TreeIndexListOptions): Promise<TreeIndexListEntriesResult>;
+  getMaxSeq(): Promise<number>;
+  /**
+   * Read-auth reference check (design §4.1) — three-way, scoped, optionally
+   * prefix-local. See {@link TreeIndex.isReferenced}. This impl is single-scope
+   * (every row shares `this.scope`), so the scope filter is implicit; only the
+   * path-prefix restriction is applied.
+   */
+  isReferenced(cid: string, pathPrefix?: string): Promise<boolean>;
+  /**
+   * Batch read-auth (design §7.2 / §14) — in-memory three-way equivalent to
+   * per-cid {@link isReferenced}. No bound-param cap (no sharding), but the
+   * result MUST agree cid-for-cid with the SQL backends.
+   */
+  isReferencedMany(cids: string[], pathPrefix?: string): Promise<Set<string>>;
+  getChangelogSince(sinceSeq: number, limit: number): Promise<{
+    entries: ChangelogEntry[];
+    hasMore: boolean;
+    cursor: number;
+  }>;
+  getCompactedBelowSeq(): Promise<number>;
+  listDirtyPaths(options: ListDirtyPathOptions): Promise<DirtyPathRow[]>;
+  ackDirtyPath(path: string, latestSeq: number): Promise<boolean>;
+  markDirtyPathError(path: string, latestSeq: number, error: string, nextAttemptAt: number): Promise<boolean>;
+  private ensureParentDirs;
+}
+//#endregion
+export { MemoryTreeIndex };
+//# sourceMappingURL=memory-tree-index.d.mts.map

package/dist/memory-tree-index.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-tree-index.d.mts","names":[],"sources":["../src/memory-tree-index.ts"],"mappings":";;;;;;cAoGa,eAAA,YAA2B,SAAA;EAAA,QAC9B,OAAA;EAsFwC;;;;;;;EAAA,QA9ExC,UAAA;EAmPkC;EAAA,QAjPlC,SAAA;EAuPmC;;;;;;;EAAA,QA/OnC,QAAA;EA2iBqB;EAAA,QAziBrB,OAAA;EAijB6C;EAAA,QA/iB7C,UAAA;EAqqBG;;;;;;EAAA,QA9pBH,UAAA;EAmvBoC;EAAA,iBAjvB3B,KAAA;EAAA,iBACA,MAAA;cAEL,IAAA;IAAS,KAAA;EAAA,IAAmB,oBAAA;EAmxBhC;;;;;;EAxwBR,oBAAA,CAAA,YAAiC,cAAA;EAqxBoB;;;;;;;;;EAAA,QAxwB7C,aAAA;EAiBF,GAAA,CAAI,IAAA,UAAc,KAAA;IAAU,cAAA;EAAA,IAA6B,OAAA,CAAQ,SAAA;EAMjE,WAAA,CAAY,OAAA,WAAkB,OAAA;IAAU,KAAA;IAAe,KAAA;EAAA;EAKvD,GAAA,CAAI,IAAA,UAAc,KAAA,EAAO,SAAA,EAAW,IAAA,EAAM,OAAA,GAAU,OAAA;IAAU,MAAA;EAAA;EAvFrB;EAsL/C,cAAA,CAAe,KAAA,EAAO,SAAA,GAAY,OAAA;EAAA,QAM1B,WAAA;EA3LA;EAAA,QAgMA,iBAAA;EAAA,QAQA,gBAAA;EAtLA;EAAA,QA4LA,kBAAA;EAcF,cAAA,CACJ,UAAA,UACA,QAAA,WACC,OAAA;IAAW,IAAA;EAAA,IAAiB,SAAA;EAOzB,WAAA,CACJ,IAAA,UACA,UAAA,UACA,QAAA,UACA,IAAA,EAAM,OAAA,GACL,OAAA;;UAWK,aAAA;EAKF,kBAAA,CAAmB,MAAA,WAAiB,OAAA;EAMpC,MAAA,CAAO,IAAA,UAAc,IAAA,EAAM,OAAA,GAAU,OAAA;EAAA,QA8BnC,iBAAA;EAAA,wBA0BgB,cAAA;EA/PhB;;;;;EAAA,QA6QA,WAAA;EA8CF,IAAA,CAAK,MAAA,UAAgB,OAAA,GAAU,oBAAA,GAAuB,OAAA,CAAQ,mBAAA;EAoF9D,WAAA,CACJ,MAAA,UACA,OAAA,GAAU,oBAAA,GACT,OAAA,CAAQ,0BAAA;EA0GL,WAAA,CAAY,MAAA,WAAiB,OAAA;EAO7B,KAAA,CAAM,MAAA,WAAiB,OAAA;EAQvB,cAAA,CAAe,MAAA,UAAgB,IAAA,EAAM,OAAA,GAAU,OAAA;EApfQ;;;;;;;EAAA,QAqjBrD,eAAA;EAkDF,YAAA,CACJ,MAAA,UACA,OAAA,GAAU,oBAAA,GACT,OAAA,CAAQ,0BAAA;EAsDL,aAAA,CAAc,MAAA,WAAiB,OAAA;EA5jBf;;;;EA2kBhB,KAAA,CAAM,MAAA,UAAgB,IAAA,EAAM,aAAA,GAAgB,OAAA,CAAQ,eAAA;EAgBpD,iBAAA,CAAkB,OAAA,aAAoB,OAAA,CAAQ,GAAA;EAc9C,SAAA,CAAU,MAAA,WAAiB,OAAA;IAAU,SAAA;IAAmB,SAAA;EAAA;EA/jB3D;EA4kBG,OAAA,CAAQ,KAAA,aAAkB,OAAA,CAAQ,GAAA,SAAY,SAAA;EA5kBrB;;EAolBzB,eAAA,CACJ,OAAA,EAAS,aAAA,IACT,GAAA,GAAM,iBAAA,GACL,OAAA,CAAQ,mBAAA;EA9kBT;EAmlBI,kBAAA,CACJ,OAAA,EAAS,gBAAA,IACT,GAAA,GAAM,iBAAA,GACL,OAAA,CAAQ,sBAAA;EAIL,QAAA,CAAS,OAAA,EAAS,KAAA;IAAQ,IAAA;IAAc,KAAA,EAAO,SAAA;EAAA,IAAc,IAAA,EAAM,OAAA,GAAU,OAAA;EAM7E,iBAAA,CACJ,MAAA,UACA,KAAA,UACA,OAAA,GAAU,oBAAA,GACT,OAAA,CAAQ,0BAAA;EAyCL,SAAA,CAAA,GAAa,OAAA;EA1nBuB;;;;;;EAsoBpC,YAAA,CAAa,GAAA,UAAa,UAAA,YAAkB,OAAA;EAxkB1B;;;;;EAylBlB,gBAAA,CAAiB,IAAA,YAAgB,UAAA,YAAkB,OAAA,CAAQ,GAAA;EAiB3D,iBAAA,CACJ,QAAA,UACA,KAAA,WACC,OAAA;IAAU,OAAA,EAAS,cAAA;IAAkB,OAAA;IAAkB,MAAA;EAAA;EAUpD,oBAAA,CAAA,GAAwB,OAAA;EAWxB,cAAA,CAAe,OAAA,EAAS,oBAAA,GAAuB,OAAA,CAAQ,YAAA;EAqBvD,YAAA,CAAa,IAAA,UAAc,SAAA,WAAoB,OAAA;EAU/C,kBAAA,CACJ,IAAA,UACA,SAAA,UACA,KAAA,UACA,aAAA,WACC,OAAA;EAAA,QAiBK,gBAAA;AAAA"}