@miller-tech/uap 1.175.13 → 1.178.1

package/dist/memory/reconstruct-store.d.ts

@@ -0,0 +1,143 @@
+/**
+ * Wiring active reconstruction to UAP's real memory stores (harness plan E3).
+ *
+ * Resolves where the graph lives, fills it from the stores UAP already writes
+ * (short-term SQLite AND the long-term semantic store), and exposes the entry
+ * point callers use: `recallActive`.
+ *
+ * The graph is a DERIVED index, never a source of truth: it can be deleted and
+ * rebuilt at any time. (It is not side-effect free, though — opening the
+ * short-term store runs `ensureShortTermSchema`, which creates indexes and can
+ * backfill FTS. That means a build needs a writable store.)
+ *
+ * COVERAGE IS THE CORRECTNESS PROPERTY HERE. The passive path queries short-term
+ * FTS *and* the long-term semantic store. If active recall indexed only the
+ * short-term store — a rolling ~50-entry window — then routing a query here
+ * would silently drop every durable memory the project has, which is a
+ * regression wearing a feature's clothes. So ingestion covers both tiers, and
+ * `recallActive` reports what it covered.
+ */
+import { MemoryGraph, type ReconstructionResult, type ReconstructionPolicy } from './reconstruct.js';
+import { type IngestItem, type IngestResult } from './reconstruct-ingest.js';
+/** Where the derived graph lives, alongside the stores it indexes. */
+export declare function memoryGraphPath(cwd: string): string;
+/**
+ * Resolve short-term store + project id the way `uap memory query` does.
+ *
+ * Reading these from the config rather than hardcoding defaults matters: a
+ * project with a configured store path, or any project not literally named
+ * "project", was otherwise indexing zero rows while reporting success — because
+ * `getRecent` filters on `project_id`.
+ */
+export declare function resolveStoreConfig(cwd: string, opts?: BuildOptions): {
+    shortTermPath: string;
+    projectId: string;
+};
+export declare function openMemoryGraph(cwd: string): MemoryGraph;
+export declare function memoryGraphExists(cwd: string): boolean;
+export interface BuildOptions {
+    /** Max short-term entries to pull. Default 2000. */
+    limit?: number;
+    /** Project id for the short-term store. */
+    projectId?: string;
+    /** Explicit short-term DB path (else the standard location). */
+    shortTermPath?: string;
+    /** Extra items from a caller (e.g. a long-term export). */
+    extra?: IngestItem[];
+    /** Rebuild from scratch (truncates the graph) instead of incrementally. */
+    rebuild?: boolean;
+    /** Skip the long-term tier (tests, or an intentionally short-term-only index). */
+    includeLongTerm?: boolean;
+}
+export interface BuildReport extends IngestResult {
+    /** Items offered to the graph (before dedupe). */
+    considered: number;
+    graphPath: string;
+    /**
+     * Which memory tiers the graph actually covers. Reported because recall over a
+     * partial corpus is worse than no recall if the caller believes it is
+     * complete.
+     */
+    coverage: {
+        shortTerm: number;
+        longTerm: number;
+    };
+    /** True when another process held the build lock and this call did nothing. */
+    skippedConcurrentBuild?: boolean;
+}
+/**
+ * Read UAP's short-term store into `IngestItem`s.
+ *
+ * Isolated and best-effort: a missing or unreadable store yields an empty list
+ * rather than failing the build, because the graph is derived and a partial
+ * index is more useful than none.
+ */
+export declare function itemsFromShortTerm(cwd: string, opts?: BuildOptions): Promise<IngestItem[]>;
+/**
+ * Read the LONG-TERM semantic store into ingest items.
+ *
+ * This tier holds everything durable — `memory store`, `sync-files`,
+ * `prepopulate`. Omitting it would make active recall a strict downgrade from
+ * the passive path it replaces. Best-effort: an unreachable Qdrant yields [] and
+ * the caller reports reduced coverage rather than failing.
+ */
+export declare function itemsFromLongTerm(cwd: string, limit?: number): Promise<IngestItem[]>;
+/**
+ * Build or refresh the graph from the stores.
+ *
+ * Incremental by default: source keys already ingested are skipped, so this is
+ * cheap to re-run and safe to call before a query.
+ */
+export declare function buildMemoryGraph(cwd: string, opts?: BuildOptions): Promise<BuildReport>;
+export interface RecallOptions {
+    policy?: ReconstructionPolicy;
+    maxSteps?: number;
+    /** Ceiling on admitted context. */
+    maxContext?: number;
+    /**
+     * Build/refresh the graph before querying.
+     *
+     *   true        — always (the CLI default: an operator asking a question wants
+     *                 the freshest answer and accepts the wait)
+     *   false       — never
+     *   'if-stale'  — only when the last ingest is older than `staleAfterSeconds`
+     *
+     * `'if-stale'` exists for the AGENT path. Refreshing on every retrieval would
+     * put a full store scan on the hot path of every model turn; never refreshing
+     * would serve an index that silently ages out. The TTL is the compromise.
+     */
+    refresh?: boolean | 'if-stale';
+    /** Staleness window for `refresh: 'if-stale'`. Default 900s (15 min). */
+    staleAfterSeconds?: number;
+    buildOptions?: BuildOptions;
+}
+export interface RecallResult extends ReconstructionResult {
+    /** True when there is nothing to traverse — distinct from "nothing matched". */
+    graphEmpty: boolean;
+    build?: BuildReport;
+}
+/**
+ * Recall by ACTIVE RECONSTRUCTION: traverse the graph while reasoning, pruning
+ * weak paths before they cost context, instead of one passive top-k pull.
+ *
+ * This is the caller area E was missing. It is invoked by `uap memory query
+ * --active` and by anything that opts in; passive retrieval remains the default
+ * until the paired bench measures the lift on our own suite.
+ */
+export declare function recallActive(cwd: string, query: string, opts?: RecallOptions): Promise<RecallResult>;
+/**
+ * Should a caller use active reconstruction?
+ *
+ * Both conditions must hold: the operator opted in AND the graph actually has
+ * content. Routing to an empty graph would silently return nothing where
+ * passive retrieval would have answered — a regression dressed as a feature.
+ */
+export declare function shouldUseActiveRecall(cwd: string, graph?: MemoryGraph): boolean;
+/**
+ * The retrieval mode actually in force, for the harness disclosure card.
+ *
+ * One implementation so the bench card and `uap harness card` cannot disagree —
+ * two call sites computing this independently is how a card starts lying.
+ */
+export declare function describeMemoryMode(cwd: string): string;
+//# sourceMappingURL=reconstruct-store.d.ts.map

