kibi-cli 2.26.2 → 2.27.0

package/dist/operations/planning/conflict-review.js

@@ -0,0 +1,133 @@
+import { intentTokens } from "../../intent-search.js";
+import { escapeAtomContent, parseListOfLists, parsePrologValue, } from "../../prolog/codec.js";
+import { loadEntityRows } from "../../public/operations/discovery-entities.js";
+/**
+ * Relationships that give a requirement a logical representation the
+ * contradiction checker can compare. A requirement with none of them is prose
+ * only: no witness can ever name it.
+ */
+const LOGICAL_RELATIONSHIPS = [
+    "constrains",
+    "requires_property",
+    "requires_predicate",
+    "requires_rule",
+];
+/**
+ * Relevance floor for a related requirement, below the kb_search default
+ * (0.18): a missed contradiction costs more than one extra comparison, and a
+ * requirement sharing half the intent's terms in other words ("label length
+ * is limited" against "label length must be at most 200") scores about 0.13.
+ * The candidate cap bounds the noise.
+ */
+// implements REQ-kibi-contradiction-review-candidates
+export const REVIEW_CANDIDATE_MIN_SCORE = 0.1;
+/** At most this many related requirements are put up for review. */
+// implements REQ-kibi-contradiction-review-candidates
+export const MAX_REVIEW_CANDIDATES = 5;
+/** The longest requirement statement a review candidate quotes. */
+const MAX_STATEMENT_LENGTH = 600;
+function text(value) {
+    return typeof value === "string" ? value.trim() : "";
+}
+/**
+ * The current requirements among `ids`, each with whether it has a logical
+ * representation. Ids that are not current requirements (superseded,
+ * deprecated or unknown) are left out.
+ */
+// implements REQ-kibi-contradiction-review-candidates
+export async function loadReviewRequirements(prolog, ids) {
+    const unique = [...new Set(ids.filter(Boolean))];
+    const found = new Map();
+    if (unique.length === 0)
+        return found;
+    const idList = unique.map((id) => `'${escapeAtomContent(id)}'`).join(",");
+    const result = await prolog.query(`findall([R,M], (member(R, [${idList}]), kb:current_req(R), (once((member(T, [${LOGICAL_RELATIONSHIPS.join(",")}]), kb_relationship(T, R, _))) -> M = modeled ; M = unmodeled)), Rows)`);
+    if (!result.success)
+        return found;
+    const modeled = new Map(parseListOfLists(result.bindings.Rows ?? "[]").map(([id, flag]) => [
+        atom(id),
+        atom(flag) === "modeled",
+    ]));
+    const rows = await loadEntityRows(prolog, [...modeled.keys()], ["id", "title", "semantic_text"]);
+    for (const row of rows) {
+        const id = text(row.id);
+        if (!modeled.has(id))
+            continue;
+        found.set(id, {
+            id,
+            title: text(row.title),
+            semanticText: text(row.semantic_text),
+            modeled: modeled.get(id) === true,
+        });
+    }
+    return found;
+}
+function atom(value) {
+    return String(parsePrologValue(value ?? "")).replace(/^['"]|['"]$/g, "");
+}
+function sentences(value) {
+    return value
+        .split(/(?<=[.!?])\s+|\n+/)
+        .map((sentence) => sentence.trim())
+        .filter(Boolean);
+}
+/**
+ * The sentence of a requirement most likely to bear on the intent: the one
+ * sharing the most intent terms, the first on a tie, the title when the
+ * requirement has no prose.
+ */
+// implements REQ-kibi-contradiction-review-candidates
+export function reviewSentence(intent, requirement) {
+    const units = sentences(requirement.semanticText);
+    if (units.length === 0)
+        return requirement.title;
+    const wanted = new Set(intentTokens(intent));
+    let best = units[0] ?? requirement.title;
+    let bestShared = -1;
+    for (const unit of units) {
+        const shared = intentTokens(unit).filter((token) => wanted.has(token)).length;
+        if (shared > bestShared) {
+            best = unit;
+            bestShared = shared;
+        }
+    }
+    return best;
+}
+function bounded(value) {
+    return value.length > MAX_STATEMENT_LENGTH
+        ? `${value.slice(0, MAX_STATEMENT_LENGTH - 1).trimEnd()}…`
+        : value;
+}
+// implements REQ-kibi-contradiction-review-candidates
+export function reviewCandidate(intent, requirement, score, decision) {
+    return {
+        requirementId: requirement.id,
+        title: requirement.title,
+        sentence: reviewSentence(intent, requirement),
+        statement: bounded(requirement.semanticText || requirement.title),
+        score: Math.round(score * 1000) / 1000,
+        modeled: requirement.modeled,
+        review: decision?.verdict ?? "pending",
+        ...(decision?.note ? { note: decision.note } : {}),
+    };
+}
+/**
+ * What the agent does next while the contradiction outcome is not decided:
+ * resolve a conflict it found, compare the candidates still pending, or model
+ * the claims Kibi could not check.
+ */
+// implements REQ-kibi-contradiction-review-candidates
+export function reviewNextAction(candidates, unmodeledClaims) {
+    const ids = (review) => candidates
+        .filter((candidate) => candidate.review === review)
+        .map((candidate) => candidate.requirementId);
+    const conflicts = ids("conflict");
+    if (conflicts.length > 0)
+        return `You judged that the intent contradicts ${conflicts.join(", ")}. Ask the human which rule holds, then supersede or change the conflicting requirement, or change the intent, and compile again. Record a conflict the human has not decided yet as a review:conflict observation fact.`;
+    const pending = ids("pending");
+    if (pending.length > 0)
+        return `Kibi could not compare this intent with ${pending.join(", ")} logically. Read each reviewCandidates entry (its statement and sentence) and decide whether the intent contradicts it, then call kb_compile_intent again with the same arguments plus conflictReviews: [{requirementId, verdict: "conflict" | "no_conflict", note}] for each.`;
+    if (unmodeledClaims.length > 0)
+        return `Kibi could not check claim ${unmodeledClaims.join(", ")} for contradictions because it has no logical model: model it with kb_model (mode requirement or predicates) and compile again. Until then no conflict is confirmed, only reviewed.`;
+    return undefined;
+}

package/dist/operations/semantic-advisor/ingestion-boundary.d.ts

@@ -12,6 +12,14 @@ export type SemanticRelationship = Readonly<{
     to?: unknown;
 }>;
 export declare function validateSemanticInventoryBoundary(payload: Payload, relationships: readonly SemanticRelationship[], receipt: SemanticAdvisorReceipt): SemanticInventoryBoundaryResult;
+/**
+ * The inventory contract the advisor derives for this payload's prose, as
+ * the properties to resend: the version, source field and hash, one ledger
+ * entry per proposition and the assertive claim keys. An entry keeps the
+ * status the payload already gave the same claim key; otherwise it carries
+ * the advisor's status (an ambiguity or ontology gap stays explicit).
+ */
+export declare function semanticInventoryContract(payload: Payload, receipt: SemanticAdvisorReceipt): Record<string, unknown>;
 export declare function assertSemanticInventoryBoundary(payload: Payload, relationships: readonly SemanticRelationship[], receipt: SemanticAdvisorReceipt): void;
 /**
  * The write-time claim_key check, run against planned writes only. Returns

package/dist/operations/semantic-advisor/ingestion-boundary.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ingestion-boundary.d.ts","sourceRoot":"","sources":["../../../src/operations/semantic-advisor/ingestion-boundary.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,0CAA0C,CAAC;AAG3E,OAAO,EACL,KAAK,OAAO,EAOb,MAAM,aAAa,CAAC;AACrB,OAAO,KAAK,EAAE,sBAAsB,EAAuB,MAAM,YAAY,CAAC;AAgB9E,MAAM,WAAW,+BAA+B;IAC9C,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;IAC7B,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED,MAAM,MAAM,oBAAoB,GAAG,QAAQ,CAAC;IAC1C,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,EAAE,CAAC,EAAE,OAAO,CAAC;CACd,CAAC,CAAC;AAuEH,wBAAgB,iCAAiC,CAC/C,OAAO,EAAE,OAAO,EAChB,aAAa,EAAE,SAAS,oBAAoB,EAAE,EAC9C,OAAO,EAAE,sBAAsB,GAC9B,+BAA+B,CA0IjC;AAED,wBAAgB,+BAA+B,CAC7C,OAAO,EAAE,OAAO,EAChB,aAAa,EAAE,SAAS,oBAAoB,EAAE,EAC9C,OAAO,EAAE,sBAAsB,GAC9B,IAAI,CAWN;AAoFD;;;;GAIG;AAEH,wBAAgB,2BAA2B,CACzC,OAAO,EAAE,OAAO,EAChB,aAAa,EAAE,SAAS,oBAAoB,EAAE,EAC9C,OAAO,EAAE,WAAW,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,GAC9D,MAAM,GAAG,IAAI,CAUf;AAGD,wBAAsB,+BAA+B,CACnD,MAAM,EAAE,UAAU,EAClB,OAAO,EAAE,OAAO,EAChB,aAAa,EAAE,SAAS,oBAAoB,EAAE,EAC9C,MAAM,CAAC,EAAE,QAAQ,CAAC;IAChB,QAAQ,EAAE,WAAW,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;CAClE,CAAC,GACD,OAAO,CAAC,IAAI,CAAC,CAwBf"}
+{"version":3,"file":"ingestion-boundary.d.ts","sourceRoot":"","sources":["../../../src/operations/semantic-advisor/ingestion-boundary.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,0CAA0C,CAAC;AAG3E,OAAO,EACL,KAAK,OAAO,EAOb,MAAM,aAAa,CAAC;AACrB,OAAO,KAAK,EAAE,sBAAsB,EAAuB,MAAM,YAAY,CAAC;AAgB9E,MAAM,WAAW,+BAA+B;IAC9C,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;IAC7B,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED,MAAM,MAAM,oBAAoB,GAAG,QAAQ,CAAC;IAC1C,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,EAAE,CAAC,EAAE,OAAO,CAAC;CACd,CAAC,CAAC;AAuEH,wBAAgB,iCAAiC,CAC/C,OAAO,EAAE,OAAO,EAChB,aAAa,EAAE,SAAS,oBAAoB,EAAE,EAC9C,OAAO,EAAE,sBAAsB,GAC9B,+BAA+B,CA0IjC;AAED;;;;;;GAMG;AAEH,wBAAgB,yBAAyB,CACvC,OAAO,EAAE,OAAO,EAChB,OAAO,EAAE,sBAAsB,GAC9B,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAuBzB;AAGD,wBAAgB,+BAA+B,CAC7C,OAAO,EAAE,OAAO,EAChB,aAAa,EAAE,SAAS,oBAAoB,EAAE,EAC9C,OAAO,EAAE,sBAAsB,GAC9B,IAAI,CAWN;AAwFD;;;;GAIG;AAEH,wBAAgB,2BAA2B,CACzC,OAAO,EAAE,OAAO,EAChB,aAAa,EAAE,SAAS,oBAAoB,EAAE,EAC9C,OAAO,EAAE,WAAW,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,GAC9D,MAAM,GAAG,IAAI,CAUf;AAGD,wBAAsB,+BAA+B,CACnD,MAAM,EAAE,UAAU,EAClB,OAAO,EAAE,OAAO,EAChB,aAAa,EAAE,SAAS,oBAAoB,EAAE,EAC9C,MAAM,CAAC,EAAE,QAAQ,CAAC;IAChB,QAAQ,EAAE,WAAW,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;CAClE,CAAC,GACD,OAAO,CAAC,IAAI,CAAC,CAiCf"}

package/dist/operations/semantic-advisor/ingestion-boundary.js

@@ -157,10 +157,41 @@ export function validateSemanticInventoryBoundary(payload, relationships, receip
     }
     return { applicable, errors, sourceHash };
 }
+/**
+ * The inventory contract the advisor derives for this payload's prose, as
+ * the properties to resend: the version, source field and hash, one ledger
+ * entry per proposition and the assertive claim keys. An entry keeps the
+ * status the payload already gave the same claim key; otherwise it carries
+ * the advisor's status (an ambiguity or ontology gap stays explicit).
+ */
+// implements REQ-kb-upsert-ledger-contract-in-error
+export function semanticInventoryContract(payload, receipt) {
+    const semanticSource = semanticSourceOf(payload);
+    const sent = new Map(inventoryOf(payload).map((entry) => [
+        stringValue(entry.claim_key),
+        stringValue(entry.status),
+    ]));
+    return {
+        semantic_inventory_version: SEMANTIC_INVENTORY_VERSION,
+        semantic_source_field: semanticSource.field,
+        semantic_source_hash: semanticSourceHash(semanticSource.text),
+        semantic_inventory: receipt.propositions.map((proposition) => ({
+            claim_key: proposition.claim_key,
+            claim_text: proposition.claim_text,
+            role: proposition.role,
+            status: sent.get(proposition.claim_key) || proposition.status,
+            span: { start: proposition.span.start, end: proposition.span.end },
+        })),
+        logic_claims: receipt.propositions
+            .filter(propositionIsAssertive)
+            .map(({ claim_key }) => claim_key),
+    };
+}
+// implements REQ-kibi-proposition-complete-ingestion, REQ-kb-upsert-ledger-contract-in-error
 export function assertSemanticInventoryBoundary(payload, relationships, receipt) {
     const result = validateSemanticInventoryBoundary(payload, relationships, receipt);
     if (result.errors.length > 0) {
-        throw new Error(`Proposition-complete ingestion failed: ${result.errors.join("; ")}. Run kb_model mode analyze (CLI: semantic-advisor) with the complete prose and preserve its inventory contract before retrying.`);
+        throw new Error(`Proposition-complete ingestion failed: ${result.errors.join("; ")}. The contract kb_model mode analyze returns for this prose, to merge into properties and resend (a claim marked modeled needs one requires_property, requires_predicate or requires_rule link to a fact with its claim_key; otherwise keep the advisor's status): ${JSON.stringify(semanticInventoryContract(payload, receipt))}`);
     }
 }
 function modeledClaimKeysOf(payload) {
@@ -182,10 +213,13 @@ function groundingTargets(payload, relationships) {
 function plannedClaimKey(planned) {
     return planned.type === "fact" ? stringValue(planned.claim_key) : "";
 }
+function missingGroundingFactError(target) {
+    return `Proposition-complete ingestion failed: logical grounding target '${target}' does not exist yet. Write the fact first: the kb_compile_intent plan has an earlier fact step for '${target}' that carries its claim_key; run that step before this one, or apply the whole plan with kb_apply_plan.`;
+}
 function groundingClaimKeyError(modeledClaimKeys, grounded) {
     const missing = grounded.find(([, claimKey]) => !claimKey);
     if (missing)
-        return `Proposition-complete ingestion failed: logical grounding target '${missing[0]}' must declare a claim_key.`;
+        return `Proposition-complete ingestion failed: logical grounding target '${missing[0]}' must declare a claim_key: it is a fact without the claim_key of the claim it grounds. Set the claim_key the kb_compile_intent plan's fact step gives it.`;
     const groundedClaimKeys = grounded.map(([, claimKey]) => claimKey);
     const duplicate = groundedClaimKeys.find((claimKey, index) => groundedClaimKeys.indexOf(claimKey) !== index);
     if (duplicate)
@@ -256,6 +290,13 @@ export async function assertLogicalGroundingClaimKeys(prolog, payload, relations
             claimKey = result.success
                 ? stringValue(result.bindings.ClaimKey).replace(/^['"]|['"]$/g, "")
                 : "";
+            // implements REQ-kibi-symbol-link-guidance
+            // A target that is not stored yet is a skipped plan step, not a fact
+            // missing its key: say which step to run first.
+            if (!claimKey &&
+                !(await prolog.query(`once(kb_entity('${escapeAtom(target)}', _, _))`))
+                    .success)
+                throw new Error(missingGroundingFactError(target));
         }
         grounded.push([target, claimKey]);
         // The first target without a claim_key is reported; later reads are moot.

package/dist/prolog/utf8-transport.d.ts

@@ -0,0 +1,21 @@
+/**
+ * Prolog goal that switches the child's standard streams and its default
+ * file encoding to UTF-8. SWI-Prolog otherwise follows the process locale,
+ * and under a POSIX locale every non-ASCII byte read from stdin becomes
+ * U+FFFD, which the store then persists.
+ */
+export declare const PROLOG_UTF8_STREAMS_GOAL = "set_prolog_flag(encoding, utf8), set_stream(user_input, encoding(utf8)), set_stream(user_output, encoding(utf8)), set_stream(user_error, encoding(utf8))";
+/**
+ * Encode a goal for an environment variable. SWI-Prolog decodes environment
+ * values with the process locale, so non-ASCII goal text travels as base64
+ * of its UTF-8 bytes.
+ */
+export declare function encodeGoalForEnv(goal: string): string;
+/** Prolog goal that binds `Atom` to the goal stored by `encodeGoalForEnv`. */
+export declare function decodeGoalFromEnvGoal(variable: string, atom: string): string;
+/**
+ * A UTF-8 decoder for one child stream that keeps a character split across
+ * two chunks whole instead of decoding each half to U+FFFD.
+ */
+export declare function utf8ChunkDecoder(): (chunk: Buffer) => string;
+//# sourceMappingURL=utf8-transport.d.ts.map

package/dist/prolog/utf8-transport.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"utf8-transport.d.ts","sourceRoot":"","sources":["../../src/prolog/utf8-transport.ts"],"names":[],"mappings":"AAqBA;;;;;GAKG;AACH,eAAO,MAAM,wBAAwB,6JACuH,CAAC;AAG7J;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAErD;AAGD,8EAA8E;AAC9E,wBAAgB,qBAAqB,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAE5E;AAGD;;;GAGG;AACH,wBAAgB,gBAAgB,IAAI,CAAC,KAAK,EAAE,MAAM,KAAK,MAAM,CAG5D"}

package/dist/prolog/utf8-transport.js

@@ -0,0 +1,49 @@
+/*
+ Kibi — repo-local, per-branch, queryable long-term memory for software projects
+ Copyright (C) 2026 Piotr Franczyk
+
+ This program is free software: you can redistribute it and/or modify
+ it under the terms of the GNU Affero General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ GNU Affero General Public License for more details.
+
+ You should have received a copy of the GNU Affero General Public License
+ along with this program.  If not, see <https://www.gnu.org/licenses/>.
+*/
+import { StringDecoder } from "node:string_decoder";
+// implements REQ-prolog-utf8-text
+/**
+ * Prolog goal that switches the child's standard streams and its default
+ * file encoding to UTF-8. SWI-Prolog otherwise follows the process locale,
+ * and under a POSIX locale every non-ASCII byte read from stdin becomes
+ * U+FFFD, which the store then persists.
+ */
+export const PROLOG_UTF8_STREAMS_GOAL = "set_prolog_flag(encoding, utf8), set_stream(user_input, encoding(utf8)), set_stream(user_output, encoding(utf8)), set_stream(user_error, encoding(utf8))";
+// implements REQ-prolog-utf8-text
+/**
+ * Encode a goal for an environment variable. SWI-Prolog decodes environment
+ * values with the process locale, so non-ASCII goal text travels as base64
+ * of its UTF-8 bytes.
+ */
+export function encodeGoalForEnv(goal) {
+    return Buffer.from(goal, "utf8").toString("base64");
+}
+// implements REQ-prolog-utf8-text
+/** Prolog goal that binds `Atom` to the goal stored by `encodeGoalForEnv`. */
+export function decodeGoalFromEnvGoal(variable, atom) {
+    return `getenv('${variable}', ${atom}Encoded), base64_encoded(${atom}, ${atom}Encoded, [encoding(utf8), as(atom)])`;
+}
+// implements REQ-prolog-utf8-text
+/**
+ * A UTF-8 decoder for one child stream that keeps a character split across
+ * two chunks whole instead of decoding each half to U+FFFD.
+ */
+export function utf8ChunkDecoder() {
+    const decoder = new StringDecoder("utf8");
+    return (chunk) => decoder.write(chunk);
+}

package/dist/prolog.d.ts

@@ -52,6 +52,8 @@ export declare class PrologProcess {
     private outputOverflowed;
     private errorBuffer;
     private errorBufferBytes;
+    private decodeOutput;
+    private decodeError;
     private cache;
     private interactiveQueryTail;
     private terminationPromise;

package/dist/prolog.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"prolog.d.ts","sourceRoot":"","sources":["../src/prolog.ts"],"names":[],"mappings":"AA2BA,OAAO,EACL,KAAK,iBAAiB,EAEvB,MAAM,yBAAyB,CAAC;AACjC,OAAO,EACL,KAAK,aAAa,EAGnB,MAAM,4BAA4B,CAAC;AAUpC,wBAAgB,eAAe,IAAI,MAAM,CAsCxC;AACD,MAAM,WAAW,aAAa;IAC5B;;;OAGG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,gFAAgF;IAChF,aAAa,CAAC,EAAE,MAAM,aAAa,CAAC;IACpC,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB;;;;OAIG;IACH,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB;;;OAGG;IACH,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAED;;;;;;GAMG;AACH,qBAAa,4BAA6B,SAAQ,KAAK;IACrD,QAAQ,CAAC,IAAI,+BAA+B;IAC5C,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;gBAEZ,MAAM,EAAE,MAAM;CAO3B;AAED,MAAM,WAAW,WAAW;IAC1B,OAAO,EAAE,OAAO,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACjC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,WAAW,CAAC,EAAE,iBAAiB,CAAC;CACjC;AAGD,wBAAgB,uBAAuB,CACrC,OAAO,EAAE,CAAC,MAAM,IAAI,CAAC,GAAG,IAAI,EAC5B,OAAO,EAAE,MAAM,IAAI,EACnB,EAAE,GAAE,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,IAAI,KAAK,IAChB,GAC5B,MAAM,IAAI,CAIZ;AAGD,wBAAgB,sBAAsB,CACpC,OAAO,EAAE,CAAC,MAAM,IAAI,CAAC,GAAG,IAAI,EAC5B,SAAS,EAAE,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,EACrC,EAAE,GAAE,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,IAAI,KAAK,IAChB,GAC5B,MAAM,IAAI,CAQZ;AAED,qBAAa,aAAa;IACxB,OAAO,CAAC,OAAO,CAA6B;IAC5C,OAAO,CAAC,iBAAiB,CAAqB;IAC9C,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAsB;IACpD,OAAO,CAAC,OAAO,CAAS;IACxB,OAAO,CAAC,YAAY,CAAM;IAC1B,OAAO,CAAC,iBAAiB,CAAK;IAC9B,OAAO,CAAC,gBAAgB,CAAS;IACjC,OAAO,CAAC,WAAW,CAAM;IACzB,OAAO,CAAC,gBAAgB,CAAK;IAC7B,OAAO,CAAC,KAAK,CAAuC;IACpD,OAAO,CAAC,oBAAoB,CAAoC;IAChE,OAAO,CAAC,kBAAkB,CAA8B;IACxD,OAAO,CAAC,gBAAgB,CAA2B;IACnD,OAAO,CAAC,cAAc,CAAU;IAChC,OAAO,CAAC,cAAc,CAAuB;IAC7C,OAAO,CAAC,aAAa,CAA6B;IAClD,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAS;IACxC;;;;OAIG;IACH,OAAO,CAAC,kBAAkB,CAAS;IACnC,OAAO,CAAC,iBAAiB,CAAuB;IAChD,6EAA6E;IAC7E,OAAO,CAAC,YAAY,CAA6B;IACjD,OAAO,CAAC,mBAAmB,CAAS;gBAExB,OAAO,GAAE,aAAkB;IAiBvC,wBAAwB,CACtB,EAAE,GAAE,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,IAAI,KAAK,IAChB,GAC5B,IAAI;IAQP;;;OAGG;IACH,IAAI,WAAW,IAAI,OAAO,CAEzB;IAED;;;OAGG;IACH,YAAY,IAAI,OAAO;IAIvB;;;;OAIG;IACH,OAAO,CAAC,YAAY;IAOd,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;YAqEd,YAAY;IAgDpB,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,OAAO,CAAC,WAAW,CAAC;IA6Q1D,wEAAwE;IAClE,UAAU,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,GAAG,OAAO,CAAC,WAAW,CAAC;IAIhE,eAAe,IAAI,IAAI;IAIvB,OAAO,CAAC,eAAe;IA2BvB,OAAO,CAAC,cAAc;IAOtB,OAAO,CAAC,kBAAkB;YAIZ,YAAY;IA2C1B,OAAO,CAAC,WAAW;IAiOnB,OAAO,CAAC,aAAa;IAIrB,OAAO,CAAC,iBAAiB;IAQzB,OAAO,CAAC,iBAAiB;IAczB,OAAO,CAAC,gBAAgB;IAcxB;;;;OAIG;IACH,OAAO,CAAC,gBAAgB;IASxB,OAAO,CAAC,SAAS;IAOjB,OAAO,CAAC,kBAAkB;IAiB1B,OAAO,CAAC,mBAAmB;IAK3B,OAAO,CAAC,iBAAiB;YAkBX,oBAAoB;IAwClC,OAAO,CAAC,eAAe;IASvB,OAAO,CAAC,eAAe;IAmCvB,sEAAsE;IACtE,OAAO,CAAC,mBAAmB;IAY3B,OAAO,CAAC,cAAc;IAoGtB,SAAS,IAAI,OAAO;IASpB,MAAM,IAAI,MAAM;IAIhB,OAAO,CAAC,gBAAgB;IASxB;;;OAGG;IACG,SAAS,CAAC,OAAO,GAAE;QAAE,OAAO,CAAC,EAAE,MAAM,CAAA;KAAO,GAAG,OAAO,CAAC,IAAI,CAAC;CAqCnE"}
+{"version":3,"file":"prolog.d.ts","sourceRoot":"","sources":["../src/prolog.ts"],"names":[],"mappings":"AA2BA,OAAO,EACL,KAAK,iBAAiB,EAEvB,MAAM,yBAAyB,CAAC;AACjC,OAAO,EACL,KAAK,aAAa,EAGnB,MAAM,4BAA4B,CAAC;AAgBpC,wBAAgB,eAAe,IAAI,MAAM,CAsCxC;AACD,MAAM,WAAW,aAAa;IAC5B;;;OAGG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,gFAAgF;IAChF,aAAa,CAAC,EAAE,MAAM,aAAa,CAAC;IACpC,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB;;;;OAIG;IACH,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB;;;OAGG;IACH,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAED;;;;;;GAMG;AACH,qBAAa,4BAA6B,SAAQ,KAAK;IACrD,QAAQ,CAAC,IAAI,+BAA+B;IAC5C,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;gBAEZ,MAAM,EAAE,MAAM;CAO3B;AAED,MAAM,WAAW,WAAW;IAC1B,OAAO,EAAE,OAAO,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACjC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,WAAW,CAAC,EAAE,iBAAiB,CAAC;CACjC;AAGD,wBAAgB,uBAAuB,CACrC,OAAO,EAAE,CAAC,MAAM,IAAI,CAAC,GAAG,IAAI,EAC5B,OAAO,EAAE,MAAM,IAAI,EACnB,EAAE,GAAE,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,IAAI,KAAK,IAChB,GAC5B,MAAM,IAAI,CAIZ;AAGD,wBAAgB,sBAAsB,CACpC,OAAO,EAAE,CAAC,MAAM,IAAI,CAAC,GAAG,IAAI,EAC5B,SAAS,EAAE,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,EACrC,EAAE,GAAE,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,IAAI,KAAK,IAChB,GAC5B,MAAM,IAAI,CAQZ;AAED,qBAAa,aAAa;IACxB,OAAO,CAAC,OAAO,CAA6B;IAC5C,OAAO,CAAC,iBAAiB,CAAqB;IAC9C,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAsB;IACpD,OAAO,CAAC,OAAO,CAAS;IACxB,OAAO,CAAC,YAAY,CAAM;IAC1B,OAAO,CAAC,iBAAiB,CAAK;IAC9B,OAAO,CAAC,gBAAgB,CAAS;IACjC,OAAO,CAAC,WAAW,CAAM;IACzB,OAAO,CAAC,gBAAgB,CAAK;IAC7B,OAAO,CAAC,YAAY,CAAsB;IAC1C,OAAO,CAAC,WAAW,CAAsB;IACzC,OAAO,CAAC,KAAK,CAAuC;IACpD,OAAO,CAAC,oBAAoB,CAAoC;IAChE,OAAO,CAAC,kBAAkB,CAA8B;IACxD,OAAO,CAAC,gBAAgB,CAA2B;IACnD,OAAO,CAAC,cAAc,CAAU;IAChC,OAAO,CAAC,cAAc,CAAuB;IAC7C,OAAO,CAAC,aAAa,CAA6B;IAClD,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAS;IACxC;;;;OAIG;IACH,OAAO,CAAC,kBAAkB,CAAS;IACnC,OAAO,CAAC,iBAAiB,CAAuB;IAChD,6EAA6E;IAC7E,OAAO,CAAC,YAAY,CAA6B;IACjD,OAAO,CAAC,mBAAmB,CAAS;gBAExB,OAAO,GAAE,aAAkB;IAiBvC,wBAAwB,CACtB,EAAE,GAAE,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,IAAI,KAAK,IAChB,GAC5B,IAAI;IAQP;;;OAGG;IACH,IAAI,WAAW,IAAI,OAAO,CAEzB;IAED;;;OAGG;IACH,YAAY,IAAI,OAAO;IAIvB;;;;OAIG;IACH,OAAO,CAAC,YAAY;IAOd,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;YAuEd,YAAY;IAgDpB,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,OAAO,CAAC,WAAW,CAAC;IA6Q1D,wEAAwE;IAClE,UAAU,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,GAAG,OAAO,CAAC,WAAW,CAAC;IAIhE,eAAe,IAAI,IAAI;IAIvB,OAAO,CAAC,eAAe;IA2BvB,OAAO,CAAC,cAAc;IAOtB,OAAO,CAAC,kBAAkB;YAIZ,YAAY;IA2C1B,OAAO,CAAC,WAAW;IAqOnB,OAAO,CAAC,aAAa;IAIrB,OAAO,CAAC,iBAAiB;IAQzB,OAAO,CAAC,iBAAiB;IAczB,OAAO,CAAC,gBAAgB;IAcxB;;;;OAIG;IACH,OAAO,CAAC,gBAAgB;IASxB,OAAO,CAAC,SAAS;IAOjB,OAAO,CAAC,kBAAkB;IAiB1B,OAAO,CAAC,mBAAmB;IAK3B,OAAO,CAAC,iBAAiB;YAkBX,oBAAoB;IAwClC,OAAO,CAAC,eAAe;IASvB,OAAO,CAAC,eAAe;IAmCvB,sEAAsE;IACtE,OAAO,CAAC,mBAAmB;IAY3B,OAAO,CAAC,cAAc;IAoGtB,SAAS,IAAI,OAAO;IASpB,MAAM,IAAI,MAAM;IAIhB,OAAO,CAAC,gBAAgB;IASxB;;;OAGG;IACG,SAAS,CAAC,OAAO,GAAE;QAAE,OAAO,CAAC,EAAE,MAAM,CAAA;KAAO,GAAG,OAAO,CAAC,IAAI,CAAC;CAqCnE"}

package/dist/prolog.js

@@ -26,6 +26,7 @@ import { kibiPackageVersions } from "./package-versions.js";
 import { writePerformanceTraceEvent } from "./performance-trace.js";
 import { extractPrologErrorRecord, } from "./prolog/error-terms.js";
 import { resolveSwipl, swiplChildEnv, } from "./prolog/swipl-resolver.js";
+import { PROLOG_UTF8_STREAMS_GOAL, decodeGoalFromEnvGoal, encodeGoalForEnv, utf8ChunkDecoder, } from "./prolog/utf8-transport.js";
 const importMetaDir = path.dirname(fileURLToPath(import.meta.url));
 const DEFAULT_PROLOG_OUTPUT_MAX_BUFFER_BYTES = 8 * 1024 * 1024;
 const PROLOG_OUTPUT_OVERFLOW_ERROR = "Query exceeded bounded Prolog output capacity (ENOBUFS); narrow the operation or reduce stored entity size";
@@ -106,6 +107,8 @@ export class PrologProcess {
     outputOverflowed = false;
     errorBuffer = "";
     errorBufferBytes = 0;
+    decodeOutput = utf8ChunkDecoder();
+    decodeError = utf8ChunkDecoder();
     cache = new Map();
     interactiveQueryTail = Promise.resolve();
     terminationPromise = null;
@@ -183,7 +186,7 @@ export class PrologProcess {
         this.invalidateCache();
         this.process = spawn(launch.bin, [
             "-g",
-            `use_module('${kbPath}'), use_module(library(semweb/rdf_db)), set_prolog_flag(answer_write_options, [max_depth(0), quoted(true)])`,
+            `${PROLOG_UTF8_STREAMS_GOAL}, use_module('${kbPath}'), use_module(library(semweb/rdf_db)), set_prolog_flag(answer_write_options, [max_depth(0), quoted(true)])`,
             "--quiet",
         ], {
             detached: process.platform !== "win32",
@@ -196,6 +199,8 @@ export class PrologProcess {
             },
         });
         this.clearQueryBuffers();
+        this.decodeOutput = utf8ChunkDecoder();
+        this.decodeError = utf8ChunkDecoder();
         if (!this.process.stdout || !this.process.stderr || !this.process.stdin) {
             throw new Error("Failed to spawn Prolog process");
         }
@@ -574,10 +579,11 @@ export class PrologProcess {
                 : `(${goalList.join(", ")})`;
         const kbModulePath = resolveKbPlPath();
         const prologGoal = [
+            PROLOG_UTF8_STREAMS_GOAL,
             `use_module('${kbModulePath}')`,
             "use_module(library(semweb/rdf_db))",
             "set_prolog_flag(answer_write_options, [max_depth(0), quoted(true)])",
-            "getenv('KIBI_GOAL', GoalAtom)",
+            decodeGoalFromEnvGoal("KIBI_GOAL", "GoalAtom"),
             "read_term_from_atom(GoalAtom, Goal, [variable_names(Vars)])",
             kbPath ? "getenv('KIBI_KB_PATH', KBPath), kb_attach(KBPath)" : "true",
             isBatch ? "WrappedGoal = rdf_transaction(Goal)" : "WrappedGoal = Goal",
@@ -601,7 +607,7 @@ export class PrologProcess {
                 env: {
                     ...process.env,
                     ...launch.env,
-                    KIBI_GOAL: combinedGoal,
+                    KIBI_GOAL: encodeGoalForEnv(combinedGoal ?? "true"),
                     KIBI_RUNTIME_NAME: runtimeName,
                     KIBI_RUNTIME_VERSION: runtimeVersion,
                     KIBI_PACKAGE_VERSIONS: packageVersions,
@@ -627,13 +633,16 @@ export class PrologProcess {
         let settled = false;
         let closed = false;
         let termination = null;
+        const decodeStdout = utf8ChunkDecoder();
+        const decodeStderr = utf8ChunkDecoder();
         const appendChunk = (chunk, target) => {
             if (outputOverflowed)
                 return;
             const bytes = target === "stdout" ? outputBytes : errorBytes;
             const remaining = this.maxOutputBytes - bytes;
+            const decode = target === "stdout" ? decodeStdout : decodeStderr;
             if (chunk.byteLength > remaining) {
-                const clipped = chunk.subarray(0, Math.max(0, remaining)).toString();
+                const clipped = decode(chunk.subarray(0, Math.max(0, remaining)));
                 if (target === "stdout")
                     stdout += clipped;
                 else
@@ -643,11 +652,11 @@ export class PrologProcess {
                 return;
             }
             if (target === "stdout") {
-                stdout += chunk.toString();
+                stdout += decode(chunk);
                 outputBytes += chunk.byteLength;
             }
             else {
-                stderr += chunk.toString();
+                stderr += decode(chunk);
                 errorBytes += chunk.byteLength;
             }
         };
@@ -749,12 +758,12 @@ export class PrologProcess {
             return;
         const remaining = this.maxOutputBytes - this.outputBufferBytes;
         if (chunk.byteLength > remaining) {
-            this.outputBuffer += chunk.subarray(0, remaining).toString();
+            this.outputBuffer += this.decodeOutput(chunk.subarray(0, remaining));
             this.outputBufferBytes = this.maxOutputBytes;
             this.outputOverflowed = true;
             return;
         }
-        this.outputBuffer += chunk.toString();
+        this.outputBuffer += this.decodeOutput(chunk);
         this.outputBufferBytes += chunk.byteLength;
         this.wakeOutputWaiter();
     }
@@ -763,12 +772,12 @@ export class PrologProcess {
             return;
         const remaining = this.maxOutputBytes - this.errorBufferBytes;
         if (chunk.byteLength > remaining) {
-            this.errorBuffer += chunk.subarray(0, remaining).toString();
+            this.errorBuffer += this.decodeError(chunk.subarray(0, remaining));
             this.errorBufferBytes = this.maxOutputBytes;
             this.outputOverflowed = true;
             return;
         }
-        this.errorBuffer += chunk.toString();
+        this.errorBuffer += this.decodeError(chunk);
         this.errorBufferBytes += chunk.byteLength;
         this.wakeOutputWaiter();
     }

package/dist/public/impact/analyzer.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"analyzer.d.ts","sourceRoot":"","sources":["../../../src/public/impact/analyzer.ts"],"names":[],"mappings":"AA8BA,OAAO,KAAK,EACV,wBAAwB,EACxB,uBAAuB,EACxB,MAAM,YAAY,CAAC;AAGpB,wBAAsB,wBAAwB,CAC5C,OAAO,EAAE,wBAAwB,GAChC,OAAO,CAAC,uBAAuB,CAAC,CAmKlC"}
+{"version":3,"file":"analyzer.d.ts","sourceRoot":"","sources":["../../../src/public/impact/analyzer.ts"],"names":[],"mappings":"AAmCA,OAAO,KAAK,EACV,wBAAwB,EACxB,uBAAuB,EACxB,MAAM,YAAY,CAAC;AAWpB,wBAAsB,wBAAwB,CAC5C,OAAO,EAAE,wBAAwB,GAChC,OAAO,CAAC,uBAAuB,CAAC,CA0LlC"}

package/dist/public/impact/analyzer.js

@@ -7,11 +7,19 @@ import { extractSymbolsFromStagedFileAsync } from "../../traceability/symbol-ext
 import { isTraceabilityRelationshipType } from "../symbol-granularity.js";
 import { createSemanticReviewDiagnostics, createSymbolGranularityDiagnostics, } from "./diagnostics.js";
 import { createImpactManifestLookup, readImpactManifestResults, } from "./manifest.js";
+import { createRequirementStatementDiagnostics, readWorkspaceRequirement, workspaceFileChanged, } from "./requirement-statements.js";
 import { normalizeSourceFile } from "./source-changes.js";
 import { collectSourceChanges, uniqueSorted } from "./source-changes.js";
 import { buildNextActions, collectLinkedEntities, formatExtractedSymbols, } from "./summaries.js";
 import { createSymbolQualityDiagnostics } from "./symbol-quality.js";
 import { createUnownedFileDiagnostics } from "./unowned-files.js";
+/** The workspace-relative document a requirement was read from. */
+function requirementSourcePath(requirement) {
+    const source = requirement.source;
+    return source && !source.includes("://")
+        ? source.replace(/^\.\//, "")
+        : `.kb/requirements/${requirement.id}.md`;
+}
 export async function analyzeChangedFileImpact(options) {
     const workspaceRoot = path.resolve(options.workspaceRoot);
     const snapshot = options.staged
@@ -47,8 +55,11 @@ export async function analyzeChangedFileImpact(options) {
             (filter.size === 0 || filter.has(file.path)))
             .map((file) => file.path)
         : sourceChanges.map((change) => change.file));
-    const manifestResults = snapshot
-        ? readSnapshotKnowledge(snapshot.readGit, snapshot.headTree, snapshot.readBlobs).filter((result) => result.entity.type === "symbol")
+    const snapshotKnowledge = snapshot
+        ? readSnapshotKnowledge(snapshot.readGit, snapshot.headTree, snapshot.readBlobs)
+        : undefined;
+    const manifestResults = snapshotKnowledge
+        ? snapshotKnowledge.filter((result) => result.entity.type === "symbol")
         : readImpactManifestResults(workspaceRoot);
     const manifestLookup = createImpactManifestLookup(manifestResults);
     const symbolsByFile = new Map();
@@ -92,6 +103,19 @@ export async function analyzeChangedFileImpact(options) {
                 requestedFiles: [...filter],
                 linkedSourceFiles,
             }),
+            // What the changed code is meant to do, quoted, before the
+            // structural findings: "no violations" never compared it.
+            ...createRequirementStatementDiagnostics({
+                workspaceRoot,
+                symbolsByFile,
+                readRequirement: (id) => snapshotKnowledge
+                    ? snapshotKnowledge.find((result) => result.entity.id === id)
+                        ?.entity
+                    : readWorkspaceRequirement(workspaceRoot, id),
+                requirementChanged: (requirement) => snapshot
+                    ? snapshot.inventory.some((file) => file.path === requirementSourcePath(requirement))
+                    : workspaceFileChanged(workspaceRoot, requirementSourcePath(requirement)),
+            }),
             ...createSymbolGranularityDiagnostics({
                 manifestResults: activeManifestResults,
                 symbolsByFile,

package/dist/public/impact/requirement-statements.d.ts

@@ -0,0 +1,29 @@
+import { type ExtractedEntity } from "../../extractors/markdown.js";
+import type { KibiImpactDiagnostic } from "../../traceability/staged-diagnostics.js";
+import type { ExtractedSymbol } from "../../traceability/symbol-extract.js";
+export type RequirementStatementDiagnosticsOptions = {
+    readonly workspaceRoot: string;
+    readonly symbolsByFile: ReadonlyMap<string, readonly ExtractedSymbol[]>;
+    /** The requirement entity for an id, or undefined when it is unknown. */
+    readonly readRequirement: (id: string) => ExtractedEntity | undefined;
+    /** Whether the requirement's document changed in this change. */
+    readonly requirementChanged: (requirement: ExtractedEntity) => boolean;
+};
+/**
+ * One `requirement_statement_unverified` warning per current requirement that
+ * a changed behavioral symbol implements, quoting the requirement's statement
+ * and firmness. A requirement whose own document changed in the same change
+ * is left to the firmness and supersede checks.
+ */
+export declare function createRequirementStatementDiagnostics(options: RequirementStatementDiagnosticsOptions): KibiImpactDiagnostic[];
+/**
+ * Whether Git reports any change (staged, unstaged or untracked) to a
+ * workspace file against HEAD. Outside a repository nothing counts as changed.
+ */
+export declare function workspaceFileChanged(workspaceRoot: string, relativePath: string): boolean;
+/**
+ * Read a requirement from its canonical document in the working tree
+ * (`.kb/requirements/<id>.md`).
+ */
+export declare function readWorkspaceRequirement(workspaceRoot: string, id: string): ExtractedEntity | undefined;
+//# sourceMappingURL=requirement-statements.d.ts.map

package/dist/public/impact/requirement-statements.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"requirement-statements.d.ts","sourceRoot":"","sources":["../../../src/public/impact/requirement-statements.ts"],"names":[],"mappings":"AAGA,OAAO,EACL,KAAK,eAAe,EAErB,MAAM,8BAA8B,CAAC;AACtC,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,0CAA0C,CAAC;AACrF,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,sCAAsC,CAAC;AAgB5E,MAAM,MAAM,sCAAsC,GAAG;IACnD,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,aAAa,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,eAAe,EAAE,CAAC,CAAC;IACxE,yEAAyE;IACzE,QAAQ,CAAC,eAAe,EAAE,CAAC,EAAE,EAAE,MAAM,KAAK,eAAe,GAAG,SAAS,CAAC;IACtE,iEAAiE;IACjE,QAAQ,CAAC,kBAAkB,EAAE,CAAC,WAAW,EAAE,eAAe,KAAK,OAAO,CAAC;CACxE,CAAC;AAiBF;;;;;GAKG;AACH,wBAAgB,qCAAqC,CACnD,OAAO,EAAE,sCAAsC,GAC9C,oBAAoB,EAAE,CAsExB;AAGD;;;GAGG;AACH,wBAAgB,oBAAoB,CAClC,aAAa,EAAE,MAAM,EACrB,YAAY,EAAE,MAAM,GACnB,OAAO,CAeT;AAGD;;;GAGG;AACH,wBAAgB,wBAAwB,CACtC,aAAa,EAAE,MAAM,EACrB,EAAE,EAAE,MAAM,GACT,eAAe,GAAG,SAAS,CAS7B"}