@ai-agent-forge/plugin-memory 0.85.0

package/dist/memory/candidates.js

@@ -0,0 +1,100 @@
+import { memoryObservationKey, validateMemoryAtomV1 } from "./foundation.js";
+/** Creates the deterministic candidate state machine over a 1C.1b store. */
+export function createMemoryCandidateMachine(options) {
+    const store = options.store;
+    const now = options.now ?? (() => Date.now());
+    const records = new Map();
+    const keyOf = (owner, observationId) => memoryObservationKey(owner, observationId);
+    const appendTransition = (record, to, patch = {}, reason) => {
+        const transition = Object.freeze({
+            from: record.state,
+            to,
+            at: now(),
+            ...(reason === undefined ? {} : { reason }),
+        });
+        const next = Object.freeze({
+            ...record,
+            ...patch,
+            state: to,
+            transitions: Object.freeze([...record.transitions, transition]),
+        });
+        records.set(record.key, next);
+        return next;
+    };
+    return {
+        observe(input) {
+            assertNonEmptyString(input.owner, "observation owner");
+            assertNonEmptyString(input.observationId, "observation observationId");
+            const key = keyOf(input.owner, input.observationId);
+            const existing = records.get(key);
+            if (existing)
+                return { record: existing, deduped: true };
+            const at = now();
+            const initial = Object.freeze({
+                key,
+                owner: input.owner,
+                observationId: input.observationId,
+                state: "observed",
+                transitions: Object.freeze([Object.freeze({ from: null, to: "observed", at })]),
+            });
+            // Structural gate 1 — identity consistency: the draft must claim the
+            // same observationId it is submitted under.
+            if (input.draft.observationId !== input.observationId) {
+                const rejected = appendTransition(initial, "rejected", { rejectedReason: "Draft atom observationId does not match the observation identity" }, "observation identity mismatch");
+                return { record: rejected, deduped: false };
+            }
+            // Structural gate 2 — full canonical atom validation (schema, sources,
+            // revisions, enums, JSON safety). Failures are explicit rejections.
+            let atom;
+            try {
+                atom = validateMemoryAtomV1(input.draft);
+                if (atom.owner !== input.owner)
+                    throw new Error("Draft atom owner does not match the observation owner");
+            }
+            catch (error) {
+                // v8 ignore next -- 校验器只抛 Error 对象
+                const reason = error instanceof Error ? error.message : String(error);
+                const rejected = appendTransition(initial, "rejected", { rejectedReason: reason }, reason);
+                return { record: rejected, deduped: false };
+            }
+            const candidate = appendTransition(initial, "candidate", { atom });
+            return { record: candidate, deduped: false };
+        },
+        accept(observationId, owner, acceptOptions) {
+            const key = keyOf(owner, observationId);
+            const record = records.get(key);
+            if (!record)
+                throw new Error(`Unknown observation: ${observationId}`);
+            if (record.state === "committed" && record.committed) {
+                // Idempotent accept: the store commit is never repeated.
+                return record.committed;
+            }
+            if (record.state !== "candidate" || !record.atom) {
+                throw new Error(`Observation ${observationId} is ${record.state} and cannot be accepted`);
+            }
+            const committed = store.commit(record.atom, acceptOptions);
+            appendTransition(record, "committed", { committed });
+            return committed;
+        },
+        reject(observationId, owner, reason) {
+            assertNonEmptyString(reason, "reject reason");
+            const key = keyOf(owner, observationId);
+            const record = records.get(key);
+            if (!record)
+                throw new Error(`Unknown observation: ${observationId}`);
+            if (record.state === "committed")
+                throw new Error("A committed memory cannot be rejected");
+            if (record.state === "rejected")
+                return record;
+            return appendTransition(record, "rejected", { rejectedReason: reason }, reason);
+        },
+        stateOf(observationId, owner) {
+            return records.get(keyOf(owner, observationId));
+        },
+    };
+}
+function assertNonEmptyString(value, label) {
+    if (typeof value !== "string" || value.trim().length === 0)
+        throw new Error(`${label} must be a non-empty string`);
+}
+//# sourceMappingURL=candidates.js.map

