@effect-agent/storage-memory 0.1.0-beta.45 → 0.1.0-beta.47

package/dist/MemoryScheduleStore.d.mts

@@ -0,0 +1,10 @@
+import { ScheduleStore } from "@effect-agent/thread/Schedule";
+import { Layer } from "effect";
+declare namespace MemoryScheduleStore_d_exports {
+  export { MemoryScheduleStoreLive, memoryScheduleStoreLayer };
+}
+declare const memoryScheduleStoreLayer: () => Layer.Layer<ScheduleStore>;
+declare const MemoryScheduleStoreLive: Layer.Layer<ScheduleStore>;
+//#endregion
+export { MemoryScheduleStoreLive, memoryScheduleStoreLayer, MemoryScheduleStore_d_exports as t };
+//# sourceMappingURL=MemoryScheduleStore.d.mts.map

package/dist/MemoryScheduleStore.mjs

@@ -0,0 +1,169 @@
+import { t as __exportAll } from "./rolldown-runtime-D7D4PA-g.mjs";
+import { ScheduleCapacityError, ScheduleChange, ScheduleConflict, ScheduleDueCursor, ScheduleFailpoint, ScheduleKey, ScheduleNotFound, ScheduleOwner, SchedulePageRequest, ScheduleRecord, ScheduleStorageError, ScheduleStore, defaultSchedulingLimits } from "@effect-agent/thread/Schedule";
+import { applyScheduleChange, compareScheduleKeys, compareScheduleNames, scheduleDeadline, scheduleKeyOf, scheduleKeyString, scheduleOwnerKey, scheduleUsesCapacity } from "@effect-agent/thread/ScheduleTransition";
+import { Effect, Layer, Ref, Result, Schema } from "effect";
+//#region src/MemoryScheduleStore.ts
+var MemoryScheduleStore_exports = /* @__PURE__ */ __exportAll({
+	MemoryScheduleStoreLive: () => MemoryScheduleStoreLive,
+	memoryScheduleStoreLayer: () => memoryScheduleStoreLayer
+});
+const storageError = (operation, reason) => ScheduleStorageError.make({
+	operation,
+	reason
+});
+const encodeRecord = (operation, record) => Effect.try({
+	try: () => Schema.encodeSync(Schema.fromJsonString(ScheduleRecord))(record),
+	catch: () => storageError(operation, "corrupt")
+});
+const decodeRecord = (operation, encoded) => Effect.try({
+	try: () => Schema.decodeSync(Schema.fromJsonString(ScheduleRecord))(encoded),
+	catch: () => storageError(operation, "corrupt")
+});
+const decodeInput = (operation, schema, value) => Effect.try({
+	try: () => Schema.decodeUnknownSync(schema)(value),
+	catch: () => storageError(operation, "corrupt")
+});
+const sameOwner = (record, owner) => scheduleOwnerKey(record.owner) === scheduleOwnerKey(owner);
+const makeScheduleStore = Effect.gen(function* () {
+	const state = yield* Ref.make({ records: /* @__PURE__ */ new Map() });
+	const failpoint = yield* ScheduleFailpoint;
+	const insert = Effect.fn("MemoryScheduleStore.insert")((record, ownerLimit) => Effect.gen(function* () {
+		const encoded = yield* encodeRecord("insert", record);
+		yield* failpoint.hit("schedule:insert:before");
+		const decision = yield* Effect.uninterruptible(Ref.modify(state, (current) => {
+			const key = scheduleKeyString(record);
+			const existingText = current.records.get(key);
+			if (existingText !== void 0) {
+				const decoded = Result.try({
+					try: () => Schema.decodeSync(Schema.fromJsonString(ScheduleRecord))(existingText),
+					catch: () => storageError("insert", "corrupt")
+				});
+				if (Result.isFailure(decoded)) return [Result.fail(decoded.failure), current];
+				if (decoded.success.creationFingerprint === record.creationFingerprint) return [Result.succeed(decoded.success), current];
+				return [Result.fail(ScheduleConflict.make({
+					reason: "creation",
+					key: scheduleKeyOf(record)
+				})), current];
+			}
+			let ownerCount = 0;
+			for (const text of current.records.values()) {
+				const decoded = Result.try({
+					try: () => Schema.decodeSync(Schema.fromJsonString(ScheduleRecord))(text),
+					catch: () => storageError("insert", "corrupt")
+				});
+				if (Result.isFailure(decoded)) return [Result.fail(decoded.failure), current];
+				if (sameOwner(decoded.success, record.owner) && scheduleUsesCapacity(decoded.success)) ownerCount += 1;
+			}
+			if (ownerCount >= ownerLimit) return [Result.fail(ScheduleCapacityError.make({ limit: ownerLimit })), current];
+			const records = new Map(current.records);
+			records.set(key, encoded);
+			const next = { records };
+			return [Result.succeed(record), next];
+		}));
+		const inserted = yield* Effect.fromResult(decision);
+		yield* failpoint.hit("schedule:insert:after");
+		return yield* decodeRecord("insert", yield* encodeRecord("insert", inserted));
+	}));
+	const get = Effect.fn("MemoryScheduleStore.get")(function* (key) {
+		const decodedKey = yield* decodeInput("get", ScheduleKey, key);
+		const text = (yield* Ref.get(state)).records.get(scheduleKeyString(decodedKey));
+		return text === void 0 ? null : yield* decodeRecord("get", text);
+	});
+	const list = Effect.fn("MemoryScheduleStore.list")(function* (request) {
+		const decodedRequest = yield* decodeInput("list", SchedulePageRequest, request);
+		const records = [];
+		for (const text of (yield* Ref.get(state)).records.values()) {
+			const record = yield* decodeRecord("list", text);
+			if (sameOwner(record, decodedRequest.owner) && (decodedRequest.after === void 0 || compareScheduleNames(record.scheduleId, decodedRequest.after) > 0)) records.push(record);
+		}
+		records.sort((left, right) => compareScheduleNames(left.scheduleId, right.scheduleId));
+		const hasNext = records.length > decodedRequest.limit;
+		const items = records.slice(0, decodedRequest.limit);
+		return {
+			items,
+			next: hasNext ? items.at(-1)?.scheduleId ?? null : null
+		};
+	});
+	const change = Effect.fn("MemoryScheduleStore.change")((key, command, ownerLimit = defaultSchedulingLimits.maxSchedulesPerOwner) => Effect.gen(function* () {
+		const decodedKey = yield* decodeInput("change", ScheduleKey, key);
+		const decodedCommand = yield* decodeInput("change", ScheduleChange, command);
+		yield* failpoint.hit(`schedule:${decodedCommand._tag.toLowerCase()}:before`);
+		const decision = yield* Effect.uninterruptible(Ref.modify(state, (current) => {
+			const storageKey = scheduleKeyString(decodedKey);
+			const text = current.records.get(storageKey);
+			if (text === void 0) return [Result.fail(ScheduleNotFound.make({ key: decodedKey })), current];
+			const decoded = Result.try({
+				try: () => Schema.decodeSync(Schema.fromJsonString(ScheduleRecord))(text),
+				catch: () => storageError("change", "corrupt")
+			});
+			if (Result.isFailure(decoded)) return [Result.fail(decoded.failure), current];
+			const applied = applyScheduleChange(decoded.success, decodedCommand);
+			if (Result.isFailure(applied)) return [Result.fail(applied.failure), current];
+			if (applied.success === decoded.success) return [Result.succeed(decoded.success), current];
+			if (!scheduleUsesCapacity(decoded.success) && scheduleUsesCapacity(applied.success)) {
+				let count = 0;
+				for (const text of current.records.values()) {
+					const candidate = Schema.decodeUnknownResult(Schema.fromJsonString(ScheduleRecord))(text);
+					if (Result.isFailure(candidate)) return [Result.fail(storageError("change", "corrupt")), current];
+					if (sameOwner(candidate.success, decodedKey.owner) && scheduleUsesCapacity(candidate.success)) count += 1;
+				}
+				if (count >= ownerLimit) return [Result.fail(ScheduleCapacityError.make({ limit: ownerLimit })), current];
+			}
+			const encoded = Result.try({
+				try: () => Schema.encodeSync(Schema.fromJsonString(ScheduleRecord))(applied.success),
+				catch: () => storageError("change", "corrupt")
+			});
+			if (Result.isFailure(encoded)) return [Result.fail(encoded.failure), current];
+			const records = new Map(current.records);
+			records.set(storageKey, encoded.success);
+			const next = { records };
+			return [Result.succeed(applied.success), next];
+		}));
+		const changed = yield* Effect.fromResult(decision);
+		yield* failpoint.hit(`schedule:${decodedCommand._tag.toLowerCase()}:after`);
+		return yield* decodeRecord("change", yield* encodeRecord("change", changed));
+	}));
+	const due = Effect.fn("MemoryScheduleStore.due")(function* (nowMillis, limit, owner, after) {
+		const decodedOwner = owner === void 0 ? void 0 : yield* decodeInput("due", ScheduleOwner, owner);
+		const cursor = after === void 0 ? void 0 : yield* decodeInput("due", ScheduleDueCursor, after);
+		const records = [];
+		for (const text of (yield* Ref.get(state)).records.values()) {
+			const record = yield* decodeRecord("due", text);
+			const deadline = scheduleDeadline(record);
+			if (deadline !== null && deadline <= nowMillis && (decodedOwner === void 0 || sameOwner(record, decodedOwner)) && (cursor === void 0 || deadline > cursor.deadlineAtMillis || deadline === cursor.deadlineAtMillis && compareScheduleKeys(record, cursor) > 0)) records.push({
+				...scheduleKeyOf(record),
+				deadlineAtMillis: deadline
+			});
+		}
+		records.sort((left, right) => {
+			const byDeadline = left.deadlineAtMillis - right.deadlineAtMillis;
+			return byDeadline !== 0 ? byDeadline : compareScheduleKeys(left, right);
+		});
+		return records.slice(0, limit);
+	});
+	const nextDeadline = Effect.fn("MemoryScheduleStore.nextDeadline")(function* (owner) {
+		const decodedOwner = owner === void 0 ? void 0 : yield* decodeInput("nextDeadline", ScheduleOwner, owner);
+		let earliest = null;
+		for (const text of (yield* Ref.get(state)).records.values()) {
+			const record = yield* decodeRecord("nextDeadline", text);
+			if (decodedOwner !== void 0 && !sameOwner(record, decodedOwner)) continue;
+			const deadline = scheduleDeadline(record);
+			if (deadline !== null && (earliest === null || deadline < earliest)) earliest = deadline;
+		}
+		return earliest;
+	});
+	return ScheduleStore.of({
+		insert,
+		get,
+		list,
+		change,
+		due,
+		nextDeadline
+	});
+});
+const memoryScheduleStoreLayer = () => Layer.effect(ScheduleStore, makeScheduleStore);
+const MemoryScheduleStoreLive = memoryScheduleStoreLayer();
+//#endregion
+export { MemoryScheduleStoreLive, memoryScheduleStoreLayer, MemoryScheduleStore_exports as t };
+
+//# sourceMappingURL=MemoryScheduleStore.mjs.map

