@rubytech/create-maxy-code 0.1.592 → 0.1.594

package/payload/platform/plugins/memory/mcp/dist/tools/__tests__/memory-write-emit.test.js

@@ -1,81 +0,0 @@
-// Task 168 — per-tool emit assertion for memory-write.
-import { describe, it, expect, beforeEach, afterEach, vi } from "vitest";
-import { setupEmitCapture, makeMockSession } from "./_helpers/emit-capture.js";
-const mockSession = makeMockSession();
-vi.mock("../../lib/neo4j.js", () => ({
-    getSession: () => mockSession,
-}));
-vi.mock("../../lib/embeddings.js", () => ({
-    embed: vi.fn().mockResolvedValue([0.1, 0.2, 0.3]),
-}));
-vi.mock("../../lib/schema-validator.js", () => ({
-    validateWrite: vi.fn(),
-}));
-vi.mock("../../lib/graph-write-gate.js", () => ({
-    checkGraphWriteGate: vi.fn().mockResolvedValue({ ok: true }),
-    checkPropertyWriteGate: vi.fn().mockReturnValue({ ok: true }),
-    checkLabelWriteGate: vi.fn().mockReturnValue({ ok: true }),
-    COMPILED_TRUTH_MAX_CHARS: 2000,
-}));
-vi.mock("../../../../../../lib/graph-write/dist/index.js", () => ({
-    writeNodeWithEdges: vi.fn(),
-    injectConversationProvenance: vi
-        .fn()
-        .mockImplementation(async ({ relationships }) => relationships),
-}));
-import { memoryWrite } from "../memory-write.js";
-import { writeNodeWithEdges } from "../../../../../../lib/graph-write/dist/index.js";
-describe("memory-write — emit wrapper wired", () => {
-    let emit;
-    beforeEach(() => {
-        emit = setupEmitCapture();
-        // Use mockClear (not mockReset) so the helper's default
-        // implementation — empty `records` array — is preserved. memory-write
-        // now runs resolveActiveVertical via this session before validating;
-        // a wiped implementation would return undefined and crash that read.
-        mockSession.run.mockClear();
-        vi.mocked(writeNodeWithEdges).mockReset();
-    });
-    afterEach(() => emit.restore());
-    it("emits result=ok line on happy path", async () => {
-        vi.mocked(writeNodeWithEdges).mockResolvedValue({
-            nodeId: "4:abc:1",
-            labels: ["LocalBusiness"],
-            created: true,
-        });
-        await memoryWrite({
-            labels: ["LocalBusiness"],
-            properties: { name: "Smalleys" },
-            accountId: "acct-1",
-            scope: "shared",
-            relationships: [{ type: "BELONGS_TO", direction: "outgoing", targetNodeId: "4:owner:1" }],
-            createdBy: { agent: "system", session: "s1" },
-            validator: { schema: { brandVertical: null } },
-        });
-        expect(emit.fetchSpy).toHaveBeenCalledTimes(1);
-        const body = emit.captures()[0];
-        expect(body.tag).toBe("mcp:memory");
-        expect(body.level).toBe("info");
-        expect(body.line).toContain("memory-write");
-        expect(body.line).toContain("result=ok");
-        expect(body.line).toContain("elementId=4:abc:1");
-    });
-    it("emits result=error reason=invalid-input on missing scope", async () => {
-        await expect(memoryWrite({
-            labels: ["LocalBusiness"],
-            properties: { name: "Smalleys" },
-            accountId: "acct-1",
-            scope: "",
-            relationships: [],
-            createdBy: {},
-            validator: { schema: { brandVertical: null } },
-        })).rejects.toThrow(/scope is required/);
-        expect(emit.fetchSpy).toHaveBeenCalledTimes(1);
-        const body = emit.captures()[0];
-        expect(body.level).toBe("error");
-        expect(body.line).toContain("memory-write");
-        expect(body.line).toContain("result=error");
-        expect(body.line).toContain("reason=invalid-input");
-    });
-});
-//# sourceMappingURL=memory-write-emit.test.js.map