package/dist/memory/candidates.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"candidates.js","sourceRoot":"","sources":["../../src/memory/candidates.ts"],"names":[],"mappings":"AAgBA,OAAO,EAAE,oBAAoB,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AAkD7E,4EAA4E;AAC5E,MAAM,UAAU,4BAA4B,CAAC,OAG5C,EAA4B;IAC5B,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;IAC5B,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;IAC9C,MAAM,OAAO,GAAG,IAAI,GAAG,EAA8C,CAAC;IAEtE,MAAM,KAAK,GAAG,CAAC,KAAa,EAAE,aAAqB,EAAU,EAAE,CAAC,oBAAoB,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;IAE3G,MAAM,gBAAgB,GAAG,CACxB,MAA0C,EAC1C,EAA0B,EAC1B,KAAK,GAAgD,EAAE,EACvD,MAAe,EACsB,EAAE,CAAC;QACxC,MAAM,UAAU,GAA4B,MAAM,CAAC,MAAM,CAAC;YACzD,IAAI,EAAE,MAAM,CAAC,KAAK;YAClB,EAAE;YACF,EAAE,EAAE,GAAG,EAAE;YACT,GAAG,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC;SAC3C,CAAC,CAAC;QACH,MAAM,IAAI,GAAuC,MAAM,CAAC,MAAM,CAAC;YAC9D,GAAG,MAAM;YACT,GAAG,KAAK;YACR,KAAK,EAAE,EAAE;YACT,WAAW,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;SAC/D,CAAC,CAAC;QACH,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC9B,OAAO,IAAI,CAAC;IAAA,CACZ,CAAC;IAEF,OAAO;QACN,OAAO,CACN,KAAyC,EACP;YAClC,oBAAoB,CAAC,KAAK,CAAC,KAAK,EAAE,mBAAmB,CAAC,CAAC;YACvD,oBAAoB,CAAC,KAAK,CAAC,aAAa,EAAE,2BAA2B,CAAC,CAAC;YACvE,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC;YACpD,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAClC,IAAI,QAAQ;gBAAE,OAAO,EAAE,MAAM,EAAE,QAA6C,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;YAE9F,MAAM,EAAE,GAAG,GAAG,EAAE,CAAC;YACjB,MAAM,OAAO,GAAsC,MAAM,CAAC,MAAM,CAAC;gBAChE,GAAG;gBACH,KAAK,EAAE,KAAK,CAAC,KAAK;gBAClB,aAAa,EAAE,KAAK,CAAC,aAAa;gBAClC,KAAK,EAAE,UAAmB;gBAC1B,WAAW,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,UAAmB,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;aACxF,CAAC,CAAC;YAEH,uEAAqE;YACrE,4CAA4C;YAC5C,IAAI,KAAK,CAAC,KAAK,CAAC,aAAa,KAAK,KAAK,CAAC,aAAa,EAAE,CAAC;gBACvD,MAAM,QAAQ,GAAG,gBAAgB,CAChC,OAAO,EACP,UAAU,EACV,EAAE,cAAc,EAAE,kEAAkE,EAAE,EACtF,+BAA+B,CAC/B,CAAC;gBACF,OAAO,EAAE,MAAM,EAAE,QAA6C,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;YAClF,CAAC;YAED,yEAAuE;YACvE,oEAAoE;YACpE,IAAI,IAA4B,CAAC;YACjC,IAAI,CAAC;gBACJ,IAAI,GAAG,oBAAoB,CAAW,KAAK,CAAC,KAAK,CAAC,CAAC;gBACnD,IAAI,IAAI,CAAC,KAAK,KAAK,KAAK,CAAC,KAAK;oBAAE,MAAM,IAAI,KAAK,CAAC,uDAAuD,CAAC,CAAC;YAC1G,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBAChB,iDAAmC;gBACnC,MAAM,MAAM,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBACtE,MAAM,QAAQ,GAAG,gBAAgB,CAAC,OAAO,EAAE,UAAU,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,EAAE,MAAM,CAAC,CAAC;gBAC3F,OAAO,EAAE,MAAM,EAAE,QAA6C,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;YAClF,CAAC;YAED,MAAM,SAAS,GAAG,gBAAgB,CAAC,OAAO,EAAE,WAAW,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;YACnE,OAAO,EAAE,MAAM,EAAE,SAA8C,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;QAAA,CAClF;QAED,MAAM,CAAC,aAAa,EAAE,KAAK,EAAE,aAAa,EAAE;YAC3C,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;YACxC,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAChC,IAAI,CAAC,MAAM;gBAAE,MAAM,IAAI,KAAK,CAAC,wBAAwB,aAAa,EAAE,CAAC,CAAC;YACtE,IAAI,MAAM,CAAC,KAAK,KAAK,WAAW,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;gBACtD,yDAAyD;gBACzD,OAAO,MAAM,CAAC,SAAS,CAAC;YACzB,CAAC;YACD,IAAI,MAAM,CAAC,KAAK,KAAK,WAAW,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;gBAClD,MAAM,IAAI,KAAK,CAAC,eAAe,aAAa,OAAO,MAAM,CAAC,KAAK,yBAAyB,CAAC,CAAC;YAC3F,CAAC;YACD,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;YAC3D,gBAAgB,CAAC,MAAM,EAAE,WAAW,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC;YACrD,OAAO,SAAS,CAAC;QAAA,CACjB;QAED,MAAM,CAAC,aAAa,EAAE,KAAK,EAAE,MAAM,EAAE;YACpC,oBAAoB,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;YAC9C,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;YACxC,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAChC,IAAI,CAAC,MAAM;gBAAE,MAAM,IAAI,KAAK,CAAC,wBAAwB,aAAa,EAAE,CAAC,CAAC;YACtE,IAAI,MAAM,CAAC,KAAK,KAAK,WAAW;gBAAE,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;YAC3F,IAAI,MAAM,CAAC,KAAK,KAAK,UAAU;gBAAE,OAAO,MAAM,CAAC;YAC/C,OAAO,gBAAgB,CAAC,MAAM,EAAE,UAAU,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,EAAE,MAAM,CAAC,CAAC;QAAA,CAChF;QAED,OAAO,CAAC,aAAa,EAAE,KAAK,EAAE;YAC7B,OAAO,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,aAAa,CAAC,CAAwC,CAAC;QAAA,CACvF;KACD,CAAC;AAAA,CACF;AAED,SAAS,oBAAoB,CAAC,KAAc,EAAE,KAAa,EAA2B;IACrF,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,6BAA6B,CAAC,CAAC;AAAA,CACnH","sourcesContent":["/**\n * Memory Foundation — minimal observation/candidate/commit state machine\n * (1C.2).\n *\n * The Foundation validates sources, revisions, idempotency, and structural\n * state only. Accept/reject are public state transitions recorded in an\n * immutable transition log; nothing is silently dropped. Idempotency identity\n * is `(owner, observationId)`: re-observing the same key returns the existing\n * record and never duplicates a commit.\n *\n * States: observed → candidate → committed, or → rejected (terminal, with\n * reason). Lifecycle beyond commit (decay/archive/purge) belongs to the\n * lifecycle manager slices.\n */\nimport type { JsonValue } from \"@agent-forge/plugin-sdk\";\nimport type { MemoryAtomV1, MemoryScopeV1 } from \"./foundation.ts\";\nimport { memoryObservationKey, validateMemoryAtomV1 } from \"./foundation.ts\";\nimport type { CommittedMemoryV1, MemoryStoreV1 } from \"./store.ts\";\n\nexport type MemoryCandidateStateV1 = \"observed\" | \"candidate\" | \"committed\" | \"rejected\";\n\nexport interface MemoryObservationInputV1<TPayload extends JsonValue = JsonValue> {\n\treadonly owner: string;\n\treadonly observationId: string;\n\t/** The unvalidated draft atom; its `observationId` field must match the observation. */\n\treadonly draft: MemoryAtomV1<TPayload>;\n}\n\nexport interface MemoryStateTransitionV1 {\n\treadonly from: MemoryCandidateStateV1 | null;\n\treadonly to: MemoryCandidateStateV1;\n\treadonly at: number;\n\treadonly reason?: string;\n}\n\nexport interface MemoryCandidateRecordV1<TPayload extends JsonValue = JsonValue> {\n\treadonly key: string;\n\treadonly owner: string;\n\treadonly observationId: string;\n\treadonly state: MemoryCandidateStateV1;\n\t/** Set from `candidate` onward: the validated, frozen draft. */\n\treadonly atom?: MemoryAtomV1<TPayload>;\n\t/** Set once committed: the store-assigned record. */\n\treadonly committed?: CommittedMemoryV1<TPayload>;\n\t/** Set when rejected: the structural reason the draft failed. */\n\treadonly rejectedReason?: string;\n\treadonly transitions: readonly MemoryStateTransitionV1[];\n}\n\nexport interface MemoryObserveResultV1<TPayload extends JsonValue = JsonValue> {\n\treadonly record: MemoryCandidateRecordV1<TPayload>;\n\t/** True when the (owner, observationId) identity already existed. */\n\treadonly deduped: boolean;\n}\n\nexport interface MemoryCandidateMachineV1 {\n\tobserve<TPayload extends JsonValue = JsonValue>(\n\t\tinput: MemoryObservationInputV1<TPayload>,\n\t): MemoryObserveResultV1<TPayload>;\n\t/** Promotes a candidate into the Foundation ledger (1C.1b store). */\n\taccept(observationId: string, owner: string, options?: { readonly retentionModeId?: string }): CommittedMemoryV1;\n\t/** Explicitly rejects a candidate; the reason becomes part of the audit log. */\n\treject(observationId: string, owner: string, reason: string): MemoryCandidateRecordV1;\n\tstateOf(observationId: string, owner: string): MemoryCandidateRecordV1 | undefined;\n}\n\n/** Creates the deterministic candidate state machine over a 1C.1b store. */\nexport function createMemoryCandidateMachine(options: {\n\treadonly store: MemoryStoreV1;\n\treadonly now?: () => number;\n}): MemoryCandidateMachineV1 {\n\tconst store = options.store;\n\tconst now = options.now ?? (() => Date.now());\n\tconst records = new Map<string, MemoryCandidateRecordV1<JsonValue>>();\n\n\tconst keyOf = (owner: string, observationId: string): string => memoryObservationKey(owner, observationId);\n\n\tconst appendTransition = (\n\t\trecord: MemoryCandidateRecordV1<JsonValue>,\n\t\tto: MemoryCandidateStateV1,\n\t\tpatch: Partial<MemoryCandidateRecordV1<JsonValue>> = {},\n\t\treason?: string,\n\t): MemoryCandidateRecordV1<JsonValue> => {\n\t\tconst transition: MemoryStateTransitionV1 = Object.freeze({\n\t\t\tfrom: record.state,\n\t\t\tto,\n\t\t\tat: now(),\n\t\t\t...(reason === undefined ? {} : { reason }),\n\t\t});\n\t\tconst next: MemoryCandidateRecordV1<JsonValue> = Object.freeze({\n\t\t\t...record,\n\t\t\t...patch,\n\t\t\tstate: to,\n\t\t\ttransitions: Object.freeze([...record.transitions, transition]),\n\t\t});\n\t\trecords.set(record.key, next);\n\t\treturn next;\n\t};\n\n\treturn {\n\t\tobserve<TPayload extends JsonValue = JsonValue>(\n\t\t\tinput: MemoryObservationInputV1<TPayload>,\n\t\t): MemoryObserveResultV1<TPayload> {\n\t\t\tassertNonEmptyString(input.owner, \"observation owner\");\n\t\t\tassertNonEmptyString(input.observationId, \"observation observationId\");\n\t\t\tconst key = keyOf(input.owner, input.observationId);\n\t\t\tconst existing = records.get(key);\n\t\t\tif (existing) return { record: existing as MemoryCandidateRecordV1<TPayload>, deduped: true };\n\n\t\t\tconst at = now();\n\t\t\tconst initial: MemoryCandidateRecordV1<TPayload> = Object.freeze({\n\t\t\t\tkey,\n\t\t\t\towner: input.owner,\n\t\t\t\tobservationId: input.observationId,\n\t\t\t\tstate: \"observed\" as const,\n\t\t\t\ttransitions: Object.freeze([Object.freeze({ from: null, to: \"observed\" as const, at })]),\n\t\t\t});\n\n\t\t\t// Structural gate 1 — identity consistency: the draft must claim the\n\t\t\t// same observationId it is submitted under.\n\t\t\tif (input.draft.observationId !== input.observationId) {\n\t\t\t\tconst rejected = appendTransition(\n\t\t\t\t\tinitial,\n\t\t\t\t\t\"rejected\",\n\t\t\t\t\t{ rejectedReason: \"Draft atom observationId does not match the observation identity\" },\n\t\t\t\t\t\"observation identity mismatch\",\n\t\t\t\t);\n\t\t\t\treturn { record: rejected as MemoryCandidateRecordV1<TPayload>, deduped: false };\n\t\t\t}\n\n\t\t\t// Structural gate 2 — full canonical atom validation (schema, sources,\n\t\t\t// revisions, enums, JSON safety). Failures are explicit rejections.\n\t\t\tlet atom: MemoryAtomV1<TPayload>;\n\t\t\ttry {\n\t\t\t\tatom = validateMemoryAtomV1<TPayload>(input.draft);\n\t\t\t\tif (atom.owner !== input.owner) throw new Error(\"Draft atom owner does not match the observation owner\");\n\t\t\t} catch (error) {\n\t\t\t\t// v8 ignore next -- 校验器只抛 Error 对象\n\t\t\t\tconst reason = error instanceof Error ? error.message : String(error);\n\t\t\t\tconst rejected = appendTransition(initial, \"rejected\", { rejectedReason: reason }, reason);\n\t\t\t\treturn { record: rejected as MemoryCandidateRecordV1<TPayload>, deduped: false };\n\t\t\t}\n\n\t\t\tconst candidate = appendTransition(initial, \"candidate\", { atom });\n\t\t\treturn { record: candidate as MemoryCandidateRecordV1<TPayload>, deduped: false };\n\t\t},\n\n\t\taccept(observationId, owner, acceptOptions) {\n\t\t\tconst key = keyOf(owner, observationId);\n\t\t\tconst record = records.get(key);\n\t\t\tif (!record) throw new Error(`Unknown observation: ${observationId}`);\n\t\t\tif (record.state === \"committed\" && record.committed) {\n\t\t\t\t// Idempotent accept: the store commit is never repeated.\n\t\t\t\treturn record.committed;\n\t\t\t}\n\t\t\tif (record.state !== \"candidate\" || !record.atom) {\n\t\t\t\tthrow new Error(`Observation ${observationId} is ${record.state} and cannot be accepted`);\n\t\t\t}\n\t\t\tconst committed = store.commit(record.atom, acceptOptions);\n\t\t\tappendTransition(record, \"committed\", { committed });\n\t\t\treturn committed;\n\t\t},\n\n\t\treject(observationId, owner, reason) {\n\t\t\tassertNonEmptyString(reason, \"reject reason\");\n\t\t\tconst key = keyOf(owner, observationId);\n\t\t\tconst record = records.get(key);\n\t\t\tif (!record) throw new Error(`Unknown observation: ${observationId}`);\n\t\t\tif (record.state === \"committed\") throw new Error(\"A committed memory cannot be rejected\");\n\t\t\tif (record.state === \"rejected\") return record;\n\t\t\treturn appendTransition(record, \"rejected\", { rejectedReason: reason }, reason);\n\t\t},\n\n\t\tstateOf(observationId, owner) {\n\t\t\treturn records.get(keyOf(owner, observationId)) as MemoryCandidateRecordV1 | undefined;\n\t\t},\n\t};\n}\n\nfunction assertNonEmptyString(value: unknown, label: string): asserts value is string {\n\tif (typeof value !== \"string\" || value.trim().length === 0) throw new Error(`${label} must be a non-empty string`);\n}\n\nexport type { MemoryScopeV1 };\n"]}

package/dist/memory/code-memory.d.ts

@@ -0,0 +1,89 @@
+/**
+ * code-memory agent (2.4a) — project facts, decisions, and tool/test facts
+ * recorded through the 1C Memory Foundation.
+ *
+ * Selective writes go through the candidate machine (validation, idempotent
+ * `(owner, observationId)` dedupe, explicit rejection); recall reuses the
+ * bounded recall index and packet. Every fact carries its source references,
+ * a `code-memory:kind` facet, and Foundation-managed scope/revisions, so a
+ * plain store replay restores full recall. Preference envelopes, complex
+ * semantics, and advanced indexing are later slices (2.4c/d).
+ */
+import type { JsonValue } from "@agent-forge/plugin-sdk";
+import type { MemoryCandidateMachineV1 } from "./candidates.ts";
+import { type MemoryAtomV1, type MemorySourceRefV1 } from "./foundation.ts";
+import type { MemoryRecallPacketV1 } from "./recall-packet.ts";
+import { type MemoryRecallBudgetContributionV1, type MemoryRecallBudgetsV1 } from "./recall-packet.ts";
+/** The slice of the 1C recall index the code-memory agent depends on. */
+export interface MemoryRecallIndexShimV1 {
+    query(query: {
+        readonly owner: string;
+        readonly projects?: readonly string[];
+        readonly tasks?: readonly string[];
+        readonly facets?: readonly {
+            readonly namespace: string;
+            readonly key?: string;
+            readonly value?: string;
+        }[];
+    }): {
+        readonly items: readonly {
+            readonly atom: MemoryAtomV1<JsonValue>;
+        }[];
+        readonly total: number;
+    };
+}
+export type CodeMemoryFactKindV1 = "project" | "decision" | "tool_test" | "bug" | "task" | "compaction";
+export interface CodeMemoryFactInputV1 {
+    readonly owner: string;
+    readonly kind: CodeMemoryFactKindV1;
+    /** Human-readable fact statement; must be non-empty. */
+    readonly statement: string;
+    /** Structured detail (command, exit code, test counts, decision options…). */
+    readonly detail?: JsonValue;
+    readonly project?: string;
+    readonly task?: string;
+    /** Where the fact came from (tool result, file, user answer…); at least one required. */
+    readonly sourceRefs: readonly {
+        readonly kind: MemorySourceRefV1["kind"];
+        readonly id: string;
+    }[];
+    readonly occurredAt: string;
+    /** Idempotency identity together with `owner`. */
+    readonly observationId: string;
+    readonly retentionMode?: "short" | "standard" | "long" | "permanent";
+    /**
+     * Suite (方案) to bind the fact to (方案系统设计 §6.1, M5). When absent the
+     * fact stays suite-less: readable through suite-unscoped queries only —
+     * suite-scoped reads skip it fail-safe.
+     */
+    readonly suiteId?: string;
+}
+export type CodeMemoryRecordResultV1 = {
+    readonly status: "recorded";
+    readonly memoryId: string;
+    readonly storeRevision: number;
+} | {
+    readonly status: "deduped";
+    readonly memoryId: string;
+} | {
+    readonly status: "rejected";
+    readonly reason: string;
+};
+export interface CodeMemoryRecallInputV1 {
+    readonly owner: string;
+    readonly kind?: CodeMemoryFactKindV1;
+    readonly project?: string;
+    readonly task?: string;
+    readonly requestedBudgets?: MemoryRecallBudgetContributionV1;
+}
+export interface CodeMemoryAgentV1 {
+    recordFact(input: CodeMemoryFactInputV1): CodeMemoryRecordResultV1;
+    recall(input: CodeMemoryRecallInputV1): MemoryRecallPacketV1;
+}
+export declare function createCodeMemoryAgent(options: {
+    readonly machine: MemoryCandidateMachineV1;
+    readonly index: MemoryRecallIndexShimV1;
+    readonly policyDefaults: MemoryRecallBudgetsV1;
+    readonly hostLimits: MemoryRecallBudgetsV1;
+}): CodeMemoryAgentV1;
+//# sourceMappingURL=code-memory.d.ts.map

