@nasser-sw/fabric 7.0.0-beta1

package/dist/src/util/misc/vectors.d.ts

@@ -0,0 +1,72 @@
+import type { XY } from '../../Point';
+import { Point } from '../../Point';
+import type { TRadian } from '../../typedefs';
+/**
+ * Rotates `vector` with `radians`
+ * @param {Point} vector The vector to rotate (x and y)
+ * @param {Number} radians The radians of the angle for the rotation
+ * @return {Point} The new rotated point
+ */
+export declare const rotateVector: (vector: Point, radians: TRadian) => Point;
+/**
+ * Creates a vector from points represented as a point
+ *
+ * @param {Point} from
+ * @param {Point} to
+ * @returns {Point} vector
+ */
+export declare const createVector: (from: XY, to: XY) => Point;
+/**
+ * return the magnitude of a vector
+ * @return {number}
+ */
+export declare const magnitude: (point: Point) => number;
+/**
+ * Calculates the angle between 2 vectors
+ * @param {Point} a
+ * @param {Point} b
+ * @returns the angle in radians from `a` to `b`
+ */
+export declare const calcAngleBetweenVectors: (a: Point, b: Point) => TRadian;
+/**
+ * Calculates the angle between the x axis and the vector
+ * @param {Point} v
+ * @returns the angle in radians of `v`
+ */
+export declare const calcVectorRotation: (v: Point) => TRadian;
+/**
+ * @param {Point} v
+ * @returns {Point} vector representing the unit vector pointing to the direction of `v`
+ */
+export declare const getUnitVector: (v: Point) => Point;
+/**
+ * @param {Point} v
+ * @param {Boolean} [counterClockwise] the direction of the orthogonal vector, defaults to `true`
+ * @returns {Point} the unit orthogonal vector
+ */
+export declare const getOrthonormalVector: (v: Point, counterClockwise?: boolean) => Point;
+/**
+ * Cross product of two vectors in 2D
+ * @param {Point} a
+ * @param {Point} b
+ * @returns {number} the magnitude of Z vector
+ */
+export declare const crossProduct: (a: Point, b: Point) => number;
+/**
+ * Dot product of two vectors in 2D
+ * @param {Point} a
+ * @param {Point} b
+ * @returns {number}
+ */
+export declare const dotProduct: (a: Point, b: Point) => number;
+/**
+ * Checks if the vector is between two others. It is considered
+ * to be inside when the vector to be tested is between the
+ * initial vector and the final vector (included) in a counterclockwise direction.
+ * @param {Point} t vector to be tested
+ * @param {Point} a initial vector
+ * @param {Point} b final vector
+ * @returns {boolean} true if the vector is among the others
+ */
+export declare const isBetweenVectors: (t: Point, a: Point, b: Point) => boolean;
+//# sourceMappingURL=vectors.d.ts.map

package/dist/src/util/misc/vectors.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"vectors.d.ts","sourceRoot":"","sources":["../../../../src/util/misc/vectors.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,EAAE,EAAE,MAAM,aAAa,CAAC;AACtC,OAAO,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AACpC,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,gBAAgB,CAAC;AAK9C;;;;;GAKG;AACH,eAAO,MAAM,YAAY,GAAI,QAAQ,KAAK,EAAE,SAAS,OAAO,UACpC,CAAC;AAEzB;;;;;;GAMG;AACH,eAAO,MAAM,YAAY,GAAI,MAAM,EAAE,EAAE,IAAI,EAAE,KAAG,KAClB,CAAC;AAE/B;;;GAGG;AACH,eAAO,MAAM,SAAS,GAAI,OAAO,KAAK,WAA6B,CAAC;AAEpE;;;;;GAKG;AACH,eAAO,MAAM,uBAAuB,GAAI,GAAG,KAAK,EAAE,GAAG,KAAK,KAAG,OACA,CAAC;AAE9D;;;;GAIG;AACH,eAAO,MAAM,kBAAkB,GAAI,GAAG,KAAK,YACF,CAAC;AAE1C;;;GAGG;AACH,eAAO,MAAM,aAAa,GAAI,GAAG,KAAK,KAAG,KACM,CAAC;AAEhD;;;;GAIG;AACH,eAAO,MAAM,oBAAoB,GAC/B,GAAG,KAAK,EACR,0BAAuB,KACtB,KAC4E,CAAC;AAEhF;;;;;GAKG;AACH,eAAO,MAAM,YAAY,GAAI,GAAG,KAAK,EAAE,GAAG,KAAK,KAAG,MAC3B,CAAC;AAExB;;;;;GAKG;AACH,eAAO,MAAM,UAAU,GAAI,GAAG,KAAK,EAAE,GAAG,KAAK,KAAG,MAA+B,CAAC;AAEhF;;;;;;;;GAQG;AACH,eAAO,MAAM,gBAAgB,GAAI,GAAG,KAAK,EAAE,GAAG,KAAK,EAAE,GAAG,KAAK,KAAG,OAM/D,CAAC"}

package/dist/src/util/misc/vectors.min.mjs

@@ -0,0 +1,2 @@
+import{Point as t}from"../../Point.min.mjs";const e=new t(1,0),n=new t,r=(t,e)=>t.rotate(e),a=(e,n)=>new t(n).subtract(e),i=t=>t.distanceFrom(n),o=(t,e)=>Math.atan2(u(t,e),x(t,e)),c=t=>o(e,t),s=t=>t.eq(n)?t:t.scalarDivide(i(t)),l=function(e){let n=!(arguments.length>1&&void 0!==arguments[1])||arguments[1];return s(new t(-e.y,e.x).scalarMultiply(n?1:-1))},u=(t,e)=>t.x*e.y-t.y*e.x,x=(t,e)=>t.x*e.x+t.y*e.y,y=(t,e,n)=>{if(t.eq(e)||t.eq(n))return!0;const r=u(e,n),a=u(e,t),i=u(n,t);return r>=0?a>=0&&i<=0:!(a<=0&&i>=0)};export{o as calcAngleBetweenVectors,c as calcVectorRotation,a as createVector,u as crossProduct,x as dotProduct,l as getOrthonormalVector,s as getUnitVector,y as isBetweenVectors,i as magnitude,r as rotateVector};
+//# sourceMappingURL=vectors.min.mjs.map

package/dist/src/util/misc/vectors.min.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"vectors.min.mjs","sources":["../../../../src/util/misc/vectors.ts"],"sourcesContent":["import type { XY } from '../../Point';\nimport { Point } from '../../Point';\nimport type { TRadian } from '../../typedefs';\n\nconst unitVectorX = new Point(1, 0);\nconst zero = new Point();\n\n/**\n * Rotates `vector` with `radians`\n * @param {Point} vector The vector to rotate (x and y)\n * @param {Number} radians The radians of the angle for the rotation\n * @return {Point} The new rotated point\n */\nexport const rotateVector = (vector: Point, radians: TRadian) =>\n  vector.rotate(radians);\n\n/**\n * Creates a vector from points represented as a point\n *\n * @param {Point} from\n * @param {Point} to\n * @returns {Point} vector\n */\nexport const createVector = (from: XY, to: XY): Point =>\n  new Point(to).subtract(from);\n\n/**\n * return the magnitude of a vector\n * @return {number}\n */\nexport const magnitude = (point: Point) => point.distanceFrom(zero);\n\n/**\n * Calculates the angle between 2 vectors\n * @param {Point} a\n * @param {Point} b\n * @returns the angle in radians from `a` to `b`\n */\nexport const calcAngleBetweenVectors = (a: Point, b: Point): TRadian =>\n  Math.atan2(crossProduct(a, b), dotProduct(a, b)) as TRadian;\n\n/**\n * Calculates the angle between the x axis and the vector\n * @param {Point} v\n * @returns the angle in radians of `v`\n */\nexport const calcVectorRotation = (v: Point) =>\n  calcAngleBetweenVectors(unitVectorX, v);\n\n/**\n * @param {Point} v\n * @returns {Point} vector representing the unit vector pointing to the direction of `v`\n */\nexport const getUnitVector = (v: Point): Point =>\n  v.eq(zero) ? v : v.scalarDivide(magnitude(v));\n\n/**\n * @param {Point} v\n * @param {Boolean} [counterClockwise] the direction of the orthogonal vector, defaults to `true`\n * @returns {Point} the unit orthogonal vector\n */\nexport const getOrthonormalVector = (\n  v: Point,\n  counterClockwise = true,\n): Point =>\n  getUnitVector(new Point(-v.y, v.x).scalarMultiply(counterClockwise ? 1 : -1));\n\n/**\n * Cross product of two vectors in 2D\n * @param {Point} a\n * @param {Point} b\n * @returns {number} the magnitude of Z vector\n */\nexport const crossProduct = (a: Point, b: Point): number =>\n  a.x * b.y - a.y * b.x;\n\n/**\n * Dot product of two vectors in 2D\n * @param {Point} a\n * @param {Point} b\n * @returns {number}\n */\nexport const dotProduct = (a: Point, b: Point): number => a.x * b.x + a.y * b.y;\n\n/**\n * Checks if the vector is between two others. It is considered\n * to be inside when the vector to be tested is between the\n * initial vector and the final vector (included) in a counterclockwise direction.\n * @param {Point} t vector to be tested\n * @param {Point} a initial vector\n * @param {Point} b final vector\n * @returns {boolean} true if the vector is among the others\n */\nexport const isBetweenVectors = (t: Point, a: Point, b: Point): boolean => {\n  if (t.eq(a) || t.eq(b)) return true;\n  const AxB = crossProduct(a, b),\n    AxT = crossProduct(a, t),\n    BxT = crossProduct(b, t);\n  return AxB >= 0 ? AxT >= 0 && BxT <= 0 : !(AxT <= 0 && BxT >= 0);\n};\n"],"names":["unitVectorX","Point","zero","rotateVector","vector","radians","rotate","createVector","from","to","subtract","magnitude","point","distanceFrom","calcAngleBetweenVectors","a","b","Math","atan2","crossProduct","dotProduct","calcVectorRotation","v","getUnitVector","eq","scalarDivide","getOrthonormalVector","counterClockwise","arguments","length","undefined","y","x","scalarMultiply","isBetweenVectors","t","AxB","AxT","BxT"],"mappings":"4CAIA,MAAMA,EAAc,IAAIC,EAAM,EAAG,GAC3BC,EAAO,IAAID,EAQJE,EAAeA,CAACC,EAAeC,IAC1CD,EAAOE,OAAOD,GASHE,EAAeA,CAACC,EAAUC,IACrC,IAAIR,EAAMQ,GAAIC,SAASF,GAMZG,EAAaC,GAAiBA,EAAMC,aAAaX,GAQjDY,EAA0BA,CAACC,EAAUC,IAChDC,KAAKC,MAAMC,EAAaJ,EAAGC,GAAII,EAAWL,EAAGC,IAOlCK,EAAsBC,GACjCR,EAAwBd,EAAasB,GAM1BC,EAAiBD,GAC5BA,EAAEE,GAAGtB,GAAQoB,EAAIA,EAAEG,aAAad,EAAUW,IAO/BI,EAAuB,SAClCJ,GAAQ,IACRK,IAAgBC,UAAAC,OAAA,QAAAC,IAAAF,UAAA,KAAAA,UAAA,GAAO,OAEvBL,EAAc,IAAItB,GAAOqB,EAAES,EAAGT,EAAEU,GAAGC,eAAeN,EAAmB,GAAI,GAAI,EAQlER,EAAeA,CAACJ,EAAUC,IACrCD,EAAEiB,EAAIhB,EAAEe,EAAIhB,EAAEgB,EAAIf,EAAEgB,EAQTZ,EAAaA,CAACL,EAAUC,IAAqBD,EAAEiB,EAAIhB,EAAEgB,EAAIjB,EAAEgB,EAAIf,EAAEe,EAWjEG,EAAmBA,CAACC,EAAUpB,EAAUC,KACnD,GAAImB,EAAEX,GAAGT,IAAMoB,EAAEX,GAAGR,GAAI,OAAO,EAC/B,MAAMoB,EAAMjB,EAAaJ,EAAGC,GAC1BqB,EAAMlB,EAAaJ,EAAGoB,GACtBG,EAAMnB,EAAaH,EAAGmB,GACxB,OAAOC,GAAO,EAAIC,GAAO,GAAKC,GAAO,IAAMD,GAAO,GAAKC,GAAO"}

package/dist/src/util/misc/vectors.mjs

