@signaltree/enterprise 4.0.3 → 4.0.6

package/src/lib/update-engine.js

@@ -0,0 +1,287 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.OptimizedUpdateEngine = void 0;
+const core_1 = require("@angular/core");
+const diff_engine_1 = require("./diff-engine");
+const path_index_1 = require("./path-index");
+/**
+ * OptimizedUpdateEngine
+ *
+ * High-performance update engine using path indexing and diffing to minimize
+ * unnecessary signal updates.
+ *
+ * Features:
+ * - Diff-based updates (only update what changed)
+ * - Path indexing for O(k) lookups
+ * - Automatic batching for large updates
+ * - Priority-based patch ordering
+ * - Skip unchanged values
+ *
+ * @example
+ * ```ts
+ * const tree = signalTree(data, { useLazySignals: true });
+ * const engine = new OptimizedUpdateEngine(tree);
+ *
+ * // Optimized update - only changes what's different
+ * const result = engine.update({
+ *   user: { name: 'Alice' } // Only updates if name changed
+ * });
+ *
+ * console.log(result.changedPaths); // ['user.name']
+ * console.log(result.duration); // ~2ms
+ * ```
+ */
+class OptimizedUpdateEngine {
+    constructor(tree) {
+        this.pathIndex = new path_index_1.PathIndex();
+        this.diffEngine = new diff_engine_1.DiffEngine();
+        // Build initial index
+        this.pathIndex.buildFromTree(tree);
+    }
+    /**
+     * Update tree with optimizations
+     *
+     * @param tree - Current tree state
+     * @param updates - Updates to apply
+     * @param options - Update options
+     * @returns Update result
+     */
+    update(tree, updates, options = {}) {
+        const startTime = performance.now();
+        // Step 1: Generate diff to find actual changes
+        const diffOptions = {};
+        if (options.maxDepth !== undefined)
+            diffOptions.maxDepth = options.maxDepth;
+        if (options.ignoreArrayOrder !== undefined)
+            diffOptions.ignoreArrayOrder = options.ignoreArrayOrder;
+        if (options.equalityFn !== undefined)
+            diffOptions.equalityFn = options.equalityFn;
+        const diff = this.diffEngine.diff(tree, updates, diffOptions);
+        if (diff.changes.length === 0) {
+            // No actual changes, skip update entirely
+            return {
+                changed: false,
+                duration: performance.now() - startTime,
+                changedPaths: [],
+            };
+        }
+        // Step 2: Convert diff to optimized patches
+        const patches = this.createPatches(diff.changes);
+        // Step 3: Sort patches for optimal application order
+        const sortedPatches = this.sortPatches(patches);
+        // Step 4: Apply patches with optional batching
+        const result = options.batch
+            ? this.batchApplyPatches(tree, sortedPatches, options.batchSize)
+            : this.applyPatches(tree, sortedPatches);
+        const duration = performance.now() - startTime;
+        return {
+            changed: true,
+            duration,
+            changedPaths: result.appliedPaths,
+            stats: {
+                totalPaths: diff.changes.length,
+                optimizedPaths: patches.length,
+                batchedUpdates: result.batchCount,
+            },
+        };
+    }
+    /**
+     * Rebuild path index from current tree state
+     *
+     * @param tree - Current tree
+     */
+    rebuildIndex(tree) {
+        this.pathIndex.clear();
+        this.pathIndex.buildFromTree(tree);
+    }
+    /**
+     * Get path index statistics
+     */
+    getIndexStats() {
+        return this.pathIndex.getStats();
+    }
+    /**
+     * Creates optimized patches from diff changes
+     */
+    createPatches(changes) {
+        const patches = [];
+        const processedPaths = new Set();
+        for (const change of changes) {
+            const pathStr = change.path.join('.');
+            // Skip if parent path already processed (optimization)
+            let skipPath = false;
+            for (const processed of processedPaths) {
+                if (pathStr.startsWith(processed + '.')) {
+                    skipPath = true;
+                    break;
+                }
+            }
+            if (skipPath) {
+                continue;
+            }
+            // Create patch based on change type
+            const patch = this.createPatch(change);
+            patches.push(patch);
+            // Mark path as processed
+            processedPaths.add(pathStr);
+            // If this is an object replacement, skip child paths
+            if (change.type === diff_engine_1.ChangeType.REPLACE &&
+                typeof change.value === 'object') {
+                processedPaths.add(pathStr);
+            }
+        }
+        return patches;
+    }
+    /**
+     * Creates a single patch from a change
+     */
+    createPatch(change) {
+        return {
+            type: change.type,
+            path: change.path,
+            value: change.value,
+            oldValue: change.oldValue,
+            priority: this.calculatePriority(change),
+            signal: this.pathIndex.get(change.path),
+        };
+    }
+    /**
+     * Calculates update priority for optimal ordering
+     */
+    calculatePriority(change) {
+        let priority = 0;
+        // Shallow updates have higher priority
+        priority += (10 - change.path.length) * 10;
+        // Array updates have lower priority (more expensive)
+        if (change.path.some((p) => typeof p === 'number')) {
+            priority -= 20;
+        }
+        // Replace operations have higher priority than nested updates
+        if (change.type === diff_engine_1.ChangeType.REPLACE) {
+            priority += 30;
+        }
+        return priority;
+    }
+    /**
+     * Sorts patches for optimal application
+     */
+    sortPatches(patches) {
+        return patches.sort((a, b) => {
+            // Sort by priority (higher first)
+            if (a.priority !== b.priority) {
+                return b.priority - a.priority;
+            }
+            // Then by path depth (shallow first)
+            return a.path.length - b.path.length;
+        });
+    }
+    /**
+     * Applies patches directly (no batching)
+     */
+    applyPatches(tree, patches) {
+        const appliedPaths = [];
+        let updateCount = 0;
+        for (const patch of patches) {
+            if (this.applyPatch(patch, tree)) {
+                appliedPaths.push(patch.path.join('.'));
+                updateCount++;
+            }
+        }
+        return {
+            appliedPaths,
+            updateCount,
+            batchCount: 1,
+        };
+    }
+    /**
+     * Applies patches with batching for better performance
+     */
+    batchApplyPatches(tree, patches, batchSize = 50) {
+        const batches = [];
+        for (let i = 0; i < patches.length; i += batchSize) {
+            batches.push(patches.slice(i, i + batchSize));
+        }
+        const appliedPaths = [];
+        let updateCount = 0;
+        // Process patches in batches
+        for (const currentBatch of batches) {
+            for (const patch of currentBatch) {
+                if (this.applyPatch(patch, tree)) {
+                    appliedPaths.push(patch.path.join('.'));
+                    updateCount++;
+                }
+            }
+        }
+        return {
+            appliedPaths,
+            updateCount,
+            batchCount: batches.length,
+        };
+    }
+    /**
+     * Applies a single patch to the tree object
+     */
+    applyPatch(patch, tree) {
+        try {
+            // First, try to update via signal if available
+            if (patch.signal && (0, core_1.isSignal)(patch.signal) && 'set' in patch.signal) {
+                const currentValue = patch.signal();
+                // Only update if value actually changed
+                if (this.isEqual(currentValue, patch.value)) {
+                    return false;
+                }
+                // Update the signal - this will handle reactivity
+                patch.signal.set(patch.value);
+                // After successful ADD, update the index
+                if (patch.type === diff_engine_1.ChangeType.ADD && patch.value !== undefined) {
+                    this.pathIndex.set(patch.path, patch.signal);
+                }
+                return true;
+            } // Fallback: Navigate to parent object and update directly
+            let current = tree;
+            for (let i = 0; i < patch.path.length - 1; i++) {
+                const key = patch.path[i];
+                current = current[key];
+                if (!current || typeof current !== 'object') {
+                    return false;
+                }
+            }
+            const lastKey = patch.path[patch.path.length - 1];
+            // Only update if value actually changed
+            if (this.isEqual(current[lastKey], patch.value)) {
+                return false;
+            }
+            // Apply update directly to object
+            current[lastKey] = patch.value;
+            return true;
+        }
+        catch (error) {
+            console.error(`Failed to apply patch at ${patch.path.join('.')}:`, error);
+            return false;
+        }
+    }
+    /**
+     * Check equality
+     */
+    isEqual(a, b) {
+        // Fast path for primitives
+        if (a === b) {
+            return true;
+        }
+        if (typeof a !== typeof b) {
+            return false;
+        }
+        if (typeof a !== 'object' || a === null || b === null) {
+            return false;
+        }
+        // Deep equality for objects (simple version)
+        try {
+            return JSON.stringify(a) === JSON.stringify(b);
+        }
+        catch (_a) {
+            return false;
+        }
+    }
+}
+exports.OptimizedUpdateEngine = OptimizedUpdateEngine;
+//# sourceMappingURL=update-engine.js.map

