@turf/line-overlap 7.0.0-alpha.2 → 7.0.0

package/README.md

@@ -46,26 +46,21 @@ Returns **[FeatureCollection][9]<[LineString][3]>** lines(s) that are overlappin
 
 [9]: https://tools.ietf.org/html/rfc7946#section-3.3
 
-<!-- This file is automatically generated. Please don't edit it directly:
-if you find an error, edit the source file (likely index.js), and re-run
-./scripts/generate-readmes in the turf project. -->
+<!-- This file is automatically generated. Please don't edit it directly. If you find an error, edit the source file of the module in question (likely index.js or index.ts), and re-run "yarn docs" from the root of the turf project. -->
 
 ---
 
-This module is part of the [Turfjs project](http://turfjs.org/), an open source
-module collection dedicated to geographic algorithms. It is maintained in the
-[Turfjs/turf](https://github.com/Turfjs/turf) repository, where you can create
-PRs and issues.
+This module is part of the [Turfjs project](https://turfjs.org/), an open source module collection dedicated to geographic algorithms. It is maintained in the [Turfjs/turf](https://github.com/Turfjs/turf) repository, where you can create PRs and issues.
 
 ### Installation
 
-Install this module individually:
+Install this single module individually:
 
 ```sh
 $ npm install @turf/line-overlap
 ```
 
-Or install the Turf module that includes it as a function:
+Or install the all-encompassing @turf/turf module that includes all modules as functions:
 
 ```sh
 $ npm install @turf/turf

package/dist/cjs/index.cjs

@@ -0,0 +1,96 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true}); function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+
+// index.ts
+var _geojsonrbush = require('@turf/geojson-rbush');
+var _linesegment = require('@turf/line-segment');
+var _nearestpointonline = require('@turf/nearest-point-on-line');
+var _booleanpointonline = require('@turf/boolean-point-on-line');
+var _invariant = require('@turf/invariant');
+var _meta = require('@turf/meta');
+var _helpers = require('@turf/helpers');
+var _deepequal = require('deep-equal'); var _deepequal2 = _interopRequireDefault(_deepequal);
+function lineOverlap(line1, line2, options = {}) {
+  options = options || {};
+  if (!_helpers.isObject.call(void 0, options))
+    throw new Error("options is invalid");
+  var tolerance = options.tolerance || 0;
+  var features = [];
+  var tree = _geojsonrbush.geojsonRbush.call(void 0, );
+  const line = _linesegment.lineSegment.call(void 0, line1);
+  tree.load(line);
+  var overlapSegment;
+  let additionalSegments = [];
+  _meta.segmentEach.call(void 0, line2, function(segment) {
+    var doesOverlaps = false;
+    if (!segment) {
+      return;
+    }
+    _meta.featureEach.call(void 0, tree.search(segment), function(match) {
+      if (doesOverlaps === false) {
+        var coordsSegment = _invariant.getCoords.call(void 0, segment).sort();
+        var coordsMatch = _invariant.getCoords.call(void 0, match).sort();
+        if (_deepequal2.default.call(void 0, coordsSegment, coordsMatch)) {
+          doesOverlaps = true;
+          if (overlapSegment) {
+            overlapSegment = concatSegment(overlapSegment, segment) || overlapSegment;
+          } else
+            overlapSegment = segment;
+        } else if (tolerance === 0 ? _booleanpointonline.booleanPointOnLine.call(void 0, coordsSegment[0], match) && _booleanpointonline.booleanPointOnLine.call(void 0, coordsSegment[1], match) : _nearestpointonline.nearestPointOnLine.call(void 0, match, coordsSegment[0]).properties.dist <= tolerance && _nearestpointonline.nearestPointOnLine.call(void 0, match, coordsSegment[1]).properties.dist <= tolerance) {
+          doesOverlaps = true;
+          if (overlapSegment) {
+            overlapSegment = concatSegment(overlapSegment, segment) || overlapSegment;
+          } else
+            overlapSegment = segment;
+        } else if (tolerance === 0 ? _booleanpointonline.booleanPointOnLine.call(void 0, coordsMatch[0], segment) && _booleanpointonline.booleanPointOnLine.call(void 0, coordsMatch[1], segment) : _nearestpointonline.nearestPointOnLine.call(void 0, segment, coordsMatch[0]).properties.dist <= tolerance && _nearestpointonline.nearestPointOnLine.call(void 0, segment, coordsMatch[1]).properties.dist <= tolerance) {
+          if (overlapSegment) {
+            const combinedSegment = concatSegment(overlapSegment, match);
+            if (combinedSegment) {
+              overlapSegment = combinedSegment;
+            } else {
+              additionalSegments.push(match);
+            }
+          } else
+            overlapSegment = match;
+        }
+      }
+    });
+    if (doesOverlaps === false && overlapSegment) {
+      features.push(overlapSegment);
+      if (additionalSegments.length) {
+        features = features.concat(additionalSegments);
+        additionalSegments = [];
+      }
+      overlapSegment = void 0;
+    }
+  });
+  if (overlapSegment)
+    features.push(overlapSegment);
+  return _helpers.featureCollection.call(void 0, features);
+}
+__name(lineOverlap, "lineOverlap");
+function concatSegment(line, segment) {
+  var coords = _invariant.getCoords.call(void 0, segment);
+  var lineCoords = _invariant.getCoords.call(void 0, line);
+  var start = lineCoords[0];
+  var end = lineCoords[lineCoords.length - 1];
+  var geom = line.geometry.coordinates;
+  if (_deepequal2.default.call(void 0, coords[0], start))
+    geom.unshift(coords[1]);
+  else if (_deepequal2.default.call(void 0, coords[0], end))
+    geom.push(coords[1]);
+  else if (_deepequal2.default.call(void 0, coords[1], start))
+    geom.unshift(coords[0]);
+  else if (_deepequal2.default.call(void 0, coords[1], end))
+    geom.push(coords[0]);
+  else
+    return;
+  return line;
+}
+__name(concatSegment, "concatSegment");
+var turf_line_overlap_default = lineOverlap;
+
+
+
+exports.default = turf_line_overlap_default; exports.lineOverlap = lineOverlap;
+//# sourceMappingURL=index.cjs.map

package/dist/cjs/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../index.ts"],"names":[],"mappings":";;;;AAAA,SAAS,gBAAgB,aAAa;AACtC,SAAS,mBAAmB;AAC5B,SAAS,0BAA0B;AACnC,SAAS,0BAA0B;AACnC,SAAS,iBAAiB;AAC1B,SAAS,aAAa,mBAAmB;AAUzC,SAAS,mBAAmB,gBAAgB;AAC5C,OAAO,WAAW;AAoBlB,SAAS,YAIP,OACA,OACA,UAAkC,CAAC,GACJ;AAE/B,YAAU,WAAW,CAAC;AACtB,MAAI,CAAC,SAAS,OAAO;AAAG,UAAM,IAAI,MAAM,oBAAoB;AAC5D,MAAI,YAAY,QAAQ,aAAa;AAGrC,MAAI,WAAqD,CAAC;AAG1D,MAAI,OAAO,MAAkB;AAG7B,QAAM,OAAY,YAAY,KAAK;AACnC,OAAK,KAAK,IAAI;AACd,MAAI;AACJ,MAAI,qBAA4C,CAAC;AAKjD,cAAY,OAAO,SAAU,SAAS;AACpC,QAAI,eAAe;AAEnB,QAAI,CAAC,SAAS;AACZ;AAAA,IACF;AAGA,gBAAY,KAAK,OAAO,OAAO,GAAG,SAAU,OAAO;AACjD,UAAI,iBAAiB,OAAO;AAC1B,YAAI,gBAAgB,UAAU,OAAO,EAAE,KAAK;AAC5C,YAAI,cAAmB,UAAU,KAAK,EAAE,KAAK;AAG7C,YAAI,MAAM,eAAe,WAAW,GAAG;AACrC,yBAAe;AAEf,cAAI,gBAAgB;AAClB,6BACE,cAAc,gBAAgB,OAAO,KAAK;AAAA,UAC9C;AAAO,6BAAiB;AAAA,QAE1B,WACE,cAAc,IACV,mBAAmB,cAAc,CAAC,GAAG,KAAK,KAC1C,mBAAmB,cAAc,CAAC,GAAG,KAAK,IAC1C,mBAAmB,OAAO,cAAc,CAAC,CAAC,EAAE,WAAW,QACrD,aACF,mBAAmB,OAAO,cAAc,CAAC,CAAC,EAAE,WAAW,QACrD,WACN;AACA,yBAAe;AACf,cAAI,gBAAgB;AAClB,6BACE,cAAc,gBAAgB,OAAO,KAAK;AAAA,UAC9C;AAAO,6BAAiB;AAAA,QAC1B,WACE,cAAc,IACV,mBAAmB,YAAY,CAAC,GAAG,OAAO,KAC1C,mBAAmB,YAAY,CAAC,GAAG,OAAO,IAC1C,mBAAmB,SAAS,YAAY,CAAC,CAAC,EAAE,WAAW,QACrD,aACF,mBAAmB,SAAS,YAAY,CAAC,CAAC,EAAE,WAAW,QACrD,WACN;AAGA,cAAI,gBAAgB;AAClB,kBAAM,kBAAkB,cAAc,gBAAgB,KAAK;AAC3D,gBAAI,iBAAiB;AACnB,+BAAiB;AAAA,YACnB,OAAO;AACL,iCAAmB,KAAK,KAAK;AAAA,YAC/B;AAAA,UACF;AAAO,6BAAiB;AAAA,QAC1B;AAAA,MACF;AAAA,IACF,CAAC;AAGD,QAAI,iBAAiB,SAAS,gBAAgB;AAC5C,eAAS,KAAK,cAAc;AAC5B,UAAI,mBAAmB,QAAQ;AAC7B,mBAAW,SAAS,OAAO,kBAAkB;AAC7C,6BAAqB,CAAC;AAAA,MACxB;AACA,uBAAiB;AAAA,IACnB;AAAA,EACF,CAAC;AAED,MAAI;AAAgB,aAAS,KAAK,cAAc;AAEhD,SAAO,kBAAkB,QAAQ;AACnC;AArGS;AA+GT,SAAS,cACP,MACA,SACA;AACA,MAAI,SAAS,UAAU,OAAO;AAC9B,MAAI,aAAa,UAAU,IAAI;AAC/B,MAAI,QAAQ,WAAW,CAAC;AACxB,MAAI,MAAM,WAAW,WAAW,SAAS,CAAC;AAC1C,MAAI,OAAO,KAAK,SAAS;AAEzB,MAAI,MAAM,OAAO,CAAC,GAAG,KAAK;AAAG,SAAK,QAAQ,OAAO,CAAC,CAAC;AAAA,WAC1C,MAAM,OAAO,CAAC,GAAG,GAAG;AAAG,SAAK,KAAK,OAAO,CAAC,CAAC;AAAA,WAC1C,MAAM,OAAO,CAAC,GAAG,KAAK;AAAG,SAAK,QAAQ,OAAO,CAAC,CAAC;AAAA,WAC/C,MAAM,OAAO,CAAC,GAAG,GAAG;AAAG,SAAK,KAAK,OAAO,CAAC,CAAC;AAAA;AAC9C;AAGL,SAAO;AACT;AAlBS;AAqBT,IAAO,4BAAQ","sourcesContent":["import { geojsonRbush as rbush } from \"@turf/geojson-rbush\";\nimport { lineSegment } from \"@turf/line-segment\";\nimport { nearestPointOnLine } from \"@turf/nearest-point-on-line\";\nimport { booleanPointOnLine } from \"@turf/boolean-point-on-line\";\nimport { getCoords } from \"@turf/invariant\";\nimport { featureEach, segmentEach } from \"@turf/meta\";\nimport {\n  FeatureCollection,\n  Feature,\n  LineString,\n  MultiLineString,\n  Polygon,\n  MultiPolygon,\n  GeoJsonProperties,\n} from \"geojson\";\nimport { featureCollection, isObject } from \"@turf/helpers\";\nimport equal from \"deep-equal\";\n\n/**\n * Takes any LineString or Polygon and returns the overlapping lines between both features.\n *\n * @name lineOverlap\n * @param {Geometry|Feature<LineString|MultiLineString|Polygon|MultiPolygon>} line1 any LineString or Polygon\n * @param {Geometry|Feature<LineString|MultiLineString|Polygon|MultiPolygon>} line2 any LineString or Polygon\n * @param {Object} [options={}] Optional parameters\n * @param {number} [options.tolerance=0] Tolerance distance to match overlapping line segments (in kilometers)\n * @returns {FeatureCollection<LineString>} lines(s) that are overlapping between both features\n * @example\n * var line1 = turf.lineString([[115, -35], [125, -30], [135, -30], [145, -35]]);\n * var line2 = turf.lineString([[115, -25], [125, -30], [135, -30], [145, -25]]);\n *\n * var overlapping = turf.lineOverlap(line1, line2);\n *\n * //addToMap\n * var addToMap = [line1, line2, overlapping]\n */\nfunction lineOverlap<\n  G1 extends LineString | MultiLineString | Polygon | MultiPolygon,\n  G2 extends LineString | MultiLineString | Polygon | MultiPolygon,\n>(\n  line1: Feature<G1> | G1,\n  line2: Feature<G2> | G2,\n  options: { tolerance?: number } = {}\n): FeatureCollection<LineString> {\n  // Optional parameters\n  options = options || {};\n  if (!isObject(options)) throw new Error(\"options is invalid\");\n  var tolerance = options.tolerance || 0;\n\n  // Containers\n  var features: Feature<LineString, GeoJsonProperties>[] = [];\n\n  // Create Spatial Index\n  var tree = rbush<LineString>();\n\n  // To-Do -- HACK way to support typescript\n  const line: any = lineSegment(line1);\n  tree.load(line);\n  var overlapSegment: Feature<LineString> | undefined;\n  let additionalSegments: Feature<LineString>[] = [];\n\n  // Line Intersection\n\n  // Iterate over line segments\n  segmentEach(line2, function (segment) {\n    var doesOverlaps = false;\n\n    if (!segment) {\n      return;\n    }\n\n    // Iterate over each segments which falls within the same bounds\n    featureEach(tree.search(segment), function (match) {\n      if (doesOverlaps === false) {\n        var coordsSegment = getCoords(segment).sort();\n        var coordsMatch: any = getCoords(match).sort();\n\n        // Segment overlaps feature\n        if (equal(coordsSegment, coordsMatch)) {\n          doesOverlaps = true;\n          // Overlaps already exists - only append last coordinate of segment\n          if (overlapSegment) {\n            overlapSegment =\n              concatSegment(overlapSegment, segment) || overlapSegment;\n          } else overlapSegment = segment;\n          // Match segments which don't share nodes (Issue #901)\n        } else if (\n          tolerance === 0\n            ? booleanPointOnLine(coordsSegment[0], match) &&\n              booleanPointOnLine(coordsSegment[1], match)\n            : nearestPointOnLine(match, coordsSegment[0]).properties.dist! <=\n                tolerance &&\n              nearestPointOnLine(match, coordsSegment[1]).properties.dist! <=\n                tolerance\n        ) {\n          doesOverlaps = true;\n          if (overlapSegment) {\n            overlapSegment =\n              concatSegment(overlapSegment, segment) || overlapSegment;\n          } else overlapSegment = segment;\n        } else if (\n          tolerance === 0\n            ? booleanPointOnLine(coordsMatch[0], segment) &&\n              booleanPointOnLine(coordsMatch[1], segment)\n            : nearestPointOnLine(segment, coordsMatch[0]).properties.dist! <=\n                tolerance &&\n              nearestPointOnLine(segment, coordsMatch[1]).properties.dist! <=\n                tolerance\n        ) {\n          // Do not define (doesOverlap = true) since more matches can occur within the same segment\n          // doesOverlaps = true;\n          if (overlapSegment) {\n            const combinedSegment = concatSegment(overlapSegment, match);\n            if (combinedSegment) {\n              overlapSegment = combinedSegment;\n            } else {\n              additionalSegments.push(match);\n            }\n          } else overlapSegment = match;\n        }\n      }\n    });\n\n    // Segment doesn't overlap - add overlaps to results & reset\n    if (doesOverlaps === false && overlapSegment) {\n      features.push(overlapSegment);\n      if (additionalSegments.length) {\n        features = features.concat(additionalSegments);\n        additionalSegments = [];\n      }\n      overlapSegment = undefined;\n    }\n  });\n  // Add last segment if exists\n  if (overlapSegment) features.push(overlapSegment);\n\n  return featureCollection(features);\n}\n\n/**\n * Concat Segment\n *\n * @private\n * @param {Feature<LineString>} line LineString\n * @param {Feature<LineString>} segment 2-vertex LineString\n * @returns {Feature<LineString>} concat linestring\n */\nfunction concatSegment(\n  line: Feature<LineString>,\n  segment: Feature<LineString>\n) {\n  var coords = getCoords(segment);\n  var lineCoords = getCoords(line);\n  var start = lineCoords[0];\n  var end = lineCoords[lineCoords.length - 1];\n  var geom = line.geometry.coordinates;\n\n  if (equal(coords[0], start)) geom.unshift(coords[1]);\n  else if (equal(coords[0], end)) geom.push(coords[1]);\n  else if (equal(coords[1], start)) geom.unshift(coords[0]);\n  else if (equal(coords[1], end)) geom.push(coords[0]);\n  else return; // If the overlap leaves the segment unchanged, return undefined so that this can be identified.\n\n  // Otherwise return the mutated line.\n  return line;\n}\n\nexport { lineOverlap };\nexport default lineOverlap;\n"]}

package/dist/cjs/index.d.cts

@@ -0,0 +1,25 @@
+import { LineString, MultiLineString, Polygon, MultiPolygon, Feature, FeatureCollection } from 'geojson';
+
+/**
+ * Takes any LineString or Polygon and returns the overlapping lines between both features.
+ *
+ * @name lineOverlap
+ * @param {Geometry|Feature<LineString|MultiLineString|Polygon|MultiPolygon>} line1 any LineString or Polygon
+ * @param {Geometry|Feature<LineString|MultiLineString|Polygon|MultiPolygon>} line2 any LineString or Polygon
+ * @param {Object} [options={}] Optional parameters
+ * @param {number} [options.tolerance=0] Tolerance distance to match overlapping line segments (in kilometers)
+ * @returns {FeatureCollection<LineString>} lines(s) that are overlapping between both features
+ * @example
+ * var line1 = turf.lineString([[115, -35], [125, -30], [135, -30], [145, -35]]);
+ * var line2 = turf.lineString([[115, -25], [125, -30], [135, -30], [145, -25]]);
+ *
+ * var overlapping = turf.lineOverlap(line1, line2);
+ *
+ * //addToMap
+ * var addToMap = [line1, line2, overlapping]
+ */
+declare function lineOverlap<G1 extends LineString | MultiLineString | Polygon | MultiPolygon, G2 extends LineString | MultiLineString | Polygon | MultiPolygon>(line1: Feature<G1> | G1, line2: Feature<G2> | G2, options?: {
+    tolerance?: number;
+}): FeatureCollection<LineString>;
+
+export { lineOverlap as default, lineOverlap };

package/dist/{js → esm}/index.d.ts

@@ -1,4 +1,5 @@
-import { FeatureCollection, Feature, LineString, MultiLineString, Polygon, MultiPolygon } from "geojson";
+import { LineString, MultiLineString, Polygon, MultiPolygon, Feature, FeatureCollection } from 'geojson';
+
 /**
  * Takes any LineString or Polygon and returns the overlapping lines between both features.
  *
@@ -20,4 +21,5 @@ import { FeatureCollection, Feature, LineString, MultiLineString, Polygon, Multi
 declare function lineOverlap<G1 extends LineString | MultiLineString | Polygon | MultiPolygon, G2 extends LineString | MultiLineString | Polygon | MultiPolygon>(line1: Feature<G1> | G1, line2: Feature<G2> | G2, options?: {
     tolerance?: number;
 }): FeatureCollection<LineString>;
-export default lineOverlap;
+
+export { lineOverlap as default, lineOverlap };

package/dist/esm/index.js

@@ -0,0 +1,96 @@
+var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+
+// index.ts
+import { geojsonRbush as rbush } from "@turf/geojson-rbush";
+import { lineSegment } from "@turf/line-segment";
+import { nearestPointOnLine } from "@turf/nearest-point-on-line";
+import { booleanPointOnLine } from "@turf/boolean-point-on-line";
+import { getCoords } from "@turf/invariant";
+import { featureEach, segmentEach } from "@turf/meta";
+import { featureCollection, isObject } from "@turf/helpers";
+import equal from "deep-equal";
+function lineOverlap(line1, line2, options = {}) {
+  options = options || {};
+  if (!isObject(options))
+    throw new Error("options is invalid");
+  var tolerance = options.tolerance || 0;
+  var features = [];
+  var tree = rbush();
+  const line = lineSegment(line1);
+  tree.load(line);
+  var overlapSegment;
+  let additionalSegments = [];
+  segmentEach(line2, function(segment) {
+    var doesOverlaps = false;
+    if (!segment) {
+      return;
+    }
+    featureEach(tree.search(segment), function(match) {
+      if (doesOverlaps === false) {
+        var coordsSegment = getCoords(segment).sort();
+        var coordsMatch = getCoords(match).sort();
+        if (equal(coordsSegment, coordsMatch)) {
+          doesOverlaps = true;
+          if (overlapSegment) {
+            overlapSegment = concatSegment(overlapSegment, segment) || overlapSegment;
+          } else
+            overlapSegment = segment;
+        } else if (tolerance === 0 ? booleanPointOnLine(coordsSegment[0], match) && booleanPointOnLine(coordsSegment[1], match) : nearestPointOnLine(match, coordsSegment[0]).properties.dist <= tolerance && nearestPointOnLine(match, coordsSegment[1]).properties.dist <= tolerance) {
+          doesOverlaps = true;
+          if (overlapSegment) {
+            overlapSegment = concatSegment(overlapSegment, segment) || overlapSegment;
+          } else
+            overlapSegment = segment;
+        } else if (tolerance === 0 ? booleanPointOnLine(coordsMatch[0], segment) && booleanPointOnLine(coordsMatch[1], segment) : nearestPointOnLine(segment, coordsMatch[0]).properties.dist <= tolerance && nearestPointOnLine(segment, coordsMatch[1]).properties.dist <= tolerance) {
+          if (overlapSegment) {
+            const combinedSegment = concatSegment(overlapSegment, match);
+            if (combinedSegment) {
+              overlapSegment = combinedSegment;
+            } else {
+              additionalSegments.push(match);
+            }
+          } else
+            overlapSegment = match;
+        }
+      }
+    });
+    if (doesOverlaps === false && overlapSegment) {
+      features.push(overlapSegment);
+      if (additionalSegments.length) {
+        features = features.concat(additionalSegments);
+        additionalSegments = [];
+      }
+      overlapSegment = void 0;
+    }
+  });
+  if (overlapSegment)
+    features.push(overlapSegment);
+  return featureCollection(features);
+}
+__name(lineOverlap, "lineOverlap");
+function concatSegment(line, segment) {
+  var coords = getCoords(segment);
+  var lineCoords = getCoords(line);
+  var start = lineCoords[0];
+  var end = lineCoords[lineCoords.length - 1];
+  var geom = line.geometry.coordinates;
+  if (equal(coords[0], start))
+    geom.unshift(coords[1]);
+  else if (equal(coords[0], end))
+    geom.push(coords[1]);
+  else if (equal(coords[1], start))
+    geom.unshift(coords[0]);
+  else if (equal(coords[1], end))
+    geom.push(coords[0]);
+  else
+    return;
+  return line;
+}
+__name(concatSegment, "concatSegment");
+var turf_line_overlap_default = lineOverlap;
+export {
+  turf_line_overlap_default as default,
+  lineOverlap
+};
+//# sourceMappingURL=index.js.map

package/dist/esm/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../index.ts"],"sourcesContent":["import { geojsonRbush as rbush } from \"@turf/geojson-rbush\";\nimport { lineSegment } from \"@turf/line-segment\";\nimport { nearestPointOnLine } from \"@turf/nearest-point-on-line\";\nimport { booleanPointOnLine } from \"@turf/boolean-point-on-line\";\nimport { getCoords } from \"@turf/invariant\";\nimport { featureEach, segmentEach } from \"@turf/meta\";\nimport {\n  FeatureCollection,\n  Feature,\n  LineString,\n  MultiLineString,\n  Polygon,\n  MultiPolygon,\n  GeoJsonProperties,\n} from \"geojson\";\nimport { featureCollection, isObject } from \"@turf/helpers\";\nimport equal from \"deep-equal\";\n\n/**\n * Takes any LineString or Polygon and returns the overlapping lines between both features.\n *\n * @name lineOverlap\n * @param {Geometry|Feature<LineString|MultiLineString|Polygon|MultiPolygon>} line1 any LineString or Polygon\n * @param {Geometry|Feature<LineString|MultiLineString|Polygon|MultiPolygon>} line2 any LineString or Polygon\n * @param {Object} [options={}] Optional parameters\n * @param {number} [options.tolerance=0] Tolerance distance to match overlapping line segments (in kilometers)\n * @returns {FeatureCollection<LineString>} lines(s) that are overlapping between both features\n * @example\n * var line1 = turf.lineString([[115, -35], [125, -30], [135, -30], [145, -35]]);\n * var line2 = turf.lineString([[115, -25], [125, -30], [135, -30], [145, -25]]);\n *\n * var overlapping = turf.lineOverlap(line1, line2);\n *\n * //addToMap\n * var addToMap = [line1, line2, overlapping]\n */\nfunction lineOverlap<\n  G1 extends LineString | MultiLineString | Polygon | MultiPolygon,\n  G2 extends LineString | MultiLineString | Polygon | MultiPolygon,\n>(\n  line1: Feature<G1> | G1,\n  line2: Feature<G2> | G2,\n  options: { tolerance?: number } = {}\n): FeatureCollection<LineString> {\n  // Optional parameters\n  options = options || {};\n  if (!isObject(options)) throw new Error(\"options is invalid\");\n  var tolerance = options.tolerance || 0;\n\n  // Containers\n  var features: Feature<LineString, GeoJsonProperties>[] = [];\n\n  // Create Spatial Index\n  var tree = rbush<LineString>();\n\n  // To-Do -- HACK way to support typescript\n  const line: any = lineSegment(line1);\n  tree.load(line);\n  var overlapSegment: Feature<LineString> | undefined;\n  let additionalSegments: Feature<LineString>[] = [];\n\n  // Line Intersection\n\n  // Iterate over line segments\n  segmentEach(line2, function (segment) {\n    var doesOverlaps = false;\n\n    if (!segment) {\n      return;\n    }\n\n    // Iterate over each segments which falls within the same bounds\n    featureEach(tree.search(segment), function (match) {\n      if (doesOverlaps === false) {\n        var coordsSegment = getCoords(segment).sort();\n        var coordsMatch: any = getCoords(match).sort();\n\n        // Segment overlaps feature\n        if (equal(coordsSegment, coordsMatch)) {\n          doesOverlaps = true;\n          // Overlaps already exists - only append last coordinate of segment\n          if (overlapSegment) {\n            overlapSegment =\n              concatSegment(overlapSegment, segment) || overlapSegment;\n          } else overlapSegment = segment;\n          // Match segments which don't share nodes (Issue #901)\n        } else if (\n          tolerance === 0\n            ? booleanPointOnLine(coordsSegment[0], match) &&\n              booleanPointOnLine(coordsSegment[1], match)\n            : nearestPointOnLine(match, coordsSegment[0]).properties.dist! <=\n                tolerance &&\n              nearestPointOnLine(match, coordsSegment[1]).properties.dist! <=\n                tolerance\n        ) {\n          doesOverlaps = true;\n          if (overlapSegment) {\n            overlapSegment =\n              concatSegment(overlapSegment, segment) || overlapSegment;\n          } else overlapSegment = segment;\n        } else if (\n          tolerance === 0\n            ? booleanPointOnLine(coordsMatch[0], segment) &&\n              booleanPointOnLine(coordsMatch[1], segment)\n            : nearestPointOnLine(segment, coordsMatch[0]).properties.dist! <=\n                tolerance &&\n              nearestPointOnLine(segment, coordsMatch[1]).properties.dist! <=\n                tolerance\n        ) {\n          // Do not define (doesOverlap = true) since more matches can occur within the same segment\n          // doesOverlaps = true;\n          if (overlapSegment) {\n            const combinedSegment = concatSegment(overlapSegment, match);\n            if (combinedSegment) {\n              overlapSegment = combinedSegment;\n            } else {\n              additionalSegments.push(match);\n            }\n          } else overlapSegment = match;\n        }\n      }\n    });\n\n    // Segment doesn't overlap - add overlaps to results & reset\n    if (doesOverlaps === false && overlapSegment) {\n      features.push(overlapSegment);\n      if (additionalSegments.length) {\n        features = features.concat(additionalSegments);\n        additionalSegments = [];\n      }\n      overlapSegment = undefined;\n    }\n  });\n  // Add last segment if exists\n  if (overlapSegment) features.push(overlapSegment);\n\n  return featureCollection(features);\n}\n\n/**\n * Concat Segment\n *\n * @private\n * @param {Feature<LineString>} line LineString\n * @param {Feature<LineString>} segment 2-vertex LineString\n * @returns {Feature<LineString>} concat linestring\n */\nfunction concatSegment(\n  line: Feature<LineString>,\n  segment: Feature<LineString>\n) {\n  var coords = getCoords(segment);\n  var lineCoords = getCoords(line);\n  var start = lineCoords[0];\n  var end = lineCoords[lineCoords.length - 1];\n  var geom = line.geometry.coordinates;\n\n  if (equal(coords[0], start)) geom.unshift(coords[1]);\n  else if (equal(coords[0], end)) geom.push(coords[1]);\n  else if (equal(coords[1], start)) geom.unshift(coords[0]);\n  else if (equal(coords[1], end)) geom.push(coords[0]);\n  else return; // If the overlap leaves the segment unchanged, return undefined so that this can be identified.\n\n  // Otherwise return the mutated line.\n  return line;\n}\n\nexport { lineOverlap };\nexport default lineOverlap;\n"],"mappings":";;;;AAAA,SAAS,gBAAgB,aAAa;AACtC,SAAS,mBAAmB;AAC5B,SAAS,0BAA0B;AACnC,SAAS,0BAA0B;AACnC,SAAS,iBAAiB;AAC1B,SAAS,aAAa,mBAAmB;AAUzC,SAAS,mBAAmB,gBAAgB;AAC5C,OAAO,WAAW;AAoBlB,SAAS,YAIP,OACA,OACA,UAAkC,CAAC,GACJ;AAE/B,YAAU,WAAW,CAAC;AACtB,MAAI,CAAC,SAAS,OAAO;AAAG,UAAM,IAAI,MAAM,oBAAoB;AAC5D,MAAI,YAAY,QAAQ,aAAa;AAGrC,MAAI,WAAqD,CAAC;AAG1D,MAAI,OAAO,MAAkB;AAG7B,QAAM,OAAY,YAAY,KAAK;AACnC,OAAK,KAAK,IAAI;AACd,MAAI;AACJ,MAAI,qBAA4C,CAAC;AAKjD,cAAY,OAAO,SAAU,SAAS;AACpC,QAAI,eAAe;AAEnB,QAAI,CAAC,SAAS;AACZ;AAAA,IACF;AAGA,gBAAY,KAAK,OAAO,OAAO,GAAG,SAAU,OAAO;AACjD,UAAI,iBAAiB,OAAO;AAC1B,YAAI,gBAAgB,UAAU,OAAO,EAAE,KAAK;AAC5C,YAAI,cAAmB,UAAU,KAAK,EAAE,KAAK;AAG7C,YAAI,MAAM,eAAe,WAAW,GAAG;AACrC,yBAAe;AAEf,cAAI,gBAAgB;AAClB,6BACE,cAAc,gBAAgB,OAAO,KAAK;AAAA,UAC9C;AAAO,6BAAiB;AAAA,QAE1B,WACE,cAAc,IACV,mBAAmB,cAAc,CAAC,GAAG,KAAK,KAC1C,mBAAmB,cAAc,CAAC,GAAG,KAAK,IAC1C,mBAAmB,OAAO,cAAc,CAAC,CAAC,EAAE,WAAW,QACrD,aACF,mBAAmB,OAAO,cAAc,CAAC,CAAC,EAAE,WAAW,QACrD,WACN;AACA,yBAAe;AACf,cAAI,gBAAgB;AAClB,6BACE,cAAc,gBAAgB,OAAO,KAAK;AAAA,UAC9C;AAAO,6BAAiB;AAAA,QAC1B,WACE,cAAc,IACV,mBAAmB,YAAY,CAAC,GAAG,OAAO,KAC1C,mBAAmB,YAAY,CAAC,GAAG,OAAO,IAC1C,mBAAmB,SAAS,YAAY,CAAC,CAAC,EAAE,WAAW,QACrD,aACF,mBAAmB,SAAS,YAAY,CAAC,CAAC,EAAE,WAAW,QACrD,WACN;AAGA,cAAI,gBAAgB;AAClB,kBAAM,kBAAkB,cAAc,gBAAgB,KAAK;AAC3D,gBAAI,iBAAiB;AACnB,+BAAiB;AAAA,YACnB,OAAO;AACL,iCAAmB,KAAK,KAAK;AAAA,YAC/B;AAAA,UACF;AAAO,6BAAiB;AAAA,QAC1B;AAAA,MACF;AAAA,IACF,CAAC;AAGD,QAAI,iBAAiB,SAAS,gBAAgB;AAC5C,eAAS,KAAK,cAAc;AAC5B,UAAI,mBAAmB,QAAQ;AAC7B,mBAAW,SAAS,OAAO,kBAAkB;AAC7C,6BAAqB,CAAC;AAAA,MACxB;AACA,uBAAiB;AAAA,IACnB;AAAA,EACF,CAAC;AAED,MAAI;AAAgB,aAAS,KAAK,cAAc;AAEhD,SAAO,kBAAkB,QAAQ;AACnC;AArGS;AA+GT,SAAS,cACP,MACA,SACA;AACA,MAAI,SAAS,UAAU,OAAO;AAC9B,MAAI,aAAa,UAAU,IAAI;AAC/B,MAAI,QAAQ,WAAW,CAAC;AACxB,MAAI,MAAM,WAAW,WAAW,SAAS,CAAC;AAC1C,MAAI,OAAO,KAAK,SAAS;AAEzB,MAAI,MAAM,OAAO,CAAC,GAAG,KAAK;AAAG,SAAK,QAAQ,OAAO,CAAC,CAAC;AAAA,WAC1C,MAAM,OAAO,CAAC,GAAG,GAAG;AAAG,SAAK,KAAK,OAAO,CAAC,CAAC;AAAA,WAC1C,MAAM,OAAO,CAAC,GAAG,KAAK;AAAG,SAAK,QAAQ,OAAO,CAAC,CAAC;AAAA,WAC/C,MAAM,OAAO,CAAC,GAAG,GAAG;AAAG,SAAK,KAAK,OAAO,CAAC,CAAC;AAAA;AAC9C;AAGL,SAAO;AACT;AAlBS;AAqBT,IAAO,4BAAQ;","names":[]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@turf/line-overlap",
-  "version": "7.0.0-alpha.2",
+  "version": "7.0.0",
   "description": "turf line-overlap module",
   "author": "Turf Authors",
   "contributors": [
@@ -26,53 +26,58 @@
     "line",
     "overlap"
   ],
-  "main": "dist/js/index.js",
-  "module": "dist/es/index.js",
+  "type": "module",
+  "main": "dist/cjs/index.cjs",
+  "module": "dist/esm/index.js",
+  "types": "dist/esm/index.d.ts",
   "exports": {
     "./package.json": "./package.json",
     ".": {
-      "types": "./dist/js/index.d.ts",
-      "import": "./dist/es/index.js",
-      "require": "./dist/js/index.js"
+      "import": {
+        "types": "./dist/esm/index.d.ts",
+        "default": "./dist/esm/index.js"
+      },
+      "require": {
+        "types": "./dist/cjs/index.d.cts",
+        "default": "./dist/cjs/index.cjs"
+      }
     }
   },
-  "types": "dist/js/index.d.ts",
   "sideEffects": false,
   "files": [
     "dist"
   ],
   "scripts": {
-    "bench": "tsx bench.js",
-    "build": "npm-run-all build:*",
-    "build:es": "tsc --outDir dist/es --module esnext --declaration false && echo '{\"type\":\"module\"}' > dist/es/package.json",
-    "build:js": "tsc",
-    "docs": "tsx ../../scripts/generate-readmes",
-    "test": "npm-run-all test:*",
-    "test:tape": "tsx test.js",
-    "test:types": "tsc --esModuleInterop --noEmit --strict types.ts"
+    "bench": "tsx bench.ts",
+    "build": "tsup --config ../../tsup.config.ts",
+    "docs": "tsx ../../scripts/generate-readmes.ts",
+    "test": "npm-run-all --npm-path npm test:*",
+    "test:tape": "tsx test.ts",
+    "test:types": "tsc --esModuleInterop --module node16 --moduleResolution node16 --noEmit --strict types.ts"
   },
   "devDependencies": {
-    "@types/deep-equal": "^1.0.1",
-    "@types/tape": "*",
-    "benchmark": "*",
-    "load-json-file": "*",
-    "npm-run-all": "*",
-    "tape": "*",
-    "tslint": "*",
-    "tsx": "*",
-    "typescript": "*",
-    "write-json-file": "*"
+    "@types/benchmark": "^2.1.5",
+    "@types/deep-equal": "^1.0.4",
+    "@types/tape": "^4.2.32",
+    "benchmark": "^2.1.4",
+    "load-json-file": "^7.0.1",
+    "npm-run-all": "^4.1.5",
+    "tape": "^5.7.2",
+    "tsup": "^8.0.1",
+    "tsx": "^4.6.2",
+    "typescript": "^5.2.2",
+    "write-json-file": "^5.0.0"
   },
   "dependencies": {
-    "@turf/boolean-point-on-line": "^7.0.0-alpha.2",
-    "@turf/geojson-rbush": "^3.2.0",
-    "@turf/helpers": "^7.0.0-alpha.2",
-    "@turf/invariant": "^7.0.0-alpha.2",
-    "@turf/line-segment": "^7.0.0-alpha.2",
-    "@turf/meta": "^7.0.0-alpha.2",
-    "@turf/nearest-point-on-line": "^7.0.0-alpha.2",
-    "deep-equal": "1.x",
-    "tslib": "^2.3.0"
+    "@turf/boolean-point-on-line": "^7.0.0",
+    "@turf/geojson-rbush": "^7.0.0",
+    "@turf/helpers": "^7.0.0",
+    "@turf/invariant": "^7.0.0",
+    "@turf/line-segment": "^7.0.0",
+    "@turf/meta": "^7.0.0",
+    "@turf/nearest-point-on-line": "^7.0.0",
+    "deep-equal": "^2.2.3",
+    "tslib": "^2.6.2"
   },
-  "gitHead": "dd35b52725945b4fa29a98d9a550733e06cc222e"
+  "gitHead": "3d3a7917025fbabe191dbddbc89754b86f9c7739"
 }

package/dist/es/index.js

@@ -1,146 +0,0 @@
-import rbush from "@turf/geojson-rbush";
-import lineSegment from "@turf/line-segment";
-import nearestPointOnLine from "@turf/nearest-point-on-line";
-import booleanPointOnLine from "@turf/boolean-point-on-line";
-import { getCoords } from "@turf/invariant";
-import { featureEach, segmentEach } from "@turf/meta";
-import { featureCollection, isObject } from "@turf/helpers";
-import equal from "deep-equal";
-/**
- * Takes any LineString or Polygon and returns the overlapping lines between both features.
- *
- * @name lineOverlap
- * @param {Geometry|Feature<LineString|MultiLineString|Polygon|MultiPolygon>} line1 any LineString or Polygon
- * @param {Geometry|Feature<LineString|MultiLineString|Polygon|MultiPolygon>} line2 any LineString or Polygon
- * @param {Object} [options={}] Optional parameters
- * @param {number} [options.tolerance=0] Tolerance distance to match overlapping line segments (in kilometers)
- * @returns {FeatureCollection<LineString>} lines(s) that are overlapping between both features
- * @example
- * var line1 = turf.lineString([[115, -35], [125, -30], [135, -30], [145, -35]]);
- * var line2 = turf.lineString([[115, -25], [125, -30], [135, -30], [145, -25]]);
- *
- * var overlapping = turf.lineOverlap(line1, line2);
- *
- * //addToMap
- * var addToMap = [line1, line2, overlapping]
- */
-function lineOverlap(line1, line2, options = {}) {
-    // Optional parameters
-    options = options || {};
-    if (!isObject(options))
-        throw new Error("options is invalid");
-    var tolerance = options.tolerance || 0;
-    // Containers
-    var features = [];
-    // Create Spatial Index
-    var tree = rbush();
-    // To-Do -- HACK way to support typescript
-    const line = lineSegment(line1);
-    tree.load(line);
-    var overlapSegment;
-    let additionalSegments = [];
-    // Line Intersection
-    // Iterate over line segments
-    segmentEach(line2, function (segment) {
-        var doesOverlaps = false;
-        if (!segment) {
-            return;
-        }
-        // Iterate over each segments which falls within the same bounds
-        featureEach(tree.search(segment), function (match) {
-            if (doesOverlaps === false) {
-                var coordsSegment = getCoords(segment).sort();
-                var coordsMatch = getCoords(match).sort();
-                // Segment overlaps feature
-                if (equal(coordsSegment, coordsMatch)) {
-                    doesOverlaps = true;
-                    // Overlaps already exists - only append last coordinate of segment
-                    if (overlapSegment) {
-                        overlapSegment =
-                            concatSegment(overlapSegment, segment) || overlapSegment;
-                    }
-                    else
-                        overlapSegment = segment;
-                    // Match segments which don't share nodes (Issue #901)
-                }
-                else if (tolerance === 0
-                    ? booleanPointOnLine(coordsSegment[0], match) &&
-                        booleanPointOnLine(coordsSegment[1], match)
-                    : nearestPointOnLine(match, coordsSegment[0]).properties.dist <=
-                        tolerance &&
-                        nearestPointOnLine(match, coordsSegment[1]).properties.dist <=
-                            tolerance) {
-                    doesOverlaps = true;
-                    if (overlapSegment) {
-                        overlapSegment =
-                            concatSegment(overlapSegment, segment) || overlapSegment;
-                    }
-                    else
-                        overlapSegment = segment;
-                }
-                else if (tolerance === 0
-                    ? booleanPointOnLine(coordsMatch[0], segment) &&
-                        booleanPointOnLine(coordsMatch[1], segment)
-                    : nearestPointOnLine(segment, coordsMatch[0]).properties.dist <=
-                        tolerance &&
-                        nearestPointOnLine(segment, coordsMatch[1]).properties.dist <=
-                            tolerance) {
-                    // Do not define (doesOverlap = true) since more matches can occur within the same segment
-                    // doesOverlaps = true;
-                    if (overlapSegment) {
-                        const combinedSegment = concatSegment(overlapSegment, match);
-                        if (combinedSegment) {
-                            overlapSegment = combinedSegment;
-                        }
-                        else {
-                            additionalSegments.push(match);
-                        }
-                    }
-                    else
-                        overlapSegment = match;
-                }
-            }
-        });
-        // Segment doesn't overlap - add overlaps to results & reset
-        if (doesOverlaps === false && overlapSegment) {
-            features.push(overlapSegment);
-            if (additionalSegments.length) {
-                features = features.concat(additionalSegments);
-                additionalSegments = [];
-            }
-            overlapSegment = undefined;
-        }
-    });
-    // Add last segment if exists
-    if (overlapSegment)
-        features.push(overlapSegment);
-    return featureCollection(features);
-}
-/**
- * Concat Segment
- *
- * @private
- * @param {Feature<LineString>} line LineString
- * @param {Feature<LineString>} segment 2-vertex LineString
- * @returns {Feature<LineString>} concat linestring
- */
-function concatSegment(line, segment) {
-    var coords = getCoords(segment);
-    var lineCoords = getCoords(line);
-    var start = lineCoords[0];
-    var end = lineCoords[lineCoords.length - 1];
-    var geom = line.geometry.coordinates;
-    if (equal(coords[0], start))
-        geom.unshift(coords[1]);
-    else if (equal(coords[0], end))
-        geom.push(coords[1]);
-    else if (equal(coords[1], start))
-        geom.unshift(coords[0]);
-    else if (equal(coords[1], end))
-        geom.push(coords[0]);
-    else
-        return; // If the overlap leaves the segment unchanged, return undefined so that this can be identified.
-    // Otherwise return the mutated line.
-    return line;
-}
-export default lineOverlap;

package/dist/es/package.json

@@ -1 +0,0 @@
-{"type":"module"}

package/dist/js/index.js

@@ -1,149 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-const tslib_1 = require("tslib");
-const geojson_rbush_1 = tslib_1.__importDefault(require("@turf/geojson-rbush"));
-const line_segment_1 = tslib_1.__importDefault(require("@turf/line-segment"));
-const nearest_point_on_line_1 = tslib_1.__importDefault(require("@turf/nearest-point-on-line"));
-const boolean_point_on_line_1 = tslib_1.__importDefault(require("@turf/boolean-point-on-line"));
-const invariant_1 = require("@turf/invariant");
-const meta_1 = require("@turf/meta");
-const helpers_1 = require("@turf/helpers");
-const deep_equal_1 = tslib_1.__importDefault(require("deep-equal"));
-/**
- * Takes any LineString or Polygon and returns the overlapping lines between both features.
- *
- * @name lineOverlap
- * @param {Geometry|Feature<LineString|MultiLineString|Polygon|MultiPolygon>} line1 any LineString or Polygon
- * @param {Geometry|Feature<LineString|MultiLineString|Polygon|MultiPolygon>} line2 any LineString or Polygon
- * @param {Object} [options={}] Optional parameters
- * @param {number} [options.tolerance=0] Tolerance distance to match overlapping line segments (in kilometers)
- * @returns {FeatureCollection<LineString>} lines(s) that are overlapping between both features
- * @example
- * var line1 = turf.lineString([[115, -35], [125, -30], [135, -30], [145, -35]]);
- * var line2 = turf.lineString([[115, -25], [125, -30], [135, -30], [145, -25]]);
- *
- * var overlapping = turf.lineOverlap(line1, line2);
- *
- * //addToMap
- * var addToMap = [line1, line2, overlapping]
- */
-function lineOverlap(line1, line2, options = {}) {
-    // Optional parameters
-    options = options || {};
-    if (!helpers_1.isObject(options))
-        throw new Error("options is invalid");
-    var tolerance = options.tolerance || 0;
-    // Containers
-    var features = [];
-    // Create Spatial Index
-    var tree = geojson_rbush_1.default();
-    // To-Do -- HACK way to support typescript
-    const line = line_segment_1.default(line1);
-    tree.load(line);
-    var overlapSegment;
-    let additionalSegments = [];
-    // Line Intersection
-    // Iterate over line segments
-    meta_1.segmentEach(line2, function (segment) {
-        var doesOverlaps = false;
-        if (!segment) {
-            return;
-        }
-        // Iterate over each segments which falls within the same bounds
-        meta_1.featureEach(tree.search(segment), function (match) {
-            if (doesOverlaps === false) {
-                var coordsSegment = invariant_1.getCoords(segment).sort();
-                var coordsMatch = invariant_1.getCoords(match).sort();
-                // Segment overlaps feature
-                if (deep_equal_1.default(coordsSegment, coordsMatch)) {
-                    doesOverlaps = true;
-                    // Overlaps already exists - only append last coordinate of segment
-                    if (overlapSegment) {
-                        overlapSegment =
-                            concatSegment(overlapSegment, segment) || overlapSegment;
-                    }
-                    else
-                        overlapSegment = segment;
-                    // Match segments which don't share nodes (Issue #901)
-                }
-                else if (tolerance === 0
-                    ? boolean_point_on_line_1.default(coordsSegment[0], match) &&
-                        boolean_point_on_line_1.default(coordsSegment[1], match)
-                    : nearest_point_on_line_1.default(match, coordsSegment[0]).properties.dist <=
-                        tolerance &&
-                        nearest_point_on_line_1.default(match, coordsSegment[1]).properties.dist <=
-                            tolerance) {
-                    doesOverlaps = true;
-                    if (overlapSegment) {
-                        overlapSegment =
-                            concatSegment(overlapSegment, segment) || overlapSegment;
-                    }
-                    else
-                        overlapSegment = segment;
-                }
-                else if (tolerance === 0
-                    ? boolean_point_on_line_1.default(coordsMatch[0], segment) &&
-                        boolean_point_on_line_1.default(coordsMatch[1], segment)
-                    : nearest_point_on_line_1.default(segment, coordsMatch[0]).properties.dist <=
-                        tolerance &&
-                        nearest_point_on_line_1.default(segment, coordsMatch[1]).properties.dist <=
-                            tolerance) {
-                    // Do not define (doesOverlap = true) since more matches can occur within the same segment
-                    // doesOverlaps = true;
-                    if (overlapSegment) {
-                        const combinedSegment = concatSegment(overlapSegment, match);
-                        if (combinedSegment) {
-                            overlapSegment = combinedSegment;
-                        }
-                        else {
-                            additionalSegments.push(match);
-                        }
-                    }
-                    else
-                        overlapSegment = match;
-                }
-            }
-        });
-        // Segment doesn't overlap - add overlaps to results & reset
-        if (doesOverlaps === false && overlapSegment) {
-            features.push(overlapSegment);
-            if (additionalSegments.length) {
-                features = features.concat(additionalSegments);
-                additionalSegments = [];
-            }
-            overlapSegment = undefined;
-        }
-    });
-    // Add last segment if exists
-    if (overlapSegment)
-        features.push(overlapSegment);
-    return helpers_1.featureCollection(features);
-}
-/**
- * Concat Segment
- *
- * @private
- * @param {Feature<LineString>} line LineString
- * @param {Feature<LineString>} segment 2-vertex LineString
- * @returns {Feature<LineString>} concat linestring
- */
-function concatSegment(line, segment) {
-    var coords = invariant_1.getCoords(segment);
-    var lineCoords = invariant_1.getCoords(line);
-    var start = lineCoords[0];
-    var end = lineCoords[lineCoords.length - 1];
-    var geom = line.geometry.coordinates;
-    if (deep_equal_1.default(coords[0], start))
-        geom.unshift(coords[1]);
-    else if (deep_equal_1.default(coords[0], end))
-        geom.push(coords[1]);
-    else if (deep_equal_1.default(coords[1], start))
-        geom.unshift(coords[0]);
-    else if (deep_equal_1.default(coords[1], end))
-        geom.push(coords[0]);
-    else
-        return; // If the overlap leaves the segment unchanged, return undefined so that this can be identified.
-    // Otherwise return the mutated line.
-    return line;
-}
-exports.default = lineOverlap;