tone 14.8.27

package/build/esm/core/util/IntervalTimeline.d.ts

@@ -0,0 +1,106 @@
+import { Tone } from "../Tone";
+/**
+ * An IntervalTimeline event must have a time and duration
+ */
+export interface IntervalTimelineEvent {
+    time: number;
+    duration: number;
+    [propName: string]: any;
+}
+declare type IteratorCallback = (event: IntervalTimelineEvent) => void;
+/**
+ * Similar to Tone.Timeline, but all events represent
+ * intervals with both "time" and "duration" times. The
+ * events are placed in a tree structure optimized
+ * for querying an intersection point with the timeline
+ * events. Internally uses an [Interval Tree](https://en.wikipedia.org/wiki/Interval_tree)
+ * to represent the data.
+ */
+export declare class IntervalTimeline extends Tone {
+    readonly name: string;
+    /**
+     * The root node of the inteval tree
+     */
+    private _root;
+    /**
+     * Keep track of the length of the timeline.
+     */
+    private _length;
+    /**
+     * The event to add to the timeline. All events must
+     * have a time and duration value
+     * @param  event  The event to add to the timeline
+     */
+    add(event: IntervalTimelineEvent): this;
+    /**
+     * Remove an event from the timeline.
+     * @param  event  The event to remove from the timeline
+     */
+    remove(event: IntervalTimelineEvent): this;
+    /**
+     * The number of items in the timeline.
+     * @readOnly
+     */
+    get length(): number;
+    /**
+     * Remove events whose time time is after the given time
+     * @param  after  The time to query.
+     */
+    cancel(after: number): this;
+    /**
+     * Set the root node as the given node
+     */
+    private _setRoot;
+    /**
+     * Replace the references to the node in the node's parent
+     * with the replacement node.
+     */
+    private _replaceNodeInParent;
+    /**
+     * Remove the node from the tree and replace it with
+     * a successor which follows the schema.
+     */
+    private _removeNode;
+    /**
+     * Rotate the tree to the left
+     */
+    private _rotateLeft;
+    /**
+     * Rotate the tree to the right
+     */
+    private _rotateRight;
+    /**
+     * Balance the BST
+     */
+    private _rebalance;
+    /**
+     * Get an event whose time and duration span the give time. Will
+     * return the match whose "time" value is closest to the given time.
+     * @return  The event which spans the desired time
+     */
+    get(time: number): IntervalTimelineEvent | null;
+    /**
+     * Iterate over everything in the timeline.
+     * @param  callback The callback to invoke with every item
+     */
+    forEach(callback: IteratorCallback): this;
+    /**
+     * Iterate over everything in the array in which the given time
+     * overlaps with the time and duration time of the event.
+     * @param  time The time to check if items are overlapping
+     * @param  callback The callback to invoke with every item
+     */
+    forEachAtTime(time: number, callback: IteratorCallback): this;
+    /**
+     * Iterate over everything in the array in which the time is greater
+     * than or equal to the given time.
+     * @param  time The time to check if items are before
+     * @param  callback The callback to invoke with every item
+     */
+    forEachFrom(time: number, callback: IteratorCallback): this;
+    /**
+     * Clean up
+     */
+    dispose(): this;
+}
+export {};

package/build/esm/core/util/IntervalTimeline.js