package/dist/memory/code-memory.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"code-memory.d.ts","sourceRoot":"","sources":["../../src/memory/code-memory.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,KAAK,EAAE,wBAAwB,EAAE,MAAM,iBAAiB,CAAC;AAChE,OAAO,EAAqB,KAAK,YAAY,EAAE,KAAK,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AAC/F,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,oBAAoB,CAAC;AAC/D,OAAO,EAEN,KAAK,gCAAgC,EACrC,KAAK,qBAAqB,EAE1B,MAAM,oBAAoB,CAAC;AAG5B,yEAAyE;AACzE,MAAM,WAAW,uBAAuB;IACvC,KAAK,CAAC,KAAK,EAAE;QACZ,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;QACvB,QAAQ,CAAC,QAAQ,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;QACtC,QAAQ,CAAC,KAAK,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;QACnC,QAAQ,CAAC,MAAM,CAAC,EAAE,SAAS;YAAE,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;YAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC;YAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAA;SAAE,EAAE,CAAC;KAC5G,GAAG;QAAE,QAAQ,CAAC,KAAK,EAAE,SAAS;YAAE,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAC,SAAS,CAAC,CAAA;SAAE,EAAE,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;CACtG;AAED,MAAM,MAAM,oBAAoB,GAAG,SAAS,GAAG,UAAU,GAAG,WAAW,GAAG,KAAK,GAAG,MAAM,GAAG,YAAY,CAAC;AAExG,MAAM,WAAW,qBAAqB;IACrC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,IAAI,EAAE,oBAAoB,CAAC;IACpC,wDAAwD;IACxD,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,gFAA8E;IAC9E,QAAQ,CAAC,MAAM,CAAC,EAAE,SAAS,CAAC;IAC5B,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IACvB,2FAAyF;IACzF,QAAQ,CAAC,UAAU,EAAE,SAAS;QAAE,QAAQ,CAAC,IAAI,EAAE,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IAClG,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,kDAAkD;IAClD,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,aAAa,CAAC,EAAE,OAAO,GAAG,UAAU,GAAG,MAAM,GAAG,WAAW,CAAC;IACrE;;;;OAIG;IACH,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED,MAAM,MAAM,wBAAwB,GACjC;IAAE,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC;IAAC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAA;CAAE,GAC1F;IAAE,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAC;IAAC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,GACzD;IAAE,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAE5D,MAAM,WAAW,uBAAuB;IACvC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,IAAI,CAAC,EAAE,oBAAoB,CAAC;IACrC,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,gBAAgB,CAAC,EAAE,gCAAgC,CAAC;CAC7D;AAED,MAAM,WAAW,iBAAiB;IACjC,UAAU,CAAC,KAAK,EAAE,qBAAqB,GAAG,wBAAwB,CAAC;IACnE,MAAM,CAAC,KAAK,EAAE,uBAAuB,GAAG,oBAAoB,CAAC;CAC7D;AAeD,wBAAgB,qBAAqB,CAAC,OAAO,EAAE;IAC9C,QAAQ,CAAC,OAAO,EAAE,wBAAwB,CAAC;IAC3C,QAAQ,CAAC,KAAK,EAAE,uBAAuB,CAAC;IACxC,QAAQ,CAAC,cAAc,EAAE,qBAAqB,CAAC;IAC/C,QAAQ,CAAC,UAAU,EAAE,qBAAqB,CAAC;CAC3C,GAAG,iBAAiB,CA+FpB","sourcesContent":["/**\n * code-memory agent (2.4a) — project facts, decisions, and tool/test facts\n * recorded through the 1C Memory Foundation.\n *\n * Selective writes go through the candidate machine (validation, idempotent\n * `(owner, observationId)` dedupe, explicit rejection); recall reuses the\n * bounded recall index and packet. Every fact carries its source references,\n * a `code-memory:kind` facet, and Foundation-managed scope/revisions, so a\n * plain store replay restores full recall. Preference envelopes, complex\n * semantics, and advanced indexing are later slices (2.4c/d).\n */\nimport type { JsonValue } from \"@agent-forge/plugin-sdk\";\nimport type { MemoryCandidateMachineV1 } from \"./candidates.ts\";\nimport { buildMemoryAtomV1, type MemoryAtomV1, type MemorySourceRefV1 } from \"./foundation.ts\";\nimport type { MemoryRecallPacketV1 } from \"./recall-packet.ts\";\nimport {\n\tbuildMemoryRecallPacketV1,\n\ttype MemoryRecallBudgetContributionV1,\n\ttype MemoryRecallBudgetsV1,\n\tresolveMemoryRecallBudgets,\n} from \"./recall-packet.ts\";\nimport { MEMORY_CONTRACT_VERSION_V2 } from \"./transfer.ts\";\n\n/** The slice of the 1C recall index the code-memory agent depends on. */\nexport interface MemoryRecallIndexShimV1 {\n\tquery(query: {\n\t\treadonly owner: string;\n\t\treadonly projects?: readonly string[];\n\t\treadonly tasks?: readonly string[];\n\t\treadonly facets?: readonly { readonly namespace: string; readonly key?: string; readonly value?: string }[];\n\t}): { readonly items: readonly { readonly atom: MemoryAtomV1<JsonValue> }[]; readonly total: number };\n}\n\nexport type CodeMemoryFactKindV1 = \"project\" | \"decision\" | \"tool_test\" | \"bug\" | \"task\" | \"compaction\";\n\nexport interface CodeMemoryFactInputV1 {\n\treadonly owner: string;\n\treadonly kind: CodeMemoryFactKindV1;\n\t/** Human-readable fact statement; must be non-empty. */\n\treadonly statement: string;\n\t/** Structured detail (command, exit code, test counts, decision options…). */\n\treadonly detail?: JsonValue;\n\treadonly project?: string;\n\treadonly task?: string;\n\t/** Where the fact came from (tool result, file, user answer…); at least one required. */\n\treadonly sourceRefs: readonly { readonly kind: MemorySourceRefV1[\"kind\"]; readonly id: string }[];\n\treadonly occurredAt: string;\n\t/** Idempotency identity together with `owner`. */\n\treadonly observationId: string;\n\treadonly retentionMode?: \"short\" | \"standard\" | \"long\" | \"permanent\";\n\t/**\n\t * Suite (方案) to bind the fact to (方案系统设计 §6.1, M5). When absent the\n\t * fact stays suite-less: readable through suite-unscoped queries only —\n\t * suite-scoped reads skip it fail-safe.\n\t */\n\treadonly suiteId?: string;\n}\n\nexport type CodeMemoryRecordResultV1 =\n\t| { readonly status: \"recorded\"; readonly memoryId: string; readonly storeRevision: number }\n\t| { readonly status: \"deduped\"; readonly memoryId: string }\n\t| { readonly status: \"rejected\"; readonly reason: string };\n\nexport interface CodeMemoryRecallInputV1 {\n\treadonly owner: string;\n\treadonly kind?: CodeMemoryFactKindV1;\n\treadonly project?: string;\n\treadonly task?: string;\n\treadonly requestedBudgets?: MemoryRecallBudgetContributionV1;\n}\n\nexport interface CodeMemoryAgentV1 {\n\trecordFact(input: CodeMemoryFactInputV1): CodeMemoryRecordResultV1;\n\trecall(input: CodeMemoryRecallInputV1): MemoryRecallPacketV1;\n}\n\nconst CONTRACT_VERSION = MEMORY_CONTRACT_VERSION_V2;\nconst RETENTION_POLICY_VERSION = \"retention@1\";\n\n/** FNV-1a 32-bit — deterministic identity from the given value. */\nfunction identityHash(value: string): string {\n\tlet hash = 0x811c9dc5;\n\tfor (let index = 0; index < value.length; index += 1) {\n\t\thash ^= value.charCodeAt(index);\n\t\thash = Math.imul(hash, 0x01000193);\n\t}\n\treturn (hash >>> 0).toString(36);\n}\n\nexport function createCodeMemoryAgent(options: {\n\treadonly machine: MemoryCandidateMachineV1;\n\treadonly index: MemoryRecallIndexShimV1;\n\treadonly policyDefaults: MemoryRecallBudgetsV1;\n\treadonly hostLimits: MemoryRecallBudgetsV1;\n}): CodeMemoryAgentV1 {\n\tconst evidenceClassOf = (kind: CodeMemoryFactKindV1) =>\n\t\tkind === \"tool_test\" || kind === \"bug\"\n\t\t\t? (\"tool_or_test\" as const)\n\t\t\t: kind === \"compaction\"\n\t\t\t\t? (\"derived\" as const)\n\t\t\t\t: (\"explicit\" as const);\n\n\treturn {\n\t\trecordFact(input) {\n\t\t\tif (typeof input.statement !== \"string\" || input.statement.trim().length === 0) {\n\t\t\t\treturn { status: \"rejected\", reason: \"code-memory statement must be a non-empty string\" };\n\t\t\t}\n\t\t\tif (!Array.isArray(input.sourceRefs) || input.sourceRefs.length === 0) {\n\t\t\t\treturn { status: \"rejected\", reason: \"code-memory facts require at least one source reference\" };\n\t\t\t}\n\t\t\tif (Number.isNaN(Date.parse(input.occurredAt))) {\n\t\t\t\treturn { status: \"rejected\", reason: \"code-memory occurredAt must be an ISO-8601 timestamp\" };\n\t\t\t}\n\t\t\tconst memoryId = `code-${identityHash(`${input.owner}\\u0000${input.observationId}`)}`;\n\t\t\tconst sourceRefs: readonly MemorySourceRefV1[] = input.sourceRefs.map((ref) =>\n\t\t\t\tObject.freeze({ kind: ref.kind, id: ref.id }),\n\t\t\t);\n\t\t\tconst draft = buildMemoryAtomV1({\n\t\t\t\tmemoryId,\n\t\t\t\tcontractVersion: CONTRACT_VERSION,\n\t\t\t\tschemaVersion: 1,\n\t\t\t\tscope: \"long-term\",\n\t\t\t\tretentionMode: input.retentionMode ?? \"standard\",\n\t\t\t\towner: input.owner,\n\t\t\t\tprofileId: \"code-memory\",\n\t\t\t\t...(input.suiteId === undefined ? {} : { suiteId: input.suiteId }),\n\t\t\t\tretentionPolicyVersion: RETENTION_POLICY_VERSION,\n\t\t\t\tmemoryKind: \"fact\",\n\t\t\t\tpayload: {\n\t\t\t\t\tkind: input.kind,\n\t\t\t\t\tstatement: input.statement,\n\t\t\t\t\t...(input.detail === undefined ? {} : { detail: input.detail }),\n\t\t\t\t} as JsonValue,\n\t\t\t\toccurredAt: input.occurredAt,\n\t\t\t\trecordedAt: input.occurredAt,\n\t\t\t\tsourceRefs,\n\t\t\t\tobservationId: input.observationId,\n\t\t\t\tsessionRefs: [],\n\t\t\t\tagentInstanceRefs: [],\n\t\t\t\tprojectRefs: input.project === undefined ? [] : [input.project],\n\t\t\t\tsubjectRefs: input.task === undefined ? [] : [input.task],\n\t\t\t\tfacets: [{ namespace: \"code-memory\", schemaVersion: 1, key: \"kind\", value: input.kind }],\n\t\t\t\trelations: [],\n\t\t\t\tconfidence: 1,\n\t\t\t\timportance: 0.5,\n\t\t\t\tevidenceClass: evidenceClassOf(input.kind),\n\t\t\t\tcontentRevision: `c-${identityHash(JSON.stringify([input.statement, input.detail ?? null]))}`,\n\t\t\t\twriteReason: `code-memory/${input.kind}`,\n\t\t\t});\n\n\t\t\tconst observation = options.machine.observe({\n\t\t\t\towner: input.owner,\n\t\t\t\tobservationId: input.observationId,\n\t\t\t\tdraft,\n\t\t\t});\n\t\t\t// v8 ignore next -- recordFact 先本地校验并构造合法 draft，observe 不可能拒绝\n\t\t\tif (observation.record.state === \"rejected\") {\n\t\t\t\t// v8 ignore next -- 同上：该分支不可达\n\t\t\t\treturn { status: \"rejected\", reason: observation.record.rejectedReason ?? \"rejected\" };\n\t\t\t}\n\t\t\tif (observation.record.state === \"committed\" && observation.record.committed) {\n\t\t\t\treturn { status: \"deduped\", memoryId: observation.record.committed.atom.memoryId };\n\t\t\t}\n\t\t\tconst committed = options.machine.accept(input.observationId, input.owner);\n\t\t\treturn { status: \"recorded\", memoryId: committed.atom.memoryId, storeRevision: committed.storeRevision };\n\t\t},\n\t\trecall(input) {\n\t\t\tconst budgets = resolveMemoryRecallBudgets({\n\t\t\t\trequested: input.requestedBudgets,\n\t\t\t\tpolicyDefaults: options.policyDefaults,\n\t\t\t\thostLimits: options.hostLimits,\n\t\t\t}).budgets;\n\t\t\tconst page = options.index.query({\n\t\t\t\towner: input.owner,\n\t\t\t\t...(input.project === undefined ? {} : { projects: [input.project] }),\n\t\t\t\t...(input.task === undefined ? {} : { tasks: [input.task] }),\n\t\t\t\t...(input.kind === undefined\n\t\t\t\t\t? { facets: [{ namespace: \"code-memory\" }] }\n\t\t\t\t\t: { facets: [{ namespace: \"code-memory\", key: \"kind\", value: input.kind }] }),\n\t\t\t});\n\t\t\treturn buildMemoryRecallPacketV1({\n\t\t\t\toperationId: `code-memory-recall-${identityHash(\n\t\t\t\t\tJSON.stringify([input.owner, input.kind ?? \"*\", input.project ?? \"*\", input.task ?? \"*\"]),\n\t\t\t\t)}`,\n\t\t\t\tcandidates: page.items.map((item) => item.atom),\n\t\t\t\tbudgets,\n\t\t\t});\n\t\t},\n\t};\n}\n"]}