package/src/lib/update-engine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"update-engine.js","sourceRoot":"","sources":["../../../../../packages/enterprise/src/lib/update-engine.ts"],"names":[],"mappings":";;;AAAA,wCAAyC;AAEzC,+CAAuD;AACvD,6CAAyC;AA8DzC;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,MAAa,qBAAqB;IAIhC,YAAY,IAAa;QACvB,IAAI,CAAC,SAAS,GAAG,IAAI,sBAAS,EAAE,CAAC;QACjC,IAAI,CAAC,UAAU,GAAG,IAAI,wBAAU,EAAE,CAAC;QAEnC,sBAAsB;QACtB,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC;IAED;;;;;;;OAOG;IACH,MAAM,CACJ,IAAa,EACb,OAAgB,EAChB,UAAyB,EAAE;QAE3B,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QAEpC,+CAA+C;QAC/C,MAAM,WAAW,GAAyB,EAAE,CAAC;QAC7C,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS;YAAE,WAAW,CAAC,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC;QAC5E,IAAI,OAAO,CAAC,gBAAgB,KAAK,SAAS;YACxC,WAAW,CAAC,gBAAgB,GAAG,OAAO,CAAC,gBAAgB,CAAC;QAC1D,IAAI,OAAO,CAAC,UAAU,KAAK,SAAS;YAClC,WAAW,CAAC,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC;QAE9C,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC;QAE9D,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC9B,0CAA0C;YAC1C,OAAO;gBACL,OAAO,EAAE,KAAK;gBACd,QAAQ,EAAE,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS;gBACvC,YAAY,EAAE,EAAE;aACjB,CAAC;QACJ,CAAC;QAED,4CAA4C;QAC5C,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAEjD,qDAAqD;QACrD,MAAM,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QAEhD,+CAA+C;QAC/C,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK;YAC1B,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,aAAa,EAAE,OAAO,CAAC,SAAS,CAAC;YAChE,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;QAE3C,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QAE/C,OAAO;YACL,OAAO,EAAE,IAAI;YACb,QAAQ;YACR,YAAY,EAAE,MAAM,CAAC,YAAY;YACjC,KAAK,EAAE;gBACL,UAAU,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM;gBAC/B,cAAc,EAAE,OAAO,CAAC,MAAM;gBAC9B,cAAc,EAAE,MAAM,CAAC,UAAU;aAClC;SACF,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,YAAY,CAAC,IAAa;QACxB,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;QACvB,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC;IAED;;OAEG;IACH,aAAa;QACX,OAAO,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC;IACnC,CAAC;IAED;;OAEG;IACK,aAAa,CAAC,OAAiB;QACrC,MAAM,OAAO,GAAY,EAAE,CAAC;QAC5B,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QAEzC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAEtC,uDAAuD;YACvD,IAAI,QAAQ,GAAG,KAAK,CAAC;YACrB,KAAK,MAAM,SAAS,IAAI,cAAc,EAAE,CAAC;gBACvC,IAAI,OAAO,CAAC,UAAU,CAAC,SAAS,GAAG,GAAG,CAAC,EAAE,CAAC;oBACxC,QAAQ,GAAG,IAAI,CAAC;oBAChB,MAAM;gBACR,CAAC;YACH,CAAC;YAED,IAAI,QAAQ,EAAE,CAAC;gBACb,SAAS;YACX,CAAC;YAED,oCAAoC;YACpC,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YACvC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAEpB,yBAAyB;YACzB,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAE5B,qDAAqD;YACrD,IACE,MAAM,CAAC,IAAI,KAAK,wBAAU,CAAC,OAAO;gBAClC,OAAO,MAAM,CAAC,KAAK,KAAK,QAAQ,EAChC,CAAC;gBACD,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,MAAc;QAChC,OAAO;YACL,IAAI,EAAE,MAAM,CAAC,IAAI;YACjB,IAAI,EAAE,MAAM,CAAC,IAAI;YACjB,KAAK,EAAE,MAAM,CAAC,KAAK;YACnB,QAAQ,EAAE,MAAM,CAAC,QAAQ;YACzB,QAAQ,EAAE,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC;YACxC,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC;SACxC,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,MAAc;QACtC,IAAI,QAAQ,GAAG,CAAC,CAAC;QAEjB,uCAAuC;QACvC,QAAQ,IAAI,CAAC,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;QAE3C,qDAAqD;QACrD,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,EAAE,CAAC;YACnD,QAAQ,IAAI,EAAE,CAAC;QACjB,CAAC;QAED,8DAA8D;QAC9D,IAAI,MAAM,CAAC,IAAI,KAAK,wBAAU,CAAC,OAAO,EAAE,CAAC;YACvC,QAAQ,IAAI,EAAE,CAAC;QACjB,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,OAAgB;QAClC,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAC3B,kCAAkC;YAClC,IAAI,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;gBAC9B,OAAO,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;YACjC,CAAC;YAED,qCAAqC;YACrC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;QACvC,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACK,YAAY,CAAC,IAAa,EAAE,OAAgB;QAClD,MAAM,YAAY,GAAa,EAAE,CAAC;QAClC,IAAI,WAAW,GAAG,CAAC,CAAC;QAEpB,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;gBACjC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;gBACxC,WAAW,EAAE,CAAC;YAChB,CAAC;QACH,CAAC;QAED,OAAO;YACL,YAAY;YACZ,WAAW;YACX,UAAU,EAAE,CAAC;SACd,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,iBAAiB,CACvB,IAAa,EACb,OAAgB,EAChB,SAAS,GAAG,EAAE;QAEd,MAAM,OAAO,GAAc,EAAE,CAAC;QAE9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC;YACnD,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;QAChD,CAAC;QAED,MAAM,YAAY,GAAa,EAAE,CAAC;QAClC,IAAI,WAAW,GAAG,CAAC,CAAC;QAEpB,6BAA6B;QAC7B,KAAK,MAAM,YAAY,IAAI,OAAO,EAAE,CAAC;YACnC,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;gBACjC,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;oBACjC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;oBACxC,WAAW,EAAE,CAAC;gBAChB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO;YACL,YAAY;YACZ,WAAW;YACX,UAAU,EAAE,OAAO,CAAC,MAAM;SAC3B,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,KAAY,EAAE,IAAa;QAC5C,IAAI,CAAC;YACH,+CAA+C;YAC/C,IAAI,KAAK,CAAC,MAAM,IAAI,IAAA,eAAQ,EAAC,KAAK,CAAC,MAAM,CAAC,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;gBACpE,MAAM,YAAY,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;gBAEpC,wCAAwC;gBACxC,IAAI,IAAI,CAAC,OAAO,CAAC,YAAY,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC5C,OAAO,KAAK,CAAC;gBACf,CAAC;gBAED,kDAAkD;gBACjD,KAAK,CAAC,MAAkC,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;gBAE3D,yCAAyC;gBACzC,IAAI,KAAK,CAAC,IAAI,KAAK,wBAAU,CAAC,GAAG,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;oBAC/D,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;gBAC/C,CAAC;gBAED,OAAO,IAAI,CAAC;YACd,CAAC,CAAC,0DAA0D;YAC5D,IAAI,OAAO,GAA4B,IAA+B,CAAC;YACvE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/C,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC1B,OAAO,GAAG,OAAO,CAAC,GAAG,CAA4B,CAAC;gBAClD,IAAI,CAAC,OAAO,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE,CAAC;oBAC5C,OAAO,KAAK,CAAC;gBACf,CAAC;YACH,CAAC;YAED,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAElD,wCAAwC;YACxC,IAAI,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;gBAChD,OAAO,KAAK,CAAC;YACf,CAAC;YAED,kCAAkC;YAClC,OAAO,CAAC,OAAO,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;YAC/B,OAAO,IAAI,CAAC;QACd,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,KAAK,CAAC,4BAA4B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAC1E,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IACD;;OAEG;IACK,OAAO,CAAC,CAAU,EAAE,CAAU;QACpC,2BAA2B;QAC3B,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,OAAO,CAAC,KAAK,OAAO,CAAC,EAAE,CAAC;YAC1B,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;YACtD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,6CAA6C;QAC7C,IAAI,CAAC;YACH,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC;QAAC,WAAM,CAAC;YACP,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;CACF;AAlTD,sDAkTC"}

