keywordgraph-mcp-server 1.7.3 → 1.8.4

package/dist/utils/feedback.d.ts

@@ -0,0 +1,63 @@
+export declare const FEEDBACK_SCHEMA_VERSION = 1;
+export declare const FEEDBACK_RULE_VERSION = 1;
+export declare const MAX_TEXT_FIELD_LENGTH = 200;
+export declare const CONSUMPTION: readonly ["none", "some", "most"];
+export declare const NOVELTY: readonly ["nothing_new", "some_new", "mostly_new"];
+export declare const TASK_FIT: readonly ["right_tool", "needed_another", "wrong_tool"];
+export declare const DEFECTS: readonly ["too_generic", "off_topic", "wrong_language", "truncated", "duplicates", "too_long_to_read", "error", "empty"];
+export declare const USER_NEXT: readonly ["built_on_it", "asked_followup", "ignored", "redirected", "unknown"];
+export type Consumption = (typeof CONSUMPTION)[number];
+export type Novelty = (typeof NOVELTY)[number];
+export type TaskFit = (typeof TASK_FIT)[number];
+export type Defect = (typeof DEFECTS)[number];
+export type UserNext = (typeof USER_NEXT)[number];
+export type FeedbackType = "useful" | "partly" | "not_useful";
+export interface FeedbackObservations {
+    workflow: string;
+    toolsUsed: string[];
+    consumption: Consumption;
+    usedExample?: string;
+    novelty: Novelty;
+    taskFit: TaskFit;
+    callsNeeded: number;
+    defects: Defect[];
+    userNext: UserNext;
+    reason: string;
+}
+export interface PreviousCallMetrics {
+    tool: string;
+    durationMs: number;
+    isError: boolean;
+    retry: boolean;
+    at: string;
+}
+export interface FeedbackRecord extends FeedbackObservations {
+    workflowId: string;
+    grounded: boolean;
+    consistent: boolean;
+    feedbackType: FeedbackType;
+    schemaVersion: number;
+    ruleVersion: number;
+    client?: string;
+    /** Objective metrics of the call that produced the rated output (utils/callTracking.ts). */
+    previousCall?: PreviousCallMetrics;
+}
+/**
+ * Stable id for "this workflow": the same tools in the same order for the
+ * same goal. A second report (e.g. next turn, to fill in `userNext`) gets the
+ * same id and is treated as an update by the analysis, not a new data point.
+ */
+export declare function workflowId(toolsUsed: string[], workflow: string): string;
+export declare function capText(value: string | undefined): string | undefined;
+/** A report that claims usage must quote what it used. */
+export declare function isGrounded(consumption: Consumption, usedExample: string | undefined): boolean;
+/**
+ * Cheap check that the free-text justification does not contradict the
+ * enums. Report-quality signal, not output-quality: it never changes what the
+ * model said, only flags it.
+ */
+export declare function isConsistent(observations: FeedbackObservations): boolean;
+/** Rule v1 — keep in sync with FEEDBACK_RULE_VERSION and the draft §1.6. */
+export declare function deriveFeedbackType(observations: FeedbackObservations, grounded: boolean): FeedbackType;
+export declare function buildFeedbackRecord(observations: FeedbackObservations, client?: string, previousCall?: PreviousCallMetrics): FeedbackRecord;
+//# sourceMappingURL=feedback.d.ts.map

package/dist/utils/feedback.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"feedback.d.ts","sourceRoot":"","sources":["../../src/utils/feedback.ts"],"names":[],"mappings":"AAWA,eAAO,MAAM,uBAAuB,IAAI,CAAC;AACzC,eAAO,MAAM,qBAAqB,IAAI,CAAC;AACvC,eAAO,MAAM,qBAAqB,MAAM,CAAC;AAEzC,eAAO,MAAM,WAAW,mCAAoC,CAAC;AAC7D,eAAO,MAAM,OAAO,oDAAqD,CAAC;AAC1E,eAAO,MAAM,QAAQ,yDAA0D,CAAC;AAChF,eAAO,MAAM,OAAO,0HASV,CAAC;AACX,eAAO,MAAM,SAAS,gFAMZ,CAAC;AAEX,MAAM,MAAM,WAAW,GAAG,CAAC,OAAO,WAAW,CAAC,CAAC,MAAM,CAAC,CAAC;AACvD,MAAM,MAAM,OAAO,GAAG,CAAC,OAAO,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC;AAC/C,MAAM,MAAM,OAAO,GAAG,CAAC,OAAO,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC;AAChD,MAAM,MAAM,MAAM,GAAG,CAAC,OAAO,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC;AAC9C,MAAM,MAAM,QAAQ,GAAG,CAAC,OAAO,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC;AAClD,MAAM,MAAM,YAAY,GAAG,QAAQ,GAAG,QAAQ,GAAG,YAAY,CAAC;AAE9D,MAAM,WAAW,oBAAoB;IACpC,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,WAAW,EAAE,WAAW,CAAC;IACzB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,OAAO,EAAE,OAAO,CAAC;IACjB,OAAO,EAAE,OAAO,CAAC;IACjB,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,QAAQ,EAAE,QAAQ,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,mBAAmB;IACnC,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,OAAO,EAAE,OAAO,CAAC;IACjB,KAAK,EAAE,OAAO,CAAC;IACf,EAAE,EAAE,MAAM,CAAC;CACX;AAED,MAAM,WAAW,cAAe,SAAQ,oBAAoB;IAC3D,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,OAAO,CAAC;IAClB,UAAU,EAAE,OAAO,CAAC;IACpB,YAAY,EAAE,YAAY,CAAC;IAC3B,aAAa,EAAE,MAAM,CAAC;IACtB,WAAW,EAAE,MAAM,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,4FAA4F;IAC5F,YAAY,CAAC,EAAE,mBAAmB,CAAC;CACnC;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAGxE;AAED,wBAAgB,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,GAAG,MAAM,GAAG,SAAS,CAMrE;AAED,0DAA0D;AAC1D,wBAAgB,UAAU,CACzB,WAAW,EAAE,WAAW,EACxB,WAAW,EAAE,MAAM,GAAG,SAAS,GAC7B,OAAO,CAGT;AAKD;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,YAAY,EAAE,oBAAoB,GAAG,OAAO,CASxE;AAED,4EAA4E;AAC5E,wBAAgB,kBAAkB,CACjC,YAAY,EAAE,oBAAoB,EAClC,QAAQ,EAAE,OAAO,GACf,YAAY,CAoBd;AAED,wBAAgB,mBAAmB,CAClC,YAAY,EAAE,oBAAoB,EAClC,MAAM,CAAC,EAAE,MAAM,EACf,YAAY,CAAC,EAAE,mBAAmB,GAChC,cAAc,CAsBhB"}

package/dist/utils/feedback.js

