@drop-ai/core 0.2.0 → 0.3.1

package/dist/audio/engine/RoutingGraph.js

@@ -0,0 +1,436 @@
+import { Signal } from '../../lib/Signal';
+export class RoutingGraph {
+    constructor() {
+        this._nodes = new Map();
+        this.graphChanged = new Signal();
+        this.feedbackDetected = new Signal();
+    }
+    // ─── Node management ────────────────────────────────────────────────────
+    /**
+     * Add a node to the graph.
+     * If a node with the same ID already exists, it is updated in place.
+     */
+    addNode(id, name, type) {
+        const existing = this._nodes.get(id);
+        if (existing) {
+            existing.name = name;
+            existing.type = type;
+        }
+        else {
+            this._nodes.set(id, {
+                id,
+                name,
+                type,
+                inputs: new Set(),
+                outputs: new Set(),
+                processed: false,
+                depth: 0,
+            });
+        }
+        this.graphChanged.emit();
+    }
+    /**
+     * Remove a node and all edges that reference it.
+     */
+    removeNode(id) {
+        const node = this._nodes.get(id);
+        if (!node)
+            return;
+        // Remove this node from the inputs/outputs of all connected nodes
+        for (const outputId of node.outputs) {
+            const target = this._nodes.get(outputId);
+            if (target)
+                target.inputs.delete(id);
+        }
+        for (const inputId of node.inputs) {
+            const source = this._nodes.get(inputId);
+            if (source)
+                source.outputs.delete(id);
+        }
+        this._nodes.delete(id);
+        this.graphChanged.emit();
+    }
+    // ─── Edge management ────────────────────────────────────────────────────
+    /**
+     * Add a directed edge from one node to another.
+     * Both nodes must already exist in the graph.
+     */
+    addEdge(fromId, toId) {
+        const from = this._nodes.get(fromId);
+        const to = this._nodes.get(toId);
+        if (!from || !to)
+            return;
+        from.outputs.add(toId);
+        to.inputs.add(fromId);
+        this.graphChanged.emit();
+    }
+    /**
+     * Remove a directed edge between two nodes.
+     */
+    removeEdge(fromId, toId) {
+        const from = this._nodes.get(fromId);
+        const to = this._nodes.get(toId);
+        if (!from || !to)
+            return;
+        from.outputs.delete(toId);
+        to.inputs.delete(fromId);
+        this.graphChanged.emit();
+    }
+    // ─── Bulk rebuild ───────────────────────────────────────────────────────
+    /**
+     * Rebuild the entire graph from session state.
+     * Clears all existing nodes/edges and reconstructs from the provided
+     * track descriptors. Typically called after bulk routing changes.
+     */
+    rebuild(tracks) {
+        this._nodes.clear();
+        // First pass: create all nodes
+        for (const track of tracks) {
+            this._nodes.set(track.id, {
+                id: track.id,
+                name: track.name,
+                type: track.type,
+                inputs: new Set(),
+                outputs: new Set(),
+                processed: false,
+                depth: 0,
+            });
+        }
+        // Second pass: wire up edges
+        for (const track of tracks) {
+            const from = this._nodes.get(track.id);
+            if (!from)
+                continue;
+            // Direct output (e.g. track -> master bus)
+            if (track.outputTarget && this._nodes.has(track.outputTarget)) {
+                from.outputs.add(track.outputTarget);
+                this._nodes.get(track.outputTarget).inputs.add(track.id);
+            }
+            // Send connections (e.g. track -> aux bus)
+            for (const sendTarget of track.sendTargets) {
+                if (this._nodes.has(sendTarget)) {
+                    from.outputs.add(sendTarget);
+                    this._nodes.get(sendTarget).inputs.add(track.id);
+                }
+            }
+        }
+        // Compute node depths
+        this._computeDepths();
+        // Detect feedback loops and emit signals for any found
+        const loops = this.detectFeedback();
+        for (const loop of loops) {
+            this.feedbackDetected.emit(loop);
+        }
+        this.graphChanged.emit();
+    }
+    // ─── Topological sort (Kahn's algorithm) ────────────────────────────────
+    /**
+     * Compute a valid processing order using Kahn's algorithm for
+     * topological sorting. Leaf nodes (no inputs) are processed first,
+     * working upward to the master bus.
+     *
+     * If cycles exist, the returned order will be incomplete (nodes
+     * involved in cycles are omitted). Use detectFeedback() to identify
+     * those cycles.
+     *
+     * @returns An array of node IDs in processing order.
+     */
+    getProcessingOrder() {
+        // Build a working copy of in-degree counts
+        const inDegree = new Map();
+        for (const [id, node] of this._nodes) {
+            inDegree.set(id, node.inputs.size);
+        }
+        // Seed the queue with all nodes that have zero in-degree (leaf nodes)
+        const queue = [];
+        for (const [id, degree] of inDegree) {
+            if (degree === 0) {
+                queue.push(id);
+            }
+        }
+        const order = [];
+        while (queue.length > 0) {
+            const current = queue.shift();
+            order.push(current);
+            const node = this._nodes.get(current);
+            if (!node)
+                continue;
+            // For each outgoing edge, reduce the in-degree of the target
+            for (const outputId of node.outputs) {
+                const deg = inDegree.get(outputId);
+                if (deg === undefined)
+                    continue;
+                const newDeg = deg - 1;
+                inDegree.set(outputId, newDeg);
+                if (newDeg === 0) {
+                    queue.push(outputId);
+                }
+            }
+        }
+        return order;
+    }
+    // ─── Feedback detection (DFS cycle detection) ───────────────────────────
+    /**
+     * Detect all feedback loops (cycles) in the graph using DFS.
+     * Returns an array of FeedbackLoop descriptors, each containing the
+     * ordered path of node IDs that form the cycle.
+     */
+    detectFeedback() {
+        const loops = [];
+        // Track visited state: 'unvisited', 'visiting' (on current DFS stack), 'visited'
+        const state = new Map();
+        for (const id of this._nodes.keys()) {
+            state.set(id, 'unvisited');
+        }
+        // DFS path stack for reconstructing cycle paths
+        const pathStack = [];
+        const pathSet = new Set(); // fast lookup for cycle extraction
+        const dfs = (nodeId) => {
+            state.set(nodeId, 'visiting');
+            pathStack.push(nodeId);
+            pathSet.add(nodeId);
+            const node = this._nodes.get(nodeId);
+            if (node) {
+                for (const neighborId of node.outputs) {
+                    const neighborState = state.get(neighborId);
+                    if (neighborState === 'visiting' && pathSet.has(neighborId)) {
+                        // Found a cycle - extract the cycle path from the stack
+                        const cycleStartIdx = pathStack.indexOf(neighborId);
+                        const cyclePath = pathStack.slice(cycleStartIdx);
+                        // Close the cycle by appending the start node
+                        cyclePath.push(neighborId);
+                        const nodeNames = cyclePath.map(id => {
+                            const n = this._nodes.get(id);
+                            return n ? n.name : id;
+                        });
+                        loops.push({
+                            path: cyclePath,
+                            description: `Feedback loop: ${nodeNames.join(' -> ')}`,
+                        });
+                    }
+                    else if (neighborState === 'unvisited') {
+                        dfs(neighborId);
+                    }
+                }
+            }
+            pathStack.pop();
+            pathSet.delete(nodeId);
+            state.set(nodeId, 'visited');
+        };
+        for (const id of this._nodes.keys()) {
+            if (state.get(id) === 'unvisited') {
+                dfs(id);
+            }
+        }
+        return loops;
+    }
+    // ─── Reachability queries ───────────────────────────────────────────────
+    /**
+     * Check whether route A feeds (directly or indirectly) into route B.
+     * Uses BFS from A, following output edges, to determine reachability.
+     */
+    feeds(fromId, toId) {
+        if (fromId === toId)
+            return false;
+        if (!this._nodes.has(fromId) || !this._nodes.has(toId))
+            return false;
+        const visited = new Set();
+        const queue = [fromId];
+        visited.add(fromId);
+        while (queue.length > 0) {
+            const current = queue.shift();
+            const node = this._nodes.get(current);
+            if (!node)
+                continue;
+            for (const outputId of node.outputs) {
+                if (outputId === toId)
+                    return true;
+                if (!visited.has(outputId)) {
+                    visited.add(outputId);
+                    queue.push(outputId);
+                }
+            }
+        }
+        return false;
+    }
+    /**
+     * Check whether route A directly feeds into route B (single hop).
+     */
+    directFeeds(fromId, toId) {
+        const from = this._nodes.get(fromId);
+        if (!from)
+            return false;
+        return from.outputs.has(toId);
+    }
+    /**
+     * Get all routes that feed (directly or indirectly) into the given route.
+     * Traverses backward from the target, following input edges via BFS.
+     */
+    getUpstream(nodeId) {
+        if (!this._nodes.has(nodeId))
+            return [];
+        const visited = new Set();
+        const queue = [nodeId];
+        visited.add(nodeId);
+        const upstream = [];
+        while (queue.length > 0) {
+            const current = queue.shift();
+            const node = this._nodes.get(current);
+            if (!node)
+                continue;
+            for (const inputId of node.inputs) {
+                if (!visited.has(inputId)) {
+                    visited.add(inputId);
+                    upstream.push(inputId);
+                    queue.push(inputId);
+                }
+            }
+        }
+        return upstream;
+    }
+    /**
+     * Get all routes that the given route feeds (directly or indirectly) into.
+     * Traverses forward from the source, following output edges via BFS.
+     */
+    getDownstream(nodeId) {
+        if (!this._nodes.has(nodeId))
+            return [];
+        const visited = new Set();
+        const queue = [nodeId];
+        visited.add(nodeId);
+        const downstream = [];
+        while (queue.length > 0) {
+            const current = queue.shift();
+            const node = this._nodes.get(current);
+            if (!node)
+                continue;
+            for (const outputId of node.outputs) {
+                if (!visited.has(outputId)) {
+                    visited.add(outputId);
+                    downstream.push(outputId);
+                    queue.push(outputId);
+                }
+            }
+        }
+        return downstream;
+    }
+    // ─── Parallel processing groups ─────────────────────────────────────────
+    /**
+     * Find groups of nodes that can be processed in parallel.
+     * Nodes at the same depth in the topological ordering have no
+     * dependencies on each other and can safely run concurrently.
+     *
+     * Uses a BFS-based level assignment: leaf nodes (in-degree 0) are
+     * at level 0, their consumers at level 1, and so on. Nodes at the
+     * same level form a parallel group.
+     *
+     * @returns An array of groups, where each group is an array of node IDs
+     *          that can be processed simultaneously. Groups are returned in
+     *          processing order (group 0 first, then group 1, etc.).
+     */
+    getParallelGroups() {
+        var _a;
+        // Compute levels using a variant of Kahn's algorithm that tracks depth
+        const inDegree = new Map();
+        const level = new Map();
+        for (const [id, node] of this._nodes) {
+            inDegree.set(id, node.inputs.size);
+            level.set(id, 0);
+        }
+        // Seed with zero in-degree nodes at level 0
+        const queue = [];
+        for (const [id, degree] of inDegree) {
+            if (degree === 0) {
+                queue.push(id);
+                level.set(id, 0);
+            }
+        }
+        const visited = new Set();
+        let maxLevel = 0;
+        while (queue.length > 0) {
+            const current = queue.shift();
+            visited.add(current);
+            const currentLevel = level.get(current);
+            const node = this._nodes.get(current);
+            if (!node)
+                continue;
+            for (const outputId of node.outputs) {
+                // The consumer's level is at least one more than this node's level
+                const newLevel = currentLevel + 1;
+                if (newLevel > ((_a = level.get(outputId)) !== null && _a !== void 0 ? _a : 0)) {
+                    level.set(outputId, newLevel);
+                }
+                if (newLevel > maxLevel) {
+                    maxLevel = newLevel;
+                }
+                const deg = inDegree.get(outputId);
+                if (deg === undefined)
+                    continue;
+                const newDeg = deg - 1;
+                inDegree.set(outputId, newDeg);
+                if (newDeg === 0) {
+                    queue.push(outputId);
+                }
+            }
+        }
+        // Collect nodes into groups by level
+        const groups = [];
+        for (let i = 0; i <= maxLevel; i++) {
+            groups.push([]);
+        }
+        for (const [id, lvl] of level) {
+            // Only include nodes that were reachable (part of the DAG portion)
+            if (visited.has(id)) {
+                groups[lvl].push(id);
+            }
+        }
+        // Filter out any empty groups (shouldn't happen, but be safe)
+        return groups.filter(g => g.length > 0);
+    }
+    // ─── Accessors ──────────────────────────────────────────────────────────
+    /**
+     * Get a single node by ID.
+     */
+    getNode(id) {
+        return this._nodes.get(id);
+    }
+    /**
+     * Get all nodes as a read-only array.
+     */
+    get nodes() {
+        return Array.from(this._nodes.values());
+    }
+    /**
+     * Clear all nodes and edges, resetting the graph to an empty state.
+     */
+    clear() {
+        this._nodes.clear();
+        this.graphChanged.emit();
+    }
+    // ─── Private helpers ────────────────────────────────────────────────────
+    /**
+     * Compute the depth of each node (longest path from any leaf to this node).
+     * Leaf nodes (no inputs) have depth 0. Used for parallel group assignment
+     * and rendering the graph visualization.
+     */
+    _computeDepths() {
+        // Reset depths
+        for (const node of this._nodes.values()) {
+            node.depth = 0;
+        }
+        // Use topological order to compute longest-path depths
+        const order = this.getProcessingOrder();
+        for (const id of order) {
+            const node = this._nodes.get(id);
+            if (!node)
+                continue;
+            for (const outputId of node.outputs) {
+                const target = this._nodes.get(outputId);
+                if (target) {
+                    target.depth = Math.max(target.depth, node.depth + 1);
+                }
+            }
+        }
+    }
+}
+//# sourceMappingURL=RoutingGraph.js.map