@@ -0,0 +1,94 @@
+import { Point } from '../../Point.mjs';
+
+const unitVectorX = new Point(1, 0);
+const zero = new Point();
+
+/**
+ * Rotates `vector` with `radians`
+ * @param {Point} vector The vector to rotate (x and y)
+ * @param {Number} radians The radians of the angle for the rotation
+ * @return {Point} The new rotated point
+ */
+const rotateVector = (vector, radians) => vector.rotate(radians);
+
+/**
+ * Creates a vector from points represented as a point
+ *
+ * @param {Point} from
+ * @param {Point} to
+ * @returns {Point} vector
+ */
+const createVector = (from, to) => new Point(to).subtract(from);
+
+/**
+ * return the magnitude of a vector
+ * @return {number}
+ */
+const magnitude = point => point.distanceFrom(zero);
+
+/**
+ * Calculates the angle between 2 vectors
+ * @param {Point} a
+ * @param {Point} b
+ * @returns the angle in radians from `a` to `b`
+ */
+const calcAngleBetweenVectors = (a, b) => Math.atan2(crossProduct(a, b), dotProduct(a, b));
+
+/**
+ * Calculates the angle between the x axis and the vector
+ * @param {Point} v
+ * @returns the angle in radians of `v`
+ */
+const calcVectorRotation = v => calcAngleBetweenVectors(unitVectorX, v);
+
+/**
+ * @param {Point} v
+ * @returns {Point} vector representing the unit vector pointing to the direction of `v`
+ */
+const getUnitVector = v => v.eq(zero) ? v : v.scalarDivide(magnitude(v));
+
+/**
+ * @param {Point} v
+ * @param {Boolean} [counterClockwise] the direction of the orthogonal vector, defaults to `true`
+ * @returns {Point} the unit orthogonal vector
+ */
+const getOrthonormalVector = function (v) {
+  let counterClockwise = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;
+  return getUnitVector(new Point(-v.y, v.x).scalarMultiply(counterClockwise ? 1 : -1));
+};
+
+/**
+ * Cross product of two vectors in 2D
+ * @param {Point} a
+ * @param {Point} b
+ * @returns {number} the magnitude of Z vector
+ */
+const crossProduct = (a, b) => a.x * b.y - a.y * b.x;
+
+/**
+ * Dot product of two vectors in 2D
+ * @param {Point} a
+ * @param {Point} b
+ * @returns {number}
+ */
+const dotProduct = (a, b) => a.x * b.x + a.y * b.y;
+
+/**
+ * Checks if the vector is between two others. It is considered
+ * to be inside when the vector to be tested is between the
+ * initial vector and the final vector (included) in a counterclockwise direction.
+ * @param {Point} t vector to be tested
+ * @param {Point} a initial vector
+ * @param {Point} b final vector
+ * @returns {boolean} true if the vector is among the others
+ */
+const isBetweenVectors = (t, a, b) => {
+  if (t.eq(a) || t.eq(b)) return true;
+  const AxB = crossProduct(a, b),
+    AxT = crossProduct(a, t),
+    BxT = crossProduct(b, t);
+  return AxB >= 0 ? AxT >= 0 && BxT <= 0 : !(AxT <= 0 && BxT >= 0);
+};
+
+export { calcAngleBetweenVectors, calcVectorRotation, createVector, crossProduct, dotProduct, getOrthonormalVector, getUnitVector, isBetweenVectors, magnitude, rotateVector };
+//# sourceMappingURL=vectors.mjs.map

package/dist/src/util/misc/vectors.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"vectors.mjs","sources":["../../../../src/util/misc/vectors.ts"],"sourcesContent":["import type { XY } from '../../Point';\nimport { Point } from '../../Point';\nimport type { TRadian } from '../../typedefs';\n\nconst unitVectorX = new Point(1, 0);\nconst zero = new Point();\n\n/**\n * Rotates `vector` with `radians`\n * @param {Point} vector The vector to rotate (x and y)\n * @param {Number} radians The radians of the angle for the rotation\n * @return {Point} The new rotated point\n */\nexport const rotateVector = (vector: Point, radians: TRadian) =>\n  vector.rotate(radians);\n\n/**\n * Creates a vector from points represented as a point\n *\n * @param {Point} from\n * @param {Point} to\n * @returns {Point} vector\n */\nexport const createVector = (from: XY, to: XY): Point =>\n  new Point(to).subtract(from);\n\n/**\n * return the magnitude of a vector\n * @return {number}\n */\nexport const magnitude = (point: Point) => point.distanceFrom(zero);\n\n/**\n * Calculates the angle between 2 vectors\n * @param {Point} a\n * @param {Point} b\n * @returns the angle in radians from `a` to `b`\n */\nexport const calcAngleBetweenVectors = (a: Point, b: Point): TRadian =>\n  Math.atan2(crossProduct(a, b), dotProduct(a, b)) as TRadian;\n\n/**\n * Calculates the angle between the x axis and the vector\n * @param {Point} v\n * @returns the angle in radians of `v`\n */\nexport const calcVectorRotation = (v: Point) =>\n  calcAngleBetweenVectors(unitVectorX, v);\n\n/**\n * @param {Point} v\n * @returns {Point} vector representing the unit vector pointing to the direction of `v`\n */\nexport const getUnitVector = (v: Point): Point =>\n  v.eq(zero) ? v : v.scalarDivide(magnitude(v));\n\n/**\n * @param {Point} v\n * @param {Boolean} [counterClockwise] the direction of the orthogonal vector, defaults to `true`\n * @returns {Point} the unit orthogonal vector\n */\nexport const getOrthonormalVector = (\n  v: Point,\n  counterClockwise = true,\n): Point =>\n  getUnitVector(new Point(-v.y, v.x).scalarMultiply(counterClockwise ? 1 : -1));\n\n/**\n * Cross product of two vectors in 2D\n * @param {Point} a\n * @param {Point} b\n * @returns {number} the magnitude of Z vector\n */\nexport const crossProduct = (a: Point, b: Point): number =>\n  a.x * b.y - a.y * b.x;\n\n/**\n * Dot product of two vectors in 2D\n * @param {Point} a\n * @param {Point} b\n * @returns {number}\n */\nexport const dotProduct = (a: Point, b: Point): number => a.x * b.x + a.y * b.y;\n\n/**\n * Checks if the vector is between two others. It is considered\n * to be inside when the vector to be tested is between the\n * initial vector and the final vector (included) in a counterclockwise direction.\n * @param {Point} t vector to be tested\n * @param {Point} a initial vector\n * @param {Point} b final vector\n * @returns {boolean} true if the vector is among the others\n */\nexport const isBetweenVectors = (t: Point, a: Point, b: Point): boolean => {\n  if (t.eq(a) || t.eq(b)) return true;\n  const AxB = crossProduct(a, b),\n    AxT = crossProduct(a, t),\n    BxT = crossProduct(b, t);\n  return AxB >= 0 ? AxT >= 0 && BxT <= 0 : !(AxT <= 0 && BxT >= 0);\n};\n"],"names":["unitVectorX","Point","zero","rotateVector","vector","radians","rotate","createVector","from","to","subtract","magnitude","point","distanceFrom","calcAngleBetweenVectors","a","b","Math","atan2","crossProduct","dotProduct","calcVectorRotation","v","getUnitVector","eq","scalarDivide","getOrthonormalVector","counterClockwise","arguments","length","undefined","y","x","scalarMultiply","isBetweenVectors","t","AxB","AxT","BxT"],"mappings":";;AAIA,MAAMA,WAAW,GAAG,IAAIC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;AACnC,MAAMC,IAAI,GAAG,IAAID,KAAK,EAAE;;AAExB;AACA;AACA;AACA;AACA;AACA;AACO,MAAME,YAAY,GAAGA,CAACC,MAAa,EAAEC,OAAgB,KAC1DD,MAAM,CAACE,MAAM,CAACD,OAAO;;AAEvB;AACA;AACA;AACA;AACA;AACA;AACA;MACaE,YAAY,GAAGA,CAACC,IAAQ,EAAEC,EAAM,KAC3C,IAAIR,KAAK,CAACQ,EAAE,CAAC,CAACC,QAAQ,CAACF,IAAI;;AAE7B;AACA;AACA;AACA;AACO,MAAMG,SAAS,GAAIC,KAAY,IAAKA,KAAK,CAACC,YAAY,CAACX,IAAI;;AAElE;AACA;AACA;AACA;AACA;AACA;AACO,MAAMY,uBAAuB,GAAGA,CAACC,CAAQ,EAAEC,CAAQ,KACxDC,IAAI,CAACC,KAAK,CAACC,YAAY,CAACJ,CAAC,EAAEC,CAAC,CAAC,EAAEI,UAAU,CAACL,CAAC,EAAEC,CAAC,CAAC;;AAEjD;AACA;AACA;AACA;AACA;AACO,MAAMK,kBAAkB,GAAIC,CAAQ,IACzCR,uBAAuB,CAACd,WAAW,EAAEsB,CAAC;;AAExC;AACA;AACA;AACA;AACO,MAAMC,aAAa,GAAID,CAAQ,IACpCA,CAAC,CAACE,EAAE,CAACtB,IAAI,CAAC,GAAGoB,CAAC,GAAGA,CAAC,CAACG,YAAY,CAACd,SAAS,CAACW,CAAC,CAAC;;AAE9C;AACA;AACA;AACA;AACA;AACO,MAAMI,oBAAoB,GAAG,UAClCJ,CAAQ,EAAA;AAAA,EAAA,IACRK,gBAAgB,GAAAC,SAAA,CAAAC,MAAA,GAAA,CAAA,IAAAD,SAAA,CAAA,CAAA,CAAA,KAAAE,SAAA,GAAAF,SAAA,CAAA,CAAA,CAAA,GAAG,IAAI;EAAA,OAEvBL,aAAa,CAAC,IAAItB,KAAK,CAAC,CAACqB,CAAC,CAACS,CAAC,EAAET,CAAC,CAACU,CAAC,CAAC,CAACC,cAAc,CAACN,gBAAgB,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;AAAA;;AAE/E;AACA;AACA;AACA;AACA;AACA;AACO,MAAMR,YAAY,GAAGA,CAACJ,CAAQ,EAAEC,CAAQ,KAC7CD,CAAC,CAACiB,CAAC,GAAGhB,CAAC,CAACe,CAAC,GAAGhB,CAAC,CAACgB,CAAC,GAAGf,CAAC,CAACgB;;AAEtB;AACA;AACA;AACA;AACA;AACA;AACO,MAAMZ,UAAU,GAAGA,CAACL,CAAQ,EAAEC,CAAQ,KAAaD,CAAC,CAACiB,CAAC,GAAGhB,CAAC,CAACgB,CAAC,GAAGjB,CAAC,CAACgB,CAAC,GAAGf,CAAC,CAACe;;AAE9E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAMG,gBAAgB,GAAGA,CAACC,CAAQ,EAAEpB,CAAQ,EAAEC,CAAQ,KAAc;AACzE,EAAA,IAAImB,CAAC,CAACX,EAAE,CAACT,CAAC,CAAC,IAAIoB,CAAC,CAACX,EAAE,CAACR,CAAC,CAAC,EAAE,OAAO,IAAI;AACnC,EAAA,MAAMoB,GAAG,GAAGjB,YAAY,CAACJ,CAAC,EAAEC,CAAC,CAAC;AAC5BqB,IAAAA,GAAG,GAAGlB,YAAY,CAACJ,CAAC,EAAEoB,CAAC,CAAC;AACxBG,IAAAA,GAAG,GAAGnB,YAAY,CAACH,CAAC,EAAEmB,CAAC,CAAC;EAC1B,OAAOC,GAAG,IAAI,CAAC,GAAGC,GAAG,IAAI,CAAC,IAAIC,GAAG,IAAI,CAAC,GAAG,EAAED,GAAG,IAAI,CAAC,IAAIC,GAAG,IAAI,CAAC,CAAC;AAClE;;;;"}

package/dist/src/util/path/index.d.ts

@@ -0,0 +1,95 @@
+import type { TMat2D, TRectBounds } from '../../typedefs';
+import type { TComplexPathData, TParsedAbsoluteCubicCurveCommand, TPathSegmentInfo, TPointAngle, TSimplePathData, TParsedArcCommand } from './typedefs';
+import { Point } from '../../Point';
+/**
+ * Calculate bounding box of a cubic Bezier curve
+ * Taken from http://jsbin.com/ivomiq/56/edit (no credits available)
+ * TODO: can we normalize this with the starting points set at 0 and then translated the bbox?
+ * @param {number} begx starting point
+ * @param {number} begy
+ * @param {number} cp1x first control point
+ * @param {number} cp1y
+ * @param {number} cp2x second control point
+ * @param {number} cp2y
+ * @param {number} endx end of bezier
+ * @param {number} endy
+ * @return {TRectBounds} the rectangular bounds
+ */
+export declare function getBoundsOfCurve(begx: number, begy: number, cp1x: number, cp1y: number, cp2x: number, cp2y: number, endx: number, endy: number): TRectBounds;
+/**
+ * Converts arc to a bunch of cubic Bezier curves
+ * @param {number} fx starting point x
+ * @param {number} fy starting point y
+ * @param {TParsedArcCommand} coords Arc command
+ */
+export declare const fromArcToBeziers: (fx: number, fy: number, [_, rx, ry, rot, large, sweep, tx, ty]: TParsedArcCommand) => TParsedAbsoluteCubicCurveCommand[];
+/**
+ * This function takes a parsed SVG path and makes it simpler for fabricJS logic.
+ * Simplification consist of:
+ * - All commands converted to absolute (lowercase to uppercase)
+ * - S converted to C
+ * - T converted to Q
+ * - A converted to C
+ * @param {TComplexPathData} path the array of commands of a parsed SVG path for `Path`
+ * @return {TSimplePathData} the simplified array of commands of a parsed SVG path for `Path`
+ * TODO: figure out how to remove the type assertions in a nice way
+ */
+export declare const makePathSimpler: (path: TComplexPathData) => TSimplePathData;
+/**
+ * Run over a parsed and simplified path and extract some information (length of each command and starting point)
+ * @param {TSimplePathData} path parsed path commands
+ * @return {TPathSegmentInfo[]} path commands information
+ */
+export declare const getPathSegmentsInfo: (path: TSimplePathData) => TPathSegmentInfo[];
+/**
+ * Get the point on the path that is distance along the path
+ * @param path
+ * @param distance
+ * @param infos
+ */
+export declare const getPointOnPath: (path: TSimplePathData, distance: number, infos?: TPathSegmentInfo[]) => TPointAngle | undefined;
+/**
+ *
+ * @param {string} pathString
+ * @return {TComplexPathData} An array of SVG path commands
+ * @example <caption>Usage</caption>
+ * parsePath('M 3 4 Q 3 5 2 1 4 0 Q 9 12 2 1 4 0') === [
+ *   ['M', 3, 4],
+ *   ['Q', 3, 5, 2, 1, 4, 0],
+ *   ['Q', 9, 12, 2, 1, 4, 0],
+ * ];
+ */
+export declare const parsePath: (pathString: string) => TComplexPathData;
+/**
+ *
+ * Converts points to a smooth SVG path
+ * @param {XY[]} points Array of points
+ * @param {number} [correction] Apply a correction to the path (usually we use `width / 1000`). If value is undefined 0 is used as the correction value.
+ * @return {(string|number)[][]} An array of SVG path commands
+ */
+export declare const getSmoothPathFromPoints: (points: Point[], correction?: number) => TSimplePathData;
+/**
+ * Transform a path by transforming each segment.
+ * it has to be a simplified path or it won't work.
+ * WARNING: this depends from pathOffset for correct operation
+ * @param {TSimplePathData} path fabricJS parsed and simplified path commands
+ * @param {TMat2D} transform matrix that represent the transformation
+ * @param {Point} [pathOffset] `Path.pathOffset`
+ * @returns {TSimplePathData} the transformed path
+ */
+export declare const transformPath: (path: TSimplePathData, transform: TMat2D, pathOffset: Point) => TSimplePathData;
+/**
+ * Returns an array of path commands to create a regular polygon
+ * @param {number} numVertexes
+ * @param {number} radius
+ * @returns {TSimplePathData} An array of SVG path commands
+ */
+export declare const getRegularPolygonPath: (numVertexes: number, radius: number) => TSimplePathData;
+/**
+ * Join path commands to go back to svg format
+ * @param {TSimplePathData} pathData fabricJS parsed path commands
+ * @param {number} fractionDigits number of fraction digits to "leave"
+ * @return {String} joined path 'M 0 0 L 20 30'
+ */
+export declare const joinPath: (pathData: TSimplePathData, fractionDigits?: number) => string;
+//# sourceMappingURL=index.d.ts.map

