Export SmartIntersection module to expose its usage in polygon-offset

alexbol99 · Aug 29, 2023 · 4b339ea · 4b339ea
1 parent 4d007c6
commit 4b339ea
Show file tree

Hide file tree

Showing 5 changed files with 51 additions and 2 deletions.
diff --git a/dist/main.cjs.js b/dist/main.cjs.js
@@ -760,6 +760,21 @@ function insertBetweenIntPoints(int_point1, int_point2, new_edge) {
     edge_after.prev = new_edge;
 }
 
+var smart_intersections = /*#__PURE__*/Object.freeze({
+    __proto__: null,
+    addToIntPoints: addToIntPoints,
+    calculateInclusionFlags: calculateInclusionFlags,
+    filterDuplicatedIntersections: filterDuplicatedIntersections,
+    getSortedArray: getSortedArray,
+    getSortedArrayOnLine: getSortedArrayOnLine,
+    initializeInclusionFlags: initializeInclusionFlags,
+    insertBetweenIntPoints: insertBetweenIntPoints,
+    intPointsPoolCount: intPointsPoolCount,
+    setOverlappingFlags: setOverlappingFlags,
+    sortIntersections: sortIntersections,
+    splitByIntersections: splitByIntersections
+});
+
 /**
  * Created by Alex Bol on 12/02/2018.
  */
@@ -8745,6 +8760,7 @@ exports.Polygon = Polygon;
 exports.Ray = Ray;
 exports.Relations = Relations;
 exports.Segment = Segment;
+exports.SmartIntersections = smart_intersections;
 exports.Utils = Utils$1;
 exports.Vector = Vector$1;
 exports.arc = arc;

diff --git a/dist/main.esm.js b/dist/main.esm.js
@@ -756,6 +756,21 @@ function insertBetweenIntPoints(int_point1, int_point2, new_edge) {
     edge_after.prev = new_edge;
 }
 
+var smart_intersections = /*#__PURE__*/Object.freeze({
+    __proto__: null,
+    addToIntPoints: addToIntPoints,
+    calculateInclusionFlags: calculateInclusionFlags,
+    filterDuplicatedIntersections: filterDuplicatedIntersections,
+    getSortedArray: getSortedArray,
+    getSortedArrayOnLine: getSortedArrayOnLine,
+    initializeInclusionFlags: initializeInclusionFlags,
+    insertBetweenIntPoints: insertBetweenIntPoints,
+    intPointsPoolCount: intPointsPoolCount,
+    setOverlappingFlags: setOverlappingFlags,
+    sortIntersections: sortIntersections,
+    splitByIntersections: splitByIntersections
+});
+
 /**
  * Created by Alex Bol on 12/02/2018.
  */
@@ -8717,4 +8732,4 @@ Flatten.Distance = Distance;
 Flatten.BooleanOperations = BooleanOperations;
 Flatten.Relations = Relations;
 
-export { Arc, BOUNDARY$1 as BOUNDARY, BooleanOperations, Box, CCW, CW, Circle$1 as Circle, Distance, Edge, errors as Errors, Face, INSIDE$2 as INSIDE, Inversion, Line$1 as Line, Matrix, Multiline, ORIENTATION, OUTSIDE$1 as OUTSIDE, PlanarSet, Point$1 as Point, Polygon, Ray, Relations, Segment, Utils$1 as Utils, Vector$1 as Vector, arc, box, circle, Flatten as default, inversion, line, matrix, multiline, point, polygon, ray, ray_shoot, segment, vector$1 as vector };
+export { Arc, BOUNDARY$1 as BOUNDARY, BooleanOperations, Box, CCW, CW, Circle$1 as Circle, Distance, Edge, errors as Errors, Face, INSIDE$2 as INSIDE, Inversion, Line$1 as Line, Matrix, Multiline, ORIENTATION, OUTSIDE$1 as OUTSIDE, PlanarSet, Point$1 as Point, Polygon, Ray, Relations, Segment, smart_intersections as SmartIntersections, Utils$1 as Utils, Vector$1 as Vector, arc, box, circle, Flatten as default, inversion, line, matrix, multiline, point, polygon, ray, ray_shoot, segment, vector$1 as vector };
diff --git a/dist/main.umd.js b/dist/main.umd.js
@@ -762,6 +762,21 @@
         edge_after.prev = new_edge;
     }
 
+    var smart_intersections = /*#__PURE__*/Object.freeze({
+        __proto__: null,
+        addToIntPoints: addToIntPoints,
+        calculateInclusionFlags: calculateInclusionFlags,
+        filterDuplicatedIntersections: filterDuplicatedIntersections,
+        getSortedArray: getSortedArray,
+        getSortedArrayOnLine: getSortedArrayOnLine,
+        initializeInclusionFlags: initializeInclusionFlags,
+        insertBetweenIntPoints: insertBetweenIntPoints,
+        intPointsPoolCount: intPointsPoolCount,
+        setOverlappingFlags: setOverlappingFlags,
+        sortIntersections: sortIntersections,
+        splitByIntersections: splitByIntersections
+    });
+
     /**
      * Created by Alex Bol on 12/02/2018.
      */
@@ -8747,6 +8762,7 @@
     exports.Ray = Ray;
     exports.Relations = Relations;
     exports.Segment = Segment;
+    exports.SmartIntersections = smart_intersections;
     exports.Utils = Utils$1;
     exports.Vector = Vector$1;
     exports.arc = arc;

diff --git a/index.js b/index.js
@@ -7,6 +7,7 @@ import * as Utils from "./src/utils/utils";
 import * as Errors from "./src/utils/errors";
 import * as BooleanOperations from './src/algorithms/boolean_op';
 import * as Relations from './src/algorithms/relation';
+import * as SmartIntersections from './src/data_structures/smart_intersections';
 
 export {Utils, Errors};
 export {Matrix, matrix} from './src/classes/matrix';
@@ -28,6 +29,7 @@ export {Inversion, inversion} from './src/classes/inversion';
 export {Distance} from './src/algorithms/distance';
 export {BooleanOperations};
 export {Relations};
+export {SmartIntersections};
 
 Flatten.BooleanOperations = BooleanOperations;
 Flatten.Relations = Relations;

diff --git a/package.json b/package.json
@@ -1,6 +1,6 @@
 {
   "name": "@flatten-js/core",
-  "version": "1.4.1",
+  "version": "1.4.2",
   "description": "Javascript library for 2d geometry",
   "main": "dist/main.cjs.js",
   "umd:main": "dist/main.umd.js",