package/dist/memory/code-memory.js

@@ -0,0 +1,104 @@
+import { buildMemoryAtomV1 } from "./foundation.js";
+import { buildMemoryRecallPacketV1, resolveMemoryRecallBudgets, } from "./recall-packet.js";
+import { MEMORY_CONTRACT_VERSION_V2 } from "./transfer.js";
+const CONTRACT_VERSION = MEMORY_CONTRACT_VERSION_V2;
+const RETENTION_POLICY_VERSION = "retention@1";
+/** FNV-1a 32-bit — deterministic identity from the given value. */
+function identityHash(value) {
+    let hash = 0x811c9dc5;
+    for (let index = 0; index < value.length; index += 1) {
+        hash ^= value.charCodeAt(index);
+        hash = Math.imul(hash, 0x01000193);
+    }
+    return (hash >>> 0).toString(36);
+}
+export function createCodeMemoryAgent(options) {
+    const evidenceClassOf = (kind) => kind === "tool_test" || kind === "bug"
+        ? "tool_or_test"
+        : kind === "compaction"
+            ? "derived"
+            : "explicit";
+    return {
+        recordFact(input) {
+            if (typeof input.statement !== "string" || input.statement.trim().length === 0) {
+                return { status: "rejected", reason: "code-memory statement must be a non-empty string" };
+            }
+            if (!Array.isArray(input.sourceRefs) || input.sourceRefs.length === 0) {
+                return { status: "rejected", reason: "code-memory facts require at least one source reference" };
+            }
+            if (Number.isNaN(Date.parse(input.occurredAt))) {
+                return { status: "rejected", reason: "code-memory occurredAt must be an ISO-8601 timestamp" };
+            }
+            const memoryId = `code-${identityHash(`${input.owner}\u0000${input.observationId}`)}`;
+            const sourceRefs = input.sourceRefs.map((ref) => Object.freeze({ kind: ref.kind, id: ref.id }));
+            const draft = buildMemoryAtomV1({
+                memoryId,
+                contractVersion: CONTRACT_VERSION,
+                schemaVersion: 1,
+                scope: "long-term",
+                retentionMode: input.retentionMode ?? "standard",
+                owner: input.owner,
+                profileId: "code-memory",
+                ...(input.suiteId === undefined ? {} : { suiteId: input.suiteId }),
+                retentionPolicyVersion: RETENTION_POLICY_VERSION,
+                memoryKind: "fact",
+                payload: {
+                    kind: input.kind,
+                    statement: input.statement,
+                    ...(input.detail === undefined ? {} : { detail: input.detail }),
+                },
+                occurredAt: input.occurredAt,
+                recordedAt: input.occurredAt,
+                sourceRefs,
+                observationId: input.observationId,
+                sessionRefs: [],
+                agentInstanceRefs: [],
+                projectRefs: input.project === undefined ? [] : [input.project],
+                subjectRefs: input.task === undefined ? [] : [input.task],
+                facets: [{ namespace: "code-memory", schemaVersion: 1, key: "kind", value: input.kind }],
+                relations: [],
+                confidence: 1,
+                importance: 0.5,
+                evidenceClass: evidenceClassOf(input.kind),
+                contentRevision: `c-${identityHash(JSON.stringify([input.statement, input.detail ?? null]))}`,
+                writeReason: `code-memory/${input.kind}`,
+            });
+            const observation = options.machine.observe({
+                owner: input.owner,
+                observationId: input.observationId,
+                draft,
+            });
+            // v8 ignore next -- recordFact 先本地校验并构造合法 draft，observe 不可能拒绝
+            if (observation.record.state === "rejected") {
+                // v8 ignore next -- 同上：该分支不可达
+                return { status: "rejected", reason: observation.record.rejectedReason ?? "rejected" };
+            }
+            if (observation.record.state === "committed" && observation.record.committed) {
+                return { status: "deduped", memoryId: observation.record.committed.atom.memoryId };
+            }
+            const committed = options.machine.accept(input.observationId, input.owner);
+            return { status: "recorded", memoryId: committed.atom.memoryId, storeRevision: committed.storeRevision };
+        },
+        recall(input) {
+            const budgets = resolveMemoryRecallBudgets({
+                requested: input.requestedBudgets,
+                policyDefaults: options.policyDefaults,
+                hostLimits: options.hostLimits,
+            }).budgets;
+            const page = options.index.query({
+                owner: input.owner,
+                ...(input.project === undefined ? {} : { projects: [input.project] }),
+                ...(input.task === undefined ? {} : { tasks: [input.task] }),
+                ...(input.kind === undefined
+                    ? { facets: [{ namespace: "code-memory" }] }
+                    : { facets: [{ namespace: "code-memory", key: "kind", value: input.kind }] }),
+            });
+            return buildMemoryRecallPacketV1({
+                operationId: `code-memory-recall-${identityHash(JSON.stringify([input.owner, input.kind ?? "*", input.project ?? "*", input.task ?? "*"]))}`,
+                candidates: page.items.map((item) => item.atom),
+                budgets,
+            });
+        },
+    };
+}
+//# sourceMappingURL=code-memory.js.map