package/dist/src/util/path/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/util/path/index.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,MAAM,EAAW,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAKnE,OAAO,KAAK,EAEV,gBAAgB,EAChB,gCAAgC,EAChC,gBAAgB,EAChB,WAAW,EAEX,eAAe,EAKf,iBAAiB,EAElB,MAAM,YAAY,CAAC;AAEpB,OAAO,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AAsLpC;;;;;;;;;;;;;GAaG;AACH,wBAAgB,gBAAgB,CAC9B,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,MAAM,GACX,WAAW,CAoFb;AAED;;;;;GAKG;AACH,eAAO,MAAM,gBAAgB,GAC3B,IAAI,MAAM,EACV,IAAI,MAAM,EACV,wCAAwC,iBAAiB,KACxD,gCAAgC,EAYlC,CAAC;AAEF;;;;;;;;;;GAUG;AACH,eAAO,MAAM,eAAe,GAAI,MAAM,gBAAgB,KAAG,eA4JxD,CAAC;AA0KF;;;;GAIG;AACH,eAAO,MAAM,mBAAmB,GAC9B,MAAM,eAAe,KACpB,gBAAgB,EAkGlB,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,cAAc,GACzB,MAAM,eAAe,EACrB,UAAU,MAAM,EAChB,QAAO,gBAAgB,EAA8B,KACpD,WAAW,GAAG,SAoChB,CAAC;AAgBF;;;;;;;;;;GAUG;AACH,eAAO,MAAM,SAAS,GAAI,YAAY,MAAM,KAAG,gBA4C9C,CAAC;AAEF;;;;;;GAMG;AACH,eAAO,MAAM,uBAAuB,GAClC,QAAQ,KAAK,EAAE,EACf,mBAAc,KACb,eA0CF,CAAC;AAEF;;;;;;;;GAQG;AACH,eAAO,MAAM,aAAa,GACxB,MAAM,eAAe,EACrB,WAAW,MAAM,EACjB,YAAY,KAAK,KAChB,eA2BF,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,qBAAqB,GAChC,aAAa,MAAM,EACnB,QAAQ,MAAM,KACb,eAgBF,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,QAAQ,GAAI,UAAU,eAAe,EAAE,iBAAiB,MAAM,WAY7D,CAAC"}

package/dist/src/util/path/index.min.mjs

@@ -0,0 +1,2 @@
+import{cache as t}from"../../cache.min.mjs";import{config as e}from"../../config.min.mjs";import{halfPI as n,PiBy180 as s}from"../../constants.min.mjs";import{cos as r}from"../misc/cos.min.mjs";import{multiplyTransformMatrices as a,transformPoint as o}from"../misc/matrix.min.mjs";import{sin as c}from"../misc/sin.min.mjs";import{toFixed as i}from"../misc/toFixed.min.mjs";import{Point as l}from"../../Point.min.mjs";import{rePathCommand as h,reArcCommandPoints as m}from"./regex.min.mjs";import{reNum as u}from"../../parser/constants.min.mjs";const f={m:"l",M:"L"},x=(t,e,n,s,a,o,i,l,h,m,u)=>{const f=r(t),x=c(t),p=r(e),y=c(e),g=n*a*p-s*o*y+i,M=s*a*p+n*o*y+l;return["C",m+h*(-n*a*x-s*o*f),u+h*(-s*a*x+n*o*f),g+h*(n*a*y+s*o*p),M+h*(s*a*y-n*o*p),g,M]},p=(t,e,n,s)=>{const r=Math.atan2(e,t),a=Math.atan2(s,n);return a>=r?a-r:2*Math.PI-(r-a)};function y(n,s,r,a,o,c,i,h){let m;if(e.cachesBoundsOfCurve&&(m=[...arguments].join(),t.boundsOfCurveCache[m]))return t.boundsOfCurveCache[m];const u=Math.sqrt,f=Math.abs,x=[],p=[[0,0],[0,0]];let y=6*n-12*r+6*o,g=-3*n+9*r-9*o+3*i,M=3*r-3*n;for(let t=0;t<2;++t){if(t>0&&(y=6*s-12*a+6*c,g=-3*s+9*a-9*c+3*h,M=3*a-3*s),f(g)<1e-12){if(f(y)<1e-12)continue;const t=-M/y;0<t&&t<1&&x.push(t);continue}const e=y*y-4*M*g;if(e<0)continue;const n=u(e),r=(-y+n)/(2*g);0<r&&r<1&&x.push(r);const o=(-y-n)/(2*g);0<o&&o<1&&x.push(o)}let d=x.length;const b=d,C=w(n,s,r,a,o,c,i,h);for(;d--;){const{x:t,y:e}=C(x[d]);p[0][d]=t,p[1][d]=e}p[0][b]=n,p[1][b]=s,p[0][b+1]=i,p[1][b+1]=h;const j=[new l(Math.min(...p[0]),Math.min(...p[1])),new l(Math.max(...p[0]),Math.max(...p[1]))];return e.cachesBoundsOfCurve&&(t.boundsOfCurveCache[m]=j),j}const g=(t,e,n)=>{let[a,o,i,l,h,m,u,f]=n;const y=((t,e,n,a,o,i,l)=>{if(0===n||0===a)return[];let h=0,m=0,u=0;const f=Math.PI,y=l*s,g=c(y),M=r(y),d=.5*(-M*t-g*e),w=.5*(-M*e+g*t),b=n**2,C=a**2,j=w**2,k=d**2,v=b*C-b*j-C*k;let L=Math.abs(n),q=Math.abs(a);if(v<0){const t=Math.sqrt(1-v/(b*C));L*=t,q*=t}else u=(o===i?-1:1)*Math.sqrt(v/(b*j+C*k));const Q=u*L*w/q,F=-u*q*d/L,Z=M*Q-g*F+.5*t,O=g*Q+M*F+.5*e;let P=p(1,0,(d-Q)/L,(w-F)/q),A=p((d-Q)/L,(w-F)/q,(-d-Q)/L,(-w-F)/q);0===i&&A>0?A-=2*f:1===i&&A<0&&(A+=2*f);const E=Math.ceil(Math.abs(A/f*2)),I=[],R=A/E,X=8/3*Math.sin(R/4)*Math.sin(R/4)/Math.sin(R/2);let Y=P+R;for(let t=0;t<E;t++)I[t]=x(P,Y,M,g,L,q,Z,O,X,h,m),h=I[t][5],m=I[t][6],P=Y,Y+=R;return I})(u-t,f-e,o,i,h,m,l);for(let n=0,s=y.length;n<s;n++)y[n][1]+=t,y[n][2]+=e,y[n][3]+=t,y[n][4]+=e,y[n][5]+=t,y[n][6]+=e;return y},M=t=>{let e=0,n=0,s=0,r=0;const a=[];let o,c=0,i=0;for(const l of t){const t=[...l];let h;switch(t[0]){case"l":t[1]+=e,t[2]+=n;case"L":e=t[1],n=t[2],h=["L",e,n];break;case"h":t[1]+=e;case"H":e=t[1],h=["L",e,n];break;case"v":t[1]+=n;case"V":n=t[1],h=["L",e,n];break;case"m":t[1]+=e,t[2]+=n;case"M":e=t[1],n=t[2],s=t[1],r=t[2],h=["M",e,n];break;case"c":t[1]+=e,t[2]+=n,t[3]+=e,t[4]+=n,t[5]+=e,t[6]+=n;case"C":c=t[3],i=t[4],e=t[5],n=t[6],h=["C",t[1],t[2],c,i,e,n];break;case"s":t[1]+=e,t[2]+=n,t[3]+=e,t[4]+=n;case"S":"C"===o?(c=2*e-c,i=2*n-i):(c=e,i=n),e=t[3],n=t[4],h=["C",c,i,t[1],t[2],e,n],c=h[3],i=h[4];break;case"q":t[1]+=e,t[2]+=n,t[3]+=e,t[4]+=n;case"Q":c=t[1],i=t[2],e=t[3],n=t[4],h=["Q",c,i,e,n];break;case"t":t[1]+=e,t[2]+=n;case"T":"Q"===o?(c=2*e-c,i=2*n-i):(c=e,i=n),e=t[1],n=t[2],h=["Q",c,i,e,n];break;case"a":t[6]+=e,t[7]+=n;case"A":g(e,n,t).forEach(t=>a.push(t)),e=t[6],n=t[7];break;case"z":case"Z":e=s,n=r,h=["Z"]}h?(a.push(h),o=h[0]):o=""}return a},d=(t,e,n,s)=>Math.sqrt((n-t)**2+(s-e)**2),w=(t,e,n,s,r,a,o,c)=>i=>{const h=i**3,m=(t=>3*t**2*(1-t))(i),u=(t=>3*t*(1-t)**2)(i),f=(t=>(1-t)**3)(i);return new l(o*h+r*m+n*u+t*f,c*h+a*m+s*u+e*f)},b=t=>t**2,C=t=>2*t*(1-t),j=t=>(1-t)**2,k=(t,e,n,s,r,a,o,c)=>i=>{const l=b(i),h=C(i),m=j(i),u=3*(m*(n-t)+h*(r-n)+l*(o-r)),f=3*(m*(s-e)+h*(a-s)+l*(c-a));return Math.atan2(f,u)},v=(t,e,n,s,r,a)=>o=>{const c=b(o),i=C(o),h=j(o);return new l(r*c+n*i+t*h,a*c+s*i+e*h)},L=(t,e,n,s,r,a)=>o=>{const c=1-o,i=2*(c*(n-t)+o*(r-n)),l=2*(c*(s-e)+o*(a-s));return Math.atan2(l,i)},q=(t,e,n)=>{let s=new l(e,n),r=0;for(let e=1;e<=100;e+=1){const n=t(e/100);r+=d(s.x,s.y,n.x,n.y),s=n}return r},Q=(t,e)=>{let n,s=0,r=0,a={x:t.x,y:t.y},o={...a},c=.01,i=0;const l=t.iterator,h=t.angleFinder;for(;r<e&&c>1e-4;)o=l(s),i=s,n=d(a.x,a.y,o.x,o.y),n+r>e?(s-=c,c/=2):(a=o,s+=c,r+=n);return{...o,angle:h(i)}},F=t=>{let e,n,s=0,r=0,a=0,o=0,c=0;const i=[];for(const l of t){const t={x:r,y:a,command:l[0],length:0};switch(l[0]){case"M":n=t,n.x=o=r=l[1],n.y=c=a=l[2];break;case"L":n=t,n.length=d(r,a,l[1],l[2]),r=l[1],a=l[2];break;case"C":e=w(r,a,l[1],l[2],l[3],l[4],l[5],l[6]),n=t,n.iterator=e,n.angleFinder=k(r,a,l[1],l[2],l[3],l[4],l[5],l[6]),n.length=q(e,r,a),r=l[5],a=l[6];break;case"Q":e=v(r,a,l[1],l[2],l[3],l[4]),n=t,n.iterator=e,n.angleFinder=L(r,a,l[1],l[2],l[3],l[4]),n.length=q(e,r,a),r=l[3],a=l[4];break;case"Z":n=t,n.destX=o,n.destY=c,n.length=d(r,a,o,c),r=o,a=c}s+=n.length,i.push(n)}return i.push({length:s,x:r,y:a}),i},Z=function(t,e){let n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:F(t),s=0;for(;e-n[s].length>0&&s<n.length-2;)e-=n[s].length,s++;const r=n[s],a=e/r.length,o=t[s];switch(r.command){case"M":return{x:r.x,y:r.y,angle:0};case"Z":return{...new l(r.x,r.y).lerp(new l(r.destX,r.destY),a),angle:Math.atan2(r.destY-r.y,r.destX-r.x)};case"L":return{...new l(r.x,r.y).lerp(new l(o[1],o[2]),a),angle:Math.atan2(o[2]-r.y,o[1]-r.x)};case"C":case"Q":return Q(r,e)}},O=new RegExp(h,"gi"),P=new RegExp(m,"g"),A=new RegExp(u,"gi"),E={m:2,l:2,h:1,v:1,c:6,s:4,q:4,t:2,a:7},I=t=>{var e;const n=[],s=null!==(e=t.match(O))&&void 0!==e?e:[];for(const t of s){const e=t[0];if("z"===e||"Z"===e){n.push([e]);continue}const s=E[e.toLowerCase()];let r=[];if("a"===e||"A"===e){P.lastIndex=0;for(let e=null;e=P.exec(t);)r.push(...e.slice(1))}else r=t.match(A)||[];for(let t=0;t<r.length;t+=s){const a=new Array(s),o=f[e];a[0]=t>0&&o?o:e;for(let e=0;e<s;e++)a[e+1]=parseFloat(r[t+e]);n.push(a)}}return n},R=function(t){let e=arguments.length>1&&void 0!==arguments[1]?arguments[1]:0,n=new l(t[0]),s=new l(t[1]),r=1,a=0;const o=[],c=t.length,i=c>2;let h;for(i&&(r=t[2].x<s.x?-1:t[2].x===s.x?0:1,a=t[2].y<s.y?-1:t[2].y===s.y?0:1),o.push(["M",n.x-r*e,n.y-a*e]),h=1;h<c;h++){if(!n.eq(s)){const t=n.midPointFrom(s);o.push(["Q",n.x,n.y,t.x,t.y])}n=t[h],h+1<t.length&&(s=t[h+1])}return i&&(r=n.x>t[h-2].x?1:n.x===t[h-2].x?0:-1,a=n.y>t[h-2].y?1:n.y===t[h-2].y?0:-1),o.push(["L",n.x+r*e,n.y+a*e]),o},X=(t,e,n)=>(n&&(e=a(e,[1,0,0,1,-n.x,-n.y])),t.map(t=>{const n=[...t];for(let s=1;s<t.length-1;s+=2){const{x:r,y:a}=o({x:t[s],y:t[s+1]},e);n[s]=r,n[s+1]=a}return n})),Y=(t,e)=>{const s=2*Math.PI/t;let a=-n;t%2==0&&(a+=s/2);const o=new Array(t+1);for(let n=0;n<t;n++){const t=n*s+a,{x:i,y:h}=new l(r(t),c(t)).scalarMultiply(e);o[n]=[0===n?"M":"L",i,h]}return o[t]=["Z"],o},z=(t,e)=>t.map(t=>t.map((t,n)=>0===n||void 0===e?t:i(t,e)).join(" ")).join(" ");export{g as fromArcToBeziers,y as getBoundsOfCurve,F as getPathSegmentsInfo,Z as getPointOnPath,Y as getRegularPolygonPath,R as getSmoothPathFromPoints,z as joinPath,M as makePathSimpler,I as parsePath,X as transformPath};
+//# sourceMappingURL=index.min.mjs.map