package/dist/audio/engine/RoutingGraph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"RoutingGraph.js","sourceRoot":"","sources":["../../../src/audio/engine/RoutingGraph.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAiC1C,MAAM,OAAO,YAAY;IAAzB;QACY,WAAM,GAA2B,IAAI,GAAG,EAAE,CAAC;QAEnC,iBAAY,GAAG,IAAI,MAAM,EAAQ,CAAC;QAClC,qBAAgB,GAAG,IAAI,MAAM,EAAgB,CAAC;IA0elE,CAAC;IAxeG,2EAA2E;IAE3E;;;OAGG;IACH,OAAO,CAAC,EAAU,EAAE,IAAY,EAAE,IAAuB;QACrD,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACrC,IAAI,QAAQ,EAAE,CAAC;YACX,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC;YACrB,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC;QACzB,CAAC;aAAM,CAAC;YACJ,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE;gBAChB,EAAE;gBACF,IAAI;gBACJ,IAAI;gBACJ,MAAM,EAAE,IAAI,GAAG,EAAE;gBACjB,OAAO,EAAE,IAAI,GAAG,EAAE;gBAClB,SAAS,EAAE,KAAK;gBAChB,KAAK,EAAE,CAAC;aACX,CAAC,CAAC;QACP,CAAC;QACD,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,EAAU;QACjB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI;YAAE,OAAO;QAElB,kEAAkE;QAClE,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAClC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACzC,IAAI,MAAM;gBAAE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACzC,CAAC;QACD,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACxC,IAAI,MAAM;gBAAE,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC1C,CAAC;QAED,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACvB,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;IAC7B,CAAC;IAED,2EAA2E;IAE3E;;;OAGG;IACH,OAAO,CAAC,MAAc,EAAE,IAAY;QAChC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACrC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE;YAAE,OAAO;QAEzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACvB,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACtB,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,MAAc,EAAE,IAAY;QACnC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACrC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE;YAAE,OAAO;QAEzB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC1B,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACzB,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;IAC7B,CAAC;IAED,2EAA2E;IAE3E;;;;OAIG;IACH,OAAO,CACH,MAME;QAEF,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QAEpB,+BAA+B;QAC/B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YACzB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE;gBACtB,EAAE,EAAE,KAAK,CAAC,EAAE;gBACZ,IAAI,EAAE,KAAK,CAAC,IAAI;gBAChB,IAAI,EAAE,KAAK,CAAC,IAAyB;gBACrC,MAAM,EAAE,IAAI,GAAG,EAAE;gBACjB,OAAO,EAAE,IAAI,GAAG,EAAE;gBAClB,SAAS,EAAE,KAAK;gBAChB,KAAK,EAAE,CAAC;aACX,CAAC,CAAC;QACP,CAAC;QAED,6BAA6B;QAC7B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACvC,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,2CAA2C;YAC3C,IAAI,KAAK,CAAC,YAAY,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,CAAC;gBAC5D,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;gBACrC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,YAAY,CAAE,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAC9D,CAAC;YAED,2CAA2C;YAC3C,KAAK,MAAM,UAAU,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;gBACzC,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC9B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;oBAC7B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBACtD,CAAC;YACL,CAAC;QACL,CAAC;QAED,sBAAsB;QACtB,IAAI,CAAC,cAAc,EAAE,CAAC;QAEtB,uDAAuD;QACvD,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACpC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACvB,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,CAAC;QAED,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;IAC7B,CAAC;IAED,2EAA2E;IAE3E;;;;;;;;;;OAUG;IACH,kBAAkB;QACd,2CAA2C;QAC3C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACnC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,CAAC;QAED,sEAAsE;QACtE,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YAClC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;gBACf,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACnB,CAAC;QACL,CAAC;QAED,MAAM,KAAK,GAAa,EAAE,CAAC;QAE3B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC/B,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAEpB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACtC,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,6DAA6D;YAC7D,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBAClC,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBACnC,IAAI,GAAG,KAAK,SAAS;oBAAE,SAAS;gBAEhC,MAAM,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC;gBACvB,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;gBAC/B,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;oBACf,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACzB,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,2EAA2E;IAE3E;;;;OAIG;IACH,cAAc;QACV,MAAM,KAAK,GAAmB,EAAE,CAAC;QAEjC,iFAAiF;QACjF,MAAM,KAAK,GAAG,IAAI,GAAG,EAAgD,CAAC;QACtE,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;YAClC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC;QAC/B,CAAC;QAED,gDAAgD;QAChD,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC,CAAC,mCAAmC;QAEtE,MAAM,GAAG,GAAG,CAAC,MAAc,EAAQ,EAAE;YACjC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;YAC9B,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACvB,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAEpB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACrC,IAAI,IAAI,EAAE,CAAC;gBACP,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;oBACpC,MAAM,aAAa,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;oBAE5C,IAAI,aAAa,KAAK,UAAU,IAAI,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;wBAC1D,wDAAwD;wBACxD,MAAM,aAAa,GAAG,SAAS,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBACpD,MAAM,SAAS,GAAG,SAAS,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;wBACjD,8CAA8C;wBAC9C,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;wBAE3B,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;4BACjC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;4BAC9B,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;wBAC3B,CAAC,CAAC,CAAC;wBAEH,KAAK,CAAC,IAAI,CAAC;4BACP,IAAI,EAAE,SAAS;4BACf,WAAW,EAAE,kBAAkB,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;yBAC1D,CAAC,CAAC;oBACP,CAAC;yBAAM,IAAI,aAAa,KAAK,WAAW,EAAE,CAAC;wBACvC,GAAG,CAAC,UAAU,CAAC,CAAC;oBACpB,CAAC;gBACL,CAAC;YACL,CAAC;YAED,SAAS,CAAC,GAAG,EAAE,CAAC;YAChB,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACvB,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QACjC,CAAC,CAAC;QAEF,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;YAClC,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,WAAW,EAAE,CAAC;gBAChC,GAAG,CAAC,EAAE,CAAC,CAAC;YACZ,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,2EAA2E;IAE3E;;;OAGG;IACH,KAAK,CAAC,MAAc,EAAE,IAAY;QAC9B,IAAI,MAAM,KAAK,IAAI;YAAE,OAAO,KAAK,CAAC;QAClC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAO,KAAK,CAAC;QAErE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAa,CAAC,MAAM,CAAC,CAAC;QACjC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAEpB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACtC,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBAClC,IAAI,QAAQ,KAAK,IAAI;oBAAE,OAAO,IAAI,CAAC;gBACnC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACzB,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBACtB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACzB,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,MAAc,EAAE,IAAY;QACpC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACrC,IAAI,CAAC,IAAI;YAAE,OAAO,KAAK,CAAC;QACxB,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IAED;;;OAGG;IACH,WAAW,CAAC,MAAc;QACtB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,OAAO,EAAE,CAAC;QAExC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAa,CAAC,MAAM,CAAC,CAAC;QACjC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpB,MAAM,QAAQ,GAAa,EAAE,CAAC;QAE9B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACtC,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBAChC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;oBACxB,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;oBACrB,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;oBACvB,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACxB,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,QAAQ,CAAC;IACpB,CAAC;IAED;;;OAGG;IACH,aAAa,CAAC,MAAc;QACxB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,OAAO,EAAE,CAAC;QAExC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAa,CAAC,MAAM,CAAC,CAAC;QACjC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpB,MAAM,UAAU,GAAa,EAAE,CAAC;QAEhC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACtC,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBAClC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACzB,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBACtB,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBAC1B,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACzB,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,UAAU,CAAC;IACtB,CAAC;IAED,2EAA2E;IAE3E;;;;;;;;;;;;OAYG;IACH,iBAAiB;;QACb,uEAAuE;QACvE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;QAExC,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACnC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACnC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACrB,CAAC;QAED,4CAA4C;QAC5C,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YAClC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;gBACf,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACf,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACrB,CAAC;QACL,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,IAAI,QAAQ,GAAG,CAAC,CAAC;QAEjB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC/B,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACrB,MAAM,YAAY,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC;YAEzC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACtC,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBAClC,mEAAmE;gBACnE,MAAM,QAAQ,GAAG,YAAY,GAAG,CAAC,CAAC;gBAClC,IAAI,QAAQ,GAAG,CAAC,MAAA,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,mCAAI,CAAC,CAAC,EAAE,CAAC;oBACxC,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;gBAClC,CAAC;gBACD,IAAI,QAAQ,GAAG,QAAQ,EAAE,CAAC;oBACtB,QAAQ,GAAG,QAAQ,CAAC;gBACxB,CAAC;gBAED,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBACnC,IAAI,GAAG,KAAK,SAAS;oBAAE,SAAS;gBAChC,MAAM,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC;gBACvB,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;gBAC/B,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;oBACf,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACzB,CAAC;YACL,CAAC;QACL,CAAC;QAED,qCAAqC;QACrC,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACpB,CAAC;QAED,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC;YAC5B,mEAAmE;YACnE,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBAClB,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACzB,CAAC;QACL,CAAC;QAED,8DAA8D;QAC9D,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5C,CAAC;IAED,2EAA2E;IAE3E;;OAEG;IACH,OAAO,CAAC,EAAU;QACd,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,IAAI,KAAK;QACL,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IAC5C,CAAC;IAED;;OAEG;IACH,KAAK;QACD,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACpB,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;IAC7B,CAAC;IAED,2EAA2E;IAE3E;;;;OAIG;IACK,cAAc;QAClB,eAAe;QACf,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;YACtC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACnB,CAAC;QAED,uDAAuD;QACvD,MAAM,KAAK,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;QACxC,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;YACrB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACjC,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBAClC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBACzC,IAAI,MAAM,EAAE,CAAC;oBACT,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAC1D,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;CACJ"}

