@tangle-network/agent-knowledge 19.1.5 → 20.0.1

package/CHANGELOG.md

@@ -1,3 +1,27 @@
+# Changelog
+
+## 20.0.1
+
+Qualify Eval 0.210 and 0.211 for packed consumers and official GEPA/SkillOpt integration.
+Retain Eval 0.209 and develop against 0.211.2, the first Eval release that prices `gpt-6-luna`.
+
+## 20.0.0
+
+Require Interface 3 and Eval 0.209, the first Eval release on Interface 3, so a consumer installs one Interface copy alongside Core 0.10.3.
+Knowledge 19 remains the release for Interface 2 and Eval 0.201 through 0.208.
+Remove the web research drivers, which no consumer imported, and the TCloud dependency only they used.
+Knowledge no longer browses or calls models itself; supply research through `runKnowledgeResearchLoop` callbacks or `@tangle-network/agent-runtime`.
+Removed: `runVerifiedResearchLoop`, `createWebResearchWorker`, `createVerifyingResearchDriver`, `createTangleRouterClient`, `RouterError`, `createAdaptiveResearchDriver`, `createCollectionResearchDriver`, `createResearchDrivingDriver`, `createPersistentResearchDrivingDriver`, `createClaimGroundingVerifier`, `createClaimDecorator`, the cited-claim helpers, the investment-thesis set, task, and material-facts metric, and their types.
+`groundClaimInText`, claim ledgers, `TrackedClaim`, store formats, and every other public operation are unchanged.
+The verified-research paper and its results remain as a historical record linked to the last commit with that code.
+Remove the memory experiment, memory improvement, and benchmark-suite runners, which no consumer imported: `runAgentMemoryExperiment`, `runAgentMemoryLearningExperiment`, `runAgentMemoryImprovement`, `runKnowledgeBenchmarkSuite`, `runMemoryAdapterBenchmark`, the industry benchmark catalogs, qrels import, benchmark scoring, and their run-lease, cost, and comparison types.
+Compare memory providers on product tasks with Agent Eval.
+Memory adapters, branches, holdout, lifecycle bounds, play memory tools, and the `/benchmarks` in-memory and no-op adapters are unchanged.
+Remove the `/sources` entry point and the unused authority adapters behind it (Cornell LII, IRS publications, state Secretary of State, polite HTTP fetch, HTML extraction), plus `detectChanges` and the freshness stores. No consumer imported them.
+The source registry (`addSourceText`, `addSourcePath`, `loadSourceRegistry`), source adapters such as `textSourceAdapter`, and readiness freshness scoring are unchanged.
+Remove unused root APIs: `optimizeKnowledgeBasePolicy`, `improveSelectedKnowledgeCandidate`, `buildKnowledgeRelationGraph` with its queries and schemas, `knowledgeCitationAuditFindings`, `planInvalidationPropagation`, `formatKnowledgeInvalidationProposal`, `calibrateRagAnswerJudge`, and `createRagAnswerQualityHook`.
+`improveKnowledgeBase`, `buildKnowledgeGraph`, citation resolution and audit, the lint `cites-invalidated` warning, and RAG answer scoring are unchanged.
+
 ## 19.1.5
 
 Publish the Eval 0.208 qualification. The play-memory tests gave their fixture Hindsight a 10 ms ingestion deadline on every path; on a loaded self-hosted runner a write that completes at once missed it and the 19.1.4 publish failed. Success paths now get 10 s; only the unresolved-path test keeps 10 ms.
@@ -57,8 +81,6 @@ Write transactions retain the host actor and run identity, with unknown authors
 Knowledge tools retain prior and new page bytes by default; applications can explicitly disable history.
 Lower-level proposal writers can select the same conditional-write contract.
 
-# Changelog
-
 ## 18.0.0 — 2026-09-29
 
 Require Eval 0.201 through 0.203, Interface 2.15, and TCloud 0.8.

package/README.md

@@ -9,16 +9,15 @@ Supply application callbacks for those decisions, or use `@tangle-network/agent-
 ## Install
 
 ```bash
-pnpm add @tangle-network/agent-knowledge@19.1.5 @tangle-network/agent-eval@0.208.2 @tangle-network/agent-interface@2.16.0
+pnpm add @tangle-network/agent-knowledge @tangle-network/agent-eval@0.211.2 @tangle-network/agent-interface@3.0.0
 ```
 
-Requires Node.js 22.12 or later and Interface 2.16 or later within v2, matching the Sandbox dependency.
+Requires Node.js 22.12 or later and Interface 3.
 
-Eval 0.201 through 0.208 are supported.
-Package and official optimizer checks exercise each supported minor; development uses 0.208.2.
+Eval 0.209 through 0.211 is supported; 0.209 is the first Eval release on Interface 3.
+Package and official optimizer checks exercise each minor; development uses 0.211.2, the first release that prices `gpt-6-luna`.
 These releases use Core 0.10, Trace Contract 2, and Zod 4.6.5.
-Knowledge 19 requires TCloud 0.8 with Sandbox 0.58.4 or later in that minor.
-Use Knowledge 17 with older Eval releases.
+Use Knowledge 19 with Interface 2 and Eval 0.201 through 0.208, and Knowledge 17 with older Eval releases.
 
 ## Choose an API
 
@@ -30,11 +29,8 @@ Use Knowledge 17 with older Eval releases.
 | Prove what knowledge was visible, retrieved, and selected for use | `createKnowledgeRetrievalReceipt`, `createKnowledgeUseReceipt` | package root |
 | Improve a live knowledge base without editing it in place | `improveKnowledgeBase` | package root |
 | Optimize retrieval or a complete RAG configuration | `runRetrievalImprovementLoop`, `runRagOptimization` | package root |
-| Optimize a KB maintenance policy | `optimizeKnowledgeBasePolicy` | package root |
 | Run retrieval, research, answer checks, and promotion as one process | `runRagKnowledgeImprovementLoop` | package root |
-| Compare providers or optimize memory configuration | `AgentMemoryAdapter`, `runAgentMemoryImprovement` | `/memory` |
-| Read from external authorities | `KnowledgeSource` and source adapters | `/sources` |
-| Run retrieval, answer, KB, or memory benchmark cases | `runKnowledgeBenchmarkSuite` | `/benchmarks` |
+| Connect a memory provider or branch its state | `AgentMemoryAdapter`, `createAgentMemoryBranch` | `/memory` |
 | Use live research or coding agents | `runKnowledgeImprovementJob` | `@tangle-network/agent-runtime` |
 
 ## Create and search a knowledge base
@@ -91,7 +87,6 @@ Pass `refresh: 'always'` to rebuild its index before every query, or call `inval
 Use `asRetrievalEvalRetriever()` to send the same search path into retrieval tests.
 
 `knowledgePageRelations(pages)` lists the labeled relations between pages (`wikilink`, `citation`, `shared-source`, `contradicts`), and `buildKnowledgeGraph` collapses them into the weighted page graph stored in the index.
-For caller-defined provenance (runs, claims, models, any predicate), `buildKnowledgeRelationGraph({ nodes, relations })` keeps one edge per `(sourceId, targetId, predicate)`, refuses a conflicting repeat or an undeclared endpoint, and `neighbors`, `walk`, and `isReachable` query it by predicate and direction; `KnowledgeRelationGraphSchema` round-trips a persisted graph with its metadata.
 
 Pages live under `knowledge/` unless you name another root-relative directory.
 `loadKnowledgePages`, `buildKnowledgeIndex`, `writeKnowledgeIndex`, `applyKnowledgeWriteBlocks`, `createFileSystemSearchProvider`, and `createRunScopedStores` all take one `pagesDirectory` option (`KnowledgePagesOptions`), so a store laid out as `kb/pages/<line>/` is read, indexed, searched, chained, and written through the same value.
