excalibur 0.25.0 → 0.25.1

package/build/dist/Util/SortedList.js

@@ -1,261 +0,0 @@
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
-    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
-    if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
-    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
-    return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-import { obsolete } from './Decorators';
-/**
- * A sorted list implementation. NOTE: this implementation is not self-balancing
- * @deprecated WIll be removed in v0.26.0 Use built in JS array.sort
- */
-let SortedList = class SortedList {
-    constructor(getComparable) {
-        this._getComparable = getComparable;
-    }
-    find(element) {
-        return this._find(this._root, element);
-    }
-    _find(node, element) {
-        if (node == null) {
-            return false;
-        }
-        else if (this._getComparable(element) === node.getKey()) {
-            if (node.getData().indexOf(element) > -1) {
-                return true;
-            }
-            else {
-                return false;
-            }
-        }
-        else if (this._getComparable(element) < node.getKey()) {
-            return this._find(node.getLeft(), element);
-        }
-        else {
-            return this._find(node.getRight(), element);
-        }
-    }
-    // returns the array of elements at a specific key value
-    get(key) {
-        return this._get(this._root, key);
-    }
-    _get(node, key) {
-        if (node == null) {
-            return [];
-        }
-        else if (key === node.getKey()) {
-            return node.getData();
-        }
-        else if (key < node.getKey()) {
-            return this._get(node.getLeft(), key);
-        }
-        else {
-            return this._get(node.getRight(), key);
-        }
-    }
-    add(element) {
-        if (this._root == null) {
-            this._root = new BinaryTreeNode(this._getComparable(element), [element], null, null);
-            return true;
-        }
-        else {
-            return this._insert(this._root, element);
-        }
-    }
-    _insert(node, element) {
-        if (node != null) {
-            if (this._getComparable(element) === node.getKey()) {
-                if (node.getData().indexOf(element) > -1) {
-                    return false; // the element we're trying to insert already exists
-                }
-                else {
-                    node.getData().push(element);
-                    return true;
-                }
-            }
-            else if (this._getComparable(element) < node.getKey()) {
-                if (node.getLeft() == null) {
-                    node.setLeft(new BinaryTreeNode(this._getComparable(element), [element], null, null));
-                    return true;
-                }
-                else {
-                    return this._insert(node.getLeft(), element);
-                }
-            }
-            else {
-                if (node.getRight() == null) {
-                    node.setRight(new BinaryTreeNode(this._getComparable(element), [element], null, null));
-                    return true;
-                }
-                else {
-                    return this._insert(node.getRight(), element);
-                }
-            }
-        }
-        return false;
-    }
-    removeByComparable(element) {
-        this._root = this._remove(this._root, element);
-    }
-    _remove(node, element) {
-        if (node == null) {
-            return null;
-        }
-        else if (this._getComparable(element) === node.getKey()) {
-            const elementIndex = node.getData().indexOf(element);
-            // if the node contains the element, remove the element
-            if (elementIndex > -1) {
-                node.getData().splice(elementIndex, 1);
-                // if we have removed the last element at this node, remove the node
-                if (node.getData().length === 0) {
-                    // if the node is a leaf
-                    if (node.getLeft() == null && node.getRight() == null) {
-                        return null;
-                    }
-                    else if (node.getLeft() == null) {
-                        return node.getRight();
-                    }
-                    else if (node.getRight() == null) {
-                        return node.getLeft();
-                    }
-                    // if node has 2 children
-                    const temp = this._findMinNode(node.getRight());
-                    node.setKey(temp.getKey());
-                    node.setData(temp.getData());
-                    node.setRight(this._cleanup(node.getRight(), temp)); //"cleanup nodes" (move them up recursively)
-                    return node;
-                }
-                else {
-                    // this prevents the node from being removed since it still contains elements
-                    return node;
-                }
-            }
-        }
-        else if (this._getComparable(element) < node.getKey()) {
-            node.setLeft(this._remove(node.getLeft(), element));
-            return node;
-        }
-        else {
-            node.setRight(this._remove(node.getRight(), element));
-            return node;
-        }
-        return null;
-    }
-    // called once we have successfully removed the element we wanted, recursively corrects the part of the tree below the removed node
-    _cleanup(node, element) {
-        const comparable = element.getKey();
-        if (node == null) {
-            return null;
-        }
-        else if (comparable === node.getKey()) {
-            // if the node is a leaf
-            if (node.getLeft() == null && node.getRight() == null) {
-                return null;
-            }
-            else if (node.getLeft() == null) {
-                return node.getRight();
-            }
-            else if (node.getRight() == null) {
-                return node.getLeft();
-            }
-            // if node has 2 children
-            const temp = this._findMinNode(node.getRight());
-            node.setKey(temp.getKey());
-            node.setData(temp.getData());
-            node.setRight(this._cleanup(node.getRight(), temp));
-            return node;
-        }
-        else if (element.getKey() < node.getKey()) {
-            node.setLeft(this._cleanup(node.getLeft(), element));
-            return node;
-        }
-        else {
-            node.setRight(this._cleanup(node.getRight(), element));
-            return node;
-        }
-    }
-    _findMinNode(node) {
-        let current = node;
-        while (current.getLeft() != null) {
-            current = current.getLeft();
-        }
-        return current;
-    }
-    list() {
-        const results = new Array();
-        this._list(this._root, results);
-        return results;
-    }
-    _list(treeNode, results) {
-        if (treeNode != null) {
-            this._list(treeNode.getLeft(), results);
-            treeNode.getData().forEach((element) => {
-                results.push(element);
-            });
-            this._list(treeNode.getRight(), results);
-        }
-    }
-};
-SortedList = __decorate([
-    obsolete({ message: 'Will be removed in excalibur v0.26.0', alternateMethod: 'Use built in JS array.sort' })
-], SortedList);
-export { SortedList };
-/**
- * A tree node part of [[SortedList]]
- * @deprecated Will be removed in v0.26.0
- */
-let BinaryTreeNode = class BinaryTreeNode {
-    constructor(key, data, left, right) {
-        this._key = key;
-        this._data = data;
-        this._left = left;
-        this._right = right;
-    }
-    getKey() {
-        return this._key;
-    }
-    setKey(key) {
-        this._key = key;
-    }
-    getData() {
-        return this._data;
-    }
-    setData(data) {
-        this._data = data;
-    }
-    getLeft() {
-        return this._left;
-    }
-    setLeft(left) {
-        this._left = left;
-    }
-    getRight() {
-        return this._right;
-    }
-    setRight(right) {
-        this._right = right;
-    }
-};
-BinaryTreeNode = __decorate([
-    obsolete({ message: 'Will be removed in excalibur v0.26.0' })
-], BinaryTreeNode);
-export { BinaryTreeNode };
-/**
- * Mock element for testing
- *
- * @internal
- * @deprecated Will be removed in v0.26.0
- */
-export class MockedElement {
-    constructor(key) {
-        this._key = 0;
-        this._key = key;
-    }
-    getTheKey() {
-        return this._key;
-    }
-    setKey(key) {
-        this._key = key;
-    }
-}
-//# sourceMappingURL=SortedList.js.map