package/dist/src/util/path/index.min.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.min.mjs","sources":["../../../../src/util/path/index.ts"],"sourcesContent":["import { cache } from '../../cache';\nimport { config } from '../../config';\nimport { halfPI, PiBy180 } from '../../constants';\nimport type { TMat2D, TRadian, TRectBounds } from '../../typedefs';\nimport { cos } from '../misc/cos';\nimport { multiplyTransformMatrices, transformPoint } from '../misc/matrix';\nimport { sin } from '../misc/sin';\nimport { toFixed } from '../misc/toFixed';\nimport type {\n  TCurveInfo,\n  TComplexPathData,\n  TParsedAbsoluteCubicCurveCommand,\n  TPathSegmentInfo,\n  TPointAngle,\n  TSimpleParsedCommand,\n  TSimplePathData,\n  TPathSegmentCommandInfo,\n  TComplexParsedCommand,\n  TPathSegmentInfoCommon,\n  TEndPathInfo,\n  TParsedArcCommand,\n  TComplexParsedCommandType,\n} from './typedefs';\nimport type { XY } from '../../Point';\nimport { Point } from '../../Point';\nimport { reArcCommandPoints, rePathCommand } from './regex';\nimport { reNum } from '../../parser/constants';\n\n/**\n * Commands that may be repeated\n */\nconst repeatedCommands: Record<string, 'l' | 'L'> = {\n  m: 'l',\n  M: 'L',\n};\n\n/**\n * Convert an arc of a rotated ellipse to a Bezier Curve\n * @param {TRadian} theta1 start of the arc\n * @param {TRadian} theta2 end of the arc\n * @param cosTh cosine of the angle of rotation\n * @param sinTh sine of the angle of rotation\n * @param rx x-axis radius (before rotation)\n * @param ry y-axis radius (before rotation)\n * @param cx1 center x of the ellipse\n * @param cy1 center y of the ellipse\n * @param mT\n * @param fromX starting point of arc x\n * @param fromY starting point of arc y\n */\nconst segmentToBezier = (\n  theta1: TRadian,\n  theta2: TRadian,\n  cosTh: number,\n  sinTh: number,\n  rx: number,\n  ry: number,\n  cx1: number,\n  cy1: number,\n  mT: number,\n  fromX: number,\n  fromY: number,\n): TParsedAbsoluteCubicCurveCommand => {\n  const costh1 = cos(theta1),\n    sinth1 = sin(theta1),\n    costh2 = cos(theta2),\n    sinth2 = sin(theta2),\n    toX = cosTh * rx * costh2 - sinTh * ry * sinth2 + cx1,\n    toY = sinTh * rx * costh2 + cosTh * ry * sinth2 + cy1,\n    cp1X = fromX + mT * (-cosTh * rx * sinth1 - sinTh * ry * costh1),\n    cp1Y = fromY + mT * (-sinTh * rx * sinth1 + cosTh * ry * costh1),\n    cp2X = toX + mT * (cosTh * rx * sinth2 + sinTh * ry * costh2),\n    cp2Y = toY + mT * (sinTh * rx * sinth2 - cosTh * ry * costh2);\n\n  return ['C', cp1X, cp1Y, cp2X, cp2Y, toX, toY];\n};\n\n/**\n * Adapted from {@link http://dxr.mozilla.org/mozilla-central/source/dom/svg/SVGPathDataParser.cpp}\n * by Andrea Bogazzi code is under MPL. if you don't have a copy of the license you can take it here\n * http://mozilla.org/MPL/2.0/\n * @param toX\n * @param toY\n * @param rx\n * @param ry\n * @param {number} large 0 or 1 flag\n * @param {number} sweep 0 or 1 flag\n * @param rotateX\n */\nconst arcToSegments = (\n  toX: number,\n  toY: number,\n  rx: number,\n  ry: number,\n  large: number,\n  sweep: number,\n  rotateX: TRadian,\n): TParsedAbsoluteCubicCurveCommand[] => {\n  if (rx === 0 || ry === 0) {\n    return [];\n  }\n  let fromX = 0,\n    fromY = 0,\n    root = 0;\n  const PI = Math.PI,\n    theta = rotateX * PiBy180,\n    sinTheta = sin(theta),\n    cosTh = cos(theta),\n    px = 0.5 * (-cosTh * toX - sinTheta * toY),\n    py = 0.5 * (-cosTh * toY + sinTheta * toX),\n    rx2 = rx ** 2,\n    ry2 = ry ** 2,\n    py2 = py ** 2,\n    px2 = px ** 2,\n    pl = rx2 * ry2 - rx2 * py2 - ry2 * px2;\n  let _rx = Math.abs(rx);\n  let _ry = Math.abs(ry);\n\n  if (pl < 0) {\n    const s = Math.sqrt(1 - pl / (rx2 * ry2));\n    _rx *= s;\n    _ry *= s;\n  } else {\n    root =\n      (large === sweep ? -1.0 : 1.0) * Math.sqrt(pl / (rx2 * py2 + ry2 * px2));\n  }\n\n  const cx = (root * _rx * py) / _ry,\n    cy = (-root * _ry * px) / _rx,\n    cx1 = cosTh * cx - sinTheta * cy + toX * 0.5,\n    cy1 = sinTheta * cx + cosTh * cy + toY * 0.5;\n  let mTheta = calcVectorAngle(1, 0, (px - cx) / _rx, (py - cy) / _ry);\n  let dtheta = calcVectorAngle(\n    (px - cx) / _rx,\n    (py - cy) / _ry,\n    (-px - cx) / _rx,\n    (-py - cy) / _ry,\n  );\n\n  if (sweep === 0 && dtheta > 0) {\n    dtheta -= 2 * PI;\n  } else if (sweep === 1 && dtheta < 0) {\n    dtheta += 2 * PI;\n  }\n\n  // Convert into cubic bezier segments <= 90deg\n  const segments = Math.ceil(Math.abs((dtheta / PI) * 2)),\n    result = [],\n    mDelta = dtheta / segments,\n    mT =\n      ((8 / 3) * Math.sin(mDelta / 4) * Math.sin(mDelta / 4)) /\n      Math.sin(mDelta / 2);\n  let th3 = mTheta + mDelta;\n\n  for (let i = 0; i < segments; i++) {\n    result[i] = segmentToBezier(\n      mTheta,\n      th3,\n      cosTh,\n      sinTheta,\n      _rx,\n      _ry,\n      cx1,\n      cy1,\n      mT,\n      fromX,\n      fromY,\n    );\n    fromX = result[i][5];\n    fromY = result[i][6];\n    mTheta = th3;\n    th3 += mDelta;\n  }\n  return result;\n};\n\n/**\n * @private\n * Calculate the angle between two vectors\n * @param ux u endpoint x\n * @param uy u endpoint y\n * @param vx v endpoint x\n * @param vy v endpoint y\n */\nconst calcVectorAngle = (\n  ux: number,\n  uy: number,\n  vx: number,\n  vy: number,\n): TRadian => {\n  const ta = Math.atan2(uy, ux),\n    tb = Math.atan2(vy, vx);\n  if (tb >= ta) {\n    return tb - ta;\n  } else {\n    return 2 * Math.PI - (ta - tb);\n  }\n};\n\n// functions for the Cubic beizer\n// taken from: https://github.com/konvajs/konva/blob/7.0.5/src/shapes/Path.ts#L350\nconst CB1 = (t: number) => t ** 3;\nconst CB2 = (t: number) => 3 * t ** 2 * (1 - t);\nconst CB3 = (t: number) => 3 * t * (1 - t) ** 2;\nconst CB4 = (t: number) => (1 - t) ** 3;\n\n/**\n * Calculate bounding box of a cubic Bezier curve\n * Taken from http://jsbin.com/ivomiq/56/edit (no credits available)\n * TODO: can we normalize this with the starting points set at 0 and then translated the bbox?\n * @param {number} begx starting point\n * @param {number} begy\n * @param {number} cp1x first control point\n * @param {number} cp1y\n * @param {number} cp2x second control point\n * @param {number} cp2y\n * @param {number} endx end of bezier\n * @param {number} endy\n * @return {TRectBounds} the rectangular bounds\n */\nexport function getBoundsOfCurve(\n  begx: number,\n  begy: number,\n  cp1x: number,\n  cp1y: number,\n  cp2x: number,\n  cp2y: number,\n  endx: number,\n  endy: number,\n): TRectBounds {\n  let argsString: string;\n  if (config.cachesBoundsOfCurve) {\n    // eslint-disable-next-line\n    argsString = [...arguments].join();\n    if (cache.boundsOfCurveCache[argsString]) {\n      return cache.boundsOfCurveCache[argsString];\n    }\n  }\n\n  const sqrt = Math.sqrt,\n    abs = Math.abs,\n    tvalues = [],\n    bounds: [[x: number, y: number], [x: number, y: number]] = [\n      [0, 0],\n      [0, 0],\n    ];\n\n  let b = 6 * begx - 12 * cp1x + 6 * cp2x;\n  let a = -3 * begx + 9 * cp1x - 9 * cp2x + 3 * endx;\n  let c = 3 * cp1x - 3 * begx;\n\n  for (let i = 0; i < 2; ++i) {\n    if (i > 0) {\n      b = 6 * begy - 12 * cp1y + 6 * cp2y;\n      a = -3 * begy + 9 * cp1y - 9 * cp2y + 3 * endy;\n      c = 3 * cp1y - 3 * begy;\n    }\n\n    if (abs(a) < 1e-12) {\n      if (abs(b) < 1e-12) {\n        continue;\n      }\n      const t = -c / b;\n      if (0 < t && t < 1) {\n        tvalues.push(t);\n      }\n      continue;\n    }\n    const b2ac = b * b - 4 * c * a;\n    if (b2ac < 0) {\n      continue;\n    }\n    const sqrtb2ac = sqrt(b2ac);\n    const t1 = (-b + sqrtb2ac) / (2 * a);\n    if (0 < t1 && t1 < 1) {\n      tvalues.push(t1);\n    }\n    const t2 = (-b - sqrtb2ac) / (2 * a);\n    if (0 < t2 && t2 < 1) {\n      tvalues.push(t2);\n    }\n  }\n\n  let j = tvalues.length;\n  const jlen = j;\n  const iterator = getPointOnCubicBezierIterator(\n    begx,\n    begy,\n    cp1x,\n    cp1y,\n    cp2x,\n    cp2y,\n    endx,\n    endy,\n  );\n  while (j--) {\n    const { x, y } = iterator(tvalues[j]);\n    bounds[0][j] = x;\n    bounds[1][j] = y;\n  }\n\n  bounds[0][jlen] = begx;\n  bounds[1][jlen] = begy;\n  bounds[0][jlen + 1] = endx;\n  bounds[1][jlen + 1] = endy;\n  const result: TRectBounds = [\n    new Point(Math.min(...bounds[0]), Math.min(...bounds[1])),\n    new Point(Math.max(...bounds[0]), Math.max(...bounds[1])),\n  ];\n  if (config.cachesBoundsOfCurve) {\n    cache.boundsOfCurveCache[argsString!] = result;\n  }\n  return result;\n}\n\n/**\n * Converts arc to a bunch of cubic Bezier curves\n * @param {number} fx starting point x\n * @param {number} fy starting point y\n * @param {TParsedArcCommand} coords Arc command\n */\nexport const fromArcToBeziers = (\n  fx: number,\n  fy: number,\n  [_, rx, ry, rot, large, sweep, tx, ty]: TParsedArcCommand,\n): TParsedAbsoluteCubicCurveCommand[] => {\n  const segsNorm = arcToSegments(tx - fx, ty - fy, rx, ry, large, sweep, rot);\n\n  for (let i = 0, len = segsNorm.length; i < len; i++) {\n    segsNorm[i][1] += fx;\n    segsNorm[i][2] += fy;\n    segsNorm[i][3] += fx;\n    segsNorm[i][4] += fy;\n    segsNorm[i][5] += fx;\n    segsNorm[i][6] += fy;\n  }\n  return segsNorm;\n};\n\n/**\n * This function takes a parsed SVG path and makes it simpler for fabricJS logic.\n * Simplification consist of:\n * - All commands converted to absolute (lowercase to uppercase)\n * - S converted to C\n * - T converted to Q\n * - A converted to C\n * @param {TComplexPathData} path the array of commands of a parsed SVG path for `Path`\n * @return {TSimplePathData} the simplified array of commands of a parsed SVG path for `Path`\n * TODO: figure out how to remove the type assertions in a nice way\n */\nexport const makePathSimpler = (path: TComplexPathData): TSimplePathData => {\n  // x and y represent the last point of the path, AKA the previous command point.\n  // we add them to each relative command to make it an absolute comment.\n  // we also swap the v V h H with L, because are easier to transform.\n  let x = 0,\n    y = 0;\n  // x1 and y1 represent the last point of the subpath. the subpath is started with\n  // m or M command. When a z or Z command is drawn, x and y need to be resetted to\n  // the last x1 and y1.\n  let x1 = 0,\n    y1 = 0;\n  // previous will host the letter of the previous command, to handle S and T.\n  // controlX and controlY will host the previous reflected control point\n  const destinationPath: TSimplePathData = [];\n  let previous,\n    // placeholders\n    controlX = 0,\n    controlY = 0;\n  for (const parsedCommand of path) {\n    const current: TComplexParsedCommand = [...parsedCommand];\n    let converted: TSimpleParsedCommand | undefined;\n    switch (\n      current[0] // first letter\n    ) {\n      case 'l': // lineto, relative\n        current[1] += x;\n        current[2] += y;\n      // falls through\n      case 'L':\n        x = current[1];\n        y = current[2];\n        converted = ['L', x, y];\n        break;\n      case 'h': // horizontal lineto, relative\n        current[1] += x;\n      // falls through\n      case 'H':\n        x = current[1];\n        converted = ['L', x, y];\n        break;\n      case 'v': // vertical lineto, relative\n        current[1] += y;\n      // falls through\n      case 'V':\n        y = current[1];\n        converted = ['L', x, y];\n        break;\n      case 'm': // moveTo, relative\n        current[1] += x;\n        current[2] += y;\n      // falls through\n      case 'M':\n        x = current[1];\n        y = current[2];\n        x1 = current[1];\n        y1 = current[2];\n        converted = ['M', x, y];\n        break;\n      case 'c': // bezierCurveTo, relative\n        current[1] += x;\n        current[2] += y;\n        current[3] += x;\n        current[4] += y;\n        current[5] += x;\n        current[6] += y;\n      // falls through\n      case 'C':\n        controlX = current[3];\n        controlY = current[4];\n        x = current[5];\n        y = current[6];\n        converted = ['C', current[1], current[2], controlX, controlY, x, y];\n        break;\n      case 's': // shorthand cubic bezierCurveTo, relative\n        current[1] += x;\n        current[2] += y;\n        current[3] += x;\n        current[4] += y;\n      // falls through\n      case 'S':\n        // would be sScC but since we are swapping sSc for C, we check just that.\n        if (previous === 'C') {\n          // calculate reflection of previous control points\n          controlX = 2 * x - controlX;\n          controlY = 2 * y - controlY;\n        } else {\n          // If there is no previous command or if the previous command was not a C, c, S, or s,\n          // the control point is coincident with the current point\n          controlX = x;\n          controlY = y;\n        }\n        x = current[3];\n        y = current[4];\n        converted = ['C', controlX, controlY, current[1], current[2], x, y];\n        // converted[3] and converted[4] are NOW the second control point.\n        // we keep it for the next reflection.\n        controlX = converted[3];\n        controlY = converted[4];\n        break;\n      case 'q': // quadraticCurveTo, relative\n        current[1] += x;\n        current[2] += y;\n        current[3] += x;\n        current[4] += y;\n      // falls through\n      case 'Q':\n        controlX = current[1];\n        controlY = current[2];\n        x = current[3];\n        y = current[4];\n        converted = ['Q', controlX, controlY, x, y];\n        break;\n      case 't': // shorthand quadraticCurveTo, relative\n        current[1] += x;\n        current[2] += y;\n      // falls through\n      case 'T':\n        if (previous === 'Q') {\n          // calculate reflection of previous control point\n          controlX = 2 * x - controlX;\n          controlY = 2 * y - controlY;\n        } else {\n          // If there is no previous command or if the previous command was not a Q, q, T or t,\n          // assume the control point is coincident with the current point\n          controlX = x;\n          controlY = y;\n        }\n        x = current[1];\n        y = current[2];\n        converted = ['Q', controlX, controlY, x, y];\n        break;\n      case 'a':\n        current[6] += x;\n        current[7] += y;\n      // falls through\n      case 'A':\n        fromArcToBeziers(x, y, current).forEach((b) => destinationPath.push(b));\n        x = current[6];\n        y = current[7];\n        break;\n      case 'z':\n      case 'Z':\n        x = x1;\n        y = y1;\n        converted = ['Z'];\n        break;\n      default:\n    }\n    if (converted) {\n      destinationPath.push(converted);\n      previous = converted[0];\n    } else {\n      previous = '';\n    }\n  }\n  return destinationPath;\n};\n\n// todo verify if we can just use the point class here\n/**\n * Calc length from point x1,y1 to x2,y2\n * @param {number} x1 starting point x\n * @param {number} y1 starting point y\n * @param {number} x2 starting point x\n * @param {number} y2 starting point y\n * @return {number} length of segment\n */\nconst calcLineLength = (\n  x1: number,\n  y1: number,\n  x2: number,\n  y2: number,\n): number => Math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2);\n\n/**\n * Get an iterator that takes a percentage and returns a point\n * @param {number} begx\n * @param {number} begy\n * @param {number} cp1x\n * @param {number} cp1y\n * @param {number} cp2x\n * @param {number} cp2y\n * @param {number} endx\n * @param {number} endy\n */\nconst getPointOnCubicBezierIterator =\n  (\n    begx: number,\n    begy: number,\n    cp1x: number,\n    cp1y: number,\n    cp2x: number,\n    cp2y: number,\n    endx: number,\n    endy: number,\n  ) =>\n  (pct: number) => {\n    const c1 = CB1(pct),\n      c2 = CB2(pct),\n      c3 = CB3(pct),\n      c4 = CB4(pct);\n    return new Point(\n      endx * c1 + cp2x * c2 + cp1x * c3 + begx * c4,\n      endy * c1 + cp2y * c2 + cp1y * c3 + begy * c4,\n    );\n  };\n\nconst QB1 = (t: number) => t ** 2;\nconst QB2 = (t: number) => 2 * t * (1 - t);\nconst QB3 = (t: number) => (1 - t) ** 2;\n\nconst getTangentCubicIterator =\n  (\n    p1x: number,\n    p1y: number,\n    p2x: number,\n    p2y: number,\n    p3x: number,\n    p3y: number,\n    p4x: number,\n    p4y: number,\n  ) =>\n  (pct: number) => {\n    const qb1 = QB1(pct),\n      qb2 = QB2(pct),\n      qb3 = QB3(pct),\n      tangentX =\n        3 * (qb3 * (p2x - p1x) + qb2 * (p3x - p2x) + qb1 * (p4x - p3x)),\n      tangentY =\n        3 * (qb3 * (p2y - p1y) + qb2 * (p3y - p2y) + qb1 * (p4y - p3y));\n    return Math.atan2(tangentY, tangentX);\n  };\n\nconst getPointOnQuadraticBezierIterator =\n  (\n    p1x: number,\n    p1y: number,\n    p2x: number,\n    p2y: number,\n    p3x: number,\n    p3y: number,\n  ) =>\n  (pct: number) => {\n    const c1 = QB1(pct),\n      c2 = QB2(pct),\n      c3 = QB3(pct);\n    return new Point(\n      p3x * c1 + p2x * c2 + p1x * c3,\n      p3y * c1 + p2y * c2 + p1y * c3,\n    );\n  };\n\nconst getTangentQuadraticIterator =\n  (\n    p1x: number,\n    p1y: number,\n    p2x: number,\n    p2y: number,\n    p3x: number,\n    p3y: number,\n  ) =>\n  (pct: number) => {\n    const invT = 1 - pct,\n      tangentX = 2 * (invT * (p2x - p1x) + pct * (p3x - p2x)),\n      tangentY = 2 * (invT * (p2y - p1y) + pct * (p3y - p2y));\n    return Math.atan2(tangentY, tangentX);\n  };\n\n// this will run over a path segment (a cubic or quadratic segment) and approximate it\n// with 100 segments. This will good enough to calculate the length of the curve\nconst pathIterator = (\n  iterator: (pct: number) => Point,\n  x1: number,\n  y1: number,\n) => {\n  let tempP = new Point(x1, y1),\n    tmpLen = 0;\n  for (let perc = 1; perc <= 100; perc += 1) {\n    const p = iterator(perc / 100);\n    tmpLen += calcLineLength(tempP.x, tempP.y, p.x, p.y);\n    tempP = p;\n  }\n  return tmpLen;\n};\n\n/**\n * Given a pathInfo, and a distance in pixels, find the percentage from 0 to 1\n * that correspond to that pixels run over the path.\n * The percentage will be then used to find the correct point on the canvas for the path.\n * @param {Array} segInfo fabricJS collection of information on a parsed path\n * @param {number} distance from starting point, in pixels.\n * @return {TPointAngle} info object with x and y ( the point on canvas ) and angle, the tangent on that point;\n */\nconst findPercentageForDistance = (\n  segInfo: TCurveInfo<'Q' | 'C'>,\n  distance: number,\n): TPointAngle => {\n  let perc = 0,\n    tmpLen = 0,\n    tempP: XY = { x: segInfo.x, y: segInfo.y },\n    p: XY = { ...tempP },\n    nextLen: number,\n    nextStep = 0.01,\n    lastPerc = 0;\n  // nextStep > 0.0001 covers 0.00015625 that 1/64th of 1/100\n  // the path\n  const iterator = segInfo.iterator,\n    angleFinder = segInfo.angleFinder;\n  while (tmpLen < distance && nextStep > 0.0001) {\n    p = iterator(perc);\n    lastPerc = perc;\n    nextLen = calcLineLength(tempP.x, tempP.y, p.x, p.y);\n    // compare tmpLen each cycle with distance, decide next perc to test.\n    if (nextLen + tmpLen > distance) {\n      // we discard this step and we make smaller steps.\n      perc -= nextStep;\n      nextStep /= 2;\n    } else {\n      tempP = p;\n      perc += nextStep;\n      tmpLen += nextLen;\n    }\n  }\n  return { ...p, angle: angleFinder(lastPerc) };\n};\n\n/**\n * Run over a parsed and simplified path and extract some information (length of each command and starting point)\n * @param {TSimplePathData} path parsed path commands\n * @return {TPathSegmentInfo[]} path commands information\n */\nexport const getPathSegmentsInfo = (\n  path: TSimplePathData,\n): TPathSegmentInfo[] => {\n  let totalLength = 0,\n    //x2 and y2 are the coords of segment start\n    //x1 and y1 are the coords of the current point\n    x1 = 0,\n    y1 = 0,\n    x2 = 0,\n    y2 = 0,\n    iterator,\n    tempInfo: TPathSegmentInfo;\n  const info: TPathSegmentInfo[] = [];\n  for (const current of path) {\n    const basicInfo: TPathSegmentInfoCommon<keyof TPathSegmentCommandInfo> = {\n      x: x1,\n      y: y1,\n      command: current[0],\n      length: 0,\n    };\n    switch (\n      current[0] //first letter\n    ) {\n      case 'M':\n        tempInfo = <TPathSegmentInfoCommon<'M'>>basicInfo;\n        tempInfo.x = x2 = x1 = current[1];\n        tempInfo.y = y2 = y1 = current[2];\n        break;\n      case 'L':\n        tempInfo = <TPathSegmentInfoCommon<'L'>>basicInfo;\n        tempInfo.length = calcLineLength(x1, y1, current[1], current[2]);\n        x1 = current[1];\n        y1 = current[2];\n        break;\n      case 'C':\n        iterator = getPointOnCubicBezierIterator(\n          x1,\n          y1,\n          current[1],\n          current[2],\n          current[3],\n          current[4],\n          current[5],\n          current[6],\n        );\n        tempInfo = <TCurveInfo<'C'>>basicInfo;\n        tempInfo.iterator = iterator;\n        tempInfo.angleFinder = getTangentCubicIterator(\n          x1,\n          y1,\n          current[1],\n          current[2],\n          current[3],\n          current[4],\n          current[5],\n          current[6],\n        );\n        tempInfo.length = pathIterator(iterator, x1, y1);\n\n        x1 = current[5];\n        y1 = current[6];\n        break;\n      case 'Q':\n        iterator = getPointOnQuadraticBezierIterator(\n          x1,\n          y1,\n          current[1],\n          current[2],\n          current[3],\n          current[4],\n        );\n        tempInfo = <TCurveInfo<'Q'>>basicInfo;\n        tempInfo.iterator = iterator;\n        tempInfo.angleFinder = getTangentQuadraticIterator(\n          x1,\n          y1,\n          current[1],\n          current[2],\n          current[3],\n          current[4],\n        );\n        tempInfo.length = pathIterator(iterator, x1, y1);\n        x1 = current[3];\n        y1 = current[4];\n        break;\n      case 'Z':\n        // we add those in order to ease calculations later\n        tempInfo = <TEndPathInfo>basicInfo;\n        tempInfo.destX = x2;\n        tempInfo.destY = y2;\n        tempInfo.length = calcLineLength(x1, y1, x2, y2);\n        x1 = x2;\n        y1 = y2;\n        break;\n    }\n    totalLength += tempInfo.length;\n    info.push(tempInfo);\n  }\n  info.push({ length: totalLength, x: x1, y: y1 });\n  return info;\n};\n\n/**\n * Get the point on the path that is distance along the path\n * @param path\n * @param distance\n * @param infos\n */\nexport const getPointOnPath = (\n  path: TSimplePathData,\n  distance: number,\n  infos: TPathSegmentInfo[] = getPathSegmentsInfo(path),\n): TPointAngle | undefined => {\n  let i = 0;\n  while (distance - infos[i].length > 0 && i < infos.length - 2) {\n    distance -= infos[i].length;\n    i++;\n  }\n  const segInfo = infos[i],\n    segPercent = distance / segInfo.length,\n    segment = path[i];\n\n  switch (segInfo.command) {\n    case 'M':\n      return { x: segInfo.x, y: segInfo.y, angle: 0 };\n    case 'Z':\n      return {\n        ...new Point(segInfo.x, segInfo.y).lerp(\n          new Point(segInfo.destX, segInfo.destY),\n          segPercent,\n        ),\n        angle: Math.atan2(segInfo.destY - segInfo.y, segInfo.destX - segInfo.x),\n      };\n    case 'L':\n      return {\n        ...new Point(segInfo.x, segInfo.y).lerp(\n          new Point(segment[1]!, segment[2]!),\n          segPercent,\n        ),\n        angle: Math.atan2(segment[2]! - segInfo.y, segment[1]! - segInfo.x),\n      };\n    case 'C':\n      return findPercentageForDistance(segInfo, distance);\n    case 'Q':\n      return findPercentageForDistance(segInfo, distance);\n    default:\n    // throw Error('Invalid command');\n  }\n};\n\nconst rePathCmdAll = new RegExp(rePathCommand, 'gi');\nconst regExpArcCommandPoints = new RegExp(reArcCommandPoints, 'g');\nconst reMyNum = new RegExp(reNum, 'gi');\nconst commandLengths = {\n  m: 2,\n  l: 2,\n  h: 1,\n  v: 1,\n  c: 6,\n  s: 4,\n  q: 4,\n  t: 2,\n  a: 7,\n} as const;\n/**\n *\n * @param {string} pathString\n * @return {TComplexPathData} An array of SVG path commands\n * @example <caption>Usage</caption>\n * parsePath('M 3 4 Q 3 5 2 1 4 0 Q 9 12 2 1 4 0') === [\n *   ['M', 3, 4],\n *   ['Q', 3, 5, 2, 1, 4, 0],\n *   ['Q', 9, 12, 2, 1, 4, 0],\n * ];\n */\nexport const parsePath = (pathString: string): TComplexPathData => {\n  const chain: TComplexPathData = [];\n  const all = pathString.match(rePathCmdAll) ?? [];\n  for (const matchStr of all) {\n    // take match string and save the first letter as the command\n    const commandLetter = matchStr[0] as TComplexParsedCommandType;\n    // in case of Z we have very little to do\n    if (commandLetter === 'z' || commandLetter === 'Z') {\n      chain.push([commandLetter]);\n      continue;\n    }\n    const commandLength =\n      commandLengths[\n        commandLetter.toLowerCase() as keyof typeof commandLengths\n      ];\n\n    let paramArr = [];\n    if (commandLetter === 'a' || commandLetter === 'A') {\n      // the arc command ha some peculariaties that requires a special regex other than numbers\n      // it is possible to avoid using a space between the sweep and large arc flags, making them either\n      // 00, 01, 10 or 11, making them identical to a plain number for the regex reMyNum\n      // reset the regexp\n      regExpArcCommandPoints.lastIndex = 0;\n      for (let out = null; (out = regExpArcCommandPoints.exec(matchStr)); ) {\n        paramArr.push(...out.slice(1));\n      }\n    } else {\n      paramArr = matchStr.match(reMyNum) || [];\n    }\n\n    // inspect the length of paramArr, if is longer than commandLength\n    // we are dealing with repeated commands\n    for (let i = 0; i < paramArr.length; i += commandLength) {\n      const newCommand = new Array(commandLength) as TComplexParsedCommand;\n      const transformedCommand = repeatedCommands[commandLetter];\n      newCommand[0] =\n        i > 0 && transformedCommand ? transformedCommand : commandLetter;\n      for (let j = 0; j < commandLength; j++) {\n        newCommand[j + 1] = parseFloat(paramArr[i + j]);\n      }\n      chain.push(newCommand);\n    }\n  }\n  return chain;\n};\n\n/**\n *\n * Converts points to a smooth SVG path\n * @param {XY[]} points Array of points\n * @param {number} [correction] Apply a correction to the path (usually we use `width / 1000`). If value is undefined 0 is used as the correction value.\n * @return {(string|number)[][]} An array of SVG path commands\n */\nexport const getSmoothPathFromPoints = (\n  points: Point[],\n  correction = 0,\n): TSimplePathData => {\n  let p1 = new Point(points[0]),\n    p2 = new Point(points[1]),\n    multSignX = 1,\n    multSignY = 0;\n  const path: TSimplePathData = [],\n    len = points.length,\n    manyPoints = len > 2;\n\n  if (manyPoints) {\n    multSignX = points[2].x < p2.x ? -1 : points[2].x === p2.x ? 0 : 1;\n    multSignY = points[2].y < p2.y ? -1 : points[2].y === p2.y ? 0 : 1;\n  }\n  path.push([\n    'M',\n    p1.x - multSignX * correction,\n    p1.y - multSignY * correction,\n  ]);\n  let i;\n  for (i = 1; i < len; i++) {\n    if (!p1.eq(p2)) {\n      const midPoint = p1.midPointFrom(p2);\n      // p1 is our bezier control point\n      // midpoint is our endpoint\n      // start point is p(i-1) value.\n      path.push(['Q', p1.x, p1.y, midPoint.x, midPoint.y]);\n    }\n    p1 = points[i];\n    if (i + 1 < points.length) {\n      p2 = points[i + 1];\n    }\n  }\n  if (manyPoints) {\n    multSignX = p1.x > points[i - 2].x ? 1 : p1.x === points[i - 2].x ? 0 : -1;\n    multSignY = p1.y > points[i - 2].y ? 1 : p1.y === points[i - 2].y ? 0 : -1;\n  }\n  path.push([\n    'L',\n    p1.x + multSignX * correction,\n    p1.y + multSignY * correction,\n  ]);\n  return path;\n};\n\n/**\n * Transform a path by transforming each segment.\n * it has to be a simplified path or it won't work.\n * WARNING: this depends from pathOffset for correct operation\n * @param {TSimplePathData} path fabricJS parsed and simplified path commands\n * @param {TMat2D} transform matrix that represent the transformation\n * @param {Point} [pathOffset] `Path.pathOffset`\n * @returns {TSimplePathData} the transformed path\n */\nexport const transformPath = (\n  path: TSimplePathData,\n  transform: TMat2D,\n  pathOffset: Point,\n): TSimplePathData => {\n  if (pathOffset) {\n    transform = multiplyTransformMatrices(transform, [\n      1,\n      0,\n      0,\n      1,\n      -pathOffset.x,\n      -pathOffset.y,\n    ]);\n  }\n  return path.map((pathSegment) => {\n    const newSegment: TSimpleParsedCommand = [...pathSegment];\n    for (let i = 1; i < pathSegment.length - 1; i += 2) {\n      // TODO: is there a way to get around casting to any?\n      const { x, y } = transformPoint(\n        {\n          x: pathSegment[i] as number,\n          y: pathSegment[i + 1] as number,\n        },\n        transform,\n      );\n      newSegment[i] = x;\n      newSegment[i + 1] = y;\n    }\n    return newSegment;\n  });\n};\n\n/**\n * Returns an array of path commands to create a regular polygon\n * @param {number} numVertexes\n * @param {number} radius\n * @returns {TSimplePathData} An array of SVG path commands\n */\nexport const getRegularPolygonPath = (\n  numVertexes: number,\n  radius: number,\n): TSimplePathData => {\n  const interiorAngle = (Math.PI * 2) / numVertexes;\n  // rotationAdjustment rotates the path by 1/2 the interior angle so that the polygon always has a flat side on the bottom\n  // This isn't strictly necessary, but it's how we tend to think of and expect polygons to be drawn\n  let rotationAdjustment = -halfPI;\n  if (numVertexes % 2 === 0) {\n    rotationAdjustment += interiorAngle / 2;\n  }\n  const d = new Array(numVertexes + 1);\n  for (let i = 0; i < numVertexes; i++) {\n    const rad = i * interiorAngle + rotationAdjustment;\n    const { x, y } = new Point(cos(rad), sin(rad)).scalarMultiply(radius);\n    d[i] = [i === 0 ? 'M' : 'L', x, y];\n  }\n  d[numVertexes] = ['Z'];\n  return d;\n};\n\n/**\n * Join path commands to go back to svg format\n * @param {TSimplePathData} pathData fabricJS parsed path commands\n * @param {number} fractionDigits number of fraction digits to \"leave\"\n * @return {String} joined path 'M 0 0 L 20 30'\n */\nexport const joinPath = (pathData: TSimplePathData, fractionDigits?: number) =>\n  pathData\n    .map((segment) => {\n      return segment\n        .map((arg, i) => {\n          if (i === 0) return arg;\n          return fractionDigits === undefined\n            ? arg\n            : toFixed(arg, fractionDigits);\n        })\n        .join(' ');\n    })\n    .join(' ');\n"],"names":["repeatedCommands","m","M","segmentToBezier","theta1","theta2","cosTh","sinTh","rx","ry","cx1","cy1","mT","fromX","fromY","costh1","cos","sinth1","sin","costh2","sinth2","toX","toY","calcVectorAngle","ux","uy","vx","vy","ta","Math","atan2","tb","PI","getBoundsOfCurve","begx","begy","cp1x","cp1y","cp2x","cp2y","endx","endy","argsString","config","cachesBoundsOfCurve","arguments","join","cache","boundsOfCurveCache","sqrt","abs","tvalues","bounds","b","a","c","i","t","push","b2ac","sqrtb2ac","t1","t2","j","length","jlen","iterator","getPointOnCubicBezierIterator","x","y","result","Point","min","max","fromArcToBeziers","fx","fy","_ref","_","rot","large","sweep","tx","ty","segsNorm","arcToSegments","rotateX","root","theta","PiBy180","sinTheta","px","py","rx2","ry2","py2","px2","pl","_rx","_ry","s","cx","cy","mTheta","dtheta","segments","ceil","mDelta","th3","len","makePathSimpler","path","x1","y1","destinationPath","previous","controlX","controlY","parsedCommand","current","converted","forEach","calcLineLength","x2","y2","pct","c1","c2","CB2","c3","CB3","c4","CB4","QB1","QB2","QB3","getTangentCubicIterator","p1x","p1y","p2x","p2y","p3x","p3y","p4x","p4y","qb1","qb2","qb3","tangentX","tangentY","getPointOnQuadraticBezierIterator","getTangentQuadraticIterator","invT","pathIterator","tempP","tmpLen","perc","p","findPercentageForDistance","segInfo","distance","nextLen","nextStep","lastPerc","angleFinder","angle","getPathSegmentsInfo","tempInfo","totalLength","info","basicInfo","command","destX","destY","getPointOnPath","infos","undefined","segPercent","segment","lerp","rePathCmdAll","RegExp","rePathCommand","regExpArcCommandPoints","reArcCommandPoints","reMyNum","reNum","commandLengths","l","h","v","q","parsePath","pathString","_pathString$match","chain","all","match","matchStr","commandLetter","commandLength","toLowerCase","paramArr","lastIndex","out","exec","slice","newCommand","Array","transformedCommand","parseFloat","getSmoothPathFromPoints","points","correction","p1","p2","multSignX","multSignY","manyPoints","eq","midPoint","midPointFrom","transformPath","transform","pathOffset","multiplyTransformMatrices","map","pathSegment","newSegment","transformPoint","getRegularPolygonPath","numVertexes","radius","interiorAngle","rotationAdjustment","halfPI","d","rad","scalarMultiply","joinPath","pathData","fractionDigits","arg","toFixed"],"mappings":"giBA+BA,MAAMA,EAA8C,CAClDC,EAAG,IACHC,EAAG,KAiBCC,EAAkBA,CACtBC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,KAEA,MAAMC,EAASC,EAAIZ,GACjBa,EAASC,EAAId,GACbe,EAASH,EAAIX,GACbe,EAASF,EAAIb,GACbgB,EAAMf,EAAQE,EAAKW,EAASZ,EAAQE,EAAKW,EAASV,EAClDY,EAAMf,EAAQC,EAAKW,EAASb,EAAQG,EAAKW,EAAST,EAMpD,MAAO,CAAC,IALCE,EAAQD,IAAON,EAAQE,EAAKS,EAASV,EAAQE,EAAKM,GAClDD,EAAQF,IAAOL,EAAQC,EAAKS,EAASX,EAAQG,EAAKM,GAClDM,EAAMT,GAAMN,EAAQE,EAAKY,EAASb,EAAQE,EAAKU,GAC/CG,EAAMV,GAAML,EAAQC,EAAKY,EAASd,EAAQG,EAAKU,GAEnBE,EAAKC,IA8GtCC,EAAkBA,CACtBC,EACAC,EACAC,EACAC,KAEA,MAAMC,EAAKC,KAAKC,MAAML,EAAID,GACxBO,EAAKF,KAAKC,MAAMH,EAAID,GACtB,OAAIK,GAAMH,EACDG,EAAKH,EAEL,EAAIC,KAAKG,IAAMJ,EAAKG,IAyBxB,SAASE,EACdC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GAEA,IAAIC,EACJ,GAAIC,EAAOC,sBAETF,EAAa,IAAIG,WAAWC,OACxBC,EAAMC,mBAAmBN,IAC3B,OAAOK,EAAMC,mBAAmBN,GAIpC,MAAMO,EAAOpB,KAAKoB,KAChBC,EAAMrB,KAAKqB,IACXC,EAAU,GACVC,EAA2D,CACzD,CAAC,EAAG,GACJ,CAAC,EAAG,IAGR,IAAIC,EAAI,EAAInB,EAAO,GAAKE,EAAO,EAAIE,EAC/BgB,GAAI,EAAKpB,EAAO,EAAIE,EAAO,EAAIE,EAAO,EAAIE,EAC1Ce,EAAI,EAAInB,EAAO,EAAIF,EAEvB,IAAK,IAAIsB,EAAI,EAAGA,EAAI,IAAKA,EAAG,CAO1B,GANIA,EAAI,IACNH,EAAI,EAAIlB,EAAO,GAAKE,EAAO,EAAIE,EAC/Be,GAAI,EAAKnB,EAAO,EAAIE,EAAO,EAAIE,EAAO,EAAIE,EAC1Cc,EAAI,EAAIlB,EAAO,EAAIF,GAGjBe,EAAII,GAAK,MAAO,CAClB,GAAIJ,EAAIG,GAAK,MACX,SAEF,MAAMI,GAAKF,EAAIF,EACX,EAAII,GAAKA,EAAI,GACfN,EAAQO,KAAKD,GAEf,QACF,CACA,MAAME,EAAON,EAAIA,EAAI,EAAIE,EAAID,EAC7B,GAAIK,EAAO,EACT,SAEF,MAAMC,EAAWX,EAAKU,GAChBE,IAAOR,EAAIO,IAAa,EAAIN,GAC9B,EAAIO,GAAMA,EAAK,GACjBV,EAAQO,KAAKG,GAEf,MAAMC,IAAOT,EAAIO,IAAa,EAAIN,GAC9B,EAAIQ,GAAMA,EAAK,GACjBX,EAAQO,KAAKI,EAEjB,CAEA,IAAIC,EAAIZ,EAAQa,OAChB,MAAMC,EAAOF,EACPG,EAAWC,EACfjC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GAEF,KAAOsB,KAAK,CACV,MAAMK,EAAEA,EAACC,EAAEA,GAAMH,EAASf,EAAQY,IAClCX,EAAO,GAAGW,GAAKK,EACfhB,EAAO,GAAGW,GAAKM,CACjB,CAEAjB,EAAO,GAAGa,GAAQ/B,EAClBkB,EAAO,GAAGa,GAAQ9B,EAClBiB,EAAO,GAAGa,EAAO,GAAKzB,EACtBY,EAAO,GAAGa,EAAO,GAAKxB,EACtB,MAAM6B,EAAsB,CAC1B,IAAIC,EAAM1C,KAAK2C,OAAOpB,EAAO,IAAKvB,KAAK2C,OAAOpB,EAAO,KACrD,IAAImB,EAAM1C,KAAK4C,OAAOrB,EAAO,IAAKvB,KAAK4C,OAAOrB,EAAO,MAKvD,OAHIT,EAAOC,sBACTG,EAAMC,mBAAmBN,GAAe4B,GAEnCA,CACT,CAQO,MAAMI,EAAmBA,CAC9BC,EACAC,EAAUC,KAE6B,IADtCC,EAAGtE,EAAIC,EAAIsE,EAAKC,EAAOC,EAAOC,EAAIC,GAAsBN,EAEzD,MAAMO,EA7OcC,EACpBhE,EACAC,EACAd,EACAC,EACAuE,EACAC,EACAK,KAEA,GAAW,IAAP9E,GAAmB,IAAPC,EACd,MAAO,GAET,IAAII,EAAQ,EACVC,EAAQ,EACRyE,EAAO,EACT,MAAMvD,EAAKH,KAAKG,GACdwD,EAAQF,EAAUG,EAClBC,EAAWxE,EAAIsE,GACflF,EAAQU,EAAIwE,GACZG,EAAK,KAAQrF,EAAQe,EAAMqE,EAAWpE,GACtCsE,EAAK,KAAQtF,EAAQgB,EAAMoE,EAAWrE,GACtCwE,EAAMrF,GAAM,EACZsF,EAAMrF,GAAM,EACZsF,EAAMH,GAAM,EACZI,EAAML,GAAM,EACZM,EAAKJ,EAAMC,EAAMD,EAAME,EAAMD,EAAME,EACrC,IAAIE,EAAMrE,KAAKqB,IAAI1C,GACf2F,EAAMtE,KAAKqB,IAAIzC,GAEnB,GAAIwF,EAAK,EAAG,CACV,MAAMG,EAAIvE,KAAKoB,KAAK,EAAIgD,GAAMJ,EAAMC,IACpCI,GAAOE,EACPD,GAAOC,CACT,MACEb,GACGP,IAAUC,GAAQ,EAAO,GAAOpD,KAAKoB,KAAKgD,GAAMJ,EAAME,EAAMD,EAAME,IAGvE,MAAMK,EAAMd,EAAOW,EAAMN,EAAMO,EAC7BG,GAAOf,EAAOY,EAAMR,EAAMO,EAC1BxF,EAAMJ,EAAQ+F,EAAKX,EAAWY,EAAW,GAANjF,EACnCV,EAAM+E,EAAWW,EAAK/F,EAAQgG,EAAW,GAANhF,EACrC,IAAIiF,EAAShF,EAAgB,EAAG,GAAIoE,EAAKU,GAAMH,GAAMN,EAAKU,GAAMH,GAC5DK,EAASjF,GACVoE,EAAKU,GAAMH,GACXN,EAAKU,GAAMH,IACVR,EAAKU,GAAMH,IACXN,EAAKU,GAAMH,GAGD,IAAVlB,GAAeuB,EAAS,EAC1BA,GAAU,EAAIxE,EACK,IAAViD,GAAeuB,EAAS,IACjCA,GAAU,EAAIxE,GAIhB,MAAMyE,EAAW5E,KAAK6E,KAAK7E,KAAKqB,IAAKsD,EAASxE,EAAM,IAClDsC,EAAS,GACTqC,EAASH,EAASC,EAClB7F,EACI,EAAI,EAAKiB,KAAKX,IAAIyF,EAAS,GAAK9E,KAAKX,IAAIyF,EAAS,GACpD9E,KAAKX,IAAIyF,EAAS,GACtB,IAAIC,EAAML,EAASI,EAEnB,IAAK,IAAInD,EAAI,EAAGA,EAAIiD,EAAUjD,IAC5Bc,EAAOd,GAAKrD,EACVoG,EACAK,EACAtG,EACAoF,EACAQ,EACAC,EACAzF,EACAC,EACAC,EACAC,EACAC,GAEFD,EAAQyD,EAAOd,GAAG,GAClB1C,EAAQwD,EAAOd,GAAG,GAClB+C,EAASK,EACTA,GAAOD,EAET,OAAOrC,GAyJUe,CAAcH,EAAKP,EAAIQ,EAAKP,EAAIpE,EAAIC,EAAIuE,EAAOC,EAAOF,GAEvE,IAAK,IAAIvB,EAAI,EAAGqD,EAAMzB,EAASpB,OAAQR,EAAIqD,EAAKrD,IAC9C4B,EAAS5B,GAAG,IAAMmB,EAClBS,EAAS5B,GAAG,IAAMoB,EAClBQ,EAAS5B,GAAG,IAAMmB,EAClBS,EAAS5B,GAAG,IAAMoB,EAClBQ,EAAS5B,GAAG,IAAMmB,EAClBS,EAAS5B,GAAG,IAAMoB,EAEpB,OAAOQ,GAcI0B,EAAmBC,IAI9B,IAAI3C,EAAI,EACNC,EAAI,EAIF2C,EAAK,EACPC,EAAK,EAGP,MAAMC,EAAmC,GACzC,IAAIC,EAEFC,EAAW,EACXC,EAAW,EACb,IAAK,MAAMC,KAAiBP,EAAM,CAChC,MAAMQ,EAAiC,IAAID,GAC3C,IAAIE,EACJ,OACED,EAAQ,IAER,IAAK,IACHA,EAAQ,IAAMnD,EACdmD,EAAQ,IAAMlD,EAEhB,IAAK,IACHD,EAAImD,EAAQ,GACZlD,EAAIkD,EAAQ,GACZC,EAAY,CAAC,IAAKpD,EAAGC,GACrB,MACF,IAAK,IACHkD,EAAQ,IAAMnD,EAEhB,IAAK,IACHA,EAAImD,EAAQ,GACZC,EAAY,CAAC,IAAKpD,EAAGC,GACrB,MACF,IAAK,IACHkD,EAAQ,IAAMlD,EAEhB,IAAK,IACHA,EAAIkD,EAAQ,GACZC,EAAY,CAAC,IAAKpD,EAAGC,GACrB,MACF,IAAK,IACHkD,EAAQ,IAAMnD,EACdmD,EAAQ,IAAMlD,EAEhB,IAAK,IACHD,EAAImD,EAAQ,GACZlD,EAAIkD,EAAQ,GACZP,EAAKO,EAAQ,GACbN,EAAKM,EAAQ,GACbC,EAAY,CAAC,IAAKpD,EAAGC,GACrB,MACF,IAAK,IACHkD,EAAQ,IAAMnD,EACdmD,EAAQ,IAAMlD,EACdkD,EAAQ,IAAMnD,EACdmD,EAAQ,IAAMlD,EACdkD,EAAQ,IAAMnD,EACdmD,EAAQ,IAAMlD,EAEhB,IAAK,IACH+C,EAAWG,EAAQ,GACnBF,EAAWE,EAAQ,GACnBnD,EAAImD,EAAQ,GACZlD,EAAIkD,EAAQ,GACZC,EAAY,CAAC,IAAKD,EAAQ,GAAIA,EAAQ,GAAIH,EAAUC,EAAUjD,EAAGC,GACjE,MACF,IAAK,IACHkD,EAAQ,IAAMnD,EACdmD,EAAQ,IAAMlD,EACdkD,EAAQ,IAAMnD,EACdmD,EAAQ,IAAMlD,EAEhB,IAAK,IAEc,MAAb8C,GAEFC,EAAW,EAAIhD,EAAIgD,EACnBC,EAAW,EAAIhD,EAAIgD,IAInBD,EAAWhD,EACXiD,EAAWhD,GAEbD,EAAImD,EAAQ,GACZlD,EAAIkD,EAAQ,GACZC,EAAY,CAAC,IAAKJ,EAAUC,EAAUE,EAAQ,GAAIA,EAAQ,GAAInD,EAAGC,GAGjE+C,EAAWI,EAAU,GACrBH,EAAWG,EAAU,GACrB,MACF,IAAK,IACHD,EAAQ,IAAMnD,EACdmD,EAAQ,IAAMlD,EACdkD,EAAQ,IAAMnD,EACdmD,EAAQ,IAAMlD,EAEhB,IAAK,IACH+C,EAAWG,EAAQ,GACnBF,EAAWE,EAAQ,GACnBnD,EAAImD,EAAQ,GACZlD,EAAIkD,EAAQ,GACZC,EAAY,CAAC,IAAKJ,EAAUC,EAAUjD,EAAGC,GACzC,MACF,IAAK,IACHkD,EAAQ,IAAMnD,EACdmD,EAAQ,IAAMlD,EAEhB,IAAK,IACc,MAAb8C,GAEFC,EAAW,EAAIhD,EAAIgD,EACnBC,EAAW,EAAIhD,EAAIgD,IAInBD,EAAWhD,EACXiD,EAAWhD,GAEbD,EAAImD,EAAQ,GACZlD,EAAIkD,EAAQ,GACZC,EAAY,CAAC,IAAKJ,EAAUC,EAAUjD,EAAGC,GACzC,MACF,IAAK,IACHkD,EAAQ,IAAMnD,EACdmD,EAAQ,IAAMlD,EAEhB,IAAK,IACHK,EAAiBN,EAAGC,EAAGkD,GAASE,QAASpE,GAAM6D,EAAgBxD,KAAKL,IACpEe,EAAImD,EAAQ,GACZlD,EAAIkD,EAAQ,GACZ,MACF,IAAK,IACL,IAAK,IACHnD,EAAI4C,EACJ3C,EAAI4C,EACJO,EAAY,CAAC,KAIbA,GACFN,EAAgBxD,KAAK8D,GACrBL,EAAWK,EAAU,IAErBL,EAAW,EAEf,CACA,OAAOD,GAYHQ,EAAiBA,CACrBV,EACAC,EACAU,EACAC,IACW/F,KAAKoB,MAAM0E,EAAKX,IAAO,GAAKY,EAAKX,IAAO,GAa/C9C,EACJA,CACEjC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,IAEDoF,IACC,MAAMC,EAASD,GA1Va,EA2V1BE,EA1VOtE,IAAc,EAAIA,GAAK,GAAK,EAAIA,GA0VlCuE,CAAIH,GACTI,EA1VOxE,IAAc,EAAIA,GAAK,EAAIA,IAAM,EA0VnCyE,CAAIL,GACTM,EA1VO1E,KAAe,EAAIA,IAAM,EA0V3B2E,CAAIP,GACX,OAAO,IAAItD,EACT/B,EAAOsF,EAAKxF,EAAOyF,EAAK3F,EAAO6F,EAAK/F,EAAOiG,EAC3C1F,EAAOqF,EAAKvF,EAAOwF,EAAK1F,EAAO4F,EAAK9F,EAAOgG,IAI3CE,EAAO5E,GAAcA,GAAK,EAC1B6E,EAAO7E,GAAc,EAAIA,GAAK,EAAIA,GAClC8E,EAAO9E,IAAe,EAAIA,IAAM,EAEhC+E,EACJA,CACEC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,IAEDnB,IACC,MAAMoB,EAAMZ,EAAIR,GACdqB,EAAMZ,EAAIT,GACVsB,EAAMZ,EAAIV,GACVuB,EACE,GAAKD,GAAOR,EAAMF,GAAOS,GAAOL,EAAMF,GAAOM,GAAOF,EAAMF,IAC5DQ,EACE,GAAKF,GAAOP,EAAMF,GAAOQ,GAAOJ,EAAMF,GAAOK,GAAOD,EAAMF,IAC9D,OAAOjH,KAAKC,MAAMuH,EAAUD,IAG1BE,EACJA,CACEb,EACAC,EACAC,EACAC,EACAC,EACAC,IAEDjB,IACC,MAAMC,EAAKO,EAAIR,GACbE,EAAKO,EAAIT,GACTI,EAAKM,EAAIV,GACX,OAAO,IAAItD,EACTsE,EAAMf,EAAKa,EAAMZ,EAAKU,EAAMR,EAC5Ba,EAAMhB,EAAKc,EAAMb,EAAKW,EAAMT,IAI5BsB,EACJA,CACEd,EACAC,EACAC,EACAC,EACAC,EACAC,IAEDjB,IACC,MAAM2B,EAAO,EAAI3B,EACfuB,EAAW,GAAKI,GAAQb,EAAMF,GAAOZ,GAAOgB,EAAMF,IAClDU,EAAW,GAAKG,GAAQZ,EAAMF,GAAOb,GAAOiB,EAAMF,IACpD,OAAO/G,KAAKC,MAAMuH,EAAUD,IAK1BK,EAAeA,CACnBvF,EACA8C,EACAC,KAEA,IAAIyC,EAAQ,IAAInF,EAAMyC,EAAIC,GACxB0C,EAAS,EACX,IAAK,IAAIC,EAAO,EAAGA,GAAQ,IAAKA,GAAQ,EAAG,CACzC,MAAMC,EAAI3F,EAAS0F,EAAO,KAC1BD,GAAUjC,EAAegC,EAAMtF,EAAGsF,EAAMrF,EAAGwF,EAAEzF,EAAGyF,EAAExF,GAClDqF,EAAQG,CACV,CACA,OAAOF,GAWHG,EAA4BA,CAChCC,EACAC,KAEA,IAIEC,EAJEL,EAAO,EACTD,EAAS,EACTD,EAAY,CAAEtF,EAAG2F,EAAQ3F,EAAGC,EAAG0F,EAAQ1F,GACvCwF,EAAQ,IAAKH,GAEbQ,EAAW,IACXC,EAAW,EAGb,MAAMjG,EAAW6F,EAAQ7F,SACvBkG,EAAcL,EAAQK,YACxB,KAAOT,EAASK,GAAYE,EAAW,MACrCL,EAAI3F,EAAS0F,GACbO,EAAWP,EACXK,EAAUvC,EAAegC,EAAMtF,EAAGsF,EAAMrF,EAAGwF,EAAEzF,EAAGyF,EAAExF,GAE9C4F,EAAUN,EAASK,GAErBJ,GAAQM,EACRA,GAAY,IAEZR,EAAQG,EACRD,GAAQM,EACRP,GAAUM,GAGd,MAAO,IAAKJ,EAAGQ,MAAOD,EAAYD,KAQvBG,EACXvD,IAEA,IAOE7C,EACAqG,EAREC,EAAc,EAGhBxD,EAAK,EACLC,EAAK,EACLU,EAAK,EACLC,EAAK,EAGP,MAAM6C,EAA2B,GACjC,IAAK,MAAMlD,KAAWR,EAAM,CAC1B,MAAM2D,EAAmE,CACvEtG,EAAG4C,EACH3C,EAAG4C,EACH0D,QAASpD,EAAQ,GACjBvD,OAAQ,GAEV,OACEuD,EAAQ,IAER,IAAK,IACHgD,EAAwCG,EACxCH,EAASnG,EAAIuD,EAAKX,EAAKO,EAAQ,GAC/BgD,EAASlG,EAAIuD,EAAKX,EAAKM,EAAQ,GAC/B,MACF,IAAK,IACHgD,EAAwCG,EACxCH,EAASvG,OAAS0D,EAAeV,EAAIC,EAAIM,EAAQ,GAAIA,EAAQ,IAC7DP,EAAKO,EAAQ,GACbN,EAAKM,EAAQ,GACb,MACF,IAAK,IACHrD,EAAWC,EACT6C,EACAC,EACAM,EAAQ,GACRA,EAAQ,GACRA,EAAQ,GACRA,EAAQ,GACRA,EAAQ,GACRA,EAAQ,IAEVgD,EAA4BG,EAC5BH,EAASrG,SAAWA,EACpBqG,EAASH,YAAc5B,EACrBxB,EACAC,EACAM,EAAQ,GACRA,EAAQ,GACRA,EAAQ,GACRA,EAAQ,GACRA,EAAQ,GACRA,EAAQ,IAEVgD,EAASvG,OAASyF,EAAavF,EAAU8C,EAAIC,GAE7CD,EAAKO,EAAQ,GACbN,EAAKM,EAAQ,GACb,MACF,IAAK,IACHrD,EAAWoF,EACTtC,EACAC,EACAM,EAAQ,GACRA,EAAQ,GACRA,EAAQ,GACRA,EAAQ,IAEVgD,EAA4BG,EAC5BH,EAASrG,SAAWA,EACpBqG,EAASH,YAAcb,EACrBvC,EACAC,EACAM,EAAQ,GACRA,EAAQ,GACRA,EAAQ,GACRA,EAAQ,IAEVgD,EAASvG,OAASyF,EAAavF,EAAU8C,EAAIC,GAC7CD,EAAKO,EAAQ,GACbN,EAAKM,EAAQ,GACb,MACF,IAAK,IAEHgD,EAAyBG,EACzBH,EAASK,MAAQjD,EACjB4C,EAASM,MAAQjD,EACjB2C,EAASvG,OAAS0D,EAAeV,EAAIC,EAAIU,EAAIC,GAC7CZ,EAAKW,EACLV,EAAKW,EAGT4C,GAAeD,EAASvG,OACxByG,EAAK/G,KAAK6G,EACZ,CAEA,OADAE,EAAK/G,KAAK,CAAEM,OAAQwG,EAAapG,EAAG4C,EAAI3C,EAAG4C,IACpCwD,GASIK,EAAiB,SAC5B/D,EACAiD,GAE4B,IAD5Be,EAAyBlI,UAAAmB,OAAA,QAAAgH,IAAAnI,UAAA,GAAAA,UAAA,GAAGyH,EAAoBvD,GAE5CvD,EAAI,EACR,KAAOwG,EAAWe,EAAMvH,GAAGQ,OAAS,GAAKR,EAAIuH,EAAM/G,OAAS,GAC1DgG,GAAYe,EAAMvH,GAAGQ,OACrBR,IAEF,MAAMuG,EAAUgB,EAAMvH,GACpByH,EAAajB,EAAWD,EAAQ/F,OAChCkH,EAAUnE,EAAKvD,GAEjB,OAAQuG,EAAQY,SACd,IAAK,IACH,MAAO,CAAEvG,EAAG2F,EAAQ3F,EAAGC,EAAG0F,EAAQ1F,EAAGgG,MAAO,GAC9C,IAAK,IACH,MAAO,IACF,IAAI9F,EAAMwF,EAAQ3F,EAAG2F,EAAQ1F,GAAG8G,KACjC,IAAI5G,EAAMwF,EAAQa,MAAOb,EAAQc,OACjCI,GAEFZ,MAAOxI,KAAKC,MAAMiI,EAAQc,MAAQd,EAAQ1F,EAAG0F,EAAQa,MAAQb,EAAQ3F,IAEzE,IAAK,IACH,MAAO,IACF,IAAIG,EAAMwF,EAAQ3F,EAAG2F,EAAQ1F,GAAG8G,KACjC,IAAI5G,EAAM2G,EAAQ,GAAKA,EAAQ,IAC/BD,GAEFZ,MAAOxI,KAAKC,MAAMoJ,EAAQ,GAAMnB,EAAQ1F,EAAG6G,EAAQ,GAAMnB,EAAQ3F,IAErE,IAAK,IAEL,IAAK,IACH,OAAO0F,EAA0BC,EAASC,GAIhD,EAEMoB,EAAe,IAAIC,OAAOC,EAAe,MACzCC,EAAyB,IAAIF,OAAOG,EAAoB,KACxDC,EAAU,IAAIJ,OAAOK,EAAO,MAC5BC,EAAiB,CACrB1L,EAAG,EACH2L,EAAG,EACHC,EAAG,EACHC,EAAG,EACHvI,EAAG,EACH6C,EAAG,EACH2F,EAAG,EACHtI,EAAG,EACHH,EAAG,GAaQ0I,EAAaC,IAAyC,IAAAC,EACjE,MAAMC,EAA0B,GAC1BC,EAAoC,QAAjCF,EAAGD,EAAWI,MAAMjB,UAAa,IAAAc,EAAAA,EAAI,GAC9C,IAAK,MAAMI,KAAYF,EAAK,CAE1B,MAAMG,EAAgBD,EAAS,GAE/B,GAAsB,MAAlBC,GAA2C,MAAlBA,EAAuB,CAClDJ,EAAMzI,KAAK,CAAC6I,IACZ,QACF,CACA,MAAMC,EACJb,EACEY,EAAcE,eAGlB,IAAIC,EAAW,GACf,GAAsB,MAAlBH,GAA2C,MAAlBA,EAAuB,CAKlDhB,EAAuBoB,UAAY,EACnC,IAAK,IAAIC,EAAM,KAAOA,EAAMrB,EAAuBsB,KAAKP,IACtDI,EAAShJ,QAAQkJ,EAAIE,MAAM,GAE/B,MACEJ,EAAWJ,EAASD,MAAMZ,IAAY,GAKxC,IAAK,IAAIjI,EAAI,EAAGA,EAAIkJ,EAAS1I,OAAQR,GAAKgJ,EAAe,CACvD,MAAMO,EAAa,IAAIC,MAAMR,GACvBS,EAAqBjN,EAAiBuM,GAC5CQ,EAAW,GACTvJ,EAAI,GAAKyJ,EAAqBA,EAAqBV,EACrD,IAAK,IAAIxI,EAAI,EAAGA,EAAIyI,EAAezI,IACjCgJ,EAAWhJ,EAAI,GAAKmJ,WAAWR,EAASlJ,EAAIO,IAE9CoI,EAAMzI,KAAKqJ,EACb,CACF,CACA,OAAOZ,GAUIgB,EAA0B,SACrCC,GAEoB,IADpBC,EAAUxK,UAAAmB,OAAA,QAAAgH,IAAAnI,UAAA,GAAAA,UAAA,GAAG,EAETyK,EAAK,IAAI/I,EAAM6I,EAAO,IACxBG,EAAK,IAAIhJ,EAAM6I,EAAO,IACtBI,EAAY,EACZC,EAAY,EACd,MAAM1G,EAAwB,GAC5BF,EAAMuG,EAAOpJ,OACb0J,EAAa7G,EAAM,EAWrB,IAAIrD,EACJ,IAVIkK,IACFF,EAAYJ,EAAO,GAAGhJ,EAAImJ,EAAGnJ,GAAI,EAAKgJ,EAAO,GAAGhJ,IAAMmJ,EAAGnJ,EAAI,EAAI,EACjEqJ,EAAYL,EAAO,GAAG/I,EAAIkJ,EAAGlJ,GAAI,EAAK+I,EAAO,GAAG/I,IAAMkJ,EAAGlJ,EAAI,EAAI,GAEnE0C,EAAKrD,KAAK,CACR,IACA4J,EAAGlJ,EAAIoJ,EAAYH,EACnBC,EAAGjJ,EAAIoJ,EAAYJ,IAGhB7J,EAAI,EAAGA,EAAIqD,EAAKrD,IAAK,CACxB,IAAK8J,EAAGK,GAAGJ,GAAK,CACd,MAAMK,EAAWN,EAAGO,aAAaN,GAIjCxG,EAAKrD,KAAK,CAAC,IAAK4J,EAAGlJ,EAAGkJ,EAAGjJ,EAAGuJ,EAASxJ,EAAGwJ,EAASvJ,GACnD,CACAiJ,EAAKF,EAAO5J,GACRA,EAAI,EAAI4J,EAAOpJ,SACjBuJ,EAAKH,EAAO5J,EAAI,GAEpB,CAUA,OATIkK,IACFF,EAAYF,EAAGlJ,EAAIgJ,EAAO5J,EAAI,GAAGY,EAAI,EAAIkJ,EAAGlJ,IAAMgJ,EAAO5J,EAAI,GAAGY,EAAI,GAAI,EACxEqJ,EAAYH,EAAGjJ,EAAI+I,EAAO5J,EAAI,GAAGa,EAAI,EAAIiJ,EAAGjJ,IAAM+I,EAAO5J,EAAI,GAAGa,EAAI,GAAI,GAE1E0C,EAAKrD,KAAK,CACR,IACA4J,EAAGlJ,EAAIoJ,EAAYH,EACnBC,EAAGjJ,EAAIoJ,EAAYJ,IAEdtG,CACT,EAWa+G,EAAgBA,CAC3B/G,EACAgH,EACAC,KAEIA,IACFD,EAAYE,EAA0BF,EAAW,CAC/C,EACA,EACA,EACA,GACCC,EAAW5J,GACX4J,EAAW3J,KAGT0C,EAAKmH,IAAKC,IACf,MAAMC,EAAmC,IAAID,GAC7C,IAAK,IAAI3K,EAAI,EAAGA,EAAI2K,EAAYnK,OAAS,EAAGR,GAAK,EAAG,CAElD,MAAMY,EAAEA,EAACC,EAAEA,GAAMgK,EACf,CACEjK,EAAG+J,EAAY3K,GACfa,EAAG8J,EAAY3K,EAAI,IAErBuK,GAEFK,EAAW5K,GAAKY,EAChBgK,EAAW5K,EAAI,GAAKa,CACtB,CACA,OAAO+J,KAUEE,EAAwBA,CACnCC,EACAC,KAEA,MAAMC,EAA2B,EAAV5M,KAAKG,GAAUuM,EAGtC,IAAIG,GAAsBC,EACtBJ,EAAc,GAAM,IACtBG,GAAsBD,EAAgB,GAExC,MAAMG,EAAI,IAAI5B,MAAMuB,EAAc,GAClC,IAAK,IAAI/K,EAAI,EAAGA,EAAI+K,EAAa/K,IAAK,CACpC,MAAMqL,EAAMrL,EAAIiL,EAAgBC,GAC1BtK,EAAEA,EAACC,EAAEA,GAAM,IAAIE,EAAMvD,EAAI6N,GAAM3N,EAAI2N,IAAMC,eAAeN,GAC9DI,EAAEpL,GAAK,CAAO,IAANA,EAAU,IAAM,IAAKY,EAAGC,EAClC,CAEA,OADAuK,EAAEL,GAAe,CAAC,KACXK,GASIG,EAAWA,CAACC,EAA2BC,IAClDD,EACGd,IAAKhD,GACGA,EACJgD,IAAI,CAACgB,EAAK1L,IACC,IAANA,QACsBwH,IAAnBiE,EADaC,EAGhBC,EAAQD,EAAKD,IAElBnM,KAAK,MAETA,KAAK"}