@signaltree/enterprise 4.0.16 → 4.1.0

package/src/lib/enterprise-enhancer.js

@@ -1,78 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.withEnterprise = withEnterprise;
-const path_index_1 = require("./path-index");
-const update_engine_1 = require("./update-engine");
-/**
- * Enterprise-grade optimizations for large-scale applications.
- *
- * **Includes:**
- * - Diff-based updates (only update changed signals)
- * - Bulk operation optimization (2-5x faster)
- * - Advanced change tracking
- * - Update statistics and monitoring
- *
- * **Use when:**
- * - 500+ signals in state tree
- * - Bulk updates at high frequency (60Hz+)
- * - Real-time dashboards or data feeds
- * - Enterprise-scale applications
- *
- * **Skip when:**
- * - Small to medium apps (<100 signals)
- * - Infrequent state updates
- * - Startup/prototype projects
- *
- * **Bundle cost:** +2.4KB gzipped
- * **Performance gain:** 2-5x faster bulk updates, detailed monitoring
- *
- * @example
- * ```typescript
- * import { signalTree } from '@signaltree/core';
- * import { withEnterprise } from '@signaltree/enterprise';
- *
- * const tree = signalTree(largeState).with(withEnterprise());
- *
- * // Now available: optimized bulk updates
- * const result = tree.updateOptimized(newData, {
- *   ignoreArrayOrder: true,
- *   maxDepth: 10
- * });
- *
- * console.log(result.stats);
- * // { totalChanges: 45, adds: 10, updates: 30, deletes: 5 }
- * ```
- *
- * @public
- */
-function withEnterprise() {
-    return (tree) => {
-        // Lazy initialization - only create when first needed
-        let pathIndex = null;
-        let updateEngine = null;
-        // Type assertion to access SignalTree properties
-        const signalTree = tree;
-        // Cast tree to enhanced type for safe property assignment
-        const enhancedTree = tree;
-        // Add updateOptimized method to tree
-        enhancedTree.updateOptimized = (updates, options) => {
-            // Lazy initialize on first use
-            if (!updateEngine) {
-                pathIndex = new path_index_1.PathIndex();
-                pathIndex.buildFromTree(signalTree.state);
-                updateEngine = new update_engine_1.OptimizedUpdateEngine(signalTree.state);
-            }
-            const result = updateEngine.update(signalTree.state, updates, options);
-            // Rebuild index if changes were made
-            if (result.changed && result.stats && pathIndex) {
-                pathIndex.clear();
-                pathIndex.buildFromTree(signalTree.state);
-            }
-            return result;
-        };
-        // Add PathIndex access for debugging/monitoring
-        enhancedTree.getPathIndex = () => pathIndex;
-        return enhancedTree;
-    };
-}
-//# sourceMappingURL=enterprise-enhancer.js.map

package/src/lib/enterprise-enhancer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"enterprise-enhancer.js","sourceRoot":"","sources":["../../../../../packages/enterprise/src/lib/enterprise-enhancer.ts"],"names":[],"mappings":";;AA+CA,wCAiDC;AAhGD,6CAAyC;AACzC,mDAAsE;AAItE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAyCG;AACH,SAAgB,cAAc;IAI5B,OAAO,CAAC,IAAO,EAAiC,EAAE;QAChD,sDAAsD;QACtD,IAAI,SAAS,GAAsC,IAAI,CAAC;QACxD,IAAI,YAAY,GAAiC,IAAI,CAAC;QAEtD,iDAAiD;QACjD,MAAM,UAAU,GAAG,IAAqC,CAAC;QAEzD,0DAA0D;QAC1D,MAAM,YAAY,GAAG,IAAqC,CAAC;QAE3D,qCAAqC;QACrC,YAAY,CAAC,eAAe,GAAG,CAC7B,OAAmB,EACnB,OAMC,EACa,EAAE;YAChB,+BAA+B;YAC/B,IAAI,CAAC,YAAY,EAAE,CAAC;gBAClB,SAAS,GAAG,IAAI,sBAAS,EAAmB,CAAC;gBAC7C,SAAS,CAAC,aAAa,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;gBAC1C,YAAY,GAAG,IAAI,qCAAqB,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAC7D,CAAC;YAED,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC,UAAU,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;YAEvE,qCAAqC;YACrC,IAAI,MAAM,CAAC,OAAO,IAAI,MAAM,CAAC,KAAK,IAAI,SAAS,EAAE,CAAC;gBAChD,SAAS,CAAC,KAAK,EAAE,CAAC;gBAClB,SAAS,CAAC,aAAa,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAC5C,CAAC;YAED,OAAO,MAAM,CAAC;QAChB,CAAC,CAAC;QAEF,gDAAgD;QAChD,YAAY,CAAC,YAAY,GAAG,GAAG,EAAE,CAAC,SAAS,CAAC;QAE5C,OAAO,YAAY,CAAC;IACtB,CAAC,CAAC;AACJ,CAAC"}

