driftdetect-cortex 0.9.41

package/dist/compression/budget/manager-v2.d.ts

@@ -0,0 +1,98 @@
+/**
+ * Token Budget Manager V2
+ *
+ * Manages token budgets for memory retrieval with
+ * intelligent level escalation and session awareness.
+ *
+ * @module compression/budget/manager-v2
+ */
+import type { CompressionLevel, CompressedMemory, TokenBudget } from '../../types/compressed-memory.js';
+import type { SessionContext } from '../../types/session-context.js';
+import type { Memory } from '../../types/memory.js';
+import { HierarchicalCompressorV2 } from '../compressor/hierarchical.js';
+import { TokenEstimator } from './estimator.js';
+import { GreedyPacker } from './packer.js';
+/**
+ * Scored memory for budget allocation
+ */
+export interface ScoredMemory {
+    /** The memory */
+    memory: Memory;
+    /** Relevance score (0.0 - 1.0) */
+    score: number;
+    /** Whether this memory is new to the session */
+    isNew?: boolean;
+}
+/**
+ * Options for budget fitting
+ */
+export interface BudgetOptions {
+    /** Prefer newer memories */
+    preferNew?: boolean;
+    /** Minimum compression level */
+    minLevel?: CompressionLevel;
+    /** Maximum compression level */
+    maxLevel?: CompressionLevel;
+    /** Session context for deduplication */
+    sessionContext?: SessionContext;
+    /** Reserved tokens for system prompts */
+    reservedTokens?: number;
+    /** Target utilization (0.0 - 1.0) */
+    targetUtilization?: number;
+}
+/**
+ * Budget allocation result
+ */
+export interface BudgetAllocation {
+    /** Compressed memories */
+    memories: CompressedMemory[];
+    /** Total tokens used */
+    tokensUsed: number;
+    /** Tokens remaining */
+    tokensRemaining: number;
+    /** Budget utilization (0.0 - 1.0) */
+    utilization: number;
+    /** Compression level distribution */
+    levelDistribution: Record<CompressionLevel, number>;
+    /** Memories that didn't fit */
+    excluded: string[];
+    /** Tokens saved by deduplication */
+    tokensSavedByDedup: number;
+}
+/**
+ * Token Budget Manager V2
+ *
+ * Fits memories to token budgets with:
+ * - Intelligent level escalation
+ * - Session-aware deduplication
+ * - Priority-based allocation
+ */
+export declare class TokenBudgetManagerV2 {
+    private compressor;
+    private estimator;
+    private packer;
+    constructor(compressor?: HierarchicalCompressorV2, estimator?: TokenEstimator, packer?: GreedyPacker);
+    /**
+     * Fit memories to a token budget
+     */
+    fitToBudget(candidates: ScoredMemory[], budget: number, options?: BudgetOptions): BudgetAllocation;
+    /**
+     * Calculate token budget breakdown
+     */
+    calculateBudget(totalTokens: number, reservedForSystem?: number, reservedForResponse?: number): TokenBudget;
+    /**
+     * Estimate how many memories can fit at each level
+     */
+    estimateCapacity(budget: number): Record<CompressionLevel, number>;
+    /**
+     * Suggest optimal level distribution for a set of memories
+     */
+    suggestLevelDistribution(memories: ScoredMemory[], budget: number): Map<string, CompressionLevel>;
+    private emptyAllocation;
+    private deduplicateWithSession;
+    private adjustScores;
+    private toPackableItems;
+    private compressWithEscalation;
+    private calculateLevelDistribution;
+}
+//# sourceMappingURL=manager-v2.d.ts.map

package/dist/compression/budget/manager-v2.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"manager-v2.d.ts","sourceRoot":"","sources":["../../../src/compression/budget/manager-v2.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EACV,gBAAgB,EAChB,gBAAgB,EAChB,WAAW,EACZ,MAAM,kCAAkC,CAAC;AAC1C,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,gCAAgC,CAAC;AACrE,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,uBAAuB,CAAC;AACpD,OAAO,EAAE,wBAAwB,EAAE,MAAM,+BAA+B,CAAC;AACzE,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAChD,OAAO,EAAE,YAAY,EAAqB,MAAM,aAAa,CAAC;AAE9D;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,iBAAiB;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,kCAAkC;IAClC,KAAK,EAAE,MAAM,CAAC;IACd,gDAAgD;IAChD,KAAK,CAAC,EAAE,OAAO,CAAC;CACjB;AAED;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,4BAA4B;IAC5B,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,gCAAgC;IAChC,QAAQ,CAAC,EAAE,gBAAgB,CAAC;IAC5B,gCAAgC;IAChC,QAAQ,CAAC,EAAE,gBAAgB,CAAC;IAC5B,wCAAwC;IACxC,cAAc,CAAC,EAAE,cAAc,CAAC;IAChC,yCAAyC;IACzC,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,qCAAqC;IACrC,iBAAiB,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,0BAA0B;IAC1B,QAAQ,EAAE,gBAAgB,EAAE,CAAC;IAC7B,wBAAwB;IACxB,UAAU,EAAE,MAAM,CAAC;IACnB,uBAAuB;IACvB,eAAe,EAAE,MAAM,CAAC;IACxB,qCAAqC;IACrC,WAAW,EAAE,MAAM,CAAC;IACpB,qCAAqC;IACrC,iBAAiB,EAAE,MAAM,CAAC,gBAAgB,EAAE,MAAM,CAAC,CAAC;IACpD,+BAA+B;IAC/B,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,oCAAoC;IACpC,kBAAkB,EAAE,MAAM,CAAC;CAC5B;AAED;;;;;;;GAOG;AACH,qBAAa,oBAAoB;IAC/B,OAAO,CAAC,UAAU,CAA2B;IAC7C,OAAO,CAAC,SAAS,CAAiB;IAClC,OAAO,CAAC,MAAM,CAAe;gBAG3B,UAAU,CAAC,EAAE,wBAAwB,EACrC,SAAS,CAAC,EAAE,cAAc,EAC1B,MAAM,CAAC,EAAE,YAAY;IAOvB;;OAEG;IACH,WAAW,CACT,UAAU,EAAE,YAAY,EAAE,EAC1B,MAAM,EAAE,MAAM,EACd,OAAO,GAAE,aAAkB,GAC1B,gBAAgB;IAiEnB;;OAEG;IACH,eAAe,CACb,WAAW,EAAE,MAAM,EACnB,iBAAiB,GAAE,MAAU,EAC7B,mBAAmB,GAAE,MAAU,GAC9B,WAAW;IAad;;OAEG;IACH,gBAAgB,CACd,MAAM,EAAE,MAAM,GACb,MAAM,CAAC,gBAAgB,EAAE,MAAM,CAAC;IASnC;;OAEG;IACH,wBAAwB,CACtB,QAAQ,EAAE,YAAY,EAAE,EACxB,MAAM,EAAE,MAAM,GACb,GAAG,CAAC,MAAM,EAAE,gBAAgB,CAAC;IA6ChC,OAAO,CAAC,eAAe;IAYvB,OAAO,CAAC,sBAAsB;IAmB9B,OAAO,CAAC,YAAY;IAcpB,OAAO,CAAC,eAAe;IAYvB,OAAO,CAAC,sBAAsB;IAoC9B,OAAO,CAAC,0BAA0B;CAWnC"}