package/payload/platform/plugins/memory/mcp/dist/tools/__tests__/memory-write-emit.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"memory-write-emit.test.js","sourceRoot":"","sources":["../../../src/tools/__tests__/memory-write-emit.test.ts"],"names":[],"mappings":"AAAA,uDAAuD;AAEvD,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAC;AACzE,OAAO,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAE/E,MAAM,WAAW,GAAG,eAAe,EAAE,CAAC;AAEtC,EAAE,CAAC,IAAI,CAAC,oBAAoB,EAAE,GAAG,EAAE,CAAC,CAAC;IACnC,UAAU,EAAE,GAAG,EAAE,CAAC,WAAW;CAC9B,CAAC,CAAC,CAAC;AAEJ,EAAE,CAAC,IAAI,CAAC,yBAAyB,EAAE,GAAG,EAAE,CAAC,CAAC;IACxC,KAAK,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;CAClD,CAAC,CAAC,CAAC;AAEJ,EAAE,CAAC,IAAI,CAAC,+BAA+B,EAAE,GAAG,EAAE,CAAC,CAAC;IAC9C,aAAa,EAAE,EAAE,CAAC,EAAE,EAAE;CACvB,CAAC,CAAC,CAAC;AAEJ,EAAE,CAAC,IAAI,CAAC,+BAA+B,EAAE,GAAG,EAAE,CAAC,CAAC;IAC9C,mBAAmB,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC;IAC5D,sBAAsB,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC;IAC7D,mBAAmB,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC;IAC1D,wBAAwB,EAAE,IAAI;CAC/B,CAAC,CAAC,CAAC;AAEJ,EAAE,CAAC,IAAI,CAAC,iDAAiD,EAAE,GAAG,EAAE,CAAC,CAAC;IAChE,kBAAkB,EAAE,EAAE,CAAC,EAAE,EAAE;IAC3B,4BAA4B,EAAE,EAAE;SAC7B,EAAE,EAAE;SACJ,kBAAkB,CAAC,KAAK,EAAE,EAAE,aAAa,EAAgC,EAAE,EAAE,CAAC,aAAa,CAAC;CAChG,CAAC,CAAC,CAAC;AAEJ,OAAO,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACjD,OAAO,EAAE,kBAAkB,EAAE,MAAM,iDAAiD,CAAC;AAErF,QAAQ,CAAC,mCAAmC,EAAE,GAAG,EAAE;IACjD,IAAI,IAAyC,CAAC;IAC9C,UAAU,CAAC,GAAG,EAAE;QACd,IAAI,GAAG,gBAAgB,EAAE,CAAC;QAC1B,wDAAwD;QACxD,sEAAsE;QACtE,qEAAqE;QACrE,qEAAqE;QACrE,WAAW,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC;QAC5B,EAAE,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC,SAAS,EAAE,CAAC;IAC5C,CAAC,CAAC,CAAC;IACH,SAAS,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;IAEhC,EAAE,CAAC,oCAAoC,EAAE,KAAK,IAAI,EAAE;QAClD,EAAE,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC,iBAAiB,CAAC;YAC9C,MAAM,EAAE,SAAS;YACjB,MAAM,EAAE,CAAC,eAAe,CAAC;YACzB,OAAO,EAAE,IAAI;SACL,CAAC,CAAC;QACZ,MAAM,WAAW,CAAC;YAChB,MAAM,EAAE,CAAC,eAAe,CAAC;YACzB,UAAU,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE;YAChC,SAAS,EAAE,QAAQ;YACnB,KAAK,EAAE,QAAQ;YACf,aAAa,EAAE,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS,EAAE,UAAU,EAAE,YAAY,EAAE,WAAW,EAAE,CAAU;YAClG,SAAS,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAI,EAAW;YACtD,SAAS,EAAE,EAAE,MAAM,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,EAAW;SACxD,CAAC,CAAC;QACH,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAE,CAAC;QACjC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACpC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;QAC5C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;QACzC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,mBAAmB,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0DAA0D,EAAE,KAAK,IAAI,EAAE;QACxE,MAAM,MAAM,CACV,WAAW,CAAC;YACV,MAAM,EAAE,CAAC,eAAe,CAAC;YACzB,UAAU,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE;YAChC,SAAS,EAAE,QAAQ;YACnB,KAAK,EAAE,EAAE;YACT,aAAa,EAAE,EAAW;YAC1B,SAAS,EAAE,EAAW;YACtB,SAAS,EAAE,EAAE,MAAM,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,EAAW;SACxD,CAAC,CACH,CAAC,OAAO,CAAC,OAAO,CAAC,mBAAmB,CAAC,CAAC;QACvC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAE,CAAC;QACjC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACjC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;QAC5C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;QAC5C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,sBAAsB,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/payload/platform/plugins/memory/mcp/dist/tools/memory-classify.d.ts

@@ -1,34 +0,0 @@
-/**
- * memory-classify MCP tool — classifies an unstructured document into typed
- * sections via Claude Haiku, ready for memory-ingest to write as typed
- * graph nodes.
- *
- * Pairs with memory-ingest-extract (which produces the text) and memory-ingest
- * (which consumes the typed structure). The classifier output is a deterministic
- * JSON shape — every `kind` is verified against the live ontology label set
- * before reaching this tool's caller, so a hallucinated label can never reach
- * the graph writer.
- */
-import { type ClassifyResult } from "../lib/llm-classifier.js";
-import type { LiveSchemaSource } from "../lib/live-schema-source.js";
-export interface MemoryClassifyParams {
-    accountId: string;
-    /**
-     * The attachmentId from memory-ingest-extract — its cache holds the
-     * extracted text. The classifier never re-reads the file from disk.
-     */
-    attachmentId: string;
-    /**
-     * Anchor description — a short human sentence the classifier reads to
-     * decide which ontology edges fit. Examples:
-     *   "subject = UserProfile (the account owner)"
-     *   "subject = LocalBusiness (the operator's business)"
-     *   "subject = Person {name: 'Jane Smith'} (a third party)"
-     */
-    anchorDescription: string;
-    /** Live ∪ declared label source — used to verify every classifier `kind`. */
-    liveSchemaSource: LiveSchemaSource;
-}
-export type MemoryClassifyResult = ClassifyResult;
-export declare function memoryClassify(params: MemoryClassifyParams): Promise<MemoryClassifyResult>;
-//# sourceMappingURL=memory-classify.d.ts.map

package/payload/platform/plugins/memory/mcp/dist/tools/memory-classify.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"memory-classify.d.ts","sourceRoot":"","sources":["../../src/tools/memory-classify.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAGH,OAAO,EAAoB,KAAK,cAAc,EAAE,MAAM,0BAA0B,CAAC;AACjF,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAGrE,MAAM,WAAW,oBAAoB;IACnC,SAAS,EAAE,MAAM,CAAC;IAClB;;;OAGG;IACH,YAAY,EAAE,MAAM,CAAC;IACrB;;;;;;OAMG;IACH,iBAAiB,EAAE,MAAM,CAAC;IAC1B,6EAA6E;IAC7E,gBAAgB,EAAE,gBAAgB,CAAC;CACpC;AAED,MAAM,MAAM,oBAAoB,GAAG,cAAc,CAAC;AA4BlD,wBAAsB,cAAc,CAClC,MAAM,EAAE,oBAAoB,GAC3B,OAAO,CAAC,oBAAoB,CAAC,CAK/B"}

package/payload/platform/plugins/memory/mcp/dist/tools/memory-classify.js