package/dist/memory/reconstruct-store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reconstruct-store.d.ts","sourceRoot":"","sources":["../../src/memory/reconstruct-store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAKH,OAAO,EACL,WAAW,EAIX,KAAK,oBAAoB,EACzB,KAAK,oBAAoB,EAC1B,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAwB,KAAK,UAAU,EAAE,KAAK,YAAY,EAAE,MAAM,yBAAyB,CAAC;AAEnG,sEAAsE;AACtE,wBAAgB,eAAe,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAEnD;AAED;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CAChC,GAAG,EAAE,MAAM,EACX,IAAI,GAAE,YAAiB,GACtB;IAAE,aAAa,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,CAS9C;AAED,wBAAgB,eAAe,CAAC,GAAG,EAAE,MAAM,GAAG,WAAW,CAExD;AAED,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAEtD;AAED,MAAM,WAAW,YAAY;IAC3B,oDAAoD;IACpD,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,2CAA2C;IAC3C,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,gEAAgE;IAChE,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,2DAA2D;IAC3D,KAAK,CAAC,EAAE,UAAU,EAAE,CAAC;IACrB,2EAA2E;IAC3E,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,kFAAkF;IAClF,eAAe,CAAC,EAAE,OAAO,CAAC;CAC3B;AAED,MAAM,WAAW,WAAY,SAAQ,YAAY;IAC/C,kDAAkD;IAClD,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;IAClB;;;;OAIG;IACH,QAAQ,EAAE;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC;IAClD,+EAA+E;IAC/E,sBAAsB,CAAC,EAAE,OAAO,CAAC;CAClC;AAED;;;;;;GAMG;AACH,wBAAsB,kBAAkB,CACtC,GAAG,EAAE,MAAM,EACX,IAAI,GAAE,YAAiB,GACtB,OAAO,CAAC,UAAU,EAAE,CAAC,CA6BvB;AAED;;;;;;;GAOG;AACH,wBAAsB,iBAAiB,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,SAAO,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,CAmDxF;AAED;;;;;GAKG;AACH,wBAAsB,gBAAgB,CACpC,GAAG,EAAE,MAAM,EACX,IAAI,GAAE,YAAiB,GACtB,OAAO,CAAC,WAAW,CAAC,CA0CtB;AAED,MAAM,WAAW,aAAa;IAC5B,MAAM,CAAC,EAAE,oBAAoB,CAAC;IAC9B,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,mCAAmC;IACnC,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,EAAE,OAAO,GAAG,UAAU,CAAC;IAC/B,yEAAyE;IACzE,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,YAAY,CAAC,EAAE,YAAY,CAAC;CAC7B;AAED,MAAM,WAAW,YAAa,SAAQ,oBAAoB;IACxD,gFAAgF;IAChF,UAAU,EAAE,OAAO,CAAC;IACpB,KAAK,CAAC,EAAE,WAAW,CAAC;CACrB;AAED;;;;;;;GAOG;AACH,wBAAsB,YAAY,CAChC,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,MAAM,EACb,IAAI,GAAE,aAAkB,GACvB,OAAO,CAAC,YAAY,CAAC,CAyBvB;AAuBD;;;;;;GAMG;AACH,wBAAgB,qBAAqB,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,WAAW,GAAG,OAAO,CAqB/E;AAED;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAMtD"}