package/dist/MemoryScheduleStore.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"MemoryScheduleStore.mjs","names":[],"sources":["../src/MemoryScheduleStore.ts"],"sourcesContent":["import {\n  ScheduleCapacityError,\n  ScheduleDueCursor,\n  defaultSchedulingLimits,\n  ScheduleChange,\n  ScheduleConflict,\n  ScheduleFailpoint,\n  ScheduleKey,\n  ScheduleNotFound,\n  ScheduleOwner,\n  SchedulePageRequest,\n  ScheduleRecord,\n  ScheduleStorageError,\n  ScheduleStore,\n} from \"@effect-agent/thread/Schedule\";\nimport {\n  scheduleUsesCapacity,\n  applyScheduleChange,\n  compareScheduleKeys,\n  compareScheduleNames,\n  scheduleDeadline,\n  scheduleKeyString,\n  scheduleKeyOf,\n  scheduleOwnerKey,\n} from \"@effect-agent/thread/ScheduleTransition\";\nimport { Effect, Layer, Ref, Result, Schema } from \"effect\";\n\ninterface MemoryScheduleState {\n  readonly records: ReadonlyMap<string, string>;\n}\n\nconst storageError = (operation: string, reason: \"unavailable\" | \"corrupt\") =>\n  ScheduleStorageError.make({ operation, reason });\n\nconst encodeRecord = (operation: string, record: ScheduleRecord) =>\n  Effect.try({\n    try: () => Schema.encodeSync(Schema.fromJsonString(ScheduleRecord))(record),\n    catch: () => storageError(operation, \"corrupt\"),\n  });\n\nconst decodeRecord = (operation: string, encoded: string) =>\n  Effect.try({\n    try: () => Schema.decodeSync(Schema.fromJsonString(ScheduleRecord))(encoded),\n    catch: () => storageError(operation, \"corrupt\"),\n  });\n\nconst decodeInput = <A, I>(operation: string, schema: Schema.Codec<A, I>, value: unknown) =>\n  Effect.try({\n    try: () => Schema.decodeUnknownSync(schema)(value),\n    catch: () => storageError(operation, \"corrupt\"),\n  });\n\nconst sameOwner = (record: ScheduleRecord, owner: ScheduleOwner): boolean =>\n  scheduleOwnerKey(record.owner) === scheduleOwnerKey(owner);\n\nconst makeScheduleStore = Effect.gen(function* () {\n  const state = yield* Ref.make<MemoryScheduleState>({ records: new Map() });\n  const failpoint = yield* ScheduleFailpoint;\n\n  const insert: ScheduleStore[\"Service\"][\"insert\"] = Effect.fn(\"MemoryScheduleStore.insert\")(\n    (record, ownerLimit) =>\n      Effect.gen(function* () {\n        const encoded = yield* encodeRecord(\"insert\", record);\n\n        yield* failpoint.hit(\"schedule:insert:before\");\n\n        const decision = yield* Effect.uninterruptible(\n          Ref.modify(\n            state,\n            (\n              current,\n            ): readonly [\n              Result.Result<\n                ScheduleRecord,\n                ScheduleConflict | ScheduleCapacityError | ScheduleStorageError\n              >,\n              MemoryScheduleState,\n            ] => {\n              const key = scheduleKeyString(record);\n              const existingText = current.records.get(key);\n\n              if (existingText !== undefined) {\n                const decoded = Result.try({\n                  try: () => Schema.decodeSync(Schema.fromJsonString(ScheduleRecord))(existingText),\n                  catch: () => storageError(\"insert\", \"corrupt\"),\n                });\n\n                if (Result.isFailure(decoded)) {\n                  return [Result.fail(decoded.failure), current];\n                }\n                if (decoded.success.creationFingerprint === record.creationFingerprint) {\n                  return [Result.succeed(decoded.success), current];\n                }\n\n                return [\n                  Result.fail(\n                    ScheduleConflict.make({ reason: \"creation\", key: scheduleKeyOf(record) }),\n                  ),\n                  current,\n                ];\n              }\n\n              let ownerCount = 0;\n\n              for (const text of current.records.values()) {\n                const decoded = Result.try({\n                  try: () => Schema.decodeSync(Schema.fromJsonString(ScheduleRecord))(text),\n                  catch: () => storageError(\"insert\", \"corrupt\"),\n                });\n\n                if (Result.isFailure(decoded)) {\n                  return [Result.fail(decoded.failure), current];\n                }\n                if (\n                  sameOwner(decoded.success, record.owner) &&\n                  scheduleUsesCapacity(decoded.success)\n                )\n                  ownerCount += 1;\n              }\n              if (ownerCount >= ownerLimit) {\n                return [Result.fail(ScheduleCapacityError.make({ limit: ownerLimit })), current];\n              }\n              const records = new Map(current.records);\n\n              records.set(key, encoded);\n              const next = { records };\n\n              return [Result.succeed(record), next];\n            },\n          ),\n        );\n\n        const inserted = yield* Effect.fromResult(decision);\n\n        yield* failpoint.hit(\"schedule:insert:after\");\n\n        return yield* decodeRecord(\"insert\", yield* encodeRecord(\"insert\", inserted));\n      }),\n  );\n\n  const get: ScheduleStore[\"Service\"][\"get\"] = Effect.fn(\"MemoryScheduleStore.get\")(\n    function* (key) {\n      const decodedKey = yield* decodeInput(\"get\", ScheduleKey, key);\n      const text = (yield* Ref.get(state)).records.get(scheduleKeyString(decodedKey));\n\n      return text === undefined ? null : yield* decodeRecord(\"get\", text);\n    },\n  );\n\n  const list: ScheduleStore[\"Service\"][\"list\"] = Effect.fn(\"MemoryScheduleStore.list\")(\n    function* (request) {\n      const decodedRequest = yield* decodeInput(\"list\", SchedulePageRequest, request);\n      const records: Array<ScheduleRecord> = [];\n\n      for (const text of (yield* Ref.get(state)).records.values()) {\n        const record = yield* decodeRecord(\"list\", text);\n\n        if (\n          sameOwner(record, decodedRequest.owner) &&\n          (decodedRequest.after === undefined ||\n            compareScheduleNames(record.scheduleId, decodedRequest.after) > 0)\n        ) {\n          records.push(record);\n        }\n      }\n      records.sort((left, right) => compareScheduleNames(left.scheduleId, right.scheduleId));\n      const hasNext = records.length > decodedRequest.limit;\n      const items = records.slice(0, decodedRequest.limit);\n\n      return {\n        items,\n        next: hasNext ? (items.at(-1)?.scheduleId ?? null) : null,\n      };\n    },\n  );\n\n  const change: ScheduleStore[\"Service\"][\"change\"] = Effect.fn(\"MemoryScheduleStore.change\")(\n    (key, command, ownerLimit = defaultSchedulingLimits.maxSchedulesPerOwner) =>\n      Effect.gen(function* () {\n        const decodedKey = yield* decodeInput(\"change\", ScheduleKey, key);\n        const decodedCommand = yield* decodeInput(\"change\", ScheduleChange, command);\n\n        yield* failpoint.hit(`schedule:${decodedCommand._tag.toLowerCase()}:before`);\n\n        const decision = yield* Effect.uninterruptible(\n          Ref.modify(\n            state,\n            (\n              current,\n            ): readonly [\n              Result.Result<\n                ScheduleRecord,\n                ScheduleConflict | ScheduleStorageError | ScheduleNotFound | ScheduleCapacityError\n              >,\n              MemoryScheduleState,\n            ] => {\n              const storageKey = scheduleKeyString(decodedKey);\n              const text = current.records.get(storageKey);\n\n              if (text === undefined) {\n                return [Result.fail(ScheduleNotFound.make({ key: decodedKey })), current];\n              }\n\n              const decoded = Result.try({\n                try: () => Schema.decodeSync(Schema.fromJsonString(ScheduleRecord))(text),\n                catch: () => storageError(\"change\", \"corrupt\"),\n              });\n\n              if (Result.isFailure(decoded)) {\n                return [Result.fail(decoded.failure), current];\n              }\n              const applied = applyScheduleChange(decoded.success, decodedCommand);\n\n              if (Result.isFailure(applied)) {\n                return [Result.fail(applied.failure), current];\n              }\n              if (applied.success === decoded.success) {\n                return [Result.succeed(decoded.success), current];\n              }\n              if (!scheduleUsesCapacity(decoded.success) && scheduleUsesCapacity(applied.success)) {\n                let count = 0;\n\n                for (const text of current.records.values()) {\n                  const candidate = Schema.decodeUnknownResult(\n                    Schema.fromJsonString(ScheduleRecord),\n                  )(text);\n\n                  if (Result.isFailure(candidate))\n                    return [Result.fail(storageError(\"change\", \"corrupt\")), current];\n                  if (\n                    sameOwner(candidate.success, decodedKey.owner) &&\n                    scheduleUsesCapacity(candidate.success)\n                  )\n                    count += 1;\n                }\n                if (count >= ownerLimit)\n                  return [Result.fail(ScheduleCapacityError.make({ limit: ownerLimit })), current];\n              }\n\n              const encoded = Result.try({\n                try: () =>\n                  Schema.encodeSync(Schema.fromJsonString(ScheduleRecord))(applied.success),\n                catch: () => storageError(\"change\", \"corrupt\"),\n              });\n\n              if (Result.isFailure(encoded)) {\n                return [Result.fail(encoded.failure), current];\n              }\n              const records = new Map(current.records);\n\n              records.set(storageKey, encoded.success);\n              const next = { records };\n\n              return [Result.succeed(applied.success), next];\n            },\n          ),\n        );\n\n        const changed = yield* Effect.fromResult(decision);\n\n        yield* failpoint.hit(`schedule:${decodedCommand._tag.toLowerCase()}:after`);\n\n        return yield* decodeRecord(\"change\", yield* encodeRecord(\"change\", changed));\n      }),\n  );\n\n  const due: ScheduleStore[\"Service\"][\"due\"] = Effect.fn(\"MemoryScheduleStore.due\")(\n    function* (nowMillis, limit, owner, after) {\n      const decodedOwner =\n        owner === undefined ? undefined : yield* decodeInput(\"due\", ScheduleOwner, owner);\n\n      const cursor =\n        after === undefined ? undefined : yield* decodeInput(\"due\", ScheduleDueCursor, after);\n\n      const records: Array<ScheduleDueCursor> = [];\n\n      for (const text of (yield* Ref.get(state)).records.values()) {\n        const record = yield* decodeRecord(\"due\", text);\n        const deadline = scheduleDeadline(record);\n\n        if (\n          deadline !== null &&\n          deadline <= nowMillis &&\n          (decodedOwner === undefined || sameOwner(record, decodedOwner)) &&\n          (cursor === undefined ||\n            deadline > cursor.deadlineAtMillis ||\n            (deadline === cursor.deadlineAtMillis && compareScheduleKeys(record, cursor) > 0))\n        ) {\n          records.push({ ...scheduleKeyOf(record), deadlineAtMillis: deadline });\n        }\n      }\n      records.sort((left, right) => {\n        const byDeadline = left.deadlineAtMillis - right.deadlineAtMillis;\n\n        return byDeadline !== 0 ? byDeadline : compareScheduleKeys(left, right);\n      });\n\n      return records.slice(0, limit);\n    },\n  );\n\n  const nextDeadline: ScheduleStore[\"Service\"][\"nextDeadline\"] = Effect.fn(\n    \"MemoryScheduleStore.nextDeadline\",\n  )(function* (owner) {\n    const decodedOwner =\n      owner === undefined ? undefined : yield* decodeInput(\"nextDeadline\", ScheduleOwner, owner);\n\n    let earliest: number | null = null;\n\n    for (const text of (yield* Ref.get(state)).records.values()) {\n      const record = yield* decodeRecord(\"nextDeadline\", text);\n\n      if (decodedOwner !== undefined && !sameOwner(record, decodedOwner)) continue;\n      const deadline = scheduleDeadline(record);\n\n      if (deadline !== null && (earliest === null || deadline < earliest)) earliest = deadline;\n    }\n\n    return earliest;\n  });\n\n  return ScheduleStore.of({ insert, get, list, change, due, nextDeadline });\n});\n\nexport const memoryScheduleStoreLayer = (): Layer.Layer<ScheduleStore> =>\n  Layer.effect(ScheduleStore, makeScheduleStore);\n\nexport const MemoryScheduleStoreLive: Layer.Layer<ScheduleStore> = memoryScheduleStoreLayer();\n"],"mappings":";;;;;;;;;AA+BA,MAAM,gBAAgB,WAAmB,WACvC,qBAAqB,KAAK;CAAE;CAAW;AAAO,CAAC;AAEjD,MAAM,gBAAgB,WAAmB,WACvC,OAAO,IAAI;CACT,WAAW,OAAO,WAAW,OAAO,eAAe,cAAc,CAAC,CAAC,CAAC,MAAM;CAC1E,aAAa,aAAa,WAAW,SAAS;AAChD,CAAC;AAEH,MAAM,gBAAgB,WAAmB,YACvC,OAAO,IAAI;CACT,WAAW,OAAO,WAAW,OAAO,eAAe,cAAc,CAAC,CAAC,CAAC,OAAO;CAC3E,aAAa,aAAa,WAAW,SAAS;AAChD,CAAC;AAEH,MAAM,eAAqB,WAAmB,QAA4B,UACxE,OAAO,IAAI;CACT,WAAW,OAAO,kBAAkB,MAAM,CAAC,CAAC,KAAK;CACjD,aAAa,aAAa,WAAW,SAAS;AAChD,CAAC;AAEH,MAAM,aAAa,QAAwB,UACzC,iBAAiB,OAAO,KAAK,MAAM,iBAAiB,KAAK;AAE3D,MAAM,oBAAoB,OAAO,IAAI,aAAa;CAChD,MAAM,QAAQ,OAAO,IAAI,KAA0B,EAAE,yBAAS,IAAI,IAAI,EAAE,CAAC;CACzE,MAAM,YAAY,OAAO;CAEzB,MAAM,SAA6C,OAAO,GAAG,4BAA4B,CAAC,EACvF,QAAQ,eACP,OAAO,IAAI,aAAa;EACtB,MAAM,UAAU,OAAO,aAAa,UAAU,MAAM;EAEpD,OAAO,UAAU,IAAI,wBAAwB;EAE7C,MAAM,WAAW,OAAO,OAAO,gBAC7B,IAAI,OACF,QAEE,YAOG;GACH,MAAM,MAAM,kBAAkB,MAAM;GACpC,MAAM,eAAe,QAAQ,QAAQ,IAAI,GAAG;GAE5C,IAAI,iBAAiB,KAAA,GAAW;IAC9B,MAAM,UAAU,OAAO,IAAI;KACzB,WAAW,OAAO,WAAW,OAAO,eAAe,cAAc,CAAC,CAAC,CAAC,YAAY;KAChF,aAAa,aAAa,UAAU,SAAS;IAC/C,CAAC;IAED,IAAI,OAAO,UAAU,OAAO,GAC1B,OAAO,CAAC,OAAO,KAAK,QAAQ,OAAO,GAAG,OAAO;IAE/C,IAAI,QAAQ,QAAQ,wBAAwB,OAAO,qBACjD,OAAO,CAAC,OAAO,QAAQ,QAAQ,OAAO,GAAG,OAAO;IAGlD,OAAO,CACL,OAAO,KACL,iBAAiB,KAAK;KAAE,QAAQ;KAAY,KAAK,cAAc,MAAM;IAAE,CAAC,CAC1E,GACA,OACF;GACF;GAEA,IAAI,aAAa;GAEjB,KAAK,MAAM,QAAQ,QAAQ,QAAQ,OAAO,GAAG;IAC3C,MAAM,UAAU,OAAO,IAAI;KACzB,WAAW,OAAO,WAAW,OAAO,eAAe,cAAc,CAAC,CAAC,CAAC,IAAI;KACxE,aAAa,aAAa,UAAU,SAAS;IAC/C,CAAC;IAED,IAAI,OAAO,UAAU,OAAO,GAC1B,OAAO,CAAC,OAAO,KAAK,QAAQ,OAAO,GAAG,OAAO;IAE/C,IACE,UAAU,QAAQ,SAAS,OAAO,KAAK,KACvC,qBAAqB,QAAQ,OAAO,GAEpC,cAAc;GAClB;GACA,IAAI,cAAc,YAChB,OAAO,CAAC,OAAO,KAAK,sBAAsB,KAAK,EAAE,OAAO,WAAW,CAAC,CAAC,GAAG,OAAO;GAEjF,MAAM,UAAU,IAAI,IAAI,QAAQ,OAAO;GAEvC,QAAQ,IAAI,KAAK,OAAO;GACxB,MAAM,OAAO,EAAE,QAAQ;GAEvB,OAAO,CAAC,OAAO,QAAQ,MAAM,GAAG,IAAI;EACtC,CACF,CACF;EAEA,MAAM,WAAW,OAAO,OAAO,WAAW,QAAQ;EAElD,OAAO,UAAU,IAAI,uBAAuB;EAE5C,OAAO,OAAO,aAAa,UAAU,OAAO,aAAa,UAAU,QAAQ,CAAC;CAC9E,CAAC,CACL;CAEA,MAAM,MAAuC,OAAO,GAAG,yBAAyB,CAAC,CAC/E,WAAW,KAAK;EACd,MAAM,aAAa,OAAO,YAAY,OAAO,aAAa,GAAG;EAC7D,MAAM,QAAQ,OAAO,IAAI,IAAI,KAAK,EAAA,CAAG,QAAQ,IAAI,kBAAkB,UAAU,CAAC;EAE9E,OAAO,SAAS,KAAA,IAAY,OAAO,OAAO,aAAa,OAAO,IAAI;CACpE,CACF;CAEA,MAAM,OAAyC,OAAO,GAAG,0BAA0B,CAAC,CAClF,WAAW,SAAS;EAClB,MAAM,iBAAiB,OAAO,YAAY,QAAQ,qBAAqB,OAAO;EAC9E,MAAM,UAAiC,CAAC;EAExC,KAAK,MAAM,SAAS,OAAO,IAAI,IAAI,KAAK,EAAA,CAAG,QAAQ,OAAO,GAAG;GAC3D,MAAM,SAAS,OAAO,aAAa,QAAQ,IAAI;GAE/C,IACE,UAAU,QAAQ,eAAe,KAAK,MACrC,eAAe,UAAU,KAAA,KACxB,qBAAqB,OAAO,YAAY,eAAe,KAAK,IAAI,IAElE,QAAQ,KAAK,MAAM;EAEvB;EACA,QAAQ,MAAM,MAAM,UAAU,qBAAqB,KAAK,YAAY,MAAM,UAAU,CAAC;EACrF,MAAM,UAAU,QAAQ,SAAS,eAAe;EAChD,MAAM,QAAQ,QAAQ,MAAM,GAAG,eAAe,KAAK;EAEnD,OAAO;GACL;GACA,MAAM,UAAW,MAAM,GAAG,EAAE,CAAC,EAAE,cAAc,OAAQ;EACvD;CACF,CACF;CAEA,MAAM,SAA6C,OAAO,GAAG,4BAA4B,CAAC,EACvF,KAAK,SAAS,aAAa,wBAAwB,yBAClD,OAAO,IAAI,aAAa;EACtB,MAAM,aAAa,OAAO,YAAY,UAAU,aAAa,GAAG;EAChE,MAAM,iBAAiB,OAAO,YAAY,UAAU,gBAAgB,OAAO;EAE3E,OAAO,UAAU,IAAI,YAAY,eAAe,KAAK,YAAY,EAAE,QAAQ;EAE3E,MAAM,WAAW,OAAO,OAAO,gBAC7B,IAAI,OACF,QAEE,YAOG;GACH,MAAM,aAAa,kBAAkB,UAAU;GAC/C,MAAM,OAAO,QAAQ,QAAQ,IAAI,UAAU;GAE3C,IAAI,SAAS,KAAA,GACX,OAAO,CAAC,OAAO,KAAK,iBAAiB,KAAK,EAAE,KAAK,WAAW,CAAC,CAAC,GAAG,OAAO;GAG1E,MAAM,UAAU,OAAO,IAAI;IACzB,WAAW,OAAO,WAAW,OAAO,eAAe,cAAc,CAAC,CAAC,CAAC,IAAI;IACxE,aAAa,aAAa,UAAU,SAAS;GAC/C,CAAC;GAED,IAAI,OAAO,UAAU,OAAO,GAC1B,OAAO,CAAC,OAAO,KAAK,QAAQ,OAAO,GAAG,OAAO;GAE/C,MAAM,UAAU,oBAAoB,QAAQ,SAAS,cAAc;GAEnE,IAAI,OAAO,UAAU,OAAO,GAC1B,OAAO,CAAC,OAAO,KAAK,QAAQ,OAAO,GAAG,OAAO;GAE/C,IAAI,QAAQ,YAAY,QAAQ,SAC9B,OAAO,CAAC,OAAO,QAAQ,QAAQ,OAAO,GAAG,OAAO;GAElD,IAAI,CAAC,qBAAqB,QAAQ,OAAO,KAAK,qBAAqB,QAAQ,OAAO,GAAG;IACnF,IAAI,QAAQ;IAEZ,KAAK,MAAM,QAAQ,QAAQ,QAAQ,OAAO,GAAG;KAC3C,MAAM,YAAY,OAAO,oBACvB,OAAO,eAAe,cAAc,CACtC,CAAC,CAAC,IAAI;KAEN,IAAI,OAAO,UAAU,SAAS,GAC5B,OAAO,CAAC,OAAO,KAAK,aAAa,UAAU,SAAS,CAAC,GAAG,OAAO;KACjE,IACE,UAAU,UAAU,SAAS,WAAW,KAAK,KAC7C,qBAAqB,UAAU,OAAO,GAEtC,SAAS;IACb;IACA,IAAI,SAAS,YACX,OAAO,CAAC,OAAO,KAAK,sBAAsB,KAAK,EAAE,OAAO,WAAW,CAAC,CAAC,GAAG,OAAO;GACnF;GAEA,MAAM,UAAU,OAAO,IAAI;IACzB,WACE,OAAO,WAAW,OAAO,eAAe,cAAc,CAAC,CAAC,CAAC,QAAQ,OAAO;IAC1E,aAAa,aAAa,UAAU,SAAS;GAC/C,CAAC;GAED,IAAI,OAAO,UAAU,OAAO,GAC1B,OAAO,CAAC,OAAO,KAAK,QAAQ,OAAO,GAAG,OAAO;GAE/C,MAAM,UAAU,IAAI,IAAI,QAAQ,OAAO;GAEvC,QAAQ,IAAI,YAAY,QAAQ,OAAO;GACvC,MAAM,OAAO,EAAE,QAAQ;GAEvB,OAAO,CAAC,OAAO,QAAQ,QAAQ,OAAO,GAAG,IAAI;EAC/C,CACF,CACF;EAEA,MAAM,UAAU,OAAO,OAAO,WAAW,QAAQ;EAEjD,OAAO,UAAU,IAAI,YAAY,eAAe,KAAK,YAAY,EAAE,OAAO;EAE1E,OAAO,OAAO,aAAa,UAAU,OAAO,aAAa,UAAU,OAAO,CAAC;CAC7E,CAAC,CACL;CAEA,MAAM,MAAuC,OAAO,GAAG,yBAAyB,CAAC,CAC/E,WAAW,WAAW,OAAO,OAAO,OAAO;EACzC,MAAM,eACJ,UAAU,KAAA,IAAY,KAAA,IAAY,OAAO,YAAY,OAAO,eAAe,KAAK;EAElF,MAAM,SACJ,UAAU,KAAA,IAAY,KAAA,IAAY,OAAO,YAAY,OAAO,mBAAmB,KAAK;EAEtF,MAAM,UAAoC,CAAC;EAE3C,KAAK,MAAM,SAAS,OAAO,IAAI,IAAI,KAAK,EAAA,CAAG,QAAQ,OAAO,GAAG;GAC3D,MAAM,SAAS,OAAO,aAAa,OAAO,IAAI;GAC9C,MAAM,WAAW,iBAAiB,MAAM;GAExC,IACE,aAAa,QACb,YAAY,cACX,iBAAiB,KAAA,KAAa,UAAU,QAAQ,YAAY,OAC5D,WAAW,KAAA,KACV,WAAW,OAAO,oBACjB,aAAa,OAAO,oBAAoB,oBAAoB,QAAQ,MAAM,IAAI,IAEjF,QAAQ,KAAK;IAAE,GAAG,cAAc,MAAM;IAAG,kBAAkB;GAAS,CAAC;EAEzE;EACA,QAAQ,MAAM,MAAM,UAAU;GAC5B,MAAM,aAAa,KAAK,mBAAmB,MAAM;GAEjD,OAAO,eAAe,IAAI,aAAa,oBAAoB,MAAM,KAAK;EACxE,CAAC;EAED,OAAO,QAAQ,MAAM,GAAG,KAAK;CAC/B,CACF;CAEA,MAAM,eAAyD,OAAO,GACpE,kCACF,CAAC,CAAC,WAAW,OAAO;EAClB,MAAM,eACJ,UAAU,KAAA,IAAY,KAAA,IAAY,OAAO,YAAY,gBAAgB,eAAe,KAAK;EAE3F,IAAI,WAA0B;EAE9B,KAAK,MAAM,SAAS,OAAO,IAAI,IAAI,KAAK,EAAA,CAAG,QAAQ,OAAO,GAAG;GAC3D,MAAM,SAAS,OAAO,aAAa,gBAAgB,IAAI;GAEvD,IAAI,iBAAiB,KAAA,KAAa,CAAC,UAAU,QAAQ,YAAY,GAAG;GACpE,MAAM,WAAW,iBAAiB,MAAM;GAExC,IAAI,aAAa,SAAS,aAAa,QAAQ,WAAW,WAAW,WAAW;EAClF;EAEA,OAAO;CACT,CAAC;CAED,OAAO,cAAc,GAAG;EAAE;EAAQ;EAAK;EAAM;EAAQ;EAAK;CAAa,CAAC;AAC1E,CAAC;AAED,MAAa,iCACX,MAAM,OAAO,eAAe,iBAAiB;AAE/C,MAAa,0BAAsD,yBAAyB"}

