@drauu/core - npm Package Compare versions

Comparing version 0.4.0 to 0.4.1

dist/index.global.js

@@ -39,3 +39,3 @@ "use strict";
 
-  // ../../node_modules/.pnpm/perfect-freehand@1.2.0/node_modules/perfect-freehand/dist/esm/index.js
+  // ../../node_modules/.pnpm/perfect-freehand@1.2.2/node_modules/perfect-freehand/dist/esm/index.mjs
   function $(e, t, u, x = (h) => h) {
@@ -98,4 +98,3 @@ return e * x(0.5 - t * (0.5 - u));
     let { size: u = 16, smoothing: x = 0.5, thinning: h = 0.5, simulatePressure: y = true, easing: n = (r) => r, start: f = {}, end: d = {}, last: D2 = false } = t, { cap: S = true, easing: j = (r) => r * (2 - r) } = f, { cap: q = true, easing: c = (r) => --r * r * r + 1 } = d;
-    if (e.length === 0 || u <= 0)
-      return [];
+    if (e.length === 0 || u <= 0) return [];
     let p = e[e.length - 1].runningLength, g = f.taper === false ? 0 : f.taper === true ? Math.max(u, p) : f.taper, T = d.taper === false ? 0 : d.taper === true ? Math.max(u, p) : d.taper, te = Math.pow(u * x, 2), _ = [], M = [], H = e.slice(0, 10).reduce((r, i) => {
@@ -111,4 +110,3 @@ let o = i.pressure;
       let { pressure: i } = e[r], { point: o, vector: s, distance: W, runningLength: I } = e[r];
-      if (r < e.length - 1 && p - I < 3)
-        continue;
+      if (r < e.length - 1 && p - I < 3) continue;
       if (h) {
@@ -120,4 +118,3 @@ if (y) {
         m = $(u, h, i, n);
-      } else
-        m = u / 2;
+      } else m = u / 2;
       U === void 0 && (U = m);
@@ -129,4 +126,3 @@ let le = I < g ? j(I / g) : 1, fe = p - I < T ? c((p - I) / T) : 1;
         let v = b(R(X), m);
-        for (let Z = 1 / 13, w = 0; w <= 1; w += Z)
-          O = L(a(o, v), o, V * w), _.push(O), E = L(l(o, v), o, V * -w), M.push(E);
+        for (let Z = 1 / 13, w = 0; w <= 1; w += Z) O = L(a(o, v), o, V * w), _.push(O), E = L(l(o, v), o, V * -w), M.push(E);
         z = O, F = E, ne && (J = true);
@@ -147,26 +143,20 @@ continue;
         let r = ee(P, G(R(a(P, k))), -(U || m)), i = [];
-        for (let o = 1 / 13, s = o; s <= 1; s += o)
-          i.push(L(r, P, V * 2 * s));
+        for (let o = 1 / 13, s = o; s <= 1; s += o) i.push(L(r, P, V * 2 * s));
         return i;
       }
     } else {
-      if (!(g || T && e.length === 1))
-        if (S)
-          for (let i = 1 / 13, o = i; o <= 1; o += i) {
-            let s = L(M[0], P, V * o);
-            Q.push(s);
-          }
-        else {
-          let i = a(_[0], M[0]), o = b(i, 0.5), s = b(i, 0.51);
-          Q.push(a(P, o), a(P, s), l(P, s), l(P, o));
-        }
+      if (!(g || T && e.length === 1)) if (S) for (let i = 1 / 13, o = i; o <= 1; o += i) {
+        let s = L(M[0], P, V * o);
+        Q.push(s);
+      }
+      else {
+        let i = a(_[0], M[0]), o = b(i, 0.5), s = b(i, 0.51);
+        Q.push(a(P, o), a(P, s), l(P, s), l(P, o));
+      }
       let r = R(se(e[e.length - 1].vector));
-      if (T || g && e.length === 1)
-        N.push(k);
+      if (T || g && e.length === 1) N.push(k);
       else if (q) {
         let i = ee(k, r, m);
-        for (let o = 1 / 29, s = o; s < 1; s += o)
-          N.push(L(i, k, V * 3 * s));
-      } else
-        N.push(l(k, b(r, m)), l(k, b(r, m * 0.99)), a(k, b(r, m * 0.99)), a(k, b(r, m)));
+        for (let o = 1 / 29, s = o; s < 1; s += o) N.push(L(i, k, V * 3 * s));
+      } else N.push(l(k, b(r, m)), l(k, b(r, m * 0.99)), a(k, b(r, m * 0.99)), a(k, b(r, m)));
     }