package/dist/compression/budget/manager-v2.js

@@ -0,0 +1,211 @@
+/**
+ * Token Budget Manager V2
+ *
+ * Manages token budgets for memory retrieval with
+ * intelligent level escalation and session awareness.
+ *
+ * @module compression/budget/manager-v2
+ */
+import { HierarchicalCompressorV2 } from '../compressor/hierarchical.js';
+import { TokenEstimator } from './estimator.js';
+import { GreedyPacker } from './packer.js';
+/**
+ * Token Budget Manager V2
+ *
+ * Fits memories to token budgets with:
+ * - Intelligent level escalation
+ * - Session-aware deduplication
+ * - Priority-based allocation
+ */
+export class TokenBudgetManagerV2 {
+    compressor;
+    estimator;
+    packer;
+    constructor(compressor, estimator, packer) {
+        this.compressor = compressor || new HierarchicalCompressorV2();
+        this.estimator = estimator || new TokenEstimator();
+        this.packer = packer || new GreedyPacker();
+    }
+    /**
+     * Fit memories to a token budget
+     */
+    fitToBudget(candidates, budget, options = {}) {
+        const { preferNew = true, minLevel = 0, maxLevel = 3, sessionContext, reservedTokens = 0,
+        // targetUtilization is available for future use
+         } = options;
+        const availableBudget = budget - reservedTokens;
+        if (availableBudget <= 0 || candidates.length === 0) {
+            return this.emptyAllocation(budget);
+        }
+        // Filter out already-loaded memories if session context provided
+        let filteredCandidates = candidates;
+        let tokensSavedByDedup = 0;
+        if (sessionContext) {
+            const { filtered, saved } = this.deduplicateWithSession(candidates, sessionContext);
+            filteredCandidates = filtered;
+            tokensSavedByDedup = saved;
+        }
+        // Adjust scores based on preferences
+        const adjusted = this.adjustScores(filteredCandidates, preferNew);
+        // Convert to packable items with estimated tokens
+        const packableItems = this.toPackableItems(adjusted, maxLevel);
+        // Pack items into budget
+        const packResult = this.packer.pack(packableItems, availableBudget, {
+            strategy: 'balanced',
+        });
+        // Compress packed items with level escalation
+        const compressed = this.compressWithEscalation(packResult.packed, adjusted, availableBudget, minLevel, maxLevel);
+        // Calculate level distribution
+        const levelDistribution = this.calculateLevelDistribution(compressed);
+        const tokensUsed = compressed.reduce((sum, c) => sum + c.tokenCount, 0);
+        return {
+            memories: compressed,
+            tokensUsed,
+            tokensRemaining: budget - tokensUsed,
+            utilization: availableBudget > 0 ? tokensUsed / availableBudget : 0,
+            levelDistribution,
+            excluded: packResult.remaining.map(r => r.id),
+            tokensSavedByDedup,
+        };
+    }
+    /**
+     * Calculate token budget breakdown
+     */
+    calculateBudget(totalTokens, reservedForSystem = 0, reservedForResponse = 0) {
+        const reserved = reservedForSystem + reservedForResponse;
+        const availableForMemories = Math.max(0, totalTokens - reserved);
+        return {
+            total: totalTokens,
+            used: 0,
+            remaining: totalTokens,
+            reserved,
+            availableForMemories,
+        };
+    }
+    /**
+     * Estimate how many memories can fit at each level
+     */
+    estimateCapacity(budget) {
+        return {
+            0: Math.floor(budget / 5), // ~5 tokens per level 0
+            1: Math.floor(budget / 50), // ~50 tokens per level 1
+            2: Math.floor(budget / 200), // ~200 tokens per level 2
+            3: Math.floor(budget / 500), // ~500 tokens per level 3
+        };
+    }
+    /**
+     * Suggest optimal level distribution for a set of memories
+     */
+    suggestLevelDistribution(memories, budget) {
+        const distribution = new Map();
+        // Sort by score
+        const sorted = [...memories].sort((a, b) => b.score - a.score);
+        let remainingBudget = budget;
+        for (const { memory, score } of sorted) {
+            // Higher scored memories get higher levels
+            let targetLevel;
+            if (score >= 0.8) {
+                targetLevel = 3;
+            }
+            else if (score >= 0.6) {
+                targetLevel = 2;
+            }
+            else if (score >= 0.4) {
+                targetLevel = 1;
+            }
+            else {
+                targetLevel = 0;
+            }
+            // Check if it fits
+            const tokens = this.compressor.getTokenCount(memory, targetLevel);
+            while (targetLevel > 0 && tokens > remainingBudget) {
+                targetLevel = (targetLevel - 1);
+            }
+            const actualTokens = this.compressor.getTokenCount(memory, targetLevel);
+            if (actualTokens <= remainingBudget) {
+                distribution.set(memory.id, targetLevel);
+                remainingBudget -= actualTokens;
+            }
+            else {
+                // Doesn't fit at any level
+                distribution.set(memory.id, 0);
+            }
+        }
+        return distribution;
+    }
+    // Private helper methods
+    emptyAllocation(budget) {
+        return {
+            memories: [],
+            tokensUsed: 0,
+            tokensRemaining: budget,
+            utilization: 0,
+            levelDistribution: { 0: 0, 1: 0, 2: 0, 3: 0 },
+            excluded: [],
+            tokensSavedByDedup: 0,
+        };
+    }
+    deduplicateWithSession(candidates, sessionContext) {
+        const filtered = [];
+        let saved = 0;
+        for (const candidate of candidates) {
+            if (sessionContext.loadedMemories.has(candidate.memory.id)) {
+                // Already loaded - estimate tokens saved
+                saved += this.estimator.estimateMemory(candidate.memory, 2);
+            }
+            else {
+                filtered.push({ ...candidate, isNew: true });
+            }
+        }
+        return { filtered, saved };
+    }
+    adjustScores(candidates, preferNew) {
+        if (!preferNew) {
+            return candidates;
+        }
+        return candidates.map(c => ({
+            ...c,
+            score: c.isNew ? c.score * 1.1 : c.score, // 10% boost for new memories
+        }));
+    }
+    toPackableItems(candidates, maxLevel) {
+        return candidates.map(c => ({
+            id: c.memory.id,
+            tokens: this.estimator.estimateMemory(c.memory, maxLevel),
+            priority: c.score,
+            metadata: { memory: c.memory },
+        }));
+    }
+    compressWithEscalation(packed, candidates, budget, minLevel, maxLevel) {
+        const compressed = [];
+        let remainingBudget = budget;
+        // Create lookup for memories
+        const memoryMap = new Map();
+        for (const c of candidates) {
+            memoryMap.set(c.memory.id, c.memory);
+        }
+        // Sort packed items by priority (highest first)
+        const sortedPacked = [...packed].sort((a, b) => b.priority - a.priority);
+        for (const item of sortedPacked) {
+            const memory = memoryMap.get(item.id);
+            if (!memory)
+                continue;
+            // Try to compress at highest level that fits
+            const result = this.compressor.compressToFit(memory, remainingBudget, {
+                minLevel,
+                maxLevel,
+            });
+            compressed.push(result);
+            remainingBudget -= result.tokenCount;
+        }
+        return compressed;
+    }
+    calculateLevelDistribution(compressed) {
+        const distribution = { 0: 0, 1: 0, 2: 0, 3: 0 };
+        for (const c of compressed) {
+            distribution[c.level]++;
+        }
+        return distribution;
+    }
+}
+//# sourceMappingURL=manager-v2.js.map