package/src/lib/enterprise.js

@@ -1,7 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.enterprise = enterprise;
-function enterprise() {
-    return 'enterprise';
-}
-//# sourceMappingURL=enterprise.js.map

package/src/lib/enterprise.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"enterprise.js","sourceRoot":"","sources":["../../../../../packages/enterprise/src/lib/enterprise.ts"],"names":[],"mappings":";;AAAA,gCAEC;AAFD,SAAgB,UAAU;IACxB,OAAO,YAAY,CAAC;AACtB,CAAC"}

package/src/lib/path-index.js

@@ -1,265 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.PathIndex = void 0;
-const core_1 = require("@angular/core");
-/**
- * Node in the Trie structure
- */
-class TrieNode {
-    constructor() {
-        this.value = null;
-        this.children = new Map();
-    }
-}
-/**
- * PathIndex
- *
- * Fast signal lookup using a Trie (prefix tree) data structure.
- * Provides O(k) lookup time where k is the path length, regardless of total signals.
- *
- * Features:
- * - Trie-based indexing for O(k) lookup
- * - WeakRef caching for memory efficiency
- * - Automatic cleanup of stale references
- * - Prefix matching for batch operations
- * - Path normalization
- *
- * @example
- * ```ts
- * const index = new PathIndex();
- *
- * // Index signals
- * index.set(['user', 'name'], nameSignal);
- * index.set(['user', 'email'], emailSignal);
- *
- * // Fast lookup
- * const signal = index.get(['user', 'name']);
- *
- * // Prefix matching
- * const userSignals = index.getByPrefix(['user']);
- * // Returns: { name: nameSignal, email: emailSignal }
- *
- * // Check if path exists
- * if (index.has(['user', 'name'])) {
- *   // ...
- * }
- * ```
- */
-// eslint-disable-next-line @typescript-eslint/no-explicit-any
-class PathIndex {
-    constructor() {
-        this.root = new TrieNode();
-        this.pathCache = new Map();
-        this.stats = {
-            hits: 0,
-            misses: 0,
-            sets: 0,
-            cleanups: 0,
-        };
-    }
-    /**
-     * Set a value at the given path
-     *
-     * @param path - Path segments
-     * @param value - Value to store
-     */
-    set(path, signal) {
-        const pathStr = this.pathToString(path);
-        const ref = new WeakRef(signal);
-        // Update trie
-        let node = this.root;
-        for (const segment of path) {
-            const key = String(segment);
-            if (!node.children.has(key)) {
-                node.children.set(key, new TrieNode());
-            }
-            const nextNode = node.children.get(key);
-            if (!nextNode) {
-                throw new Error(`Failed to get node for key: ${key}`);
-            }
-            node = nextNode;
-        }
-        node.value = ref;
-        // Update cache for fast string lookups
-        this.pathCache.set(pathStr, ref);
-        this.stats.sets++;
-    }
-    /**
-     * Get value at the given path
-     *
-     * @param path - Path segments
-     * @returns Value if found and not GC'd, null otherwise
-     */
-    get(path) {
-        const pathStr = this.pathToString(path);
-        // Try cache first
-        const cached = this.pathCache.get(pathStr);
-        if (cached) {
-            const value = cached.deref();
-            if (value) {
-                this.stats.hits++;
-                return value;
-            }
-            // Clean up dead reference
-            this.pathCache.delete(pathStr);
-            this.stats.cleanups++;
-        }
-        // Try trie
-        let node = this.root;
-        for (const segment of path) {
-            const key = String(segment);
-            node = node.children.get(key);
-            if (!node) {
-                this.stats.misses++;
-                return null;
-            }
-        }
-        if (node.value) {
-            const value = node.value.deref();
-            if (value) {
-                // Re-cache for next time
-                this.pathCache.set(pathStr, node.value);
-                this.stats.hits++;
-                return value;
-            }
-            // Clean up dead reference
-            node.value = null;
-            this.stats.cleanups++;
-        }
-        this.stats.misses++;
-        return null;
-    }
-    /**
-     * Check if path exists in index
-     *
-     * @param path - Path segments
-     * @returns True if path exists and value is not GC'd
-     */
-    has(path) {
-        return this.get(path) !== null;
-    }
-    /**
-     * Get all values matching a prefix
-     *
-     * @param prefix - Path prefix
-     * @returns Map of relative paths to values
-     */
-    getByPrefix(prefix) {
-        const results = new Map();
-        // Find the node at prefix
-        let node = this.root;
-        for (const segment of prefix) {
-            const key = String(segment);
-            node = node.children.get(key);
-            if (!node) {
-                return results; // Empty map
-            }
-        }
-        // Collect all descendants
-        this.collectDescendants(node, [], results);
-        return results;
-    }
-    /**
-     * Delete value at path
-     *
-     * @param path - Path segments
-     * @returns True if deleted, false if not found
-     */
-    delete(path) {
-        const pathStr = this.pathToString(path);
-        // Remove from cache
-        this.pathCache.delete(pathStr);
-        // Remove from trie
-        let node = this.root;
-        const nodes = [node];
-        for (const segment of path) {
-            const key = String(segment);
-            node = node.children.get(key);
-            if (!node) {
-                return false;
-            }
-            nodes.push(node);
-        }
-        // Clear value
-        const hadValue = node.value !== null;
-        node.value = null;
-        // Clean up empty nodes (from leaf to root)
-        for (let i = nodes.length - 1; i > 0; i--) {
-            const current = nodes[i];
-            if (current.value === null && current.children.size === 0) {
-                const parent = nodes[i - 1];
-                const segment = path[i - 1];
-                parent.children.delete(String(segment));
-            }
-            else {
-                break; // Stop if node has value or children
-            }
-        }
-        return hadValue;
-    }
-    /**
-     * Clear all entries
-     */
-    clear() {
-        this.root = new TrieNode();
-        this.pathCache.clear();
-    }
-    /**
-     * Get statistics
-     *
-     * @returns Index statistics
-     */
-    getStats() {
-        const total = this.stats.hits + this.stats.misses;
-        const hitRate = total > 0 ? this.stats.hits / total : 0;
-        return Object.assign(Object.assign({}, this.stats), { hitRate, cacheSize: this.pathCache.size });
-    }
-    /**
-     * Build index from a tree structure
-     *
-     * @param tree - Tree object to index
-     * @param path - Current path (for recursion)
-     */
-    buildFromTree(tree, path = []) {
-        if (!tree) {
-            return;
-        }
-        // Check if it's a signal using Angular's isSignal
-        if ((0, core_1.isSignal)(tree)) {
-            this.set(path, tree);
-            return;
-        }
-        // Only continue if it's an object (not a signal or primitive)
-        if (typeof tree !== 'object') {
-            return;
-        }
-        // Recursively index children
-        for (const [key, value] of Object.entries(tree)) {
-            this.buildFromTree(value, [...path, key]);
-        }
-    }
-    /**
-     * Convert path to string for caching
-     */
-    pathToString(path) {
-        return path.join('.');
-    }
-    /**
-     * Collect all descendant values recursively
-     */
-    collectDescendants(node, currentPath, results) {
-        // Add current node's value if it exists
-        if (node.value) {
-            const value = node.value.deref();
-            if (value) {
-                results.set(this.pathToString(currentPath), value);
-            }
-        }
-        // Recursively collect children
-        for (const [key, child] of node.children) {
-            this.collectDescendants(child, [...currentPath, key], results);
-        }
-    }
-}
-exports.PathIndex = PathIndex;
-//# sourceMappingURL=path-index.js.map