@@ -178,4 +168,3 @@ return _.concat(N, M.reverse(), Q);
     let { streamline: u = 0.5, size: x = 16, last: h = false } = t;
-    if (e.length === 0)
-      return [];
+    if (e.length === 0) return [];
     let y = 0.15 + (1 - u) * 0.85, n = Array.isArray(e[0]) ? e : e.map(({ x: c, y: p, pressure: g = 0.5 }) => [c, p, g]);
@@ -185,4 +174,3 @@ if (n.length === 2) {
       n = n.slice(0, -1);
-      for (let p = 1; p < 5; p++)
-        n.push(K(n[0], c, p / 4));
+      for (let p = 1; p < 5; p++) n.push(K(n[0], c, p / 4));
     }
@@ -193,8 +181,6 @@ n.length === 1 && (n = [...n, [...l(n[0], [1, 1]), ...n[0].slice(2)]]);
       let p = h && c === j ? n[c].slice(0, 2) : K(S.point, n[c], y);
-      if (ue(S.point, p))
-        continue;
+      if (ue(S.point, p)) continue;
       let g = ie(p, S.point);
       if (D2 += g, c < j && !d) {
-        if (D2 < x)
-          continue;
+        if (D2 < x) continue;
         d = true;
@@ -671,4 +657,9 @@ }
       path.setAttribute("d", _DrawModel.toSvgData(simplify(this.points, 1, true)));
-      if (!path.getTotalLength())
-        return false;
+      if (!path.getTotalLength()) {
+        const { x, y } = this.points[0];
+        const r = this.brush.size / 2;
+        path.setAttribute("d", `M ${x - r} ${y} a ${r},${r} 0 1,0 ${r * 2},0 a ${r},${r} 0 1,0 ${-r * 2},0`);
+        path.setAttribute("fill", this.brush.color);
+        path.setAttribute("stroke-width", "0");
+      }
       return true;
@@ -1014,2 +1005,3 @@ }
       this._opIndex = 0;
+      this._elements = [];
       this.cancel();
@@ -1016,0 +1008,0 @@ this.el.innerHTML = "";

dist/index.js

@@ -67,3 +67,3 @@ "use strict";
 
-// ../../node_modules/.pnpm/perfect-freehand@1.2.0/node_modules/perfect-freehand/dist/esm/index.js
+// ../../node_modules/.pnpm/perfect-freehand@1.2.2/node_modules/perfect-freehand/dist/esm/index.mjs
 function $(e, t, u, x = (h) => h) {
@@ -126,4 +126,3 @@ return e * x(0.5 - t * (0.5 - u));
   let { size: u = 16, smoothing: x = 0.5, thinning: h = 0.5, simulatePressure: y = true, easing: n = (r) => r, start: f = {}, end: d = {}, last: D2 = false } = t, { cap: S = true, easing: j = (r) => r * (2 - r) } = f, { cap: q = true, easing: c = (r) => --r * r * r + 1 } = d;
-  if (e.length === 0 || u <= 0)
-    return [];
+  if (e.length === 0 || u <= 0) return [];
   let p = e[e.length - 1].runningLength, g = f.taper === false ? 0 : f.taper === true ? Math.max(u, p) : f.taper, T = d.taper === false ? 0 : d.taper === true ? Math.max(u, p) : d.taper, te = Math.pow(u * x, 2), _ = [], M = [], H = e.slice(0, 10).reduce((r, i) => {
@@ -139,4 +138,3 @@ let o = i.pressure;
     let { pressure: i } = e[r], { point: o, vector: s, distance: W, runningLength: I } = e[r];
-    if (r < e.length - 1 && p - I < 3)
-      continue;
+    if (r < e.length - 1 && p - I < 3) continue;
     if (h) {
@@ -148,4 +146,3 @@ if (y) {
       m = $(u, h, i, n);
-    } else
-      m = u / 2;
+    } else m = u / 2;
     U === void 0 && (U = m);
@@ -157,4 +154,3 @@ let le = I < g ? j(I / g) : 1, fe = p - I < T ? c((p - I) / T) : 1;
       let v = b(R(X), m);
-      for (let Z = 1 / 13, w = 0; w <= 1; w += Z)
-        O = L(a(o, v), o, V * w), _.push(O), E = L(l(o, v), o, V * -w), M.push(E);
+      for (let Z = 1 / 13, w = 0; w <= 1; w += Z) O = L(a(o, v), o, V * w), _.push(O), E = L(l(o, v), o, V * -w), M.push(E);
       z = O, F = E, ne && (J = true);
@@ -175,26 +171,20 @@ continue;
       let r = ee(P, G(R(a(P, k))), -(U || m)), i = [];
-      for (let o = 1 / 13, s = o; s <= 1; s += o)
-        i.push(L(r, P, V * 2 * s));
+      for (let o = 1 / 13, s = o; s <= 1; s += o) i.push(L(r, P, V * 2 * s));
       return i;
     }
   } else {
-    if (!(g || T && e.length === 1))
-      if (S)
-        for (let i = 1 / 13, o = i; o <= 1; o += i) {
-          let s = L(M[0], P, V * o);
-          Q.push(s);
-        }
-      else {
-        let i = a(_[0], M[0]), o = b(i, 0.5), s = b(i, 0.51);
-        Q.push(a(P, o), a(P, s), l(P, s), l(P, o));
-      }
+    if (!(g || T && e.length === 1)) if (S) for (let i = 1 / 13, o = i; o <= 1; o += i) {
+      let s = L(M[0], P, V * o);
+      Q.push(s);
+    }
+    else {
+      let i = a(_[0], M[0]), o = b(i, 0.5), s = b(i, 0.51);
+      Q.push(a(P, o), a(P, s), l(P, s), l(P, o));
+    }
     let r = R(se(e[e.length - 1].vector));
-    if (T || g && e.length === 1)
-      N.push(k);
+    if (T || g && e.length === 1) N.push(k);
     else if (q) {
       let i = ee(k, r, m);
-      for (let o = 1 / 29, s = o; s < 1; s += o)
-        N.push(L(i, k, V * 3 * s));
-    } else
-      N.push(l(k, b(r, m)), l(k, b(r, m * 0.99)), a(k, b(r, m * 0.99)), a(k, b(r, m)));
+      for (let o = 1 / 29, s = o; s < 1; s += o) N.push(L(i, k, V * 3 * s));
+    } else N.push(l(k, b(r, m)), l(k, b(r, m * 0.99)), a(k, b(r, m * 0.99)), a(k, b(r, m)));
   }
