@gguf/coder 0.0.1

package/dist/utils/atomic-deletion.spec.js

@@ -0,0 +1,154 @@
+import test from 'ava';
+import { PlaceholderType } from '../types/hooks.js';
+import { findPlaceholderAtPosition, handleAtomicDeletion, wouldPartiallyDeletePlaceholder, } from './atomic-deletion.js';
+console.log(`\natomic-deletion.spec.ts`);
+// Tests for atomic placeholder deletion
+test('handleAtomicDeletion removes placeholder when backspaced', t => {
+    const previousState = {
+        displayValue: 'Analyze this: [Paste #123: 500 chars] code',
+        placeholderContent: {
+            '123': {
+                type: PlaceholderType.PASTE,
+                displayText: '[Paste #123: 500 chars]',
+                content: 'console.log("hello world");',
+                originalSize: 500,
+            },
+        },
+    };
+    // Simulate backspacing from the end of the placeholder
+    const newText = 'Analyze this: [Paste #123: 500 char code';
+    const result = handleAtomicDeletion(previousState, newText);
+    t.truthy(result);
+    t.is(result.displayValue, 'Analyze this:  code');
+    t.deepEqual(result.placeholderContent, {});
+});
+test('handleAtomicDeletion removes placeholder when deleted from middle', t => {
+    const previousState = {
+        displayValue: 'Before [Paste #456: 200 chars] after',
+        placeholderContent: {
+            '456': {
+                type: PlaceholderType.PASTE,
+                displayText: '[Paste #456: 200 chars]',
+                content: 'function test() { return true; }',
+                originalSize: 200,
+            },
+        },
+    };
+    // Simulate deleting part of the placeholder
+    const newText = 'Before [Paste #456: 200 ch after';
+    const result = handleAtomicDeletion(previousState, newText);
+    t.truthy(result);
+    t.is(result.displayValue, 'Before  after');
+    t.deepEqual(result.placeholderContent, {});
+});
+test('handleAtomicDeletion preserves other placeholders', t => {
+    const previousState = {
+        displayValue: 'First [Paste #111: 100 chars] second [Paste #222: 200 chars]',
+        placeholderContent: {
+            '111': {
+                type: PlaceholderType.PASTE,
+                displayText: '[Paste #111: 100 chars]',
+                content: 'first content',
+                originalSize: 100,
+            },
+            '222': {
+                type: PlaceholderType.PASTE,
+                displayText: '[Paste #222: 200 chars]',
+                content: 'second content',
+                originalSize: 200,
+            },
+        },
+    };
+    // Delete part of first placeholder
+    const newText = 'First [Paste #111: 100 ch second [Paste #222: 200 chars]';
+    const result = handleAtomicDeletion(previousState, newText);
+    t.truthy(result);
+    t.is(result.displayValue, 'First  second [Paste #222: 200 chars]');
+    t.deepEqual(result.placeholderContent, {
+        '222': {
+            type: PlaceholderType.PASTE,
+            displayText: '[Paste #222: 200 chars]',
+            content: 'second content',
+            originalSize: 200,
+        },
+    });
+});
+test('handleAtomicDeletion returns null for normal deletions', t => {
+    const previousState = {
+        displayValue: 'Normal text here',
+        placeholderContent: {},
+    };
+    const newText = 'Normal text her';
+    const result = handleAtomicDeletion(previousState, newText);
+    t.is(result, null);
+});
+test('handleAtomicDeletion returns null for additions', t => {
+    const previousState = {
+        displayValue: 'Short text',
+        placeholderContent: {},
+    };
+    const newText = 'Short text with more';
+    const result = handleAtomicDeletion(previousState, newText);
+    t.is(result, null);
+});
+test('findPlaceholderAtPosition finds placeholder ID', t => {
+    const text = 'Before [Paste #789: 300 chars] after';
+    // Position inside the placeholder
+    const result1 = findPlaceholderAtPosition(text, 10); // Inside "[Paste #789: 300 chars]"
+    t.is(result1, '789');
+    // Position outside the placeholder
+    const result2 = findPlaceholderAtPosition(text, 0); // In "Before"
+    t.is(result2, null);
+    // Position after placeholder
+    const result3 = findPlaceholderAtPosition(text, 35); // In "after"
+    t.is(result3, null);
+});
+test('wouldPartiallyDeletePlaceholder detects partial deletion', t => {
+    const text = 'Text [Paste #123: 100 chars] more';
+    //       01234567890123456789012345678901234
+    //       0         1         2         3
+    // Placeholder is at position 5-28 (length 23)
+    // Partial deletion from middle of placeholder
+    const result1 = wouldPartiallyDeletePlaceholder(text, 8, 5); // Delete "Paste"
+    t.true(result1);
+    // Complete deletion of placeholder - delete from position 5, length 23
+    const result2 = wouldPartiallyDeletePlaceholder(text, 5, 23); // Delete entire "[Paste #123: 100 chars]"
+    t.false(result2);
+    // Deletion outside placeholder
+    const result3 = wouldPartiallyDeletePlaceholder(text, 0, 4); // Delete "Text"
+    t.false(result3);
+});
+// Integration test showing complete flow
+test('atomic deletion works with multiple placeholders', t => {
+    const previousState = {
+        displayValue: 'Compare [Paste #111: 50 chars] with [Paste #222: 100 chars] output',
+        placeholderContent: {
+            '111': {
+                type: PlaceholderType.PASTE,
+                displayText: '[Paste #111: 50 chars]',
+                content: 'first code block',
+                originalSize: 50,
+            },
+            '222': {
+                type: PlaceholderType.PASTE,
+                displayText: '[Paste #222: 100 chars]',
+                content: 'second code block with more content',
+                originalSize: 100,
+            },
+        },
+    };
+    // Delete part of second placeholder
+    const newText = 'Compare [Paste #111: 50 chars] with [Paste #222: 100 ch output';
+    const result = handleAtomicDeletion(previousState, newText);
+    t.truthy(result);
+    t.is(result.displayValue, 'Compare [Paste #111: 50 chars] with  output');
+    t.deepEqual(result.placeholderContent, {
+        '111': {
+            type: PlaceholderType.PASTE,
+            displayText: '[Paste #111: 50 chars]',
+            content: 'first code block',
+            originalSize: 50,
+        },
+    });
+});
+//# sourceMappingURL=atomic-deletion.spec.js.map