package/src/lib/path-index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"path-index.js","sourceRoot":"","sources":["../../../../../packages/enterprise/src/lib/path-index.ts"],"names":[],"mappings":";;;AAAA,wCAAyC;AAmBzC;;GAEG;AACH,MAAM,QAAQ;IAAd;QACE,UAAK,GAAa,IAAI,CAAC;QACvB,aAAQ,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC5C,CAAC;CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AACH,8DAA8D;AAC9D,MAAa,SAAS;IAAtB;QACU,SAAI,GAAG,IAAI,QAAQ,EAAc,CAAC;QAClC,cAAS,GAAG,IAAI,GAAG,EAAsB,CAAC;QAC1C,UAAK,GAAG;YACd,IAAI,EAAE,CAAC;YACP,MAAM,EAAE,CAAC;YACT,IAAI,EAAE,CAAC;YACP,QAAQ,EAAE,CAAC;SACZ,CAAC;IAyPJ,CAAC;IAvPC;;;;;OAKG;IACH,GAAG,CAAC,IAAU,EAAE,MAAS;QACvB,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QACxC,MAAM,GAAG,GAAG,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC;QAEhC,cAAc;QACd,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACrB,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;YAC3B,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;YAC5B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC5B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,QAAQ,EAAc,CAAC,CAAC;YACrD,CAAC;YACD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACxC,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,MAAM,IAAI,KAAK,CAAC,+BAA+B,GAAG,EAAE,CAAC,CAAC;YACxD,CAAC;YACD,IAAI,GAAG,QAAQ,CAAC;QAClB,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC;QAEjB,uCAAuC;QACvC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;QAEjC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;IACpB,CAAC;IAED;;;;;OAKG;IACH,GAAG,CAAC,IAAU;QACZ,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QAExC,kBAAkB;QAClB,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC3C,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;YAC7B,IAAI,KAAK,EAAE,CAAC;gBACV,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;gBAClB,OAAO,KAAK,CAAC;YACf,CAAC;YACD,0BAA0B;YAC1B,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAC/B,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;QACxB,CAAC;QAED,WAAW;QACX,IAAI,IAAI,GAAqC,IAAI,CAAC,IAAI,CAAC;QACvD,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;YAC3B,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;YAC5B,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC9B,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;gBACpB,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QAED,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;YACjC,IAAI,KAAK,EAAE,CAAC;gBACV,yBAAyB;gBACzB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;gBACxC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;gBAClB,OAAO,KAAK,CAAC;YACf,CAAC;YACD,0BAA0B;YAC1B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;YAClB,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;QACxB,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QACpB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;OAKG;IACH,GAAG,CAAC,IAAU;QACZ,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC;IACjC,CAAC;IAED;;;;;OAKG;IACH,WAAW,CAAC,MAAY;QACtB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAa,CAAC;QAErC,0BAA0B;QAC1B,IAAI,IAAI,GAAqC,IAAI,CAAC,IAAI,CAAC;QACvD,KAAK,MAAM,OAAO,IAAI,MAAM,EAAE,CAAC;YAC7B,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;YAC5B,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC9B,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,OAAO,OAAO,CAAC,CAAC,YAAY;YAC9B,CAAC;QACH,CAAC;QAED,0BAA0B;QAC1B,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC;QAE3C,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,IAAU;QACf,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QAExC,oBAAoB;QACpB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAE/B,mBAAmB;QACnB,IAAI,IAAI,GAAqC,IAAI,CAAC,IAAI,CAAC;QACvD,MAAM,KAAK,GAA2B,CAAC,IAAI,CAAC,CAAC;QAE7C,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;YAC3B,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;YAC5B,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC9B,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,OAAO,KAAK,CAAC;YACf,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;QAED,cAAc;QACd,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC;QACrC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAElB,2CAA2C;QAC3C,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,OAAO,CAAC,KAAK,KAAK,IAAI,IAAI,OAAO,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBAC1D,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC5B,MAAM,OAAO,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC5B,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;YAC1C,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,qCAAqC;YAC9C,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,IAAI,GAAG,IAAI,QAAQ,EAAc,CAAC;QACvC,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;IACzB,CAAC;IAED;;;;OAIG;IACH,QAAQ;QAQN,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAClD,MAAM,OAAO,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAExD,uCACK,IAAI,CAAC,KAAK,KACb,OAAO,EACP,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,IAC9B;IACJ,CAAC;IAED;;;;;OAKG;IACH,aAAa,CAAC,IAAa,EAAE,OAAa,EAAE;QAC1C,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO;QACT,CAAC;QAED,kDAAkD;QAClD,IAAI,IAAA,eAAQ,EAAC,IAAI,CAAC,EAAE,CAAC;YACnB,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAS,CAAC,CAAC;YAC1B,OAAO;QACT,CAAC;QAED,8DAA8D;QAC9D,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC7B,OAAO;QACT,CAAC;QAED,6BAA6B;QAC7B,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YAChD,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC;IAED;;OAEG;IACK,YAAY,CAAC,IAAU;QAC7B,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACxB,CAAC;IAED;;OAEG;IACK,kBAAkB,CACxB,IAA0B,EAC1B,WAA0B,EAC1B,OAAuB;QAEvB,wCAAwC;QACxC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;YACjC,IAAI,KAAK,EAAE,CAAC;gBACV,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,EAAE,KAAK,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;QAED,+BAA+B;QAC/B,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACzC,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,CAAC,GAAG,WAAW,EAAE,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC;QACjE,CAAC;IACH,CAAC;CACF;AAjQD,8BAiQC"}

