excalibur 0.25.2 → 0.25.3

package/build/dist/Collision/Detection/DynamicTree.js

@@ -0,0 +1,442 @@
+import { Physics } from '../Physics';
+import { BoundingBox } from '../BoundingBox';
+import { Logger } from '../../Util/Log';
+import { BodyComponent } from '../BodyComponent';
+import { Color } from '../..';
+/**
+ * Dynamic Tree Node used for tracking bounds within the tree
+ */
+export class TreeNode {
+    constructor(parent) {
+        this.parent = parent;
+        this.parent = parent || null;
+        this.data = null;
+        this.bounds = new BoundingBox();
+        this.left = null;
+        this.right = null;
+        this.height = 0;
+    }
+    isLeaf() {
+        return !this.left && !this.right;
+    }
+}
+/**
+ * The DynamicTrees provides a spatial partitioning data structure for quickly querying for overlapping bounding boxes for
+ * all tracked bodies. The worst case performance of this is O(n*log(n)) where n is the number of bodies in the tree.
+ *
+ * Internally the bounding boxes are organized as a balanced binary tree of bounding boxes, where the leaf nodes are tracked bodies.
+ * Every non-leaf node is a bounding box that contains child bounding boxes.
+ */
+export class DynamicTree {
+    constructor(worldBounds = new BoundingBox(-Number.MAX_VALUE, -Number.MAX_VALUE, Number.MAX_VALUE, Number.MAX_VALUE)) {
+        this.worldBounds = worldBounds;
+        this.root = null;
+        this.nodes = {};
+    }
+    /**
+     * Inserts a node into the dynamic tree
+     */
+    _insert(leaf) {
+        // If there are no nodes in the tree, make this the root leaf
+        if (this.root === null) {
+            this.root = leaf;
+            this.root.parent = null;
+            return;
+        }
+        // Search the tree for a node that is not a leaf and find the best place to insert
+        const leafAABB = leaf.bounds;
+        let currentRoot = this.root;
+        while (!currentRoot.isLeaf()) {
+            const left = currentRoot.left;
+            const right = currentRoot.right;
+            const area = currentRoot.bounds.getPerimeter();
+            const combinedAABB = currentRoot.bounds.combine(leafAABB);
+            const combinedArea = combinedAABB.getPerimeter();
+            // Calculate cost heuristic for creating a new parent and leaf
+            const cost = 2 * combinedArea;
+            // Minimum cost of pushing the leaf down the tree
+            const inheritanceCost = 2 * (combinedArea - area);
+            // Cost of descending
+            let leftCost = 0;
+            const leftCombined = leafAABB.combine(left.bounds);
+            let newArea;
+            let oldArea;
+            if (left.isLeaf()) {
+                leftCost = leftCombined.getPerimeter() + inheritanceCost;
+            }
+            else {
+                oldArea = left.bounds.getPerimeter();
+                newArea = leftCombined.getPerimeter();
+                leftCost = newArea - oldArea + inheritanceCost;
+            }
+            let rightCost = 0;
+            const rightCombined = leafAABB.combine(right.bounds);
+            if (right.isLeaf()) {
+                rightCost = rightCombined.getPerimeter() + inheritanceCost;
+            }
+            else {
+                oldArea = right.bounds.getPerimeter();
+                newArea = rightCombined.getPerimeter();
+                rightCost = newArea - oldArea + inheritanceCost;
+            }
+            // cost is acceptable
+            if (cost < leftCost && cost < rightCost) {
+                break;
+            }
+            // Descend to the depths
+            if (leftCost < rightCost) {
+                currentRoot = left;
+            }
+            else {
+                currentRoot = right;
+            }
+        }
+        // Create the new parent node and insert into the tree
+        const oldParent = currentRoot.parent;
+        const newParent = new TreeNode(oldParent);
+        newParent.bounds = leafAABB.combine(currentRoot.bounds);
+        newParent.height = currentRoot.height + 1;
+        if (oldParent !== null) {
+            // The sibling node was not the root
+            if (oldParent.left === currentRoot) {
+                oldParent.left = newParent;
+            }
+            else {
+                oldParent.right = newParent;
+            }
+            newParent.left = currentRoot;
+            newParent.right = leaf;
+            currentRoot.parent = newParent;
+            leaf.parent = newParent;
+        }
+        else {
+            // The sibling node was the root
+            newParent.left = currentRoot;
+            newParent.right = leaf;
+            currentRoot.parent = newParent;
+            leaf.parent = newParent;
+            this.root = newParent;
+        }
+        // Walk up the tree fixing heights and AABBs
+        let currentNode = leaf.parent;
+        while (currentNode) {
+            currentNode = this._balance(currentNode);
+            if (!currentNode.left) {
+                throw new Error('Parent of current leaf cannot have a null left child' + currentNode);
+            }
+            if (!currentNode.right) {
+                throw new Error('Parent of current leaf cannot have a null right child' + currentNode);
+            }
+            currentNode.height = 1 + Math.max(currentNode.left.height, currentNode.right.height);
+            currentNode.bounds = currentNode.left.bounds.combine(currentNode.right.bounds);
+            currentNode = currentNode.parent;
+        }
+    }
+    /**
+     * Removes a node from the dynamic tree
+     */
+    _remove(leaf) {
+        if (leaf === this.root) {
+            this.root = null;
+            return;
+        }
+        const parent = leaf.parent;
+        const grandParent = parent.parent;
+        let sibling;
+        if (parent.left === leaf) {
+            sibling = parent.right;
+        }
+        else {
+            sibling = parent.left;
+        }
+        if (grandParent) {
+            if (grandParent.left === parent) {
+                grandParent.left = sibling;
+            }
+            else {
+                grandParent.right = sibling;
+            }
+            sibling.parent = grandParent;
+            let currentNode = grandParent;
+            while (currentNode) {
+                currentNode = this._balance(currentNode);
+                currentNode.bounds = currentNode.left.bounds.combine(currentNode.right.bounds);
+                currentNode.height = 1 + Math.max(currentNode.left.height, currentNode.right.height);
+                currentNode = currentNode.parent;
+            }
+        }
+        else {
+            this.root = sibling;
+            sibling.parent = null;
+        }
+    }
+    /**
+     * Tracks a body in the dynamic tree
+     */
+    trackCollider(collider) {
+        const node = new TreeNode();
+        node.data = collider;
+        node.bounds = collider.bounds;
+        node.bounds.left -= 2;
+        node.bounds.top -= 2;
+        node.bounds.right += 2;
+        node.bounds.bottom += 2;
+        this.nodes[collider.id.value] = node;
+        this._insert(node);
+    }
+    /**
+     * Updates the dynamic tree given the current bounds of each body being tracked
+     */
+    updateCollider(collider) {
+        var _a;
+        const node = this.nodes[collider.id.value];
+        if (!node) {
+            return false;
+        }
+        const b = collider.bounds;
+        // if the body is outside the world no longer update it
+        if (!this.worldBounds.contains(b)) {
+            Logger.getInstance().warn('Collider with id ' + collider.id.value + ' is outside the world bounds and will no longer be tracked for physics');
+            this.untrackCollider(collider);
+            return false;
+        }
+        if (node.bounds.contains(b)) {
+            return false;
+        }
+        this._remove(node);
+        b.left -= Physics.boundsPadding;
+        b.top -= Physics.boundsPadding;
+        b.right += Physics.boundsPadding;
+        b.bottom += Physics.boundsPadding;
+        // THIS IS CAUSING UNECESSARY CHECKS
+        if (collider.owner) {
+            const body = (_a = collider.owner) === null || _a === void 0 ? void 0 : _a.get(BodyComponent);
+            if (body) {
+                const multdx = ((body.vel.x * 32) / 1000) * Physics.dynamicTreeVelocityMultiplier;
+                const multdy = ((body.vel.y * 32) / 1000) * Physics.dynamicTreeVelocityMultiplier;
+                if (multdx < 0) {
+                    b.left += multdx;
+                }
+                else {
+                    b.right += multdx;
+                }
+                if (multdy < 0) {
+                    b.top += multdy;
+                }
+                else {
+                    b.bottom += multdy;
+                }
+            }
+        }
+        node.bounds = b;
+        this._insert(node);
+        return true;
+    }
+    /**
+     * Untracks a body from the dynamic tree
+     */
+    untrackCollider(collider) {
+        const node = this.nodes[collider.id.value];
+        if (!node) {
+            return;
+        }
+        this._remove(node);
+        this.nodes[collider.id.value] = null;
+        delete this.nodes[collider.id.value];
+    }
+    /**
+     * Balances the tree about a node
+     */
+    _balance(node) {
+        if (node === null) {
+            throw new Error('Cannot balance at null node');
+        }
+        if (node.isLeaf() || node.height < 2) {
+            return node;
+        }
+        const left = node.left;
+        const right = node.right;
+        const a = node;
+        const b = left;
+        const c = right;
+        const d = left.left;
+        const e = left.right;
+        const f = right.left;
+        const g = right.right;
+        const balance = c.height - b.height;
+        // Rotate c node up
+        if (balance > 1) {
+            // Swap the right node with it's parent
+            c.left = a;
+            c.parent = a.parent;
+            a.parent = c;
+            // The original node's old parent should point to the right node
+            // this is mega confusing
+            if (c.parent) {
+                if (c.parent.left === a) {
+                    c.parent.left = c;
+                }
+                else {
+                    c.parent.right = c;
+                }
+            }
+            else {
+                this.root = c;
+            }
+            // Rotate
+            if (f.height > g.height) {
+                c.right = f;
+                a.right = g;
+                g.parent = a;
+                a.bounds = b.bounds.combine(g.bounds);
+                c.bounds = a.bounds.combine(f.bounds);
+                a.height = 1 + Math.max(b.height, g.height);
+                c.height = 1 + Math.max(a.height, f.height);
+            }
+            else {
+                c.right = g;
+                a.right = f;
+                f.parent = a;
+                a.bounds = b.bounds.combine(f.bounds);
+                c.bounds = a.bounds.combine(g.bounds);
+                a.height = 1 + Math.max(b.height, f.height);
+                c.height = 1 + Math.max(a.height, g.height);
+            }
+            return c;
+        }
+        // Rotate left node up
+        if (balance < -1) {
+            // swap
+            b.left = a;
+            b.parent = a.parent;
+            a.parent = b;
+            // node's old parent should point to b
+            if (b.parent) {
+                if (b.parent.left === a) {
+                    b.parent.left = b;
+                }
+                else {
+                    if (b.parent.right !== a) {
+                        throw 'Error rotating Dynamic Tree';
+                    }
+                    b.parent.right = b;
+                }
+            }
+            else {
+                this.root = b;
+            }
+            // rotate
+            if (d.height > e.height) {
+                b.right = d;
+                a.left = e;
+                e.parent = a;
+                a.bounds = c.bounds.combine(e.bounds);
+                b.bounds = a.bounds.combine(d.bounds);
+                a.height = 1 + Math.max(c.height, e.height);
+                b.height = 1 + Math.max(a.height, d.height);
+            }
+            else {
+                b.right = e;
+                a.left = d;
+                d.parent = a;
+                a.bounds = c.bounds.combine(d.bounds);
+                b.bounds = a.bounds.combine(e.bounds);
+                a.height = 1 + Math.max(c.height, d.height);
+                b.height = 1 + Math.max(a.height, e.height);
+            }
+            return b;
+        }
+        return node;
+    }
+    /**
+     * Returns the internal height of the tree, shorter trees are better. Performance drops as the tree grows
+     */
+    getHeight() {
+        if (this.root === null) {
+            return 0;
+        }
+        return this.root.height;
+    }
+    /**
+     * Queries the Dynamic Axis Aligned Tree for bodies that could be colliding with the provided body.
+     *
+     * In the query callback, it will be passed a potential collider. Returning true from this callback indicates
+     * that you are complete with your query and you do not want to continue. Returning false will continue searching
+     * the tree until all possible colliders have been returned.
+     */
+    query(collider, callback) {
+        const bounds = collider.bounds;
+        const helper = (currentNode) => {
+            if (currentNode && currentNode.bounds.intersect(bounds)) {
+                if (currentNode.isLeaf() && currentNode.data !== collider) {
+                    if (callback.call(collider, currentNode.data)) {
+                        return true;
+                    }
+                }
+                else {
+                    return helper(currentNode.left) || helper(currentNode.right);
+                }
+            }
+            return false;
+        };
+        helper(this.root);
+    }
+    /**
+     * Queries the Dynamic Axis Aligned Tree for bodies that could be intersecting. By default the raycast query uses an infinitely
+     * long ray to test the tree specified by `max`.
+     *
+     * In the query callback, it will be passed a potential body that intersects with the raycast. Returning true from this
+     * callback indicates that your are complete with your query and do not want to continue. Return false will continue searching
+     * the tree until all possible bodies that would intersect with the ray have been returned.
+     */
+    rayCastQuery(ray, max = Infinity, callback) {
+        const helper = (currentNode) => {
+            if (currentNode && currentNode.bounds.rayCast(ray, max)) {
+                if (currentNode.isLeaf()) {
+                    if (callback.call(ray, currentNode.data)) {
+                        // ray hit a leaf! return the body
+                        return true;
+                    }
+                }
+                else {
+                    // ray hit but not at a leaf, recurse deeper
+                    return helper(currentNode.left) || helper(currentNode.right);
+                }
+            }
+            return false; // ray missed
+        };
+        helper(this.root);
+    }
+    getNodes() {
+        const helper = (currentNode) => {
+            if (currentNode) {
+                return [currentNode].concat(helper(currentNode.left), helper(currentNode.right));
+            }
+            else {
+                return [];
+            }
+        };
+        return helper(this.root);
+    }
+    debug(ex) {
+        // draw all the nodes in the Dynamic Tree
+        const helper = (currentNode) => {
+            if (currentNode) {
+                if (currentNode.isLeaf()) {
+                    currentNode.bounds.draw(ex, Color.Green);
+                }
+                else {
+                    currentNode.bounds.draw(ex, Color.White);
+                }
+                if (currentNode.left) {
+                    helper(currentNode.left);
+                }
+                if (currentNode.right) {
+                    helper(currentNode.right);
+                }
+            }
+        };
+        helper(this.root);
+    }
+}
+//# sourceMappingURL=DynamicTree.js.map