@@ -1,62 +0,0 @@
-/**
- * memory-classify MCP tool — classifies an unstructured document into typed
- * sections via Claude Haiku, ready for memory-ingest to write as typed
- * graph nodes.
- *
- * Pairs with memory-ingest-extract (which produces the text) and memory-ingest
- * (which consumes the typed structure). The classifier output is a deterministic
- * JSON shape — every `kind` is verified against the live ontology label set
- * before reaching this tool's caller, so a hallucinated label can never reach
- * the graph writer.
- */
-import { extractCache } from "./memory-ingest-extract.js";
-import { classifyDocument } from "../lib/llm-classifier.js";
-import { withWriteEvent } from "../lib/log-ingest.js";
-/**
- * Natural-edge map pasted into the classifier prompt. Mirrors
- * schema-base.md "Section kinds" table. Every section becomes a `:Section`
- * node with the listed secondary label (e.g. `:Section:Position`).
- *
- * For identity kinds: anchorEdge points from the document subject to the
- * multi-labeled section node. For structural and contract-clause kinds:
- * anchorEdge is null — the section is anchored only via HAS_SECTION + NEXT.
- * Special-case extras for Parties + Definitions are emitted via documentEdges
- * and section-level related entries.
- */
-const NATURAL_EDGE_MAP = `Section kind                     | Anchor edge (direction = from-anchor unless noted)
-Position (identity)              | (anchor:UserProfile)-[:HAS_POSITION]->(:Section:Position); section -[:AT]-> related:Organization (merge:true)
-Education (identity)             | (anchor:UserProfile)-[:ATTENDED {degree, startDate, endDate}]->(:Section:Education); section -[:ATTENDED]-> related:Organization {organizationCategory:'educational'} (merge:true)
-Credential (identity)            | (anchor:UserProfile)-[:HOLDS]->(:Section:Credential)
-Skill (identity)                 | (anchor:UserProfile)-[:HAS_SKILL]->(:Section:Skill)
-Biography (identity)             | (anchor:UserProfile)-[:DESCRIBED_BY]->(:Section:Biography)
-Project (standalone, not :Section) | (anchor:UserProfile)-[:CREATED]->(:Project); optional (:Project)-[:UNDER]->related:Organization (merge:true)
-Preface, Abstract, Introduction, TableOfContents, Chapter, Conclusion, Appendix, Bibliography, Glossary, Acknowledgments (structural)
-                                 | anchorEdge: null — anchored only via (:KnowledgeDocument)-[:HAS_SECTION]->(:Section:<Kind>) + (:Section)-[:NEXT]->(:Section)
-Parties, Recitals, Definitions, Scope, Term, Payment, Confidentiality, IntellectualProperty, Warranties, Indemnification, Liability, Termination, GoverningLaw, ForceMajeure, Notices, EntireAgreement, Amendment, Assignment, Severability, Signatures (contract-clause)
-                                 | anchorEdge: null — anchored via HAS_SECTION + NEXT; for Parties section, additionally emit top-level documentEdges PARTY entries; for Definitions, emit related DefinedTerm nodes with edge type DEFINES (direction outgoing from the Definitions section).
-Other (label fallback)           | anchorEdge: null — section-kind closure miss; you MUST also include 'classifierReason' (one-line about-what)
-
-Set "anchorEdge" to null for any kind whose row says "anchorEdge: null". For others, emit { "type": "<edge>", "direction": "from-anchor", "properties": { ... edge properties if any } }.`;
-export async function memoryClassify(params) {
-    return withWriteEvent({ tool: "memory-classify", accountId: params.accountId, name: params.attachmentId }, () => memoryClassifyImpl(params));
-}
-async function memoryClassifyImpl(params) {
-    const { accountId, attachmentId, anchorDescription, liveSchemaSource } = params;
-    const cached = extractCache.get(attachmentId);
-    if (!cached) {
-        throw new Error(`No cached extract found for attachment "${attachmentId}". ` +
-            `Call memory-ingest-extract first.`);
-    }
-    // Live ∪ declared labels — the gate the validator uses for memory-write.
-    // The classifier sees the same set so its output and the validator agree
-    // by construction.
-    const ontologyLabels = liveSchemaSource.recognisedLabels();
-    return classifyDocument({
-        accountId,
-        anchorDescription,
-        ontologyLabels,
-        naturalEdgeMap: NATURAL_EDGE_MAP,
-        documentText: cached.text,
-    });
-}
-//# sourceMappingURL=memory-classify.js.map

package/payload/platform/plugins/memory/mcp/dist/tools/memory-classify.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"memory-classify.js","sourceRoot":"","sources":["../../src/tools/memory-classify.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAC1D,OAAO,EAAE,gBAAgB,EAAuB,MAAM,0BAA0B,CAAC;AAEjF,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAuBtD;;;;;;;;;;GAUG;AACH,MAAM,gBAAgB,GAAG;;;;;;;;;;;;;0LAaiK,CAAC;AAE3L,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,MAA4B;IAE5B,OAAO,cAAc,CACnB,EAAE,IAAI,EAAE,iBAAiB,EAAE,SAAS,EAAE,MAAM,CAAC,SAAS,EAAE,IAAI,EAAE,MAAM,CAAC,YAAY,EAAE,EACnF,GAAG,EAAE,CAAC,kBAAkB,CAAC,MAAM,CAAC,CACjC,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,kBAAkB,CAC/B,MAA4B;IAE5B,MAAM,EAAE,SAAS,EAAE,YAAY,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,GAAG,MAAM,CAAC;IAEhF,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;IAC9C,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,IAAI,KAAK,CACb,2CAA2C,YAAY,KAAK;YAC5D,mCAAmC,CACpC,CAAC;IACJ,CAAC;IAED,yEAAyE;IACzE,yEAAyE;IACzE,mBAAmB;IACnB,MAAM,cAAc,GAAG,gBAAgB,CAAC,gBAAgB,EAAE,CAAC;IAE3D,OAAO,gBAAgB,CAAC;QACtB,SAAS;QACT,iBAAiB;QACjB,cAAc;QACd,cAAc,EAAE,gBAAgB;QAChC,YAAY,EAAE,MAAM,CAAC,IAAI;KAC1B,CAAC,CAAC;AACL,CAAC"}

package/payload/platform/plugins/memory/mcp/dist/tools/memory-rank.d.ts

