driftdetect-cortex 0.9.41

package/dist/causal/traversal/traverser.js

@@ -0,0 +1,254 @@
+/**
+ * Causal Graph Traverser
+ *
+ * Traverses the causal graph to trace origins and effects
+ * of memories, building causal chains for narrative generation.
+ *
+ * @module causal/traversal/traverser
+ */
+/**
+ * Default traversal options
+ */
+const DEFAULT_OPTIONS = {
+    maxDepth: 5,
+    minStrength: 0.3,
+    relationTypes: [],
+    includeInferred: true,
+    maxNodes: 50,
+    computeConfidence: true,
+};
+/**
+ * Causal graph traverser
+ *
+ * Provides methods to traverse the causal graph and build
+ * chains of causally connected memories.
+ */
+export class CausalGraphTraverser {
+    causalStorage;
+    memoryStorage;
+    constructor(causalStorage, memoryStorage) {
+        this.causalStorage = causalStorage;
+        this.memoryStorage = memoryStorage;
+    }
+    /**
+     * Trace the origins of a memory (what caused it)
+     *
+     * Traverses backwards through the causal graph to find
+     * all memories that contributed to this one.
+     */
+    async traceOrigins(memoryId, options) {
+        const opts = { ...DEFAULT_OPTIONS, ...options };
+        const visited = new Set();
+        const nodes = [];
+        const edges = [];
+        await this.traverseBackward(memoryId, 0, opts, visited, nodes, edges);
+        const chainConfidence = opts.computeConfidence
+            ? this.computeChainConfidence(edges)
+            : 1.0;
+        return {
+            rootId: memoryId,
+            direction: 'origins',
+            nodes,
+            edges,
+            maxDepth: Math.max(0, ...nodes.map(n => n.depth)),
+            totalMemories: nodes.length,
+            chainConfidence,
+            computedAt: new Date().toISOString(),
+        };
+    }
+    /**
+     * Trace the effects of a memory (what it caused)
+     *
+     * Traverses forward through the causal graph to find
+     * all memories that were influenced by this one.
+     */
+    async traceEffects(memoryId, options) {
+        const opts = { ...DEFAULT_OPTIONS, ...options };
+        const visited = new Set();
+        const nodes = [];
+        const edges = [];
+        await this.traverseForward(memoryId, 0, opts, visited, nodes, edges);
+        const chainConfidence = opts.computeConfidence
+            ? this.computeChainConfidence(edges)
+            : 1.0;
+        return {
+            rootId: memoryId,
+            direction: 'effects',
+            nodes,
+            edges,
+            maxDepth: Math.max(0, ...nodes.map(n => n.depth)),
+            totalMemories: nodes.length,
+            chainConfidence,
+            computedAt: new Date().toISOString(),
+        };
+    }
+    /**
+     * Trace both origins and effects
+     */
+    async traceBidirectional(memoryId, options) {
+        const opts = { ...DEFAULT_OPTIONS, ...options };
+        const visited = new Set();
+        const nodes = [];
+        const edges = [];
+        // Trace origins
+        await this.traverseBackward(memoryId, 0, opts, visited, nodes, edges);
+        // Reset visited for forward traversal but keep the root
+        visited.clear();
+        visited.add(memoryId);
+        // Trace effects
+        await this.traverseForward(memoryId, 0, opts, visited, nodes, edges);
+        // Deduplicate nodes
+        const uniqueNodes = this.deduplicateNodes(nodes);
+        const chainConfidence = opts.computeConfidence
+            ? this.computeChainConfidence(edges)
+            : 1.0;
+        return {
+            rootId: memoryId,
+            direction: 'bidirectional',
+            nodes: uniqueNodes,
+            edges,
+            maxDepth: Math.max(0, ...uniqueNodes.map(n => n.depth)),
+            totalMemories: uniqueNodes.length,
+            chainConfidence,
+            computedAt: new Date().toISOString(),
+        };
+    }
+    /**
+     * Get immediate neighbors (one hop)
+     */
+    async getNeighbors(memoryId, options) {
+        const opts = { ...DEFAULT_OPTIONS, ...options, maxDepth: 1 };
+        const queryOpts = {
+            minStrength: opts.minStrength,
+            includeInferred: opts.includeInferred,
+        };
+        if (opts.relationTypes.length > 0) {
+            queryOpts.relationTypes = opts.relationTypes;
+        }
+        const incomingEdges = await this.causalStorage.getEdgesTo(memoryId, queryOpts);
+        const outgoingEdges = await this.causalStorage.getEdgesFrom(memoryId, queryOpts);
+        const incoming = [];
+        const outgoing = [];
+        for (const edge of incomingEdges) {
+            const node = await this.createNode(edge.sourceId, 1, [], [edge]);
+            if (node)
+                incoming.push(node);
+        }
+        for (const edge of outgoingEdges) {
+            const node = await this.createNode(edge.targetId, 1, [edge], []);
+            if (node)
+                outgoing.push(node);
+        }
+        return { incoming, outgoing };
+    }
+    // Private traversal methods
+    async traverseBackward(memoryId, depth, options, visited, nodes, edges) {
+        if (visited.has(memoryId))
+            return;
+        if (depth > options.maxDepth)
+            return;
+        if (nodes.length >= options.maxNodes)
+            return;
+        visited.add(memoryId);
+        const queryOpts = {
+            minStrength: options.minStrength,
+            includeInferred: options.includeInferred,
+        };
+        if (options.relationTypes.length > 0) {
+            queryOpts.relationTypes = options.relationTypes;
+        }
+        // Get edges pointing TO this memory (causes)
+        const incomingEdges = await this.causalStorage.getEdgesTo(memoryId, queryOpts);
+        // Get edges FROM this memory for the node
+        const outgoingEdges = await this.causalStorage.getEdgesFrom(memoryId, queryOpts);
+        // Create node for this memory
+        const node = await this.createNode(memoryId, depth, outgoingEdges, incomingEdges);
+        if (node) {
+            nodes.push(node);
+        }
+        // Add edges to collection
+        for (const edge of incomingEdges) {
+            if (!edges.find(e => e.id === edge.id)) {
+                edges.push(edge);
+            }
+        }
+        // Recursively traverse causes
+        for (const edge of incomingEdges) {
+            if (nodes.length < options.maxNodes) {
+                await this.traverseBackward(edge.sourceId, depth + 1, options, visited, nodes, edges);
+            }
+        }
+    }
+    async traverseForward(memoryId, depth, options, visited, nodes, edges) {
+        if (visited.has(memoryId))
+            return;
+        if (depth > options.maxDepth)
+            return;
+        if (nodes.length >= options.maxNodes)
+            return;
+        visited.add(memoryId);
+        const queryOpts = {
+            minStrength: options.minStrength,
+            includeInferred: options.includeInferred,
+        };
+        if (options.relationTypes.length > 0) {
+            queryOpts.relationTypes = options.relationTypes;
+        }
+        // Get edges FROM this memory (effects)
+        const outgoingEdges = await this.causalStorage.getEdgesFrom(memoryId, queryOpts);
+        // Get edges TO this memory for the node
+        const incomingEdges = await this.causalStorage.getEdgesTo(memoryId, queryOpts);
+        // Create node for this memory
+        const node = await this.createNode(memoryId, depth, outgoingEdges, incomingEdges);
+        if (node) {
+            nodes.push(node);
+        }
+        // Add edges to collection
+        for (const edge of outgoingEdges) {
+            if (!edges.find(e => e.id === edge.id)) {
+                edges.push(edge);
+            }
+        }
+        // Recursively traverse effects
+        for (const edge of outgoingEdges) {
+            if (nodes.length < options.maxNodes) {
+                await this.traverseForward(edge.targetId, depth + 1, options, visited, nodes, edges);
+            }
+        }
+    }
+    async createNode(memoryId, depth, outgoingEdges, incomingEdges) {
+        const memory = await this.memoryStorage.read(memoryId);
+        if (!memory)
+            return null;
+        return {
+            memoryId,
+            memoryType: memory.type,
+            summary: memory.summary,
+            depth,
+            incomingEdges,
+            outgoingEdges,
+        };
+    }
+    computeChainConfidence(edges) {
+        if (edges.length === 0)
+            return 1.0;
+        // Chain confidence is the product of edge strengths
+        // (weakest link principle)
+        const strengths = edges.map(e => e.strength);
+        const minStrength = Math.min(...strengths);
+        const avgStrength = strengths.reduce((a, b) => a + b, 0) / strengths.length;
+        // Weighted combination: 60% min, 40% average
+        return minStrength * 0.6 + avgStrength * 0.4;
+    }
+    deduplicateNodes(nodes) {
+        const seen = new Map();
+        for (const node of nodes) {
+            const existing = seen.get(node.memoryId);
+            if (!existing || node.depth < existing.depth) {
+                seen.set(node.memoryId, node);
+            }
+        }
+        return Array.from(seen.values());
+    }
+}
+//# sourceMappingURL=traverser.js.map

