@hy-sde-org/dsh-graph-control 0.1.2-rc.1
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/README.i18n.yaml +6 -0
- package/README.md +64 -0
- package/README.zh.md +69 -0
- package/dist/errors.d.ts +32 -0
- package/dist/errors.d.ts.map +1 -0
- package/dist/errors.js +46 -0
- package/dist/errors.js.map +1 -0
- package/dist/index.d.ts +20 -0
- package/dist/index.d.ts.map +1 -0
- package/dist/index.js +18 -0
- package/dist/index.js.map +1 -0
- package/dist/store.d.ts +136 -0
- package/dist/store.d.ts.map +1 -0
- package/dist/store.js +573 -0
- package/dist/store.js.map +1 -0
- package/dist/types.d.ts +217 -0
- package/dist/types.d.ts.map +1 -0
- package/dist/types.js +48 -0
- package/dist/types.js.map +1 -0
- package/package.json +45 -0
package/LICENSE
ADDED
|
@@ -0,0 +1,21 @@
|
|
|
1
|
+
MIT License
|
|
2
|
+
|
|
3
|
+
Copyright (c) 2026 hy-sde
|
|
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.
|
package/README.i18n.yaml
ADDED
|
@@ -0,0 +1,6 @@
|
|
|
1
|
+
# Bilingual-pair consistency record (docs/i18n/README.md): the git blob hash of each
|
|
2
|
+
# side as of the last confirmed-consistent state. Both languages carry equal authority;
|
|
3
|
+
# after editing either side, bring the other along and re-record with:
|
|
4
|
+
# pnpm run verify-translation-pairing --write packages/graph/graph-control/README.md
|
|
5
|
+
README.md: 3f619cc71a8f865e67b0b0a14781f3b1365d0f48
|
|
6
|
+
README.zh.md: df74aafc80c6ab1c25065e6e7cfcd31cf4469e9d
|
package/README.md
ADDED
|
@@ -0,0 +1,64 @@
|
|
|
1
|
+
---
|
|
2
|
+
description: "Durable control plane for the Agent Graph: schedule updates, exactly-once intent claims, operator provisions, and supervisor wakes."
|
|
3
|
+
kind: "package-reference"
|
|
4
|
+
---
|
|
5
|
+
|
|
6
|
+
# @hy-sde-org/dsh-graph-control
|
|
7
|
+
|
|
8
|
+
English | [中文](README.zh.md)
|
|
9
|
+
|
|
10
|
+
## Summary
|
|
11
|
+
|
|
12
|
+
`dsh-graph-control` is the durable decision store for the Agent Graph (Maka port, slice P1). It owns exactly the stateful rows a graph needs — the schedule-update log, exactly-once intent claims, operator provisions, and supervisor wakes — and nothing else: records, routes, readiness intents, work status, and client snapshots stay derived (session-projection folds) in later slices.
|
|
13
|
+
|
|
14
|
+
The store is designed around Maka's one hard rule: **the durable claim (with preallocated turn/run identity) is written before the runtime is ever asked to run**, and every claim/provision transition is conditional on the schedule revision it observed. A retry therefore reuses the same activation identity instead of invoking the provider twice. All ids are deterministic sha256 (`graph_update_…`, `graph_claim_…`, `graph_operator_…`, `graph_wake_…`), so replays are idempotent by construction.
|
|
15
|
+
|
|
16
|
+
Persistence: one `KvUnit` (`name: agent_graph`) with five authoritative tables; derived uniqueness indexes are rebuilt from those rows at open, so a torn write heals instead of corrupting. The storage contract forbids concurrent writers on one unit, so the store serializes mutations on one write chain and each per-record write is durable.
|
|
17
|
+
|
|
18
|
+
This package contributes no tool, prompt, or plugin row — the coordinator (P2), executor adapter (P3), and supervisor tools (P4) consume it.
|
|
19
|
+
|
|
20
|
+
## Table of Contents
|
|
21
|
+
|
|
22
|
+
- [Use this package](#use-this-package)
|
|
23
|
+
- [Understand the implementation](#understand-the-implementation)
|
|
24
|
+
- [Further Exploration](#further-exploration)
|
|
25
|
+
- [Model Experience](#model-experience)
|
|
26
|
+
- [Known Limitations and Deferred Work](#known-limitations-and-deferred-work)
|
|
27
|
+
|
|
28
|
+
## Use this package
|
|
29
|
+
|
|
30
|
+
```ts
|
|
31
|
+
import Storage, { storageBackendServiceKey } from '@deepseek-ai/dsh-storage'
|
|
32
|
+
import { GraphControlStore } from '@hy-sde-org/dsh-graph-control'
|
|
33
|
+
|
|
34
|
+
const backend = await ctx[storageBackendServiceKey('sqlite')]
|
|
35
|
+
const unit = await backend.kv.open(GraphControlStore.descriptor)
|
|
36
|
+
const store = await GraphControlStore.open(unit)
|
|
37
|
+
|
|
38
|
+
const { update, created } = await store.commitScheduleUpdate(request)
|
|
39
|
+
const { claim } = await store.claimIntentAtScheduleRevision(claimRequest, update.revision)
|
|
40
|
+
```
|
|
41
|
+
|
|
42
|
+
Open the unit exactly once per process: the storage layer rejects double-open, and the store is the single writer chain over the unit.
|
|
43
|
+
|
|
44
|
+
## Understand the implementation
|
|
45
|
+
|
|
46
|
+
- **Schedule log** (`schedule`): append-only decisions, revision = max+1, idempotent by `updateId` and by source triple `(session, run, toolCall)`; `finish` cannot combine with `add_work`; the graph is closed once a finish is committed.
|
|
47
|
+
- **Intent claims** (`claims`): keyed `graphId:intentId`, with activation-identity uniqueness (`(targetSessionId, targetTurnId)` and `(targetSessionId, targetRunId)`) enforced against derived indexes; transitions `claimed → executing → cancelled` are revision-conditional; fresh claims are rejected after closure while existing claims stay dispatchable.
|
|
48
|
+
- **Operator provisions** (`provisions`): deterministic `provisionId`/`operatorId` make retries adopt the same operator; revision-conditional and closure-blocked like claims.
|
|
49
|
+
- **Supervisor wakes** (`wakes` + `wake_attempts`): claim once, begin attempts (refused once delivered/superseded), complete with `waiting_permission | delivered | superseded | retryable_failed`; supersede by root session (+ optional graph filter); `recoverSupervisorWakes()` is deliberately a no-op — whether an interrupted attempt really completed is a Runtime fact, so the coordinator (P5) inspects run facts and completes accordingly. The store never guesses.
|
|
50
|
+
|
|
51
|
+
## Further Exploration
|
|
52
|
+
|
|
53
|
+
- [`port_maka.md`](../../../../workspace/port_maka.md) — the port's design note and phase checklist.
|
|
54
|
+
- Maka reference: `docs/architecture/agent-graph-stream-scheduling-draft.md` (Chapter 7) in the Maka checkout.
|
|
55
|
+
|
|
56
|
+
## Model Experience
|
|
57
|
+
|
|
58
|
+
No model-facing surface. This package is host-side machinery; the supervisor tools of slice P4 are what the model sees.
|
|
59
|
+
|
|
60
|
+
## Known Limitations and Deferred Work
|
|
61
|
+
|
|
62
|
+
- No epoch table: one DSH session owns one graph per the design decision (multi-graph-per-root is deferred).
|
|
63
|
+
- Multi-row CAS is process-atomic (one write chain), not transaction-atomic; a crash mid-sequence heals on open because indexes are derived. Claims with a torn write are recovered by the coordinator inspecting run facts, as in Maka.
|
|
64
|
+
- Derived work status (`requested/stopped/superseded`), records, routes, readiness, and client snapshots belong to later slices and are not stored here.
|
package/README.zh.md
ADDED
|
@@ -0,0 +1,69 @@
|
|
|
1
|
+
---
|
|
2
|
+
description: "Agent Graph 的持久化决策存储:调度更新、恰好一次的意图声明、操作员预置与主管唤醒。"
|
|
3
|
+
kind: "package-reference"
|
|
4
|
+
---
|
|
5
|
+
|
|
6
|
+
# @hy-sde-org/dsh-graph-control
|
|
7
|
+
|
|
8
|
+
[English](README.md) | 中文
|
|
9
|
+
|
|
10
|
+
## 摘要
|
|
11
|
+
|
|
12
|
+
`dsh-graph-control` 是 Agent Graph 的持久化决策存储(Maka 移植,P1 切片)。它只持有图真正需要的有状态行——调度更新日志、恰好一次的意图声明、操作员预置和主管唤醒——其余一律不存:记录、路由、就绪意图、工作状态和客户端快照留给后续切片中的派生层(session-projection 折叠)。
|
|
13
|
+
|
|
14
|
+
本包围绕 Maka 的一条硬规则设计:**持久化声明(含预分配的 turn/run 身份)必须在运行时被要求执行之前写入**,且每个声明/预置转换都以其观察到的调度修订号为前置条件。因此重试只会复用同一个激活身份,而不会第二次调用提供方。所有 ID 均为确定性 sha256(`graph_update_…`、`graph_claim_…`、`graph_operator_…`、`graph_wake_…`),重放天然幂等。
|
|
15
|
+
|
|
16
|
+
持久化:一个 `KvUnit`(`name: agent_graph`)承载五张权威表;派生唯一性索引在打开时从权威行重建,撕裂写入可自愈而非损坏。存储契约禁止同一单元的并发写入者,因此本存储将全部变更串在一条写链上,每条记录写入均持久化。
|
|
17
|
+
|
|
18
|
+
本包不提供任何工具、提示词或插件行——由协调器(P2)、执行器适配器(P3)和主管工具(P4)消费。
|
|
19
|
+
|
|
20
|
+
## 目录
|
|
21
|
+
|
|
22
|
+
- [使用本包](#use-this-package)
|
|
23
|
+
- [理解实现](#understand-the-implementation)
|
|
24
|
+
- [进一步探索](#further-exploration)
|
|
25
|
+
- [模型体验](#model-experience)
|
|
26
|
+
- [已知限制与后续工作](#known-limitations-and-deferred-work)
|
|
27
|
+
|
|
28
|
+
<a id="use-this-package"></a>
|
|
29
|
+
## 使用本包
|
|
30
|
+
|
|
31
|
+
```ts
|
|
32
|
+
import Storage, { storageBackendServiceKey } from '@deepseek-ai/dsh-storage'
|
|
33
|
+
import { GraphControlStore } from '@hy-sde-org/dsh-graph-control'
|
|
34
|
+
|
|
35
|
+
const backend = await ctx[storageBackendServiceKey('sqlite')]
|
|
36
|
+
const unit = await backend.kv.open(GraphControlStore.descriptor)
|
|
37
|
+
const store = await GraphControlStore.open(unit)
|
|
38
|
+
|
|
39
|
+
const { update, created } = await store.commitScheduleUpdate(request)
|
|
40
|
+
const { claim } = await store.claimIntentAtScheduleRevision(claimRequest, update.revision)
|
|
41
|
+
```
|
|
42
|
+
|
|
43
|
+
每个进程只打开该单元一次:存储层拒绝重复打开,且本存储是该单元上的唯一写链。
|
|
44
|
+
|
|
45
|
+
<a id="understand-the-implementation"></a>
|
|
46
|
+
## 理解实现
|
|
47
|
+
|
|
48
|
+
- **调度日志**(`schedule`):只追加决策,修订号 = max+1,按 `updateId` 与源三元组 `(session, run, toolCall)` 幂等;`finish` 不能与 `add_work` 合并;一旦提交 finish,图即关闭。
|
|
49
|
+
- **意图声明**(`claims`):键为 `graphId:intentId`,激活身份唯一性(`(targetSessionId, targetTurnId)` 与 `(targetSessionId, targetRunId)`)由派生索引约束;`claimed → executing → cancelled` 转换以修订号为条件;关闭后拒绝新声明,但既有声明仍可派发。
|
|
50
|
+
- **操作员预置**(`provisions`):确定性 `provisionId`/`operatorId` 使重试采用同一操作员;与声明一样受修订号约束并在关闭后拦截。
|
|
51
|
+
- **主管唤醒**(`wakes` + `wake_attempts`):声明一次后开始尝试(已投递/已替代则拒绝);以 `waiting_permission | delivered | superseded | retryable_failed` 完成;按根会话(可选图过滤)替代;`recoverSupervisorWakes()` 刻意为空操作——中断的尝试是否真正完成属于运行时事实,协调器(P5)检查运行事实后完成之。本存储从不猜测。
|
|
52
|
+
|
|
53
|
+
<a id="further-exploration"></a>
|
|
54
|
+
## 进一步探索
|
|
55
|
+
|
|
56
|
+
- [`port_maka.md`](../../../../workspace/port_maka.md) — 移植设计说明与阶段清单。
|
|
57
|
+
- Maka 参考:Maka 检出中的 `docs/architecture/agent-graph-stream-scheduling-draft.md`(第 7 章)。
|
|
58
|
+
|
|
59
|
+
<a id="model-experience"></a>
|
|
60
|
+
## 模型体验
|
|
61
|
+
|
|
62
|
+
无模型可见面。本包是主机侧机制;模型看到的是 P4 切片的主管工具。
|
|
63
|
+
|
|
64
|
+
<a id="known-limitations-and-deferred-work"></a>
|
|
65
|
+
## 已知限制与后续工作
|
|
66
|
+
|
|
67
|
+
- 无 epoch 表:按设计决策,一个 DSH 会话拥有一个图(每根多图推迟)。
|
|
68
|
+
- 多行 CAS 为进程原子(单写链)而非事务原子;崩溃后序列中撕裂的写入在打开时自愈,因为索引是派生的。撕裂写入的声明由协调器检查运行事实恢复,与 Maka 一致。
|
|
69
|
+
- 派生工作状态(`requested/stopped/superseded`)、记录、路由、就绪与客户端快照属于后续切片,不在此存储。
|
package/dist/errors.d.ts
ADDED
|
@@ -0,0 +1,32 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Error vocabulary of the Agent Graph control plane.
|
|
3
|
+
*
|
|
4
|
+
* `GraphControlError` carries a stable machine `code` (DSH convention, cf.
|
|
5
|
+
* `StorageError`); the two schedule errors keep Maka's class names so the
|
|
6
|
+
* reconciler (slice P2) can catch them by identity.
|
|
7
|
+
* @module
|
|
8
|
+
*/
|
|
9
|
+
export type GraphControlErrorCode = 'schedule-revision-conflict' | 'schedule-closed' | 'schedule-update-conflict' | 'intent-claim-conflict' | 'intent-not-found' | 'provision-conflict' | 'provision-not-found' | 'binding-conflict' | 'wake-not-found' | 'wake-attempt-not-found' | 'wake-already-delivered' | 'malformed-state';
|
|
10
|
+
export declare class GraphControlError extends Error {
|
|
11
|
+
readonly code: GraphControlErrorCode;
|
|
12
|
+
constructor(code: GraphControlErrorCode, message: string, options?: {
|
|
13
|
+
cause?: unknown;
|
|
14
|
+
});
|
|
15
|
+
}
|
|
16
|
+
/** A reconciler tried to admit work from an observation no longer current (Maka: `AgentGraphScheduleRevisionConflictError`). */
|
|
17
|
+
export declare class AgentGraphScheduleRevisionConflictError extends GraphControlError {
|
|
18
|
+
readonly graphId: string;
|
|
19
|
+
readonly expectedRevision: number;
|
|
20
|
+
readonly currentRevision: number;
|
|
21
|
+
constructor(graphId: string, expectedRevision: number, currentRevision: number);
|
|
22
|
+
}
|
|
23
|
+
/** Fresh admission after terminal closure (Maka: `AgentGraphScheduleClosedError`). Existing claims stay recoverable. */
|
|
24
|
+
export declare class AgentGraphScheduleClosedError extends GraphControlError {
|
|
25
|
+
readonly graphId: string;
|
|
26
|
+
constructor(graphId: string);
|
|
27
|
+
}
|
|
28
|
+
/** Two different decisions claimed the same intent / target identity. */
|
|
29
|
+
export declare class AgentGraphIntentClaimConflictError extends GraphControlError {
|
|
30
|
+
constructor(message: string);
|
|
31
|
+
}
|
|
32
|
+
//# sourceMappingURL=errors.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"errors.d.ts","sourceRoot":"","sources":["../src/errors.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,MAAM,MAAM,qBAAqB,GAC7B,4BAA4B,GAC5B,iBAAiB,GACjB,0BAA0B,GAC1B,uBAAuB,GACvB,kBAAkB,GAClB,oBAAoB,GACpB,qBAAqB,GACrB,kBAAkB,GAClB,gBAAgB,GAChB,wBAAwB,GACxB,wBAAwB,GACxB,iBAAiB,CAAA;AAErB,qBAAa,iBAAkB,SAAQ,KAAK;IAC1C,QAAQ,CAAC,IAAI,EAAE,qBAAqB,CAAA;gBAExB,IAAI,EAAE,qBAAqB,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE;QAAE,KAAK,CAAC,EAAE,OAAO,CAAA;KAAE;CAKxF;AAED,gIAAgI;AAChI,qBAAa,uCAAwC,SAAQ,iBAAiB;IAC5E,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;IACxB,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAA;IACjC,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAA;gBAEpB,OAAO,EAAE,MAAM,EAAE,gBAAgB,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM;CAU/E;AAED,wHAAwH;AACxH,qBAAa,6BAA8B,SAAQ,iBAAiB;IAClE,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;gBAEZ,OAAO,EAAE,MAAM;CAK5B;AAED,yEAAyE;AACzE,qBAAa,kCAAmC,SAAQ,iBAAiB;gBAC3D,OAAO,EAAE,MAAM;CAI5B"}
|
package/dist/errors.js
ADDED
|
@@ -0,0 +1,46 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Error vocabulary of the Agent Graph control plane.
|
|
3
|
+
*
|
|
4
|
+
* `GraphControlError` carries a stable machine `code` (DSH convention, cf.
|
|
5
|
+
* `StorageError`); the two schedule errors keep Maka's class names so the
|
|
6
|
+
* reconciler (slice P2) can catch them by identity.
|
|
7
|
+
* @module
|
|
8
|
+
*/
|
|
9
|
+
export class GraphControlError extends Error {
|
|
10
|
+
code;
|
|
11
|
+
constructor(code, message, options) {
|
|
12
|
+
super(message, options);
|
|
13
|
+
this.name = 'GraphControlError';
|
|
14
|
+
this.code = code;
|
|
15
|
+
}
|
|
16
|
+
}
|
|
17
|
+
/** A reconciler tried to admit work from an observation no longer current (Maka: `AgentGraphScheduleRevisionConflictError`). */
|
|
18
|
+
export class AgentGraphScheduleRevisionConflictError extends GraphControlError {
|
|
19
|
+
graphId;
|
|
20
|
+
expectedRevision;
|
|
21
|
+
currentRevision;
|
|
22
|
+
constructor(graphId, expectedRevision, currentRevision) {
|
|
23
|
+
super('schedule-revision-conflict', `Agent graph schedule ${graphId} revision changed from ${expectedRevision} to ${currentRevision}`);
|
|
24
|
+
this.name = 'AgentGraphScheduleRevisionConflictError';
|
|
25
|
+
this.graphId = graphId;
|
|
26
|
+
this.expectedRevision = expectedRevision;
|
|
27
|
+
this.currentRevision = currentRevision;
|
|
28
|
+
}
|
|
29
|
+
}
|
|
30
|
+
/** Fresh admission after terminal closure (Maka: `AgentGraphScheduleClosedError`). Existing claims stay recoverable. */
|
|
31
|
+
export class AgentGraphScheduleClosedError extends GraphControlError {
|
|
32
|
+
graphId;
|
|
33
|
+
constructor(graphId) {
|
|
34
|
+
super('schedule-closed', `Agent graph schedule ${graphId} is already finished`);
|
|
35
|
+
this.name = 'AgentGraphScheduleClosedError';
|
|
36
|
+
this.graphId = graphId;
|
|
37
|
+
}
|
|
38
|
+
}
|
|
39
|
+
/** Two different decisions claimed the same intent / target identity. */
|
|
40
|
+
export class AgentGraphIntentClaimConflictError extends GraphControlError {
|
|
41
|
+
constructor(message) {
|
|
42
|
+
super('intent-claim-conflict', message);
|
|
43
|
+
this.name = 'AgentGraphIntentClaimConflictError';
|
|
44
|
+
}
|
|
45
|
+
}
|
|
46
|
+
//# sourceMappingURL=errors.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"errors.js","sourceRoot":"","sources":["../src/errors.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAgBH,MAAM,OAAO,iBAAkB,SAAQ,KAAK;IACjC,IAAI,CAAuB;IAEpC,YAAY,IAA2B,EAAE,OAAe,EAAE,OAA6B;QACrF,KAAK,CAAC,OAAO,EAAE,OAAO,CAAC,CAAA;QACvB,IAAI,CAAC,IAAI,GAAG,mBAAmB,CAAA;QAC/B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;IAClB,CAAC;CACF;AAED,gIAAgI;AAChI,MAAM,OAAO,uCAAwC,SAAQ,iBAAiB;IACnE,OAAO,CAAQ;IACf,gBAAgB,CAAQ;IACxB,eAAe,CAAQ;IAEhC,YAAY,OAAe,EAAE,gBAAwB,EAAE,eAAuB;QAC5E,KAAK,CACH,4BAA4B,EAC5B,wBAAwB,OAAO,0BAA0B,gBAAgB,OAAO,eAAe,EAAE,CAClG,CAAA;QACD,IAAI,CAAC,IAAI,GAAG,yCAAyC,CAAA;QACrD,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;QACtB,IAAI,CAAC,gBAAgB,GAAG,gBAAgB,CAAA;QACxC,IAAI,CAAC,eAAe,GAAG,eAAe,CAAA;IACxC,CAAC;CACF;AAED,wHAAwH;AACxH,MAAM,OAAO,6BAA8B,SAAQ,iBAAiB;IACzD,OAAO,CAAQ;IAExB,YAAY,OAAe;QACzB,KAAK,CAAC,iBAAiB,EAAE,wBAAwB,OAAO,sBAAsB,CAAC,CAAA;QAC/E,IAAI,CAAC,IAAI,GAAG,+BAA+B,CAAA;QAC3C,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;IACxB,CAAC;CACF;AAED,yEAAyE;AACzE,MAAM,OAAO,kCAAmC,SAAQ,iBAAiB;IACvE,YAAY,OAAe;QACzB,KAAK,CAAC,uBAAuB,EAAE,OAAO,CAAC,CAAA;QACvC,IAAI,CAAC,IAAI,GAAG,oCAAoC,CAAA;IAClD,CAAC;CACF"}
|
package/dist/index.d.ts
ADDED
|
@@ -0,0 +1,20 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Durable control plane for the Agent Graph (Maka port, slice P1).
|
|
3
|
+
*
|
|
4
|
+
* This package owns the *decisions*, not the derivation. Following Maka's
|
|
5
|
+
* split (verified against `docs/architecture/agent-graph-stream-scheduling-draft.md`):
|
|
6
|
+
* schedule updates, intent claims, operator provisions, and supervisor wakes are
|
|
7
|
+
* the only stateful rows; records, routes, readiness intents, work status, and
|
|
8
|
+
* client snapshots are derived elsewhere (session-projection folds).
|
|
9
|
+
*
|
|
10
|
+
* Storage shape: one {@link KvUnit} (`name: 'agent_graph'`) with a table per
|
|
11
|
+
* record kind, plus derived uniqueness indexes that are rebuilt on open (see
|
|
12
|
+
* {@link GraphControlStore}).
|
|
13
|
+
* @module @hy-sde-org/dsh-graph-control
|
|
14
|
+
*/
|
|
15
|
+
export { GraphControlStore, AGENT_GRAPH_CONTROL_UNIT_VERSION, AGENT_GRAPH_CONTROL_UNIT_NAME, } from './store.ts';
|
|
16
|
+
export type { AgentGraphIntentClaimRecord } from './store.ts';
|
|
17
|
+
export { AgentGraphScheduleRevisionConflictError, AgentGraphScheduleClosedError, AgentGraphIntentClaimConflictError, GraphControlError, } from './errors.ts';
|
|
18
|
+
export type { AgentGraphScheduleUpdateRequest, AgentGraphScheduleUpdate, AgentGraphScheduleUpdateResult, AgentGraphScheduledWork, AgentGraphWorkTarget, AgentGraphSelectedResultInput, AgentGraphScheduleStop, AgentGraphScheduleFinish, AgentGraphScheduleUpdateSource, AgentGraphIntentClaimRequest, AgentGraphIntentClaim, AgentGraphIntentClaimResult, AgentGraphIntentAdmissionState, AgentGraphIntentAdmissionTransition, AgentGraphOperatorProvisionRequest, AgentGraphOperatorProvision, AgentGraphOperatorBinding, AgentGraphProvisionedEdge, AgentGraphOperatorProvisionResult, AgentGraphSupervisorWakeRecord, AgentGraphSupervisorWakeAttemptRecord, AgentGraphSupervisorWakeStatus, ClaimAgentGraphSupervisorWakeRequest, BeginAgentGraphSupervisorWakeAttemptRequest, CompleteAgentGraphSupervisorWakeAttemptRequest, SupersedeAgentGraphSupervisorWakesRequest, AgentGraphControlSnapshot, } from './types.ts';
|
|
19
|
+
export { AGENT_GRAPH_SCHEDULE_SCHEMA_VERSION, AGENT_GRAPH_INTENT_CLAIM_SCHEMA_VERSION, MAX_ADD_WORK, MAX_INPUT_IDS, MAX_SELECTED_RESULT_INPUTS, MAX_SCHEDULE_INSTRUCTION_LENGTH, MAX_WORK_STOPS, graphUpdateId, graphIntentId, graphOperatorId, graphClaimId, graphProvisionId, graphWakeId, graphWakeAttemptId, } from './types.ts';
|
|
20
|
+
//# sourceMappingURL=index.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EACL,iBAAiB,EACjB,gCAAgC,EAChC,6BAA6B,GAC9B,MAAM,YAAY,CAAA;AACnB,YAAY,EAAE,2BAA2B,EAAE,MAAM,YAAY,CAAA;AAC7D,OAAO,EACL,uCAAuC,EACvC,6BAA6B,EAC7B,kCAAkC,EAClC,iBAAiB,GAClB,MAAM,aAAa,CAAA;AACpB,YAAY,EACV,+BAA+B,EAC/B,wBAAwB,EACxB,8BAA8B,EAC9B,uBAAuB,EACvB,oBAAoB,EACpB,6BAA6B,EAC7B,sBAAsB,EACtB,wBAAwB,EACxB,8BAA8B,EAC9B,4BAA4B,EAC5B,qBAAqB,EACrB,2BAA2B,EAC3B,8BAA8B,EAC9B,mCAAmC,EACnC,kCAAkC,EAClC,2BAA2B,EAC3B,yBAAyB,EACzB,yBAAyB,EACzB,iCAAiC,EACjC,8BAA8B,EAC9B,qCAAqC,EACrC,8BAA8B,EAC9B,oCAAoC,EACpC,2CAA2C,EAC3C,8CAA8C,EAC9C,yCAAyC,EACzC,yBAAyB,GAC1B,MAAM,YAAY,CAAA;AACnB,OAAO,EACL,mCAAmC,EACnC,uCAAuC,EACvC,YAAY,EACZ,aAAa,EACb,0BAA0B,EAC1B,+BAA+B,EAC/B,cAAc,EACd,aAAa,EACb,aAAa,EACb,eAAe,EACf,YAAY,EACZ,gBAAgB,EAChB,WAAW,EACX,kBAAkB,GACnB,MAAM,YAAY,CAAA"}
|
package/dist/index.js
ADDED
|
@@ -0,0 +1,18 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Durable control plane for the Agent Graph (Maka port, slice P1).
|
|
3
|
+
*
|
|
4
|
+
* This package owns the *decisions*, not the derivation. Following Maka's
|
|
5
|
+
* split (verified against `docs/architecture/agent-graph-stream-scheduling-draft.md`):
|
|
6
|
+
* schedule updates, intent claims, operator provisions, and supervisor wakes are
|
|
7
|
+
* the only stateful rows; records, routes, readiness intents, work status, and
|
|
8
|
+
* client snapshots are derived elsewhere (session-projection folds).
|
|
9
|
+
*
|
|
10
|
+
* Storage shape: one {@link KvUnit} (`name: 'agent_graph'`) with a table per
|
|
11
|
+
* record kind, plus derived uniqueness indexes that are rebuilt on open (see
|
|
12
|
+
* {@link GraphControlStore}).
|
|
13
|
+
* @module @hy-sde-org/dsh-graph-control
|
|
14
|
+
*/
|
|
15
|
+
export { GraphControlStore, AGENT_GRAPH_CONTROL_UNIT_VERSION, AGENT_GRAPH_CONTROL_UNIT_NAME, } from "./store.js";
|
|
16
|
+
export { AgentGraphScheduleRevisionConflictError, AgentGraphScheduleClosedError, AgentGraphIntentClaimConflictError, GraphControlError, } from "./errors.js";
|
|
17
|
+
export { AGENT_GRAPH_SCHEDULE_SCHEMA_VERSION, AGENT_GRAPH_INTENT_CLAIM_SCHEMA_VERSION, MAX_ADD_WORK, MAX_INPUT_IDS, MAX_SELECTED_RESULT_INPUTS, MAX_SCHEDULE_INSTRUCTION_LENGTH, MAX_WORK_STOPS, graphUpdateId, graphIntentId, graphOperatorId, graphClaimId, graphProvisionId, graphWakeId, graphWakeAttemptId, } from "./types.js";
|
|
18
|
+
//# sourceMappingURL=index.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EACL,iBAAiB,EACjB,gCAAgC,EAChC,6BAA6B,GAC9B,MAAM,YAAY,CAAA;AAEnB,OAAO,EACL,uCAAuC,EACvC,6BAA6B,EAC7B,kCAAkC,EAClC,iBAAiB,GAClB,MAAM,aAAa,CAAA;AA8BpB,OAAO,EACL,mCAAmC,EACnC,uCAAuC,EACvC,YAAY,EACZ,aAAa,EACb,0BAA0B,EAC1B,+BAA+B,EAC/B,cAAc,EACd,aAAa,EACb,aAAa,EACb,eAAe,EACf,YAAY,EACZ,gBAAgB,EAChB,WAAW,EACX,kBAAkB,GACnB,MAAM,YAAY,CAAA"}
|
package/dist/store.d.ts
ADDED
|
@@ -0,0 +1,136 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* The Agent Graph control store: single-writer, durable, heal-on-open.
|
|
3
|
+
*
|
|
4
|
+
* Persisted (authoritative) tables over one {@link KvUnit}:
|
|
5
|
+
* - `schedule` key = updateId → AgentGraphScheduleUpdate
|
|
6
|
+
* - `claims` key = `${graphId}:${intentId}` → claim record (with admission status)
|
|
7
|
+
* - `provisions` key = provisionId → AgentGraphOperatorProvision
|
|
8
|
+
* - `operator_bindings` key = provisionId → AgentGraphOperatorBinding
|
|
9
|
+
* - `wakes` key = wakeId → AgentGraphSupervisorWakeRecord
|
|
10
|
+
* - `wake_attempts` key = `${wakeId}:${attemptId}` → AgentGraphSupervisorWakeAttemptRecord
|
|
11
|
+
*
|
|
12
|
+
* Derived indexes (schedule-by-revision, schedule-by-source, claim-target
|
|
13
|
+
* uniqueness, provision-by-work, wake-by-root-and-graph) are rebuilt from the
|
|
14
|
+
* authoritative rows at open — a torn multi-row write heals instead of
|
|
15
|
+
* corrupting. The storage contract already forbids concurrent writers on one
|
|
16
|
+
* unit ("the domain layer runs one write chain per unit"), so the in-process
|
|
17
|
+
* promise-chain mutex below is the serialization point and per-record
|
|
18
|
+
* `putRecord` calls supply durability.
|
|
19
|
+
* @module
|
|
20
|
+
*/
|
|
21
|
+
import type { KvUnit } from '@deepseek-ai/dsh-storage';
|
|
22
|
+
import type { AgentGraphControlSnapshot, AgentGraphIntentAdmissionState, AgentGraphIntentAdmissionTransition, AgentGraphIntentClaim, AgentGraphIntentClaimRequest, AgentGraphIntentClaimResult, AgentGraphOperatorBinding, AgentGraphOperatorProvision, AgentGraphOperatorProvisionRequest, AgentGraphOperatorProvisionResult, AgentGraphScheduleUpdate, AgentGraphScheduleUpdateRequest, AgentGraphScheduleUpdateResult, AgentGraphSupervisorWakeAttemptRecord, AgentGraphSupervisorWakeRecord, BeginAgentGraphSupervisorWakeAttemptRequest, ClaimAgentGraphSupervisorWakeRequest, CompleteAgentGraphSupervisorWakeAttemptRequest, SupersedeAgentGraphSupervisorWakesRequest } from './types.ts';
|
|
23
|
+
export declare const AGENT_GRAPH_CONTROL_UNIT_NAME = "agent_graph";
|
|
24
|
+
export declare const AGENT_GRAPH_CONTROL_UNIT_VERSION = 1;
|
|
25
|
+
/** Claim row as stored: the public claim plus its durable admission status. */
|
|
26
|
+
export interface AgentGraphIntentClaimRecord extends AgentGraphIntentClaim {
|
|
27
|
+
readonly admissionStatus: AgentGraphIntentAdmissionState;
|
|
28
|
+
readonly cancellationReason?: string;
|
|
29
|
+
}
|
|
30
|
+
export declare class GraphControlStore {
|
|
31
|
+
#private;
|
|
32
|
+
private readonly kv;
|
|
33
|
+
static readonly descriptor: {
|
|
34
|
+
name: string;
|
|
35
|
+
version: number;
|
|
36
|
+
tables: readonly ["schedule", "claims", "provisions", "operator_bindings", "wakes", "wake_attempts"];
|
|
37
|
+
hasGlobal: boolean;
|
|
38
|
+
};
|
|
39
|
+
private constructor();
|
|
40
|
+
/** Open the investigation-free store over an already-opened unit. */
|
|
41
|
+
static open(kv: KvUnit): Promise<GraphControlStore>;
|
|
42
|
+
private scheduleByUpdate;
|
|
43
|
+
private scheduleByGraph;
|
|
44
|
+
private scheduleBySource;
|
|
45
|
+
private claims;
|
|
46
|
+
private claimsByGraph;
|
|
47
|
+
private claimByTurn;
|
|
48
|
+
private claimByRun;
|
|
49
|
+
private provisions;
|
|
50
|
+
private provisionsByGraph;
|
|
51
|
+
private provisionByWork;
|
|
52
|
+
private bindings;
|
|
53
|
+
private bindingsByGraph;
|
|
54
|
+
private bindingByWork;
|
|
55
|
+
private wakes;
|
|
56
|
+
private attempts;
|
|
57
|
+
private lockTail;
|
|
58
|
+
/** Chain one mutation onto the write chain and keep the chain alive. */
|
|
59
|
+
private locked;
|
|
60
|
+
private hydrate;
|
|
61
|
+
/** Derived indexes only — the authoritative rows above are the heal source. */
|
|
62
|
+
private rebuildIndexes;
|
|
63
|
+
private currentRevision;
|
|
64
|
+
private isClosed;
|
|
65
|
+
private put;
|
|
66
|
+
/**
|
|
67
|
+
* Append one idempotent supervisor decision. Revision assignment, source
|
|
68
|
+
* idempotency, and the no-add-work-with-finish invariant are one atomic
|
|
69
|
+
* decision under the write chain.
|
|
70
|
+
*/
|
|
71
|
+
commitScheduleUpdate(request: AgentGraphScheduleUpdateRequest): Promise<AgentGraphScheduleUpdateResult>;
|
|
72
|
+
listScheduleUpdates(graphId: string): Promise<AgentGraphScheduleUpdate[]>;
|
|
73
|
+
readScheduleUpdate(graphId: string, updateId: string): Promise<AgentGraphScheduleUpdate | undefined>;
|
|
74
|
+
/**
|
|
75
|
+
* Claim one runnable intent, linearized against `expectedRevision`.
|
|
76
|
+
* Exactly-once: preallocated turn/run identity is written before any runtime
|
|
77
|
+
* action; a retry of the same claim observes the persisted identity.
|
|
78
|
+
*/
|
|
79
|
+
claimIntentAtScheduleRevision(request: AgentGraphIntentClaimRequest, expectedRevision: number): Promise<AgentGraphIntentClaimResult>;
|
|
80
|
+
/** Plain claim at the current revision (Maka `claimAgentGraphIntent`). */
|
|
81
|
+
claimIntent(request: AgentGraphIntentClaimRequest): Promise<AgentGraphIntentClaimResult>;
|
|
82
|
+
readAgentGraphIntentClaim(graphId: string, intentId: string): Promise<AgentGraphIntentClaimRecord | undefined>;
|
|
83
|
+
listAgentGraphIntentClaims(graphId?: string): Promise<AgentGraphIntentClaimRecord[]>;
|
|
84
|
+
/** `claimed → executing`, revision-conditional; a cancelled claim short-circuits. */
|
|
85
|
+
beginAgentGraphIntentExecutionAtScheduleRevision(graphId: string, intentId: string, expectedRevision: number): Promise<AgentGraphIntentAdmissionTransition>;
|
|
86
|
+
cancelAgentGraphIntentExecution(graphId: string, intentId: string, reason: string): Promise<AgentGraphIntentAdmissionTransition>;
|
|
87
|
+
/**
|
|
88
|
+
* Monotonic operator addition, linearized against `expectedScheduleRevision`.
|
|
89
|
+
* Deterministic provision/operator ids make retries adopt the same operator;
|
|
90
|
+
* the provision row is written atomically with the child-session binding by
|
|
91
|
+
* the caller (the graph-control unit keeps only the graph-side half here).
|
|
92
|
+
*/
|
|
93
|
+
provisionOperator(request: AgentGraphOperatorProvisionRequest): Promise<AgentGraphOperatorProvisionResult>;
|
|
94
|
+
listOperatorProvisions(graphId: string): Promise<AgentGraphOperatorProvision[]>;
|
|
95
|
+
readOperatorProvision(provisionId: string): Promise<AgentGraphOperatorProvision | undefined>;
|
|
96
|
+
/**
|
|
97
|
+
* Persist one operator worktree binding, keyed by `provisionId`. Re-binding
|
|
98
|
+
* the same provision with the SAME lease id adopts the existing row (the
|
|
99
|
+
* original `boundAt` is kept); re-binding with a DIFFERENT lease id is
|
|
100
|
+
* rejected — a provision owns exactly one worktree lease.
|
|
101
|
+
*/
|
|
102
|
+
bindOperatorWorktree(binding: AgentGraphOperatorBinding): Promise<void>;
|
|
103
|
+
readOperatorBinding(provisionId: string): Promise<AgentGraphOperatorBinding | undefined>;
|
|
104
|
+
readOperatorBindingByWork(graphId: string, workId: string): Promise<AgentGraphOperatorBinding | undefined>;
|
|
105
|
+
listOperatorBindings(graphId?: string): Promise<AgentGraphOperatorBinding[]>;
|
|
106
|
+
claimSupervisorWake(request: ClaimAgentGraphSupervisorWakeRequest): Promise<{
|
|
107
|
+
wake: AgentGraphSupervisorWakeRecord;
|
|
108
|
+
created: boolean;
|
|
109
|
+
}>;
|
|
110
|
+
/**
|
|
111
|
+
* Begin one delivery attempt. Acquire is refused once the wake is delivered
|
|
112
|
+
* or superseded; retrying the same attempt returns the existing attempt.
|
|
113
|
+
*/
|
|
114
|
+
beginSupervisorWakeAttempt(request: BeginAgentGraphSupervisorWakeAttemptRequest): Promise<{
|
|
115
|
+
wake: AgentGraphSupervisorWakeRecord;
|
|
116
|
+
attempt?: AgentGraphSupervisorWakeAttemptRecord;
|
|
117
|
+
acquired: boolean;
|
|
118
|
+
}>;
|
|
119
|
+
completeSupervisorWakeAttempt(request: CompleteAgentGraphSupervisorWakeAttemptRequest): Promise<AgentGraphSupervisorWakeRecord>;
|
|
120
|
+
supersedeSupervisorWakes(request: SupersedeAgentGraphSupervisorWakesRequest): Promise<number>;
|
|
121
|
+
readSupervisorWake(graphId: string, wakeId: string): Promise<AgentGraphSupervisorWakeRecord | undefined>;
|
|
122
|
+
listSupervisorWakeAttempts(graphId: string, wakeId: string): Promise<AgentGraphSupervisorWakeAttemptRecord[]>;
|
|
123
|
+
listUnsettledSupervisorWakes(): Promise<AgentGraphSupervisorWakeRecord[]>;
|
|
124
|
+
listRetryableSupervisorWakes(): Promise<AgentGraphSupervisorWakeRecord[]>;
|
|
125
|
+
/**
|
|
126
|
+
* No-op by design: whether an interrupted wake attempt actually completed is
|
|
127
|
+
* a Runtime fact (the AgentRun outcome), so the coordinator (P5) inspects
|
|
128
|
+
* run facts and calls {@link completeSupervisorWakeAttempt} with
|
|
129
|
+
* `retryable_failed`/`delivered`; the store never guesses.
|
|
130
|
+
*/
|
|
131
|
+
recoverSupervisorWakes(): Promise<number>;
|
|
132
|
+
/** Diagnostics / tests: the whole authoritative state, derived indexes excluded. */
|
|
133
|
+
snapshot(): Promise<AgentGraphControlSnapshot>;
|
|
134
|
+
close(): Promise<void>;
|
|
135
|
+
}
|
|
136
|
+
//# sourceMappingURL=store.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"store.d.ts","sourceRoot":"","sources":["../src/store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,0BAA0B,CAAA;AAOtD,OAAO,KAAK,EACV,yBAAyB,EACzB,8BAA8B,EAC9B,mCAAmC,EACnC,qBAAqB,EACrB,4BAA4B,EAC5B,2BAA2B,EAC3B,yBAAyB,EACzB,2BAA2B,EAC3B,kCAAkC,EAClC,iCAAiC,EACjC,wBAAwB,EACxB,+BAA+B,EAC/B,8BAA8B,EAC9B,qCAAqC,EACrC,8BAA8B,EAE9B,2CAA2C,EAC3C,oCAAoC,EACpC,8CAA8C,EAC9C,yCAAyC,EAC1C,MAAM,YAAY,CAAA;AAEnB,eAAO,MAAM,6BAA6B,gBAAgB,CAAA;AAC1D,eAAO,MAAM,gCAAgC,IAAI,CAAA;AAIjD,+EAA+E;AAC/E,MAAM,WAAW,2BAA4B,SAAQ,qBAAqB;IACxE,QAAQ,CAAC,eAAe,EAAE,8BAA8B,CAAA;IACxD,QAAQ,CAAC,kBAAkB,CAAC,EAAE,MAAM,CAAA;CACrC;AA0BD,qBAAa,iBAAiB;;IAQR,OAAO,CAAC,QAAQ,CAAC,EAAE;IAPvC,MAAM,CAAC,QAAQ,CAAC,UAAU;;;;;MAKzB;IAED,OAAO;IAEP,qEAAqE;WACxD,IAAI,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,iBAAiB,CAAC;IAQzD,OAAO,CAAC,gBAAgB,CAA8C;IACtE,OAAO,CAAC,eAAe,CAAgD;IACvE,OAAO,CAAC,gBAAgB,CAA8C;IACtE,OAAO,CAAC,MAAM,CAAiD;IAC/D,OAAO,CAAC,aAAa,CAAmD;IACxE,OAAO,CAAC,WAAW,CAA4B;IAC/C,OAAO,CAAC,UAAU,CAA4B;IAC9C,OAAO,CAAC,UAAU,CAAiD;IACnE,OAAO,CAAC,iBAAiB,CAAmD;IAC5E,OAAO,CAAC,eAAe,CAA4B;IACnD,OAAO,CAAC,QAAQ,CAA+C;IAC/D,OAAO,CAAC,eAAe,CAAiD;IACxE,OAAO,CAAC,aAAa,CAA4B;IACjD,OAAO,CAAC,KAAK,CAAoD;IACjE,OAAO,CAAC,QAAQ,CAA2D;IAC3E,OAAO,CAAC,QAAQ,CAAsC;IAEtD,wEAAwE;IACxE,OAAO,CAAC,MAAM;YASA,OAAO;IA8BrB,+EAA+E;IAC/E,OAAO,CAAC,cAAc;IAsCtB,OAAO,CAAC,eAAe;IAMvB,OAAO,CAAC,QAAQ;YASF,GAAG;IAMjB;;;;OAIG;IACH,oBAAoB,CAAC,OAAO,EAAE,+BAA+B,GAAG,OAAO,CAAC,8BAA8B,CAAC;IAyCvG,mBAAmB,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,wBAAwB,EAAE,CAAC;IAIzE,kBAAkB,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,wBAAwB,GAAG,SAAS,CAAC;IAOpG;;;;OAIG;IACH,6BAA6B,CAC3B,OAAO,EAAE,4BAA4B,EACrC,gBAAgB,EAAE,MAAM,GACvB,OAAO,CAAC,2BAA2B,CAAC;IAsDvC,0EAA0E;IAC1E,WAAW,CAAC,OAAO,EAAE,4BAA4B,GAAG,OAAO,CAAC,2BAA2B,CAAC;IAIxF,yBAAyB,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,2BAA2B,GAAG,SAAS,CAAC;IAI9G,0BAA0B,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,2BAA2B,EAAE,CAAC;IAKpF,qFAAqF;IACrF,gDAAgD,CAC9C,OAAO,EAAE,MAAM,EACf,QAAQ,EAAE,MAAM,EAChB,gBAAgB,EAAE,MAAM,GACvB,OAAO,CAAC,mCAAmC,CAAC;IAwB/C,+BAA+B,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,mCAAmC,CAAC;IAmBhI;;;;;OAKG;IACH,iBAAiB,CAAC,OAAO,EAAE,kCAAkC,GAAG,OAAO,CAAC,iCAAiC,CAAC;IA0C1G,sBAAsB,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,2BAA2B,EAAE,CAAC;IAI/E,qBAAqB,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,2BAA2B,GAAG,SAAS,CAAC;IAK5F;;;;;OAKG;IACH,oBAAoB,CAAC,OAAO,EAAE,yBAAyB,GAAG,OAAO,CAAC,IAAI,CAAC;IA0BvE,mBAAmB,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,yBAAyB,GAAG,SAAS,CAAC;IAIxF,yBAAyB,CACvB,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,MAAM,GACb,OAAO,CAAC,yBAAyB,GAAG,SAAS,CAAC;IAMjD,oBAAoB,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,yBAAyB,EAAE,CAAC;IAO5E,mBAAmB,CAAC,OAAO,EAAE,oCAAoC,GAAG,OAAO,CAAC;QAAE,IAAI,EAAE,8BAA8B,CAAC;QAAC,OAAO,EAAE,OAAO,CAAA;KAAE,CAAC;IAqBvI;;;OAGG;IACH,0BAA0B,CAAC,OAAO,EAAE,2CAA2C,GAAG,OAAO,CAAC;QACxF,IAAI,EAAE,8BAA8B,CAAA;QACpC,OAAO,CAAC,EAAE,qCAAqC,CAAA;QAC/C,QAAQ,EAAE,OAAO,CAAA;KAClB,CAAC;IAuCF,6BAA6B,CAAC,OAAO,EAAE,8CAA8C,GAAG,OAAO,CAAC,8BAA8B,CAAC;IA+B/H,wBAAwB,CAAC,OAAO,EAAE,yCAAyC,GAAG,OAAO,CAAC,MAAM,CAAC;IAuB7F,kBAAkB,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,8BAA8B,GAAG,SAAS,CAAC;IAKxG,0BAA0B,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,qCAAqC,EAAE,CAAC;IAS7G,4BAA4B,IAAI,OAAO,CAAC,8BAA8B,EAAE,CAAC;IAIzE,4BAA4B,IAAI,OAAO,CAAC,8BAA8B,EAAE,CAAC;IAIzE;;;;;OAKG;IACH,sBAAsB,IAAI,OAAO,CAAC,MAAM,CAAC;IAMzC,oFAAoF;IACpF,QAAQ,IAAI,OAAO,CAAC,yBAAyB,CAAC;IAUxC,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;CAG7B"}
|