@openagentsy/memory 0.0.0-stage → 0.2.0

package/dist/inbox.test.js

@@ -0,0 +1,144 @@
+import { describe, expect, it } from 'vitest';
+import { candidateRecord, fakeReader, temporaryRoot } from './fixtures.js';
+import { MemoryInbox, parseCandidateState } from './inbox.js';
+import { MemoryStore } from './store.js';
+async function inboxIn(root, records) {
+    const audited = [];
+    const store = new MemoryStore({ root });
+    const inbox = new MemoryInbox({
+        root,
+        read: fakeReader(records),
+        store,
+        onAudit: (policyId, detail) => {
+            audited.push({ policyId, detail });
+        },
+    });
+    return { inbox, store, audited };
+}
+describe('the memory inbox', () => {
+    it('lists the candidates no person has decided on', async () => {
+        const { root, remove } = await temporaryRoot();
+        try {
+            const records = [
+                candidateRecord({ id: 1 }),
+                candidateRecord({ id: 2, state: 'promoted' }),
+                candidateRecord({ id: 3, bean: 'other' }),
+            ];
+            const { inbox } = await inboxIn(root, records);
+            const pending = await inbox.pending();
+            expect(pending.map((record) => record.id)).toEqual([1]);
+        }
+        finally {
+            await remove();
+        }
+    });
+    it('reads the category and the source out of the record state', () => {
+        expect(parseCandidateState('build · 2a-1')).toEqual({
+            category: 'build',
+            source: '2a-1',
+        });
+        expect(parseCandidateState('nothing here')).toEqual({
+            category: 'uncategorized',
+            source: 'nothing here',
+        });
+    });
+    it('approves a candidate into the store and marks the record promoted', async () => {
+        const { root, remove } = await temporaryRoot();
+        try {
+            const records = [candidateRecord({ id: 7 })];
+            const { inbox, store, audited } = await inboxIn(root, records);
+            const outcome = await inbox.decide(7, 'approve', 'daniel');
+            expect(outcome.ok).toBe(true);
+            const entries = await store.entries();
+            expect(entries).toHaveLength(1);
+            expect(entries[0]?.source).toBe('7 · 2a-1');
+            expect(entries[0]?.category).toBe('build');
+            // An approved candidate becomes a trusted memory (the human's
+            // decision of 2026-10-28); the approval is the person's act.
+            expect(entries[0]?.verified).toBe(true);
+            expect(records[0]?.state).toBe('promoted');
+            expect(audited).toEqual([
+                {
+                    policyId: 'oa.memory.decide',
+                    detail: { recordId: 7, decidedBy: 'daniel', decision: 'approve' },
+                },
+            ]);
+        }
+        finally {
+            await remove();
+        }
+    });
+    it('rejects a candidate, and the store never sees the text', async () => {
+        const { root, remove } = await temporaryRoot();
+        try {
+            const records = [candidateRecord({ id: 7 })];
+            const { inbox, store, audited } = await inboxIn(root, records);
+            const outcome = await inbox.decide(7, 'reject', 'daniel');
+            expect(outcome.ok).toBe(true);
+            expect(await store.entries()).toEqual([]);
+            expect(records[0]?.state).toBe('rejected');
+            expect(audited).toEqual([
+                {
+                    policyId: 'oa.memory.decide',
+                    detail: { recordId: 7, decidedBy: 'daniel', decision: 'reject' },
+                },
+            ]);
+        }
+        finally {
+            await remove();
+        }
+    });
+    it('refuses a record that is not a candidate, and one that was decided', async () => {
+        const { root, remove } = await temporaryRoot();
+        try {
+            const records = [candidateRecord({ id: 7, bean: 'other' }), candidateRecord({ id: 8 })];
+            const { inbox } = await inboxIn(root, records);
+            const notACandidate = await inbox.decide(7, 'approve', 'daniel');
+            expect(notACandidate.ok).toBe(false);
+            if (!notACandidate.ok)
+                expect(notACandidate.reason).toBe('not-a-candidate');
+            await inbox.decide(8, 'reject', 'daniel');
+            const twice = await inbox.decide(8, 'approve', 'daniel');
+            expect(twice.ok).toBe(false);
+            if (!twice.ok)
+                expect(twice.reason).toBe('already-decided');
+        }
+        finally {
+            await remove();
+        }
+    });
+    it('refuses a record that does not exist', async () => {
+        const { root, remove } = await temporaryRoot();
+        try {
+            const { inbox } = await inboxIn(root, []);
+            const outcome = await inbox.decide(99, 'approve', 'daniel');
+            expect(outcome.ok).toBe(false);
+            if (!outcome.ok)
+                expect(outcome.reason).toBe('unknown-record');
+        }
+        finally {
+            await remove();
+        }
+    });
+    it('writes the state back through the injected writer', async () => {
+        const { root, remove } = await temporaryRoot();
+        try {
+            const marked = [];
+            const store = new MemoryStore({ root });
+            const inbox = new MemoryInbox({
+                root,
+                read: fakeReader([candidateRecord({ id: 7 })]),
+                store,
+                markState: (recordId, state) => {
+                    marked.push({ recordId, state });
+                },
+            });
+            await inbox.decide(7, 'approve', 'daniel');
+            expect(marked).toEqual([{ recordId: 7, state: 'promoted' }]);
+        }
+        finally {
+            await remove();
+        }
+    });
+});
+//# sourceMappingURL=inbox.test.js.map