package/dist/memory/reconstruct-store.js

@@ -0,0 +1,312 @@
+/**
+ * Wiring active reconstruction to UAP's real memory stores (harness plan E3).
+ *
+ * Resolves where the graph lives, fills it from the stores UAP already writes
+ * (short-term SQLite AND the long-term semantic store), and exposes the entry
+ * point callers use: `recallActive`.
+ *
+ * The graph is a DERIVED index, never a source of truth: it can be deleted and
+ * rebuilt at any time. (It is not side-effect free, though — opening the
+ * short-term store runs `ensureShortTermSchema`, which creates indexes and can
+ * backfill FTS. That means a build needs a writable store.)
+ *
+ * COVERAGE IS THE CORRECTNESS PROPERTY HERE. The passive path queries short-term
+ * FTS *and* the long-term semantic store. If active recall indexed only the
+ * short-term store — a rolling ~50-entry window — then routing a query here
+ * would silently drop every durable memory the project has, which is a
+ * regression wearing a feature's clothes. So ingestion covers both tiers, and
+ * `recallActive` reports what it covered.
+ */
+import { existsSync } from 'node:fs';
+import { join } from 'node:path';
+import { loadUapConfig } from '../utils/config-loader.js';
+import { MemoryGraph, reconstruct, heuristicPolicy, activeReconstructionEnabled, } from './reconstruct.js';
+import { ingestItems, itemKey } from './reconstruct-ingest.js';
+/** Where the derived graph lives, alongside the stores it indexes. */
+export function memoryGraphPath(cwd) {
+    return join(cwd, 'agents', 'data', 'memory', 'memory-graph.db');
+}
+/**
+ * Resolve short-term store + project id the way `uap memory query` does.
+ *
+ * Reading these from the config rather than hardcoding defaults matters: a
+ * project with a configured store path, or any project not literally named
+ * "project", was otherwise indexing zero rows while reporting success — because
+ * `getRecent` filters on `project_id`.
+ */
+export function resolveStoreConfig(cwd, opts = {}) {
+    const config = loadUapConfig(cwd);
+    return {
+        shortTermPath: opts.shortTermPath ||
+            config?.memory?.shortTerm?.path ||
+            join(cwd, 'agents', 'data', 'memory', 'short_term.db'),
+        projectId: opts.projectId ?? config?.project?.name ?? 'project',
+    };
+}
+export function openMemoryGraph(cwd) {
+    return new MemoryGraph(memoryGraphPath(cwd));
+}
+export function memoryGraphExists(cwd) {
+    return existsSync(memoryGraphPath(cwd));
+}
+/**
+ * Read UAP's short-term store into `IngestItem`s.
+ *
+ * Isolated and best-effort: a missing or unreadable store yields an empty list
+ * rather than failing the build, because the graph is derived and a partial
+ * index is more useful than none.
+ */
+export async function itemsFromShortTerm(cwd, opts = {}) {
+    const { shortTermPath: dbPath, projectId } = resolveStoreConfig(cwd, opts);
+    if (!existsSync(dbPath))
+        return [];
+    const { SQLiteShortTermMemory } = await import('./short-term/sqlite.js');
+    let store = null;
+    try {
+        store = new SQLiteShortTermMemory({
+            dbPath,
+            projectId,
+            maxEntries: opts.limit ?? 2000,
+        });
+        const rows = (await store.getRecent(opts.limit ?? 2000)) ?? [];
+        return rows.map((r) => ({
+            id: `st:${r.id ?? itemKey({ text: r.content })}`,
+            text: r.content,
+            type: r.type,
+            occurredAt: r.timestamp,
+        }));
+    }
+    catch {
+        return [];
+    }
+    finally {
+        // A throw in getRecent used to skip close(), leaking the handle (plus WAL and
+        // SHM refs) once per query, since recall refreshes on every call.
+        try {
+            await store?.close();
+        }
+        catch {
+            /* ignore */
+        }
+    }
+}
+/**
+ * Read the LONG-TERM semantic store into ingest items.
+ *
+ * This tier holds everything durable — `memory store`, `sync-files`,
+ * `prepopulate`. Omitting it would make active recall a strict downgrade from
+ * the passive path it replaces. Best-effort: an unreachable Qdrant yields [] and
+ * the caller reports reduced coverage rather than failing.
+ */
+export async function itemsFromLongTerm(cwd, limit = 2000) {
+    try {
+        const config = loadUapConfig(cwd);
+        const endpoint = config?.memory?.longTerm?.endpoint || 'localhost:6333';
+        const url = /^https?:\/\//.test(endpoint) ? endpoint : `http://${endpoint}`;
+        const collection = config?.memory?.longTerm?.collection || 'agent_memory';
+        const apiKey = config?.memory?.longTerm?.qdrantCloud?.apiKey || process.env.QDRANT_API_KEY;
+        const { getQdrantClientClass } = await import('../utils/lazy-imports.js');
+        const QdrantClientClass = await getQdrantClientClass();
+        // The client defaults to a 300_000ms timeout. On the AGENT path this call
+        // is awaited during context assembly, so a black-holed endpoint (firewall
+        // drop, not a fast ECONNREFUSED) would block a model turn for five minutes.
+        const timeout = Number(process.env.UAP_MEMORY_QDRANT_TIMEOUT_MS) || 3000;
+        const client = new QdrantClientClass({ url, apiKey, checkCompatibility: false, timeout });
+        const collections = await client.getCollections();
+        const names = [collection, `${collection}_prepopulated`].filter((c) => collections.collections.some((col) => col.name === c));
+        const items = [];
+        for (const name of names) {
+            // Scroll the payloads only — the graph indexes text, not vectors.
+            let offset = undefined;
+            while (items.length < limit) {
+                const page = await client.scroll(name, {
+                    limit: Math.min(256, limit - items.length),
+                    with_payload: true,
+                    with_vector: false,
+                    offset,
+                });
+                for (const point of page.points ?? []) {
+                    const payload = (point.payload ?? {});
+                    const text = String(payload.content ?? '');
+                    if (!text)
+                        continue;
+                    items.push({
+                        id: `lt:${name}:${String(point.id)}`,
+                        text,
+                        type: String(payload.type ?? 'knowledge'),
+                        tags: Array.isArray(payload.tags) ? payload.tags : undefined,
+                        occurredAt: typeof payload.timestamp === 'string' ? payload.timestamp : undefined,
+                    });
+                }
+                offset = page.next_page_offset;
+                if (!offset)
+                    break;
+            }
+        }
+        return items;
+    }
+    catch {
+        return [];
+    }
+}
+/**
+ * Build or refresh the graph from the stores.
+ *
+ * Incremental by default: source keys already ingested are skipped, so this is
+ * cheap to re-run and safe to call before a query.
+ */
+export async function buildMemoryGraph(cwd, opts = {}) {
+    const graph = openMemoryGraph(cwd);
+    try {
+        if (!graph.acquireBuildLock(Date.now())) {
+            // Another process is building. Duplicating that work would insert every
+            // item a second time under fresh ids — permanent, since the ledger then
+            // reports them indexed.
+            return {
+                ingested: 0, skipped: 0, storedKeys: [], cues: 0, tags: 0, bridgingTags: 0,
+                considered: 0, graphPath: memoryGraphPath(cwd),
+                coverage: { shortTerm: 0, longTerm: 0 },
+                skippedConcurrentBuild: true,
+            };
+        }
+        const shortTerm = await itemsFromShortTerm(cwd, opts);
+        const longTerm = opts.includeLongTerm === false ? [] : await itemsFromLongTerm(cwd, opts.limit);
+        const items = [...shortTerm, ...longTerm, ...(opts.extra ?? [])];
+        if (opts.rebuild) {
+            // A real rebuild TRUNCATES. Clearing only the in-memory dedupe set left
+            // every row in place and re-inserted the whole corpus under fresh ids, so
+            // two rebuilds meant every memory twice — permanently, since the ledger
+            // then reported them as already indexed.
+            graph.clear();
+        }
+        const seen = opts.rebuild ? new Set() : graph.ingestedKeys();
+        const result = ingestItems(graph, items, { seen });
+        // Mark ONLY what was stored — see IngestResult.storedKeys.
+        graph.markIngested(result.storedKeys);
+        // Heartbeat REGARDLESS of whether anything was stored. Deriving staleness
+        // from stored keys means a refresh that finds nothing new never advances the
+        // clock, so the TTL never clears and the index rebuilds every retrieval.
+        graph.markRefreshed(new Date().toISOString());
+        return {
+            ...result,
+            considered: items.length,
+            graphPath: memoryGraphPath(cwd),
+            coverage: { shortTerm: shortTerm.length, longTerm: longTerm.length },
+        };
+    }
+    finally {
+        graph.releaseBuildLock();
+        graph.close();
+    }
+}
+/**
+ * Recall by ACTIVE RECONSTRUCTION: traverse the graph while reasoning, pruning
+ * weak paths before they cost context, instead of one passive top-k pull.
+ *
+ * This is the caller area E was missing. It is invoked by `uap memory query
+ * --active` and by anything that opts in; passive retrieval remains the default
+ * until the paired bench measures the lift on our own suite.
+ */
+export async function recallActive(cwd, query, opts = {}) {
+    const build = (await shouldRefresh(cwd, opts))
+        ? await buildMemoryGraph(cwd, opts.buildOptions)
+        : undefined;
+    const graph = openMemoryGraph(cwd);
+    try {
+        if (graph.isEmpty()) {
+            return {
+                context: [],
+                steps: [],
+                converged: false,
+                stopReason: 'exhausted',
+                graphEmpty: true,
+                build,
+            };
+        }
+        const result = reconstruct(graph, query, {
+            policy: opts.policy ?? heuristicPolicy(),
+            maxSteps: opts.maxSteps,
+            maxContext: opts.maxContext,
+        });
+        return { ...result, graphEmpty: false, build };
+    }
+    finally {
+        graph.close();
+    }
+}
+/** Decide whether this recall should rebuild the index first. */
+async function shouldRefresh(cwd, opts) {
+    if (opts.refresh === false)
+        return false;
+    if (opts.refresh !== 'if-stale')
+        return true;
+    if (!memoryGraphExists(cwd))
+        return true;
+    const graph = openMemoryGraph(cwd);
+    try {
+        const last = graph.lastRefreshedAt() ?? graph.lastIngestedAt();
+        if (!last)
+            return true;
+        // SQLite datetime('now') is UTC without a zone marker; parse it as such.
+        const lastMs = Date.parse(last.endsWith('Z') ? last : `${last.replace(' ', 'T')}Z`);
+        if (!Number.isFinite(lastMs))
+            return true;
+        const ttlMs = (opts.staleAfterSeconds ?? 900) * 1000;
+        return Date.now() - lastMs > ttlMs;
+    }
+    catch {
+        return false;
+    }
+    finally {
+        graph.close();
+    }
+}
+/**
+ * Should a caller use active reconstruction?
+ *
+ * Both conditions must hold: the operator opted in AND the graph actually has
+ * content. Routing to an empty graph would silently return nothing where
+ * passive retrieval would have answered — a regression dressed as a feature.
+ */
+export function shouldUseActiveRecall(cwd, graph) {
+    if (!activeReconstructionEnabled())
+        return false;
+    if (!memoryGraphExists(cwd))
+        return false;
+    if (graph) {
+        try {
+            return !graph.isEmpty();
+        }
+        catch {
+            return false;
+        }
+    }
+    const owned = openMemoryGraph(cwd);
+    const graphRef = owned;
+    try {
+        // Cheap probe, not stats(): this runs on EVERY `uap memory query` and every
+        // harness-card render, and stats() is five aggregates over the triples table.
+        return !graphRef.isEmpty();
+    }
+    catch {
+        return false;
+    }
+    finally {
+        owned.close();
+    }
+}
+/**
+ * The retrieval mode actually in force, for the harness disclosure card.
+ *
+ * One implementation so the bench card and `uap harness card` cannot disagree —
+ * two call sites computing this independently is how a card starts lying.
+ */
+export function describeMemoryMode(cwd) {
+    try {
+        return shouldUseActiveRecall(cwd) ? 'active reconstruction' : 'semantic retrieval';
+    }
+    catch {
+        return 'semantic retrieval';
+    }
+}
+//# sourceMappingURL=reconstruct-store.js.map