package/dist/causal/traversal/traverser.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"traverser.js","sourceRoot":"","sources":["../../../src/causal/traversal/traverser.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAWH;;GAEG;AACH,MAAM,eAAe,GAAoC;IACvD,QAAQ,EAAE,CAAC;IACX,WAAW,EAAE,GAAG;IAChB,aAAa,EAAE,EAAE;IACjB,eAAe,EAAE,IAAI;IACrB,QAAQ,EAAE,EAAE;IACZ,iBAAiB,EAAE,IAAI;CACxB,CAAC;AAEF;;;;;GAKG;AACH,MAAM,OAAO,oBAAoB;IAErB;IACA;IAFV,YACU,aAA6B,EAC7B,aAA6B;QAD7B,kBAAa,GAAb,aAAa,CAAgB;QAC7B,kBAAa,GAAb,aAAa,CAAgB;IACpC,CAAC;IAEJ;;;;;OAKG;IACH,KAAK,CAAC,YAAY,CAChB,QAAgB,EAChB,OAA+B;QAE/B,MAAM,IAAI,GAAG,EAAE,GAAG,eAAe,EAAE,GAAG,OAAO,EAAE,CAAC;QAChD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAiB,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAiB,EAAE,CAAC;QAE/B,MAAM,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QAEtE,MAAM,eAAe,GAAG,IAAI,CAAC,iBAAiB;YAC5C,CAAC,CAAC,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC;YACpC,CAAC,CAAC,GAAG,CAAC;QAER,OAAO;YACL,MAAM,EAAE,QAAQ;YAChB,SAAS,EAAE,SAAS;YACpB,KAAK;YACL,KAAK;YACL,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACjD,aAAa,EAAE,KAAK,CAAC,MAAM;YAC3B,eAAe;YACf,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACrC,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,YAAY,CAChB,QAAgB,EAChB,OAA+B;QAE/B,MAAM,IAAI,GAAG,EAAE,GAAG,eAAe,EAAE,GAAG,OAAO,EAAE,CAAC;QAChD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAiB,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAiB,EAAE,CAAC;QAE/B,MAAM,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QAErE,MAAM,eAAe,GAAG,IAAI,CAAC,iBAAiB;YAC5C,CAAC,CAAC,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC;YACpC,CAAC,CAAC,GAAG,CAAC;QAER,OAAO;YACL,MAAM,EAAE,QAAQ;YAChB,SAAS,EAAE,SAAS;YACpB,KAAK;YACL,KAAK;YACL,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACjD,aAAa,EAAE,KAAK,CAAC,MAAM;YAC3B,eAAe;YACf,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACrC,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,kBAAkB,CACtB,QAAgB,EAChB,OAA+B;QAE/B,MAAM,IAAI,GAAG,EAAE,GAAG,eAAe,EAAE,GAAG,OAAO,EAAE,CAAC;QAChD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAiB,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAiB,EAAE,CAAC;QAE/B,gBAAgB;QAChB,MAAM,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QAEtE,wDAAwD;QACxD,OAAO,CAAC,KAAK,EAAE,CAAC;QAChB,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAEtB,gBAAgB;QAChB,MAAM,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QAErE,oBAAoB;QACpB,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;QAEjD,MAAM,eAAe,GAAG,IAAI,CAAC,iBAAiB;YAC5C,CAAC,CAAC,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC;YACpC,CAAC,CAAC,GAAG,CAAC;QAER,OAAO;YACL,MAAM,EAAE,QAAQ;YAChB,SAAS,EAAE,eAAe;YAC1B,KAAK,EAAE,WAAW;YAClB,KAAK;YACL,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACvD,aAAa,EAAE,WAAW,CAAC,MAAM;YACjC,eAAe;YACf,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACrC,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,YAAY,CAChB,QAAgB,EAChB,OAA+B;QAE/B,MAAM,IAAI,GAAG,EAAE,GAAG,eAAe,EAAE,GAAG,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;QAE7D,MAAM,SAAS,GAAyD;YACtE,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,eAAe,EAAE,IAAI,CAAC,eAAe;SACtC,CAAC;QACF,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAClC,SAAS,CAAC,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC;QAC/C,CAAC;QAED,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAC/E,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAEjF,MAAM,QAAQ,GAAiB,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAiB,EAAE,CAAC;QAElC,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;YACjE,IAAI,IAAI;gBAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;YACjE,IAAI,IAAI;gBAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,CAAC;QAED,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;IAChC,CAAC;IAED,4BAA4B;IAEpB,KAAK,CAAC,gBAAgB,CAC5B,QAAgB,EAChB,KAAa,EACb,OAAwC,EACxC,OAAoB,EACpB,KAAmB,EACnB,KAAmB;QAEnB,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,OAAO;QAClC,IAAI,KAAK,GAAG,OAAO,CAAC,QAAQ;YAAE,OAAO;QACrC,IAAI,KAAK,CAAC,MAAM,IAAI,OAAO,CAAC,QAAQ;YAAE,OAAO;QAE7C,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAEtB,MAAM,SAAS,GAAyD;YACtE,WAAW,EAAE,OAAO,CAAC,WAAW;YAChC,eAAe,EAAE,OAAO,CAAC,eAAe;SACzC,CAAC;QACF,IAAI,OAAO,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrC,SAAS,CAAC,aAAa,GAAG,OAAO,CAAC,aAAa,CAAC;QAClD,CAAC;QAED,6CAA6C;QAC7C,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAE/E,0CAA0C;QAC1C,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAEjF,8BAA8B;QAC9B,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,QAAQ,EAAE,KAAK,EAAE,aAAa,EAAE,aAAa,CAAC,CAAC;QAClF,IAAI,IAAI,EAAE,CAAC;YACT,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;QAED,0BAA0B;QAC1B,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBACvC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QAED,8BAA8B;QAC9B,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,IAAI,KAAK,CAAC,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;gBACpC,MAAM,IAAI,CAAC,gBAAgB,CACzB,IAAI,CAAC,QAAQ,EACb,KAAK,GAAG,CAAC,EACT,OAAO,EACP,OAAO,EACP,KAAK,EACL,KAAK,CACN,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAEO,KAAK,CAAC,eAAe,CAC3B,QAAgB,EAChB,KAAa,EACb,OAAwC,EACxC,OAAoB,EACpB,KAAmB,EACnB,KAAmB;QAEnB,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,OAAO;QAClC,IAAI,KAAK,GAAG,OAAO,CAAC,QAAQ;YAAE,OAAO;QACrC,IAAI,KAAK,CAAC,MAAM,IAAI,OAAO,CAAC,QAAQ;YAAE,OAAO;QAE7C,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAEtB,MAAM,SAAS,GAAyD;YACtE,WAAW,EAAE,OAAO,CAAC,WAAW;YAChC,eAAe,EAAE,OAAO,CAAC,eAAe;SACzC,CAAC;QACF,IAAI,OAAO,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrC,SAAS,CAAC,aAAa,GAAG,OAAO,CAAC,aAAa,CAAC;QAClD,CAAC;QAED,uCAAuC;QACvC,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAEjF,wCAAwC;QACxC,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAE/E,8BAA8B;QAC9B,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,QAAQ,EAAE,KAAK,EAAE,aAAa,EAAE,aAAa,CAAC,CAAC;QAClF,IAAI,IAAI,EAAE,CAAC;YACT,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;QAED,0BAA0B;QAC1B,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBACvC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QAED,+BAA+B;QAC/B,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,IAAI,KAAK,CAAC,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;gBACpC,MAAM,IAAI,CAAC,eAAe,CACxB,IAAI,CAAC,QAAQ,EACb,KAAK,GAAG,CAAC,EACT,OAAO,EACP,OAAO,EACP,KAAK,EACL,KAAK,CACN,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAEO,KAAK,CAAC,UAAU,CACtB,QAAgB,EAChB,KAAa,EACb,aAA2B,EAC3B,aAA2B;QAE3B,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACvD,IAAI,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC;QAEzB,OAAO;YACL,QAAQ;YACR,UAAU,EAAE,MAAM,CAAC,IAAI;YACvB,OAAO,EAAE,MAAM,CAAC,OAAO;YACvB,KAAK;YACL,aAAa;YACb,aAAa;SACd,CAAC;IACJ,CAAC;IAEO,sBAAsB,CAAC,KAAmB;QAChD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,GAAG,CAAC;QAEnC,oDAAoD;QACpD,2BAA2B;QAC3B,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QAC7C,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC;QAC3C,MAAM,WAAW,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;QAE5E,6CAA6C;QAC7C,OAAO,WAAW,GAAG,GAAG,GAAG,WAAW,GAAG,GAAG,CAAC;IAC/C,CAAC;IAEO,gBAAgB,CAAC,KAAmB;QAC1C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAsB,CAAC;QAE3C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACzC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC;gBAC7C,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACnC,CAAC;CACF"}

