@intentius/chant 0.124.44 → 0.124.46

package/dist/cli/handlers/search-count.js

@@ -0,0 +1,132 @@
+import { terraformType } from "../../graph-effective.js";
+// The one reading of a terraform node's type lives with the folds that also
+// select on it, so `--count-by kind` and `kind:` cannot disagree (#4366).
+export { terraformType };
+/** The group a node with no value for the grouped dimension is counted under. */
+export const NONE_GROUP = "(none)";
+/** The module group of a Terraform block declared in the root module itself. */
+export const ROOT_MODULE_GROUP = "(root)";
+/** Parse a `--count-by` value, or say what the accepted spellings are. */
+export function parseCountBy(raw) {
+    const value = raw.trim();
+    if (value === "kind")
+        return { by: "kind" };
+    if (value === "module")
+        return { by: "module" };
+    const attr = /^attr:(.+)$/.exec(value);
+    if (attr && attr[1].trim())
+        return { by: "attr", name: attr[1].trim() };
+    return {
+        error: `--count-by "${raw}" is not a grouping`,
+        hint: "group by one of: --count-by kind, --count-by module, --count-by attr:<name>",
+    };
+}
+/** A Terraform node's root name, from its attrs or the first segment of its id. */
+function terraformRoot(n) {
+    const attrs = (n.attrs ?? {});
+    if (typeof attrs.root === "string")
+        return attrs.root;
+    const slash = n.id.indexOf("/");
+    return slash === -1 ? "" : n.id.slice(0, slash);
+}
+/**
+ * The module a Terraform node sits in: its call chain as Terraform writes it
+ * (`module.cdn`, `module.cdn.module.bucket`), or `(root)` for a block of the
+ * root module itself. The chain is on `attrs.callers`; an entity key
+ * `<root>/module.cdn/<address>` carries the same chain when it is absent.
+ */
+function terraformModule(n) {
+    const attrs = (n.attrs ?? {});
+    const callers = Array.isArray(attrs.callers)
+        ? attrs.callers.filter((c) => typeof c === "string")
+        : n.id.split("/").slice(1, -1);
+    return callers.length === 0 ? ROOT_MODULE_GROUP : callers.join(".");
+}
+/** An attribute's value as a group name, matched by exact name and then case-insensitively, as `--show` does. */
+function attrGroup(n, name) {
+    const attrs = (n.attrs ?? {});
+    const key = name in attrs ? name : Object.keys(attrs).find((k) => k.toLowerCase() === name.toLowerCase());
+    const v = key === undefined ? undefined : attrs[key];
+    if (v === undefined || v === null || v === "")
+        return NONE_GROUP;
+    return typeof v === "object" ? JSON.stringify(v) : String(v);
+}
+/**
+ * The group one node belongs to.
+ *
+ * `module` on a Terraform node is its call chain. When the graph holds more
+ * than one Terraform root, the chain is prefixed with the root (`app/(root)`,
+ * `net/module.vpc`): `module.vpc` in two roots is two modules, applied
+ * separately, and counting them as one would add up resources that never sit
+ * in the same state. A node of another lexicon groups under the composite that
+ * expanded it, chant's own unit of reuse, or `(none)`.
+ */
+export function groupOf(n, countBy, multiRoot = false) {
+    if (countBy.by === "kind")
+        return terraformType(n) ?? (n.kind || NONE_GROUP);
+    if (countBy.by === "attr")
+        return attrGroup(n, countBy.name);
+    if (n.lexicon === "terraform") {
+        const module = terraformModule(n);
+        return multiRoot ? `${terraformRoot(n) || NONE_GROUP}/${module}` : module;
+    }
+    return n.compositeParent || NONE_GROUP;
+}
+/** Whether the graph holds blocks from more than one Terraform root. */
+export function hasManyTerraformRoots(ir) {
+    const roots = new Set();
+    for (const n of ir.nodes)
+        if (n.lexicon === "terraform")
+            roots.add(terraformRoot(n));
+    return roots.size > 1;
+}
+/** Count `matches` per group, sorted by count (highest first) and then by name. */
+export function countGroups(matches, countBy, multiRoot = false) {
+    return groupMembers(matches, countBy, multiRoot).map(({ group, count }) => ({ group, count }));
+}
+/**
+ * The groups with the ids of the matches in each, in match order (#4382), in
+ * the order {@link countGroups} gives. `count` is always `ids.length`. A
+ * reader that draws the groups (behold#922) lights each group's nodes from
+ * `ids`, so it never has to read a node's group itself.
+ */
+export function groupMembers(matches, countBy, multiRoot = false) {
+    const ids = new Map();
+    for (const n of matches) {
+        const g = groupOf(n, countBy, multiRoot);
+        const list = ids.get(g);
+        if (list)
+            list.push(n.id);
+        else
+            ids.set(g, [n.id]);
+    }
+    return [...ids]
+        .map(([group, members]) => ({ group, count: members.length, ids: members }))
+        .sort((a, b) => b.count - a.count || (a.group < b.group ? -1 : a.group > b.group ? 1 : 0));
+}
+export function countsJson(query, source, groups, countBy, liveFailures = []) {
+    return {
+        query,
+        source,
+        countBy: countByLabel(countBy),
+        groups,
+        total: groups.reduce((sum, g) => sum + g.count, 0),
+        ...(liveFailures.length > 0 ? { liveFailures } : {}),
+    };
+}
+/** The label a `--count-by` value is printed with on the total line. */
+function countByLabel(countBy) {
+    return countBy.by === "attr" ? `attr:${countBy.name}` : countBy.by;
+}
+/**
+ * Render grouped counts: one `<count>  <group>` line per group, counts right
+ * aligned, then the total. The total is the number of matches, which is the
+ * sum of the group counts by construction.
+ */
+export function formatCounts(groups, countBy) {
+    const total = groups.reduce((sum, g) => sum + g.count, 0);
+    const width = String(groups[0]?.count ?? 0).length;
+    const lines = groups.map((g) => `${String(g.count).padStart(width)}  ${g.group}`);
+    lines.push(`— ${total} total · ${groups.length} group${groups.length === 1 ? "" : "s"} by ${countByLabel(countBy)}`);
+    return lines;
+}

