@push.rocks/smartproxy 25.17.10 → 26.0.0

package/dist_ts/core/utils/binary-heap.d.ts

@@ -1,73 +0,0 @@
-/**
- * A binary heap implementation for efficient priority queue operations
- * Supports O(log n) insert and extract operations
- */
-export declare class BinaryHeap<T> {
-    private compareFn;
-    private extractKey?;
-    private heap;
-    private keyMap?;
-    constructor(compareFn: (a: T, b: T) => number, extractKey?: (item: T) => string);
-    /**
-     * Get the current size of the heap
-     */
-    get size(): number;
-    /**
-     * Check if the heap is empty
-     */
-    isEmpty(): boolean;
-    /**
-     * Peek at the top element without removing it
-     */
-    peek(): T | undefined;
-    /**
-     * Insert a new item into the heap
-     * O(log n) time complexity
-     */
-    insert(item: T): void;
-    /**
-     * Extract the top element from the heap
-     * O(log n) time complexity
-     */
-    extract(): T | undefined;
-    /**
-     * Extract an element that matches the predicate
-     * O(n) time complexity for search, O(log n) for extraction
-     */
-    extractIf(predicate: (item: T) => boolean): T | undefined;
-    /**
-     * Extract an element by its key (if extractKey was provided)
-     * O(log n) time complexity
-     */
-    extractByKey(key: string): T | undefined;
-    /**
-     * Check if a key exists in the heap
-     * O(1) time complexity
-     */
-    hasKey(key: string): boolean;
-    /**
-     * Get all elements as an array (does not modify heap)
-     * O(n) time complexity
-     */
-    toArray(): T[];
-    /**
-     * Clear the heap
-     */
-    clear(): void;
-    /**
-     * Extract element at specific index
-     */
-    private extractAt;
-    /**
-     * Bubble up element at given index to maintain heap property
-     */
-    private bubbleUp;
-    /**
-     * Bubble down element at given index to maintain heap property
-     */
-    private bubbleDown;
-    /**
-     * Swap two elements in the heap
-     */
-    private swap;
-}

package/dist_ts/core/utils/binary-heap.js

