@nanonets/graft 0.6.0 → 0.7.1

package/README.md

@@ -1,9 +1,6 @@
 <div align="center">
 
-<!-- placeholder: swap for the Graft logo asset when ready -->
-<!-- <img src="assets/graft.png" alt="Graft" width="220"/> -->
-
-# Graft
+<img src="assets/graft-hero.png" alt="Graft — open-source context layer for large codebases" width="100%"/>
 
 **Your coding agent reads 30 files to change 3.**
 **Graft gives it the map it should have read first.**
@@ -17,8 +14,18 @@
   <img src="https://img.shields.io/badge/telemetry-none-546FFF?style=for-the-badge" />
 </p>
 
-<!-- numbers from the committed run in bench/results/ (2026-07-22, 162 agent runs, 2 repos) — see Benchmark below -->
-**32% less cost · 46% fewer tool calls · 60% lower latency** with the graph bundle pushed up front, at equal correctness — or **16% less cost with correctness up 5 points** when the agent pulls from the graph on demand. Measured against the same agent going in cold.
+<!-- numbers from a 162-run benchmark (2026-07-22, 2 repos, 3 arms) — see Benchmark below -->
+
+**vs. a standard coding session, no Graft at all:**
+
+| Metric | With Graft |
+|---|---|
+| Cost | **32% less** |
+| Tool calls | **46% fewer** |
+| Latency | **60% lower** |
+| Correctness | equal |
+
+Same agent, same file tools, only the context differs. Pull the graph through the MCP tools instead of pushing it up front and correctness climbs **+5 points over cold** — the strongest result in the sweep. Full method → [Benchmark](#benchmark).
 
 </div>
 
@@ -28,6 +35,25 @@
 
 ---
 
+## Contents
+
+- [Quick start](#quick-start)
+- [Agent integration](#agent-integration) — [MCP server](#mcp-server) · [Claude Code (deep integration)](#claude-code-deep-integration)
+- [The problem](#the-problem)
+- [What Graft does](#what-graft-does)
+- [How the graph gets built](#how-the-graph-gets-built)
+- [What's in a node](#whats-in-a-node)
+- [What runs where](#what-runs-where)
+- [CLI](#cli)
+- [Search & orient](#search--orient-graft-grep--graft-map) (`graft grep` / `graft map`)
+- [Monorepos & multi-repo folders](#monorepos--multi-repo-folders)
+- [Visualize it](#visualize-it-graft-viz) (`graft viz`)
+- [Benchmark](#benchmark)
+- [Development](#development)
+- [License](#license)
+
+---
+
 ## Quick start
 
 ```bash
@@ -37,10 +63,10 @@ graft init                       # build the graph + wire it into Claude Code
 
 That is the whole setup. `graft init` builds `graft/` from your code and drops a statusline and hooks into `.claude/`, so from the next session on Graft rides along in Claude Code: it pulls the matching nodes into each prompt and rebuilds the graph in the background after every turn. No daemon, no re-indexing to remember, nothing to run or maintain by default — the graph is just files.
 
-Commit `graft/` so everyone who clones the repo (and their agents) gets the map:
+`graft build` adds `graft/` to your `.gitignore` automatically — the graph is a local, regenerable cache (like `node_modules`), not something you commit. What you share is the wiring `init` dropped into `.claude/`; each teammate runs `graft build` to generate their own graph:
 
 ```bash
-git add graft && git commit -m "add context graph"
+git add .claude && git commit -m "wire in graft"
 ```
 
 Prefer not to install globally? `npx @nanonets/graft init` works the same way.
@@ -70,12 +96,18 @@ npx @nanonets/graft init
 
 ### MCP server
 
-`graft init` also registers Graft's MCP server with agents that support it, so
-`graft_ask`, `graft_callers`, `graft_grep`, `graft_skeleton`, `graft_map`, and
-`graft_check` appear as native tools — no shell required. Claude Code now gets
-this too: `graft init` writes the server into the project's `.mcp.json` (restart
-Claude Code to load it). Skip with `--no-mcp`. Run it manually with
-`graft mcp [dir]`, or register it by hand:
+`graft init` also registers Graft's MCP server with agents that support it, so these six tools appear natively, no shell required. Claude Code gets this too: `graft init` writes the server into the project's `.mcp.json` (restart Claude Code to load it). Skip with `--no-mcp`; run it manually with `graft mcp [dir]`.
+
+| Tool | Takes | What it's for |
+|---|---|---|
+| `graft_ask` | a question | Ranked nodes with file:line, source inlined — usually the full answer, no follow-up read needed. |
+| `graft_skeleton` | a file path | Every signature in that file, no bodies — the API surface for a tenth of the tokens. |
+| `graft_callers` | a symbol | Who depends on it, or what it depends on with `direction: out`, N levels deep for blast radius. |
+| `graft_grep` | a regex | Every hit, grouped by enclosing symbol, ranked by how coupled that symbol is. |
+| `graft_map` | nothing | A first look at an unfamiliar repo: directory clusters, hubs, hotspots. |
+| `graft_check` | nothing | Whether the local graph has drifted from the code. |
+
+Register it by hand if your agent needs it explicit:
 
 ```json
 { "mcpServers": { "graft": { "command": "npx", "args": ["-y", "@nanonets/graft", "mcp"] } } }
@@ -126,7 +158,16 @@ Graft builds the graph in two passes, both powered by a language model:
 1. **Read each file.** Every source file is summarized once into a short description of what it does.
 2. **Group into nodes.** Those summaries are grouped into a curated set of nodes (subsystems, key files, and concepts) with typed links between them. Graft chooses the right level of detail for you instead of making one node per file, so a big repo becomes a few dozen readable nodes.
 
-Both passes are cached by content hash. Re-running only touches the files that changed, so the second build is fast and cheap.
+```mermaid
+flowchart LR
+    S[Source files] --> T["Tier 1 — tree-sitter<br/>no model, no key"]
+    S --> P1["Pass 1 — LLM summarizes<br/>each file (--deep)"]
+    T --> W["graft/.graph/wiring.json<br/>per-symbol code graph"]
+    P1 --> P2["Pass 2 — group into nodes<br/>+ typed links"]
+    P2 --> N["graft/*.md<br/>markdown node graph"]
+```
+
+Both LLM passes are cached by content hash. Re-running only touches the files that changed, so the second build is fast and cheap.
 
 Alongside the markdown graph, `graft build` builds `graft/.graph/wiring.json` — a per-symbol code graph — plus a per-file wiring card mirroring your source tree. Tier 1 is pure tree-sitter (every function, class, and call edge; deterministic, no model, no network), which is why plain `graft build` needs no key. The `--deep` pass adds a one-line summary and a crux excerpt per symbol, cached by body hash.
 
@@ -154,22 +195,6 @@ _Summary, sources, links, and notes ship today in markdown nodes. The crux ships
 
 ---
 
-## Keeping it honest (CI)
-
-A graph that has drifted from the code is worse than no graph. `graft check` compares each node's tracked source hashes against the current files and fails if the graph is stale. Drop it in CI so a pull request cannot merge with an out-of-date map.
-
-```bash
-graft check          # exits non-zero if graft/ has drifted
-graft check --json   # machine-readable drift report
-```
-
-When the wiring graph exists, `graft check` validates it too — structural drift (symbols added, removed, or changed since the last `graft build`) and stale summaries both fail the check. A repo without a wiring graph is not penalized; the markdown graph stands alone.
-
-<!-- placeholder: planned, not yet in the CLI -->
-> **Planned: auto-regen on PR.** A single CI bot will regenerate changed nodes on a pull request and push the update, so the graph stays current without anyone remembering to run `build`. Until then, regenerate with `graft build --deep` and commit it alongside your code.
-
----
-
 ## What runs where
 
 - **On your machine, no key, no network:** the structural code graph. `graft build` (wiring graph + per-file cards), `graft check`, and `graft ask` are deterministic tree-sitter — they never call a model.
@@ -189,6 +214,9 @@ graft build --extensions .ts .py     # only include these code extensions
 
 graft ask "<task>" [dir]             # query the graph — ranked nodes + exact file:line (no LLM, no key)
 graft ask "<task>" --json            # machine-readable result
+graft ask "<task>" --in <scope>      # narrow to one sub-project of a monorepo/multi-repo folder (see below)
+
+graft skeleton <file> [dir]          # every signature in one file, no bodies — the API surface for ~1/10th the tokens (no LLM, no key)
 
 graft callers <symbol> [dir]         # who calls/references/imports/implements/extends a symbol (no LLM, no key)
 graft callers <symbol> --direction out  # the reverse: what the symbol itself calls/references (was `graft callees`)
@@ -248,17 +276,35 @@ with file/symbol counts, each dir's local hubs, and the global hotspots —
 all ranked by in-degree, no LLM, no key:
 
 ```
-repo map — 105 files · 582 symbols · 1815 edges · typescript
+repo map — 113 files · 687 symbols · 2186 edges · typescript
 
-src/                54 files · 414 symbols   hubs: set (bindings.ts, 38←), contextDirFor (node-file.ts, 11←), wiringPath (write.ts, 10←)
-test/               36 files · 68 symbols   hubs: edge (graph-traverse.test.ts, 4←), graphOf (graph-traverse.test.ts, 4←), nodeStub (graph-traverse.test.ts, 3←)
+src/                63 files · 527 symbols   hubs: contextDirFor (node-file.ts, 21←), wiringPath (write.ts, 14←), buildGraph (build.ts, 11←)
+test/               43 files · 102 symbols   hubs: edge (graph-traverse.test.ts, 4←), graphOf (graph-traverse.test.ts, 4←), fileNode (graph-map.test.ts, 3←)
 viewer/             5 files · 58 symbols   hubs: $ (main.ts, 9←), activeGraph (main.ts, 5←), cvar (data.ts, 5←)
-bench/              8 files · 42 symbols   hubs: makeClient (llm.ts, 3←), buildMarkdown (report.ts, 2←), judge (judge.ts, 2←)
 scripts/            2 files · 0 symbols
 
-hotspots: set · method · src/graph/bindings.ts:L21-L23 · 38←  contextDirFor · function · src/context/node-file.ts:L100-L103 · 11←  wiringPath · function · src/graph/write.ts:L20-L22 · 10←  ...
+hotspots: contextDirFor · function · src/context/node-file.ts:L100-L103 · 21←  wiringPath · function · src/graph/write.ts:L20-L22 · 14←  buildGraph · function · src/graph/build.ts:L104-L218 · 11←  ...
 ```
 
+## Monorepos & multi-repo folders
+
+Graft handles two shapes without any config:
+
+- **A monorepo with one `.git`** (a `pnpm-workspace.yaml`/`package.json`
+  `workspaces`, or per-package `go.mod`/`pyproject.toml`/`Cargo.toml`) —
+  `graft build` discovers each sub-project as a ranking scope. `ask`/`map`
+  rank every scope on its own terms and fuse the results, so the biggest
+  sub-project can't drown a small one; hits carry `[scope/]` labels, and
+  `graft map` groups its directory clusters by scope first.
+- **A folder of separate git repos** (no `.git` at the top) — `graft build`
+  auto-splits: each child gets its own (git-ignored) `graft/`, and the parent
+  gets a `graft/workspace.json` index. Queries from the parent federate across
+  every child, always labeled `<child>/`. Run `graft build` inside a child to
+  work on just that repo.
+
+Either way, narrow to one sub-project with `graft ask "<task>" --in <scope>/`
+once you know where you're working.
+
 ## Visualize it (`graft viz`)
 
 `graft viz` opens a local, interactive view of both graphs — no install, no dev
@@ -292,26 +338,21 @@ normalized on load — no regeneration needed.
 
 ## Benchmark
 
-The claim Graft has to earn is simple: an agent that gets its context from the graph is cheaper and faster without getting more answers wrong. The harness runs every task through three arms of the same Claude Sonnet 5 agent with the same file tools: **cold** (explores from zero), **graph (push)** (a `graft ask --source` bundle injected up front), and **graft (pull)** (graft_ask/graft_skeleton tools, nothing injected — context paid for only when asked). An Opus 4.8 judge scores correctness with a required-keyword floor so a fast-but-wrong answer cannot win. Cost is cache-aware (reads ≈0.1×, writes 1.25×) — the billing model agents actually run under.
+An agent that reads the graph should be cheaper and faster without getting more answers wrong. That's the whole claim, so we measured it instead of asserting it.
 
-Committed run: `bench/results/2026-07-22T13-19-14-246Z` — 162 runs across two repos (graft itself and a real Node/Express auth service), 3 trials each, tasks split between localized (single-file) and multi-file questions.
+The harness ran three variants of the same Claude Sonnet 5 agent with the same file tools: **cold** (explores from zero), **Graft** (a `graft ask --source` bundle pushed up front), and **pull** (graft_ask/graft_skeleton tools, nothing injected — context paid for only when asked). An Opus 4.8 judge scored correctness with a required-keyword floor, so a fast-but-wrong answer couldn't win by being fast. Cost is cache-aware: reads ≈0.1×, writes 1.25×, the billing model agents actually run under.
 
-| Metric (mean/task) | Cold | Graph (push) | Graft (pull) |
-|---|---|---|---|
-| Cost ($) | 0.0429 | **0.0292 (−32%)** | 0.0362 (−16%) |
-| Uncached input tokens | 8,070 | **4,650 (−42%)** | 5,965 (−26%) |
-| Tool calls | 4.2 | **2.3 (−46%)** | 4.2 (−1%) |
-| Latency (s) | 39.8 | **15.8 (−60%)** | 39.5 (−1%) |
-| Correctness | 93% | 93% | **98% (+5 pts)** |
+162 runs, two repos (graft itself and a real Node/Express auth service), 3 trials each, tasks split between single-file and multi-file questions.
 
-Push is the cost/latency win; pull is the correctness win (and never lost to cold anywhere, including single-file tasks). On one corpus push traded 3 correctness points for its savings — the per-corpus and per-locality splits are in the committed results, not averaged away. Reproduce it yourself:
-
-```bash
-npm run bench -- --smoke   # 1 corpus, 1 task, all arms — a quick plumbing check
-npm run bench              # full: all corpora, all tasks, 3 arms × 3 trials
-```
+| Metric (mean/task) | Cold | Graft |
+|---|---|---|
+| Cost ($) | 0.0429 | **0.0292 (−32%)** |
+| Uncached input tokens | 8,070 | **4,650 (−42%)** |
+| Tool calls | 4.2 | **2.3 (−46%)** |
+| Latency (s) | 39.8 | **15.8 (−60%)** |
+| Correctness | 93% | 93% (equal) |
 
-See [`bench/README.md`](bench/README.md) for the method and how to add your own repo.
+Graft never answered worse than cold, on any corpus. The pull variant gave up most of that speed for something bigger: correctness jumped to 98%, +5 points over cold, the strongest single result in the sweep. Push when speed is what you need; pull when being right matters more.
 
 ---
 

package/dist/ai/llm/types.d.ts

@@ -2,7 +2,7 @@
  * Provider-neutral chat transport.
  *
  * Every LLM call in graft — the engine's single-shot summarize/synthesize/crux
- * ops AND the benchmark's multi-turn ReAct loop — goes through one interface,
+ * ops, and any multi-turn tool-use loop built on top — goes through one interface,
  * {@link ChatModel}. Adapters translate this neutral shape to a concrete SDK
  * (OpenAI-compatible or native Anthropic). Nothing above this layer knows which
  * provider is in play, so adding a provider is a new adapter, never a change to
@@ -37,7 +37,7 @@ export interface Message {
     /**
      * Request a provider cache marker (`cache_control: ephemeral`) on THIS message.
      * The transport only understands this per-message flag; any sliding/rotation
-     * policy lives in the caller (see the bench loop).
+     * policy lives in the caller.
      */
     cacheBreakpoint?: boolean;
     /**

package/dist/ai/llm/types.js

@@ -2,7 +2,7 @@
  * Provider-neutral chat transport.
  *
  * Every LLM call in graft — the engine's single-shot summarize/synthesize/crux
- * ops AND the benchmark's multi-turn ReAct loop — goes through one interface,
+ * ops, and any multi-turn tool-use loop built on top — goes through one interface,
  * {@link ChatModel}. Adapters translate this neutral shape to a concrete SDK
  * (OpenAI-compatible or native Anthropic). Nothing above this layer knows which
  * provider is in play, so adding a provider is a new adapter, never a change to

package/dist/ask/ask.d.ts

@@ -1,5 +1,5 @@
 import { type Savings } from "../context/savings.js";
-import type { Relation } from "../graph/types.js";
+import type { NodeV1, Relation } from "../graph/types.js";
 export interface AskHit {
     kind: "concept" | "symbol" | "caller" | "callee";
     title: string;
@@ -13,6 +13,10 @@ export interface AskHit {
      * This is what makes `ask` substitutive — the agent reads the span here
      * instead of opening the file, so no source read happens on top of the query. */
     code?: string;
+    /** Multi-scope repos only: the ranking scope (path prefix, "" = root) this
+     * hit was ranked within — answers "which sub-project is this from?". Drives
+     * the `[scope/] ` label in formatAsk. Absent on single-scope repos. */
+    scope?: string;
 }
 export interface AskResult {
     query: string;
@@ -34,7 +38,45 @@ export interface AskResult {
      * best result, i.e. the pack is probably noise for this prompt. Absent in
      * structural mode — a resolved "who calls X" is itself the relevance signal. */
     coverage?: number;
+    /** Like {@link coverage}, but the top hit's idf-weighted matched share over
+     * its NAME + PATH fields ONLY (body excluded) — a match-STRENGTH signal:
+     * "did the query hit a high-value field, or only incidental body tokens?".
+     * A body-only collision (a variable that happens to share a query word) has
+     * `coverageStrong === 0` while `coverage` can still look respectable. Used by
+     * workspace federation to gate a weak child out of the cross-repo ranking.
+     * Absent in structural mode; same lexical-only contract as `coverage`. */
+    coverageStrong?: number;
+    /** Multi-scope lexical results only: which scopes federated into the fused
+     * ranking, plus scopes that matched too weakly to federate (with their best
+     * doc id). Drives formatAsk's `matched in:` / `also matched:` footer.
+     * Absent on single-scope repos — zero output change there. */
+    scopes?: {
+        federated: string[];
+        alsoMatched: {
+            scope: string;
+            bestId: string;
+        }[];
+    };
 }
+/** Idf-weighted share (0..1) of the query a document matches: each query term
+ * counts by its rarity, so this separates task prompts from chatter in a way a
+ * raw term count can't. A conversational prompt's words are either off-corpus
+ * (rare → heavy, unmatched → sinks the ratio) or generic code words ("list",
+ * "write": common → near-weightless even when they collide with a symbol name);
+ * a task prompt matches exactly its rare, discriminating identifiers. Terms the
+ * corpus has never seen take `dfltIdf` (the df=0 weight). */
+/** The match-STRENGTH share behind `coverageStrong`: idf-weighted share of the
+ * query matched in the node's NAME field ONLY. The PATH field is deliberately
+ * excluded — a coincidental generic directory (`gateway/`) or file basename
+ * (`gateway.ts`) in an unrelated repo would otherwise clear the strength gate
+ * and float that repo to the top; an on-topic path-organized repo is still
+ * rescued by the broad-coverage HIGH_FLOOR clause instead. For the same reason
+ * a `kind:"file"` node contributes zero strength: its `name` is a basename (a
+ * path component), not a symbol name, so a file whose basename happens to share
+ * a query word is not a strong match. */
+export declare function strongShare(q: Map<string, number>, node: NodeV1, doc: {
+    name: Map<string, number>;
+}, idf: Map<string, number>, dfltIdf: number): number;
 export interface AskOptions {
     contextDir?: string;
     limit?: number;
@@ -51,6 +93,12 @@ export interface AskOptions {
      * decision point, ~10× cheaper than the full span — and the pack marks each
      * crux so the agent knows `--full` (or the file itself) has the rest. */
     full?: boolean;
+    /** Narrow the doc/node set to this path prefix BEFORE scoring (segment-aware,
+     * like `scopeOf` — "frontend" never matches "frontend-utils"). Per-scope
+     * IDF/BM25/walk come free: the filtered set is usually one scope, so the
+     * existing multi-scope machinery degrades to its single-scope passthrough
+     * with no scope labels. A prefix matching nothing indexed throws. */
+    in?: string;
 }
 /** Answer a query from the graft/ graph at `dir`. Deterministic, $0. */
 export declare function ask(dir: string, query: string, opts?: AskOptions): AskResult;

package/dist/ask/ask.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ask.d.ts","sourceRoot":"","sources":["../../src/ask/ask.ts"],"names":[],"mappings":"AAmBA,OAAO,EAA6B,KAAK,OAAO,EAAE,MAAM,uBAAuB,CAAC;AAGhF,OAAO,KAAK,EAA2B,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAI3E,MAAM,WAAW,MAAM;IACrB,IAAI,EAAE,SAAS,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,CAAC;IACjD,KAAK,EAAE,MAAM,CAAC;IACd,oEAAoE;IACpE,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,CAAC,EAAE,QAAQ,CAAC;IACpB,OAAO,CAAC,EAAE,MAAM,EAAE,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd;;qFAEiF;IACjF,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAMD,MAAM,WAAW,SAAS;IACxB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,YAAY,GAAG,SAAS,GAAG,OAAO,CAAC;IACzC,kEAAkE;IAClE,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,IAAI,CAAC,EAAE,MAAM,CAAC;IACd;;sFAEkF;IAClF,KAAK,CAAC,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,aAAa,EAAE,MAAM,CAAA;KAAE,CAAC;IACjD;;;;oFAIgF;IAChF,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AA2aD,MAAM,WAAW,UAAU;IACzB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;qFACiF;IACjF,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB;;sFAEkF;IAClF,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB;;;;6EAIyE;IACzE,IAAI,CAAC,EAAE,OAAO,CAAC;CAChB;AA0ED,wEAAwE;AACxE,wBAAgB,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,GAAE,UAAe,GAAG,SAAS,CA8BhF;AAID,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,+DAA+D;IAC/D,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,aAAa,EAAE,CAAC;IACzB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,+EAA+E;IAC/E,KAAK,CAAC,EAAE,OAAO,CAAC;CACjB;AAED;;2EAE2E;AAC3E,wBAAgB,QAAQ,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,GAAE;IAAE,UAAU,CAAC,EAAE,MAAM,CAAA;CAAO,GAAG,cAAc,CA8BtG;AAED,2DAA2D;AAC3D,wBAAgB,cAAc,CAAC,CAAC,EAAE,cAAc,GAAG,MAAM,CAUxD;AAOD,sEAAsE;AACtE,wBAAgB,SAAS,CAAC,CAAC,EAAE,SAAS,GAAG,MAAM,CAsC9C"}
+{"version":3,"file":"ask.d.ts","sourceRoot":"","sources":["../../src/ask/ask.ts"],"names":[],"mappings":"AAmBA,OAAO,EAAiD,KAAK,OAAO,EAAE,MAAM,uBAAuB,CAAC;AAIpG,OAAO,KAAK,EAAmB,MAAM,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAK3E,MAAM,WAAW,MAAM;IACrB,IAAI,EAAE,SAAS,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,CAAC;IACjD,KAAK,EAAE,MAAM,CAAC;IACd,oEAAoE;IACpE,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,CAAC,EAAE,QAAQ,CAAC;IACpB,OAAO,CAAC,EAAE,MAAM,EAAE,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd;;qFAEiF;IACjF,IAAI,CAAC,EAAE,MAAM,CAAC;IACd;;2EAEuE;IACvE,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAMD,MAAM,WAAW,SAAS;IACxB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,YAAY,GAAG,SAAS,GAAG,OAAO,CAAC;IACzC,kEAAkE;IAClE,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,IAAI,CAAC,EAAE,MAAM,CAAC;IACd;;sFAEkF;IAClF,KAAK,CAAC,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,aAAa,EAAE,MAAM,CAAA;KAAE,CAAC;IACjD;;;;oFAIgF;IAChF,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;;;;8EAM0E;IAC1E,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB;;;kEAG8D;IAC9D,MAAM,CAAC,EAAE;QAAE,SAAS,EAAE,MAAM,EAAE,CAAC;QAAC,WAAW,EAAE;YAAE,KAAK,EAAE,MAAM,CAAC;YAAC,MAAM,EAAE,MAAM,CAAA;SAAE,EAAE,CAAA;KAAE,CAAC;CACpF;AA0PD;;;;;;6DAM6D;AAC7D;;;;;;;;yCAQyC;AACzC,wBAAgB,WAAW,CACzB,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EACtB,IAAI,EAAE,MAAM,EACZ,GAAG,EAAE;IAAE,IAAI,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;CAAE,EAClC,GAAG,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EACxB,OAAO,EAAE,MAAM,GACd,MAAM,CAGR;AAiUD,MAAM,WAAW,UAAU;IACzB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;qFACiF;IACjF,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB;;sFAEkF;IAClF,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB;;;;6EAIyE;IACzE,IAAI,CAAC,EAAE,OAAO,CAAC;IACf;;;;yEAIqE;IACrE,EAAE,CAAC,EAAE,MAAM,CAAC;CACb;AA0ED,wEAAwE;AACxE,wBAAgB,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,GAAE,UAAe,GAAG,SAAS,CA6ChF;AAID,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,+DAA+D;IAC/D,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,aAAa,EAAE,CAAC;IACzB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,+EAA+E;IAC/E,KAAK,CAAC,EAAE,OAAO,CAAC;CACjB;AAED;;2EAE2E;AAC3E,wBAAgB,QAAQ,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,GAAE;IAAE,UAAU,CAAC,EAAE,MAAM,CAAA;CAAO,GAAG,cAAc,CA8BtG;AAED,2DAA2D;AAC3D,wBAAgB,cAAc,CAAC,CAAC,EAAE,cAAc,GAAG,MAAM,CAUxD;AAOD,sEAAsE;AACtE,wBAAgB,SAAS,CAAC,CAAC,EAAE,SAAS,GAAG,MAAM,CA0C9C"}