package/dist/compression/budget/manager-v2.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"manager-v2.js","sourceRoot":"","sources":["../../../src/compression/budget/manager-v2.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AASH,OAAO,EAAE,wBAAwB,EAAE,MAAM,+BAA+B,CAAC;AACzE,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAChD,OAAO,EAAE,YAAY,EAAqB,MAAM,aAAa,CAAC;AAoD9D;;;;;;;GAOG;AACH,MAAM,OAAO,oBAAoB;IACvB,UAAU,CAA2B;IACrC,SAAS,CAAiB;IAC1B,MAAM,CAAe;IAE7B,YACE,UAAqC,EACrC,SAA0B,EAC1B,MAAqB;QAErB,IAAI,CAAC,UAAU,GAAG,UAAU,IAAI,IAAI,wBAAwB,EAAE,CAAC;QAC/D,IAAI,CAAC,SAAS,GAAG,SAAS,IAAI,IAAI,cAAc,EAAE,CAAC;QACnD,IAAI,CAAC,MAAM,GAAG,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;IAC7C,CAAC;IAED;;OAEG;IACH,WAAW,CACT,UAA0B,EAC1B,MAAc,EACd,UAAyB,EAAE;QAE3B,MAAM,EACJ,SAAS,GAAG,IAAI,EAChB,QAAQ,GAAG,CAAC,EACZ,QAAQ,GAAG,CAAC,EACZ,cAAc,EACd,cAAc,GAAG,CAAC;QAClB,gDAAgD;UACjD,GAAG,OAAO,CAAC;QAEZ,MAAM,eAAe,GAAG,MAAM,GAAG,cAAc,CAAC;QAEhD,IAAI,eAAe,IAAI,CAAC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACpD,OAAO,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QACtC,CAAC;QAED,iEAAiE;QACjE,IAAI,kBAAkB,GAAG,UAAU,CAAC;QACpC,IAAI,kBAAkB,GAAG,CAAC,CAAC;QAE3B,IAAI,cAAc,EAAE,CAAC;YACnB,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,sBAAsB,CACrD,UAAU,EACV,cAAc,CACf,CAAC;YACF,kBAAkB,GAAG,QAAQ,CAAC;YAC9B,kBAAkB,GAAG,KAAK,CAAC;QAC7B,CAAC;QAED,qCAAqC;QACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,kBAAkB,EAAE,SAAS,CAAC,CAAC;QAElE,kDAAkD;QAClD,MAAM,aAAa,GAAG,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAE/D,yBAAyB;QACzB,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,EAAE,eAAe,EAAE;YAClE,QAAQ,EAAE,UAAU;SACrB,CAAC,CAAC;QAEH,8CAA8C;QAC9C,MAAM,UAAU,GAAG,IAAI,CAAC,sBAAsB,CAC5C,UAAU,CAAC,MAAM,EACjB,QAAQ,EACR,eAAe,EACf,QAAQ,EACR,QAAQ,CACT,CAAC;QAEF,+BAA+B;QAC/B,MAAM,iBAAiB,GAAG,IAAI,CAAC,0BAA0B,CAAC,UAAU,CAAC,CAAC;QAEtE,MAAM,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;QAExE,OAAO;YACL,QAAQ,EAAE,UAAU;YACpB,UAAU;YACV,eAAe,EAAE,MAAM,GAAG,UAAU;YACpC,WAAW,EAAE,eAAe,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;YACnE,iBAAiB;YACjB,QAAQ,EAAE,UAAU,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC7C,kBAAkB;SACnB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,eAAe,CACb,WAAmB,EACnB,oBAA4B,CAAC,EAC7B,sBAA8B,CAAC;QAE/B,MAAM,QAAQ,GAAG,iBAAiB,GAAG,mBAAmB,CAAC;QACzD,MAAM,oBAAoB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,GAAG,QAAQ,CAAC,CAAC;QAEjE,OAAO;YACL,KAAK,EAAE,WAAW;YAClB,IAAI,EAAE,CAAC;YACP,SAAS,EAAE,WAAW;YACtB,QAAQ;YACR,oBAAoB;SACrB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,gBAAgB,CACd,MAAc;QAEd,OAAO;YACL,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAI,wBAAwB;YACrD,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,EAAE,CAAC,EAAG,yBAAyB;YACtD,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,GAAG,CAAC,EAAE,0BAA0B;YACvD,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,GAAG,CAAC,EAAE,0BAA0B;SACxD,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,wBAAwB,CACtB,QAAwB,EACxB,MAAc;QAEd,MAAM,YAAY,GAAG,IAAI,GAAG,EAA4B,CAAC;QAEzD,gBAAgB;QAChB,MAAM,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAE/D,IAAI,eAAe,GAAG,MAAM,CAAC;QAE7B,KAAK,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,MAAM,EAAE,CAAC;YACvC,2CAA2C;YAC3C,IAAI,WAA6B,CAAC;YAElC,IAAI,KAAK,IAAI,GAAG,EAAE,CAAC;gBACjB,WAAW,GAAG,CAAC,CAAC;YAClB,CAAC;iBAAM,IAAI,KAAK,IAAI,GAAG,EAAE,CAAC;gBACxB,WAAW,GAAG,CAAC,CAAC;YAClB,CAAC;iBAAM,IAAI,KAAK,IAAI,GAAG,EAAE,CAAC;gBACxB,WAAW,GAAG,CAAC,CAAC;YAClB,CAAC;iBAAM,CAAC;gBACN,WAAW,GAAG,CAAC,CAAC;YAClB,CAAC;YAED,mBAAmB;YACnB,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,aAAa,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;YAElE,OAAO,WAAW,GAAG,CAAC,IAAI,MAAM,GAAG,eAAe,EAAE,CAAC;gBACnD,WAAW,GAAG,CAAC,WAAW,GAAG,CAAC,CAAqB,CAAC;YACtD,CAAC;YAED,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,aAAa,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;YAExE,IAAI,YAAY,IAAI,eAAe,EAAE,CAAC;gBACpC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC;gBACzC,eAAe,IAAI,YAAY,CAAC;YAClC,CAAC;iBAAM,CAAC;gBACN,2BAA2B;gBAC3B,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QAED,OAAO,YAAY,CAAC;IACtB,CAAC;IAED,yBAAyB;IAEjB,eAAe,CAAC,MAAc;QACpC,OAAO;YACL,QAAQ,EAAE,EAAE;YACZ,UAAU,EAAE,CAAC;YACb,eAAe,EAAE,MAAM;YACvB,WAAW,EAAE,CAAC;YACd,iBAAiB,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;YAC7C,QAAQ,EAAE,EAAE;YACZ,kBAAkB,EAAE,CAAC;SACtB,CAAC;IACJ,CAAC;IAEO,sBAAsB,CAC5B,UAA0B,EAC1B,cAA8B;QAE9B,MAAM,QAAQ,GAAmB,EAAE,CAAC;QACpC,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,IAAI,cAAc,CAAC,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC3D,yCAAyC;gBACzC,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAC9D,CAAC;iBAAM,CAAC;gBACN,QAAQ,CAAC,IAAI,CAAC,EAAE,GAAG,SAAS,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;QAED,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;IAC7B,CAAC;IAEO,YAAY,CAClB,UAA0B,EAC1B,SAAkB;QAElB,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,OAAO,UAAU,CAAC;QACpB,CAAC;QAED,OAAO,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC1B,GAAG,CAAC;YACJ,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,6BAA6B;SACxE,CAAC,CAAC,CAAC;IACN,CAAC;IAEO,eAAe,CACrB,UAA0B,EAC1B,QAA0B;QAE1B,OAAO,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC1B,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE;YACf,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC;YACzD,QAAQ,EAAE,CAAC,CAAC,KAAK;YACjB,QAAQ,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE;SAC/B,CAAC,CAAC,CAAC;IACN,CAAC;IAEO,sBAAsB,CAC5B,MAAsB,EACtB,UAA0B,EAC1B,MAAc,EACd,QAA0B,EAC1B,QAA0B;QAE1B,MAAM,UAAU,GAAuB,EAAE,CAAC;QAC1C,IAAI,eAAe,GAAG,MAAM,CAAC;QAE7B,6BAA6B;QAC7B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;QACvC,CAAC;QAED,gDAAgD;QAChD,MAAM,YAAY,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;QAEzE,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACtC,IAAI,CAAC,MAAM;gBAAE,SAAS;YAEtB,6CAA6C;YAC7C,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,aAAa,CAAC,MAAM,EAAE,eAAe,EAAE;gBACpE,QAAQ;gBACR,QAAQ;aACT,CAAC,CAAC;YAEH,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACxB,eAAe,IAAI,MAAM,CAAC,UAAU,CAAC;QACvC,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAEO,0BAA0B,CAChC,UAA8B;QAE9B,MAAM,YAAY,GAAqC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;QAElF,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1B,CAAC;QAED,OAAO,YAAY,CAAC;IACtB,CAAC;CACF"}

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