@@ -282,19 +277,9 @@ const receipt = createKnowledgeRetrievalReceipt({
 `excludeInvalidated` defaults to **true** here, the opposite of `searchKnowledge`: a brief offers every page it names with an id ready to cite, so a refuted page in it invites a run to build on a dead claim.
 `maxChars` bounds the brief, and a page whose line does not fit is left out of `text`, `hits`, `citationIds`, and `results` alike, so all four always describe one identical set.
 
-## Propagate an invalidation
+## Invalidated pages
 
-A page whose own evidence refuted it carries an `invalidation`. A reader who arrives through a citation never meets that verdict, so run the propagation pass after grading:
-
-```ts
-const plan = planInvalidationPropagation(originatedPages(await loadKnowledgePages(root)))
-if (plan.stamps.length > 0) {
-  await applyKnowledgeWriteBlocks(root, formatKnowledgeInvalidationProposal(plan))
-}
-```
-
-Each stamped page records `citesInvalidated: [ids]` in its frontmatter, and nothing else changes.
-The plan is a diff, so a second pass over an already stamped store produces no mutation, and a citation whose target was revalidated has its stamp removed.
+A page whose own evidence refuted it carries an `invalidation`.
 `agent-knowledge lint` reports a `cites-invalidated` warning for every live citation into a refuted page, and `searchKnowledge(index, query, { excludeInvalidated: true })` drops the refuted pages from a result set.
 The default stays `false`: a caller reading history needs them.
 
@@ -382,9 +367,7 @@ Use the narrowest API that matches the job:
 |---|---|
 | `runRetrievalImprovementLoop` | Runs one complete `OptimizationMethod` over serialized retrieval configuration. |
 | `runRagOptimization` | Optimizes retrieval and answer behavior as one serialized RAG configuration. |
-| `optimizeKnowledgeBasePolicy` | Optimizes a KB maintenance policy, then applies only the selected policy to an isolated candidate. |
 | `scoreKnowledgeBaseIndex` | Measures KB structure, citations, source freshness, and configured quality thresholds. |
-| `createRagAnswerQualityHook` | Adapts answer-quality checks such as support, relevance, citations, and abstention. |
 | `runRagKnowledgeImprovementLoop` | Connects retrieval tuning, gap diagnosis, source acquisition, KB updates, answer checks, and a promotion decision. |
 | `improveKnowledgeBase` | Adds resumable state, isolated candidates, exact promotion, and conflict detection around that process. |
 
@@ -433,7 +416,7 @@ Official external methods must report observed package identity.
 Custom in-process methods have no external package identity, so their behavior must be covered by `executionRef`.
 Treat `accountingComplete: false` as incomplete evidence for activation.
 
-Retrieval, RAG, serialized-candidate, and KB-policy optimization accept Eval's optional `claim` and `finalEvidence` options.
+Retrieval, RAG, and serialized-candidate optimization accept Eval's optional `claim` and `finalEvidence` options.
 Use `claim.independentUnit` to group questions from the same source.
 A `new-units` claim requires separate source units for development and final evaluation.
 Results retain scenario scores, source-unit scores, and both observation counts.
@@ -452,7 +435,6 @@ Only answer evaluation, the terminal promotion decision, and the returned result
 Answer-quality evidence must name at least two final scenario IDs, immutable dataset and evaluator references, non-empty finite metrics, and observed cost accounting.
 Promotion also requires `answerQualityCostCeiling`.
 
-`calibrateRagAnswerJudge()` checks supplied strong and weak fixtures; it does not measure an evaluator's error rates.
 For evaluator admission, use `auditEvaluator()` from `@tangle-network/agent-eval/meta-eval` with actual judgments of independently verified controls.
 The application must enforce evaluator and auditor separation and retain evidence for the labels.
 
@@ -462,75 +444,16 @@ The application must enforce evaluator and auditor separation and retain evidenc
 The package is not a memory database.
 Install the provider you use, create its client, and pass that client to the adapter.
 
-The memory APIs support scoped reads and writes, isolated branches, ordered histories, independent train, selection, and final comparisons, and adapter experiments.
-Use them to compare a provider against no memory or another provider on the same tasks before changing production behavior.
-`runAgentMemoryImprovement` accepts a complete `OptimizationMethod`, evaluates each serialized configuration in an isolated provider branch, and activates only a winner that passes a separate final comparison.
-Set `implementationRef` to `git:<40 lowercase hex>` or `sha256:<64 lowercase hex>` covering the installed implementation, method configuration, candidate construction, execution behavior, and external configuration so incompatible state cannot resume.
-The run records one immutable candidate reference for each memory configuration and refuses cached results if that reference changes.
-Critical dimensions use Eval's deciding interval and observation minimum.
-Missing, insufficient, or indeterminate safety evidence holds activation.
-An interval that crosses the safety margin remains uncertain; it is not reported as an observed regression.
-Set `significance.independentUnitByScenarioId` when final sequences share a source unit.
-The run captures this mapping before execution and binds it to resume identity.
-Paired repetitions retain their coverage without increasing the independent-unit count.
-Each improvement candidate declares a maximum for one sequence and one recovery attempt.
-The adapter must enforce that maximum with its provider before starting external work.
-The adapter callback must call `recordExternalCost()` with each observed charge.
-Positive external work without a receipt is recorded as incomplete cost accounting, not as the configured maximum.
-Use `0` only for a free local path.
-Paid memory improvement defaults to a zero-dollar total limit; set `maxTotalCostUsd` and `maximumEvaluationCostUsd` before enabling paid work.
-
-Use `runAgentMemoryLearningExperiment` to measure whether retained memory helps across ordered steps:
-
-```ts
-import { runAgentMemoryLearningExperiment } from '@tangle-network/agent-knowledge/memory'
-
-const result = await runAgentMemoryLearningExperiment({
-  experimentId: 'support-memory',
-  runDir: 'support-memory',
-  candidates: [memoryCandidate],
-  sequences,
-  seed: 42,
-  reps: 5,
-  armOrder: 'stateful-first',
-  costCeiling: 10,
-})
-
-console.log(result.comparison.gain)
-```
-
-The function runs matched stateful and stateless arms with the same immutable candidate, tasks, executor, policy, seed, and repetitions.
-The stateless arm clears declared scopes between steps; adapters must support scoped `clear`.
-Gain excludes first-step probes and averages candidates and repetitions within each independent sequence.
-Use `transferKey` on later probes for transfer and repeat one `retentionKey` across steps for forgetting.
-Unmarked probes are not assigned those meanings.
-
-Both arms share one cost limit and must have identical comparison references.
-Run independent experiments with opposite `armOrder` values when provider behavior may drift.
-Each saved probe includes the exact scoring input and content hash, so protect the run directory like the memory data itself.
-Pass `signal` to cancel; rerun the same options and directory to resume completed work and cost records.
-
-## Run benchmarks
-
-`@tangle-network/agent-knowledge/benchmarks` provides common case and report types for:
-
-- retrieval from qrels datasets
-- RAG answer quality and unsupported claims
-- knowledge-base improvement
-- multi-turn memory behavior and provider comparison
-
-The bundled industry cases are small smoke checks for adapter wiring.
-They are not copies of full BEIR, MTEB, MS MARCO, LongMemEval, or other external datasets, and they do not produce a public leaderboard by themselves.
-Import the real dataset rows or qrels and run them through `runKnowledgeBenchmarkSuite` for benchmark results.
+The memory APIs support scoped reads and writes and isolated branches.
+Compare providers on product tasks with `@tangle-network/agent-eval` before changing production behavior.
 
 ## Package boundaries
 
 | Import | Contents |
 |---|---|
 | `@tangle-network/agent-knowledge` | KB files, indexes, search, validation, research callbacks, RAG evaluation, and candidate improvement |
-| `@tangle-network/agent-knowledge/memory` | Memory contracts, provider adapters, branches, and experiments |
-| `@tangle-network/agent-knowledge/sources` | HTTP and authority-specific source adapters |
-| `@tangle-network/agent-knowledge/benchmarks` | Benchmark cases, qrels import, execution, and reports |
+| `@tangle-network/agent-knowledge/memory` | Memory contracts, provider adapters, branches, holdout, and play memory tools |
+| `@tangle-network/agent-knowledge/benchmarks` | In-memory and no-op memory adapters for benchmark harnesses |
 | `@tangle-network/agent-knowledge/viz` | Dependency-free graph analysis helpers |
 
 Use the `agent-knowledge` binary for CLI commands rather than importing its CLI module.
@@ -541,8 +464,11 @@ Those choices stay in the application or in `@tangle-network/agent-runtime`.
 ## More detail
 
 - [Architecture and data model](docs/architecture.md)
+- [Run-scoped citations](docs/run-scoped-citations.md)
 - [Knowledge retrieval and use receipts](docs/knowledge-use-receipts.md)
-- [Verified research comparison](docs/verified-research-ab.md)
+- [QMD source snapshots](docs/qmd-retrieval.md)
+- [Play-scoped Hindsight memory](docs/hindsight-memory.md)
+- [Verified research comparison (historical; the research drivers were removed in 20.0.0)](docs/verified-research-ab.md)
 - [Changelog](CHANGELOG.md)
 
 ## License

package/dist/benchmarks/index.d.ts

@@ -1,2 +1,2 @@
-import { A as KnowledgeBenchmarkResponder, B as KnowledgeMemoryEvent, C as KnowledgeBenchmarkArtifact, Ct as createInMemoryBenchmarkAdapter, D as KnowledgeBenchmarkEvaluation, E as KnowledgeBenchmarkDistribution, F as KnowledgeBenchmarkSplit, G as MemoryAdapterBenchmarkCandidate, H as KnowledgeRetrievalBenchmarkCase, I as KnowledgeBenchmarkTaskKind, J as RunKnowledgeBenchmarkSuiteResult, K as MemoryAdapterBenchmarkRankingRow, L as KnowledgeClaimMatcher, M as KnowledgeBenchmarkSliceSummary, N as KnowledgeBenchmarkSource, O as KnowledgeBenchmarkFamily, P as KnowledgeBenchmarkSpec, R as KnowledgeMemoryBenchmarkCase, S as KnowledgeAnswerBenchmarkTaskKind, T as KnowledgeBenchmarkCaseBase, U as KnowledgeRetrievalBenchmarkQrel, V as KnowledgeMemoryFactMatcher, W as KnowledgeRetrievalBenchmarkQuery, X as RunMemoryAdapterBenchmarkResult, Y as RunMemoryAdapterBenchmarkOptions, _ as buildIndustryRagBenchmarkSmokeCases, a as runKnowledgeBenchmarkSuite, b as BuildRetrievalBenchmarkCasesFromQrelsOptions, c as buildRetrievalBenchmarkCasesFromQrels, d as summarizeKnowledgeBenchmarkCampaign, f as runMemoryAdapterBenchmark, g as buildIndustryMemoryBenchmarkSmokeCases, h as buildFirstPartyMemoryLifecycleBenchmarkCases, i as renderKnowledgeBenchmarkReportMarkdown, j as KnowledgeBenchmarkScenario, k as KnowledgeBenchmarkReport, l as parseKnowledgeBenchmarkJsonl, m as INDUSTRY_RAG_BENCHMARKS, n as buildKnowledgeBenchmarkScenarios, o as scoreKnowledgeBenchmarkArtifact, p as INDUSTRY_MEMORY_BENCHMARKS, q as RunKnowledgeBenchmarkSuiteOptions, r as knowledgeBenchmarkJudge, s as scoreMemoryBenchmarkArtifact, t as isKnowledgeMemoryBenchmarkCase, u as parseKnowledgeBenchmarkQrels, v as respondToIndustryMemoryBenchmarkSmokeCase, w as KnowledgeBenchmarkCase, wt as createNoopMemoryBenchmarkAdapter, x as KnowledgeAnswerBenchmarkCase, y as respondToIndustryRagBenchmarkSmokeCase, z as KnowledgeMemoryBenchmarkTaskKind } from "../index-DZeFm-BP.js";
-export { type BuildRetrievalBenchmarkCasesFromQrelsOptions, INDUSTRY_MEMORY_BENCHMARKS, INDUSTRY_RAG_BENCHMARKS, type KnowledgeAnswerBenchmarkCase, type KnowledgeAnswerBenchmarkTaskKind, type KnowledgeBenchmarkArtifact, type KnowledgeBenchmarkCase, type KnowledgeBenchmarkCaseBase, type KnowledgeBenchmarkDistribution, type KnowledgeBenchmarkEvaluation, type KnowledgeBenchmarkFamily, type KnowledgeBenchmarkReport, type KnowledgeBenchmarkResponder, type KnowledgeBenchmarkScenario, type KnowledgeBenchmarkSliceSummary, type KnowledgeBenchmarkSource, type KnowledgeBenchmarkSpec, type KnowledgeBenchmarkSplit, type KnowledgeBenchmarkTaskKind, type KnowledgeClaimMatcher, type KnowledgeMemoryBenchmarkCase, type KnowledgeMemoryBenchmarkTaskKind, type KnowledgeMemoryEvent, type KnowledgeMemoryFactMatcher, type KnowledgeRetrievalBenchmarkCase, type KnowledgeRetrievalBenchmarkQrel, type KnowledgeRetrievalBenchmarkQuery, type MemoryAdapterBenchmarkCandidate, type MemoryAdapterBenchmarkRankingRow, type RunKnowledgeBenchmarkSuiteOptions, type RunKnowledgeBenchmarkSuiteResult, type RunMemoryAdapterBenchmarkOptions, type RunMemoryAdapterBenchmarkResult, buildFirstPartyMemoryLifecycleBenchmarkCases, buildIndustryMemoryBenchmarkSmokeCases, buildIndustryRagBenchmarkSmokeCases, buildKnowledgeBenchmarkScenarios, buildRetrievalBenchmarkCasesFromQrels, createInMemoryBenchmarkAdapter, createNoopMemoryBenchmarkAdapter, isKnowledgeMemoryBenchmarkCase, knowledgeBenchmarkJudge, parseKnowledgeBenchmarkJsonl, parseKnowledgeBenchmarkQrels, renderKnowledgeBenchmarkReportMarkdown, respondToIndustryMemoryBenchmarkSmokeCase, respondToIndustryRagBenchmarkSmokeCase, runKnowledgeBenchmarkSuite, runMemoryAdapterBenchmark, scoreKnowledgeBenchmarkArtifact, scoreMemoryBenchmarkArtifact, summarizeKnowledgeBenchmarkCampaign };
+import { n as createNoopMemoryBenchmarkAdapter, t as createInMemoryBenchmarkAdapter } from "../index-OAxtm6is.js";
+export { createInMemoryBenchmarkAdapter, createNoopMemoryBenchmarkAdapter };

package/dist/benchmarks/index.js

@@ -1,2 +1,2 @@
-import { F as buildIndustryRagBenchmarkSmokeCases, H as createNoopMemoryBenchmarkAdapter, I as respondToIndustryMemoryBenchmarkSmokeCase, L as respondToIndustryRagBenchmarkSmokeCase, M as INDUSTRY_RAG_BENCHMARKS, N as buildFirstPartyMemoryLifecycleBenchmarkCases, P as buildIndustryMemoryBenchmarkSmokeCases, R as isKnowledgeMemoryBenchmarkCase, V as createInMemoryBenchmarkAdapter, a as buildKnowledgeBenchmarkScenarios, c as runKnowledgeBenchmarkSuite, d as summarizeKnowledgeBenchmarkCampaign, i as runMemoryAdapterBenchmark, j as INDUSTRY_MEMORY_BENCHMARKS, l as scoreKnowledgeBenchmarkArtifact, n as parseKnowledgeBenchmarkJsonl, o as knowledgeBenchmarkJudge, r as parseKnowledgeBenchmarkQrels, s as renderKnowledgeBenchmarkReportMarkdown, t as buildRetrievalBenchmarkCasesFromQrels, u as scoreMemoryBenchmarkArtifact } from "../benchmarks-BjXxjAke.js";
-export { INDUSTRY_MEMORY_BENCHMARKS, INDUSTRY_RAG_BENCHMARKS, buildFirstPartyMemoryLifecycleBenchmarkCases, buildIndustryMemoryBenchmarkSmokeCases, buildIndustryRagBenchmarkSmokeCases, buildKnowledgeBenchmarkScenarios, buildRetrievalBenchmarkCasesFromQrels, createInMemoryBenchmarkAdapter, createNoopMemoryBenchmarkAdapter, isKnowledgeMemoryBenchmarkCase, knowledgeBenchmarkJudge, parseKnowledgeBenchmarkJsonl, parseKnowledgeBenchmarkQrels, renderKnowledgeBenchmarkReportMarkdown, respondToIndustryMemoryBenchmarkSmokeCase, respondToIndustryRagBenchmarkSmokeCase, runKnowledgeBenchmarkSuite, runMemoryAdapterBenchmark, scoreKnowledgeBenchmarkArtifact, scoreMemoryBenchmarkArtifact, summarizeKnowledgeBenchmarkCampaign };
+import { n as createNoopMemoryBenchmarkAdapter, t as createInMemoryBenchmarkAdapter } from "../benchmarks-jir3ZP-M.js";
+export { createInMemoryBenchmarkAdapter, createNoopMemoryBenchmarkAdapter };

package/dist/benchmarks-jir3ZP-M.js

@@ -0,0 +1,162 @@
+import { n as memoryWriteResultToSourceRecord, t as memoryHitToSourceRecord } from "./source-record-CdWvzvO6.js";
+//#region src/benchmarks/adapters.ts
+function createNoopMemoryBenchmarkAdapter(id = "no-memory") {
+	return {
+		id,
+		branchIsolation: { mode: "scoped" },
+		async search() {
+			return [];
+		},
+		async getContext(query) {
+			return {
+				query,
+				text: "",
+				hits: [],
+				sourceRecords: []
+			};
+		},
+		async write(input) {
+			return {
+				accepted: false,
+				id: input.id ?? `${id}:ignored`,
+				uri: `memory://${id}/ignored`,
+				kind: input.kind
+			};
+		},
+		async clear() {},
+		async flush() {}
+	};
+}
+function createInMemoryBenchmarkAdapter(options = {}) {
+	const id = options.id ?? "in-memory";
+	const rows = [];
+	let seq = 0;
+	const adapter = {
+		id,
+		branchIsolation: { mode: "scoped" },
+		async search(query, searchOptions = {}) {
+			return rows.filter((row) => memoryScopeMatches(row.input.scope, searchOptions.scope)).filter((row) => !searchOptions.kinds?.length || searchOptions.kinds.includes(row.hit.kind)).map((row) => {
+				const lexical = tokenOverlap(query, row.hit.text);
+				const recency = row.seq / Math.max(1, seq);
+				return {
+					...row.hit,
+					score: lexical + recency * .01,
+					normalizedScore: lexical
+				};
+			}).filter((hit) => searchOptions.minScore === void 0 ? true : hit.score >= searchOptions.minScore).sort((a, b) => (b.score ?? 0) - (a.score ?? 0)).slice(0, searchOptions.limit ?? 5);
+		},
+		async getContext(query, searchOptions = {}) {
+			const hits = await adapter.search(query, searchOptions);
+			return {
+				query,
+				hits,
+				sourceRecords: hits.map((hit) => memoryHitToSourceRecord(hit, { scope: searchOptions.scope })),
+				text: renderMemoryHits(hits)
+			};
+		},
+		async write(input) {
+			seq += 1;
+			const memoryId = input.id ?? `${id}:${seq}`;
+			const hit = {
+				id: memoryId,
+				uri: `memory://${id}/${encodeURIComponent(memoryId)}`,
+				kind: input.kind,
+				text: input.text,
+				title: input.title,
+				score: 1,
+				normalizedScore: 1,
+				createdAt: input.metadata?.timestamp,
+				metadata: {
+					...input.metadata ?? {},
+					scope: input.scope
+				}
+			};
+			rows.push({
+				seq,
+				input,
+				hit
+			});
+			return {
+				accepted: true,
+				id: memoryId,
+				uri: hit.uri,
+				kind: input.kind,
+				sourceRecord: memoryWriteResultToSourceRecord({
+					accepted: true,
+					id: memoryId,
+					uri: hit.uri,
+					kind: input.kind,
+					metadata: hit.metadata
+				}, input.text, { scope: input.scope }),
+				metadata: hit.metadata
+			};
+		},
+		async clear(scope) {
+			for (let index = rows.length - 1; index >= 0; index -= 1) if (memoryScopeMatches(rows[index].input.scope, scope)) rows.splice(index, 1);
+		},
+		async flush() {}
+	};
+	return adapter;
+}
+function memoryEventId(hit) {
+	const eventId = hit.metadata?.eventId;
+	return typeof eventId === "string" ? eventId : void 0;
+}
+function memoryActorId(hit) {
+	const actorId = hit.metadata?.actorId;
+	return typeof actorId === "string" ? actorId : void 0;
+}
+function memoryScopeMatches(stored, requested) {
+	if (!requested) return true;
+	if (requested.tenantId !== void 0 && stored?.tenantId !== requested.tenantId) return false;
+	if (requested.userId !== void 0 && stored?.userId !== requested.userId) return false;
+	if (requested.agentId !== void 0 && stored?.agentId !== requested.agentId) return false;
+	if (requested.teamId !== void 0 && stored?.teamId !== requested.teamId) return false;
+	if (requested.runId !== void 0 && stored?.runId !== requested.runId) return false;
+	if (requested.sessionId !== void 0 && stored?.sessionId !== requested.sessionId) return false;
+	if (requested.namespace !== void 0 && stored?.namespace !== requested.namespace) return false;
+	for (const [key, value] of Object.entries(requested.tags ?? {})) if (stored?.tags?.[key] !== value) return false;
+	return true;
+}
+function tokenOverlap(query, text) {
+	const queryTokens = new Set(tokenize(query));
+	if (queryTokens.size === 0) return 0;
+	const textTokens = new Set(tokenize(text));
+	let matched = 0;
+	for (const token of queryTokens) if (textTokens.has(token)) matched += 1;
+	return matched / queryTokens.size;
+}
+function tokenize(text) {
+	const stop = /* @__PURE__ */ new Set([
+		"the",
+		"and",
+		"for",
+		"this",
+		"that",
+		"with",
+		"what",
+		"should",
+		"agent",
+		"user",
+		"current",
+		"now",
+		"use"
+	]);
+	return text.toLowerCase().split(/[^a-z0-9/]+/).filter((token) => token.length > 2 && !stop.has(token));
+}
+function renderMemoryHits(hits) {
+	return hits.map((hit, index) => {
+		const eventId = memoryEventId(hit);
+		const actorId = memoryActorId(hit);
+		return [
+			`[${index + 1}] ${hit.title ?? hit.id}`,
+			eventId ? `event=${eventId}` : "",
+			actorId ? `actor=${actorId}` : "",
+			hit.text
+		].filter(Boolean).join("\n");
+	}).join("\n\n");
+}
+//#endregion
+export { createNoopMemoryBenchmarkAdapter as n, createInMemoryBenchmarkAdapter as t };
+
+//# sourceMappingURL=benchmarks-jir3ZP-M.js.map

package/dist/benchmarks-jir3ZP-M.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"benchmarks-jir3ZP-M.js","names":[],"sources":["../src/benchmarks/adapters.ts"],"sourcesContent":["import { memoryHitToSourceRecord, memoryWriteResultToSourceRecord } from '../memory/source-record'\n\nimport type {\n  AgentMemoryAdapter,\n  AgentMemoryHit,\n  AgentMemoryScope,\n  AgentMemoryWriteInput,\n} from '../memory/types'\n\nexport function createNoopMemoryBenchmarkAdapter(id = 'no-memory'): AgentMemoryAdapter {\n  return {\n    id,\n    branchIsolation: { mode: 'scoped' },\n    async search() {\n      return []\n    },\n    async getContext(query) {\n      return { query, text: '', hits: [], sourceRecords: [] }\n    },\n    async write(input) {\n      return {\n        accepted: false,\n        id: input.id ?? `${id}:ignored`,\n        uri: `memory://${id}/ignored`,\n        kind: input.kind,\n      }\n    },\n    async clear() {},\n    async flush() {},\n  }\n}\n\nexport function createInMemoryBenchmarkAdapter(options: { id?: string } = {}): AgentMemoryAdapter {\n  const id = options.id ?? 'in-memory'\n  const rows: Array<{\n    seq: number\n    input: AgentMemoryWriteInput\n    hit: AgentMemoryHit\n  }> = []\n  let seq = 0\n  const adapter: AgentMemoryAdapter = {\n    id,\n    branchIsolation: { mode: 'scoped' },\n    async search(query, searchOptions = {}) {\n      const scored = rows\n        .filter((row) => memoryScopeMatches(row.input.scope, searchOptions.scope))\n        .filter((row) => !searchOptions.kinds?.length || searchOptions.kinds.includes(row.hit.kind))\n        .map((row) => {\n          const lexical = tokenOverlap(query, row.hit.text)\n          const recency = row.seq / Math.max(1, seq)\n          return {\n            ...row.hit,\n            score: lexical + recency * 0.01,\n            normalizedScore: lexical,\n          }\n        })\n        .filter((hit) =>\n          searchOptions.minScore === undefined ? true : hit.score! >= searchOptions.minScore,\n        )\n        .sort((a, b) => (b.score ?? 0) - (a.score ?? 0))\n      return scored.slice(0, searchOptions.limit ?? 5)\n    },\n    async getContext(query, searchOptions = {}) {\n      const hits = await adapter.search(query, searchOptions)\n      return {\n        query,\n        hits,\n        sourceRecords: hits.map((hit) =>\n          memoryHitToSourceRecord(hit, { scope: searchOptions.scope }),\n        ),\n        text: renderMemoryHits(hits),\n      }\n    },\n    async write(input) {\n      seq += 1\n      const memoryId = input.id ?? `${id}:${seq}`\n      const hit: AgentMemoryHit = {\n        id: memoryId,\n        uri: `memory://${id}/${encodeURIComponent(memoryId)}`,\n        kind: input.kind,\n        text: input.text,\n        title: input.title,\n        score: 1,\n        normalizedScore: 1,\n        createdAt: input.metadata?.timestamp as string | undefined,\n        metadata: {\n          ...(input.metadata ?? {}),\n          scope: input.scope,\n        },\n      }\n      rows.push({ seq, input, hit })\n      return {\n        accepted: true,\n        id: memoryId,\n        uri: hit.uri,\n        kind: input.kind,\n        sourceRecord: memoryWriteResultToSourceRecord(\n          {\n            accepted: true,\n            id: memoryId,\n            uri: hit.uri,\n            kind: input.kind,\n            metadata: hit.metadata,\n          },\n          input.text,\n          { scope: input.scope },\n        ),\n        metadata: hit.metadata,\n      }\n    },\n    async clear(scope) {\n      for (let index = rows.length - 1; index >= 0; index -= 1) {\n        if (memoryScopeMatches(rows[index]!.input.scope, scope)) rows.splice(index, 1)\n      }\n    },\n    async flush() {},\n  }\n  return adapter\n}\n\nexport function memoryEventId(hit: AgentMemoryHit): string | undefined {\n  const eventId = hit.metadata?.eventId\n  return typeof eventId === 'string' ? eventId : undefined\n}\n\nexport function memoryActorId(hit: AgentMemoryHit): string | undefined {\n  const actorId = hit.metadata?.actorId\n  return typeof actorId === 'string' ? actorId : undefined\n}\n\nfunction memoryScopeMatches(stored?: AgentMemoryScope, requested?: AgentMemoryScope): boolean {\n  if (!requested) return true\n  if (requested.tenantId !== undefined && stored?.tenantId !== requested.tenantId) return false\n  if (requested.userId !== undefined && stored?.userId !== requested.userId) return false\n  if (requested.agentId !== undefined && stored?.agentId !== requested.agentId) return false\n  if (requested.teamId !== undefined && stored?.teamId !== requested.teamId) return false\n  if (requested.runId !== undefined && stored?.runId !== requested.runId) return false\n  if (requested.sessionId !== undefined && stored?.sessionId !== requested.sessionId) return false\n  if (requested.namespace !== undefined && stored?.namespace !== requested.namespace) return false\n  for (const [key, value] of Object.entries(requested.tags ?? {})) {\n    if (stored?.tags?.[key] !== value) return false\n  }\n  return true\n}\n\nfunction tokenOverlap(query: string, text: string): number {\n  const queryTokens = new Set(tokenize(query))\n  if (queryTokens.size === 0) return 0\n  const textTokens = new Set(tokenize(text))\n  let matched = 0\n  for (const token of queryTokens) {\n    if (textTokens.has(token)) matched += 1\n  }\n  return matched / queryTokens.size\n}\n\nfunction tokenize(text: string): string[] {\n  const stop = new Set([\n    'the',\n    'and',\n    'for',\n    'this',\n    'that',\n    'with',\n    'what',\n    'should',\n    'agent',\n    'user',\n    'current',\n    'now',\n    'use',\n  ])\n  return text\n    .toLowerCase()\n    .split(/[^a-z0-9/]+/)\n    .filter((token) => token.length > 2 && !stop.has(token))\n}\n\nfunction renderMemoryHits(hits: readonly AgentMemoryHit[]): string {\n  return hits\n    .map((hit, index) => {\n      const eventId = memoryEventId(hit)\n      const actorId = memoryActorId(hit)\n      return [\n        `[${index + 1}] ${hit.title ?? hit.id}`,\n        eventId ? `event=${eventId}` : '',\n        actorId ? `actor=${actorId}` : '',\n        hit.text,\n      ]\n        .filter(Boolean)\n        .join('\\n')\n    })\n    .join('\\n\\n')\n}\n"],"mappings":";;AASA,SAAgB,iCAAiC,KAAK,aAAiC;CACrF,OAAO;EACL;EACA,iBAAiB,EAAE,MAAM,SAAS;EAClC,MAAM,SAAS;GACb,OAAO,CAAC;EACV;EACA,MAAM,WAAW,OAAO;GACtB,OAAO;IAAE;IAAO,MAAM;IAAI,MAAM,CAAC;IAAG,eAAe,CAAC;GAAE;EACxD;EACA,MAAM,MAAM,OAAO;GACjB,OAAO;IACL,UAAU;IACV,IAAI,MAAM,MAAM,GAAG,GAAG;IACtB,KAAK,YAAY,GAAG;IACpB,MAAM,MAAM;GACd;EACF;EACA,MAAM,QAAQ,CAAC;EACf,MAAM,QAAQ,CAAC;CACjB;AACF;AAEA,SAAgB,+BAA+B,UAA2B,CAAC,GAAuB;CAChG,MAAM,KAAK,QAAQ,MAAM;CACzB,MAAM,OAID,CAAC;CACN,IAAI,MAAM;CACV,MAAM,UAA8B;EAClC;EACA,iBAAiB,EAAE,MAAM,SAAS;EAClC,MAAM,OAAO,OAAO,gBAAgB,CAAC,GAAG;GAiBtC,OAhBe,KACZ,QAAQ,QAAQ,mBAAmB,IAAI,MAAM,OAAO,cAAc,KAAK,CAAC,CAAC,CACzE,QAAQ,QAAQ,CAAC,cAAc,OAAO,UAAU,cAAc,MAAM,SAAS,IAAI,IAAI,IAAI,CAAC,CAAC,CAC3F,KAAK,QAAQ;IACZ,MAAM,UAAU,aAAa,OAAO,IAAI,IAAI,IAAI;IAChD,MAAM,UAAU,IAAI,MAAM,KAAK,IAAI,GAAG,GAAG;IACzC,OAAO;KACL,GAAG,IAAI;KACP,OAAO,UAAU,UAAU;KAC3B,iBAAiB;IACnB;GACF,CAAC,CAAC,CACD,QAAQ,QACP,cAAc,aAAa,KAAA,IAAY,OAAO,IAAI,SAAU,cAAc,QAC5E,CAAC,CACA,MAAM,GAAG,OAAO,EAAE,SAAS,MAAM,EAAE,SAAS,EACnC,CAAC,CAAC,MAAM,GAAG,cAAc,SAAS,CAAC;EACjD;EACA,MAAM,WAAW,OAAO,gBAAgB,CAAC,GAAG;GAC1C,MAAM,OAAO,MAAM,QAAQ,OAAO,OAAO,aAAa;GACtD,OAAO;IACL;IACA;IACA,eAAe,KAAK,KAAK,QACvB,wBAAwB,KAAK,EAAE,OAAO,cAAc,MAAM,CAAC,CAC7D;IACA,MAAM,iBAAiB,IAAI;GAC7B;EACF;EACA,MAAM,MAAM,OAAO;GACjB,OAAO;GACP,MAAM,WAAW,MAAM,MAAM,GAAG,GAAG,GAAG;GACtC,MAAM,MAAsB;IAC1B,IAAI;IACJ,KAAK,YAAY,GAAG,GAAG,mBAAmB,QAAQ;IAClD,MAAM,MAAM;IACZ,MAAM,MAAM;IACZ,OAAO,MAAM;IACb,OAAO;IACP,iBAAiB;IACjB,WAAW,MAAM,UAAU;IAC3B,UAAU;KACR,GAAI,MAAM,YAAY,CAAC;KACvB,OAAO,MAAM;IACf;GACF;GACA,KAAK,KAAK;IAAE;IAAK;IAAO;GAAI,CAAC;GAC7B,OAAO;IACL,UAAU;IACV,IAAI;IACJ,KAAK,IAAI;IACT,MAAM,MAAM;IACZ,cAAc,gCACZ;KACE,UAAU;KACV,IAAI;KACJ,KAAK,IAAI;KACT,MAAM,MAAM;KACZ,UAAU,IAAI;IAChB,GACA,MAAM,MACN,EAAE,OAAO,MAAM,MAAM,CACvB;IACA,UAAU,IAAI;GAChB;EACF;EACA,MAAM,MAAM,OAAO;GACjB,KAAK,IAAI,QAAQ,KAAK,SAAS,GAAG,SAAS,GAAG,SAAS,GACrD,IAAI,mBAAmB,KAAK,MAAM,CAAE,MAAM,OAAO,KAAK,GAAG,KAAK,OAAO,OAAO,CAAC;EAEjF;EACA,MAAM,QAAQ,CAAC;CACjB;CACA,OAAO;AACT;AAEA,SAAgB,cAAc,KAAyC;CACrE,MAAM,UAAU,IAAI,UAAU;CAC9B,OAAO,OAAO,YAAY,WAAW,UAAU,KAAA;AACjD;AAEA,SAAgB,cAAc,KAAyC;CACrE,MAAM,UAAU,IAAI,UAAU;CAC9B,OAAO,OAAO,YAAY,WAAW,UAAU,KAAA;AACjD;AAEA,SAAS,mBAAmB,QAA2B,WAAuC;CAC5F,IAAI,CAAC,WAAW,OAAO;CACvB,IAAI,UAAU,aAAa,KAAA,KAAa,QAAQ,aAAa,UAAU,UAAU,OAAO;CACxF,IAAI,UAAU,WAAW,KAAA,KAAa,QAAQ,WAAW,UAAU,QAAQ,OAAO;CAClF,IAAI,UAAU,YAAY,KAAA,KAAa,QAAQ,YAAY,UAAU,SAAS,OAAO;CACrF,IAAI,UAAU,WAAW,KAAA,KAAa,QAAQ,WAAW,UAAU,QAAQ,OAAO;CAClF,IAAI,UAAU,UAAU,KAAA,KAAa,QAAQ,UAAU,UAAU,OAAO,OAAO;CAC/E,IAAI,UAAU,cAAc,KAAA,KAAa,QAAQ,cAAc,UAAU,WAAW,OAAO;CAC3F,IAAI,UAAU,cAAc,KAAA,KAAa,QAAQ,cAAc,UAAU,WAAW,OAAO;CAC3F,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,UAAU,QAAQ,CAAC,CAAC,GAC5D,IAAI,QAAQ,OAAO,SAAS,OAAO,OAAO;CAE5C,OAAO;AACT;AAEA,SAAS,aAAa,OAAe,MAAsB;CACzD,MAAM,cAAc,IAAI,IAAI,SAAS,KAAK,CAAC;CAC3C,IAAI,YAAY,SAAS,GAAG,OAAO;CACnC,MAAM,aAAa,IAAI,IAAI,SAAS,IAAI,CAAC;CACzC,IAAI,UAAU;CACd,KAAK,MAAM,SAAS,aAClB,IAAI,WAAW,IAAI,KAAK,GAAG,WAAW;CAExC,OAAO,UAAU,YAAY;AAC/B;AAEA,SAAS,SAAS,MAAwB;CACxC,MAAM,uBAAO,IAAI,IAAI;EACnB;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF,CAAC;CACD,OAAO,KACJ,YAAY,CAAC,CACb,MAAM,aAAa,CAAC,CACpB,QAAQ,UAAU,MAAM,SAAS,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC;AAC3D;AAEA,SAAS,iBAAiB,MAAyC;CACjE,OAAO,KACJ,KAAK,KAAK,UAAU;EACnB,MAAM,UAAU,cAAc,GAAG;EACjC,MAAM,UAAU,cAAc,GAAG;EACjC,OAAO;GACL,IAAI,QAAQ,EAAE,IAAI,IAAI,SAAS,IAAI;GACnC,UAAU,SAAS,YAAY;GAC/B,UAAU,SAAS,YAAY;GAC/B,IAAI;EACN,CAAC,CACE,OAAO,OAAO,CAAC,CACf,KAAK,IAAI;CACd,CAAC,CAAC,CACD,KAAK,MAAM;AAChB"}

package/dist/cli.js

@@ -1,9 +1,8 @@
 #!/usr/bin/env node
-import { Dt as initKnowledgeBase, L as validateKnowledgeIndex, Q as loadSourceRegistry, R as lintKnowledgeIndex, X as addSourcePath, Y as writeKnowledgeIndex, a as applyKnowledgeWriteBlocksFile, jt as layoutFor, n as inspectKnowledgeIndex, t as explainKnowledgeTarget } from "./inspect-C6c4zuKp.js";
-import { r as searchKnowledge } from "./search-BBr5eUyT.js";
+import { Ht as layoutFor, J as validateKnowledgeIndex, Rt as initKnowledgeBase, Y as lintKnowledgeIndex, a as searchKnowledge, g as applyKnowledgeWriteBlocksFile, lt as loadSourceRegistry, n as inspectKnowledgeIndex, ot as writeKnowledgeIndex, st as addSourcePath, t as explainKnowledgeTarget } from "./inspect-CMigdsD5.js";
 import { detectKnowledgeGaps, findSurprisingConnections, toKnowledgeVizGraph } from "./viz/index.js";
-import { join, resolve } from "node:path";
 import { existsSync, readFileSync } from "node:fs";
+import { join, resolve } from "node:path";
 //#region src/cli.ts
 function parseArgs(argv) {
 	const [command, ...rest] = argv;

package/dist/cli.js.map

@@ -1 +1 @@
-{"version":3,"file":"cli.js","names":[],"sources":["../src/cli.ts"],"sourcesContent":["#!/usr/bin/env node\nimport { existsSync, readFileSync } from 'node:fs'\nimport { join, resolve } from 'node:path'\n\nimport { type buildKnowledgeIndex, writeKnowledgeIndex } from './indexer'\nimport { explainKnowledgeTarget, inspectKnowledgeIndex } from './inspect'\nimport { lintKnowledgeIndex } from './lint'\nimport type { KnowledgePagesOptions } from './pages-directory'\nimport { type ApplyKnowledgeWriteBlocksOptions, applyKnowledgeWriteBlocksFile } from './proposals'\nimport { searchKnowledge } from './search'\nimport { addSourcePath, loadSourceRegistry } from './sources'\nimport { initKnowledgeBase, layoutFor } from './store'\nimport { validateKnowledgeIndex } from './validate'\nimport { detectKnowledgeGaps, findSurprisingConnections, toKnowledgeVizGraph } from './viz/index'\n\ninterface Args {\n  command: string\n  positional: string[]\n  flags: Record<string, string>\n}\n\nfunction parseArgs(argv: string[]): Args {\n  const [command, ...rest] = argv\n  const positional: string[] = []\n  const flags: Record<string, string> = {}\n  for (let i = 0; i < rest.length; i++) {\n    const token = rest[i]!\n    if (token.startsWith('--')) {\n      const key = token.slice(2)\n      const next = rest[i + 1]\n      if (next && !next.startsWith('--')) {\n        flags[key] = next\n        i++\n      } else {\n        flags[key] = 'true'\n      }\n    } else {\n      positional.push(token)\n    }\n  }\n  return { command: command ?? 'help', positional, flags }\n}\n\nconst HELP = `agent-knowledge — source-grounded knowledge graph CLI.\n\nOptions shared by the commands below:\n  --root <dir>        Knowledge-base root. Defaults to the current directory.\n  --pages-dir <dir>   Root-relative directory that holds Markdown pages. Defaults to knowledge.\n                      Bounds apply-write-blocks and selects what index builds.\n\nCommands:\n  init [--root .]\n      Create raw/sources, knowledge, and cache directories.\n  index [--root .] [--pages-dir knowledge] [--json]\n      Build .agent-knowledge/index.json from <pages-dir>/**/*.md.\n  source-add <path> [--root .] [--json]\n      Copy a file or directory into raw/sources and register immutable source records.\n  sources [--root .] [--json]\n      List registered sources.\n  apply-write-blocks <proposal-file> [--root .] [--pages-dir knowledge] [--intake]\n                     [--intake-threshold 0.82] [--json]\n      Apply safe ---FILE: <pages-dir>/...--- blocks emitted by an agent.\n      --intake refuses the whole proposal when a block duplicates a page already\n      in the store without citing it, naming it in contradicts, or reusing its\n      id, or when a block cites a page id that exists nowhere.\n      --intake-threshold sets the duplicate Jaccard similarity.\n  inspect [--root .] [--json]\n      Summarize page/source/edge counts, top pages, and lint state.\n  explain <page|id|query> [--root .] [--json]\n      Explain sources, links, inbound links, and related pages.\n  search <query> [--root .] [--pages-dir knowledge] [--limit 10] [--json]\n      Local BM25 and link-graph search (RRF fused) over the generated knowledge index.\n  graph [--root .] [--format summary|json]\n      Emit graph summary or JSON.\n  lint [--root .] [--json]\n      Run deterministic structural lint.\n  validate [--root .] [--strict] [--json]\n      Run schema + lint validation. Exits non-zero on blocking findings.\n  export [--root .] [--format json]\n      Export the current index.\n  viz [--root .] [--json]\n      Emit graph gaps and surprising connections.\n  version\n      Print package version.\n`\n\nasync function main(): Promise<number> {\n  const args = parseArgs(process.argv.slice(2))\n  const root = resolve(args.flags.root ?? '.')\n  const pages = pagesOptions(args)\n  switch (args.command) {\n    case 'init': {\n      const layout = await initKnowledgeBase(root)\n      process.stdout.write(`initialized knowledge base at ${layout.root}\\n`)\n      return 0\n    }\n    case 'index': {\n      const index = await writeKnowledgeIndex(root, pages)\n      if (args.flags.json === 'true') process.stdout.write(`${JSON.stringify(index, null, 2)}\\n`)\n      else\n        process.stdout.write(\n          `indexed ${index.pages.length} pages, ${index.graph.edges.length} edges\\n`,\n        )\n      return 0\n    }\n    case 'source-add': {\n      const [path] = args.positional\n      if (!path) {\n        process.stderr.write('source-add requires a file or directory path\\n')\n        return 1\n      }\n      await initKnowledgeBase(root)\n      const sources = await addSourcePath(root, resolve(path))\n      if (args.flags.json === 'true') process.stdout.write(`${JSON.stringify(sources, null, 2)}\\n`)\n      else for (const source of sources) process.stdout.write(`${source.id} ${source.uri}\\n`)\n      return 0\n    }\n    case 'sources': {\n      const registry = await loadSourceRegistry(root)\n      if (args.flags.json === 'true')\n        process.stdout.write(`${JSON.stringify(registry.sources, null, 2)}\\n`)\n      else {\n        for (const source of registry.sources)\n          process.stdout.write(`${source.id} ${source.title ?? source.uri} ${source.uri}\\n`)\n      }\n      return 0\n    }\n    case 'apply-write-blocks': {\n      const [proposalPath] = args.positional\n      if (!proposalPath) {\n        process.stderr.write('apply-write-blocks requires a proposal file\\n')\n        return 1\n      }\n      await initKnowledgeBase(root)\n      const result = await applyKnowledgeWriteBlocksFile(root, resolve(proposalPath), {\n        ...pages,\n        ...intakeOption(args),\n      })\n      await writeKnowledgeIndex(root, pages)\n      if (args.flags.json === 'true') process.stdout.write(`${JSON.stringify(result, null, 2)}\\n`)\n      else {\n        for (const path of result.written) process.stdout.write(`wrote ${path}\\n`)\n        for (const warning of result.warnings) process.stderr.write(`warning: ${warning}\\n`)\n      }\n      return result.warnings.length > 0 ? 2 : 0\n    }\n    case 'inspect': {\n      const index = await loadOrBuildIndex(root, pages)\n      const inspection = inspectKnowledgeIndex(index)\n      if (args.flags.json === 'true')\n        process.stdout.write(`${JSON.stringify(inspection, null, 2)}\\n`)\n      else {\n        process.stdout.write(\n          `pages=${inspection.pageCount} sources=${inspection.sourceCount} edges=${inspection.edgeCount} findings=${inspection.findingCount} blocking=${inspection.blockingFindingCount}\\n`,\n        )\n        for (const page of inspection.topPages.slice(0, 5))\n          process.stdout.write(`${page.degree} ${page.path} sources=${page.sources}\\n`)\n      }\n      return inspection.blockingFindingCount > 0 ? 2 : 0\n    }\n    case 'explain': {\n      const target = args.positional.join(' ')\n      if (!target) {\n        process.stderr.write('explain requires a page path, id, title, or query\\n')\n        return 1\n      }\n      const explanation = explainKnowledgeTarget(await loadOrBuildIndex(root, pages), target)\n      if (args.flags.json === 'true')\n        process.stdout.write(`${JSON.stringify(explanation, null, 2)}\\n`)\n      else {\n        process.stdout.write(`${explanation.page ? explanation.page.title : target}\\n`)\n        for (const source of explanation.sources)\n          process.stdout.write(`source ${source.id} ${source.title ?? source.uri}\\n`)\n        for (const link of explanation.links) process.stdout.write(`out ${link}\\n`)\n        for (const inbound of explanation.inbound) process.stdout.write(`in ${inbound}\\n`)\n        for (const related of explanation.related.slice(0, 5))\n          process.stdout.write(`related ${related.path} score=${related.score.toFixed(5)}\\n`)\n      }\n      return 0\n    }\n    case 'search': {\n      const query = args.positional.join(' ')\n      if (!query) {\n        process.stderr.write('search requires a query\\n')\n        return 1\n      }\n      const index = await loadOrBuildIndex(root, pages)\n      const results = searchKnowledge(index, query, Number(args.flags.limit ?? 10))\n      if (args.flags.json === 'true') {\n        process.stdout.write(`${JSON.stringify(results, null, 2)}\\n`)\n      } else {\n        for (const result of results) {\n          process.stdout.write(\n            `${result.rank}. ${result.page.title} (${result.page.path}) score=${result.score.toFixed(5)}\\n`,\n          )\n          if (result.snippet) process.stdout.write(`   ${result.snippet}\\n`)\n        }\n      }\n      return 0\n    }\n    case 'graph': {\n      const index = await loadOrBuildIndex(root, pages)\n      if ((args.flags.format ?? 'summary') === 'json')\n        process.stdout.write(`${JSON.stringify(index.graph, null, 2)}\\n`)\n      else\n        process.stdout.write(\n          `nodes=${index.graph.nodes.length} edges=${index.graph.edges.length}\\n`,\n        )\n      return 0\n    }\n    case 'lint': {\n      const index = await loadOrBuildIndex(root, pages)\n      const findings = lintKnowledgeIndex(index)\n      if (args.flags.json === 'true') process.stdout.write(`${JSON.stringify(findings, null, 2)}\\n`)\n      else {\n        if (findings.length === 0) process.stdout.write('no findings\\n')\n        for (const finding of findings) {\n          process.stdout.write(\n            `${finding.severity.toUpperCase()} ${finding.type}${finding.page ? ` ${finding.page}` : ''}: ${finding.message}\\n`,\n          )\n        }\n      }\n      return findings.some((finding) => finding.severity === 'error') ? 2 : 0\n    }\n    case 'validate': {\n      const result = validateKnowledgeIndex(await loadOrBuildIndex(root, pages), {\n        strict: args.flags.strict === 'true',\n      })\n      if (args.flags.json === 'true') process.stdout.write(`${JSON.stringify(result, null, 2)}\\n`)\n      else {\n        process.stdout.write(result.ok ? 'valid\\n' : 'invalid\\n')\n        for (const finding of result.findings)\n          process.stdout.write(\n            `${finding.severity.toUpperCase()} ${finding.type}${finding.page ? ` ${finding.page}` : ''}: ${finding.message}\\n`,\n          )\n      }\n      return result.ok ? 0 : 2\n    }\n    case 'export': {\n      const index = await loadOrBuildIndex(root, pages)\n      const format = args.flags.format ?? 'json'\n      if (format !== 'json') {\n        process.stderr.write('export currently supports --format json\\n')\n        return 1\n      }\n      process.stdout.write(`${JSON.stringify(index, null, 2)}\\n`)\n      return 0\n    }\n    case 'viz': {\n      const index = await loadOrBuildIndex(root, pages)\n      const viz = toKnowledgeVizGraph(index.graph)\n      const payload = {\n        graph: viz,\n        gaps: detectKnowledgeGaps(viz),\n        surprisingConnections: findSurprisingConnections(viz),\n      }\n      if (args.flags.json === 'true') process.stdout.write(`${JSON.stringify(payload, null, 2)}\\n`)\n      else {\n        process.stdout.write(\n          `communities=${viz.communities.length} gaps=${payload.gaps.length} surprising=${payload.surprisingConnections.length}\\n`,\n        )\n      }\n      return 0\n    }\n    case 'version': {\n      const pkg = JSON.parse(readFileSync(new URL('../package.json', import.meta.url), 'utf8')) as {\n        version: string\n      }\n      process.stdout.write(`${pkg.version}\\n`)\n      return 0\n    }\n    case 'help':\n    case '--help':\n    case '-h':\n      process.stdout.write(HELP)\n      return 0\n    default:\n      process.stderr.write(`unknown command: ${args.command}\\n${HELP}`)\n      return 1\n  }\n}\n\nfunction pagesOptions(args: Args): KnowledgePagesOptions {\n  const pagesDirectory = args.flags['pages-dir']\n  if (pagesDirectory === undefined) return {}\n  if (pagesDirectory === 'true') throw new Error('--pages-dir requires a directory')\n  return { pagesDirectory }\n}\n\nfunction intakeOption(args: Args): Pick<ApplyKnowledgeWriteBlocksOptions, 'intake'> {\n  const threshold = args.flags['intake-threshold']\n  if (args.flags.intake !== 'true') {\n    if (threshold !== undefined) throw new Error('--intake-threshold requires --intake')\n    return {}\n  }\n  if (threshold === undefined) return { intake: {} }\n  if (threshold === 'true') throw new Error('--intake-threshold requires a number')\n  const parsed = Number(threshold)\n  if (!Number.isFinite(parsed)) throw new Error(`--intake-threshold is not a number: ${threshold}`)\n  return { intake: { nearDuplicates: { threshold: parsed } } }\n}\n\nasync function loadOrBuildIndex(root: string, pages: KnowledgePagesOptions) {\n  const path = join(layoutFor(root).cacheDir, 'index.json')\n  if (existsSync(path))\n    return JSON.parse(readFileSync(path, 'utf8')) as Awaited<ReturnType<typeof buildKnowledgeIndex>>\n  return await writeKnowledgeIndex(root, pages)\n}\n\nmain()\n  .then((code) => process.exit(code))\n  .catch((err) => {\n    process.stderr.write(\n      `agent-knowledge error: ${err instanceof Error ? (err.stack ?? err.message) : String(err)}\\n`,\n    )\n    process.exit(1)\n  })\n"],"mappings":";;;;;;;AAqBA,SAAS,UAAU,MAAsB;CACvC,MAAM,CAAC,SAAS,GAAG,QAAQ;CAC3B,MAAM,aAAuB,CAAC;CAC9B,MAAM,QAAgC,CAAC;CACvC,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;EACpC,MAAM,QAAQ,KAAK;EACnB,IAAI,MAAM,WAAW,IAAI,GAAG;GAC1B,MAAM,MAAM,MAAM,MAAM,CAAC;GACzB,MAAM,OAAO,KAAK,IAAI;GACtB,IAAI,QAAQ,CAAC,KAAK,WAAW,IAAI,GAAG;IAClC,MAAM,OAAO;IACb;GACF,OACE,MAAM,OAAO;EAEjB,OACE,WAAW,KAAK,KAAK;CAEzB;CACA,OAAO;EAAE,SAAS,WAAW;EAAQ;EAAY;CAAM;AACzD;AAEA,MAAM,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2Cb,eAAe,OAAwB;CACrC,MAAM,OAAO,UAAU,QAAQ,KAAK,MAAM,CAAC,CAAC;CAC5C,MAAM,OAAO,QAAQ,KAAK,MAAM,QAAQ,GAAG;CAC3C,MAAM,QAAQ,aAAa,IAAI;CAC/B,QAAQ,KAAK,SAAb;EACE,KAAK,QAAQ;GACX,MAAM,SAAS,MAAM,kBAAkB,IAAI;GAC3C,QAAQ,OAAO,MAAM,iCAAiC,OAAO,KAAK,GAAG;GACrE,OAAO;EACT;EACA,KAAK,SAAS;GACZ,MAAM,QAAQ,MAAM,oBAAoB,MAAM,KAAK;GACnD,IAAI,KAAK,MAAM,SAAS,QAAQ,QAAQ,OAAO,MAAM,GAAG,KAAK,UAAU,OAAO,MAAM,CAAC,EAAE,GAAG;QAExF,QAAQ,OAAO,MACb,WAAW,MAAM,MAAM,OAAO,UAAU,MAAM,MAAM,MAAM,OAAO,SACnE;GACF,OAAO;EACT;EACA,KAAK,cAAc;GACjB,MAAM,CAAC,QAAQ,KAAK;GACpB,IAAI,CAAC,MAAM;IACT,QAAQ,OAAO,MAAM,gDAAgD;IACrE,OAAO;GACT;GACA,MAAM,kBAAkB,IAAI;GAC5B,MAAM,UAAU,MAAM,cAAc,MAAM,QAAQ,IAAI,CAAC;GACvD,IAAI,KAAK,MAAM,SAAS,QAAQ,QAAQ,OAAO,MAAM,GAAG,KAAK,UAAU,SAAS,MAAM,CAAC,EAAE,GAAG;QACvF,KAAK,MAAM,UAAU,SAAS,QAAQ,OAAO,MAAM,GAAG,OAAO,GAAG,GAAG,OAAO,IAAI,GAAG;GACtF,OAAO;EACT;EACA,KAAK,WAAW;GACd,MAAM,WAAW,MAAM,mBAAmB,IAAI;GAC9C,IAAI,KAAK,MAAM,SAAS,QACtB,QAAQ,OAAO,MAAM,GAAG,KAAK,UAAU,SAAS,SAAS,MAAM,CAAC,EAAE,GAAG;QAErE,KAAK,MAAM,UAAU,SAAS,SAC5B,QAAQ,OAAO,MAAM,GAAG,OAAO,GAAG,GAAG,OAAO,SAAS,OAAO,IAAI,GAAG,OAAO,IAAI,GAAG;GAErF,OAAO;EACT;EACA,KAAK,sBAAsB;GACzB,MAAM,CAAC,gBAAgB,KAAK;GAC5B,IAAI,CAAC,cAAc;IACjB,QAAQ,OAAO,MAAM,+CAA+C;IACpE,OAAO;GACT;GACA,MAAM,kBAAkB,IAAI;GAC5B,MAAM,SAAS,MAAM,8BAA8B,MAAM,QAAQ,YAAY,GAAG;IAC9E,GAAG;IACH,GAAG,aAAa,IAAI;GACtB,CAAC;GACD,MAAM,oBAAoB,MAAM,KAAK;GACrC,IAAI,KAAK,MAAM,SAAS,QAAQ,QAAQ,OAAO,MAAM,GAAG,KAAK,UAAU,QAAQ,MAAM,CAAC,EAAE,GAAG;QACtF;IACH,KAAK,MAAM,QAAQ,OAAO,SAAS,QAAQ,OAAO,MAAM,SAAS,KAAK,GAAG;IACzE,KAAK,MAAM,WAAW,OAAO,UAAU,QAAQ,OAAO,MAAM,YAAY,QAAQ,GAAG;GACrF;GACA,OAAO,OAAO,SAAS,SAAS,IAAI,IAAI;EAC1C;EACA,KAAK,WAAW;GACd,MAAM,QAAQ,MAAM,iBAAiB,MAAM,KAAK;GAChD,MAAM,aAAa,sBAAsB,KAAK;GAC9C,IAAI,KAAK,MAAM,SAAS,QACtB,QAAQ,OAAO,MAAM,GAAG,KAAK,UAAU,YAAY,MAAM,CAAC,EAAE,GAAG;QAC5D;IACH,QAAQ,OAAO,MACb,SAAS,WAAW,UAAU,WAAW,WAAW,YAAY,SAAS,WAAW,UAAU,YAAY,WAAW,aAAa,YAAY,WAAW,qBAAqB,GAChL;IACA,KAAK,MAAM,QAAQ,WAAW,SAAS,MAAM,GAAG,CAAC,GAC/C,QAAQ,OAAO,MAAM,GAAG,KAAK,OAAO,GAAG,KAAK,KAAK,WAAW,KAAK,QAAQ,GAAG;GAChF;GACA,OAAO,WAAW,uBAAuB,IAAI,IAAI;EACnD;EACA,KAAK,WAAW;GACd,MAAM,SAAS,KAAK,WAAW,KAAK,GAAG;GACvC,IAAI,CAAC,QAAQ;IACX,QAAQ,OAAO,MAAM,qDAAqD;IAC1E,OAAO;GACT;GACA,MAAM,cAAc,uBAAuB,MAAM,iBAAiB,MAAM,KAAK,GAAG,MAAM;GACtF,IAAI,KAAK,MAAM,SAAS,QACtB,QAAQ,OAAO,MAAM,GAAG,KAAK,UAAU,aAAa,MAAM,CAAC,EAAE,GAAG;QAC7D;IACH,QAAQ,OAAO,MAAM,GAAG,YAAY,OAAO,YAAY,KAAK,QAAQ,OAAO,GAAG;IAC9E,KAAK,MAAM,UAAU,YAAY,SAC/B,QAAQ,OAAO,MAAM,UAAU,OAAO,GAAG,GAAG,OAAO,SAAS,OAAO,IAAI,GAAG;IAC5E,KAAK,MAAM,QAAQ,YAAY,OAAO,QAAQ,OAAO,MAAM,OAAO,KAAK,GAAG;IAC1E,KAAK,MAAM,WAAW,YAAY,SAAS,QAAQ,OAAO,MAAM,MAAM,QAAQ,GAAG;IACjF,KAAK,MAAM,WAAW,YAAY,QAAQ,MAAM,GAAG,CAAC,GAClD,QAAQ,OAAO,MAAM,WAAW,QAAQ,KAAK,SAAS,QAAQ,MAAM,QAAQ,CAAC,EAAE,GAAG;GACtF;GACA,OAAO;EACT;EACA,KAAK,UAAU;GACb,MAAM,QAAQ,KAAK,WAAW,KAAK,GAAG;GACtC,IAAI,CAAC,OAAO;IACV,QAAQ,OAAO,MAAM,2BAA2B;IAChD,OAAO;GACT;GACA,MAAM,QAAQ,MAAM,iBAAiB,MAAM,KAAK;GAChD,MAAM,UAAU,gBAAgB,OAAO,OAAO,OAAO,KAAK,MAAM,SAAS,EAAE,CAAC;GAC5E,IAAI,KAAK,MAAM,SAAS,QACtB,QAAQ,OAAO,MAAM,GAAG,KAAK,UAAU,SAAS,MAAM,CAAC,EAAE,GAAG;QAE5D,KAAK,MAAM,UAAU,SAAS;IAC5B,QAAQ,OAAO,MACb,GAAG,OAAO,KAAK,IAAI,OAAO,KAAK,MAAM,IAAI,OAAO,KAAK,KAAK,UAAU,OAAO,MAAM,QAAQ,CAAC,EAAE,GAC9F;IACA,IAAI,OAAO,SAAS,QAAQ,OAAO,MAAM,MAAM,OAAO,QAAQ,GAAG;GACnE;GAEF,OAAO;EACT;EACA,KAAK,SAAS;GACZ,MAAM,QAAQ,MAAM,iBAAiB,MAAM,KAAK;GAChD,KAAK,KAAK,MAAM,UAAU,eAAe,QACvC,QAAQ,OAAO,MAAM,GAAG,KAAK,UAAU,MAAM,OAAO,MAAM,CAAC,EAAE,GAAG;QAEhE,QAAQ,OAAO,MACb,SAAS,MAAM,MAAM,MAAM,OAAO,SAAS,MAAM,MAAM,MAAM,OAAO,GACtE;GACF,OAAO;EACT;EACA,KAAK,QAAQ;GACX,MAAM,QAAQ,MAAM,iBAAiB,MAAM,KAAK;GAChD,MAAM,WAAW,mBAAmB,KAAK;GACzC,IAAI,KAAK,MAAM,SAAS,QAAQ,QAAQ,OAAO,MAAM,GAAG,KAAK,UAAU,UAAU,MAAM,CAAC,EAAE,GAAG;QACxF;IACH,IAAI,SAAS,WAAW,GAAG,QAAQ,OAAO,MAAM,eAAe;IAC/D,KAAK,MAAM,WAAW,UACpB,QAAQ,OAAO,MACb,GAAG,QAAQ,SAAS,YAAY,EAAE,GAAG,QAAQ,OAAO,QAAQ,OAAO,IAAI,QAAQ,SAAS,GAAG,IAAI,QAAQ,QAAQ,GACjH;GAEJ;GACA,OAAO,SAAS,MAAM,YAAY,QAAQ,aAAa,OAAO,IAAI,IAAI;EACxE;EACA,KAAK,YAAY;GACf,MAAM,SAAS,uBAAuB,MAAM,iBAAiB,MAAM,KAAK,GAAG,EACzE,QAAQ,KAAK,MAAM,WAAW,OAChC,CAAC;GACD,IAAI,KAAK,MAAM,SAAS,QAAQ,QAAQ,OAAO,MAAM,GAAG,KAAK,UAAU,QAAQ,MAAM,CAAC,EAAE,GAAG;QACtF;IACH,QAAQ,OAAO,MAAM,OAAO,KAAK,YAAY,WAAW;IACxD,KAAK,MAAM,WAAW,OAAO,UAC3B,QAAQ,OAAO,MACb,GAAG,QAAQ,SAAS,YAAY,EAAE,GAAG,QAAQ,OAAO,QAAQ,OAAO,IAAI,QAAQ,SAAS,GAAG,IAAI,QAAQ,QAAQ,GACjH;GACJ;GACA,OAAO,OAAO,KAAK,IAAI;EACzB;EACA,KAAK,UAAU;GACb,MAAM,QAAQ,MAAM,iBAAiB,MAAM,KAAK;GAEhD,KADe,KAAK,MAAM,UAAU,YACrB,QAAQ;IACrB,QAAQ,OAAO,MAAM,2CAA2C;IAChE,OAAO;GACT;GACA,QAAQ,OAAO,MAAM,GAAG,KAAK,UAAU,OAAO,MAAM,CAAC,EAAE,GAAG;GAC1D,OAAO;EACT;EACA,KAAK,OAAO;GACV,MAAM,QAAQ,MAAM,iBAAiB,MAAM,KAAK;GAChD,MAAM,MAAM,oBAAoB,MAAM,KAAK;GAC3C,MAAM,UAAU;IACd,OAAO;IACP,MAAM,oBAAoB,GAAG;IAC7B,uBAAuB,0BAA0B,GAAG;GACtD;GACA,IAAI,KAAK,MAAM,SAAS,QAAQ,QAAQ,OAAO,MAAM,GAAG,KAAK,UAAU,SAAS,MAAM,CAAC,EAAE,GAAG;QAE1F,QAAQ,OAAO,MACb,eAAe,IAAI,YAAY,OAAO,QAAQ,QAAQ,KAAK,OAAO,cAAc,QAAQ,sBAAsB,OAAO,GACvH;GAEF,OAAO;EACT;EACA,KAAK,WAAW;GACd,MAAM,MAAM,KAAK,MAAM,aAAa,IAAI,IAAI,mBAAmB,YAAY,GAAG,GAAG,MAAM,CAAC;GAGxF,QAAQ,OAAO,MAAM,GAAG,IAAI,QAAQ,GAAG;GACvC,OAAO;EACT;EACA,KAAK;EACL,KAAK;EACL,KAAK;GACH,QAAQ,OAAO,MAAM,IAAI;GACzB,OAAO;EACT;GACE,QAAQ,OAAO,MAAM,oBAAoB,KAAK,QAAQ,IAAI,MAAM;GAChE,OAAO;CACX;AACF;AAEA,SAAS,aAAa,MAAmC;CACvD,MAAM,iBAAiB,KAAK,MAAM;CAClC,IAAI,mBAAmB,KAAA,GAAW,OAAO,CAAC;CAC1C,IAAI,mBAAmB,QAAQ,MAAM,IAAI,MAAM,kCAAkC;CACjF,OAAO,EAAE,eAAe;AAC1B;AAEA,SAAS,aAAa,MAA8D;CAClF,MAAM,YAAY,KAAK,MAAM;CAC7B,IAAI,KAAK,MAAM,WAAW,QAAQ;EAChC,IAAI,cAAc,KAAA,GAAW,MAAM,IAAI,MAAM,sCAAsC;EACnF,OAAO,CAAC;CACV;CACA,IAAI,cAAc,KAAA,GAAW,OAAO,EAAE,QAAQ,CAAC,EAAE;CACjD,IAAI,cAAc,QAAQ,MAAM,IAAI,MAAM,sCAAsC;CAChF,MAAM,SAAS,OAAO,SAAS;CAC/B,IAAI,CAAC,OAAO,SAAS,MAAM,GAAG,MAAM,IAAI,MAAM,uCAAuC,WAAW;CAChG,OAAO,EAAE,QAAQ,EAAE,gBAAgB,EAAE,WAAW,OAAO,EAAE,EAAE;AAC7D;AAEA,eAAe,iBAAiB,MAAc,OAA8B;CAC1E,MAAM,OAAO,KAAK,UAAU,IAAI,CAAC,CAAC,UAAU,YAAY;CACxD,IAAI,WAAW,IAAI,GACjB,OAAO,KAAK,MAAM,aAAa,MAAM,MAAM,CAAC;CAC9C,OAAO,MAAM,oBAAoB,MAAM,KAAK;AAC9C;AAEA,KAAK,CAAC,CACH,MAAM,SAAS,QAAQ,KAAK,IAAI,CAAC,CAAC,CAClC,OAAO,QAAQ;CACd,QAAQ,OAAO,MACb,0BAA0B,eAAe,QAAS,IAAI,SAAS,IAAI,UAAW,OAAO,GAAG,EAAE,GAC5F;CACA,QAAQ,KAAK,CAAC;AAChB,CAAC"}
+{"version":3,"file":"cli.js","names":[],"sources":["../src/cli.ts"],"sourcesContent":["#!/usr/bin/env node\nimport { existsSync, readFileSync } from 'node:fs'\nimport { join, resolve } from 'node:path'\n\nimport { type buildKnowledgeIndex, writeKnowledgeIndex } from './indexer'\nimport { explainKnowledgeTarget, inspectKnowledgeIndex } from './inspect'\nimport { lintKnowledgeIndex } from './lint'\nimport type { KnowledgePagesOptions } from './pages-directory'\nimport { type ApplyKnowledgeWriteBlocksOptions, applyKnowledgeWriteBlocksFile } from './proposals'\nimport { searchKnowledge } from './search'\nimport { addSourcePath, loadSourceRegistry } from './sources'\nimport { initKnowledgeBase, layoutFor } from './store'\nimport { validateKnowledgeIndex } from './validate'\nimport { detectKnowledgeGaps, findSurprisingConnections, toKnowledgeVizGraph } from './viz/index'\n\ninterface Args {\n  command: string\n  positional: string[]\n  flags: Record<string, string>\n}\n\nfunction parseArgs(argv: string[]): Args {\n  const [command, ...rest] = argv\n  const positional: string[] = []\n  const flags: Record<string, string> = {}\n  for (let i = 0; i < rest.length; i++) {\n    const token = rest[i]!\n    if (token.startsWith('--')) {\n      const key = token.slice(2)\n      const next = rest[i + 1]\n      if (next && !next.startsWith('--')) {\n        flags[key] = next\n        i++\n      } else {\n        flags[key] = 'true'\n      }\n    } else {\n      positional.push(token)\n    }\n  }\n  return { command: command ?? 'help', positional, flags }\n}\n\nconst HELP = `agent-knowledge — source-grounded knowledge graph CLI.\n\nOptions shared by the commands below:\n  --root <dir>        Knowledge-base root. Defaults to the current directory.\n  --pages-dir <dir>   Root-relative directory that holds Markdown pages. Defaults to knowledge.\n                      Bounds apply-write-blocks and selects what index builds.\n\nCommands:\n  init [--root .]\n      Create raw/sources, knowledge, and cache directories.\n  index [--root .] [--pages-dir knowledge] [--json]\n      Build .agent-knowledge/index.json from <pages-dir>/**/*.md.\n  source-add <path> [--root .] [--json]\n      Copy a file or directory into raw/sources and register immutable source records.\n  sources [--root .] [--json]\n      List registered sources.\n  apply-write-blocks <proposal-file> [--root .] [--pages-dir knowledge] [--intake]\n                     [--intake-threshold 0.82] [--json]\n      Apply safe ---FILE: <pages-dir>/...--- blocks emitted by an agent.\n      --intake refuses the whole proposal when a block duplicates a page already\n      in the store without citing it, naming it in contradicts, or reusing its\n      id, or when a block cites a page id that exists nowhere.\n      --intake-threshold sets the duplicate Jaccard similarity.\n  inspect [--root .] [--json]\n      Summarize page/source/edge counts, top pages, and lint state.\n  explain <page|id|query> [--root .] [--json]\n      Explain sources, links, inbound links, and related pages.\n  search <query> [--root .] [--pages-dir knowledge] [--limit 10] [--json]\n      Local BM25 and link-graph search (RRF fused) over the generated knowledge index.\n  graph [--root .] [--format summary|json]\n      Emit graph summary or JSON.\n  lint [--root .] [--json]\n      Run deterministic structural lint.\n  validate [--root .] [--strict] [--json]\n      Run schema + lint validation. Exits non-zero on blocking findings.\n  export [--root .] [--format json]\n      Export the current index.\n  viz [--root .] [--json]\n      Emit graph gaps and surprising connections.\n  version\n      Print package version.\n`\n\nasync function main(): Promise<number> {\n  const args = parseArgs(process.argv.slice(2))\n  const root = resolve(args.flags.root ?? '.')\n  const pages = pagesOptions(args)\n  switch (args.command) {\n    case 'init': {\n      const layout = await initKnowledgeBase(root)\n      process.stdout.write(`initialized knowledge base at ${layout.root}\\n`)\n      return 0\n    }\n    case 'index': {\n      const index = await writeKnowledgeIndex(root, pages)\n      if (args.flags.json === 'true') process.stdout.write(`${JSON.stringify(index, null, 2)}\\n`)\n      else\n        process.stdout.write(\n          `indexed ${index.pages.length} pages, ${index.graph.edges.length} edges\\n`,\n        )\n      return 0\n    }\n    case 'source-add': {\n      const [path] = args.positional\n      if (!path) {\n        process.stderr.write('source-add requires a file or directory path\\n')\n        return 1\n      }\n      await initKnowledgeBase(root)\n      const sources = await addSourcePath(root, resolve(path))\n      if (args.flags.json === 'true') process.stdout.write(`${JSON.stringify(sources, null, 2)}\\n`)\n      else for (const source of sources) process.stdout.write(`${source.id} ${source.uri}\\n`)\n      return 0\n    }\n    case 'sources': {\n      const registry = await loadSourceRegistry(root)\n      if (args.flags.json === 'true')\n        process.stdout.write(`${JSON.stringify(registry.sources, null, 2)}\\n`)\n      else {\n        for (const source of registry.sources)\n          process.stdout.write(`${source.id} ${source.title ?? source.uri} ${source.uri}\\n`)\n      }\n      return 0\n    }\n    case 'apply-write-blocks': {\n      const [proposalPath] = args.positional\n      if (!proposalPath) {\n        process.stderr.write('apply-write-blocks requires a proposal file\\n')\n        return 1\n      }\n      await initKnowledgeBase(root)\n      const result = await applyKnowledgeWriteBlocksFile(root, resolve(proposalPath), {\n        ...pages,\n        ...intakeOption(args),\n      })\n      await writeKnowledgeIndex(root, pages)\n      if (args.flags.json === 'true') process.stdout.write(`${JSON.stringify(result, null, 2)}\\n`)\n      else {\n        for (const path of result.written) process.stdout.write(`wrote ${path}\\n`)\n        for (const warning of result.warnings) process.stderr.write(`warning: ${warning}\\n`)\n      }\n      return result.warnings.length > 0 ? 2 : 0\n    }\n    case 'inspect': {\n      const index = await loadOrBuildIndex(root, pages)\n      const inspection = inspectKnowledgeIndex(index)\n      if (args.flags.json === 'true')\n        process.stdout.write(`${JSON.stringify(inspection, null, 2)}\\n`)\n      else {\n        process.stdout.write(\n          `pages=${inspection.pageCount} sources=${inspection.sourceCount} edges=${inspection.edgeCount} findings=${inspection.findingCount} blocking=${inspection.blockingFindingCount}\\n`,\n        )\n        for (const page of inspection.topPages.slice(0, 5))\n          process.stdout.write(`${page.degree} ${page.path} sources=${page.sources}\\n`)\n      }\n      return inspection.blockingFindingCount > 0 ? 2 : 0\n    }\n    case 'explain': {\n      const target = args.positional.join(' ')\n      if (!target) {\n        process.stderr.write('explain requires a page path, id, title, or query\\n')\n        return 1\n      }\n      const explanation = explainKnowledgeTarget(await loadOrBuildIndex(root, pages), target)\n      if (args.flags.json === 'true')\n        process.stdout.write(`${JSON.stringify(explanation, null, 2)}\\n`)\n      else {\n        process.stdout.write(`${explanation.page ? explanation.page.title : target}\\n`)\n        for (const source of explanation.sources)\n          process.stdout.write(`source ${source.id} ${source.title ?? source.uri}\\n`)\n        for (const link of explanation.links) process.stdout.write(`out ${link}\\n`)\n        for (const inbound of explanation.inbound) process.stdout.write(`in ${inbound}\\n`)\n        for (const related of explanation.related.slice(0, 5))\n          process.stdout.write(`related ${related.path} score=${related.score.toFixed(5)}\\n`)\n      }\n      return 0\n    }\n    case 'search': {\n      const query = args.positional.join(' ')\n      if (!query) {\n        process.stderr.write('search requires a query\\n')\n        return 1\n      }\n      const index = await loadOrBuildIndex(root, pages)\n      const results = searchKnowledge(index, query, Number(args.flags.limit ?? 10))\n      if (args.flags.json === 'true') {\n        process.stdout.write(`${JSON.stringify(results, null, 2)}\\n`)\n      } else {\n        for (const result of results) {\n          process.stdout.write(\n            `${result.rank}. ${result.page.title} (${result.page.path}) score=${result.score.toFixed(5)}\\n`,\n          )\n          if (result.snippet) process.stdout.write(`   ${result.snippet}\\n`)\n        }\n      }\n      return 0\n    }\n    case 'graph': {\n      const index = await loadOrBuildIndex(root, pages)\n      if ((args.flags.format ?? 'summary') === 'json')\n        process.stdout.write(`${JSON.stringify(index.graph, null, 2)}\\n`)\n      else\n        process.stdout.write(\n          `nodes=${index.graph.nodes.length} edges=${index.graph.edges.length}\\n`,\n        )\n      return 0\n    }\n    case 'lint': {\n      const index = await loadOrBuildIndex(root, pages)\n      const findings = lintKnowledgeIndex(index)\n      if (args.flags.json === 'true') process.stdout.write(`${JSON.stringify(findings, null, 2)}\\n`)\n      else {\n        if (findings.length === 0) process.stdout.write('no findings\\n')\n        for (const finding of findings) {\n          process.stdout.write(\n            `${finding.severity.toUpperCase()} ${finding.type}${finding.page ? ` ${finding.page}` : ''}: ${finding.message}\\n`,\n          )\n        }\n      }\n      return findings.some((finding) => finding.severity === 'error') ? 2 : 0\n    }\n    case 'validate': {\n      const result = validateKnowledgeIndex(await loadOrBuildIndex(root, pages), {\n        strict: args.flags.strict === 'true',\n      })\n      if (args.flags.json === 'true') process.stdout.write(`${JSON.stringify(result, null, 2)}\\n`)\n      else {\n        process.stdout.write(result.ok ? 'valid\\n' : 'invalid\\n')\n        for (const finding of result.findings)\n          process.stdout.write(\n            `${finding.severity.toUpperCase()} ${finding.type}${finding.page ? ` ${finding.page}` : ''}: ${finding.message}\\n`,\n          )\n      }\n      return result.ok ? 0 : 2\n    }\n    case 'export': {\n      const index = await loadOrBuildIndex(root, pages)\n      const format = args.flags.format ?? 'json'\n      if (format !== 'json') {\n        process.stderr.write('export currently supports --format json\\n')\n        return 1\n      }\n      process.stdout.write(`${JSON.stringify(index, null, 2)}\\n`)\n      return 0\n    }\n    case 'viz': {\n      const index = await loadOrBuildIndex(root, pages)\n      const viz = toKnowledgeVizGraph(index.graph)\n      const payload = {\n        graph: viz,\n        gaps: detectKnowledgeGaps(viz),\n        surprisingConnections: findSurprisingConnections(viz),\n      }\n      if (args.flags.json === 'true') process.stdout.write(`${JSON.stringify(payload, null, 2)}\\n`)\n      else {\n        process.stdout.write(\n          `communities=${viz.communities.length} gaps=${payload.gaps.length} surprising=${payload.surprisingConnections.length}\\n`,\n        )\n      }\n      return 0\n    }\n    case 'version': {\n      const pkg = JSON.parse(readFileSync(new URL('../package.json', import.meta.url), 'utf8')) as {\n        version: string\n      }\n      process.stdout.write(`${pkg.version}\\n`)\n      return 0\n    }\n    case 'help':\n    case '--help':\n    case '-h':\n      process.stdout.write(HELP)\n      return 0\n    default:\n      process.stderr.write(`unknown command: ${args.command}\\n${HELP}`)\n      return 1\n  }\n}\n\nfunction pagesOptions(args: Args): KnowledgePagesOptions {\n  const pagesDirectory = args.flags['pages-dir']\n  if (pagesDirectory === undefined) return {}\n  if (pagesDirectory === 'true') throw new Error('--pages-dir requires a directory')\n  return { pagesDirectory }\n}\n\nfunction intakeOption(args: Args): Pick<ApplyKnowledgeWriteBlocksOptions, 'intake'> {\n  const threshold = args.flags['intake-threshold']\n  if (args.flags.intake !== 'true') {\n    if (threshold !== undefined) throw new Error('--intake-threshold requires --intake')\n    return {}\n  }\n  if (threshold === undefined) return { intake: {} }\n  if (threshold === 'true') throw new Error('--intake-threshold requires a number')\n  const parsed = Number(threshold)\n  if (!Number.isFinite(parsed)) throw new Error(`--intake-threshold is not a number: ${threshold}`)\n  return { intake: { nearDuplicates: { threshold: parsed } } }\n}\n\nasync function loadOrBuildIndex(root: string, pages: KnowledgePagesOptions) {\n  const path = join(layoutFor(root).cacheDir, 'index.json')\n  if (existsSync(path))\n    return JSON.parse(readFileSync(path, 'utf8')) as Awaited<ReturnType<typeof buildKnowledgeIndex>>\n  return await writeKnowledgeIndex(root, pages)\n}\n\nmain()\n  .then((code) => process.exit(code))\n  .catch((err) => {\n    process.stderr.write(\n      `agent-knowledge error: ${err instanceof Error ? (err.stack ?? err.message) : String(err)}\\n`,\n    )\n    process.exit(1)\n  })\n"],"mappings":";;;;;;AAqBA,SAAS,UAAU,MAAsB;CACvC,MAAM,CAAC,SAAS,GAAG,QAAQ;CAC3B,MAAM,aAAuB,CAAC;CAC9B,MAAM,QAAgC,CAAC;CACvC,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;EACpC,MAAM,QAAQ,KAAK;EACnB,IAAI,MAAM,WAAW,IAAI,GAAG;GAC1B,MAAM,MAAM,MAAM,MAAM,CAAC;GACzB,MAAM,OAAO,KAAK,IAAI;GACtB,IAAI,QAAQ,CAAC,KAAK,WAAW,IAAI,GAAG;IAClC,MAAM,OAAO;IACb;GACF,OACE,MAAM,OAAO;EAEjB,OACE,WAAW,KAAK,KAAK;CAEzB;CACA,OAAO;EAAE,SAAS,WAAW;EAAQ;EAAY;CAAM;AACzD;AAEA,MAAM,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2Cb,eAAe,OAAwB;CACrC,MAAM,OAAO,UAAU,QAAQ,KAAK,MAAM,CAAC,CAAC;CAC5C,MAAM,OAAO,QAAQ,KAAK,MAAM,QAAQ,GAAG;CAC3C,MAAM,QAAQ,aAAa,IAAI;CAC/B,QAAQ,KAAK,SAAb;EACE,KAAK,QAAQ;GACX,MAAM,SAAS,MAAM,kBAAkB,IAAI;GAC3C,QAAQ,OAAO,MAAM,iCAAiC,OAAO,KAAK,GAAG;GACrE,OAAO;EACT;EACA,KAAK,SAAS;GACZ,MAAM,QAAQ,MAAM,oBAAoB,MAAM,KAAK;GACnD,IAAI,KAAK,MAAM,SAAS,QAAQ,QAAQ,OAAO,MAAM,GAAG,KAAK,UAAU,OAAO,MAAM,CAAC,EAAE,GAAG;QAExF,QAAQ,OAAO,MACb,WAAW,MAAM,MAAM,OAAO,UAAU,MAAM,MAAM,MAAM,OAAO,SACnE;GACF,OAAO;EACT;EACA,KAAK,cAAc;GACjB,MAAM,CAAC,QAAQ,KAAK;GACpB,IAAI,CAAC,MAAM;IACT,QAAQ,OAAO,MAAM,gDAAgD;IACrE,OAAO;GACT;GACA,MAAM,kBAAkB,IAAI;GAC5B,MAAM,UAAU,MAAM,cAAc,MAAM,QAAQ,IAAI,CAAC;GACvD,IAAI,KAAK,MAAM,SAAS,QAAQ,QAAQ,OAAO,MAAM,GAAG,KAAK,UAAU,SAAS,MAAM,CAAC,EAAE,GAAG;QACvF,KAAK,MAAM,UAAU,SAAS,QAAQ,OAAO,MAAM,GAAG,OAAO,GAAG,GAAG,OAAO,IAAI,GAAG;GACtF,OAAO;EACT;EACA,KAAK,WAAW;GACd,MAAM,WAAW,MAAM,mBAAmB,IAAI;GAC9C,IAAI,KAAK,MAAM,SAAS,QACtB,QAAQ,OAAO,MAAM,GAAG,KAAK,UAAU,SAAS,SAAS,MAAM,CAAC,EAAE,GAAG;QAErE,KAAK,MAAM,UAAU,SAAS,SAC5B,QAAQ,OAAO,MAAM,GAAG,OAAO,GAAG,GAAG,OAAO,SAAS,OAAO,IAAI,GAAG,OAAO,IAAI,GAAG;GAErF,OAAO;EACT;EACA,KAAK,sBAAsB;GACzB,MAAM,CAAC,gBAAgB,KAAK;GAC5B,IAAI,CAAC,cAAc;IACjB,QAAQ,OAAO,MAAM,+CAA+C;IACpE,OAAO;GACT;GACA,MAAM,kBAAkB,IAAI;GAC5B,MAAM,SAAS,MAAM,8BAA8B,MAAM,QAAQ,YAAY,GAAG;IAC9E,GAAG;IACH,GAAG,aAAa,IAAI;GACtB,CAAC;GACD,MAAM,oBAAoB,MAAM,KAAK;GACrC,IAAI,KAAK,MAAM,SAAS,QAAQ,QAAQ,OAAO,MAAM,GAAG,KAAK,UAAU,QAAQ,MAAM,CAAC,EAAE,GAAG;QACtF;IACH,KAAK,MAAM,QAAQ,OAAO,SAAS,QAAQ,OAAO,MAAM,SAAS,KAAK,GAAG;IACzE,KAAK,MAAM,WAAW,OAAO,UAAU,QAAQ,OAAO,MAAM,YAAY,QAAQ,GAAG;GACrF;GACA,OAAO,OAAO,SAAS,SAAS,IAAI,IAAI;EAC1C;EACA,KAAK,WAAW;GACd,MAAM,QAAQ,MAAM,iBAAiB,MAAM,KAAK;GAChD,MAAM,aAAa,sBAAsB,KAAK;GAC9C,IAAI,KAAK,MAAM,SAAS,QACtB,QAAQ,OAAO,MAAM,GAAG,KAAK,UAAU,YAAY,MAAM,CAAC,EAAE,GAAG;QAC5D;IACH,QAAQ,OAAO,MACb,SAAS,WAAW,UAAU,WAAW,WAAW,YAAY,SAAS,WAAW,UAAU,YAAY,WAAW,aAAa,YAAY,WAAW,qBAAqB,GAChL;IACA,KAAK,MAAM,QAAQ,WAAW,SAAS,MAAM,GAAG,CAAC,GAC/C,QAAQ,OAAO,MAAM,GAAG,KAAK,OAAO,GAAG,KAAK,KAAK,WAAW,KAAK,QAAQ,GAAG;GAChF;GACA,OAAO,WAAW,uBAAuB,IAAI,IAAI;EACnD;EACA,KAAK,WAAW;GACd,MAAM,SAAS,KAAK,WAAW,KAAK,GAAG;GACvC,IAAI,CAAC,QAAQ;IACX,QAAQ,OAAO,MAAM,qDAAqD;IAC1E,OAAO;GACT;GACA,MAAM,cAAc,uBAAuB,MAAM,iBAAiB,MAAM,KAAK,GAAG,MAAM;GACtF,IAAI,KAAK,MAAM,SAAS,QACtB,QAAQ,OAAO,MAAM,GAAG,KAAK,UAAU,aAAa,MAAM,CAAC,EAAE,GAAG;QAC7D;IACH,QAAQ,OAAO,MAAM,GAAG,YAAY,OAAO,YAAY,KAAK,QAAQ,OAAO,GAAG;IAC9E,KAAK,MAAM,UAAU,YAAY,SAC/B,QAAQ,OAAO,MAAM,UAAU,OAAO,GAAG,GAAG,OAAO,SAAS,OAAO,IAAI,GAAG;IAC5E,KAAK,MAAM,QAAQ,YAAY,OAAO,QAAQ,OAAO,MAAM,OAAO,KAAK,GAAG;IAC1E,KAAK,MAAM,WAAW,YAAY,SAAS,QAAQ,OAAO,MAAM,MAAM,QAAQ,GAAG;IACjF,KAAK,MAAM,WAAW,YAAY,QAAQ,MAAM,GAAG,CAAC,GAClD,QAAQ,OAAO,MAAM,WAAW,QAAQ,KAAK,SAAS,QAAQ,MAAM,QAAQ,CAAC,EAAE,GAAG;GACtF;GACA,OAAO;EACT;EACA,KAAK,UAAU;GACb,MAAM,QAAQ,KAAK,WAAW,KAAK,GAAG;GACtC,IAAI,CAAC,OAAO;IACV,QAAQ,OAAO,MAAM,2BAA2B;IAChD,OAAO;GACT;GACA,MAAM,QAAQ,MAAM,iBAAiB,MAAM,KAAK;GAChD,MAAM,UAAU,gBAAgB,OAAO,OAAO,OAAO,KAAK,MAAM,SAAS,EAAE,CAAC;GAC5E,IAAI,KAAK,MAAM,SAAS,QACtB,QAAQ,OAAO,MAAM,GAAG,KAAK,UAAU,SAAS,MAAM,CAAC,EAAE,GAAG;QAE5D,KAAK,MAAM,UAAU,SAAS;IAC5B,QAAQ,OAAO,MACb,GAAG,OAAO,KAAK,IAAI,OAAO,KAAK,MAAM,IAAI,OAAO,KAAK,KAAK,UAAU,OAAO,MAAM,QAAQ,CAAC,EAAE,GAC9F;IACA,IAAI,OAAO,SAAS,QAAQ,OAAO,MAAM,MAAM,OAAO,QAAQ,GAAG;GACnE;GAEF,OAAO;EACT;EACA,KAAK,SAAS;GACZ,MAAM,QAAQ,MAAM,iBAAiB,MAAM,KAAK;GAChD,KAAK,KAAK,MAAM,UAAU,eAAe,QACvC,QAAQ,OAAO,MAAM,GAAG,KAAK,UAAU,MAAM,OAAO,MAAM,CAAC,EAAE,GAAG;QAEhE,QAAQ,OAAO,MACb,SAAS,MAAM,MAAM,MAAM,OAAO,SAAS,MAAM,MAAM,MAAM,OAAO,GACtE;GACF,OAAO;EACT;EACA,KAAK,QAAQ;GACX,MAAM,QAAQ,MAAM,iBAAiB,MAAM,KAAK;GAChD,MAAM,WAAW,mBAAmB,KAAK;GACzC,IAAI,KAAK,MAAM,SAAS,QAAQ,QAAQ,OAAO,MAAM,GAAG,KAAK,UAAU,UAAU,MAAM,CAAC,EAAE,GAAG;QACxF;IACH,IAAI,SAAS,WAAW,GAAG,QAAQ,OAAO,MAAM,eAAe;IAC/D,KAAK,MAAM,WAAW,UACpB,QAAQ,OAAO,MACb,GAAG,QAAQ,SAAS,YAAY,EAAE,GAAG,QAAQ,OAAO,QAAQ,OAAO,IAAI,QAAQ,SAAS,GAAG,IAAI,QAAQ,QAAQ,GACjH;GAEJ;GACA,OAAO,SAAS,MAAM,YAAY,QAAQ,aAAa,OAAO,IAAI,IAAI;EACxE;EACA,KAAK,YAAY;GACf,MAAM,SAAS,uBAAuB,MAAM,iBAAiB,MAAM,KAAK,GAAG,EACzE,QAAQ,KAAK,MAAM,WAAW,OAChC,CAAC;GACD,IAAI,KAAK,MAAM,SAAS,QAAQ,QAAQ,OAAO,MAAM,GAAG,KAAK,UAAU,QAAQ,MAAM,CAAC,EAAE,GAAG;QACtF;IACH,QAAQ,OAAO,MAAM,OAAO,KAAK,YAAY,WAAW;IACxD,KAAK,MAAM,WAAW,OAAO,UAC3B,QAAQ,OAAO,MACb,GAAG,QAAQ,SAAS,YAAY,EAAE,GAAG,QAAQ,OAAO,QAAQ,OAAO,IAAI,QAAQ,SAAS,GAAG,IAAI,QAAQ,QAAQ,GACjH;GACJ;GACA,OAAO,OAAO,KAAK,IAAI;EACzB;EACA,KAAK,UAAU;GACb,MAAM,QAAQ,MAAM,iBAAiB,MAAM,KAAK;GAEhD,KADe,KAAK,MAAM,UAAU,YACrB,QAAQ;IACrB,QAAQ,OAAO,MAAM,2CAA2C;IAChE,OAAO;GACT;GACA,QAAQ,OAAO,MAAM,GAAG,KAAK,UAAU,OAAO,MAAM,CAAC,EAAE,GAAG;GAC1D,OAAO;EACT;EACA,KAAK,OAAO;GACV,MAAM,QAAQ,MAAM,iBAAiB,MAAM,KAAK;GAChD,MAAM,MAAM,oBAAoB,MAAM,KAAK;GAC3C,MAAM,UAAU;IACd,OAAO;IACP,MAAM,oBAAoB,GAAG;IAC7B,uBAAuB,0BAA0B,GAAG;GACtD;GACA,IAAI,KAAK,MAAM,SAAS,QAAQ,QAAQ,OAAO,MAAM,GAAG,KAAK,UAAU,SAAS,MAAM,CAAC,EAAE,GAAG;QAE1F,QAAQ,OAAO,MACb,eAAe,IAAI,YAAY,OAAO,QAAQ,QAAQ,KAAK,OAAO,cAAc,QAAQ,sBAAsB,OAAO,GACvH;GAEF,OAAO;EACT;EACA,KAAK,WAAW;GACd,MAAM,MAAM,KAAK,MAAM,aAAa,IAAI,IAAI,mBAAmB,YAAY,GAAG,GAAG,MAAM,CAAC;GAGxF,QAAQ,OAAO,MAAM,GAAG,IAAI,QAAQ,GAAG;GACvC,OAAO;EACT;EACA,KAAK;EACL,KAAK;EACL,KAAK;GACH,QAAQ,OAAO,MAAM,IAAI;GACzB,OAAO;EACT;GACE,QAAQ,OAAO,MAAM,oBAAoB,KAAK,QAAQ,IAAI,MAAM;GAChE,OAAO;CACX;AACF;AAEA,SAAS,aAAa,MAAmC;CACvD,MAAM,iBAAiB,KAAK,MAAM;CAClC,IAAI,mBAAmB,KAAA,GAAW,OAAO,CAAC;CAC1C,IAAI,mBAAmB,QAAQ,MAAM,IAAI,MAAM,kCAAkC;CACjF,OAAO,EAAE,eAAe;AAC1B;AAEA,SAAS,aAAa,MAA8D;CAClF,MAAM,YAAY,KAAK,MAAM;CAC7B,IAAI,KAAK,MAAM,WAAW,QAAQ;EAChC,IAAI,cAAc,KAAA,GAAW,MAAM,IAAI,MAAM,sCAAsC;EACnF,OAAO,CAAC;CACV;CACA,IAAI,cAAc,KAAA,GAAW,OAAO,EAAE,QAAQ,CAAC,EAAE;CACjD,IAAI,cAAc,QAAQ,MAAM,IAAI,MAAM,sCAAsC;CAChF,MAAM,SAAS,OAAO,SAAS;CAC/B,IAAI,CAAC,OAAO,SAAS,MAAM,GAAG,MAAM,IAAI,MAAM,uCAAuC,WAAW;CAChG,OAAO,EAAE,QAAQ,EAAE,gBAAgB,EAAE,WAAW,OAAO,EAAE,EAAE;AAC7D;AAEA,eAAe,iBAAiB,MAAc,OAA8B;CAC1E,MAAM,OAAO,KAAK,UAAU,IAAI,CAAC,CAAC,UAAU,YAAY;CACxD,IAAI,WAAW,IAAI,GACjB,OAAO,KAAK,MAAM,aAAa,MAAM,MAAM,CAAC;CAC9C,OAAO,MAAM,oBAAoB,MAAM,KAAK;AAC9C;AAEA,KAAK,CAAC,CACH,MAAM,SAAS,QAAQ,KAAK,IAAI,CAAC,CAAC,CAClC,OAAO,QAAQ;CACd,QAAQ,OAAO,MACb,0BAA0B,eAAe,QAAS,IAAI,SAAS,IAAI,UAAW,OAAO,GAAG,EAAE,GAC5F;CACA,QAAQ,KAAK,CAAC;AAChB,CAAC"}