package/dist/memory/code-memory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"code-memory.js","sourceRoot":"","sources":["../../src/memory/code-memory.ts"],"names":[],"mappings":"AAaA,OAAO,EAAE,iBAAiB,EAA6C,MAAM,iBAAiB,CAAC;AAE/F,OAAO,EACN,yBAAyB,EAGzB,0BAA0B,GAC1B,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,0BAA0B,EAAE,MAAM,eAAe,CAAC;AAuD3D,MAAM,gBAAgB,GAAG,0BAA0B,CAAC;AACpD,MAAM,wBAAwB,GAAG,aAAa,CAAC;AAE/C,qEAAmE;AACnE,SAAS,YAAY,CAAC,KAAa,EAAU;IAC5C,IAAI,IAAI,GAAG,UAAU,CAAC;IACtB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QACtD,IAAI,IAAI,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;AAAA,CACjC;AAED,MAAM,UAAU,qBAAqB,CAAC,OAKrC,EAAqB;IACrB,MAAM,eAAe,GAAG,CAAC,IAA0B,EAAE,EAAE,CACtD,IAAI,KAAK,WAAW,IAAI,IAAI,KAAK,KAAK;QACrC,CAAC,CAAE,cAAwB;QAC3B,CAAC,CAAC,IAAI,KAAK,YAAY;YACtB,CAAC,CAAE,SAAmB;YACtB,CAAC,CAAE,UAAoB,CAAC;IAE3B,OAAO;QACN,UAAU,CAAC,KAAK,EAAE;YACjB,IAAI,OAAO,KAAK,CAAC,SAAS,KAAK,QAAQ,IAAI,KAAK,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAChF,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,kDAAkD,EAAE,CAAC;YAC3F,CAAC;YACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACvE,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,yDAAyD,EAAE,CAAC;YAClG,CAAC;YACD,IAAI,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC;gBAChD,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,sDAAsD,EAAE,CAAC;YAC/F,CAAC;YACD,MAAM,QAAQ,GAAG,QAAQ,YAAY,CAAC,GAAG,KAAK,CAAC,KAAK,SAAS,KAAK,CAAC,aAAa,EAAE,CAAC,EAAE,CAAC;YACtF,MAAM,UAAU,GAAiC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAC7E,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAC7C,CAAC;YACF,MAAM,KAAK,GAAG,iBAAiB,CAAC;gBAC/B,QAAQ;gBACR,eAAe,EAAE,gBAAgB;gBACjC,aAAa,EAAE,CAAC;gBAChB,KAAK,EAAE,WAAW;gBAClB,aAAa,EAAE,KAAK,CAAC,aAAa,IAAI,UAAU;gBAChD,KAAK,EAAE,KAAK,CAAC,KAAK;gBAClB,SAAS,EAAE,aAAa;gBACxB,GAAG,CAAC,KAAK,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,CAAC;gBAClE,sBAAsB,EAAE,wBAAwB;gBAChD,UAAU,EAAE,MAAM;gBAClB,OAAO,EAAE;oBACR,IAAI,EAAE,KAAK,CAAC,IAAI;oBAChB,SAAS,EAAE,KAAK,CAAC,SAAS;oBAC1B,GAAG,CAAC,KAAK,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC;iBAClD;gBACd,UAAU,EAAE,KAAK,CAAC,UAAU;gBAC5B,UAAU,EAAE,KAAK,CAAC,UAAU;gBAC5B,UAAU;gBACV,aAAa,EAAE,KAAK,CAAC,aAAa;gBAClC,WAAW,EAAE,EAAE;gBACf,iBAAiB,EAAE,EAAE;gBACrB,WAAW,EAAE,KAAK,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC;gBAC/D,WAAW,EAAE,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC;gBACzD,MAAM,EAAE,CAAC,EAAE,SAAS,EAAE,aAAa,EAAE,aAAa,EAAE,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC;gBACxF,SAAS,EAAE,EAAE;gBACb,UAAU,EAAE,CAAC;gBACb,UAAU,EAAE,GAAG;gBACf,aAAa,EAAE,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC;gBAC1C,eAAe,EAAE,KAAK,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE;gBAC7F,WAAW,EAAE,eAAe,KAAK,CAAC,IAAI,EAAE;aACxC,CAAC,CAAC;YAEH,MAAM,WAAW,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC;gBAC3C,KAAK,EAAE,KAAK,CAAC,KAAK;gBAClB,aAAa,EAAE,KAAK,CAAC,aAAa;gBAClC,KAAK;aACL,CAAC,CAAC;YACH,8FAA8D;YAC9D,IAAI,WAAW,CAAC,MAAM,CAAC,KAAK,KAAK,UAAU,EAAE,CAAC;gBAC7C,gDAA8B;gBAC9B,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,WAAW,CAAC,MAAM,CAAC,cAAc,IAAI,UAAU,EAAE,CAAC;YACxF,CAAC;YACD,IAAI,WAAW,CAAC,MAAM,CAAC,KAAK,KAAK,WAAW,IAAI,WAAW,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC;gBAC9E,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,WAAW,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACpF,CAAC;YACD,MAAM,SAAS,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,aAAa,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;YAC3E,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,SAAS,CAAC,IAAI,CAAC,QAAQ,EAAE,aAAa,EAAE,SAAS,CAAC,aAAa,EAAE,CAAC;QAAA,CACzG;QACD,MAAM,CAAC,KAAK,EAAE;YACb,MAAM,OAAO,GAAG,0BAA0B,CAAC;gBAC1C,SAAS,EAAE,KAAK,CAAC,gBAAgB;gBACjC,cAAc,EAAE,OAAO,CAAC,cAAc;gBACtC,UAAU,EAAE,OAAO,CAAC,UAAU;aAC9B,CAAC,CAAC,OAAO,CAAC;YACX,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC;gBAChC,KAAK,EAAE,KAAK,CAAC,KAAK;gBAClB,GAAG,CAAC,KAAK,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;gBACrE,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC5D,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,SAAS;oBAC3B,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,SAAS,EAAE,aAAa,EAAE,CAAC,EAAE;oBAC5C,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,SAAS,EAAE,aAAa,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;aAC9E,CAAC,CAAC;YACH,OAAO,yBAAyB,CAAC;gBAChC,WAAW,EAAE,sBAAsB,YAAY,CAC9C,IAAI,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,IAAI,GAAG,EAAE,KAAK,CAAC,OAAO,IAAI,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC,CACzF,EAAE;gBACH,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC;gBAC/C,OAAO;aACP,CAAC,CAAC;QAAA,CACH;KACD,CAAC;AAAA,CACF","sourcesContent":["/**\n * code-memory agent (2.4a) — project facts, decisions, and tool/test facts\n * recorded through the 1C Memory Foundation.\n *\n * Selective writes go through the candidate machine (validation, idempotent\n * `(owner, observationId)` dedupe, explicit rejection); recall reuses the\n * bounded recall index and packet. Every fact carries its source references,\n * a `code-memory:kind` facet, and Foundation-managed scope/revisions, so a\n * plain store replay restores full recall. Preference envelopes, complex\n * semantics, and advanced indexing are later slices (2.4c/d).\n */\nimport type { JsonValue } from \"@agent-forge/plugin-sdk\";\nimport type { MemoryCandidateMachineV1 } from \"./candidates.ts\";\nimport { buildMemoryAtomV1, type MemoryAtomV1, type MemorySourceRefV1 } from \"./foundation.ts\";\nimport type { MemoryRecallPacketV1 } from \"./recall-packet.ts\";\nimport {\n\tbuildMemoryRecallPacketV1,\n\ttype MemoryRecallBudgetContributionV1,\n\ttype MemoryRecallBudgetsV1,\n\tresolveMemoryRecallBudgets,\n} from \"./recall-packet.ts\";\nimport { MEMORY_CONTRACT_VERSION_V2 } from \"./transfer.ts\";\n\n/** The slice of the 1C recall index the code-memory agent depends on. */\nexport interface MemoryRecallIndexShimV1 {\n\tquery(query: {\n\t\treadonly owner: string;\n\t\treadonly projects?: readonly string[];\n\t\treadonly tasks?: readonly string[];\n\t\treadonly facets?: readonly { readonly namespace: string; readonly key?: string; readonly value?: string }[];\n\t}): { readonly items: readonly { readonly atom: MemoryAtomV1<JsonValue> }[]; readonly total: number };\n}\n\nexport type CodeMemoryFactKindV1 = \"project\" | \"decision\" | \"tool_test\" | \"bug\" | \"task\" | \"compaction\";\n\nexport interface CodeMemoryFactInputV1 {\n\treadonly owner: string;\n\treadonly kind: CodeMemoryFactKindV1;\n\t/** Human-readable fact statement; must be non-empty. */\n\treadonly statement: string;\n\t/** Structured detail (command, exit code, test counts, decision options…). */\n\treadonly detail?: JsonValue;\n\treadonly project?: string;\n\treadonly task?: string;\n\t/** Where the fact came from (tool result, file, user answer…); at least one required. */\n\treadonly sourceRefs: readonly { readonly kind: MemorySourceRefV1[\"kind\"]; readonly id: string }[];\n\treadonly occurredAt: string;\n\t/** Idempotency identity together with `owner`. */\n\treadonly observationId: string;\n\treadonly retentionMode?: \"short\" | \"standard\" | \"long\" | \"permanent\";\n\t/**\n\t * Suite (方案) to bind the fact to (方案系统设计 §6.1, M5). When absent the\n\t * fact stays suite-less: readable through suite-unscoped queries only —\n\t * suite-scoped reads skip it fail-safe.\n\t */\n\treadonly suiteId?: string;\n}\n\nexport type CodeMemoryRecordResultV1 =\n\t| { readonly status: \"recorded\"; readonly memoryId: string; readonly storeRevision: number }\n\t| { readonly status: \"deduped\"; readonly memoryId: string }\n\t| { readonly status: \"rejected\"; readonly reason: string };\n\nexport interface CodeMemoryRecallInputV1 {\n\treadonly owner: string;\n\treadonly kind?: CodeMemoryFactKindV1;\n\treadonly project?: string;\n\treadonly task?: string;\n\treadonly requestedBudgets?: MemoryRecallBudgetContributionV1;\n}\n\nexport interface CodeMemoryAgentV1 {\n\trecordFact(input: CodeMemoryFactInputV1): CodeMemoryRecordResultV1;\n\trecall(input: CodeMemoryRecallInputV1): MemoryRecallPacketV1;\n}\n\nconst CONTRACT_VERSION = MEMORY_CONTRACT_VERSION_V2;\nconst RETENTION_POLICY_VERSION = \"retention@1\";\n\n/** FNV-1a 32-bit — deterministic identity from the given value. */\nfunction identityHash(value: string): string {\n\tlet hash = 0x811c9dc5;\n\tfor (let index = 0; index < value.length; index += 1) {\n\t\thash ^= value.charCodeAt(index);\n\t\thash = Math.imul(hash, 0x01000193);\n\t}\n\treturn (hash >>> 0).toString(36);\n}\n\nexport function createCodeMemoryAgent(options: {\n\treadonly machine: MemoryCandidateMachineV1;\n\treadonly index: MemoryRecallIndexShimV1;\n\treadonly policyDefaults: MemoryRecallBudgetsV1;\n\treadonly hostLimits: MemoryRecallBudgetsV1;\n}): CodeMemoryAgentV1 {\n\tconst evidenceClassOf = (kind: CodeMemoryFactKindV1) =>\n\t\tkind === \"tool_test\" || kind === \"bug\"\n\t\t\t? (\"tool_or_test\" as const)\n\t\t\t: kind === \"compaction\"\n\t\t\t\t? (\"derived\" as const)\n\t\t\t\t: (\"explicit\" as const);\n\n\treturn {\n\t\trecordFact(input) {\n\t\t\tif (typeof input.statement !== \"string\" || input.statement.trim().length === 0) {\n\t\t\t\treturn { status: \"rejected\", reason: \"code-memory statement must be a non-empty string\" };\n\t\t\t}\n\t\t\tif (!Array.isArray(input.sourceRefs) || input.sourceRefs.length === 0) {\n\t\t\t\treturn { status: \"rejected\", reason: \"code-memory facts require at least one source reference\" };\n\t\t\t}\n\t\t\tif (Number.isNaN(Date.parse(input.occurredAt))) {\n\t\t\t\treturn { status: \"rejected\", reason: \"code-memory occurredAt must be an ISO-8601 timestamp\" };\n\t\t\t}\n\t\t\tconst memoryId = `code-${identityHash(`${input.owner}\\u0000${input.observationId}`)}`;\n\t\t\tconst sourceRefs: readonly MemorySourceRefV1[] = input.sourceRefs.map((ref) =>\n\t\t\t\tObject.freeze({ kind: ref.kind, id: ref.id }),\n\t\t\t);\n\t\t\tconst draft = buildMemoryAtomV1({\n\t\t\t\tmemoryId,\n\t\t\t\tcontractVersion: CONTRACT_VERSION,\n\t\t\t\tschemaVersion: 1,\n\t\t\t\tscope: \"long-term\",\n\t\t\t\tretentionMode: input.retentionMode ?? \"standard\",\n\t\t\t\towner: input.owner,\n\t\t\t\tprofileId: \"code-memory\",\n\t\t\t\t...(input.suiteId === undefined ? {} : { suiteId: input.suiteId }),\n\t\t\t\tretentionPolicyVersion: RETENTION_POLICY_VERSION,\n\t\t\t\tmemoryKind: \"fact\",\n\t\t\t\tpayload: {\n\t\t\t\t\tkind: input.kind,\n\t\t\t\t\tstatement: input.statement,\n\t\t\t\t\t...(input.detail === undefined ? {} : { detail: input.detail }),\n\t\t\t\t} as JsonValue,\n\t\t\t\toccurredAt: input.occurredAt,\n\t\t\t\trecordedAt: input.occurredAt,\n\t\t\t\tsourceRefs,\n\t\t\t\tobservationId: input.observationId,\n\t\t\t\tsessionRefs: [],\n\t\t\t\tagentInstanceRefs: [],\n\t\t\t\tprojectRefs: input.project === undefined ? [] : [input.project],\n\t\t\t\tsubjectRefs: input.task === undefined ? [] : [input.task],\n\t\t\t\tfacets: [{ namespace: \"code-memory\", schemaVersion: 1, key: \"kind\", value: input.kind }],\n\t\t\t\trelations: [],\n\t\t\t\tconfidence: 1,\n\t\t\t\timportance: 0.5,\n\t\t\t\tevidenceClass: evidenceClassOf(input.kind),\n\t\t\t\tcontentRevision: `c-${identityHash(JSON.stringify([input.statement, input.detail ?? null]))}`,\n\t\t\t\twriteReason: `code-memory/${input.kind}`,\n\t\t\t});\n\n\t\t\tconst observation = options.machine.observe({\n\t\t\t\towner: input.owner,\n\t\t\t\tobservationId: input.observationId,\n\t\t\t\tdraft,\n\t\t\t});\n\t\t\t// v8 ignore next -- recordFact 先本地校验并构造合法 draft，observe 不可能拒绝\n\t\t\tif (observation.record.state === \"rejected\") {\n\t\t\t\t// v8 ignore next -- 同上：该分支不可达\n\t\t\t\treturn { status: \"rejected\", reason: observation.record.rejectedReason ?? \"rejected\" };\n\t\t\t}\n\t\t\tif (observation.record.state === \"committed\" && observation.record.committed) {\n\t\t\t\treturn { status: \"deduped\", memoryId: observation.record.committed.atom.memoryId };\n\t\t\t}\n\t\t\tconst committed = options.machine.accept(input.observationId, input.owner);\n\t\t\treturn { status: \"recorded\", memoryId: committed.atom.memoryId, storeRevision: committed.storeRevision };\n\t\t},\n\t\trecall(input) {\n\t\t\tconst budgets = resolveMemoryRecallBudgets({\n\t\t\t\trequested: input.requestedBudgets,\n\t\t\t\tpolicyDefaults: options.policyDefaults,\n\t\t\t\thostLimits: options.hostLimits,\n\t\t\t}).budgets;\n\t\t\tconst page = options.index.query({\n\t\t\t\towner: input.owner,\n\t\t\t\t...(input.project === undefined ? {} : { projects: [input.project] }),\n\t\t\t\t...(input.task === undefined ? {} : { tasks: [input.task] }),\n\t\t\t\t...(input.kind === undefined\n\t\t\t\t\t? { facets: [{ namespace: \"code-memory\" }] }\n\t\t\t\t\t: { facets: [{ namespace: \"code-memory\", key: \"kind\", value: input.kind }] }),\n\t\t\t});\n\t\t\treturn buildMemoryRecallPacketV1({\n\t\t\t\toperationId: `code-memory-recall-${identityHash(\n\t\t\t\t\tJSON.stringify([input.owner, input.kind ?? \"*\", input.project ?? \"*\", input.task ?? \"*\"]),\n\t\t\t\t)}`,\n\t\t\t\tcandidates: page.items.map((item) => item.atom),\n\t\t\t\tbudgets,\n\t\t\t});\n\t\t},\n\t};\n}\n"]}