package/dist/utils/atomic-deletion.spec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"atomic-deletion.spec.js","sourceRoot":"","sources":["../../source/utils/atomic-deletion.spec.ts"],"names":[],"mappings":"AAAA,OAAO,IAAI,MAAM,KAAK,CAAC;AAEvB,OAAO,EAAC,eAAe,EAAC,MAAM,gBAAgB,CAAC;AAC/C,OAAO,EACN,yBAAyB,EACzB,oBAAoB,EACpB,+BAA+B,GAC/B,MAAM,mBAAmB,CAAC;AAE3B,OAAO,CAAC,GAAG,CAAC,2BAA2B,CAAC,CAAC;AAEzC,wCAAwC;AACxC,IAAI,CAAC,0DAA0D,EAAE,CAAC,CAAC,EAAE;IACpE,MAAM,aAAa,GAAe;QACjC,YAAY,EAAE,4CAA4C;QAC1D,kBAAkB,EAAE;YACnB,KAAK,EAAE;gBACN,IAAI,EAAE,eAAe,CAAC,KAAK;gBAC3B,WAAW,EAAE,yBAAyB;gBACtC,OAAO,EAAE,6BAA6B;gBACtC,YAAY,EAAE,GAAG;aACU;SAC5B;KACD,CAAC;IAEF,uDAAuD;IACvD,MAAM,OAAO,GAAG,0CAA0C,CAAC;IAE3D,MAAM,MAAM,GAAG,oBAAoB,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;IAE5D,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACjB,CAAC,CAAC,EAAE,CAAC,MAAO,CAAC,YAAY,EAAE,qBAAqB,CAAC,CAAC;IAClD,CAAC,CAAC,SAAS,CAAC,MAAO,CAAC,kBAAkB,EAAE,EAAE,CAAC,CAAC;AAC7C,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,mEAAmE,EAAE,CAAC,CAAC,EAAE;IAC7E,MAAM,aAAa,GAAe;QACjC,YAAY,EAAE,sCAAsC;QACpD,kBAAkB,EAAE;YACnB,KAAK,EAAE;gBACN,IAAI,EAAE,eAAe,CAAC,KAAK;gBAC3B,WAAW,EAAE,yBAAyB;gBACtC,OAAO,EAAE,kCAAkC;gBAC3C,YAAY,EAAE,GAAG;aACU;SAC5B;KACD,CAAC;IAEF,4CAA4C;IAC5C,MAAM,OAAO,GAAG,kCAAkC,CAAC;IAEnD,MAAM,MAAM,GAAG,oBAAoB,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;IAE5D,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACjB,CAAC,CAAC,EAAE,CAAC,MAAO,CAAC,YAAY,EAAE,eAAe,CAAC,CAAC;IAC5C,CAAC,CAAC,SAAS,CAAC,MAAO,CAAC,kBAAkB,EAAE,EAAE,CAAC,CAAC;AAC7C,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,mDAAmD,EAAE,CAAC,CAAC,EAAE;IAC7D,MAAM,aAAa,GAAe;QACjC,YAAY,EACX,8DAA8D;QAC/D,kBAAkB,EAAE;YACnB,KAAK,EAAE;gBACN,IAAI,EAAE,eAAe,CAAC,KAAK;gBAC3B,WAAW,EAAE,yBAAyB;gBACtC,OAAO,EAAE,eAAe;gBACxB,YAAY,EAAE,GAAG;aACU;YAC5B,KAAK,EAAE;gBACN,IAAI,EAAE,eAAe,CAAC,KAAK;gBAC3B,WAAW,EAAE,yBAAyB;gBACtC,OAAO,EAAE,gBAAgB;gBACzB,YAAY,EAAE,GAAG;aACU;SAC5B;KACD,CAAC;IAEF,mCAAmC;IACnC,MAAM,OAAO,GAAG,0DAA0D,CAAC;IAE3E,MAAM,MAAM,GAAG,oBAAoB,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;IAE5D,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACjB,CAAC,CAAC,EAAE,CAAC,MAAO,CAAC,YAAY,EAAE,uCAAuC,CAAC,CAAC;IACpE,CAAC,CAAC,SAAS,CAAC,MAAO,CAAC,kBAAkB,EAAE;QACvC,KAAK,EAAE;YACN,IAAI,EAAE,eAAe,CAAC,KAAK;YAC3B,WAAW,EAAE,yBAAyB;YACtC,OAAO,EAAE,gBAAgB;YACzB,YAAY,EAAE,GAAG;SACU;KAC5B,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,wDAAwD,EAAE,CAAC,CAAC,EAAE;IAClE,MAAM,aAAa,GAAe;QACjC,YAAY,EAAE,kBAAkB;QAChC,kBAAkB,EAAE,EAAE;KACtB,CAAC;IAEF,MAAM,OAAO,GAAG,iBAAiB,CAAC;IAElC,MAAM,MAAM,GAAG,oBAAoB,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;IAE5D,CAAC,CAAC,EAAE,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;AACpB,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,iDAAiD,EAAE,CAAC,CAAC,EAAE;IAC3D,MAAM,aAAa,GAAe;QACjC,YAAY,EAAE,YAAY;QAC1B,kBAAkB,EAAE,EAAE;KACtB,CAAC;IAEF,MAAM,OAAO,GAAG,sBAAsB,CAAC;IAEvC,MAAM,MAAM,GAAG,oBAAoB,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;IAE5D,CAAC,CAAC,EAAE,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;AACpB,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,gDAAgD,EAAE,CAAC,CAAC,EAAE;IAC1D,MAAM,IAAI,GAAG,sCAAsC,CAAC;IAEpD,kCAAkC;IAClC,MAAM,OAAO,GAAG,yBAAyB,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,mCAAmC;IACxF,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IAErB,mCAAmC;IACnC,MAAM,OAAO,GAAG,yBAAyB,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,cAAc;IAClE,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IAEpB,6BAA6B;IAC7B,MAAM,OAAO,GAAG,yBAAyB,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa;IAClE,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;AACrB,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,0DAA0D,EAAE,CAAC,CAAC,EAAE;IACpE,MAAM,IAAI,GAAG,mCAAmC,CAAC;IACjD,4CAA4C;IAC5C,wCAAwC;IACxC,8CAA8C;IAE9C,8CAA8C;IAC9C,MAAM,OAAO,GAAG,+BAA+B,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,iBAAiB;IAC9E,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAEhB,uEAAuE;IACvE,MAAM,OAAO,GAAG,+BAA+B,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,0CAA0C;IACxG,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAEjB,+BAA+B;IAC/B,MAAM,OAAO,GAAG,+BAA+B,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,gBAAgB;IAC7E,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;AAClB,CAAC,CAAC,CAAC;AAEH,yCAAyC;AACzC,IAAI,CAAC,kDAAkD,EAAE,CAAC,CAAC,EAAE;IAC5D,MAAM,aAAa,GAAe;QACjC,YAAY,EACX,oEAAoE;QACrE,kBAAkB,EAAE;YACnB,KAAK,EAAE;gBACN,IAAI,EAAE,eAAe,CAAC,KAAK;gBAC3B,WAAW,EAAE,wBAAwB;gBACrC,OAAO,EAAE,kBAAkB;gBAC3B,YAAY,EAAE,EAAE;aACW;YAC5B,KAAK,EAAE;gBACN,IAAI,EAAE,eAAe,CAAC,KAAK;gBAC3B,WAAW,EAAE,yBAAyB;gBACtC,OAAO,EAAE,qCAAqC;gBAC9C,YAAY,EAAE,GAAG;aACU;SAC5B;KACD,CAAC;IAEF,oCAAoC;IACpC,MAAM,OAAO,GACZ,gEAAgE,CAAC;IAElE,MAAM,MAAM,GAAG,oBAAoB,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;IAE5D,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACjB,CAAC,CAAC,EAAE,CAAC,MAAO,CAAC,YAAY,EAAE,6CAA6C,CAAC,CAAC;IAC1E,CAAC,CAAC,SAAS,CAAC,MAAO,CAAC,kBAAkB,EAAE;QACvC,KAAK,EAAE;YACN,IAAI,EAAE,eAAe,CAAC,KAAK;YAC3B,WAAW,EAAE,wBAAwB;YACrC,OAAO,EAAE,kBAAkB;YAC3B,YAAY,EAAE,EAAE;SACW;KAC5B,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC"}