package/build/dist/Util/SortedList.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"SortedList.js","sourceRoot":"","sources":["../../../src/engine/Util/SortedList.ts"],"names":[],"mappings":";;;;;;AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AAExC;;;GAGG;AAEH,IAAa,UAAU,GAAvB,MAAa,UAAU;IAIrB,YAAY,aAAkC;QAC5C,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC;IACtC,CAAC;IAEM,IAAI,CAAC,OAAU;QACpB,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IACzC,CAAC;IAEO,KAAK,CAAC,IAAuB,EAAE,OAAY;QACjD,IAAI,IAAI,IAAI,IAAI,EAAE;YAChB,OAAO,KAAK,CAAC;SACd;aAAM,IAAI,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,KAAK,IAAI,CAAC,MAAM,EAAE,EAAE;YACzD,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE;gBACxC,OAAO,IAAI,CAAC;aACb;iBAAM;gBACL,OAAO,KAAK,CAAC;aACd;SACF;aAAM,IAAI,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,EAAE;YACvD,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,OAAO,CAAC,CAAC;SAC5C;aAAM;YACL,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,OAAO,CAAC,CAAC;SAC7C;IACH,CAAC;IAED,wDAAwD;IACjD,GAAG,CAAC,GAAW;QACpB,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACpC,CAAC;IAEO,IAAI,CAAC,IAAuB,EAAE,GAAW;QAC/C,IAAI,IAAI,IAAI,IAAI,EAAE;YAChB,OAAO,EAAE,CAAC;SACX;aAAM,IAAI,GAAG,KAAK,IAAI,CAAC,MAAM,EAAE,EAAE;YAChC,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;SACvB;aAAM,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,EAAE;YAC9B,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,GAAG,CAAC,CAAC;SACvC;aAAM;YACL,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,GAAG,CAAC,CAAC;SACxC;IACH,CAAC;IAEM,GAAG,CAAC,OAAU;QACnB,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,EAAE;YACtB,IAAI,CAAC,KAAK,GAAG,IAAI,cAAc,CAAC,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YACrF,OAAO,IAAI,CAAC;SACb;aAAM;YACL,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;SAC1C;IACH,CAAC;IAEO,OAAO,CAAC,IAAuB,EAAE,OAAU;QACjD,IAAI,IAAI,IAAI,IAAI,EAAE;YAChB,IAAI,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,KAAK,IAAI,CAAC,MAAM,EAAE,EAAE;gBAClD,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE;oBACxC,OAAO,KAAK,CAAC,CAAC,oDAAoD;iBACnE;qBAAM;oBACL,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;oBAC7B,OAAO,IAAI,CAAC;iBACb;aACF;iBAAM,IAAI,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,EAAE;gBACvD,IAAI,IAAI,CAAC,OAAO,EAAE,IAAI,IAAI,EAAE;oBAC1B,IAAI,CAAC,OAAO,CAAC,IAAI,cAAc,CAAC,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;oBACtF,OAAO,IAAI,CAAC;iBACb;qBAAM;oBACL,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,OAAO,CAAC,CAAC;iBAC9C;aACF;iBAAM;gBACL,IAAI,IAAI,CAAC,QAAQ,EAAE,IAAI,IAAI,EAAE;oBAC3B,IAAI,CAAC,QAAQ,CAAC,IAAI,cAAc,CAAC,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;oBACvF,OAAO,IAAI,CAAC;iBACb;qBAAM;oBACL,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,OAAO,CAAC,CAAC;iBAC/C;aACF;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAEM,kBAAkB,CAAC,OAAU;QAClC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IACjD,CAAC;IAEO,OAAO,CAAC,IAAuB,EAAE,OAAU;QACjD,IAAI,IAAI,IAAI,IAAI,EAAE;YAChB,OAAO,IAAI,CAAC;SACb;aAAM,IAAI,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,KAAK,IAAI,CAAC,MAAM,EAAE,EAAE;YACzD,MAAM,YAAY,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YACrD,uDAAuD;YACvD,IAAI,YAAY,GAAG,CAAC,CAAC,EAAE;gBACrB,IAAI,CAAC,OAAO,EAAE,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC;gBACvC,oEAAoE;gBACpE,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE;oBAC/B,wBAAwB;oBACxB,IAAI,IAAI,CAAC,OAAO,EAAE,IAAI,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE,IAAI,IAAI,EAAE;wBACrD,OAAO,IAAI,CAAC;qBACb;yBAAM,IAAI,IAAI,CAAC,OAAO,EAAE,IAAI,IAAI,EAAE;wBACjC,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC;qBACxB;yBAAM,IAAI,IAAI,CAAC,QAAQ,EAAE,IAAI,IAAI,EAAE;wBAClC,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;qBACvB;oBACD,yBAAyB;oBACzB,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;oBAChD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;oBAC3B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;oBAC7B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,4CAA4C;oBACjG,OAAO,IAAI,CAAC;iBACb;qBAAM;oBACL,6EAA6E;oBAC7E,OAAO,IAAI,CAAC;iBACb;aACF;SACF;aAAM,IAAI,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,EAAE;YACvD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC;YACpD,OAAO,IAAI,CAAC;SACb;aAAM;YACL,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC;YACtD,OAAO,IAAI,CAAC;SACb;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,mIAAmI;IAC3H,QAAQ,CAAC,IAAuB,EAAE,OAA0B;QAClE,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QACpC,IAAI,IAAI,IAAI,IAAI,EAAE;YAChB,OAAO,IAAI,CAAC;SACb;aAAM,IAAI,UAAU,KAAK,IAAI,CAAC,MAAM,EAAE,EAAE;YACvC,wBAAwB;YACxB,IAAI,IAAI,CAAC,OAAO,EAAE,IAAI,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE,IAAI,IAAI,EAAE;gBACrD,OAAO,IAAI,CAAC;aACb;iBAAM,IAAI,IAAI,CAAC,OAAO,EAAE,IAAI,IAAI,EAAE;gBACjC,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC;aACxB;iBAAM,IAAI,IAAI,CAAC,QAAQ,EAAE,IAAI,IAAI,EAAE;gBAClC,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;aACvB;YACD,yBAAyB;YACzB,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;YAChD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;YAC3B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;YAE7B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC;YACpD,OAAO,IAAI,CAAC;SACb;aAAM,IAAI,OAAO,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,EAAE;YAC3C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC;YACrD,OAAO,IAAI,CAAC;SACb;aAAM;YACL,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC;YACvD,OAAO,IAAI,CAAC;SACb;IACH,CAAC;IAEO,YAAY,CAAC,IAAuB;QAC1C,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,OAAO,OAAO,CAAC,OAAO,EAAE,IAAI,IAAI,EAAE;YAChC,OAAO,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC;SAC7B;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAEM,IAAI;QACT,MAAM,OAAO,GAAG,IAAI,KAAK,EAAK,CAAC;QAC/B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAChC,OAAO,OAAO,CAAC;IACjB,CAAC;IAEO,KAAK,CAAC,QAA2B,EAAE,OAAiB;QAC1D,IAAI,QAAQ,IAAI,IAAI,EAAE;YACpB,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,EAAE,EAAE,OAAO,CAAC,CAAC;YACxC,QAAQ,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;gBACrC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACxB,CAAC,CAAC,CAAC;YACH,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,QAAQ,EAAE,EAAE,OAAO,CAAC,CAAC;SAC1C;IACH,CAAC;CACF,CAAA;AAlLY,UAAU;IADtB,QAAQ,CAAC,EAAC,OAAO,EAAE,sCAAsC,EAAE,eAAe,EAAE,4BAA4B,EAAC,CAAC;GAC9F,UAAU,CAkLtB;SAlLY,UAAU;AAoLvB;;;GAGG;AAEH,IAAa,cAAc,GAA3B,MAAa,cAAc;IAMzB,YAAY,GAAW,EAAE,IAAc,EAAE,IAAuB,EAAE,KAAwB;QACxF,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;QAChB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAEM,MAAM;QACX,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAEM,MAAM,CAAC,GAAW;QACvB,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;IAClB,CAAC;IAEM,OAAO;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAEM,OAAO,CAAC,IAAS;QACtB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAEM,OAAO;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAEM,OAAO,CAAC,IAAuB;QACpC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAEM,QAAQ;QACb,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAEM,QAAQ,CAAC,KAAwB;QACtC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;CACF,CAAA;AA5CY,cAAc;IAD1B,QAAQ,CAAC,EAAC,OAAO,EAAE,sCAAsC,EAAC,CAAC;GAC/C,cAAc,CA4C1B;SA5CY,cAAc;AA8C3B;;;;;GAKG;AACH,MAAM,OAAO,aAAa;IAGxB,YAAY,GAAW;QAFf,SAAI,GAAW,CAAC,CAAC;QAGvB,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;IAClB,CAAC;IAEM,SAAS;QACd,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAEM,MAAM,CAAC,GAAW;QACvB,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;IAClB,CAAC;CACF"}