package/dist/memory/compaction-sequencer.d.ts

@@ -0,0 +1,63 @@
+/**
+ * Memory Foundation — memory commit ordering across compaction (1C.7a).
+ *
+ * Adapts memory commits to the 1B.3c revision-checked session/context commit:
+ * - Memory is committed BEFORE compaction; a failed compaction can never
+ *   delete already-committed memories.
+ * - Commits that arrive DURING a compaction are queued (projection-pending)
+ *   and replayed in order when the compaction settles — success or failure.
+ * - The compaction commit and every memory commit carry an operationId and
+ *   the context revision they are causally bound to; the journal makes that
+ *   ordering observable.
+ * - After revoke/reload/dispose, late memory writes fail explicitly.
+ * - `abort` failure mode (D-027): the compaction failure is recorded and the
+ *   queued memories replay — degraded-visible marking belongs to the Profile
+ *   layer (2.x), not to this sequencer.
+ */
+import type { MemoryAtomV1 } from "./foundation.ts";
+import type { CommittedMemoryV1, MemoryStoreV1 } from "./store.ts";
+export type MemorySequencerStateV1 = "idle" | "compacting" | "revoked";
+export interface MemorySequencerJournalFactV1 {
+    readonly kind: "memory_commit" | "compaction_started" | "compaction_completed" | "compaction_failed";
+    readonly operationId: string;
+    readonly contextRevision: number;
+    readonly memoryId?: string;
+    readonly reason?: string;
+    readonly queued?: boolean;
+    readonly replayed?: boolean;
+}
+export interface MemorySequencedCommitV1 {
+    readonly committed: CommittedMemoryV1;
+    readonly contextRevision: number;
+    readonly operationId: string;
+    /** True when the commit was queued during a compaction and replayed after. */
+    readonly replayed?: boolean;
+    /** True when the commit is held until the running compaction settles. */
+    readonly projectionPending?: boolean;
+}
+export interface MemoryCompactionSequencerV1 {
+    commitMemory(input: {
+        readonly atom: MemoryAtomV1;
+        readonly operationId: string;
+    }): MemorySequencedCommitV1;
+    beginCompaction(input: {
+        readonly operationId: string;
+        readonly expectedContextRevision: number;
+    }): void;
+    completeCompaction(input: {
+        readonly operationId: string;
+        readonly newContextRevision?: number;
+    }): number;
+    failCompaction(input: {
+        readonly operationId: string;
+        readonly reason: string;
+    }): number;
+    setRevoked(reason: string): void;
+    readonly contextRevision: number;
+    pendingCommits(): number;
+    journal(): readonly MemorySequencerJournalFactV1[];
+}
+export declare function createMemoryCompactionSequencer(options: {
+    readonly store: MemoryStoreV1;
+}): MemoryCompactionSequencerV1;
+//# sourceMappingURL=compaction-sequencer.d.ts.map

package/dist/memory/compaction-sequencer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compaction-sequencer.d.ts","sourceRoot":"","sources":["../../src/memory/compaction-sequencer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AACH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAEpD,OAAO,KAAK,EAAE,iBAAiB,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAEnE,MAAM,MAAM,sBAAsB,GAAG,MAAM,GAAG,YAAY,GAAG,SAAS,CAAC;AAEvE,MAAM,WAAW,4BAA4B;IAC5C,QAAQ,CAAC,IAAI,EAAE,eAAe,GAAG,oBAAoB,GAAG,sBAAsB,GAAG,mBAAmB,CAAC;IACrG,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,QAAQ,CAAC,EAAE,OAAO,CAAC;CAC5B;AAED,MAAM,WAAW,uBAAuB;IACvC,QAAQ,CAAC,SAAS,EAAE,iBAAiB,CAAC;IACtC,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,8EAA8E;IAC9E,QAAQ,CAAC,QAAQ,CAAC,EAAE,OAAO,CAAC;IAC5B,yEAAyE;IACzE,QAAQ,CAAC,iBAAiB,CAAC,EAAE,OAAO,CAAC;CACrC;AAED,MAAM,WAAW,2BAA2B;IAC3C,YAAY,CAAC,KAAK,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAC;QAAC,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAA;KAAE,GAAG,uBAAuB,CAAC;IAC5G,eAAe,CAAC,KAAK,EAAE;QAAE,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,uBAAuB,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAC;IACzG,kBAAkB,CAAC,KAAK,EAAE;QAAE,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,kBAAkB,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,MAAM,CAAC;IAC1G,cAAc,CAAC,KAAK,EAAE;QAAE,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;KAAE,GAAG,MAAM,CAAC;IACzF,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACjC,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,cAAc,IAAI,MAAM,CAAC;IACzB,OAAO,IAAI,SAAS,4BAA4B,EAAE,CAAC;CACnD;AAED,wBAAgB,+BAA+B,CAAC,OAAO,EAAE;IACxD,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC;CAC9B,GAAG,2BAA2B,CAwI9B","sourcesContent":["/**\n * Memory Foundation — memory commit ordering across compaction (1C.7a).\n *\n * Adapts memory commits to the 1B.3c revision-checked session/context commit:\n * - Memory is committed BEFORE compaction; a failed compaction can never\n *   delete already-committed memories.\n * - Commits that arrive DURING a compaction are queued (projection-pending)\n *   and replayed in order when the compaction settles — success or failure.\n * - The compaction commit and every memory commit carry an operationId and\n *   the context revision they are causally bound to; the journal makes that\n *   ordering observable.\n * - After revoke/reload/dispose, late memory writes fail explicitly.\n * - `abort` failure mode (D-027): the compaction failure is recorded and the\n *   queued memories replay — degraded-visible marking belongs to the Profile\n *   layer (2.x), not to this sequencer.\n */\nimport type { MemoryAtomV1 } from \"./foundation.ts\";\nimport { validateMemoryAtomV1 } from \"./foundation.ts\";\nimport type { CommittedMemoryV1, MemoryStoreV1 } from \"./store.ts\";\n\nexport type MemorySequencerStateV1 = \"idle\" | \"compacting\" | \"revoked\";\n\nexport interface MemorySequencerJournalFactV1 {\n\treadonly kind: \"memory_commit\" | \"compaction_started\" | \"compaction_completed\" | \"compaction_failed\";\n\treadonly operationId: string;\n\treadonly contextRevision: number;\n\treadonly memoryId?: string;\n\treadonly reason?: string;\n\treadonly queued?: boolean;\n\treadonly replayed?: boolean;\n}\n\nexport interface MemorySequencedCommitV1 {\n\treadonly committed: CommittedMemoryV1;\n\treadonly contextRevision: number;\n\treadonly operationId: string;\n\t/** True when the commit was queued during a compaction and replayed after. */\n\treadonly replayed?: boolean;\n\t/** True when the commit is held until the running compaction settles. */\n\treadonly projectionPending?: boolean;\n}\n\nexport interface MemoryCompactionSequencerV1 {\n\tcommitMemory(input: { readonly atom: MemoryAtomV1; readonly operationId: string }): MemorySequencedCommitV1;\n\tbeginCompaction(input: { readonly operationId: string; readonly expectedContextRevision: number }): void;\n\tcompleteCompaction(input: { readonly operationId: string; readonly newContextRevision?: number }): number;\n\tfailCompaction(input: { readonly operationId: string; readonly reason: string }): number;\n\tsetRevoked(reason: string): void;\n\treadonly contextRevision: number;\n\tpendingCommits(): number;\n\tjournal(): readonly MemorySequencerJournalFactV1[];\n}\n\nexport function createMemoryCompactionSequencer(options: {\n\treadonly store: MemoryStoreV1;\n}): MemoryCompactionSequencerV1 {\n\tconst store = options.store;\n\tlet state: MemorySequencerStateV1 = \"idle\";\n\tlet contextRevision = 1;\n\tlet revokedReason: string | undefined;\n\tlet activeCompactionOperationId: string | undefined;\n\tconst pending: Array<{ atom: MemoryAtomV1; operationId: string }> = [];\n\tconst journalLog: MemorySequencerJournalFactV1[] = [];\n\n\tconst assertNotRevoked = (): void => {\n\t\tif (state === \"revoked\") {\n\t\t\t// v8 ignore next -- setRevoked 必带 reason\n\t\t\tthrow new Error(`Memory sequencer is revoked: ${revokedReason ?? \"revoked\"}; late writes must fail`);\n\t\t}\n\t};\n\n\tconst commitNow = (\n\t\tatom: MemoryAtomV1,\n\t\toperationId: string,\n\t\tflags: { replayed?: boolean } = {},\n\t): MemorySequencedCommitV1 => {\n\t\tconst validated = validateMemoryAtomV1(atom);\n\t\tconst committed = store.commit(validated);\n\t\tconst fact: MemorySequencerJournalFactV1 = Object.freeze({\n\t\t\tkind: \"memory_commit\",\n\t\t\toperationId,\n\t\t\tcontextRevision,\n\t\t\tmemoryId: committed.atom.memoryId,\n\t\t\t...(flags.replayed === undefined ? {} : { replayed: true }),\n\t\t});\n\t\tjournalLog.push(fact);\n\t\treturn Object.freeze({\n\t\t\tcommitted,\n\t\t\tcontextRevision,\n\t\t\toperationId,\n\t\t\t...(flags.replayed === undefined ? {} : { replayed: true }),\n\t\t});\n\t};\n\n\tconst replayPending = (compactionOperationId: string, failureReason?: string): number => {\n\t\tlet replayed = 0;\n\t\twhile (pending.length > 0) {\n\t\t\tconst entry = pending.shift()!;\n\t\t\tcommitNow(entry.atom, entry.operationId, { replayed: true });\n\t\t\treplayed += 1;\n\t\t}\n\t\tjournalLog.push(\n\t\t\tObject.freeze({\n\t\t\t\tkind: failureReason === undefined ? \"compaction_completed\" : \"compaction_failed\",\n\t\t\t\toperationId: compactionOperationId,\n\t\t\t\tcontextRevision,\n\t\t\t\t...(failureReason === undefined ? {} : { reason: failureReason }),\n\t\t\t\t...(replayed > 0 ? { queued: true } : {}),\n\t\t\t}),\n\t\t);\n\t\treturn replayed;\n\t};\n\n\treturn {\n\t\tget contextRevision() {\n\t\t\treturn contextRevision;\n\t\t},\n\t\tcommitMemory({ atom, operationId }) {\n\t\t\tassertNotRevoked();\n\t\t\tassertNonEmptyString(operationId, \"operationId\");\n\t\t\tif (state === \"compacting\") {\n\t\t\t\tconst validated = validateMemoryAtomV1(atom);\n\t\t\t\tpending.push({ atom: validated, operationId });\n\t\t\t\tjournalLog.push(\n\t\t\t\t\tObject.freeze({\n\t\t\t\t\t\tkind: \"memory_commit\",\n\t\t\t\t\t\toperationId,\n\t\t\t\t\t\tcontextRevision,\n\t\t\t\t\t\tmemoryId: validated.memoryId,\n\t\t\t\t\t\tqueued: true,\n\t\t\t\t\t}),\n\t\t\t\t);\n\t\t\t\treturn Object.freeze({\n\t\t\t\t\tcommitted: undefined as never,\n\t\t\t\t\tcontextRevision,\n\t\t\t\t\toperationId,\n\t\t\t\t\tprojectionPending: true,\n\t\t\t\t});\n\t\t\t}\n\t\t\treturn commitNow(atom, operationId);\n\t\t},\n\t\tbeginCompaction({ operationId, expectedContextRevision }) {\n\t\t\tassertNotRevoked();\n\t\t\tassertNonEmptyString(operationId, \"compaction operationId\");\n\t\t\tif (state === \"compacting\") {\n\t\t\t\tthrow new Error(`A compaction is already running: ${activeCompactionOperationId}`);\n\t\t\t}\n\t\t\tif (expectedContextRevision !== contextRevision) {\n\t\t\t\tthrow new Error(\n\t\t\t\t\t`Context revision mismatch: expected ${expectedContextRevision}, current ${contextRevision} (stale compaction input)`,\n\t\t\t\t);\n\t\t\t}\n\t\t\tstate = \"compacting\";\n\t\t\tactiveCompactionOperationId = operationId;\n\t\t\tjournalLog.push(Object.freeze({ kind: \"compaction_started\", operationId, contextRevision }));\n\t\t},\n\t\tcompleteCompaction({ operationId, newContextRevision }) {\n\t\t\tassertNotRevoked();\n\t\t\tif (state !== \"compacting\" || activeCompactionOperationId !== operationId) {\n\t\t\t\tthrow new Error(`No running compaction with operationId ${operationId}`);\n\t\t\t}\n\t\t\tcontextRevision = newContextRevision ?? contextRevision + 1;\n\t\t\tstate = \"idle\";\n\t\t\tconst replayed = replayPending(operationId);\n\t\t\tactiveCompactionOperationId = undefined;\n\t\t\treturn replayed;\n\t\t},\n\t\tfailCompaction({ operationId, reason }) {\n\t\t\tassertNotRevoked();\n\t\t\tif (state !== \"compacting\" || activeCompactionOperationId !== operationId) {\n\t\t\t\tthrow new Error(`No running compaction with operationId ${operationId}`);\n\t\t\t}\n\t\t\tstate = \"idle\";\n\t\t\t// Abort failure mode (D-027): the compaction failed, but memories that\n\t\t\t// were committed or queued during it are replayed in order — a failed\n\t\t\t// compaction never deletes committed facts.\n\t\t\tconst replayed = replayPending(operationId, reason);\n\t\t\tactiveCompactionOperationId = undefined;\n\t\t\treturn replayed;\n\t\t},\n\t\tsetRevoked(reason) {\n\t\t\tstate = \"revoked\";\n\t\t\trevokedReason = reason;\n\t\t},\n\t\tpendingCommits() {\n\t\t\treturn pending.length;\n\t\t},\n\t\tjournal() {\n\t\t\treturn Object.freeze([...journalLog]);\n\t\t},\n\t};\n}\n\nfunction assertNonEmptyString(value: unknown, label: string): asserts value is string {\n\tif (typeof value !== \"string\" || value.trim().length === 0) throw new Error(`${label} must be a non-empty string`);\n}\n"]}

