@twinmatrix/spatialverse-sdk-web 0.0.2 → 0.0.3

package/lib/cjs/meta-atlas-sdk/MetaAtlasCore/routing-core/utils.js

@@ -17,31 +17,19 @@ var turf = _interopRequireWildcard(require("@turf/turf"));
 var _geojsonRbush = _interopRequireDefault(require("geojson-rbush"));
 var _graphlib = require("@dagrejs/graphlib");
 var _lodash = require("lodash");
-var _interfaces = require("./interfaces");
-var _mapObjectsHelper = require("./mapObjectsHelper");
-function _interopRequireDefault(e) { return e && e.__esModule ? e : { "default": e }; }
-function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function _interopRequireWildcard(e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, "default": e }; if (null === e || "object" != _typeof(e) && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (var _t in e) "default" !== _t && {}.hasOwnProperty.call(e, _t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, _t)) && (i.get || i.set) ? o(f, _t, i) : f[_t] = e[_t]); return f; })(e, t); }
-function _typeof(o) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, _typeof(o); }
-function _toConsumableArray(r) { return _arrayWithoutHoles(r) || _iterableToArray(r) || _unsupportedIterableToArray(r) || _nonIterableSpread(); }
-function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
-function _unsupportedIterableToArray(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
-function _iterableToArray(r) { if ("undefined" != typeof Symbol && null != r[Symbol.iterator] || null != r["@@iterator"]) return Array.from(r); }
-function _arrayWithoutHoles(r) { if (Array.isArray(r)) return _arrayLikeToArray(r); }
-function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
-function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
-function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
-function _defineProperty(e, r, t) { return (r = _toPropertyKey(r)) in e ? Object.defineProperty(e, r, { value: t, enumerable: !0, configurable: !0, writable: !0 }) : e[r] = t, e; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == _typeof(i) ? i : i + ""; }
-function _toPrimitive(t, r) { if ("object" != _typeof(t) || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != _typeof(i)) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
-var debugMode = false;
-var minSnapDistance = exports.minSnapDistance = 1e-3; // meters
+var _interfaces = require("./interfaces.js");
+var _mapObjectsHelper = require("./mapObjectsHelper.js");
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+const debugMode = false;
+const minSnapDistance = exports.minSnapDistance = 1e-3; // meters
 
 function indexOfPointOnLine(feature, point) {
-  var matchIndex = -1;
-  turf.coordEach(feature, function (currentCoord, coordIndex, featureIndex, multiFeatureIndex, geometryIndex) {
+  let matchIndex = -1;
+  turf.coordEach(feature, (currentCoord, coordIndex, featureIndex, multiFeatureIndex, geometryIndex) => {
     if (matchIndex === -1) {
-      var lineVertex = turf.point(currentCoord);
-      var dist = turf.distance(point, lineVertex, {
+      const lineVertex = turf.point(currentCoord);
+      const dist = turf.distance(point, lineVertex, {
         units: 'meters'
       });
       if (debugMode) console.log('coordIndex: ', coordIndex, dist);
@@ -52,10 +40,10 @@ function indexOfPointOnLine(feature, point) {
   return matchIndex;
 }
 function addIntersectionToFeature(intersectedPoint, feature) {
-  var doNearbyCheck = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;
-  var addToLine = function addToLine(point, line) {
-    var cleanedFeature = turf.cleanCoords(line);
-    var nearestPoint1 = turf.nearestPointOnLine(cleanedFeature, point);
+  let doNearbyCheck = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;
+  const addToLine = (point, line) => {
+    const cleanedFeature = turf.cleanCoords(line);
+    const nearestPoint1 = turf.nearestPointOnLine(cleanedFeature, point);
     if (nearestPoint1.properties.index !== undefined) {
       feature.geometry.coordinates.splice(nearestPoint1.properties.index + 1, 0, intersectedPoint.geometry.coordinates);
       if (feature.properties) feature.properties.modified = 1;
@@ -63,7 +51,7 @@ function addIntersectionToFeature(intersectedPoint, feature) {
     } else if (debugMode) console.log('nearest point on line undefined');
   };
   if (doNearbyCheck) {
-    var indexOnLine = indexOfPointOnLine(feature, intersectedPoint);
+    const indexOnLine = indexOfPointOnLine(feature, intersectedPoint);
     if (indexOnLine === -1) {
       addToLine(intersectedPoint.geometry.coordinates, feature);
     } else {
@@ -77,15 +65,15 @@ function addIntersectionToFeature(intersectedPoint, feature) {
 }
 function snap(a, b) {
   if (turf.getType(a) === 'LineString') {
-    turf.coordEach(a, function (currentCoord, coordIndex, featureIndex, multiFeatureIndex, geometryIndex) {
-      var currentPoint = turf.point(currentCoord);
-      var cleanedFeature = turf.cleanCoords(b);
-      var snappedPoint = turf.nearestPointOnLine(cleanedFeature, currentPoint, {
+    turf.coordEach(a, (currentCoord, coordIndex, featureIndex, multiFeatureIndex, geometryIndex) => {
+      const currentPoint = turf.point(currentCoord);
+      const cleanedFeature = turf.cleanCoords(b);
+      const snappedPoint = turf.nearestPointOnLine(cleanedFeature, currentPoint, {
         units: 'meters'
       });
       if (snappedPoint && snappedPoint.properties.dist !== undefined && snappedPoint.properties.index !== undefined) {
-        var existingVertexOnLine = turf.point(b.geometry.coordinates[snappedPoint.properties.index]);
-        var distToExistingVertexOnLine = turf.distance(currentPoint, existingVertexOnLine, {
+        const existingVertexOnLine = turf.point(b.geometry.coordinates[snappedPoint.properties.index]);
+        const distToExistingVertexOnLine = turf.distance(currentPoint, existingVertexOnLine, {
           units: 'meters'
         });
         // If the snappedPoint is close (< minSnapDistance) to a pre-existing vertex then use that vertex instead of adding new
@@ -110,19 +98,19 @@ function snap(a, b) {
 
 // b is a superset which also includes a
 function findIntersectionsWithSuperset(a, b) {
-  for (var i = 0; i < a.length; i += 1) {
-    for (var j = 0; j < b.length; j += 1) {
+  for (let i = 0; i < a.length; i += 1) {
+    for (let j = 0; j < b.length; j += 1) {
       if (a[i].id !== b[j].id) {
         // TODO: Optimize for two-way snapping in one call
         snap(a[i], b[j]);
         snap(b[j], a[i]);
-        var intersections = turf.lineIntersect(a[i], b[j]);
+        const intersections = turf.lineIntersect(a[i], b[j]);
         if (debugMode) console.log('intersections for ', i, j, intersections);
 
         // Add intersection points to the respective LineStrings
         if (intersections.features.length > 0) {
-          for (var index = 0; index < intersections.features.length; index += 1) {
-            var intersectedFeature = intersections.features[index];
+          for (let index = 0; index < intersections.features.length; index += 1) {
+            const intersectedFeature = intersections.features[index];
             addIntersectionToFeature(intersectedFeature, a[i]);
             addIntersectionToFeature(intersectedFeature, b[j]);
           }
@@ -139,26 +127,26 @@ function findIntersectionsWithSuperset(a, b) {
 // It updates the given feature data inplace, make sure params are passed by reference.
 function optimized(a, b) {
   // Step 1: Build spatial index for the second set of LineStrings
-  var tree = (0, _geojsonRbush["default"])();
+  const tree = (0, _geojsonRbush.default)();
   tree.load(b);
 
   // Step 2: Find potential intersecting pairs using bounding boxes
-  a.forEach(function (line1) {
-    var bbox1 = turf.bbox(line1);
-    var possibleMatches = tree.search(bbox1);
+  a.forEach(line1 => {
+    const bbox1 = turf.bbox(line1);
+    const possibleMatches = tree.search(bbox1);
     if (debugMode) console.log('possible matches for ', line1.properties.title, possibleMatches);
-    possibleMatches.features.forEach(function (match) {
-      var line2 = match;
+    possibleMatches.features.forEach(match => {
+      const line2 = match;
       if (line1.properties && line1.properties.dimension_where && line2.properties && line2.properties.dimension_where && line1.properties.dimension_where === line2.properties.dimension_where) {
         // Step 3: Perform detailed intersection check
         snap(line1, line2);
-        var intersections = turf.lineIntersect(line1, line2);
+        const intersections = turf.lineIntersect(line1, line2);
         if (debugMode) console.log('intersections', intersections);
 
         // Add intersection points to the respective LineStrings
         if (intersections.features.length > 0) {
-          for (var j = 0; j < intersections.features.length; j += 1) {
-            var intersectedFeature = intersections.features[j];
+          for (let j = 0; j < intersections.features.length; j += 1) {
+            const intersectedFeature = intersections.features[j];
             addIntersectionToFeature(intersectedFeature, line1, false);
             addIntersectionToFeature(intersectedFeature, line2, false);
           }
@@ -169,8 +157,8 @@ function optimized(a, b) {
 }
 function markAsModified(features, mapBoxDraw) {
   if (features) {
-    for (var index = 0; index < features.length; index += 1) {
-      var feature = features[index];
+    for (let index = 0; index < features.length; index += 1) {
+      const feature = features[index];
       // modified key is used to mark that a feature was updated by mapboxDraw or custom logic like intersection during the respective editing session
       feature.properties.modified = 1;
       mapBoxDraw.add(feature);
@@ -178,9 +166,9 @@ function markAsModified(features, mapBoxDraw) {
   }
 }
 function getFirstPointFeature(features) {
-  for (var index = 0; index < features.length; index += 1) {
-    var feature = features[index];
-    var type = turf.getType(feature);
+  for (let index = 0; index < features.length; index += 1) {
+    const feature = features[index];
+    const type = turf.getType(feature);
     if (type === 'Point') {
       return feature;
     }
@@ -188,66 +176,68 @@ function getFirstPointFeature(features) {
   return undefined;
 }
 function getParentDimension(dimension) {
-  var splitResult = dimension.split('.');
-  var lastChildName = splitResult[splitResult.length - 1];
-  var parentDimensionValueStrict = dimension.replace('.'.concat(lastChildName), '');
+  const splitResult = dimension.split('.');
+  const lastChildName = splitResult[splitResult.length - 1];
+  const parentDimensionValueStrict = dimension.replace('.'.concat(lastChildName), '');
   return parentDimensionValueStrict;
 }
-var DEFAULT_DIMENSION = exports.DEFAULT_DIMENSION = 'where.singapore';
+const DEFAULT_DIMENSION = exports.DEFAULT_DIMENSION = 'where.singapore';
 function getPortalEdgeData(portalLinks) {
-  var allEdgeLines = [];
-  var portalEdgeData = {};
-  var addLink = function addLink(link, container) {
-    var _link$property_portal = link.property_portalLink,
-      cost = _link$property_portal.cost,
-      direction = _link$property_portal.direction,
-      wheelchair = _link$property_portal.wheelchair,
-      description = _link$property_portal.description;
-    var edge = (0, _mapObjectsHelper.getEdge)(link.property_secondRelatedId);
+  const allEdgeLines = [];
+  const portalEdgeData = {};
+  const addLink = (link, container) => {
+    const {
+      cost,
+      direction,
+      wheelchair,
+      description
+    } = link.property_portalLink;
+    const edge = (0, _mapObjectsHelper.getEdge)(link.property_secondRelatedId);
     if (edge && edge.lines) {
-      var pathFeatures = link.property_routeData && link.property_routeData.features ? link.property_routeData.features.filter(function (feature) {
-        return feature.geometry !== undefined && turf.getType(feature) === 'LineString' && feature.geometry.coordinates.length > 0;
-      }) : null;
-      var portalEdge = _objectSpread(_objectSpread({}, edge), {}, {
-        cost: cost,
-        direction: direction,
-        wheelchair: wheelchair,
-        pathFeatures: pathFeatures,
-        description: description
-      });
+      const pathFeatures = link.property_routeData && link.property_routeData.features ? link.property_routeData.features.filter(feature => feature.geometry !== undefined && turf.getType(feature) === 'LineString' && feature.geometry.coordinates.length > 0) : null;
+      const portalEdge = {
+        ...edge,
+        cost,
+        direction,
+        wheelchair,
+        pathFeatures,
+        description
+      };
       container.push(portalEdge);
-      allEdgeLines.push.apply(allEdgeLines, _toConsumableArray(edge.lines));
+      allEdgeLines.push(...edge.lines);
     }
   };
-  var addNode = function addNode(mapObjectId, links) {
-    var edge = (0, _mapObjectsHelper.getEdge)(mapObjectId);
+  const addNode = (mapObjectId, links) => {
+    const edge = (0, _mapObjectsHelper.getEdge)(mapObjectId);
     if (edge && edge.lines) {
-      var portal = _objectSpread(_objectSpread({}, edge), {}, {
-        links: links
-      });
+      const portal = {
+        ...edge,
+        links
+      };
       portalEdgeData[mapObjectId] = portal;
-      allEdgeLines.push.apply(allEdgeLines, _toConsumableArray(edge.lines));
+      allEdgeLines.push(...edge.lines);
       return portal;
     }
     return undefined;
   };
   console.log('portalData input', portalLinks);
-  var escalatorGraph = new _graphlib.Graph();
+  const escalatorGraph = new _graphlib.Graph();
   if (!(0, _lodash.isEmpty)(portalLinks)) {
-    Object.keys(portalLinks).forEach(function (anchorId) {
-      var _portalLinks$anchorId = portalLinks[anchorId],
-        type = _portalLinks$anchorId.type,
-        links = _portalLinks$anchorId.links;
+    Object.keys(portalLinks).forEach(anchorId => {
+      const {
+        type,
+        links
+      } = portalLinks[anchorId];
       if (type !== _interfaces.PortalType.escalator) {
-        var linksForAnchor = [];
-        for (var j = 0; j < links.length; j += 1) {
-          var link = links[j];
+        const linksForAnchor = [];
+        for (let j = 0; j < links.length; j += 1) {
+          const link = links[j];
           addLink(link, linksForAnchor);
           if (type === _interfaces.PortalType.lift) {
             // Extrapolate links for non-anchor lifts
-            var linksForNonAnchor = [];
-            for (var k = 0; k < links.length; k += 1) {
-              var nestedLink = links[k];
+            const linksForNonAnchor = [];
+            for (let k = 0; k < links.length; k += 1) {
+              const nestedLink = links[k];
               if (nestedLink.property_secondRelatedId !== link.property_secondRelatedId) {
                 addLink(nestedLink, linksForNonAnchor);
               }
@@ -263,22 +253,24 @@ function getPortalEdgeData(portalLinks) {
         addNode(anchorId, linksForAnchor);
       } else {
         if (!escalatorGraph.hasNode(anchorId)) {
-          var edge = (0, _mapObjectsHelper.getEdge)(anchorId);
+          const edge = (0, _mapObjectsHelper.getEdge)(anchorId);
           if (edge) {
             escalatorGraph.setNode(anchorId, {
               where: edge.where
             });
           }
         }
-        for (var _j = 0; _j < links.length; _j += 1) {
-          var _link = links[_j];
-          if (!escalatorGraph.hasNode(_link.property_secondRelatedId)) {
+        for (let j = 0; j < links.length; j += 1) {
+          const link = links[j];
+          if (!escalatorGraph.hasNode(link.property_secondRelatedId)) {
             escalatorGraph.setNode(anchorId, {
-              where: _link.taxonomy1Path
+              where: link.taxonomy1Path
             });
           }
-          if (!escalatorGraph.hasEdge(anchorId, _link.property_secondRelatedId)) {
-            escalatorGraph.setEdge(anchorId, _link.property_secondRelatedId, _objectSpread({}, _link.property_portalLink));
+          if (!escalatorGraph.hasEdge(anchorId, link.property_secondRelatedId)) {
+            escalatorGraph.setEdge(anchorId, link.property_secondRelatedId, {
+              ...link.property_portalLink
+            });
           }
         }
       }
@@ -286,32 +278,32 @@ function getPortalEdgeData(portalLinks) {
   }
 
   // eslint-disable-next-line no-loop-func
-  var extrapolateLinks = function extrapolateLinks(graph) {
-    var components = _graphlib.alg.components(graph);
-    components.forEach(function (component) {
-      var reachableNodes = component;
+  const extrapolateLinks = graph => {
+    const components = _graphlib.alg.components(graph);
+    components.forEach(component => {
+      const reachableNodes = component;
 
       // Connect the node directly to each indirectly connected node
-      for (var i = 0; i < reachableNodes.length; i += 1) {
-        var node1 = reachableNodes[i];
-        for (var j = i + 1; j < reachableNodes.length; j += 1) {
-          var node2 = reachableNodes[j];
+      for (let i = 0; i < reachableNodes.length; i += 1) {
+        const node1 = reachableNodes[i];
+        for (let j = i + 1; j < reachableNodes.length; j += 1) {
+          const node2 = reachableNodes[j];
           if (node1 !== node2 && !graph.hasEdge(node1, node2)) {
-            var edgeData = {
+            let edgeData = {
               cost: 120,
               direction: 2,
               wheelchair: true
             };
-            var nodeEdges = graph.nodeEdges(node1);
-            var isParallelLink = false;
+            const nodeEdges = graph.nodeEdges(node1);
+            let isParallelLink = false;
             if (nodeEdges && nodeEdges.length > 0) {
-              for (var k = 0; !isParallelLink && k < nodeEdges.length; k += 1) {
-                var nodeEdge = nodeEdges[k];
+              for (let k = 0; !isParallelLink && k < nodeEdges.length; k += 1) {
+                const nodeEdge = nodeEdges[k];
 
                 // check sibling connection with node2
-                var nodeToUse = nodeEdge.v === node1 ? nodeEdge.w : nodeEdge.v;
+                const nodeToUse = nodeEdge.v === node1 ? nodeEdge.w : nodeEdge.v;
                 if (graph.hasEdge(nodeToUse, node2)) {
-                  var nodeEdgeData = graph.edgeAsObj(nodeToUse, node2);
+                  const nodeEdgeData = graph.edgeAsObj(nodeToUse, node2);
                   if ('isParallel' in nodeEdgeData && nodeEdgeData.isParallel) {
                     isParallelLink = true;
                   }
@@ -333,57 +325,60 @@ function getPortalEdgeData(portalLinks) {
       }
 
       // Delete all parallel links from graph
-      for (var _i = 0; _i < reachableNodes.length; _i += 1) {
-        var _node = reachableNodes[_i];
-        var _nodeEdges = graph.nodeEdges(_node);
-        for (var _k = 0; _nodeEdges && _k < _nodeEdges.length; _k += 1) {
-          var _nodeEdge = _nodeEdges[_k];
-          var _nodeEdgeData = graph.edgeAsObj(_nodeEdge);
-          if ('isParallel' in _nodeEdgeData && _nodeEdgeData.isParallel) {
-            graph.removeEdge(_nodeEdge.v, _nodeEdge.w);
+      for (let i = 0; i < reachableNodes.length; i += 1) {
+        const node1 = reachableNodes[i];
+        const nodeEdges = graph.nodeEdges(node1);
+        for (let k = 0; nodeEdges && k < nodeEdges.length; k += 1) {
+          const nodeEdge = nodeEdges[k];
+          const nodeEdgeData = graph.edgeAsObj(nodeEdge);
+          if ('isParallel' in nodeEdgeData && nodeEdgeData.isParallel) {
+            graph.removeEdge(nodeEdge.v, nodeEdge.w);
           }
         }
       }
     });
   };
-  var addLinkUsingGraph = function addLinkUsingGraph(portal, escalatorEdge) {
-    var nodeEdgeData = escalatorGraph.edge(escalatorEdge);
-    var cost = nodeEdgeData.cost,
-      direction = nodeEdgeData.direction,
-      wheelchair = nodeEdgeData.wheelchair,
-      pathFeatures = nodeEdgeData.pathFeatures,
-      description = nodeEdgeData.description;
-    var edge = (0, _mapObjectsHelper.getEdge)(escalatorEdge.w);
+  const addLinkUsingGraph = (portal, escalatorEdge) => {
+    const nodeEdgeData = escalatorGraph.edge(escalatorEdge);
+    const {
+      cost,
+      direction,
+      wheelchair,
+      pathFeatures,
+      description
+    } = nodeEdgeData;
+    const edge = (0, _mapObjectsHelper.getEdge)(escalatorEdge.w);
     if (edge && edge.lines) {
-      var portalEdge = _objectSpread(_objectSpread({}, edge), {}, {
-        cost: cost,
-        direction: direction,
-        wheelchair: wheelchair,
-        pathFeatures: pathFeatures,
-        description: description
-      });
+      const portalEdge = {
+        ...edge,
+        cost,
+        direction,
+        wheelchair,
+        pathFeatures,
+        description
+      };
       portal.links.push(portalEdge);
-      allEdgeLines.push.apply(allEdgeLines, _toConsumableArray(edge.lines));
+      allEdgeLines.push(...edge.lines);
     }
   };
-  var start = performance.now();
+  const start = performance.now();
   extrapolateLinks(escalatorGraph);
   console.log('time extrapolation: ', (performance.now() - start) / 1000);
 
   // Add escaaltor links to portalEdgeData using the escalator graph
-  var escalatorGraphEdges = escalatorGraph.edges();
-  for (var i = 0; i < escalatorGraphEdges.length; i += 1) {
-    var escalatorEdge = escalatorGraphEdges[i];
+  const escalatorGraphEdges = escalatorGraph.edges();
+  for (let i = 0; i < escalatorGraphEdges.length; i += 1) {
+    const escalatorEdge = escalatorGraphEdges[i];
     // eslint-disable-next-line no-prototype-builtins
     if (!portalEdgeData.hasOwnProperty(escalatorEdge.v)) {
       // Add node and then add link
-      var portal = addNode(escalatorEdge.v, []);
+      const portal = addNode(escalatorEdge.v, []);
       if (portal) {
         addLinkUsingGraph(portal, escalatorEdge);
       }
     } else {
-      var _portal = portalEdgeData[escalatorEdge.v];
-      addLinkUsingGraph(_portal, escalatorEdge);
+      const portal = portalEdgeData[escalatorEdge.v];
+      addLinkUsingGraph(portal, escalatorEdge);
     }
   }
   console.log('portalEdgeData', portalEdgeData);
@@ -393,17 +388,17 @@ function getPortalEdgeData(portalLinks) {
   };
 }
 function filterPortalEdgeDataByWhere(allPortalEdgeData, whereDimension) {
-  var allEdgeLines = [];
-  var portalEdgeData = {};
+  const allEdgeLines = [];
+  const portalEdgeData = {};
 
   // eslint-disable-next-line no-restricted-syntax
-  for (var portalId in allPortalEdgeData) {
+  for (const portalId in allPortalEdgeData) {
     if (allPortalEdgeData[portalId].where.includes(whereDimension)) {
-      var portal = allPortalEdgeData[portalId];
+      const portal = allPortalEdgeData[portalId];
       portalEdgeData[portalId] = portal;
-      allEdgeLines.push.apply(allEdgeLines, _toConsumableArray(portal.lines));
-      portal.links.forEach(function (link) {
-        allEdgeLines.push.apply(allEdgeLines, _toConsumableArray(link.lines));
+      allEdgeLines.push(...portal.lines);
+      portal.links.forEach(link => {
+        allEdgeLines.push(...link.lines);
       });
     }
   }
@@ -413,15 +408,15 @@ function filterPortalEdgeDataByWhere(allPortalEdgeData, whereDimension) {
   };
 }
 function filterPortalEdgeDataByList(allPortalEdgeData, portalIdList) {
-  var allEdgeLines = [];
-  var portalEdgeData = {};
-  portalIdList.forEach(function (portalId) {
+  const allEdgeLines = [];
+  const portalEdgeData = {};
+  portalIdList.forEach(portalId => {
     if (portalId in allPortalEdgeData && portalIdList.has(allPortalEdgeData[portalId].id)) {
-      var portal = allPortalEdgeData[portalId];
+      const portal = allPortalEdgeData[portalId];
       portalEdgeData[portalId] = portal;
-      allEdgeLines.push.apply(allEdgeLines, _toConsumableArray(portal.lines));
-      portal.links.forEach(function (link) {
-        allEdgeLines.push.apply(allEdgeLines, _toConsumableArray(link.lines));
+      allEdgeLines.push(...portal.lines);
+      portal.links.forEach(link => {
+        allEdgeLines.push(...link.lines);
       });
     }
   });