package/dist/audio/engine/SidechainRouter.d.ts

@@ -0,0 +1,137 @@
+import { Signal } from '../../lib/Signal';
+import { SidechainConfig } from '../../domain/SidechainConfig';
+import { TrackId } from '../../domain/types';
+/**
+ * SidechainRouter manages the actual audio signal routing for sidechain connections.
+ *
+ * In the Web Audio context, sidechain routing works by:
+ * 1. Tapping the source track's audio output (pre or post fader)
+ * 2. Optionally applying a high-pass filter
+ * 3. Feeding it into the target processor's sidechain input
+ *
+ * The router maintains a buffer-per-config that holds the latest audio block
+ * from the source track, available for the target processor to read.
+ */
+export declare class SidechainRouter {
+    private _configs;
+    /** Buffer storage: configId -> latest audio block from source */
+    private _sidechainBuffers;
+    /** HPF filter state per config (one state per channel, keyed by configId) */
+    private _filterStates;
+    /** Sample rate used for HPF coefficient computation */
+    private _sampleRate;
+    readonly routingChanged: Signal<void>;
+    /**
+     * @param sampleRate - The audio sample rate (e.g. 44100, 48000)
+     */
+    constructor(sampleRate?: number);
+    /**
+     * Register a sidechain configuration.
+     * Initialises the buffer and filter state for the new config.
+     */
+    addConfig(config: SidechainConfig): void;
+    /**
+     * Remove a sidechain configuration and clean up its resources.
+     */
+    removeConfig(configId: string): void;
+    /**
+     * Get config by ID.
+     */
+    getConfig(configId: string): SidechainConfig | undefined;
+    /**
+     * Get all configs targeting a specific track.
+     */
+    getConfigsForTarget(trackId: TrackId): SidechainConfig[];
+    /**
+     * Get all configs sourcing from a specific track.
+     */
+    getConfigsForSource(trackId: TrackId): SidechainConfig[];
+    /**
+     * Called by the audio engine when a source track produces audio.
+     * Stores the audio block for later retrieval by target processors.
+     *
+     * For every config that sources from the given trackId, we copy the
+     * audio data into the config's sidechain buffer.
+     *
+     * @param trackId - The source track that just produced audio
+     * @param audioData - Per-channel audio data (e.g. [leftChannel, rightChannel])
+     * @param blockSize - Number of samples per channel in this block
+     */
+    feedSourceAudio(trackId: TrackId, audioData: Float32Array[], blockSize: number): void;
+    /**
+     * Called by the target processor to get the sidechain input.
+     * Returns the latest audio block from the source track (with optional HPF applied),
+     * or null if no valid data is available.
+     *
+     * @param configId - The sidechain configuration ID
+     * @returns Per-channel audio data, or null if unavailable
+     */
+    getSidechainInput(configId: string): Float32Array[] | null;
+    /**
+     * Apply a 2nd-order Butterworth high-pass filter to the sidechain signal.
+     * Processes in-place on copies of the input channels.
+     *
+     * The Butterworth HPF transfer function is implemented as a Direct Form I
+     * biquad filter: y[n] = b0*x[n] + b1*x[n-1] + b2*x[n-2] - a1*y[n-1] - a2*y[n-2]
+     */
+    private _applyHPF;
+    /**
+     * Rebuild the filter state for a given config.
+     * Called when the config is added or its filter parameters change.
+     */
+    private _rebuildFilterState;
+    /**
+     * Reset all buffers and filter states.
+     * Typically called when transport stops or seeks.
+     */
+    reset(): void;
+    /**
+     * Update the sample rate. Recomputes all HPF filter coefficients.
+     */
+    setSampleRate(sampleRate: number): void;
+}
+/**
+ * Biquad HPF state for the sidechain filter (Direct Form I).
+ * Stores both the filter coefficients and the delay-line state.
+ */
+interface BiquadFilterState {
+    /** Input delay line */
+    x1: number;
+    x2: number;
+    /** Output delay line */
+    y1: number;
+    y2: number;
+    /** Numerator (feedforward) coefficients */
+    b0: number;
+    b1: number;
+    b2: number;
+    /** Denominator (feedback) coefficients (negated convention: y = ... - a1*y1 - a2*y2) */
+    a1: number;
+    a2: number;
+}
+/**
+ * Compute the biquad filter coefficients for a 2nd-order Butterworth high-pass filter.
+ *
+ * Derivation from the analogue Butterworth prototype:
+ *   H(s) = s^2 / (s^2 + sqrt(2)*s + 1)
+ *
+ * Bilinear transform with pre-warping:
+ *   omega_c = 2 * pi * frequency / sampleRate
+ *   K = tan(omega_c / 2)
+ *   norm = 1 / (1 + sqrt(2)*K + K^2)
+ *
+ *   b0 = norm
+ *   b1 = -2 * norm
+ *   b2 = norm
+ *   a1 = 2 * (K^2 - 1) * norm
+ *   a2 = (1 - sqrt(2)*K + K^2) * norm
+ *
+ * The returned state has zeroed delay lines, ready for immediate use.
+ *
+ * @param frequency - HPF cutoff frequency in Hz
+ * @param sampleRate - Audio sample rate in Hz
+ * @returns A BiquadFilterState with computed coefficients and zeroed state
+ */
+export declare function computeHPFCoefficients(frequency: number, sampleRate: number): BiquadFilterState;
+export {};
+//# sourceMappingURL=SidechainRouter.d.ts.map