@@ -1,61 +0,0 @@
-/**
- * memory-rank — LLM-reasoned entity ranking.
- *
- * Flow:
- *   1. memorySearch(..., limit = candidatePoolSize) to retrieve candidates
- *      using the existing hybrid vector+BM25 pipeline and scope/agent filters.
- *   2. rankCandidates(candidates, criteria, accountId) — passes the pool to
- *      Claude Haiku with a sandboxed ranking prompt, parses the response, and
- *      filters any hallucinated nodeIds.
- *   3. Merge reasoning back onto the original memory-search results and slice
- *      to `limit`.
- *   4. On LLM unavailability (no key, API error, malformed response, etc.),
- *      fall back to the unranked memory-search results prefixed with a
- *      "[Ranking unavailable: <reason>]" notice. Degraded success — not an
- *      error response. This makes the failure visible to the agent so it can
- *      relay to the user.
- */
-export interface RankParams {
-    query: string;
-    criteria: string;
-    labels?: string[];
-    accountId: string;
-    limit?: number;
-    candidatePoolSize?: number;
-    expandHops?: number;
-    allowedScopes?: string[];
-    keywords?: string[];
-    keywordMatch?: "any" | "all";
-    agentSlug?: string;
-    /** Passed through to memory-search so reactive knowledge subscriptions
-     * (KNOWLEDGE_KEYWORDS env var on public agents) expand the candidate pool
-     * the same way they do for memory-search. Omitting this would silently
-     * give memory-rank a narrower candidate pool than memory-search for the
-     * same account. */
-    keywordSubscriptions?: string[];
-}
-export interface RankedResult {
-    nodeId: string;
-    labels: string[];
-    properties: Record<string, unknown>;
-    score: number;
-    related: Array<{
-        relationship: string;
-        direction: string;
-        labels: string[];
-        properties: Record<string, unknown>;
-    }>;
-    rank?: number;
-    reasoning?: string;
-}
-export interface RankResponse {
-    results: RankedResult[];
-    /** When present, ranking failed and results are in original memory-search score order. */
-    fallbackReason?: string;
-    /** Number of candidates the LLM invented that were filtered out. */
-    hallucinated: number;
-    /** Number of candidates returned by memory-search before ranking. */
-    candidatePoolSize: number;
-}
-export declare function memoryRank(params: RankParams): Promise<RankResponse>;
-//# sourceMappingURL=memory-rank.d.ts.map

package/payload/platform/plugins/memory/mcp/dist/tools/memory-rank.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"memory-rank.d.ts","sourceRoot":"","sources":["../../src/tools/memory-rank.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AASH,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,aAAa,CAAC,EAAE,MAAM,EAAE,CAAC;IACzB,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;IACpB,YAAY,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC;IAC7B,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;;;;uBAImB;IACnB,oBAAoB,CAAC,EAAE,MAAM,EAAE,CAAC;CACjC;AAED,MAAM,WAAW,YAAY;IAC3B,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACpC,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,KAAK,CAAC;QACb,YAAY,EAAE,MAAM,CAAC;QACrB,SAAS,EAAE,MAAM,CAAC;QAClB,MAAM,EAAE,MAAM,EAAE,CAAC;QACjB,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;KACrC,CAAC,CAAC;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,YAAY;IAC3B,OAAO,EAAE,YAAY,EAAE,CAAC;IACxB,0FAA0F;IAC1F,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,oEAAoE;IACpE,YAAY,EAAE,MAAM,CAAC;IACrB,qEAAqE;IACrE,iBAAiB,EAAE,MAAM,CAAC;CAC3B;AAeD,wBAAsB,UAAU,CAAC,MAAM,EAAE,UAAU,GAAG,OAAO,CAAC,YAAY,CAAC,CAqF1E"}

package/payload/platform/plugins/memory/mcp/dist/tools/memory-rank.js

@@ -1,102 +0,0 @@
-/**
- * memory-rank — LLM-reasoned entity ranking.
- *
- * Flow:
- *   1. memorySearch(..., limit = candidatePoolSize) to retrieve candidates
- *      using the existing hybrid vector+BM25 pipeline and scope/agent filters.
- *   2. rankCandidates(candidates, criteria, accountId) — passes the pool to
- *      Claude Haiku with a sandboxed ranking prompt, parses the response, and
- *      filters any hallucinated nodeIds.
- *   3. Merge reasoning back onto the original memory-search results and slice
- *      to `limit`.
- *   4. On LLM unavailability (no key, API error, malformed response, etc.),
- *      fall back to the unranked memory-search results prefixed with a
- *      "[Ranking unavailable: <reason>]" notice. Degraded success — not an
- *      error response. This makes the failure visible to the agent so it can
- *      relay to the user.
- */
-import { memorySearch } from "./memory-search.js";
-import { rankCandidates } from "../lib/llm-ranker.js";
-// ---------------------------------------------------------------------------
-// Defaults
-// ---------------------------------------------------------------------------
-const DEFAULT_LIMIT = 10;
-const DEFAULT_POOL = 20;
-const MAX_POOL = 50;
-const DEFAULT_EXPAND = 1;
-// ---------------------------------------------------------------------------
-// Main entry point
-// ---------------------------------------------------------------------------
-export async function memoryRank(params) {
-    const limit = Math.max(1, Math.min(params.limit ?? DEFAULT_LIMIT, MAX_POOL));
-    const pool = Math.max(1, Math.min(params.candidatePoolSize ?? DEFAULT_POOL, MAX_POOL));
-    const expandHops = params.expandHops ?? DEFAULT_EXPAND;
-    // --- Step 1: retrieve candidates via memory-search ---
-    const candidates = await memorySearch({
-        query: params.query,
-        labels: params.labels,
-        accountId: params.accountId,
-        limit: pool,
-        expandHops,
-        allowedScopes: params.allowedScopes,
-        keywords: params.keywords,
-        keywordMatch: params.keywordMatch,
-        agentSlug: params.agentSlug,
-        keywordSubscriptions: params.keywordSubscriptions,
-    });
-    process.stderr.write(`[memory-rank] [${params.accountId}] candidates=${candidates.length} (requested pool=${pool}, limit=${limit})\n`);
-    if (candidates.length === 0) {
-        return {
-            results: [],
-            hallucinated: 0,
-            candidatePoolSize: 0,
-        };
-    }
-    // --- Step 2: LLM ranking ---
-    const rankCandidatePayload = candidates.map((c) => ({
-        nodeId: c.nodeId,
-        labels: c.labels,
-        properties: c.properties,
-        related: c.related,
-    }));
-    const rankResult = await rankCandidates(rankCandidatePayload, params.criteria, params.accountId);
-    // --- Step 3a: error path — return original memory-search order unranked ---
-    if (rankResult.kind === "error") {
-        const sliced = candidates.slice(0, limit).map((c) => ({
-            nodeId: c.nodeId,
-            labels: c.labels,
-            properties: c.properties,
-            score: c.score,
-            related: c.related,
-        }));
-        return {
-            results: sliced,
-            fallbackReason: rankResult.reason,
-            hallucinated: 0,
-            candidatePoolSize: candidates.length,
-        };
-    }
-    // --- Step 3b: ranked path — merge reasoning back onto memory-search results ---
-    const candidateByNodeId = new Map(candidates.map((c) => [c.nodeId, c]));
-    const rankedResults = [];
-    for (const ranking of rankResult.rankings) {
-        const candidate = candidateByNodeId.get(ranking.nodeId);
-        if (!candidate)
-            continue; // defensive — should never hit since llm-ranker already filtered
-        rankedResults.push({
-            nodeId: candidate.nodeId,
-            labels: candidate.labels,
-            properties: candidate.properties,
-            score: candidate.score,
-            related: candidate.related,
-            rank: ranking.rank,
-            reasoning: ranking.reasoning,
-        });
-    }
-    return {
-        results: rankedResults.slice(0, limit),
-        hallucinated: rankResult.hallucinated,
-        candidatePoolSize: candidates.length,
-    };
-}
-//# sourceMappingURL=memory-rank.js.map