package/dist/utils/bounded-map.d.ts

@@ -0,0 +1,83 @@
+/**
+ * BoundedMap - A Map with size and TTL constraints to prevent unbounded memory growth
+ *
+ * Features:
+ * - Maximum size limit with automatic eviction of oldest entries
+ * - Optional TTL (time-to-live) for automatic expiration
+ * - Maintains insertion order for predictable eviction
+ */
+export interface BoundedMapOptions {
+    /**
+     * Maximum number of entries. When exceeded, oldest entries are removed.
+     * @default 1000
+     */
+    maxSize?: number;
+    /**
+     * Time-to-live in milliseconds. Entries older than this are automatically removed.
+     * Set to 0 or undefined to disable TTL.
+     * @default undefined (no TTL)
+     */
+    ttl?: number;
+}
+/**
+ * A Map implementation with automatic size limiting and optional TTL
+ */
+export declare class BoundedMap<K, V> {
+    private map;
+    private maxSize;
+    private ttl?;
+    constructor(options?: BoundedMapOptions);
+    /**
+     * Set a key-value pair, enforcing size limit
+     */
+    set(key: K, value: V): this;
+    /**
+     * Get a value by key, checking TTL if configured
+     */
+    get(key: K): V | undefined;
+    /**
+     * Check if key exists and is not expired
+     */
+    has(key: K): boolean;
+    /**
+     * Delete a key-value pair
+     */
+    delete(key: K): boolean;
+    /**
+     * Clear all entries
+     */
+    clear(): void;
+    /**
+     * Get number of entries (including potentially expired ones)
+     */
+    get size(): number;
+    /**
+     * Get all non-expired keys
+     */
+    keys(): IterableIterator<K>;
+    /**
+     * Get all non-expired values
+     */
+    values(): IterableIterator<V>;
+    /**
+     * Get all non-expired entries as [key, value] pairs
+     */
+    entries(): IterableIterator<[K, V]>;
+    /**
+     * Iterate over non-expired entries
+     */
+    forEach(callbackfn: (value: V, key: K, map: BoundedMap<K, V>) => void, thisArg?: unknown): void;
+    /**
+     * Remove all expired entries based on TTL
+     */
+    private cleanupExpired;
+    /**
+     * Get all entries including expired ones (for debugging)
+     */
+    getRawSize(): number;
+    /**
+     * Make BoundedMap iterable
+     */
+    [Symbol.iterator](): IterableIterator<[K, V]>;
+}
+//# sourceMappingURL=bounded-map.d.ts.map

