@pixerate/editor 0.119.0 → 0.121.0

package/dist/chunk-GX332W2C.js

@@ -0,0 +1,181 @@
+// src/geom/homography.ts
+var IDENTITY_HOMOGRAPHY = [1, 0, 0, 0, 1, 0, 0, 0, 1];
+function solve8(rows) {
+  const m = rows.map((r) => r.slice());
+  for (let col = 0; col < 8; col++) {
+    let pivot = col;
+    for (let r = col + 1; r < 8; r++) if (Math.abs(m[r][col]) > Math.abs(m[pivot][col])) pivot = r;
+    if (!(Math.abs(m[pivot][col]) >= 1e-12)) return null;
+    [m[col], m[pivot]] = [m[pivot], m[col]];
+    const p = m[col];
+    for (let r = 0; r < 8; r++) {
+      if (r === col) continue;
+      const f = m[r][col] / p[col];
+      if (f !== 0) for (let k = 0; k < 9; k++) m[r][k] -= f * p[k];
+    }
+  }
+  const out = [];
+  for (let i = 0; i < 8; i++) {
+    const v = m[i][8] / m[i][i];
+    if (!Number.isFinite(v)) return null;
+    out.push(v);
+  }
+  return out;
+}
+function applyHomography(h, p) {
+  const w = h[6] * p.x + h[7] * p.y + h[8];
+  if (!Number.isFinite(w) || Math.abs(w) < 1e-12) return null;
+  const x = (h[0] * p.x + h[1] * p.y + h[2]) / w;
+  const y = (h[3] * p.x + h[4] * p.y + h[5]) / w;
+  return Number.isFinite(x) && Number.isFinite(y) ? { x, y } : null;
+}
+function homographyW(h, p) {
+  return h[6] * p.x + h[7] * p.y + h[8];
+}
+var finite = (p) => Number.isFinite(p.x) && Number.isFinite(p.y);
+function homographyFromPoints(from, to) {
+  if (from.length !== 4 || to.length !== 4 || ![...from, ...to].every(finite)) return null;
+  const rows = [];
+  for (let i = 0; i < 4; i++) {
+    const { x, y } = from[i];
+    const { x: u, y: v } = to[i];
+    rows.push([x, y, 1, 0, 0, 0, -u * x, -u * y, u]);
+    rows.push([0, 0, 0, x, y, 1, -v * x, -v * y, v]);
+  }
+  const h = solve8(rows);
+  if (!h) return null;
+  const out = [h[0], h[1], h[2], h[3], h[4], h[5], h[6], h[7], 1];
+  for (let i = 0; i < 4; i++) {
+    const r = applyHomography(out, from[i]);
+    const q = to[i];
+    const scale = 1 + Math.max(Math.abs(q.x), Math.abs(q.y));
+    if (!r || Math.abs(r.x - q.x) > 1e-6 * scale || Math.abs(r.y - q.y) > 1e-6 * scale) return null;
+  }
+  return out;
+}
+function homographyKeepsQuad(h, quad) {
+  const ws = quad.map((p) => h[6] * p.x + h[7] * p.y + h[8]);
+  return ws.every((w) => w > 1e-9) || ws.every((w) => w < -1e-9);
+}
+function orderQuad(points) {
+  if (points.length !== 4 || !points.every(finite)) return null;
+  const cx = points.reduce((s, p) => s + p.x, 0) / 4;
+  const cy = points.reduce((s, p) => s + p.y, 0) / 4;
+  const q = points.slice().sort((a, b) => Math.atan2(a.y - cy, a.x - cx) - Math.atan2(b.y - cy, b.x - cx));
+  let first = 0;
+  for (let i = 1; i < 4; i++) if (q[i].x + q[i].y < q[first].x + q[first].y) first = i;
+  const ordered = [...q.slice(first), ...q.slice(0, first)];
+  const cross = (o, a, b) => (a.x - o.x) * (b.y - o.y) - (a.y - o.y) * (b.x - o.x);
+  const turns = ordered.map((_, i) => cross(ordered[i], ordered[(i + 1) % 4], ordered[(i + 2) % 4]));
+  const area = turns.reduce((s, t) => s + t, 0) / 2;
+  const xs = ordered.map((p) => p.x);
+  const ys = ordered.map((p) => p.y);
+  const size = Math.max(Math.max(...xs) - Math.min(...xs), Math.max(...ys) - Math.min(...ys));
+  const convex = turns.every((t) => t > 1e-9 * size * size);
+  return convex && area > 1e-6 * size * size ? ordered : null;
+}
+function multiplyHomographies(a, b) {
+  const r = new Array(9);
+  for (let i = 0; i < 3; i++) for (let j = 0; j < 3; j++) r[i * 3 + j] = b[i * 3] * a[j] + b[i * 3 + 1] * a[3 + j] + b[i * 3 + 2] * a[6 + j];
+  return r;
+}
+function invertHomography(m) {
+  const c = [
+    m[4] * m[8] - m[5] * m[7],
+    m[2] * m[7] - m[1] * m[8],
+    m[1] * m[5] - m[2] * m[4],
+    m[5] * m[6] - m[3] * m[8],
+    m[0] * m[8] - m[2] * m[6],
+    m[2] * m[3] - m[0] * m[5],
+    m[3] * m[7] - m[4] * m[6],
+    m[1] * m[6] - m[0] * m[7],
+    m[0] * m[4] - m[1] * m[3]
+  ];
+  const det = m[0] * c[0] + m[1] * c[3] + m[2] * c[6];
+  if (!(Math.abs(det) >= 1e-12) || !Number.isFinite(det)) return null;
+  return c.map((v) => v / det);
+}
+function homographyFromAffine(m) {
+  return [m[0], m[2], m[4], m[1], m[3], m[5], 0, 0, 1];
+}
+function affineFromHomography(h, eps = 1e-12) {
+  if (Math.abs(h[6]) > eps * Math.abs(h[8]) || Math.abs(h[7]) > eps * Math.abs(h[8]) || !h[8]) return null;
+  const w = h[8];
+  return [h[0] / w, h[3] / w, h[1] / w, h[4] / w, h[2] / w, h[5] / w];
+}
+function isIdentityHomography(h, eps = 1e-9) {
+  const w = h[8];
+  if (Math.abs(w) < 1e-12) return false;
+  const id = IDENTITY_HOMOGRAPHY;
+  for (let i = 0; i < 8; i++) if (Math.abs(h[i] / w - id[i]) > eps) return false;
+  return true;
+}
+function squareToQuad(q) {
+  const [p0, p1, p2, p3] = q;
+  const sx = p0.x - p1.x + p2.x - p3.x;
+  const sy = p0.y - p1.y + p2.y - p3.y;
+  if (Math.abs(sx) < 1e-12 && Math.abs(sy) < 1e-12) {
+    return [p1.x - p0.x, p3.x - p0.x, p0.x, p1.y - p0.y, p3.y - p0.y, p0.y, 0, 0, 1];
+  }
+  const dx1 = p1.x - p2.x;
+  const dx2 = p3.x - p2.x;
+  const dy1 = p1.y - p2.y;
+  const dy2 = p3.y - p2.y;
+  const den = dx1 * dy2 - dx2 * dy1;
+  if (Math.abs(den) < 1e-12) return null;
+  const g = (sx * dy2 - dx2 * sy) / den;
+  const h = (dx1 * sy - sx * dy1) / den;
+  return [p1.x - p0.x + g * p1.x, p3.x - p0.x + h * p3.x, p0.x, p1.y - p0.y + g * p1.y, p3.y - p0.y + h * p3.y, p0.y, g, h, 1];
+}
+function rectToQuad(r, quad) {
+  if (!(r.width > 0 && r.height > 0) || quad.length !== 4 || !quad.every(finite)) return null;
+  const toUnit = [1 / r.width, 0, -r.x / r.width, 0, 1 / r.height, -r.y / r.height, 0, 0, 1];
+  const sq = squareToQuad(quad);
+  if (!sq) return null;
+  const h = multiplyHomographies(toUnit, sq);
+  return invertHomography(h) ? h : null;
+}
+function boxQuad(r) {
+  return [
+    { x: r.x, y: r.y },
+    { x: r.x + r.width, y: r.y },
+    { x: r.x + r.width, y: r.y + r.height },
+    { x: r.x, y: r.y + r.height }
+  ];
+}
+function homographyFrontSide(h, r) {
+  const ahead = boxQuad(r).filter((p) => homographyW(h, p) > 0).length;
+  if (ahead >= 3) return 1;
+  if (ahead <= 1) return -1;
+  return homographyW(h, { x: r.x + r.width / 2, y: r.y + r.height / 2 }) >= 0 ? 1 : -1;
+}
+var OUTPUT_LIMIT = 1 << 20;
+function cornerBounds(corners) {
+  const lim = OUTPUT_LIMIT;
+  const xs = corners.map((c) => c.x);
+  const ys = corners.map((c) => c.y);
+  const x0 = Math.floor(Math.max(-lim, Math.min(...xs))) - 1;
+  const y0 = Math.floor(Math.max(-lim, Math.min(...ys))) - 1;
+  const x1 = Math.ceil(Math.min(lim, Math.max(...xs))) + 1;
+  const y1 = Math.ceil(Math.min(lim, Math.max(...ys))) + 1;
+  return { x: x0, y: y0, width: x1 - x0, height: y1 - y0 };
+}
+
+export {
+  solve8,
+  applyHomography,
+  homographyW,
+  homographyFromPoints,
+  homographyKeepsQuad,
+  orderQuad,
+  multiplyHomographies,
+  invertHomography,
+  homographyFromAffine,
+  affineFromHomography,
+  isIdentityHomography,
+  rectToQuad,
+  boxQuad,
+  homographyFrontSide,
+  cornerBounds
+};
+//# sourceMappingURL=chunk-GX332W2C.js.map