package/payload/platform/plugins/memory/mcp/dist/tools/memory-rank.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"memory-rank.js","sourceRoot":"","sources":["../../src/tools/memory-rank.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAClD,OAAO,EAAE,cAAc,EAAsB,MAAM,sBAAsB,CAAC;AAmD1E,8EAA8E;AAC9E,WAAW;AACX,8EAA8E;AAE9E,MAAM,aAAa,GAAG,EAAE,CAAC;AACzB,MAAM,YAAY,GAAG,EAAE,CAAC;AACxB,MAAM,QAAQ,GAAG,EAAE,CAAC;AACpB,MAAM,cAAc,GAAG,CAAC,CAAC;AAEzB,8EAA8E;AAC9E,mBAAmB;AACnB,8EAA8E;AAE9E,MAAM,CAAC,KAAK,UAAU,UAAU,CAAC,MAAkB;IACjD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,IAAI,aAAa,EAAE,QAAQ,CAAC,CAAC,CAAC;IAC7E,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,iBAAiB,IAAI,YAAY,EAAE,QAAQ,CAAC,CAAC,CAAC;IACvF,MAAM,UAAU,GAAG,MAAM,CAAC,UAAU,IAAI,cAAc,CAAC;IAEvD,wDAAwD;IACxD,MAAM,UAAU,GAAG,MAAM,YAAY,CAAC;QACpC,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,MAAM,EAAE,MAAM,CAAC,MAAM;QACrB,SAAS,EAAE,MAAM,CAAC,SAAS;QAC3B,KAAK,EAAE,IAAI;QACX,UAAU;QACV,aAAa,EAAE,MAAM,CAAC,aAAa;QACnC,QAAQ,EAAE,MAAM,CAAC,QAAQ;QACzB,YAAY,EAAE,MAAM,CAAC,YAAY;QACjC,SAAS,EAAE,MAAM,CAAC,SAAS;QAC3B,oBAAoB,EAAE,MAAM,CAAC,oBAAoB;KAClD,CAAC,CAAC;IAEH,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,kBAAkB,MAAM,CAAC,SAAS,gBAAgB,UAAU,CAAC,MAAM,oBAAoB,IAAI,WAAW,KAAK,KAAK,CACjH,CAAC;IAEF,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO;YACL,OAAO,EAAE,EAAE;YACX,YAAY,EAAE,CAAC;YACf,iBAAiB,EAAE,CAAC;SACrB,CAAC;IACJ,CAAC;IAED,8BAA8B;IAC9B,MAAM,oBAAoB,GAAoB,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACnE,MAAM,EAAE,CAAC,CAAC,MAAM;QAChB,MAAM,EAAE,CAAC,CAAC,MAAM;QAChB,UAAU,EAAE,CAAC,CAAC,UAAU;QACxB,OAAO,EAAE,CAAC,CAAC,OAAO;KACnB,CAAC,CAAC,CAAC;IAEJ,MAAM,UAAU,GAAG,MAAM,cAAc,CACrC,oBAAoB,EACpB,MAAM,CAAC,QAAQ,EACf,MAAM,CAAC,SAAS,CACjB,CAAC;IAEF,6EAA6E;IAC7E,IAAI,UAAU,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QAChC,MAAM,MAAM,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACpD,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,UAAU,EAAE,CAAC,CAAC,UAAU;YACxB,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,OAAO,EAAE,CAAC,CAAC,OAAO;SACnB,CAAC,CAAC,CAAC;QACJ,OAAO;YACL,OAAO,EAAE,MAAM;YACf,cAAc,EAAE,UAAU,CAAC,MAAM;YACjC,YAAY,EAAE,CAAC;YACf,iBAAiB,EAAE,UAAU,CAAC,MAAM;SACrC,CAAC;IACJ,CAAC;IAED,iFAAiF;IACjF,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACxE,MAAM,aAAa,GAAmB,EAAE,CAAC;IAEzC,KAAK,MAAM,OAAO,IAAI,UAAU,CAAC,QAAQ,EAAE,CAAC;QAC1C,MAAM,SAAS,GAAG,iBAAiB,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACxD,IAAI,CAAC,SAAS;YAAE,SAAS,CAAC,iEAAiE;QAC3F,aAAa,CAAC,IAAI,CAAC;YACjB,MAAM,EAAE,SAAS,CAAC,MAAM;YACxB,MAAM,EAAE,SAAS,CAAC,MAAM;YACxB,UAAU,EAAE,SAAS,CAAC,UAAU;YAChC,KAAK,EAAE,SAAS,CAAC,KAAK;YACtB,OAAO,EAAE,SAAS,CAAC,OAAO;YAC1B,IAAI,EAAE,OAAO,CAAC,IAAI;YAClB,SAAS,EAAE,OAAO,CAAC,SAAS;SAC7B,CAAC,CAAC;IACL,CAAC;IAED,OAAO;QACL,OAAO,EAAE,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;QACtC,YAAY,EAAE,UAAU,CAAC,YAAY;QACrC,iBAAiB,EAAE,UAAU,CAAC,MAAM;KACrC,CAAC;AACJ,CAAC"}