package/dist/cli/handlers/search.d.ts

@@ -1,9 +1,12 @@
 import { type GraphIR, type IRNode } from "../../graph-ir.js";
+import type { CapabilityPack, View } from "../../capabilities/view.js";
 import { type LiveDiffResult } from "../../lifecycle/live-diff.js";
 import type { LiveObservation } from "../../graph-ir.js";
 import type { ResourceMetadata } from "../../lexicon.js";
 import type { ObservationDepth } from "../../lifecycle/types.js";
+import { type CountBy } from "./search-count.js";
 import type { CommandContext } from "../registry.js";
+import { type SearchErrorCode, type SearchFailure } from "../../workspace/search-contract.js";
 /**
  * `chant search <query> [--live --env <name>]` — answer an estate question with
  * a COMPACT result instead of the whole graph. The point (measured on aws-bench,
@@ -12,11 +15,14 @@ import type { CommandContext } from "../registry.js";
  *
  * Query grammar (space-separated terms, all must match — AND):
  *   bare word            case-insensitive substring over id, kind, and attrs
- *   kind:<substr>        node kind contains <substr> (e.g. kind:EC2::Instance)
+ *   kind:<substr>        node kind contains <substr> (e.g. kind:EC2::Instance);
+ *                        on a terraform resource, its type (kind:aws_instance, kind:aws_iam_)
  *   tag:<key>=<val>      a Tags entry with Key=key and Value containing val
  *   attr:<name>=<val>    attribute <name> equals/contains <val>
  *   ->kind:X / ->attr:.. this node has an edge TO a node matching the right side
  *   <-kind:X / <-attr:.. this node has an edge FROM a node matching the right side
+ *   ->*X, ->{n}X, ->{m,n}X  the far end is any depth / n / m..n hops away (#4359)
+ *   ->[via=a]X, ->[to=a]X   only edges through consumer attr a / reading producer attr a
  *
  * The edge operators are the point of "edge-aware" search (#1139): a small
  * model shouldn't hand-join instance→subnet→public across many results — one
@@ -28,13 +34,96 @@ import type { CommandContext } from "../registry.js";
  * thousands.
  */
 export declare function runSearch(ctx: CommandContext): Promise<number>;
+/** A search's arguments refused before anything is read, or its parsed terms and grouping. */
+export type SearchArgsCheck = {
+    error: {
+        code: SearchErrorCode;
+        message: string;
+        hint?: string;
+    };
+} | {
+    terms: Term[];
+    countBy?: CountBy;
+};
+/**
+ * Check a search's query and flags before anything is read (#4374): the
+ * grammar, `--count-by`, and the flags that need or exclude each other. The
+ * rules `chant search` and `chant workspace search` share, so the workspace
+ * form refuses once, with the same code and message, instead of once per
+ * member. `snapshot` is the snapshot asked for and the flag that asked:
+ * `--snapshot`, or plain search's `--at`.
+ */
+export declare function checkSearchArgs(args: {
+    countBy?: string;
+    checkLive?: boolean;
+    checkSnapshot?: boolean;
+    failOnDrift?: boolean;
+    live?: boolean;
+    env?: string;
+}, query: string, snapshot: {
+    ref?: string;
+    flag: string;
+}): SearchArgsCheck;
+/**
+ * Print the capability catalog (#4375): the `capabilities` document under
+ * `--json`, a line per capability otherwise. It takes no query and no other
+ * search flag, since it answers nothing about the estate. Shared by `chant
+ * search` and `chant workspace search`, which differ only in the lexicons
+ * they report on.
+ */
+export declare function printCapabilities(args: {
+    json?: boolean;
+    live?: boolean;
+    env?: string;
+    snapshot?: string;
+    at?: string;
+    countBy?: string;
+    explain?: boolean;
+    show?: string;
+}, query: string, lexicons: string[]): Promise<number>;
+/**
+ * Answer capability terms over a graph that is not this project's own (#4375):
+ * `chant workspace search` composes its members' graphs and views and asks
+ * here, so the rules run once over the whole of it. Given packs, the view is
+ * built here; given a view, it is the one the members' own chants mapped
+ * (#4378). Returns the rows
+ * as `--json` carries them, or the refusal for a capability the query names
+ * wrongly.
+ */
+export declare function answerOverGraph(ir: GraphIR, terms: Term[], query: string, packsOrView: CapabilityPack[] | View): {
+    matches: SearchJson["matches"];
+    capabilities: NonNullable<SearchJson["capabilities"]>;
+} | {
+    error: {
+        message: string;
+        hint?: string;
+    };
+};
+/** Whether a term, or the leaf under it, names a capability (#4375). */
+export declare function usesCapability(t: Term): boolean;
+/**
+ * Which read answered a live search's matches, when the lexicon reports it
+ * (#2267) and at least one answer came from the plan (#4384). Absent for a
+ * plain live or state answer, so those documents are unchanged.
+ */
+export interface ReadDepth {
+    /** `plan` or `live+plan` when every read match came that way, else `mixed`. */
+    depth?: "plan" | "live+plan" | "mixed";
+    /** The distinct reads that answered the matches, sorted. */
+    reads?: string[];
+    /** The plan read was asked for and failed: the read that answered instead. */
+    planFellBackTo?: "state" | "live" | "declared";
+}
 /** Where an answer's facts came from, for the provenance line (#1266). */