package/dist/utils/bounded-map.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bounded-map.d.ts","sourceRoot":"","sources":["../../source/utils/bounded-map.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAOH,MAAM,WAAW,iBAAiB;IACjC;;;OAGG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IAEjB;;;;OAIG;IACH,GAAG,CAAC,EAAE,MAAM,CAAC;CACb;AAED;;GAEG;AACH,qBAAa,UAAU,CAAC,CAAC,EAAE,CAAC;IAC3B,OAAO,CAAC,GAAG,CAA6B;IACxC,OAAO,CAAC,OAAO,CAAS;IACxB,OAAO,CAAC,GAAG,CAAC,CAAS;gBAET,OAAO,GAAE,iBAAsB;IAU3C;;OAEG;IACH,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAiB3B;;OAEG;IACH,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAkB1B;;OAEG;IACH,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAIpB;;OAEG;IACH,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAIvB;;OAEG;IACH,KAAK,IAAI,IAAI;IAIb;;OAEG;IACH,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED;;OAEG;IACH,IAAI,IAAI,gBAAgB,CAAC,CAAC,CAAC;IAK3B;;OAEG;IACF,MAAM,IAAI,gBAAgB,CAAC,CAAC,CAAC;IAO9B;;OAEG;IACF,OAAO,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAOpC;;OAEG;IACH,OAAO,CACN,UAAU,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,EAC7D,OAAO,CAAC,EAAE,OAAO,GACf,IAAI;IAOP;;OAEG;IACH,OAAO,CAAC,cAAc;IAmBtB;;OAEG;IACH,UAAU,IAAI,MAAM;IAIpB;;OAEG;IACH,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CAG7C"}

package/dist/utils/bounded-map.js

@@ -0,0 +1,148 @@
+/**
+ * BoundedMap - A Map with size and TTL constraints to prevent unbounded memory growth
+ *
+ * Features:
+ * - Maximum size limit with automatic eviction of oldest entries
+ * - Optional TTL (time-to-live) for automatic expiration
+ * - Maintains insertion order for predictable eviction
+ */
+/**
+ * A Map implementation with automatic size limiting and optional TTL
+ */
+export class BoundedMap {
+    map;
+    maxSize;
+    ttl;
+    constructor(options = {}) {
+        this.map = new Map();
+        this.maxSize = options.maxSize ?? 1000;
+        this.ttl = options.ttl;
+        if (this.maxSize <= 0) {
+            throw new Error('maxSize must be greater than 0');
+        }
+    }
+    /**
+     * Set a key-value pair, enforcing size limit
+     */
+    set(key, value) {
+        // Remove oldest entry if at capacity
+        if (this.map.size >= this.maxSize && !this.map.has(key)) {
+            const firstKey = this.map.keys().next().value;
+            if (firstKey !== undefined) {
+                this.map.delete(firstKey);
+            }
+        }
+        this.map.set(key, {
+            value,
+            timestamp: Date.now(),
+        });
+        return this;
+    }
+    /**
+     * Get a value by key, checking TTL if configured
+     */
+    get(key) {
+        const entry = this.map.get(key);
+        if (!entry) {
+            return undefined;
+        }
+        // Check TTL if configured
+        if (this.ttl !== undefined && this.ttl > 0) {
+            const age = Date.now() - entry.timestamp;
+            if (age > this.ttl) {
+                this.map.delete(key);
+                return undefined;
+            }
+        }
+        return entry.value;
+    }
+    /**
+     * Check if key exists and is not expired
+     */
+    has(key) {
+        return this.get(key) !== undefined;
+    }
+    /**
+     * Delete a key-value pair
+     */
+    delete(key) {
+        return this.map.delete(key);
+    }
+    /**
+     * Clear all entries
+     */
+    clear() {
+        this.map.clear();
+    }
+    /**
+     * Get number of entries (including potentially expired ones)
+     */
+    get size() {
+        return this.map.size;
+    }
+    /**
+     * Get all non-expired keys
+     */
+    keys() {
+        this.cleanupExpired();
+        return this.map.keys();
+    }
+    /**
+     * Get all non-expired values
+     */
+    *values() {
+        this.cleanupExpired();
+        for (const entry of this.map.values()) {
+            yield entry.value;
+        }
+    }
+    /**
+     * Get all non-expired entries as [key, value] pairs
+     */
+    *entries() {
+        this.cleanupExpired();
+        for (const [key, entry] of this.map.entries()) {
+            yield [key, entry.value];
+        }
+    }
+    /**
+     * Iterate over non-expired entries
+     */
+    forEach(callbackfn, thisArg) {
+        this.cleanupExpired();
+        for (const [key, entry] of this.map.entries()) {
+            callbackfn.call(thisArg, entry.value, key, this);
+        }
+    }
+    /**
+     * Remove all expired entries based on TTL
+     */
+    cleanupExpired() {
+        if (!this.ttl || this.ttl <= 0) {
+            return;
+        }
+        const now = Date.now();
+        const keysToDelete = [];
+        for (const [key, entry] of this.map.entries()) {
+            if (now - entry.timestamp > this.ttl) {
+                keysToDelete.push(key);
+            }
+        }
+        for (const key of keysToDelete) {
+            this.map.delete(key);
+        }
+    }
+    /**
+     * Get all entries including expired ones (for debugging)
+     */
+    getRawSize() {
+        return this.map.size;
+    }
+    /**
+     * Make BoundedMap iterable
+     */
+    [Symbol.iterator]() {
+        return this.entries();
+    }
+}
+//# sourceMappingURL=bounded-map.js.map