package/payload/platform/plugins/memory/mcp/dist/tools/memory-signals-recent.d.ts

@@ -1,35 +0,0 @@
-interface SignalsRecentParams {
-    accountId: string;
-    /** Hours back from now. Default 24. Capped at 720h (30 days) — beyond that the read becomes a graph crawl, not a diagnostic. */
-    windowHours?: number;
-    /** Max rows returned. Default 50, max 200. */
-    limit?: number;
-}
-interface MentionRow {
-    kind: "mention";
-    entityLabel: string;
-    entityName: string;
-    conversationId: string;
-    messageId: string;
-    messageExcerpt: string;
-    observedAt: string;
-}
-interface IdeaRow {
-    kind: "idea";
-    conversationId: string;
-    ideaBody: string;
-    observedAt: string;
-}
-type SignalRow = MentionRow | IdeaRow;
-interface SignalsRecentResult {
-    rows: SignalRow[];
-    windowHours: number;
-    counts: {
-        mentions: number;
-        ideas: number;
-        total: number;
-    };
-}
-export declare function memorySignalsRecent(params: SignalsRecentParams): Promise<SignalsRecentResult>;
-export {};
-//# sourceMappingURL=memory-signals-recent.d.ts.map

package/payload/platform/plugins/memory/mcp/dist/tools/memory-signals-recent.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"memory-signals-recent.d.ts","sourceRoot":"","sources":["../../src/tools/memory-signals-recent.ts"],"names":[],"mappings":"AAiBA,UAAU,mBAAmB;IAC3B,SAAS,EAAE,MAAM,CAAC;IAClB,gIAAgI;IAChI,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,8CAA8C;IAC9C,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,UAAU,UAAU;IAClB,IAAI,EAAE,SAAS,CAAC;IAChB,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,cAAc,EAAE,MAAM,CAAC;IACvB,SAAS,EAAE,MAAM,CAAC;IAClB,cAAc,EAAE,MAAM,CAAC;IACvB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,UAAU,OAAO;IACf,IAAI,EAAE,MAAM,CAAC;IACb,cAAc,EAAE,MAAM,CAAC;IACvB,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,KAAK,SAAS,GAAG,UAAU,GAAG,OAAO,CAAC;AAEtC,UAAU,mBAAmB;IAC3B,IAAI,EAAE,SAAS,EAAE,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IACpB,MAAM,EAAE;QACN,QAAQ,EAAE,MAAM,CAAC;QACjB,KAAK,EAAE,MAAM,CAAC;QACd,KAAK,EAAE,MAAM,CAAC;KACf,CAAC;CACH;AAOD,wBAAsB,mBAAmB,CACvC,MAAM,EAAE,mBAAmB,GAC1B,OAAO,CAAC,mBAAmB,CAAC,CA8E9B"}

package/payload/platform/plugins/memory/mcp/dist/tools/memory-signals-recent.js

@@ -1,73 +0,0 @@
-import { getSession } from "../lib/neo4j.js";
-import { notTrashed } from "../../../../../lib/graph-trash/dist/index.js";
-const DEFAULT_WINDOW_HOURS = 24;
-const MAX_WINDOW_HOURS = 720;
-const DEFAULT_LIMIT = 50;
-const MAX_LIMIT = 200;
-export async function memorySignalsRecent(params) {
-    const { accountId } = params;
-    const windowHours = Math.min(Math.max(params.windowHours ?? DEFAULT_WINDOW_HOURS, 1), MAX_WINDOW_HOURS);
-    const limit = Math.min(Math.max(params.limit ?? DEFAULT_LIMIT, 1), MAX_LIMIT);
-    const session = getSession();
-    try {
-        // Mentions: :Message-[:MENTIONS]->Entity edges written by signal-detector
-        // since the cutoff. Excerpt is the first 120 chars of the message body
-        // so the operator sees enough to recognise context without a separate read.
-        const mentionsResult = await session.run(`MATCH (m:Message)-[r:MENTIONS]->(e)
-       WHERE m.accountId = $accountId
-         AND r.createdByAgent = 'signal-detector'
-         AND r.createdAt > datetime() - duration({hours: $windowHours})
-         AND ${notTrashed("m")}
-         AND ${notTrashed("e")}
-       RETURN labels(e) AS entityLabels,
-              coalesce(e.name, e.title, '<unnamed>') AS entityName,
-              m.conversationId AS conversationId,
-              elementId(m) AS messageId,
-              substring(coalesce(m.body, m.text, ''), 0, 120) AS messageExcerpt,
-              toString(r.createdAt) AS observedAt
-       ORDER BY r.createdAt DESC
-       LIMIT $limit`, { accountId, windowHours, limit });
-        const mentions = mentionsResult.records.map((rec) => ({
-            kind: "mention",
-            entityLabel: (rec.get("entityLabels") ?? []).find((l) => l !== "Trashed") ?? "Unknown",
-            entityName: String(rec.get("entityName") ?? ""),
-            conversationId: String(rec.get("conversationId") ?? ""),
-            messageId: String(rec.get("messageId") ?? ""),
-            messageExcerpt: String(rec.get("messageExcerpt") ?? ""),
-            observedAt: String(rec.get("observedAt") ?? ""),
-        }));
-        // Ideas: :Idea nodes written by signal-detector since the cutoff.
-        const ideasResult = await session.run(`MATCH (i:Idea)
-       WHERE i.accountId = $accountId
-         AND i.createdByAgent = 'signal-detector'
-         AND i.createdAt > datetime() - duration({hours: $windowHours})
-         AND ${notTrashed("i")}
-       RETURN coalesce(i.conversationId, '<none>') AS conversationId,
-              coalesce(i.body, '') AS ideaBody,
-              toString(i.createdAt) AS observedAt
-       ORDER BY i.createdAt DESC
-       LIMIT $limit`, { accountId, windowHours, limit });
-        const ideas = ideasResult.records.map((rec) => ({
-            kind: "idea",
-            conversationId: String(rec.get("conversationId") ?? ""),
-            ideaBody: String(rec.get("ideaBody") ?? ""),
-            observedAt: String(rec.get("observedAt") ?? ""),
-        }));
-        // Interleaved by observedAt desc so the operator scans a single
-        // chronological feed instead of two separate sections.
-        const rows = [...mentions, ...ideas].sort((a, b) => a.observedAt < b.observedAt ? 1 : a.observedAt > b.observedAt ? -1 : 0);
-        return {
-            rows: rows.slice(0, limit),
-            windowHours,
-            counts: {
-                mentions: mentions.length,
-                ideas: ideas.length,
-                total: mentions.length + ideas.length,
-            },
-        };
-    }
-    finally {
-        await session.close();
-    }
-}
-//# sourceMappingURL=memory-signals-recent.js.map