package/build/dist/Collision/Detection/DynamicTree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DynamicTree.js","sourceRoot":"","sources":["../../../../src/engine/Collision/Detection/DynamicTree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AACrC,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAG7C,OAAO,EAAE,MAAM,EAAE,MAAM,gBAAgB,CAAC;AAGxC,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,KAAK,EAA4B,MAAM,OAAO,CAAC;AAExD;;GAEG;AACH,MAAM,OAAO,QAAQ;IAMnB,YAAmB,MAAoB;QAApB,WAAM,GAAN,MAAM,CAAc;QACrC,IAAI,CAAC,MAAM,GAAG,MAAM,IAAI,IAAI,CAAC;QAC7B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;QAChC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IAEM,MAAM;QACX,OAAO,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;IACnC,CAAC;CACF;AAQD;;;;;;GAMG;AACH,MAAM,OAAO,WAAW;IAGtB,YAAmB,cAA2B,IAAI,WAAW,CAAC,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,SAAS,CAAC;QAApH,gBAAW,GAAX,WAAW,CAAyG;QACrI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,OAAO,CAAC,IAAiB;QAC/B,6DAA6D;QAC7D,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE;YACtB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACjB,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;YACxB,OAAO;SACR;QAED,kFAAkF;QAClF,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC;QAC7B,IAAI,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC;QAC5B,OAAO,CAAC,WAAW,CAAC,MAAM,EAAE,EAAE;YAC5B,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC;YAC9B,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC;YAEhC,MAAM,IAAI,GAAG,WAAW,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YAC/C,MAAM,YAAY,GAAG,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YAC1D,MAAM,YAAY,GAAG,YAAY,CAAC,YAAY,EAAE,CAAC;YAEjD,8DAA8D;YAC9D,MAAM,IAAI,GAAG,CAAC,GAAG,YAAY,CAAC;YAE9B,iDAAiD;YACjD,MAAM,eAAe,GAAG,CAAC,GAAG,CAAC,YAAY,GAAG,IAAI,CAAC,CAAC;YAElD,qBAAqB;YACrB,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,MAAM,YAAY,GAAG,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACnD,IAAI,OAAO,CAAC;YACZ,IAAI,OAAO,CAAC;YACZ,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE;gBACjB,QAAQ,GAAG,YAAY,CAAC,YAAY,EAAE,GAAG,eAAe,CAAC;aAC1D;iBAAM;gBACL,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;gBACrC,OAAO,GAAG,YAAY,CAAC,YAAY,EAAE,CAAC;gBACtC,QAAQ,GAAG,OAAO,GAAG,OAAO,GAAG,eAAe,CAAC;aAChD;YAED,IAAI,SAAS,GAAG,CAAC,CAAC;YAClB,MAAM,aAAa,GAAG,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YACrD,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE;gBAClB,SAAS,GAAG,aAAa,CAAC,YAAY,EAAE,GAAG,eAAe,CAAC;aAC5D;iBAAM;gBACL,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;gBACtC,OAAO,GAAG,aAAa,CAAC,YAAY,EAAE,CAAC;gBACvC,SAAS,GAAG,OAAO,GAAG,OAAO,GAAG,eAAe,CAAC;aACjD;YAED,qBAAqB;YACrB,IAAI,IAAI,GAAG,QAAQ,IAAI,IAAI,GAAG,SAAS,EAAE;gBACvC,MAAM;aACP;YAED,wBAAwB;YACxB,IAAI,QAAQ,GAAG,SAAS,EAAE;gBACxB,WAAW,GAAG,IAAI,CAAC;aACpB;iBAAM;gBACL,WAAW,GAAG,KAAK,CAAC;aACrB;SACF;QAED,sDAAsD;QACtD,MAAM,SAAS,GAAG,WAAW,CAAC,MAAM,CAAC;QACrC,MAAM,SAAS,GAAG,IAAI,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC1C,SAAS,CAAC,MAAM,GAAG,QAAQ,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACxD,SAAS,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAE1C,IAAI,SAAS,KAAK,IAAI,EAAE;YACtB,oCAAoC;YACpC,IAAI,SAAS,CAAC,IAAI,KAAK,WAAW,EAAE;gBAClC,SAAS,CAAC,IAAI,GAAG,SAAS,CAAC;aAC5B;iBAAM;gBACL,SAAS,CAAC,KAAK,GAAG,SAAS,CAAC;aAC7B;YAED,SAAS,CAAC,IAAI,GAAG,WAAW,CAAC;YAC7B,SAAS,CAAC,KAAK,GAAG,IAAI,CAAC;YAEvB,WAAW,CAAC,MAAM,GAAG,SAAS,CAAC;YAC/B,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;SACzB;aAAM;YACL,gCAAgC;YAChC,SAAS,CAAC,IAAI,GAAG,WAAW,CAAC;YAC7B,SAAS,CAAC,KAAK,GAAG,IAAI,CAAC;YAEvB,WAAW,CAAC,MAAM,GAAG,SAAS,CAAC;YAC/B,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;YACxB,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;SACvB;QAED,4CAA4C;QAC5C,IAAI,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC;QAC9B,OAAO,WAAW,EAAE;YAClB,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;YAEzC,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE;gBACrB,MAAM,IAAI,KAAK,CAAC,sDAAsD,GAAG,WAAW,CAAC,CAAC;aACvF;YACD,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE;gBACtB,MAAM,IAAI,KAAK,CAAC,uDAAuD,GAAG,WAAW,CAAC,CAAC;aACxF;YAED,WAAW,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,WAAW,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YACrF,WAAW,CAAC,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAE/E,WAAW,GAAG,WAAW,CAAC,MAAM,CAAC;SAClC;IACH,CAAC;IAED;;OAEG;IACK,OAAO,CAAC,IAAiB;QAC/B,IAAI,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE;YACtB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACjB,OAAO;SACR;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC;QAClC,IAAI,OAAoB,CAAC;QACzB,IAAI,MAAM,CAAC,IAAI,KAAK,IAAI,EAAE;YACxB,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC;SACxB;aAAM;YACL,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC;SACvB;QAED,IAAI,WAAW,EAAE;YACf,IAAI,WAAW,CAAC,IAAI,KAAK,MAAM,EAAE;gBAC/B,WAAW,CAAC,IAAI,GAAG,OAAO,CAAC;aAC5B;iBAAM;gBACL,WAAW,CAAC,KAAK,GAAG,OAAO,CAAC;aAC7B;YACD,OAAO,CAAC,MAAM,GAAG,WAAW,CAAC;YAE7B,IAAI,WAAW,GAAG,WAAW,CAAC;YAC9B,OAAO,WAAW,EAAE;gBAClB,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;gBACzC,WAAW,CAAC,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;gBAC/E,WAAW,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,WAAW,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;gBAErF,WAAW,GAAG,WAAW,CAAC,MAAM,CAAC;aAClC;SACF;aAAM;YACL,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;YACpB,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;SACvB;IACH,CAAC;IAED;;OAEG;IACI,aAAa,CAAC,QAAW;QAC9B,MAAM,IAAI,GAAG,IAAI,QAAQ,EAAK,CAAC;QAC/B,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC;QACrB,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;QAC9B,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC;QACtB,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC;QACrB,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC;QACvB,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC;QACxB,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;QACrC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACrB,CAAC;IAED;;OAEG;IACI,cAAc,CAAC,QAAW;;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;QAC3C,IAAI,CAAC,IAAI,EAAE;YACT,OAAO,KAAK,CAAC;SACd;QACD,MAAM,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC;QAE1B,uDAAuD;QACvD,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE;YACjC,MAAM,CAAC,WAAW,EAAE,CAAC,IAAI,CACvB,mBAAmB,GAAG,QAAQ,CAAC,EAAE,CAAC,KAAK,GAAG,wEAAwE,CACnH,CAAC;YACF,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;YAC/B,OAAO,KAAK,CAAC;SACd;QAED,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE;YAC3B,OAAO,KAAK,CAAC;SACd;QAED,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC,CAAC,IAAI,IAAI,OAAO,CAAC,aAAa,CAAC;QAChC,CAAC,CAAC,GAAG,IAAI,OAAO,CAAC,aAAa,CAAC;QAC/B,CAAC,CAAC,KAAK,IAAI,OAAO,CAAC,aAAa,CAAC;QACjC,CAAC,CAAC,MAAM,IAAI,OAAO,CAAC,aAAa,CAAC;QAElC,oCAAoC;QACpC,IAAI,QAAQ,CAAC,KAAK,EAAE;YAClB,MAAM,IAAI,GAAG,MAAA,QAAQ,CAAC,KAAK,0CAAE,GAAG,CAAC,aAAa,CAAC,CAAC;YAChD,IAAI,IAAI,EAAE;gBACR,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,OAAO,CAAC,6BAA6B,CAAC;gBAClF,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,OAAO,CAAC,6BAA6B,CAAC;gBAElF,IAAI,MAAM,GAAG,CAAC,EAAE;oBACd,CAAC,CAAC,IAAI,IAAI,MAAM,CAAC;iBAClB;qBAAM;oBACL,CAAC,CAAC,KAAK,IAAI,MAAM,CAAC;iBACnB;gBAED,IAAI,MAAM,GAAG,CAAC,EAAE;oBACd,CAAC,CAAC,GAAG,IAAI,MAAM,CAAC;iBACjB;qBAAM;oBACL,CAAC,CAAC,MAAM,IAAI,MAAM,CAAC;iBACpB;aACF;SACF;QAED,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAChB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACnB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACI,eAAe,CAAC,QAAW;QAChC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;QAC3C,IAAI,CAAC,IAAI,EAAE;YACT,OAAO;SACR;QACD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACnB,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;QACrC,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;IACvC,CAAC;IAED;;OAEG;IACK,QAAQ,CAAC,IAAiB;QAChC,IAAI,IAAI,KAAK,IAAI,EAAE;YACjB,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;SAChD;QAED,IAAI,IAAI,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;YACpC,OAAO,IAAI,CAAC;SACb;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QAEzB,MAAM,CAAC,GAAG,IAAI,CAAC;QACf,MAAM,CAAC,GAAG,IAAI,CAAC;QACf,MAAM,CAAC,GAAG,KAAK,CAAC;QAChB,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;QACpB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;QACrB,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC;QACrB,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;QAEtB,MAAM,OAAO,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;QACpC,mBAAmB;QACnB,IAAI,OAAO,GAAG,CAAC,EAAE;YACf,uCAAuC;YACvC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;YACX,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;YACpB,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;YAEb,gEAAgE;YAChE,yBAAyB;YACzB,IAAI,CAAC,CAAC,MAAM,EAAE;gBACZ,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,EAAE;oBACvB,CAAC,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;iBACnB;qBAAM;oBACL,CAAC,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;iBACpB;aACF;iBAAM;gBACL,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;aACf;YAED,SAAS;YACT,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,EAAE;gBACvB,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;gBACZ,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;gBACZ,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;gBAEb,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBACtC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBAEtC,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;gBAC5C,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;aAC7C;iBAAM;gBACL,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;gBACZ,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;gBACZ,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;gBAEb,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBACtC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBAEtC,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;gBAC5C,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;aAC7C;YAED,OAAO,CAAC,CAAC;SACV;QACD,sBAAsB;QACtB,IAAI,OAAO,GAAG,CAAC,CAAC,EAAE;YAChB,OAAO;YACP,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;YACX,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;YACpB,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;YAEb,sCAAsC;YACtC,IAAI,CAAC,CAAC,MAAM,EAAE;gBACZ,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,EAAE;oBACvB,CAAC,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;iBACnB;qBAAM;oBACL,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,KAAK,CAAC,EAAE;wBACxB,MAAM,6BAA6B,CAAC;qBACrC;oBACD,CAAC,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;iBACpB;aACF;iBAAM;gBACL,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;aACf;YAED,SAAS;YACT,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,EAAE;gBACvB,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;gBACZ,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;gBACX,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;gBAEb,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBACtC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBAEtC,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;gBAC5C,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;aAC7C;iBAAM;gBACL,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;gBACZ,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;gBACX,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;gBAEb,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBACtC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBAEtC,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;gBAC5C,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;aAC7C;YACD,OAAO,CAAC,CAAC;SACV;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACI,SAAS;QACd,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE;YACtB,OAAO,CAAC,CAAC;SACV;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IAC1B,CAAC;IAED;;;;;;OAMG;IACI,KAAK,CAAC,QAAW,EAAE,QAA+B;QACvD,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;QAC/B,MAAM,MAAM,GAAG,CAAC,WAAwB,EAAW,EAAE;YACnD,IAAI,WAAW,IAAI,WAAW,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE;gBACvD,IAAI,WAAW,CAAC,MAAM,EAAE,IAAI,WAAW,CAAC,IAAI,KAAK,QAAQ,EAAE;oBACzD,IAAI,QAAQ,CAAC,IAAI,CAAC,QAAQ,EAAE,WAAW,CAAC,IAAI,CAAC,EAAE;wBAC7C,OAAO,IAAI,CAAC;qBACb;iBACF;qBAAM;oBACL,OAAO,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;iBAC9D;aACF;YACD,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;QACF,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpB,CAAC;IAED;;;;;;;OAOG;IACI,YAAY,CAAC,GAAQ,EAAE,MAAc,QAAQ,EAAE,QAA+B;QACnF,MAAM,MAAM,GAAG,CAAC,WAAwB,EAAW,EAAE;YACnD,IAAI,WAAW,IAAI,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE;gBACvD,IAAI,WAAW,CAAC,MAAM,EAAE,EAAE;oBACxB,IAAI,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,WAAW,CAAC,IAAI,CAAC,EAAE;wBACxC,kCAAkC;wBAClC,OAAO,IAAI,CAAC;qBACb;iBACF;qBAAM;oBACL,4CAA4C;oBAC5C,OAAO,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;iBAC9D;aACF;YACD,OAAO,KAAK,CAAC,CAAC,aAAa;QAC7B,CAAC,CAAC;QACF,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpB,CAAC;IAEM,QAAQ;QACb,MAAM,MAAM,GAAG,CAAC,WAAwB,EAAiB,EAAE;YACzD,IAAI,WAAW,EAAE;gBACf,OAAO,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC;aAClF;iBAAM;gBACL,OAAO,EAAE,CAAC;aACX;QACH,CAAC,CAAC;QACF,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3B,CAAC;IAEM,KAAK,CAAC,EAA4B;QACvC,yCAAyC;QACzC,MAAM,MAAM,GAAG,CAAC,WAAwB,EAAE,EAAE;YAC1C,IAAI,WAAW,EAAE;gBACf,IAAI,WAAW,CAAC,MAAM,EAAE,EAAE;oBACxB,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;iBAC1C;qBAAM;oBACL,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;iBAC1C;gBAED,IAAI,WAAW,CAAC,IAAI,EAAE;oBACpB,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;iBAC1B;gBACD,IAAI,WAAW,CAAC,KAAK,EAAE;oBACrB,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;iBAC3B;aACF;QACH,CAAC,CAAC;QAEF,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpB,CAAC;CACF"}