package/build/dist/Util/Sound.js

@@ -1,22 +0,0 @@
-import { Logger } from './Log';
-/**
- * Whether or not the browser can play this file as HTML5 Audio
- */
-export function canPlayFile(file) {
-    try {
-        const a = new Audio();
-        const filetype = /.*\.([A-Za-z0-9]+)$/;
-        const type = file.match(filetype)[1];
-        if (a.canPlayType('audio/' + type)) {
-            return true;
-        }
-        else {
-            return false;
-        }
-    }
-    catch (e) {
-        Logger.getInstance().warn('Cannot determine audio support, assuming no support for the Audio Tag', e);
-        return false;
-    }
-}
-//# sourceMappingURL=Sound.js.map

package/build/dist/Util/Sound.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Sound.js","sourceRoot":"","sources":["../../../src/engine/Util/Sound.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,OAAO,CAAC;AAE/B;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,IAAY;IACtC,IAAI;QACF,MAAM,CAAC,GAAG,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,QAAQ,GAAG,qBAAqB,CAAC;QACvC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,IAAI,CAAC,CAAC,WAAW,CAAC,QAAQ,GAAG,IAAI,CAAC,EAAE;YAClC,OAAO,IAAI,CAAC;SACb;aAAM;YACL,OAAO,KAAK,CAAC;SACd;KACF;IAAC,OAAO,CAAC,EAAE;QACV,MAAM,CAAC,WAAW,EAAE,CAAC,IAAI,CAAC,uEAAuE,EAAE,CAAC,CAAC,CAAC;QACtG,OAAO,KAAK,CAAC;KACd;AACH,CAAC"}

