@yielded/agent-storage-memory 0.1.0-beta.166
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/LICENSE +21 -0
- package/dist/MemoryMessageDeliveryStore.d.mts +15 -0
- package/dist/MemoryMessageDeliveryStore.mjs +190 -0
- package/dist/MemoryMessageDeliveryStore.mjs.map +1 -0
- package/dist/MemoryScheduleStore.d.mts +10 -0
- package/dist/MemoryScheduleStore.mjs +169 -0
- package/dist/MemoryScheduleStore.mjs.map +1 -0
- package/dist/MemorySemanticIndex.d.mts +21 -0
- package/dist/MemorySemanticIndex.mjs +223 -0
- package/dist/MemorySemanticIndex.mjs.map +1 -0
- package/dist/MemorySubmissionLedger.d.mts +24 -0
- package/dist/MemorySubmissionLedger.mjs +1167 -0
- package/dist/MemorySubmissionLedger.mjs.map +1 -0
- package/dist/MemorySubscriptionStore.d.mts +9 -0
- package/dist/MemorySubscriptionStore.mjs +849 -0
- package/dist/MemorySubscriptionStore.mjs.map +1 -0
- package/dist/MemoryThreadStore.d.mts +17 -0
- package/dist/MemoryThreadStore.mjs +480 -0
- package/dist/MemoryThreadStore.mjs.map +1 -0
- package/dist/index.d.mts +7 -0
- package/dist/index.mjs +7 -0
- package/dist/rolldown-runtime-D7D4PA-g.mjs +13 -0
- package/package.json +1 -0
- package/src/MemoryMessageDeliveryStore.ts +373 -0
- package/src/MemoryScheduleStore.ts +328 -0
- package/src/MemorySemanticIndex.ts +358 -0
- package/src/MemorySubmissionLedger.ts +2844 -0
- package/src/MemorySubscriptionStore.ts +1549 -0
- package/src/MemoryThreadStore.ts +953 -0
- package/src/index.ts +6 -0
package/LICENSE
ADDED
|
@@ -0,0 +1,21 @@
|
|
|
1
|
+
MIT License
|
|
2
|
+
|
|
3
|
+
Copyright (c) 2026 Daniel van der Merwe
|
|
4
|
+
|
|
5
|
+
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
6
|
+
of this software and associated documentation files (the "Software"), to deal
|
|
7
|
+
in the Software without restriction, including without limitation the rights
|
|
8
|
+
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
9
|
+
copies of the Software, and to permit persons to whom the Software is
|
|
10
|
+
furnished to do so, subject to the following conditions:
|
|
11
|
+
|
|
12
|
+
The above copyright notice and this permission notice shall be included in all
|
|
13
|
+
copies or substantial portions of the Software.
|
|
14
|
+
|
|
15
|
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
16
|
+
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
17
|
+
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
18
|
+
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
19
|
+
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
20
|
+
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
21
|
+
SOFTWARE.
|
|
@@ -0,0 +1,15 @@
|
|
|
1
|
+
import { Layer } from "effect";
|
|
2
|
+
import { MessageDeliveryError, MessageDeliveryStore, MessageDeliveryStoreLimits } from "@yielded/agent/message-delivery";
|
|
3
|
+
declare namespace MemoryMessageDeliveryStore_d_exports {
|
|
4
|
+
export { MemoryMessageDeliveryStoreLive, MemoryMessageDeliveryStoreOptions, memoryMessageDeliveryStoreLayer };
|
|
5
|
+
}
|
|
6
|
+
export interface MemoryMessageDeliveryStoreOptions {
|
|
7
|
+
/** UTF-8 bound on the complete stored record, including a processed Settlement. */
|
|
8
|
+
readonly maxStoredValueBytes?: number;
|
|
9
|
+
}
|
|
10
|
+
/** Reference adapter. All retained rows are bounded; completed deduplication evidence is never evicted. */
|
|
11
|
+
export declare const memoryMessageDeliveryStoreLayer: (limits?: MessageDeliveryStoreLimits, options?: MemoryMessageDeliveryStoreOptions) => Layer.Layer<MessageDeliveryStore, MessageDeliveryError>;
|
|
12
|
+
export declare const MemoryMessageDeliveryStoreLive: Layer.Layer<MessageDeliveryStore, MessageDeliveryError, never>;
|
|
13
|
+
//#endregion
|
|
14
|
+
export { MemoryMessageDeliveryStore_d_exports as t };
|
|
15
|
+
//# sourceMappingURL=MemoryMessageDeliveryStore.d.mts.map
|
|
@@ -0,0 +1,190 @@
|
|
|
1
|
+
import { t as __exportAll } from "./rolldown-runtime-D7D4PA-g.mjs";
|
|
2
|
+
import { ScheduleInstant } from "@yielded/agent/schedule";
|
|
3
|
+
import { Effect, Layer, Ref, Schema, Semaphore } from "effect";
|
|
4
|
+
import { ThreadId } from "@yielded/agent/identifiers";
|
|
5
|
+
import { MessageDeliveryChange, MessageDeliveryError, MessageDeliveryFailpoint, MessageDeliveryKey, MessageDeliveryPageRequest, MessageDeliveryRecord, MessageDeliveryStore, MessageDeliveryStoreLimits, applyMessageDeliveryChange, defaultMessageDeliveryStoreLimits, isWorkerUpdateDelivery, messageDeliveryCapacity, messageDeliveryDeadline, messageDeliveryKeyString, messageDeliveryUsesCapacity, sameMessageDeliveryIdentity, validateMessageDelivery } from "@yielded/agent/message-delivery";
|
|
6
|
+
//#region src/MemoryMessageDeliveryStore.ts
|
|
7
|
+
var MemoryMessageDeliveryStore_exports = /* @__PURE__ */ __exportAll({
|
|
8
|
+
MemoryMessageDeliveryStoreLive: () => MemoryMessageDeliveryStoreLive,
|
|
9
|
+
memoryMessageDeliveryStoreLayer: () => memoryMessageDeliveryStoreLayer
|
|
10
|
+
});
|
|
11
|
+
const codec = Schema.fromJsonString(MessageDeliveryRecord);
|
|
12
|
+
const decode = (text) => Schema.decodeEffect(codec)(text).pipe(Effect.mapError(() => MessageDeliveryError.make({
|
|
13
|
+
reason: "corrupt",
|
|
14
|
+
operation: "decode"
|
|
15
|
+
})));
|
|
16
|
+
const Scan = Schema.Struct({
|
|
17
|
+
nowMillis: ScheduleInstant,
|
|
18
|
+
limit: Schema.Int.check(Schema.isGreaterThan(0), Schema.isLessThanOrEqualTo(100)),
|
|
19
|
+
ownerThreadId: Schema.optionalKey(ThreadId)
|
|
20
|
+
});
|
|
21
|
+
/** Reference adapter. All retained rows are bounded; completed deduplication evidence is never evicted. */
|
|
22
|
+
const memoryMessageDeliveryStoreLayer = (limits = defaultMessageDeliveryStoreLimits, options = {}) => Layer.effect(MessageDeliveryStore, Effect.gen(function* () {
|
|
23
|
+
const config = yield* validateMessageDelivery(MessageDeliveryStoreLimits, limits, "limits");
|
|
24
|
+
const maxStoredValueBytes = yield* validateMessageDelivery(Schema.Int.check(Schema.isGreaterThan(0)), options.maxStoredValueBytes ?? 16777216, "stored-value-limit");
|
|
25
|
+
const state = yield* Ref.make({
|
|
26
|
+
records: /* @__PURE__ */ new Map(),
|
|
27
|
+
pending: /* @__PURE__ */ new Map(),
|
|
28
|
+
workers: /* @__PURE__ */ new Map()
|
|
29
|
+
});
|
|
30
|
+
const commit = (record, encoded) => Ref.update(state, (current) => {
|
|
31
|
+
const key = messageDeliveryKeyString(record.key);
|
|
32
|
+
const keys = new Set(current.pending.get(record.key.ownerThreadId));
|
|
33
|
+
if (messageDeliveryUsesCapacity(record)) keys.add(record.key.messageId);
|
|
34
|
+
else keys.delete(record.key.messageId);
|
|
35
|
+
const pending = new Map(current.pending);
|
|
36
|
+
if (keys.size === 0) pending.delete(record.key.ownerThreadId);
|
|
37
|
+
else pending.set(record.key.ownerThreadId, keys);
|
|
38
|
+
const workers = new Map(current.workers);
|
|
39
|
+
const admission = record.envelope.workerAdmission;
|
|
40
|
+
if (admission !== void 0) {
|
|
41
|
+
const worker = admission.origin.worker;
|
|
42
|
+
const startKey = JSON.stringify([
|
|
43
|
+
record.key.ownerThreadId,
|
|
44
|
+
worker.delegationId,
|
|
45
|
+
worker.targetAgentId
|
|
46
|
+
]);
|
|
47
|
+
if (record.key.messageId === admission.origin.firstMessageId) workers.set(startKey, /* @__PURE__ */ new Set([...workers.get(startKey) ?? [], record.key.messageId]));
|
|
48
|
+
const pendingKey = JSON.stringify([record.key.ownerThreadId, worker.threadId]);
|
|
49
|
+
const inputs = new Set(workers.get(pendingKey));
|
|
50
|
+
if ((record.status === "pending" || record.status === "parked") && record.receipt === null) inputs.add(record.key.messageId);
|
|
51
|
+
else inputs.delete(record.key.messageId);
|
|
52
|
+
workers.set(pendingKey, inputs);
|
|
53
|
+
}
|
|
54
|
+
return {
|
|
55
|
+
records: new Map(current.records).set(key, encoded),
|
|
56
|
+
pending,
|
|
57
|
+
workers
|
|
58
|
+
};
|
|
59
|
+
});
|
|
60
|
+
const lock = yield* Semaphore.make(1);
|
|
61
|
+
const failpoint = yield* MessageDeliveryFailpoint;
|
|
62
|
+
const encode = Effect.fn("MemoryMessageDeliveryStore.encode")(function* (record) {
|
|
63
|
+
const text = yield* Schema.encodeEffect(codec)(record).pipe(Effect.mapError(() => MessageDeliveryError.make({
|
|
64
|
+
reason: "corrupt",
|
|
65
|
+
operation: "encode"
|
|
66
|
+
})));
|
|
67
|
+
if (new TextEncoder().encode(text).byteLength > maxStoredValueBytes) return yield* MessageDeliveryError.make({
|
|
68
|
+
reason: "capacity",
|
|
69
|
+
operation: "stored-value-bytes"
|
|
70
|
+
});
|
|
71
|
+
return text;
|
|
72
|
+
});
|
|
73
|
+
const all = Effect.fn("MemoryMessageDeliveryStore.all")(function* () {
|
|
74
|
+
return yield* Effect.forEach((yield* Ref.get(state)).records.values(), decode);
|
|
75
|
+
});
|
|
76
|
+
const insert = Effect.fn("MemoryMessageDeliveryStore.insert")(function* (record) {
|
|
77
|
+
const encoded = yield* encode(record);
|
|
78
|
+
const input = yield* decode(encoded);
|
|
79
|
+
if (input.version !== 1 || input.status !== "pending" || input.leaseUntilMillis !== null || input.retry.attempts !== 0 || input.retry.generation !== 0 || input.retry.automaticAttempts !== 0 || input.retry.nextAttemptAtMillis !== input.createdAtMillis || input.retry.lastAttemptAtMillis !== null || input.retry.lastFailure !== null || input.deadlineAtMillis !== input.initialDeadlineAtMillis) return yield* MessageDeliveryError.make({
|
|
80
|
+
reason: "validation",
|
|
81
|
+
operation: "insert-state"
|
|
82
|
+
});
|
|
83
|
+
if (new TextEncoder().encode(JSON.stringify(input.envelope)).byteLength > config.maxEnvelopeBytes) return yield* MessageDeliveryError.make({
|
|
84
|
+
reason: "capacity",
|
|
85
|
+
operation: "envelope-bytes"
|
|
86
|
+
});
|
|
87
|
+
yield* failpoint.hit("message-delivery:insert:before");
|
|
88
|
+
const inserted = yield* lock.withPermit(Effect.uninterruptible(Effect.gen(function* () {
|
|
89
|
+
const { records } = yield* Ref.get(state);
|
|
90
|
+
const key = messageDeliveryKeyString(input.key);
|
|
91
|
+
const existingText = records.get(key);
|
|
92
|
+
if (existingText !== void 0) {
|
|
93
|
+
const existing = yield* decode(existingText);
|
|
94
|
+
if (!sameMessageDeliveryIdentity(existing, input)) return yield* MessageDeliveryError.make({
|
|
95
|
+
reason: "conflict",
|
|
96
|
+
operation: "insert"
|
|
97
|
+
});
|
|
98
|
+
return existing;
|
|
99
|
+
}
|
|
100
|
+
const owned = (yield* all()).filter((record) => record.key.ownerThreadId === input.key.ownerThreadId && isWorkerUpdateDelivery(record) === isWorkerUpdateDelivery(input));
|
|
101
|
+
const capacity = messageDeliveryCapacity(config, isWorkerUpdateDelivery(input));
|
|
102
|
+
if (owned.length >= capacity.retained || owned.filter(messageDeliveryUsesCapacity).length >= capacity.pending) return yield* MessageDeliveryError.make({
|
|
103
|
+
reason: "capacity",
|
|
104
|
+
operation: "insert"
|
|
105
|
+
});
|
|
106
|
+
yield* commit(input, encoded);
|
|
107
|
+
return input;
|
|
108
|
+
})));
|
|
109
|
+
yield* failpoint.hit("message-delivery:insert:after");
|
|
110
|
+
return yield* decode(yield* encode(inserted));
|
|
111
|
+
});
|
|
112
|
+
const get = Effect.fn("MemoryMessageDeliveryStore.get")(function* (key) {
|
|
113
|
+
const input = yield* validateMessageDelivery(MessageDeliveryKey, key, "get");
|
|
114
|
+
const text = (yield* Ref.get(state)).records.get(messageDeliveryKeyString(input));
|
|
115
|
+
return text === void 0 ? null : yield* decode(text);
|
|
116
|
+
});
|
|
117
|
+
const change = Effect.fn("MemoryMessageDeliveryStore.change")(function* (key, change) {
|
|
118
|
+
const input = yield* validateMessageDelivery(MessageDeliveryChange, change, "change");
|
|
119
|
+
const decodedKey = yield* validateMessageDelivery(MessageDeliveryKey, key, "change");
|
|
120
|
+
const point = `message-delivery:${input._tag.toLowerCase()}`;
|
|
121
|
+
yield* failpoint.hit(`${point}:before`);
|
|
122
|
+
const changed = yield* lock.withPermit(Effect.uninterruptible(Effect.gen(function* () {
|
|
123
|
+
const existing = yield* get(decodedKey);
|
|
124
|
+
if (existing === null) return yield* MessageDeliveryError.make({
|
|
125
|
+
reason: "not-found",
|
|
126
|
+
operation: "change"
|
|
127
|
+
});
|
|
128
|
+
const next = yield* Effect.fromResult(applyMessageDeliveryChange(existing, input));
|
|
129
|
+
const encoded = yield* encode(next);
|
|
130
|
+
yield* commit(next, encoded);
|
|
131
|
+
return next;
|
|
132
|
+
})));
|
|
133
|
+
yield* failpoint.hit(`${point}:after`);
|
|
134
|
+
return yield* decode(yield* encode(changed));
|
|
135
|
+
});
|
|
136
|
+
return MessageDeliveryStore.of({
|
|
137
|
+
limits: config,
|
|
138
|
+
maxStoredValueBytes,
|
|
139
|
+
insert,
|
|
140
|
+
get,
|
|
141
|
+
change,
|
|
142
|
+
list: Effect.fn("MemoryMessageDeliveryStore.list")(function* (request) {
|
|
143
|
+
const input = yield* validateMessageDelivery(MessageDeliveryPageRequest, request, "list");
|
|
144
|
+
const current = yield* Ref.get(state);
|
|
145
|
+
const workerKey = input.workerStarts !== void 0 ? JSON.stringify([
|
|
146
|
+
input.ownerThreadId,
|
|
147
|
+
input.workerStarts.delegationId,
|
|
148
|
+
input.workerStarts.targetAgentId
|
|
149
|
+
]) : input.pendingWorker !== void 0 ? JSON.stringify([input.ownerThreadId, input.pendingWorker]) : void 0;
|
|
150
|
+
const records = (workerKey !== void 0 || input.pendingOnly ? yield* Effect.forEach([...(workerKey === void 0 ? current.pending.get(input.ownerThreadId) : current.workers.get(workerKey)) ?? []].filter((messageId) => input.after === void 0 || messageId > input.after).sort().slice(0, input.limit + 1), (messageId) => decode(current.records.get(messageDeliveryKeyString({
|
|
151
|
+
ownerThreadId: input.ownerThreadId,
|
|
152
|
+
messageId
|
|
153
|
+
})) ?? "")) : yield* all()).filter((record) => record.key.ownerThreadId === input.ownerThreadId && (input.after === void 0 || record.key.messageId > input.after)).sort((left, right) => left.key.messageId < right.key.messageId ? -1 : left.key.messageId > right.key.messageId ? 1 : 0);
|
|
154
|
+
const items = records.slice(0, input.limit);
|
|
155
|
+
return {
|
|
156
|
+
items,
|
|
157
|
+
next: records.length > input.limit ? items.at(-1)?.key.messageId ?? null : null
|
|
158
|
+
};
|
|
159
|
+
}),
|
|
160
|
+
due: Effect.fn("MemoryMessageDeliveryStore.due")(function* (nowMillis, limit, ownerThreadId) {
|
|
161
|
+
const input = yield* validateMessageDelivery(Scan, {
|
|
162
|
+
nowMillis,
|
|
163
|
+
limit,
|
|
164
|
+
...ownerThreadId === void 0 ? {} : { ownerThreadId }
|
|
165
|
+
}, "due");
|
|
166
|
+
return (yield* all()).flatMap((record) => {
|
|
167
|
+
const deadline = messageDeliveryDeadline(record);
|
|
168
|
+
return deadline !== null && deadline <= input.nowMillis && (input.ownerThreadId === void 0 || input.ownerThreadId === record.key.ownerThreadId) ? [{
|
|
169
|
+
key: record.key,
|
|
170
|
+
deadline
|
|
171
|
+
}] : [];
|
|
172
|
+
}).sort((left, right) => left.deadline - right.deadline || (messageDeliveryKeyString(left.key) < messageDeliveryKeyString(right.key) ? -1 : 1)).slice(0, input.limit).map((record) => record.key);
|
|
173
|
+
}),
|
|
174
|
+
nextDeadline: Effect.fn("MemoryMessageDeliveryStore.nextDeadline")(function* (ownerThreadId) {
|
|
175
|
+
if (ownerThreadId !== void 0) yield* validateMessageDelivery(ThreadId, ownerThreadId, "nextDeadline");
|
|
176
|
+
let next = null;
|
|
177
|
+
for (const record of yield* all()) {
|
|
178
|
+
if (ownerThreadId !== void 0 && ownerThreadId !== record.key.ownerThreadId) continue;
|
|
179
|
+
const deadline = messageDeliveryDeadline(record);
|
|
180
|
+
if (deadline !== null && (next === null || deadline < next)) next = deadline;
|
|
181
|
+
}
|
|
182
|
+
return next;
|
|
183
|
+
})
|
|
184
|
+
});
|
|
185
|
+
}));
|
|
186
|
+
const MemoryMessageDeliveryStoreLive = memoryMessageDeliveryStoreLayer();
|
|
187
|
+
//#endregion
|
|
188
|
+
export { MemoryMessageDeliveryStoreLive, memoryMessageDeliveryStoreLayer, MemoryMessageDeliveryStore_exports as t };
|
|
189
|
+
|
|
190
|
+
//# sourceMappingURL=MemoryMessageDeliveryStore.mjs.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"MemoryMessageDeliveryStore.mjs","names":[],"sources":["../src/MemoryMessageDeliveryStore.ts"],"sourcesContent":["import { ThreadId } from \"@yielded/agent/identifiers\";\nimport {\n applyMessageDeliveryChange,\n defaultMessageDeliveryStoreLimits,\n MessageDeliveryChange,\n MessageDeliveryError,\n MessageDeliveryFailpoint,\n MessageDeliveryKey,\n MessageDeliveryPageRequest,\n MessageDeliveryRecord,\n MessageDeliveryStore,\n MessageDeliveryStoreLimits,\n messageDeliveryDeadline,\n messageDeliveryKeyString,\n messageDeliveryUsesCapacity,\n isWorkerUpdateDelivery,\n messageDeliveryCapacity,\n sameMessageDeliveryIdentity,\n validateMessageDelivery,\n} from \"@yielded/agent/message-delivery\";\nimport { ScheduleInstant } from \"@yielded/agent/schedule\";\nimport { Effect, Layer, Ref, Schema, Semaphore } from \"effect\";\n\nconst codec = Schema.fromJsonString(MessageDeliveryRecord);\n\nconst decode = (text: string) =>\n Schema.decodeEffect(codec)(text).pipe(\n Effect.mapError(() => MessageDeliveryError.make({ reason: \"corrupt\", operation: \"decode\" })),\n );\n\nconst Scan = Schema.Struct({\n nowMillis: ScheduleInstant,\n limit: Schema.Int.check(Schema.isGreaterThan(0), Schema.isLessThanOrEqualTo(100)),\n ownerThreadId: Schema.optionalKey(ThreadId),\n});\n\nexport interface MemoryMessageDeliveryStoreOptions {\n /** UTF-8 bound on the complete stored record, including a processed Settlement. */\n readonly maxStoredValueBytes?: number;\n}\n\n/** Reference adapter. All retained rows are bounded; completed deduplication evidence is never evicted. */\nexport const memoryMessageDeliveryStoreLayer = (\n limits: MessageDeliveryStoreLimits = defaultMessageDeliveryStoreLimits,\n options: MemoryMessageDeliveryStoreOptions = {},\n): Layer.Layer<MessageDeliveryStore, MessageDeliveryError> =>\n Layer.effect(\n MessageDeliveryStore,\n Effect.gen(function* () {\n const config = yield* validateMessageDelivery(MessageDeliveryStoreLimits, limits, \"limits\");\n\n const maxStoredValueBytes = yield* validateMessageDelivery(\n Schema.Int.check(Schema.isGreaterThan(0)),\n options.maxStoredValueBytes ?? 16 * 1_024 * 1_024,\n \"stored-value-limit\",\n );\n\n const state = yield* Ref.make({\n records: new Map<string, string>(),\n pending: new Map<ThreadId, ReadonlySet<MessageDeliveryKey[\"messageId\"]>>(),\n workers: new Map<string, ReadonlySet<MessageDeliveryKey[\"messageId\"]>>(),\n });\n\n const commit = (record: MessageDeliveryRecord, encoded: string) =>\n Ref.update(state, (current) => {\n const key = messageDeliveryKeyString(record.key);\n const keys = new Set(current.pending.get(record.key.ownerThreadId));\n\n if (messageDeliveryUsesCapacity(record)) keys.add(record.key.messageId);\n else keys.delete(record.key.messageId);\n const pending = new Map(current.pending);\n\n if (keys.size === 0) pending.delete(record.key.ownerThreadId);\n else pending.set(record.key.ownerThreadId, keys);\n\n const workers = new Map(current.workers);\n const admission = record.envelope.workerAdmission;\n\n if (admission !== undefined) {\n const worker = admission.origin.worker;\n\n const startKey = JSON.stringify([\n record.key.ownerThreadId,\n worker.delegationId,\n worker.targetAgentId,\n ]);\n\n if (record.key.messageId === admission.origin.firstMessageId)\n workers.set(\n startKey,\n new Set([...(workers.get(startKey) ?? []), record.key.messageId]),\n );\n const pendingKey = JSON.stringify([record.key.ownerThreadId, worker.threadId]);\n const inputs = new Set(workers.get(pendingKey));\n\n if (\n (record.status === \"pending\" || record.status === \"parked\") &&\n record.receipt === null\n )\n inputs.add(record.key.messageId);\n else inputs.delete(record.key.messageId);\n workers.set(pendingKey, inputs);\n }\n\n return { records: new Map(current.records).set(key, encoded), pending, workers };\n });\n\n const lock = yield* Semaphore.make(1);\n const failpoint = yield* MessageDeliveryFailpoint;\n\n const encode = Effect.fn(\"MemoryMessageDeliveryStore.encode\")(function* (\n record: MessageDeliveryRecord,\n ) {\n const text = yield* Schema.encodeEffect(codec)(record).pipe(\n Effect.mapError(() =>\n MessageDeliveryError.make({ reason: \"corrupt\", operation: \"encode\" }),\n ),\n );\n\n if (new TextEncoder().encode(text).byteLength > maxStoredValueBytes) {\n return yield* MessageDeliveryError.make({\n reason: \"capacity\",\n operation: \"stored-value-bytes\",\n });\n }\n\n return text;\n });\n\n const all = Effect.fn(\"MemoryMessageDeliveryStore.all\")(function* () {\n return yield* Effect.forEach((yield* Ref.get(state)).records.values(), decode);\n });\n\n const insert: MessageDeliveryStore[\"Service\"][\"insert\"] = Effect.fn(\n \"MemoryMessageDeliveryStore.insert\",\n )(function* (record) {\n const encoded = yield* encode(record);\n const input = yield* decode(encoded);\n\n if (\n input.version !== 1 ||\n input.status !== \"pending\" ||\n input.leaseUntilMillis !== null ||\n input.retry.attempts !== 0 ||\n input.retry.generation !== 0 ||\n input.retry.automaticAttempts !== 0 ||\n input.retry.nextAttemptAtMillis !== input.createdAtMillis ||\n input.retry.lastAttemptAtMillis !== null ||\n input.retry.lastFailure !== null ||\n input.deadlineAtMillis !== input.initialDeadlineAtMillis\n ) {\n return yield* MessageDeliveryError.make({\n reason: \"validation\",\n operation: \"insert-state\",\n });\n }\n if (\n new TextEncoder().encode(JSON.stringify(input.envelope)).byteLength >\n config.maxEnvelopeBytes\n ) {\n return yield* MessageDeliveryError.make({\n reason: \"capacity\",\n operation: \"envelope-bytes\",\n });\n }\n yield* failpoint.hit(\"message-delivery:insert:before\");\n\n const inserted = yield* lock.withPermit(\n Effect.uninterruptible(\n Effect.gen(function* () {\n const { records } = yield* Ref.get(state);\n const key = messageDeliveryKeyString(input.key);\n const existingText = records.get(key);\n\n if (existingText !== undefined) {\n const existing = yield* decode(existingText);\n\n if (!sameMessageDeliveryIdentity(existing, input))\n return yield* MessageDeliveryError.make({\n reason: \"conflict\",\n operation: \"insert\",\n });\n\n return existing;\n }\n\n const owned = (yield* all()).filter(\n (record) =>\n record.key.ownerThreadId === input.key.ownerThreadId &&\n isWorkerUpdateDelivery(record) === isWorkerUpdateDelivery(input),\n );\n\n const capacity = messageDeliveryCapacity(config, isWorkerUpdateDelivery(input));\n\n if (\n owned.length >= capacity.retained ||\n owned.filter(messageDeliveryUsesCapacity).length >= capacity.pending\n ) {\n return yield* MessageDeliveryError.make({\n reason: \"capacity\",\n operation: \"insert\",\n });\n }\n yield* commit(input, encoded);\n\n return input;\n }),\n ),\n );\n\n yield* failpoint.hit(\"message-delivery:insert:after\");\n\n return yield* decode(yield* encode(inserted));\n });\n\n const get: MessageDeliveryStore[\"Service\"][\"get\"] = Effect.fn(\n \"MemoryMessageDeliveryStore.get\",\n )(function* (key) {\n const input = yield* validateMessageDelivery(MessageDeliveryKey, key, \"get\");\n const text = (yield* Ref.get(state)).records.get(messageDeliveryKeyString(input));\n\n return text === undefined ? null : yield* decode(text);\n });\n\n const change: MessageDeliveryStore[\"Service\"][\"change\"] = Effect.fn(\n \"MemoryMessageDeliveryStore.change\",\n )(function* (key, change) {\n const input = yield* validateMessageDelivery(MessageDeliveryChange, change, \"change\");\n const decodedKey = yield* validateMessageDelivery(MessageDeliveryKey, key, \"change\");\n const point = `message-delivery:${input._tag.toLowerCase()}`;\n\n yield* failpoint.hit(`${point}:before`);\n\n const changed = yield* lock.withPermit(\n Effect.uninterruptible(\n Effect.gen(function* () {\n const existing = yield* get(decodedKey);\n\n if (existing === null)\n return yield* MessageDeliveryError.make({\n reason: \"not-found\",\n operation: \"change\",\n });\n const next = yield* Effect.fromResult(applyMessageDeliveryChange(existing, input));\n const encoded = yield* encode(next);\n\n yield* commit(next, encoded);\n\n return next;\n }),\n ),\n );\n\n yield* failpoint.hit(`${point}:after`);\n\n return yield* decode(yield* encode(changed));\n });\n\n return MessageDeliveryStore.of({\n limits: config,\n maxStoredValueBytes,\n insert,\n get,\n change,\n list: Effect.fn(\"MemoryMessageDeliveryStore.list\")(function* (request) {\n const input = yield* validateMessageDelivery(MessageDeliveryPageRequest, request, \"list\");\n\n const current = yield* Ref.get(state);\n\n const workerKey =\n input.workerStarts !== undefined\n ? JSON.stringify([\n input.ownerThreadId,\n input.workerStarts.delegationId,\n input.workerStarts.targetAgentId,\n ])\n : input.pendingWorker !== undefined\n ? JSON.stringify([input.ownerThreadId, input.pendingWorker])\n : undefined;\n\n const retained =\n workerKey !== undefined || input.pendingOnly\n ? yield* Effect.forEach(\n [\n ...((workerKey === undefined\n ? current.pending.get(input.ownerThreadId)\n : current.workers.get(workerKey)) ?? []),\n ]\n .filter((messageId) => input.after === undefined || messageId > input.after)\n .sort()\n .slice(0, input.limit + 1),\n (messageId) =>\n decode(\n current.records.get(\n messageDeliveryKeyString({ ownerThreadId: input.ownerThreadId, messageId }),\n ) ?? \"\",\n ),\n )\n : yield* all();\n\n const records = retained\n .filter(\n (record) =>\n record.key.ownerThreadId === input.ownerThreadId &&\n (input.after === undefined || record.key.messageId > input.after),\n )\n .sort((left, right) =>\n left.key.messageId < right.key.messageId\n ? -1\n : left.key.messageId > right.key.messageId\n ? 1\n : 0,\n );\n\n const items = records.slice(0, input.limit);\n\n return {\n items,\n next: records.length > input.limit ? (items.at(-1)?.key.messageId ?? null) : null,\n };\n }),\n due: Effect.fn(\"MemoryMessageDeliveryStore.due\")(\n function* (nowMillis, limit, ownerThreadId) {\n const input = yield* validateMessageDelivery(\n Scan,\n { nowMillis, limit, ...(ownerThreadId === undefined ? {} : { ownerThreadId }) },\n \"due\",\n );\n\n return (yield* all())\n .flatMap((record) => {\n const deadline = messageDeliveryDeadline(record);\n\n return deadline !== null &&\n deadline <= input.nowMillis &&\n (input.ownerThreadId === undefined ||\n input.ownerThreadId === record.key.ownerThreadId)\n ? [{ key: record.key, deadline }]\n : [];\n })\n .sort(\n (left, right) =>\n left.deadline - right.deadline ||\n (messageDeliveryKeyString(left.key) < messageDeliveryKeyString(right.key)\n ? -1\n : 1),\n )\n .slice(0, input.limit)\n .map((record) => record.key);\n },\n ),\n nextDeadline: Effect.fn(\"MemoryMessageDeliveryStore.nextDeadline\")(\n function* (ownerThreadId) {\n if (ownerThreadId !== undefined)\n yield* validateMessageDelivery(ThreadId, ownerThreadId, \"nextDeadline\");\n let next: number | null = null;\n\n for (const record of yield* all()) {\n if (ownerThreadId !== undefined && ownerThreadId !== record.key.ownerThreadId)\n continue;\n const deadline = messageDeliveryDeadline(record);\n\n if (deadline !== null && (next === null || deadline < next)) next = deadline;\n }\n\n return next;\n },\n ),\n });\n }),\n );\n\nexport const MemoryMessageDeliveryStoreLive = memoryMessageDeliveryStoreLayer();\n"],"mappings":";;;;;;;;;;AAuBA,MAAM,QAAQ,OAAO,eAAe,qBAAqB;AAEzD,MAAM,UAAU,SACd,OAAO,aAAa,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,KAC/B,OAAO,eAAe,qBAAqB,KAAK;CAAE,QAAQ;CAAW,WAAW;AAAS,CAAC,CAAC,CAC7F;AAEF,MAAM,OAAO,OAAO,OAAO;CACzB,WAAW;CACX,OAAO,OAAO,IAAI,MAAM,OAAO,cAAc,CAAC,GAAG,OAAO,oBAAoB,GAAG,CAAC;CAChF,eAAe,OAAO,YAAY,QAAQ;AAC5C,CAAC;;AAQD,MAAa,mCACX,SAAqC,mCACrC,UAA6C,CAAC,MAE9C,MAAM,OACJ,sBACA,OAAO,IAAI,aAAa;CACtB,MAAM,SAAS,OAAO,wBAAwB,4BAA4B,QAAQ,QAAQ;CAE1F,MAAM,sBAAsB,OAAO,wBACjC,OAAO,IAAI,MAAM,OAAO,cAAc,CAAC,CAAC,GACxC,QAAQ,uBAAuB,UAC/B,oBACF;CAEA,MAAM,QAAQ,OAAO,IAAI,KAAK;EAC5B,yBAAS,IAAI,IAAoB;EACjC,yBAAS,IAAI,IAA4D;EACzE,yBAAS,IAAI,IAA0D;CACzE,CAAC;CAED,MAAM,UAAU,QAA+B,YAC7C,IAAI,OAAO,QAAQ,YAAY;EAC7B,MAAM,MAAM,yBAAyB,OAAO,GAAG;EAC/C,MAAM,OAAO,IAAI,IAAI,QAAQ,QAAQ,IAAI,OAAO,IAAI,aAAa,CAAC;EAElE,IAAI,4BAA4B,MAAM,GAAG,KAAK,IAAI,OAAO,IAAI,SAAS;OACjE,KAAK,OAAO,OAAO,IAAI,SAAS;EACrC,MAAM,UAAU,IAAI,IAAI,QAAQ,OAAO;EAEvC,IAAI,KAAK,SAAS,GAAG,QAAQ,OAAO,OAAO,IAAI,aAAa;OACvD,QAAQ,IAAI,OAAO,IAAI,eAAe,IAAI;EAE/C,MAAM,UAAU,IAAI,IAAI,QAAQ,OAAO;EACvC,MAAM,YAAY,OAAO,SAAS;EAElC,IAAI,cAAc,KAAA,GAAW;GAC3B,MAAM,SAAS,UAAU,OAAO;GAEhC,MAAM,WAAW,KAAK,UAAU;IAC9B,OAAO,IAAI;IACX,OAAO;IACP,OAAO;GACT,CAAC;GAED,IAAI,OAAO,IAAI,cAAc,UAAU,OAAO,gBAC5C,QAAQ,IACN,0BACA,IAAI,IAAI,CAAC,GAAI,QAAQ,IAAI,QAAQ,KAAK,CAAC,GAAI,OAAO,IAAI,SAAS,CAAC,CAClE;GACF,MAAM,aAAa,KAAK,UAAU,CAAC,OAAO,IAAI,eAAe,OAAO,QAAQ,CAAC;GAC7E,MAAM,SAAS,IAAI,IAAI,QAAQ,IAAI,UAAU,CAAC;GAE9C,KACG,OAAO,WAAW,aAAa,OAAO,WAAW,aAClD,OAAO,YAAY,MAEnB,OAAO,IAAI,OAAO,IAAI,SAAS;QAC5B,OAAO,OAAO,OAAO,IAAI,SAAS;GACvC,QAAQ,IAAI,YAAY,MAAM;EAChC;EAEA,OAAO;GAAE,SAAS,IAAI,IAAI,QAAQ,OAAO,CAAC,CAAC,IAAI,KAAK,OAAO;GAAG;GAAS;EAAQ;CACjF,CAAC;CAEH,MAAM,OAAO,OAAO,UAAU,KAAK,CAAC;CACpC,MAAM,YAAY,OAAO;CAEzB,MAAM,SAAS,OAAO,GAAG,mCAAmC,CAAC,CAAC,WAC5D,QACA;EACA,MAAM,OAAO,OAAO,OAAO,aAAa,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,KACrD,OAAO,eACL,qBAAqB,KAAK;GAAE,QAAQ;GAAW,WAAW;EAAS,CAAC,CACtE,CACF;EAEA,IAAI,IAAI,YAAY,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,aAAa,qBAC9C,OAAO,OAAO,qBAAqB,KAAK;GACtC,QAAQ;GACR,WAAW;EACb,CAAC;EAGH,OAAO;CACT,CAAC;CAED,MAAM,MAAM,OAAO,GAAG,gCAAgC,CAAC,CAAC,aAAa;EACnE,OAAO,OAAO,OAAO,SAAS,OAAO,IAAI,IAAI,KAAK,EAAA,CAAG,QAAQ,OAAO,GAAG,MAAM;CAC/E,CAAC;CAED,MAAM,SAAoD,OAAO,GAC/D,mCACF,CAAC,CAAC,WAAW,QAAQ;EACnB,MAAM,UAAU,OAAO,OAAO,MAAM;EACpC,MAAM,QAAQ,OAAO,OAAO,OAAO;EAEnC,IACE,MAAM,YAAY,KAClB,MAAM,WAAW,aACjB,MAAM,qBAAqB,QAC3B,MAAM,MAAM,aAAa,KACzB,MAAM,MAAM,eAAe,KAC3B,MAAM,MAAM,sBAAsB,KAClC,MAAM,MAAM,wBAAwB,MAAM,mBAC1C,MAAM,MAAM,wBAAwB,QACpC,MAAM,MAAM,gBAAgB,QAC5B,MAAM,qBAAqB,MAAM,yBAEjC,OAAO,OAAO,qBAAqB,KAAK;GACtC,QAAQ;GACR,WAAW;EACb,CAAC;EAEH,IACE,IAAI,YAAY,CAAC,CAAC,OAAO,KAAK,UAAU,MAAM,QAAQ,CAAC,CAAC,CAAC,aACzD,OAAO,kBAEP,OAAO,OAAO,qBAAqB,KAAK;GACtC,QAAQ;GACR,WAAW;EACb,CAAC;EAEH,OAAO,UAAU,IAAI,gCAAgC;EAErD,MAAM,WAAW,OAAO,KAAK,WAC3B,OAAO,gBACL,OAAO,IAAI,aAAa;GACtB,MAAM,EAAE,YAAY,OAAO,IAAI,IAAI,KAAK;GACxC,MAAM,MAAM,yBAAyB,MAAM,GAAG;GAC9C,MAAM,eAAe,QAAQ,IAAI,GAAG;GAEpC,IAAI,iBAAiB,KAAA,GAAW;IAC9B,MAAM,WAAW,OAAO,OAAO,YAAY;IAE3C,IAAI,CAAC,4BAA4B,UAAU,KAAK,GAC9C,OAAO,OAAO,qBAAqB,KAAK;KACtC,QAAQ;KACR,WAAW;IACb,CAAC;IAEH,OAAO;GACT;GAEA,MAAM,SAAS,OAAO,IAAI,EAAA,CAAG,QAC1B,WACC,OAAO,IAAI,kBAAkB,MAAM,IAAI,iBACvC,uBAAuB,MAAM,MAAM,uBAAuB,KAAK,CACnE;GAEA,MAAM,WAAW,wBAAwB,QAAQ,uBAAuB,KAAK,CAAC;GAE9E,IACE,MAAM,UAAU,SAAS,YACzB,MAAM,OAAO,2BAA2B,CAAC,CAAC,UAAU,SAAS,SAE7D,OAAO,OAAO,qBAAqB,KAAK;IACtC,QAAQ;IACR,WAAW;GACb,CAAC;GAEH,OAAO,OAAO,OAAO,OAAO;GAE5B,OAAO;EACT,CAAC,CACH,CACF;EAEA,OAAO,UAAU,IAAI,+BAA+B;EAEpD,OAAO,OAAO,OAAO,OAAO,OAAO,QAAQ,CAAC;CAC9C,CAAC;CAED,MAAM,MAA8C,OAAO,GACzD,gCACF,CAAC,CAAC,WAAW,KAAK;EAChB,MAAM,QAAQ,OAAO,wBAAwB,oBAAoB,KAAK,KAAK;EAC3E,MAAM,QAAQ,OAAO,IAAI,IAAI,KAAK,EAAA,CAAG,QAAQ,IAAI,yBAAyB,KAAK,CAAC;EAEhF,OAAO,SAAS,KAAA,IAAY,OAAO,OAAO,OAAO,IAAI;CACvD,CAAC;CAED,MAAM,SAAoD,OAAO,GAC/D,mCACF,CAAC,CAAC,WAAW,KAAK,QAAQ;EACxB,MAAM,QAAQ,OAAO,wBAAwB,uBAAuB,QAAQ,QAAQ;EACpF,MAAM,aAAa,OAAO,wBAAwB,oBAAoB,KAAK,QAAQ;EACnF,MAAM,QAAQ,oBAAoB,MAAM,KAAK,YAAY;EAEzD,OAAO,UAAU,IAAI,GAAG,MAAM,QAAQ;EAEtC,MAAM,UAAU,OAAO,KAAK,WAC1B,OAAO,gBACL,OAAO,IAAI,aAAa;GACtB,MAAM,WAAW,OAAO,IAAI,UAAU;GAEtC,IAAI,aAAa,MACf,OAAO,OAAO,qBAAqB,KAAK;IACtC,QAAQ;IACR,WAAW;GACb,CAAC;GACH,MAAM,OAAO,OAAO,OAAO,WAAW,2BAA2B,UAAU,KAAK,CAAC;GACjF,MAAM,UAAU,OAAO,OAAO,IAAI;GAElC,OAAO,OAAO,MAAM,OAAO;GAE3B,OAAO;EACT,CAAC,CACH,CACF;EAEA,OAAO,UAAU,IAAI,GAAG,MAAM,OAAO;EAErC,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO,CAAC;CAC7C,CAAC;CAED,OAAO,qBAAqB,GAAG;EAC7B,QAAQ;EACR;EACA;EACA;EACA;EACA,MAAM,OAAO,GAAG,iCAAiC,CAAC,CAAC,WAAW,SAAS;GACrE,MAAM,QAAQ,OAAO,wBAAwB,4BAA4B,SAAS,MAAM;GAExF,MAAM,UAAU,OAAO,IAAI,IAAI,KAAK;GAEpC,MAAM,YACJ,MAAM,iBAAiB,KAAA,IACnB,KAAK,UAAU;IACb,MAAM;IACN,MAAM,aAAa;IACnB,MAAM,aAAa;GACrB,CAAC,IACD,MAAM,kBAAkB,KAAA,IACtB,KAAK,UAAU,CAAC,MAAM,eAAe,MAAM,aAAa,CAAC,IACzD,KAAA;GAsBR,MAAM,WAnBJ,cAAc,KAAA,KAAa,MAAM,cAC7B,OAAO,OAAO,QACZ,CACE,IAAK,cAAc,KAAA,IACf,QAAQ,QAAQ,IAAI,MAAM,aAAa,IACvC,QAAQ,QAAQ,IAAI,SAAS,MAAM,CAAC,CAC1C,CAAC,CACE,QAAQ,cAAc,MAAM,UAAU,KAAA,KAAa,YAAY,MAAM,KAAK,CAAC,CAC3E,KAAK,CAAC,CACN,MAAM,GAAG,MAAM,QAAQ,CAAC,IAC1B,cACC,OACE,QAAQ,QAAQ,IACd,yBAAyB;IAAE,eAAe,MAAM;IAAe;GAAU,CAAC,CAC5E,KAAK,EACP,CACJ,IACA,OAAO,IAAI,EAAA,CAGd,QACE,WACC,OAAO,IAAI,kBAAkB,MAAM,kBAClC,MAAM,UAAU,KAAA,KAAa,OAAO,IAAI,YAAY,MAAM,MAC/D,CAAC,CACA,MAAM,MAAM,UACX,KAAK,IAAI,YAAY,MAAM,IAAI,YAC3B,KACA,KAAK,IAAI,YAAY,MAAM,IAAI,YAC7B,IACA,CACR;GAEF,MAAM,QAAQ,QAAQ,MAAM,GAAG,MAAM,KAAK;GAE1C,OAAO;IACL;IACA,MAAM,QAAQ,SAAS,MAAM,QAAS,MAAM,GAAG,EAAE,CAAC,EAAE,IAAI,aAAa,OAAQ;GAC/E;EACF,CAAC;EACD,KAAK,OAAO,GAAG,gCAAgC,CAAC,CAC9C,WAAW,WAAW,OAAO,eAAe;GAC1C,MAAM,QAAQ,OAAO,wBACnB,MACA;IAAE;IAAW;IAAO,GAAI,kBAAkB,KAAA,IAAY,CAAC,IAAI,EAAE,cAAc;GAAG,GAC9E,KACF;GAEA,QAAQ,OAAO,IAAI,EAAA,CAChB,SAAS,WAAW;IACnB,MAAM,WAAW,wBAAwB,MAAM;IAE/C,OAAO,aAAa,QAClB,YAAY,MAAM,cACjB,MAAM,kBAAkB,KAAA,KACvB,MAAM,kBAAkB,OAAO,IAAI,iBACnC,CAAC;KAAE,KAAK,OAAO;KAAK;IAAS,CAAC,IAC9B,CAAC;GACP,CAAC,CAAC,CACD,MACE,MAAM,UACL,KAAK,WAAW,MAAM,aACrB,yBAAyB,KAAK,GAAG,IAAI,yBAAyB,MAAM,GAAG,IACpE,KACA,EACR,CAAC,CACA,MAAM,GAAG,MAAM,KAAK,CAAC,CACrB,KAAK,WAAW,OAAO,GAAG;EAC/B,CACF;EACA,cAAc,OAAO,GAAG,yCAAyC,CAAC,CAChE,WAAW,eAAe;GACxB,IAAI,kBAAkB,KAAA,GACpB,OAAO,wBAAwB,UAAU,eAAe,cAAc;GACxE,IAAI,OAAsB;GAE1B,KAAK,MAAM,UAAU,OAAO,IAAI,GAAG;IACjC,IAAI,kBAAkB,KAAA,KAAa,kBAAkB,OAAO,IAAI,eAC9D;IACF,MAAM,WAAW,wBAAwB,MAAM;IAE/C,IAAI,aAAa,SAAS,SAAS,QAAQ,WAAW,OAAO,OAAO;GACtE;GAEA,OAAO;EACT,CACF;CACF,CAAC;AACH,CAAC,CACH;AAEF,MAAa,iCAAiC,gCAAgC"}
|
|
@@ -0,0 +1,10 @@
|
|
|
1
|
+
import { ScheduleStore } from "@yielded/agent/schedule";
|
|
2
|
+
import { Layer } from "effect";
|
|
3
|
+
declare namespace MemoryScheduleStore_d_exports {
|
|
4
|
+
export { MemoryScheduleStoreLive, memoryScheduleStoreLayer };
|
|
5
|
+
}
|
|
6
|
+
export declare const memoryScheduleStoreLayer: () => Layer.Layer<ScheduleStore>;
|
|
7
|
+
export declare const MemoryScheduleStoreLive: Layer.Layer<ScheduleStore>;
|
|
8
|
+
//#endregion
|
|
9
|
+
export { MemoryScheduleStore_d_exports as t };
|
|
10
|
+
//# sourceMappingURL=MemoryScheduleStore.d.mts.map
|
|
@@ -0,0 +1,169 @@
|
|
|
1
|
+
import { t as __exportAll } from "./rolldown-runtime-D7D4PA-g.mjs";
|
|
2
|
+
import { ScheduleCapacityError, ScheduleChange, ScheduleConflict, ScheduleDueCursor, ScheduleFailpoint, ScheduleKey, ScheduleNotFound, ScheduleOwner, SchedulePageRequest, ScheduleRecord, ScheduleStorageError, ScheduleStore, defaultSchedulingLimits } from "@yielded/agent/schedule";
|
|
3
|
+
import { applyScheduleChange, compareScheduleKeys, compareScheduleNames, scheduleDeadline, scheduleKeyOf, scheduleKeyString, scheduleOwnerKey, scheduleUsesCapacity } from "@yielded/agent/schedule-transition";
|
|
4
|
+
import { Effect, Layer, Ref, Result, Schema } from "effect";
|
|
5
|
+
//#region src/MemoryScheduleStore.ts
|
|
6
|
+
var MemoryScheduleStore_exports = /* @__PURE__ */ __exportAll({
|
|
7
|
+
MemoryScheduleStoreLive: () => MemoryScheduleStoreLive,
|
|
8
|
+
memoryScheduleStoreLayer: () => memoryScheduleStoreLayer
|
|
9
|
+
});
|
|
10
|
+
const storageError = (operation, reason) => ScheduleStorageError.make({
|
|
11
|
+
operation,
|
|
12
|
+
reason
|
|
13
|
+
});
|
|
14
|
+
const encodeRecord = (operation, record) => Effect.try({
|
|
15
|
+
try: () => Schema.encodeSync(Schema.fromJsonString(ScheduleRecord))(record),
|
|
16
|
+
catch: () => storageError(operation, "corrupt")
|
|
17
|
+
});
|
|
18
|
+
const decodeRecord = (operation, encoded) => Effect.try({
|
|
19
|
+
try: () => Schema.decodeSync(Schema.fromJsonString(ScheduleRecord))(encoded),
|
|
20
|
+
catch: () => storageError(operation, "corrupt")
|
|
21
|
+
});
|
|
22
|
+
const decodeInput = (operation, schema, value) => Effect.try({
|
|
23
|
+
try: () => Schema.decodeUnknownSync(schema)(value),
|
|
24
|
+
catch: () => storageError(operation, "corrupt")
|
|
25
|
+
});
|
|
26
|
+
const sameOwner = (record, owner) => scheduleOwnerKey(record.owner) === scheduleOwnerKey(owner);
|
|
27
|
+
const makeScheduleStore = Effect.gen(function* () {
|
|
28
|
+
const state = yield* Ref.make({ records: /* @__PURE__ */ new Map() });
|
|
29
|
+
const failpoint = yield* ScheduleFailpoint;
|
|
30
|
+
const insert = Effect.fn("MemoryScheduleStore.insert")((record, ownerLimit) => Effect.gen(function* () {
|
|
31
|
+
const encoded = yield* encodeRecord("insert", record);
|
|
32
|
+
yield* failpoint.hit("schedule:insert:before");
|
|
33
|
+
const decision = yield* Effect.uninterruptible(Ref.modify(state, (current) => {
|
|
34
|
+
const key = scheduleKeyString(record);
|
|
35
|
+
const existingText = current.records.get(key);
|
|
36
|
+
if (existingText !== void 0) {
|
|
37
|
+
const decoded = Result.try({
|
|
38
|
+
try: () => Schema.decodeSync(Schema.fromJsonString(ScheduleRecord))(existingText),
|
|
39
|
+
catch: () => storageError("insert", "corrupt")
|
|
40
|
+
});
|
|
41
|
+
if (Result.isFailure(decoded)) return [Result.fail(decoded.failure), current];
|
|
42
|
+
if (decoded.success.creationFingerprint === record.creationFingerprint) return [Result.succeed(decoded.success), current];
|
|
43
|
+
return [Result.fail(ScheduleConflict.make({
|
|
44
|
+
reason: "creation",
|
|
45
|
+
key: scheduleKeyOf(record)
|
|
46
|
+
})), current];
|
|
47
|
+
}
|
|
48
|
+
let ownerCount = 0;
|
|
49
|
+
for (const text of current.records.values()) {
|
|
50
|
+
const decoded = Result.try({
|
|
51
|
+
try: () => Schema.decodeSync(Schema.fromJsonString(ScheduleRecord))(text),
|
|
52
|
+
catch: () => storageError("insert", "corrupt")
|
|
53
|
+
});
|
|
54
|
+
if (Result.isFailure(decoded)) return [Result.fail(decoded.failure), current];
|
|
55
|
+
if (sameOwner(decoded.success, record.owner) && scheduleUsesCapacity(decoded.success)) ownerCount += 1;
|
|
56
|
+
}
|
|
57
|
+
if (ownerCount >= ownerLimit) return [Result.fail(ScheduleCapacityError.make({ limit: ownerLimit })), current];
|
|
58
|
+
const records = new Map(current.records);
|
|
59
|
+
records.set(key, encoded);
|
|
60
|
+
const next = { records };
|
|
61
|
+
return [Result.succeed(record), next];
|
|
62
|
+
}));
|
|
63
|
+
const inserted = yield* Effect.fromResult(decision);
|
|
64
|
+
yield* failpoint.hit("schedule:insert:after");
|
|
65
|
+
return yield* decodeRecord("insert", yield* encodeRecord("insert", inserted));
|
|
66
|
+
}));
|
|
67
|
+
const get = Effect.fn("MemoryScheduleStore.get")(function* (key) {
|
|
68
|
+
const decodedKey = yield* decodeInput("get", ScheduleKey, key);
|
|
69
|
+
const text = (yield* Ref.get(state)).records.get(scheduleKeyString(decodedKey));
|
|
70
|
+
return text === void 0 ? null : yield* decodeRecord("get", text);
|
|
71
|
+
});
|
|
72
|
+
const list = Effect.fn("MemoryScheduleStore.list")(function* (request) {
|
|
73
|
+
const decodedRequest = yield* decodeInput("list", SchedulePageRequest, request);
|
|
74
|
+
const records = [];
|
|
75
|
+
for (const text of (yield* Ref.get(state)).records.values()) {
|
|
76
|
+
const record = yield* decodeRecord("list", text);
|
|
77
|
+
if (sameOwner(record, decodedRequest.owner) && (decodedRequest.after === void 0 || compareScheduleNames(record.scheduleId, decodedRequest.after) > 0)) records.push(record);
|
|
78
|
+
}
|
|
79
|
+
records.sort((left, right) => compareScheduleNames(left.scheduleId, right.scheduleId));
|
|
80
|
+
const hasNext = records.length > decodedRequest.limit;
|
|
81
|
+
const items = records.slice(0, decodedRequest.limit);
|
|
82
|
+
return {
|
|
83
|
+
items,
|
|
84
|
+
next: hasNext ? items.at(-1)?.scheduleId ?? null : null
|
|
85
|
+
};
|
|
86
|
+
});
|
|
87
|
+
const change = Effect.fn("MemoryScheduleStore.change")((key, command, ownerLimit = defaultSchedulingLimits.maxSchedulesPerOwner) => Effect.gen(function* () {
|
|
88
|
+
const decodedKey = yield* decodeInput("change", ScheduleKey, key);
|
|
89
|
+
const decodedCommand = yield* decodeInput("change", ScheduleChange, command);
|
|
90
|
+
yield* failpoint.hit(`schedule:${decodedCommand._tag.toLowerCase()}:before`);
|
|
91
|
+
const decision = yield* Effect.uninterruptible(Ref.modify(state, (current) => {
|
|
92
|
+
const storageKey = scheduleKeyString(decodedKey);
|
|
93
|
+
const text = current.records.get(storageKey);
|
|
94
|
+
if (text === void 0) return [Result.fail(ScheduleNotFound.make({ key: decodedKey })), current];
|
|
95
|
+
const decoded = Result.try({
|
|
96
|
+
try: () => Schema.decodeSync(Schema.fromJsonString(ScheduleRecord))(text),
|
|
97
|
+
catch: () => storageError("change", "corrupt")
|
|
98
|
+
});
|
|
99
|
+
if (Result.isFailure(decoded)) return [Result.fail(decoded.failure), current];
|
|
100
|
+
const applied = applyScheduleChange(decoded.success, decodedCommand);
|
|
101
|
+
if (Result.isFailure(applied)) return [Result.fail(applied.failure), current];
|
|
102
|
+
if (applied.success === decoded.success) return [Result.succeed(decoded.success), current];
|
|
103
|
+
if (!scheduleUsesCapacity(decoded.success) && scheduleUsesCapacity(applied.success)) {
|
|
104
|
+
let count = 0;
|
|
105
|
+
for (const text of current.records.values()) {
|
|
106
|
+
const candidate = Schema.decodeResult(Schema.fromJsonString(ScheduleRecord))(text);
|
|
107
|
+
if (Result.isFailure(candidate)) return [Result.fail(storageError("change", "corrupt")), current];
|
|
108
|
+
if (sameOwner(candidate.success, decodedKey.owner) && scheduleUsesCapacity(candidate.success)) count += 1;
|
|
109
|
+
}
|
|
110
|
+
if (count >= ownerLimit) return [Result.fail(ScheduleCapacityError.make({ limit: ownerLimit })), current];
|
|
111
|
+
}
|
|
112
|
+
const encoded = Result.try({
|
|
113
|
+
try: () => Schema.encodeSync(Schema.fromJsonString(ScheduleRecord))(applied.success),
|
|
114
|
+
catch: () => storageError("change", "corrupt")
|
|
115
|
+
});
|
|
116
|
+
if (Result.isFailure(encoded)) return [Result.fail(encoded.failure), current];
|
|
117
|
+
const records = new Map(current.records);
|
|
118
|
+
records.set(storageKey, encoded.success);
|
|
119
|
+
const next = { records };
|
|
120
|
+
return [Result.succeed(applied.success), next];
|
|
121
|
+
}));
|
|
122
|
+
const changed = yield* Effect.fromResult(decision);
|
|
123
|
+
yield* failpoint.hit(`schedule:${decodedCommand._tag.toLowerCase()}:after`);
|
|
124
|
+
return yield* decodeRecord("change", yield* encodeRecord("change", changed));
|
|
125
|
+
}));
|
|
126
|
+
const due = Effect.fn("MemoryScheduleStore.due")(function* (nowMillis, limit, owner, after) {
|
|
127
|
+
const decodedOwner = owner === void 0 ? void 0 : yield* decodeInput("due", ScheduleOwner, owner);
|
|
128
|
+
const cursor = after === void 0 ? void 0 : yield* decodeInput("due", ScheduleDueCursor, after);
|
|
129
|
+
const records = [];
|
|
130
|
+
for (const text of (yield* Ref.get(state)).records.values()) {
|
|
131
|
+
const record = yield* decodeRecord("due", text);
|
|
132
|
+
const deadline = scheduleDeadline(record);
|
|
133
|
+
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({
|
|
134
|
+
...scheduleKeyOf(record),
|
|
135
|
+
deadlineAtMillis: deadline
|
|
136
|
+
});
|
|
137
|
+
}
|
|
138
|
+
records.sort((left, right) => {
|
|
139
|
+
const byDeadline = left.deadlineAtMillis - right.deadlineAtMillis;
|
|
140
|
+
return byDeadline !== 0 ? byDeadline : compareScheduleKeys(left, right);
|
|
141
|
+
});
|
|
142
|
+
return records.slice(0, limit);
|
|
143
|
+
});
|
|
144
|
+
const nextDeadline = Effect.fn("MemoryScheduleStore.nextDeadline")(function* (owner) {
|
|
145
|
+
const decodedOwner = owner === void 0 ? void 0 : yield* decodeInput("nextDeadline", ScheduleOwner, owner);
|
|
146
|
+
let earliest = null;
|
|
147
|
+
for (const text of (yield* Ref.get(state)).records.values()) {
|
|
148
|
+
const record = yield* decodeRecord("nextDeadline", text);
|
|
149
|
+
if (decodedOwner !== void 0 && !sameOwner(record, decodedOwner)) continue;
|
|
150
|
+
const deadline = scheduleDeadline(record);
|
|
151
|
+
if (deadline !== null && (earliest === null || deadline < earliest)) earliest = deadline;
|
|
152
|
+
}
|
|
153
|
+
return earliest;
|
|
154
|
+
});
|
|
155
|
+
return ScheduleStore.of({
|
|
156
|
+
insert,
|
|
157
|
+
get,
|
|
158
|
+
list,
|
|
159
|
+
change,
|
|
160
|
+
due,
|
|
161
|
+
nextDeadline
|
|
162
|
+
});
|
|
163
|
+
});
|
|
164
|
+
const memoryScheduleStoreLayer = () => Layer.effect(ScheduleStore, makeScheduleStore);
|
|
165
|
+
const MemoryScheduleStoreLive = memoryScheduleStoreLayer();
|
|
166
|
+
//#endregion
|
|
167
|
+
export { MemoryScheduleStoreLive, memoryScheduleStoreLayer, MemoryScheduleStore_exports as t };
|
|
168
|
+
|
|
169
|
+
//# sourceMappingURL=MemoryScheduleStore.mjs.map
|
|
@@ -0,0 +1 @@
|
|
|
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 \"@yielded/agent/schedule\";\nimport {\n scheduleUsesCapacity,\n applyScheduleChange,\n compareScheduleKeys,\n compareScheduleNames,\n scheduleDeadline,\n scheduleKeyString,\n scheduleKeyOf,\n scheduleOwnerKey,\n} from \"@yielded/agent/schedule-transition\";\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.decodeResult(Schema.fromJsonString(ScheduleRecord))(\n text,\n );\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,aAAa,OAAO,eAAe,cAAc,CAAC,CAAC,CAC1E,IACF;KAEA,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"}
|
|
@@ -0,0 +1,21 @@
|
|
|
1
|
+
import { Layer, Schema } from "effect";
|
|
2
|
+
import { MemoryIndexError, SemanticMemoryIndex, SemanticMemoryProfile } from "@yielded/agent/semantic-memory-index";
|
|
3
|
+
declare namespace MemorySemanticIndex_d_exports {
|
|
4
|
+
export { InMemorySemanticIndexCapacity, inMemorySemanticIndexLayer };
|
|
5
|
+
}
|
|
6
|
+
declare const InMemorySemanticIndexCapacity_base: Schema.Class<InMemorySemanticIndexCapacity, Schema.Struct<{
|
|
7
|
+
readonly maxSources: Schema.Int;
|
|
8
|
+
readonly maxChunks: Schema.Int;
|
|
9
|
+
readonly maxSourceBytes: Schema.optionalKey<Schema.Int>;
|
|
10
|
+
}>, {}>;
|
|
11
|
+
/**
|
|
12
|
+
* Hard per-Layer bounds for disposable semantic index state. maxChunks times profile dimensions
|
|
13
|
+
* must not exceed 16,777,216 vector components. maxSourceBytes bounds the aggregate UTF-8 JSON
|
|
14
|
+
* of retained source identities and defaults to 16 MiB; it is not a general heap limit.
|
|
15
|
+
*/
|
|
16
|
+
export declare class InMemorySemanticIndexCapacity extends InMemorySemanticIndexCapacity_base {}
|
|
17
|
+
/** Scoped disposable semantic index. No persistent build or recovery state is retained. */
|
|
18
|
+
export declare const inMemorySemanticIndexLayer: (profile: SemanticMemoryProfile, capacity: InMemorySemanticIndexCapacity) => Layer.Layer<SemanticMemoryIndex, MemoryIndexError>;
|
|
19
|
+
//#endregion
|
|
20
|
+
export { MemorySemanticIndex_d_exports as t };
|
|
21
|
+
//# sourceMappingURL=MemorySemanticIndex.d.mts.map
|