package/dist/utils/bounded-map.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bounded-map.js","sourceRoot":"","sources":["../../source/utils/bounded-map.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAsBH;;GAEG;AACH,MAAM,OAAO,UAAU;IACd,GAAG,CAA6B;IAChC,OAAO,CAAS;IAChB,GAAG,CAAU;IAErB,YAAY,UAA6B,EAAE;QAC1C,IAAI,CAAC,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;QACrB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,IAAI,CAAC;QACvC,IAAI,CAAC,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC;QAEvB,IAAI,IAAI,CAAC,OAAO,IAAI,CAAC,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;QACnD,CAAC;IACF,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,GAAM,EAAE,KAAQ;QACnB,qCAAqC;QACrC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACzD,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;YAC9C,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC5B,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YAC3B,CAAC;QACF,CAAC;QAED,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE;YACjB,KAAK;YACL,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;SACrB,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,GAAM;QACT,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,KAAK,EAAE,CAAC;YACZ,OAAO,SAAS,CAAC;QAClB,CAAC;QAED,0BAA0B;QAC1B,IAAI,IAAI,CAAC,GAAG,KAAK,SAAS,IAAI,IAAI,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC;YAC5C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,SAAS,CAAC;YACzC,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;gBACpB,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACrB,OAAO,SAAS,CAAC;YAClB,CAAC;QACF,CAAC;QAED,OAAO,KAAK,CAAC,KAAK,CAAC;IACpB,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,GAAM;QACT,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC;IACpC,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,GAAM;QACZ,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,KAAK;QACJ,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,IAAI,IAAI;QACP,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;IACtB,CAAC;IAED;;OAEG;IACH,IAAI;QACH,IAAI,CAAC,cAAc,EAAE,CAAC;QACtB,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,CAAC,MAAM;QACN,IAAI,CAAC,cAAc,EAAE,CAAC;QACtB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,MAAM,KAAK,CAAC,KAAK,CAAC;QACnB,CAAC;IACF,CAAC;IAED;;OAEG;IACH,CAAC,OAAO;QACP,IAAI,CAAC,cAAc,EAAE,CAAC;QACtB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,EAAE,CAAC;YAC/C,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QAC1B,CAAC;IACF,CAAC;IAED;;OAEG;IACH,OAAO,CACN,UAA6D,EAC7D,OAAiB;QAEjB,IAAI,CAAC,cAAc,EAAE,CAAC;QACtB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,EAAE,CAAC;YAC/C,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;QAClD,CAAC;IACF,CAAC;IAED;;OAEG;IACK,cAAc;QACrB,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;YAChC,OAAO;QACR,CAAC;QAED,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,YAAY,GAAQ,EAAE,CAAC;QAE7B,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,EAAE,CAAC;YAC/C,IAAI,GAAG,GAAG,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;gBACtC,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACxB,CAAC;QACF,CAAC;QAED,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;YAChC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACtB,CAAC;IACF,CAAC;IAED;;OAEG;IACH,UAAU;QACT,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;IACtB,CAAC;IAED;;OAEG;IACH,CAAC,MAAM,CAAC,QAAQ,CAAC;QAChB,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;IACvB,CAAC;CACD"}

package/dist/utils/bounded-map.spec.d.ts

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

package/dist/utils/bounded-map.spec.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bounded-map.spec.d.ts","sourceRoot":"","sources":["../../source/utils/bounded-map.spec.ts"],"names":[],"mappings":""}

package/dist/utils/bounded-map.spec.js