package/dist/MemorySemanticIndex.d.mts

@@ -0,0 +1,21 @@
+import { Layer, Schema } from "effect";
+import { MemoryIndexError, SemanticMemoryIndex, SemanticMemoryProfile } from "@effect-agent/core/SemanticMemoryIndex";
+declare namespace MemorySemanticIndex_d_exports {
+  export { InMemorySemanticIndexCapacity, inMemorySemanticIndexLayer };
+}
+declare const InMemorySemanticIndexCapacity_base: Schema.Class<InMemorySemanticIndexCapacity, Schema.Struct<{
+  readonly maxSources: Schema.Int;
+  readonly maxChunks: Schema.Int;
+  readonly maxSourceBytes: Schema.optionalKey<Schema.Int>;
+}>, {}>;
+/**
+ * Hard per-Layer bounds for disposable semantic index state. maxChunks times profile dimensions
+ * must not exceed 16,777,216 vector components. maxSourceBytes bounds the aggregate UTF-8 JSON
+ * of retained source identities and defaults to 16 MiB; it is not a general heap limit.
+ */
+declare class InMemorySemanticIndexCapacity extends InMemorySemanticIndexCapacity_base {}
+/** Scoped disposable semantic index. No persistent build or recovery state is retained. */
+declare const inMemorySemanticIndexLayer: (profile: SemanticMemoryProfile, capacity: InMemorySemanticIndexCapacity) => Layer.Layer<SemanticMemoryIndex, MemoryIndexError>;
+//#endregion
+export { InMemorySemanticIndexCapacity, inMemorySemanticIndexLayer, MemorySemanticIndex_d_exports as t };
+//# sourceMappingURL=MemorySemanticIndex.d.mts.map