package/dist/chunk-GX332W2C.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/geom/homography.ts"],"sourcesContent":["/**\n * Perspective (projective) maps between quadrilaterals: Free Distort and Perspective in both the\n * vector and the image editor. Pure maths; degenerate or non-finite input gives `null` instead of\n * NaNs.\n *\n * Ported from ArtCraft (MIT OR Apache-2.0, © ArtCraft Team and contributors; see\n * THIRD_PARTY_NOTICES.md): pdfcraft `crates/geom/src/perspective.rs` (`Homography::from_points`,\n * `Homography::apply`, `solve8`, `order_quad`) and photocraft `crates/algo/src/transform.rs`\n * (`Homography::square_to_quad`, `rect_to_quad`, `inverse`, `mul`, `local_scale`, `front_side`,\n * `warp_output_bounds`, `convex_quad`).\n */\nimport type { AffineMatrix, Box, Homography, Quad, Vec2 } from './types';\n\nexport type { Homography };\n\nexport const IDENTITY_HOMOGRAPHY: Homography = [1, 0, 0, 0, 1, 0, 0, 0, 1];\n\n/**\n * Gaussian elimination with partial pivoting on an 8×8 system (the 9th column of each row is the\n * right-hand side). Null when the system is singular.\n */\nexport function solve8(rows: readonly (readonly number[])[]): number[] | null {\n  const m = rows.map((r) => r.slice());\n  for (let col = 0; col < 8; col++) {\n    let pivot = col;\n    for (let r = col + 1; r < 8; r++) if (Math.abs(m[r][col]) > Math.abs(m[pivot][col])) pivot = r;\n    if (!(Math.abs(m[pivot][col]) >= 1e-12)) return null;\n    [m[col], m[pivot]] = [m[pivot], m[col]];\n    const p = m[col];\n    for (let r = 0; r < 8; r++) {\n      if (r === col) continue;\n      const f = m[r][col] / p[col];\n      if (f !== 0) for (let k = 0; k < 9; k++) m[r][k] -= f * p[k];\n    }\n  }\n  const out: number[] = [];\n  for (let i = 0; i < 8; i++) {\n    const v = m[i][8] / m[i][i];\n    if (!Number.isFinite(v)) return null;\n    out.push(v);\n  }\n  return out;\n}\n\n/** The image of `p`, or null where the map sends it to infinity. */\nexport function applyHomography(h: Homography, p: Vec2): Vec2 | null {\n  const w = h[6] * p.x + h[7] * p.y + h[8];\n  if (!Number.isFinite(w) || Math.abs(w) < 1e-12) return null;\n  const x = (h[0] * p.x + h[1] * p.y + h[2]) / w;\n  const y = (h[3] * p.x + h[4] * p.y + h[5]) / w;\n  return Number.isFinite(x) && Number.isFinite(y) ? { x, y } : null;\n}\n\n/** The homogeneous `w` of `p`: its sign is the side of the horizon `p` maps to (0 on it). */\nexport function homographyW(h: Homography, p: Vec2): number {\n  return h[6] * p.x + h[7] * p.y + h[8];\n}\n\nconst finite = (p: Vec2) => Number.isFinite(p.x) && Number.isFinite(p.y);\n\n/**\n * The projective map that takes each of `from` to the point at the same index of `to`. Null when\n * three of either set are collinear or a coordinate is not finite.\n */\nexport function homographyFromPoints(from: readonly Vec2[], to: readonly Vec2[]): Homography | null {\n  if (from.length !== 4 || to.length !== 4 || ![...from, ...to].every(finite)) return null;\n  // x' = (h0 x + h1 y + h2) / (h6 x + h7 y + 1), y' likewise with h3..h5: eight unknowns, two\n  // equations per point pair.\n  const rows: number[][] = [];\n  for (let i = 0; i < 4; i++) {\n    const { x, y } = from[i];\n    const { x: u, y: v } = to[i];\n    rows.push([x, y, 1, 0, 0, 0, -u * x, -u * y, u]);\n    rows.push([0, 0, 0, x, y, 1, -v * x, -v * y, v]);\n  }\n  const h = solve8(rows);\n  if (!h) return null;\n  const out: Homography = [h[0], h[1], h[2], h[3], h[4], h[5], h[6], h[7], 1];\n  // Collinear points can leave a solvable but singular system: check the map really takes the\n  // four points where they should go.\n  for (let i = 0; i < 4; i++) {\n    const r = applyHomography(out, from[i]);\n    const q = to[i];\n    const scale = 1 + Math.max(Math.abs(q.x), Math.abs(q.y));\n    if (!r || Math.abs(r.x - q.x) > 1e-6 * scale || Math.abs(r.y - q.y) > 1e-6 * scale) return null;\n  }\n  return out;\n}\n\n/**\n * Whether `h` maps the whole convex quad `quad` without sending any of it through infinity (the\n * denominator keeps one sign over it): what a usable distortion needs.\n */\nexport function homographyKeepsQuad(h: Homography, quad: readonly Vec2[]): boolean {\n  const ws = quad.map((p) => h[6] * p.x + h[7] * p.y + h[8]);\n  return ws.every((w) => w > 1e-9) || ws.every((w) => w < -1e-9);\n}\n\n/**\n * The four corners in reading order for a y-down space: top-left, top-right, bottom-right,\n * bottom-left, whatever order they come in. Null unless they form a convex quadrilateral with a\n * non-negligible area.\n */\nexport function orderQuad(points: readonly Vec2[]): Vec2[] | null {\n  if (points.length !== 4 || !points.every(finite)) return null;\n  const cx = points.reduce((s, p) => s + p.x, 0) / 4;\n  const cy = points.reduce((s, p) => s + p.y, 0) / 4;\n  // Ascending angle about the centre is clockwise on screen (y down).\n  const q = points.slice().sort((a, b) => Math.atan2(a.y - cy, a.x - cx) - Math.atan2(b.y - cy, b.x - cx));\n  let first = 0;\n  for (let i = 1; i < 4; i++) if (q[i].x + q[i].y < q[first].x + q[first].y) first = i;\n  const ordered = [...q.slice(first), ...q.slice(0, first)];\n  const cross = (o: Vec2, a: Vec2, b: Vec2) => (a.x - o.x) * (b.y - o.y) - (a.y - o.y) * (b.x - o.x);\n  const turns = ordered.map((_, i) => cross(ordered[i], ordered[(i + 1) % 4], ordered[(i + 2) % 4]));\n  const area = turns.reduce((s, t) => s + t, 0) / 2;\n  const xs = ordered.map((p) => p.x);\n  const ys = ordered.map((p) => p.y);\n  const size = Math.max(Math.max(...xs) - Math.min(...xs), Math.max(...ys) - Math.min(...ys));\n  const convex = turns.every((t) => t > 1e-9 * size * size);\n  return convex && area > 1e-6 * size * size ? ordered : null;\n}\n\n/** `a` then `b` (apply `a` first). */\nexport function multiplyHomographies(a: Homography, b: Homography): Homography {\n  // Row-major column-vector maps: (b ∘ a) = B · A.\n  const r = new Array<number>(9);\n  for (let i = 0; i < 3; i++) for (let j = 0; j < 3; j++) r[i * 3 + j] = b[i * 3] * a[j] + b[i * 3 + 1] * a[3 + j] + b[i * 3 + 2] * a[6 + j];\n  return r as unknown as Homography;\n}\n\n/** The inverse map, or null for a singular one. */\nexport function invertHomography(m: Homography): Homography | null {\n  const c = [\n    m[4] * m[8] - m[5] * m[7],\n    m[2] * m[7] - m[1] * m[8],\n    m[1] * m[5] - m[2] * m[4],\n    m[5] * m[6] - m[3] * m[8],\n    m[0] * m[8] - m[2] * m[6],\n    m[2] * m[3] - m[0] * m[5],\n    m[3] * m[7] - m[4] * m[6],\n    m[1] * m[6] - m[0] * m[7],\n    m[0] * m[4] - m[1] * m[3],\n  ];\n  const det = m[0] * c[0] + m[1] * c[3] + m[2] * c[6];\n  if (!(Math.abs(det) >= 1e-12) || !Number.isFinite(det)) return null;\n  return c.map((v) => v / det) as unknown as Homography;\n}\n\n/** An affine matrix (SVG order) as a homography. */\nexport function homographyFromAffine(m: AffineMatrix): Homography {\n  return [m[0], m[2], m[4], m[1], m[3], m[5], 0, 0, 1];\n}\n\n/** The affine matrix of `h` when it is affine (no perspective part), else null. */\nexport function affineFromHomography(h: Homography, eps = 1e-12): AffineMatrix | null {\n  if (Math.abs(h[6]) > eps * Math.abs(h[8]) || Math.abs(h[7]) > eps * Math.abs(h[8]) || !h[8]) return null;\n  const w = h[8];\n  return [h[0] / w, h[3] / w, h[1] / w, h[4] / w, h[2] / w, h[5] / w];\n}\n\nexport function isIdentityHomography(h: Homography, eps = 1e-9): boolean {\n  const w = h[8];\n  if (Math.abs(w) < 1e-12) return false;\n  const id = IDENTITY_HOMOGRAPHY;\n  for (let i = 0; i < 8; i++) if (Math.abs(h[i] / w - id[i]) > eps) return false;\n  return true;\n}\n\n/** Unit square → quad (corners (0,0), (1,0), (1,1), (0,1) to TL, TR, BR, BL); null when degenerate. */\nfunction squareToQuad(q: readonly Vec2[]): Homography | null {\n  const [p0, p1, p2, p3] = q;\n  const sx = p0.x - p1.x + p2.x - p3.x;\n  const sy = p0.y - p1.y + p2.y - p3.y;\n  if (Math.abs(sx) < 1e-12 && Math.abs(sy) < 1e-12) {\n    return [p1.x - p0.x, p3.x - p0.x, p0.x, p1.y - p0.y, p3.y - p0.y, p0.y, 0, 0, 1];\n  }\n  const dx1 = p1.x - p2.x;\n  const dx2 = p3.x - p2.x;\n  const dy1 = p1.y - p2.y;\n  const dy2 = p3.y - p2.y;\n  const den = dx1 * dy2 - dx2 * dy1;\n  if (Math.abs(den) < 1e-12) return null;\n  const g = (sx * dy2 - dx2 * sy) / den;\n  const h = (dx1 * sy - sx * dy1) / den;\n  return [p1.x - p0.x + g * p1.x, p3.x - p0.x + h * p3.x, p0.x, p1.y - p0.y + g * p1.y, p3.y - p0.y + h * p3.y, p0.y, g, h, 1];\n}\n\n/**\n * The map taking box `r`'s corners onto `quad` (TL, TR, BR, BL), exact for parallelograms (then\n * affine). Null for an empty box, a non-finite or degenerate quad, or a singular result.\n */\nexport function rectToQuad(r: Box, quad: readonly Vec2[]): Homography | null {\n  if (!(r.width > 0 && r.height > 0) || quad.length !== 4 || !quad.every(finite)) return null;\n  const toUnit: Homography = [1 / r.width, 0, -r.x / r.width, 0, 1 / r.height, -r.y / r.height, 0, 0, 1];\n  const sq = squareToQuad(quad);\n  if (!sq) return null;\n  const h = multiplyHomographies(toUnit, sq);\n  return invertHomography(h) ? h : null;\n}\n\n/** Box `r`'s corners as a quad (TL, TR, BR, BL). */\nexport function boxQuad(r: Box): Quad {\n  return [\n    { x: r.x, y: r.y },\n    { x: r.x + r.width, y: r.y },\n    { x: r.x + r.width, y: r.y + r.height },\n    { x: r.x, y: r.y + r.height },\n  ];\n}\n\n/** Approximate linear scale of the map near `p` (square root of the Jacobian determinant). */\nexport function homographyLocalScale(h: Homography, p: Vec2): number {\n  const e = 0.5;\n  const a = applyHomography(h, { x: p.x - e, y: p.y });\n  const b = applyHomography(h, { x: p.x + e, y: p.y });\n  const c = applyHomography(h, { x: p.x, y: p.y - e });\n  const d = applyHomography(h, { x: p.x, y: p.y + e });\n  if (!a || !b || !c || !d) return 0;\n  const jx = { x: b.x - a.x, y: b.y - a.y };\n  const jy = { x: d.x - c.x, y: d.y - c.y };\n  return Math.sqrt(Math.abs(jx.x * jy.y - jx.y * jy.x));\n}\n\n/**\n * The side of the horizon (+1 or −1) most of box `r`'s corners map to (the centre's on a tie). A\n * Distort dragged past the horizon maps the rest of the source to the far side, where it would\n * show as a mirrored copy wrapped round infinity; resampling keeps to this side, as Photoshop does.\n */\nexport function homographyFrontSide(h: Homography, r: Box): 1 | -1 {\n  const ahead = boxQuad(r).filter((p) => homographyW(h, p) > 0).length;\n  if (ahead >= 3) return 1;\n  if (ahead <= 1) return -1;\n  return homographyW(h, { x: r.x + r.width / 2, y: r.y + r.height / 2 }) >= 0 ? 1 : -1;\n}\n\n/** Most pixels a side of a warped result may span (±2²⁰), as photocraft clamps. */\nconst OUTPUT_LIMIT = 1 << 20;\n\n/**\n * The integer box a warp of box `r` through `h` fills: the warped corners plus a pixel for filter\n * support, each side clamped to ±2²⁰. Null when a corner maps to infinity or `h` is singular.\n */\nexport function warpOutputBounds(r: Box, h: Homography): Box | null {\n  if (!(r.width > 0 && r.height > 0) || !invertHomography(h)) return null;\n  const corners = boxQuad(r).map((p) => applyHomography(h, p));\n  if (corners.some((c) => !c)) return null;\n  return cornerBounds(corners as Vec2[]);\n}\n\n/** The integer box around `corners`, grown by a pixel and clamped to ±2²⁰. */\nexport function cornerBounds(corners: readonly Vec2[]): Box {\n  const lim = OUTPUT_LIMIT;\n  const xs = corners.map((c) => c.x);\n  const ys = corners.map((c) => c.y);\n  const x0 = Math.floor(Math.max(-lim, Math.min(...xs))) - 1;\n  const y0 = Math.floor(Math.max(-lim, Math.min(...ys))) - 1;\n  const x1 = Math.ceil(Math.min(lim, Math.max(...xs))) + 1;\n  const y1 = Math.ceil(Math.min(lim, Math.max(...ys))) + 1;\n  return { x: x0, y: y0, width: x1 - x0, height: y1 - y0 };\n}\n\n/**\n * Whether `q` (TL, TR, BR, BL) is strictly convex with every corner turn above ~0.06°, wound\n * clockwise on screen (y down), finite and at least 1 px² in area.\n */\nexport function isConvexQuad(q: readonly Vec2[]): boolean {\n  if (q.length !== 4 || !q.every(finite)) return false;\n  let area2 = 0;\n  for (let i = 0; i < 4; i++) {\n    const a = q[i];\n    const b = q[(i + 1) % 4];\n    const c = q[(i + 2) % 4];\n    const e1 = { x: b.x - a.x, y: b.y - a.y };\n    const e2 = { x: c.x - b.x, y: c.y - b.y };\n    const cross = e1.x * e2.y - e1.y * e2.x;\n    if (!(cross > 1e-3 * Math.hypot(e1.x, e1.y) * Math.hypot(e2.x, e2.y))) return false;\n    area2 += a.x * b.y - b.x * a.y;\n  }\n  return Number.isFinite(area2) && area2 >= 2;\n}\n"],"mappings":";AAeO,IAAM,sBAAkC,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAMlE,SAAS,OAAO,MAAuD;AAC5E,QAAM,IAAI,KAAK,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC;AACnC,WAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,QAAI,QAAQ;AACZ,aAAS,IAAI,MAAM,GAAG,IAAI,GAAG,IAAK,KAAI,KAAK,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,IAAI,KAAK,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,EAAG,SAAQ;AAC7F,QAAI,EAAE,KAAK,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,OAAQ,QAAO;AAChD,KAAC,EAAE,GAAG,GAAG,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,GAAG,CAAC;AACtC,UAAM,IAAI,EAAE,GAAG;AACf,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAI,MAAM,IAAK;AACf,YAAM,IAAI,EAAE,CAAC,EAAE,GAAG,IAAI,EAAE,GAAG;AAC3B,UAAI,MAAM,EAAG,UAAS,IAAI,GAAG,IAAI,GAAG,IAAK,GAAE,CAAC,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC;AAAA,IAC7D;AAAA,EACF;AACA,QAAM,MAAgB,CAAC;AACvB,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAM,IAAI,EAAE,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;AAC1B,QAAI,CAAC,OAAO,SAAS,CAAC,EAAG,QAAO;AAChC,QAAI,KAAK,CAAC;AAAA,EACZ;AACA,SAAO;AACT;AAGO,SAAS,gBAAgB,GAAe,GAAsB;AACnE,QAAM,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC;AACvC,MAAI,CAAC,OAAO,SAAS,CAAC,KAAK,KAAK,IAAI,CAAC,IAAI,MAAO,QAAO;AACvD,QAAM,KAAK,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,KAAK;AAC7C,QAAM,KAAK,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,KAAK;AAC7C,SAAO,OAAO,SAAS,CAAC,KAAK,OAAO,SAAS,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI;AAC/D;AAGO,SAAS,YAAY,GAAe,GAAiB;AAC1D,SAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC;AACtC;AAEA,IAAM,SAAS,CAAC,MAAY,OAAO,SAAS,EAAE,CAAC,KAAK,OAAO,SAAS,EAAE,CAAC;AAMhE,SAAS,qBAAqB,MAAuB,IAAwC;AAClG,MAAI,KAAK,WAAW,KAAK,GAAG,WAAW,KAAK,CAAC,CAAC,GAAG,MAAM,GAAG,EAAE,EAAE,MAAM,MAAM,EAAG,QAAO;AAGpF,QAAM,OAAmB,CAAC;AAC1B,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAM,EAAE,GAAG,EAAE,IAAI,KAAK,CAAC;AACvB,UAAM,EAAE,GAAG,GAAG,GAAG,EAAE,IAAI,GAAG,CAAC;AAC3B,SAAK,KAAK,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC;AAC/C,SAAK,KAAK,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC;AAAA,EACjD;AACA,QAAM,IAAI,OAAO,IAAI;AACrB,MAAI,CAAC,EAAG,QAAO;AACf,QAAM,MAAkB,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC;AAG1E,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAM,IAAI,gBAAgB,KAAK,KAAK,CAAC,CAAC;AACtC,UAAM,IAAI,GAAG,CAAC;AACd,UAAM,QAAQ,IAAI,KAAK,IAAI,KAAK,IAAI,EAAE,CAAC,GAAG,KAAK,IAAI,EAAE,CAAC,CAAC;AACvD,QAAI,CAAC,KAAK,KAAK,IAAI,EAAE,IAAI,EAAE,CAAC,IAAI,OAAO,SAAS,KAAK,IAAI,EAAE,IAAI,EAAE,CAAC,IAAI,OAAO,MAAO,QAAO;AAAA,EAC7F;AACA,SAAO;AACT;AAMO,SAAS,oBAAoB,GAAe,MAAgC;AACjF,QAAM,KAAK,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;AACzD,SAAO,GAAG,MAAM,CAAC,MAAM,IAAI,IAAI,KAAK,GAAG,MAAM,CAAC,MAAM,IAAI,KAAK;AAC/D;AAOO,SAAS,UAAU,QAAwC;AAChE,MAAI,OAAO,WAAW,KAAK,CAAC,OAAO,MAAM,MAAM,EAAG,QAAO;AACzD,QAAM,KAAK,OAAO,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,GAAG,CAAC,IAAI;AACjD,QAAM,KAAK,OAAO,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,GAAG,CAAC,IAAI;AAEjD,QAAM,IAAI,OAAO,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,IAAI,EAAE,IAAI,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,IAAI,EAAE,CAAC;AACvG,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,GAAG,IAAK,KAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,EAAG,SAAQ;AACnF,QAAM,UAAU,CAAC,GAAG,EAAE,MAAM,KAAK,GAAG,GAAG,EAAE,MAAM,GAAG,KAAK,CAAC;AACxD,QAAM,QAAQ,CAAC,GAAS,GAAS,OAAa,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE;AAChG,QAAM,QAAQ,QAAQ,IAAI,CAAC,GAAG,MAAM,MAAM,QAAQ,CAAC,GAAG,SAAS,IAAI,KAAK,CAAC,GAAG,SAAS,IAAI,KAAK,CAAC,CAAC,CAAC;AACjG,QAAM,OAAO,MAAM,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;AAChD,QAAM,KAAK,QAAQ,IAAI,CAAC,MAAM,EAAE,CAAC;AACjC,QAAM,KAAK,QAAQ,IAAI,CAAC,MAAM,EAAE,CAAC;AACjC,QAAM,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,EAAE,IAAI,KAAK,IAAI,GAAG,EAAE,GAAG,KAAK,IAAI,GAAG,EAAE,IAAI,KAAK,IAAI,GAAG,EAAE,CAAC;AAC1F,QAAM,SAAS,MAAM,MAAM,CAAC,MAAM,IAAI,OAAO,OAAO,IAAI;AACxD,SAAO,UAAU,OAAO,OAAO,OAAO,OAAO,UAAU;AACzD;AAGO,SAAS,qBAAqB,GAAe,GAA2B;AAE7E,QAAM,IAAI,IAAI,MAAc,CAAC;AAC7B,WAAS,IAAI,GAAG,IAAI,GAAG,IAAK,UAAS,IAAI,GAAG,IAAI,GAAG,IAAK,GAAE,IAAI,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC;AACzI,SAAO;AACT;AAGO,SAAS,iBAAiB,GAAkC;AACjE,QAAM,IAAI;AAAA,IACR,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;AAAA,IACxB,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;AAAA,IACxB,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;AAAA,IACxB,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;AAAA,IACxB,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;AAAA,IACxB,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;AAAA,IACxB,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;AAAA,IACxB,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;AAAA,IACxB,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;AAAA,EAC1B;AACA,QAAM,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;AAClD,MAAI,EAAE,KAAK,IAAI,GAAG,KAAK,UAAU,CAAC,OAAO,SAAS,GAAG,EAAG,QAAO;AAC/D,SAAO,EAAE,IAAI,CAAC,MAAM,IAAI,GAAG;AAC7B;AAGO,SAAS,qBAAqB,GAA6B;AAChE,SAAO,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC;AACrD;AAGO,SAAS,qBAAqB,GAAe,MAAM,OAA4B;AACpF,MAAI,KAAK,IAAI,EAAE,CAAC,CAAC,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC,CAAC,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,EAAG,QAAO;AACpG,QAAM,IAAI,EAAE,CAAC;AACb,SAAO,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC;AACpE;AAEO,SAAS,qBAAqB,GAAe,MAAM,MAAe;AACvE,QAAM,IAAI,EAAE,CAAC;AACb,MAAI,KAAK,IAAI,CAAC,IAAI,MAAO,QAAO;AAChC,QAAM,KAAK;AACX,WAAS,IAAI,GAAG,IAAI,GAAG,IAAK,KAAI,KAAK,IAAI,EAAE,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,IAAK,QAAO;AACzE,SAAO;AACT;AAGA,SAAS,aAAa,GAAuC;AAC3D,QAAM,CAAC,IAAI,IAAI,IAAI,EAAE,IAAI;AACzB,QAAM,KAAK,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG;AACnC,QAAM,KAAK,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG;AACnC,MAAI,KAAK,IAAI,EAAE,IAAI,SAAS,KAAK,IAAI,EAAE,IAAI,OAAO;AAChD,WAAO,CAAC,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,EACjF;AACA,QAAM,MAAM,GAAG,IAAI,GAAG;AACtB,QAAM,MAAM,GAAG,IAAI,GAAG;AACtB,QAAM,MAAM,GAAG,IAAI,GAAG;AACtB,QAAM,MAAM,GAAG,IAAI,GAAG;AACtB,QAAM,MAAM,MAAM,MAAM,MAAM;AAC9B,MAAI,KAAK,IAAI,GAAG,IAAI,MAAO,QAAO;AAClC,QAAM,KAAK,KAAK,MAAM,MAAM,MAAM;AAClC,QAAM,KAAK,MAAM,KAAK,KAAK,OAAO;AAClC,SAAO,CAAC,GAAG,IAAI,GAAG,IAAI,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAC7H;AAMO,SAAS,WAAW,GAAQ,MAA0C;AAC3E,MAAI,EAAE,EAAE,QAAQ,KAAK,EAAE,SAAS,MAAM,KAAK,WAAW,KAAK,CAAC,KAAK,MAAM,MAAM,EAAG,QAAO;AACvF,QAAM,SAAqB,CAAC,IAAI,EAAE,OAAO,GAAG,CAAC,EAAE,IAAI,EAAE,OAAO,GAAG,IAAI,EAAE,QAAQ,CAAC,EAAE,IAAI,EAAE,QAAQ,GAAG,GAAG,CAAC;AACrG,QAAM,KAAK,aAAa,IAAI;AAC5B,MAAI,CAAC,GAAI,QAAO;AAChB,QAAM,IAAI,qBAAqB,QAAQ,EAAE;AACzC,SAAO,iBAAiB,CAAC,IAAI,IAAI;AACnC;AAGO,SAAS,QAAQ,GAAc;AACpC,SAAO;AAAA,IACL,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE;AAAA,IACjB,EAAE,GAAG,EAAE,IAAI,EAAE,OAAO,GAAG,EAAE,EAAE;AAAA,IAC3B,EAAE,GAAG,EAAE,IAAI,EAAE,OAAO,GAAG,EAAE,IAAI,EAAE,OAAO;AAAA,IACtC,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,IAAI,EAAE,OAAO;AAAA,EAC9B;AACF;AAoBO,SAAS,oBAAoB,GAAe,GAAgB;AACjE,QAAM,QAAQ,QAAQ,CAAC,EAAE,OAAO,CAAC,MAAM,YAAY,GAAG,CAAC,IAAI,CAAC,EAAE;AAC9D,MAAI,SAAS,EAAG,QAAO;AACvB,MAAI,SAAS,EAAG,QAAO;AACvB,SAAO,YAAY,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,QAAQ,GAAG,GAAG,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,KAAK,IAAI,IAAI;AACpF;AAGA,IAAM,eAAe,KAAK;AAcnB,SAAS,aAAa,SAA+B;AAC1D,QAAM,MAAM;AACZ,QAAM,KAAK,QAAQ,IAAI,CAAC,MAAM,EAAE,CAAC;AACjC,QAAM,KAAK,QAAQ,IAAI,CAAC,MAAM,EAAE,CAAC;AACjC,QAAM,KAAK,KAAK,MAAM,KAAK,IAAI,CAAC,KAAK,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC,IAAI;AACzD,QAAM,KAAK,KAAK,MAAM,KAAK,IAAI,CAAC,KAAK,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC,IAAI;AACzD,QAAM,KAAK,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC,IAAI;AACvD,QAAM,KAAK,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC,IAAI;AACvD,SAAO,EAAE,GAAG,IAAI,GAAG,IAAI,OAAO,KAAK,IAAI,QAAQ,KAAK,GAAG;AACzD;","names":[]}

package/dist/{chunk-TS5IEUW6.cjs → chunk-K7V27T72.cjs}

@@ -1,4 +1,4 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true}); function _nullishCoalesce(lhs, rhsFn) { if (lhs != null) { return lhs; } else { return rhsFn(); } } function _optionalChain(ops) { let lastAccessLHS = undefined; let value = ops[0]; let i = 1; while (i < ops.length) { const op = ops[i]; const fn = ops[i + 1]; i += 2; if ((op === 'optionalAccess' || op === 'optionalCall') && value == null) { return undefined; } if (op === 'access' || op === 'optionalAccess') { lastAccessLHS = value; value = fn(value); } else if (op === 'call' || op === 'optionalCall') { value = fn((...args) => value.call(lastAccessLHS, ...args)); lastAccessLHS = undefined; } } return value; } var _class; var _class2;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true}); function _nullishCoalesce(lhs, rhsFn) { if (lhs != null) { return lhs; } else { return rhsFn(); } } function _optionalChain(ops) { let lastAccessLHS = undefined; let value = ops[0]; let i = 1; while (i < ops.length) { const op = ops[i]; const fn = ops[i + 1]; i += 2; if ((op === 'optionalAccess' || op === 'optionalCall') && value == null) { return undefined; } if (op === 'access' || op === 'optionalAccess') { lastAccessLHS = value; value = fn(value); } else if (op === 'call' || op === 'optionalCall') { value = fn((...args) => value.call(lastAccessLHS, ...args)); lastAccessLHS = undefined; } } return value; } var _class; var _class2; var _class3;
 
 
 