-type AnswerSource = {
+export type AnswerSource = {
     kind: "declared";
-} | {
+} | ({
     kind: "live";
-} | {
+} & ReadDepth)
+/** `snapshot` is the ref asked for (`latest`), `commit` the snapshot commit it named (#4374). */
+ | {
     kind: "snapshot";
+    snapshot?: string;
     commit: string;
     timestamp: string;
 };
@@ -96,7 +185,9 @@ declare function ambientHint(matches: IRNode[], ambientKinds: string[], asked: b
  * already done. That is a fact about the query, printed for every query, and it
  * encodes no expected answer.
  */
-declare function provenance(matches: IRNode[], source: AnswerSource, recorded?: string, liveFailures?: string[]): void;
+declare function provenanceLine(matches: IRNode[], source: AnswerSource, recorded?: string, liveFailures?: string[], derived?: string[]): string;
+/** Print {@link provenanceLine}: the text footer. */
+declare function provenance(matches: IRNode[], source: AnswerSource, recorded?: string, liveFailures?: string[], derived?: string[]): void;
 /** Union `LiveObservation.resources` across lexicons into one name-keyed map. */
 declare function mergeResources(observations: LiveObservation[]): Record<string, ResourceMetadata>;
 /** Restrict a name-keyed map to the matched ids — the whole of "query-scoped". */
@@ -112,6 +203,40 @@ declare function pickResources<T>(map: Record<string, T>, ids: Set<string>): Rec
  * look — stays distinct from both, the same #1089 tri-state everywhere else.
  */
 declare function renderDrift(diff: LiveDiffResult, checked: number, direction: "live" | "snapshot", depth?: ObservationDepth): number;
+/** The query-scoped drift check as `--json` carries it (#4367). See {@link SearchJson}. */
+export interface SearchDriftJson {
+    against: "live" | "snapshot";
+    /** Matched rows checked. */
+    checked?: number;
+    /** Rows that drifted: missing + orphan + disappeared + drifted, as the text summary counts. */
+    count?: number;
+    missing?: string[];
+    orphan?: string[];
+    disappeared?: string[];
+    drifted?: {
+        id: string;
+        path: string;
+        old?: unknown;
+        new?: unknown;
+    }[];
+    newlyObserved?: string[];
+    runtimeChildren?: {
+        id: string;
+        type: string;
+        owner: string;
+    }[];
+    unobserved?: {
+        id: string;
+        type?: string;
+        reason: string;
+        detail?: string;
+    }[];
+    /** The snapshot was recorded deeper than the identity-level comparison made here. */
+    depth?: ObservationDepth;
+    /** --check-snapshot found no snapshot to check against: the reason, and no other field. */
+    unavailable?: string;
+}
+declare function searchDriftJson(diff: LiveDiffResult, checked: number, against: "live" | "snapshot", depth?: ObservationDepth): SearchDriftJson;
 /**
  * Name the facts chant computed for the kinds in this result that the query did not use.
  *
@@ -135,6 +260,29 @@ declare function derivedSurface(terms: Term[], matches: IRNode[], ir: GraphIR, b
  * any expected answer, so it stays a fair, question-agnostic capability.
  */
 declare function explain(terms: Term[], matches: IRNode[], ir: GraphIR, byId: Map<string, IRNode>, query: string): void;
+/**
+ * The facts behind the `--explain` footer, shared by the text and `--json`
+ * (#4367). The universe is every node of the matched kinds (every node when
+ * nothing matched); a near-miss is a node of that universe the query
+ * excluded, with the first term it fails.
+ */
+declare function explainData(terms: Term[], matches: IRNode[], ir: GraphIR, byId: Map<string, IRNode>): {
+    universe: {
+        matched: number;
+        of: number;
+        kinds: string[];
+    };
+    evidence: {
+        id: string;
+        attr: string;
+        via: string;
+    }[];
+    nearMisses: {
+        id: string;
+        term?: Term;
+    }[];
+    moreExcluded: number;
+};
 /**
  * On a miss, name the attributes the queried kind actually carries. A graph knows
  * its own schema, so a caller who guessed an attribute name — or did not know a
@@ -145,8 +293,129 @@ declare function explain(terms: Term[], matches: IRNode[], ir: GraphIR, byId: Ma
  */
 declare function availableAttrs(terms: Term[], ir: GraphIR): void;
 declare function describeTerm(t: Term): string;
+/**
+ * `chant search --json` (#4359, #4367): the whole answer as one document on
+ * stdout, read by behold (behold#913). Warnings and errors still go to stderr;
+ * the exit code is the text path's. It is the `search` document of the read
+ * contract (#4374, `workspace/search.schema.json`): every document opens with
+ * `$schema`, `contract` and `chant`, then `workspace` when the project belongs
+ * to one, and `at: null`, since plain search reads the working tree.
+ *
+ *   {
+ *     "$schema": "https://intentius.io/chant/schemas/workspace/search/v1/search.schema.json",
+ *     "contract": 1, "chant": "0.124.46", "workspace"?: { "name", "root" }, "at": null,
+ *     "query": "kind:aws_instance ->*kind:aws_vpc",
+ *     "source": { "kind": "declared" | "live" | "snapshot", "env"?, "snapshot"?, "commit"?, "timestamp"? },
+ *     "matches": [
+ *       { "id": "east::web", "displayId": "web", "kind": "Terraform::Resource", "physicalId"?: "i-1",
+ *         "unobserved"?: "read-failed", "show"?: { "InstanceType": "t3.micro" },
+ *         "paths": [ { "term": "->*kind:aws_vpc", "dir": "out",
+ *                      "hops": [ { "from": "web", "fromAttr": "subnet_id", "to": "a", "toAttr": "id" },
+ *                                { "from": "a", "fromAttr": "vpc_id", "to": "main", "toAttr": "id" } ] } ] }
+ *     ],
+ *     "provenance": "observed live · bound 2/2",
+ *     "liveFailures"?: ["aws: ..."],
+ *     "explain"?: { "universe": { "matched": 2, "of": 6, "kinds": ["aws_instance"] },
+ *                   "evidence": [ { "id": "web", "attr": "internetFacing", "via": "..." } ],
+ *                   "nearMisses": [ { "id": "db", "fails": "attr:internetFacing=true" } ],
+ *                   "moreExcluded": 0 },
+ *     "drift"?: { "against": "live" | "snapshot", ... see SearchDriftJson }
+ *   }
+ *
+ * A refused query or invocation prints the head, `query` and
+ * `error: { code, message, hint? }` instead, and exits 1. The code is from the
+ * read contract's closed list (`SEARCH_ERROR_CODES`).
+ *
+ * `kind` is the IR kind, so a Terraform block's is `Terraform::Resource`;
+ * `kind:aws_instance` matches it by its resource type (#4366).
+ *
+ * `id` is the graph's full id, stack-qualified (`stack::name`) where the graph
+ * qualifies it; `displayId` is the bare name the text row prints. `hops` is in
+ * walk order from the match; each hop keeps the edge's own direction (see
+ * {@link PathHop}). `paths` is empty when the query has no positive edge
+ * term. `show` is present when `--show` was given, holding the requested
+ * attributes a row carries, under the name the graph spells them with.
+ * `explain` is present with `--explain`; `drift` with `--check-live` or
+ * `--check-snapshot`.
+ */
+export interface SearchJson {
+    query: string;
+    source: AnswerSource & {
+        env?: string;
+    };
+    matches: {
+        id: string;
+        displayId: string;
+        kind?: string;
+        physicalId?: string;
+        unobserved?: string;
+        show?: Record<string, unknown>;
+        paths: {
+            term: string;
+            dir: "out" | "in";
+            hops: PathHop[];
+            because?: {
+                capability: string;
+                id: string;
+                hops: PathHop[];
+            }[];
+        }[];
+    }[];
+    provenance?: string;
+    /** Present when every match is a planned create (#4372): how many. See the schema. */
+    plannedCreates?: number;
+    liveFailures?: string[];
+    explain?: {
+        universe: {
+            matched: number;
+            of: number;
+            kinds: string[];
+        };
+        evidence: {
+            id: string;
+            attr: string;
+            via: string;
+        }[];
+        nearMisses: {
+            id: string;
+            fails?: string;
+        }[];
+        moreExcluded: number;
+    };
+    drift?: SearchDriftJson;
+    /**
+     * Present when the query names a capability (#4375): each one, the
+     * observation its facts were derived from, and what it does not evaluate.
+     */
+    capabilities?: {
+        name: string;
+        source: AnswerSource["kind"];
+        notEvaluated: string[];
+    }[];
+}
+/**
+ * A refusal under `--json` (#4367): the same message and hint stderr carries,
+ * with its code from the read contract's closed list (#4374).
+ */
+export type SearchErrorJson = SearchFailure;
+declare function searchErrorJson(query: string, error: {
+    code: SearchErrorCode;
+    message: string;
+    hint?: string;
+}): SearchErrorJson;
+declare function searchJson(query: string, source: AnswerSource, matches: IRNode[], terms: Term[], ir: GraphIR, byId: Map<string, IRNode>, liveFailures?: string[], extra?: {
+    env?: string;
+    show?: string[];
+    provenance?: string;
+    plannedCreates?: number;
+    capabilities?: SearchJson["capabilities"];
+    explain?: ReturnType<typeof explainData>;
+    drift?: SearchDriftJson;
+}): SearchJson;
+/** A term as the query grammar spells it, `!` and ASCII arrows included (#4367). */
+declare function termText(t: Term): string;
 export interface Term {
-    kind: "word" | "kind" | "tag" | "attr" | "edge";
+    kind: "word" | "kind" | "tag" | "attr" | "edge" | "cap";
     /** `!term` — the node must NOT satisfy this (#1280). */
     negated?: boolean;
     a: string;
@@ -154,12 +423,36 @@ export interface Term {
     /** For edge terms: the direction and the sub-predicate matched at the far end. */
     dir?: "out" | "in";
     sub?: Term;
+    /**
+     * For edge terms (#4359): how many hops the far end may be away. Absent on a
+     * plain `->`/`<-`, which is exactly one hop. `max` is `Infinity` for `*`.
+     */
+    depth?: {
+        min: number;
+        max: number;
+    };
+    /** For edge terms (#4359): every edge on the path goes through this consumer attribute (`IREdge.viaAttr`). */
+    viaAttr?: string;
+    /** For edge terms (#4359): every edge on the path reads this producer attribute (`IREdge.toAttr`). */
+    toAttr?: string;
+    /**
+     * For edge terms (#4375): walk this edge capability (`reaches`,
+     * `grants(s3:GetObject)`) instead of the graph's own edges. A `cap:` leaf
+     * keeps its call in `a`.
+     */
+    capability?: string;
     /**
      * For kind terms: the kinds this term actually means, resolved against the
      * graph (see {@link resolveKindTerms}). Absent when nothing resolved it, in
      * which case the substring rule applies unchanged.
      */
     kinds?: Set<string>;
+    /**
+     * For kind terms (#4366): the terraform resource types this term means,
+     * resolved against the graph. A terraform resource matches the term when its
+     * type is in here, whatever `kinds` says.
+     */
+    tfTypes?: Set<string>;
 }
 /**
  * Decide which kinds a `kind:` term means, given what is in the graph.
@@ -182,15 +475,72 @@ export interface Term {
  * Substring is kept as the fallback, so `kind:Gateway` still finds both
  * `InternetGateway` and `VPCGatewayAttachment` — a genuine substring search
  * that no segment rule would serve. Most specific wins; nothing else changes.
+ *
+ * A terraform resource is `Terraform::Resource` whatever it is, so the term is
+ * also read against each resource's type (#4366), with the same boundary rule
+ * on `_`: `kind:aws_iam_role` means that type exactly and never
+ * `aws_iam_role_policy`, and a term ending in `_` (`kind:aws_iam_`) or a bare
+ * provider name (`kind:aws`) means every type it begins. A data source's type
+ * keeps its `data.` prefix (`kind:data.aws_ami`), the same type `--count-by kind`
+ * groups it under, so `kind:aws_ami` is not a data source. A term that names a
+ * type turns off the substring fallback for the IR kind, so `kind:aws_instance`
+ * is the instances and nothing found by accident.
  */
 export declare function resolveKindTerms(terms: Term[], nodes: IRNode[]): void;
 declare function parseQuery(query: string): Term[];
 declare function matchTerm(n: IRNode, t: Term, ir?: GraphIR, byId?: Map<string, IRNode>): boolean;
+/**
+ * One edge on the path a match was reached by (#4359), in walk order from the
+ * match outward. `from` and `to` keep the edge's own direction (`from` holds
+ * the reference, `to` is what it names), whichever way the term walked, so a
+ * reader can find the edge in the graph by its endpoints. Node ids are the
+ * graph's full ids, stack qualification included.
+ */
+export interface PathHop {
+    from: string;
+    /** The consumer attribute the reference flows through (`IREdge.viaAttr`), when known. */
+    fromAttr?: string;
+    to: string;
+    /** The producer attribute read (`IREdge.toAttr`), when known. */
+    toAttr?: string;
+    /**
+     * On a capability's path (#4375): the name the capability rules give this
+     * edge (`subnet`, `statement`, `resource`). Its `from` may be a node inside
+     * another (a policy statement, `<holder>#policy[0].Statement[1]`).
+     */
+    edge?: string;
+}
+/**
+ * The shortest path by which an edge term reaches `n` (#4359), or null.
+ *
+ * Breadth-first over the edges in the term's direction, keeping only edges
+ * whose attributes satisfy its qualifier, and accepting a node that satisfies
+ * the target leaf (any node when the term has none) at a depth inside the
+ * term's range. A plain `->`/`<-` is the range 1..1.
+ *
+ * Termination on a cycle: a state is (node, depth capped at the range's
+ * minimum). Past the minimum, arriving at a node again by a longer walk can
+ * reach nothing the first arrival could not, so it is not queued twice. The
+ * state space is finite and the walk always ends.
+ */
+declare function findPath(n: IRNode, t: Term, ir: GraphIR, byId: Map<string, IRNode>): PathHop[] | null;
+/**
+ * A path as one line of `id.attr` steps, read from the match outward (#4359).
+ * Walking `->`, each hop reads `consumer.via -> producer.attr`; walking `<-`,
+ * `producer.attr <- consumer.via`. Hops are joined with `; `.
+ */
+declare function formatPath(hops: PathHop[], dir: "out" | "in"): string;
 declare function formatRow(n: IRNode, show: string[]): string;
 /** Internals exposed for unit tests. */
 export declare const __searchInternals: {
     parseQuery: typeof parseQuery;
     matchTerm: typeof matchTerm;
+    findPath: typeof findPath;
+    formatPath: typeof formatPath;
+    searchJson: typeof searchJson;
+    searchErrorJson: typeof searchErrorJson;
+    explainData: typeof explainData;
+    termText: typeof termText;
     formatRow: typeof formatRow;
     explain: typeof explain;
     describeTerm: typeof describeTerm;
@@ -200,7 +550,9 @@ export declare const __searchInternals: {
     regionSpread: typeof regionSpread;
     showMiss: typeof showMiss;
     provenance: typeof provenance;
+    provenanceLine: typeof provenanceLine;
     renderDrift: typeof renderDrift;
+    searchDriftJson: typeof searchDriftJson;
     mergeResources: typeof mergeResources;
     pickResources: typeof pickResources;
 };

package/dist/cli/handlers/search.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"search.d.ts","sourceRoot":"","sources":["../../../src/cli/handlers/search.ts"],"names":[],"mappings":"AAEA,OAAO,EAA0E,KAAK,OAAO,EAAE,KAAK,MAAM,EAAe,MAAM,gBAAgB,CAAC;AAQhJ,OAAO,EAAY,KAAK,cAAc,EAAE,MAAM,2BAA2B,CAAC;AAC1E,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AACtD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAC;AACtD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAK9D,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAElD;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAsB,SAAS,CAAC,GAAG,EAAE,cAAc,GAAG,OAAO,CAAC,MAAM,CAAC,CA+VpE;AAGD,0EAA0E;AAC1E,KAAK,YAAY,GACb;IAAE,IAAI,EAAE,UAAU,CAAA;CAAE,GACpB;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,GAChB;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,CAAC;AAK5D;;;;;;;;GAQG;AACH,iBAAS,QAAQ,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,IAAI,CAQzD;AAED;;;;;;;;;;;;;GAaG;AACH,iBAAS,YAAY,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,IAAI,CAW5E;AAED;;;;;;;;;;;;;;GAcG;AACH,iBAAS,WAAW,CAClB,OAAO,EAAE,MAAM,EAAE,EACjB,YAAY,EAAE,MAAM,EAAE,EACtB,KAAK,EAAE,OAAO,EACd,MAAM,CAAC,EAAE;IAAE,eAAe,EAAE,OAAO,CAAA;CAAE,GACpC,IAAI,CAuBN;AAED;;;;;;;;;;;;;;GAcG;AACH,iBAAS,UAAU,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,YAAY,EAAE,QAAQ,CAAC,EAAE,MAAM,EAAE,YAAY,GAAE,MAAM,EAAO,GAAG,IAAI,CA6CjH;AAED,iFAAiF;AACjF,iBAAS,cAAc,CAAC,YAAY,EAAE,eAAe,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAIzF;AAED,kFAAkF;AAClF,iBAAS,aAAa,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAIrF;AAED;;;;;;;;;GASG;AACH,iBAAS,WAAW,CAClB,IAAI,EAAE,cAAc,EACpB,OAAO,EAAE,MAAM,EACf,SAAS,EAAE,MAAM,GAAG,UAAU,EAC9B,KAAK,CAAC,EAAE,gBAAgB,GACvB,MAAM,CAmBR;AASD;;;;;;;;;;;GAWG;AACH,iBAAS,cAAc,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,MAAM,UAAO,GAAG,IAAI,CAgB1F;AAED;;;;;;;;GAQG;AACH,iBAAS,OAAO,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAyB9G;AAED;;;;;;;GAOG;AACH,iBAAS,cAAc,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,OAAO,GAAG,IAAI,CAiCxD;AAED,iBAAS,YAAY,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CASrC;AAED,MAAM,WAAW,IAAI;IACnB,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,KAAK,GAAG,MAAM,GAAG,MAAM,CAAC;IAChD,wDAAwD;IACxD,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,kFAAkF;IAClF,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC;IACnB,GAAG,CAAC,EAAE,IAAI,CAAC;IACX;;;;OAIG;IACH,KAAK,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;CACrB;AAED;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,IAAI,CAiBrE;AA2CD,iBAAS,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,EAAE,CA+CzC;AAeD,iBAAS,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,OAAO,CAmCxF;AAED,iBAAS,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,CA+BpD;AAED,wCAAwC;AACxC,eAAO,MAAM,iBAAiB;;;;;;;;;;;;;;;CAA2L,CAAC"}
+{"version":3,"file":"search.d.ts","sourceRoot":"","sources":["../../../src/cli/handlers/search.ts"],"names":[],"mappings":"AAEA,OAAO,EAA0E,KAAK,OAAO,EAAE,KAAK,MAAM,EAAe,MAAM,gBAAgB,CAAC;AAKhJ,OAAO,KAAK,EAAE,cAAc,EAAE,IAAI,EAAE,MAAM,yBAAyB,CAAC;AAMpE,OAAO,EAAY,KAAK,cAAc,EAAE,MAAM,2BAA2B,CAAC;AAC1E,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AACtD,OAAO,KAAK,EAAiB,gBAAgB,EAAE,MAAM,eAAe,CAAC;AACrE,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAM9D,OAAO,EAA4F,KAAK,OAAO,EAAE,MAAM,gBAAgB,CAAC;AAExI,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAClD,OAAO,EAAoD,KAAK,eAAe,EAAE,KAAK,aAAa,EAAmB,MAAM,iCAAiC,CAAC;AAE9J;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,wBAAsB,SAAS,CAAC,GAAG,EAAE,cAAc,GAAG,OAAO,CAAC,MAAM,CAAC,CA4ZpE;AAGD,8FAA8F;AAC9F,MAAM,MAAM,eAAe,GACvB;IAAE,KAAK,EAAE;QAAE,IAAI,EAAE,eAAe,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,CAAA;KAAE,CAAA;CAAE,GACpE;IAAE,KAAK,EAAE,IAAI,EAAE,CAAC;IAAC,OAAO,CAAC,EAAE,OAAO,CAAA;CAAE,CAAC;AAEzC;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAC7B,IAAI,EAAE;IAAE,OAAO,CAAC,EAAE,MAAM,CAAC;IAAC,SAAS,CAAC,EAAE,OAAO,CAAC;IAAC,aAAa,CAAC,EAAE,OAAO,CAAC;IAAC,WAAW,CAAC,EAAE,OAAO,CAAC;IAAC,IAAI,CAAC,EAAE,OAAO,CAAC;IAAC,GAAG,CAAC,EAAE,MAAM,CAAA;CAAE,EAC7H,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE;IAAE,GAAG,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GACvC,eAAe,CAkEjB;AAyCD;;;;;;GAMG;AACH,wBAAsB,iBAAiB,CACrC,IAAI,EAAE;IAAE,IAAI,CAAC,EAAE,OAAO,CAAC;IAAC,IAAI,CAAC,EAAE,OAAO,CAAC;IAAC,GAAG,CAAC,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAAC,EAAE,CAAC,EAAE,MAAM,CAAC;IAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAAC,OAAO,CAAC,EAAE,OAAO,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAA;CAAE,EAC1I,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,MAAM,EAAE,GACjB,OAAO,CAAC,MAAM,CAAC,CAuBjB;AA2CD;;;;;;;;GAQG;AACH,wBAAgB,eAAe,CAC7B,EAAE,EAAE,OAAO,EACX,KAAK,EAAE,IAAI,EAAE,EACb,KAAK,EAAE,MAAM,EACb,WAAW,EAAE,cAAc,EAAE,GAAG,IAAI,GACnC;IAAE,OAAO,EAAE,UAAU,CAAC,SAAS,CAAC,CAAC;IAAC,YAAY,EAAE,WAAW,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC,CAAA;CAAE,GAAG;IAAE,KAAK,EAAE;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,CAAA;KAAE,CAAA;CAAE,CAU3I;AAED,wEAAwE;AACxE,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO,CAE/C;AA0DD;;;;GAIG;AACH,MAAM,WAAW,SAAS;IACxB,+EAA+E;IAC/E,KAAK,CAAC,EAAE,MAAM,GAAG,WAAW,GAAG,OAAO,CAAC;IACvC,4DAA4D;IAC5D,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;IACjB,8EAA8E;IAC9E,cAAc,CAAC,EAAE,OAAO,GAAG,MAAM,GAAG,UAAU,CAAC;CAChD;AA+CD,0EAA0E;AAC1E,MAAM,MAAM,YAAY,GACpB;IAAE,IAAI,EAAE,UAAU,CAAA;CAAE,GACpB,CAAC;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,GAAG,SAAS,CAAC;AAChC,iGAAiG;GAC/F;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,CAAC;AAK/E;;;;;;;;GAQG;AACH,iBAAS,QAAQ,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,IAAI,CAQzD;AAED;;;;;;;;;;;;;GAaG;AACH,iBAAS,YAAY,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,IAAI,CAW5E;AAED;;;;;;;;;;;;;;GAcG;AACH,iBAAS,WAAW,CAClB,OAAO,EAAE,MAAM,EAAE,EACjB,YAAY,EAAE,MAAM,EAAE,EACtB,KAAK,EAAE,OAAO,EACd,MAAM,CAAC,EAAE;IAAE,eAAe,EAAE,OAAO,CAAA;CAAE,GACpC,IAAI,CAuBN;AAED;;;;;;;;;;;;;;GAcG;AACH,iBAAS,cAAc,CACrB,OAAO,EAAE,MAAM,EAAE,EACjB,MAAM,EAAE,YAAY,EACpB,QAAQ,CAAC,EAAE,MAAM,EACjB,YAAY,GAAE,MAAM,EAAO,EAC3B,OAAO,GAAE,MAAM,EAAO,GACrB,MAAM,CAIR;AAoFD,qDAAqD;AACrD,iBAAS,UAAU,CACjB,OAAO,EAAE,MAAM,EAAE,EACjB,MAAM,EAAE,YAAY,EACpB,QAAQ,CAAC,EAAE,MAAM,EACjB,YAAY,GAAE,MAAM,EAAO,EAC3B,OAAO,GAAE,MAAM,EAAO,GACrB,IAAI,CAEN;AAED,iFAAiF;AACjF,iBAAS,cAAc,CAAC,YAAY,EAAE,eAAe,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAIzF;AAED,kFAAkF;AAClF,iBAAS,aAAa,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAIrF;AAED;;;;;;;;;GASG;AACH,iBAAS,WAAW,CAClB,IAAI,EAAE,cAAc,EACpB,OAAO,EAAE,MAAM,EACf,SAAS,EAAE,MAAM,GAAG,UAAU,EAC9B,KAAK,CAAC,EAAE,gBAAgB,GACvB,MAAM,CAmBR;AAOD,2FAA2F;AAC3F,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,MAAM,GAAG,UAAU,CAAC;IAC7B,4BAA4B;IAC5B,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,+FAA+F;IAC/F,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,OAAO,CAAC,EAAE,MAAM,EAAE,CAAC;IACnB,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;IAClB,WAAW,CAAC,EAAE,MAAM,EAAE,CAAC;IACvB,OAAO,CAAC,EAAE;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,GAAG,CAAC,EAAE,OAAO,CAAC;QAAC,GAAG,CAAC,EAAE,OAAO,CAAA;KAAE,EAAE,CAAC;IACvE,aAAa,CAAC,EAAE,MAAM,EAAE,CAAC;IACzB,eAAe,CAAC,EAAE;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IAChE,UAAU,CAAC,EAAE;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IAC9E,qFAAqF;IACrF,KAAK,CAAC,EAAE,gBAAgB,CAAC;IACzB,2FAA2F;IAC3F,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,iBAAS,eAAe,CACtB,IAAI,EAAE,cAAc,EACpB,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,GAAG,UAAU,EAC5B,KAAK,CAAC,EAAE,gBAAgB,GACvB,eAAe,CAqBjB;AASD;;;;;;;;;;;GAWG;AACH,iBAAS,cAAc,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,MAAM,UAAO,GAAG,IAAI,CAW1F;AAkBD;;;;;;;;GAQG;AACH,iBAAS,OAAO,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CA2B9G;AAKD;;;;;GAKG;AACH,iBAAS,WAAW,CAClB,KAAK,EAAE,IAAI,EAAE,EACb,OAAO,EAAE,MAAM,EAAE,EACjB,EAAE,EAAE,OAAO,EACX,IAAI,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GACxB;IACD,QAAQ,EAAE;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;IAC3D,QAAQ,EAAE;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IACtD,UAAU,EAAE;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,IAAI,CAAA;KAAE,EAAE,CAAC;IAC1C,YAAY,EAAE,MAAM,CAAC;CACtB,CAsBA;AAED;;;;;;;GAOG;AACH,iBAAS,cAAc,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,OAAO,GAAG,IAAI,CAiCxD;AAED,iBAAS,YAAY,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAMrC;AAQD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4CG;AACH,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,YAAY,GAAG;QAAE,GAAG,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;IACxC,OAAO,EAAE;QACP,EAAE,EAAE,MAAM,CAAC;QACX,SAAS,EAAE,MAAM,CAAC;QAClB,IAAI,CAAC,EAAE,MAAM,CAAC;QACd,UAAU,CAAC,EAAE,MAAM,CAAC;QACpB,UAAU,CAAC,EAAE,MAAM,CAAC;QACpB,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAC/B,KAAK,EAAE;YAAE,IAAI,EAAE,MAAM,CAAC;YAAC,GAAG,EAAE,KAAK,GAAG,IAAI,CAAC;YAAC,IAAI,EAAE,OAAO,EAAE,CAAC;YAAC,OAAO,CAAC,EAAE;gBAAE,UAAU,EAAE,MAAM,CAAC;gBAAC,EAAE,EAAE,MAAM,CAAC;gBAAC,IAAI,EAAE,OAAO,EAAE,CAAA;aAAE,EAAE,CAAA;SAAE,EAAE,CAAC;KAChI,EAAE,CAAC;IACJ,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,sFAAsF;IACtF,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;IACxB,OAAO,CAAC,EAAE;QACR,QAAQ,EAAE;YAAE,OAAO,EAAE,MAAM,CAAC;YAAC,EAAE,EAAE,MAAM,CAAC;YAAC,KAAK,EAAE,MAAM,EAAE,CAAA;SAAE,CAAC;QAC3D,QAAQ,EAAE;YAAE,EAAE,EAAE,MAAM,CAAC;YAAC,IAAI,EAAE,MAAM,CAAC;YAAC,GAAG,EAAE,MAAM,CAAA;SAAE,EAAE,CAAC;QACtD,UAAU,EAAE;YAAE,EAAE,EAAE,MAAM,CAAC;YAAC,KAAK,CAAC,EAAE,MAAM,CAAA;SAAE,EAAE,CAAC;QAC7C,YAAY,EAAE,MAAM,CAAC;KACtB,CAAC;IACF,KAAK,CAAC,EAAE,eAAe,CAAC;IACxB;;;OAGG;IACH,YAAY,CAAC,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC;QAAC,YAAY,EAAE,MAAM,EAAE,CAAA;KAAE,EAAE,CAAC;CACzF;AAED;;;GAGG;AACH,MAAM,MAAM,eAAe,GAAG,aAAa,CAAC;AAE5C,iBAAS,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE;IAAE,IAAI,EAAE,eAAe,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAA;CAAE,GAAG,eAAe,CAEzH;AAuBD,iBAAS,UAAU,CACjB,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,YAAY,EACpB,OAAO,EAAE,MAAM,EAAE,EACjB,KAAK,EAAE,IAAI,EAAE,EACb,EAAE,EAAE,OAAO,EACX,IAAI,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EACzB,YAAY,GAAE,MAAM,EAAO,EAC3B,KAAK,GAAE;IACL,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;IAChB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,YAAY,CAAC,EAAE,UAAU,CAAC,cAAc,CAAC,CAAC;IAC1C,OAAO,CAAC,EAAE,UAAU,CAAC,OAAO,WAAW,CAAC,CAAC;IACzC,KAAK,CAAC,EAAE,eAAe,CAAC;CACpB,GACL,UAAU,CAuCZ;AAED,oFAAoF;AACpF,iBAAS,QAAQ,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAIjC;AAED,MAAM,WAAW,IAAI;IACnB,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,KAAK,GAAG,MAAM,GAAG,MAAM,GAAG,KAAK,CAAC;IACxD,wDAAwD;IACxD,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,kFAAkF;IAClF,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC;IACnB,GAAG,CAAC,EAAE,IAAI,CAAC;IACX;;;OAGG;IACH,KAAK,CAAC,EAAE;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAC;IACrC,8GAA8G;IAC9G,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,sGAAsG;IACtG,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB;;;;OAIG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;;;;OAIG;IACH,KAAK,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACpB;;;;OAIG;IACH,OAAO,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;CACvB;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,IAAI,CAoBrE;AA0ID,iBAAS,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,EAAE,CA2CzC;AA4BD,iBAAS,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,OAAO,CAgDxF;AAED;;;;;;GAMG;AACH,MAAM,WAAW,OAAO;IACtB,IAAI,EAAE,MAAM,CAAC;IACb,yFAAyF;IACzF,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,EAAE,EAAE,MAAM,CAAC;IACX,iEAAiE;IACjE,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB;;;;OAIG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAuBD;;;;;;;;;;;;GAYG;AACH,iBAAS,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,OAAO,EAAE,GAAG,IAAI,CAsC9F;AAMD;;;;GAIG;AACH,iBAAS,UAAU,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE,GAAG,EAAE,KAAK,GAAG,IAAI,GAAG,MAAM,CAS9D;AA4GD,iBAAS,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,CAwBpD;AAsBD,wCAAwC;AACxC,eAAO,MAAM,iBAAiB;;;;;;;;;;;;;;;;;;;;;;;CAAsS,CAAC"}