package/dist/compression/budget/estimator.d.ts

@@ -0,0 +1,55 @@
+/**
+ * Token Estimator
+ *
+ * Estimates token counts for text and objects.
+ * Uses a simple character-based estimation that works
+ * well for most LLM tokenizers.
+ *
+ * @module compression/budget/estimator
+ */
+import type { CompressionLevel } from '../../types/compressed-memory.js';
+import type { Memory } from '../../types/memory.js';
+/**
+ * Token Estimator
+ *
+ * Provides token count estimation for various content types.
+ * Uses ~4 characters per token as a reasonable approximation.
+ */
+export declare class TokenEstimator {
+    /** Average characters per token */
+    private readonly CHARS_PER_TOKEN;
+    /** Overhead for JSON structure */
+    private readonly JSON_OVERHEAD_FACTOR;
+    /** Overhead for code (more tokens due to symbols) */
+    private readonly CODE_OVERHEAD_FACTOR;
+    /**
+     * Estimate tokens for plain text
+     */
+    estimate(text: string): number;
+    /**
+     * Estimate tokens for an object (JSON serialized)
+     */
+    estimateObject(obj: object): number;
+    /**
+     * Estimate tokens for code
+     */
+    estimateCode(code: string): number;
+    /**
+     * Estimate tokens for a memory at a specific compression level
+     */
+    estimateMemory(memory: Memory, level: CompressionLevel): number;
+    /**
+     * Estimate tokens for an array of strings
+     */
+    estimateArray(items: string[]): number;
+    /**
+     * Get the characters per token ratio
+     */
+    getCharsPerToken(): number;
+    private estimateLevel0;
+    private estimateLevel1;
+    private estimateLevel2;
+    private estimateLevel3;
+    private estimateObjectRecursive;
+}
+//# sourceMappingURL=estimator.d.ts.map