package/dist/memory/compaction-sequencer.js

@@ -0,0 +1,129 @@
+import { validateMemoryAtomV1 } from "./foundation.js";
+export function createMemoryCompactionSequencer(options) {
+    const store = options.store;
+    let state = "idle";
+    let contextRevision = 1;
+    let revokedReason;
+    let activeCompactionOperationId;
+    const pending = [];
+    const journalLog = [];
+    const assertNotRevoked = () => {
+        if (state === "revoked") {
+            // v8 ignore next -- setRevoked 必带 reason
+            throw new Error(`Memory sequencer is revoked: ${revokedReason ?? "revoked"}; late writes must fail`);
+        }
+    };
+    const commitNow = (atom, operationId, flags = {}) => {
+        const validated = validateMemoryAtomV1(atom);
+        const committed = store.commit(validated);
+        const fact = Object.freeze({
+            kind: "memory_commit",
+            operationId,
+            contextRevision,
+            memoryId: committed.atom.memoryId,
+            ...(flags.replayed === undefined ? {} : { replayed: true }),
+        });
+        journalLog.push(fact);
+        return Object.freeze({
+            committed,
+            contextRevision,
+            operationId,
+            ...(flags.replayed === undefined ? {} : { replayed: true }),
+        });
+    };
+    const replayPending = (compactionOperationId, failureReason) => {
+        let replayed = 0;
+        while (pending.length > 0) {
+            const entry = pending.shift();
+            commitNow(entry.atom, entry.operationId, { replayed: true });
+            replayed += 1;
+        }
+        journalLog.push(Object.freeze({
+            kind: failureReason === undefined ? "compaction_completed" : "compaction_failed",
+            operationId: compactionOperationId,
+            contextRevision,
+            ...(failureReason === undefined ? {} : { reason: failureReason }),
+            ...(replayed > 0 ? { queued: true } : {}),
+        }));
+        return replayed;
+    };
+    return {
+        get contextRevision() {
+            return contextRevision;
+        },
+        commitMemory({ atom, operationId }) {
+            assertNotRevoked();
+            assertNonEmptyString(operationId, "operationId");
+            if (state === "compacting") {
+                const validated = validateMemoryAtomV1(atom);
+                pending.push({ atom: validated, operationId });
+                journalLog.push(Object.freeze({
+                    kind: "memory_commit",
+                    operationId,
+                    contextRevision,
+                    memoryId: validated.memoryId,
+                    queued: true,
+                }));
+                return Object.freeze({
+                    committed: undefined,
+                    contextRevision,
+                    operationId,
+                    projectionPending: true,
+                });
+            }
+            return commitNow(atom, operationId);
+        },
+        beginCompaction({ operationId, expectedContextRevision }) {
+            assertNotRevoked();
+            assertNonEmptyString(operationId, "compaction operationId");
+            if (state === "compacting") {
+                throw new Error(`A compaction is already running: ${activeCompactionOperationId}`);
+            }
+            if (expectedContextRevision !== contextRevision) {
+                throw new Error(`Context revision mismatch: expected ${expectedContextRevision}, current ${contextRevision} (stale compaction input)`);
+            }
+            state = "compacting";
+            activeCompactionOperationId = operationId;
+            journalLog.push(Object.freeze({ kind: "compaction_started", operationId, contextRevision }));
+        },
+        completeCompaction({ operationId, newContextRevision }) {
+            assertNotRevoked();
+            if (state !== "compacting" || activeCompactionOperationId !== operationId) {
+                throw new Error(`No running compaction with operationId ${operationId}`);
+            }
+            contextRevision = newContextRevision ?? contextRevision + 1;
+            state = "idle";
+            const replayed = replayPending(operationId);
+            activeCompactionOperationId = undefined;
+            return replayed;
+        },
+        failCompaction({ operationId, reason }) {
+            assertNotRevoked();
+            if (state !== "compacting" || activeCompactionOperationId !== operationId) {
+                throw new Error(`No running compaction with operationId ${operationId}`);
+            }
+            state = "idle";
+            // Abort failure mode (D-027): the compaction failed, but memories that
+            // were committed or queued during it are replayed in order — a failed
+            // compaction never deletes committed facts.
+            const replayed = replayPending(operationId, reason);
+            activeCompactionOperationId = undefined;
+            return replayed;
+        },
+        setRevoked(reason) {
+            state = "revoked";
+            revokedReason = reason;
+        },
+        pendingCommits() {
+            return pending.length;
+        },
+        journal() {
+            return Object.freeze([...journalLog]);
+        },
+    };
+}
+function assertNonEmptyString(value, label) {
+    if (typeof value !== "string" || value.trim().length === 0)
+        throw new Error(`${label} must be a non-empty string`);
+}
+//# sourceMappingURL=compaction-sequencer.js.map