@@ -0,0 +1,539 @@
+import { Tone } from "../Tone";
+import { isDefined } from "./TypeCheck";
+import { assert } from "./Debug";
+/**
+ * Similar to Tone.Timeline, but all events represent
+ * intervals with both "time" and "duration" times. The
+ * events are placed in a tree structure optimized
+ * for querying an intersection point with the timeline
+ * events. Internally uses an [Interval Tree](https://en.wikipedia.org/wiki/Interval_tree)
+ * to represent the data.
+ */
+export class IntervalTimeline extends Tone {
+    constructor() {
+        super(...arguments);
+        this.name = "IntervalTimeline";
+        /**
+         * The root node of the inteval tree
+         */
+        this._root = null;
+        /**
+         * Keep track of the length of the timeline.
+         */
+        this._length = 0;
+    }
+    /**
+     * The event to add to the timeline. All events must
+     * have a time and duration value
+     * @param  event  The event to add to the timeline
+     */
+    add(event) {
+        assert(isDefined(event.time), "Events must have a time property");
+        assert(isDefined(event.duration), "Events must have a duration parameter");
+        event.time = event.time.valueOf();
+        let node = new IntervalNode(event.time, event.time + event.duration, event);
+        if (this._root === null) {
+            this._root = node;
+        }
+        else {
+            this._root.insert(node);
+        }
+        this._length++;
+        // Restructure tree to be balanced
+        while (node !== null) {
+            node.updateHeight();
+            node.updateMax();
+            this._rebalance(node);
+            node = node.parent;
+        }
+        return this;
+    }
+    /**
+     * Remove an event from the timeline.
+     * @param  event  The event to remove from the timeline
+     */
+    remove(event) {
+        if (this._root !== null) {
+            const results = [];
+            this._root.search(event.time, results);
+            for (const node of results) {
+                if (node.event === event) {
+                    this._removeNode(node);
+                    this._length--;
+                    break;
+                }
+            }
+        }
+        return this;
+    }
+    /**
+     * The number of items in the timeline.
+     * @readOnly
+     */
+    get length() {
+        return this._length;
+    }
+    /**
+     * Remove events whose time time is after the given time
+     * @param  after  The time to query.
+     */
+    cancel(after) {
+        this.forEachFrom(after, event => this.remove(event));
+        return this;
+    }
+    /**
+     * Set the root node as the given node
+     */
+    _setRoot(node) {
+        this._root = node;
+        if (this._root !== null) {
+            this._root.parent = null;
+        }
+    }
+    /**
+     * Replace the references to the node in the node's parent
+     * with the replacement node.
+     */
+    _replaceNodeInParent(node, replacement) {
+        if (node.parent !== null) {
+            if (node.isLeftChild()) {
+                node.parent.left = replacement;
+            }
+            else {
+                node.parent.right = replacement;
+            }
+            this._rebalance(node.parent);
+        }
+        else {
+            this._setRoot(replacement);
+        }
+    }
+    /**
+     * Remove the node from the tree and replace it with
+     * a successor which follows the schema.
+     */
+    _removeNode(node) {
+        if (node.left === null && node.right === null) {
+            this._replaceNodeInParent(node, null);
+        }
+        else if (node.right === null) {
+            this._replaceNodeInParent(node, node.left);
+        }
+        else if (node.left === null) {
+            this._replaceNodeInParent(node, node.right);
+        }
+        else {
+            const balance = node.getBalance();
+            let replacement;
+            let temp = null;
+            if (balance > 0) {
+                if (node.left.right === null) {
+                    replacement = node.left;
+                    replacement.right = node.right;
+                    temp = replacement;
+                }
+                else {
+                    replacement = node.left.right;
+                    while (replacement.right !== null) {
+                        replacement = replacement.right;
+                    }
+                    if (replacement.parent) {
+                        replacement.parent.right = replacement.left;
+                        temp = replacement.parent;
+                        replacement.left = node.left;
+                        replacement.right = node.right;
+                    }
+                }
+            }
+            else if (node.right.left === null) {
+                replacement = node.right;
+                replacement.left = node.left;
+                temp = replacement;
+            }
+            else {
+                replacement = node.right.left;
+                while (replacement.left !== null) {
+                    replacement = replacement.left;
+                }
+                if (replacement.parent) {
+                    replacement.parent.left = replacement.right;
+                    temp = replacement.parent;
+                    replacement.left = node.left;
+                    replacement.right = node.right;
+                }
+            }
+            if (node.parent !== null) {
+                if (node.isLeftChild()) {
+                    node.parent.left = replacement;
+                }
+                else {
+                    node.parent.right = replacement;
+                }
+            }
+            else {
+                this._setRoot(replacement);
+            }
+            if (temp) {
+                this._rebalance(temp);
+            }
+        }
+        node.dispose();
+    }
+    /**
+     * Rotate the tree to the left
+     */
+    _rotateLeft(node) {
+        const parent = node.parent;
+        const isLeftChild = node.isLeftChild();
+        // Make node.right the new root of this sub tree (instead of node)
+        const pivotNode = node.right;
+        if (pivotNode) {
+            node.right = pivotNode.left;
+            pivotNode.left = node;
+        }
+        if (parent !== null) {
+            if (isLeftChild) {
+                parent.left = pivotNode;
+            }
+            else {
+                parent.right = pivotNode;
+            }
+        }
+        else {
+            this._setRoot(pivotNode);
+        }
+    }
+    /**
+     * Rotate the tree to the right
+     */
+    _rotateRight(node) {
+        const parent = node.parent;
+        const isLeftChild = node.isLeftChild();
+        // Make node.left the new root of this sub tree (instead of node)
+        const pivotNode = node.left;
+        if (pivotNode) {
+            node.left = pivotNode.right;
+            pivotNode.right = node;
+        }
+        if (parent !== null) {
+            if (isLeftChild) {
+                parent.left = pivotNode;
+            }
+            else {
+                parent.right = pivotNode;
+            }
+        }
+        else {
+            this._setRoot(pivotNode);
+        }
+    }
+    /**
+     * Balance the BST
+     */
+    _rebalance(node) {
+        const balance = node.getBalance();
+        if (balance > 1 && node.left) {
+            if (node.left.getBalance() < 0) {
+                this._rotateLeft(node.left);
+            }
+            else {
+                this._rotateRight(node);
+            }
+        }
+        else if (balance < -1 && node.right) {
+            if (node.right.getBalance() > 0) {
+                this._rotateRight(node.right);
+            }
+            else {
+                this._rotateLeft(node);
+            }
+        }
+    }
+    /**
+     * Get an event whose time and duration span the give time. Will
+     * return the match whose "time" value is closest to the given time.
+     * @return  The event which spans the desired time
+     */
+    get(time) {
+        if (this._root !== null) {
+            const results = [];
+            this._root.search(time, results);
+            if (results.length > 0) {
+                let max = results[0];
+                for (let i = 1; i < results.length; i++) {
+                    if (results[i].low > max.low) {
+                        max = results[i];
+                    }
+                }
+                return max.event;
+            }
+        }
+        return null;
+    }
+    /**
+     * Iterate over everything in the timeline.
+     * @param  callback The callback to invoke with every item
+     */
+    forEach(callback) {
+        if (this._root !== null) {
+            const allNodes = [];
+            this._root.traverse(node => allNodes.push(node));
+            allNodes.forEach(node => {
+                if (node.event) {
+                    callback(node.event);
+                }
+            });
+        }
+        return this;
+    }
+    /**
+     * Iterate over everything in the array in which the given time
+     * overlaps with the time and duration time of the event.
+     * @param  time The time to check if items are overlapping
+     * @param  callback The callback to invoke with every item
+     */
+    forEachAtTime(time, callback) {
+        if (this._root !== null) {
+            const results = [];
+            this._root.search(time, results);
+            results.forEach(node => {
+                if (node.event) {
+                    callback(node.event);
+                }
+            });
+        }
+        return this;
+    }
+    /**
+     * Iterate over everything in the array in which the time is greater
+     * than or equal to the given time.
+     * @param  time The time to check if items are before
+     * @param  callback The callback to invoke with every item
+     */
+    forEachFrom(time, callback) {
+        if (this._root !== null) {
+            const results = [];
+            this._root.searchAfter(time, results);
+            results.forEach(node => {
+                if (node.event) {
+                    callback(node.event);
+                }
+            });
+        }
+        return this;
+    }
+    /**
+     * Clean up
+     */
+    dispose() {
+        super.dispose();
+        if (this._root !== null) {
+            this._root.traverse(node => node.dispose());
+        }
+        this._root = null;
+        return this;
+    }
+}
+//-------------------------------------
+// 	INTERVAL NODE HELPER
+//-------------------------------------
+/**
+ * Represents a node in the binary search tree, with the addition
+ * of a "high" value which keeps track of the highest value of
+ * its children.
+ * References:
+ * https://brooknovak.wordpress.com/2013/12/07/augmented-interval-tree-in-c/
+ * http://www.mif.vu.lt/~valdas/ALGORITMAI/LITERATURA/Cormen/Cormen.pdf
+ * @param low
+ * @param high
+ */
+class IntervalNode {
+    constructor(low, high, event) {
+        // the nodes to the left
+        this._left = null;
+        // the nodes to the right
+        this._right = null;
+        // the parent node
+        this.parent = null;
+        // the number of child nodes
+        this.height = 0;
+        this.event = event;
+        // the low value
+        this.low = low;
+        // the high value
+        this.high = high;
+        // the high value for this and all child nodes
+        this.max = this.high;
+    }
+    /**
+     * Insert a node into the correct spot in the tree
+     */
+    insert(node) {
+        if (node.low <= this.low) {
+            if (this.left === null) {
+                this.left = node;
+            }
+            else {
+                this.left.insert(node);
+            }
+        }
+        else if (this.right === null) {
+            this.right = node;
+        }
+        else {
+            this.right.insert(node);
+        }
+    }
+    /**
+     * Search the tree for nodes which overlap
+     * with the given point
+     * @param  point  The point to query
+     * @param  results  The array to put the results
+     */
+    search(point, results) {
+        // If p is to the right of the rightmost point of any interval
+        // in this node and all children, there won't be any matches.
+        if (point > this.max) {
+            return;
+        }
+        // Search left children
+        if (this.left !== null) {
+            this.left.search(point, results);
+        }
+        // Check this node
+        if (this.low <= point && this.high > point) {
+            results.push(this);
+        }
+        // If p is to the left of the time of this interval,
+        // then it can't be in any child to the right.
+        if (this.low > point) {
+            return;
+        }
+        // Search right children
+        if (this.right !== null) {
+            this.right.search(point, results);
+        }
+    }
+    /**
+     * Search the tree for nodes which are less
+     * than the given point
+     * @param  point  The point to query
+     * @param  results  The array to put the results
+     */
+    searchAfter(point, results) {
+        // Check this node
+        if (this.low >= point) {
+            results.push(this);
+            if (this.left !== null) {
+                this.left.searchAfter(point, results);
+            }
+        }
+        // search the right side
+        if (this.right !== null) {
+            this.right.searchAfter(point, results);
+        }
+    }
+    /**
+     * Invoke the callback on this element and both it's branches
+     * @param  {Function}  callback
+     */
+    traverse(callback) {
+        callback(this);
+        if (this.left !== null) {
+            this.left.traverse(callback);
+        }
+        if (this.right !== null) {
+            this.right.traverse(callback);
+        }
+    }
+    /**
+     * Update the height of the node
+     */
+    updateHeight() {
+        if (this.left !== null && this.right !== null) {
+            this.height = Math.max(this.left.height, this.right.height) + 1;
+        }
+        else if (this.right !== null) {
+            this.height = this.right.height + 1;
+        }
+        else if (this.left !== null) {
+            this.height = this.left.height + 1;
+        }
+        else {
+            this.height = 0;
+        }
+    }
+    /**
+     * Update the height of the node
+     */
+    updateMax() {
+        this.max = this.high;
+        if (this.left !== null) {
+            this.max = Math.max(this.max, this.left.max);
+        }
+        if (this.right !== null) {
+            this.max = Math.max(this.max, this.right.max);
+        }
+    }
+    /**
+     * The balance is how the leafs are distributed on the node
+     * @return  Negative numbers are balanced to the right
+     */
+    getBalance() {
+        let balance = 0;
+        if (this.left !== null && this.right !== null) {
+            balance = this.left.height - this.right.height;
+        }
+        else if (this.left !== null) {
+            balance = this.left.height + 1;
+        }
+        else if (this.right !== null) {
+            balance = -(this.right.height + 1);
+        }
+        return balance;
+    }
+    /**
+     * @returns true if this node is the left child of its parent
+     */
+    isLeftChild() {
+        return this.parent !== null && this.parent.left === this;
+    }
+    /**
+     * get/set the left node
+     */
+    get left() {
+        return this._left;
+    }
+    set left(node) {
+        this._left = node;
+        if (node !== null) {
+            node.parent = this;
+        }
+        this.updateHeight();
+        this.updateMax();
+    }
+    /**
+     * get/set the right node
+     */
+    get right() {
+        return this._right;
+    }
+    set right(node) {
+        this._right = node;
+        if (node !== null) {
+            node.parent = this;
+        }
+        this.updateHeight();
+        this.updateMax();
+    }
+    /**
+     * null out references.
+     */
+    dispose() {
+        this.parent = null;
+        this._left = null;
+        this._right = null;
+        this.event = null;
+    }
+}
+//# sourceMappingURL=IntervalTimeline.js.map