@@ -0,0 +1,88 @@
+/**
+ * Greedy Packer
+ *
+ * Packs items into a budget using a greedy algorithm.
+ * Prioritizes items by score while respecting token limits.
+ *
+ * @module compression/budget/packer
+ */
+/**
+ * An item that can be packed
+ */
+export interface PackableItem {
+    /** Unique identifier */
+    id: string;
+    /** Token count for this item */
+    tokens: number;
+    /** Priority score (higher = more important) */
+    priority: number;
+    /** Optional metadata */
+    metadata?: Record<string, unknown>;
+}
+/**
+ * Options for packing
+ */
+export interface PackOptions {
+    /** Minimum tokens to reserve */
+    reserveTokens?: number;
+    /** Maximum items to pack */
+    maxItems?: number;
+    /** Minimum priority to include */
+    minPriority?: number;
+    /** Whether to allow partial fills */
+    allowPartial?: boolean;
+    /** Strategy for packing */
+    strategy?: 'greedy' | 'balanced';
+}
+/**
+ * Result of packing operation
+ */
+export interface PackResult {
+    /** Items that were packed */
+    packed: PackableItem[];
+    /** Items that didn't fit */
+    remaining: PackableItem[];
+    /** Total tokens used */
+    tokensUsed: number;
+    /** Tokens remaining in budget */
+    tokensRemaining: number;
+    /** Whether budget was fully utilized */
+    fullyUtilized: boolean;
+    /** Packing efficiency (0.0 - 1.0) */
+    efficiency: number;
+}
+/**
+ * Greedy Packer
+ *
+ * Implements a greedy bin-packing algorithm that:
+ * 1. Sorts items by priority (descending)
+ * 2. Adds items until budget is exhausted
+ * 3. Optionally tries to fill gaps with smaller items
+ */
+export declare class GreedyPacker {
+    /**
+     * Pack items into a budget
+     */
+    pack(items: PackableItem[], budget: number, options?: PackOptions): PackResult;
+    /**
+     * Pack with a specific token allocation per item
+     */
+    packWithAllocation(items: PackableItem[], budget: number, tokensPerItem: number): PackResult;
+    /**
+     * Estimate how many items can fit
+     */
+    estimateCapacity(items: PackableItem[], budget: number): {
+        count: number;
+        tokens: number;
+    };
+    /**
+     * Find optimal budget distribution for multiple categories
+     */
+    distributeBudget(categories: {
+        name: string;
+        items: PackableItem[];
+        weight: number;
+    }[], totalBudget: number): Map<string, number>;
+    private packBalanced;
+}
+//# sourceMappingURL=packer.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"packer.d.ts","sourceRoot":"","sources":["../../../src/compression/budget/packer.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,wBAAwB;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,gCAAgC;IAChC,MAAM,EAAE,MAAM,CAAC;IACf,+CAA+C;IAC/C,QAAQ,EAAE,MAAM,CAAC;IACjB,wBAAwB;IACxB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACpC;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,gCAAgC;IAChC,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,4BAA4B;IAC5B,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,kCAAkC;IAClC,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,qCAAqC;IACrC,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,2BAA2B;IAC3B,QAAQ,CAAC,EAAE,QAAQ,GAAG,UAAU,CAAC;CAClC;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB,6BAA6B;IAC7B,MAAM,EAAE,YAAY,EAAE,CAAC;IACvB,4BAA4B;IAC5B,SAAS,EAAE,YAAY,EAAE,CAAC;IAC1B,wBAAwB;IACxB,UAAU,EAAE,MAAM,CAAC;IACnB,iCAAiC;IACjC,eAAe,EAAE,MAAM,CAAC;IACxB,wCAAwC;IACxC,aAAa,EAAE,OAAO,CAAC;IACvB,qCAAqC;IACrC,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;;;;;;GAOG;AACH,qBAAa,YAAY;IACvB;;OAEG;IACH,IAAI,CACF,KAAK,EAAE,YAAY,EAAE,EACrB,MAAM,EAAE,MAAM,EACd,OAAO,GAAE,WAAgB,GACxB,UAAU;IA0Eb;;OAEG;IACH,kBAAkB,CAChB,KAAK,EAAE,YAAY,EAAE,EACrB,MAAM,EAAE,MAAM,EACd,aAAa,EAAE,MAAM,GACpB,UAAU;IAKb;;OAEG;IACH,gBAAgB,CACd,KAAK,EAAE,YAAY,EAAE,EACrB,MAAM,EAAE,MAAM,GACb;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE;IAgBpC;;OAEG;IACH,gBAAgB,CACd,UAAU,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,YAAY,EAAE,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,EAAE,EACrE,WAAW,EAAE,MAAM,GAClB,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;IActB,OAAO,CAAC,YAAY;CA+CrB"}