package/payload/platform/plugins/memory/mcp/dist/tools/memory-signals-recent.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"memory-signals-recent.js","sourceRoot":"","sources":["../../src/tools/memory-signals-recent.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,UAAU,EAAE,MAAM,8CAA8C,CAAC;AAqD1E,MAAM,oBAAoB,GAAG,EAAE,CAAC;AAChC,MAAM,gBAAgB,GAAG,GAAG,CAAC;AAC7B,MAAM,aAAa,GAAG,EAAE,CAAC;AACzB,MAAM,SAAS,GAAG,GAAG,CAAC;AAEtB,MAAM,CAAC,KAAK,UAAU,mBAAmB,CACvC,MAA2B;IAE3B,MAAM,EAAE,SAAS,EAAE,GAAG,MAAM,CAAC;IAC7B,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,IAAI,oBAAoB,EAAE,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;IACxG,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,IAAI,aAAa,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IAE9E,MAAM,OAAO,GAAG,UAAU,EAAE,CAAC;IAC7B,IAAI,CAAC;QACH,0EAA0E;QAC1E,uEAAuE;QACvE,4EAA4E;QAC5E,MAAM,cAAc,GAAG,MAAM,OAAO,CAAC,GAAG,CACtC;;;;eAIS,UAAU,CAAC,GAAG,CAAC;eACf,UAAU,CAAC,GAAG,CAAC;;;;;;;;oBAQV,EACd,EAAE,SAAS,EAAE,WAAW,EAAE,KAAK,EAAE,CAClC,CAAC;QAEF,MAAM,QAAQ,GAAiB,cAAc,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;YAClE,IAAI,EAAE,SAAkB;YACxB,WAAW,EAAE,CAAE,GAAG,CAAC,GAAG,CAAC,cAAc,CAAc,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,IAAI,SAAS;YACpG,UAAU,EAAE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;YAC/C,cAAc,EAAE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE,CAAC;YACvD,SAAS,EAAE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;YAC7C,cAAc,EAAE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE,CAAC;YACvD,UAAU,EAAE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;SAChD,CAAC,CAAC,CAAC;QAEJ,kEAAkE;QAClE,MAAM,WAAW,GAAG,MAAM,OAAO,CAAC,GAAG,CACnC;;;;eAIS,UAAU,CAAC,GAAG,CAAC;;;;;oBAKV,EACd,EAAE,SAAS,EAAE,WAAW,EAAE,KAAK,EAAE,CAClC,CAAC;QAEF,MAAM,KAAK,GAAc,WAAW,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;YACzD,IAAI,EAAE,MAAe;YACrB,cAAc,EAAE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE,CAAC;YACvD,QAAQ,EAAE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC;YAC3C,UAAU,EAAE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;SAChD,CAAC,CAAC,CAAC;QAEJ,gEAAgE;QAChE,uDAAuD;QACvD,MAAM,IAAI,GAAgB,CAAC,GAAG,QAAQ,EAAE,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAC9D,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CACvE,CAAC;QAEF,OAAO;YACL,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;YAC1B,WAAW;YACX,MAAM,EAAE;gBACN,QAAQ,EAAE,QAAQ,CAAC,MAAM;gBACzB,KAAK,EAAE,KAAK,CAAC,MAAM;gBACnB,KAAK,EAAE,QAAQ,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM;aACtC;SACF,CAAC;IACJ,CAAC;YAAS,CAAC;QACT,MAAM,OAAO,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC;AACH,CAAC"}

package/payload/platform/plugins/memory/mcp/dist/tools/memory-typed-edge-pass.d.ts

