copy array length < 3

andriiheonia · Mar 28, 2019 · e2f2172 · e2f2172
1 parent 978e23e
commit e2f2172
Show file tree

Hide file tree

Showing 2 changed files with 8 additions and 7 deletions.
diff --git a/dist/hull.js b/dist/hull.js
@@ -284,7 +284,7 @@ function _concave(convex, maxSqEdgeLen, maxSearchArea, grid, edgeSkipList) {
             bBoxWidth = bBoxAround[2] - bBoxAround[0];
             bBoxHeight = bBoxAround[3] - bBoxAround[1];
 
-            midPoint = _midPoint(edge, grid.rangePoints(bBoxAround), convex);            
+            midPoint = _midPoint(edge, grid.rangePoints(bBoxAround), convex);
             scaleFactor++;
         }  while (midPoint === null && (maxSearchArea[0] > bBoxWidth || maxSearchArea[1] > bBoxHeight));
 
@@ -317,7 +317,7 @@ function hull(pointset, concavity, format) {
         maxEdgeLen = concavity || 20;
 
     if (pointset.length < 4) {
-        return pointset.concat([pointset[0]]);
+        return pointset.concat([pointset[0]]).slice();
     }
 
     points = _filterDuplicates(_sortByX(formatUtil.toXy(pointset, format)));
@@ -338,14 +338,15 @@ function hull(pointset, concavity, format) {
     concave = _concave(
         convex, Math.pow(maxEdgeLen, 2),
         maxSearchArea, grid(innerPoints, cellSize), {});
- 
+
     return formatUtil.fromXy(concave, format);
 }
 
 var MAX_CONCAVE_ANGLE_COS = Math.cos(90 / (180 / Math.PI)); // angle = 90 deg
 var MAX_SEARCH_BBOX_SIZE_PERCENT = 0.6;
 
 module.exports = hull;
+
 },{"./convex.js":1,"./format.js":2,"./grid.js":3,"./intersect.js":5}],5:[function(require,module,exports){
 function ccw(x1, y1, x2, y2, x3, y3) {           
     var cw = ((y3 - y1) * (x2 - x1)) - ((y2 - y1) * (x3 - x1));

diff --git a/src/hull.js b/src/hull.js
@@ -139,7 +139,7 @@ function _concave(convex, maxSqEdgeLen, maxSearchArea, grid, edgeSkipList) {
             bBoxWidth = bBoxAround[2] - bBoxAround[0];
             bBoxHeight = bBoxAround[3] - bBoxAround[1];
 
-            midPoint = _midPoint(edge, grid.rangePoints(bBoxAround), convex);            
+            midPoint = _midPoint(edge, grid.rangePoints(bBoxAround), convex);
             scaleFactor++;
         }  while (midPoint === null && (maxSearchArea[0] > bBoxWidth || maxSearchArea[1] > bBoxHeight));
 
@@ -172,7 +172,7 @@ function hull(pointset, concavity, format) {
         maxEdgeLen = concavity || 20;
 
     if (pointset.length < 4) {
-        return pointset.concat([pointset[0]]);
+        return pointset.concat([pointset[0]]).slice();
     }
 
     points = _filterDuplicates(_sortByX(formatUtil.toXy(pointset, format)));
@@ -193,11 +193,11 @@ function hull(pointset, concavity, format) {
     concave = _concave(
         convex, Math.pow(maxEdgeLen, 2),
         maxSearchArea, grid(innerPoints, cellSize), {});
- 
+
     return formatUtil.fromXy(concave, format);
 }
 
 var MAX_CONCAVE_ANGLE_COS = Math.cos(90 / (180 / Math.PI)); // angle = 90 deg
 var MAX_SEARCH_BBOX_SIZE_PERCENT = 0.6;
 
-module.exports = hull;
+module.exports = hull;