flo-mat 3.0.11 → 3.0.12

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/browser/index.js CHANGED
@@ -8804,18 +8804,18 @@ const eval_de_casteljau_error_abs = Math.abs;
8804
8804
  * ```
8805
8805
  * // for cubic bezier curves
8806
8806
  * return [
8807
- * x_, // <E> === 3T + 9
8808
- * y_ // <E> === 3T + 9
8807
+ * x_, // <E> === 3T + 9
8808
+ * y_ // <E> === 3T + 9
8809
8809
  * ];
8810
8810
  * // for quadratic bezier curves
8811
8811
  * return [
8812
- * x_, // <E> === 2T + 6
8813
- * y_ // <E> === 2T + 6
8812
+ * x_, // <E> === 2T + 6
8813
+ * y_ // <E> === 2T + 6
8814
8814
  * ];
8815
8815
  * // for linear bezier curves (i.e. lines)
8816
8816
  * return [
8817
- * x_, // <E> === T + 3
8818
- * y_ // <E> === T + 3
8817
+ * x_, // <E> === T + 3
8818
+ * y_ // <E> === T + 3
8819
8819
  * ];
8820
8820
  * ```
8821
8821
  *
@@ -19221,44 +19221,44 @@ const to_power_basis_error_counters_abs = Math.abs;
19221
19221
  * ```
19222
19222
  * // for cubic bezier curves
19223
19223
  * return [
19224
- * [
19225
- * x3, // <E> === 3
19226
- * x2, // <E> === 3
19227
- * x1, // <E> === 2
19228
- * 0,
19229
- * ],
19230
- * [
19231
- * y3, // <E> === 3
19232
- * y2, // <E> === 3
19233
- * y1, // <E> === 2
19234
- * 0,
19235
- * ]
19224
+ * [
19225
+ * x3, // <E> === 3
19226
+ * x2, // <E> === 3
19227
+ * x1, // <E> === 2
19228
+ * 0,
19229
+ * ],
19230
+ * [
19231
+ * y3, // <E> === 3
19232
+ * y2, // <E> === 3
19233
+ * y1, // <E> === 2
19234
+ * 0,
19235
+ * ]
19236
19236
  * ]
19237
19237
  *
19238
19238
  * // for quadratic bezier curves
19239
19239
  * return [
19240
- * [
19241
- * x2, // <E> === 2
19242
- * x1, // <E> === 1
19243
- * 0,
19244
- * ],
19245
- * [
19246
- * y2, // <E> === 2
19247
- * y1, // <E> === 1
19248
- * 0,
19249
- * ]
19240
+ * [
19241
+ * x2, // <E> === 2
19242
+ * x1, // <E> === 1
19243
+ * 0,
19244
+ * ],
19245
+ * [
19246
+ * y2, // <E> === 2
19247
+ * y1, // <E> === 1
19248
+ * 0,
19249
+ * ]
19250
19250
  * ];
19251
19251
  *
19252
19252
  * // for linear bezier curves (i.e. lines)
19253
19253
  * return [
19254
- * [
19255
- * x1_, // <E> === 1
19256
- * x0_ // <E> === 0
19257
- * ],
19258
- * [
19259
- * y1_, // <E> === 1
19260
- * y0_ // <E> === 0
19261
- * ]
19254
+ * [
19255
+ * x1_, // <E> === 1
19256
+ * x0_ // <E> === 0
19257
+ * ],
19258
+ * [
19259
+ * y1_, // <E> === 1
19260
+ * y0_ // <E> === 0
19261
+ * ]
19262
19262
  * ];
19263
19263
  * ```
19264
19264
  *
@@ -25799,7 +25799,7 @@ const matOptionRanges = {
25799
25799
  range: [1, Number.POSITIVE_INFINITY],
25800
25800
  },
25801
25801
  simplifyTolerance: {
25802
- range: [2 ** -10, 1024],
25802
+ range: [2 ** -20, 2 ** 20],
25803
25803
  scaleByMaxCoordinate: true
25804
25804
  },
25805
25805
  minBezLength: {
@@ -28125,6 +28125,7 @@ const { ceil: find_2_prong_ceil, log2: find_2_prong_log2, max: find_2_prong_max,
28125
28125
  * centered at an interior point x which contains two boundary portions c and
28126
28126
  * d of dΩ as in Fig. 19."
28127
28127
  * In fact, we (and they) start by fixing one point on the boundary beforehand.
28128
+ *
28128
28129
  * @param loops A shape represented by path loops
28129
28130
  * @param maxCoordinate The extreme coordinate value of the shape
28130
28131
  * @param squaredDiagonalLength The squared diagonal length of the shape
@@ -28208,7 +28209,7 @@ function find2Prong(meta, isHoleClosing, for1Prong, angle, y) {
28208
28209
  return undefined;
28209
28210
  }
28210
28211
  }
28211
- // Find the point on the line connecting y with x that is
28212
+ // Find the point on the line connecting y with x that is
28212
28213
  // equidistant from y and z. This will be our next x.
28213
28214
  const nextX = findEquidistantPointOnLineDd(x, y.p, z.p);
28214
28215
  const error = find_2_prong_abs(find_2_prong_sqrt(xy) - find_2_prong_sqrt(xz));