package/src/test-setup.d.ts

@@ -0,0 +1 @@
+export {};

package/src/test-setup.js

@@ -0,0 +1,8 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const zone_1 = require("jest-preset-angular/setup-env/zone");
+(0, zone_1.setupZoneTestEnv)({
+    errorOnUnknownElements: true,
+    errorOnUnknownProperties: true,
+});
+//# sourceMappingURL=test-setup.js.map

package/src/test-setup.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"test-setup.js","sourceRoot":"","sources":["../../../../packages/enterprise/src/test-setup.ts"],"names":[],"mappings":";;AAAA,6DAAsE;AAEtE,IAAA,uBAAgB,EAAC;IACf,sBAAsB,EAAE,IAAI;IAC5B,wBAAwB,EAAE,IAAI;CAC/B,CAAC,CAAC"}

package/README.md

@@ -1,203 +0,0 @@
-# @signaltree/enterprise
-
-Enterprise-grade optimizations for SignalTree. Designed for large-scale applications with 500+ signals and high-frequency bulk updates.
-
-## Features
-
-- **Diff-based updates** - Only update signals that actually changed
-- **Bulk operation optimization** - 2-5x faster for large state updates
-- **Advanced change tracking** - Detailed statistics and monitoring
-- **Path indexing** - Optimized signal lookup for large trees
-- **Lazy initialization** - Zero overhead until first use
-
-## Installation
-
-```bash
-npm install @signaltree/core @signaltree/enterprise
-```
-
-## Quick Start
-
-```typescript
-import { signalTree } from '@signaltree/core';
-import { withEnterprise } from '@signaltree/enterprise';
-
-const tree = signalTree(largeState).with(withEnterprise());
-
-// Use optimized bulk updates
-const result = tree.updateOptimized(newData, {
-  ignoreArrayOrder: true,
-  maxDepth: 10,
-});
-
-console.log(result.stats);
-// { totalChanges: 45, adds: 10, updates: 30, deletes: 5 }
-```
-
-## When to Use
-
-### ✅ Use @signaltree/enterprise when:
-
-- You have 500+ signals in your state tree
-- Bulk updates happen at high frequency (60Hz+)
-- You need real-time dashboards or data feeds
-- You're building enterprise-scale applications
-- You need detailed update monitoring and statistics
-
-### ❌ Skip @signaltree/enterprise when:
-
-- Small to medium apps (<100 signals)
-- Infrequent state updates
-- Startup/prototype projects
-- Bundle size is critical (adds +2.4KB gzipped)
-
-## API
-
-### `withEnterprise()`
-
-Enhancer that adds enterprise optimizations to a SignalTree.
-
-```typescript
-import { signalTree } from '@signaltree/core';
-import { withEnterprise } from '@signaltree/enterprise';
-
-const tree = signalTree(initialState).with(withEnterprise());
-```
-
-### `tree.updateOptimized(updates, options?)`
-
-Performs optimized bulk updates using diff-based change detection.
-
-**Parameters:**
-
-- `updates: Partial<T>` - The new state values
-- `options?: UpdateOptions` - Configuration options
-
-**Options:**
-
-```typescript
-{
-  maxDepth?: number;              // Maximum depth to traverse (default: 100)
-  ignoreArrayOrder?: boolean;     // Ignore array element order (default: false)
-  equalityFn?: (a, b) => boolean; // Custom equality function
-  autoBatch?: boolean;            // Automatically batch updates (default: true)
-  batchSize?: number;             // Patches per batch (default: 10)
-}
-```
-
-**Returns:**
-
-```typescript
-{
-  changed: boolean; // Whether any changes were made
-  stats: {
-    totalChanges: number; // Total number of changes
-    adds: number; // New properties added
-    updates: number; // Properties updated
-    deletes: number; // Properties deleted
-  }
-}
-```
-
-### `tree.getPathIndex()`
-
-Get the PathIndex for debugging/monitoring. Returns `null` if `updateOptimized` hasn't been called yet (lazy initialization).
-
-```typescript
-const index = tree.getPathIndex();
-if (index) {
-  console.log('Path index active');
-}
-```
-
-## Examples
-
-### Real-time Dashboard
-
-```typescript
-import { signalTree } from '@signaltree/core';
-import { withEnterprise } from '@signaltree/enterprise';
-
-interface DashboardState {
-  metrics: Record<string, number>;
-  alerts: Alert[];
-  users: User[];
-  // ... hundreds more properties
-}
-
-const dashboard = signalTree<DashboardState>(initialState).with(withEnterprise());
-
-// High-frequency updates from WebSocket
-socket.on('metrics', (newMetrics) => {
-  const result = dashboard.updateOptimized({ metrics: newMetrics }, { ignoreArrayOrder: true });
-
-  console.log(`Updated ${result.stats.updates} metrics`);
-});
-```
-
-### Data Grid with Bulk Operations
-
-```typescript
-import { signalTree } from '@signaltree/core';
-import { withEnterprise } from '@signaltree/enterprise';
-
-const grid = signalTree({
-  rows: [] as GridRow[],
-  columns: [] as GridColumn[],
-  filters: {} as FilterState,
-  selection: new Set<string>(),
-}).with(withEnterprise());
-
-// Bulk update from API
-async function loadData() {
-  const data = await fetchGridData();
-
-  const result = grid.updateOptimized(data, {
-    maxDepth: 5,
-    autoBatch: true,
-  });
-
-  console.log(`Loaded ${result.stats.adds} rows in bulk`);
-}
-```
-
-### Custom Equality for Complex Objects
-
-```typescript
-const tree = signalTree(complexState).with(withEnterprise());
-
-tree.updateOptimized(newState, {
-  equalityFn: (a, b) => {
-    // Custom deep equality for specific object types
-    if (a instanceof Date && b instanceof Date) {
-      return a.getTime() === b.getTime();
-    }
-    return a === b;
-  },
-});
-```
-
-## Performance
-
-**Bundle Size:**
-
-- Adds +2.4KB gzipped to your bundle
-- Zero overhead until first `updateOptimized()` call (lazy initialization)
-
-**Performance Gains:**
-
-- 2-5x faster for bulk updates on large state trees
-- Scales efficiently with tree depth and complexity
-- Minimal memory overhead with path indexing
-
-## License
-
-Business Source License 1.1 (BSL-1.1) - See [LICENSE](../../LICENSE) for details.
-
-Converts to MIT license on the Change Date specified in the license.
-
-## Related Packages
-
-- [@signaltree/core](../core) - Core SignalTree functionality
-- [@signaltree/ng-forms](../ng-forms) - Angular forms integration
-- [@signaltree/callable-syntax](../callable-syntax) - Callable syntax transform