package/dist/audio/engine/SidechainRouter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"SidechainRouter.d.ts","sourceRoot":"","sources":["../../../src/audio/engine/SidechainRouter.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAC1C,OAAO,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AAC/D,OAAO,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAE7C;;;;;;;;;;GAUG;AACH,qBAAa,eAAe;IACxB,OAAO,CAAC,QAAQ,CAA2C;IAE3D,iEAAiE;IACjE,OAAO,CAAC,iBAAiB,CAA2C;IAEpE,6EAA6E;IAC7E,OAAO,CAAC,aAAa,CAA+C;IAEpE,uDAAuD;IACvD,OAAO,CAAC,WAAW,CAAS;IAE5B,SAAgB,cAAc,eAAsB;IAEpD;;OAEG;gBACS,UAAU,GAAE,MAAc;IAMtC;;;OAGG;IACH,SAAS,CAAC,MAAM,EAAE,eAAe,GAAG,IAAI;IAqBxC;;OAEG;IACH,YAAY,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI;IAUpC;;OAEG;IACH,SAAS,CAAC,QAAQ,EAAE,MAAM,GAAG,eAAe,GAAG,SAAS;IAIxD;;OAEG;IACH,mBAAmB,CAAC,OAAO,EAAE,OAAO,GAAG,eAAe,EAAE;IAUxD;;OAEG;IACH,mBAAmB,CAAC,OAAO,EAAE,OAAO,GAAG,eAAe,EAAE;IAYxD;;;;;;;;;;OAUG;IACH,eAAe,CAAC,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI;IAiCrF;;;;;;;OAOG;IACH,iBAAiB,CAAC,QAAQ,EAAE,MAAM,GAAG,YAAY,EAAE,GAAG,IAAI;IAsB1D;;;;;;OAMG;IACH,OAAO,CAAC,SAAS;IAsDjB;;;OAGG;IACH,OAAO,CAAC,mBAAmB;IAkB3B;;;OAGG;IACH,KAAK,IAAI,IAAI;IAoBb;;OAEG;IACH,aAAa,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI;CAM1C;AAcD;;;GAGG;AACH,UAAU,iBAAiB;IACvB,uBAAuB;IACvB,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,wBAAwB;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,2CAA2C;IAC3C,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,wFAAwF;IACxF,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;CACd;AAID;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,sBAAsB,CAClC,SAAS,EAAE,MAAM,EACjB,UAAU,EAAE,MAAM,GACnB,iBAAiB,CAyBnB"}