mrplex 0.0.1

package/dist/kernel/graph.js

@@ -0,0 +1,559 @@
+/**
+ * kernel.graph — the graph read surface (docs/graph-plan.md).
+ *
+ * A read-only BFS neighborhood expansion over the repo-local `links` derived
+ * index. Given a root set, expand outward under a direction lens, honoring
+ * scope and `filter` as *visibility* (traversal happens inside the visible
+ * subgraph), and return documents, distinct induced links, a behavioral
+ * frontier, and truncation metadata.
+ *
+ * The whole thing is expressed in the system's own vocabulary — documents and
+ * links — with no node/edge layer. See §5 for the pinned decisions.
+ *
+ * Visibility reuse: rather than re-implement scope/sigil/filter evaluation,
+ * every visibility check runs through the existing `versions_search` path via
+ * a `SearchPlan`. `$degrees` is bound per round by rewriting the parsed filter
+ * to an integer constant (degrees.ts), so both dialect compilers stay unaware
+ * of it. This is the "reuse the SearchPlan path" mandate of §4.3.
+ */
+import { BODY_FIELD } from "../links/extract.js";
+import { globToRegexSource } from "./auth/glob.js";
+import { claimsGrantRepo, claimsToScopeGroups } from "./auth/scope.js";
+import { KernelError, repoNotFound } from "./errors.js";
+import { effectivePathConfig, parseRepoOverride } from "./path-config.js";
+import { parseCel } from "./query/cel-parse.js";
+import { bindDegrees } from "./query/degrees.js";
+import { isPathGlobPattern, normalizeExactDocumentPath } from "./validation.js";
+// Defaults + caps (§8). Following query's constant-default style rather than
+// config knobs; a generous links ceiling keeps a hub expansion bounded.
+export const DEFAULT_DEGREES = 1;
+export const MAX_DEGREES = 5;
+export const DEFAULT_MAX_DOCUMENTS = 100;
+export const HARD_MAX_DOCUMENTS = 500;
+export const LINKS_CEILING = 5000;
+export async function runGraph(claims, spec, deps) {
+    const repo = await deps.storage.repos_by_slug(spec.repo);
+    if (!repo)
+        throw repoNotFound(spec.repo);
+    if (claims && !claimsGrantRepo(claims, repo.slug))
+        throw repoNotFound(spec.repo);
+    const internal = buildInternal(claims, spec, deps, repo);
+    const rootPatterns = normalizeRoots(spec.roots, deps.pathConfig);
+    const emptyResult = {
+        documents: [],
+        links: [],
+        frontier: [],
+        complete_degrees: 0,
+        truncated: false,
+    };
+    // 1-2. Resolve roots against visible, filter-matching current docs at
+    // $degrees = 0. A glob matching nothing → empty result, not an error.
+    const roots = await resolveRoots(internal, rootPatterns);
+    if (roots.length === 0)
+        return emptyResult;
+    // 3-4. BFS by rounds within the effective graph, bounded by max_documents.
+    const bfs = await expand(internal, roots);
+    // 5. Behavioral frontier: admitted docs with ≥1 effective link to a
+    // document not in the result.
+    const frontier = await computeFrontier(internal, bfs);
+    // 6. Induced links: distinct (source, target, field) over admitted docs.
+    const { links, linksTruncated } = await inducedLinks(internal, bfs.admittedIds);
+    // 7. Degree counts: scope-visible distinct in/out neighbor counts,
+    // independent of this call's filter/fields/degrees.
+    const degreeCounts = await degreeCountsFor(internal, bfs.admittedIds);
+    // 8. Assemble. Documents ordered ($degrees, $path); links (source,target,field).
+    const documents = assembleDocuments(internal, bfs, degreeCounts);
+    return {
+        documents,
+        links,
+        frontier,
+        complete_degrees: bfs.completeDegrees,
+        truncated: bfs.truncated || linksTruncated,
+    };
+}
+// -----------------------------------------------------------------------------
+// Spec validation + normalization
+// -----------------------------------------------------------------------------
+const KNOWN_FIELDS = new Set([
+    "repo",
+    "roots",
+    "direction",
+    "degrees",
+    "fields",
+    "filter",
+    "select",
+    "max_documents",
+]);
+function buildInternal(claims, spec, deps, repo) {
+    for (const key of Object.keys(spec)) {
+        if (!KNOWN_FIELDS.has(key)) {
+            throw new KernelError("filter_invalid", {
+                reason: `unknown GraphSpec field: ${JSON.stringify(key)}`,
+            });
+        }
+    }
+    const direction = spec.direction ?? "both";
+    if (direction !== "out" && direction !== "in" && direction !== "both") {
+        throw new KernelError("filter_invalid", {
+            reason: `direction must be "out", "in", or "both" (got ${JSON.stringify(direction)})`,
+        });
+    }
+    let degrees = spec.degrees ?? DEFAULT_DEGREES;
+    if (!Number.isSafeInteger(degrees) || degrees < 0) {
+        throw new KernelError("filter_invalid", {
+            reason: `degrees must be a non-negative integer (got ${JSON.stringify(spec.degrees)})`,
+        });
+    }
+    if (degrees > MAX_DEGREES)
+        degrees = MAX_DEGREES;
+    let maxDocuments = spec.max_documents ?? DEFAULT_MAX_DOCUMENTS;
+    if (!Number.isSafeInteger(maxDocuments) || maxDocuments <= 0) {
+        throw new KernelError("filter_invalid", {
+            reason: `max_documents must be a positive integer (got ${JSON.stringify(spec.max_documents)})`,
+        });
+    }
+    if (maxDocuments > HARD_MAX_DOCUMENTS)
+        maxDocuments = HARD_MAX_DOCUMENTS;
+    // `fields` maps `$body` → the storage sentinel; other members are
+    // frontmatter field paths, stored verbatim.
+    let fieldSet = null;
+    if (spec.fields !== undefined) {
+        if (!Array.isArray(spec.fields) || spec.fields.some((f) => typeof f !== "string")) {
+            throw new KernelError("filter_invalid", { reason: "fields must be an array of strings" });
+        }
+        fieldSet = new Set(spec.fields.map((f) => (f === "$body" ? BODY_FIELD : f)));
+    }
+    const select = spec.select ?? ["title"];
+    if (!Array.isArray(select) || select.some((s) => typeof s !== "string")) {
+        throw new KernelError("filter_invalid", { reason: "select must be an array of strings" });
+    }
+    for (const key of select) {
+        if (key.startsWith("$")) {
+            throw new KernelError("filter_invalid", {
+                reason: `select takes bare frontmatter keys, not intrinsics (got ${JSON.stringify(key)})`,
+            });
+        }
+    }
+    let filterAst;
+    if (spec.filter !== undefined) {
+        const parsed = parseCel(spec.filter);
+        if (!parsed.expr)
+            throw new KernelError("filter_invalid", { reason: "empty filter" });
+        filterAst = parsed.expr;
+    }
+    const effectiveConfig = effectivePathConfig(deps.serverPathConfig, parseRepoOverride(repo.path_config));
+    const sigils = buildSigilExclusion(repo.id, effectiveConfig);
+    const scope = buildScope(claims, repo);
+    return {
+        storage: deps.storage,
+        repo,
+        claims,
+        scope,
+        sigils,
+        direction,
+        degrees,
+        maxDocuments,
+        fieldSet,
+        filterAst,
+        select,
+    };
+}
+function normalizeRoots(roots, pathConfig) {
+    const list = Array.isArray(roots) ? roots : [roots];
+    if (list.length === 0 || list.some((r) => typeof r !== "string")) {
+        throw new KernelError("filter_invalid", {
+            reason: "roots must be a path/glob string or a non-empty array of them",
+        });
+    }
+    return list.map((r) => isPathGlobPattern(r) ? r : normalizeExactDocumentPath(r, pathConfig));
+}
+/**
+ * A graph never surfaces system/hidden docs unless the caller could, but the
+ * graph tool has no include_hidden/system flags — expansion always excludes
+ * hidden + system namespaces (matching `query`'s defaults). Build the
+ * exclusion the same way runQuery does.
+ */
+function buildSigilExclusion(repoId, cfg) {
+    const sigils = [...cfg.hidden_sigils, ...cfg.system_sigils];
+    if (sigils.length === 0)
+        return [];
+    return [{ repo_ids: [repoId], sigils }];
+}
+function buildScope(claims, repo) {
+    if (claims === null)
+        return { kind: "allow_all" };
+    const groups = claimsToScopeGroups(claims, [repo]);
+    if (groups.length === 0)
+        return { kind: "deny_all" };
+    return { kind: "groups", groups };
+}
+// -----------------------------------------------------------------------------
+// Visibility (§4.1, §4.3) — reuses versions_search.
+// -----------------------------------------------------------------------------
+/**
+ * Max candidate document ids per `versions_search` call. A BFS ring is bounded
+ * only by fan-out, not by `max_documents`, so a large ring's candidate/neighbor
+ * set could otherwise overflow SQLite's bound-variable cap (via
+ * `candidate_document_ids`). We chunk under it and union; the visibility
+ * predicate is per-row (no cross-chunk ordering), so the union is exact.
+ */
+const VISIBILITY_CHUNK_SIZE = 20000;
+/** Split ids into chunks of at most VISIBILITY_CHUNK_SIZE. */
+function idChunks(ids) {
+    if (ids.length <= VISIBILITY_CHUNK_SIZE)
+        return ids.length === 0 ? [] : [[...ids]];
+    const out = [];
+    for (let i = 0; i < ids.length; i += VISIBILITY_CHUNK_SIZE) {
+        out.push(ids.slice(i, i + VISIBILITY_CHUNK_SIZE));
+    }
+    return out;
+}
+/**
+ * Return the subset of `docIds` that are visible at hop `degrees` — i.e. live
+ * current documents passing scope∧sigils∧filter (with `$degrees` bound to
+ * `degrees`). Runs a `versions_search` pass per id-chunk and unions the rows.
+ */
+async function visibleAt(internal, docIds, degrees) {
+    if (docIds.length === 0)
+        return [];
+    if (internal.scope.kind === "deny_all")
+        return [];
+    const filterAst = internal.filterAst === undefined ? undefined : bindDegrees(internal.filterAst, degrees);
+    const out = [];
+    for (const chunk of idChunks(docIds)) {
+        const plan = {
+            repo_ids: [internal.repo.id],
+            // candidate_document_ids already bounds the result to the chunk.
+            limit: chunk.length,
+            filter_ast: filterAst,
+            sigils: internal.sigils,
+            scope: internal.scope,
+            candidate_document_ids: chunk,
+        };
+        out.push(...(await internal.storage.versions_search(plan)));
+    }
+    return out;
+}
+/**
+ * Scope+sigil visibility WITHOUT the filter — used for `$links`/`$backlinks`
+ * degree counts, which describe true visible connectivity independent of this
+ * call's filter/fields/degrees (§2.2, decision 7).
+ */
+async function scopeVisible(internal, docIds) {
+    if (docIds.length === 0)
+        return new Set();
+    if (internal.scope.kind === "deny_all")
+        return new Set();
+    const visible = new Set();
+    for (const chunk of idChunks(docIds)) {
+        const plan = {
+            repo_ids: [internal.repo.id],
+            limit: chunk.length,
+            sigils: internal.sigils,
+            scope: internal.scope,
+            candidate_document_ids: chunk,
+        };
+        for (const r of await internal.storage.versions_search(plan))
+            visible.add(r.document_id);
+    }
+    return visible;
+}
+// -----------------------------------------------------------------------------
+// Roots (§4.2)
+// -----------------------------------------------------------------------------
+async function resolveRoots(internal, patterns) {
+    // Match root patterns against live paths IN SQL (SQLite regexp() / Postgres
+    // `~`), so a graph call never materializes the whole repo just to find its
+    // roots. Each gitignore-glob compiles to the same anchored regex source the
+    // scope/link-predicate compilers use.
+    const regexes = patterns.map((p) => `^${globToRegexSource(p)}$`);
+    const matchIds = await internal.storage.versions_live_document_ids_matching(internal.repo.id, regexes);
+    if (matchIds.length === 0)
+        return [];
+    // Roots are visible + filter-matching at $degrees = 0.
+    return visibleAt(internal, matchIds, 0);
+}
+async function expand(internal, roots) {
+    const admitted = new Map();
+    const admittedOrder = [];
+    // Admit roots (round 0), sorted by path for determinism.
+    const sortedRoots = [...roots].sort((a, b) => cmpPath(a.path, b.path));
+    let truncated = false;
+    let completeDegrees = 0;
+    for (const v of sortedRoots) {
+        if (admitted.size >= internal.maxDocuments) {
+            truncated = true;
+            break;
+        }
+        admitted.set(v.document_id, { degrees: 0, version: v });
+        admittedOrder.push(v.document_id);
+    }
+    // If roots themselves overflowed the budget, round 0 is incomplete.
+    if (truncated) {
+        completeDegrees = 0;
+        return finishState(admitted, admittedOrder, completeDegrees, truncated, [
+            // boundary = admitted round-0 docs (all potentially unexpanded)
+            ...admittedOrder,
+        ]);
+    }
+    completeDegrees = 0; // will bump to r on each clean round
+    let frontierIds = [...admittedOrder]; // round r-1's newly admitted docs
+    for (let r = 1; r <= internal.degrees; r++) {
+        if (frontierIds.length === 0) {
+            // Nothing left to expand — the whole reachable graph fits; complete
+            // through the requested degrees.
+            completeDegrees = internal.degrees;
+            break;
+        }
+        // Candidate neighbor document ids reached this round (not yet admitted).
+        const neighborIds = await neighborsOf(internal, frontierIds);
+        const fresh = [...new Set(neighborIds)].filter((id) => !admitted.has(id));
+        if (fresh.length === 0) {
+            // Ring r is empty: every neighbor already seen. Complete through r.
+            completeDegrees = r;
+            frontierIds = [];
+            continue;
+        }
+        // Visibility at this round ($degrees = r).
+        const visibleRows = await visibleAt(internal, fresh, r);
+        // Deterministic admission order within the round: by path.
+        visibleRows.sort((a, b) => cmpPath(a.path, b.path));
+        const admittedThisRound = [];
+        let roundCut = false;
+        for (const v of visibleRows) {
+            if (admitted.has(v.document_id))
+                continue;
+            if (admitted.size >= internal.maxDocuments) {
+                roundCut = true;
+                break;
+            }
+            admitted.set(v.document_id, { degrees: r, version: v });
+            admittedOrder.push(v.document_id);
+            admittedThisRound.push(v.document_id);
+        }
+        if (roundCut) {
+            // Budget cut this ring mid-way: the previous ring is the last exhaustive
+            // one (§4.4).
+            completeDegrees = r - 1;
+            truncated = true;
+            // Boundary = everything admitted this round PLUS the prior frontier
+            // (their onward links weren't fully enumerated) — but the frontier peek
+            // handles the general behavioral test, so return the admitted-this-round
+            // plus prior frontier as expansion candidates.
+            return finishState(admitted, admittedOrder, completeDegrees, truncated, [
+                ...admittedThisRound,
+                ...frontierIds,
+            ]);
+        }
+        // Clean ring.
+        completeDegrees = r;
+        frontierIds = admittedThisRound;
+    }
+    // Boundary docs whose onward links weren't enumerated: those admitted at the
+    // final requested degree (they were never expanded).
+    const boundaryIds = admittedOrder.filter((id) => admitted.get(id).degrees === internal.degrees);
+    return finishState(admitted, admittedOrder, completeDegrees, truncated, boundaryIds);
+}
+function finishState(admitted, admittedOrder, completeDegrees, truncated, boundaryIds) {
+    return {
+        admitted,
+        admittedOrder,
+        admittedIds: [...admitted.keys()],
+        completeDegrees,
+        truncated,
+        boundaryIds,
+    };
+}
+/**
+ * Distinct neighbor document ids of `sourceIds` under the direction lens,
+ * `fields`-filtered. Traversal only follows edges whose field passes `fields`.
+ */
+async function neighborsOf(internal, sourceIds) {
+    const adj = await adjacencyFor(internal, sourceIds);
+    const out = [];
+    for (const a of adj) {
+        // The "other end" relative to the seed set depends on which direction the
+        // edge was fetched for; adjacencyFor already orients this.
+        out.push(a.otherId);
+    }
+    return out;
+}
+/**
+ * Fetch adjacency for a seed set under the lens, `fields`-filtered, returning
+ * oriented links: `seedId` is the doc in the seed set, `otherId` the neighbor.
+ * For "both", out- and in-adjacency are unioned.
+ */
+async function adjacencyFor(internal, seedIds) {
+    const oriented = [];
+    const passesField = (field) => internal.fieldSet === null || internal.fieldSet.has(field);
+    if (internal.direction === "out" || internal.direction === "both") {
+        const rows = await internal.storage.links_adjacent_out(internal.repo.id, seedIds);
+        for (const r of rows) {
+            if (passesField(r.field)) {
+                oriented.push({ seedId: r.source_id, otherId: r.target_id, field: r.field });
+            }
+        }
+    }
+    if (internal.direction === "in" || internal.direction === "both") {
+        const rows = await internal.storage.links_adjacent_in(internal.repo.id, seedIds);
+        for (const r of rows) {
+            if (passesField(r.field)) {
+                oriented.push({ seedId: r.target_id, otherId: r.source_id, field: r.field });
+            }
+        }
+    }
+    return oriented;
+}
+// -----------------------------------------------------------------------------
+// Frontier (§4.5) — behavioral: admitted docs with ≥1 effective link to a
+// document not in the result.
+// -----------------------------------------------------------------------------
+async function computeFrontier(internal, bfs) {
+    if (bfs.boundaryIds.length === 0)
+        return [];
+    const boundary = [...new Set(bfs.boundaryIds)];
+    const oriented = await adjacencyFor(internal, boundary);
+    // Candidate neighbor ids not already in the result.
+    const neighborIds = new Set();
+    for (const o of oriented) {
+        if (!bfs.admitted.has(o.otherId))
+            neighborIds.add(o.otherId);
+    }
+    if (neighborIds.size === 0)
+        return [];
+    // Cheap visibility (§8 "start cheap"): a neighbor counts as potentially-new
+    // if it is scope+sigil visible (filter-unknown neighbors treated as
+    // potentially-new). This keeps the peek to one batched call.
+    const visibleNeighbors = await scopeVisible(internal, [...neighborIds]);
+    if (visibleNeighbors.size === 0)
+        return [];
+    const frontierDocIds = new Set();
+    for (const o of oriented) {
+        if (!bfs.admitted.has(o.otherId) && visibleNeighbors.has(o.otherId)) {
+            frontierDocIds.add(o.seedId);
+        }
+    }
+    const paths = [...frontierDocIds]
+        .map((id) => bfs.admitted.get(id).version.path)
+        .sort(cmpPath);
+    return paths;
+}
+// -----------------------------------------------------------------------------
+// Induced links (§4.6) — distinct (source, target, field) over admitted docs.
+// -----------------------------------------------------------------------------
+async function inducedLinks(internal, admittedIds) {
+    if (admittedIds.length === 0)
+        return { links: [], linksTruncated: false };
+    const admittedSet = new Set(admittedIds);
+    // One outbound pass over admitted sources; keep edges whose target is also
+    // admitted and whose field passes `fields`. Directional lens does not narrow
+    // the induced set — it is the complete picture over the shown documents.
+    const rows = await internal.storage.links_adjacent_out(internal.repo.id, admittedIds);
+    const passesField = (field) => internal.fieldSet === null || internal.fieldSet.has(field);
+    // Map document_id → path for the admitted set.
+    const pathById = await pathsForAdmitted(internal, admittedIds);
+    const seen = new Set();
+    const links = [];
+    for (const r of rows) {
+        if (!admittedSet.has(r.target_id))
+            continue;
+        if (!passesField(r.field))
+            continue;
+        const source = pathById.get(r.source_id);
+        const target = pathById.get(r.target_id);
+        if (source === undefined || target === undefined)
+            continue;
+        const field = r.field;
+        const key = `${source}${target}${field}`;
+        if (seen.has(key))
+            continue;
+        seen.add(key);
+        links.push({ source, target, field });
+    }
+    links.sort((a, b) => cmpPath(a.source, b.source) ||
+        cmpPath(a.target, b.target) ||
+        (a.field < b.field ? -1 : a.field > b.field ? 1 : 0));
+    if (links.length > LINKS_CEILING) {
+        return { links: links.slice(0, LINKS_CEILING), linksTruncated: true };
+    }
+    return { links, linksTruncated: false };
+}
+// Cache of admitted-doc paths keyed by the concrete BfsState.admitted map is
+// awkward to thread; recompute once here from storage in a single batch.
+async function pathsForAdmitted(internal, admittedIds) {
+    const rows = await internal.storage.versions_current_by_documents(internal.repo.id, admittedIds);
+    const map = new Map();
+    for (const r of rows)
+        map.set(r.document_id, r.path);
+    return map;
+}
+async function degreeCountsFor(internal, admittedIds) {
+    const result = new Map();
+    for (const id of admittedIds)
+        result.set(id, { links: 0, backlinks: 0 });
+    if (admittedIds.length === 0)
+        return result;
+    // All outbound + inbound adjacency of the admitted docs, unfiltered by
+    // `fields`/`filter`/`degrees` (decision 7). Collect the neighbor ids so we
+    // can apply scope-only visibility in one batch.
+    const outRows = await internal.storage.links_adjacent_out(internal.repo.id, admittedIds);
+    const inRows = await internal.storage.links_adjacent_in(internal.repo.id, admittedIds);
+    const neighborIds = new Set();
+    for (const r of outRows)
+        neighborIds.add(r.target_id);
+    for (const r of inRows)
+        neighborIds.add(r.source_id);
+    const visible = await scopeVisible(internal, [...neighborIds]);
+    // Distinct visible neighbor documents per admitted doc.
+    const outSets = new Map();
+    const inSets = new Map();
+    for (const id of admittedIds) {
+        outSets.set(id, new Set());
+        inSets.set(id, new Set());
+    }
+    for (const r of outRows) {
+        if (visible.has(r.target_id))
+            outSets.get(r.source_id)?.add(r.target_id);
+    }
+    for (const r of inRows) {
+        if (visible.has(r.source_id))
+            inSets.get(r.target_id)?.add(r.source_id);
+    }
+    for (const id of admittedIds) {
+        result.set(id, {
+            links: outSets.get(id)?.size ?? 0,
+            backlinks: inSets.get(id)?.size ?? 0,
+        });
+    }
+    return result;
+}
+// -----------------------------------------------------------------------------
+// Assembly (§4.8)
+// -----------------------------------------------------------------------------
+function assembleDocuments(internal, bfs, degreeCounts) {
+    const docs = [];
+    for (const [docId, { degrees, version }] of bfs.admitted) {
+        const counts = degreeCounts.get(docId) ?? { links: 0, backlinks: 0 };
+        const doc = {
+            $path: version.path,
+            $degrees: degrees,
+            $links: counts.links,
+            $backlinks: counts.backlinks,
+        };
+        for (const key of internal.select) {
+            const value = version.frontmatter[key];
+            if (value !== undefined)
+                doc[key] = value;
+        }
+        docs.push(doc);
+    }
+    docs.sort((a, b) => a.$degrees - b.$degrees || cmpPath(a.$path, b.$path));
+    return docs;
+}
+// -----------------------------------------------------------------------------
+// Ordering — stable, byte-for-byte deterministic (§2.2 "Ordering").
+// -----------------------------------------------------------------------------
+function cmpPath(a, b) {
+    return a < b ? -1 : a > b ? 1 : 0;
+}
+//# sourceMappingURL=graph.js.map