package/build/esm/core/util/IntervalTimeline.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"IntervalTimeline.js","sourceRoot":"","sources":["../../../../Tone/core/util/IntervalTimeline.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAC/B,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,EAAE,MAAM,EAAE,MAAM,SAAS,CAAC;AAajC;;;;;;;GAOG;AACH,MAAM,OAAO,gBAAiB,SAAQ,IAAI;IAA1C;;QAEU,SAAI,GAAW,kBAAkB,CAAC;QAE3C;;WAEG;QACK,UAAK,GAAwB,IAAI,CAAC;QAE1C;;WAEG;QACK,YAAO,GAAG,CAAC,CAAC;IA0TrB,CAAC;IAxTA;;;;OAIG;IACH,GAAG,CAAC,KAA4B;QAC/B,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,kCAAkC,CAAC,CAAC;QAClE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,uCAAuC,CAAC,CAAC;QAE3E,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;QAClC,IAAI,IAAI,GAAwB,IAAI,YAAY,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QACjG,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE;YACxB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;SAClB;aAAM;YACN,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;SACxB;QACD,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,kCAAkC;QAClC,OAAO,IAAI,KAAK,IAAI,EAAE;YACrB,IAAI,CAAC,YAAY,EAAE,CAAC;YACpB,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YACtB,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;SACnB;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,KAA4B;QAClC,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE;YACxB,MAAM,OAAO,GAAmB,EAAE,CAAC;YACnC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;YACvC,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE;gBAC3B,IAAI,IAAI,CAAC,KAAK,KAAK,KAAK,EAAE;oBACzB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;oBACvB,IAAI,CAAC,OAAO,EAAE,CAAC;oBACf,MAAM;iBACN;aACD;SACD;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;OAGG;IACH,IAAI,MAAM;QACT,OAAO,IAAI,CAAC,OAAO,CAAC;IACrB,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,KAAa;QACnB,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QACrD,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;OAEG;IACK,QAAQ,CAAC,IAAyB;QACzC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE;YACxB,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC;SACzB;IACF,CAAC;IAED;;;OAGG;IACK,oBAAoB,CAAC,IAAkB,EAAE,WAAgC;QAChF,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,EAAE;YACzB,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE;gBACvB,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,WAAW,CAAC;aAC/B;iBAAM;gBACN,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,WAAW,CAAC;aAChC;YACD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;SAC7B;aAAM;YACN,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;SAC3B;IACF,CAAC;IAED;;;OAGG;IACK,WAAW,CAAC,IAAkB;QACrC,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE;YAC9C,IAAI,CAAC,oBAAoB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;SACtC;aAAM,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE;YAC/B,IAAI,CAAC,oBAAoB,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;SAC3C;aAAM,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE;YAC9B,IAAI,CAAC,oBAAoB,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;SAC5C;aAAM;YACN,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;YAClC,IAAI,WAAyB,CAAC;YAC9B,IAAI,IAAI,GAAwB,IAAI,CAAC;YACrC,IAAI,OAAO,GAAG,CAAC,EAAE;gBAChB,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE;oBAC7B,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC;oBACxB,WAAW,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;oBAC/B,IAAI,GAAG,WAAW,CAAC;iBACnB;qBAAM;oBACN,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;oBAC9B,OAAO,WAAW,CAAC,KAAK,KAAK,IAAI,EAAE;wBAClC,WAAW,GAAG,WAAW,CAAC,KAAK,CAAC;qBAChC;oBACD,IAAI,WAAW,CAAC,MAAM,EAAE;wBACvB,WAAW,CAAC,MAAM,CAAC,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC;wBAC5C,IAAI,GAAG,WAAW,CAAC,MAAM,CAAC;wBAC1B,WAAW,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;wBAC7B,WAAW,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;qBAC/B;iBACD;aACD;iBAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,EAAE;gBACpC,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC;gBACzB,WAAW,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBAC7B,IAAI,GAAG,WAAW,CAAC;aACnB;iBAAM;gBACN,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;gBAC9B,OAAO,WAAW,CAAC,IAAI,KAAK,IAAI,EAAE;oBACjC,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC;iBAC/B;gBACD,IAAI,WAAW,CAAC,MAAM,EAAE;oBACvB,WAAW,CAAC,MAAM,CAAC,IAAI,GAAG,WAAW,CAAC,KAAK,CAAC;oBAC5C,IAAI,GAAG,WAAW,CAAC,MAAM,CAAC;oBAC1B,WAAW,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;oBAC7B,WAAW,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;iBAC/B;aACD;YACD,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,EAAE;gBACzB,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE;oBACvB,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,WAAW,CAAC;iBAC/B;qBAAM;oBACN,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,WAAW,CAAC;iBAChC;aACD;iBAAM;gBACN,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;aAC3B;YACD,IAAI,IAAI,EAAE;gBACT,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;aACtB;SACD;QACD,IAAI,CAAC,OAAO,EAAE,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,IAAkB;QACrC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QAEvC,kEAAkE;QAClE,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC;QAC7B,IAAI,SAAS,EAAE;YACd,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC;YAC5B,SAAS,CAAC,IAAI,GAAG,IAAI,CAAC;SACtB;QAED,IAAI,MAAM,KAAK,IAAI,EAAE;YACpB,IAAI,WAAW,EAAE;gBAChB,MAAM,CAAC,IAAI,GAAG,SAAS,CAAC;aACxB;iBAAM;gBACN,MAAM,CAAC,KAAK,GAAG,SAAS,CAAC;aACzB;SACD;aAAM;YACN,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;SACzB;IACF,CAAC;IAED;;OAEG;IACK,YAAY,CAAC,IAAkB;QACtC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QAEvC,iEAAiE;QACjE,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC;QAC5B,IAAI,SAAS,EAAE;YACd,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC;YAC5B,SAAS,CAAC,KAAK,GAAG,IAAI,CAAC;SACvB;QAED,IAAI,MAAM,KAAK,IAAI,EAAE;YACpB,IAAI,WAAW,EAAE;gBAChB,MAAM,CAAC,IAAI,GAAG,SAAS,CAAC;aACxB;iBAAM;gBACN,MAAM,CAAC,KAAK,GAAG,SAAS,CAAC;aACzB;SACD;aAAM;YACN,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;SACzB;IACF,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,IAAkB;QACpC,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;QAClC,IAAI,OAAO,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE;YAC7B,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,GAAG,CAAC,EAAE;gBAC/B,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aAC5B;iBAAM;gBACN,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;aACxB;SACD;aAAM,IAAI,OAAO,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE;YACtC,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,GAAG,CAAC,EAAE;gBAChC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;aAC9B;iBAAM;gBACN,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;aACvB;SACD;IACF,CAAC;IAED;;;;OAIG;IACH,GAAG,CAAC,IAAY;QACf,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE;YACxB,MAAM,OAAO,GAAmB,EAAE,CAAC;YACnC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;YACjC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE;gBACvB,IAAI,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;gBACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBACxC,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,EAAE;wBAC7B,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;qBACjB;iBACD;gBACD,OAAO,GAAG,CAAC,KAAK,CAAC;aACjB;SACD;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;OAGG;IACH,OAAO,CAAC,QAA0B;QACjC,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE;YACxB,MAAM,QAAQ,GAAmB,EAAE,CAAC;YACpC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YACjD,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBACvB,IAAI,IAAI,CAAC,KAAK,EAAE;oBACf,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;iBACrB;YACF,CAAC,CAAC,CAAC;SACH;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;;;OAKG;IACH,aAAa,CAAC,IAAY,EAAE,QAA0B;QACrD,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE;YACxB,MAAM,OAAO,GAAmB,EAAE,CAAC;YACnC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;YACjC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBACtB,IAAI,IAAI,CAAC,KAAK,EAAE;oBACf,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;iBACrB;YACF,CAAC,CAAC,CAAC;SACH;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;;;OAKG;IACH,WAAW,CAAC,IAAY,EAAE,QAA0B;QACnD,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE;YACxB,MAAM,OAAO,GAAmB,EAAE,CAAC;YACnC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;YACtC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBACtB,IAAI,IAAI,CAAC,KAAK,EAAE;oBACf,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;iBACrB;YACF,CAAC,CAAC,CAAC;SACH;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;OAEG;IACH,OAAO;QACN,KAAK,CAAC,OAAO,EAAE,CAAC;QAChB,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE;YACxB,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;SAC5C;QACD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,OAAO,IAAI,CAAC;IACb,CAAC;CACD;AAED,uCAAuC;AACvC,wBAAwB;AACxB,uCAAuC;AAEvC;;;;;;;;;GASG;AACH,MAAM,YAAY;IAmBjB,YAAY,GAAW,EAAE,IAAY,EAAE,KAA4B;QATnE,wBAAwB;QAChB,UAAK,GAAwB,IAAI,CAAC;QAC1C,yBAAyB;QACjB,WAAM,GAAwB,IAAI,CAAC;QAC3C,kBAAkB;QAClB,WAAM,GAAwB,IAAI,CAAC;QACnC,4BAA4B;QAC5B,WAAM,GAAG,CAAC,CAAC;QAGV,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,gBAAgB;QAChB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,iBAAiB;QACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,8CAA8C;QAC9C,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC;IACtB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,IAAkB;QACxB,IAAI,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE;YACzB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE;gBACvB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;aACjB;iBAAM;gBACN,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;aACvB;SACD;aAAM,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE;YAC/B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;SAClB;aAAM;YACN,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;SACxB;IACF,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,KAAa,EAAE,OAAuB;QAC5C,8DAA8D;QAC9D,6DAA6D;QAC7D,IAAI,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE;YACrB,OAAO;SACP;QACD,uBAAuB;QACvB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE;YACvB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;SACjC;QACD,kBAAkB;QAClB,IAAI,IAAI,CAAC,GAAG,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,GAAG,KAAK,EAAE;YAC3C,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SACnB;QACD,oDAAoD;QACpD,8CAA8C;QAC9C,IAAI,IAAI,CAAC,GAAG,GAAG,KAAK,EAAE;YACrB,OAAO;SACP;QACD,wBAAwB;QACxB,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE;YACxB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;SAClC;IACF,CAAC;IAED;;;;;OAKG;IACH,WAAW,CAAC,KAAa,EAAE,OAAuB;QACjD,kBAAkB;QAClB,IAAI,IAAI,CAAC,GAAG,IAAI,KAAK,EAAE;YACtB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE;gBACvB,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;aACtC;SACD;QACD,wBAAwB;QACxB,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE;YACxB,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;SACvC;IACF,CAAC;IAED;;;OAGG;IACH,QAAQ,CAAC,QAAsC;QAC9C,QAAQ,CAAC,IAAI,CAAC,CAAC;QACf,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE;YACvB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;SAC7B;QACD,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE;YACxB,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;SAC9B;IACF,CAAC;IAED;;OAEG;IACH,YAAY;QACX,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE;YAC9C,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;SAChE;aAAM,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE;YAC/B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;SACpC;aAAM,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE;YAC9B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;SACnC;aAAM;YACN,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;SAChB;IACF,CAAC;IAED;;OAEG;IACH,SAAS;QACR,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC;QACrB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE;YACvB,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;SAC7C;QACD,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE;YACxB,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;SAC9C;IACF,CAAC;IAED;;;OAGG;IACH,UAAU;QACT,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE;YAC9C,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;SAC/C;aAAM,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE;YAC9B,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;SAC/B;aAAM,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE;YAC/B,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;SACnC;QACD,OAAO,OAAO,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,WAAW;QACV,OAAO,IAAI,CAAC,MAAM,KAAK,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,IAAI,CAAC;IAC1D,CAAC;IAED;;OAEG;IACH,IAAI,IAAI;QACP,OAAO,IAAI,CAAC,KAAK,CAAC;IACnB,CAAC;IAED,IAAI,IAAI,CAAC,IAAyB;QACjC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,IAAI,KAAK,IAAI,EAAE;YAClB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;SACnB;QACD,IAAI,CAAC,YAAY,EAAE,CAAC;QACpB,IAAI,CAAC,SAAS,EAAE,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,IAAI,KAAK;QACR,OAAO,IAAI,CAAC,MAAM,CAAC;IACpB,CAAC;IAED,IAAI,KAAK,CAAC,IAAyB;QAClC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QACnB,IAAI,IAAI,KAAK,IAAI,EAAE;YAClB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;SACnB;QACD,IAAI,CAAC,YAAY,EAAE,CAAC;QACpB,IAAI,CAAC,SAAS,EAAE,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,OAAO;QACN,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACnB,CAAC;CACD"}

package/build/esm/core/util/Math.d.ts

@@ -0,0 +1,20 @@
+/**
+ * Test if A is greater than B
+ */
+export declare function GT(a: number, b: number): boolean;
+/**
+ * Test if A is greater than or equal to B
+ */
+export declare function GTE(a: number, b: number): boolean;
+/**
+ * Test if A is less than B
+ */
+export declare function LT(a: number, b: number): boolean;
+/**
+ * Test if A is less than B
+ */
+export declare function EQ(a: number, b: number): boolean;
+/**
+ * Clamp the value within the given range
+ */
+export declare function clamp(value: number, min: number, max: number): number;