kibi-cli 2.25.0 → 2.26.2

package/dist/commands/sync.js

@@ -644,6 +644,27 @@ export async function syncCommand(options = {}, runtime = {}) {
             changedManifestFiles.length === manifestFiles.length;
         const extraction = await processExtractions(changedMarkdownFiles, changedManifestFiles, validateOnly, workspaceRoot);
         const { failedCacheKeys, errors } = extraction;
+        // implements REQ-kibi-uncompiled-source-visibility
+        // Sources sync could not extract stay out of the store; record them so
+        // kb_status can say so. A source that failed in the store's first
+        // compilation (and in every sync since) is legacy content that missed the
+        // semantic baseline, so it keeps the baseline treatment once it compiles.
+        const previousExtractionFailures = syncCache.extractionFailures ?? {};
+        const nextExtractionFailures = {};
+        for (const failure of extraction.failures) {
+            const key = toCacheKey(workspaceRoot, failure.file);
+            const hash = nextHashes[key];
+            if (hash === undefined)
+                continue;
+            nextExtractionFailures[key] = {
+                hash,
+                message: failure.message,
+                ...(initialSemanticBaseline ||
+                    previousExtractionFailures[key]?.baseline === true
+                    ? { baseline: true }
+                    : {}),
+            };
+        }
         const extractedResults = normalizeExtractionSources(extraction.results, workspaceRoot);
         const nextEntityHashes = {
             ...(syncCache.entityHashes ?? {}),
@@ -739,7 +760,9 @@ export async function syncCommand(options = {}, runtime = {}) {
             const advertisedContract = result.entity.semantic_inventory_version !== undefined ||
                 result.entity.semantic_source_hash !== undefined ||
                 result.entity.semantic_inventory !== undefined;
-            const enforceBoundary = (!initialSemanticBaseline && syncCache.hashes[key] === undefined) ||
+            const enforceBoundary = (!initialSemanticBaseline &&
+                syncCache.hashes[key] === undefined &&
+                previousExtractionFailures[key]?.baseline !== true) ||
                 syncCache.semanticContracts[key] === true ||
                 (previousSemanticHash !== undefined &&
                     previousSemanticHash !== boundary.sourceHash) ||
@@ -841,6 +864,7 @@ export async function syncCommand(options = {}, runtime = {}) {
                 semanticHashes: evictedSemanticHashes,
                 semanticContracts: evictedSemanticContracts,
                 compilerFingerprint: SYNC_COMPILER_FINGERPRINT,
+                extractionFailures: nextExtractionFailures,
             });
             info("✓ Imported 0 entities, 0 relationships (no changes)");
             return withOptionalCommit({
@@ -990,6 +1014,7 @@ export async function syncCommand(options = {}, runtime = {}) {
                     semanticHashes: evictedSemanticHashes,
                     semanticContracts: evictedSemanticContracts,
                     compilerFingerprint: SYNC_COMPILER_FINGERPRINT,
+                    extractionFailures: nextExtractionFailures,
                 });
                 published = true;
                 if (performedFullReindex &&
@@ -1180,6 +1205,7 @@ export async function syncCommand(options = {}, runtime = {}) {
                 semanticHashes: evictedSemanticHashes,
                 semanticContracts: evictedSemanticContracts,
                 compilerFingerprint: SYNC_COMPILER_FINGERPRINT,
+                extractionFailures: nextExtractionFailures,
             });
             published = true;
             maybePushDocsNotIndexedDiagnostic(diagnostics, performedFullReindex, markdownFiles.length, entityCount);

package/dist/intent-search.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"intent-search.d.ts","sourceRoot":"","sources":["../src/intent-search.ts"],"names":[],"mappings":"AAKA,OAAO,EACL,KAAK,kBAAkB,EAIxB,MAAM,2CAA2C,CAAC;AACnD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,sCAAsC,CAAC;AACvE,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAIvD,MAAM,MAAM,qBAAqB,GAC7B,QAAQ,GACR,SAAS,GACT,SAAS,GACT,aAAa,GACb,SAAS,CAAC;AAGd,MAAM,MAAM,kBAAkB,GAAG,QAAQ,CACvC,OAAO,CAAC,MAAM,CAAC,qBAAqB,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC,CAC1D,CAAC;AAGF,MAAM,MAAM,cAAc,GAAG,QAAQ,CAAC;IACpC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB,CAAC,CAAC;AAGH,MAAM,MAAM,mBAAmB,GAAG,QAAQ,CAAC;IACzC,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,CAAC,OAAO,kBAAkB,CAAC,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC;IACpD,cAAc,CAAC,EAAE,kBAAkB,CAAC;IACpC,eAAe,CAAC,EAAE,SAAS,cAAc,EAAE,CAAC;IAC5C,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB,CAAC,CAAC;AAGH,MAAM,MAAM,iBAAiB,GAAG,QAAQ,CAAC;IACvC,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB,CAAC,CAAC;AAGH,MAAM,MAAM,eAAe,GAAG,QAAQ,CAAC;IACrC,IAAI,EAAE,MAAM,CAAC;IACb,aAAa,EAAE,SAAS,MAAM,EAAE,CAAC;IACjC,EAAE,EAAE,MAAM,CAAC;CACZ,CAAC,CAAC;AAGH,MAAM,MAAM,oBAAoB,GAAG,QAAQ,CAAC;IAC1C,eAAe,EAAE,MAAM,CAAC;IACxB,aAAa,EAAE,SAAS,MAAM,EAAE,CAAC;IACjC,aAAa,EAAE,SAAS,iBAAiB,EAAE,CAAC;IAC5C,UAAU,EAAE,SAAS,eAAe,EAAE,CAAC;IACvC,kBAAkB,EAAE,OAAO,CAAC;CAC7B,CAAC,CAAC;AAGH,MAAM,MAAM,iBAAiB,GAAG,WAAW,GAAG;IAC5C,QAAQ,CAAC,QAAQ,EAAE,oBAAoB,CAAC;CACzC,CAAC;AAGF,MAAM,MAAM,oBAAoB,GAAG,QAAQ,CAAC;IAC1C,WAAW,EAAE,WAAW,CAAC;IACzB,cAAc,EAAE,MAAM,CAAC;IACvB,aAAa,EAAE,MAAM,CAAC;IACtB,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5B;;;;;OAKG;IACH,cAAc,EAAE,MAAM,GAAG,IAAI,CAAC;IAC9B,SAAS,EAAE,OAAO,CAAC;IACnB,SAAS,EAAE,OAAO,CAAC;CACpB,CAAC,CAAC;AAGH,MAAM,MAAM,kBAAkB,GAAG,QAAQ,CAAC;IACxC,OAAO,EAAE,SAAS,iBAAiB,EAAE,CAAC;IACtC,QAAQ,EAAE,oBAAoB,CAAC;CAChC,CAAC,CAAC;AAEH,KAAK,SAAS,GAAG,QAAQ,CAAC;IACxB,YAAY,EAAE,MAAM,CAAC;IACrB,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;CACZ,CAAC,CAAC;AA6IH,gFAAgF;AAChF,wBAAgB,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CAQrD;AA2WD,2EAA2E;AAE3E,MAAM,MAAM,iBAAiB,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC;AA8B3D,wBAAsB,kBAAkB,CACtC,QAAQ,EAAE,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,EAC5C,OAAO,EAAE,mBAAmB,EAC5B,aAAa,EAAE,MAAM,EACrB,UAAU,GAAE,SAAS,SAAS,EAAO,EACrC,SAAS,GAAE,iBAA6B,GACvC,OAAO,CAAC,kBAAkB,CAAC,CAqJ7B;AAoCD,wBAAgB,SAAS,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,CAO1E;AA8FD,wBAAsB,mBAAmB,CACvC,OAAO,EAAE,mBAAmB,EAC5B,MAAM,EAAE,UAAU,EAClB,aAAa,EAAE,MAAM,GACpB,OAAO,CAAC,kBAAkB,CAAC,CAoD7B;AAGD,wBAAgB,yBAAyB,CAAC,KAAK,EAAE,mBAAmB,GAAG,IAAI,CA0C1E"}
+{"version":3,"file":"intent-search.d.ts","sourceRoot":"","sources":["../src/intent-search.ts"],"names":[],"mappings":"AAKA,OAAO,EACL,KAAK,kBAAkB,EAIxB,MAAM,2CAA2C,CAAC;AACnD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,sCAAsC,CAAC;AACvE,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAIvD,MAAM,MAAM,qBAAqB,GAC7B,QAAQ,GACR,SAAS,GACT,SAAS,GACT,aAAa,GACb,SAAS,CAAC;AAGd,MAAM,MAAM,kBAAkB,GAAG,QAAQ,CACvC,OAAO,CAAC,MAAM,CAAC,qBAAqB,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC,CAC1D,CAAC;AAGF,MAAM,MAAM,cAAc,GAAG,QAAQ,CAAC;IACpC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB,CAAC,CAAC;AAGH,MAAM,MAAM,mBAAmB,GAAG,QAAQ,CAAC;IACzC,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,CAAC,OAAO,kBAAkB,CAAC,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC;IACpD,cAAc,CAAC,EAAE,kBAAkB,CAAC;IACpC,eAAe,CAAC,EAAE,SAAS,cAAc,EAAE,CAAC;IAC5C,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB,CAAC,CAAC;AAGH,MAAM,MAAM,iBAAiB,GAAG,QAAQ,CAAC;IACvC,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB,CAAC,CAAC;AAGH,MAAM,MAAM,eAAe,GAAG,QAAQ,CAAC;IACrC,IAAI,EAAE,MAAM,CAAC;IACb,aAAa,EAAE,SAAS,MAAM,EAAE,CAAC;IACjC,EAAE,EAAE,MAAM,CAAC;CACZ,CAAC,CAAC;AAGH,MAAM,MAAM,oBAAoB,GAAG,QAAQ,CAAC;IAC1C,eAAe,EAAE,MAAM,CAAC;IACxB,aAAa,EAAE,SAAS,MAAM,EAAE,CAAC;IACjC,aAAa,EAAE,SAAS,iBAAiB,EAAE,CAAC;IAC5C,UAAU,EAAE,SAAS,eAAe,EAAE,CAAC;IACvC,kBAAkB,EAAE,OAAO,CAAC;CAC7B,CAAC,CAAC;AAGH,MAAM,MAAM,iBAAiB,GAAG,WAAW,GAAG;IAC5C,QAAQ,CAAC,QAAQ,EAAE,oBAAoB,CAAC;CACzC,CAAC;AAGF,MAAM,MAAM,oBAAoB,GAAG,QAAQ,CAAC;IAC1C,WAAW,EAAE,WAAW,CAAC;IACzB,cAAc,EAAE,MAAM,CAAC;IACvB,aAAa,EAAE,MAAM,CAAC;IACtB,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5B;;;;;OAKG;IACH,cAAc,EAAE,MAAM,GAAG,IAAI,CAAC;IAC9B,SAAS,EAAE,OAAO,CAAC;IACnB,SAAS,EAAE,OAAO,CAAC;CACpB,CAAC,CAAC;AAGH,MAAM,MAAM,kBAAkB,GAAG,QAAQ,CAAC;IACxC,OAAO,EAAE,SAAS,iBAAiB,EAAE,CAAC;IACtC,QAAQ,EAAE,oBAAoB,CAAC;CAChC,CAAC,CAAC;AAEH,KAAK,SAAS,GAAG,QAAQ,CAAC;IACxB,YAAY,EAAE,MAAM,CAAC;IACrB,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;CACZ,CAAC,CAAC;AA6IH,gFAAgF;AAChF,wBAAgB,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CAQrD;AAyXD,2EAA2E;AAE3E,MAAM,MAAM,iBAAiB,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC;AA8B3D,wBAAsB,kBAAkB,CACtC,QAAQ,EAAE,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,EAC5C,OAAO,EAAE,mBAAmB,EAC5B,aAAa,EAAE,MAAM,EACrB,UAAU,GAAE,SAAS,SAAS,EAAO,EACrC,SAAS,GAAE,iBAA6B,GACvC,OAAO,CAAC,kBAAkB,CAAC,CAuJ7B;AAoCD,wBAAgB,SAAS,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,CAO1E;AA8FD,wBAAsB,mBAAmB,CACvC,OAAO,EAAE,mBAAmB,EAC5B,MAAM,EAAE,UAAU,EAClB,aAAa,EAAE,MAAM,GACpB,OAAO,CAAC,kBAAkB,CAAC,CAoD7B;AAGD,wBAAgB,yBAAyB,CAAC,KAAK,EAAE,mBAAmB,GAAG,IAAI,CA0C1E"}

package/dist/intent-search.js

@@ -154,6 +154,13 @@ function topicText(query, locations = []) {
     }
     return topic.replace(CAMEL_IDENTIFIER, splitIdentifier);
 }
+const CODE_SPAN = /`([^`\n]+)`/g;
+const CODE_SPAN_WEIGHT = 2;
+/** Tokens of the question's backticked code spans (`canExport(user)`). */
+// implements REQ-kibi-intent-aware-source-discovery
+function codeSpanTokens(topic) {
+    return new Set([...topic.matchAll(CODE_SPAN)].flatMap((match) => tokens(match[1] ?? "")));
+}
 function normalize(value) {
     return expandIdentifiers(value)
         .trim()
@@ -338,7 +345,7 @@ function entityTokens(entity, body) {
     ENTITY_TOKENS.set(entity, computed);
     return computed;
 }
-function scoreEntity(entity, queryTokens, facets, sourceEvidence, graphEvidence, documentFrequency, documentCount, body, superseded = false, provenanceStub = false) {
+function scoreEntity(entity, queryTokens, facets, sourceEvidence, graphEvidence, documentFrequency, documentCount, body, superseded = false, provenanceStub = false, emphasis = new Set()) {
     const { title: titleTokens, metadata: metadataTokens, bodyTokens, } = entityTokens(entity, body);
     const allSignalTokens = Array.from(new Set(queryTokens));
     // BM25-style inverse document frequency over title, metadata and body:
@@ -355,7 +362,10 @@ function scoreEntity(entity, queryTokens, facets, sourceEvidence, graphEvidence,
     let total = 0;
     for (const token of allSignalTokens) {
         const frequency = documentFrequency.get(token) ?? 0;
-        const idf = Math.log(1 + (documentCount - frequency + 0.5) / (frequency + 0.5));
+        // A word the question writes as code (`canExport(user)`) names what it
+        // is about, so it weighs twice as much as the words around it.
+        const idf = Math.log(1 + (documentCount - frequency + 0.5) / (frequency + 0.5)) *
+            (emphasis.has(token) ? CODE_SPAN_WEIGHT : 1);
         const fieldWeight = titleTokens.has(token)
             ? 1
             : metadataTokens.has(token)
@@ -452,6 +462,7 @@ export async function rankIntentEntities(entities, options, workspaceRoot, graph
     // Each clause of a compound question is also scored on its own, so the
     // words of one clause do not dilute a match on another.
     const clauseTokenSets = queryClauses(query).map((clause) => Array.from(new Set([...clause, ...facetTokens])));
+    const emphasis = codeSpanTokens(query);
     const bodies = await readBodies(entities, workspaceRoot, bodyCache);
     const documentFrequency = buildDocumentFrequency(entities, bodies);
     const supersededIds = new Set(graphEdges
@@ -486,7 +497,7 @@ export async function rankIntentEntities(entities, options, workspaceRoot, graph
         const body = bodies.get(entity) ?? null;
         let scored;
         for (const signalTokens of [allTokens, ...clauseTokenSets]) {
-            const candidate = scoreEntity(entity, signalTokens, facets, sourceEvidence, graphEvidence, documentFrequency, entities.length, body, supersededIds.has(entityId), isProvenanceStub(entity));
+            const candidate = scoreEntity(entity, signalTokens, facets, sourceEvidence, graphEvidence, documentFrequency, entities.length, body, supersededIds.has(entityId), isProvenanceStub(entity), emphasis);
             if (scored === undefined || candidate.score > scored.score)
                 scored = candidate;
         }

package/dist/operations/bootstrap/claim-restatement.d.ts

@@ -0,0 +1,37 @@
+/** A current requirement a declared intent claim may restate. */
+export type ExistingRequirement = {
+    readonly id: string;
+    readonly title: string;
+    readonly semanticText: string;
+};
+/**
+ * Token-set Jaccard at or above which a claim that is not an exact
+ * restatement is still flagged for review: the same threshold the
+ * entity-context check uses to call a context section a restatement of the
+ * title. Below it a claim is planned with no signal.
+ */
+export declare const NEAR_RESTATEMENT_JACCARD = 0.8;
+export type RestatementMatch = {
+    /** exact: the normalized texts are equal; near: overlap at the threshold. */
+    readonly kind: "exact" | "near";
+    readonly requirementId: string;
+    /** The requirement field the claim matched. */
+    readonly field: "title" | "semantic_text";
+    /** Token-set Jaccard of the closest pair, rounded to two decimals. */
+    readonly score: number;
+};
+/**
+ * Case, whitespace and punctuation do not change what a sentence says, so
+ * they do not count when a claim is compared with a requirement.
+ */
+export declare function normalizeRestatementText(text: string): string;
+/**
+ * The current requirement a claim restates, if any. A claim restates a
+ * requirement exactly when its statement or excerpt, normalized, equals the
+ * requirement's title, its semantic text or one sentence of it; only that
+ * counts as already in the KB. A pair at or above NEAR_RESTATEMENT_JACCARD is
+ * a near restatement: a review signal, never a reason to drop the claim.
+ * Requirements are compared in id order, so the answer is deterministic.
+ */
+export declare function findRestatement(claimTexts: readonly (string | undefined)[], requirements: readonly ExistingRequirement[]): RestatementMatch | null;
+//# sourceMappingURL=claim-restatement.d.ts.map

package/dist/operations/bootstrap/claim-restatement.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"claim-restatement.d.ts","sourceRoot":"","sources":["../../../src/operations/bootstrap/claim-restatement.ts"],"names":[],"mappings":"AAKA,iEAAiE;AAEjE,MAAM,MAAM,mBAAmB,GAAG;IAChC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;CAC/B,CAAC;AAEF;;;;;GAKG;AAEH,eAAO,MAAM,wBAAwB,MAAsB,CAAC;AAG5D,MAAM,MAAM,gBAAgB,GAAG;IAC7B,6EAA6E;IAC7E,QAAQ,CAAC,IAAI,EAAE,OAAO,GAAG,MAAM,CAAC;IAChC,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,+CAA+C;IAC/C,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,eAAe,CAAC;IAC1C,sEAAsE;IACtE,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB,CAAC;AAEF;;;GAGG;AAEH,wBAAgB,wBAAwB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAM7D;AAwBD;;;;;;;GAOG;AAEH,wBAAgB,eAAe,CAC7B,UAAU,EAAE,SAAS,CAAC,MAAM,GAAG,SAAS,CAAC,EAAE,EAC3C,YAAY,EAAE,SAAS,mBAAmB,EAAE,GAC3C,gBAAgB,GAAG,IAAI,CAoCzB"}

package/dist/operations/bootstrap/claim-restatement.js

@@ -0,0 +1,83 @@
+import { RESTATEMENT_JACCARD, tokenSetJaccard, } from "../../entity-body-context.js";
+/**
+ * Token-set Jaccard at or above which a claim that is not an exact
+ * restatement is still flagged for review: the same threshold the
+ * entity-context check uses to call a context section a restatement of the
+ * title. Below it a claim is planned with no signal.
+ */
+// implements REQ-bootstrap-claim-restatement
+export const NEAR_RESTATEMENT_JACCARD = RESTATEMENT_JACCARD;
+/**
+ * Case, whitespace and punctuation do not change what a sentence says, so
+ * they do not count when a claim is compared with a requirement.
+ */
+// implements REQ-bootstrap-claim-restatement
+export function normalizeRestatementText(text) {
+    return text
+        .toLowerCase()
+        .split(/[^\p{L}\p{N}]+/u)
+        .filter((token) => token !== "")
+        .join(" ");
+}
+/** The whole prose and each of its sentences. */
+function proseUnits(text) {
+    const sentences = text
+        .split(/(?<=[.!?])\s+|\n+/)
+        .map((sentence) => sentence.trim())
+        .filter((sentence) => sentence !== "");
+    return [text, ...sentences];
+}
+function references(requirement) {
+    return [
+        { field: "title", text: requirement.title },
+        ...proseUnits(requirement.semanticText).map((text) => ({
+            field: "semantic_text",
+            text,
+        })),
+    ].filter((reference) => normalizeRestatementText(reference.text) !== "");
+}
+/**
+ * The current requirement a claim restates, if any. A claim restates a
+ * requirement exactly when its statement or excerpt, normalized, equals the
+ * requirement's title, its semantic text or one sentence of it; only that
+ * counts as already in the KB. A pair at or above NEAR_RESTATEMENT_JACCARD is
+ * a near restatement: a review signal, never a reason to drop the claim.
+ * Requirements are compared in id order, so the answer is deterministic.
+ */
+// implements REQ-bootstrap-claim-restatement
+export function findRestatement(claimTexts, requirements) {
+    const texts = claimTexts
+        .filter((text) => typeof text === "string")
+        .map((text) => ({ text, normalized: normalizeRestatementText(text) }))
+        .filter((text) => text.normalized !== "");
+    if (texts.length === 0)
+        return null;
+    const ordered = [...requirements].sort((left, right) => left.id < right.id ? -1 : left.id > right.id ? 1 : 0);
+    let near = null;
+    let nearScore = 0;
+    for (const requirement of ordered) {
+        for (const reference of references(requirement)) {
+            const normalized = normalizeRestatementText(reference.text);
+            for (const claim of texts) {
+                if (claim.normalized === normalized)
+                    return {
+                        kind: "exact",
+                        requirementId: requirement.id,
+                        field: reference.field,
+                        score: 1,
+                    };
+                const score = tokenSetJaccard(claim.text, reference.text);
+                if (score >= NEAR_RESTATEMENT_JACCARD && score > nearScore) {
+                    nearScore = score;
+                    near = {
+                        kind: "near",
+                        requirementId: requirement.id,
+                        field: reference.field,
+                        score: Math.round(score * 100) / 100,
+                    };
+                }
+            }
+        }
+    }
+    return near;
+}

package/dist/operations/bootstrap/generate.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"generate.d.ts","sourceRoot":"","sources":["../../../src/operations/bootstrap/generate.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,0CAA0C,CAAC;AAejF,OAAO,KAAK,EAGV,SAAS,EACT,iBAAiB,EACjB,mBAAmB,EACnB,gBAAgB,EACjB,MAAM,YAAY,CAAC;AAGpB,wBAAgB,uBAAuB,CACrC,OAAO,EAAE,SAAS,gBAAgB,EAAE,EACpC,WAAW,EAAE,SAAS,MAAM,EAAE,GAAG,SAAS,GACzC,SAAS,gBAAgB,EAAE,CAI7B;AA+BD,wBAAgB,yBAAyB,CACvC,KAAK,EAAE,SAAS,SAAS,EAAE,EAC3B,WAAW,EAAE,WAAW,CAAC,MAAM,CAAC,EAChC,WAAW,EAAE,SAAS,MAAM,EAAE,GAAG,SAAS,EAC1C,OAAO,EAAE,MAAM,GACd;IACD,QAAQ,CAAC,UAAU,EAAE,SAAS,SAAS,EAAE,CAAC;IAC1C,QAAQ,CAAC,UAAU,EAAE,SAAS,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC;IAClE,QAAQ,CAAC,iBAAiB,EAAE,SAAS,gBAAgB,EAAE,CAAC;IACxD,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;CACzC,CAwJA;AAkMD,wBAAsB,oBAAoB,CACxC,IAAI,EAAE,iBAAiB,EACvB,OAAO,EAAE,gBAAgB,GACxB,OAAO,CAAC,mBAAmB,CAAC,CAqI9B"}
+{"version":3,"file":"generate.d.ts","sourceRoot":"","sources":["../../../src/operations/bootstrap/generate.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,0CAA0C,CAAC;AAgBjF,OAAO,KAAK,EAGV,SAAS,EACT,iBAAiB,EACjB,mBAAmB,EACnB,gBAAgB,EACjB,MAAM,YAAY,CAAC;AAGpB,wBAAgB,uBAAuB,CACrC,OAAO,EAAE,SAAS,gBAAgB,EAAE,EACpC,WAAW,EAAE,SAAS,MAAM,EAAE,GAAG,SAAS,GACzC,SAAS,gBAAgB,EAAE,CAI7B;AA+BD,wBAAgB,yBAAyB,CACvC,KAAK,EAAE,SAAS,SAAS,EAAE,EAC3B,WAAW,EAAE,WAAW,CAAC,MAAM,CAAC,EAChC,WAAW,EAAE,SAAS,MAAM,EAAE,GAAG,SAAS,EAC1C,OAAO,EAAE,MAAM,GACd;IACD,QAAQ,CAAC,UAAU,EAAE,SAAS,SAAS,EAAE,CAAC;IAC1C,QAAQ,CAAC,UAAU,EAAE,SAAS,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC;IAClE,QAAQ,CAAC,iBAAiB,EAAE,SAAS,gBAAgB,EAAE,CAAC;IACxD,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;CACzC,CAwJA;AAmND,wBAAsB,oBAAoB,CACxC,IAAI,EAAE,iBAAiB,EACvB,OAAO,EAAE,gBAAgB,GACxB,OAAO,CAAC,mBAAmB,CAAC,CAwI9B"}

package/dist/operations/bootstrap/generate.js

@@ -1,6 +1,6 @@
 import { createHash } from "node:crypto";
 import path from "node:path";
-import { loadEntityIds } from "../../public/operations/discovery-entities.js";
+import { loadCurrentRequirementTexts, loadEntityIds, } from "../../public/operations/discovery-entities.js";
 import { executeStatus } from "../../public/operations/discovery-executors.js";
 import { readWorkspaceSnapshot } from "../../public/operations/workspace-snapshot.js";
 import { stagedLogicalGroundingError, } from "../semantic-advisor/ingestion-boundary.js";
@@ -238,21 +238,31 @@ function activationSuppressedClaims(declared, activation) {
         activationMode: activation.activationMode,
     }));
 }
+const NO_EXISTING_KNOWLEDGE = {
+    ids: new Set(),
+    requirements: [],
+};
 /**
  * IDs already in the KB, so declared claims and discovered candidates that
- * exist are counted under entity_exists instead of being planned again. An
- * attached root starts the lazy engine when the host supplied none (the CLI
- * does so for status anyway); an unattached root never starts one.
+ * exist are counted under entity_exists instead of being planned again, and,
+ * when intent claims are declared, the current requirements those claims may
+ * restate. An attached root starts the lazy engine when the host supplied
+ * none (the CLI does so for status anyway); an unattached root never starts
+ * one.
  */
-// implements REQ-bootstrap-intent-claim-accounting
-async function existingEntityIds(context, attached) {
+// implements REQ-bootstrap-intent-claim-accounting, REQ-bootstrap-claim-restatement
+async function existingKnowledge(context, attached, withRequirements) {
     try {
         const prolog = context.prolog ?? (attached ? await context.ensureProlog?.() : undefined);
         if (!prolog)
-            return new Set();
+            return NO_EXISTING_KNOWLEDGE;
         // Ids only: materializing every entity (receipt histories included)
         // just to build this set exceeds the bounded engine output.
-        return new Set((await loadEntityIds(prolog)).filter(Boolean));
+        const ids = new Set((await loadEntityIds(prolog)).filter(Boolean));
+        const requirements = withRequirements
+            ? await loadCurrentRequirementTexts(prolog)
+            : [];
+        return { ids, requirements };
     }
     catch (error) {
         throw new Error(`Bootstrap binding could not read existing entity IDs: ${error instanceof Error ? error.message : String(error)}`);
@@ -346,11 +356,12 @@ export async function executePlanBootstrap(args, context) {
     const maxCandidates = clamp(Math.trunc(args.maxCandidates ?? 50), 1, 200);
     const entityBindingDiagnostics = [];
     const discovery = await discoverBootstrap(context);
-    const existingIds = await existingEntityIds(context, discovery.activation.activationState === "root_active_thin" ||
-        discovery.activation.activationState === "root_active_seeded").catch((error) => {
+    const existing = await existingKnowledge(context, discovery.activation.activationState === "root_active_thin" ||
+        discovery.activation.activationState === "root_active_seeded", (declared.intentClaims?.length ?? 0) > 0).catch((error) => {
         entityBindingDiagnostics.push(error.message);
-        return new Set();
+        return NO_EXISTING_KNOWLEDGE;
     });
+    const existingIds = existing.ids;
     // Discovery runs before planning so its evidence paths can be bound into
     // the exact plan rather than leaving the reviewer to reconstruct them.
     const bound = await expectedSnapshots(context, discovery.evidence
@@ -374,7 +385,7 @@ export async function executePlanBootstrap(args, context) {
     const allowDeclaredClaims = discovery.activation.allowDeclaredClaims ??
         discovery.activation.allowCandidateGeneration;
     const claimed = allowDeclaredClaims
-        ? buildIntentClaimCandidates(declared, existingIds, minConfidence, subjectKeys)
+        ? buildIntentClaimCandidates(declared, existingIds, minConfidence, subjectKeys, existing.requirements)
         : {
             candidates: [],
             sourceOnlySignals: [],

package/dist/operations/bootstrap/intent-claims.d.ts

@@ -1,3 +1,4 @@
+import { type ExistingRequirement } from "./claim-restatement.js";
 import { type SubjectKeyRegistry } from "./requirement-claims.js";
 import type { BootstrapDeclaredContext, Candidate, SourceOnlySignal } from "./types.js";
 export type IntentClaimBuildResult = {
@@ -12,7 +13,9 @@ export type IntentClaimBuildResult = {
  * what the agent read, binds it into the plan hash through the declared
  * context, and keeps the citation on every candidate it produces. A claim the
  * strict modeler cannot ground stays an explicit authoring follow-up instead
- * of becoming unverifiable knowledge.
+ * of becoming unverifiable knowledge. An intent claim whose statement or
+ * excerpt restates a current requirement is already in the KB and is counted
+ * as such instead of being planned again under a new id.
  */
-export declare function buildIntentClaimCandidates(declared: BootstrapDeclaredContext, existingIds: ReadonlySet<string>, minConfidence: number, subjectKeys?: SubjectKeyRegistry): IntentClaimBuildResult;
+export declare function buildIntentClaimCandidates(declared: BootstrapDeclaredContext, existingIds: ReadonlySet<string>, minConfidence: number, subjectKeys?: SubjectKeyRegistry, existingRequirements?: readonly ExistingRequirement[]): IntentClaimBuildResult;
 //# sourceMappingURL=intent-claims.d.ts.map

package/dist/operations/bootstrap/intent-claims.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"intent-claims.d.ts","sourceRoot":"","sources":["../../../src/operations/bootstrap/intent-claims.ts"],"names":[],"mappings":"AASA,OAAO,EACL,KAAK,kBAAkB,EAGxB,MAAM,yBAAyB,CAAC;AACjC,OAAO,KAAK,EACV,wBAAwB,EAGxB,SAAS,EACT,gBAAgB,EACjB,MAAM,YAAY,CAAC;AAQpB,MAAM,MAAM,sBAAsB,GAAG;IACnC,QAAQ,CAAC,UAAU,EAAE,SAAS,SAAS,EAAE,CAAC;IAC1C,QAAQ,CAAC,iBAAiB,EAAE,SAAS,gBAAgB,EAAE,CAAC;IACxD,QAAQ,CAAC,UAAU,EAAE,SAAS,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC;IAClE,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;CACzC,CAAC;AAyOF;;;;;;;GAOG;AAEH,wBAAgB,0BAA0B,CACxC,QAAQ,EAAE,wBAAwB,EAClC,WAAW,EAAE,WAAW,CAAC,MAAM,CAAC,EAChC,aAAa,EAAE,MAAM,EACrB,WAAW,CAAC,EAAE,kBAAkB,GAC/B,sBAAsB,CA4KxB"}
+{"version":3,"file":"intent-claims.d.ts","sourceRoot":"","sources":["../../../src/operations/bootstrap/intent-claims.ts"],"names":[],"mappings":"AASA,OAAO,EACL,KAAK,mBAAmB,EAGzB,MAAM,wBAAwB,CAAC;AAChC,OAAO,EACL,KAAK,kBAAkB,EAGxB,MAAM,yBAAyB,CAAC;AACjC,OAAO,KAAK,EACV,wBAAwB,EAGxB,SAAS,EACT,gBAAgB,EACjB,MAAM,YAAY,CAAC;AAQpB,MAAM,MAAM,sBAAsB,GAAG;IACnC,QAAQ,CAAC,UAAU,EAAE,SAAS,SAAS,EAAE,CAAC;IAC1C,QAAQ,CAAC,iBAAiB,EAAE,SAAS,gBAAgB,EAAE,CAAC;IACxD,QAAQ,CAAC,UAAU,EAAE,SAAS,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC;IAClE,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;CACzC,CAAC;AAuPF;;;;;;;;;GASG;AAEH,wBAAgB,0BAA0B,CACxC,QAAQ,EAAE,wBAAwB,EAClC,WAAW,EAAE,WAAW,CAAC,MAAM,CAAC,EAChC,aAAa,EAAE,MAAM,EACrB,WAAW,CAAC,EAAE,kBAAkB,EAChC,oBAAoB,GAAE,SAAS,mBAAmB,EAAO,GACxD,sBAAsB,CA+MxB"}

package/dist/operations/bootstrap/intent-claims.js

@@ -2,6 +2,7 @@ import { createHash } from "node:crypto";
 import { renderRequirementBody } from "../../entity-body-context.js";
 import { buildStrictWriteSet } from "../../utils/strict-modeling.js";
 import { asImportedRule, confidenceBand, strictPlan, upsert, } from "./candidate-helpers.js";
+import { findRestatement, } from "./claim-restatement.js";
 import { claimFor, planSubjectKey, } from "./requirement-claims.js";
 /** How much a claim is trusted follows the authority the human assigned. */
 const AUTHORITY_CONFIDENCE = {
@@ -190,16 +191,27 @@ function conflictCandidates(declared, sources, existingIds, minConfidence) {
     }
     return { candidates, sourceOnlySignals: [], suppressed, diagnostics };
 }
+/**
+ * The review signal a planned claim carries when it closely restates a
+ * current requirement: kept, but named so the reviewer can drop it or link
+ * the two with restates or supersedes.
+ */
+// implements REQ-bootstrap-claim-restatement
+function nearRestatementDiagnostic(source, claim, match) {
+    return `Intent claim at ${source.id}:${claim.reference} closely restates current requirement ${match.requirementId} (token overlap ${match.score} with its ${match.field === "title" ? "title" : "semantic text"}, not an exact match); it is still planned. Review it before apply: drop the claim if it states the same rule, or keep it and link the two with restates or supersedes.`;
+}
 /**
  * Turn intent the agent harvested from declared knowledge sources into cited
  * bootstrap candidates. Kibi never contacts those sources: it only records
  * what the agent read, binds it into the plan hash through the declared
  * context, and keeps the citation on every candidate it produces. A claim the
  * strict modeler cannot ground stays an explicit authoring follow-up instead
- * of becoming unverifiable knowledge.
+ * of becoming unverifiable knowledge. An intent claim whose statement or
+ * excerpt restates a current requirement is already in the KB and is counted
+ * as such instead of being planned again under a new id.
  */
-// implements REQ-kibi-bootstrap-knowledge-sources, REQ-bootstrap-claim-kinds-and-conflicts
-export function buildIntentClaimCandidates(declared, existingIds, minConfidence, subjectKeys) {
+// implements REQ-kibi-bootstrap-knowledge-sources, REQ-bootstrap-claim-kinds-and-conflicts, REQ-bootstrap-claim-restatement
+export function buildIntentClaimCandidates(declared, existingIds, minConfidence, subjectKeys, existingRequirements = []) {
     const sources = new Map((declared.knowledgeSources ?? []).map((source) => [source.id, source]));
     const candidates = [];
     const sourceOnlySignals = [];
@@ -255,7 +267,31 @@ export function buildIntentClaimCandidates(declared, existingIds, minConfidence,
                 candidates.push(review);
             continue;
         }
-        const evidence = citation(source, claim);
+        // A claim that restates a current requirement word for word (case,
+        // whitespace and punctuation aside) is that requirement: count it as
+        // already in the KB under the requirement's id, and do not model it.
+        const restatement = findRestatement([claim.statement, claim.excerpt], existingRequirements);
+        if (restatement?.kind === "exact") {
+            suppressed.push({
+                candidateId: "",
+                reason: "entity_exists",
+                sourcePath: claim.reference,
+                entityType: "req",
+                statement: claim.statement,
+                sourceId: source.id,
+                matchedId: restatement.requirementId,
+                matchedBy: "restatement",
+                matchedField: restatement.field,
+            });
+            continue;
+        }
+        const nearRestatement = restatement?.kind === "near" ? restatement : null;
+        const evidence = [
+            ...citation(source, claim),
+            ...(nearRestatement
+                ? [`possible_restatement:${nearRestatement.requirementId}`]
+                : []),
+        ];
         const provenance = `${source.id}:${claim.reference}`;
         let writeSet = null;
         try {
@@ -301,6 +337,8 @@ export function buildIntentClaimCandidates(declared, existingIds, minConfidence,
                     ? withClaimBody(asImportedRule(withRationale(step, claim.rationale), provenance), claimBody(source, claim))
                     : step),
             });
+            if (nearRestatement)
+                diagnostics.push(nearRestatementDiagnostic(source, claim, nearRestatement));
             continue;
         }
         if (writeSet?.isStrict && confidence < minConfidence)
@@ -326,6 +364,8 @@ export function buildIntentClaimCandidates(declared, existingIds, minConfidence,
             confidence,
             evidence,
         });
+        if (nearRestatement)
+            diagnostics.push(nearRestatementDiagnostic(source, claim, nearRestatement));
     }
     const declaredConflicts = conflictCandidates(declared, sources, existingIds, minConfidence);
     return {

package/dist/operations/migration/requirement-status.d.ts

@@ -5,6 +5,17 @@ import { type InventoryRederivation } from "./inventory-rederive.js";
  * intent is `closed`.
  */
 export declare const SUGGESTED_REQUIREMENT_STATUS: Readonly<Record<string, string>>;
+/** The tag that keeps a delivered legacy requirement's meaning once closed. */
+export declare const DELIVERED_REQUIREMENT_TAG = "implemented";
+/**
+ * Legacy delivery statuses and their one lossless current reading: `closed`
+ * with the tag `implemented`, which kb.pl reads as a delivered requirement
+ * that still owes coverage. `kibi migrate` applies these without review.
+ */
+export declare const DELIVERED_REQUIREMENT_STATUS: Readonly<Record<string, Readonly<{
+    status: string;
+    tag: string;
+}>>>;
 /** One requirement whose status is outside the vocabulary. */
 export type RequirementStatusFinding = Readonly<{
     requirementId: string;
@@ -12,6 +23,19 @@ export type RequirementStatusFinding = Readonly<{
     status: string;
     /** The suggested current status; null when Kibi has no suggestion. */
     suggestedStatus: string | null;
+    /**
+     * The lossless mapping `kibi migrate` applies without review (delivery
+     * vocabulary); null when the target status is a person's choice.
+     */
+    automatic: Readonly<{
+        status: string;
+        tag: string;
+    }> | null;
+    /**
+     * Why `kibi sync` cannot compile the requirement as authored (for example
+     * a status outside the entity schema); null when it compiles.
+     */
+    extractionError: string | null;
     /** Inventory drift the requirement shows once it has the suggested status. */
     latentDrift: InventoryRederivation | null;
 }>;
@@ -19,7 +43,22 @@ export type RequirementStatusFinding = Readonly<{
 export declare function planRequirementStatusMappings(workspaceRoot: string): RequirementStatusFinding[];
 /**
  * Set the status of one requirement from `from` to `to`, replacing only its
- * `status` line. Refuses when the authored status is no longer `from`.
+ * `status` line, and add `tag` when given and missing. Refuses when the
+ * authored status is no longer `from`.
+ */
+export declare function applyRequirementStatusMapping(workspaceRoot: string, relativePath: string, from: string, to: string, tag?: string): void;
+/** What mapping the delivery statuses changed, and what it could not edit. */
+export type DeliveredStatusMappingResult = Readonly<{
+    mapped: readonly RequirementStatusFinding[];
+    skipped: readonly Readonly<{
+        path: string;
+        reason: string;
+    }>[];
+}>;
+/**
+ * Map every requirement whose status is delivery vocabulary to `closed` with
+ * the tag `implemented`, front matter only. With `only`, maps just those
+ * requirement ids (a plan action applies what it planned). Idempotent.
  */
-export declare function applyRequirementStatusMapping(workspaceRoot: string, relativePath: string, from: string, to: string): void;
+export declare function applyDeliveredStatusMappings(workspaceRoot: string, only?: ReadonlySet<string>): DeliveredStatusMappingResult;
 //# sourceMappingURL=requirement-status.d.ts.map

package/dist/operations/migration/requirement-status.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"requirement-status.d.ts","sourceRoot":"","sources":["../../../src/operations/migration/requirement-status.ts"],"names":[],"mappings":"AAmBA,OAAO,EACL,KAAK,qBAAqB,EAE3B,MAAM,yBAAyB,CAAC;AA8BjC;;;;GAIG;AAEH,eAAO,MAAM,4BAA4B,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAOzE,CAAC;AAEF,8DAA8D;AAE9D,MAAM,MAAM,wBAAwB,GAAG,QAAQ,CAAC;IAC9C,aAAa,EAAE,MAAM,CAAC;IACtB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf,sEAAsE;IACtE,eAAe,EAAE,MAAM,GAAG,IAAI,CAAC;IAC/B,8EAA8E;IAC9E,WAAW,EAAE,qBAAqB,GAAG,IAAI,CAAC;CAC3C,CAAC,CAAC;AAYH,yEAAyE;AAEzE,wBAAgB,6BAA6B,CAC3C,aAAa,EAAE,MAAM,GACpB,wBAAwB,EAAE,CA8B5B;AAED;;;GAGG;AAEH,wBAAgB,6BAA6B,CAC3C,aAAa,EAAE,MAAM,EACrB,YAAY,EAAE,MAAM,EACpB,IAAI,EAAE,MAAM,EACZ,EAAE,EAAE,MAAM,GACT,IAAI,CAaN"}
+{"version":3,"file":"requirement-status.d.ts","sourceRoot":"","sources":["../../../src/operations/migration/requirement-status.ts"],"names":[],"mappings":"AAqBA,OAAO,EACL,KAAK,qBAAqB,EAE3B,MAAM,yBAAyB,CAAC;AAkCjC;;;;GAIG;AAEH,eAAO,MAAM,4BAA4B,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAOzE,CAAC;AAEF,+EAA+E;AAE/E,eAAO,MAAM,yBAAyB,gBAAgB,CAAC;AAEvD;;;;GAIG;AAEH,eAAO,MAAM,4BAA4B,EAAE,QAAQ,CACjD,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAA;CAAE,CAAC,CAAC,CAK1D,CAAC;AAEF,8DAA8D;AAE9D,MAAM,MAAM,wBAAwB,GAAG,QAAQ,CAAC;IAC9C,aAAa,EAAE,MAAM,CAAC;IACtB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf,sEAAsE;IACtE,eAAe,EAAE,MAAM,GAAG,IAAI,CAAC;IAC/B;;;OAGG;IACH,SAAS,EAAE,QAAQ,CAAC;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAC,GAAG,IAAI,CAAC;IAC5D;;;OAGG;IACH,eAAe,EAAE,MAAM,GAAG,IAAI,CAAC;IAC/B,8EAA8E;IAC9E,WAAW,EAAE,qBAAqB,GAAG,IAAI,CAAC;CAC3C,CAAC,CAAC;AAqBH,yEAAyE;AAEzE,wBAAgB,6BAA6B,CAC3C,aAAa,EAAE,MAAM,GACpB,wBAAwB,EAAE,CAkC5B;AASD;;;;GAIG;AAEH,wBAAgB,6BAA6B,CAC3C,aAAa,EAAE,MAAM,EACrB,YAAY,EAAE,MAAM,EACpB,IAAI,EAAE,MAAM,EACZ,EAAE,EAAE,MAAM,EACV,GAAG,CAAC,EAAE,MAAM,GACX,IAAI,CAiBN;AAED,8EAA8E;AAE9E,MAAM,MAAM,4BAA4B,GAAG,QAAQ,CAAC;IAClD,MAAM,EAAE,SAAS,wBAAwB,EAAE,CAAC;IAC5C,OAAO,EAAE,SAAS,QAAQ,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC,EAAE,CAAC;CAChE,CAAC,CAAC;AAEH;;;;GAIG;AAEH,wBAAgB,4BAA4B,CAC1C,aAAa,EAAE,MAAM,EACrB,IAAI,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,GACzB,4BAA4B,CAuB9B"}