package/dist/MemorySemanticIndex.mjs

@@ -0,0 +1,222 @@
+import { t as __exportAll } from "./rolldown-runtime-D7D4PA-g.mjs";
+import { Clock, Effect, Encoding, Layer, Ref, Schema } from "effect";
+import { MemoryKey } from "@effect-agent/core/MemoryStore";
+import { MemoryIndexCandidate, MemoryIndexError, MemoryIndexQuery, MemoryIndexReplacement, MemoryIndexSearch, MemoryIndexSource, SemanticMemoryChunk, SemanticMemoryIndex, SemanticMemoryProfile } from "@effect-agent/core/SemanticMemoryIndex";
+//#region src/MemorySemanticIndex.ts
+var MemorySemanticIndex_exports = /* @__PURE__ */ __exportAll({
+	InMemorySemanticIndexCapacity: () => InMemorySemanticIndexCapacity,
+	inMemorySemanticIndexLayer: () => inMemorySemanticIndexLayer
+});
+const PositiveCapacity = Schema.Int.check(Schema.isBetween({
+	minimum: 1,
+	maximum: 65536
+}));
+const MaxStoredVectorComponents = 16777216;
+/**
+* Hard per-Layer bounds for disposable semantic index state. maxChunks times profile dimensions
+* must not exceed 16,777,216 vector components. maxSourceBytes bounds the aggregate UTF-8 JSON
+* of retained source identities and defaults to 16 MiB; it is not a general heap limit.
+*/
+var InMemorySemanticIndexCapacity = class extends Schema.Class("@effect-agent/storage-memory/InMemorySemanticIndexCapacity")({
+	maxSources: PositiveCapacity,
+	maxChunks: PositiveCapacity,
+	maxSourceBytes: Schema.optionalKey(Schema.Int.check(Schema.isBetween({
+		minimum: 1,
+		maximum: 67108864
+	})))
+}) {};
+const sameProfile = Schema.toEquivalence(SemanticMemoryProfile);
+const sameSource = Schema.toEquivalence(MemoryIndexSource.Wire);
+const error = (operation, reason) => MemoryIndexError.make({
+	operation,
+	reason
+});
+const keyString = (key) => JSON.stringify([key.namespace.address, key.id]);
+const sourceIdentityBytes = (source) => Encoding.encodeHex(JSON.stringify(source)).length / 2;
+const decodeBoundary = Effect.fn("InMemorySemanticIndex.decodeBoundary")(function* (schema, value, operation) {
+	return yield* Schema.decodeUnknownEffect(schema)(value).pipe(Effect.flatMap((decoded) => Schema.encodeEffect(schema)(decoded).pipe(Effect.as(decoded))), Effect.mapError(() => error(operation, "invalid-input")));
+});
+const freezeSource = (source) => Object.freeze(MemoryIndexSource.make({
+	key: Object.freeze(MemoryKey.make({
+		...source.key,
+		namespace: Object.freeze({ address: source.key.namespace.address })
+	})),
+	source: Object.freeze({ ...source.source }),
+	sourceGeneration: source.sourceGeneration
+}));
+const freezeChunk = (chunk) => Object.freeze(SemanticMemoryChunk.make({
+	...chunk,
+	vector: Object.freeze([...chunk.vector])
+}));
+const sourceIsFenced = (source, existing) => source.sourceGeneration < existing.source.sourceGeneration || source.sourceGeneration === existing.source.sourceGeneration && !sameSource(source, existing.source);
+const squaredNorm = (vector) => {
+	let sum = 0;
+	for (const value of vector) {
+		sum += value * value;
+		if (!Number.isFinite(sum)) return null;
+	}
+	return sum > 0 ? sum : null;
+};
+const validVector = (vector, profile) => vector.length === profile.dimensions && squaredNorm(vector) !== null;
+const validateChunks = Effect.fn("InMemorySemanticIndex.validateChunks")(function* (chunks, profile, operation) {
+	let nextByte = 0;
+	const passageIds = /* @__PURE__ */ new Set();
+	for (let index = 0; index < chunks.length; index++) {
+		const chunk = chunks[index];
+		const byteLength = Encoding.encodeHex(chunk.text).length / 2;
+		if (chunk.ordinal !== index || chunk.startByte !== nextByte || chunk.endByte <= chunk.startByte || chunk.endByte - chunk.startByte !== byteLength || byteLength > profile.maxChunkBytes || passageIds.has(chunk.passageId) || !validVector(chunk.vector, profile)) return yield* error(operation, "invalid-input");
+		passageIds.add(chunk.passageId);
+		nextByte = chunk.endByte;
+	}
+});
+const cosine = (left, right) => {
+	const leftNorm = Math.sqrt(squaredNorm(left) ?? 1);
+	const rightNorm = Math.sqrt(squaredNorm(right) ?? 1);
+	let score = 0;
+	for (let index = 0; index < left.length; index++) score += left[index] / leftNorm * (right[index] / rightNorm);
+	const bounded = Math.max(-1, Math.min(1, score));
+	return bounded === 0 ? 0 : bounded;
+};
+const compareText = (left, right) => left < right ? -1 : left > right ? 1 : 0;
+const makeIndex = Effect.fn("InMemorySemanticIndex.make")(function* (rawProfile, rawCapacity) {
+	const profile = Object.freeze(SemanticMemoryProfile.make({ ...yield* decodeBoundary(SemanticMemoryProfile, rawProfile, "configure semantic memory index") }));
+	const capacity = yield* decodeBoundary(InMemorySemanticIndexCapacity, rawCapacity, "configure semantic memory index");
+	if (capacity.maxChunks * profile.dimensions > MaxStoredVectorComponents) return yield* error("configure semantic memory index", "invalid-input");
+	const maxSourceBytes = capacity.maxSourceBytes ?? 16777216;
+	const data = yield* Ref.make({
+		closed: false,
+		entries: /* @__PURE__ */ new Map(),
+		sourceBytes: 0
+	});
+	yield* Effect.addFinalizer(() => Ref.set(data, {
+		closed: true,
+		entries: /* @__PURE__ */ new Map(),
+		sourceBytes: 0
+	}));
+	const ensureOpen = Effect.fn("InMemorySemanticIndex.ensureOpen")(function* (operation) {
+		if ((yield* Ref.get(data)).closed) return yield* error(operation, "unavailable");
+	});
+	const replace = Effect.fn("InMemorySemanticIndex.replace")(function* (rawRequest) {
+		const operation = "replace semantic memory source";
+		yield* ensureOpen(operation);
+		const request = yield* decodeBoundary(MemoryIndexReplacement.Wire, rawRequest, operation);
+		const source = freezeSource(request.source);
+		const sourceBytes = sourceIdentityBytes(source);
+		const chunks = Object.freeze(request.chunks.map(freezeChunk));
+		if (source.source.id !== source.key.id) return yield* error(operation, "invalid-input");
+		if (!sameProfile(request.profile, profile)) return yield* error(operation, "incompatible");
+		yield* validateChunks(chunks, profile, operation);
+		const indexedAt = yield* Clock.currentTimeMillis;
+		const failure = yield* Ref.modify(data, (current) => {
+			if (current.closed) return [error(operation, "unavailable"), current];
+			const id = keyString(source.key);
+			const existing = current.entries.get(id);
+			if (existing !== void 0 && (existing._tag === "Withdrawn" || sourceIsFenced(source, existing))) return [error(operation, "fenced"), current];
+			if (existing === void 0 && current.entries.size >= capacity.maxSources) return [error(operation, "budget"), current];
+			const nextSourceBytes = current.sourceBytes - (existing?.sourceBytes ?? 0) + sourceBytes;
+			if (nextSourceBytes > maxSourceBytes) return [error(operation, "budget"), current];
+			let count = chunks.length;
+			for (const [entryId, entry] of current.entries) if (entryId !== id && entry._tag === "Indexed") count += entry.chunks.length;
+			if (count > capacity.maxChunks) return [error(operation, "budget"), current];
+			const entries = new Map(current.entries);
+			entries.set(id, {
+				_tag: "Indexed",
+				source,
+				sourceBytes,
+				chunks,
+				indexedAt
+			});
+			return [void 0, {
+				...current,
+				entries,
+				sourceBytes: nextSourceBytes
+			}];
+		});
+		if (failure !== void 0) return yield* failure;
+	});
+	const withdraw = Effect.fn("InMemorySemanticIndex.withdraw")(function* (rawSource) {
+		const operation = "withdraw semantic memory source";
+		yield* ensureOpen(operation);
+		const source = freezeSource(yield* decodeBoundary(MemoryIndexSource.Wire, rawSource, operation));
+		const sourceBytes = sourceIdentityBytes(source);
+		if (source.source.id !== source.key.id) return yield* error(operation, "invalid-input");
+		const failure = yield* Ref.modify(data, (current) => {
+			if (current.closed) return [error(operation, "unavailable"), current];
+			const id = keyString(source.key);
+			const existing = current.entries.get(id);
+			if (existing !== void 0) {
+				if (existing._tag === "Withdrawn") return [sameSource(source, existing.source) ? void 0 : error(operation, "fenced"), current];
+				if (sourceIsFenced(source, existing)) return [error(operation, "fenced"), current];
+			} else if (current.entries.size >= capacity.maxSources) return [error(operation, "budget"), current];
+			const nextSourceBytes = current.sourceBytes - (existing?.sourceBytes ?? 0) + sourceBytes;
+			if (nextSourceBytes > maxSourceBytes) return [error(operation, "budget"), current];
+			const entries = new Map(current.entries);
+			entries.set(id, {
+				_tag: "Withdrawn",
+				source,
+				sourceBytes
+			});
+			return [void 0, {
+				...current,
+				entries,
+				sourceBytes: nextSourceBytes
+			}];
+		});
+		if (failure !== void 0) return yield* failure;
+	});
+	const search = Effect.fn("InMemorySemanticIndex.search")(function* (rawQuery) {
+		const operation = "search semantic memory index";
+		yield* ensureOpen(operation);
+		const query = yield* decodeBoundary(MemoryIndexQuery.Wire, rawQuery, operation);
+		const vector = Object.freeze([...query.vector]);
+		if (!validVector(vector, profile)) return yield* error(operation, "invalid-input");
+		const current = yield* Ref.get(data);
+		if (current.closed) return yield* error(operation, "unavailable");
+		let scannedChunks = 0;
+		let inspectedSources = 0;
+		const candidates = [];
+		for (const entry of current.entries.values()) {
+			inspectedSources += 1;
+			if (inspectedSources % 128 === 0) yield* Effect.yieldNow;
+			if (entry.source.key.namespace.address !== query.namespace.address || entry._tag !== "Indexed") continue;
+			scannedChunks += entry.chunks.length;
+			if (scannedChunks > query.maxScannedChunks) return yield* error(operation, "budget");
+		}
+		for (const entry of current.entries.values()) {
+			if (entry.source.key.namespace.address !== query.namespace.address || entry._tag !== "Indexed") continue;
+			yield* Effect.yieldNow;
+			for (const chunk of entry.chunks) {
+				const score = cosine(vector, chunk.vector);
+				if (score < query.minScore) continue;
+				candidates.push(MemoryIndexCandidate.make({
+					...entry.source,
+					passageId: chunk.passageId,
+					ordinal: chunk.ordinal,
+					startByte: chunk.startByte,
+					endByte: chunk.endByte,
+					text: chunk.text,
+					score,
+					indexedAt: entry.indexedAt
+				}));
+			}
+		}
+		candidates.sort((left, right) => right.score - left.score || compareText(left.key.id, right.key.id) || compareText(left.source.revision, right.source.revision) || left.ordinal - right.ordinal);
+		yield* ensureOpen(operation);
+		return MemoryIndexSearch.make({
+			candidates: candidates.slice(0, query.limit),
+			scannedChunks
+		});
+	});
+	return SemanticMemoryIndex.fromAdapter({
+		profile,
+		replace,
+		withdraw,
+		search
+	});
+});
+/** Scoped disposable semantic index. No persistent build or recovery state is retained. */
+const inMemorySemanticIndexLayer = (profile, capacity) => Layer.effect(SemanticMemoryIndex, makeIndex(profile, capacity));
+//#endregion
+export { InMemorySemanticIndexCapacity, inMemorySemanticIndexLayer, MemorySemanticIndex_exports as t };
+
+//# sourceMappingURL=MemorySemanticIndex.mjs.map