package/dist/memory/compaction-sequencer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compaction-sequencer.js","sourceRoot":"","sources":["../../src/memory/compaction-sequencer.ts"],"names":[],"mappings":"AAiBA,OAAO,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AAoCvD,MAAM,UAAU,+BAA+B,CAAC,OAE/C,EAA+B;IAC/B,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;IAC5B,IAAI,KAAK,GAA2B,MAAM,CAAC;IAC3C,IAAI,eAAe,GAAG,CAAC,CAAC;IACxB,IAAI,aAAiC,CAAC;IACtC,IAAI,2BAA+C,CAAC;IACpD,MAAM,OAAO,GAAuD,EAAE,CAAC;IACvE,MAAM,UAAU,GAAmC,EAAE,CAAC;IAEtD,MAAM,gBAAgB,GAAG,GAAS,EAAE,CAAC;QACpC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACzB,6CAAyC;YACzC,MAAM,IAAI,KAAK,CAAC,gCAAgC,aAAa,IAAI,SAAS,yBAAyB,CAAC,CAAC;QACtG,CAAC;IAAA,CACD,CAAC;IAEF,MAAM,SAAS,GAAG,CACjB,IAAkB,EAClB,WAAmB,EACnB,KAAK,GAA2B,EAAE,EACR,EAAE,CAAC;QAC7B,MAAM,SAAS,GAAG,oBAAoB,CAAC,IAAI,CAAC,CAAC;QAC7C,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAC1C,MAAM,IAAI,GAAiC,MAAM,CAAC,MAAM,CAAC;YACxD,IAAI,EAAE,eAAe;YACrB,WAAW;YACX,eAAe;YACf,QAAQ,EAAE,SAAS,CAAC,IAAI,CAAC,QAAQ;YACjC,GAAG,CAAC,KAAK,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;SAC3D,CAAC,CAAC;QACH,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,OAAO,MAAM,CAAC,MAAM,CAAC;YACpB,SAAS;YACT,eAAe;YACf,WAAW;YACX,GAAG,CAAC,KAAK,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;SAC3D,CAAC,CAAC;IAAA,CACH,CAAC;IAEF,MAAM,aAAa,GAAG,CAAC,qBAA6B,EAAE,aAAsB,EAAU,EAAE,CAAC;QACxF,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3B,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,EAAG,CAAC;YAC/B,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,WAAW,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;YAC7D,QAAQ,IAAI,CAAC,CAAC;QACf,CAAC;QACD,UAAU,CAAC,IAAI,CACd,MAAM,CAAC,MAAM,CAAC;YACb,IAAI,EAAE,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,mBAAmB;YAChF,WAAW,EAAE,qBAAqB;YAClC,eAAe;YACf,GAAG,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC;YACjE,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACzC,CAAC,CACF,CAAC;QACF,OAAO,QAAQ,CAAC;IAAA,CAChB,CAAC;IAEF,OAAO;QACN,IAAI,eAAe,GAAG;YACrB,OAAO,eAAe,CAAC;QAAA,CACvB;QACD,YAAY,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,EAAE;YACnC,gBAAgB,EAAE,CAAC;YACnB,oBAAoB,CAAC,WAAW,EAAE,aAAa,CAAC,CAAC;YACjD,IAAI,KAAK,KAAK,YAAY,EAAE,CAAC;gBAC5B,MAAM,SAAS,GAAG,oBAAoB,CAAC,IAAI,CAAC,CAAC;gBAC7C,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC,CAAC;gBAC/C,UAAU,CAAC,IAAI,CACd,MAAM,CAAC,MAAM,CAAC;oBACb,IAAI,EAAE,eAAe;oBACrB,WAAW;oBACX,eAAe;oBACf,QAAQ,EAAE,SAAS,CAAC,QAAQ;oBAC5B,MAAM,EAAE,IAAI;iBACZ,CAAC,CACF,CAAC;gBACF,OAAO,MAAM,CAAC,MAAM,CAAC;oBACpB,SAAS,EAAE,SAAkB;oBAC7B,eAAe;oBACf,WAAW;oBACX,iBAAiB,EAAE,IAAI;iBACvB,CAAC,CAAC;YACJ,CAAC;YACD,OAAO,SAAS,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;QAAA,CACpC;QACD,eAAe,CAAC,EAAE,WAAW,EAAE,uBAAuB,EAAE,EAAE;YACzD,gBAAgB,EAAE,CAAC;YACnB,oBAAoB,CAAC,WAAW,EAAE,wBAAwB,CAAC,CAAC;YAC5D,IAAI,KAAK,KAAK,YAAY,EAAE,CAAC;gBAC5B,MAAM,IAAI,KAAK,CAAC,oCAAoC,2BAA2B,EAAE,CAAC,CAAC;YACpF,CAAC;YACD,IAAI,uBAAuB,KAAK,eAAe,EAAE,CAAC;gBACjD,MAAM,IAAI,KAAK,CACd,uCAAuC,uBAAuB,aAAa,eAAe,2BAA2B,CACrH,CAAC;YACH,CAAC;YACD,KAAK,GAAG,YAAY,CAAC;YACrB,2BAA2B,GAAG,WAAW,CAAC;YAC1C,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,oBAAoB,EAAE,WAAW,EAAE,eAAe,EAAE,CAAC,CAAC,CAAC;QAAA,CAC7F;QACD,kBAAkB,CAAC,EAAE,WAAW,EAAE,kBAAkB,EAAE,EAAE;YACvD,gBAAgB,EAAE,CAAC;YACnB,IAAI,KAAK,KAAK,YAAY,IAAI,2BAA2B,KAAK,WAAW,EAAE,CAAC;gBAC3E,MAAM,IAAI,KAAK,CAAC,0CAA0C,WAAW,EAAE,CAAC,CAAC;YAC1E,CAAC;YACD,eAAe,GAAG,kBAAkB,IAAI,eAAe,GAAG,CAAC,CAAC;YAC5D,KAAK,GAAG,MAAM,CAAC;YACf,MAAM,QAAQ,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;YAC5C,2BAA2B,GAAG,SAAS,CAAC;YACxC,OAAO,QAAQ,CAAC;QAAA,CAChB;QACD,cAAc,CAAC,EAAE,WAAW,EAAE,MAAM,EAAE,EAAE;YACvC,gBAAgB,EAAE,CAAC;YACnB,IAAI,KAAK,KAAK,YAAY,IAAI,2BAA2B,KAAK,WAAW,EAAE,CAAC;gBAC3E,MAAM,IAAI,KAAK,CAAC,0CAA0C,WAAW,EAAE,CAAC,CAAC;YAC1E,CAAC;YACD,KAAK,GAAG,MAAM,CAAC;YACf,uEAAuE;YACvE,wEAAsE;YACtE,4CAA4C;YAC5C,MAAM,QAAQ,GAAG,aAAa,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;YACpD,2BAA2B,GAAG,SAAS,CAAC;YACxC,OAAO,QAAQ,CAAC;QAAA,CAChB;QACD,UAAU,CAAC,MAAM,EAAE;YAClB,KAAK,GAAG,SAAS,CAAC;YAClB,aAAa,GAAG,MAAM,CAAC;QAAA,CACvB;QACD,cAAc,GAAG;YAChB,OAAO,OAAO,CAAC,MAAM,CAAC;QAAA,CACtB;QACD,OAAO,GAAG;YACT,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC;QAAA,CACtC;KACD,CAAC;AAAA,CACF;AAED,SAAS,oBAAoB,CAAC,KAAc,EAAE,KAAa,EAA2B;IACrF,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,6BAA6B,CAAC,CAAC;AAAA,CACnH","sourcesContent":["/**\n * Memory Foundation — memory commit ordering across compaction (1C.7a).\n *\n * Adapts memory commits to the 1B.3c revision-checked session/context commit:\n * - Memory is committed BEFORE compaction; a failed compaction can never\n *   delete already-committed memories.\n * - Commits that arrive DURING a compaction are queued (projection-pending)\n *   and replayed in order when the compaction settles — success or failure.\n * - The compaction commit and every memory commit carry an operationId and\n *   the context revision they are causally bound to; the journal makes that\n *   ordering observable.\n * - After revoke/reload/dispose, late memory writes fail explicitly.\n * - `abort` failure mode (D-027): the compaction failure is recorded and the\n *   queued memories replay — degraded-visible marking belongs to the Profile\n *   layer (2.x), not to this sequencer.\n */\nimport type { MemoryAtomV1 } from \"./foundation.ts\";\nimport { validateMemoryAtomV1 } from \"./foundation.ts\";\nimport type { CommittedMemoryV1, MemoryStoreV1 } from \"./store.ts\";\n\nexport type MemorySequencerStateV1 = \"idle\" | \"compacting\" | \"revoked\";\n\nexport interface MemorySequencerJournalFactV1 {\n\treadonly kind: \"memory_commit\" | \"compaction_started\" | \"compaction_completed\" | \"compaction_failed\";\n\treadonly operationId: string;\n\treadonly contextRevision: number;\n\treadonly memoryId?: string;\n\treadonly reason?: string;\n\treadonly queued?: boolean;\n\treadonly replayed?: boolean;\n}\n\nexport interface MemorySequencedCommitV1 {\n\treadonly committed: CommittedMemoryV1;\n\treadonly contextRevision: number;\n\treadonly operationId: string;\n\t/** True when the commit was queued during a compaction and replayed after. */\n\treadonly replayed?: boolean;\n\t/** True when the commit is held until the running compaction settles. */\n\treadonly projectionPending?: boolean;\n}\n\nexport interface MemoryCompactionSequencerV1 {\n\tcommitMemory(input: { readonly atom: MemoryAtomV1; readonly operationId: string }): MemorySequencedCommitV1;\n\tbeginCompaction(input: { readonly operationId: string; readonly expectedContextRevision: number }): void;\n\tcompleteCompaction(input: { readonly operationId: string; readonly newContextRevision?: number }): number;\n\tfailCompaction(input: { readonly operationId: string; readonly reason: string }): number;\n\tsetRevoked(reason: string): void;\n\treadonly contextRevision: number;\n\tpendingCommits(): number;\n\tjournal(): readonly MemorySequencerJournalFactV1[];\n}\n\nexport function createMemoryCompactionSequencer(options: {\n\treadonly store: MemoryStoreV1;\n}): MemoryCompactionSequencerV1 {\n\tconst store = options.store;\n\tlet state: MemorySequencerStateV1 = \"idle\";\n\tlet contextRevision = 1;\n\tlet revokedReason: string | undefined;\n\tlet activeCompactionOperationId: string | undefined;\n\tconst pending: Array<{ atom: MemoryAtomV1; operationId: string }> = [];\n\tconst journalLog: MemorySequencerJournalFactV1[] = [];\n\n\tconst assertNotRevoked = (): void => {\n\t\tif (state === \"revoked\") {\n\t\t\t// v8 ignore next -- setRevoked 必带 reason\n\t\t\tthrow new Error(`Memory sequencer is revoked: ${revokedReason ?? \"revoked\"}; late writes must fail`);\n\t\t}\n\t};\n\n\tconst commitNow = (\n\t\tatom: MemoryAtomV1,\n\t\toperationId: string,\n\t\tflags: { replayed?: boolean } = {},\n\t): MemorySequencedCommitV1 => {\n\t\tconst validated = validateMemoryAtomV1(atom);\n\t\tconst committed = store.commit(validated);\n\t\tconst fact: MemorySequencerJournalFactV1 = Object.freeze({\n\t\t\tkind: \"memory_commit\",\n\t\t\toperationId,\n\t\t\tcontextRevision,\n\t\t\tmemoryId: committed.atom.memoryId,\n\t\t\t...(flags.replayed === undefined ? {} : { replayed: true }),\n\t\t});\n\t\tjournalLog.push(fact);\n\t\treturn Object.freeze({\n\t\t\tcommitted,\n\t\t\tcontextRevision,\n\t\t\toperationId,\n\t\t\t...(flags.replayed === undefined ? {} : { replayed: true }),\n\t\t});\n\t};\n\n\tconst replayPending = (compactionOperationId: string, failureReason?: string): number => {\n\t\tlet replayed = 0;\n\t\twhile (pending.length > 0) {\n\t\t\tconst entry = pending.shift()!;\n\t\t\tcommitNow(entry.atom, entry.operationId, { replayed: true });\n\t\t\treplayed += 1;\n\t\t}\n\t\tjournalLog.push(\n\t\t\tObject.freeze({\n\t\t\t\tkind: failureReason === undefined ? \"compaction_completed\" : \"compaction_failed\",\n\t\t\t\toperationId: compactionOperationId,\n\t\t\t\tcontextRevision,\n\t\t\t\t...(failureReason === undefined ? {} : { reason: failureReason }),\n\t\t\t\t...(replayed > 0 ? { queued: true } : {}),\n\t\t\t}),\n\t\t);\n\t\treturn replayed;\n\t};\n\n\treturn {\n\t\tget contextRevision() {\n\t\t\treturn contextRevision;\n\t\t},\n\t\tcommitMemory({ atom, operationId }) {\n\t\t\tassertNotRevoked();\n\t\t\tassertNonEmptyString(operationId, \"operationId\");\n\t\t\tif (state === \"compacting\") {\n\t\t\t\tconst validated = validateMemoryAtomV1(atom);\n\t\t\t\tpending.push({ atom: validated, operationId });\n\t\t\t\tjournalLog.push(\n\t\t\t\t\tObject.freeze({\n\t\t\t\t\t\tkind: \"memory_commit\",\n\t\t\t\t\t\toperationId,\n\t\t\t\t\t\tcontextRevision,\n\t\t\t\t\t\tmemoryId: validated.memoryId,\n\t\t\t\t\t\tqueued: true,\n\t\t\t\t\t}),\n\t\t\t\t);\n\t\t\t\treturn Object.freeze({\n\t\t\t\t\tcommitted: undefined as never,\n\t\t\t\t\tcontextRevision,\n\t\t\t\t\toperationId,\n\t\t\t\t\tprojectionPending: true,\n\t\t\t\t});\n\t\t\t}\n\t\t\treturn commitNow(atom, operationId);\n\t\t},\n\t\tbeginCompaction({ operationId, expectedContextRevision }) {\n\t\t\tassertNotRevoked();\n\t\t\tassertNonEmptyString(operationId, \"compaction operationId\");\n\t\t\tif (state === \"compacting\") {\n\t\t\t\tthrow new Error(`A compaction is already running: ${activeCompactionOperationId}`);\n\t\t\t}\n\t\t\tif (expectedContextRevision !== contextRevision) {\n\t\t\t\tthrow new Error(\n\t\t\t\t\t`Context revision mismatch: expected ${expectedContextRevision}, current ${contextRevision} (stale compaction input)`,\n\t\t\t\t);\n\t\t\t}\n\t\t\tstate = \"compacting\";\n\t\t\tactiveCompactionOperationId = operationId;\n\t\t\tjournalLog.push(Object.freeze({ kind: \"compaction_started\", operationId, contextRevision }));\n\t\t},\n\t\tcompleteCompaction({ operationId, newContextRevision }) {\n\t\t\tassertNotRevoked();\n\t\t\tif (state !== \"compacting\" || activeCompactionOperationId !== operationId) {\n\t\t\t\tthrow new Error(`No running compaction with operationId ${operationId}`);\n\t\t\t}\n\t\t\tcontextRevision = newContextRevision ?? contextRevision + 1;\n\t\t\tstate = \"idle\";\n\t\t\tconst replayed = replayPending(operationId);\n\t\t\tactiveCompactionOperationId = undefined;\n\t\t\treturn replayed;\n\t\t},\n\t\tfailCompaction({ operationId, reason }) {\n\t\t\tassertNotRevoked();\n\t\t\tif (state !== \"compacting\" || activeCompactionOperationId !== operationId) {\n\t\t\t\tthrow new Error(`No running compaction with operationId ${operationId}`);\n\t\t\t}\n\t\t\tstate = \"idle\";\n\t\t\t// Abort failure mode (D-027): the compaction failed, but memories that\n\t\t\t// were committed or queued during it are replayed in order — a failed\n\t\t\t// compaction never deletes committed facts.\n\t\t\tconst replayed = replayPending(operationId, reason);\n\t\t\tactiveCompactionOperationId = undefined;\n\t\t\treturn replayed;\n\t\t},\n\t\tsetRevoked(reason) {\n\t\t\tstate = \"revoked\";\n\t\t\trevokedReason = reason;\n\t\t},\n\t\tpendingCommits() {\n\t\t\treturn pending.length;\n\t\t},\n\t\tjournal() {\n\t\t\treturn Object.freeze([...journalLog]);\n\t\t},\n\t};\n}\n\nfunction assertNonEmptyString(value: unknown, label: string): asserts value is string {\n\tif (typeof value !== \"string\" || value.trim().length === 0) throw new Error(`${label} must be a non-empty string`);\n}\n"]}