package/dist/memory/reconstruct-store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reconstruct-store.js","sourceRoot":"","sources":["../../src/memory/reconstruct-store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AACrC,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAC1D,OAAO,EACL,WAAW,EACX,WAAW,EACX,eAAe,EACf,2BAA2B,GAG5B,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,WAAW,EAAE,OAAO,EAAsC,MAAM,yBAAyB,CAAC;AAEnG,sEAAsE;AACtE,MAAM,UAAU,eAAe,CAAC,GAAW;IACzC,OAAO,IAAI,CAAC,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,iBAAiB,CAAC,CAAC;AAClE,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,kBAAkB,CAChC,GAAW,EACX,OAAqB,EAAE;IAEvB,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;IAClC,OAAO;QACL,aAAa,EACX,IAAI,CAAC,aAAa;YAClB,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI;YAC/B,IAAI,CAAC,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,eAAe,CAAC;QACxD,SAAS,EAAE,IAAI,CAAC,SAAS,IAAI,MAAM,EAAE,OAAO,EAAE,IAAI,IAAI,SAAS;KAChE,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,GAAW;IACzC,OAAO,IAAI,WAAW,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;AAC/C,CAAC;AAED,MAAM,UAAU,iBAAiB,CAAC,GAAW;IAC3C,OAAO,UAAU,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;AAC1C,CAAC;AA+BD;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,GAAW,EACX,OAAqB,EAAE;IAEvB,MAAM,EAAE,aAAa,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,kBAAkB,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IAC3E,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAAE,OAAO,EAAE,CAAC;IACnC,MAAM,EAAE,qBAAqB,EAAE,GAAG,MAAM,MAAM,CAAC,wBAAwB,CAAC,CAAC;IACzE,IAAI,KAAK,GAAsD,IAAI,CAAC;IACpE,IAAI,CAAC;QACH,KAAK,GAAG,IAAI,qBAAqB,CAAC;YAChC,MAAM;YACN,SAAS;YACT,UAAU,EAAE,IAAI,CAAC,KAAK,IAAI,IAAI;SAC/B,CAAC,CAAC;QACH,MAAM,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;QAC/D,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACtB,EAAE,EAAE,MAAM,CAAC,CAAC,EAAE,IAAI,OAAO,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,EAAE;YAChD,IAAI,EAAE,CAAC,CAAC,OAAO;YACf,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,UAAU,EAAE,CAAC,CAAC,SAAS;SACxB,CAAC,CAAC,CAAC;IACN,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;YAAS,CAAC;QACT,8EAA8E;QAC9E,kEAAkE;QAClE,IAAI,CAAC;YACH,MAAM,KAAK,EAAE,KAAK,EAAE,CAAC;QACvB,CAAC;QAAC,MAAM,CAAC;YACP,YAAY;QACd,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CAAC,GAAW,EAAE,KAAK,GAAG,IAAI;IAC/D,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;QAClC,MAAM,QAAQ,GAAG,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,IAAI,gBAAgB,CAAC;QACxE,MAAM,GAAG,GAAG,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,UAAU,QAAQ,EAAE,CAAC;QAC5E,MAAM,UAAU,GAAG,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,IAAI,cAAc,CAAC;QAC1E,MAAM,MAAM,GAAG,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE,MAAM,IAAI,OAAO,CAAC,GAAG,CAAC,cAAc,CAAC;QAE3F,MAAM,EAAE,oBAAoB,EAAE,GAAG,MAAM,MAAM,CAAC,0BAA0B,CAAC,CAAC;QAC1E,MAAM,iBAAiB,GAAG,MAAM,oBAAoB,EAAE,CAAC;QACvD,0EAA0E;QAC1E,0EAA0E;QAC1E,4EAA4E;QAC5E,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,4BAA4B,CAAC,IAAI,IAAI,CAAC;QACzE,MAAM,MAAM,GAAG,IAAI,iBAAiB,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,kBAAkB,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;QAC1F,MAAM,WAAW,GAAG,MAAM,MAAM,CAAC,cAAc,EAAE,CAAC;QAClD,MAAM,KAAK,GAAG,CAAC,UAAU,EAAE,GAAG,UAAU,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAS,EAAE,EAAE,CAC5E,WAAW,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,GAAqB,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,CACxE,CAAC;QAEF,MAAM,KAAK,GAAiB,EAAE,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,kEAAkE;YAClE,IAAI,MAAM,GAAiE,SAAS,CAAC;YACrF,OAAO,KAAK,CAAC,MAAM,GAAG,KAAK,EAAE,CAAC;gBAC5B,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE;oBACrC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC;oBAC1C,YAAY,EAAE,IAAI;oBAClB,WAAW,EAAE,KAAK;oBAClB,MAAM;iBACP,CAAC,CAAC;gBACH,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,IAAI,EAAE,EAAE,CAAC;oBACtC,MAAM,OAAO,GAAG,CAAC,KAAK,CAAC,OAAO,IAAI,EAAE,CAA4B,CAAC;oBACjE,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;oBAC3C,IAAI,CAAC,IAAI;wBAAE,SAAS;oBACpB,KAAK,CAAC,IAAI,CAAC;wBACT,EAAE,EAAE,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE;wBACpC,IAAI;wBACJ,IAAI,EAAE,MAAM,CAAC,OAAO,CAAC,IAAI,IAAI,WAAW,CAAC;wBACzC,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAE,OAAO,CAAC,IAAiB,CAAC,CAAC,CAAC,SAAS;wBAC1E,UAAU,EAAE,OAAO,OAAO,CAAC,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS;qBAClF,CAAC,CAAC;gBACL,CAAC;gBACD,MAAM,GAAG,IAAI,CAAC,gBAAiC,CAAC;gBAChD,IAAI,CAAC,MAAM;oBAAE,MAAM;YACrB,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,GAAW,EACX,OAAqB,EAAE;IAEvB,MAAM,KAAK,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;IACnC,IAAI,CAAC;QACH,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;YACxC,wEAAwE;YACxE,wEAAwE;YACxE,wBAAwB;YACxB,OAAO;gBACL,QAAQ,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC;gBAC1E,UAAU,EAAE,CAAC,EAAE,SAAS,EAAE,eAAe,CAAC,GAAG,CAAC;gBAC9C,QAAQ,EAAE,EAAE,SAAS,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE;gBACvC,sBAAsB,EAAE,IAAI;aAC7B,CAAC;QACJ,CAAC;QACD,MAAM,SAAS,GAAG,MAAM,kBAAkB,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACtD,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,iBAAiB,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QAChG,MAAM,KAAK,GAAG,CAAC,GAAG,SAAS,EAAE,GAAG,QAAQ,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC;QACjE,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,wEAAwE;YACxE,0EAA0E;YAC1E,wEAAwE;YACxE,yCAAyC;YACzC,KAAK,CAAC,KAAK,EAAE,CAAC;QAChB,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,GAAG,EAAU,CAAC,CAAC,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC;QACrE,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;QACnD,2DAA2D;QAC3D,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QACtC,0EAA0E;QAC1E,6EAA6E;QAC7E,yEAAyE;QACzE,KAAK,CAAC,aAAa,CAAC,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC;QAC9C,OAAO;YACL,GAAG,MAAM;YACT,UAAU,EAAE,KAAK,CAAC,MAAM;YACxB,SAAS,EAAE,eAAe,CAAC,GAAG,CAAC;YAC/B,QAAQ,EAAE,EAAE,SAAS,EAAE,SAAS,CAAC,MAAM,EAAE,QAAQ,EAAE,QAAQ,CAAC,MAAM,EAAE;SACrE,CAAC;IACJ,CAAC;YAAS,CAAC;QACT,KAAK,CAAC,gBAAgB,EAAE,CAAC;QACzB,KAAK,CAAC,KAAK,EAAE,CAAC;IAChB,CAAC;AACH,CAAC;AA+BD;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,YAAY,CAChC,GAAW,EACX,KAAa,EACb,OAAsB,EAAE;IAExB,MAAM,KAAK,GAAG,CAAC,MAAM,aAAa,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC5C,CAAC,CAAC,MAAM,gBAAgB,CAAC,GAAG,EAAE,IAAI,CAAC,YAAY,CAAC;QAChD,CAAC,CAAC,SAAS,CAAC;IACd,MAAM,KAAK,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;IACnC,IAAI,CAAC;QACH,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YACpB,OAAO;gBACL,OAAO,EAAE,EAAE;gBACX,KAAK,EAAE,EAAE;gBACT,SAAS,EAAE,KAAK;gBAChB,UAAU,EAAE,WAAW;gBACvB,UAAU,EAAE,IAAI;gBAChB,KAAK;aACN,CAAC;QACJ,CAAC;QACD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,KAAK,EAAE;YACvC,MAAM,EAAE,IAAI,CAAC,MAAM,IAAI,eAAe,EAAE;YACxC,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,UAAU,EAAE,IAAI,CAAC,UAAU;SAC5B,CAAC,CAAC;QACH,OAAO,EAAE,GAAG,MAAM,EAAE,UAAU,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;IACjD,CAAC;YAAS,CAAC;QACT,KAAK,CAAC,KAAK,EAAE,CAAC;IAChB,CAAC;AACH,CAAC;AAED,iEAAiE;AACjE,KAAK,UAAU,aAAa,CAAC,GAAW,EAAE,IAAmB;IAC3D,IAAI,IAAI,CAAC,OAAO,KAAK,KAAK;QAAE,OAAO,KAAK,CAAC;IACzC,IAAI,IAAI,CAAC,OAAO,KAAK,UAAU;QAAE,OAAO,IAAI,CAAC;IAC7C,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IACzC,MAAM,KAAK,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;IACnC,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,KAAK,CAAC,eAAe,EAAE,IAAI,KAAK,CAAC,cAAc,EAAE,CAAC;QAC/D,IAAI,CAAC,IAAI;YAAE,OAAO,IAAI,CAAC;QACvB,yEAAyE;QACzE,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;QACpF,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC;YAAE,OAAO,IAAI,CAAC;QAC1C,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,iBAAiB,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC;QACrD,OAAO,IAAI,CAAC,GAAG,EAAE,GAAG,MAAM,GAAG,KAAK,CAAC;IACrC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;YAAS,CAAC;QACT,KAAK,CAAC,KAAK,EAAE,CAAC;IAChB,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,qBAAqB,CAAC,GAAW,EAAE,KAAmB;IACpE,IAAI,CAAC,2BAA2B,EAAE;QAAE,OAAO,KAAK,CAAC;IACjD,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IAC1C,IAAI,KAAK,EAAE,CAAC;QACV,IAAI,CAAC;YACH,OAAO,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;QAC1B,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IACD,MAAM,KAAK,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;IACnC,MAAM,QAAQ,GAAG,KAAK,CAAC;IACvB,IAAI,CAAC;QACH,4EAA4E;QAC5E,8EAA8E;QAC9E,OAAO,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;IAC7B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;YAAS,CAAC;QACT,KAAK,CAAC,KAAK,EAAE,CAAC;IAChB,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAAC,GAAW;IAC5C,IAAI,CAAC;QACH,OAAO,qBAAqB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,uBAAuB,CAAC,CAAC,CAAC,oBAAoB,CAAC;IACrF,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,oBAAoB,CAAC;IAC9B,CAAC;AACH,CAAC"}