package/dist/MemorySemanticIndex.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"MemorySemanticIndex.mjs","names":[],"sources":["../src/MemorySemanticIndex.ts"],"sourcesContent":["import { MemoryKey } from \"@effect-agent/core/MemoryStore\";\nimport {\n  MemoryIndexCandidate,\n  MemoryIndexError,\n  MemoryIndexQuery,\n  MemoryIndexReplacement,\n  MemoryIndexSearch,\n  MemoryIndexSource,\n  SemanticMemoryChunk,\n  SemanticMemoryIndex,\n  SemanticMemoryProfile,\n} from \"@effect-agent/core/SemanticMemoryIndex\";\nimport { Clock, Effect, Encoding, Layer, Ref, Schema } from \"effect\";\n\nconst PositiveCapacity = Schema.Int.check(Schema.isBetween({ minimum: 1, maximum: 65_536 }));\nconst MaxStoredVectorComponents = 16_777_216;\n\n/**\n * Hard per-Layer bounds for disposable semantic index state. maxChunks times profile dimensions\n * must not exceed 16,777,216 vector components. maxSourceBytes bounds the aggregate UTF-8 JSON\n * of retained source identities and defaults to 16 MiB; it is not a general heap limit.\n */\nexport class InMemorySemanticIndexCapacity extends Schema.Class<InMemorySemanticIndexCapacity>(\n  \"@effect-agent/storage-memory/InMemorySemanticIndexCapacity\",\n)({\n  maxSources: PositiveCapacity,\n  maxChunks: PositiveCapacity,\n  maxSourceBytes: Schema.optionalKey(\n    Schema.Int.check(Schema.isBetween({ minimum: 1, maximum: 67_108_864 })),\n  ),\n}) {}\n\ntype StoredEntry = {\n  readonly source: MemoryIndexSource;\n  readonly sourceBytes: number;\n} & (\n  | {\n      readonly _tag: \"Indexed\";\n      readonly chunks: ReadonlyArray<SemanticMemoryChunk>;\n      readonly indexedAt: number;\n    }\n  | { readonly _tag: \"Withdrawn\" }\n);\n\ninterface IndexData {\n  readonly closed: boolean;\n  readonly entries: ReadonlyMap<string, StoredEntry>;\n  readonly sourceBytes: number;\n}\n\nconst sameProfile = Schema.toEquivalence(SemanticMemoryProfile);\nconst sameSource = Schema.toEquivalence(MemoryIndexSource.Wire);\n\nconst error = (operation: string, reason: MemoryIndexError[\"reason\"]): MemoryIndexError =>\n  MemoryIndexError.make({ operation, reason });\n\nconst keyString = (key: MemoryKey): string => JSON.stringify([key.namespace.address, key.id]);\n\nconst sourceIdentityBytes = (source: MemoryIndexSource): number =>\n  Encoding.encodeHex(JSON.stringify(source)).length / 2;\n\nconst decodeBoundary = Effect.fn(\"InMemorySemanticIndex.decodeBoundary\")(function* <A, I>(\n  schema: Schema.Codec<A, I, never>,\n  value: unknown,\n  operation: string,\n): Effect.fn.Return<A, MemoryIndexError> {\n  return yield* Schema.decodeUnknownEffect(schema)(value).pipe(\n    Effect.flatMap((decoded) => Schema.encodeEffect(schema)(decoded).pipe(Effect.as(decoded))),\n    Effect.mapError(() => error(operation, \"invalid-input\")),\n  );\n});\n\nconst freezeSource = (source: MemoryIndexSource): MemoryIndexSource =>\n  Object.freeze(\n    MemoryIndexSource.make({\n      key: Object.freeze(\n        MemoryKey.make({\n          ...source.key,\n          namespace: Object.freeze({ address: source.key.namespace.address }),\n        }),\n      ),\n      source: Object.freeze({ ...source.source }),\n      sourceGeneration: source.sourceGeneration,\n    }),\n  );\n\nconst freezeChunk = (chunk: SemanticMemoryChunk): SemanticMemoryChunk =>\n  Object.freeze(SemanticMemoryChunk.make({ ...chunk, vector: Object.freeze([...chunk.vector]) }));\n\nconst sourceIsFenced = (source: MemoryIndexSource, existing: StoredEntry): boolean =>\n  source.sourceGeneration < existing.source.sourceGeneration ||\n  (source.sourceGeneration === existing.source.sourceGeneration &&\n    !sameSource(source, existing.source));\n\nconst squaredNorm = (vector: ReadonlyArray<number>): number | null => {\n  let sum = 0;\n\n  for (const value of vector) {\n    sum += value * value;\n    if (!Number.isFinite(sum)) return null;\n  }\n\n  return sum > 0 ? sum : null;\n};\n\nconst validVector = (vector: ReadonlyArray<number>, profile: SemanticMemoryProfile): boolean =>\n  vector.length === profile.dimensions && squaredNorm(vector) !== null;\n\nconst validateChunks = Effect.fn(\"InMemorySemanticIndex.validateChunks\")(function* (\n  chunks: ReadonlyArray<SemanticMemoryChunk>,\n  profile: SemanticMemoryProfile,\n  operation: string,\n): Effect.fn.Return<void, MemoryIndexError> {\n  let nextByte = 0;\n  const passageIds = new Set<string>();\n\n  for (let index = 0; index < chunks.length; index++) {\n    const chunk = chunks[index];\n    const byteLength = Encoding.encodeHex(chunk.text).length / 2;\n\n    if (\n      chunk.ordinal !== index ||\n      chunk.startByte !== nextByte ||\n      chunk.endByte <= chunk.startByte ||\n      chunk.endByte - chunk.startByte !== byteLength ||\n      byteLength > profile.maxChunkBytes ||\n      passageIds.has(chunk.passageId) ||\n      !validVector(chunk.vector, profile)\n    ) {\n      return yield* error(operation, \"invalid-input\");\n    }\n    passageIds.add(chunk.passageId);\n    nextByte = chunk.endByte;\n  }\n});\n\nconst cosine = (left: ReadonlyArray<number>, right: ReadonlyArray<number>): number => {\n  const leftNorm = Math.sqrt(squaredNorm(left) ?? 1);\n  const rightNorm = Math.sqrt(squaredNorm(right) ?? 1);\n  let score = 0;\n\n  for (let index = 0; index < left.length; index++) {\n    score += (left[index] / leftNorm) * (right[index] / rightNorm);\n  }\n  const bounded = Math.max(-1, Math.min(1, score));\n\n  return bounded === 0 ? 0 : bounded;\n};\n\nconst compareText = (left: string, right: string): number =>\n  left < right ? -1 : left > right ? 1 : 0;\n\nconst makeIndex = Effect.fn(\"InMemorySemanticIndex.make\")(function* (\n  rawProfile: SemanticMemoryProfile,\n  rawCapacity: InMemorySemanticIndexCapacity,\n) {\n  const profile = Object.freeze(\n    SemanticMemoryProfile.make({\n      ...(yield* decodeBoundary(\n        SemanticMemoryProfile,\n        rawProfile,\n        \"configure semantic memory index\",\n      )),\n    }),\n  );\n\n  const capacity = yield* decodeBoundary(\n    InMemorySemanticIndexCapacity,\n    rawCapacity,\n    \"configure semantic memory index\",\n  );\n\n  if (capacity.maxChunks * profile.dimensions > MaxStoredVectorComponents) {\n    return yield* error(\"configure semantic memory index\", \"invalid-input\");\n  }\n  const maxSourceBytes = capacity.maxSourceBytes ?? 16_777_216;\n  const data = yield* Ref.make<IndexData>({ closed: false, entries: new Map(), sourceBytes: 0 });\n\n  yield* Effect.addFinalizer(() =>\n    Ref.set(data, { closed: true, entries: new Map(), sourceBytes: 0 }),\n  );\n\n  const ensureOpen = Effect.fn(\"InMemorySemanticIndex.ensureOpen\")(function* (operation: string) {\n    if ((yield* Ref.get(data)).closed) return yield* error(operation, \"unavailable\");\n  });\n\n  const replace: SemanticMemoryIndex[\"Service\"][\"replace\"] = Effect.fn(\n    \"InMemorySemanticIndex.replace\",\n  )(function* (rawRequest) {\n    const operation = \"replace semantic memory source\";\n\n    yield* ensureOpen(operation);\n    const request = yield* decodeBoundary(MemoryIndexReplacement.Wire, rawRequest, operation);\n    const source = freezeSource(request.source);\n    const sourceBytes = sourceIdentityBytes(source);\n    const chunks = Object.freeze(request.chunks.map(freezeChunk));\n\n    if (source.source.id !== source.key.id) return yield* error(operation, \"invalid-input\");\n    if (!sameProfile(request.profile, profile)) return yield* error(operation, \"incompatible\");\n    yield* validateChunks(chunks, profile, operation);\n    const indexedAt = yield* Clock.currentTimeMillis;\n\n    const failure = yield* Ref.modify(\n      data,\n      (current): readonly [MemoryIndexError | undefined, IndexData] => {\n        if (current.closed) return [error(operation, \"unavailable\"), current];\n        const id = keyString(source.key);\n        const existing = current.entries.get(id);\n\n        if (\n          existing !== undefined &&\n          (existing._tag === \"Withdrawn\" || sourceIsFenced(source, existing))\n        ) {\n          return [error(operation, \"fenced\"), current];\n        }\n        if (existing === undefined && current.entries.size >= capacity.maxSources) {\n          return [error(operation, \"budget\"), current];\n        }\n        const nextSourceBytes = current.sourceBytes - (existing?.sourceBytes ?? 0) + sourceBytes;\n\n        if (nextSourceBytes > maxSourceBytes) return [error(operation, \"budget\"), current];\n        let count = chunks.length;\n\n        for (const [entryId, entry] of current.entries) {\n          if (entryId !== id && entry._tag === \"Indexed\") count += entry.chunks.length;\n        }\n        if (count > capacity.maxChunks) return [error(operation, \"budget\"), current];\n        const entries = new Map(current.entries);\n\n        entries.set(id, { _tag: \"Indexed\", source, sourceBytes, chunks, indexedAt });\n\n        return [undefined, { ...current, entries, sourceBytes: nextSourceBytes }];\n      },\n    );\n\n    if (failure !== undefined) return yield* failure;\n  });\n\n  const withdraw: SemanticMemoryIndex[\"Service\"][\"withdraw\"] = Effect.fn(\n    \"InMemorySemanticIndex.withdraw\",\n  )(function* (rawSource) {\n    const operation = \"withdraw semantic memory source\";\n\n    yield* ensureOpen(operation);\n\n    const source = freezeSource(\n      yield* decodeBoundary(MemoryIndexSource.Wire, rawSource, operation),\n    );\n\n    const sourceBytes = sourceIdentityBytes(source);\n\n    if (source.source.id !== source.key.id) return yield* error(operation, \"invalid-input\");\n\n    const failure = yield* Ref.modify(\n      data,\n      (current): readonly [MemoryIndexError | undefined, IndexData] => {\n        if (current.closed) return [error(operation, \"unavailable\"), current];\n        const id = keyString(source.key);\n        const existing = current.entries.get(id);\n\n        if (existing !== undefined) {\n          if (existing._tag === \"Withdrawn\") {\n            return [\n              sameSource(source, existing.source) ? undefined : error(operation, \"fenced\"),\n              current,\n            ];\n          }\n          if (sourceIsFenced(source, existing)) return [error(operation, \"fenced\"), current];\n        } else if (current.entries.size >= capacity.maxSources) {\n          return [error(operation, \"budget\"), current];\n        }\n        const nextSourceBytes = current.sourceBytes - (existing?.sourceBytes ?? 0) + sourceBytes;\n\n        if (nextSourceBytes > maxSourceBytes) return [error(operation, \"budget\"), current];\n        const entries = new Map(current.entries);\n\n        entries.set(id, { _tag: \"Withdrawn\", source, sourceBytes });\n\n        return [undefined, { ...current, entries, sourceBytes: nextSourceBytes }];\n      },\n    );\n\n    if (failure !== undefined) return yield* failure;\n  });\n\n  const search = Effect.fn(\"InMemorySemanticIndex.search\")(function* (rawQuery: MemoryIndexQuery) {\n    const operation = \"search semantic memory index\";\n\n    yield* ensureOpen(operation);\n    const query = yield* decodeBoundary(MemoryIndexQuery.Wire, rawQuery, operation);\n    const vector = Object.freeze([...query.vector]);\n\n    if (!validVector(vector, profile)) return yield* error(operation, \"invalid-input\");\n    const current = yield* Ref.get(data);\n\n    if (current.closed) return yield* error(operation, \"unavailable\");\n    let scannedChunks = 0;\n    let inspectedSources = 0;\n    const candidates: Array<MemoryIndexCandidate> = [];\n\n    for (const entry of current.entries.values()) {\n      inspectedSources += 1;\n      if (inspectedSources % 128 === 0) yield* Effect.yieldNow;\n      if (\n        entry.source.key.namespace.address !== query.namespace.address ||\n        entry._tag !== \"Indexed\"\n      )\n        continue;\n      scannedChunks += entry.chunks.length;\n      if (scannedChunks > query.maxScannedChunks) return yield* error(operation, \"budget\");\n    }\n    for (const entry of current.entries.values()) {\n      if (\n        entry.source.key.namespace.address !== query.namespace.address ||\n        entry._tag !== \"Indexed\"\n      )\n        continue;\n      yield* Effect.yieldNow;\n      for (const chunk of entry.chunks) {\n        const score = cosine(vector, chunk.vector);\n\n        if (score < query.minScore) continue;\n        candidates.push(\n          MemoryIndexCandidate.make({\n            ...entry.source,\n            passageId: chunk.passageId,\n            ordinal: chunk.ordinal,\n            startByte: chunk.startByte,\n            endByte: chunk.endByte,\n            text: chunk.text,\n            score,\n            indexedAt: entry.indexedAt,\n          }),\n        );\n      }\n    }\n    candidates.sort(\n      (left, right) =>\n        right.score - left.score ||\n        compareText(left.key.id, right.key.id) ||\n        compareText(left.source.revision, right.source.revision) ||\n        left.ordinal - right.ordinal,\n    );\n    yield* ensureOpen(operation);\n\n    return MemoryIndexSearch.make({ candidates: candidates.slice(0, query.limit), scannedChunks });\n  });\n\n  return SemanticMemoryIndex.fromAdapter({ profile, replace, withdraw, search });\n});\n\n/** Scoped disposable semantic index. No persistent build or recovery state is retained. */\nexport const inMemorySemanticIndexLayer = (\n  profile: SemanticMemoryProfile,\n  capacity: InMemorySemanticIndexCapacity,\n): Layer.Layer<SemanticMemoryIndex, MemoryIndexError> =>\n  Layer.effect(SemanticMemoryIndex, makeIndex(profile, capacity));\n"],"mappings":";;;;;;;;;AAcA,MAAM,mBAAmB,OAAO,IAAI,MAAM,OAAO,UAAU;CAAE,SAAS;CAAG,SAAS;AAAO,CAAC,CAAC;AAC3F,MAAM,4BAA4B;;;;;;AAOlC,IAAa,gCAAb,cAAmD,OAAO,MACxD,4DACF,CAAC,CAAC;CACA,YAAY;CACZ,WAAW;CACX,gBAAgB,OAAO,YACrB,OAAO,IAAI,MAAM,OAAO,UAAU;EAAE,SAAS;EAAG,SAAS;CAAW,CAAC,CAAC,CACxE;AACF,CAAC,CAAC,CAAC,CAAC;AAoBJ,MAAM,cAAc,OAAO,cAAc,qBAAqB;AAC9D,MAAM,aAAa,OAAO,cAAc,kBAAkB,IAAI;AAE9D,MAAM,SAAS,WAAmB,WAChC,iBAAiB,KAAK;CAAE;CAAW;AAAO,CAAC;AAE7C,MAAM,aAAa,QAA2B,KAAK,UAAU,CAAC,IAAI,UAAU,SAAS,IAAI,EAAE,CAAC;AAE5F,MAAM,uBAAuB,WAC3B,SAAS,UAAU,KAAK,UAAU,MAAM,CAAC,CAAC,CAAC,SAAS;AAEtD,MAAM,iBAAiB,OAAO,GAAG,sCAAsC,CAAC,CAAC,WACvE,QACA,OACA,WACuC;CACvC,OAAO,OAAO,OAAO,oBAAoB,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,KACtD,OAAO,SAAS,YAAY,OAAO,aAAa,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,OAAO,GAAG,OAAO,CAAC,CAAC,GACzF,OAAO,eAAe,MAAM,WAAW,eAAe,CAAC,CACzD;AACF,CAAC;AAED,MAAM,gBAAgB,WACpB,OAAO,OACL,kBAAkB,KAAK;CACrB,KAAK,OAAO,OACV,UAAU,KAAK;EACb,GAAG,OAAO;EACV,WAAW,OAAO,OAAO,EAAE,SAAS,OAAO,IAAI,UAAU,QAAQ,CAAC;CACpE,CAAC,CACH;CACA,QAAQ,OAAO,OAAO,EAAE,GAAG,OAAO,OAAO,CAAC;CAC1C,kBAAkB,OAAO;AAC3B,CAAC,CACH;AAEF,MAAM,eAAe,UACnB,OAAO,OAAO,oBAAoB,KAAK;CAAE,GAAG;CAAO,QAAQ,OAAO,OAAO,CAAC,GAAG,MAAM,MAAM,CAAC;AAAE,CAAC,CAAC;AAEhG,MAAM,kBAAkB,QAA2B,aACjD,OAAO,mBAAmB,SAAS,OAAO,oBACzC,OAAO,qBAAqB,SAAS,OAAO,oBAC3C,CAAC,WAAW,QAAQ,SAAS,MAAM;AAEvC,MAAM,eAAe,WAAiD;CACpE,IAAI,MAAM;CAEV,KAAK,MAAM,SAAS,QAAQ;EAC1B,OAAO,QAAQ;EACf,IAAI,CAAC,OAAO,SAAS,GAAG,GAAG,OAAO;CACpC;CAEA,OAAO,MAAM,IAAI,MAAM;AACzB;AAEA,MAAM,eAAe,QAA+B,YAClD,OAAO,WAAW,QAAQ,cAAc,YAAY,MAAM,MAAM;AAElE,MAAM,iBAAiB,OAAO,GAAG,sCAAsC,CAAC,CAAC,WACvE,QACA,SACA,WAC0C;CAC1C,IAAI,WAAW;CACf,MAAM,6BAAa,IAAI,IAAY;CAEnC,KAAK,IAAI,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS;EAClD,MAAM,QAAQ,OAAO;EACrB,MAAM,aAAa,SAAS,UAAU,MAAM,IAAI,CAAC,CAAC,SAAS;EAE3D,IACE,MAAM,YAAY,SAClB,MAAM,cAAc,YACpB,MAAM,WAAW,MAAM,aACvB,MAAM,UAAU,MAAM,cAAc,cACpC,aAAa,QAAQ,iBACrB,WAAW,IAAI,MAAM,SAAS,KAC9B,CAAC,YAAY,MAAM,QAAQ,OAAO,GAElC,OAAO,OAAO,MAAM,WAAW,eAAe;EAEhD,WAAW,IAAI,MAAM,SAAS;EAC9B,WAAW,MAAM;CACnB;AACF,CAAC;AAED,MAAM,UAAU,MAA6B,UAAyC;CACpF,MAAM,WAAW,KAAK,KAAK,YAAY,IAAI,KAAK,CAAC;CACjD,MAAM,YAAY,KAAK,KAAK,YAAY,KAAK,KAAK,CAAC;CACnD,IAAI,QAAQ;CAEZ,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,QAAQ,SACvC,SAAU,KAAK,SAAS,YAAa,MAAM,SAAS;CAEtD,MAAM,UAAU,KAAK,IAAI,IAAI,KAAK,IAAI,GAAG,KAAK,CAAC;CAE/C,OAAO,YAAY,IAAI,IAAI;AAC7B;AAEA,MAAM,eAAe,MAAc,UACjC,OAAO,QAAQ,KAAK,OAAO,QAAQ,IAAI;AAEzC,MAAM,YAAY,OAAO,GAAG,4BAA4B,CAAC,CAAC,WACxD,YACA,aACA;CACA,MAAM,UAAU,OAAO,OACrB,sBAAsB,KAAK,EACzB,GAAI,OAAO,eACT,uBACA,YACA,iCACF,EACF,CAAC,CACH;CAEA,MAAM,WAAW,OAAO,eACtB,+BACA,aACA,iCACF;CAEA,IAAI,SAAS,YAAY,QAAQ,aAAa,2BAC5C,OAAO,OAAO,MAAM,mCAAmC,eAAe;CAExE,MAAM,iBAAiB,SAAS,kBAAkB;CAClD,MAAM,OAAO,OAAO,IAAI,KAAgB;EAAE,QAAQ;EAAO,yBAAS,IAAI,IAAI;EAAG,aAAa;CAAE,CAAC;CAE7F,OAAO,OAAO,mBACZ,IAAI,IAAI,MAAM;EAAE,QAAQ;EAAM,yBAAS,IAAI,IAAI;EAAG,aAAa;CAAE,CAAC,CACpE;CAEA,MAAM,aAAa,OAAO,GAAG,kCAAkC,CAAC,CAAC,WAAW,WAAmB;EAC7F,KAAK,OAAO,IAAI,IAAI,IAAI,EAAA,CAAG,QAAQ,OAAO,OAAO,MAAM,WAAW,aAAa;CACjF,CAAC;CAED,MAAM,UAAqD,OAAO,GAChE,+BACF,CAAC,CAAC,WAAW,YAAY;EACvB,MAAM,YAAY;EAElB,OAAO,WAAW,SAAS;EAC3B,MAAM,UAAU,OAAO,eAAe,uBAAuB,MAAM,YAAY,SAAS;EACxF,MAAM,SAAS,aAAa,QAAQ,MAAM;EAC1C,MAAM,cAAc,oBAAoB,MAAM;EAC9C,MAAM,SAAS,OAAO,OAAO,QAAQ,OAAO,IAAI,WAAW,CAAC;EAE5D,IAAI,OAAO,OAAO,OAAO,OAAO,IAAI,IAAI,OAAO,OAAO,MAAM,WAAW,eAAe;EACtF,IAAI,CAAC,YAAY,QAAQ,SAAS,OAAO,GAAG,OAAO,OAAO,MAAM,WAAW,cAAc;EACzF,OAAO,eAAe,QAAQ,SAAS,SAAS;EAChD,MAAM,YAAY,OAAO,MAAM;EAE/B,MAAM,UAAU,OAAO,IAAI,OACzB,OACC,YAAgE;GAC/D,IAAI,QAAQ,QAAQ,OAAO,CAAC,MAAM,WAAW,aAAa,GAAG,OAAO;GACpE,MAAM,KAAK,UAAU,OAAO,GAAG;GAC/B,MAAM,WAAW,QAAQ,QAAQ,IAAI,EAAE;GAEvC,IACE,aAAa,KAAA,MACZ,SAAS,SAAS,eAAe,eAAe,QAAQ,QAAQ,IAEjE,OAAO,CAAC,MAAM,WAAW,QAAQ,GAAG,OAAO;GAE7C,IAAI,aAAa,KAAA,KAAa,QAAQ,QAAQ,QAAQ,SAAS,YAC7D,OAAO,CAAC,MAAM,WAAW,QAAQ,GAAG,OAAO;GAE7C,MAAM,kBAAkB,QAAQ,eAAe,UAAU,eAAe,KAAK;GAE7E,IAAI,kBAAkB,gBAAgB,OAAO,CAAC,MAAM,WAAW,QAAQ,GAAG,OAAO;GACjF,IAAI,QAAQ,OAAO;GAEnB,KAAK,MAAM,CAAC,SAAS,UAAU,QAAQ,SACrC,IAAI,YAAY,MAAM,MAAM,SAAS,WAAW,SAAS,MAAM,OAAO;GAExE,IAAI,QAAQ,SAAS,WAAW,OAAO,CAAC,MAAM,WAAW,QAAQ,GAAG,OAAO;GAC3E,MAAM,UAAU,IAAI,IAAI,QAAQ,OAAO;GAEvC,QAAQ,IAAI,IAAI;IAAE,MAAM;IAAW;IAAQ;IAAa;IAAQ;GAAU,CAAC;GAE3E,OAAO,CAAC,KAAA,GAAW;IAAE,GAAG;IAAS;IAAS,aAAa;GAAgB,CAAC;EAC1E,CACF;EAEA,IAAI,YAAY,KAAA,GAAW,OAAO,OAAO;CAC3C,CAAC;CAED,MAAM,WAAuD,OAAO,GAClE,gCACF,CAAC,CAAC,WAAW,WAAW;EACtB,MAAM,YAAY;EAElB,OAAO,WAAW,SAAS;EAE3B,MAAM,SAAS,aACb,OAAO,eAAe,kBAAkB,MAAM,WAAW,SAAS,CACpE;EAEA,MAAM,cAAc,oBAAoB,MAAM;EAE9C,IAAI,OAAO,OAAO,OAAO,OAAO,IAAI,IAAI,OAAO,OAAO,MAAM,WAAW,eAAe;EAEtF,MAAM,UAAU,OAAO,IAAI,OACzB,OACC,YAAgE;GAC/D,IAAI,QAAQ,QAAQ,OAAO,CAAC,MAAM,WAAW,aAAa,GAAG,OAAO;GACpE,MAAM,KAAK,UAAU,OAAO,GAAG;GAC/B,MAAM,WAAW,QAAQ,QAAQ,IAAI,EAAE;GAEvC,IAAI,aAAa,KAAA,GAAW;IAC1B,IAAI,SAAS,SAAS,aACpB,OAAO,CACL,WAAW,QAAQ,SAAS,MAAM,IAAI,KAAA,IAAY,MAAM,WAAW,QAAQ,GAC3E,OACF;IAEF,IAAI,eAAe,QAAQ,QAAQ,GAAG,OAAO,CAAC,MAAM,WAAW,QAAQ,GAAG,OAAO;GACnF,OAAO,IAAI,QAAQ,QAAQ,QAAQ,SAAS,YAC1C,OAAO,CAAC,MAAM,WAAW,QAAQ,GAAG,OAAO;GAE7C,MAAM,kBAAkB,QAAQ,eAAe,UAAU,eAAe,KAAK;GAE7E,IAAI,kBAAkB,gBAAgB,OAAO,CAAC,MAAM,WAAW,QAAQ,GAAG,OAAO;GACjF,MAAM,UAAU,IAAI,IAAI,QAAQ,OAAO;GAEvC,QAAQ,IAAI,IAAI;IAAE,MAAM;IAAa;IAAQ;GAAY,CAAC;GAE1D,OAAO,CAAC,KAAA,GAAW;IAAE,GAAG;IAAS;IAAS,aAAa;GAAgB,CAAC;EAC1E,CACF;EAEA,IAAI,YAAY,KAAA,GAAW,OAAO,OAAO;CAC3C,CAAC;CAED,MAAM,SAAS,OAAO,GAAG,8BAA8B,CAAC,CAAC,WAAW,UAA4B;EAC9F,MAAM,YAAY;EAElB,OAAO,WAAW,SAAS;EAC3B,MAAM,QAAQ,OAAO,eAAe,iBAAiB,MAAM,UAAU,SAAS;EAC9E,MAAM,SAAS,OAAO,OAAO,CAAC,GAAG,MAAM,MAAM,CAAC;EAE9C,IAAI,CAAC,YAAY,QAAQ,OAAO,GAAG,OAAO,OAAO,MAAM,WAAW,eAAe;EACjF,MAAM,UAAU,OAAO,IAAI,IAAI,IAAI;EAEnC,IAAI,QAAQ,QAAQ,OAAO,OAAO,MAAM,WAAW,aAAa;EAChE,IAAI,gBAAgB;EACpB,IAAI,mBAAmB;EACvB,MAAM,aAA0C,CAAC;EAEjD,KAAK,MAAM,SAAS,QAAQ,QAAQ,OAAO,GAAG;GAC5C,oBAAoB;GACpB,IAAI,mBAAmB,QAAQ,GAAG,OAAO,OAAO;GAChD,IACE,MAAM,OAAO,IAAI,UAAU,YAAY,MAAM,UAAU,WACvD,MAAM,SAAS,WAEf;GACF,iBAAiB,MAAM,OAAO;GAC9B,IAAI,gBAAgB,MAAM,kBAAkB,OAAO,OAAO,MAAM,WAAW,QAAQ;EACrF;EACA,KAAK,MAAM,SAAS,QAAQ,QAAQ,OAAO,GAAG;GAC5C,IACE,MAAM,OAAO,IAAI,UAAU,YAAY,MAAM,UAAU,WACvD,MAAM,SAAS,WAEf;GACF,OAAO,OAAO;GACd,KAAK,MAAM,SAAS,MAAM,QAAQ;IAChC,MAAM,QAAQ,OAAO,QAAQ,MAAM,MAAM;IAEzC,IAAI,QAAQ,MAAM,UAAU;IAC5B,WAAW,KACT,qBAAqB,KAAK;KACxB,GAAG,MAAM;KACT,WAAW,MAAM;KACjB,SAAS,MAAM;KACf,WAAW,MAAM;KACjB,SAAS,MAAM;KACf,MAAM,MAAM;KACZ;KACA,WAAW,MAAM;IACnB,CAAC,CACH;GACF;EACF;EACA,WAAW,MACR,MAAM,UACL,MAAM,QAAQ,KAAK,SACnB,YAAY,KAAK,IAAI,IAAI,MAAM,IAAI,EAAE,KACrC,YAAY,KAAK,OAAO,UAAU,MAAM,OAAO,QAAQ,KACvD,KAAK,UAAU,MAAM,OACzB;EACA,OAAO,WAAW,SAAS;EAE3B,OAAO,kBAAkB,KAAK;GAAE,YAAY,WAAW,MAAM,GAAG,MAAM,KAAK;GAAG;EAAc,CAAC;CAC/F,CAAC;CAED,OAAO,oBAAoB,YAAY;EAAE;EAAS;EAAS;EAAU;CAAO,CAAC;AAC/E,CAAC;;AAGD,MAAa,8BACX,SACA,aAEA,MAAM,OAAO,qBAAqB,UAAU,SAAS,QAAQ,CAAC"}