@@ -1,29 +0,0 @@
-/**
- * MCP tool wrapper for the typed-edge pass.
- *
- * Called by `database-operator` (Task-spawned by admin during an on-demand
- * `/insight` pass). Admin does not call this tool directly — it is not in
- * `ADMIN_CORE_TOOLS`. Backfill invokes the underlying `runTypedEdgePass`
- * via the CLI script, bypassing this tool.
- *
- * Returns the pass counters so database-operator can hand them back to
- * admin for its insight-pass summary.
- */
-import type { Session } from "neo4j-driver";
-import { type TypedEdgePassResult } from "../lib/typed-edge-pass.js";
-export interface MemoryTypedEdgePassArgs {
-    /**
-     * Lower bound on `node.updatedAt`. The admin agent passes the session
-     * start timestamp from the insight-pass prompt. Backfill mode passes
-     * null (handled by the CLI script, not this tool).
-     */
-    sinceIso: string;
-    /**
-     * Optional conversation id stamped onto the createdBy provenance of
-     * MERGEd edges. Admin passes its own conversation id; if absent, the
-     * env var fallback is used.
-     */
-    sessionId?: string;
-}
-export declare function memoryTypedEdgePass(args: MemoryTypedEdgePassArgs, session: Session, accountId: string): Promise<TypedEdgePassResult>;
-//# sourceMappingURL=memory-typed-edge-pass.d.ts.map

package/payload/platform/plugins/memory/mcp/dist/tools/memory-typed-edge-pass.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"memory-typed-edge-pass.d.ts","sourceRoot":"","sources":["../../src/tools/memory-typed-edge-pass.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAC5C,OAAO,EAAoB,KAAK,mBAAmB,EAAE,MAAM,2BAA2B,CAAC;AAEvF,MAAM,WAAW,uBAAuB;IACtC;;;;OAIG;IACH,QAAQ,EAAE,MAAM,CAAC;IACjB;;;;OAIG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,wBAAsB,mBAAmB,CACvC,IAAI,EAAE,uBAAuB,EAC7B,OAAO,EAAE,OAAO,EAChB,SAAS,EAAE,MAAM,GAChB,OAAO,CAAC,mBAAmB,CAAC,CAQ9B"}

package/payload/platform/plugins/memory/mcp/dist/tools/memory-typed-edge-pass.js

@@ -1,22 +0,0 @@
-/**
- * MCP tool wrapper for the typed-edge pass.
- *
- * Called by `database-operator` (Task-spawned by admin during an on-demand
- * `/insight` pass). Admin does not call this tool directly — it is not in
- * `ADMIN_CORE_TOOLS`. Backfill invokes the underlying `runTypedEdgePass`
- * via the CLI script, bypassing this tool.
- *
- * Returns the pass counters so database-operator can hand them back to
- * admin for its insight-pass summary.
- */
-import { runTypedEdgePass } from "../lib/typed-edge-pass.js";
-export async function memoryTypedEdgePass(args, session, accountId) {
-    const sessionId = args.sessionId ?? process.env.SESSION_ID ?? null;
-    return runTypedEdgePass({
-        session,
-        accountId,
-        sinceIso: args.sinceIso,
-        sessionId,
-    });
-}
-//# sourceMappingURL=memory-typed-edge-pass.js.map

package/payload/platform/plugins/memory/mcp/dist/tools/memory-typed-edge-pass.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"memory-typed-edge-pass.js","sourceRoot":"","sources":["../../src/tools/memory-typed-edge-pass.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAGH,OAAO,EAAE,gBAAgB,EAA4B,MAAM,2BAA2B,CAAC;AAiBvF,MAAM,CAAC,KAAK,UAAU,mBAAmB,CACvC,IAA6B,EAC7B,OAAgB,EAChB,SAAiB;IAEjB,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,OAAO,CAAC,GAAG,CAAC,UAAU,IAAI,IAAI,CAAC;IACnE,OAAO,gBAAgB,CAAC;QACtB,OAAO;QACP,SAAS;QACT,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,SAAS;KACV,CAAC,CAAC;AACL,CAAC"}

package/payload/platform/plugins/memory/mcp/dist/tools/session-retrospective-skip-rate.d.ts

@@ -1,30 +0,0 @@
-/**
- * Session-retrospective skip-rate visibility tool.
- *
- * Called by the admin agent at session start. Returns the ratio of recent
- * sessions that closed without calling `session-retrospective-mark-complete`
- * — sessions where the typed-edge pass, learnings pass, and SOUL.md pass
- * never ran. The admin agent surfaces the result to the operator if the
- * rate is non-zero so closing via Sidebar Archive / tab-close becomes a
- * visible cost rather than a silent one.
- *
- * Mechanism: count `:Conversation` nodes for this account in the recent
- * window; count those whose corresponding session log contains the
- * sentinel tool-use of `session-retrospective-mark-complete`. The ratio
- * is the skip rate. Pending nodes (prose with `updatedAt` later than the
- * most-recent completed retrospective) carry the deferred typed-edge work
- * that will land at the next /end.
- */
-import { type Session } from "neo4j-driver";
-export interface SessionSkipRateArgs {
-    /** Window size — number of most-recent sessions to inspect. Default 10. */
-    windowSize?: number;
-}
-export interface SessionSkipRateResult {
-    windowSessions: number;
-    completedRetrospectives: number;
-    skipRate: number;
-    oldestPendingSinceIso: string | null;
-}
-export declare function sessionRetrospectiveSkipRate(args: SessionSkipRateArgs, session: Session, accountId: string): Promise<SessionSkipRateResult>;
-//# sourceMappingURL=session-retrospective-skip-rate.d.ts.map

package/payload/platform/plugins/memory/mcp/dist/tools/session-retrospective-skip-rate.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"session-retrospective-skip-rate.d.ts","sourceRoot":"","sources":["../../src/tools/session-retrospective-skip-rate.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAO,KAAK,OAAO,EAAE,MAAM,cAAc,CAAC;AAEjD,MAAM,WAAW,mBAAmB;IAClC,2EAA2E;IAC3E,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,qBAAqB;IACpC,cAAc,EAAE,MAAM,CAAC;IACvB,uBAAuB,EAAE,MAAM,CAAC;IAChC,QAAQ,EAAE,MAAM,CAAC;IACjB,qBAAqB,EAAE,MAAM,GAAG,IAAI,CAAC;CACtC;AAED,wBAAsB,4BAA4B,CAChD,IAAI,EAAE,mBAAmB,EACzB,OAAO,EAAE,OAAO,EAChB,SAAS,EAAE,MAAM,GAChB,OAAO,CAAC,qBAAqB,CAAC,CAuHhC"}