@@ -1,193 +0,0 @@
-/**
- * A binary heap implementation for efficient priority queue operations
- * Supports O(log n) insert and extract operations
- */
-export class BinaryHeap {
-    constructor(compareFn, extractKey) {
-        this.compareFn = compareFn;
-        this.extractKey = extractKey;
-        this.heap = [];
-        if (extractKey) {
-            this.keyMap = new Map();
-        }
-    }
-    /**
-     * Get the current size of the heap
-     */
-    get size() {
-        return this.heap.length;
-    }
-    /**
-     * Check if the heap is empty
-     */
-    isEmpty() {
-        return this.heap.length === 0;
-    }
-    /**
-     * Peek at the top element without removing it
-     */
-    peek() {
-        return this.heap[0];
-    }
-    /**
-     * Insert a new item into the heap
-     * O(log n) time complexity
-     */
-    insert(item) {
-        const index = this.heap.length;
-        this.heap.push(item);
-        if (this.keyMap && this.extractKey) {
-            const key = this.extractKey(item);
-            this.keyMap.set(key, index);
-        }
-        this.bubbleUp(index);
-    }
-    /**
-     * Extract the top element from the heap
-     * O(log n) time complexity
-     */
-    extract() {
-        if (this.heap.length === 0)
-            return undefined;
-        if (this.heap.length === 1) {
-            const item = this.heap.pop();
-            if (this.keyMap && this.extractKey) {
-                this.keyMap.delete(this.extractKey(item));
-            }
-            return item;
-        }
-        const result = this.heap[0];
-        const lastItem = this.heap.pop();
-        this.heap[0] = lastItem;
-        if (this.keyMap && this.extractKey) {
-            this.keyMap.delete(this.extractKey(result));
-            this.keyMap.set(this.extractKey(lastItem), 0);
-        }
-        this.bubbleDown(0);
-        return result;
-    }
-    /**
-     * Extract an element that matches the predicate
-     * O(n) time complexity for search, O(log n) for extraction
-     */
-    extractIf(predicate) {
-        const index = this.heap.findIndex(predicate);
-        if (index === -1)
-            return undefined;
-        return this.extractAt(index);
-    }
-    /**
-     * Extract an element by its key (if extractKey was provided)
-     * O(log n) time complexity
-     */
-    extractByKey(key) {
-        if (!this.keyMap || !this.extractKey) {
-            throw new Error('extractKey function must be provided to use key-based extraction');
-        }
-        const index = this.keyMap.get(key);
-        if (index === undefined)
-            return undefined;
-        return this.extractAt(index);
-    }
-    /**
-     * Check if a key exists in the heap
-     * O(1) time complexity
-     */
-    hasKey(key) {
-        if (!this.keyMap)
-            return false;
-        return this.keyMap.has(key);
-    }
-    /**
-     * Get all elements as an array (does not modify heap)
-     * O(n) time complexity
-     */
-    toArray() {
-        return [...this.heap];
-    }
-    /**
-     * Clear the heap
-     */
-    clear() {
-        this.heap = [];
-        if (this.keyMap) {
-            this.keyMap.clear();
-        }
-    }
-    /**
-     * Extract element at specific index
-     */
-    extractAt(index) {
-        const item = this.heap[index];
-        if (this.keyMap && this.extractKey) {
-            this.keyMap.delete(this.extractKey(item));
-        }
-        if (index === this.heap.length - 1) {
-            this.heap.pop();
-            return item;
-        }
-        const lastItem = this.heap.pop();
-        this.heap[index] = lastItem;
-        if (this.keyMap && this.extractKey) {
-            this.keyMap.set(this.extractKey(lastItem), index);
-        }
-        // Try bubbling up first
-        const parentIndex = Math.floor((index - 1) / 2);
-        if (parentIndex >= 0 && this.compareFn(this.heap[index], this.heap[parentIndex]) < 0) {
-            this.bubbleUp(index);
-        }
-        else {
-            this.bubbleDown(index);
-        }
-        return item;
-    }
-    /**
-     * Bubble up element at given index to maintain heap property
-     */
-    bubbleUp(index) {
-        while (index > 0) {
-            const parentIndex = Math.floor((index - 1) / 2);
-            if (this.compareFn(this.heap[index], this.heap[parentIndex]) >= 0) {
-                break;
-            }
-            this.swap(index, parentIndex);
-            index = parentIndex;
-        }
-    }
-    /**
-     * Bubble down element at given index to maintain heap property
-     */
-    bubbleDown(index) {
-        const length = this.heap.length;
-        while (true) {
-            const leftChild = 2 * index + 1;
-            const rightChild = 2 * index + 2;
-            let smallest = index;
-            if (leftChild < length &&
-                this.compareFn(this.heap[leftChild], this.heap[smallest]) < 0) {
-                smallest = leftChild;
-            }
-            if (rightChild < length &&
-                this.compareFn(this.heap[rightChild], this.heap[smallest]) < 0) {
-                smallest = rightChild;
-            }
-            if (smallest === index)
-                break;
-            this.swap(index, smallest);
-            index = smallest;
-        }
-    }
-    /**
-     * Swap two elements in the heap
-     */
-    swap(i, j) {
-        const temp = this.heap[i];
-        this.heap[i] = this.heap[j];
-        this.heap[j] = temp;
-        if (this.keyMap && this.extractKey) {
-            this.keyMap.set(this.extractKey(this.heap[i]), i);
-            this.keyMap.set(this.extractKey(this.heap[j]), j);
-        }
-    }
-}
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiYmluYXJ5LWhlYXAuanMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi8uLi90cy9jb3JlL3V0aWxzL2JpbmFyeS1oZWFwLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiJBQUFBOzs7R0FHRztBQUNILE1BQU0sT0FBTyxVQUFVO0lBSXJCLFlBQ1UsU0FBaUMsRUFDakMsVUFBZ0M7UUFEaEMsY0FBUyxHQUFULFNBQVMsQ0FBd0I7UUFDakMsZUFBVSxHQUFWLFVBQVUsQ0FBc0I7UUFMbEMsU0FBSSxHQUFRLEVBQUUsQ0FBQztRQU9yQixJQUFJLFVBQVUsRUFBRSxDQUFDO1lBQ2YsSUFBSSxDQUFDLE1BQU0sR0FBRyxJQUFJLEdBQUcsRUFBRSxDQUFDO1FBQzFCLENBQUM7SUFDSCxDQUFDO0lBRUQ7O09BRUc7SUFDSCxJQUFXLElBQUk7UUFDYixPQUFPLElBQUksQ0FBQyxJQUFJLENBQUMsTUFBTSxDQUFDO0lBQzFCLENBQUM7SUFFRDs7T0FFRztJQUNJLE9BQU87UUFDWixPQUFPLElBQUksQ0FBQyxJQUFJLENBQUMsTUFBTSxLQUFLLENBQUMsQ0FBQztJQUNoQyxDQUFDO0lBRUQ7O09BRUc7SUFDSSxJQUFJO1FBQ1QsT0FBTyxJQUFJLENBQUMsSUFBSSxDQUFDLENBQUMsQ0FBQyxDQUFDO0lBQ3RCLENBQUM7SUFFRDs7O09BR0c7SUFDSSxNQUFNLENBQUMsSUFBTztRQUNuQixNQUFNLEtBQUssR0FBRyxJQUFJLENBQUMsSUFBSSxDQUFDLE1BQU0sQ0FBQztRQUMvQixJQUFJLENBQUMsSUFBSSxDQUFDLElBQUksQ0FBQyxJQUFJLENBQUMsQ0FBQztRQUVyQixJQUFJLElBQUksQ0FBQyxNQUFNLElBQUksSUFBSSxDQUFDLFVBQVUsRUFBRSxDQUFDO1lBQ25DLE1BQU0sR0FBRyxHQUFHLElBQUksQ0FBQyxVQUFVLENBQUMsSUFBSSxDQUFDLENBQUM7WUFDbEMsSUFBSSxDQUFDLE1BQU0sQ0FBQyxHQUFHLENBQUMsR0FBRyxFQUFFLEtBQUssQ0FBQyxDQUFDO1FBQzlCLENBQUM7UUFFRCxJQUFJLENBQUMsUUFBUSxDQUFDLEtBQUssQ0FBQyxDQUFDO0lBQ3ZCLENBQUM7SUFFRDs7O09BR0c7SUFDSSxPQUFPO1FBQ1osSUFBSSxJQUFJLENBQUMsSUFBSSxDQUFDLE1BQU0sS0FBSyxDQUFDO1lBQUUsT0FBTyxTQUFTLENBQUM7UUFDN0MsSUFBSSxJQUFJLENBQUMsSUFBSSxDQUFDLE1BQU0sS0FBSyxDQUFDLEVBQUUsQ0FBQztZQUMzQixNQUFNLElBQUksR0FBRyxJQUFJLENBQUMsSUFBSSxDQUFDLEdBQUcsRUFBRyxDQUFDO1lBQzlCLElBQUksSUFBSSxDQUFDLE1BQU0sSUFBSSxJQUFJLENBQUMsVUFBVSxFQUFFLENBQUM7Z0JBQ25DLElBQUksQ0FBQyxNQUFNLENBQUMsTUFBTSxDQUFDLElBQUksQ0FBQyxVQUFVLENBQUMsSUFBSSxDQUFDLENBQUMsQ0FBQztZQUM1QyxDQUFDO1lBQ0QsT0FBTyxJQUFJLENBQUM7UUFDZCxDQUFDO1FBRUQsTUFBTSxNQUFNLEdBQUcsSUFBSSxDQUFDLElBQUksQ0FBQyxDQUFDLENBQUMsQ0FBQztRQUM1QixNQUFNLFFBQVEsR0FBRyxJQUFJLENBQUMsSUFBSSxDQUFDLEdBQUcsRUFBRyxDQUFDO1FBQ2xDLElBQUksQ0FBQyxJQUFJLENBQUMsQ0FBQyxDQUFDLEdBQUcsUUFBUSxDQUFDO1FBRXhCLElBQUksSUFBSSxDQUFDLE1BQU0sSUFBSSxJQUFJLENBQUMsVUFBVSxFQUFFLENBQUM7WUFDbkMsSUFBSSxDQUFDLE1BQU0sQ0FBQyxNQUFNLENBQUMsSUFBSSxDQUFDLFVBQVUsQ0FBQyxNQUFNLENBQUMsQ0FBQyxDQUFDO1lBQzVDLElBQUksQ0FBQyxNQUFNLENBQUMsR0FBRyxDQUFDLElBQUksQ0FBQyxVQUFVLENBQUMsUUFBUSxDQUFDLEVBQUUsQ0FBQyxDQUFDLENBQUM7UUFDaEQsQ0FBQztRQUVELElBQUksQ0FBQyxVQUFVLENBQUMsQ0FBQyxDQUFDLENBQUM7UUFDbkIsT0FBTyxNQUFNLENBQUM7SUFDaEIsQ0FBQztJQUVEOzs7T0FHRztJQUNJLFNBQVMsQ0FBQyxTQUErQjtRQUM5QyxNQUFNLEtBQUssR0FBRyxJQUFJLENBQUMsSUFBSSxDQUFDLFNBQVMsQ0FBQyxTQUFTLENBQUMsQ0FBQztRQUM3QyxJQUFJLEtBQUssS0FBSyxDQUFDLENBQUM7WUFBRSxPQUFPLFNBQVMsQ0FBQztRQUVuQyxPQUFPLElBQUksQ0FBQyxTQUFTLENBQUMsS0FBSyxDQUFDLENBQUM7SUFDL0IsQ0FBQztJQUVEOzs7T0FHRztJQUNJLFlBQVksQ0FBQyxHQUFXO1FBQzdCLElBQUksQ0FBQyxJQUFJLENBQUMsTUFBTSxJQUFJLENBQUMsSUFBSSxDQUFDLFVBQVUsRUFBRSxDQUFDO1lBQ3JDLE1BQU0sSUFBSSxLQUFLLENBQUMsa0VBQWtFLENBQUMsQ0FBQztRQUN0RixDQUFDO1FBRUQsTUFBTSxLQUFLLEdBQUcsSUFBSSxDQUFDLE1BQU0sQ0FBQyxHQUFHLENBQUMsR0FBRyxDQUFDLENBQUM7UUFDbkMsSUFBSSxLQUFLLEtBQUssU0FBUztZQUFFLE9BQU8sU0FBUyxDQUFDO1FBRTFDLE9BQU8sSUFBSSxDQUFDLFNBQVMsQ0FBQyxLQUFLLENBQUMsQ0FBQztJQUMvQixDQUFDO0lBRUQ7OztPQUdHO0lBQ0ksTUFBTSxDQUFDLEdBQVc7UUFDdkIsSUFBSSxDQUFDLElBQUksQ0FBQyxNQUFNO1lBQUUsT0FBTyxLQUFLLENBQUM7UUFDL0IsT0FBTyxJQUFJLENBQUMsTUFBTSxDQUFDLEdBQUcsQ0FBQyxHQUFHLENBQUMsQ0FBQztJQUM5QixDQUFDO0lBRUQ7OztPQUdHO0lBQ0ksT0FBTztRQUNaLE9BQU8sQ0FBQyxHQUFHLElBQUksQ0FBQyxJQUFJLENBQUMsQ0FBQztJQUN4QixDQUFDO0lBRUQ7O09BRUc7SUFDSSxLQUFLO1FBQ1YsSUFBSSxDQUFDLElBQUksR0FBRyxFQUFFLENBQUM7UUFDZixJQUFJLElBQUksQ0FBQyxNQUFNLEVBQUUsQ0FBQztZQUNoQixJQUFJLENBQUMsTUFBTSxDQUFDLEtBQUssRUFBRSxDQUFDO1FBQ3RCLENBQUM7SUFDSCxDQUFDO0lBRUQ7O09BRUc7SUFDSyxTQUFTLENBQUMsS0FBYTtRQUM3QixNQUFNLElBQUksR0FBRyxJQUFJLENBQUMsSUFBSSxDQUFDLEtBQUssQ0FBQyxDQUFDO1FBRTlCLElBQUksSUFBSSxDQUFDLE1BQU0sSUFBSSxJQUFJLENBQUMsVUFBVSxFQUFFLENBQUM7WUFDbkMsSUFBSSxDQUFDLE1BQU0sQ0FBQyxNQUFNLENBQUMsSUFBSSxDQUFDLFVBQVUsQ0FBQyxJQUFJLENBQUMsQ0FBQyxDQUFDO1FBQzVDLENBQUM7UUFFRCxJQUFJLEtBQUssS0FBSyxJQUFJLENBQUMsSUFBSSxDQUFDLE1BQU0sR0FBRyxDQUFDLEVBQUUsQ0FBQztZQUNuQyxJQUFJLENBQUMsSUFBSSxDQUFDLEdBQUcsRUFBRSxDQUFDO1lBQ2hCLE9BQU8sSUFBSSxDQUFDO1FBQ2QsQ0FBQztRQUVELE1BQU0sUUFBUSxHQUFHLElBQUksQ0FBQyxJQUFJLENBQUMsR0FBRyxFQUFHLENBQUM7UUFDbEMsSUFBSSxDQUFDLElBQUksQ0FBQyxLQUFLLENBQUMsR0FBRyxRQUFRLENBQUM7UUFFNUIsSUFBSSxJQUFJLENBQUMsTUFBTSxJQUFJLElBQUksQ0FBQyxVQUFVLEVBQUUsQ0FBQztZQUNuQyxJQUFJLENBQUMsTUFBTSxDQUFDLEdBQUcsQ0FBQyxJQUFJLENBQUMsVUFBVSxDQUFDLFFBQVEsQ0FBQyxFQUFFLEtBQUssQ0FBQyxDQUFDO1FBQ3BELENBQUM7UUFFRCx3QkFBd0I7UUFDeEIsTUFBTSxXQUFXLEdBQUcsSUFBSSxDQUFDLEtBQUssQ0FBQyxDQUFDLEtBQUssR0FBRyxDQUFDLENBQUMsR0FBRyxDQUFDLENBQUMsQ0FBQztRQUNoRCxJQUFJLFdBQVcsSUFBSSxDQUFDLElBQUksSUFBSSxDQUFDLFNBQVMsQ0FBQyxJQUFJLENBQUMsSUFBSSxDQUFDLEtBQUssQ0FBQyxFQUFFLElBQUksQ0FBQyxJQUFJLENBQUMsV0FBVyxDQUFDLENBQUMsR0FBRyxDQUFDLEVBQUUsQ0FBQztZQUNyRixJQUFJLENBQUMsUUFBUSxDQUFDLEtBQUssQ0FBQyxDQUFDO1FBQ3ZCLENBQUM7YUFBTSxDQUFDO1lBQ04sSUFBSSxDQUFDLFVBQVUsQ0FBQyxLQUFLLENBQUMsQ0FBQztRQUN6QixDQUFDO1FBRUQsT0FBTyxJQUFJLENBQUM7SUFDZCxDQUFDO0lBRUQ7O09BRUc7SUFDSyxRQUFRLENBQUMsS0FBYTtRQUM1QixPQUFPLEtBQUssR0FBRyxDQUFDLEVBQUUsQ0FBQztZQUNqQixNQUFNLFdBQVcsR0FBRyxJQUFJLENBQUMsS0FBSyxDQUFDLENBQUMsS0FBSyxHQUFHLENBQUMsQ0FBQyxHQUFHLENBQUMsQ0FBQyxDQUFDO1lBRWhELElBQUksSUFBSSxDQUFDLFNBQVMsQ0FBQyxJQUFJLENBQUMsSUFBSSxDQUFDLEtBQUssQ0FBQyxFQUFFLElBQUksQ0FBQyxJQUFJLENBQUMsV0FBVyxDQUFDLENBQUMsSUFBSSxDQUFDLEVBQUUsQ0FBQztnQkFDbEUsTUFBTTtZQUNSLENBQUM7WUFFRCxJQUFJLENBQUMsSUFBSSxDQUFDLEtBQUssRUFBRSxXQUFXLENBQUMsQ0FBQztZQUM5QixLQUFLLEdBQUcsV0FBVyxDQUFDO1FBQ3RCLENBQUM7SUFDSCxDQUFDO0lBRUQ7O09BRUc7SUFDSyxVQUFVLENBQUMsS0FBYTtRQUM5QixNQUFNLE1BQU0sR0FBRyxJQUFJLENBQUMsSUFBSSxDQUFDLE1BQU0sQ0FBQztRQUVoQyxPQUFPLElBQUksRUFBRSxDQUFDO1lBQ1osTUFBTSxTQUFTLEdBQUcsQ0FBQyxHQUFHLEtBQUssR0FBRyxDQUFDLENBQUM7WUFDaEMsTUFBTSxVQUFVLEdBQUcsQ0FBQyxHQUFHLEtBQUssR0FBRyxDQUFDLENBQUM7WUFDakMsSUFBSSxRQUFRLEdBQUcsS0FBSyxDQUFDO1lBRXJCLElBQUksU0FBUyxHQUFHLE1BQU07Z0JBQ2xCLElBQUksQ0FBQyxTQUFTLENBQUMsSUFBSSxDQUFDLElBQUksQ0FBQyxTQUFTLENBQUMsRUFBRSxJQUFJLENBQUMsSUFBSSxDQUFDLFFBQVEsQ0FBQyxDQUFDLEdBQUcsQ0FBQyxFQUFFLENBQUM7Z0JBQ2xFLFFBQVEsR0FBRyxTQUFTLENBQUM7WUFDdkIsQ0FBQztZQUVELElBQUksVUFBVSxHQUFHLE1BQU07Z0JBQ25CLElBQUksQ0FBQyxTQUFTLENBQUMsSUFBSSxDQUFDLElBQUksQ0FBQyxVQUFVLENBQUMsRUFBRSxJQUFJLENBQUMsSUFBSSxDQUFDLFFBQVEsQ0FBQyxDQUFDLEdBQUcsQ0FBQyxFQUFFLENBQUM7Z0JBQ25FLFFBQVEsR0FBRyxVQUFVLENBQUM7WUFDeEIsQ0FBQztZQUVELElBQUksUUFBUSxLQUFLLEtBQUs7Z0JBQUUsTUFBTTtZQUU5QixJQUFJLENBQUMsSUFBSSxDQUFDLEtBQUssRUFBRSxRQUFRLENBQUMsQ0FBQztZQUMzQixLQUFLLEdBQUcsUUFBUSxDQUFDO1FBQ25CLENBQUM7SUFDSCxDQUFDO0lBRUQ7O09BRUc7SUFDSyxJQUFJLENBQUMsQ0FBUyxFQUFFLENBQVM7UUFDL0IsTUFBTSxJQUFJLEdBQUcsSUFBSSxDQUFDLElBQUksQ0FBQyxDQUFDLENBQUMsQ0FBQztRQUMxQixJQUFJLENBQUMsSUFBSSxDQUFDLENBQUMsQ0FBQyxHQUFHLElBQUksQ0FBQyxJQUFJLENBQUMsQ0FBQyxDQUFDLENBQUM7UUFDNUIsSUFBSSxDQUFDLElBQUksQ0FBQyxDQUFDLENBQUMsR0FBRyxJQUFJLENBQUM7UUFFcEIsSUFBSSxJQUFJLENBQUMsTUFBTSxJQUFJLElBQUksQ0FBQyxVQUFVLEVBQUUsQ0FBQztZQUNuQyxJQUFJLENBQUMsTUFBTSxDQUFDLEdBQUcsQ0FBQyxJQUFJLENBQUMsVUFBVSxDQUFDLElBQUksQ0FBQyxJQUFJLENBQUMsQ0FBQyxDQUFDLENBQUMsRUFBRSxDQUFDLENBQUMsQ0FBQztZQUNsRCxJQUFJLENBQUMsTUFBTSxDQUFDLEdBQUcsQ0FBQyxJQUFJLENBQUMsVUFBVSxDQUFDLElBQUksQ0FBQyxJQUFJLENBQUMsQ0FBQyxDQUFDLENBQUMsRUFBRSxDQUFDLENBQUMsQ0FBQztRQUNwRCxDQUFDO0lBQ0gsQ0FBQztDQUNGIn0=