package/dist/compression/budget/estimator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"estimator.d.ts","sourceRoot":"","sources":["../../../src/compression/budget/estimator.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,kCAAkC,CAAC;AACzE,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,uBAAuB,CAAC;AAEpD;;;;;GAKG;AACH,qBAAa,cAAc;IACzB,mCAAmC;IACnC,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAK;IACrC,kCAAkC;IAClC,OAAO,CAAC,QAAQ,CAAC,oBAAoB,CAAO;IAC5C,qDAAqD;IACrD,OAAO,CAAC,QAAQ,CAAC,oBAAoB,CAAO;IAE5C;;OAEG;IACH,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM;IAK9B;;OAEG;IACH,cAAc,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;IAYnC;;OAEG;IACH,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM;IAKlC;;OAEG;IACH,cAAc,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,gBAAgB,GAAG,MAAM;IAe/D;;OAEG;IACH,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM;IAItC;;OAEG;IACH,gBAAgB,IAAI,MAAM;IAM1B,OAAO,CAAC,cAAc;IAStB,OAAO,CAAC,cAAc;IAqBtB,OAAO,CAAC,cAAc;IAqCtB,OAAO,CAAC,cAAc;IAsDtB,OAAO,CAAC,uBAAuB;CAyBhC"}

package/dist/compression/budget/estimator.js