package/dist/kernel/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../src/kernel/graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAGjD,OAAO,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AACnD,OAAO,EAAqB,eAAe,EAAE,mBAAmB,EAAE,MAAM,iBAAiB,CAAC;AAC1F,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AACxD,OAAO,EAAmB,mBAAmB,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AAE3F,OAAO,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAChD,OAAO,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACjD,OAAO,EAAE,iBAAiB,EAAE,0BAA0B,EAAE,MAAM,iBAAiB,CAAC;AAGhF,6EAA6E;AAC7E,wEAAwE;AACxE,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,CAAC;AACjC,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,CAAC;AAC7B,MAAM,CAAC,MAAM,qBAAqB,GAAG,GAAG,CAAC;AACzC,MAAM,CAAC,MAAM,kBAAkB,GAAG,GAAG,CAAC;AACtC,MAAM,CAAC,MAAM,aAAa,GAAG,IAAI,CAAC;AAuBlC,MAAM,CAAC,KAAK,UAAU,QAAQ,CAC5B,MAA6B,EAC7B,IAAe,EACf,IAAe;IAEf,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzD,IAAI,CAAC,IAAI;QAAE,MAAM,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzC,IAAI,MAAM,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC;QAAE,MAAM,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAEjF,MAAM,QAAQ,GAAG,aAAa,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IAEzD,MAAM,YAAY,GAAG,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;IACjE,MAAM,WAAW,GAAgB;QAC/B,SAAS,EAAE,EAAE;QACb,KAAK,EAAE,EAAE;QACT,QAAQ,EAAE,EAAE;QACZ,gBAAgB,EAAE,CAAC;QACnB,SAAS,EAAE,KAAK;KACjB,CAAC;IAEF,sEAAsE;IACtE,sEAAsE;IACtE,MAAM,KAAK,GAAG,MAAM,YAAY,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;IACzD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,WAAW,CAAC;IAE3C,2EAA2E;IAC3E,MAAM,GAAG,GAAG,MAAM,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAE1C,oEAAoE;IACpE,8BAA8B;IAC9B,MAAM,QAAQ,GAAG,MAAM,eAAe,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;IAEtD,yEAAyE;IACzE,MAAM,EAAE,KAAK,EAAE,cAAc,EAAE,GAAG,MAAM,YAAY,CAAC,QAAQ,EAAE,GAAG,CAAC,WAAW,CAAC,CAAC;IAEhF,mEAAmE;IACnE,oDAAoD;IACpD,MAAM,YAAY,GAAG,MAAM,eAAe,CAAC,QAAQ,EAAE,GAAG,CAAC,WAAW,CAAC,CAAC;IAEtE,iFAAiF;IACjF,MAAM,SAAS,GAAG,iBAAiB,CAAC,QAAQ,EAAE,GAAG,EAAE,YAAY,CAAC,CAAC;IAEjE,OAAO;QACL,SAAS;QACT,KAAK;QACL,QAAQ;QACR,gBAAgB,EAAE,GAAG,CAAC,eAAe;QACrC,SAAS,EAAE,GAAG,CAAC,SAAS,IAAI,cAAc;KAC3C,CAAC;AACJ,CAAC;AAED,gFAAgF;AAChF,kCAAkC;AAClC,gFAAgF;AAEhF,MAAM,YAAY,GAAG,IAAI,GAAG,CAAkB;IAC5C,MAAM;IACN,OAAO;IACP,WAAW;IACX,SAAS;IACT,QAAQ;IACR,QAAQ;IACR,QAAQ;IACR,eAAe;CAChB,CAAC,CAAC;AAEH,SAAS,aAAa,CACpB,MAA6B,EAC7B,IAAe,EACf,IAAe,EACf,IAAa;IAEb,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QACpC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAsB,CAAC,EAAE,CAAC;YAC9C,MAAM,IAAI,WAAW,CAAC,gBAAgB,EAAE;gBACtC,MAAM,EAAE,4BAA4B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE;aAC1D,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,MAAM,CAAC;IAC3C,IAAI,SAAS,KAAK,KAAK,IAAI,SAAS,KAAK,IAAI,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;QACtE,MAAM,IAAI,WAAW,CAAC,gBAAgB,EAAE;YACtC,MAAM,EAAE,iDAAiD,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,GAAG;SACtF,CAAC,CAAC;IACL,CAAC;IAED,IAAI,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,eAAe,CAAC;IAC9C,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,OAAO,CAAC,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;QAClD,MAAM,IAAI,WAAW,CAAC,gBAAgB,EAAE;YACtC,MAAM,EAAE,+CAA+C,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG;SACvF,CAAC,CAAC;IACL,CAAC;IACD,IAAI,OAAO,GAAG,WAAW;QAAE,OAAO,GAAG,WAAW,CAAC;IAEjD,IAAI,YAAY,GAAG,IAAI,CAAC,aAAa,IAAI,qBAAqB,CAAC;IAC/D,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,YAAY,CAAC,IAAI,YAAY,IAAI,CAAC,EAAE,CAAC;QAC7D,MAAM,IAAI,WAAW,CAAC,gBAAgB,EAAE;YACtC,MAAM,EAAE,iDAAiD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG;SAC/F,CAAC,CAAC;IACL,CAAC;IACD,IAAI,YAAY,GAAG,kBAAkB;QAAE,YAAY,GAAG,kBAAkB,CAAC;IAEzE,kEAAkE;IAClE,4CAA4C;IAC5C,IAAI,QAAQ,GAA+B,IAAI,CAAC;IAChD,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QAC9B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,EAAE,CAAC;YAClF,MAAM,IAAI,WAAW,CAAC,gBAAgB,EAAE,EAAE,MAAM,EAAE,oCAAoC,EAAE,CAAC,CAAC;QAC5F,CAAC;QACD,QAAQ,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/E,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,CAAC,OAAO,CAAC,CAAC;IACxC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,EAAE,CAAC;QACxE,MAAM,IAAI,WAAW,CAAC,gBAAgB,EAAE,EAAE,MAAM,EAAE,oCAAoC,EAAE,CAAC,CAAC;IAC5F,CAAC;IACD,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QACzB,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,WAAW,CAAC,gBAAgB,EAAE;gBACtC,MAAM,EAAE,2DAA2D,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG;aAC1F,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,IAAI,SAA8B,CAAC;IACnC,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QAC9B,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrC,IAAI,CAAC,MAAM,CAAC,IAAI;YAAE,MAAM,IAAI,WAAW,CAAC,gBAAgB,EAAE,EAAE,MAAM,EAAE,cAAc,EAAE,CAAC,CAAC;QACtF,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC;IAC1B,CAAC;IAED,MAAM,eAAe,GAAG,mBAAmB,CACzC,IAAI,CAAC,gBAAgB,EACrB,iBAAiB,CAAC,IAAI,CAAC,WAAW,CAAC,CACpC,CAAC;IACF,MAAM,MAAM,GAAG,mBAAmB,CAAC,IAAI,CAAC,EAAE,EAAE,eAAe,CAAC,CAAC;IAC7D,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAEvC,OAAO;QACL,OAAO,EAAE,IAAI,CAAC,OAAO;QACrB,IAAI;QACJ,MAAM;QACN,KAAK;QACL,MAAM;QACN,SAAS;QACT,OAAO;QACP,YAAY;QACZ,QAAQ;QACR,SAAS;QACT,MAAM;KACP,CAAC;AACJ,CAAC;AAED,SAAS,cAAc,CAAC,KAAwB,EAAE,UAAsB;IACtE,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACpD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,EAAE,CAAC;QACjE,MAAM,IAAI,WAAW,CAAC,gBAAgB,EAAE;YACtC,MAAM,EAAE,+DAA+D;SACxE,CAAC,CAAC;IACL,CAAC;IACD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACpB,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,0BAA0B,CAAC,CAAC,EAAE,UAAU,CAAC,CACrE,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,SAAS,mBAAmB,CAAC,MAAc,EAAE,GAAe;IAC1D,MAAM,MAAM,GAAG,CAAC,GAAG,GAAG,CAAC,aAAa,EAAE,GAAG,GAAG,CAAC,aAAa,CAAC,CAAC;IAC5D,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACnC,OAAO,CAAC,EAAE,QAAQ,EAAE,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC;AAC1C,CAAC;AAED,SAAS,UAAU,CAAC,MAA6B,EAAE,IAAa;IAC9D,IAAI,MAAM,KAAK,IAAI;QAAE,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;IAClD,MAAM,MAAM,GAAG,mBAAmB,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;IACnD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;IACrD,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC;AACpC,CAAC;AAED,gFAAgF;AAChF,oDAAoD;AACpD,gFAAgF;AAEhF;;;;;;GAMG;AACH,MAAM,qBAAqB,GAAG,KAAK,CAAC;AAEpC,8DAA8D;AAC9D,SAAS,QAAQ,CAAC,GAAsB;IACtC,IAAI,GAAG,CAAC,MAAM,IAAI,qBAAqB;QAAE,OAAO,GAAG,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IACnF,MAAM,GAAG,GAAe,EAAE,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,qBAAqB,EAAE,CAAC;QAC3D,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,qBAAqB,CAAC,CAAC,CAAC;IACpD,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,KAAK,UAAU,SAAS,CACtB,QAAkB,EAClB,MAAyB,EACzB,OAAe;IAEf,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACnC,IAAI,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,UAAU;QAAE,OAAO,EAAE,CAAC;IAClD,MAAM,SAAS,GACb,QAAQ,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IAC1F,MAAM,GAAG,GAAiB,EAAE,CAAC;IAC7B,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;QACrC,MAAM,IAAI,GAAe;YACvB,QAAQ,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5B,iEAAiE;YACjE,KAAK,EAAE,KAAK,CAAC,MAAM;YACnB,UAAU,EAAE,SAAS;YACrB,MAAM,EAAE,QAAQ,CAAC,MAAM;YACvB,KAAK,EAAE,QAAQ,CAAC,KAAK;YACrB,sBAAsB,EAAE,KAAK;SAC9B,CAAC;QACF,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,QAAQ,CAAC,OAAO,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9D,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,KAAK,UAAU,YAAY,CAAC,QAAkB,EAAE,MAAyB;IACvE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,GAAG,EAAE,CAAC;IAC1C,IAAI,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,UAAU;QAAE,OAAO,IAAI,GAAG,EAAE,CAAC;IACzD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;QACrC,MAAM,IAAI,GAAe;YACvB,QAAQ,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5B,KAAK,EAAE,KAAK,CAAC,MAAM;YACnB,MAAM,EAAE,QAAQ,CAAC,MAAM;YACvB,KAAK,EAAE,QAAQ,CAAC,KAAK;YACrB,sBAAsB,EAAE,KAAK;SAC9B,CAAC;QACF,KAAK,MAAM,CAAC,IAAI,MAAM,QAAQ,CAAC,OAAO,CAAC,eAAe,CAAC,IAAI,CAAC;YAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;IAC3F,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,gFAAgF;AAChF,eAAe;AACf,gFAAgF;AAEhF,KAAK,UAAU,YAAY,CAAC,QAAkB,EAAE,QAAkB;IAChE,4EAA4E;IAC5E,2EAA2E;IAC3E,4EAA4E;IAC5E,sCAAsC;IACtC,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,iBAAiB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACjE,MAAM,QAAQ,GAAG,MAAM,QAAQ,CAAC,OAAO,CAAC,mCAAmC,CACzE,QAAQ,CAAC,IAAI,CAAC,EAAE,EAChB,OAAO,CACR,CAAC;IACF,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACrC,uDAAuD;IACvD,OAAO,SAAS,CAAC,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;AAC1C,CAAC;AAmBD,KAAK,UAAU,MAAM,CAAC,QAAkB,EAAE,KAAmB;IAC3D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoD,CAAC;IAC7E,MAAM,aAAa,GAAa,EAAE,CAAC;IAEnC,yDAAyD;IACzD,MAAM,WAAW,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACvE,IAAI,SAAS,GAAG,KAAK,CAAC;IACtB,IAAI,eAAe,GAAG,CAAC,CAAC;IAExB,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC5B,IAAI,QAAQ,CAAC,IAAI,IAAI,QAAQ,CAAC,YAAY,EAAE,CAAC;YAC3C,SAAS,GAAG,IAAI,CAAC;YACjB,MAAM;QACR,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC;QACxD,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;IACpC,CAAC;IACD,oEAAoE;IACpE,IAAI,SAAS,EAAE,CAAC;QACd,eAAe,GAAG,CAAC,CAAC;QACpB,OAAO,WAAW,CAAC,QAAQ,EAAE,aAAa,EAAE,eAAe,EAAE,SAAS,EAAE;YACtE,gEAAgE;YAChE,GAAG,aAAa;SACjB,CAAC,CAAC;IACL,CAAC;IACD,eAAe,GAAG,CAAC,CAAC,CAAC,qCAAqC;IAE1D,IAAI,WAAW,GAAG,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,kCAAkC;IACxE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,oEAAoE;YACpE,iCAAiC;YACjC,eAAe,GAAG,QAAQ,CAAC,OAAO,CAAC;YACnC,MAAM;QACR,CAAC;QACD,yEAAyE;QACzE,MAAM,WAAW,GAAG,MAAM,WAAW,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;QAC7D,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1E,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,oEAAoE;YACpE,eAAe,GAAG,CAAC,CAAC;YACpB,WAAW,GAAG,EAAE,CAAC;YACjB,SAAS;QACX,CAAC;QACD,2CAA2C;QAC3C,MAAM,WAAW,GAAG,MAAM,SAAS,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;QACxD,2DAA2D;QAC3D,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAEpD,MAAM,iBAAiB,GAAa,EAAE,CAAC;QACvC,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;YAC5B,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC;gBAAE,SAAS;YAC1C,IAAI,QAAQ,CAAC,IAAI,IAAI,QAAQ,CAAC,YAAY,EAAE,CAAC;gBAC3C,QAAQ,GAAG,IAAI,CAAC;gBAChB,MAAM;YACR,CAAC;YACD,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC;YACxD,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;YAClC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;QACxC,CAAC;QAED,IAAI,QAAQ,EAAE,CAAC;YACb,yEAAyE;YACzE,cAAc;YACd,eAAe,GAAG,CAAC,GAAG,CAAC,CAAC;YACxB,SAAS,GAAG,IAAI,CAAC;YACjB,oEAAoE;YACpE,wEAAwE;YACxE,yEAAyE;YACzE,+CAA+C;YAC/C,OAAO,WAAW,CAAC,QAAQ,EAAE,aAAa,EAAE,eAAe,EAAE,SAAS,EAAE;gBACtE,GAAG,iBAAiB;gBACpB,GAAG,WAAW;aACf,CAAC,CAAC;QACL,CAAC;QAED,cAAc;QACd,eAAe,GAAG,CAAC,CAAC;QACpB,WAAW,GAAG,iBAAiB,CAAC;IAClC,CAAC;IAED,6EAA6E;IAC7E,qDAAqD;IACrD,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,CACtC,CAAC,EAAE,EAAE,EAAE,CAAE,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAyB,CAAC,OAAO,KAAK,QAAQ,CAAC,OAAO,CAC/E,CAAC;IACF,OAAO,WAAW,CAAC,QAAQ,EAAE,aAAa,EAAE,eAAe,EAAE,SAAS,EAAE,WAAW,CAAC,CAAC;AACvF,CAAC;AAED,SAAS,WAAW,CAClB,QAA+D,EAC/D,aAAuB,EACvB,eAAuB,EACvB,SAAkB,EAClB,WAAqB;IAErB,OAAO;QACL,QAAQ;QACR,aAAa;QACb,WAAW,EAAE,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC;QACjC,eAAe;QACf,SAAS;QACT,WAAW;KACZ,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,KAAK,UAAU,WAAW,CAAC,QAAkB,EAAE,SAA4B;IACzE,MAAM,GAAG,GAAG,MAAM,YAAY,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;IACpD,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;QACpB,0EAA0E;QAC1E,2DAA2D;QAC3D,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;IACtB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAID;;;;GAIG;AACH,KAAK,UAAU,YAAY,CACzB,QAAkB,EAClB,OAA0B;IAE1B,MAAM,QAAQ,GAAmB,EAAE,CAAC;IACpC,MAAM,WAAW,GAAG,CAAC,KAAa,EAAW,EAAE,CAC7C,QAAQ,CAAC,QAAQ,KAAK,IAAI,IAAI,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAE7D,IAAI,QAAQ,CAAC,SAAS,KAAK,KAAK,IAAI,QAAQ,CAAC,SAAS,KAAK,MAAM,EAAE,CAAC;QAClE,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,OAAO,CAAC,kBAAkB,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;QAClF,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBACzB,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,SAAS,EAAE,OAAO,EAAE,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;YAC/E,CAAC;QACH,CAAC;IACH,CAAC;IACD,IAAI,QAAQ,CAAC,SAAS,KAAK,IAAI,IAAI,QAAQ,CAAC,SAAS,KAAK,MAAM,EAAE,CAAC;QACjE,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,OAAO,CAAC,iBAAiB,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;QACjF,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBACzB,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,SAAS,EAAE,OAAO,EAAE,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;YAC/E,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,gFAAgF;AAChF,0EAA0E;AAC1E,8BAA8B;AAC9B,gFAAgF;AAEhF,KAAK,UAAU,eAAe,CAAC,QAAkB,EAAE,GAAa;IAC9D,IAAI,GAAG,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAC5C,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC;IAC/C,MAAM,QAAQ,GAAG,MAAM,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IAExD,oDAAoD;IACpD,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC;YAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;IAC/D,CAAC;IACD,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEtC,4EAA4E;IAC5E,oEAAoE;IACpE,6DAA6D;IAC7D,MAAM,gBAAgB,GAAG,MAAM,YAAY,CAAC,QAAQ,EAAE,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;IACxE,IAAI,gBAAgB,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAE3C,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;YACpE,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IACD,MAAM,KAAK,GAAG,CAAC,GAAG,cAAc,CAAC;SAC9B,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAE,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAA6B,CAAC,OAAO,CAAC,IAAI,CAAC;SAC3E,IAAI,CAAC,OAAO,CAAC,CAAC;IACjB,OAAO,KAAK,CAAC;AACf,CAAC;AAED,gFAAgF;AAChF,8EAA8E;AAC9E,gFAAgF;AAEhF,KAAK,UAAU,YAAY,CACzB,QAAkB,EAClB,WAA8B;IAE9B,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,cAAc,EAAE,KAAK,EAAE,CAAC;IAC1E,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC;IACzC,2EAA2E;IAC3E,6EAA6E;IAC7E,yEAAyE;IACzE,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,OAAO,CAAC,kBAAkB,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC;IACtF,MAAM,WAAW,GAAG,CAAC,KAAa,EAAW,EAAE,CAC7C,QAAQ,CAAC,QAAQ,KAAK,IAAI,IAAI,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAE7D,+CAA+C;IAC/C,MAAM,QAAQ,GAAG,MAAM,gBAAgB,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;IAE/D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,KAAK,GAAgB,EAAE,CAAC;IAC9B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC;YAAE,SAAS;QAC5C,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC;YAAE,SAAS;QACpC,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QACzC,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QACzC,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS;YAAE,SAAS;QAC3D,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;QACtB,MAAM,GAAG,GAAG,GAAG,MAAM,IAAI,MAAM,IAAI,KAAK,EAAE,CAAC;QAC3C,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;IACxC,CAAC;IACD,KAAK,CAAC,IAAI,CACR,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC;QAC3B,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC;QAC3B,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CACvD,CAAC;IACF,IAAI,KAAK,CAAC,MAAM,GAAG,aAAa,EAAE,CAAC;QACjC,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC,EAAE,cAAc,EAAE,IAAI,EAAE,CAAC;IACxE,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,cAAc,EAAE,KAAK,EAAE,CAAC;AAC1C,CAAC;AAED,6EAA6E;AAC7E,yEAAyE;AACzE,KAAK,UAAU,gBAAgB,CAC7B,QAAkB,EAClB,WAA8B;IAE9B,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,OAAO,CAAC,6BAA6B,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC;IACjG,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,IAAI;QAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IACrD,OAAO,GAAG,CAAC;AACb,CAAC;AASD,KAAK,UAAU,eAAe,CAC5B,QAAkB,EAClB,WAA8B;IAE9B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAwB,CAAC;IAC/C,KAAK,MAAM,EAAE,IAAI,WAAW;QAAE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;IACzE,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC;IAE5C,uEAAuE;IACvE,2EAA2E;IAC3E,gDAAgD;IAChD,MAAM,OAAO,GAAG,MAAM,QAAQ,CAAC,OAAO,CAAC,kBAAkB,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC;IACzF,MAAM,MAAM,GAAG,MAAM,QAAQ,CAAC,OAAO,CAAC,iBAAiB,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC;IACvF,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,OAAO;QAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IACtD,KAAK,MAAM,CAAC,IAAI,MAAM;QAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IACrD,MAAM,OAAO,GAAG,MAAM,YAAY,CAAC,QAAQ,EAAE,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;IAE/D,wDAAwD;IACxD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC/C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC9C,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;QAC7B,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC3B,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IAC5B,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC;YAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAC3E,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC;YAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAC1E,CAAC;IACD,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;QAC7B,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE;YACb,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,IAAI,CAAC;YACjC,SAAS,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,IAAI,CAAC;SACrC,CAAC,CAAC;IACL,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,gFAAgF;AAChF,kBAAkB;AAClB,gFAAgF;AAEhF,SAAS,iBAAiB,CACxB,QAAkB,EAClB,GAAa,EACb,YAAuC;IAEvC,MAAM,IAAI,GAAoB,EAAE,CAAC;IACjC,KAAK,MAAM,CAAC,KAAK,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzD,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC;QACrE,MAAM,GAAG,GAAkB;YACzB,KAAK,EAAE,OAAO,CAAC,IAAI;YACnB,QAAQ,EAAE,OAAO;YACjB,MAAM,EAAE,MAAM,CAAC,KAAK;YACpB,UAAU,EAAE,MAAM,CAAC,SAAS;SAC7B,CAAC;QACF,KAAK,MAAM,GAAG,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;YAClC,MAAM,KAAK,GAAG,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;YACvC,IAAI,KAAK,KAAK,SAAS;gBAAE,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;QAC5C,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjB,CAAC;IACD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IAC1E,OAAO,IAAI,CAAC;AACd,CAAC;AAED,gFAAgF;AAChF,oEAAoE;AACpE,gFAAgF;AAEhF,SAAS,OAAO,CAAC,CAAS,EAAE,CAAS;IACnC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACpC,CAAC"}

