melonjs 14.5.0 → 15.1.0

package/src/physics/quadtree.js

@@ -11,7 +11,7 @@ import * as arrayUtil from "./../utils/array.js";
  * a pool of `QuadTree` objects
  * @ignore
  */
-var QT_ARRAY = [];
+let QT_ARRAY = [];
 
 /**
  * will pop a quadtree object from the array
@@ -20,7 +20,7 @@ var QT_ARRAY = [];
  */
 function QT_ARRAY_POP(world, bounds, max_objects = 4, max_levels = 4, level = 0) {
     if (QT_ARRAY.length > 0) {
-        var _qt =  QT_ARRAY.pop();
+        let _qt =  QT_ARRAY.pop();
         _qt.world = world;
         _qt.bounds = bounds;
         _qt.max_objects = max_objects;
@@ -44,7 +44,7 @@ function QT_ARRAY_PUSH(qt) {
  * a temporary vector object to be reused
  * @ignore
  */
-var QT_VECTOR = new Vector2d();
+let QT_VECTOR = new Vector2d();
 
 /**
  * @classdesc
@@ -77,7 +77,7 @@ var QT_VECTOR = new Vector2d();
      * Split the node into 4 subnodes
      */
     split() {
-        var nextLevel = this.level + 1,
+        let nextLevel = this.level + 1,
             subWidth  = this.bounds.width / 2,
             subHeight = this.bounds.height / 2,
             left = this.bounds.left,
@@ -146,8 +146,8 @@ var QT_VECTOR = new Vector2d();
      * @returns Integer index of the subnode (0-3), or -1 if rect cannot completely fit within a subnode and is part of the parent node
      */
     getIndex(item) {
-        var pos;
-        var bounds = item.getBounds();
+        let pos;
+        let bounds = item.getBounds();
 
         // use game world coordinates for floating items
         if (item.isFloating === true) {
@@ -156,7 +156,7 @@ var QT_VECTOR = new Vector2d();
             pos = QT_VECTOR.set(item.left, item.top);
         }
 
-        var index = -1,
+        let index = -1,
             rx = pos.x,
             ry = pos.y,
             rw = bounds.width,
@@ -194,7 +194,7 @@ var QT_VECTOR = new Vector2d();
      * @param {Container} container - group of objects to be added
      */
     insertContainer(container) {
-        for (var i = container.children.length, child; i--, (child = container.children[i]);) {
+        for (let i = container.children.length, child; i--, (child = container.children[i]);) {
             if (child.isKinematic !== true) {
                 if (typeof child.addChild === "function") {
                     if (child.name !== "rootContainer") {
@@ -222,7 +222,7 @@ var QT_VECTOR = new Vector2d();
      * @param {object} item - object to be added
      */
     insert(item) {
-        var index = -1;
+        let index = -1;
 
         //if we have subnodes ...
         if (this.nodes.length > 0) {
@@ -243,7 +243,7 @@ var QT_VECTOR = new Vector2d();
                 this.split();
             }
 
-            var i = 0;
+            let i = 0;
 
             //add all objects to there corresponding subnodes
             while (i < this.objects.length) {
@@ -268,19 +268,19 @@ var QT_VECTOR = new Vector2d();
      * @returns {object[]} array with all detected objects
      */
     retrieve(item, fn) {
-        var returnObjects = this.objects;
+        let returnObjects = this.objects;
 
         //if we have subnodes ...
         if (this.nodes.length > 0) {
 
-            var index = this.getIndex(item);
+            let index = this.getIndex(item);
 
             //if rect fits into a subnode ..
             if (index !== -1) {
                 returnObjects = returnObjects.concat(this.nodes[index].retrieve(item));
             } else {
                  //if rect does not fit into a subnode, check it against all subnodes
-                for (var i = 0; i < this.nodes.length; i = i + 1) {
+                for (let i = 0; i < this.nodes.length; i = i + 1) {
                     returnObjects = returnObjects.concat(this.nodes[i].retrieve(item));
                 }
             }
@@ -302,7 +302,7 @@ var QT_VECTOR = new Vector2d();
      * @returns {boolean} true if the item was found and removed.
      */
      remove(item) {
-        var found = false;
+        let found = false;
 
         if (typeof (item.getBounds) === "undefined") {
             // ignore object that cannot be added in the first place
@@ -312,7 +312,7 @@ var QT_VECTOR = new Vector2d();
         //if we have subnodes ...
         if (this.nodes.length > 0) {
             // determine to which node the item belongs to
-            var index = this.getIndex(item);
+            let index = this.getIndex(item);
 
             if (index !== -1) {
                 found = arrayUtil.remove(this.nodes[index], item);
@@ -351,8 +351,8 @@ var QT_VECTOR = new Vector2d();
      * @returns {boolean} true if the node has any children
      */
     hasChildren() {
-        for (var i = 0; i < this.nodes.length; i = i + 1) {
-            var subnode = this.nodes[i];
+        for (let i = 0; i < this.nodes.length; i = i + 1) {
+            let subnode = this.nodes[i];
             if (subnode.length > 0 || subnode.objects.length > 0) {
                 return true;
             }
@@ -369,7 +369,7 @@ var QT_VECTOR = new Vector2d();
     clear(bounds) {
         this.objects.length = 0;
 
-        for (var i = 0; i < this.nodes.length; i++) {
+        for (let i = 0; i < this.nodes.length; i++) {
             this.nodes[i].clear();
             // recycle the quadTree object
             QT_ARRAY_PUSH(this.nodes[i]);

package/src/physics/sat.js

@@ -29,16 +29,16 @@ const RIGHT_VORNOI_REGION = 1;
  * @type {Array.<Vector2d>}
  * @ignore
  */
-var T_VECTORS = [];
-for (var v = 0; v < 10; v++) { T_VECTORS.push(new Vector2d()); }
+let T_VECTORS = [];
+for (let v = 0; v < 10; v++) { T_VECTORS.push(new Vector2d()); }
 
 /**
  * A pool of arrays of numbers used in calculations to avoid allocating memory.
  * @type {Array.<Array.<number>>}
  * @ignore
  */
-var T_ARRAYS = [];
-for (var a = 0; a < 5; a++) { T_ARRAYS.push([]); }
+let T_ARRAYS = [];
+for (let a = 0; a < 5; a++) { T_ARRAYS.push([]); }
 
 
 /**
@@ -53,12 +53,12 @@ for (var a = 0; a < 5; a++) { T_ARRAYS.push([]); }
  *   result[1] will be the maximum value.
  */
 function flattenPointsOn(points, normal, result) {
-    var min = Number.MAX_VALUE;
-    var max = -Number.MAX_VALUE;
-    var len = points.length;
-    for (var i = 0; i < len; i++) {
+    let min = Number.MAX_VALUE;
+    let max = -Number.MAX_VALUE;
+    let len = points.length;
+    for (let i = 0; i < len; i++) {
         // The magnitude of the projection of the point onto the normal
-        var dot = points[i].dot(normal);
+        let dot = points[i].dot(normal);
         if (dot < min) { min = dot; }
         if (dot > max) { max = dot; }
     }
@@ -83,11 +83,11 @@ function flattenPointsOn(points, normal, result) {
  *   the direction of the overlap will be populated.
  */
 function isSeparatingAxis(aPos, bPos, aPoints, bPoints, axis, response) {
-    var rangeA = T_ARRAYS.pop();
-    var rangeB = T_ARRAYS.pop();
+    let rangeA = T_ARRAYS.pop();
+    let rangeB = T_ARRAYS.pop();
     // The magnitude of the offset between the two polygons
-    var offsetV = T_VECTORS.pop().copy(bPos).sub(aPos);
-    var projectedOffset = offsetV.dot(axis);
+    let offsetV = T_VECTORS.pop().copy(bPos).sub(aPos);
+    let projectedOffset = offsetV.dot(axis);
 
     // Project the polygons onto the axis.
     flattenPointsOn(aPoints, axis, rangeA);
@@ -105,7 +105,7 @@ function isSeparatingAxis(aPos, bPos, aPoints, bPoints, axis, response) {
 
     // This is not a separating axis. If we're calculating a response, calculate the overlap.
     if (response) {
-        var overlap = 0;
+        let overlap = 0;
         // A starts further left than B
         if (rangeA[0] < rangeB[0]) {
             response.aInB = false;
@@ -115,8 +115,8 @@ function isSeparatingAxis(aPos, bPos, aPoints, bPoints, axis, response) {
                 response.bInA = false;
             // B is fully inside A.  Pick the shortest way out.
             } else {
-                var option1 = rangeA[1] - rangeB[0];
-                var option2 = rangeB[1] - rangeA[0];
+                let option1 = rangeA[1] - rangeB[0];
+                let option2 = rangeB[1] - rangeA[0];
                 overlap = option1 < option2 ? option1 : -option2;
             }
         // B starts further left than A
@@ -128,14 +128,14 @@ function isSeparatingAxis(aPos, bPos, aPoints, bPoints, axis, response) {
                 response.aInB = false;
             // A is fully inside B.  Pick the shortest way out.
             } else {
-                var option11 = rangeA[1] - rangeB[0];
-                var option22 = rangeB[1] - rangeA[0];
+                let option11 = rangeA[1] - rangeB[0];
+                let option22 = rangeB[1] - rangeA[0];
                 overlap = option11 < option22 ? option11 : -option22;
             }
         }
 
         // If this is the smallest amount of overlap we've seen so far, set it as the minimum overlap.
-        var absOverlap = Math.abs(overlap);
+        let absOverlap = Math.abs(overlap);
         if (absOverlap < response.overlap) {
             response.overlap = absOverlap;
             response.overlapN.copy(axis);
@@ -168,8 +168,8 @@ function isSeparatingAxis(aPos, bPos, aPoints, bPoints, axis, response) {
  *          RIGHT_VORNOI_REGION (1) if it is the right region.
  */
 function vornoiRegion(line, point) {
-    var len2 = line.length2();
-    var dp = point.dot(line);
+    let len2 = line.length2();
+    let dp = point.dot(line);
     if (dp < 0) {
         // If the point is beyond the start of the line, it is in the
         // left vornoi region.
@@ -196,16 +196,16 @@ function vornoiRegion(line, point) {
  */
 export function testPolygonPolygon(a, polyA, b, polyB, response) {
     // specific point for
-    var aPoints = polyA.points;
-    var aNormals = polyA.normals;
-    var aLen = aNormals.length;
-    var bPoints = polyB.points;
-    var bNormals = polyB.normals;
-    var bLen = bNormals.length;
+    let aPoints = polyA.points;
+    let aNormals = polyA.normals;
+    let aLen = aNormals.length;
+    let bPoints = polyB.points;
+    let bNormals = polyB.normals;
+    let bLen = bNormals.length;
     // aboslute shape position
-    var posA = T_VECTORS.pop().copy(a.pos).add(a.ancestor.getAbsolutePosition()).add(polyA.pos);
-    var posB = T_VECTORS.pop().copy(b.pos).add(b.ancestor.getAbsolutePosition()).add(polyB.pos);
-    var i;
+    let posA = T_VECTORS.pop().copy(a.pos).add(a.ancestor.getAbsolutePosition()).add(polyA.pos);
+    let posB = T_VECTORS.pop().copy(b.pos).add(b.ancestor.getAbsolutePosition()).add(polyB.pos);
+    let i;
 
     // If any of the edge normals of A is a separating axis, no intersection.
     for (i = 0; i < aLen; i++) {
@@ -252,13 +252,13 @@ export function testPolygonPolygon(a, polyA, b, polyB, response) {
 export function testEllipseEllipse(a, ellipseA, b, ellipseB, response) {
     // Check if the distance between the centers of the two
     // circles is greater than their combined radius.
-    var differenceV = T_VECTORS.pop().copy(b.pos).add(b.ancestor.getAbsolutePosition()).add(ellipseB.pos)
+    let differenceV = T_VECTORS.pop().copy(b.pos).add(b.ancestor.getAbsolutePosition()).add(ellipseB.pos)
         .sub(a.pos).add(a.ancestor.getAbsolutePosition()).sub(ellipseA.pos);
-    var radiusA = ellipseA.radius;
-    var radiusB = ellipseB.radius;
-    var totalRadius = radiusA + radiusB;
-    var totalRadiusSq = totalRadius * totalRadius;
-    var distanceSq = differenceV.length2();
+    let radiusA = ellipseA.radius;
+    let radiusB = ellipseB.radius;
+    let totalRadius = radiusA + radiusB;
+    let totalRadiusSq = totalRadius * totalRadius;
+    let distanceSq = differenceV.length2();
     // If the distance is bigger than the combined radius, they don't intersect.
     if (distanceSq > totalRadiusSq) {
         T_VECTORS.push(differenceV);
@@ -266,7 +266,7 @@ export function testEllipseEllipse(a, ellipseA, b, ellipseB, response) {
     }
     // They intersect.  If we're calculating a response, calculate the overlap.
     if (response) {
-        var dist = Math.sqrt(distanceSq);
+        let dist = Math.sqrt(distanceSq);
         response.a = a;
         response.b = b;
         response.overlap = totalRadius - dist;
@@ -291,24 +291,24 @@ export function testEllipseEllipse(a, ellipseA, b, ellipseB, response) {
  */
 export function testPolygonEllipse(a, polyA, b, ellipseB, response) {
     // Get the position of the circle relative to the polygon.
-    var circlePos = T_VECTORS.pop().copy(b.pos).add(b.ancestor.getAbsolutePosition()).add(ellipseB.pos)
+    let circlePos = T_VECTORS.pop().copy(b.pos).add(b.ancestor.getAbsolutePosition()).add(ellipseB.pos)
         .sub(a.pos).add(a.ancestor.getAbsolutePosition()).sub(polyA.pos);
-    var radius = ellipseB.radius;
-    var radius2 = radius * radius;
-    var points = polyA.points;
-    var edges = polyA.edges;
-    var len = edges.length;
-    var edge = T_VECTORS.pop();
-    var normal = T_VECTORS.pop();
-    var point = T_VECTORS.pop();
-    var dist = 0;
+    let radius = ellipseB.radius;
+    let radius2 = radius * radius;
+    let points = polyA.points;
+    let edges = polyA.edges;
+    let len = edges.length;
+    let edge = T_VECTORS.pop();
+    let normal = T_VECTORS.pop();
+    let point = T_VECTORS.pop();
+    let dist = 0;
 
     // For each edge in the polygon:
-    for (var i = 0; i < len; i++) {
-        var next = i === len - 1 ? 0 : i + 1;
-        var prev = i === 0 ? len - 1 : i - 1;
-        var overlap = 0;
-        var overlapN = null;
+    for (let i = 0; i < len; i++) {
+        let next = i === len - 1 ? 0 : i + 1;
+        let prev = i === 0 ? len - 1 : i - 1;
+        let overlap = 0;
+        let overlapN = null;
 
         // Get the edge.
         edge.copy(edges[i]);
@@ -323,11 +323,11 @@ export function testPolygonEllipse(a, polyA, b, ellipseB, response) {
         }
 
         // Calculate which Vornoi region the center of the circle is in.
-        var region = vornoiRegion(edge, point);
-        var inRegion = true;
+        let region = vornoiRegion(edge, point);
+        let inRegion = true;
         // If it's the left region:
         if (region === LEFT_VORNOI_REGION) {
-            var point2 = null;
+            let point2 = null;
             if (len > 1) {
                 // We need to make sure we're in the RIGHT_VORNOI_REGION of the previous edge.
                 edge.copy(edges[prev]);
@@ -401,7 +401,7 @@ export function testPolygonEllipse(a, polyA, b, ellipseB, response) {
             // Find the perpendicular distance between the center of the
             // circle and the edge.
             dist = point.dot(normal);
-            var distAbs = Math.abs(dist);
+            let distAbs = Math.abs(dist);
             // If the circle is on the outside of the edge, there is no intersection.
             if ((len === 1 || dist > 0) && distAbs > radius) {
                 // No intersection
@@ -458,11 +458,11 @@ export function testPolygonEllipse(a, polyA, b, ellipseB, response) {
  */
 export function testEllipsePolygon(a, ellipseA, b, polyB, response) {
     // Test the polygon against the circle.
-    var result = testPolygonEllipse(b, polyB, a, ellipseA, response);
+    let result = testPolygonEllipse(b, polyB, a, ellipseA, response);
     if (result && response) {
         // Swap A and B in the response.
-        var resa = response.a;
-        var aInB = response.aInB;
+        let resa = response.a;
+        let aInB = response.aInB;
         response.overlapN.negateSelf();
         response.overlapV.negateSelf();
         response.a = response.b;

package/src/physics/world.js

@@ -140,7 +140,7 @@ import state from "./../state/state.js";
     bodyApplyGravity(body) {
         // apply gravity to the current velocity
         if (!body.ignoreGravity && body.gravityScale !== 0) {
-            var gravity = this.gravity;
+            let gravity = this.gravity;
 
             // apply gravity if defined
             body.force.x += (body.mass * gravity.x) * body.gravityScale;
@@ -154,7 +154,7 @@ import state from "./../state/state.js";
      * @returns {boolean} true if the word is dirty
      */
     update(dt) {
-        var isPaused = state.isPaused();
+        let isPaused = state.isPaused();
 
         // clear the quadtree
         this.broadphase.clear();
@@ -165,7 +165,7 @@ import state from "./../state/state.js";
         // iterate through all bodies
         this.bodies.forEach((body) => {
             if (!body.isStatic) {
-                var ancestor = body.ancestor;
+                let ancestor = body.ancestor;
                 // if the game is not paused, and ancestor can be updated
                 if (!(isPaused && (!ancestor.updateWhenPaused)) &&
                    (ancestor.inViewport || ancestor.alwaysUpdate)) {

package/src/plugin/plugin.js

@@ -6,7 +6,7 @@ import { version } from "./../index.js";
  * @see plugin.register
  * @namespace plugins
  */
-export var plugins = {};
+export let plugins = {};
 
 
 class BasePlugin {
@@ -27,7 +27,7 @@ class BasePlugin {
 /**
  * @namespace plugin
  */
-export var plugin = {
+export let plugin = {
 
     /**
      * a base Object for plugin <br>
@@ -64,14 +64,14 @@ export var plugin = {
         // reuse the logic behind object extends
         if (typeof(proto[name]) === "function") {
             // save the original function
-            var _parent = proto[name];
+            let _parent = proto[name];
             // override the function with the new one
             Object.defineProperty(proto, name, {
                 "configurable" : true,
                 "value" : (function (name, fn) {
                     return function () {
                         this._patched = _parent;
-                        var ret = fn.apply(this, arguments);
+                        let ret = fn.apply(this, arguments);
                         this._patched = null;
                         return ret;
                     };
@@ -90,7 +90,7 @@ export var plugin = {
      * @see Base
      * @public
      * @param {plugin.Base} pluginObj - Plugin object to instantiate and register
-     * @param {string} name
+     * @param {string} [name=pluginObj.constructor.name] - a unique name for this plugin
      * @param {object} [...arguments] - all extra parameters will be passed to the plugin constructor
      * @example
      * // register a new plugin
@@ -99,14 +99,14 @@ export var plugin = {
      * // under then me.plugins namespace
      * me.plugins.testPlugin.myfunction ();
      */
-    register : function (pluginObj, name) {
+    register : function (pluginObj, name = pluginObj.toString().match(/ (\w+)/)[1]) {
         // ensure me.plugins[name] is not already "used"
         if (plugins[name]) {
             throw new Error("plugin " + name + " already registered");
         }
 
         // get extra arguments
-        var _args = [];
+        let _args = [];
         if (arguments.length > 2) {
             // store extra arguments if any
             _args = Array.prototype.slice.call(arguments, 1);
@@ -114,7 +114,7 @@ export var plugin = {
 
         // try to instantiate the plugin
         _args[0] = pluginObj;
-        var instance = new (pluginObj.bind.apply(pluginObj, _args))();
+        let instance = new (pluginObj.bind.apply(pluginObj, _args))();
 
         // inheritance check
         if (typeof instance === "undefined" || !(instance instanceof plugin.Base)) {

package/src/polyfill/index.js

@@ -7,6 +7,4 @@ import "core-js/es/string/trim-end";
 
 // "built-in" polyfills
 import "./console.js";
-import "./performance.js";
-import "./requestAnimationFrame.js";
 import "./roundrect.js";

package/src/renderable/collectable.js

@@ -24,7 +24,7 @@ import pool from "./../system/pooling.js";
         this.id = settings.id;
 
         // add and configure the physic body
-        var shape = settings.shapes;
+        let shape = settings.shapes;
         if (typeof shape === "undefined") {
             shape = pool.pull("Polygon", 0, 0, [
                 pool.pull("Vector2d", 0,          0),