@@ -18,8 +18,13 @@ var _chunkL3PXFMOFcjs = require('./chunk-L3PXFMOF.cjs');
 
 
 
+
+
 var _chunk7ISPWEJAcjs = require('./chunk-7ISPWEJA.cjs');
 
+
+var _chunkDCLJNVZScjs = require('./chunk-DCLJNVZS.cjs');
+
 // src/paint/heal.ts
 var TOL = 2e-3;
 var FINE_ITERS = 30;
@@ -937,6 +942,176 @@ function paintPathStroke(surface, samples, options) {
   return { surface: new (0, _chunk7ISPWEJAcjs.TiledSurface)(4, tiles, surface.defaultValue), bounds, dabs };
 }
 
+// src/paint/brushstroke.ts
+var DEFAULT_MAX_PIXELS = 4096 * 4096;
+var MIN_SCALE = 1 / 16;
+var MAX_SCALE = 16;
+var isProfilePath = (input) => !Array.isArray(input) && typeof input === "object" && input !== null && "points" in input;
+function profileAt(profile, f) {
+  if (!profile || !profile.length) return void 0;
+  if (profile.length === 1) return profile[0];
+  const u = Math.min(1, Math.max(0, f)) * (profile.length - 1);
+  const i = Math.min(profile.length - 2, Math.floor(u));
+  return profile[i] + (profile[i + 1] - profile[i]) * (u - i);
+}
+function brushstrokeSamples(input) {
+  if (!isProfilePath(input)) return input.map((s) => ({ ...s }));
+  const pts = input.points;
+  const lengths = [0];
+  for (let i = 1; i < pts.length; i++) lengths.push(lengths[i - 1] + Math.hypot(pts[i].x - pts[i - 1].x, pts[i].y - pts[i - 1].y));
+  const total = _nullishCoalesce(lengths.at(-1), () => ( 0));
+  return pts.map((p, i) => {
+    const f = total > 0 ? lengths[i] / total : pts.length > 1 ? i / (pts.length - 1) : 0;
+    const s = { x: p.x, y: p.y };
+    const pressure = profileAt(input.pressure, f);
+    const tiltX = profileAt(input.tiltX, f);
+    const tiltY = profileAt(input.tiltY, f);
+    if (pressure !== void 0) s.pressure = pressure;
+    if (tiltX !== void 0) s.tiltX = tiltX;
+    if (tiltY !== void 0) s.tiltY = tiltY;
+    return s;
+  });
+}
+var REFUSED_ENGINES = {
+  wet: "is a wet brush, and wet paint needs an area to flow in (paint it on a wet layer in the paint editor)",
+  mixer: "is a Mixer Brush, which picks up paint from under the tip and has none on a standalone stroke",
+  blender: "is a blender, which only moves paint that is already there",
+  smudge: "is a smudge brush, which only moves paint that is already there",
+  eraser: "is an eraser, which has nothing to remove on a standalone stroke"
+};
+function brushstrokeStrokeOptions(brush) {
+  if (!brush || typeof brush !== "object") throw new Error("A brushstroke needs a brush: tip settings ({ size, hardness, \u2026 }) or a paint brush preset.");
+  if (!("tip" in brush) || !brush.tip) return { brush: _chunkL3PXFMOFcjs.normalizeBrush.call(void 0, brush) };
+  const engine = _nullishCoalesce(brush.engine, () => ( "dab"));
+  if (engine !== "dab") {
+    const label = _nullishCoalesce(_nullishCoalesce(brush.name, () => ( brush.id)), () => ( "This brush"));
+    const why = _nullishCoalesce(REFUSED_ENGINES[engine], () => ( `uses the '${engine}' engine, which renderBrushstroke does not draw`));
+    throw new Error(`Brushstrokes render dry media only: '${label}' ${why}. Pick a dry brush (a dab-engine preset such as a pencil, pastel, charcoal, marker, ink or airbrush) or plain tip settings.`);
+  }
+  const d = _nullishCoalesce(brush.dynamics, () => ( {}));
+  const tilt = { size: _nullishCoalesce(d.tiltSize, () => ( 0)), roundness: _nullishCoalesce(d.tiltRoundness, () => ( 0)) };
+  return {
+    brush: _chunkL3PXFMOFcjs.normalizeBrush.call(void 0, brush.tip),
+    followPath: brush.rotation === "stroke",
+    minSize: _nullishCoalesce(d.minSize, () => ( 0)),
+    ...tilt.size || tilt.roundness ? { tilt } : {}
+  };
+}
+function isBrushstrokeBrush(brush) {
+  return !("tip" in brush) || !brush.tip || (_nullishCoalesce(brush.engine, () => ( "dab"))) === "dab";
+}
+function brushstrokeScaleBucket(zoom, devicePixelRatio = 1) {
+  const s = zoom * devicePixelRatio;
+  if (!Number.isFinite(s) || s <= 0) return 1;
+  const b = Math.pow(Math.SQRT2, Math.ceil(Math.log2(Math.min(MAX_SCALE, Math.max(MIN_SCALE, s))) * 2 - 1e-9));
+  return Math.min(MAX_SCALE, Math.max(MIN_SCALE, Math.round(b * 1e9) / 1e9));
+}
+var finite = (v) => typeof v === "number" && Number.isFinite(v);
+function renderBrushstroke(input, brush, options = {}) {
+  const strokeOptions = brushstrokeStrokeOptions(brush);
+  const samples = brushstrokeSamples(input);
+  for (const s of samples) if (!finite(s.x) || !finite(s.y)) throw new Error("Brushstroke samples need finite x and y.");
+  const color = _nullishCoalesce(_nullishCoalesce(_optionalChain([options, 'access', _7 => _7.paint, 'optionalAccess', _8 => _8.color]), () => ( options.color)), () => ( [0, 0, 0, 255]));
+  let scale = finite(options.scale) && options.scale > 0 ? Math.min(MAX_SCALE, Math.max(MIN_SCALE, options.scale)) : 1;
+  if (!samples.length) return { image: { width: 0, height: 0, data: new Uint8ClampedArray(0) }, bounds: null, scale, dabs: 0 };
+  const tip = strokeOptions.brush;
+  const reach = tip.size * (1 + 1.5 * (_nullishCoalesce(_optionalChain([strokeOptions, 'access', _9 => _9.tilt, 'optionalAccess', _10 => _10.size]), () => ( 0)))) + 4;
+  let x0 = Infinity, y0 = Infinity, x1 = -Infinity, y1 = -Infinity;
+  for (const s of samples) {
+    x0 = Math.min(x0, s.x);
+    y0 = Math.min(y0, s.y);
+    x1 = Math.max(x1, s.x);
+    y1 = Math.max(y1, s.y);
+  }
+  const maxPixels = finite(options.maxPixels) && options.maxPixels > 0 ? options.maxPixels : DEFAULT_MAX_PIXELS;
+  const area = (x1 - x0 + reach) * (y1 - y0 + reach);
+  if (area * scale * scale > maxPixels) scale = Math.max(MIN_SCALE, Math.sqrt(maxPixels / area));
+  const scaled = samples.map((s) => ({ ...s, x: s.x * scale, y: s.y * scale }));
+  const { surface, bounds, dabs } = paintPathStroke(_chunk7ISPWEJAcjs.emptySurface.call(void 0, 4), scaled, {
+    ...strokeOptions,
+    brush: { ...tip, size: tip.size * scale },
+    closed: _nullishCoalesce(options.closed, () => ( strokeOptions.closed)),
+    color
+  });
+  if (!bounds) return { image: { width: 0, height: 0, data: new Uint8ClampedArray(0) }, bounds: null, scale, dabs };
+  const rect = bounds;
+  const data = _chunk7ISPWEJAcjs.readRegion.call(void 0, surface, rect);
+  return {
+    image: { width: rect.width, height: rect.height, data },
+    bounds: { x: rect.x / scale, y: rect.y / scale, width: rect.width / scale, height: rect.height / scale },
+    scale,
+    dabs
+  };
+}
+function brushstrokeDataUrl(stroke) {
+  const { width, height, data } = stroke.image;
+  return width && height ? _chunkDCLJNVZScjs.pngDataUrl.call(void 0, width, height, data) : "";
+}
+function brushstrokeToCanvas(stroke, createCanvas) {
+  const { width, height, data } = stroke.image;
+  if (!width || !height) return null;
+  const canvas = createCanvas(width, height);
+  const ctx = canvas.getContext("2d");
+  if (!ctx) return null;
+  const img = ctx.createImageData(width, height);
+  img.data.set(data);
+  ctx.putImageData(img, 0, 0);
+  return canvas;
+}
+function hashString(s, h = 2166136261) {
+  for (let i = 0; i < s.length; i++) {
+    h ^= s.charCodeAt(i);
+    h = Math.imul(h, 16777619) >>> 0;
+  }
+  return h;
+}
+function brushstrokeKey(input, brush, options = {}) {
+  const path = JSON.stringify(input);
+  const { brush: tip, ...rest } = brushstrokeStrokeOptions(brush);
+  const rest2 = JSON.stringify([tip, rest, _nullishCoalesce(_nullishCoalesce(_optionalChain([options, 'access', _11 => _11.paint, 'optionalAccess', _12 => _12.color]), () => ( options.color)), () => ( null)), _nullishCoalesce(options.closed, () => ( false)), _nullishCoalesce(options.maxPixels, () => ( null))]);
+  const scale = finite(options.scale) ? options.scale : 1;
+  return `${hashString(path).toString(16)}:${path.length}:${hashString(rest2).toString(16)}:${scale}`;
+}
+var BrushstrokeCache = (_class3 = class {
+  constructor(capacity = 64) {;_class3.prototype.__init8.call(this);_class3.prototype.__init9.call(this);
+    this.capacity = capacity;
+  }
+  
+  __init8() {this.entries = /* @__PURE__ */ new Map()}
+  /** Renders that missed the cache (for tests and stats). */
+  __init9() {this.misses = 0}
+  get size() {
+    return this.entries.size;
+  }
+  /** The cached stroke for these arguments, rendering (and caching) it on a miss. */
+  render(input, brush, options = {}) {
+    const key = brushstrokeKey(input, brush, options);
+    const hit = this.entries.get(key);
+    if (hit) {
+      this.entries.delete(key);
+      this.entries.set(key, hit);
+      return hit;
+    }
+    this.misses++;
+    const out = renderBrushstroke(input, brush, options);
+    this.entries.set(key, out);
+    while (this.entries.size > Math.max(1, this.capacity)) this.entries.delete(this.entries.keys().next().value);
+    return out;
+  }
+  clear() {
+    this.entries.clear();
+  }
+}, _class3);
+
+
+
+
+
+
+
+
+
+
 
 
 