@@ -0,0 +1,221 @@
+import test from 'ava';
+import { BoundedMap } from './bounded-map.js';
+test('BoundedMap - basic set and get operations', t => {
+    const map = new BoundedMap();
+    map.set('a', 1);
+    map.set('b', 2);
+    map.set('c', 3);
+    t.is(map.get('a'), 1);
+    t.is(map.get('b'), 2);
+    t.is(map.get('c'), 3);
+    t.is(map.get('nonexistent'), undefined);
+});
+test('BoundedMap - has() method', t => {
+    const map = new BoundedMap();
+    map.set('a', 1);
+    t.true(map.has('a'));
+    t.false(map.has('nonexistent'));
+});
+test('BoundedMap - delete() method', t => {
+    const map = new BoundedMap();
+    map.set('a', 1);
+    map.set('b', 2);
+    t.true(map.delete('a'));
+    t.false(map.has('a'));
+    t.true(map.has('b'));
+    t.false(map.delete('nonexistent'));
+});
+test('BoundedMap - clear() method', t => {
+    const map = new BoundedMap();
+    map.set('a', 1);
+    map.set('b', 2);
+    map.set('c', 3);
+    t.is(map.size, 3);
+    map.clear();
+    t.is(map.size, 0);
+    t.false(map.has('a'));
+});
+test('BoundedMap - enforces max size limit', t => {
+    const map = new BoundedMap({ maxSize: 3 });
+    map.set('a', 1);
+    map.set('b', 2);
+    map.set('c', 3);
+    t.is(map.size, 3);
+    // Adding 4th element should evict oldest ('a')
+    map.set('d', 4);
+    t.is(map.size, 3);
+    t.false(map.has('a')); // Oldest entry evicted
+    t.true(map.has('b'));
+    t.true(map.has('c'));
+    t.true(map.has('d'));
+});
+test('BoundedMap - evicts oldest entry first', t => {
+    const map = new BoundedMap({ maxSize: 2 });
+    map.set('first', 1);
+    map.set('second', 2);
+    map.set('third', 3);
+    // 'first' should be evicted
+    t.false(map.has('first'));
+    t.true(map.has('second'));
+    t.true(map.has('third'));
+});
+test('BoundedMap - updating existing key does not trigger eviction', t => {
+    const map = new BoundedMap({ maxSize: 2 });
+    map.set('a', 1);
+    map.set('b', 2);
+    // Update existing key
+    map.set('a', 10);
+    // Should still have both entries
+    t.is(map.size, 2);
+    t.is(map.get('a'), 10);
+    t.is(map.get('b'), 2);
+});
+test('BoundedMap - TTL causes entries to expire', async (t) => {
+    const map = new BoundedMap({
+        maxSize: 100,
+        ttl: 50, // 50ms TTL
+    });
+    map.set('a', 1);
+    t.is(map.get('a'), 1);
+    // Wait for TTL to expire
+    await new Promise(resolve => setTimeout(resolve, 60));
+    // Entry should be expired
+    t.is(map.get('a'), undefined);
+    t.false(map.has('a'));
+});
+test('BoundedMap - entries within TTL are accessible', async (t) => {
+    const map = new BoundedMap({
+        maxSize: 100,
+        ttl: 100, // 100ms TTL
+    });
+    map.set('a', 1);
+    // Wait less than TTL
+    await new Promise(resolve => setTimeout(resolve, 50));
+    // Entry should still be accessible
+    t.is(map.get('a'), 1);
+    t.true(map.has('a'));
+});
+test('BoundedMap - keys() returns non-expired keys', async (t) => {
+    const map = new BoundedMap({
+        maxSize: 100,
+        ttl: 50, // 50ms TTL
+    });
+    map.set('a', 1);
+    map.set('b', 2);
+    await new Promise(resolve => setTimeout(resolve, 60));
+    map.set('c', 3); // Add after expiration
+    const keys = Array.from(map.keys());
+    t.deepEqual(keys, ['c']);
+});
+test('BoundedMap - values() returns non-expired values', async (t) => {
+    const map = new BoundedMap({
+        maxSize: 100,
+        ttl: 50,
+    });
+    map.set('a', 1);
+    map.set('b', 2);
+    await new Promise(resolve => setTimeout(resolve, 60));
+    map.set('c', 3);
+    const values = Array.from(map.values());
+    t.deepEqual(values, [3]);
+});
+test('BoundedMap - entries() returns non-expired entries', async (t) => {
+    const map = new BoundedMap({
+        maxSize: 100,
+        ttl: 50,
+    });
+    map.set('a', 1);
+    map.set('b', 2);
+    await new Promise(resolve => setTimeout(resolve, 60));
+    map.set('c', 3);
+    const entries = Array.from(map.entries());
+    t.deepEqual(entries, [['c', 3]]);
+});
+test('BoundedMap - forEach iterates over non-expired entries', async (t) => {
+    const map = new BoundedMap({
+        maxSize: 100,
+        ttl: 50,
+    });
+    map.set('a', 1);
+    map.set('b', 2);
+    await new Promise(resolve => setTimeout(resolve, 60));
+    map.set('c', 3);
+    const entries = [];
+    map.forEach((value, key) => {
+        entries.push([key, value]);
+    });
+    t.deepEqual(entries, [['c', 3]]);
+});
+test('BoundedMap - is iterable', t => {
+    const map = new BoundedMap();
+    map.set('a', 1);
+    map.set('b', 2);
+    map.set('c', 3);
+    const entries = Array.from(map);
+    t.deepEqual(entries, [
+        ['a', 1],
+        ['b', 2],
+        ['c', 3],
+    ]);
+});
+test('BoundedMap - getRawSize() returns size including expired entries', async (t) => {
+    const map = new BoundedMap({
+        maxSize: 100,
+        ttl: 50,
+    });
+    map.set('a', 1);
+    map.set('b', 2);
+    await new Promise(resolve => setTimeout(resolve, 60));
+    // Entries are expired but not yet cleaned up
+    t.is(map.getRawSize(), 2);
+    // Accessing keys() triggers cleanup
+    Array.from(map.keys());
+    t.is(map.getRawSize(), 0);
+});
+test('BoundedMap - throws error if maxSize is 0 or negative', t => {
+    t.throws(() => {
+        new BoundedMap({ maxSize: 0 });
+    }, { message: 'maxSize must be greater than 0' });
+    t.throws(() => {
+        new BoundedMap({ maxSize: -1 });
+    }, { message: 'maxSize must be greater than 0' });
+});
+test('BoundedMap - default maxSize is 1000', t => {
+    const map = new BoundedMap();
+    // Fill with 1000 entries
+    for (let i = 0; i < 1000; i++) {
+        map.set(`key${i}`, i);
+    }
+    t.is(map.size, 1000);
+    // Adding 1001st entry should evict first
+    map.set('key1000', 1000);
+    t.is(map.size, 1000);
+    t.false(map.has('key0'));
+    t.true(map.has('key1000'));
+});
+test('BoundedMap - works with different key/value types', t => {
+    const numberMap = new BoundedMap();
+    numberMap.set(1, 'one');
+    numberMap.set(2, 'two');
+    t.is(numberMap.get(1), 'one');
+    const objectMap = new BoundedMap();
+    objectMap.set('a', { value: 1 });
+    t.deepEqual(objectMap.get('a'), { value: 1 });
+});
+test('BoundedMap - set() returns this for chaining', t => {
+    const map = new BoundedMap();
+    const result = map.set('a', 1).set('b', 2).set('c', 3);
+    t.is(result, map);
+    t.is(map.size, 3);
+});
+test('BoundedMap - no TTL when ttl is 0 or undefined', async (t) => {
+    const map1 = new BoundedMap({ ttl: 0 });
+    const map2 = new BoundedMap({ ttl: undefined });
+    map1.set('a', 1);
+    map2.set('b', 2);
+    await new Promise(resolve => setTimeout(resolve, 100));
+    // Entries should not expire
+    t.is(map1.get('a'), 1);
+    t.is(map2.get('b'), 2);
+});
+//# sourceMappingURL=bounded-map.spec.js.map