package/dist/compression/budget/packer.js

@@ -0,0 +1,153 @@
+/**
+ * Greedy Packer
+ *
+ * Packs items into a budget using a greedy algorithm.
+ * Prioritizes items by score while respecting token limits.
+ *
+ * @module compression/budget/packer
+ */
+/**
+ * Greedy Packer
+ *
+ * Implements a greedy bin-packing algorithm that:
+ * 1. Sorts items by priority (descending)
+ * 2. Adds items until budget is exhausted
+ * 3. Optionally tries to fill gaps with smaller items
+ */
+export class GreedyPacker {
+    /**
+     * Pack items into a budget
+     */
+    pack(items, budget, options = {}) {
+        const { reserveTokens = 0, maxItems = Infinity, minPriority = 0, allowPartial = true, strategy = 'greedy', } = options;
+        const availableBudget = budget - reserveTokens;
+        if (availableBudget <= 0) {
+            return {
+                packed: [],
+                remaining: [...items],
+                tokensUsed: 0,
+                tokensRemaining: budget,
+                fullyUtilized: false,
+                efficiency: 0,
+            };
+        }
+        // Filter by minimum priority
+        const eligible = items.filter(item => item.priority >= minPriority);
+        // Sort by priority (descending)
+        const sorted = [...eligible].sort((a, b) => b.priority - a.priority);
+        const packed = [];
+        const remaining = [];
+        let tokensUsed = 0;
+        if (strategy === 'greedy') {
+            // Simple greedy: take highest priority items that fit
+            for (const item of sorted) {
+                if (packed.length >= maxItems) {
+                    remaining.push(item);
+                    continue;
+                }
+                if (tokensUsed + item.tokens <= availableBudget) {
+                    packed.push(item);
+                    tokensUsed += item.tokens;
+                }
+                else if (allowPartial) {
+                    remaining.push(item);
+                }
+                else {
+                    remaining.push(item);
+                }
+            }
+        }
+        else {
+            // Balanced: try to maximize utilization
+            this.packBalanced(sorted, availableBudget, maxItems, packed, remaining);
+            tokensUsed = packed.reduce((sum, item) => sum + item.tokens, 0);
+        }
+        // Add items that weren't eligible
+        for (const item of items) {
+            if (!eligible.includes(item)) {
+                remaining.push(item);
+            }
+        }
+        const efficiency = availableBudget > 0 ? tokensUsed / availableBudget : 0;
+        return {
+            packed,
+            remaining,
+            tokensUsed,
+            tokensRemaining: budget - tokensUsed,
+            fullyUtilized: tokensUsed >= availableBudget * 0.9,
+            efficiency: Math.min(1, efficiency),
+        };
+    }
+    /**
+     * Pack with a specific token allocation per item
+     */
+    packWithAllocation(items, budget, tokensPerItem) {
+        const maxItems = Math.floor(budget / tokensPerItem);
+        return this.pack(items, budget, { maxItems });
+    }
+    /**
+     * Estimate how many items can fit
+     */
+    estimateCapacity(items, budget) {
+        const sorted = [...items].sort((a, b) => b.priority - a.priority);
+        let count = 0;
+        let tokens = 0;
+        for (const item of sorted) {
+            if (tokens + item.tokens <= budget) {
+                count++;
+                tokens += item.tokens;
+            }
+        }
+        return { count, tokens };
+    }
+    /**
+     * Find optimal budget distribution for multiple categories
+     */
+    distributeBudget(categories, totalBudget) {
+        const totalWeight = categories.reduce((sum, c) => sum + c.weight, 0);
+        const distribution = new Map();
+        for (const category of categories) {
+            const share = (category.weight / totalWeight) * totalBudget;
+            distribution.set(category.name, Math.floor(share));
+        }
+        return distribution;
+    }
+    // Private helper methods
+    packBalanced(sorted, budget, maxItems, packed, remaining) {
+        // First pass: add high-priority items
+        let tokensUsed = 0;
+        const skipped = [];
+        for (const item of sorted) {
+            if (packed.length >= maxItems) {
+                remaining.push(item);
+                continue;
+            }
+            if (tokensUsed + item.tokens <= budget) {
+                packed.push(item);
+                tokensUsed += item.tokens;
+            }
+            else {
+                skipped.push(item);
+            }
+        }
+        // Second pass: try to fill gaps with smaller skipped items
+        const remainingBudget = budget - tokensUsed;
+        const smallEnough = skipped
+            .filter(item => item.tokens <= remainingBudget)
+            .sort((a, b) => b.priority - a.priority);
+        for (const item of smallEnough) {
+            if (packed.length >= maxItems) {
+                remaining.push(item);
+                continue;
+            }
+            if (tokensUsed + item.tokens <= budget) {
+                packed.push(item);
+                tokensUsed += item.tokens;
+                skipped.splice(skipped.indexOf(item), 1);
+            }
+        }
+        // Add remaining skipped items
+        remaining.push(...skipped);
+    }
+}
+//# sourceMappingURL=packer.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"packer.js","sourceRoot":"","sources":["../../../src/compression/budget/packer.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAkDH;;;;;;;GAOG;AACH,MAAM,OAAO,YAAY;IACvB;;OAEG;IACH,IAAI,CACF,KAAqB,EACrB,MAAc,EACd,UAAuB,EAAE;QAEzB,MAAM,EACJ,aAAa,GAAG,CAAC,EACjB,QAAQ,GAAG,QAAQ,EACnB,WAAW,GAAG,CAAC,EACf,YAAY,GAAG,IAAI,EACnB,QAAQ,GAAG,QAAQ,GACpB,GAAG,OAAO,CAAC;QAEZ,MAAM,eAAe,GAAG,MAAM,GAAG,aAAa,CAAC;QAE/C,IAAI,eAAe,IAAI,CAAC,EAAE,CAAC;YACzB,OAAO;gBACL,MAAM,EAAE,EAAE;gBACV,SAAS,EAAE,CAAC,GAAG,KAAK,CAAC;gBACrB,UAAU,EAAE,CAAC;gBACb,eAAe,EAAE,MAAM;gBACvB,aAAa,EAAE,KAAK;gBACpB,UAAU,EAAE,CAAC;aACd,CAAC;QACJ,CAAC;QAED,6BAA6B;QAC7B,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,IAAI,WAAW,CAAC,CAAC;QAEpE,gCAAgC;QAChC,MAAM,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;QAErE,MAAM,MAAM,GAAmB,EAAE,CAAC;QAClC,MAAM,SAAS,GAAmB,EAAE,CAAC;QACrC,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;YAC1B,sDAAsD;YACtD,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;gBAC1B,IAAI,MAAM,CAAC,MAAM,IAAI,QAAQ,EAAE,CAAC;oBAC9B,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACrB,SAAS;gBACX,CAAC;gBAED,IAAI,UAAU,GAAG,IAAI,CAAC,MAAM,IAAI,eAAe,EAAE,CAAC;oBAChD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAClB,UAAU,IAAI,IAAI,CAAC,MAAM,CAAC;gBAC5B,CAAC;qBAAM,IAAI,YAAY,EAAE,CAAC;oBACxB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACvB,CAAC;qBAAM,CAAC;oBACN,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;aAAM,CAAC;YACN,wCAAwC;YACxC,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,eAAe,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;YACxE,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAClE,CAAC;QAED,kCAAkC;QAClC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC7B,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QAED,MAAM,UAAU,GAAG,eAAe,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;QAE1E,OAAO;YACL,MAAM;YACN,SAAS;YACT,UAAU;YACV,eAAe,EAAE,MAAM,GAAG,UAAU;YACpC,aAAa,EAAE,UAAU,IAAI,eAAe,GAAG,GAAG;YAClD,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC;SACpC,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,kBAAkB,CAChB,KAAqB,EACrB,MAAc,EACd,aAAqB;QAErB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,aAAa,CAAC,CAAC;QACpD,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC;IAChD,CAAC;IAED;;OAEG;IACH,gBAAgB,CACd,KAAqB,EACrB,MAAc;QAEd,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;QAElE,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;YAC1B,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,MAAM,EAAE,CAAC;gBACnC,KAAK,EAAE,CAAC;gBACR,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC;YACxB,CAAC;QACH,CAAC;QAED,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,gBAAgB,CACd,UAAqE,EACrE,WAAmB;QAEnB,MAAM,WAAW,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACrE,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE/C,KAAK,MAAM,QAAQ,IAAI,UAAU,EAAE,CAAC;YAClC,MAAM,KAAK,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,WAAW,CAAC,GAAG,WAAW,CAAC;YAC5D,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QACrD,CAAC;QAED,OAAO,YAAY,CAAC;IACtB,CAAC;IAED,yBAAyB;IAEjB,YAAY,CAClB,MAAsB,EACtB,MAAc,EACd,QAAgB,EAChB,MAAsB,EACtB,SAAyB;QAEzB,sCAAsC;QACtC,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,MAAM,OAAO,GAAmB,EAAE,CAAC;QAEnC,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;YAC1B,IAAI,MAAM,CAAC,MAAM,IAAI,QAAQ,EAAE,CAAC;gBAC9B,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACrB,SAAS;YACX,CAAC;YAED,IAAI,UAAU,GAAG,IAAI,CAAC,MAAM,IAAI,MAAM,EAAE,CAAC;gBACvC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAClB,UAAU,IAAI,IAAI,CAAC,MAAM,CAAC;YAC5B,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QAED,2DAA2D;QAC3D,MAAM,eAAe,GAAG,MAAM,GAAG,UAAU,CAAC;QAC5C,MAAM,WAAW,GAAG,OAAO;aACxB,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,IAAI,eAAe,CAAC;aAC9C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;QAE3C,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;YAC/B,IAAI,MAAM,CAAC,MAAM,IAAI,QAAQ,EAAE,CAAC;gBAC9B,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACrB,SAAS;YACX,CAAC;YAED,IAAI,UAAU,GAAG,IAAI,CAAC,MAAM,IAAI,MAAM,EAAE,CAAC;gBACvC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAClB,UAAU,IAAI,IAAI,CAAC,MAAM,CAAC;gBAC1B,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;QAED,8BAA8B;QAC9B,SAAS,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC;IAC7B,CAAC;CACF"}