@@ -971,5 +1146,5 @@ function paintPathStroke(surface, samples, options) {
 
 
 
-exports.solveMembrane = solveMembrane; exports.seamlessClone = seamlessClone; exports.membraneFill = membraneFill; exports.dilateMask = dilateMask; exports.maskBounds = maskBounds; exports.bestOffset = bestOffset; exports.TONE_RANGES = TONE_RANGES; exports.luma = luma; exports.dodgeBurnCurve = dodgeBurnCurve; exports.dodgeBurn = dodgeBurn; exports.saturationOf = saturationOf; exports.sponge = sponge; exports.perDabStrength = perDabStrength; exports.RETOUCH_SAMPLES = RETOUCH_SAMPLES; exports.SPOT_HEAL_TYPES = SPOT_HEAL_TYPES; exports.DEFAULT_RETOUCH = DEFAULT_RETOUCH; exports.normalizeRetouch = normalizeRetouch; exports.TilePixelSource = TilePixelSource; exports.RegionPixelSource = RegionPixelSource; exports.readSourceRegion = readSourceRegion; exports.applyRetouchToTile = applyRetouchToTile; exports.applyToneToDeepTile = applyToneToDeepTile; exports.toneOf = toneOf; exports.healPixels = healPixels; exports.spotHealPixels = spotHealPixels; exports.spotHealWindow = spotHealWindow; exports.RetouchDabStroke = RetouchDabStroke; exports.smudgeEffect = smudgeEffect; exports.spongeEffect = spongeEffect; exports.rgbaViewOfGrey = rgbaViewOfGrey; exports.pathStrokeDabs = pathStrokeDabs; exports.pathStrokeCoverage = pathStrokeCoverage; exports.paintPathStroke = paintPathStroke;
-//# sourceMappingURL=chunk-TS5IEUW6.cjs.map
+exports.solveMembrane = solveMembrane; exports.seamlessClone = seamlessClone; exports.membraneFill = membraneFill; exports.dilateMask = dilateMask; exports.maskBounds = maskBounds; exports.bestOffset = bestOffset; exports.TONE_RANGES = TONE_RANGES; exports.luma = luma; exports.dodgeBurnCurve = dodgeBurnCurve; exports.dodgeBurn = dodgeBurn; exports.saturationOf = saturationOf; exports.sponge = sponge; exports.perDabStrength = perDabStrength; exports.RETOUCH_SAMPLES = RETOUCH_SAMPLES; exports.SPOT_HEAL_TYPES = SPOT_HEAL_TYPES; exports.DEFAULT_RETOUCH = DEFAULT_RETOUCH; exports.normalizeRetouch = normalizeRetouch; exports.TilePixelSource = TilePixelSource; exports.RegionPixelSource = RegionPixelSource; exports.readSourceRegion = readSourceRegion; exports.applyRetouchToTile = applyRetouchToTile; exports.applyToneToDeepTile = applyToneToDeepTile; exports.toneOf = toneOf; exports.healPixels = healPixels; exports.spotHealPixels = spotHealPixels; exports.spotHealWindow = spotHealWindow; exports.RetouchDabStroke = RetouchDabStroke; exports.smudgeEffect = smudgeEffect; exports.spongeEffect = spongeEffect; exports.rgbaViewOfGrey = rgbaViewOfGrey; exports.pathStrokeDabs = pathStrokeDabs; exports.pathStrokeCoverage = pathStrokeCoverage; exports.paintPathStroke = paintPathStroke; exports.brushstrokeSamples = brushstrokeSamples; exports.brushstrokeStrokeOptions = brushstrokeStrokeOptions; exports.isBrushstrokeBrush = isBrushstrokeBrush; exports.brushstrokeScaleBucket = brushstrokeScaleBucket; exports.renderBrushstroke = renderBrushstroke; exports.brushstrokeDataUrl = brushstrokeDataUrl; exports.brushstrokeToCanvas = brushstrokeToCanvas; exports.brushstrokeKey = brushstrokeKey; exports.BrushstrokeCache = BrushstrokeCache;
+//# sourceMappingURL=chunk-K7V27T72.cjs.map