package/dist/kernel/history.d.ts

@@ -0,0 +1,74 @@
+/**
+ * The `history` namespace (sync/history plan §3) — a top-level read surface
+ * keyed by position in the version log, spanning documents. `history.since` is
+ * the global change feed: it wraps `Storage.versions_since` (the gap-aware
+ * walk, §3.2) and enriches each settled row into a `VersionRef` — deriving
+ * `op` and resolving `prev_path` — so consumers never parse path sigils.
+ */
+import type { Storage } from "../storage/types.js";
+import type { HistoryIndexPage, HistorySincePage, VersionOp } from "./wire.js";
+/** Default feed page size when a caller omits `limit` (§3.3). */
+export declare const HISTORY_SINCE_DEFAULT_LIMIT = 500;
+/** Default `history.index` page size when a caller omits `limit` (§3.4). */
+export declare const HISTORY_INDEX_DEFAULT_LIMIT = 1000;
+/**
+ * Safety-window duration (§3.2): a gap's successor visible longer than this is
+ * treated as settled (the hole is burned, cross it); younger means the hole may
+ * still be committing (truncate before it). ~30s dwarfs any real write-tx.
+ */
+export declare const HISTORY_SAFETY_WINDOW_MS = 30000;
+/**
+ * Derive the operation a version row represents (§3.3): no prev → create; same
+ * path → update; a new path in the system namespace (a `:deleted/…` tombstone)
+ * → delete; any other new path → move.
+ */
+export declare function deriveOp(hasPrev: boolean, path: string, prevPath: string | null, isSystemPath: (p: string) => boolean): VersionOp;
+export type HistorySinceInput = {
+    after_version: string;
+    repo_id?: number;
+    limit: number;
+    now_ms: number;
+    window_ms: number;
+};
+export type HistorySinceDeps = {
+    storage: Storage;
+    /** repo id → slug, for stamping refs. */
+    repoSlug: (repoId: number) => string;
+    /** Whether a path lives in the system namespace (delete tombstones). */
+    isSystemPath: (path: string) => boolean;
+    /** Visibility gate: true when the caller may see this repo+path. */
+    canRead: (repoId: number, path: string) => boolean;
+};
+/**
+ * The global change feed. Advances the cursor to the storage safe frontier
+ * regardless of how many refs survive the visibility filter, so a caller with
+ * narrow scope still makes progress rather than stalling on hidden rows.
+ */
+export declare function runHistorySince(input: HistorySinceInput, deps: HistorySinceDeps): Promise<HistorySincePage>;
+export type HistoryIndexInput = {
+    repo_id: number;
+    through_version?: string;
+    after_version?: string;
+    limit: number;
+    now_ms: number;
+    window_ms: number;
+};
+export type HistoryIndexDeps = {
+    storage: Storage;
+    /** Exclude a path from the index (system/hidden namespaces, as query does). */
+    isExcluded: (path: string) => boolean;
+    /** Visibility gate for the caller's scope. */
+    canRead: (path: string) => boolean;
+};
+/**
+ * Page the live set as of a safe head `R` (§3.4). On the first call (no
+ * `through_version`) the server captures `R = versions_safe_head(...)` and
+ * echoes it; subsequent pages pass it back. Keyset over current-version id in
+ * `(after, R]`, never offset — a document updated mid-pagination gets a new id
+ * > R, drops out of the remaining pages, and is delivered by
+ * `history.since(R)` afterward. System/hidden paths and out-of-scope rows are
+ * dropped here (the storage page is lightweight and unfiltered), so a raw page
+ * may yield fewer visible items than `limit`; we keep pulling storage pages
+ * until we fill `limit` or reach R.
+ */
+export declare function runHistoryIndex(input: HistoryIndexInput, deps: HistoryIndexDeps): Promise<HistoryIndexPage>;