package/dist/MemorySubmissionLedger.d.mts

@@ -0,0 +1,24 @@
+import { Effect, Layer, Option } from "effect";
+import { SubmissionLedger } from "@effect-agent/thread/SubmissionLedger";
+declare namespace MemorySubmissionLedger_d_exports {
+  export { MemorySubmissionLedgerLive, MemorySubmissionLedgerOptions, memorySubmissionLedgerLayer };
+}
+/** Construction options for the in-memory reference SubmissionLedger. */
+interface MemorySubmissionLedgerOptions {
+  /**
+   * Test-only fault seam for `resolveAdmission` (SUB-031): when the effect yields a reason,
+   * the resolution answers `Indeterminate` with it instead of consulting the store — modelling
+   * an authoritative child owner that is temporarily unreachable. `Option.none()` restores the
+   * store-derived answer. Ledger state is never mutated by the fault.
+   */
+  readonly resolveAdmissionFault?: Effect.Effect<Option.Option<string>>;
+}
+/**
+ * In-memory reference SubmissionLedger Layer (durability `non-durable`). All state lives in one
+ * `Ref` owned by the Layer's Scope; no daemon fibers are spawned and no wall clock is consulted.
+ */
+declare const memorySubmissionLedgerLayer: (options?: MemorySubmissionLedgerOptions) => Layer.Layer<SubmissionLedger>;
+declare const MemorySubmissionLedgerLive: Layer.Layer<SubmissionLedger>;
+//#endregion
+export { MemorySubmissionLedgerLive, MemorySubmissionLedgerOptions, memorySubmissionLedgerLayer, MemorySubmissionLedger_d_exports as t };
+//# sourceMappingURL=MemorySubmissionLedger.d.mts.map