@vpmedia/phaser 1.11.0 → 1.13.0

package/src/phaser/display/webgl/earcut.js

@@ -1,15 +1,15 @@
 /**
+ * @copyright    Copyright (c) 2018-present Richard Davey, Photon Storm Ltd., Andras Csizmadia <andras@vpmedia.hu> (www.vpmedia.hu)
  * @author       Andras Csizmadia <andras@vpmedia.hu>
  * @author       Richard Davey <rich@photonstorm.com>
  * @author       Mat Groves http://matgroves.com/ @Doormat23
- * @copyright    Copyright (c) 2018-present Richard Davey, Photon Storm Ltd., Andras Csizmadia <andras@vpmedia.hu> (www.vpmedia.hu)
  */
 import Node from './earcut_node';
 
 /**
  *
- * @param {object} list TBD
- * @returns {object} TBD
+ * @param {object} list - TBD.
+ * @returns {object} TBD.
  */
 export function sortLinked(list) {
   let i;
@@ -74,9 +74,9 @@ export function sortLinked(list) {
 
 /**
  *
- * @param {object} a TBD
- * @param {object} b TBD
- * @returns {number} TBD
+ * @param {object} a - TBD.
+ * @param {object} b - TBD.
+ * @returns {number} TBD.
  */
 export function compareX(a, b) {
   return a.x - b.x;
@@ -84,23 +84,23 @@ export function compareX(a, b) {
 
 /**
  *
- * @param {number} x TBD
- * @param {number} y TBD
- * @param {number} minX TBD
- * @param {number} minY TBD
- * @param {number} size TBD
- * @returns {number} TBD
+ * @param {number} x - TBD.
+ * @param {number} y - TBD.
+ * @param {number} minX - TBD.
+ * @param {number} minY - TBD.
+ * @param {number} size - TBD.
+ * @returns {number} TBD.
  */
 export function zOrder(x, y, minX, minY, size) {
   // coords are transformed into non-negative 15-bit integer range
-  x = 32767 * (x - minX) / size;
-  y = 32767 * (y - minY) / size;
-  x = (x | (x << 8)) & 0x00FF00FF;
-  x = (x | (x << 4)) & 0x0F0F0F0F;
+  x = (32767 * (x - minX)) / size;
+  y = (32767 * (y - minY)) / size;
+  x = (x | (x << 8)) & 0x00ff00ff;
+  x = (x | (x << 4)) & 0x0f0f0f0f;
   x = (x | (x << 2)) & 0x33333333;
   x = (x | (x << 1)) & 0x55555555;
-  y = (y | (y << 8)) & 0x00FF00FF;
-  y = (y | (y << 4)) & 0x0F0F0F0F;
+  y = (y | (y << 8)) & 0x00ff00ff;
+  y = (y | (y << 4)) & 0x0f0f0f0f;
   y = (y | (y << 2)) & 0x33333333;
   y = (y | (y << 1)) & 0x55555555;
   return x | (y << 1);
@@ -108,10 +108,10 @@ export function zOrder(x, y, minX, minY, size) {
 
 /**
  *
- * @param {object} start TBD
- * @param {number} minX TBD
- * @param {number} minY TBD
- * @param {number} size TBD
+ * @param {object} start - TBD.
+ * @param {number} minX - TBD.
+ * @param {number} minY - TBD.
+ * @param {number} size - TBD.
  */
 export function indexCurve(start, minX, minY, size) {
   let p = start;
@@ -128,8 +128,8 @@ export function indexCurve(start, minX, minY, size) {
 
 /**
  *
- * @param {object} start TBD
- * @returns {object} TBD
+ * @param {object} start - TBD.
+ * @returns {object} TBD.
  */
 export function getLeftmost(start) {
   let p = start;
@@ -143,26 +143,30 @@ export function getLeftmost(start) {
 
 /**
  *
- * @param {number} ax TBD
- * @param {number} ay TBD
- * @param {number} bx TBD
- * @param {number} by TBD
- * @param {number} cx TBD
- * @param {number} cy TBD
- * @param {number} px TBD
- * @param {number} py TBD
- * @returns {object} TBD
+ * @param {number} ax - TBD.
+ * @param {number} ay - TBD.
+ * @param {number} bx - TBD.
+ * @param {number} by - TBD.
+ * @param {number} cx - TBD.
+ * @param {number} cy - TBD.
+ * @param {number} px - TBD.
+ * @param {number} py - TBD.
+ * @returns {object} TBD.
  */
 export function pointInTriangle(ax, ay, bx, by, cx, cy, px, py) {
-  return (cx - px) * (ay - py) - (ax - px) * (cy - py) >= 0 && (ax - px) * (by - py) - (bx - px) * (ay - py) >= 0 && (bx - px) * (cy - py) - (cx - px) * (by - py) >= 0;
+  return (
+    (cx - px) * (ay - py) - (ax - px) * (cy - py) >= 0 &&
+    (ax - px) * (by - py) - (bx - px) * (ay - py) >= 0 &&
+    (bx - px) * (cy - py) - (cx - px) * (by - py) >= 0
+  );
 }
 
 /**
  *
- * @param {object} p TBD
- * @param {object} q TBD
- * @param {object} r TBD
- * @returns {number} TBD
+ * @param {object} p - TBD.
+ * @param {object} q - TBD.
+ * @param {object} r - TBD.
+ * @returns {number} TBD.
  */
 export function area(p, q, r) {
   return (q.y - p.y) * (r.x - q.x) - (q.x - p.x) * (r.y - q.y);
@@ -170,9 +174,9 @@ export function area(p, q, r) {
 
 /**
  *
- * @param {object} p1 TBD
- * @param {object} p2 TBD
- * @returns {boolean} TBD
+ * @param {object} p1 - TBD.
+ * @param {object} p2 - TBD.
+ * @returns {boolean} TBD.
  */
 export function equals(p1, p2) {
   return p1.x === p2.x && p1.y === p2.y;
@@ -180,26 +184,35 @@ export function equals(p1, p2) {
 
 /**
  *
- * @param {object} p1 TBD
- * @param {object} q1 TBD
- * @param {object} p2 TBD
- * @param {object} q2 TBD
- * @returns {boolean} TBD
+ * @param {object} p1 - TBD.
+ * @param {object} q1 - TBD.
+ * @param {object} p2 - TBD.
+ * @param {object} q2 - TBD.
+ * @returns {boolean} TBD.
  */
 export function intersects(p1, q1, p2, q2) {
-  return area(p1, q1, p2) > 0 !== area(p1, q1, q2) > 0 && area(p2, q2, p1) > 0 !== area(p2, q2, q1) > 0;
+  return (
+    area(p1, q1, p2) > 0 !== area(p1, q1, q2) > 0 && area(p2, q2, p1) > 0 !== area(p2, q2, q1) > 0
+  );
 }
 
 /**
  *
- * @param {object} a TBD
- * @param {object} b TBD
- * @returns {boolean} TBD
+ * @param {object} a - TBD.
+ * @param {object} b - TBD.
+ * @returns {boolean} TBD.
  */
 export function intersectsPolygon(a, b) {
   let p = a;
   do {
-    if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i && intersects(p, p.next, a, b)) return true;
+    if (
+      p.i !== a.i &&
+      p.next.i !== a.i &&
+      p.i !== b.i &&
+      p.next.i !== b.i &&
+      intersects(p, p.next, a, b)
+    )
+      return true;
     p = p.next;
   } while (p !== a);
   return false;
@@ -207,19 +220,21 @@ export function intersectsPolygon(a, b) {
 
 /**
  *
- * @param {object} a TBD
- * @param {object} b TBD
- * @returns {object} TBD
+ * @param {object} a - TBD.
+ * @param {object} b - TBD.
+ * @returns {object} TBD.
  */
 export function locallyInside(a, b) {
-  return area(a.prev, a, a.next) < 0 ? area(a, b, a.next) >= 0 && area(a, a.prev, b) >= 0 : area(a, b, a.prev) < 0 || area(a, a.next, b) < 0;
+  return area(a.prev, a, a.next) < 0
+    ? area(a, b, a.next) >= 0 && area(a, a.prev, b) >= 0
+    : area(a, b, a.prev) < 0 || area(a, a.next, b) < 0;
 }
 
 /**
  *
- * @param {object} a TBD
- * @param {object} b TBD
- * @returns {boolean} TBD
+ * @param {object} a - TBD.
+ * @param {object} b - TBD.
+ * @returns {boolean} TBD.
  */
 export function middleInside(a, b) {
   let p = a;
@@ -227,7 +242,10 @@ export function middleInside(a, b) {
   const px = (a.x + b.x) / 2;
   const py = (a.y + b.y) / 2;
   do {
-    if (((p.y > py) !== (p.next.y > py)) && (px < (p.next.x - p.x) * (py - p.y) / (p.next.y - p.y) + p.x)) {
+    if (
+      p.y > py !== p.next.y > py &&
+      px < ((p.next.x - p.x) * (py - p.y)) / (p.next.y - p.y) + p.x
+    ) {
       inside = !inside;
     }
     p = p.next;
@@ -237,19 +255,27 @@ export function middleInside(a, b) {
 
 /**
  *
- * @param {object} a TBD
- * @param {object} b TBD
- * @returns {boolean} TBD
+ * @param {object} a - TBD.
+ * @param {object} b - TBD.
+ * @returns {boolean} TBD.
  */
 export function isValidDiagonal(a, b) {
-  return equals(a, b) || a.next.i !== b.i && a.prev.i !== b.i && !intersectsPolygon(a, b) && locallyInside(a, b) && locallyInside(b, a) && middleInside(a, b);
+  return (
+    equals(a, b) ||
+    (a.next.i !== b.i &&
+      a.prev.i !== b.i &&
+      !intersectsPolygon(a, b) &&
+      locallyInside(a, b) &&
+      locallyInside(b, a) &&
+      middleInside(a, b))
+  );
 }
 
 /**
  *
- * @param {object} a TBD
- * @param {object} b TBD
- * @returns {object} TBD
+ * @param {object} a - TBD.
+ * @param {object} b - TBD.
+ * @returns {object} TBD.
  */
 export function splitPolygon(a, b) {
   const a2 = new Node(a.i, a.x, a.y);
@@ -269,11 +295,11 @@ export function splitPolygon(a, b) {
 
 /**
  *
- * @param {number} i TBD
- * @param {number} x TBD
- * @param {number} y TBD
- * @param {object} last TBD
- * @returns {object} TBD
+ * @param {number} i - TBD.
+ * @param {number} x - TBD.
+ * @param {number} y - TBD.
+ * @param {object} last - TBD.
+ * @returns {object} TBD.
  */
 export function insertNode(i, x, y, last) {
   const p = new Node(i, x, y);
@@ -291,7 +317,7 @@ export function insertNode(i, x, y, last) {
 
 /**
  *
- * @param {object} p TBD
+ * @param {object} p - TBD.
  */
 export function removeNode(p) {
   p.next.prev = p.prev;
@@ -306,8 +332,8 @@ export function removeNode(p) {
 
 /**
  *
- * @param {object} ear TBD
- * @returns {boolean} TBD
+ * @param {object} ear - TBD.
+ * @returns {boolean} TBD.
  */
 export function isEar(ear) {
   const a = ear.prev;
@@ -317,7 +343,8 @@ export function isEar(ear) {
   // now make sure we don't have other points inside the potential ear
   let p = ear.next.next;
   while (p !== ear.prev) {
-    if (pointInTriangle(a.x, a.y, b.x, b.y, c.x, c.y, p.x, p.y) && area(p.prev, p, p.next) >= 0) return false;
+    if (pointInTriangle(a.x, a.y, b.x, b.y, c.x, c.y, p.x, p.y) && area(p.prev, p, p.next) >= 0)
+      return false;
     p = p.next;
   }
   return true;
@@ -325,11 +352,11 @@ export function isEar(ear) {
 
 /**
  *
- * @param {object} ear TBD
- * @param {number} minX TBD
- * @param {number} minY TBD
- * @param {number} size TBD
- * @returns {boolean} TBD
+ * @param {object} ear - TBD.
+ * @param {number} minX - TBD.
+ * @param {number} minY - TBD.
+ * @param {number} size - TBD.
+ * @returns {boolean} TBD.
  */
 export function isEarHashed(ear, minX, minY, size) {
   const a = ear.prev;
@@ -337,17 +364,22 @@ export function isEarHashed(ear, minX, minY, size) {
   const c = ear.next;
   if (area(a, b, c) >= 0) return false; // reflex, can't be an ear
   // triangle bbox; min & max are calculated like this for speed
-  const minTX = a.x < b.x ? (a.x < c.x ? a.x : c.x) : (b.x < c.x ? b.x : c.x);
-  const minTY = a.y < b.y ? (a.y < c.y ? a.y : c.y) : (b.y < c.y ? b.y : c.y);
-  const maxTX = a.x > b.x ? (a.x > c.x ? a.x : c.x) : (b.x > c.x ? b.x : c.x);
-  const maxTY = a.y > b.y ? (a.y > c.y ? a.y : c.y) : (b.y > c.y ? b.y : c.y);
+  const minTX = a.x < b.x ? (a.x < c.x ? a.x : c.x) : b.x < c.x ? b.x : c.x;
+  const minTY = a.y < b.y ? (a.y < c.y ? a.y : c.y) : b.y < c.y ? b.y : c.y;
+  const maxTX = a.x > b.x ? (a.x > c.x ? a.x : c.x) : b.x > c.x ? b.x : c.x;
+  const maxTY = a.y > b.y ? (a.y > c.y ? a.y : c.y) : b.y > c.y ? b.y : c.y;
   // z-order range for the current triangle bbox;
   const minZ = zOrder(minTX, minTY, minX, minY, size);
   const maxZ = zOrder(maxTX, maxTY, minX, minY, size);
   // first look for points inside the triangle in increasing z-order
   let p = ear.nextZ;
   while (p && p.z <= maxZ) {
-    if (p !== ear.prev && p !== ear.next && pointInTriangle(a.x, a.y, b.x, b.y, c.x, c.y, p.x, p.y) && area(p.prev, p, p.next) >= 0) {
+    if (
+      p !== ear.prev &&
+      p !== ear.next &&
+      pointInTriangle(a.x, a.y, b.x, b.y, c.x, c.y, p.x, p.y) &&
+      area(p.prev, p, p.next) >= 0
+    ) {
       return false;
     }
     p = p.nextZ;
@@ -355,7 +387,12 @@ export function isEarHashed(ear, minX, minY, size) {
   // then look for points in decreasing z-order
   p = ear.prevZ;
   while (p && p.z >= minZ) {
-    if (p !== ear.prev && p !== ear.next && pointInTriangle(a.x, a.y, b.x, b.y, c.x, c.y, p.x, p.y) && area(p.prev, p, p.next) >= 0) {
+    if (
+      p !== ear.prev &&
+      p !== ear.next &&
+      pointInTriangle(a.x, a.y, b.x, b.y, c.x, c.y, p.x, p.y) &&
+      area(p.prev, p, p.next) >= 0
+    ) {
       return false;
     }
     p = p.prevZ;
@@ -365,12 +402,12 @@ export function isEarHashed(ear, minX, minY, size) {
 
 /**
  *
- * @param {object} data TBD
- * @param {number} start TBD
- * @param {number} end TBD
- * @param {number} dim TBD
- * @param {boolean} clockwise TBD
- * @returns {object} TBD
+ * @param {object} data - TBD.
+ * @param {number} start - TBD.
+ * @param {number} end - TBD.
+ * @param {number} dim - TBD.
+ * @param {boolean} clockwise - TBD.
+ * @returns {object} TBD.
  */
 export function linkedList(data, start, end, dim, clockwise) {
   let sum = 0;
@@ -383,7 +420,7 @@ export function linkedList(data, start, end, dim, clockwise) {
     j = i;
   }
   // link points into circular doubly-linked list in the specified winding order
-  if (clockwise === (sum > 0)) {
+  if (clockwise === sum > 0) {
     for (i = start; i < end; i += dim) last = insertNode(i, data[i], data[i + 1], last);
   } else {
     for (i = end - dim; i >= start; i -= dim) last = insertNode(i, data[i], data[i + 1], last);
@@ -393,9 +430,9 @@ export function linkedList(data, start, end, dim, clockwise) {
 
 /**
  *
- * @param {object} start TBD
- * @param {object} end TBD
- * @returns {object} TBD
+ * @param {object} start - TBD.
+ * @param {object} end - TBD.
+ * @returns {object} TBD.
  */
 export function filterPoints(start, end) {
   if (!start) return start;
@@ -419,9 +456,9 @@ export function filterPoints(start, end) {
 
 /**
  *
- * @param {object} hole TBD
- * @param {object} outerNode TBD
- * @returns {object} TBD
+ * @param {object} hole - TBD.
+ * @param {object} outerNode - TBD.
+ * @returns {object} TBD.
  */
 export function findHoleBridge(hole, outerNode) {
   let p = outerNode;
@@ -433,7 +470,7 @@ export function findHoleBridge(hole, outerNode) {
   // segment's endpoint with lesser x will be potential connection point
   do {
     if (hy <= p.y && hy >= p.next.y) {
-      const x = p.x + (hy - p.y) * (p.next.x - p.x) / (p.next.y - p.y);
+      const x = p.x + ((hy - p.y) * (p.next.x - p.x)) / (p.next.y - p.y);
       if (x <= hx && x > qx) {
         qx = x;
         m = p.x < p.next.x ? p : p.next;
@@ -451,7 +488,11 @@ export function findHoleBridge(hole, outerNode) {
   let tan;
   p = m.next;
   while (p !== stop) {
-    if (hx >= p.x && p.x >= m.x && pointInTriangle(hy < m.y ? hx : qx, hy, m.x, m.y, hy < m.y ? qx : hx, hy, p.x, p.y)) {
+    if (
+      hx >= p.x &&
+      p.x >= m.x &&
+      pointInTriangle(hy < m.y ? hx : qx, hy, m.x, m.y, hy < m.y ? qx : hx, hy, p.x, p.y)
+    ) {
       tan = Math.abs(hy - p.y) / (hx - p.x); // tangential
       if ((tan < tanMin || (tan === tanMin && p.x > m.x)) && locallyInside(p, hole)) {
         m = p;
@@ -465,8 +506,8 @@ export function findHoleBridge(hole, outerNode) {
 
 /**
  *
- * @param {object} hole TBD
- * @param {object} outerNode TBD
+ * @param {object} hole - TBD.
+ * @param {object} outerNode - TBD.
  */
 export function eliminateHole(hole, outerNode) {
   outerNode = findHoleBridge(hole, outerNode);
@@ -478,11 +519,11 @@ export function eliminateHole(hole, outerNode) {
 
 /**
  *
- * @param {object} data TBD
- * @param {object} holeIndices TBD
- * @param {object} outerNode TBD
- * @param {object} dim TBD
- * @returns {object} TBD
+ * @param {object} data - TBD.
+ * @param {object} holeIndices - TBD.
+ * @param {object} outerNode - TBD.
+ * @param {object} dim - TBD.
+ * @returns {object} TBD.
  */
 export function eliminateHoles(data, holeIndices, outerNode, dim) {
   const queue = [];
@@ -509,10 +550,10 @@ export function eliminateHoles(data, holeIndices, outerNode, dim) {
 
 /**
  *
- * @param {object} start TBD
- * @param {object} triangles TBD
- * @param {number} dim TBD
- * @returns {object} TBD
+ * @param {object} start - TBD.
+ * @param {object} triangles - TBD.
+ * @param {number} dim - TBD.
+ * @returns {object} TBD.
  */
 export function cureLocalIntersections(start, triangles, dim) {
   let p = start;
@@ -537,12 +578,12 @@ export function cureLocalIntersections(start, triangles, dim) {
 
 /**
  *
- * @param {object} start TBD
- * @param {object} triangles TBD
- * @param {number} dim TBD
- * @param {number} minX TBD
- * @param {number} minY TBD
- * @param {number} size TBD
+ * @param {object} start - TBD.
+ * @param {object} triangles - TBD.
+ * @param {number} dim - TBD.
+ * @param {number} minX - TBD.
+ * @param {number} minY - TBD.
+ * @param {number} size - TBD.
  */
 export function splitEarcut(start, triangles, dim, minX, minY, size) {
   // look for a valid diagonal that divides the polygon into two
@@ -569,13 +610,13 @@ export function splitEarcut(start, triangles, dim, minX, minY, size) {
 
 /**
  *
- * @param {object} ear TBD
- * @param {object} triangles TBD
- * @param {number} dim TBD
- * @param {number} minX TBD
- * @param {number} minY TBD
- * @param {number} size TBD
- * @param {object} pass TBD
+ * @param {object} ear - TBD.
+ * @param {object} triangles - TBD.
+ * @param {number} dim - TBD.
+ * @param {number} minX - TBD.
+ * @param {number} minY - TBD.
+ * @param {number} size - TBD.
+ * @param {object} pass - TBD.
  */
 export function earcutLinked(ear, triangles, dim, minX, minY, size, pass) {
   if (!ear) return;
@@ -620,10 +661,10 @@ export function earcutLinked(ear, triangles, dim, minX, minY, size, pass) {
 
 /**
  *
- * @param {object} data TBD
- * @param {object} holeIndices TBD
- * @param {number} dim TBD
- * @returns {object} TBD
+ * @param {object} data - TBD.
+ * @param {object} holeIndices - TBD.
+ * @param {number} dim - TBD.
+ * @returns {object} TBD.
  */
 export function triangulate(data, holeIndices, dim) {
   dim = dim || 2;

package/src/phaser/display/webgl/earcut_node.js

@@ -1,12 +1,11 @@
 /**
+ * @copyright    Copyright (c) 2018-present Richard Davey, Photon Storm Ltd., Andras Csizmadia <andras@vpmedia.hu> (www.vpmedia.hu)
  * @author       Andras Csizmadia <andras@vpmedia.hu>
  * @author       Richard Davey <rich@photonstorm.com>
  * @author       Mat Groves http://matgroves.com/ @Doormat23
- * @copyright    Copyright (c) 2018-present Richard Davey, Photon Storm Ltd., Andras Csizmadia <andras@vpmedia.hu> (www.vpmedia.hu)
  */
 
 export default class {
-
   constructor(i, x, y) {
     // vertice index in coordinates array
     this.i = i;
@@ -24,5 +23,4 @@ export default class {
     // indicates whether this is a steiner point
     this.steiner = false;
   }
-
 }