package/build/dist/Util/Util.js

@@ -1,401 +0,0 @@
-import { Vector } from '../Math/vector';
-import { Random } from '../Math/Random';
-import { Side } from '../Collision/Side';
-/**
- * Two PI constant
- */
-export const TwoPI = Math.PI * 2;
-/**
- * Merges one or more objects into a single target object
- *
- * @returns Merged object with properties from other objects
- * @credit https://gomakethings.com/vanilla-javascript-version-of-jquery-extend/
- */
-export function extend() {
-    const extended = {};
-    let deep = false;
-    let i = 0;
-    const length = arguments.length;
-    // Check if a deep merge
-    if (Object.prototype.toString.call(arguments[0]) === '[object Boolean]') {
-        deep = arguments[0];
-        i++;
-    }
-    // Merge the object into the extended object
-    const assignExists = typeof Object.assign === 'function';
-    let merge = null;
-    if (!assignExists) {
-        merge = function (obj) {
-            for (const prop in obj) {
-                if (Object.prototype.hasOwnProperty.call(obj, prop)) {
-                    // If deep merge and property is an object, merge properties
-                    if (deep && Object.prototype.toString.call(obj[prop]) === '[object Object]') {
-                        extended[prop] = extend(true, extended[prop], obj[prop]);
-                    }
-                    else {
-                        extended[prop] = obj[prop];
-                    }
-                }
-            }
-        };
-    }
-    else {
-        merge = Object.assign;
-    }
-    // Loop through each object and conduct a merge
-    for (; i < length; i++) {
-        const obj = arguments[i];
-        if (!assignExists) {
-            merge(obj);
-        }
-        else {
-            merge(extended, obj);
-        }
-    }
-    return extended;
-}
-/**
- * Encode a string in base64
- * @deprecated This will be removed in v0.26.0
- */
-export function base64Encode(inputStr) {
-    const b64 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=';
-    let outputStr = '';
-    let i = 0;
-    while (i < inputStr.length) {
-        //all three "& 0xff" added below are there to fix a known bug
-        //with bytes returned by xhr.responseText
-        const byte1 = inputStr.charCodeAt(i++) & 0xff;
-        const byte2 = inputStr.charCodeAt(i++) & 0xff;
-        const byte3 = inputStr.charCodeAt(i++) & 0xff;
-        const enc1 = byte1 >> 2;
-        const enc2 = ((byte1 & 3) << 4) | (byte2 >> 4);
-        let enc3, enc4;
-        if (isNaN(byte2)) {
-            enc3 = enc4 = 64;
-        }
-        else {
-            enc3 = ((byte2 & 15) << 2) | (byte3 >> 6);
-            if (isNaN(byte3)) {
-                enc4 = 64;
-            }
-            else {
-                enc4 = byte3 & 63;
-            }
-        }
-        outputStr += b64.charAt(enc1) + b64.charAt(enc2) + b64.charAt(enc3) + b64.charAt(enc4);
-    }
-    return outputStr;
-}
-/**
- * Sugar that will use `nullishVal` if it's not null or undefined. Simulates the `??` operator
- * @param nullishVal
- * @param defaultVal
- */
-export function nullish(nullishVal, defaultVal) {
-    return nullishVal !== null && nullishVal !== undefined ? nullishVal : defaultVal;
-}
-/**
- * Clamps a value between a min and max inclusive
- */
-export function clamp(val, min, max) {
-    return Math.min(Math.max(min, val), max);
-}
-/**
- * Find a random floating point number in range
- */
-export function randomInRange(min, max, random = new Random()) {
-    return random ? random.floating(min, max) : min + Math.random() * (max - min);
-}
-/**
- * Find a random integer in a range
- */
-export function randomIntInRange(min, max, random = new Random()) {
-    return random ? random.integer(min, max) : Math.round(randomInRange(min, max));
-}
-/**
- * Convert an angle to be the equivalent in the range [0, 2PI]
- */
-export function canonicalizeAngle(angle) {
-    let tmpAngle = angle;
-    if (angle > TwoPI) {
-        while (tmpAngle > TwoPI) {
-            tmpAngle -= TwoPI;
-        }
-    }
-    if (angle < 0) {
-        while (tmpAngle < 0) {
-            tmpAngle += TwoPI;
-        }
-    }
-    return tmpAngle;
-}
-/**
- * Convert radians to degrees
- */
-export function toDegrees(radians) {
-    return (180 / Math.PI) * radians;
-}
-/**
- * Convert degrees to radians
- */
-export function toRadians(degrees) {
-    return (degrees / 180) * Math.PI;
-}
-/**
- * Find the screen position of an HTML element
- */
-export function getPosition(el) {
-    let oLeft = 0, oTop = 0;
-    const calcOffsetLeft = (parent) => {
-        oLeft += parent.offsetLeft;
-        if (parent.offsetParent) {
-            calcOffsetLeft(parent.offsetParent);
-        }
-    };
-    const calcOffsetTop = (parent) => {
-        oTop += parent.offsetTop;
-        if (parent.offsetParent) {
-            calcOffsetTop(parent.offsetParent);
-        }
-    };
-    calcOffsetLeft(el);
-    calcOffsetTop(el);
-    return new Vector(oLeft, oTop);
-}
-/**
- * Add an item to an array list if it doesn't already exist. Returns true if added, false if not and already exists in the array.
- * @deprecated Will be removed in v0.26.0
- */
-export function addItemToArray(item, array) {
-    if (array.indexOf(item) === -1) {
-        array.push(item);
-        return true;
-    }
-    return false;
-}
-/**
- * Remove an item from an list
- * @deprecated Will be removed in v0.26.0
- */
-export function removeItemFromArray(item, array) {
-    let index = -1;
-    if ((index = array.indexOf(item)) > -1) {
-        array.splice(index, 1);
-        return true;
-    }
-    return false;
-}
-/**
- * See if an array contains something
- */
-export function contains(array, obj) {
-    for (let i = 0; i < array.length; i++) {
-        if (array[i] === obj) {
-            return true;
-        }
-    }
-    return false;
-}
-/**
- * Get the opposit side
- * TODO: Move to Side type
- * @deprecated Will be removed in v0.26.0
- */
-export function getOppositeSide(side) {
-    if (side === Side.Top) {
-        return Side.Bottom;
-    }
-    if (side === Side.Bottom) {
-        return Side.Top;
-    }
-    if (side === Side.Left) {
-        return Side.Right;
-    }
-    if (side === Side.Right) {
-        return Side.Left;
-    }
-    return Side.None;
-}
-/**
- * Returns the side in the direction of the vector supplied
- * @param direction Vector to check
- * @deprecated
- * TODO: Move to Side type
- */
-export function getSideFromDirection(direction) {
-    const directions = [Vector.Left, Vector.Right, Vector.Up, Vector.Down];
-    const directionEnum = [Side.Left, Side.Right, Side.Top, Side.Bottom];
-    let max = -Number.MAX_VALUE;
-    let maxIndex = -1;
-    for (let i = 0; i < directions.length; i++) {
-        if (directions[i].dot(direction) > max) {
-            max = directions[i].dot(direction);
-            maxIndex = i;
-        }
-    }
-    return directionEnum[maxIndex];
-}
-/**
- * Excalibur's dynamically resizing collection
- * @deprecated Will be removed v0.26.0
- */
-export class Collection {
-    /**
-     * @param initialSize  Initial size of the internal backing array
-     */
-    constructor(initialSize = Collection.DefaultSize) {
-        this._internalArray = null;
-        this._endPointer = 0;
-        this._internalArray = new Array(initialSize);
-    }
-    _resize() {
-        const newSize = this._internalArray.length * 2;
-        const newArray = new Array(newSize);
-        const count = this.count();
-        for (let i = 0; i < count; i++) {
-            newArray[i] = this._internalArray[i];
-        }
-        delete this._internalArray;
-        this._internalArray = newArray;
-    }
-    /**
-     * Push elements to the end of the collection
-     */
-    push(element) {
-        if (this._endPointer === this._internalArray.length) {
-            this._resize();
-        }
-        return (this._internalArray[this._endPointer++] = element);
-    }
-    /**
-     * Removes elements from the end of the collection
-     */
-    pop() {
-        this._endPointer = this._endPointer - 1 < 0 ? 0 : this._endPointer - 1;
-        return this._internalArray[this._endPointer];
-    }
-    /**
-     * Returns the count of the collection
-     */
-    count() {
-        return this._endPointer;
-    }
-    /**
-     * Empties the collection
-     */
-    clear() {
-        this._endPointer = 0;
-    }
-    /**
-     * Returns the size of the internal backing array
-     */
-    internalSize() {
-        return this._internalArray.length;
-    }
-    /**
-     * Returns an element at a specific index
-     * @param index  Index of element to retrieve
-     */
-    elementAt(index) {
-        if (index >= this.count()) {
-            //Logger.getInstance().error('Invalid parameter: ' + index);
-            throw new Error('Invalid index ' + index);
-        }
-        return this._internalArray[index];
-    }
-    /**
-     * Inserts an element at a specific index
-     * @param index  Index to insert the element
-     * @param value  Element to insert
-     */
-    insert(index, value) {
-        if (index >= this.count()) {
-            this._resize();
-        }
-        return (this._internalArray[index] = value);
-    }
-    /**
-     * Removes an element at a specific index
-     * @param index  Index of element to remove
-     */
-    remove(index) {
-        const count = this.count();
-        if (count === 0) {
-            //Logger.getInstance().error('Invalid parameter: ' + index);
-            throw new Error('Invalid parameter ' + index);
-        }
-        // O(n) Shift
-        const removed = this._internalArray[index];
-        for (let i = index; i < count; i++) {
-            this._internalArray[i] = this._internalArray[i + 1];
-        }
-        this._endPointer--;
-        return removed;
-    }
-    /**
-     * Removes an element by reference
-     * @param element  Element to retrieve
-     */
-    removeElement(element) {
-        const index = this._internalArray.indexOf(element);
-        this.remove(index);
-    }
-    /**
-     * Returns a array representing the collection
-     */
-    toArray() {
-        return this._internalArray.slice(0, this._endPointer);
-    }
-    /**
-     * Iterate over every element in the collection
-     * @param func  Callback to call for each element passing a reference to the element and its index, returned values are ignored
-     */
-    forEach(func) {
-        let i = 0;
-        const count = this.count();
-        for (i; i < count; i++) {
-            func.call(this, this._internalArray[i], i);
-        }
-    }
-    /**
-     * Mutate every element in the collection
-     * @param func  Callback to call for each element passing a reference to the element and its index, any values returned mutate
-     * the collection
-     */
-    map(func) {
-        const count = this.count();
-        for (let i = 0; i < count; i++) {
-            this._internalArray[i] = func.call(this, this._internalArray[i], i);
-        }
-    }
-}
-/**
- * Default collection size
- */
-Collection.DefaultSize = 200;
-/**
- * Used for exhaustive checks at compile time
- */
-export function fail(message) {
-    throw new Error(message);
-}
-/**
- * Generate a range of numbers
- * For example: range(0, 5) -> [0, 1, 2, 3, 4, 5]
- * @param from inclusive
- * @param to inclusive
- */
-export const range = (from, to) => Array.from(new Array(to - from + 1), (_x, i) => i + from);
-/**
- * Create a promise that resolves after a certain number of milliseconds
- * @param milliseconds
- */
-export function delay(milliseconds) {
-    return new Promise((resolve) => {
-        setTimeout(() => {
-            resolve();
-        }, milliseconds);
-    });
-}
-//# sourceMappingURL=Util.js.map