package/dist/utils/bounded-map.spec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bounded-map.spec.js","sourceRoot":"","sources":["../../source/utils/bounded-map.spec.ts"],"names":[],"mappings":"AAAA,OAAO,IAAI,MAAM,KAAK,CAAC;AACvB,OAAO,EAAC,UAAU,EAAC,MAAM,eAAe,CAAC;AAEzC,IAAI,CAAC,2CAA2C,EAAE,CAAC,CAAC,EAAE;IACrD,MAAM,GAAG,GAAG,IAAI,UAAU,EAAkB,CAAC;IAE7C,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAChB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAChB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAEhB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACtB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACtB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACtB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,aAAa,CAAC,EAAE,SAAS,CAAC,CAAC;AACzC,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,2BAA2B,EAAE,CAAC,CAAC,EAAE;IACrC,MAAM,GAAG,GAAG,IAAI,UAAU,EAAkB,CAAC;IAE7C,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAEhB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACrB,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC;AACjC,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,8BAA8B,EAAE,CAAC,CAAC,EAAE;IACxC,MAAM,GAAG,GAAG,IAAI,UAAU,EAAkB,CAAC;IAE7C,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAChB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAEhB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;IACxB,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACtB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACrB,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC;AACpC,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,6BAA6B,EAAE,CAAC,CAAC,EAAE;IACvC,MAAM,GAAG,GAAG,IAAI,UAAU,EAAkB,CAAC;IAE7C,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAChB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAChB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAEhB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAClB,GAAG,CAAC,KAAK,EAAE,CAAC;IACZ,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAClB,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AACvB,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,sCAAsC,EAAE,CAAC,CAAC,EAAE;IAChD,MAAM,GAAG,GAAG,IAAI,UAAU,CAAiB,EAAC,OAAO,EAAE,CAAC,EAAC,CAAC,CAAC;IAEzD,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAChB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAChB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAChB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAElB,+CAA+C;IAC/C,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAChB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAClB,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,uBAAuB;IAC9C,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACrB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACrB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AACtB,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,wCAAwC,EAAE,CAAC,CAAC,EAAE;IAClD,MAAM,GAAG,GAAG,IAAI,UAAU,CAAiB,EAAC,OAAO,EAAE,CAAC,EAAC,CAAC,CAAC;IAEzD,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IACpB,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;IACrB,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IAEpB,4BAA4B;IAC5B,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;IAC1B,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC1B,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;AAC1B,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,8DAA8D,EAAE,CAAC,CAAC,EAAE;IACxE,MAAM,GAAG,GAAG,IAAI,UAAU,CAAiB,EAAC,OAAO,EAAE,CAAC,EAAC,CAAC,CAAC;IAEzD,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAChB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAEhB,sBAAsB;IACtB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IAEjB,iCAAiC;IACjC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAClB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;IACvB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;AACvB,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,2CAA2C,EAAE,KAAK,EAAC,CAAC,EAAC,EAAE;IAC3D,MAAM,GAAG,GAAG,IAAI,UAAU,CAAiB;QAC1C,OAAO,EAAE,GAAG;QACZ,GAAG,EAAE,EAAE,EAAE,WAAW;KACpB,CAAC,CAAC;IAEH,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAChB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAEtB,yBAAyB;IACzB,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;IAEtD,0BAA0B;IAC1B,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,SAAS,CAAC,CAAC;IAC9B,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AACvB,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,gDAAgD,EAAE,KAAK,EAAC,CAAC,EAAC,EAAE;IAChE,MAAM,GAAG,GAAG,IAAI,UAAU,CAAiB;QAC1C,OAAO,EAAE,GAAG;QACZ,GAAG,EAAE,GAAG,EAAE,YAAY;KACtB,CAAC,CAAC;IAEH,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAEhB,qBAAqB;IACrB,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;IAEtD,mCAAmC;IACnC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACtB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AACtB,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,8CAA8C,EAAE,KAAK,EAAC,CAAC,EAAC,EAAE;IAC9D,MAAM,GAAG,GAAG,IAAI,UAAU,CAAiB;QAC1C,OAAO,EAAE,GAAG;QACZ,GAAG,EAAE,EAAE,EAAE,WAAW;KACpB,CAAC,CAAC;IAEH,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAChB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAEhB,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;IAEtD,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,uBAAuB;IAExC,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;IACpC,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;AAC1B,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,kDAAkD,EAAE,KAAK,EAAC,CAAC,EAAC,EAAE;IAClE,MAAM,GAAG,GAAG,IAAI,UAAU,CAAiB;QAC1C,OAAO,EAAE,GAAG;QACZ,GAAG,EAAE,EAAE;KACP,CAAC,CAAC;IAEH,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAChB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAEhB,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;IAEtD,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAEhB,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;IACxC,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1B,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,oDAAoD,EAAE,KAAK,EAAC,CAAC,EAAC,EAAE;IACpE,MAAM,GAAG,GAAG,IAAI,UAAU,CAAiB;QAC1C,OAAO,EAAE,GAAG;QACZ,GAAG,EAAE,EAAE;KACP,CAAC,CAAC;IAEH,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAChB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAEhB,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;IAEtD,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAEhB,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;IAC1C,CAAC,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AAClC,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,wDAAwD,EAAE,KAAK,EAAC,CAAC,EAAC,EAAE;IACxE,MAAM,GAAG,GAAG,IAAI,UAAU,CAAiB;QAC1C,OAAO,EAAE,GAAG;QACZ,GAAG,EAAE,EAAE;KACP,CAAC,CAAC;IAEH,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAChB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAEhB,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;IAEtD,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAEhB,MAAM,OAAO,GAA4B,EAAE,CAAC;IAC5C,GAAG,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;QAC1B,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,CAAC,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AAClC,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,0BAA0B,EAAE,CAAC,CAAC,EAAE;IACpC,MAAM,GAAG,GAAG,IAAI,UAAU,EAAkB,CAAC;IAE7C,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAChB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAChB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAEhB,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChC,CAAC,CAAC,SAAS,CAAC,OAAO,EAAE;QACpB,CAAC,GAAG,EAAE,CAAC,CAAC;QACR,CAAC,GAAG,EAAE,CAAC,CAAC;QACR,CAAC,GAAG,EAAE,CAAC,CAAC;KACR,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,kEAAkE,EAAE,KAAK,EAAC,CAAC,EAAC,EAAE;IAClF,MAAM,GAAG,GAAG,IAAI,UAAU,CAAiB;QAC1C,OAAO,EAAE,GAAG;QACZ,GAAG,EAAE,EAAE;KACP,CAAC,CAAC;IAEH,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAChB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAEhB,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;IAEtD,6CAA6C;IAC7C,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC,CAAC;IAE1B,oCAAoC;IACpC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;IACvB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC,CAAC;AAC3B,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,uDAAuD,EAAE,CAAC,CAAC,EAAE;IACjE,CAAC,CAAC,MAAM,CACP,GAAG,EAAE;QACJ,IAAI,UAAU,CAAC,EAAC,OAAO,EAAE,CAAC,EAAC,CAAC,CAAC;IAC9B,CAAC,EACD,EAAC,OAAO,EAAE,gCAAgC,EAAC,CAC3C,CAAC;IAEF,CAAC,CAAC,MAAM,CACP,GAAG,EAAE;QACJ,IAAI,UAAU,CAAC,EAAC,OAAO,EAAE,CAAC,CAAC,EAAC,CAAC,CAAC;IAC/B,CAAC,EACD,EAAC,OAAO,EAAE,gCAAgC,EAAC,CAC3C,CAAC;AACH,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,sCAAsC,EAAE,CAAC,CAAC,EAAE;IAChD,MAAM,GAAG,GAAG,IAAI,UAAU,EAAkB,CAAC;IAE7C,yBAAyB;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACvB,CAAC;IAED,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAErB,yCAAyC;IACzC,GAAG,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;IACzB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACrB,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IACzB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC;AAC5B,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,mDAAmD,EAAE,CAAC,CAAC,EAAE;IAC7D,MAAM,SAAS,GAAG,IAAI,UAAU,EAAkB,CAAC;IACnD,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACxB,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACxB,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAE9B,MAAM,SAAS,GAAG,IAAI,UAAU,EAA2B,CAAC;IAC5D,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,EAAC,KAAK,EAAE,CAAC,EAAC,CAAC,CAAC;IAC/B,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAC,KAAK,EAAE,CAAC,EAAC,CAAC,CAAC;AAC7C,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,8CAA8C,EAAE,CAAC,CAAC,EAAE;IACxD,MAAM,GAAG,GAAG,IAAI,UAAU,EAAkB,CAAC;IAE7C,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAEvD,CAAC,CAAC,EAAE,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IAClB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AACnB,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,gDAAgD,EAAE,KAAK,EAAC,CAAC,EAAC,EAAE;IAChE,MAAM,IAAI,GAAG,IAAI,UAAU,CAAiB,EAAC,GAAG,EAAE,CAAC,EAAC,CAAC,CAAC;IACtD,MAAM,IAAI,GAAG,IAAI,UAAU,CAAiB,EAAC,GAAG,EAAE,SAAS,EAAC,CAAC,CAAC;IAE9D,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACjB,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAEjB,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;IAEvD,4BAA4B;IAC5B,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACvB,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;AACxB,CAAC,CAAC,CAAC"}

package/dist/utils/checkpoint-utils.d.ts

@@ -0,0 +1,12 @@
+/**
+ * Format timestamp to relative time string
+ */
+export declare function formatRelativeTime(timestamp: string): string;
+/**
+ * Validate checkpoint name for invalid characters and length
+ */
+export declare function validateCheckpointName(name: string): {
+    valid: boolean;
+    error?: string;
+};
+//# sourceMappingURL=checkpoint-utils.d.ts.map

package/dist/utils/checkpoint-utils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"checkpoint-utils.d.ts","sourceRoot":"","sources":["../../source/utils/checkpoint-utils.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,CAmB5D;AAED;;GAEG;AACH,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,MAAM,GAAG;IACrD,KAAK,EAAE,OAAO,CAAC;IACf,KAAK,CAAC,EAAE,MAAM,CAAC;CACf,CA6DA"}