@@ -0,0 +1,204 @@
+/**
+ * Token Estimator
+ *
+ * Estimates token counts for text and objects.
+ * Uses a simple character-based estimation that works
+ * well for most LLM tokenizers.
+ *
+ * @module compression/budget/estimator
+ */
+/**
+ * Token Estimator
+ *
+ * Provides token count estimation for various content types.
+ * Uses ~4 characters per token as a reasonable approximation.
+ */
+export class TokenEstimator {
+    /** Average characters per token */
+    CHARS_PER_TOKEN = 4;
+    /** Overhead for JSON structure */
+    JSON_OVERHEAD_FACTOR = 1.2;
+    /** Overhead for code (more tokens due to symbols) */
+    CODE_OVERHEAD_FACTOR = 1.3;
+    /**
+     * Estimate tokens for plain text
+     */
+    estimate(text) {
+        if (!text)
+            return 0;
+        return Math.ceil(text.length / this.CHARS_PER_TOKEN);
+    }
+    /**
+     * Estimate tokens for an object (JSON serialized)
+     */
+    estimateObject(obj) {
+        if (!obj)
+            return 0;
+        try {
+            const json = JSON.stringify(obj);
+            return Math.ceil((json.length / this.CHARS_PER_TOKEN) * this.JSON_OVERHEAD_FACTOR);
+        }
+        catch {
+            // If serialization fails, estimate based on keys
+            return this.estimateObjectRecursive(obj);
+        }
+    }
+    /**
+     * Estimate tokens for code
+     */
+    estimateCode(code) {
+        if (!code)
+            return 0;
+        return Math.ceil((code.length / this.CHARS_PER_TOKEN) * this.CODE_OVERHEAD_FACTOR);
+    }
+    /**
+     * Estimate tokens for a memory at a specific compression level
+     */
+    estimateMemory(memory, level) {
+        switch (level) {
+            case 0:
+                return this.estimateLevel0(memory);
+            case 1:
+                return this.estimateLevel1(memory);
+            case 2:
+                return this.estimateLevel2(memory);
+            case 3:
+                return this.estimateLevel3(memory);
+            default:
+                return this.estimateLevel0(memory);
+        }
+    }
+    /**
+     * Estimate tokens for an array of strings
+     */
+    estimateArray(items) {
+        return items.reduce((sum, item) => sum + this.estimate(item), 0);
+    }
+    /**
+     * Get the characters per token ratio
+     */
+    getCharsPerToken() {
+        return this.CHARS_PER_TOKEN;
+    }
+    // Private estimation methods for each level
+    estimateLevel0(memory) {
+        // ID (~8 tokens) + type (~2 tokens) + importance (~2 tokens)
+        const idTokens = Math.ceil(memory.id.length / this.CHARS_PER_TOKEN);
+        const typeTokens = Math.ceil(memory.type.length / this.CHARS_PER_TOKEN);
+        const importanceTokens = Math.ceil(memory.importance.length / this.CHARS_PER_TOKEN);
+        return Math.max(5, idTokens + typeTokens + importanceTokens);
+    }
+    estimateLevel1(memory) {
+        const level0 = this.estimateLevel0(memory);
+        // Summary/one-liner
+        const summaryTokens = memory.summary
+            ? this.estimate(memory.summary)
+            : 20; // Default estimate
+        // Tags (max 3)
+        const tags = memory.tags || [];
+        const tagTokens = tags.slice(0, 3).reduce((sum, tag) => sum + this.estimate(tag), 0);
+        // Confidence (~2 tokens)
+        const confidenceTokens = 2;
+        return Math.max(50, level0 + summaryTokens + tagTokens + confidenceTokens);
+    }
+    estimateLevel2(memory) {
+        const level1 = this.estimateLevel1(memory);
+        const m = memory;
+        // Knowledge/content
+        let knowledgeTokens = 50; // Default
+        const knowledgeFields = ['knowledge', 'content', 'rationale', 'description'];
+        for (const field of knowledgeFields) {
+            const value = m[field];
+            if (value && typeof value === 'string') {
+                knowledgeTokens = Math.min(100, this.estimate(value));
+                break;
+            }
+        }
+        // One example
+        let exampleTokens = 0;
+        const examplesArr = m['examples'];
+        if (examplesArr && Array.isArray(examplesArr) && examplesArr.length > 0) {
+            const firstExample = examplesArr[0];
+            if (typeof firstExample === 'string') {
+                exampleTokens = Math.min(75, this.estimateCode(firstExample));
+            }
+            else if (firstExample && typeof firstExample === 'object') {
+                const ex = firstExample;
+                const code = ex['code'];
+                if (code && typeof code === 'string') {
+                    exampleTokens = Math.min(75, this.estimateCode(code));
+                }
+            }
+        }
+        // Evidence (max 2 items)
+        const evidenceTokens = 20; // Estimate for 2 short evidence items
+        return Math.max(200, level1 + knowledgeTokens + exampleTokens + evidenceTokens);
+    }
+    estimateLevel3(memory) {
+        const level2 = this.estimateLevel2(memory);
+        const m = memory;
+        // Full knowledge (no truncation)
+        let fullKnowledgeTokens = 0;
+        const knowledgeFields = ['knowledge', 'content', 'rationale', 'description', 'explanation'];
+        for (const field of knowledgeFields) {
+            const value = m[field];
+            if (value && typeof value === 'string') {
+                fullKnowledgeTokens += this.estimate(value);
+            }
+        }
+        // All examples
+        let allExamplesTokens = 0;
+        const examplesArr = m['examples'];
+        if (examplesArr && Array.isArray(examplesArr)) {
+            for (const ex of examplesArr) {
+                if (typeof ex === 'string') {
+                    allExamplesTokens += this.estimateCode(ex);
+                }
+                else if (ex && typeof ex === 'object') {
+                    const exObj = ex;
+                    const code = exObj['code'];
+                    if (code && typeof code === 'string') {
+                        allExamplesTokens += this.estimateCode(code);
+                    }
+                }
+            }
+        }
+        // Related memories (IDs)
+        let relatedTokens = 0;
+        const relatedMemories = m['relatedMemories'];
+        if (relatedMemories && Array.isArray(relatedMemories)) {
+            relatedTokens = relatedMemories.length * 8; // ~8 tokens per UUID
+        }
+        // Linked entities
+        let linkedTokens = 0;
+        const linkedFields = ['linkedPatterns', 'linkedConstraints', 'linkedFiles', 'linkedFunctions'];
+        for (const field of linkedFields) {
+            const value = m[field];
+            if (value && Array.isArray(value)) {
+                linkedTokens += value.length * 5;
+            }
+        }
+        return Math.max(500, level2 + fullKnowledgeTokens + allExamplesTokens + relatedTokens + linkedTokens);
+    }
+    estimateObjectRecursive(obj, depth = 0) {
+        if (depth > 5)
+            return 10; // Prevent infinite recursion
+        if (obj === null || obj === undefined)
+            return 1;
+        if (typeof obj === 'string')
+            return this.estimate(obj);
+        if (typeof obj === 'number' || typeof obj === 'boolean')
+            return 1;
+        if (Array.isArray(obj)) {
+            return obj.reduce((sum, item) => sum + this.estimateObjectRecursive(item, depth + 1), 2 // Array brackets
+            );
+        }
+        if (typeof obj === 'object') {
+            const entries = Object.entries(obj);
+            return entries.reduce((sum, [key, value]) => sum + this.estimate(key) + this.estimateObjectRecursive(value, depth + 1), 2 // Object braces
+            );
+        }
+        return 1;
+    }
+}
+//# sourceMappingURL=estimator.js.map