package/build/dist/Collision/Detection/DynamicTreeCollisionProcessor.js

@@ -0,0 +1,211 @@
+import { Physics } from '../Physics';
+import { DynamicTree } from './DynamicTree';
+import { Pair } from './Pair';
+import { Vector } from '../../Math/vector';
+import { Ray } from '../../Math/ray';
+import { Logger } from '../../Util/Log';
+import { CollisionType } from '../CollisionType';
+import { BodyComponent } from '../BodyComponent';
+import { CompositeCollider } from '../Colliders/CompositeCollider';
+/**
+ * Responsible for performing the collision broadphase (locating potential collisions) and
+ * the narrowphase (actual collision contacts)
+ */
+export class DynamicTreeCollisionProcessor {
+    constructor() {
+        this._dynamicCollisionTree = new DynamicTree();
+        this._pairs = new Set();
+        this._collisionPairCache = [];
+        this._colliders = [];
+    }
+    getColliders() {
+        return this._colliders;
+    }
+    /**
+     * Tracks a physics body for collisions
+     */
+    track(target) {
+        if (!target) {
+            Logger.getInstance().warn('Cannot track null collider');
+            return;
+        }
+        if (target instanceof CompositeCollider) {
+            const colliders = target.getColliders();
+            for (const c of colliders) {
+                c.owner = target.owner;
+                this._colliders.push(c);
+                this._dynamicCollisionTree.trackCollider(c);
+            }
+        }
+        else {
+            this._colliders.push(target);
+            this._dynamicCollisionTree.trackCollider(target);
+        }
+    }
+    /**
+     * Untracks a physics body
+     */
+    untrack(target) {
+        if (!target) {
+            Logger.getInstance().warn('Cannot untrack a null collider');
+            return;
+        }
+        if (target instanceof CompositeCollider) {
+            const colliders = target.getColliders();
+            for (const c of colliders) {
+                const index = this._colliders.indexOf(c);
+                if (index !== -1) {
+                    this._colliders.splice(index, 1);
+                }
+                this._dynamicCollisionTree.untrackCollider(c);
+            }
+        }
+        else {
+            const index = this._colliders.indexOf(target);
+            if (index !== -1) {
+                this._colliders.splice(index, 1);
+            }
+            this._dynamicCollisionTree.untrackCollider(target);
+        }
+    }
+    _pairExists(colliderA, colliderB) {
+        // if the collision pair has been calculated already short circuit
+        const hash = Pair.calculatePairHash(colliderA.id, colliderB.id);
+        return this._pairs.has(hash);
+    }
+    /**
+     * Detects potential collision pairs in a broadphase approach with the dynamic AABB tree strategy
+     */
+    broadphase(targets, delta, stats) {
+        const seconds = delta / 1000;
+        // Retrieve the list of potential colliders, exclude killed, prevented, and self
+        const potentialColliders = targets.filter((other) => {
+            var _a, _b;
+            const body = (_a = other.owner) === null || _a === void 0 ? void 0 : _a.get(BodyComponent);
+            return ((_b = other.owner) === null || _b === void 0 ? void 0 : _b.active) && body.collisionType !== CollisionType.PreventCollision;
+        });
+        // clear old list of collision pairs
+        this._collisionPairCache = [];
+        this._pairs.clear();
+        // check for normal collision pairs
+        let collider;
+        for (let j = 0, l = potentialColliders.length; j < l; j++) {
+            collider = potentialColliders[j];
+            // Query the collision tree for potential colliders
+            this._dynamicCollisionTree.query(collider, (other) => {
+                if (!this._pairExists(collider, other) && Pair.canCollide(collider, other)) {
+                    const pair = new Pair(collider, other);
+                    this._pairs.add(pair.id);
+                    this._collisionPairCache.push(pair);
+                }
+                // Always return false, to query whole tree. Returning true in the query method stops searching
+                return false;
+            });
+        }
+        if (stats) {
+            stats.physics.pairs = this._collisionPairCache.length;
+        }
+        // Check dynamic tree for fast moving objects
+        // Fast moving objects are those moving at least there smallest bound per frame
+        if (Physics.checkForFastBodies) {
+            for (const collider of potentialColliders) {
+                const body = collider.owner.get(BodyComponent);
+                // Skip non-active objects. Does not make sense on other collision types
+                if (body.collisionType !== CollisionType.Active) {
+                    continue;
+                }
+                // Maximum travel distance next frame
+                const updateDistance = body.vel.size * seconds + // velocity term
+                    body.acc.size * 0.5 * seconds * seconds; // acc term
+                // Find the minimum dimension
+                const minDimension = Math.min(collider.bounds.height, collider.bounds.width);
+                if (Physics.disableMinimumSpeedForFastBody || updateDistance > minDimension / 2) {
+                    if (stats) {
+                        stats.physics.fastBodies++;
+                    }
+                    // start with the oldPos because the integration for actors has already happened
+                    // objects resting on a surface may be slightly penetrating in the current position
+                    const updateVec = body.pos.sub(body.oldPos);
+                    const centerPoint = collider.center;
+                    const furthestPoint = collider.getFurthestPoint(body.vel);
+                    const origin = furthestPoint.sub(updateVec);
+                    const ray = new Ray(origin, body.vel);
+                    // back the ray up by -2x surfaceEpsilon to account for fast moving objects starting on the surface
+                    ray.pos = ray.pos.add(ray.dir.scale(-2 * Physics.surfaceEpsilon));
+                    let minCollider;
+                    let minTranslate = new Vector(Infinity, Infinity);
+                    this._dynamicCollisionTree.rayCastQuery(ray, updateDistance + Physics.surfaceEpsilon * 2, (other) => {
+                        if (!this._pairExists(collider, other) && Pair.canCollide(collider, other)) {
+                            const hitPoint = other.rayCast(ray, updateDistance + Physics.surfaceEpsilon * 10);
+                            if (hitPoint) {
+                                const translate = hitPoint.sub(origin);
+                                if (translate.size < minTranslate.size) {
+                                    minTranslate = translate;
+                                    minCollider = other;
+                                }
+                            }
+                        }
+                        return false;
+                    });
+                    if (minCollider && Vector.isValid(minTranslate)) {
+                        const pair = new Pair(collider, minCollider);
+                        if (!this._pairs.has(pair.id)) {
+                            this._pairs.add(pair.id);
+                            this._collisionPairCache.push(pair);
+                        }
+                        // move the fast moving object to the other body
+                        // need to push into the surface by ex.Physics.surfaceEpsilon
+                        const shift = centerPoint.sub(furthestPoint);
+                        body.pos = origin
+                            .add(shift)
+                            .add(minTranslate)
+                            .add(ray.dir.scale(10 * Physics.surfaceEpsilon)); // needed to push the shape slightly into contact
+                        collider.update(body.transform);
+                        if (stats) {
+                            stats.physics.fastBodyCollisions++;
+                        }
+                    }
+                }
+            }
+        }
+        // return cache
+        return this._collisionPairCache;
+    }
+    /**
+     * Applies narrow phase on collision pairs to find actual area intersections
+     * Adds actual colliding pairs to stats' Frame data
+     */
+    narrowphase(pairs, stats) {
+        let contacts = [];
+        for (let i = 0; i < pairs.length; i++) {
+            const newContacts = pairs[i].collide();
+            contacts = contacts.concat(newContacts);
+            if (stats && newContacts.length > 0) {
+                for (const c of newContacts) {
+                    stats.physics.contacts.set(c.id, c);
+                }
+            }
+        }
+        if (stats) {
+            stats.physics.collisions += contacts.length;
+        }
+        return contacts;
+    }
+    /**
+     * Update the dynamic tree positions
+     */
+    update(targets) {
+        let updated = 0;
+        const len = targets.length;
+        for (let i = 0; i < len; i++) {
+            if (this._dynamicCollisionTree.updateCollider(targets[i])) {
+                updated++;
+            }
+        }
+        return updated;
+    }
+    debug(ex) {
+        this._dynamicCollisionTree.debug(ex);
+    }
+}
+//# sourceMappingURL=DynamicTreeCollisionProcessor.js.map