package/src/lib/scheduler.js

@@ -1,25 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.postTask = postTask;
-const tslib_1 = require("tslib");
-const q = [];
-function postTask(t) {
-    q.push(t);
-    if (q.length === 1)
-        flush();
-}
-function flush() {
-    return tslib_1.__awaiter(this, void 0, void 0, function* () {
-        while (q.length) {
-            const t = q.shift();
-            try {
-                t();
-            }
-            catch (e) {
-                console.error('[EnterpriseScheduler]', e);
-            }
-            yield Promise.resolve();
-        }
-    });
-}
-//# sourceMappingURL=scheduler.js.map

package/src/lib/scheduler.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"scheduler.js","sourceRoot":"","sources":["../../../../../packages/enterprise/src/lib/scheduler.ts"],"names":[],"mappings":";;AAIA,4BAGC;;AALD,MAAM,CAAC,GAAW,EAAE,CAAC;AAErB,SAAgB,QAAQ,CAAC,CAAO;IAC9B,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACV,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,KAAK,EAAE,CAAC;AAC9B,CAAC;AAED,SAAe,KAAK;;QAClB,OAAO,CAAC,CAAC,MAAM,EAAE,CAAC;YAChB,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAG,CAAC;YACrB,IAAI,CAAC;gBAAC,CAAC,EAAE,CAAC;YAAC,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBAAC,OAAO,CAAC,KAAK,CAAC,uBAAuB,EAAE,CAAC,CAAC,CAAC;YAAC,CAAC;YACrE,MAAM,OAAO,CAAC,OAAO,EAAE,CAAC;QAC1B,CAAC;IACH,CAAC;CAAA"}

package/src/lib/thread-pools.js

@@ -1,14 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.createMockPool = createMockPool;
-const tslib_1 = require("tslib");
-function createMockPool() {
-    return {
-        run(fn, ...args) {
-            return tslib_1.__awaiter(this, void 0, void 0, function* () {
-                return fn(...args);
-            });
-        }
-    };
-}
-//# sourceMappingURL=thread-pools.js.map

package/src/lib/thread-pools.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"thread-pools.js","sourceRoot":"","sources":["../../../../../packages/enterprise/src/lib/thread-pools.ts"],"names":[],"mappings":";;AAIA,wCAMC;;AAND,SAAgB,cAAc;IAC5B,OAAO;QACC,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI;;gBACnB,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;YACrB,CAAC;SAAA;KACF,CAAC;AACJ,CAAC"}