@@ -206,4 +196,3 @@ return _.concat(N, M.reverse(), Q);
   let { streamline: u = 0.5, size: x = 16, last: h = false } = t;
-  if (e.length === 0)
-    return [];
+  if (e.length === 0) return [];
   let y = 0.15 + (1 - u) * 0.85, n = Array.isArray(e[0]) ? e : e.map(({ x: c, y: p, pressure: g = 0.5 }) => [c, p, g]);
@@ -213,4 +202,3 @@ if (n.length === 2) {
     n = n.slice(0, -1);
-    for (let p = 1; p < 5; p++)
-      n.push(K(n[0], c, p / 4));
+    for (let p = 1; p < 5; p++) n.push(K(n[0], c, p / 4));
   }
@@ -221,8 +209,6 @@ n.length === 1 && (n = [...n, [...l(n[0], [1, 1]), ...n[0].slice(2)]]);
     let p = h && c === j ? n[c].slice(0, 2) : K(S.point, n[c], y);
-    if (ue(S.point, p))
-      continue;
+    if (ue(S.point, p)) continue;
     let g = ie(p, S.point);
     if (D2 += g, c < j && !d) {
-      if (D2 < x)
-        continue;
+      if (D2 < x) continue;
       d = true;
@@ -699,4 +685,9 @@ }
     path.setAttribute("d", _DrawModel.toSvgData(simplify(this.points, 1, true)));
-    if (!path.getTotalLength())
-      return false;
+    if (!path.getTotalLength()) {
+      const { x, y } = this.points[0];
+      const r = this.brush.size / 2;
+      path.setAttribute("d", `M ${x - r} ${y} a ${r},${r} 0 1,0 ${r * 2},0 a ${r},${r} 0 1,0 ${-r * 2},0`);
+      path.setAttribute("fill", this.brush.color);
+      path.setAttribute("stroke-width", "0");
+    }
     return true;
@@ -1042,2 +1033,3 @@ }
     this._opIndex = 0;
+    this._elements = [];
     this.cancel();
@@ -1044,0 +1036,0 @@ this.el.innerHTML = "";

package.json

 {
   "name": "@drauu/core",
-  "version": "0.4.0",
+  "version": "0.4.1",
   "author": "Anthony Fu <[e-mail]>",
@@ -32,3 +32,3 @@ "license": "MIT",
   "devDependencies": {
-    "perfect-freehand": "^1.2.0"
+    "perfect-freehand": "^1.2.2"
   },
@@ -35,0 +35,0 @@ "scripts": {

New alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Fixed alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Improved metrics

Total package byte prevSize

116806

increased by0.46%

Worsened metrics

Lines of code

3451

decreased by-0.69%

No dependency changes