package/dist/compression/compressor/hierarchical.d.ts

@@ -0,0 +1,76 @@
+/**
+ * Hierarchical Compressor V2
+ *
+ * Orchestrates the 4-level compression system.
+ * Provides intelligent level selection based on token budgets.
+ *
+ * @module compression/compressor/hierarchical
+ */
+import type { CompressionLevel, CompressedMemory } from '../../types/compressed-memory.js';
+import type { Memory } from '../../types/memory.js';
+import { Level0Compressor } from './level-0.js';
+import { Level1Compressor } from './level-1.js';
+import { Level2Compressor } from './level-2.js';
+import { Level3Compressor } from './level-3.js';
+/**
+ * Options for compression
+ */
+export interface HierarchicalCompressionOptions {
+    /** Minimum compression level */
+    minLevel?: CompressionLevel;
+    /** Maximum compression level */
+    maxLevel?: CompressionLevel;
+    /** Whether to allow level escalation to fit budget */
+    allowEscalation?: boolean;
+}
+/**
+ * Hierarchical Compressor V2
+ *
+ * Coordinates 4 level compressors to provide flexible
+ * compression based on token budgets and requirements.
+ */
+export declare class HierarchicalCompressorV2 {
+    private level0;
+    private level1;
+    private level2;
+    private level3;
+    constructor(level0?: Level0Compressor, level1?: Level1Compressor, level2?: Level2Compressor, level3?: Level3Compressor);
+    /**
+     * Compress a memory to a specific level
+     */
+    compress(memory: Memory, level: CompressionLevel): CompressedMemory;
+    /**
+     * Compress a memory to fit within a token budget
+     *
+     * Starts at the highest level and decreases until it fits.
+     */
+    compressToFit(memory: Memory, maxTokens: number, options?: HierarchicalCompressionOptions): CompressedMemory;
+    /**
+     * Compress multiple memories to fit within a total budget
+     *
+     * Uses a greedy approach, prioritizing higher importance memories.
+     */
+    compressBatchToFit(memories: Memory[], totalBudget: number, options?: HierarchicalCompressionOptions): CompressedMemory[];
+    /**
+     * Get token count for a memory at a specific level
+     */
+    getTokenCount(memory: Memory, level: CompressionLevel): number;
+    /**
+     * Get token counts for all levels
+     */
+    getTokenCountsAllLevels(memory: Memory): Record<CompressionLevel, number>;
+    /**
+     * Suggest optimal level for a given budget
+     */
+    suggestLevel(memory: Memory, budget: number): CompressionLevel;
+    /**
+     * Format compressed memory as string
+     */
+    format(compressed: CompressedMemory): string;
+    /**
+     * Get target tokens for a level
+     */
+    getTargetTokens(level: CompressionLevel): number;
+    private compressToLevel;
+}
+//# sourceMappingURL=hierarchical.d.ts.map