@@ -0,0 +1,115 @@
+/**
+ * Pure helpers for `submit_workflow_feedback` (see
+ * docs/drafts/workflow-feedback-tool.md). Everything here is deterministic
+ * and unit-tested; nothing touches the network.
+ *
+ * The model reports observations, never a score. The rating is derived here
+ * so the rule is inspectable and versioned; the raw observations are stored
+ * alongside it so the rating can be recomputed in SQL when the rule changes.
+ */
+import { createHash } from "node:crypto";
+export const FEEDBACK_SCHEMA_VERSION = 1;
+export const FEEDBACK_RULE_VERSION = 1;
+export const MAX_TEXT_FIELD_LENGTH = 200;
+export const CONSUMPTION = ["none", "some", "most"];
+export const NOVELTY = ["nothing_new", "some_new", "mostly_new"];
+export const TASK_FIT = ["right_tool", "needed_another", "wrong_tool"];
+export const DEFECTS = [
+    "too_generic",
+    "off_topic",
+    "wrong_language",
+    "truncated",
+    "duplicates",
+    "too_long_to_read",
+    "error",
+    "empty",
+];
+export const USER_NEXT = [
+    "built_on_it",
+    "asked_followup",
+    "ignored",
+    "redirected",
+    "unknown",
+];
+/**
+ * Stable id for "this workflow": the same tools in the same order for the
+ * same goal. A second report (e.g. next turn, to fill in `userNext`) gets the
+ * same id and is treated as an update by the analysis, not a new data point.
+ */
+export function workflowId(toolsUsed, workflow) {
+    const key = `${toolsUsed.join(">")}|${workflow.trim().toLowerCase()}`;
+    return createHash("sha1").update(key).digest("hex").slice(0, 10);
+}
+export function capText(value) {
+    if (value === undefined)
+        return undefined;
+    const trimmed = value.trim();
+    return trimmed.length > MAX_TEXT_FIELD_LENGTH
+        ? `${trimmed.slice(0, MAX_TEXT_FIELD_LENGTH - 1)}…`
+        : trimmed;
+}
+/** A report that claims usage must quote what it used. */
+export function isGrounded(consumption, usedExample) {
+    if (consumption === "none")
+        return true;
+    return Boolean(usedExample && usedExample.trim().length > 0);
+}
+const NOT_USED_RE = /\b(didn'?t|did not|never|not)\s+(use|used|using|need|needed|incorporate)\b|\bignored\b|\bdiscarded\b|\bunused\b/i;
+const WRONG_TOOL_RE = /\bwrong tool\b|\bshould have (used|called)\b|\bbetter tool\b|\bnot the right tool\b/i;
+/**
+ * Cheap check that the free-text justification does not contradict the
+ * enums. Report-quality signal, not output-quality: it never changes what the
+ * model said, only flags it.
+ */
+export function isConsistent(observations) {
+    const reason = observations.reason;
+    if (observations.consumption === "most" && NOT_USED_RE.test(reason)) {
+        return false;
+    }
+    if (observations.taskFit === "right_tool" && WRONG_TOOL_RE.test(reason)) {
+        return false;
+    }
+    return true;
+}
+/** Rule v1 — keep in sync with FEEDBACK_RULE_VERSION and the draft §1.6. */
+export function deriveFeedbackType(observations, grounded) {
+    const { consumption, novelty, taskFit, defects } = observations;
+    if (consumption === "none" ||
+        taskFit === "wrong_tool" ||
+        defects.includes("error") ||
+        defects.includes("empty")) {
+        return "not_useful";
+    }
+    if (consumption === "most" &&
+        novelty !== "nothing_new" &&
+        taskFit === "right_tool" &&
+        defects.length === 0 &&
+        grounded) {
+        return "useful";
+    }
+    return "partly";
+}
+export function buildFeedbackRecord(observations, client, previousCall) {
+    const workflow = capText(observations.workflow) ?? "";
+    const usedExample = capText(observations.usedExample);
+    const grounded = isGrounded(observations.consumption, usedExample);
+    const normalized = {
+        ...observations,
+        workflow,
+        usedExample,
+        reason: capText(observations.reason) ?? "",
+        defects: [...new Set(observations.defects)],
+    };
+    return {
+        ...normalized,
+        workflowId: workflowId(observations.toolsUsed, workflow),
+        grounded,
+        consistent: isConsistent(normalized),
+        feedbackType: deriveFeedbackType(normalized, grounded),
+        schemaVersion: FEEDBACK_SCHEMA_VERSION,
+        ruleVersion: FEEDBACK_RULE_VERSION,
+        ...(client ? { client } : {}),
+        ...(previousCall ? { previousCall } : {}),
+    };
+}
+//# sourceMappingURL=feedback.js.map

package/dist/utils/feedback.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"feedback.js","sourceRoot":"","sources":["../../src/utils/feedback.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,MAAM,CAAC,MAAM,uBAAuB,GAAG,CAAC,CAAC;AACzC,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,CAAC;AACvC,MAAM,CAAC,MAAM,qBAAqB,GAAG,GAAG,CAAC;AAEzC,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAU,CAAC;AAC7D,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,aAAa,EAAE,UAAU,EAAE,YAAY,CAAU,CAAC;AAC1E,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,YAAY,EAAE,gBAAgB,EAAE,YAAY,CAAU,CAAC;AAChF,MAAM,CAAC,MAAM,OAAO,GAAG;IACtB,aAAa;IACb,WAAW;IACX,gBAAgB;IAChB,WAAW;IACX,YAAY;IACZ,kBAAkB;IAClB,OAAO;IACP,OAAO;CACE,CAAC;AACX,MAAM,CAAC,MAAM,SAAS,GAAG;IACxB,aAAa;IACb,gBAAgB;IAChB,SAAS;IACT,YAAY;IACZ,SAAS;CACA,CAAC;AA0CX;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,SAAmB,EAAE,QAAgB;IAC/D,MAAM,GAAG,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,EAAE,CAAC;IACtE,OAAO,UAAU,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AAClE,CAAC;AAED,MAAM,UAAU,OAAO,CAAC,KAAyB;IAChD,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAC1C,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IAC7B,OAAO,OAAO,CAAC,MAAM,GAAG,qBAAqB;QAC5C,CAAC,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,qBAAqB,GAAG,CAAC,CAAC,GAAG;QACnD,CAAC,CAAC,OAAO,CAAC;AACZ,CAAC;AAED,0DAA0D;AAC1D,MAAM,UAAU,UAAU,CACzB,WAAwB,EACxB,WAA+B;IAE/B,IAAI,WAAW,KAAK,MAAM;QAAE,OAAO,IAAI,CAAC;IACxC,OAAO,OAAO,CAAC,WAAW,IAAI,WAAW,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAC9D,CAAC;AAED,MAAM,WAAW,GAAG,kHAAkH,CAAC;AACvI,MAAM,aAAa,GAAG,sFAAsF,CAAC;AAE7G;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,YAAkC;IAC9D,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC;IACnC,IAAI,YAAY,CAAC,WAAW,KAAK,MAAM,IAAI,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;QACrE,OAAO,KAAK,CAAC;IACd,CAAC;IACD,IAAI,YAAY,CAAC,OAAO,KAAK,YAAY,IAAI,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;QACzE,OAAO,KAAK,CAAC;IACd,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAED,4EAA4E;AAC5E,MAAM,UAAU,kBAAkB,CACjC,YAAkC,EAClC,QAAiB;IAEjB,MAAM,EAAE,WAAW,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,YAAY,CAAC;IAChE,IACC,WAAW,KAAK,MAAM;QACtB,OAAO,KAAK,YAAY;QACxB,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC;QACzB,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,EACxB,CAAC;QACF,OAAO,YAAY,CAAC;IACrB,CAAC;IACD,IACC,WAAW,KAAK,MAAM;QACtB,OAAO,KAAK,aAAa;QACzB,OAAO,KAAK,YAAY;QACxB,OAAO,CAAC,MAAM,KAAK,CAAC;QACpB,QAAQ,EACP,CAAC;QACF,OAAO,QAAQ,CAAC;IACjB,CAAC;IACD,OAAO,QAAQ,CAAC;AACjB,CAAC;AAED,MAAM,UAAU,mBAAmB,CAClC,YAAkC,EAClC,MAAe,EACf,YAAkC;IAElC,MAAM,QAAQ,GAAG,OAAO,CAAC,YAAY,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;IACtD,MAAM,WAAW,GAAG,OAAO,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC;IACtD,MAAM,QAAQ,GAAG,UAAU,CAAC,YAAY,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;IACnE,MAAM,UAAU,GAAyB;QACxC,GAAG,YAAY;QACf,QAAQ;QACR,WAAW;QACX,MAAM,EAAE,OAAO,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,EAAE;QAC1C,OAAO,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;KAC3C,CAAC;IACF,OAAO;QACN,GAAG,UAAU;QACb,UAAU,EAAE,UAAU,CAAC,YAAY,CAAC,SAAS,EAAE,QAAQ,CAAC;QACxD,QAAQ;QACR,UAAU,EAAE,YAAY,CAAC,UAAU,CAAC;QACpC,YAAY,EAAE,kBAAkB,CAAC,UAAU,EAAE,QAAQ,CAAC;QACtD,aAAa,EAAE,uBAAuB;QACtC,WAAW,EAAE,qBAAqB;QAClC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7B,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACzC,CAAC;AACH,CAAC"}

package/dist/utils/graphInput.d.ts

@@ -16,6 +16,7 @@ export type GraphInputResult = {
     ok: false;
     error: string;
 };
+export declare function timestampIsParsable(value: string): boolean;
 /**
  * Validate a caller-supplied statements array and its parallel metadata.
  * Returns null when valid, otherwise the error message to hand back.

package/dist/utils/graphInput.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"graphInput.d.ts","sourceRoot":"","sources":["../../src/utils/graphInput.ts"],"names":[],"mappings":"AACA,OAAO,EAIN,KAAK,aAAa,EAClB,KAAK,gBAAgB,EACrB,MAAM,oBAAoB,CAAC;AAE5B,MAAM,WAAW,gBAAgB;IAChC,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;IACtB,UAAU,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC;IACxB,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;IACtB,aAAa,CAAC,EAAE,aAAa,CAAC;CAC9B;AAED,MAAM,MAAM,gBAAgB,GACzB;IAAE,EAAE,EAAE,IAAI,CAAC;IAAC,OAAO,EAAE,gBAAgB,GAAG;QAAE,IAAI,EAAE,MAAM,CAAA;KAAE,CAAA;CAAE,GAC1D;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC;AAchC;;;GAGG;AACH,wBAAgB,uBAAuB,CACtC,UAAU,EAAE,MAAM,EAAE,EACpB,UAAU,CAAC,EAAE,MAAM,EAAE,EAAE,EACvB,UAAU,CAAC,EAAE,MAAM,EAAE,GACnB,MAAM,GAAG,IAAI,CAkBf;AAED;;;;;GAKG;AACH,wBAAsB,iBAAiB,CACtC,MAAM,EAAE,gBAAgB,GACtB,OAAO,CAAC,gBAAgB,CAAC,CAiD3B;AAED,MAAM,MAAM,WAAW,GACpB;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,GAChB;IAAE,GAAG,EAAE,MAAM,CAAA;CAAE,GACf;IAAE,SAAS,EAAE,MAAM,CAAA;CAAE,GACrB;IAAE,UAAU,EAAE,MAAM,EAAE,CAAC;IAAC,UAAU,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC;IAAC,UAAU,CAAC,EAAE,MAAM,EAAE,CAAA;CAAE,CAAC;AAM5E,MAAM,MAAM,gBAAgB,GACzB;IACA,EAAE,EAAE,IAAI,CAAC;IACT,QAAQ,EAAE,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;IACzC,eAAe,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACzC,GACD;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC;AAEhC;;;;;;;;;;;;;;GAcG;AACH,wBAAsB,eAAe,CACpC,KAAK,EAAE,WAAW,EAAE,EACpB,oBAAoB,EAAE,CACrB,SAAS,EAAE,MAAM,KACb,OAAO,CAAC;IAAE,EAAE,EAAE,IAAI,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAAG;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC,GACrE,OAAO,CAAC,gBAAgB,CAAC,CA6E3B"}
+{"version":3,"file":"graphInput.d.ts","sourceRoot":"","sources":["../../src/utils/graphInput.ts"],"names":[],"mappings":"AACA,OAAO,EAIN,KAAK,aAAa,EAClB,KAAK,gBAAgB,EACrB,MAAM,oBAAoB,CAAC;AAE5B,MAAM,WAAW,gBAAgB;IAChC,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;IACtB,UAAU,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC;IACxB,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;IACtB,aAAa,CAAC,EAAE,aAAa,CAAC;CAC9B;AAED,MAAM,MAAM,gBAAgB,GACzB;IAAE,EAAE,EAAE,IAAI,CAAC;IAAC,OAAO,EAAE,gBAAgB,GAAG;QAAE,IAAI,EAAE,MAAM,CAAA;KAAE,CAAA;CAAE,GAC1D;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC;AAShC,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAG1D;AAED;;;GAGG;AACH,wBAAgB,uBAAuB,CACtC,UAAU,EAAE,MAAM,EAAE,EACpB,UAAU,CAAC,EAAE,MAAM,EAAE,EAAE,EACvB,UAAU,CAAC,EAAE,MAAM,EAAE,GACnB,MAAM,GAAG,IAAI,CAkBf;AAED;;;;;GAKG;AACH,wBAAsB,iBAAiB,CACtC,MAAM,EAAE,gBAAgB,GACtB,OAAO,CAAC,gBAAgB,CAAC,CAiD3B;AAED,MAAM,MAAM,WAAW,GACpB;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,GAChB;IAAE,GAAG,EAAE,MAAM,CAAA;CAAE,GACf;IAAE,SAAS,EAAE,MAAM,CAAA;CAAE,GACrB;IAAE,UAAU,EAAE,MAAM,EAAE,CAAC;IAAC,UAAU,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC;IAAC,UAAU,CAAC,EAAE,MAAM,EAAE,CAAA;CAAE,CAAC;AAM5E,MAAM,MAAM,gBAAgB,GACzB;IACA,EAAE,EAAE,IAAI,CAAC;IACT,QAAQ,EAAE,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;IACzC,eAAe,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACzC,GACD;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC;AAEhC;;;;;;;;;;;;;;GAcG;AACH,wBAAsB,eAAe,CACpC,KAAK,EAAE,WAAW,EAAE,EACpB,oBAAoB,EAAE,CACrB,SAAS,EAAE,MAAM,KACb,OAAO,CAAC;IAAE,EAAE,EAAE,IAAI,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAAG;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC,GACrE,OAAO,CAAC,gBAAgB,CAAC,CA6E3B"}

package/dist/utils/graphInput.js

@@ -6,7 +6,7 @@ import { prepareStatementsPayload, prepareWikilinksPayload, statementsContextSet
 // it returns false for, which becomes 1970-01-01 downstream. Neither failure is
 // visible to the caller, so anything ambiguous is refused here instead.
 const ISO_DATE = /^\d{4}-\d{2}-\d{2}([T ]\d{2}:\d{2}(:\d{2}(\.\d+)?)?(Z|[+-]\d{2}:?\d{2})?)?$/;
-function timestampIsParsable(value) {
+export function timestampIsParsable(value) {
     const trimmed = value.trim();
     return ISO_DATE.test(trimmed) && Number.isFinite(Date.parse(trimmed));
 }

package/dist/utils/graphInput.js.map

@@ -1 +1 @@
-{"version":3,"file":"graphInput.js","sourceRoot":"","sources":["../../src/utils/graphInput.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,qBAAqB,EAAE,MAAM,iBAAiB,CAAC;AACxD,OAAO,EACN,wBAAwB,EACxB,uBAAuB,EACvB,yBAAyB,GAGzB,MAAM,oBAAoB,CAAC;AAe5B,6EAA6E;AAC7E,8EAA8E;AAC9E,+EAA+E;AAC/E,gFAAgF;AAChF,wEAAwE;AACxE,MAAM,QAAQ,GAAG,6EAA6E,CAAC;AAE/F,SAAS,mBAAmB,CAAC,KAAa;IACzC,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IAC7B,OAAO,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;AACvE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,uBAAuB,CACtC,UAAoB,EACpB,UAAuB,EACvB,UAAqB;IAErB,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,uCAAuC,CAAC;IAC5E,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,SAAS,EAAE,IAAI,EAAE,CAAC;QACrD,OAAO,gHAAgH,CAAC;IACzH,8EAA8E;IAC9E,gDAAgD;IAChD,IAAI,UAAU,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,IAAI,UAAU,CAAC,MAAM,KAAK,UAAU,CAAC,MAAM;QACjF,OAAO,6DAA6D,UAAU,CAAC,MAAM,mBAAmB,UAAU,CAAC,MAAM,kEAAkE,CAAC;IAC7L,IAAI,UAAU,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzC,IAAI,UAAU,CAAC,MAAM,KAAK,UAAU,CAAC,MAAM;YAC1C,OAAO,6DAA6D,UAAU,CAAC,MAAM,mBAAmB,UAAU,CAAC,MAAM,iEAAiE,CAAC;QAC5L,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAC1B,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,CACnE,CAAC;QACF,IAAI,GAAG;YACN,OAAO,cAAc,GAAG,+KAA+K,CAAC;IAC1M,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CACtC,MAAwB;IAExB,MAAM,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,aAAa,EAAE,GAAG,MAAM,CAAC;IACrE,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;IAC7C,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAEnC,IAAI,UAAU,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzC,IAAI,OAAO,IAAI,MAAM,EAAE,CAAC;YACvB,OAAO;gBACN,EAAE,EAAE,KAAK;gBACT,KAAK,EACJ,uFAAuF;aACxF,CAAC;QACH,CAAC;QACD,MAAM,OAAO,GAAG,uBAAuB,CAAC,UAAU,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;QAC5E,IAAI,OAAO;YAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;QAClD,OAAO;YACN,EAAE,EAAE,IAAI;YACR,OAAO,EAAE,wBAAwB,CAChC,UAAU,EACV,UAAU,EACV,aAAa,EACb,UAAU,CAC6B;SACxC,CAAC;IACH,CAAC;IAED,IAAI,WAAmB,CAAC;IACxB,IAAI,MAAM,EAAE,CAAC;QACZ,MAAM,MAAM,GAAG,MAAM,qBAAqB,CAAC,MAAM,CAAC,GAAa,CAAC,CAAC;QACjE,IAAI,CAAC,MAAM,CAAC,EAAE;YAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC;QAC1D,WAAW,GAAG,MAAM,CAAC,WAAW,CAAC;QACjC,IAAI,CAAC,WAAW,EAAE,IAAI,EAAE;YACvB,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,qCAAqC,EAAE,CAAC;IACrE,CAAC;SAAM,IAAI,OAAO,EAAE,CAAC;QACpB,WAAW,GAAG,MAAM,CAAC,IAAc,CAAC;IACrC,CAAC;SAAM,CAAC;QACP,OAAO;YACN,EAAE,EAAE,KAAK;YACT,KAAK,EAAE,uDAAuD;SAC9D,CAAC;IACH,CAAC;IAED,OAAO;QACN,EAAE,EAAE,IAAI;QACR,OAAO,EAAE;YACR,IAAI,EAAE,WAAW;YACjB,GAAG,uBAAuB,CAAC,WAAW,EAAE,aAAa,CAAC;SACtD;KACD,CAAC;AACH,CAAC;AAoBD;;;;;;;;;;;;;;GAcG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACpC,KAAoB,EACpB,oBAEuE;IAEvE,MAAM,QAAQ,GAAmB,EAAE,CAAC;IAEpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,YAAY,IAAI,IAAI,EAAE,CAAC;YAC1B,MAAM,OAAO,GAAG,uBAAuB,CACtC,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,UAAU,CACf,CAAC;YACF,IAAI,OAAO;gBACV,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,oBAAoB,CAAC,KAAK,OAAO,EAAE,EAAE,CAAC;YAClE,QAAQ,CAAC,IAAI,CAAC;gBACb,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,GAAG,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACnE,GAAG,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aACnE,CAAC,CAAC;YACH,SAAS;QACV,CAAC;QACD,IAAI,MAAM,IAAI,IAAI,EAAE,CAAC;YACpB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;gBACpB,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,oBAAoB,CAAC,kBAAkB,EAAE,CAAC;YACtE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;YACnC,SAAS;QACV,CAAC;QACD,IAAI,KAAK,IAAI,IAAI,EAAE,CAAC;YACnB,MAAM,MAAM,GAAG,MAAM,qBAAqB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACrD,IAAI,CAAC,MAAM,CAAC,EAAE;gBACb,OAAO;oBACN,EAAE,EAAE,KAAK;oBACT,KAAK,EAAE,wBAAwB,CAAC,YAAY,MAAM,CAAC,KAAK,EAAE;iBAC1D,CAAC;YACH,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,IAAI,EAAE;gBAC9B,OAAO;oBACN,EAAE,EAAE,KAAK;oBACT,KAAK,EAAE,wBAAwB,CAAC,kCAAkC;iBAClE,CAAC;YACH,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC;YAC5C,SAAS;QACV,CAAC;QACD,IAAI,WAAW,IAAI,IAAI,EAAE,CAAC;YACzB,MAAM,MAAM,GAAG,MAAM,oBAAoB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC1D,IAAI,CAAC,MAAM,CAAC,EAAE;gBACb,OAAO;oBACN,EAAE,EAAE,KAAK;oBACT,KAAK,EAAE,0BAA0B,CAAC,YAAY,MAAM,CAAC,KAAK,EAAE;iBAC5D,CAAC;YACH,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;YACrC,SAAS;QACV,CAAC;QACD,OAAO;YACN,EAAE,EAAE,KAAK;YACT,KAAK,EAAE,oBAAoB,CAAC,+DAA+D;SAC3F,CAAC;IACH,CAAC;IAED,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,YAAY,IAAI,IAAI,CAAC,EAAE,CAAC;QACrD,OAAO;YACN,EAAE,EAAE,IAAI;YACR,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAC/B,YAAY,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAClE;SACD,CAAC;IACH,CAAC;IAED,MAAM,aAAa,GAAG,QAAQ,CAAC,IAAI,CAClC,CAAC,IAAI,EAAE,EAAE,CACR,YAAY,IAAI,IAAI;QACpB,CAAC,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAC1D,CAAC;IACF,MAAM,eAAe,GAAG,yBAAyB,CAAC,SAAS,EAAE,aAAa,CAAC,CAAC;IAC5E,OAAO;QACN,EAAE,EAAE,IAAI;QACR,QAAQ,EAAE,QAA0C;QACpD,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,eAAe,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACvE,CAAC;AACH,CAAC"}
+{"version":3,"file":"graphInput.js","sourceRoot":"","sources":["../../src/utils/graphInput.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,qBAAqB,EAAE,MAAM,iBAAiB,CAAC;AACxD,OAAO,EACN,wBAAwB,EACxB,uBAAuB,EACvB,yBAAyB,GAGzB,MAAM,oBAAoB,CAAC;AAe5B,6EAA6E;AAC7E,8EAA8E;AAC9E,+EAA+E;AAC/E,gFAAgF;AAChF,wEAAwE;AACxE,MAAM,QAAQ,GAAG,6EAA6E,CAAC;AAE/F,MAAM,UAAU,mBAAmB,CAAC,KAAa;IAChD,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IAC7B,OAAO,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;AACvE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,uBAAuB,CACtC,UAAoB,EACpB,UAAuB,EACvB,UAAqB;IAErB,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,uCAAuC,CAAC;IAC5E,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,SAAS,EAAE,IAAI,EAAE,CAAC;QACrD,OAAO,gHAAgH,CAAC;IACzH,8EAA8E;IAC9E,gDAAgD;IAChD,IAAI,UAAU,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,IAAI,UAAU,CAAC,MAAM,KAAK,UAAU,CAAC,MAAM;QACjF,OAAO,6DAA6D,UAAU,CAAC,MAAM,mBAAmB,UAAU,CAAC,MAAM,kEAAkE,CAAC;IAC7L,IAAI,UAAU,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzC,IAAI,UAAU,CAAC,MAAM,KAAK,UAAU,CAAC,MAAM;YAC1C,OAAO,6DAA6D,UAAU,CAAC,MAAM,mBAAmB,UAAU,CAAC,MAAM,iEAAiE,CAAC;QAC5L,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAC1B,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,CACnE,CAAC;QACF,IAAI,GAAG;YACN,OAAO,cAAc,GAAG,+KAA+K,CAAC;IAC1M,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CACtC,MAAwB;IAExB,MAAM,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,aAAa,EAAE,GAAG,MAAM,CAAC;IACrE,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;IAC7C,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAEnC,IAAI,UAAU,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzC,IAAI,OAAO,IAAI,MAAM,EAAE,CAAC;YACvB,OAAO;gBACN,EAAE,EAAE,KAAK;gBACT,KAAK,EACJ,uFAAuF;aACxF,CAAC;QACH,CAAC;QACD,MAAM,OAAO,GAAG,uBAAuB,CAAC,UAAU,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;QAC5E,IAAI,OAAO;YAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;QAClD,OAAO;YACN,EAAE,EAAE,IAAI;YACR,OAAO,EAAE,wBAAwB,CAChC,UAAU,EACV,UAAU,EACV,aAAa,EACb,UAAU,CAC6B;SACxC,CAAC;IACH,CAAC;IAED,IAAI,WAAmB,CAAC;IACxB,IAAI,MAAM,EAAE,CAAC;QACZ,MAAM,MAAM,GAAG,MAAM,qBAAqB,CAAC,MAAM,CAAC,GAAa,CAAC,CAAC;QACjE,IAAI,CAAC,MAAM,CAAC,EAAE;YAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC;QAC1D,WAAW,GAAG,MAAM,CAAC,WAAW,CAAC;QACjC,IAAI,CAAC,WAAW,EAAE,IAAI,EAAE;YACvB,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,qCAAqC,EAAE,CAAC;IACrE,CAAC;SAAM,IAAI,OAAO,EAAE,CAAC;QACpB,WAAW,GAAG,MAAM,CAAC,IAAc,CAAC;IACrC,CAAC;SAAM,CAAC;QACP,OAAO;YACN,EAAE,EAAE,KAAK;YACT,KAAK,EAAE,uDAAuD;SAC9D,CAAC;IACH,CAAC;IAED,OAAO;QACN,EAAE,EAAE,IAAI;QACR,OAAO,EAAE;YACR,IAAI,EAAE,WAAW;YACjB,GAAG,uBAAuB,CAAC,WAAW,EAAE,aAAa,CAAC;SACtD;KACD,CAAC;AACH,CAAC;AAoBD;;;;;;;;;;;;;;GAcG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACpC,KAAoB,EACpB,oBAEuE;IAEvE,MAAM,QAAQ,GAAmB,EAAE,CAAC;IAEpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,YAAY,IAAI,IAAI,EAAE,CAAC;YAC1B,MAAM,OAAO,GAAG,uBAAuB,CACtC,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,UAAU,CACf,CAAC;YACF,IAAI,OAAO;gBACV,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,oBAAoB,CAAC,KAAK,OAAO,EAAE,EAAE,CAAC;YAClE,QAAQ,CAAC,IAAI,CAAC;gBACb,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,GAAG,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACnE,GAAG,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aACnE,CAAC,CAAC;YACH,SAAS;QACV,CAAC;QACD,IAAI,MAAM,IAAI,IAAI,EAAE,CAAC;YACpB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;gBACpB,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,oBAAoB,CAAC,kBAAkB,EAAE,CAAC;YACtE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;YACnC,SAAS;QACV,CAAC;QACD,IAAI,KAAK,IAAI,IAAI,EAAE,CAAC;YACnB,MAAM,MAAM,GAAG,MAAM,qBAAqB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACrD,IAAI,CAAC,MAAM,CAAC,EAAE;gBACb,OAAO;oBACN,EAAE,EAAE,KAAK;oBACT,KAAK,EAAE,wBAAwB,CAAC,YAAY,MAAM,CAAC,KAAK,EAAE;iBAC1D,CAAC;YACH,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,IAAI,EAAE;gBAC9B,OAAO;oBACN,EAAE,EAAE,KAAK;oBACT,KAAK,EAAE,wBAAwB,CAAC,kCAAkC;iBAClE,CAAC;YACH,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC;YAC5C,SAAS;QACV,CAAC;QACD,IAAI,WAAW,IAAI,IAAI,EAAE,CAAC;YACzB,MAAM,MAAM,GAAG,MAAM,oBAAoB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC1D,IAAI,CAAC,MAAM,CAAC,EAAE;gBACb,OAAO;oBACN,EAAE,EAAE,KAAK;oBACT,KAAK,EAAE,0BAA0B,CAAC,YAAY,MAAM,CAAC,KAAK,EAAE;iBAC5D,CAAC;YACH,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;YACrC,SAAS;QACV,CAAC;QACD,OAAO;YACN,EAAE,EAAE,KAAK;YACT,KAAK,EAAE,oBAAoB,CAAC,+DAA+D;SAC3F,CAAC;IACH,CAAC;IAED,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,YAAY,IAAI,IAAI,CAAC,EAAE,CAAC;QACrD,OAAO;YACN,EAAE,EAAE,IAAI;YACR,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAC/B,YAAY,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAClE;SACD,CAAC;IACH,CAAC;IAED,MAAM,aAAa,GAAG,QAAQ,CAAC,IAAI,CAClC,CAAC,IAAI,EAAE,EAAE,CACR,YAAY,IAAI,IAAI;QACpB,CAAC,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAC1D,CAAC;IACF,MAAM,eAAe,GAAG,yBAAyB,CAAC,SAAS,EAAE,aAAa,CAAC,CAAC;IAC5E,OAAO;QACN,EAAE,EAAE,IAAI;QACR,QAAQ,EAAE,QAA0C;QACpD,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,eAAe,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACvE,CAAC;AACH,CAAC"}

package/dist/utils/graphLookup.d.ts

@@ -0,0 +1,29 @@
+export interface ListedGraph {
+    id?: number;
+    contextName?: string;
+    createdAt?: string;
+    defaultRevisionUrl?: string | null;
+    textProcessingSettings?: {
+        categoriesAsMentions?: boolean;
+    };
+}
+/**
+ * The API runs on several instances, each with its own per-user contexts-list
+ * cache (6 min TTL) that is only invalidated on the instance that handled a
+ * write. Right after a graph is created, a read may therefore land on an
+ * instance that still says it does not exist. A positive answer is
+ * authoritative (a graph cannot be listed unless it exists), so reads retry a
+ * few times and accept the first positive; a negative is trusted only after
+ * every attempt agreed.
+ */
+export declare const READ_ATTEMPTS = 4;
+export declare function firstPositive<T>(attempt: (n: number) => Promise<T | null>, attempts?: number): Promise<T | null>;
+/** The API sometimes returns `error` as an object ({ statusCode, message[] }). */
+export declare function errorText(error: unknown): string;
+/**
+ * Exact-name lookup through /listGraphs in the caller's own account
+ * (read-only). Returns the listing entry, or null after every retry agreed
+ * that the graph is absent.
+ */
+export declare function findGraphByName(graphName: string): Promise<ListedGraph | null>;
+//# sourceMappingURL=graphLookup.d.ts.map

package/dist/utils/graphLookup.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graphLookup.d.ts","sourceRoot":"","sources":["../../src/utils/graphLookup.ts"],"names":[],"mappings":"AAOA,MAAM,WAAW,WAAW;IAC3B,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,kBAAkB,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACnC,sBAAsB,CAAC,EAAE;QAAE,oBAAoB,CAAC,EAAE,OAAO,CAAA;KAAE,CAAC;CAC5D;AAED;;;;;;;;GAQG;AACH,eAAO,MAAM,aAAa,IAAI,CAAC;AAE/B,wBAAsB,aAAa,CAAC,CAAC,EACpC,OAAO,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,EACzC,QAAQ,GAAE,MAAsB,GAC9B,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAMnB;AAED,kFAAkF;AAClF,wBAAgB,SAAS,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,CAShD;AAED;;;;GAIG;AACH,wBAAsB,eAAe,CACpC,SAAS,EAAE,MAAM,GACf,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC,CAa7B"}

package/dist/utils/graphLookup.js

@@ -0,0 +1,57 @@
+/**
+ * Read-only graph lookup shared by the tools that must know whether a graph
+ * exists in the caller's account before they act on it (project learnings,
+ * delete_statements). Never creates anything.
+ */
+import { makeInfraNodusRequest } from "../api/client.js";
+/**
+ * The API runs on several instances, each with its own per-user contexts-list
+ * cache (6 min TTL) that is only invalidated on the instance that handled a
+ * write. Right after a graph is created, a read may therefore land on an
+ * instance that still says it does not exist. A positive answer is
+ * authoritative (a graph cannot be listed unless it exists), so reads retry a
+ * few times and accept the first positive; a negative is trusted only after
+ * every attempt agreed.
+ */
+export const READ_ATTEMPTS = 4;
+export async function firstPositive(attempt, attempts = READ_ATTEMPTS) {
+    for (let n = 0; n < attempts; n++) {
+        const result = await attempt(n);
+        if (result !== null)
+            return result;
+    }
+    return null;
+}
+/** The API sometimes returns `error` as an object ({ statusCode, message[] }). */
+export function errorText(error) {
+    if (typeof error === "string")
+        return error;
+    if (error && typeof error === "object") {
+        const message = error.message;
+        if (Array.isArray(message))
+            return message.join("; ");
+        if (typeof message === "string")
+            return message;
+        return JSON.stringify(error);
+    }
+    return String(error);
+}
+/**
+ * Exact-name lookup through /listGraphs in the caller's own account
+ * (read-only). Returns the listing entry, or null after every retry agreed
+ * that the graph is absent.
+ */
+export async function findGraphByName(graphName) {
+    return firstPositive(async (n) => {
+        const response = (await makeInfraNodusRequest("/listGraphs", {
+            query: graphName,
+            // Varies the body so no intermediate layer can collapse the retries.
+            attempt: n,
+        }));
+        if (!Array.isArray(response))
+            return null;
+        const match = response.find((graph) => graph.contextName === graphName);
+        return match ?? null;
+    });
+}
+//# sourceMappingURL=graphLookup.js.map

package/dist/utils/graphLookup.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graphLookup.js","sourceRoot":"","sources":["../../src/utils/graphLookup.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,EAAE,qBAAqB,EAAE,MAAM,kBAAkB,CAAC;AAUzD;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,CAAC;AAE/B,MAAM,CAAC,KAAK,UAAU,aAAa,CAClC,OAAyC,EACzC,WAAmB,aAAa;IAEhC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,CAAC,CAAC,CAAC;QAChC,IAAI,MAAM,KAAK,IAAI;YAAE,OAAO,MAAM,CAAC;IACpC,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAED,kFAAkF;AAClF,MAAM,UAAU,SAAS,CAAC,KAAc;IACvC,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC5C,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QACxC,MAAM,OAAO,GAAI,KAA+B,CAAC,OAAO,CAAC;QACzD,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC;YAAE,OAAO,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtD,IAAI,OAAO,OAAO,KAAK,QAAQ;YAAE,OAAO,OAAO,CAAC;QAChD,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;IACD,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC;AACtB,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACpC,SAAiB;IAEjB,OAAO,aAAa,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE;QAChC,MAAM,QAAQ,GAAG,CAAC,MAAM,qBAAqB,CAAC,aAAa,EAAE;YAC5D,KAAK,EAAE,SAAS;YAChB,qEAAqE;YACrE,OAAO,EAAE,CAAC;SACV,CAAC,CAAY,CAAC;QACf,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC;YAAE,OAAO,IAAI,CAAC;QAC1C,MAAM,KAAK,GAAI,QAA0B,CAAC,IAAI,CAC7C,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,WAAW,KAAK,SAAS,CAC1C,CAAC;QACF,OAAO,KAAK,IAAI,IAAI,CAAC;IACtB,CAAC,CAAC,CAAC;AACJ,CAAC"}

package/dist/utils/knowledgeBase.d.ts

@@ -0,0 +1,21 @@
+/**
+ * Pure helpers for `optimize_knowledge_base`: turn the graph engine's
+ * diversity diagnosis into a reading that makes sense for a code base, a
+ * document vault, or a body of procedural knowledge (rules, frameworks,
+ * principles). The engine's numbers are the same for any text; what differs
+ * is what a "gap" or a "dominant cluster" means for the thing being studied.
+ */
+export declare const FOCUSES: readonly ["general", "codebase", "vault", "procedural"];
+export type Focus = (typeof FOCUSES)[number];
+export declare const STATES: readonly ["biased", "focused", "diversified", "dispersed"];
+export type DiversityState = (typeof STATES)[number];
+interface Reading {
+    meaning: string;
+    action: string;
+}
+export declare function normalizeState(raw: unknown): DiversityState | undefined;
+export declare function readState(focus: Focus, state: DiversityState): Reading;
+/** Bounded, de-duplicated list helper for report fields. */
+export declare function dedupeList(items: Array<string | undefined>, limit: number): string[];
+export {};
+//# sourceMappingURL=knowledgeBase.d.ts.map

package/dist/utils/knowledgeBase.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"knowledgeBase.d.ts","sourceRoot":"","sources":["../../src/utils/knowledgeBase.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,eAAO,MAAM,OAAO,yDAA0D,CAAC;AAC/E,MAAM,MAAM,KAAK,GAAG,CAAC,OAAO,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC;AAE7C,eAAO,MAAM,MAAM,4DAA6D,CAAC;AACjF,MAAM,MAAM,cAAc,GAAG,CAAC,OAAO,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC;AAErD,UAAU,OAAO;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;CACf;AA6ED,wBAAgB,cAAc,CAAC,GAAG,EAAE,OAAO,GAAG,cAAc,GAAG,SAAS,CAIvE;AAED,wBAAgB,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,cAAc,GAAG,OAAO,CAEtE;AAED,4DAA4D;AAC5D,wBAAgB,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CAYpF"}

package/dist/utils/knowledgeBase.js

@@ -0,0 +1,110 @@
+/**
+ * Pure helpers for `optimize_knowledge_base`: turn the graph engine's
+ * diversity diagnosis into a reading that makes sense for a code base, a
+ * document vault, or a body of procedural knowledge (rules, frameworks,
+ * principles). The engine's numbers are the same for any text; what differs
+ * is what a "gap" or a "dominant cluster" means for the thing being studied.
+ */
+export const FOCUSES = ["general", "codebase", "vault", "procedural"];
+export const STATES = ["biased", "focused", "diversified", "dispersed"];
+const READINGS = {
+    general: {
+        biased: {
+            meaning: "One cluster of ideas dominates; the rest orbit it.",
+            action: "Develop the under-represented clusters before adding more to the dominant one.",
+        },
+        focused: {
+            meaning: "Coherent and centred, but narrow.",
+            action: "Develop the content gaps: the topics listed as under-developed are the cheapest way to widen it.",
+        },
+        diversified: {
+            meaning: "Several strong clusters that barely connect.",
+            action: "Bridge the gaps between clusters — the missing links are where the most original ideas sit.",
+        },
+        dispersed: {
+            meaning: "Many small clusters with no shared backbone.",
+            action: "Consolidate: pick the most common gap topics and connect the fragments through them.",
+        },
+    },
+    codebase: {
+        biased: {
+            meaning: "One module or feature area dominates the project: everything depends on it or describes it (a god module, or a product that is really one feature with satellites).",
+            action: "Decide whether the dominance is intended. If not, develop the thin areas and cut dependencies on the dominant one; the under-developed list shows which parts of the code base nobody has built out.",
+        },
+        focused: {
+            meaning: "The code base is coherent and centred on a clear purpose, but narrow: little exists beyond the main path.",
+            action: "The gaps are the features and integrations that are implied but not built; the under-developed topics are the ones to build next.",
+        },
+        diversified: {
+            meaning: "Several substantial subsystems that hardly talk to each other.",
+            action: "The gaps between clusters are missing integrations or glue code — the most actionable state for a product: each gap is a feature that connects two things users already have.",
+        },
+        dispersed: {
+            meaning: "Fragmented: many small parts sharing no entities — features that do not compose, or several projects in one repo.",
+            action: "Consolidate around the most common gap topics; consider extracting or removing fragments that connect to nothing.",
+        },
+    },
+    vault: {
+        biased: {
+            meaning: "The vault keeps returning to one theme; other notes are satellites of it.",
+            action: "Grow the satellite themes into their own clusters, or accept the vault as single-topic and prune what does not serve it.",
+        },
+        focused: {
+            meaning: "A coherent vault around one line of thought, not yet exploring its edges.",
+            action: "Write into the gaps: the under-developed topics are notes the vault is already pointing at but has not written.",
+        },
+        diversified: {
+            meaning: "Several well-developed themes with few notes linking them.",
+            action: "The gaps are the bridge notes waiting to be written — the places where two of your themes would produce a new idea if connected.",
+        },
+        dispersed: {
+            meaning: "Many unconnected notes; no theme is developed enough to organise the others.",
+            action: "Pick the most common gap topics as hub notes and link the fragments through them (maps of content).",
+        },
+    },
+    procedural: {
+        biased: {
+            meaning: "One framework or rule set dominates the procedural knowledge; the others are footnotes to it.",
+            action: "Check whether the dominant framework really covers the other situations; develop the thin rule sets or make the dominance explicit.",
+        },
+        focused: {
+            meaning: "A coherent set of rules and frameworks around one way of working, with little guidance beyond it.",
+            action: "The gaps are situations the rules do not address; the under-developed topics are frameworks mentioned but not spelled out.",
+        },
+        diversified: {
+            meaning: "Several independent frameworks or rule sets that never reference each other.",
+            action: "The gaps are where two frameworks should hand off to each other — write the rules for those transitions, or you have contradictions waiting to happen.",
+        },
+        dispersed: {
+            meaning: "Fragmented procedural knowledge: many rules, no organising principles.",
+            action: "Consolidate the rules under the most common gap topics as principles; rules that connect to no principle are candidates for removal.",
+        },
+    },
+};
+export function normalizeState(raw) {
+    if (typeof raw !== "string")
+        return undefined;
+    const value = raw.toLowerCase();
+    return STATES.find((state) => value.includes(state));
+}
+export function readState(focus, state) {
+    return READINGS[focus][state];
+}
+/** Bounded, de-duplicated list helper for report fields. */
+export function dedupeList(items, limit) {
+    const seen = new Set();
+    const out = [];
+    for (const item of items) {
+        if (!item)
+            continue;
+        const key = item.trim();
+        if (!key || seen.has(key.toLowerCase()))
+            continue;
+        seen.add(key.toLowerCase());
+        out.push(key);
+        if (out.length >= limit)
+            break;
+    }
+    return out;
+}
+//# sourceMappingURL=knowledgeBase.js.map

package/dist/utils/knowledgeBase.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"knowledgeBase.js","sourceRoot":"","sources":["../../src/utils/knowledgeBase.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,SAAS,EAAE,UAAU,EAAE,OAAO,EAAE,YAAY,CAAU,CAAC;AAG/E,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,QAAQ,EAAE,SAAS,EAAE,aAAa,EAAE,WAAW,CAAU,CAAC;AAQjF,MAAM,QAAQ,GAAmD;IAChE,OAAO,EAAE;QACR,MAAM,EAAE;YACP,OAAO,EAAE,oDAAoD;YAC7D,MAAM,EAAE,gFAAgF;SACxF;QACD,OAAO,EAAE;YACR,OAAO,EAAE,mCAAmC;YAC5C,MAAM,EAAE,kGAAkG;SAC1G;QACD,WAAW,EAAE;YACZ,OAAO,EAAE,8CAA8C;YACvD,MAAM,EAAE,6FAA6F;SACrG;QACD,SAAS,EAAE;YACV,OAAO,EAAE,8CAA8C;YACvD,MAAM,EAAE,sFAAsF;SAC9F;KACD;IACD,QAAQ,EAAE;QACT,MAAM,EAAE;YACP,OAAO,EAAE,qKAAqK;YAC9K,MAAM,EAAE,sMAAsM;SAC9M;QACD,OAAO,EAAE;YACR,OAAO,EAAE,2GAA2G;YACpH,MAAM,EAAE,mIAAmI;SAC3I;QACD,WAAW,EAAE;YACZ,OAAO,EAAE,gEAAgE;YACzE,MAAM,EAAE,+KAA+K;SACvL;QACD,SAAS,EAAE;YACV,OAAO,EAAE,mHAAmH;YAC5H,MAAM,EAAE,mHAAmH;SAC3H;KACD;IACD,KAAK,EAAE;QACN,MAAM,EAAE;YACP,OAAO,EAAE,2EAA2E;YACpF,MAAM,EAAE,0HAA0H;SAClI;QACD,OAAO,EAAE;YACR,OAAO,EAAE,2EAA2E;YACpF,MAAM,EAAE,iHAAiH;SACzH;QACD,WAAW,EAAE;YACZ,OAAO,EAAE,4DAA4D;YACrE,MAAM,EAAE,kIAAkI;SAC1I;QACD,SAAS,EAAE;YACV,OAAO,EAAE,8EAA8E;YACvF,MAAM,EAAE,qGAAqG;SAC7G;KACD;IACD,UAAU,EAAE;QACX,MAAM,EAAE;YACP,OAAO,EAAE,+FAA+F;YACxG,MAAM,EAAE,qIAAqI;SAC7I;QACD,OAAO,EAAE;YACR,OAAO,EAAE,mGAAmG;YAC5G,MAAM,EAAE,4HAA4H;SACpI;QACD,WAAW,EAAE;YACZ,OAAO,EAAE,8EAA8E;YACvF,MAAM,EAAE,wJAAwJ;SAChK;QACD,SAAS,EAAE;YACV,OAAO,EAAE,wEAAwE;YACjF,MAAM,EAAE,sIAAsI;SAC9I;KACD;CACD,CAAC;AAEF,MAAM,UAAU,cAAc,CAAC,GAAY;IAC1C,IAAI,OAAO,GAAG,KAAK,QAAQ;QAAE,OAAO,SAAS,CAAC;IAC9C,MAAM,KAAK,GAAG,GAAG,CAAC,WAAW,EAAE,CAAC;IAChC,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;AACtD,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,KAAY,EAAE,KAAqB;IAC5D,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC;AAC/B,CAAC;AAED,4DAA4D;AAC5D,MAAM,UAAU,UAAU,CAAC,KAAgC,EAAE,KAAa;IACzE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QACxB,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC;YAAE,SAAS;QAClD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC;QAC5B,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACd,IAAI,GAAG,CAAC,MAAM,IAAI,KAAK;YAAE,MAAM;IAChC,CAAC;IACD,OAAO,GAAG,CAAC;AACZ,CAAC"}

package/dist/utils/learnings.d.ts

@@ -0,0 +1,119 @@
+import type { GraphResponse, Statement } from "../types/index.js";
+import { READ_ATTEMPTS, errorText } from "./graphLookup.js";
+export declare const GRAPH_PREFIX = "learn-";
+export declare const MAX_GRAPH_NAME_LENGTH = 28;
+export declare const MARKER_CATEGORY = "learnings-enabled";
+export declare const LEARNING_TYPES: readonly ["location", "trap", "convention", "decision", "workflow", "question", "approach"];
+export type LearningType = (typeof LEARNING_TYPES)[number];
+export declare const TYPE_CATEGORY_PREFIX = "type-";
+export declare const SOURCE_CATEGORY_PREFIX = "source-";
+/** Near-duplicate threshold on word-set Jaccard similarity. */
+export declare const DEDUPE_THRESHOLD = 0.6;
+export declare const MAX_STATEMENT_LENGTH = 400;
+export declare function slugify(input: string): string;
+export declare function learningsGraphName(project: string): string;
+/**
+ * Not attached to statements any more: a per-client label links every
+ * statement of that client and became the most central node of the graph in
+ * testing. Kept so `toStoredLearning` can still read graphs written before
+ * that change.
+ */
+export declare function sourceCategory(clientName?: string): string;
+export declare function typeCategory(type: LearningType): string;
+export interface RedactionIssue {
+    index: number;
+    reason: "secret-like" | "too-long" | "empty";
+}
+/** Returns the indices (never the content) of statements that must not be stored. */
+export declare function redactionIssues(statements: string[]): RedactionIssue[];
+export declare function tokenize(statement: string): Set<string>;
+export declare function jaccard(a: Set<string>, b: Set<string>): number;
+export interface DedupeResult {
+    statement: string;
+    status: "new" | "reinforced";
+    /** The existing statement this one reinforces (when status is "reinforced"). */
+    matches?: string;
+    similarity?: number;
+}
+/**
+ * Compare candidates against what the graph already holds. A near-duplicate
+ * is not dropped — it is rewritten as a short "Confirmed again" statement so
+ * the repeat still raises the weight of the same entity links (that is how
+ * frequently re-learned things become central) without duplicating the text.
+ */
+export declare function dedupeAgainstExisting(candidates: string[], existing: string[], threshold?: number): DedupeResult[];
+export interface LearningsGraphInfo {
+    exists: boolean;
+    /**
+     * True for graphs created before 2026-08-28 with `categoriesAsMentions`
+     * on (labels are nodes there). Informational only; consent is the marker
+     * statement.
+     */
+    categoriesOn: boolean;
+    id?: number;
+    url?: string;
+    createdAt?: string;
+}
+export { READ_ATTEMPTS, errorText };
+/** Exact-name lookup through /listGraphs (read-only; never creates anything). */
+export declare function findLearningsGraph(graphName: string): Promise<LearningsGraphInfo>;
+export interface StoredLearning {
+    content: string;
+    types: string[];
+    source?: string;
+    categories: string[];
+    createdAt?: string;
+}
+export declare function toStoredLearning(statement: Statement): StoredLearning | null;
+export declare function isMarkerStatement(statement: Statement): boolean;
+/**
+ * Read every statement of the graph (doNotSave; the graph must already exist —
+ * a missing name errors and is never created). "Select an existing graph
+ * context" on a graph that does exist means the request hit an instance
+ * with a stale contexts list (see firstPositive), not a parameter problem.
+ */
+export declare function fetchLearningsGraph(graphName: string): Promise<{
+    statements: Statement[];
+    response: GraphResponse;
+}>;
+/**
+ * Resolve whether learnings are enabled for a graph name: the graph exists
+ * and holds the marker statement written by `createLearningsGraph`. The
+ * listing supplies url/createdAt; reading by name is authoritative for
+ * existence (a missing graph errors and is never created) and is also what
+ * catches a graph the listing does not show yet (see firstPositive).
+ */
+export declare function checkEnabled(graphName: string): Promise<{
+    enabled: boolean;
+    info: LearningsGraphInfo;
+    reason?: "missing" | "not-a-learnings-graph";
+}>;
+export interface AppendResult {
+    graphName?: string;
+    graphUrl?: string;
+    response: GraphResponse;
+}
+/**
+ * Append statements (with parallel categories/timestamps) to an existing
+ * graph. Sent as a plain statements payload — NOT via prepareStatementsPayload,
+ * which would switch `categoriesAsMentions` on and turn the labels into nodes.
+ */
+export declare function appendLearnings(params: {
+    graphName: string;
+    statements: string[];
+    categories: string[][];
+    timestamps: string[];
+}): Promise<AppendResult>;
+/**
+ * Create the learnings graph. The marker statement (and its
+ * `learnings-enabled` category) is what `checkEnabled` looks for.
+ */
+export declare function createLearningsGraph(params: {
+    graphName: string;
+    slug: string;
+    clientName?: string;
+}): Promise<AppendResult>;
+export declare function newestFirst<T extends {
+    createdAt?: string;
+}>(items: T[]): T[];
+//# sourceMappingURL=learnings.d.ts.map

package/dist/utils/learnings.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"learnings.d.ts","sourceRoot":"","sources":["../../src/utils/learnings.ts"],"names":[],"mappings":"AAgBA,OAAO,KAAK,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAClE,OAAO,EACN,aAAa,EACb,SAAS,EAGT,MAAM,kBAAkB,CAAC;AAE1B,eAAO,MAAM,YAAY,WAAW,CAAC;AACrC,eAAO,MAAM,qBAAqB,KAAK,CAAC;AACxC,eAAO,MAAM,eAAe,sBAAsB,CAAC;AAEnD,eAAO,MAAM,cAAc,6FAQjB,CAAC;AACX,MAAM,MAAM,YAAY,GAAG,CAAC,OAAO,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC;AAE3D,eAAO,MAAM,oBAAoB,UAAU,CAAC;AAC5C,eAAO,MAAM,sBAAsB,YAAY,CAAC;AAEhD,+DAA+D;AAC/D,eAAO,MAAM,gBAAgB,MAAM,CAAC;AACpC,eAAO,MAAM,oBAAoB,MAAM,CAAC;AAExC,wBAAgB,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAM7C;AAED,wBAAgB,kBAAkB,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAI1D;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,UAAU,CAAC,EAAE,MAAM,GAAG,MAAM,CAE1D;AAED,wBAAgB,YAAY,CAAC,IAAI,EAAE,YAAY,GAAG,MAAM,CAEvD;AAiBD,MAAM,WAAW,cAAc;IAC9B,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,aAAa,GAAG,UAAU,GAAG,OAAO,CAAC;CAC7C;AAED,qFAAqF;AACrF,wBAAgB,eAAe,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,cAAc,EAAE,CAgBtE;AAaD,wBAAgB,QAAQ,CAAC,SAAS,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAQvD;AAED,wBAAgB,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,MAAM,CAM9D;AAED,MAAM,WAAW,YAAY;IAC5B,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,KAAK,GAAG,YAAY,CAAC;IAC7B,gFAAgF;IAChF,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,UAAU,CAAC,EAAE,MAAM,CAAC;CACpB;AAED;;;;;GAKG;AACH,wBAAgB,qBAAqB,CACpC,UAAU,EAAE,MAAM,EAAE,EACpB,QAAQ,EAAE,MAAM,EAAE,EAClB,SAAS,GAAE,MAAyB,GAClC,YAAY,EAAE,CAsChB;AAUD,MAAM,WAAW,kBAAkB;IAClC,MAAM,EAAE,OAAO,CAAC;IAChB;;;;OAIG;IACH,YAAY,EAAE,OAAO,CAAC;IACtB,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,SAAS,CAAC,EAAE,MAAM,CAAC;CACnB;AAKD,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,CAAC;AAEpC,iFAAiF;AACjF,wBAAsB,kBAAkB,CACvC,SAAS,EAAE,MAAM,GACf,OAAO,CAAC,kBAAkB,CAAC,CAU7B;AAED,MAAM,WAAW,cAAc;IAC9B,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,SAAS,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,wBAAgB,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,cAAc,GAAG,IAAI,CAc5E;AAED,wBAAgB,iBAAiB,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO,CAK/D;AAED;;;;;GAKG;AACH,wBAAsB,mBAAmB,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC;IACrE,UAAU,EAAE,SAAS,EAAE,CAAC;IACxB,QAAQ,EAAE,aAAa,CAAC;CACxB,CAAC,CA+BD;AAED;;;;;;GAMG;AACH,wBAAsB,YAAY,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC;IAC9D,OAAO,EAAE,OAAO,CAAC;IACjB,IAAI,EAAE,kBAAkB,CAAC;IACzB,MAAM,CAAC,EAAE,SAAS,GAAG,uBAAuB,CAAC;CAC7C,CAAC,CAiBD;AAED,MAAM,WAAW,YAAY;IAC5B,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,aAAa,CAAC;CACxB;AAED;;;;GAIG;AACH,wBAAsB,eAAe,CAAC,MAAM,EAAE;IAC7C,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,UAAU,EAAE,MAAM,EAAE,EAAE,CAAC;IACvB,UAAU,EAAE,MAAM,EAAE,CAAC;CACrB,GAAG,OAAO,CAAC,YAAY,CAAC,CA8CxB;AAED;;;GAGG;AACH,wBAAsB,oBAAoB,CAAC,MAAM,EAAE;IAClD,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,CAAC,EAAE,MAAM,CAAC;CACpB,GAAG,OAAO,CAAC,YAAY,CAAC,CAWxB;AAED,wBAAgB,WAAW,CAAC,CAAC,SAAS;IAAE,SAAS,CAAC,EAAE,MAAM,CAAA;CAAE,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAM7E"}