package/dist/compression/budget/estimator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"estimator.js","sourceRoot":"","sources":["../../../src/compression/budget/estimator.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAKH;;;;;GAKG;AACH,MAAM,OAAO,cAAc;IACzB,mCAAmC;IAClB,eAAe,GAAG,CAAC,CAAC;IACrC,kCAAkC;IACjB,oBAAoB,GAAG,GAAG,CAAC;IAC5C,qDAAqD;IACpC,oBAAoB,GAAG,GAAG,CAAC;IAE5C;;OAEG;IACH,QAAQ,CAAC,IAAY;QACnB,IAAI,CAAC,IAAI;YAAE,OAAO,CAAC,CAAC;QACpB,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,CAAC;IACvD,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,GAAW;QACxB,IAAI,CAAC,GAAG;YAAE,OAAO,CAAC,CAAC;QAEnB,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YACjC,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC,CAAC;QACrF,CAAC;QAAC,MAAM,CAAC;YACP,iDAAiD;YACjD,OAAO,IAAI,CAAC,uBAAuB,CAAC,GAAG,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,IAAY;QACvB,IAAI,CAAC,IAAI;YAAE,OAAO,CAAC,CAAC;QACpB,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC,CAAC;IACrF,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,MAAc,EAAE,KAAuB;QACpD,QAAQ,KAAK,EAAE,CAAC;YACd,KAAK,CAAC;gBACJ,OAAO,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;YACrC,KAAK,CAAC;gBACJ,OAAO,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;YACrC,KAAK,CAAC;gBACJ,OAAO,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;YACrC,KAAK,CAAC;gBACJ,OAAO,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;YACrC;gBACE,OAAO,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,KAAe;QAC3B,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IACnE,CAAC;IAED;;OAEG;IACH,gBAAgB;QACd,OAAO,IAAI,CAAC,eAAe,CAAC;IAC9B,CAAC;IAED,4CAA4C;IAEpC,cAAc,CAAC,MAAc;QACnC,6DAA6D;QAC7D,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,CAAC;QACpE,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,CAAC;QACxE,MAAM,gBAAgB,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,CAAC;QAEpF,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,UAAU,GAAG,gBAAgB,CAAC,CAAC;IAC/D,CAAC;IAEO,cAAc,CAAC,MAAc;QACnC,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QAE3C,oBAAoB;QACpB,MAAM,aAAa,GAAG,MAAM,CAAC,OAAO;YAClC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC;YAC/B,CAAC,CAAC,EAAE,CAAC,CAAC,mBAAmB;QAE3B,eAAe;QACf,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QAC/B,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CACvC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EACtC,CAAC,CACF,CAAC;QAEF,yBAAyB;QACzB,MAAM,gBAAgB,GAAG,CAAC,CAAC;QAE3B,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,aAAa,GAAG,SAAS,GAAG,gBAAgB,CAAC,CAAC;IAC7E,CAAC;IAEO,cAAc,CAAC,MAAc;QACnC,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QAC3C,MAAM,CAAC,GAAG,MAA4C,CAAC;QAEvD,oBAAoB;QACpB,IAAI,eAAe,GAAG,EAAE,CAAC,CAAC,UAAU;QACpC,MAAM,eAAe,GAAG,CAAC,WAAW,EAAE,SAAS,EAAE,WAAW,EAAE,aAAa,CAAC,CAAC;QAC7E,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;YACpC,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;YACvB,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;gBACvC,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;gBACtD,MAAM;YACR,CAAC;QACH,CAAC;QAED,cAAc;QACd,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,MAAM,WAAW,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;QAClC,IAAI,WAAW,IAAI,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxE,MAAM,YAAY,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;YACpC,IAAI,OAAO,YAAY,KAAK,QAAQ,EAAE,CAAC;gBACrC,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC;YAChE,CAAC;iBAAM,IAAI,YAAY,IAAI,OAAO,YAAY,KAAK,QAAQ,EAAE,CAAC;gBAC5D,MAAM,EAAE,GAAG,YAAuC,CAAC;gBACnD,MAAM,IAAI,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC;gBACxB,IAAI,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;oBACrC,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;gBACxD,CAAC;YACH,CAAC;QACH,CAAC;QAED,yBAAyB;QACzB,MAAM,cAAc,GAAG,EAAE,CAAC,CAAC,sCAAsC;QAEjE,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,eAAe,GAAG,aAAa,GAAG,cAAc,CAAC,CAAC;IAClF,CAAC;IAEO,cAAc,CAAC,MAAc;QACnC,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QAC3C,MAAM,CAAC,GAAG,MAA4C,CAAC;QAEvD,iCAAiC;QACjC,IAAI,mBAAmB,GAAG,CAAC,CAAC;QAC5B,MAAM,eAAe,GAAG,CAAC,WAAW,EAAE,SAAS,EAAE,WAAW,EAAE,aAAa,EAAE,aAAa,CAAC,CAAC;QAC5F,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;YACpC,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;YACvB,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;gBACvC,mBAAmB,IAAI,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC9C,CAAC;QACH,CAAC;QAED,eAAe;QACf,IAAI,iBAAiB,GAAG,CAAC,CAAC;QAC1B,MAAM,WAAW,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;QAClC,IAAI,WAAW,IAAI,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;YAC9C,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;gBAC7B,IAAI,OAAO,EAAE,KAAK,QAAQ,EAAE,CAAC;oBAC3B,iBAAiB,IAAI,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;gBAC7C,CAAC;qBAAM,IAAI,EAAE,IAAI,OAAO,EAAE,KAAK,QAAQ,EAAE,CAAC;oBACxC,MAAM,KAAK,GAAG,EAA6B,CAAC;oBAC5C,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;oBAC3B,IAAI,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;wBACrC,iBAAiB,IAAI,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;oBAC/C,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,yBAAyB;QACzB,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,MAAM,eAAe,GAAG,CAAC,CAAC,iBAAiB,CAAC,CAAC;QAC7C,IAAI,eAAe,IAAI,KAAK,CAAC,OAAO,CAAC,eAAe,CAAC,EAAE,CAAC;YACtD,aAAa,GAAG,eAAe,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,qBAAqB;QACnE,CAAC;QAED,kBAAkB;QAClB,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,MAAM,YAAY,GAAG,CAAC,gBAAgB,EAAE,mBAAmB,EAAE,aAAa,EAAE,iBAAiB,CAAC,CAAC;QAC/F,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;YACjC,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;YACvB,IAAI,KAAK,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBAClC,YAAY,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;YACnC,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CACb,GAAG,EACH,MAAM,GAAG,mBAAmB,GAAG,iBAAiB,GAAG,aAAa,GAAG,YAAY,CAChF,CAAC;IACJ,CAAC;IAEO,uBAAuB,CAAC,GAAY,EAAE,KAAK,GAAG,CAAC;QACrD,IAAI,KAAK,GAAG,CAAC;YAAE,OAAO,EAAE,CAAC,CAAC,6BAA6B;QAEvD,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO,CAAC,CAAC;QAChD,IAAI,OAAO,GAAG,KAAK,QAAQ;YAAE,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QACvD,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,OAAO,GAAG,KAAK,SAAS;YAAE,OAAO,CAAC,CAAC;QAElE,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,OAAO,GAAG,CAAC,MAAM,CACf,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,uBAAuB,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC,EAClE,CAAC,CAAC,iBAAiB;aACpB,CAAC;QACJ,CAAC;QAED,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;YAC5B,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACpC,OAAO,OAAO,CAAC,MAAM,CACnB,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE,CACpB,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,uBAAuB,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,EAC3E,CAAC,CAAC,gBAAgB;aACnB,CAAC;QACJ,CAAC;QAED,OAAO,CAAC,CAAC;IACX,CAAC;CACF"}

package/dist/compression/budget/index.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Budget Submodule
+ *
+ * Exports all budget management components.
+ *
+ * @module compression/budget
+ */
+export { TokenEstimator } from './estimator.js';
+export { GreedyPacker } from './packer.js';
+export type { PackableItem, PackOptions, PackResult } from './packer.js';
+export { TokenBudgetManagerV2 } from './manager-v2.js';
+export type { BudgetOptions, BudgetAllocation } from './manager-v2.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/compression/budget/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/compression/budget/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAChD,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAC3C,YAAY,EAAE,YAAY,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzE,OAAO,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AACvD,YAAY,EAAE,aAAa,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC"}

package/dist/compression/budget/index.js

@@ -0,0 +1,11 @@
+/**
+ * Budget Submodule
+ *
+ * Exports all budget management components.
+ *
+ * @module compression/budget
+ */
+export { TokenEstimator } from './estimator.js';
+export { GreedyPacker } from './packer.js';
+export { TokenBudgetManagerV2 } from './manager-v2.js';
+//# sourceMappingURL=index.js.map

package/dist/compression/budget/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/compression/budget/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAChD,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAE3C,OAAO,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC"}