package/dist/compression/compressor/hierarchical.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hierarchical.d.ts","sourceRoot":"","sources":["../../../src/compression/compressor/hierarchical.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EACV,gBAAgB,EAChB,gBAAgB,EAKjB,MAAM,kCAAkC,CAAC;AAC1C,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,uBAAuB,CAAC;AACpD,OAAO,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAChD,OAAO,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAChD,OAAO,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAChD,OAAO,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAEhD;;GAEG;AACH,MAAM,WAAW,8BAA8B;IAC7C,gCAAgC;IAChC,QAAQ,CAAC,EAAE,gBAAgB,CAAC;IAC5B,gCAAgC;IAChC,QAAQ,CAAC,EAAE,gBAAgB,CAAC;IAC5B,sDAAsD;IACtD,eAAe,CAAC,EAAE,OAAO,CAAC;CAC3B;AAED;;;;;GAKG;AACH,qBAAa,wBAAwB;IACnC,OAAO,CAAC,MAAM,CAAmB;IACjC,OAAO,CAAC,MAAM,CAAmB;IACjC,OAAO,CAAC,MAAM,CAAmB;IACjC,OAAO,CAAC,MAAM,CAAmB;gBAG/B,MAAM,CAAC,EAAE,gBAAgB,EACzB,MAAM,CAAC,EAAE,gBAAgB,EACzB,MAAM,CAAC,EAAE,gBAAgB,EACzB,MAAM,CAAC,EAAE,gBAAgB;IAQ3B;;OAEG;IACH,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,gBAAgB,GAAG,gBAAgB;IAenE;;;;OAIG;IACH,aAAa,CACX,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,EACjB,OAAO,GAAE,8BAAmC,GAC3C,gBAAgB;IAqCnB;;;;OAIG;IACH,kBAAkB,CAChB,QAAQ,EAAE,MAAM,EAAE,EAClB,WAAW,EAAE,MAAM,EACnB,OAAO,GAAE,8BAAmC,GAC3C,gBAAgB,EAAE;IAuBrB;;OAEG;IACH,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,gBAAgB,GAAG,MAAM;IAK9D;;OAEG;IACH,uBAAuB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,gBAAgB,EAAE,MAAM,CAAC;IASzE;;OAEG;IACH,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,gBAAgB;IAU9D;;OAEG;IACH,MAAM,CAAC,UAAU,EAAE,gBAAgB,GAAG,MAAM;IAe5C;;OAEG;IACH,eAAe,CAAC,KAAK,EAAE,gBAAgB,GAAG,MAAM;IAiBhD,OAAO,CAAC,eAAe;CAiBxB"}