package/dist_ts/core/utils/enhanced-connection-pool.d.ts

@@ -1,110 +0,0 @@
-import { LifecycleComponent } from './lifecycle-component.js';
-/**
- * Interface for pooled connection
- */
-export interface IPooledConnection<T> {
-    id: string;
-    connection: T;
-    createdAt: number;
-    lastUsedAt: number;
-    useCount: number;
-    inUse: boolean;
-    metadata?: any;
-}
-/**
- * Configuration options for the connection pool
- */
-export interface IConnectionPoolOptions<T> {
-    minSize?: number;
-    maxSize?: number;
-    acquireTimeout?: number;
-    idleTimeout?: number;
-    maxUseCount?: number;
-    validateOnAcquire?: boolean;
-    validateOnReturn?: boolean;
-    queueTimeout?: number;
-    connectionFactory: () => Promise<T>;
-    connectionValidator?: (connection: T) => Promise<boolean>;
-    connectionDestroyer?: (connection: T) => Promise<void>;
-    onConnectionError?: (error: Error, connection?: T) => void;
-}
-/**
- * Enhanced connection pool with priority queue, backpressure, and lifecycle management
- */
-export declare class EnhancedConnectionPool<T> extends LifecycleComponent {
-    private readonly options;
-    private readonly availableConnections;
-    private readonly activeConnections;
-    private readonly waitQueue;
-    private readonly mutex;
-    private readonly eventEmitter;
-    private connectionIdCounter;
-    private requestIdCounter;
-    private isClosing;
-    private metrics;
-    constructor(options: IConnectionPoolOptions<T>);
-    /**
-     * Initialize minimum number of connections
-     */
-    private initializeMinConnections;
-    /**
-     * Start maintenance timer for idle connection cleanup
-     */
-    private startMaintenance;
-    /**
-     * Perform maintenance tasks
-     */
-    private performMaintenance;
-    /**
-     * Acquire a connection from the pool
-     */
-    acquire(priority?: number, timeout?: number): Promise<IPooledConnection<T>>;
-    /**
-     * Try to acquire an available connection
-     */
-    private tryAcquireConnection;
-    /**
-     * Checkout a connection for use
-     */
-    private checkoutConnection;
-    /**
-     * Queue an acquire request
-     */
-    private queueAcquireRequest;
-    /**
-     * Release a connection back to the pool
-     */
-    release(connection: IPooledConnection<T>): Promise<void>;
-    /**
-     * Create a new connection
-     */
-    private createConnection;
-    /**
-     * Destroy a connection
-     */
-    private destroyConnection;
-    /**
-     * Get current pool statistics
-     */
-    getStats(): {
-        connectionsCreated: number;
-        connectionsDestroyed: number;
-        connectionsAcquired: number;
-        connectionsReleased: number;
-        acquireTimeouts: number;
-        validationFailures: number;
-        queueHighWaterMark: number;
-        available: number;
-        active: number;
-        waiting: number;
-        total: number;
-    };
-    /**
-     * Subscribe to pool events
-     */
-    on(event: string, listener: Function): void;
-    /**
-     * Close the pool and cleanup resources
-     */
-    protected onCleanup(): Promise<void>;
-}