package/dist/inbox.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"inbox.test.js","sourceRoot":"","sources":["../src/inbox.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,eAAe,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AAC3E,OAAO,EAAE,WAAW,EAAE,mBAAmB,EAAE,MAAM,YAAY,CAAC;AAC9D,OAAO,EAA0B,WAAW,EAAE,MAAM,YAAY,CAAC;AAEjE,KAAK,UAAU,OAAO,CAAC,IAAY,EAAE,OAA6C;IAChF,MAAM,OAAO,GAAsD,EAAE,CAAC;IACtE,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC;IACxC,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC;QAC5B,IAAI;QACJ,IAAI,EAAE,UAAU,CAAC,OAAO,CAAC;QACzB,KAAK;QACL,OAAO,EAAE,CAAC,QAAQ,EAAE,MAAM,EAAE,EAAE;YAC5B,OAAO,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC;QACrC,CAAC;KACF,CAAC,CAAC;IACH,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;AACnC,CAAC;AAED,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IAChC,EAAE,CAAC,+CAA+C,EAAE,KAAK,IAAI,EAAE;QAC7D,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,aAAa,EAAE,CAAC;QAC/C,IAAI,CAAC;YACH,MAAM,OAAO,GAAG;gBACd,eAAe,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;gBAC1B,eAAe,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;gBAC7C,eAAe,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;aAC1C,CAAC;YACF,MAAM,EAAE,KAAK,EAAE,GAAG,MAAM,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;YAC/C,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC;YACtC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1D,CAAC;gBAAS,CAAC;YACT,MAAM,MAAM,EAAE,CAAC;QACjB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,MAAM,CAAC,mBAAmB,CAAC,cAAc,CAAC,CAAC,CAAC,OAAO,CAAC;YAClD,QAAQ,EAAE,OAAO;YACjB,MAAM,EAAE,MAAM;SACf,CAAC,CAAC;QACH,MAAM,CAAC,mBAAmB,CAAC,cAAc,CAAC,CAAC,CAAC,OAAO,CAAC;YAClD,QAAQ,EAAE,eAAe;YACzB,MAAM,EAAE,cAAc;SACvB,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mEAAmE,EAAE,KAAK,IAAI,EAAE;QACjF,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,aAAa,EAAE,CAAC;QAC/C,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,CAAC,eAAe,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7C,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,MAAM,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;YAC/D,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;YAC3D,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAE9B,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC;YACtC,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAChC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC5C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC3C,8DAA8D;YAC9D,6DAA6D;YAC7D,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC3C,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC;gBACtB;oBACE,QAAQ,EAAE,kBAAkB;oBAC5B,MAAM,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,SAAS,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE;iBAClE;aACF,CAAC,CAAC;QACL,CAAC;gBAAS,CAAC;YACT,MAAM,MAAM,EAAE,CAAC;QACjB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wDAAwD,EAAE,KAAK,IAAI,EAAE;QACtE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,aAAa,EAAE,CAAC;QAC/C,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,CAAC,eAAe,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7C,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,MAAM,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;YAC/D,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;YAC1D,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC9B,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YAC1C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC3C,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC;gBACtB;oBACE,QAAQ,EAAE,kBAAkB;oBAC5B,MAAM,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,SAAS,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE;iBACjE;aACF,CAAC,CAAC;QACL,CAAC;gBAAS,CAAC;YACT,MAAM,MAAM,EAAE,CAAC;QACjB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oEAAoE,EAAE,KAAK,IAAI,EAAE;QAClF,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,aAAa,EAAE,CAAC;QAC/C,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,CAAC,eAAe,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,EAAE,eAAe,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACxF,MAAM,EAAE,KAAK,EAAE,GAAG,MAAM,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;YAE/C,MAAM,aAAa,GAAG,MAAM,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;YACjE,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrC,IAAI,CAAC,aAAa,CAAC,EAAE;gBAAE,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;YAE5E,MAAM,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;YAC1C,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;YACzD,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC7B,IAAI,CAAC,KAAK,CAAC,EAAE;gBAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;QAC9D,CAAC;gBAAS,CAAC;YACT,MAAM,MAAM,EAAE,CAAC;QACjB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE,KAAK,IAAI,EAAE;QACpD,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,aAAa,EAAE,CAAC;QAC/C,IAAI,CAAC;YACH,MAAM,EAAE,KAAK,EAAE,GAAG,MAAM,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAC1C,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;YAC5D,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC/B,IAAI,CAAC,OAAO,CAAC,EAAE;gBAAE,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;QACjE,CAAC;gBAAS,CAAC;YACT,MAAM,MAAM,EAAE,CAAC;QACjB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mDAAmD,EAAE,KAAK,IAAI,EAAE;QACjE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,aAAa,EAAE,CAAC;QAC/C,IAAI,CAAC;YACH,MAAM,MAAM,GAA0C,EAAE,CAAC;YACzD,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC;YACxC,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC;gBAC5B,IAAI;gBACJ,IAAI,EAAE,UAAU,CAAC,CAAC,eAAe,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC9C,KAAK;gBACL,SAAS,EAAE,CAAC,QAAQ,EAAE,KAAK,EAAE,EAAE;oBAC7B,MAAM,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;gBACnC,CAAC;aACF,CAAC,CAAC;YACH,MAAM,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;YAC3C,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC;QAC/D,CAAC;gBAAS,CAAC;YACT,MAAM,MAAM,EAAE,CAAC;QACjB,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,15 @@
+/**
+ * @openagentsy/memory
+ *
+ * The consumer side of the memory pipeline: the decision, the store, and the
+ * way back in. The producer side is the archivist, which posts candidate
+ * memories as board records.
+ *
+ * Nothing here touches a prompt. A memory is found by asking for it, and a
+ * person decides what is kept.
+ */
+export * from './inbox.js';
+export * from './model.js';
+export * from './store.js';
+export * from './tools.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,cAAc,YAAY,CAAC;AAC3B,cAAc,YAAY,CAAC;AAC3B,cAAc,YAAY,CAAC;AAC3B,cAAc,YAAY,CAAC"}

package/dist/index.js

@@ -0,0 +1,15 @@
+/**
+ * @openagentsy/memory
+ *
+ * The consumer side of the memory pipeline: the decision, the store, and the
+ * way back in. The producer side is the archivist, which posts candidate
+ * memories as board records.
+ *
+ * Nothing here touches a prompt. A memory is found by asking for it, and a
+ * person decides what is kept.
+ */
+export * from './inbox.js';
+export * from './model.js';
+export * from './store.js';
+export * from './tools.js';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,cAAc,YAAY,CAAC;AAC3B,cAAc,YAAY,CAAC;AAC3B,cAAc,YAAY,CAAC;AAC3B,cAAc,YAAY,CAAC"}

package/dist/model.d.ts

@@ -0,0 +1,85 @@
+/**
+ * The memory slice's own vocabulary.
+ *
+ * A memory is what a person decided to keep. It is small on purpose: a
+ * sentence, a tag, a source and a label. Everything else about the pipeline
+ * - the candidates, the decisions, the audit - lives on the board, and this
+ * package is only what survives a decision.
+ */
+/**
+ * How sure the archivist was.
+ *
+ * The label travels with the memory, so a reader can tell a claim that was
+ * checked from one that was inferred. It is not a verification: nobody has
+ * looked at the memory, and `verified` says whether they have.
+ */
+export declare const MEMORY_CONFIDENCES: readonly ["verified", "inferred", "guess"];
+export type MemoryConfidence = (typeof MEMORY_CONFIDENCES)[number];
+/**
+ * One memory.
+ *
+ * The shape the plan gives it (§4.2), plus the verified flag the revision-3
+ * fold adds (§4.8).
+ */
+export interface MemoryEntry {
+    /** `oa-mem-<nanoid6>`. */
+    id: string;
+    /** At most 280 characters. Enforced on write. */
+    text: string;
+    /** A free-form tag: at most 24 characters, in the tasks TAG grammar. */
+    category: string;
+    /** `<recordId> · <bean|commit|file:line>` - where it came from. */
+    source: string;
+    /** The label the archivist gave the candidate. */
+    confidence: MemoryConfidence;
+    /** ISO 8601. */
+    created_at: string;
+    /**
+     * Whether a person has verified this memory.
+     *
+     * It is true on append (the human's decision of 2026-10-28: the
+     * archivist's judgement is the source, and a person marks a memory
+     * unverified when they disagree) and a person can mark it either way
+     * afterwards. The search redacts an unverified memory by default, so this
+     * flag decides what an agent sees before anyone has said anything about
+     * it.
+     */
+    verified: boolean;
+}
+/**
+ * A marker line.
+ *
+ * The store's file is append-only, so a person who forgets or verifies a
+ * memory does not change the entry: the store appends a line that says what
+ * happened, and the view the store returns folds the markers into the
+ * entries. The entry itself is what the archivist said, and it stays that
+ * way.
+ */
+export interface MemoryMarker {
+    kind: 'forget' | 'verify';
+    /** The id of the entry the marker is about. */
+    id: string;
+    /** Who did it. */
+    by: string;
+    /** ISO 8601. */
+    at: string;
+}
+/** The longest text a memory may hold. */
+export declare const MAX_TEXT_LENGTH = 280;
+/** The longest category a memory may hold. */
+export declare const MAX_CATEGORY_LENGTH = 24;
+/** The category a candidate gets when its record carries none. */
+export declare const DEFAULT_CATEGORY = "uncategorized";
+/** The id of a memory: `oa-mem-<nanoid6>`. */
+export declare function createMemoryId(): string;
+/** The text as the dedup sees it: lowercased, whitespace collapsed. */
+export declare function normalizeText(text: string): string;
+/** Whether a category is a tag. */
+export declare function isValidCategory(category: string): boolean;
+/** Whether a value is one of the three confidence labels. */
+export declare function isMemoryConfidence(value: unknown): value is MemoryConfidence;
+/** Whether a value is a memory entry. */
+export declare function isMemoryEntry(value: unknown): value is MemoryEntry;
+/** Whether a value is a marker line. */
+export declare function isMemoryMarker(value: unknown): value is MemoryMarker;
+//# sourceMappingURL=model.d.ts.map

package/dist/model.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"model.d.ts","sourceRoot":"","sources":["../src/model.ts"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AAEH;;;;;;GAMG;AACH,eAAO,MAAM,kBAAkB,4CAA6C,CAAC;AAE7E,MAAM,MAAM,gBAAgB,GAAG,CAAC,OAAO,kBAAkB,CAAC,CAAC,MAAM,CAAC,CAAC;AAEnE;;;;;GAKG;AACH,MAAM,WAAW,WAAW;IAC1B,0BAA0B;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,iDAAiD;IACjD,IAAI,EAAE,MAAM,CAAC;IACb,wEAAwE;IACxE,QAAQ,EAAE,MAAM,CAAC;IACjB,mEAAmE;IACnE,MAAM,EAAE,MAAM,CAAC;IACf,kDAAkD;IAClD,UAAU,EAAE,gBAAgB,CAAC;IAC7B,gBAAgB;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB;;;;;;;;;OASG;IACH,QAAQ,EAAE,OAAO,CAAC;CACnB;AAED;;;;;;;;GAQG;AACH,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,QAAQ,GAAG,QAAQ,CAAC;IAC1B,+CAA+C;IAC/C,EAAE,EAAE,MAAM,CAAC;IACX,kBAAkB;IAClB,EAAE,EAAE,MAAM,CAAC;IACX,gBAAgB;IAChB,EAAE,EAAE,MAAM,CAAC;CACZ;AAED,0CAA0C;AAC1C,eAAO,MAAM,eAAe,MAAM,CAAC;AAEnC,8CAA8C;AAC9C,eAAO,MAAM,mBAAmB,KAAK,CAAC;AAWtC,kEAAkE;AAClE,eAAO,MAAM,gBAAgB,kBAAkB,CAAC;AAEhD,8CAA8C;AAC9C,wBAAgB,cAAc,IAAI,MAAM,CAEvC;AAED,uEAAuE;AACvE,wBAAgB,aAAa,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAElD;AAED,mCAAmC;AACnC,wBAAgB,eAAe,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAEzD;AAED,6DAA6D;AAC7D,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,gBAAgB,CAE5E;AAED,yCAAyC;AACzC,wBAAgB,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,WAAW,CAYlE;AAED,wCAAwC;AACxC,wBAAgB,cAAc,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,YAAY,CASpE"}

package/dist/model.js

@@ -0,0 +1,71 @@
+import { nanoid } from 'nanoid';
+/**
+ * The memory slice's own vocabulary.
+ *
+ * A memory is what a person decided to keep. It is small on purpose: a
+ * sentence, a tag, a source and a label. Everything else about the pipeline
+ * - the candidates, the decisions, the audit - lives on the board, and this
+ * package is only what survives a decision.
+ */
+/**
+ * How sure the archivist was.
+ *
+ * The label travels with the memory, so a reader can tell a claim that was
+ * checked from one that was inferred. It is not a verification: nobody has
+ * looked at the memory, and `verified` says whether they have.
+ */
+export const MEMORY_CONFIDENCES = ['verified', 'inferred', 'guess'];
+/** The longest text a memory may hold. */
+export const MAX_TEXT_LENGTH = 280;
+/** The longest category a memory may hold. */
+export const MAX_CATEGORY_LENGTH = 24;
+/**
+ * The category grammar.
+ *
+ * The same grammar the task store uses for a tag: a lowercase word, and
+ * words joined by single hyphens. A category that is not a tag is a
+ * sentence, and a sentence is not a category.
+ */
+const CATEGORY_GRAMMAR = /^[a-z][a-z0-9]*(?:-[a-z0-9]+)*$/;
+/** The category a candidate gets when its record carries none. */
+export const DEFAULT_CATEGORY = 'uncategorized';
+/** The id of a memory: `oa-mem-<nanoid6>`. */
+export function createMemoryId() {
+    return `oa-mem-${nanoid(6)}`;
+}
+/** The text as the dedup sees it: lowercased, whitespace collapsed. */
+export function normalizeText(text) {
+    return text.toLowerCase().replace(/\s+/g, ' ').trim();
+}
+/** Whether a category is a tag. */
+export function isValidCategory(category) {
+    return category.length <= MAX_CATEGORY_LENGTH && CATEGORY_GRAMMAR.test(category);
+}
+/** Whether a value is one of the three confidence labels. */
+export function isMemoryConfidence(value) {
+    return typeof value === 'string' && MEMORY_CONFIDENCES.includes(value);
+}
+/** Whether a value is a memory entry. */
+export function isMemoryEntry(value) {
+    if (typeof value !== 'object' || value === null)
+        return false;
+    const entry = value;
+    return (typeof entry.id === 'string' &&
+        typeof entry.text === 'string' &&
+        typeof entry.category === 'string' &&
+        typeof entry.source === 'string' &&
+        typeof entry.created_at === 'string' &&
+        typeof entry.verified === 'boolean' &&
+        isMemoryConfidence(entry.confidence));
+}
+/** Whether a value is a marker line. */
+export function isMemoryMarker(value) {
+    if (typeof value !== 'object' || value === null)
+        return false;
+    const marker = value;
+    return ((marker.kind === 'forget' || marker.kind === 'verify') &&
+        typeof marker.id === 'string' &&
+        typeof marker.by === 'string' &&
+        typeof marker.at === 'string');
+}
+//# sourceMappingURL=model.js.map

package/dist/model.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"model.js","sourceRoot":"","sources":["../src/model.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAEhC;;;;;;;GAOG;AAEH;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,UAAU,EAAE,UAAU,EAAE,OAAO,CAAU,CAAC;AAuD7E,0CAA0C;AAC1C,MAAM,CAAC,MAAM,eAAe,GAAG,GAAG,CAAC;AAEnC,8CAA8C;AAC9C,MAAM,CAAC,MAAM,mBAAmB,GAAG,EAAE,CAAC;AAEtC;;;;;;GAMG;AACH,MAAM,gBAAgB,GAAG,iCAAiC,CAAC;AAE3D,kEAAkE;AAClE,MAAM,CAAC,MAAM,gBAAgB,GAAG,eAAe,CAAC;AAEhD,8CAA8C;AAC9C,MAAM,UAAU,cAAc;IAC5B,OAAO,UAAU,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;AAC/B,CAAC;AAED,uEAAuE;AACvE,MAAM,UAAU,aAAa,CAAC,IAAY;IACxC,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;AACxD,CAAC;AAED,mCAAmC;AACnC,MAAM,UAAU,eAAe,CAAC,QAAgB;IAC9C,OAAO,QAAQ,CAAC,MAAM,IAAI,mBAAmB,IAAI,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;AACnF,CAAC;AAED,6DAA6D;AAC7D,MAAM,UAAU,kBAAkB,CAAC,KAAc;IAC/C,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAK,kBAAwC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;AAChG,CAAC;AAED,yCAAyC;AACzC,MAAM,UAAU,aAAa,CAAC,KAAc;IAC1C,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,KAAK,CAAC;IAC9D,MAAM,KAAK,GAAG,KAAgC,CAAC;IAC/C,OAAO,CACL,OAAO,KAAK,CAAC,EAAE,KAAK,QAAQ;QAC5B,OAAO,KAAK,CAAC,IAAI,KAAK,QAAQ;QAC9B,OAAO,KAAK,CAAC,QAAQ,KAAK,QAAQ;QAClC,OAAO,KAAK,CAAC,MAAM,KAAK,QAAQ;QAChC,OAAO,KAAK,CAAC,UAAU,KAAK,QAAQ;QACpC,OAAO,KAAK,CAAC,QAAQ,KAAK,SAAS;QACnC,kBAAkB,CAAC,KAAK,CAAC,UAAU,CAAC,CACrC,CAAC;AACJ,CAAC;AAED,wCAAwC;AACxC,MAAM,UAAU,cAAc,CAAC,KAAc;IAC3C,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,KAAK,CAAC;IAC9D,MAAM,MAAM,GAAG,KAAgC,CAAC;IAChD,OAAO,CACL,CAAC,MAAM,CAAC,IAAI,KAAK,QAAQ,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC;QACtD,OAAO,MAAM,CAAC,EAAE,KAAK,QAAQ;QAC7B,OAAO,MAAM,CAAC,EAAE,KAAK,QAAQ;QAC7B,OAAO,MAAM,CAAC,EAAE,KAAK,QAAQ,CAC9B,CAAC;AACJ,CAAC"}

package/dist/permissions.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=permissions.test.d.ts.map

package/dist/permissions.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"permissions.test.d.ts","sourceRoot":"","sources":["../src/permissions.test.ts"],"names":[],"mappings":""}

package/dist/permissions.test.js

@@ -0,0 +1,53 @@
+import { existsSync } from 'node:fs';
+import { readdir, readFile } from 'node:fs/promises';
+import { join } from 'node:path';
+import { toV2Permissions, withProtectedPaths } from '@openagentsy/core';
+import { describe, expect, it } from 'vitest';
+import { loadRealRoles, repositoryRoot } from './fixtures.js';
+/**
+ * The permission map is the enforcement.
+ *
+ * The hook cannot see an MCP call on the pinned binary, so the map is what
+ * stops an agent from deciding what is kept. The map has to carry the deny
+ * under both of the names the tool is called by: the bare name, and the
+ * name the MCP server publishes it under.
+ */
+const DECIDE_NAMES = ['oa_memory_decide', 'openagentsy_memory_decide'];
+/** Whether a generated prompt denies a tool. */
+function deniesTool(content, tool) {
+    if (new RegExp(`^\\s*${tool}: deny$`, 'm').test(content))
+        return true;
+    return new RegExp(`action: ${tool}\\n\\s+resource: [^\\n]*\\n\\s+effect: deny`).test(content);
+}
+describe('the permission map and the decide tool', () => {
+    it('denies the decide tool to every role, under both of its names', async () => {
+        const roles = await loadRealRoles();
+        const names = Object.keys(roles.roles);
+        expect(names.length).toBeGreaterThan(0);
+        for (const name of names) {
+            const role = roles.roles[name];
+            if (role === undefined)
+                continue;
+            const rules = toV2Permissions(withProtectedPaths(role, roles.protectedPaths));
+            for (const tool of DECIDE_NAMES) {
+                expect(rules).toContainEqual({ action: tool, resource: '*', effect: 'deny' });
+            }
+        }
+    });
+    it('carries the deny into every generated agent', async () => {
+        const dir = join(repositoryRoot, '.opencode', 'agents');
+        // The generated files are not in the repository: they are written by
+        // `openagentsy build`, and a checkout that never ran it has none.
+        if (!existsSync(dir))
+            return;
+        const files = (await readdir(dir)).filter((file) => file.endsWith('.md'));
+        expect(files.length).toBeGreaterThan(0);
+        for (const file of files) {
+            const content = await readFile(join(dir, file), 'utf8');
+            for (const tool of DECIDE_NAMES) {
+                expect(deniesTool(content, tool)).toBe(true);
+            }
+        }
+    });
+});
+//# sourceMappingURL=permissions.test.js.map

package/dist/permissions.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"permissions.test.js","sourceRoot":"","sources":["../src/permissions.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AACrC,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AACrD,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AACxE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AAE9D;;;;;;;GAOG;AACH,MAAM,YAAY,GAAG,CAAC,kBAAkB,EAAE,2BAA2B,CAAU,CAAC;AAEhF,gDAAgD;AAChD,SAAS,UAAU,CAAC,OAAe,EAAE,IAAY;IAC/C,IAAI,IAAI,MAAM,CAAC,QAAQ,IAAI,SAAS,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;QAAE,OAAO,IAAI,CAAC;IACtE,OAAO,IAAI,MAAM,CAAC,WAAW,IAAI,6CAA6C,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AAChG,CAAC;AAED,QAAQ,CAAC,wCAAwC,EAAE,GAAG,EAAE;IACtD,EAAE,CAAC,+DAA+D,EAAE,KAAK,IAAI,EAAE;QAC7E,MAAM,KAAK,GAAG,MAAM,aAAa,EAAE,CAAC;QACpC,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACvC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAExC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,IAAI,KAAK,SAAS;gBAAE,SAAS;YACjC,MAAM,KAAK,GAAG,eAAe,CAAC,kBAAkB,CAAC,IAAI,EAAE,KAAK,CAAC,cAAc,CAAC,CAAC,CAAC;YAC9E,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;gBAChC,MAAM,CAAC,KAAK,CAAC,CAAC,cAAc,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;YAChF,CAAC;QACH,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6CAA6C,EAAE,KAAK,IAAI,EAAE;QAC3D,MAAM,GAAG,GAAG,IAAI,CAAC,cAAc,EAAE,WAAW,EAAE,QAAQ,CAAC,CAAC;QACxD,qEAAqE;QACrE,kEAAkE;QAClE,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;YAAE,OAAO;QAE7B,MAAM,KAAK,GAAG,CAAC,MAAM,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;QAC1E,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACxC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,OAAO,GAAG,MAAM,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,MAAM,CAAC,CAAC;YACxD,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;gBAChC,MAAM,CAAC,UAAU,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/store.d.ts

@@ -0,0 +1,142 @@
+import { type MemoryConfidence, type MemoryEntry } from './model.js';
+/**
+ * The memory store.
+ *
+ * One file, one JSON object per line, so `grep` and `wc -l` work on it. The
+ * file lives at the state root (§3.9), which is the root of the project the
+ * store is given: `.openagentsy/memory.jsonl`. The resolution of that root
+ * from a worktree is a later phase, so the root is injected here and a test
+ * passes a temporary directory.
+ */
+/** What a decision is audited with. */
+export type MemoryAuditDetail = {
+    /** The board record the decision was about. */
+    recordId?: number;
+    /** The memory the decision was about. */
+    id?: string;
+    /** Who decided. */
+    decidedBy: string;
+    /** The decision itself, for the inbox's decisions. */
+    decision?: 'approve' | 'reject';
+};
+/** The audit sink a decision is written to. */
+export type MemoryAuditSink = (policyId: string, detail: MemoryAuditDetail) => void | Promise<void>;
+export type MemoryStoreOptions = {
+    /** The state root. The file is `<root>/.openagentsy/memory.jsonl`. */
+    root: string;
+    /** The clock, so a test can pin the time. */
+    now?: () => Date;
+    /** Where a person-only change is audited. */
+    onAudit?: MemoryAuditSink;
+};
+/** What a caller hands the store. */
+export type AppendInput = {
+    text: string;
+    category: string;
+    source: string;
+    confidence: MemoryConfidence;
+    /** Whether a person has already verified it. False unless said so. */
+    verified?: boolean;
+};
+/** What the store did with an append. */
+export type AppendOutcome = {
+    ok: true;
+    entry: MemoryEntry;
+    redactions: number;
+} | {
+    ok: false;
+    reason: 'duplicate';
+    id: string;
+    redactions: number;
+} | {
+    ok: false;
+    reason: 'invalid';
+    detail: string;
+    redactions: number;
+};
+/** How the results are ordered. */
+export type MemoryOrdering = 'relevance' | 'recency' | 'lost-in-the-middle';
+/** A search. */
+export type MemoryQuery = {
+    q: string;
+    category?: string;
+    limit?: number;
+    ordering?: MemoryOrdering;
+};
+/** A result and the score that found it. */
+export type ScoredMemory = {
+    entry: MemoryEntry;
+    score: number;
+};
+/**
+ * The store of what a person decided to keep.
+ *
+ * Append-only: an entry is written once and never changed. A person who
+ * forgets or verifies a memory appends a marker instead, and the view this
+ * class returns folds the markers into the entries. The file therefore only
+ * ever grows, and a line in it is never rewritten.
+ */
+export declare class MemoryStore {
+    private readonly root;
+    private readonly now;
+    private readonly onAudit;
+    private cached;
+    constructor(options: MemoryStoreOptions);
+    /** The file the store lives in. */
+    get path(): string;
+    /**
+     * Add a memory.
+     *
+     * The redaction runs first: nothing reaches the file that carries a
+     * secret, and the count comes back with the outcome so the caller can
+     * report it. A text that is already a duplicate is refused with the id of
+     * the entry that holds it, because a memory that is already known is not
+     * a new thing.
+     */
+    append(input: AppendInput): Promise<AppendOutcome>;
+    /** Every memory that is neither forgotten nor superseded. */
+    entries(): Promise<MemoryEntry[]>;
+    /**
+     * Find the memories that mention the terms of a query.
+     *
+     * The store is small - a target of under ten thousand entries - so the
+     * scan is over the parsed lines, and the parsed lines are cached against
+     * the file's stat, so a search that follows a search reads the file once.
+     */
+    search(query: MemoryQuery): Promise<ScoredMemory[]>;
+    /**
+     * Forget a memory.
+     *
+     * The entry stays in the file and the store stops returning it. The
+     * removal command is a later phase; this is the path it will take, and
+     * the person who did it is on the marker.
+     */
+    forget(id: string, by?: string): Promise<boolean>;
+    /**
+     * Mark a memory verified.
+     *
+     * A memory is trusted on write, and this is the other direction: a
+     * person says it is true. The archivist's label is not a verification:
+     * the archivist never looked at the memory.
+     */
+    verify(id: string, decidedBy: string): Promise<boolean>;
+    /** Append one line to the file. */
+    private appendLine;
+    /**
+     * The parsed file, from the cache when the file has not changed.
+     *
+     * The key is the file's size and modification time, so a file that was
+     * appended to misses the cache and a file that was not is read once.
+     */
+    private read;
+}
+/**
+ * The order that keeps the best results where a model looks first.
+ *
+ * A model attends to the start and the end of a context more than to the
+ * middle, so the strongest result goes first and the second strongest goes
+ * last, and the rest fill in between. The ranking is unchanged: only the
+ * positions move.
+ */
+export declare function lostInTheMiddle<T>(ranked: readonly T[]): T[];
+//# sourceMappingURL=store.d.ts.map

package/dist/store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"store.d.ts","sourceRoot":"","sources":["../src/store.ts"],"names":[],"mappings":"AAGA,OAAO,EAML,KAAK,gBAAgB,EACrB,KAAK,WAAW,EAGjB,MAAM,YAAY,CAAC;AAEpB;;;;;;;;GAQG;AAEH,uCAAuC;AACvC,MAAM,MAAM,iBAAiB,GAAG;IAC9B,+CAA+C;IAC/C,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,yCAAyC;IACzC,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,mBAAmB;IACnB,SAAS,EAAE,MAAM,CAAC;IAClB,sDAAsD;IACtD,QAAQ,CAAC,EAAE,SAAS,GAAG,QAAQ,CAAC;CACjC,CAAC;AAEF,+CAA+C;AAC/C,MAAM,MAAM,eAAe,GAAG,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,iBAAiB,KAAK,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;AAEpG,MAAM,MAAM,kBAAkB,GAAG;IAC/B,sEAAsE;IACtE,IAAI,EAAE,MAAM,CAAC;IACb,6CAA6C;IAC7C,GAAG,CAAC,EAAE,MAAM,IAAI,CAAC;IACjB,6CAA6C;IAC7C,OAAO,CAAC,EAAE,eAAe,CAAC;CAC3B,CAAC;AAEF,qCAAqC;AACrC,MAAM,MAAM,WAAW,GAAG;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,gBAAgB,CAAC;IAC7B,sEAAsE;IACtE,QAAQ,CAAC,EAAE,OAAO,CAAC;CACpB,CAAC;AAEF,yCAAyC;AACzC,MAAM,MAAM,aAAa,GACrB;IAAE,EAAE,EAAE,IAAI,CAAC;IAAC,KAAK,EAAE,WAAW,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,GACpD;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,MAAM,EAAE,WAAW,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,GAClE;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,MAAM,EAAE,SAAS,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,CAAC;AAEzE,mCAAmC;AACnC,MAAM,MAAM,cAAc,GAAG,WAAW,GAAG,SAAS,GAAG,oBAAoB,CAAC;AAE5E,gBAAgB;AAChB,MAAM,MAAM,WAAW,GAAG;IACxB,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE,cAAc,CAAC;CAC3B,CAAC;AAEF,4CAA4C;AAC5C,MAAM,MAAM,YAAY,GAAG;IACzB,KAAK,EAAE,WAAW,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AAUF;;;;;;;GAOG;AACH,qBAAa,WAAW;IACtB,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAS;IAC9B,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAa;IACjC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAA8B;IACtD,OAAO,CAAC,MAAM,CAAgD;gBAElD,OAAO,EAAE,kBAAkB;IAMvC,mCAAmC;IACnC,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED;;;;;;;;OAQG;IACG,MAAM,CAAC,KAAK,EAAE,WAAW,GAAG,OAAO,CAAC,aAAa,CAAC;IAkDxD,6DAA6D;IACvD,OAAO,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;IAavC;;;;;;OAMG;IACG,MAAM,CAAC,KAAK,EAAE,WAAW,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;IAgBzD;;;;;;OAMG;IACG,MAAM,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,GAAE,MAAkB,GAAG,OAAO,CAAC,OAAO,CAAC;IAQlE;;;;;;OAMG;IACG,MAAM,CAAC,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAQ7D,mCAAmC;YACrB,UAAU;IAMxB;;;;;OAKG;YACW,IAAI;CAmCnB;AAiDD;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,GAAG,CAAC,EAAE,CAQ5D"}