kibi-cli 2.35.1 → 2.38.0

package/dist/logic/ir.js

@@ -13,7 +13,9 @@ function isRecord(value) {
     return typeof value === "object" && value !== null && !Array.isArray(value);
 }
 function asString(value) {
-    return typeof value === "string" && value.trim() ? value.trim() : undefined;
+    if (typeof value !== "string")
+        return undefined;
+    return value.trim() || undefined;
 }
 function invalidKeys(value, allowed, path, errors) {
     const allowedKeys = new Set(allowed);
@@ -28,8 +30,8 @@ function stableValue(value) {
         return value.map(stableValue);
     if (!isRecord(value))
         return value;
+    // JSON.stringify drops undefined fields itself.
     return Object.fromEntries(Object.entries(value)
-        .filter(([, nested]) => nested !== undefined)
         .sort(([a], [b]) => a.localeCompare(b))
         .map(([key, nested]) => [key, stableValue(nested)]));
 }
@@ -50,10 +52,23 @@ function mergeInto(target, source) {
     for (const value of source)
         target.add(value);
 }
+/** The name of a variable term, before the term itself is validated. */
+function variableName(term) {
+    return isRecord(term) && term.kind === "var" && typeof term.name === "string"
+        ? term.name
+        : undefined;
+}
+function addVariables(target, terms) {
+    for (const term of terms) {
+        const name = variableName(term);
+        if (name !== undefined)
+            target.add(name);
+    }
+}
 function validateTerm(value, path, declared, errors) {
     if (!isRecord(value) || typeof value.kind !== "string") {
         errors.push(`${path} must be a typed term object`);
-        return false;
+        return;
     }
     switch (value.kind) {
         case "var": {
@@ -66,7 +81,7 @@ function validateTerm(value, path, declared, errors) {
                 errors.push(`${path}.type must be a lowercase type name`);
             if (name && !declared.has(name))
                 errors.push(`${path}.name ${name} is not declared in variables`);
-            return true;
+            return;
         }
         case "const":
             invalidKeys(value, ["kind", "value", "type"], path, errors);
@@ -75,48 +90,43 @@ function validateTerm(value, path, declared, errors) {
             if (value.type !== undefined &&
                 (typeof value.type !== "string" || !TYPE_NAME.test(value.type)))
                 errors.push(`${path}.type is invalid`);
-            return true;
+            return;
         case "number":
             invalidKeys(value, ["kind", "value", "unit"], path, errors);
-            if (typeof value.value !== "number" || !Number.isFinite(value.value))
+            if (!Number.isFinite(value.value))
                 errors.push(`${path}.value must be finite`);
             if (value.unit !== undefined &&
                 (typeof value.unit !== "string" || !TYPE_NAME.test(value.unit)))
                 errors.push(`${path}.unit is invalid`);
-            return true;
+            return;
         case "duration":
             invalidKeys(value, ["kind", "value", "unit"], path, errors);
-            if (typeof value.value !== "number" ||
-                !Number.isFinite(value.value) ||
-                value.value < 0)
+            if (!Number.isFinite(value.value) || Number(value.value) < 0)
                 errors.push(`${path}.value must be a non-negative finite duration`);
             if (!["ms", "s", "m", "h", "d", "w"].includes(String(value.unit)))
                 errors.push(`${path}.unit is invalid`);
-            return true;
+            return;
         case "timestamp":
             invalidKeys(value, ["kind", "value"], path, errors);
             if (typeof value.value !== "string" ||
                 Number.isNaN(Date.parse(value.value)))
                 errors.push(`${path}.value must be an ISO timestamp`);
-            return true;
-        case "interval":
+            return;
+        case "interval": {
             invalidKeys(value, ["kind", "start", "end"], path, errors);
-            if (typeof value.start !== "string" ||
-                Number.isNaN(Date.parse(value.start)))
+            const start = typeof value.start === "string" ? Date.parse(value.start) : Number.NaN;
+            const end = typeof value.end === "string" ? Date.parse(value.end) : Number.NaN;
+            if (Number.isNaN(start))
                 errors.push(`${path}.start must be an ISO timestamp`);
-            if (typeof value.end !== "string" || Number.isNaN(Date.parse(value.end)))
+            if (Number.isNaN(end))
                 errors.push(`${path}.end must be an ISO timestamp`);
-            if (typeof value.start === "string" &&
-                typeof value.end === "string" &&
-                !Number.isNaN(Date.parse(value.start)) &&
-                !Number.isNaN(Date.parse(value.end)) &&
-                Date.parse(value.start) > Date.parse(value.end)) {
+            // Comparisons with NaN are false, so unparsable bounds add nothing here.
+            if (start > end)
                 errors.push(`${path}.start must not be after ${path}.end`);
-            }
-            return true;
+            return;
+        }
         default:
             errors.push(`${path}.kind ${String(value.kind)} is not supported`);
-            return false;
     }
 }
 function validateAtom(value, path, declared, errors) {
@@ -135,13 +145,9 @@ function validateAtom(value, path, declared, errors) {
         errors.push(`${path}.args must contain at most 8 terms`);
     const allVariables = new Set();
     const args = Array.isArray(value.args) ? value.args : [];
-    for (let index = 0; index < args.length; index += 1) {
-        validateTerm(args[index], `${path}.args[${index}]`, declared, errors);
-        if (isRecord(args[index]) &&
-            args[index].kind === "var" &&
-            typeof args[index].name === "string")
-            allVariables.add(args[index].name);
-    }
+    for (const [index, arg] of args.entries())
+        validateTerm(arg, `${path}.args[${index}]`, declared, errors);
+    addVariables(allVariables, args);
     if (value.polarity !== undefined &&
         value.polarity !== "positive" &&
         value.polarity !== "negative")
@@ -221,14 +227,7 @@ function validateExpression(value, path, declared, errors, depth) {
         validateTerm(value.left, `${path}.left`, declared, errors);
         validateTerm(value.right, `${path}.right`, declared, errors);
         const variables = new Set();
-        if (isRecord(value.left) &&
-            value.left.kind === "var" &&
-            typeof value.left.name === "string")
-            variables.add(value.left.name);
-        if (isRecord(value.right) &&
-            value.right.kind === "var" &&
-            typeof value.right.name === "string")
-            variables.add(value.right.name);
+        addVariables(variables, [value.left, value.right]);
         validateComparableTerms(value.left, value.right, path, errors);
         return { positiveVariables: new Set(), allVariables: variables, atoms: 0 };
     }
@@ -237,9 +236,7 @@ function validateExpression(value, path, declared, errors, depth) {
         const facts = validateAtom(value.atom, `${path}.atom`, declared, errors);
         if (!["eq", "neq", "lt", "lte", "gt", "gte"].includes(String(value.operator)))
             errors.push(`${path}.operator is invalid`);
-        if (typeof value.value !== "number" ||
-            !Number.isInteger(value.value) ||
-            value.value < 0)
+        if (!Number.isInteger(value.value) || Number(value.value) < 0)
             errors.push(`${path}.value must be a non-negative integer`);
         return {
             positiveVariables: facts.positiveVariables,
@@ -254,11 +251,7 @@ function validateExpression(value, path, declared, errors, depth) {
         validateTerm(value.left, `${path}.left`, declared, errors);
         validateTerm(value.right, `${path}.right`, declared, errors);
         const variables = new Set();
-        for (const term of [value.left, value.right])
-            if (isRecord(term) &&
-                term.kind === "var" &&
-                typeof term.name === "string")
-                variables.add(term.name);
+        addVariables(variables, [value.left, value.right]);
         validateTemporalTerms(value.relation, value.left, value.right, path, errors);
         return { positiveVariables: new Set(), allVariables: variables, atoms: 0 };
     }
@@ -301,27 +294,17 @@ function validateTemporalTerms(relation, left, right, path, errors) {
         errors.push(`${path} ${String(relation)} requires interval terms`);
     }
 }
+// Validation already requires lowercase identifiers, exact const types and
+// units, and unpadded variable names in terms (a padded one is never
+// declared); normalization trims what validation trimmed and puts times in
+// ISO form.
 function normalizeTerm(term) {
     if (term.kind === "var")
-        return {
-            ...term,
-            name: term.name.trim(),
-            type: term.type.trim().toLowerCase(),
-        };
+        return { ...term, type: term.type.trim() };
     if (term.kind === "const")
-        return {
-            ...term,
-            value: term.value.trim(),
-            ...(term.type ? { type: term.type.trim().toLowerCase() } : {}),
-        };
-    if (term.kind === "number")
-        return {
-            ...term,
-            value: term.value,
-            ...(term.unit ? { unit: term.unit.trim().toLowerCase() } : {}),
-        };
-    if (term.kind === "duration")
-        return { ...term, value: term.value, unit: term.unit };
+        return { ...term, value: term.value.trim() };
+    if (term.kind === "number" || term.kind === "duration")
+        return term;
     if (term.kind === "timestamp")
         return { ...term, value: new Date(term.value).toISOString() };
     return {
@@ -334,10 +317,7 @@ function normalizeExpression(expression) {
     if (expression.kind === "atom")
         return {
             ...expression,
-            name: expression.name.trim().toLowerCase(),
-            ...(expression.namespace
-                ? { namespace: expression.namespace.trim().toLowerCase() }
-                : {}),
+            name: expression.name.trim(),
             args: expression.args.map(normalizeTerm),
         };
     if (expression.kind === "all" || expression.kind === "any") {
@@ -351,17 +331,12 @@ function normalizeExpression(expression) {
             kind: "not",
             item: normalizeExpression(expression.item),
         };
-    if (expression.kind === "compare")
-        return {
-            ...expression,
-            left: normalizeTerm(expression.left),
-            right: normalizeTerm(expression.right),
-        };
     if (expression.kind === "count")
         return {
             ...expression,
             atom: normalizeExpression(expression.atom),
         };
+    // compare and temporal
     return {
         ...expression,
         left: normalizeTerm(expression.left),
@@ -386,20 +361,22 @@ function variableNamesInExpression(expression, names) {
             variableNamesInExpression(item, names);
         return;
     }
-    if (expression.kind === "not") {
-        variableNamesInExpression(expression.item, names);
-        return;
-    }
     if (expression.kind === "count") {
         variableNamesInExpression(expression.atom, names);
         return;
     }
-    if (expression.kind === "compare" || expression.kind === "temporal") {
+    // A negated atom's variables are bound by a positive atom or count that
+    // sorts before it, so they are named already; a temporal expression never
+    // holds a variable (its terms are timestamps or intervals).
+    if (expression.kind === "compare") {
         variableNamesInTerm(expression.left, names);
         variableNamesInTerm(expression.right, names);
     }
 }
 function renameTerm(term, names) {
+    // rationale: only a variable term has a name, so names.get misses for the
+    // others either way; the guard narrows the type.
+    // Stryker disable next-line ConditionalExpression
     if (term.kind !== "var")
         return term;
     const renamed = names.get(term.name);
@@ -433,17 +410,20 @@ function renameExpression(expression, names) {
     };
 }
 function alphaNormalizeVariables(ir) {
+    // Exception variables are bound by the body, so they are named already;
+    // declared but unused variables follow in name order (normalizeIr sorted
+    // them).
     const names = [];
     if (ir.head)
         variableNamesInExpression(ir.head, names);
     if (ir.body)
         variableNamesInExpression(ir.body, names);
-    for (const exception of ir.exceptions ?? [])
-        variableNamesInExpression(exception, names);
-    for (const variable of [...(ir.variables ?? [])].sort((left, right) => left.name.localeCompare(right.name))) {
-        if (!names.includes(variable.name))
-            names.push(variable.name);
-    }
+    // rationale: a stand-in entry has no name, and an undefined name renames
+    // nothing.
+    // Stryker disable next-line ArrayDeclaration
+    for (const { name } of ir.variables ?? [])
+        if (!names.includes(name))
+            names.push(name);
     const renames = new Map(names.map((name, index) => [name, `V${index + 1}`]));
     const variables = (ir.variables ?? [])
         .map((variable) => ({
@@ -478,7 +458,7 @@ function normalizeIr(ir) {
                     .map((variable) => ({
                     ...variable,
                     name: variable.name.trim(),
-                    type: variable.type.trim().toLowerCase(),
+                    type: variable.type.trim(),
                     quantifier: variable.quantifier ?? "forall",
                 }))
                     .sort((a, b) => a.name.localeCompare(b.name)),
@@ -509,7 +489,7 @@ function normalizeIr(ir) {
             ? { validFrom: new Date(ir.validFrom).toISOString() }
             : {}),
         ...(ir.validTo ? { validTo: new Date(ir.validTo).toISOString() } : {}),
-        ...(ir.ruleSchemaId ? { ruleSchemaId: ir.ruleSchemaId.trim() } : {}),
+        ...(ir.ruleSchemaId ? { ruleSchemaId: ir.ruleSchemaId } : {}),
     });
 }
 function prologTerm(term) {
@@ -601,6 +581,9 @@ export function validateLogicIr(input) {
             variable.quantifier !== "forall" &&
             variable.quantifier !== "exists")
             errors.push(`variables[${index}].quantifier is invalid`);
+        // rationale: an undefined name is never looked up, so adding it would be
+        // harmless; the guard keeps the set typed.
+        // Stryker disable next-line ConditionalExpression
         if (name)
             declared.add(name);
     }
@@ -636,20 +619,12 @@ export function validateLogicIr(input) {
     if (kind === "constraint" &&
         (input.body === undefined || input.head !== undefined))
         errors.push("constraint kind requires body and forbids head");
-    if (isRecord(input.head)) {
-        const headVars = new Set();
-        for (const term of Array.isArray(input.head.args) ? input.head.args : [])
-            if (isRecord(term) &&
-                term.kind === "var" &&
-                typeof term.name === "string")
-                headVars.add(term.name);
-        for (const variable of headVars) {
-            if (!facts.positiveVariables.has(variable))
-                errors.push(`head variable ${variable} is not range-restricted by a positive body atom`);
-            const declaration = variables.find((candidate) => isRecord(candidate) && candidate.name === variable);
-            if (declaration?.quantifier === "exists")
-                errors.push(`head variable ${variable} cannot be existential`);
-        }
+    for (const variable of headFacts.allVariables) {
+        if (!facts.positiveVariables.has(variable))
+            errors.push(`head variable ${variable} is not range-restricted by a positive body atom`);
+        const declaration = variables.find((candidate) => isRecord(candidate) && candidate.name === variable);
+        if (declaration?.quantifier === "exists")
+            errors.push(`head variable ${variable} cannot be existential`);
     }
     for (const variable of facts.allVariables)
         if (!declared.has(variable))
@@ -660,7 +635,7 @@ export function validateLogicIr(input) {
     if (input.exceptions !== undefined &&
         (!Array.isArray(input.exceptions) || input.exceptions.length > 16))
         errors.push("exceptions must contain at most 16 expressions");
-    if (input.exceptions !== undefined && Array.isArray(input.exceptions)) {
+    if (Array.isArray(input.exceptions)) {
         for (const [index, exception] of input.exceptions.entries()) {
             const exceptionFacts = validateExpression(exception, `exceptions[${index}]`, declared, errors, 0);
             for (const variable of exceptionFacts.allVariables)
@@ -696,9 +671,8 @@ export function validateLogicIr(input) {
         (typeof input.validTo !== "string" ||
             Number.isNaN(Date.parse(input.validTo))))
         errors.push("validTo must be an ISO timestamp");
-    if (input.validFrom &&
-        input.validTo &&
-        Date.parse(String(input.validFrom)) > Date.parse(String(input.validTo)))
+    // Missing or unparsable bounds parse to NaN, which never compares greater.
+    if (Date.parse(String(input.validFrom)) > Date.parse(String(input.validTo)))
         errors.push("validFrom must not be after validTo");
     if (errors.length > 0)
         return { valid: false, errors, warnings };
@@ -723,7 +697,7 @@ export function validateLogicIr(input) {
 }
 export function utf8Span(text, start, end) {
     return {
-        start: Buffer.byteLength(text.slice(0, Math.max(0, start)), "utf8"),
-        end: Buffer.byteLength(text.slice(0, Math.max(start, end)), "utf8"),
+        start: Buffer.byteLength(text.slice(0, Math.max(0, start))),
+        end: Buffer.byteLength(text.slice(0, Math.max(start, end))),
     };
 }

package/dist/operations/bootstrap/guidance-actions.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"guidance-actions.d.ts","sourceRoot":"","sources":["../../../src/operations/bootstrap/guidance-actions.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACtD,OAAO,KAAK,EACV,gBAAgB,EAChB,wBAAwB,EACxB,SAAS,EACT,gBAAgB,EACjB,MAAM,YAAY,CAAC;AAkBpB,wBAAgB,YAAY,CAC1B,IAAI,EAAE,MAAM,EACZ,UAAU,EAAE,gBAAgB,EAC5B,QAAQ,EAAE,wBAAwB,EAClC,UAAU,EAAE,SAAS,SAAS,EAAE,EAChC,OAAO,EAAE,SAAS,gBAAgB,EAAE,EACpC,MAAM,GAAE,SAAS,WAAW,EAAO,GAClC,SAAS,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,EAAE,CA+F9C"}
+{"version":3,"file":"guidance-actions.d.ts","sourceRoot":"","sources":["../../../src/operations/bootstrap/guidance-actions.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACtD,OAAO,KAAK,EACV,gBAAgB,EAChB,wBAAwB,EACxB,SAAS,EACT,gBAAgB,EACjB,MAAM,YAAY,CAAC;AAkBpB,wBAAgB,YAAY,CAC1B,IAAI,EAAE,MAAM,EACZ,UAAU,EAAE,gBAAgB,EAC5B,QAAQ,EAAE,wBAAwB,EAClC,UAAU,EAAE,SAAS,SAAS,EAAE,EAChC,OAAO,EAAE,SAAS,gBAAgB,EAAE,EACpC,MAAM,GAAE,SAAS,WAAW,EAAO,GAClC,SAAS,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,EAAE,CAgG9C"}

package/dist/operations/bootstrap/guidance-actions.js

@@ -92,8 +92,9 @@ export function buildActions(root, activation, declared, candidates, signals, of
             kind: "plugin_offer",
             package: offer.package,
             capability: offer.capability,
+            mode: offer.mode,
             evidence: offer.evidence,
-            description: `${offer.reason} (${summary(offer.evidence)}). Ask the operator whether to enable the experimental ${offer.package}; on yes, install it as a dev dependency and add it to package.json kibi.plugins with "${offer.capability}": { "mode": "augment" }; on no, add "${offer.package}" to kibi.declinedPlugins so bootstrap stops offering it.`,
+            description: `${offer.reason} (${summary(offer.evidence)}). Ask the operator whether to enable the experimental ${offer.package}; on yes, install it as a dev dependency and add it to package.json kibi.plugins with "${offer.capability}": { "mode": "${offer.mode}" }; on no, add "${offer.package}" to kibi.declinedPlugins so bootstrap stops offering it.`,
         });
     result.push({
         order,

package/dist/operations/bootstrap/plugin-offers.d.ts

@@ -3,14 +3,23 @@ import type { OperationContext } from "../../public/operations/runtime-types.js"
 export type PluginOffer = {
     readonly package: string;
     readonly capability: string;
+    /** The mode to activate the capability in. */
+    readonly mode: "augment" | "replace";
     readonly reason: string;
     readonly fileCount: number;
     readonly evidence: readonly string[];
 };
+/**
+ * Below this many requirements a reader can scan the list, and a question
+ * worded unlike the KB rarely misses; above it hints start to pay.
+ */
+export declare const SEARCH_HINTS_OFFER_REQUIREMENTS = 50;
 /**
  * Optional plugins worth offering for this workspace. kibi-plugin-ui is
- * offered when production React or Angular component files exist and the
- * project has neither activated nor declined it.
+ * offered when production React or Angular component files exist, and
+ * kibi-plugin-search-hints once the KB holds enough requirements that a
+ * question worded differently from them is likely to miss; neither is
+ * offered once the project activated or declined it.
  */
 export declare function pluginOffers(context: OperationContext, files: readonly string[]): Promise<readonly PluginOffer[]>;
 //# sourceMappingURL=plugin-offers.d.ts.map

package/dist/operations/bootstrap/plugin-offers.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"plugin-offers.d.ts","sourceRoot":"","sources":["../../../src/operations/bootstrap/plugin-offers.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,0CAA0C,CAAC;AAEjF,oFAAoF;AAEpF,MAAM,MAAM,WAAW,GAAG;IACxB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;CACtC,CAAC;AAgDF;;;;GAIG;AAEH,wBAAsB,YAAY,CAChC,OAAO,EAAE,gBAAgB,EACzB,KAAK,EAAE,SAAS,MAAM,EAAE,GACvB,OAAO,CAAC,SAAS,WAAW,EAAE,CAAC,CAgBjC"}
+{"version":3,"file":"plugin-offers.d.ts","sourceRoot":"","sources":["../../../src/operations/bootstrap/plugin-offers.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,0CAA0C,CAAC;AAGjF,oFAAoF;AAEpF,MAAM,MAAM,WAAW,GAAG;IACxB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,8CAA8C;IAC9C,QAAQ,CAAC,IAAI,EAAE,SAAS,GAAG,SAAS,CAAC;IACrC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;CACtC,CAAC;AAUF;;;GAGG;AAEH,eAAO,MAAM,+BAA+B,KAAK,CAAC;AAyDlD;;;;;;GAMG;AAEH,wBAAsB,YAAY,CAChC,OAAO,EAAE,gBAAgB,EACzB,KAAK,EAAE,SAAS,MAAM,EAAE,GACvB,OAAO,CAAC,SAAS,WAAW,EAAE,CAAC,CA6BjC"}

package/dist/operations/bootstrap/plugin-offers.js

@@ -1,9 +1,18 @@
 import path from "node:path";
+import { KB_PATHS } from "../../utils/kb-paths.js";
 const UI_PLUGIN = "kibi-plugin-ui";
 const UI_CAPABILITY = "kibi.check-policy.v1";
 const UI_SOURCE = /(?:\.(?:tsx|jsx)|\.component\.ts)$/i;
 const NOT_PRODUCTION = /(?:^|\/)(?:node_modules|dist|build|coverage|tests?|__tests__|e2e)\/|\.(?:test|spec|stories)\.[^/]+$/i;
 const EVIDENCE_LIMIT = 5;
+const HINTS_PLUGIN = "kibi-plugin-search-hints";
+const HINTS_CAPABILITY = "kibi.search-hints.v1";
+/**
+ * Below this many requirements a reader can scan the list, and a question
+ * worded unlike the KB rarely misses; above it hints start to pay.
+ */
+// implements REQ-kibi-plugin-search-hints
+export const SEARCH_HINTS_OFFER_REQUIREMENTS = 50;
 /** Plugin names the project activated or declined, from its package.json. */
 async function configuredPlugins(context) {
     let manifest;
@@ -41,26 +50,56 @@ async function configuredPlugins(context) {
                 names.add(name);
     return names;
 }
+/** Requirement documents already in the KB lane. */
+async function requirementFiles(context) {
+    if (!context.fs?.glob)
+        return [];
+    try {
+        return [
+            ...(await context.fs.glob([`${KB_PATHS.lanes.requirements}/**/*.md`], {
+                cwd: context.workspaceRoot,
+            })),
+        ].sort();
+    }
+    catch {
+        return [];
+    }
+}
 /**
  * Optional plugins worth offering for this workspace. kibi-plugin-ui is
- * offered when production React or Angular component files exist and the
- * project has neither activated nor declined it.
+ * offered when production React or Angular component files exist, and
+ * kibi-plugin-search-hints once the KB holds enough requirements that a
+ * question worded differently from them is likely to miss; neither is
+ * offered once the project activated or declined it.
  */
-// implements REQ-bootstrap-ui-plugin-offer
+// implements REQ-bootstrap-ui-plugin-offer, REQ-kibi-plugin-search-hints
 export async function pluginOffers(context, files) {
     const uiFiles = files.filter((file) => UI_SOURCE.test(file) && !NOT_PRODUCTION.test(file));
-    if (uiFiles.length === 0)
+    const requirements = await requirementFiles(context);
+    const wantsHints = requirements.length >= SEARCH_HINTS_OFFER_REQUIREMENTS;
+    if (uiFiles.length === 0 && !wantsHints)
         return [];
     const configured = await configuredPlugins(context);
-    if (configured === undefined || configured.has(UI_PLUGIN))
+    if (configured === undefined)
         return [];
-    return [
-        {
+    const offers = [];
+    if (uiFiles.length > 0 && !configured.has(UI_PLUGIN))
+        offers.push({
             package: UI_PLUGIN,
             capability: UI_CAPABILITY,
+            mode: "augment",
             reason: `${uiFiles.length} UI component file(s) found`,
             fileCount: uiFiles.length,
             evidence: uiFiles.slice(0, EVIDENCE_LIMIT),
-        },
-    ];
+        });
+    if (wantsHints && !configured.has(HINTS_PLUGIN))
+        offers.push({
+            package: HINTS_PLUGIN,
+            capability: HINTS_CAPABILITY,
+            mode: "replace",
+            reason: `${requirements.length} requirements in the KB; kb_search can suggest which ones a weakly answered question means`,
+            fileCount: requirements.length,
+            evidence: requirements.slice(0, EVIDENCE_LIMIT),
+        });
+    return offers;
 }

package/dist/operations/proof/claim-bindings.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"claim-bindings.d.ts","sourceRoot":"","sources":["../../../src/operations/proof/claim-bindings.ts"],"names":[],"mappings":"AAyBA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,0CAA0C,CAAC;AACjF,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AACpE,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EACL,KAAK,kBAAkB,EAIxB,MAAM,wBAAwB,CAAC;AAgDhC;;;GAGG;AAEH,wBAAgB,kBAAkB,CAChC,UAAU,EAAE,MAAM,EAClB,OAAO,EAAE,SAAS,MAAM,EAAE,EAC1B,WAAW,EAAE,MAAM,GAClB,MAAM,CAWR;AAgED;;;;;;GAMG;AAEH,wBAAgB,qBAAqB,CACnC,UAAU,EAAE,MAAM,EAClB,cAAc,EAAE,MAAM,EACtB,MAAM,EAAE,SAAS,MAAM,EAAE,GACxB,MAAM,CAgBR;AAED,uEAAuE;AACvE,wBAAgB,sBAAsB,CACpC,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,SAAS,MAAM,EAAE,EACzB,UAAU,EAAE,SAAS,MAAM,EAAE,GAC5B,MAAM,EAAE,CAaV;AA0JD;;;;;;GAMG;AAEH,wBAAgB,oBAAoB,CAClC,KAAK,EAAE,QAAQ,GAAG,QAAQ,EAC1B,QAAQ,EAAE,SAAS,YAAY,EAAE,GAAG,SAAS,GAC5C,QAAQ,GAAG,QAAQ,CAQrB;AAED;;;;;;GAMG;AAEH,wBAAsB,kBAAkB,CACtC,OAAO,EAAE,gBAAgB,EACzB,KAAK,EAAE,QAAQ,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,aAAa,CAAC;IACxB,OAAO,EAAE,kBAAkB,CAAC;IAC5B,gBAAgB,EAAE,SAAS,MAAM,EAAE,CAAC;CACrC,CAAC,GACD,OAAO,CAAC,YAAY,EAAE,GAAG,SAAS,CAAC,CA+FrC"}
+{"version":3,"file":"claim-bindings.d.ts","sourceRoot":"","sources":["../../../src/operations/proof/claim-bindings.ts"],"names":[],"mappings":"AAyBA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,0CAA0C,CAAC;AACjF,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AACpE,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EACL,KAAK,kBAAkB,EAIxB,MAAM,wBAAwB,CAAC;AAgDhC;;;GAGG;AAEH,wBAAgB,kBAAkB,CAChC,UAAU,EAAE,MAAM,EAClB,OAAO,EAAE,SAAS,MAAM,EAAE,EAC1B,WAAW,EAAE,MAAM,GAClB,MAAM,CAWR;AAgED;;;;;;GAMG;AAEH,wBAAgB,qBAAqB,CACnC,UAAU,EAAE,MAAM,EAClB,cAAc,EAAE,MAAM,EACtB,MAAM,EAAE,SAAS,MAAM,EAAE,GACxB,MAAM,CAgBR;AAED,uEAAuE;AACvE,wBAAgB,sBAAsB,CACpC,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,SAAS,MAAM,EAAE,EACzB,UAAU,EAAE,SAAS,MAAM,EAAE,GAC5B,MAAM,EAAE,CAaV;AA2JD;;;;;;GAMG;AAEH,wBAAgB,oBAAoB,CAClC,KAAK,EAAE,QAAQ,GAAG,QAAQ,EAC1B,QAAQ,EAAE,SAAS,YAAY,EAAE,GAAG,SAAS,GAC5C,QAAQ,GAAG,QAAQ,CAQrB;AAED;;;;;;GAMG;AAEH,wBAAsB,kBAAkB,CACtC,OAAO,EAAE,gBAAgB,EACzB,KAAK,EAAE,QAAQ,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,aAAa,CAAC;IACxB,OAAO,EAAE,kBAAkB,CAAC;IAC5B,gBAAgB,EAAE,SAAS,MAAM,EAAE,CAAC;CACrC,CAAC,GACD,OAAO,CAAC,YAAY,EAAE,GAAG,SAAS,CAAC,CA+FrC"}

package/dist/operations/proof/claim-bindings.js

@@ -225,6 +225,7 @@ const NON_NUMERIC_OBLIGATIONS = new Set([
     "set_relation",
     "nullable_fields",
     "route_middleware",
+    "sequence_precedes",
 ]);
 async function derivedProblem(context, contract, certificate, row, coveredBy) {
     const obligation = record(row.obligation) ?? {};

package/dist/operations/proof/code-certificates.d.ts

@@ -45,6 +45,8 @@ export declare function compiledToSourcePath(workspaceRoot: string, relativePath
 export declare function evaluateDomain(workspaceRoot: string, sourceFile: string, exportName: string, options?: Readonly<{
     /** The TypeScript runners to try, in order (default all three). */
     runners?: readonly ("bun" | "tsx" | "node")[];
+    /** Read this field of each member instead of the member itself. */
+    field?: string;
 }>): {
     ok: true;
     count: number;

package/dist/operations/proof/code-certificates.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"code-certificates.d.ts","sourceRoot":"","sources":["../../../src/operations/proof/code-certificates.ts"],"names":[],"mappings":"AA4BA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,0CAA0C,CAAC;AAKjF,OAAO,EAEL,KAAK,aAAa,EAClB,KAAK,SAAS,EAEf,MAAM,gCAAgC,CAAC;AAkBxC;;;GAGG;AAEH,MAAM,MAAM,kBAAkB,GAAG,QAAQ,CAAC;IACxC,IAAI,EAAE,SAAS,CAAC;IAChB,cAAc,EAAE,QAAQ,GAAG,QAAQ,CAAC;IACpC,WAAW,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;IAChD,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,qBAAqB,CAAC,EAAE,MAAM,CAAC;CAChC,CAAC,CAAC;AAEH,MAAM,MAAM,SAAS,GAAG,QAAQ,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,CAAC,CAAC;AAYpF,wBAAsB,UAAU,CAC9B,OAAO,EAAE,gBAAgB,EACzB,QAAQ,EAAE,MAAM,GACf,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC,CAS3B;AAED,wBAAgB,iBAAiB,CAAC,aAAa,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,iBAIxE;AAKD;;;;;;GAMG;AAEH,wBAAgB,aAAa,CAC3B,MAAM,EAAE,MAAM,EACd,UAAU,EAAE,MAAM,EAClB,UAAU,EAAE,MAAM,EAClB,UAAU,EAAE,MAAM,EAClB,aAAa,CAAC,EAAE,MAAM,GACrB,OAAO,CAgBT;AA0ED;;;;;GAKG;AAEH,wBAAgB,oBAAoB,CAClC,aAAa,EAAE,MAAM,EACrB,YAAY,EAAE,MAAM,GACnB,MAAM,GAAG,IAAI,CA2Bf;AAoED;;;;;;;;GAQG;AAEH,wBAAgB,cAAc,CAC5B,aAAa,EAAE,MAAM,EACrB,UAAU,EAAE,MAAM,EAClB,UAAU,EAAE,MAAM,EAClB,OAAO,GAAE,QAAQ,CAAC;IAChB,mEAAmE;IACnE,OAAO,CAAC,EAAE,SAAS,CAAC,KAAK,GAAG,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC;CAC/C,CAAM,GAEL;IAAE,EAAE,EAAE,IAAI,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI,CAAA;CAAE,GAC9D;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAShC;AAED;;GAEG;AAEH,wBAAgB,cAAc,CAC5B,aAAa,EAAE,MAAM,EACrB,UAAU,EAAE,MAAM,EAClB,UAAU,EAAE,MAAM,GACjB;IAAE,EAAE,EAAE,IAAI,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GAAG;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAM7D;AA2DD;;;GAGG;AAEH,wBAAgB,qBAAqB,CACnC,UAAU,EAAE,MAAM,EAClB,SAAS,EAAE,QAAQ,CAAC;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI,CAAA;CAAE,CAAC,EACzE,SAAS,EAAE,SAAS,MAAM,EAAE,GAC3B,MAAM,GAAG,IAAI,CAiBf;AAwHD;;;;;;;GAOG;AAEH,wBAAgB,cAAc,CAC5B,aAAa,EAAE,MAAM,EACrB,WAAW,EAAE,MAAM,EACnB,OAAO,GAAE,QAAQ,CAAC;IAAE,qBAAqB,CAAC,EAAE,OAAO,CAAA;CAAE,CAAM,GAEzD;IAAE,EAAE,EAAE,IAAI,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GAC7B;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,UAAU,CAAC,EAAE,MAAM,EAAE,CAAA;CAAE,CA2DvD;AAED,MAAM,MAAM,cAAc,GAAG,QAAQ,CAAC;IAAE,QAAQ,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC,CAAC;AAiF3E,2EAA2E;AAC3E,wBAAgB,YAAY,CAC1B,QAAQ,EAAE,MAAM,EAChB,SAAS,EAAE,KAAK,GAAG,MAAM,EACzB,GAAG,EAAE,cAAc,GAClB,MAAM,CAKR;AAED;;;;GAIG;AAEH,wBAAsB,iBAAiB,CACrC,OAAO,EAAE,gBAAgB,EACzB,QAAQ,EAAE,aAAa,GACtB,OAAO,CACN;IAAE,EAAE,EAAE,IAAI,CAAC;IAAC,MAAM,EAAE;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,EAAE,CAAA;CAAE,GAC5D;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAChC,CA0CA;AAmED,4EAA4E;AAE5E,wBAAgB,aAAa,CAC3B,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,MAAM,GACZ;IAAE,EAAE,EAAE,IAAI,CAAA;CAAE,GAAG;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CA0B9C;AA+FD;;;;;GAKG;AAEH,wBAAsB,yBAAyB,CAC7C,OAAO,EAAE,gBAAgB,EACzB,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,aAAa,EACvB,IAAI,EAAE,OAAO,GACZ,OAAO,CACR;IAAE,EAAE,EAAE,IAAI,CAAC;IAAC,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;CAAE,GAAG;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CACnF,CAsCA;AAID;;;;GAIG;AACH,wBAAgB,oBAAoB,CAClC,OAAO,EAAE,gBAAgB,EACzB,QAAQ,EAAE,aAAa,EACvB,MAAM,EAAE,MAAM,GACb,MAAM,CAOR;AAED,OAAO,EACL,wBAAwB,EACxB,gBAAgB,EAChB,gBAAgB,GACjB,MAAM,kBAAkB,CAAC;AAE1B;;;;;;;;GAQG;AAEH,wBAAsB,oBAAoB,CACxC,OAAO,EAAE,gBAAgB,EACzB,KAAK,EAAE,QAAQ,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,aAAa,CAAC;IACxB,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,OAAO,CAAC;CACtB,CAAC,GACD,OAAO,CAAC,kBAAkB,CAAC,CAoF7B"}
+{"version":3,"file":"code-certificates.d.ts","sourceRoot":"","sources":["../../../src/operations/proof/code-certificates.ts"],"names":[],"mappings":"AA2BA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,0CAA0C,CAAC;AAKjF,OAAO,EAEL,KAAK,aAAa,EAClB,KAAK,SAAS,EAEf,MAAM,gCAAgC,CAAC;AAmBxC;;;GAGG;AAEH,MAAM,MAAM,kBAAkB,GAAG,QAAQ,CAAC;IACxC,IAAI,EAAE,SAAS,CAAC;IAChB,cAAc,EAAE,QAAQ,GAAG,QAAQ,CAAC;IACpC,WAAW,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;IAChD,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,qBAAqB,CAAC,EAAE,MAAM,CAAC;CAChC,CAAC,CAAC;AAEH,MAAM,MAAM,SAAS,GAAG,QAAQ,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,CAAC,CAAC;AAYpF,wBAAsB,UAAU,CAC9B,OAAO,EAAE,gBAAgB,EACzB,QAAQ,EAAE,MAAM,GACf,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC,CAS3B;AAED,wBAAgB,iBAAiB,CAAC,aAAa,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,iBAIxE;AAKD;;;;;;GAMG;AAEH,wBAAgB,aAAa,CAC3B,MAAM,EAAE,MAAM,EACd,UAAU,EAAE,MAAM,EAClB,UAAU,EAAE,MAAM,EAClB,UAAU,EAAE,MAAM,EAClB,aAAa,CAAC,EAAE,MAAM,GACrB,OAAO,CAkBT;AA0ED;;;;;GAKG;AAEH,wBAAgB,oBAAoB,CAClC,aAAa,EAAE,MAAM,EACrB,YAAY,EAAE,MAAM,GACnB,MAAM,GAAG,IAAI,CA2Bf;AAsFD;;;;;;;;GAQG;AAEH,wBAAgB,cAAc,CAC5B,aAAa,EAAE,MAAM,EACrB,UAAU,EAAE,MAAM,EAClB,UAAU,EAAE,MAAM,EAClB,OAAO,GAAE,QAAQ,CAAC;IAChB,mEAAmE;IACnE,OAAO,CAAC,EAAE,SAAS,CAAC,KAAK,GAAG,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC;IAC9C,mEAAmE;IACnE,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB,CAAM,GAEL;IAAE,EAAE,EAAE,IAAI,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI,CAAA;CAAE,GAC9D;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAShC;AAED;;GAEG;AAEH,wBAAgB,cAAc,CAC5B,aAAa,EAAE,MAAM,EACrB,UAAU,EAAE,MAAM,EAClB,UAAU,EAAE,MAAM,GACjB;IAAE,EAAE,EAAE,IAAI,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GAAG;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAM7D;AA4DD;;;GAGG;AAEH,wBAAgB,qBAAqB,CACnC,UAAU,EAAE,MAAM,EAClB,SAAS,EAAE,QAAQ,CAAC;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI,CAAA;CAAE,CAAC,EACzE,SAAS,EAAE,SAAS,MAAM,EAAE,GAC3B,MAAM,GAAG,IAAI,CAiBf;AAwHD;;;;;;;GAOG;AAEH,wBAAgB,cAAc,CAC5B,aAAa,EAAE,MAAM,EACrB,WAAW,EAAE,MAAM,EACnB,OAAO,GAAE,QAAQ,CAAC;IAAE,qBAAqB,CAAC,EAAE,OAAO,CAAA;CAAE,CAAM,GAEzD;IAAE,EAAE,EAAE,IAAI,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GAC7B;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,UAAU,CAAC,EAAE,MAAM,EAAE,CAAA;CAAE,CA2DvD;AAED,MAAM,MAAM,cAAc,GAAG,QAAQ,CAAC;IAAE,QAAQ,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC,CAAC;AAiF3E,2EAA2E;AAC3E,wBAAgB,YAAY,CAC1B,QAAQ,EAAE,MAAM,EAChB,SAAS,EAAE,KAAK,GAAG,MAAM,EACzB,GAAG,EAAE,cAAc,GAClB,MAAM,CAKR;AAED;;;;GAIG;AAEH,wBAAsB,iBAAiB,CACrC,OAAO,EAAE,gBAAgB,EACzB,QAAQ,EAAE,aAAa,GACtB,OAAO,CACN;IAAE,EAAE,EAAE,IAAI,CAAC;IAAC,MAAM,EAAE;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,EAAE,CAAA;CAAE,GAC5D;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAChC,CA0CA;AAmED,4EAA4E;AAE5E,wBAAgB,aAAa,CAC3B,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,MAAM,GACZ;IAAE,EAAE,EAAE,IAAI,CAAA;CAAE,GAAG;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAyB9C;AAkGD;;;;;GAKG;AAEH,wBAAsB,yBAAyB,CAC7C,OAAO,EAAE,gBAAgB,EACzB,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,aAAa,EACvB,IAAI,EAAE,OAAO,GACZ,OAAO,CACR;IAAE,EAAE,EAAE,IAAI,CAAC;IAAC,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;CAAE,GAAG;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CACnF,CAsCA;AAID;;;;GAIG;AACH,wBAAgB,oBAAoB,CAClC,OAAO,EAAE,gBAAgB,EACzB,QAAQ,EAAE,aAAa,EACvB,MAAM,EAAE,MAAM,GACb,MAAM,CAOR;AAED,OAAO,EACL,wBAAwB,EACxB,gBAAgB,EAChB,gBAAgB,GACjB,MAAM,kBAAkB,CAAC;AAE1B;;;;;;;;GAQG;AAEH,wBAAsB,oBAAoB,CACxC,OAAO,EAAE,gBAAgB,EACzB,KAAK,EAAE,QAAQ,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,aAAa,CAAC;IACxB,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,OAAO,CAAC;CACtB,CAAC,GACD,OAAO,CAAC,kBAAkB,CAAC,CAoF7B"}