@pixerate/editor 0.41.0 → 0.42.0

package/dist/vector/index.js

@@ -18,6 +18,7 @@ import {
   hatchPath,
   isStraightCubic,
   normalizeBezierPath,
+  offsetPath,
   outlineStroke,
   pathBoolean,
   pathToContours,
@@ -73,6 +74,8 @@ var VECTOR_TOOLS = [
 ];
 var VECTOR_TRANSFORM_HANDLES = ["nw", "n", "ne", "e", "se", "s", "sw", "w", "rotate"];
 var VECTOR_PATHFINDER_OPERATIONS = ["divide", "trim", "merge", "crop", "outline", "minusBack"];
+var VECTOR_EFFECT_TYPES = ["trim", "roundCorners", "puckerBloat", "twist", "zigzag", "wiggle", "offset", "merge", "repeater"];
+var VECTOR_MERGE_MODES = ["merge", "add", "subtract", "intersect", "exclude"];
 
 // src/vector/corners.ts
 var EPS = 1e-9;
@@ -1042,8 +1045,872 @@ function vectorStrokeReach(style) {
   return reach;
 }
 
-// src/vector/geometry.ts
+// src/vector/pathEffects.ts
 var EPS2 = 1e-9;
+var degenerate = (s) => s.every((p) => Math.abs(p[0] - s[0][0]) < EPS2 && Math.abs(p[1] - s[0][1]) < EPS2);
+function raise(seg) {
+  if (seg.length !== 3) return seg.map((p) => [p[0], p[1]]);
+  const [p0, p1, p2] = seg;
+  return [p0, [p0[0] + 2 / 3 * (p1[0] - p0[0]), p0[1] + 2 / 3 * (p1[1] - p0[1])], [p2[0] + 2 / 3 * (p1[0] - p2[0]), p2[1] + 2 / 3 * (p1[1] - p2[1])], p2];
+}
+function subsOf(path) {
+  return pathToContours(path).map((c) => ({ segs: closeContour(c).filter((s) => !degenerate(s)).map(raise), closed: c.closed })).filter((s) => s.segs.length > 0);
+}
+var subsToPath = (subs) => contoursToPath(subs.map((s) => ({ segments: s.segs, closed: s.closed })));
+var unit2 = (x, y) => {
+  const l = Math.hypot(x, y);
+  return l > 1e-12 && Number.isFinite(l) ? [x / l, y / l] : null;
+};
+function startTangent(s) {
+  for (let i = 1; i < s.length; i++) {
+    const u = unit2(s[i][0] - s[0][0], s[i][1] - s[0][1]);
+    if (u) return u;
+  }
+  return [1, 0];
+}
+function endTangent(s) {
+  const end = s[s.length - 1];
+  for (let i = s.length - 2; i >= 0; i--) {
+    const u = unit2(end[0] - s[i][0], end[1] - s[i][1]);
+    if (u) return u;
+  }
+  return [1, 0];
+}
+function tangentAt(s, t) {
+  if (t <= 1e-9) return startTangent(s);
+  if (t >= 1 - 1e-9) return endTangent(s);
+  const d = segmentDerivative(s, t);
+  return unit2(d[0], d[1]) ?? startTangent(s);
+}
+var perp = (v2) => [-v2[1], v2[0]];
+function effectPathLength(path) {
+  let total = 0;
+  for (const s of subsOf(path)) for (const seg of s.segs) total += segmentLength(seg);
+  return total;
+}
+function effectPathVertexCount(path) {
+  return subsOf(path).reduce((n, s) => n + s.segs.length + (s.closed ? 0 : 1), 0);
+}
+var Measured = class {
+  segs;
+  lens;
+  total;
+  constructor(path) {
+    this.segs = subsOf(path).flatMap((s) => s.segs);
+    this.lens = this.segs.map((s) => segmentLength(s));
+    this.total = this.lens.reduce((a, b) => a + b, 0);
+  }
+  /**
+   * Appends the part between lengths `sa` and `sb`, continuing the last piece when this one
+   * starts where it ends (across the start of a closed path).
+   */
+  append(sa, sb, out) {
+    for (const piece of trimSegments(this.segs, sa, sb, this.lens)) {
+      if (degenerate(piece)) continue;
+      const last = out[out.length - 1]?.segs;
+      const end = last?.[last.length - 1]?.at(-1);
+      if (!end || Math.hypot(end[0] - piece[0][0], end[1] - piece[0][1]) > 1e-6) out.push({ segs: [piece], closed: false });
+      else last.push(piece);
+    }
+  }
+};
+function trimIntervals(start, end, offsetDegrees) {
+  let s = start / 100;
+  let e = end / 100;
+  if (!Number.isFinite(s) || !Number.isFinite(e)) return null;
+  if (s > e) [s, e] = [e, s];
+  s = Math.min(1, Math.max(0, s));
+  e = Math.min(1, Math.max(0, e));
+  if (e - s >= 1 - 1e-9) return null;
+  if (e - s <= 1e-9) return [];
+  const off = Number.isFinite(offsetDegrees) ? (offsetDegrees / 360 % 1 + 1) % 1 : 0;
+  s += off;
+  e += off;
+  if (e <= 1) return [[s, e]];
+  if (s >= 1) return [[s - 1, e - 1]];
+  return [
+    [s, 1],
+    [0, e - 1]
+  ];
+}
+function trimPaths(paths, start, end, offsetDegrees = 0) {
+  const iv = trimIntervals(start, end, offsetDegrees);
+  if (!iv) return paths.slice();
+  return paths.map((p) => {
+    const m = new Measured(p);
+    const out = [];
+    if (m.total > 0) for (const [a, b] of iv) m.append(a * m.total, b * m.total, out);
+    return subsToPath(out);
+  });
+}
+function trimPathsIndividually(paths, start, end, offsetDegrees = 0) {
+  const iv = trimIntervals(start, end, offsetDegrees);
+  if (!iv) return paths.slice();
+  const ms = paths.map((p) => new Measured(p));
+  const total = ms.reduce((n, m) => n + m.total, 0);
+  let base = 0;
+  return ms.map((m) => {
+    const out = [];
+    for (const [a, b] of iv) {
+      const la = Math.max(0, a * total - base);
+      const lb = Math.min(m.total, b * total - base);
+      if (lb > la) m.append(la, lb, out);
+    }
+    base += m.total;
+    return subsToPath(out);
+  });
+}
+function puckerBloatPaths(paths, amount) {
+  const a = amount / 100;
+  if (!a || !Number.isFinite(a)) return paths.slice();
+  return paths.map((p) => {
+    const verts = p.filter((c) => c.type !== "Z");
+    if (!verts.length) return p;
+    const cx = verts.reduce((s, c) => s + c.x, 0) / verts.length;
+    const cy = verts.reduce((s, c) => s + c.y, 0) / verts.length;
+    const mv = (x, y) => ({ x: x + (cx - x) * a, y: y + (cy - y) * a });
+    const mvh = (x, y) => ({ x: x + (x - cx) * a, y: y + (y - cy) * a });
+    const out = [];
+    let prev = { x: 0, y: 0 };
+    let start = { x: 0, y: 0 };
+    const curve = (c1, c2, q) => {
+      const h1 = mvh(c1.x, c1.y);
+      const h2 = mvh(c2.x, c2.y);
+      const e = mv(q.x, q.y);
+      out.push({ type: "C", x1: h1.x, y1: h1.y, x2: h2.x, y2: h2.y, x: e.x, y: e.y });
+    };
+    for (const c of p) {
+      switch (c.type) {
+        case "M": {
+          const e = mv(c.x, c.y);
+          out.push({ type: "M", x: e.x, y: e.y });
+          prev = start = { x: c.x, y: c.y };
+          break;
+        }
+        case "L":
+          curve(prev, c, c);
+          prev = { x: c.x, y: c.y };
+          break;
+        case "Q": {
+          const c1 = { x: prev.x + 2 / 3 * (c.x1 - prev.x), y: prev.y + 2 / 3 * (c.y1 - prev.y) };
+          const c2 = { x: c.x + 2 / 3 * (c.x1 - c.x), y: c.y + 2 / 3 * (c.y1 - c.y) };
+          curve(c1, c2, c);
+          prev = { x: c.x, y: c.y };
+          break;
+        }
+        case "C":
+          curve({ x: c.x1, y: c.y1 }, { x: c.x2, y: c.y2 }, c);
+          prev = { x: c.x, y: c.y };
+          break;
+        case "Z":
+          if (Math.hypot(prev.x - start.x, prev.y - start.y) > EPS2) curve(prev, start, start);
+          out.push({ type: "Z" });
+          prev = start;
+          break;
+      }
+    }
+    return out;
+  });
+}
+function roundCornerPaths(paths, radius) {
+  if (!(radius > 0) || !Number.isFinite(radius)) return paths.slice();
+  return paths.map((p) => subpathsToBezier(bezierToSubpaths(p).map((sp) => setSubpathCorners(sp, radius))));
+}
+function offsetPaths(paths, amount, join = "miter", miterLimit = 4, copies = 1, copyOffset = 0) {
+  const n = Math.min(1e3, Math.max(1, Math.round(Number.isFinite(copies) ? copies : 1)));
+  return paths.map((p) => {
+    const out = [];
+    for (let i = 0; i < n; i++) out.push(...offsetPath(p, amount * (i + 1 + copyOffset), { join, miterLimit }));
+    return out;
+  });
+}
+function twistPaths(paths, angle, center) {
+  let rmax = 0;
+  for (const p of paths) for (const c of p) if (c.type !== "Z") rmax = Math.max(rmax, Math.hypot(c.x - center.x, c.y - center.y));
+  const a = angle * Math.PI / 180;
+  if (!a || rmax <= 1e-9 || !Number.isFinite(a)) return paths.slice();
+  const k = a / rmax;
+  const rot = (v2, th) => {
+    const s = Math.sin(th);
+    const co = Math.cos(th);
+    return [v2[0] * co - v2[1] * s, v2[0] * s + v2[1] * co];
+  };
+  const map = (p) => {
+    const v2 = [p[0] - center.x, p[1] - center.y];
+    const r = rot(v2, k * Math.hypot(v2[0], v2[1]));
+    return [center.x + r[0], center.y + r[1]];
+  };
+  const jac = (p, dv) => {
+    const v2 = [p[0] - center.x, p[1] - center.y];
+    const r = Math.hypot(v2[0], v2[1]);
+    let w = dv;
+    if (r > 1e-12) {
+      const f = k * (v2[0] * dv[0] + v2[1] * dv[1]) / r;
+      w = [dv[0] - v2[1] * f, dv[1] + v2[0] * f];
+    }
+    return rot(w, k * r);
+  };
+  return paths.map((p) => {
+    const out = [];
+    for (const sub3 of subsOf(p)) {
+      const segs = [];
+      for (const seg of sub3.segs) {
+        const cubic = seg.length === 2 ? [seg[0], seg[0], seg[1], seg[1]] : seg;
+        const len2 = segmentLength(seg);
+        const m = Math.min(64, Math.max(1, Math.ceil(Math.abs(a) * len2 / rmax / 0.15 + len2 / 50)));
+        for (let i = 0; i < m; i++) {
+          const q = subSegment(cubic, i / m, (i + 1) / m);
+          const p0 = map(q[0]);
+          const p3 = map(q[3]);
+          const h1 = jac(q[0], [q[1][0] - q[0][0], q[1][1] - q[0][1]]);
+          const h2 = jac(q[3], [q[2][0] - q[3][0], q[2][1] - q[3][1]]);
+          segs.push([p0, [p0[0] + h1[0], p0[1] + h1[1]], [p3[0] + h2[0], p3[1] + h2[1]], p3]);
+        }
+      }
+      out.push({ segs, closed: sub3.closed });
+    }
+    return subsToPath(out);
+  });
+}
+function resample(sub3, m) {
+  const segs = sub3.segs;
+  const n = segs.length;
+  const lens = segs.map((s) => segmentLength(s));
+  const out = [];
+  for (let j = 0; j < n; j++) {
+    const piece = lens[j] / m;
+    for (let k = 0; k < m; k++) {
+      if (k === 0) {
+        const tout = startTangent(segs[j]);
+        const prev = sub3.closed || j > 0 ? (j + n - 1) % n : null;
+        let tan = tout;
+        if (prev !== null) {
+          const tin = endTangent(segs[prev]);
+          tan = unit2(tin[0] + tout[0], tin[1] + tout[1]) ?? tout;
+        }
+        out.push({ p: segs[j][0], tan, lenPrev: prev === null ? 0 : lens[prev] / m, lenNext: piece });
+      } else {
+        const t = segmentParamAtLength(segs[j], piece * k, lens[j]);
+        out.push({ p: segmentPoint(segs[j], t), tan: tangentAt(segs[j], t), lenPrev: piece, lenNext: piece });
+      }
+    }
+  }
+  if (!sub3.closed) {
+    const last = segs[n - 1];
+    out.push({ p: last[last.length - 1], tan: endTangent(last), lenPrev: lens[n - 1] / m, lenNext: 0 });
+  }
+  return out;
+}
+function emit(samples, disp, closed, smooth, handle) {
+  const n = samples.length;
+  if (!n) return null;
+  const pt2 = (i) => [samples[i].p[0] + disp[i][0], samples[i].p[1] + disp[i][1]];
+  const segs = [];
+  const count = closed ? n : n - 1;
+  for (let i = 0; i < count; i++) {
+    const j = (i + 1) % n;
+    const a = samples[i];
+    const b = samples[j];
+    const p = pt2(i);
+    const q = pt2(j);
+    if (smooth) segs.push([p, [p[0] + a.tan[0] * a.lenNext * handle, p[1] + a.tan[1] * a.lenNext * handle], [q[0] - b.tan[0] * b.lenPrev * handle, q[1] - b.tan[1] * b.lenPrev * handle], q]);
+    else segs.push([p, q]);
+  }
+  if (!segs.length) return null;
+  return { segs, closed };
+}
+function zigzagPaths(paths, size, ridges, smooth = false) {
+  const m = Math.min(1e3, Math.max(0, Math.round(Number.isFinite(ridges) ? ridges : 0))) + 1;
+  return paths.map((p) => {
+    const out = [];
+    for (const sub3 of subsOf(p)) {
+      const s = resample(sub3, m);
+      const disp = s.map((x, i) => {
+        const n = perp(x.tan);
+        const d = i % 2 === 0 ? size : -size;
+        return [n[0] * d, n[1] * d];
+      });
+      const e = emit(s, disp, sub3.closed, smooth, 0.36);
+      if (e) out.push(e);
+    }
+    return subsToPath(out);
+  });
+}
+var MASK64 = (1n << 64n) - 1n;
+function splitmix(x) {
+  x = x + 0x9e3779b97f4a7c15n & MASK64;
+  let z = x;
+  z = (z ^ z >> 30n) * 0xbf58476d1ce4e5b9n & MASK64;
+  z = (z ^ z >> 27n) * 0x94d049bb133111ebn & MASK64;
+  return z ^ z >> 31n;
+}
+function hash(seed, idx, t) {
+  const h = splitmix(splitmix(splitmix(seed) ^ idx) ^ BigInt.asUintN(64, BigInt(t)));
+  return Number(h >> 11n) / 2 ** 53 * 2 - 1;
+}
+function noise(seed, idx, t) {
+  const i = Math.floor(t);
+  const f = t - i;
+  const p0 = hash(seed, idx, i - 1);
+  const p1 = hash(seed, idx, i);
+  const p2 = hash(seed, idx, i + 1);
+  const p3 = hash(seed, idx, i + 2);
+  const v2 = 0.5 * (2 * p1 + (-p0 + p2) * f + (2 * p0 - 5 * p1 + 4 * p2 - p3) * f * f + (-p0 + 3 * p1 - 3 * p2 + p3) * f * f * f);
+  return Math.min(1, Math.max(-1, v2));
+}
+function wigglePaths(paths, w) {
+  if (!w.size || !Number.isFinite(w.size)) return paths.slice();
+  const m = Math.min(1e3, Math.max(0, Math.round(Number.isFinite(w.detail) ? w.detail : 0))) + 1;
+  const seed = BigInt.asUintN(64, BigInt(Math.round(Number.isFinite(w.seed) ? w.seed : 0)));
+  const t = (Number.isFinite(w.time) ? w.time : 0) * (Number.isFinite(w.speed) ? w.speed : 0) + (Number.isFinite(w.phase) ? w.phase : 0) / 360;
+  const corr = Math.min(1, Math.max(0, (Number.isFinite(w.correlation) ? w.correlation : 0) / 100));
+  const sx = noise(seed, MASK64, t);
+  const sy = noise(seed, MASK64 - 1n, t);
+  let idx = 0;
+  return paths.map((p) => {
+    const out = [];
+    for (const sub3 of subsOf(p)) {
+      const s = resample(sub3, m);
+      const disp = s.map(() => {
+        const i = BigInt(idx);
+        const ox = noise(seed, i * 2n, t + idx * 0.37);
+        const oy = noise(seed, i * 2n + 1n, t + idx * 0.61);
+        idx++;
+        return [(sx * corr + ox * (1 - corr)) * w.size, (sy * corr + oy * (1 - corr)) * w.size];
+      });
+      const e = emit(s, disp, sub3.closed, w.smooth, 1 / 3);
+      if (e) out.push(e);
+    }
+    return subsToPath(out);
+  });
+}
+var MERGE_OPS = { add: "union", subtract: "difference", intersect: "intersection", exclude: "xor" };
+function mergePaths(paths, mode = "merge") {
+  if (mode === "merge" || !(mode in MERGE_OPS)) return paths.flat();
+  const inputs = paths.filter((p) => p.length > 0).map((path) => ({ path, fillRule: "nonzero" }));
+  if (!inputs.length) return [];
+  return pathBoolean(MERGE_OPS[mode], inputs).path;
+}
+function vectorRepeaterCopies(r, pivot) {
+  const copies = Math.max(0, Number.isFinite(r.copies) ? Math.min(r.copies, 1e3) : 0);
+  const n = Math.ceil(copies);
+  const offset = Number.isFinite(r.offset) ? r.offset : 0;
+  const so = (r.startOpacity ?? 100) / 100;
+  const eo = (r.endOpacity ?? 100) / 100;
+  const fract = copies - Math.floor(copies);
+  const out = [];
+  for (let i = 0; i < n; i++) {
+    const k = i + offset;
+    let m = translateMatrix(-pivot.x, -pivot.y);
+    m = multiplyMatrices(m, scaleMatrix(Math.pow((r.scale?.x ?? 100) / 100, k), Math.pow((r.scale?.y ?? 100) / 100, k)));
+    m = multiplyMatrices(m, rotateMatrix((r.rotation ?? 0) * k));
+    m = multiplyMatrices(m, translateMatrix(pivot.x + (r.position?.x ?? 0) * k, pivot.y + (r.position?.y ?? 0) * k));
+    const t = n > 1 ? i / (n - 1) : 0;
+    const partial = i + 1 === n && fract > 0 ? fract : 1;
+    out.push({ index: i, matrix: m, opacity: Math.min(1, Math.max(0, (so + (eo - so) * t) * partial)) });
+  }
+  return out;
+}
+function repeatPaths(paths, r, pivot) {
+  return vectorRepeaterCopies(r, pivot).map((copy) => ({ copy, paths: paths.map((p) => transformBezierPath(p, copy.matrix)) }));
+}
+function pathsCenter(paths) {
+  const b = bezierPathBounds(paths.flat());
+  return b ? { x: (b.minX + b.maxX) / 2, y: (b.minY + b.maxY) / 2 } : { x: 0, y: 0 };
+}
+
+// src/vector/appearance.ts
+var VECTOR_EFFECT_DEFAULTS = {
+  trim: { start: 0, end: 50, offset: 0, mode: "simultaneous" },
+  roundCorners: { radius: 10 },
+  puckerBloat: { amount: 30 },
+  twist: { angle: 45, center: { x: 0, y: 0 } },
+  zigzag: { size: 5, ridges: 4, smooth: false },
+  wiggle: { size: 5, detail: 6, smooth: true, speed: 2, correlation: 50, phase: 0, seed: 1, time: 0 },
+  offset: { amount: 5, join: "miter", miterLimit: 4, copies: 1, copyOffset: 0 },
+  merge: { mode: "add" },
+  repeater: {
+    copies: 3,
+    offset: 0,
+    position: { x: 100, y: 0 },
+    anchor: { x: 0, y: 0 },
+    rotation: 0,
+    scale: { x: 100, y: 100 },
+    startOpacity: 100,
+    endOpacity: 100,
+    composite: "below"
+  }
+};
+var VECTOR_EFFECT_LABELS = {
+  trim: "Trim Paths",
+  roundCorners: "Round Corners",
+  puckerBloat: "Pucker & Bloat",
+  twist: "Twist",
+  zigzag: "Zig Zag",
+  wiggle: "Wiggle Paths",
+  offset: "Offset Paths",
+  merge: "Merge Paths",
+  repeater: "Repeater"
+};
+var VECTOR_EFFECT_PARAM_SPECS = {
+  trim: [
+    { key: "start", label: "Start %", kind: "number", min: 0, max: 100, step: 1, slider: true },
+    { key: "end", label: "End %", kind: "number", min: 0, max: 100, step: 1, slider: true },
+    { key: "offset", label: "Offset \xB0", kind: "number", min: -360, max: 360, step: 1, slider: true },
+    {
+      key: "mode",
+      label: "Paths",
+      kind: "select",
+      options: [
+        { value: "simultaneous", label: "Simultaneously" },
+        { value: "individual", label: "Individually" }
+      ]
+    }
+  ],
+  roundCorners: [{ key: "radius", label: "Radius", kind: "number", min: 0, max: 200, step: 1, slider: true }],
+  puckerBloat: [{ key: "amount", label: "Amount %", kind: "number", min: -100, max: 100, step: 1, slider: true }],
+  twist: [
+    { key: "angle", label: "Angle \xB0", kind: "number", min: -720, max: 720, step: 1, slider: true },
+    { key: "center", label: "Centre", kind: "vec2", step: 1 }
+  ],
+  zigzag: [
+    { key: "size", label: "Size", kind: "number", min: 0, max: 100, step: 0.5, slider: true },
+    { key: "ridges", label: "Ridges", kind: "number", min: 0, max: 50, step: 1, slider: true },
+    { key: "smooth", label: "Smooth", kind: "boolean" }
+  ],
+  wiggle: [
+    { key: "size", label: "Size", kind: "number", min: 0, max: 100, step: 0.5, slider: true },
+    { key: "detail", label: "Detail", kind: "number", min: 0, max: 50, step: 1, slider: true },
+    { key: "smooth", label: "Smooth", kind: "boolean" },
+    { key: "correlation", label: "Correlation %", kind: "number", min: 0, max: 100, step: 1, slider: true },
+    { key: "speed", label: "Speed", kind: "number", min: 0, step: 0.1 },
+    { key: "phase", label: "Phase \xB0", kind: "number", step: 1 },
+    { key: "time", label: "Time (s)", kind: "number", min: 0, max: 10, step: 0.05, slider: true },
+    { key: "seed", label: "Seed", kind: "number", step: 1 }
+  ],
+  offset: [
+    { key: "amount", label: "Amount", kind: "number", min: -100, max: 100, step: 0.5, slider: true },
+    {
+      key: "join",
+      label: "Join",
+      kind: "select",
+      options: [
+        { value: "miter", label: "Miter" },
+        { value: "round", label: "Round" },
+        { value: "bevel", label: "Bevel" }
+      ]
+    },
+    { key: "miterLimit", label: "Miter limit", kind: "number", min: 1, step: 0.5 },
+    { key: "copies", label: "Copies", kind: "number", min: 1, max: 20, step: 1 },
+    { key: "copyOffset", label: "Copy offset", kind: "number", step: 0.5 }
+  ],
+  merge: [
+    {
+      key: "mode",
+      label: "Mode",
+      kind: "select",
+      options: [
+        { value: "merge", label: "Merge" },
+        { value: "add", label: "Add" },
+        { value: "subtract", label: "Subtract" },
+        { value: "intersect", label: "Intersect" },
+        { value: "exclude", label: "Exclude" }
+      ]
+    }
+  ],
+  repeater: [
+    { key: "copies", label: "Copies", kind: "number", min: 0, max: 50, step: 0.1, slider: true },
+    { key: "offset", label: "Offset", kind: "number", min: -10, max: 10, step: 0.1, slider: true },
+    { key: "position", label: "Position", kind: "vec2", step: 1 },
+    { key: "anchor", label: "Anchor", kind: "vec2", step: 1 },
+    { key: "rotation", label: "Rotation \xB0", kind: "number", min: -360, max: 360, step: 1, slider: true },
+    { key: "scale", label: "Scale %", kind: "vec2", step: 1 },
+    { key: "startOpacity", label: "Start opacity %", kind: "number", min: 0, max: 100, step: 1, slider: true },
+    { key: "endOpacity", label: "End opacity %", kind: "number", min: 0, max: 100, step: 1, slider: true },
+    {
+      key: "composite",
+      label: "Copies",
+      kind: "select",
+      options: [
+        { value: "below", label: "Below" },
+        { value: "above", label: "Above" }
+      ]
+    }
+  ]
+};
+var isVec2 = (v2) => !!v2 && typeof v2 === "object" && Number.isFinite(v2.x) && Number.isFinite(v2.y);
+function normalizeVectorEffectParams(type, params, base) {
+  const defaults = VECTOR_EFFECT_DEFAULTS[type];
+  if (!defaults) return null;
+  const out = { ...defaults, ...base ?? {} };
+  for (const spec of VECTOR_EFFECT_PARAM_SPECS[type]) {
+    const v2 = params?.[spec.key];
+    if (v2 === void 0) continue;
+    if (spec.kind === "number" && typeof v2 === "number" && Number.isFinite(v2)) out[spec.key] = Math.min(spec.max ?? Infinity, Math.max(spec.min ?? -Infinity, v2));
+    else if (spec.kind === "boolean" && typeof v2 === "boolean") out[spec.key] = v2;
+    else if (spec.kind === "vec2" && isVec2(v2)) out[spec.key] = { x: v2.x, y: v2.y };
+    else if (spec.kind === "select" && spec.options.some((o) => o.value === v2)) out[spec.key] = v2;
+  }
+  return out;
+}
+function createVectorEffect(type, id, params) {
+  const p = normalizeVectorEffectParams(type, params);
+  return p ? { id, type, params: p } : null;
+}
+var isEnabled = (e) => e.enabled !== false && !!VECTOR_EFFECT_DEFAULTS[e.type];
+function activeVectorEffects(node) {
+  return node.effects?.filter(isEnabled) ?? [];
+}
+function hasOwnVectorAppearance(node) {
+  return node.type === "group" && !!node.liveBoolean || !!node.effects?.some(isEnabled);
+}
+var liveCache = /* @__PURE__ */ new WeakMap();
+function hasVectorAppearance(node) {
+  let v2 = liveCache.get(node);
+  if (v2 === void 0) {
+    v2 = hasOwnVectorAppearance(node) || node.type === "group" && node.children.some(hasVectorAppearance);
+    liveCache.set(node, v2);
+  }
+  return v2;
+}
+function isVectorLiveBoolean(node) {
+  return node?.type === "group" && !!node.liveBoolean;
+}
+function vectorOperandOperation(group, child) {
+  return child.booleanOperation ?? group.liveBoolean ?? "union";
+}
+var PATH_OPS = { union: "union", subtract: "difference", intersect: "intersection", exclude: "xor" };
+var FoldCache = class {
+  constructor(cap) {
+    this.cap = cap;
+  }
+  cap;
+  map = /* @__PURE__ */ new Map();
+  get(key) {
+    const hit = this.map.get(key);
+    if (hit) {
+      this.map.delete(key);
+      this.map.set(key, hit);
+    }
+    return hit;
+  }
+  set(key, path) {
+    if (this.map.size >= this.cap) {
+      let drop = Math.floor(this.map.size / 2);
+      for (const k of this.map.keys()) {
+        if (drop-- <= 0) break;
+        this.map.delete(k);
+      }
+    }
+    this.map.set(key, path);
+  }
+  clear() {
+    this.map.clear();
+  }
+};
+var foldCache = new FoldCache(4096);
+var foldSteps = 0;
+function vectorLiveBooleanSteps() {
+  return foldSteps;
+}
+function clearVectorLiveBooleanCache() {
+  foldCache.clear();
+}
+var RollingHash = class _RollingHash {
+  a = 2166136261;
+  b = 16777619 ^ 1540483477;
+  static view = new DataView(new ArrayBuffer(8));
+  byte(v2) {
+    this.a = Math.imul(this.a ^ v2 & 255, 16777619);
+    this.b = Math.imul(this.b ^ v2 & 255, 1540483477) ^ this.b >>> 15;
+  }
+  num(n) {
+    _RollingHash.view.setFloat64(0, n);
+    for (let i = 0; i < 8; i++) this.byte(_RollingHash.view.getUint8(i));
+  }
+  path(p) {
+    for (const c of p) {
+      this.byte(c.type.charCodeAt(0));
+      if (c.type === "Z") continue;
+      if (c.type === "C") {
+        this.num(c.x1);
+        this.num(c.y1);
+        this.num(c.x2);
+        this.num(c.y2);
+      } else if (c.type === "Q") {
+        this.num(c.x1);
+        this.num(c.y1);
+      }
+      this.num(c.x);
+      this.num(c.y);
+    }
+  }
+  key() {
+    return `${(this.a >>> 0).toString(36)}.${(this.b >>> 0).toString(36)}`;
+  }
+};
+function foldVectorBooleanOperands(operands) {
+  if (!operands.length) return [];
+  if (operands.length === 1) return operands[0].path;
+  const h = new RollingHash();
+  const keys = operands.map((o, i) => {
+    if (i > 0) h.byte(o.operation.charCodeAt(0) + o.operation.length);
+    h.byte(o.fillRule === "evenodd" ? 1 : 0);
+    h.path(o.path);
+    h.byte(9);
+    return h.key();
+  });
+  let start = 0;
+  let acc = operands[0].path;
+  for (let i = keys.length - 1; i >= 1; i--) {
+    const hit = foldCache.get(keys[i]);
+    if (hit) {
+      if (i === keys.length - 1) return hit;
+      start = i;
+      acc = hit;
+      break;
+    }
+  }
+  let accRule = start === 0 ? operands[0].fillRule : "nonzero";
+  for (let i = start + 1; i < operands.length; i++) {
+    const o = operands[i];
+    foldSteps++;
+    const r = pathBoolean(PATH_OPS[o.operation] ?? "union", [
+      { path: acc, fillRule: accRule },
+      { path: o.path, fillRule: o.fillRule }
+    ]);
+    if (r.error) return [];
+    acc = r.path;
+    accRule = "nonzero";
+    foldCache.set(keys[i], acc);
+  }
+  return acc;
+}
+var compareOrder = (a, b) => {
+  const n = Math.min(a.length, b.length);
+  for (let i = 0; i < n; i++) if (a[i] !== b[i]) return a[i] - b[i];
+  return a.length - b.length;
+};
+var add2 = (a, b) => ({ x: a.x + (b?.x ?? 0), y: a.y + (b?.y ?? 0) });
+var mapPaths = (shapes, fn) => {
+  const out = fn(shapes.map((s) => s.path));
+  return shapes.map((s, i) => ({ ...s, path: out[i] ?? [] }));
+};
+function applyVectorEffects(shapes, effects) {
+  let list = shapes.slice();
+  for (const e of effects ?? []) {
+    if (!isEnabled(e) || !list.length) continue;
+    switch (e.type) {
+      case "trim": {
+        const { start, end, offset, mode } = e.params;
+        list = mapPaths(list, (p) => mode === "individual" ? trimPathsIndividually(p, start, end, offset) : trimPaths(p, start, end, offset));
+        break;
+      }
+      case "roundCorners":
+        list = mapPaths(list, (p) => roundCornerPaths(p, e.params.radius));
+        break;
+      case "puckerBloat":
+        list = mapPaths(list, (p) => puckerBloatPaths(p, e.params.amount));
+        break;
+      case "twist":
+        list = mapPaths(list, (p) => twistPaths(p, e.params.angle, add2(pathsCenter(p), e.params.center)));
+        break;
+      case "zigzag":
+        list = mapPaths(list, (p) => zigzagPaths(p, e.params.size, e.params.ridges, e.params.smooth));
+        break;
+      case "wiggle":
+        list = mapPaths(list, (p) => wigglePaths(p, e.params));
+        break;
+      case "offset": {
+        const o = e.params;
+        list = mapPaths(list, (p) => offsetPaths(p, o.amount, o.join, o.miterLimit, o.copies, o.copyOffset));
+        break;
+      }
+      case "merge": {
+        const first = list[0];
+        list = [{ ...first, path: mergePaths(list.map((s) => s.path), e.params.mode) }];
+        break;
+      }
+      case "repeater": {
+        const r = e.params;
+        const copies = repeatPaths(
+          list.map((s) => s.path),
+          r,
+          add2(pathsCenter(list.map((s) => s.path)), r.anchor)
+        );
+        const n = copies.length;
+        const next = [];
+        for (const { copy, paths } of copies) {
+          const rank = r.composite === "above" ? copy.index : n - 1 - copy.index;
+          list.forEach((s, i) => next.push({ source: s.source, path: paths[i], opacity: s.opacity * copy.opacity, order: [rank, ...s.order] }));
+        }
+        list = next;
+        break;
+      }
+    }
+  }
+  return list;
+}
+function childShapes(child, index) {
+  if (child.visible === false) return [];
+  const m = child.transform;
+  const k = child.opacity ?? 1;
+  return vectorAppearanceShapes(child).map((s) => ({
+    source: s.source,
+    path: m && !isIdentityMatrix(m) ? transformBezierPath(s.path, m) : s.path,
+    opacity: s.opacity * k,
+    order: [index, ...s.order]
+  }));
+}
+function liveBooleanShapes(group) {
+  const operands = [];
+  let source = null;
+  group.children.forEach((child, i) => {
+    const shapes = childShapes(child, i);
+    if (!shapes.length) return;
+    source ??= shapes[0].source;
+    const path = shapes.length === 1 ? shapes[0].path : pathBoolean("union", shapes.map((s) => ({ path: s.path, fillRule: s.source.fillRule ?? "nonzero" }))).path;
+    const fillRule = shapes.length === 1 ? shapes[0].source.fillRule ?? "nonzero" : "nonzero";
+    operands.push({ path, fillRule, operation: vectorOperandOperation(group, child) });
+  });
+  if (!source) return [];
+  return [{ source, path: foldVectorBooleanOperands(operands), opacity: 1, order: [0] }];
+}
+var shapeCache = /* @__PURE__ */ new WeakMap();
+function vectorAppearanceShapes(node) {
+  const hit = shapeCache.get(node);
+  if (hit) return hit;
+  let base;
+  if (node.type === "path") base = [{ source: node, path: subpathsToBezier(node.subpaths), opacity: 1, order: [] }];
+  else if (node.liveBoolean) base = liveBooleanShapes(node);
+  else base = node.children.flatMap((c, i) => childShapes(c, i));
+  const out = applyVectorEffects(base, node.effects).sort((a, b) => compareOrder(a.order, b.order));
+  shapeCache.set(node, out);
+  return out;
+}
+var outlineCache = /* @__PURE__ */ new WeakMap();
+function vectorAppearanceOutline(node) {
+  let hit = outlineCache.get(node);
+  if (!hit) {
+    hit = node.type === "path" && !hasOwnVectorAppearance(node) ? subpathsToBezier(node.subpaths) : vectorAppearanceShapes(node).flatMap((s) => s.path);
+    outlineCache.set(node, hit);
+  }
+  return hit;
+}
+function shapeNode(shape, id) {
+  const {
+    id: _id,
+    type: _type,
+    subpaths: _s,
+    transform: _t,
+    effects: _e,
+    booleanOperation: _b,
+    blendStep: _bs,
+    locked: _l,
+    visible: _v,
+    opacity: _o,
+    ...style
+  } = shape.source;
+  return { ...style, id, type: "path", subpaths: bezierToSubpaths(shape.path), ...shape.opacity < 1 ? { opacity: shape.opacity } : {} };
+}
+function placement(node) {
+  return {
+    ...node.name !== void 0 ? { name: node.name } : {},
+    ...node.transform ? { transform: node.transform } : {},
+    ...node.visible === false ? { visible: false } : {},
+    ...node.locked ? { locked: true } : {},
+    ...node.blendStep ? { blendStep: true } : {},
+    ...node.booleanOperation ? { booleanOperation: node.booleanOperation } : {}
+  };
+}
+function vectorAppearanceNodes(node) {
+  return vectorAppearanceShapes(node).map((s, k) => shapeNode(s, `${node.id}~fx${k}`));
+}
+var expandCache = /* @__PURE__ */ new WeakMap();
+function expandVectorAppearance(node) {
+  if (!hasVectorAppearance(node)) return node;
+  const hit = expandCache.get(node);
+  if (hit) return hit;
+  let out;
+  if (!hasOwnVectorAppearance(node)) {
+    const group = node;
+    out = { ...group, children: group.children.map(expandVectorAppearance) };
+  } else {
+    const shapes = vectorAppearanceShapes(node);
+    if (node.type === "path" && shapes.length === 1) {
+      const one = shapes[0];
+      const { effects: _e, opacity: _o, ...rest } = node;
+      const opacity = (node.opacity ?? 1) * one.opacity;
+      out = { ...rest, subpaths: bezierToSubpaths(one.path), ...opacity < 1 ? { opacity } : {} };
+    } else {
+      out = {
+        id: node.id,
+        type: "group",
+        ...placement(node),
+        ...node.opacity !== void 0 ? { opacity: node.opacity } : {},
+        children: vectorAppearanceNodes(node)
+      };
+    }
+  }
+  expandCache.set(node, out);
+  return out;
+}
+function expandVectorAppearances(nodes) {
+  let changed = false;
+  const out = nodes.map((n) => {
+    const e = expandVectorAppearance(n);
+    if (e !== n) changed = true;
+    return e;
+  });
+  return changed ? out : nodes;
+}
+function sanitizeVectorEffects(value) {
+  if (!Array.isArray(value)) return [];
+  const out = [];
+  const used = /* @__PURE__ */ new Set();
+  for (const raw of value) {
+    if (!raw || typeof raw !== "object") continue;
+    const r = raw;
+    const type = r.type;
+    if (typeof type !== "string" || !VECTOR_EFFECT_DEFAULTS[type]) continue;
+    let id = typeof r.id === "string" && r.id && !used.has(r.id) ? r.id : "";
+    for (let k = out.length + 1; !id; k++) if (!used.has(`fx${k}`)) id = `fx${k}`;
+    used.add(id);
+    const effect = createVectorEffect(type, id, r.params ?? {});
+    out.push(r.enabled === false ? { ...effect, enabled: false } : effect);
+  }
+  return out;
+}
+function transformVectorEffects(effects, m) {
+  const lin = (v2) => ({ x: m[0] * v2.x + m[2] * v2.y, y: m[1] * v2.x + m[3] * v2.y });
+  const mirror = m[0] * m[3] - m[1] * m[2] < 0 ? -1 : 1;
+  return effects.map((e) => {
+    if (e.type === "twist") return { ...e, params: { ...e.params, center: lin(e.params.center), angle: e.params.angle * mirror } };
+    if (e.type === "repeater")
+      return { ...e, params: { ...e.params, position: lin(e.params.position), anchor: lin(e.params.anchor), rotation: e.params.rotation * mirror } };
+    return e;
+  });
+}
+function vectorEnteredGroups(nodes, ids) {
+  const out = /* @__PURE__ */ new Set();
+  if (!ids.length) return out;
+  const want = new Set(ids);
+  const visit = (list, live) => {
+    for (const n of list) {
+      const own = n.type === "group" && hasOwnVectorAppearance(n);
+      if (want.has(n.id)) {
+        for (const id of live) out.add(id);
+        if (own) out.add(n.id);
+      }
+      if (n.type === "group") visit(n.children, own ? [...live, n.id] : live);
+    }
+  };
+  visit(nodes, []);
+  return out;
+}
+
+// src/vector/geometry.ts
+var EPS3 = 1e-9;
 var cloneAnchor = (a) => ({
   x: a.x,
   y: a.y,
@@ -1068,7 +1935,7 @@ function hasPaint(paint) {
   return true;
 }
 var handleOf = (a, side) => a[side] ?? { x: a.x, y: a.y };
-var isOnAnchor = (a, h) => !h || Math.abs(h.x - a.x) < EPS2 && Math.abs(h.y - a.y) < EPS2;
+var isOnAnchor = (a, h) => !h || Math.abs(h.x - a.x) < EPS3 && Math.abs(h.y - a.y) < EPS3;
 function subpathSegmentCount(sp) {
   const n = sp.anchors.length;
   if (n < 2) return 0;
@@ -1100,7 +1967,7 @@ function subpathsToBezier(subpaths, options = {}) {
   return out;
 }
 function vectorNodeToBezier(node) {
-  return node.type === "path" ? subpathsToBezier(node.subpaths) : [];
+  return node.type === "path" ? vectorAppearanceOutline(node) : [];
 }
 function vectorPathData(input, precision = 3) {
   const subpaths = Array.isArray(input) ? input : input.subpaths;
@@ -1214,12 +2081,13 @@ function collectPathNodes(node) {
 function nodeMatrix(node) {
   return node.transform ?? IDENTITY_MATRIX;
 }
-function vectorPathWorldBezier(node, parent = IDENTITY_MATRIX) {
+function vectorPathWorldBezier(node, parent = IDENTITY_MATRIX, options = {}) {
   const m = multiplyMatrices(nodeMatrix(node), parent);
-  const path = subpathsToBezier(node.subpaths);
+  const path = options.effects === false || !hasOwnVectorAppearance(node) ? subpathsToBezier(node.subpaths) : vectorAppearanceOutline(node);
   return isIdentityMatrix(m) ? path : transformBezierPath(path, m);
 }
 function vectorNodeBounds(node, parent = IDENTITY_MATRIX) {
+  node = expandVectorAppearance(node);
   if (node.type === "group") {
     const m = multiplyMatrices(nodeMatrix(node), parent);
     return unionBounds(node.children.map((c) => vectorNodeBounds(c, m)));
@@ -1249,11 +2117,12 @@ function boundsIntersect(a, b) {
 function boundsFromPoints(a, b) {
   return { x: Math.min(a.x, b.x), y: Math.min(a.y, b.y), width: Math.abs(b.x - a.x), height: Math.abs(b.y - a.y) };
 }
-function hitTestVectorNode(node, p, tolerance = 0, parent = IDENTITY_MATRIX) {
+function hitTestVectorNode(node, p, tolerance = 0, parent = IDENTITY_MATRIX, options = {}) {
   if (node.visible === false) return false;
+  if (!(node.type === "group" && (!hasOwnVectorAppearance(node) || options.entered?.has(node.id)))) node = expandVectorAppearance(node);
   if (node.type === "group") {
     const m = multiplyMatrices(nodeMatrix(node), parent);
-    return node.children.some((c) => hitTestVectorNode(c, p, tolerance, m));
+    return node.children.some((c) => hitTestVectorNode(c, p, tolerance, m, options));
   }
   const path = vectorPathWorldBezier(node, parent);
   if (path.length === 0) return false;
@@ -1266,11 +2135,11 @@ function vectorStrokeOutline(node, parent = IDENTITY_MATRIX) {
   if (!hasPaint(node.stroke) || !((node.strokeWidth ?? 1) > 0)) return [];
   return vectorStrokeOutlinePath(vectorPathWorldBezier(node, parent), node);
 }
-function hitTestVectorNodes(nodes, p, tolerance = 0) {
+function hitTestVectorNodes(nodes, p, tolerance = 0, options = {}) {
   for (let i = nodes.length - 1; i >= 0; i--) {
     const node = nodes[i];
     if (node.visible === false || node.locked) continue;
-    if (hitTestVectorNode(node, p, tolerance)) return node;
+    if (hitTestVectorNode(node, p, tolerance, IDENTITY_MATRIX, options)) return node;
   }
   return null;
 }
@@ -1349,6 +2218,7 @@ function mapAnchor(a, m) {
 }
 function bakeIntoGeometry(node, m) {
   if (isIdentityMatrix(m)) return node;
+  if (node.effects?.length) node = { ...node, effects: transformVectorEffects(node.effects, m) };
   if (node.type === "group") {
     const group = node;
     const children = group.children.map((c) => transformVectorNode(c, m));
@@ -1416,7 +2286,7 @@ function moveAnchorHandle(a, side, pos, breakHandles = false) {
   const dy = pos.y - a.y;
   const len2 = Math.hypot(dx, dy);
   if (type === "symmetric") next[other] = { x: a.x - dx, y: a.y - dy };
-  else if (type === "smooth" && len2 > EPS2) {
+  else if (type === "smooth" && len2 > EPS3) {
     const o = a[other];
     const olen = o ? Math.hypot(o.x - a.x, o.y - a.y) : len2;
     next[other] = { x: a.x - dx / len2 * olen, y: a.y - dy / len2 * olen };
@@ -1446,15 +2316,15 @@ function convertAnchor(sp, index, type) {
   else if (prev && next) dir = { x: next.x - prev.x, y: next.y - prev.y };
   else if (next) dir = { x: next.x - a.x, y: next.y - a.y };
   else if (prev) dir = { x: a.x - prev.x, y: a.y - prev.y };
-  if (!dir || Math.hypot(dir.x, dir.y) < EPS2) return { anchors, closed: sp.closed };
+  if (!dir || Math.hypot(dir.x, dir.y) < EPS3) return { anchors, closed: sp.closed };
   const dl = Math.hypot(dir.x, dir.y);
   const ux = dir.x / dl;
   const uy = dir.y / dl;
   lenIn = a.in && !isOnAnchor(a, a.in) ? Math.hypot(a.in.x - a.x, a.in.y - a.y) : prev ? Math.hypot(prev.x - a.x, prev.y - a.y) / 3 : 0;
   lenOut = a.out && !isOnAnchor(a, a.out) ? Math.hypot(a.out.x - a.x, a.out.y - a.y) : next ? Math.hypot(next.x - a.x, next.y - a.y) / 3 : 0;
   if (type === "symmetric") lenIn = lenOut = (lenIn + lenOut) / 2 || Math.max(lenIn, lenOut);
-  if (lenIn > EPS2) a.in = { x: a.x - ux * lenIn, y: a.y - uy * lenIn };
-  if (lenOut > EPS2) a.out = { x: a.x + ux * lenOut, y: a.y + uy * lenOut };
+  if (lenIn > EPS3) a.in = { x: a.x - ux * lenIn, y: a.y - uy * lenIn };
+  if (lenOut > EPS3) a.out = { x: a.x + ux * lenOut, y: a.y + uy * lenOut };
   a.type = type;
   return { anchors, closed: sp.closed };
 }
@@ -1674,13 +2544,33 @@ function vectorDocumentToSvg(doc, options = {}) {
     if (node.visible === false) out2 += ` display="none"`;
     if (node.blendStep) out2 += ` data-vector-blend-step=""`;
     if (node.type === "group" && node.blend) out2 += ` data-vector-blend="${escapeAttr(JSON.stringify(node.blend))}"`;
+    if (node.booleanOperation) out2 += ` data-vector-boolean-operation="${node.booleanOperation}"`;
     return out2;
   };
-  const emit = (node, depth) => {
+  const emit2 = (node, depth) => {
     if (node.visible === false && !options.includeHidden) return;
+    if (hasOwnVectorAppearance(node)) {
+      const live2 = {
+        kind: node.type,
+        ...node.effects?.length ? { effects: node.effects } : {},
+        ...node.type === "group" && node.liveBoolean ? { liveBoolean: node.liveBoolean } : {}
+      };
+      lines.push(`${indent(depth)}<g${common(node)} data-vector-live="${escapeAttr(JSON.stringify(live2))}">`);
+      lines.push(`${indent(depth + 1)}<g data-vector-part="appearance">`);
+      for (const shape of vectorAppearanceNodes(node)) emit2(shape, depth + 2);
+      lines.push(`${indent(depth + 1)}</g>`);
+      lines.push(`${indent(depth + 1)}<g data-vector-part="source" display="none">`);
+      if (node.type === "path") {
+        const { effects: _e, transform: _t, opacity: _o, visible: _v, booleanOperation: _b, blendStep: _s, ...source } = node;
+        emit2({ ...source, id: `${node.id}~src` }, depth + 2);
+      } else for (const child of node.children) emit2(child, depth + 2);
+      lines.push(`${indent(depth + 1)}</g>`);
+      lines.push(`${indent(depth)}</g>`);
+      return;
+    }
     if (node.type === "group") {
       lines.push(`${indent(depth)}<g${common(node)}>`);
-      for (const child of node.children) emit(child, depth + 1);
+      for (const child of node.children) emit2(child, depth + 1);
       lines.push(`${indent(depth)}</g>`);
       return;
     }
@@ -1744,7 +2634,7 @@ function vectorDocumentToSvg(doc, options = {}) {
     }
     lines.push(`${indent(depth)}</g>`);
   };
-  for (const node of doc.nodes) emit(node, 1);
+  for (const node of doc.nodes) emit2(node, 1);
   const w = num(doc.width);
   const h = num(doc.height);
   const nl = pretty ? "\n" : "";
@@ -1756,6 +2646,7 @@ function vectorDocumentToSvg(doc, options = {}) {
   out.push(...lines, "</svg>");
   return out.join(nl);
 }
+var BOOLEAN_OPERATIONS = ["union", "subtract", "intersect", "exclude"];
 function parseXml(source) {
   const text = source.replace(/<!--[\s\S]*?-->/g, "").replace(/<\?[\s\S]*?\?>/g, "").replace(/<!\[CDATA\[[\s\S]*?\]\]>/g, "").replace(/<!DOCTYPE[^>[]*(\[[\s\S]*?\])?\s*>/gi, "");
   const root = { name: "#root", attrs: {}, children: [] };
@@ -2030,6 +2921,34 @@ function parseVectorSvg(svg, options = {}) {
     };
     return placed(node, m);
   };
+  const liveNode = (g, style, m, meta) => {
+    let raw = {};
+    try {
+      raw = JSON.parse(g.attrs["data-vector-live"]) ?? {};
+    } catch {
+      raw = {};
+    }
+    const sourceEl = g.children.find((c) => c.name === "g" && c.attrs["data-vector-part"] === "source");
+    if (!sourceEl) return null;
+    const inner = visit(sourceEl, style, m);
+    const effects = sanitizeVectorEffects(raw.effects);
+    const liveBoolean = BOOLEAN_OPERATIONS.includes(raw.liveBoolean) ? raw.liveBoolean : null;
+    const id = idFor(g);
+    if (raw.kind === "path") {
+      const path = inner.find((n) => n.type === "path");
+      if (!path) return null;
+      const { residual } = decomposeRigid(m);
+      const { visible: _v, ...rest } = path;
+      return { ...rest, id, ...meta, ...effects.length ? { effects: transformVectorEffects(effects, residual) } : {} };
+    }
+    if (!inner.length) return null;
+    const group = { id, type: "group", ...meta, children: inner };
+    if (effects.length) group.effects = transformVectorEffects(effects, m);
+    if (liveBoolean) group.liveBoolean = liveBoolean;
+    const blend = blendFromAttribute(g.attrs["data-vector-blend"], m);
+    if (blend) group.blend = blend;
+    return group;
+  };
   const visit = (el, style, matrix) => {
     const out = [];
     for (const child of el.children) {
@@ -2044,6 +2963,13 @@ function parseVectorSvg(svg, options = {}) {
         ...hidden ? { visible: false } : {}
       };
       if (child.attrs["data-vector-blend-step"] !== void 0) continue;
+      const operation = child.attrs["data-vector-boolean-operation"];
+      if (BOOLEAN_OPERATIONS.includes(operation)) meta.booleanOperation = operation;
+      if (child.name === "g" && child.attrs["data-vector-live"] !== void 0) {
+        const node2 = liveNode(child, s, m, meta);
+        if (node2) out.push(node2);
+        continue;
+      }
       if (child.name === "g" && child.attrs["data-vector-path"] !== void 0) {
         const node2 = mergedPath(child, s, m, meta);
         if (node2) out.push(node2);
@@ -3197,8 +4123,9 @@ var VectorSnapTargets = class _VectorSnapTargets {
     let anchors = BUDGET;
     let segments = BUDGET;
     const visit = (list, parent) => {
-      for (const n of list) {
-        if (exclude.has(n.id) || n.visible === false) continue;
+      for (const stored of list) {
+        if (exclude.has(stored.id) || stored.visible === false) continue;
+        const n = contains(stored, exclude) ? stored : expandVectorAppearance(stored);
         const m = multiplyMatrices(nodeMatrix(n), parent);
         if (n.type === "group") {
           visit(n.children, m);
@@ -3736,8 +4663,8 @@ function solveOnSegment(seg, base, cond) {
 }
 
 // src/vector/pathEdit.ts
-var EPS3 = 1e-9;
-var unit2 = (x, y) => {
+var EPS4 = 1e-9;
+var unit3 = (x, y) => {
   const l = Math.hypot(x, y);
   return l > 1e-12 && Number.isFinite(l) ? [x / l, y / l] : null;
 };
@@ -3748,16 +4675,16 @@ function cubicOf(sp, i) {
   return [a, [a[0] + (b[0] - a[0]) / 3, a[1] + (b[1] - a[1]) / 3], [a[0] + 2 * (b[0] - a[0]) / 3, a[1] + 2 * (b[1] - a[1]) / 3], b];
 }
 var isLine = (sp, i) => subpathSegment(sp, i).length === 2;
-function startTangent(c) {
+function startTangent2(c) {
   for (let k = 1; k < 4; k++) {
-    const u = unit2(c[k][0] - c[0][0], c[k][1] - c[0][1]);
+    const u = unit3(c[k][0] - c[0][0], c[k][1] - c[0][1]);
     if (u) return u;
   }
   return [1, 0];
 }
-function endTangent(c) {
+function endTangent2(c) {
   for (let k = 2; k >= 0; k--) {
-    const u = unit2(c[3][0] - c[k][0], c[3][1] - c[k][1]);
+    const u = unit3(c[3][0] - c[k][0], c[3][1] - c[k][1]);
     if (u) return u;
   }
   return [1, 0];
@@ -3765,7 +4692,7 @@ function endTangent(c) {
 function sample(c, n, out, withStart) {
   for (let i = withStart ? 0 : 1; i <= n; i++) out.push(segmentPoint(c, i / n));
 }
-var onAnchor2 = (a, h) => !h || Math.abs(h.x - a.x) < EPS3 && Math.abs(h.y - a.y) < EPS3;
+var onAnchor2 = (a, h) => !h || Math.abs(h.x - a.x) < EPS4 && Math.abs(h.y - a.y) < EPS4;
 function tidy(a, keepType = true) {
   const next = cloneAnchor(a);
   if (onAnchor2(next, next.in)) delete next.in;
@@ -3827,8 +4754,8 @@ function removeAnchorKeepingShape(sp, index) {
       const pts = [];
       sample(left, N, pts, true);
       sample(right, N, pts, false);
-      const t0 = startTangent(left);
-      const t1 = endTangent(right);
+      const t0 = startTangent2(left);
+      const t1 = endTangent2(right);
       const { curve } = fitAcross(pts, N, t0, t1);
       if ([curve.p1, curve.p2].every((p) => Number.isFinite(p[0]) && Number.isFinite(p[1]))) {
         anchors[pi] = tidy({ ...anchors[pi], out: { x: curve.p1[0], y: curve.p1[1] } });
@@ -4029,7 +4956,7 @@ function smoothSubpath(sp, amount = 1, only) {
     const prev = orig[(i + n - 1) % n];
     const next = orig[(i + 1) % n];
     const p = orig[i];
-    const dir = unit2(next.x - prev.x, next.y - prev.y);
+    const dir = unit3(next.x - prev.x, next.y - prev.y);
     if (!dir) continue;
     const li = dist2(p, prev) / 3;
     const lo = dist2(p, next) / 3;
@@ -4095,13 +5022,13 @@ function mergePair(a, b, tol) {
   }
   const ca = a.line ? [a0, a0, a3, a3] : a.c;
   const cb = b.line ? [a3, a3, b3, b3] : b.c;
-  const ta = endTangent(ca);
-  const tb = startTangent(cb);
+  const ta = endTangent2(ca);
+  const tb = startTangent2(cb);
   if (ta[0] * tb[0] + ta[1] * tb[1] < 0.99) return null;
   const pts = [];
   sample(ca, 16, pts, true);
   sample(cb, 16, pts, false);
-  const { curve, error } = fitAcross(pts, 16, startTangent(ca), endTangent(cb));
+  const { curve, error } = fitAcross(pts, 16, startTangent2(ca), endTangent2(cb));
   return error <= tol ? { c: [curve.p0, curve.p1, curve.p2, curve.p3], line: false } : null;
 }
 function removeRedundantPoints(sp, tolerance) {
@@ -4233,14 +5160,14 @@ function lineHits(p, q, seg) {
   return out;
 }
 var near = (a, b, eps) => Math.abs(a[0] - b[0]) <= eps && Math.abs(a[1] - b[1]) <= eps;
-var degenerate = (seg, eps) => seg.every((p) => near(p, seg[0], eps));
+var degenerate2 = (seg, eps) => seg.every((p) => near(p, seg[0], eps));
 function arc(l, a, b, eps) {
   const n = l.segs.length;
   const segs = [];
   const chord = [];
   const push = (k, t0, t1) => {
     const piece = t0 <= 0 && t1 >= 1 ? l.segs[k].slice() : subSegment(l.segs[k], t0, t1);
-    if (!degenerate(piece, eps)) {
+    if (!degenerate2(piece, eps)) {
       segs.push(piece);
       chord.push(l.chord[k]);
     }
@@ -4698,8 +5625,9 @@ function recognizeInkShape(points, options = {}) {
 // src/vector/builder.ts
 function vectorPathEntries(doc, roots, options = {}) {
   const out = [];
-  const visit = (node, parent, inside) => {
-    if (node.visible === false || node.locked && !options.locked) return;
+  const visit = (stored, parent, inside) => {
+    if (stored.visible === false || stored.locked && !options.locked) return;
+    const node = options.expand === false ? stored : expandVectorAppearance(stored);
     const picked = inside || roots === null || roots.includes(node.id);
     if (node.type === "group") {
       const m = multiplyMatrices(nodeMatrix(node), parent);
@@ -4753,7 +5681,7 @@ var STROKE_KEYS = [
   "strokeWidthProfile"
 ];
 function vectorResultStyle(node, paint, edge = false) {
-  const { id: _id, subpaths: _s, transform: _t, ...rest } = node;
+  const { id: _id, subpaths: _s, transform: _t, effects: _e, booleanOperation: _b, ...rest } = node;
   const base = { ...rest, fillRule: "nonzero" };
   if (edge) {
     for (const k of STROKE_KEYS) delete base[k];
@@ -5281,6 +6209,12 @@ function spliceTree(nodes, id, replacements) {
   return changed ? out : nodes;
 }
 var toPoint2 = (p) => [p.x, p.y];
+var placementOf = (n) => ({
+  ...n.transform ? { transform: n.transform } : {},
+  ...n.visible === false ? { visible: false } : {},
+  ...n.locked ? { locked: true } : {},
+  ...n.booleanOperation ? { booleanOperation: n.booleanOperation } : {}
+});
 var isRoot = (m) => m === IDENTITY_MATRIX || m[0] === 1 && m[1] === 0 && m[2] === 0 && m[3] === 1 && m[4] === 0 && m[5] === 0;
 var idCounter = 0;
 var defaultCreateId = () => `vn-${Date.now().toString(36)}${(++idCounter).toString(36)}`;
@@ -5505,8 +6439,11 @@ var VectorEditorController = class {
     }
     this.notify(docChanged);
   }
-  /** Records the change from `before` to the current state as one undo step. */
-  commit(name, before) {
+  /**
+   * Records the change from `before` to the current state as one undo step. Consecutive
+   * changes with the same `merge` key (a slider drag) fold into one step.
+   */
+  commit(name, before, merge) {
     this.doc = this.refreshed(this.doc);
     const after = this.snapshot();
     if (before.doc === after.doc) {
@@ -5517,17 +6454,23 @@ var VectorEditorController = class {
       name,
       execute: () => this.restore(after),
       undo: () => this.restore(before),
-      redo: () => this.restore(after)
+      redo: () => this.restore(after),
+      ...merge ? { tag: merge } : {}
     };
     this.committing = true;
-    this.history.execute(command);
+    if (merge) this.history.executeMerged(command, { key: merge });
+    else this.history.execute(command);
     this.committing = false;
   }
-  /** Runs `fn` (which updates fields) and records it as one undo step. */
-  change(name, fn) {
+  /** Runs `fn` (which updates fields) and records it as one undo step (merged by `merge` key). */
+  change(name, fn, merge) {
     const before = this.snapshot();
     fn();
-    this.commit(name, before);
+    this.commit(name, before, merge);
+  }
+  /** Ends a merged edit (a slider released): the next change starts a new undo step. */
+  endMergedEdit() {
+    this.history.endGesture();
   }
   setDoc(nodes) {
     if (nodes !== this.doc.nodes) this.doc = { ...this.doc, nodes };
@@ -6077,7 +7020,7 @@ var VectorEditorController = class {
     const created = [];
     const replace = /* @__PURE__ */ new Map();
     for (const p of paths) {
-      const outline = bezierToSubpaths(vectorStrokeOutlinePath(subpathsToBezier(p.subpaths), p));
+      const outline = bezierToSubpaths(vectorStrokeOutlinePath(vectorAppearanceOutline(p), p));
       if (!outline.length) continue;
       const {
         stroke,
@@ -6092,11 +7035,12 @@ var VectorEditorController = class {
         startArrowScale: _ss,
         endArrowScale: _es,
         strokeWidthProfile: _wp,
+        effects,
         ...rest
       } = cloneVectorNode(p);
       const id = this.newId();
       const strokeNode = { ...rest, id, name: `${p.name ?? "Path"} Stroke`, subpaths: outline, fill: stroke ?? null, stroke: null, fillRule: "nonzero" };
-      const list = hasPaint(p.fill) ? [{ ...rest, stroke: null }, strokeNode] : [strokeNode];
+      const list = hasPaint(p.fill) ? [{ ...rest, ...effects ? { effects } : {}, stroke: null }, strokeNode] : [strokeNode];
       created.push(id);
       replace.set(p.id, list);
     }
@@ -6111,6 +7055,121 @@ var VectorEditorController = class {
     });
     return created;
   }
+  // -------------------------------------------------------------------------
+  // Path effects
+  // -------------------------------------------------------------------------
+  /** Selected (or given) nodes that can carry effects: the roots of the selection. */
+  effectTargets(ids) {
+    return (ids ?? this.selectedRoots()).map((id) => this.getNode(id)).filter((n) => !!n && !n.blendStep);
+  }
+  /**
+   * Adds an effect of `type` to the selected (or given) nodes, at the bottom of each stack (or
+   * at `index`), with default parameters merged with `params`. A repeater's copies start one
+   * shape width apart. One undo step; returns the new effect ids (one per node, in order).
+   */
+  addEffect(type, options = {}) {
+    const targets = this.effectTargets(options.ids);
+    if (!targets.length || !createVectorEffect(type, "")) return [];
+    const created = [];
+    const next = /* @__PURE__ */ new Map();
+    for (const node of targets) {
+      const list = node.effects ?? [];
+      let k = list.length + 1;
+      while (list.some((e) => e.id === `fx${k}`)) k++;
+      const params = { ...options.params ?? {} };
+      if (type === "repeater" && params.position === void 0) {
+        const b = bezierPathBounds(vectorAppearanceOutline(node));
+        if (b && b.maxX - b.minX > 0) params.position = { x: Math.round((b.maxX - b.minX) * 1.25 * 100) / 100, y: 0 };
+      }
+      const effect = createVectorEffect(type, `fx${k}`, params);
+      const at2 = options.index === void 0 ? list.length : Math.min(list.length, Math.max(0, Math.round(options.index)));
+      next.set(node.id, { ...node, effects: [...list.slice(0, at2), effect, ...list.slice(at2)] });
+      created.push(effect.id);
+    }
+    this.change(`Add ${VECTOR_EFFECT_LABELS[type]}`, () => this.setDoc(mapTree(this.doc.nodes, (n) => next.get(n.id) ?? n)));
+    return created;
+  }
+  editEffects(nodeId, label, fn, merge) {
+    const node = this.getNode(nodeId);
+    if (!node) return { ok: false, message: `There is no node "${nodeId}".` };
+    const result = fn(node.effects ?? []);
+    if (typeof result === "string") return { ok: false, message: result };
+    this.change(label, () => this.replaceNode(nodeId, result.length ? { ...node, effects: result } : (({ effects: _e, ...rest }) => rest)(node)), merge);
+    return { ok: true };
+  }
+  /**
+   * Turns an effect on or off and changes its parameters (unknown or invalid values are
+   * ignored). With `merge` (true, or a key of your own), consecutive updates of the same effect
+   * fold into one undo step, as a slider drag should; call `endMergedEdit` when it ends.
+   */
+  updateEffect(nodeId, effectId, patch, options = {}) {
+    const merge = options.merge === true ? `effect:${nodeId}:${effectId}` : options.merge || void 0;
+    const node = this.getNode(nodeId);
+    const current = node?.effects?.find((e) => e.id === effectId);
+    const label = current ? VECTOR_EFFECT_LABELS[current.type] ?? "Effect" : "Effect";
+    return this.editEffects(
+      nodeId,
+      `Edit ${label}`,
+      (list) => {
+        const i = list.findIndex((e2) => e2.id === effectId);
+        if (i < 0) return `Node "${nodeId}" has no effect "${effectId}".`;
+        const e = list[i];
+        const params = patch.params ? normalizeVectorEffectParams(e.type, patch.params, e.params) : e.params;
+        const next = { ...e, params, ...patch.enabled !== void 0 ? { enabled: patch.enabled } : {} };
+        if (next.enabled !== false) delete next.enabled;
+        return list.map((x, j) => j === i ? next : x);
+      },
+      merge
+    );
+  }
+  /** Removes an effect from a node's stack. */
+  removeEffect(nodeId, effectId) {
+    return this.editEffects(nodeId, "Remove Effect", (list) => list.some((e) => e.id === effectId) ? list.filter((e) => e.id !== effectId) : `Node "${nodeId}" has no effect "${effectId}".`);
+  }
+  /** Moves an effect to position `index` of its stack (0 is applied first). */
+  moveEffect(nodeId, effectId, index) {
+    return this.editEffects(nodeId, "Reorder Effects", (list) => {
+      const i = list.findIndex((e2) => e2.id === effectId);
+      if (i < 0) return `Node "${nodeId}" has no effect "${effectId}".`;
+      const to = Math.min(list.length - 1, Math.max(0, Math.round(index)));
+      const out = list.slice();
+      const [e] = out.splice(i, 1);
+      out.splice(to, 0, e);
+      return out;
+    });
+  }
+  /**
+   * Expand Appearance: bakes the path effects and live booleans of the selected (or given)
+   * nodes, and of everything inside them, into plain paths. A node keeps its id (a group when
+   * it draws as several shapes); the shapes it made get new ids. Returns the ids of the expanded
+   * nodes (empty when none was live).
+   */
+  expandAppearance(options = {}) {
+    const roots = (options.ids ?? this.selectedRoots()).map((id) => this.getNode(id)).filter((n) => !!n && hasVectorAppearance(n));
+    if (!roots.length) return [];
+    const fresh = (n) => {
+      const id = n.id.includes("~fx") ? this.newId() : n.id;
+      return n.type === "group" ? { ...n, id, children: n.children.map(fresh) } : { ...n, id };
+    };
+    const bake = (n) => {
+      if (!hasVectorAppearance(n)) return n;
+      if (!hasOwnVectorAppearance(n)) return { ...n, children: n.children.map(bake) };
+      let e = expandVectorAppearance(n);
+      if (e.type === "group" && e.children.length === 1 && e.children[0].type === "path") {
+        const { id: _id, opacity, name, ...child } = e.children[0];
+        const k = (e.opacity ?? 1) * (opacity ?? 1);
+        e = { ...child, id: e.id, name: e.name ?? name, ...placementOf(e), ...k < 1 ? { opacity: k } : {} };
+      }
+      return fresh(e);
+    };
+    const next = new Map(roots.map((n) => [n.id, bake(n)]));
+    this.change("Expand Appearance", () => {
+      this.setDoc(mapTree(this.doc.nodes, (n) => next.get(n.id) ?? n));
+      this.anchors = [];
+      this.editingId = null;
+    });
+    return roots.map((n) => n.id);
+  }
   rename(id, name) {
     return this.updateNode(id, { name }, { label: "Rename" });
   }
@@ -6402,7 +7461,7 @@ var VectorEditorController = class {
             const opacity = n.opacity;
             const m = nodeMatrix(n);
             out.push(
-              ...n.children.map((c) => c.blendStep ? (({ blendStep: _s, locked: _l, ...rest }) => rest)(c) : c).map((c) => n.transform ? transformVectorNode(c, m) : c).map((c) => opacity !== void 0 && opacity < 1 ? { ...c, opacity: (c.opacity ?? 1) * opacity } : c)
+              ...n.children.map((c) => c.blendStep ? (({ blendStep: _s, locked: _l, ...rest }) => rest)(c) : c).map((c) => c.booleanOperation ? (({ booleanOperation: _b, ...rest }) => rest)(c) : c).map((c) => n.transform ? transformVectorNode(c, m) : c).map((c) => opacity !== void 0 && opacity < 1 ? { ...c, opacity: (c.opacity ?? 1) * opacity } : c)
             );
           } else if (n.type === "group") {
             const children = flatten2(n.children);
@@ -6439,34 +7498,33 @@ var VectorEditorController = class {
   /**
    * Combines the selected paths (two or more) into one with a boolean operation. `subtract`
    * removes the upper shapes from the lowest one. The result takes the lowest shape's style
-   * and place.
+   * and place. Shapes take part as drawn (path effects and live booleans applied).
+   *
+   * With `live`, the operands stay editable instead: a lone live boolean group gets the
+   * operation (its operands follow it again), operands of live boolean groups get it as their
+   * own, and anything else (two or more nodes with one parent) is wrapped in a new live boolean
+   * group. Returns the result's (or the live group's) id, or null.
    */
   booleanOp(op, options = {}) {
     const roots = options.ids ?? this.selectedRoots();
-    const order = [];
-    walkVectorNodes(this.doc.nodes, (n) => {
-      if (roots.includes(n.id)) for (const p of collectPathNodes(n)) order.push(p.id);
-    });
-    const paths = [...new Set(order)].map((id2) => this.getNode(id2));
-    if (paths.length < 2) return null;
+    if (options.live) return this.liveBooleanOp(op, roots);
+    const entries = vectorPathEntries(this.doc, roots, { locked: true });
+    if (entries.length < 2) return null;
     const result = pathBoolean(
       BOOLEAN_OPS[op],
-      paths.map((p) => ({
-        path: vectorPathWorldBezier(
-          { ...p, subpaths: p.subpaths.filter((s) => s.anchors.length > 1).map((s) => ({ ...s, closed: true })) },
-          vectorParentMatrix(this.doc.nodes, p.id) ?? IDENTITY_MATRIX
-        ),
-        fillRule: p.fillRule ?? "nonzero"
+      entries.map((e) => ({
+        path: vectorPathWorldBezier({ ...e.node, subpaths: e.node.subpaths.filter((s) => s.anchors.length > 1).map((s) => ({ ...s, closed: true })) }, e.parent),
+        fillRule: e.node.fillRule ?? "nonzero"
       }))
     );
-    const base = paths[0];
-    const anchorRoot = roots.find((r) => findVectorNode([this.getNode(r)], base.id)) ?? base.id;
+    const base = entries[0].node;
+    const anchorRoot = roots.find((r) => this.holds(r, base.id)) ?? base.id;
     const subpaths = bezierToSubpaths(this.intoParentSpace(anchorRoot, result.path));
     if (result.error || !subpaths.length) return null;
     const id = this.newId();
-    const { transform: _t, ...baseRest } = cloneVectorNode(base);
+    const { transform: _t, effects: _e, booleanOperation: _b, ...baseRest } = cloneVectorNode(base);
     const node = { ...baseRest, id, name: BOOLEAN_LABELS[op], subpaths };
-    const drop = /* @__PURE__ */ new Set([...paths.map((p) => p.id), ...roots]);
+    const drop = /* @__PURE__ */ new Set([...entries.map((e) => e.node.id), ...roots]);
     this.change(BOOLEAN_LABELS[op], () => {
       this.setDoc(mapTree(this.doc.nodes, (n) => n.id === anchorRoot ? node : drop.has(n.id) ? null : n));
       this.selection = [id];
@@ -6475,18 +7533,75 @@ var VectorEditorController = class {
     });
     return id;
   }
+  /** Whether stored node `rootId` holds `id` as drawn (`id` may be an expanded path inside it). */
+  holds(rootId, id) {
+    const n = this.getNode(rootId);
+    return !!n && (!!findVectorNode([n], id) || !!findVectorNode([expandVectorAppearance(n)], id));
+  }
+  liveBooleanOp(op, roots) {
+    const nodes = roots.map((id2) => this.getNode(id2));
+    if (!nodes.length || nodes.some((n) => !n)) return null;
+    const label = `Live ${BOOLEAN_LABELS[op]}`;
+    const lone = nodes.length === 1 ? nodes[0] : null;
+    if (isVectorLiveBoolean(lone)) {
+      const children = lone.children.map((c) => c.booleanOperation ? (({ booleanOperation: _b, ...rest }) => rest)(c) : c);
+      this.change(label, () => this.replaceNode(lone.id, { ...lone, liveBoolean: op, children }));
+      return lone.id;
+    }
+    const parents = roots.map((id2) => locateVectorNode(this.doc.nodes, id2)?.parent ?? null);
+    if (parents.every((g) => isVectorLiveBoolean(g))) {
+      const set = new Set(roots);
+      this.change(
+        label,
+        () => this.setDoc(
+          mapTree(this.doc.nodes, (n) => {
+            if (n.type !== "group" || !n.liveBoolean || !n.children.some((c) => set.has(c.id))) return n;
+            const group = n;
+            const children = group.children.map((c) => {
+              if (!set.has(c.id)) return c;
+              const { booleanOperation: _b, ...rest } = c;
+              return op === group.liveBoolean ? rest : { ...rest, booleanOperation: op };
+            });
+            return { ...group, children };
+          })
+        )
+      );
+      return parents[0].id;
+    }
+    if (nodes.length < 2) return null;
+    const parent = parents[0]?.id ?? null;
+    if (parents.some((g) => (g?.id ?? null) !== parent)) return null;
+    const id = this.newId();
+    this.change(label, () => {
+      const set = new Set(roots);
+      const wrap = (list) => {
+        const members = list.filter((n) => set.has(n.id)).map((c) => c.booleanOperation ? (({ booleanOperation: _b, ...rest }) => rest)(c) : c);
+        const top = Math.max(...list.map((n, i) => set.has(n.id) ? i : -1));
+        const out = [];
+        list.forEach((n, i) => {
+          if (i === top) out.push({ id, type: "group", name: BOOLEAN_LABELS[op], liveBoolean: op, children: members });
+          if (!set.has(n.id)) out.push(n);
+        });
+        return out;
+      };
+      if (parent === null) this.setDoc(wrap(this.doc.nodes));
+      else this.setDoc(mapTree(this.doc.nodes, (n) => n.id === parent && n.type === "group" ? { ...n, children: wrap(n.children) } : n));
+      this.selection = [id];
+      this.anchors = [];
+      this.editingId = null;
+    });
+    return id;
+  }
   /** Joins the selected paths into one compound path (subpaths kept, lowest style). */
   combine(options = {}) {
     const roots = options.ids ?? this.selectedRoots();
-    const paths = [];
-    walkVectorNodes(this.doc.nodes, (n) => {
-      if (roots.includes(n.id)) paths.push(...collectPathNodes(n));
-    });
-    if (paths.length < 2) return null;
+    const entries = vectorPathEntries(this.doc, roots, { locked: true });
+    if (entries.length < 2) return null;
+    const paths = entries.map((e) => e.node);
     const id = this.newId();
-    const first = roots.find((r) => findVectorNode([this.getNode(r)], paths[0].id)) ?? paths[0].id;
-    const subpaths = paths.flatMap((p) => bezierToSubpaths(this.intoParentSpace(first, vectorPathWorldBezier(p, vectorParentMatrix(this.doc.nodes, p.id) ?? IDENTITY_MATRIX))));
-    const { transform: _t, ...baseRest } = cloneVectorNode(paths[0]);
+    const first = roots.find((r) => this.holds(r, paths[0].id)) ?? paths[0].id;
+    const subpaths = entries.flatMap((e) => bezierToSubpaths(this.intoParentSpace(first, vectorPathWorldBezier(e.node, e.parent))));
+    const { transform: _t, effects: _e, booleanOperation: _b, ...baseRest } = cloneVectorNode(paths[0]);
     const node = { ...baseRest, id, name: "Compound Path", subpaths };
     const drop = /* @__PURE__ */ new Set([...paths.map((p) => p.id), ...roots]);
     this.change("Combine", () => {
@@ -6541,10 +7656,7 @@ var VectorEditorController = class {
     const result = pathfinder(op, shapes);
     if (result.error || !result.pieces.length) return [];
     const last = entries[entries.length - 1].node.id;
-    const topRoot = [...roots].reverse().find((r) => {
-      const n = this.getNode(r);
-      return !!n && !!findVectorNode([n], last);
-    }) ?? last;
+    const topRoot = [...roots].reverse().find((r) => this.holds(r, last)) ?? last;
     const nodes = [];
     for (const piece of result.pieces) {
       const subpaths = bezierToSubpaths(this.intoParentSpace(topRoot, piece.path)).map((sp) => piece.open ? { ...sp, closed: false } : sp);
@@ -6737,7 +7849,7 @@ var VectorEditorController = class {
     const roots = ids ?? this.selectedRoots();
     const key = roots.join("\0");
     if (this.builderCache?.doc === this.doc && this.builderCache.key === key) return this.builderCache.map;
-    const entries = roots.length ? vectorPathEntries(this.doc, roots) : [];
+    const entries = roots.length ? vectorPathEntries(this.doc, roots, { expand: false }) : [];
     const map = entries.length ? vectorShapeBuilderMap(entries) : null;
     this.builderCache = { doc: this.doc, key, map };
     return map;
@@ -7521,16 +8633,22 @@ var VectorEditorController = class {
     return best;
   }
   /** Deepest unlocked visible path under `p`. */
+  /** Live groups being edited (selected, or holding the selection or the edited path): their children are hit as stored. */
+  enteredGroups() {
+    return vectorEnteredGroups(this.doc.nodes, this.editingId ? [...this.selection, this.editingId] : this.selection);
+  }
   hitPath(p) {
     const tol = this.tolerance();
+    const entered = this.enteredGroups();
     const search = (list, parent) => {
       for (let i = list.length - 1; i >= 0; i--) {
         const n = list[i];
         if (n.visible === false || n.locked) continue;
         if (n.type === "group") {
+          if (hasOwnVectorAppearance(n) && !entered.has(n.id) && !hitTestVectorNode(n, p, tol, parent, { entered })) continue;
           const found = search(n.children, multiplyMatrices(nodeMatrix(n), parent));
           if (found) return found;
-        } else if (hitTestVectorNode(n, p, tol, parent)) return n;
+        } else if (hitTestVectorNode(n, p, tol, parent, { entered })) return n;
       }
       return null;
     };
@@ -7555,7 +8673,7 @@ var VectorEditorController = class {
       case "select": {
         const handle = this.hitTransformHandle(screen);
         if (handle) return { nodeId: null, transformHandle: handle };
-        const node = hitTestVectorNodes(this.doc.nodes, p, this.tolerance());
+        const node = hitTestVectorNodes(this.doc.nodes, p, this.tolerance(), { entered: this.enteredGroups() });
         return node ? { nodeId: node.id } : null;
       }
       case "direct": {
@@ -7884,7 +9002,7 @@ var VectorEditorController = class {
       this.notify();
       return;
     }
-    const node = hitTestVectorNodes(this.doc.nodes, p, this.tolerance());
+    const node = hitTestVectorNodes(this.doc.nodes, p, this.tolerance(), { entered: this.enteredGroups() });
     if (node) {
       const selected = this.selection.includes(node.id);
       if (input.shift) {
@@ -8809,8 +9927,9 @@ function pencilPressureProfile(points, pressures) {
 var fmt = (n) => Math.round(n * 100) / 100;
 var fmtMatrix = (m) => `matrix(${m.map((n) => Math.round(n * 1e6) / 1e6).join(" ")})`;
 var VECTOR_BUILDER_HATCH_GAP = 6;
-function renderNode(node, defs, idPrefix) {
-  if (node.visible === false) return null;
+function renderNode(stored, defs, idPrefix) {
+  if (stored.visible === false) return null;
+  const node = expandVectorAppearance(stored);
   if (node.type === "group") {
     const children = node.children.map((c) => renderNode(c, defs, idPrefix)).filter((c) => !!c);
     return { kind: "group", id: node.id, ...node.transform ? { transform: fmtMatrix(node.transform) } : {}, opacity: node.opacity ?? 1, children };
@@ -8851,16 +9970,20 @@ function getVectorSceneRenderData(state, options = {}) {
   };
 }
 var toScreen = (state, p) => ({ x: p.x * state.viewport.zoom + state.viewport.x, y: p.y * state.viewport.zoom + state.viewport.y });
-function screenOutline(state, node) {
+function screenOutline(state, node, entered) {
   const v2 = state.viewport;
   const view = [v2.zoom, 0, 0, v2.zoom, v2.x, v2.y];
   const parent = vectorParentMatrix(state.document.nodes, node.id) ?? IDENTITY_MATRIX;
-  return collectWithMatrix(node, parent).map(({ path, parent: m }) => bezierPathToSvg(transformBezierPath(vectorPathWorldBezier(path, m), view), { precision: 2 })).join(" ");
+  return outlinePaths(node, parent, entered).map((path) => bezierPathToSvg(transformBezierPath(path, view), { precision: 2 })).join(" ");
 }
-function collectWithMatrix(node, parent) {
-  if (node.type === "path") return [{ path: node, parent }];
+function outlinePaths(node, parent, entered) {
+  if (node.type === "path") return [vectorPathWorldBezier(node, parent, { effects: false })];
   const m = multiplyMatrices(nodeMatrix(node), parent);
-  return node.children.flatMap((c) => collectWithMatrix(c, m));
+  if (hasOwnVectorAppearance(node) && !entered.has(node.id)) return [transformBezierPath(vectorAppearanceOutline(node), m)];
+  return node.children.filter((c) => c.visible !== false).flatMap((c) => outlinePaths(c, m, entered));
+}
+function getVectorEnteredGroups(state) {
+  return vectorEnteredGroups(state.document.nodes, state.editingId ? [...state.selection, state.editingId] : state.selection);
 }
 function collect(node) {
   if (node.type === "path") return [node];
@@ -8870,13 +9993,14 @@ function getVectorOverlayRenderData(state) {
   const doc = state.document;
   const z = state.viewport.zoom;
   const outlines = [];
+  const entered = getVectorEnteredGroups(state);
   const seen = /* @__PURE__ */ new Set();
   const outline = (id, selected2) => {
     if (seen.has(id)) return;
     const node = findVectorNode(doc.nodes, id);
     if (!node || node.visible === false) return;
     seen.add(id);
-    outlines.push({ id, d: screenOutline(state, node), selected: selected2 });
+    outlines.push({ id, d: screenOutline(state, node, entered), selected: selected2 });
   };
   for (const id of state.selection) outline(id, true);
   if (state.editingId) outline(state.editingId, true);
@@ -9041,7 +10165,7 @@ function blendOverlay(state) {
     const from = state.blendStart ? findVectorNode(doc.nodes, state.blendStart.nodeId) : void 0;
     if (from && state.blendStart) {
       const a = state.blendStart.anchor === null ? void 0 : getAnchorWorld(doc, { nodeId: from.id, subpath: 0, index: state.blendStart.anchor });
-      start = { d: screenOutline(state, from), anchor: a ? sc(a, view) : null };
+      start = { d: screenOutline(state, from, /* @__PURE__ */ new Set()), anchor: a ? sc(a, view) : null };
     }
     const hovered = state.hover?.nodeId ? findVectorNode(doc.nodes, state.hover.nodeId) : void 0;
     if (hovered?.type === "path" && hovered.subpaths[0]) {
@@ -9226,8 +10350,28 @@ var VECTOR_EDIT_TOGGLES = [
   { key: "curvatureMoves", label: "Curv", title: "Curvature point moves (Alt flips while dragging)" },
   { key: "recognizeShapes", label: "Shapes", title: "Turn pencil scribbles into shapes" }
 ];
+var VECTOR_EFFECT_MENU = VECTOR_EFFECT_TYPES.map((type) => ({ type, label: VECTOR_EFFECT_LABELS[type] }));
+function getVectorEffectsPanel(state) {
+  const nodes = state.selection.map((id) => findVectorNode(state.document.nodes, id)).filter((n) => !!n && !n.blendStep);
+  if (!nodes.length) return null;
+  const one = nodes.length === 1 ? nodes[0] : null;
+  return {
+    nodeId: one?.id ?? null,
+    count: nodes.length,
+    effects: (one?.effects ?? []).map((e) => ({
+      id: e.id,
+      type: e.type,
+      label: VECTOR_EFFECT_LABELS[e.type] ?? e.type,
+      enabled: e.enabled !== false,
+      params: e.params,
+      specs: VECTOR_EFFECT_PARAM_SPECS[e.type] ?? []
+    })),
+    expandable: nodes.some(hasVectorAppearance)
+  };
+}
 
 // src/vector/commands.ts
+var EFFECT_PARAMS_DESCRIPTION = "Effect parameters (missing ones keep their value or default). trim: start, end (percent), offset (degrees), mode simultaneous|individual. roundCorners: radius. puckerBloat: amount (\u2212100\u2026100). twist: angle, center {x, y} (offset from the middle). zigzag: size, ridges, smooth. wiggle: size, detail, smooth, speed, correlation, phase, seed, time (seconds). offset: amount, join miter|round|bevel, miterLimit, copies, copyOffset. merge: mode merge|add|subtract|intersect|exclude. repeater: copies (fractions fade the last), offset, position {x, y}, anchor {x, y} (offset from the middle), rotation, scale {x, y} (percent), startOpacity, endOpacity (percent), composite below|above.";
 var fail = (message) => {
   throw new Error(message);
 };
@@ -9338,7 +10482,10 @@ function createVectorCommands(controller, options = {}) {
           selected: state.selection.includes(n.id),
           ...n.type === "path" ? { fill: n.fill ?? null, stroke: n.stroke ?? null, strokeWidth: n.strokeWidth ?? 1, d: vectorPathData(n, 2) } : { children: n.children.length },
           ...n.type === "group" && n.blend ? { blend: { ...resolveVectorBlendOptions(n.blend), spine: !!n.blend.spine, keys: vectorBlendKeys(n).map((k) => k.id) } } : {},
-          ...n.blendStep ? { blendStep: true } : {}
+          ...n.blendStep ? { blendStep: true } : {},
+          ...n.effects?.length ? { effects: n.effects } : {},
+          ...n.type === "group" && n.liveBoolean ? { liveBoolean: n.liveBoolean } : {},
+          ...n.booleanOperation ? { booleanOperation: n.booleanOperation } : {}
         });
         if (n.type === "group") visit(n.children, depth + 1);
       }
@@ -9574,15 +10721,101 @@ function createVectorCommands(controller, options = {}) {
       id: `${prefix}boolean`,
       label: "Boolean Operation\u2026",
       keywords: ["union", "unite", "subtract", "intersect", "exclude", "combine", "pathfinder"],
-      description: "Combines two or more paths with union, subtract (upper shapes from the lowest), intersect or exclude.",
-      params: { type: "object", properties: { operation: { type: "string", enum: ["union", "subtract", "intersect", "exclude"] }, ids: IDS }, required: ["operation"] },
+      description: "Combines two or more paths with union, subtract (upper shapes from the lowest), intersect or exclude. With `live`, the shapes stay editable operands of a live boolean group instead (a lone live group gets the operation; its operands get their own).",
+      params: {
+        type: "object",
+        properties: {
+          operation: { type: "string", enum: ["union", "subtract", "intersect", "exclude"] },
+          ids: IDS,
+          live: { type: "boolean", description: "Keep the operands editable in a live boolean group (default false: one new path)." }
+        },
+        required: ["operation"]
+      },
       undoable: true,
       run: (_ctx, params) => {
-        const id = controller.booleanOp(params.operation, { ids: ids(params) });
-        if (!id) fail("Select at least two overlapping paths (the result was empty).");
+        const id = controller.booleanOp(params.operation, { ids: ids(params), live: params.live });
+        if (!id) fail(params.live ? "Select two or more nodes with one parent, a live boolean group or its operands." : "Select at least two overlapping paths (the result was empty).");
         return { id };
       }
     },
+    {
+      ...base,
+      id: `${prefix}addEffect`,
+      label: "Add Path Effect\u2026",
+      keywords: ["effect", "trim", "round corners", "pucker", "bloat", "twist", "zig zag", "wiggle", "offset", "merge", "repeater", "appearance", "live"],
+      description: "Adds a live path effect to the bottom of the effect stack of nodes (paths or groups). Effects apply top to bottom; effects after a repeater act on its copies. Returns the new effect ids.",
+      params: {
+        type: "object",
+        properties: {
+          type: { type: "string", enum: VECTOR_EFFECT_TYPES },
+          params: { type: "object", description: EFFECT_PARAMS_DESCRIPTION },
+          index: { type: "integer", minimum: 0, description: "Position in the stack (default: last)." },
+          ids: IDS
+        },
+        required: ["type"]
+      },
+      undoable: true,
+      enabled: enabledFor,
+      run: (_ctx, params) => {
+        if (!VECTOR_EFFECT_TYPES.includes(params.type)) fail(`Unknown effect type "${params.type}".`);
+        const targets = ids(params);
+        const created = controller.addEffect(params.type, { ids: targets, params: params.params, index: params.index });
+        if (!created.length) fail("Nothing to add the effect to.");
+        return { effects: targets.map((id, i) => ({ nodeId: id, effectId: created[i] })) };
+      }
+    },
+    {
+      ...base,
+      id: `${prefix}updateEffect`,
+      label: "Edit Path Effect\u2026",
+      keywords: ["effect", "parameters", "enable", "disable", "reorder"],
+      description: "Changes a path effect: its parameters, whether it is enabled, and its position in the stack.",
+      params: {
+        type: "object",
+        properties: {
+          nodeId: { type: "string" },
+          effectId: { type: "string" },
+          params: { type: "object", description: EFFECT_PARAMS_DESCRIPTION },
+          enabled: { type: "boolean" },
+          index: { type: "integer", minimum: 0, description: "Move it to this position in the stack (0 applies first)." }
+        },
+        required: ["nodeId", "effectId"]
+      },
+      undoable: true,
+      run: (_ctx, params) => {
+        if (params.params !== void 0 || params.enabled !== void 0) check(controller.updateEffect(params.nodeId, params.effectId, { params: params.params, enabled: params.enabled }));
+        if (params.index !== void 0) check(controller.moveEffect(params.nodeId, params.effectId, params.index));
+        return { effects: controller.getNode(params.nodeId)?.effects ?? [] };
+      }
+    },
+    {
+      ...base,
+      id: `${prefix}removeEffect`,
+      label: "Remove Path Effect",
+      keywords: ["effect", "delete"],
+      description: "Removes a path effect from a node.",
+      params: { type: "object", properties: { nodeId: { type: "string" }, effectId: { type: "string" } }, required: ["nodeId", "effectId"] },
+      undoable: true,
+      run: (_ctx, params) => {
+        check(controller.removeEffect(params.nodeId, params.effectId));
+        return { ok: true };
+      }
+    },
+    {
+      ...base,
+      id: `${prefix}expandAppearance`,
+      label: "Expand Appearance",
+      keywords: ["effects", "bake", "flatten", "live boolean", "expand"],
+      description: "Bakes the path effects and live booleans of nodes (and everything inside them) into plain paths.",
+      params: { type: "object", properties: { ids: IDS } },
+      undoable: true,
+      enabled: enabledFor,
+      run: (_ctx, params) => {
+        const expanded = controller.expandAppearance({ ids: ids(params) });
+        if (!expanded.length) fail("Nothing selected has path effects or a live boolean.");
+        return { ids: expanded };
+      }
+    },
     {
       ...base,
       id: `${prefix}blend`,
@@ -10030,8 +11263,14 @@ export {
   VECTOR_CORNER_KIND_LABELS,
   VECTOR_CORNER_WIDGET_INSET,
   VECTOR_EDIT_TOGGLES,
+  VECTOR_EFFECT_DEFAULTS,
+  VECTOR_EFFECT_LABELS,
+  VECTOR_EFFECT_MENU,
+  VECTOR_EFFECT_PARAM_SPECS,
+  VECTOR_EFFECT_TYPES,
   VECTOR_FILL_GAP,
   VECTOR_INK_MAX_CORNERS,
+  VECTOR_MERGE_MODES,
   VECTOR_OVERLAY_THEME,
   VECTOR_PATHFINDER_ACTIONS,
   VECTOR_PATHFINDER_LABELS,
@@ -10053,11 +11292,13 @@ export {
   VECTOR_WIDTH_SAME_T,
   VectorEditorController,
   VectorSnapTargets,
+  activeVectorEffects,
   addBuilderHit,
   applyMatrix,
   applyMatrixLinear,
   applyVectorBlendOptions,
   applyVectorCornersAttribute,
+  applyVectorEffects,
   arrowheadInset,
   arrowheadPath,
   arrowheadWeight,
@@ -10065,6 +11306,7 @@ export {
   bezierToSubpaths,
   boundsFromPoints,
   boundsIntersect,
+  clearVectorLiveBooleanCache,
   cloneAnchor,
   cloneSubpath,
   cloneVectorDocument,
@@ -10077,22 +11319,28 @@ export {
   cornerSetback,
   correspondMorphContours,
   createVectorCommands,
+  createVectorEffect,
   createVectorMorph,
   curvatureMoveAnchor,
   cutSubpathAt,
   dashIntervals,
   decomposeRigid,
+  effectPathLength,
+  effectPathVertexCount,
   effectiveStrokeAlign,
   ellipseSubpath,
   eraseFromFill,
   eraseFromOutline,
   eraserRegion,
   evaluateVectorPathKeyframes,
+  expandVectorAppearance,
+  expandVectorAppearances,
   expandVectorBlend,
   expandVectorCorners,
   expandVectorCornersOf,
   findVectorNode,
   fitCornerRadius,
+  foldVectorBooleanOperands,
   generateVectorBlendChildren,
   generateWidthProfile,
   getAnchor,
@@ -10101,6 +11349,8 @@ export {
   getTransformHandlePositions,
   getVectorBlendControls,
   getVectorCornerWidgets,
+  getVectorEffectsPanel,
+  getVectorEnteredGroups,
   getVectorOverlayRenderData,
   getVectorSceneRenderData,
   getVectorSelectionBoxGeometry,
@@ -10109,8 +11359,10 @@ export {
   getVectorWidthHandles,
   getVisibleAnchors,
   getVisibleHandles,
+  hasOwnVectorAppearance,
   hasPaint,
   hasStrokeExtras,
+  hasVectorAppearance,
   hasVectorCorners,
   hitTestVectorNode,
   hitTestVectorNodes,
@@ -10130,12 +11382,14 @@ export {
   isIdentityMatrix,
   isUniformWidthProfile,
   isVectorBlendGroup,
+  isVectorLiveBoolean,
   isVectorTextTarget,
   joinSubpaths,
   knifePath,
   lineSubpath,
   locateVectorNode,
   matrixRotation,
+  mergePaths,
   mirrorWidthProfile,
   morphContourToSubpath,
   morphPathsCross,
@@ -10145,12 +11399,16 @@ export {
   nearestStrokePosition,
   nextVectorCornerKind,
   nodeMatrix,
+  normalizeVectorEffectParams,
+  offsetPaths,
   parseSvgTransform,
   parseVectorSvg,
+  pathsCenter,
   planShapeBuilder,
   polygonSubpath,
   polylineBounds,
   pressureWidthProfile,
+  puckerBloatPaths,
   recognizeInkShape,
   rectSubpath,
   refineMorphContour,
@@ -10161,14 +11419,17 @@ export {
   removeAnchorsKeepingShape,
   removeRedundantPoints,
   removeWidthPoints,
+  repeatPaths,
   resampleGradientStops,
   resolveVectorBlendOptions,
   reverseMorphContour,
   reverseSubpath,
   reverseWidthProfile,
   rotateMatrix,
+  roundCornerPaths,
   roundSubpaths,
   samplePolyline,
+  sanitizeVectorEffects,
   sanitizeWidthProfile,
   scaleFor,
   scaleMatrix,
@@ -10192,13 +11453,21 @@ export {
   toVectorKeyInput,
   toVectorModifiers,
   toVectorPointerInput,
+  transformVectorEffects,
   transformVectorNode,
   translateAnchor,
   translateMatrix,
+  trimIntervals,
+  trimPaths,
+  trimPathsIndividually,
   turnMorphContour,
+  twistPaths,
   unionBounds,
   variableStrokeOutline,
   variableStrokeRings,
+  vectorAppearanceNodes,
+  vectorAppearanceOutline,
+  vectorAppearanceShapes,
   vectorBlendColorDistance,
   vectorBlendKeyTargets,
   vectorBlendKeys,
@@ -10212,11 +11481,14 @@ export {
   vectorCornersAttribute,
   vectorDiamondPath,
   vectorDocumentToSvg,
+  vectorEnteredGroups,
   vectorFillMap,
   vectorInkShapeName,
+  vectorLiveBooleanSteps,
   vectorNodeBounds,
   vectorNodeRotation,
   vectorNodeToBezier,
+  vectorOperandOperation,
   vectorPaintToHex,
   vectorPaintToSvg,
   vectorParentMatrix,
@@ -10224,6 +11496,7 @@ export {
   vectorPathEntries,
   vectorPathWorldBezier,
   vectorPathfinderShape,
+  vectorRepeaterCopies,
   vectorResizeCursor,
   vectorResultStyle,
   vectorShapeBuilderHit,
@@ -10243,6 +11516,8 @@ export {
   widthProfileMaxScale,
   widthProfilePreset,
   widthProfilePresetId,
-  widthProfileToAttribute
+  widthProfileToAttribute,
+  wigglePaths,
+  zigzagPaths
 };
 //# sourceMappingURL=index.js.map