@weasel-js/geom 1.15.2 → 1.16.0

package/dist/lengthTable-Cv3W6lsH.d.ts

@@ -0,0 +1,64 @@
+/** One subpath of a path in pen order: points joined by straight segments, or by curves where `controls` gives them. */
+interface LengthRun {
+    /** `dim` components per point. A closed run does not repeat its first point. */
+    points: ArrayLike<number>;
+    /** Whether a closing edge runs from the last point back to the first. */
+    closed: boolean;
+    /** Per point, the anchor before it, the anchor after it, and the arc-length
+     *  fraction between them, as `Polyline` carries them. Absent, every point is
+     *  an anchor, numbered on from the previous run's. */
+    anchorA?: ArrayLike<number>;
+    anchorB?: ArrayLike<number>;
+    anchorT?: ArrayLike<number>;
+    /** A closed run's last anchor when it sat on the first point and was dropped, as `Polyline` carries it. */
+    closeAnchor?: number;
+    /** Per segment, from point `i` to the next (a closed run's closing edge last), the control
+     *  points of the curve between them, `dim` components each; empty, null or absent where
+     *  the segment is straight. A curved segment is measured by its exact arc length. */
+    controls?: readonly (ArrayLike<number> | null | undefined)[];
+}
+/** A stretch of a path between two pen-order lengths, `from` before `to`. */
+interface LengthSpan {
+    from: number;
+    to: number;
+}
+/** A path's arc length in pen order: subpaths in order, the lift between them covering no distance. */
+interface LengthTable {
+    readonly dim: 2 | 3;
+    readonly runs: readonly LengthRun[];
+    /** Pen-order length, closing edges included. */
+    readonly total: number;
+    /** Where each run starts, `runs.length + 1` entries; the last is `total`. */
+    readonly runStart: Float64Array;
+    /** The anchor range: per subpath, the segments between its anchors, a closed one's closing edge included. */
+    readonly segments: number;
+}
+/**
+ * The length table of `runs`, in `dim` components per point. `anchorSources`
+ * (from `resolveCornersWithSources`) maps the anchors of a corner-expanded path
+ * back to the authored ones, so anchor queries answer in authored numbering:
+ * an anchor rounded into an arc sits at the arc's midpoint.
+ */
+declare function lengthTable(runs: readonly LengthRun[], dim: 2 | 3, anchorSources?: Uint32Array | null): LengthTable;
+/** The pen-order length at authored anchor position `anchor`; `3.5` is halfway
+ *  along the segment from anchor 3 by length. Clamps to the path. */
+declare function lengthAtAnchor(t: LengthTable, anchor: number): number;
+/** The authored anchor position at pen length `s`: the inverse of
+ *  {@link lengthAtAnchor}. Where a pen lift puts two anchors at one length,
+ *  the later. Clamps to the path. */
+declare function anchorAtLength(t: LengthTable, s: number): number;
+/** The pen-order length at the start of subpath `subpath`; a fractional part
+ *  goes that share of the way along it by length. Clamps to the path. */
+declare function lengthAtSubpath(t: LengthTable, subpath: number): number;
+/** The pen-order length at fraction `f` of the anchor range: each segment an
+ *  equal share, a pen lift none. Clamps to the path. */
+declare function lengthAtSegmentFraction(t: LengthTable, f: number): number;
+/**
+ * The anchor a closed run's closing edge ends at when that anchor was dropped
+ * as a duplicate of the first point: `closeAnchor`, else the anchor the last
+ * point is heading toward. `undefined` when none was dropped, so the edge
+ * ends at the run's first anchor. `dim` is the run's components per point.
+ */
+declare function closingAnchor(run: LengthRun, dim?: 2 | 3): number | undefined;
+
+export { type LengthTable as L, type LengthSpan as a, type LengthRun as b, anchorAtLength as c, closingAnchor as d, lengthAtSegmentFraction as e, lengthAtSubpath as f, lengthTable as g, lengthAtAnchor as l };

package/dist/tessellate/index.d.ts

@@ -1,4 +1,5 @@
 import { a as Path } from '../path-t80OoJnM.js';
+import { b as LengthRun } from '../lengthTable-Cv3W6lsH.js';
 
 /**
  * A tessellated representation of a Path, ready to upload to GL.
@@ -62,6 +63,9 @@ interface Polyline {
     anchorB?: Uint32Array;
     /** For each point, the arc-length fraction along (A, B). 0 at anchor A; for anchor-aligned, set to 0. */
     anchorT?: Float32Array;
+    /** A closed contour's last anchor when it repeated the first point and was
+     *  dropped for that; the closing edge ends at it. */
+    closeAnchor?: number;
     /** Per-point stroke width, populated by the tessellator when the Stroke
      *  carries `vertexWidths`. Undefined means uniform `Stroke.width`. */
     widths?: Float32Array;
@@ -102,6 +106,24 @@ declare function extractPolylines(path: Path, opts?: ExtractOptions): Polyline[]
  */
 declare function trimPolyline(pl: Polyline, startInset: number, endInset: number): Polyline | null;
 
+/** A curve position found on one flattening of its run. */
+interface PolylinePlace {
+    /** How far from the polyline's first point it sits, along the polyline: the polyline's own measure. */
+    length: number;
+    /** The point itself, on the curve rather than on the chord beside it. */
+    x: number;
+    y: number;
+}
+/**
+ * Where curve position (`segment`, `t`) falls on `pl`, a flattening of `run`.
+ * Segment `k` runs from `pl`'s `k`-th anchor-aligned point to the next, a
+ * closed `pl`'s closing edge last, as `pathLengthTable` counts them; `run`
+ * gives each curve's control points, and without one every segment is
+ * straight. The ends come from `pl`, so a run of the same shape carried
+ * elsewhere (a rect shifted by alignment) places onto it too.
+ */
+declare function polylineAtCurve(pl: Polyline, segment: number, t: number, run?: LengthRun): PolylinePlace;
+
 /**
  * The anchor parameters `(A, B, t)` of a point a fraction `frac` of the way
  * from one polyline point to the next: `t` interpolated when both lie between
@@ -109,4 +131,4 @@ declare function trimPolyline(pl: Polyline, startInset: number, endInset: number
  */
 declare function anchorParamsBetween(a0: number, b0: number, t0: number, a1: number, b1: number, t1: number, frac: number): [number, number, number];
 
-export { type ExtractOptions, MAX_EVENODD_RESOLVE_WORK, type Mesh, type Polyline, type TessellateOptions, anchorParamsBetween, extractPolylines, tessellate, trimPolyline };
+export { type ExtractOptions, MAX_EVENODD_RESOLVE_WORK, type Mesh, type Polyline, type PolylinePlace, type TessellateOptions, anchorParamsBetween, extractPolylines, polylineAtCurve, tessellate, trimPolyline };

package/dist/tessellate/index.js

@@ -1,6 +1,8 @@
-export { extractPolylines } from '../chunk-IDSKOHA4.js';
-export { MAX_EVENODD_RESOLVE_WORK, tessellate } from '../chunk-MIKP4V2C.js';
-import '../chunk-GA5R5KWD.js';
+export { extractPolylines, polylineAtCurve } from '../chunk-5W425HJA.js';
+import '../chunk-QSVZO7QZ.js';
+export { MAX_EVENODD_RESOLVE_WORK, tessellate } from '../chunk-VJG5ZWCR.js';
+import '../chunk-TBS4NHGQ.js';
+import '../chunk-IOD2NFHQ.js';
 import '../chunk-346XYYMX.js';
 import '../chunk-DNX24KBT.js';
 
@@ -26,6 +28,11 @@ function sampleAt(pl, cum, A, B, T, W, O, dist, vertexFollows) {
   const o = O ? O[i - 1] + (O[i] - O[i - 1]) * f : 0;
   return { x: px + (qx - px) * f, y: py + (qy - py) * f, a, b, t, w, o, next: i };
 }
+var ROUNDING = 4 * 2 ** -23;
+function nearVertex(pl, s, i) {
+  const x = pl.points[i * 2], y = pl.points[i * 2 + 1];
+  return Math.hypot(s.x - x, s.y - y) <= ROUNDING * Math.max(1, Math.abs(x), Math.abs(y));
+}
 function trimPolyline(pl, startInset, endInset) {
   const from = Math.max(0, startInset);
   const to = Math.max(0, endInset);
@@ -50,12 +57,24 @@ function trimPolyline(pl, startInset, endInset) {
   if (cutB - cutA <= EPS) return null;
   const head = sampleAt(pl, cum, A, B, T, W, O, cutA, true);
   const tail = sampleAt(pl, cum, A, B, T, W, O, cutB, false);
-  const points = [head.x, head.y];
-  const aOut = [head.a];
-  const bOut = [head.b];
-  const tOut = [head.t];
-  const wOut = W ? [head.w] : void 0;
-  const oOut = O ? [head.o] : void 0;
+  const interior = tail.next - head.next;
+  const headOnVertex = interior > 0 && nearVertex(pl, head, head.next);
+  const tailOnVertex = interior > 0 && nearVertex(pl, tail, tail.next - 1) && interior + (headOnVertex ? 0 : 1) >= 2;
+  const points = [];
+  const aOut = [];
+  const bOut = [];
+  const tOut = [];
+  const wOut = W ? [] : void 0;
+  const oOut = O ? [] : void 0;
+  const push = (s) => {
+    points.push(s.x, s.y);
+    aOut.push(s.a);
+    bOut.push(s.b);
+    tOut.push(s.t);
+    if (wOut) wOut.push(s.w);
+    if (oOut) oOut.push(s.o);
+  };
+  if (!headOnVertex) push(head);
   for (let i = head.next; i < tail.next; i++) {
     points.push(pl.points[i * 2], pl.points[i * 2 + 1]);
     aOut.push(A[i]);
@@ -64,12 +83,7 @@ function trimPolyline(pl, startInset, endInset) {
     if (wOut) wOut.push(W[i]);
     if (oOut) oOut.push(O[i]);
   }
-  points.push(tail.x, tail.y);
-  aOut.push(tail.a);
-  bOut.push(tail.b);
-  tOut.push(tail.t);
-  if (wOut) wOut.push(tail.w);
-  if (oOut) oOut.push(tail.o);
+  if (!tailOnVertex) push(tail);
   return {
     points,
     closed: false,

package/dist/tessellate/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/tessellate/anchorParams.ts","../../src/tessellate/trim.ts"],"names":[],"mappings":";;;;;;;AAKO,SAAS,oBACd,EAAA,EAAY,EAAA,EAAY,IACxB,EAAA,EAAY,EAAA,EAAY,IACxB,IAAA,EAC0B;AAC1B,EAAA,IAAI,EAAA,KAAO,EAAA,IAAM,EAAA,KAAO,EAAA,EAAI,OAAO,CAAC,EAAA,EAAI,EAAA,EAAI,EAAA,GAAA,CAAM,EAAA,GAAK,EAAA,IAAM,IAAI,CAAA;AACjE,EAAA,OAAO,IAAA,GAAO,GAAA,GAAM,CAAC,EAAA,EAAI,EAAA,EAAI,EAAE,CAAA,GAAI,CAAC,EAAA,EAAI,EAAA,EAAI,EAAE,CAAA;AAChD;;;ACAA,IAAM,GAAA,GAAM,IAAA;AAWZ,SAAS,QAAA,CACP,IAAc,GAAA,EACd,CAAA,EAAgB,GAAgB,CAAA,EAAiB,CAAA,EAA6B,CAAA,EAC9E,IAAA,EAGA,aAAA,EACQ;AACR,EAAA,MAAM,IAAI,GAAA,CAAI,MAAA;AACd,EAAA,IAAI,CAAA,GAAI,CAAA;AACR,EAAA,OAAO,CAAA,GAAI,CAAA,GAAI,CAAA,KAAM,aAAA,GAAgB,GAAA,CAAI,CAAC,CAAA,IAAK,IAAA,GAAO,GAAA,CAAI,CAAC,CAAA,GAAI,IAAA,CAAA,EAAO,CAAA,EAAA;AACtE,EAAA,MAAM,QAAA,GAAW,GAAA,CAAI,CAAA,GAAI,CAAC,CAAA;AAC1B,EAAA,MAAM,MAAA,GAAS,GAAA,CAAI,CAAC,CAAA,GAAI,QAAA;AACxB,EAAA,MAAM,CAAA,GAAI,MAAA,GAAS,GAAA,GAAA,CAAO,IAAA,GAAO,YAAY,MAAA,GAAS,CAAA;AAEtD,EAAA,MAAM,EAAA,GAAK,EAAA,CAAG,MAAA,CAAA,CAAQ,CAAA,GAAI,CAAA,IAAK,CAAC,CAAA,EAAG,EAAA,GAAK,EAAA,CAAG,MAAA,CAAA,CAAQ,CAAA,GAAI,CAAA,IAAK,IAAI,CAAC,CAAA;AACjE,EAAA,MAAM,EAAA,GAAK,EAAA,CAAG,MAAA,CAAO,CAAA,GAAI,CAAC,CAAA,EAAG,EAAA,GAAK,EAAA,CAAG,MAAA,CAAO,CAAA,GAAI,CAAA,GAAI,CAAC,CAAA;AAErD,EAAA,MAAM,CAAC,CAAA,EAAG,CAAA,EAAG,CAAC,CAAA,GAAI,mBAAA,CAAoB,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,EAAG,CAAA,CAAE,CAAC,CAAA,EAAG,CAAA,CAAE,CAAC,CAAA,EAAG,CAAA,CAAE,CAAC,CAAA,EAAG,CAAC,CAAA;AAEvF,EAAA,MAAM,CAAA,GAAI,CAAA,GAAI,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,GAAA,CAAK,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,CAAE,CAAA,GAAI,CAAC,KAAK,CAAA,GAAI,CAAA;AACjD,EAAA,MAAM,CAAA,GAAI,CAAA,GAAI,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,GAAA,CAAK,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,CAAE,CAAA,GAAI,CAAC,KAAK,CAAA,GAAI,CAAA;AACjD,EAAA,OAAO,EAAE,CAAA,EAAG,EAAA,GAAA,CAAM,EAAA,GAAK,EAAA,IAAM,GAAG,CAAA,EAAG,EAAA,GAAA,CAAM,EAAA,GAAK,EAAA,IAAM,GAAG,CAAA,EAAG,CAAA,EAAG,GAAG,CAAA,EAAG,CAAA,EAAG,MAAM,CAAA,EAAE;AAChF;AAUO,SAAS,YAAA,CACd,EAAA,EACA,UAAA,EACA,QAAA,EACiB;AACjB,EAAA,MAAM,IAAA,GAAO,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,UAAU,CAAA;AACnC,EAAA,MAAM,EAAA,GAAK,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,QAAQ,CAAA;AAC/B,EAAA,IAAI,IAAA,IAAQ,CAAA,IAAK,EAAA,IAAM,CAAA,EAAG,OAAO,EAAA;AACjC,EAAA,IAAI,EAAA,CAAG,QAAQ,OAAO,EAAA;AAEtB,EAAA,MAAM,CAAA,GAAI,EAAA,CAAG,MAAA,CAAO,MAAA,GAAS,CAAA;AAC7B,EAAA,IAAI,CAAA,GAAI,GAAG,OAAO,IAAA;AAElB,EAAA,MAAM,CAAA,GAAI,EAAA,CAAG,OAAA,IAAW,IAAI,YAAY,CAAC,CAAA;AACzC,EAAA,MAAM,CAAA,GAAI,EAAA,CAAG,OAAA,IAAW,IAAI,YAAY,CAAC,CAAA;AACzC,EAAA,MAAM,CAAA,GAAI,EAAA,CAAG,OAAA,IAAW,IAAI,aAAa,CAAC,CAAA;AAC1C,EAAA,MAAM,IAAI,EAAA,CAAG,MAAA;AACb,EAAA,MAAM,IAAI,EAAA,CAAG,OAAA;AAEb,EAAA,MAAM,GAAA,GAAM,IAAI,YAAA,CAAa,CAAC,CAAA;AAC9B,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA,EAAA,EAAK;AAC1B,IAAA,MAAM,EAAA,GAAK,EAAA,CAAG,MAAA,CAAO,CAAA,GAAI,CAAC,IAAI,EAAA,CAAG,MAAA,CAAA,CAAQ,CAAA,GAAI,CAAA,IAAK,CAAC,CAAA;AACnD,IAAA,MAAM,EAAA,GAAK,EAAA,CAAG,MAAA,CAAO,CAAA,GAAI,CAAA,GAAI,CAAC,CAAA,GAAI,EAAA,CAAG,MAAA,CAAA,CAAQ,CAAA,GAAI,CAAA,IAAK,CAAA,GAAI,CAAC,CAAA;AAC3D,IAAA,GAAA,CAAI,CAAC,IAAI,GAAA,CAAI,CAAA,GAAI,CAAC,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,EAAA,EAAI,EAAE,CAAA;AAAA,EACzC;AACA,EAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,CAAA,GAAI,CAAC,CAAA;AACvB,EAAA,MAAM,IAAA,GAAO,IAAA;AACb,EAAA,MAAM,OAAO,KAAA,GAAQ,EAAA;AACrB,EAAA,IAAI,IAAA,GAAO,IAAA,IAAQ,GAAA,EAAK,OAAO,IAAA;AAE/B,EAAA,MAAM,IAAA,GAAO,QAAA,CAAS,EAAA,EAAI,GAAA,EAAK,CAAA,EAAG,GAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,IAAA,EAAM,IAAI,CAAA;AACxD,EAAA,MAAM,IAAA,GAAO,QAAA,CAAS,EAAA,EAAI,GAAA,EAAK,CAAA,EAAG,GAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,IAAA,EAAM,KAAK,CAAA;AAEzD,EAAA,MAAM,MAAA,GAAmB,CAAC,IAAA,CAAK,CAAA,EAAG,KAAK,CAAC,CAAA;AACxC,EAAA,MAAM,IAAA,GAAiB,CAAC,IAAA,CAAK,CAAC,CAAA;AAC9B,EAAA,MAAM,IAAA,GAAiB,CAAC,IAAA,CAAK,CAAC,CAAA;AAC9B,EAAA,MAAM,IAAA,GAAiB,CAAC,IAAA,CAAK,CAAC,CAAA;AAC9B,EAAA,MAAM,IAAA,GAA6B,CAAA,GAAI,CAAC,IAAA,CAAK,CAAC,CAAA,GAAI,MAAA;AAClD,EAAA,MAAM,IAAA,GAA6B,CAAA,GAAI,CAAC,IAAA,CAAK,CAAC,CAAA,GAAI,MAAA;AAElD,EAAA,KAAA,IAAS,IAAI,IAAA,CAAK,IAAA,EAAM,CAAA,GAAI,IAAA,CAAK,MAAM,CAAA,EAAA,EAAK;AAC1C,IAAA,MAAA,CAAO,IAAA,CAAK,EAAA,CAAG,MAAA,CAAO,CAAA,GAAI,CAAC,CAAA,EAAG,EAAA,CAAG,MAAA,CAAO,CAAA,GAAI,CAAA,GAAI,CAAC,CAAC,CAAA;AAClD,IAAA,IAAA,CAAK,IAAA,CAAK,CAAA,CAAE,CAAC,CAAC,CAAA;AAAG,IAAA,IAAA,CAAK,IAAA,CAAK,CAAA,CAAE,CAAC,CAAC,CAAA;AAAG,IAAA,IAAA,CAAK,IAAA,CAAK,CAAA,CAAE,CAAC,CAAC,CAAA;AAChD,IAAA,IAAI,IAAA,EAAM,IAAA,CAAK,IAAA,CAAK,CAAA,CAAG,CAAC,CAAC,CAAA;AACzB,IAAA,IAAI,IAAA,EAAM,IAAA,CAAK,IAAA,CAAK,CAAA,CAAG,CAAC,CAAC,CAAA;AAAA,EAC3B;AAEA,EAAA,MAAA,CAAO,IAAA,CAAK,IAAA,CAAK,CAAA,EAAG,IAAA,CAAK,CAAC,CAAA;AAC1B,EAAA,IAAA,CAAK,IAAA,CAAK,KAAK,CAAC,CAAA;AAAG,EAAA,IAAA,CAAK,IAAA,CAAK,KAAK,CAAC,CAAA;AAAG,EAAA,IAAA,CAAK,IAAA,CAAK,KAAK,CAAC,CAAA;AACtD,EAAA,IAAI,IAAA,EAAM,IAAA,CAAK,IAAA,CAAK,IAAA,CAAK,CAAC,CAAA;AAC1B,EAAA,IAAI,IAAA,EAAM,IAAA,CAAK,IAAA,CAAK,IAAA,CAAK,CAAC,CAAA;AAE1B,EAAA,OAAO;AAAA,IACL,MAAA;AAAA,IACA,MAAA,EAAQ,KAAA;AAAA,IACR,OAAA,EAAS,IAAI,WAAA,CAAY,IAAI,CAAA;AAAA,IAC7B,OAAA,EAAS,IAAI,WAAA,CAAY,IAAI,CAAA;AAAA,IAC7B,OAAA,EAAS,IAAI,YAAA,CAAa,IAAI,CAAA;AAAA,IAC9B,GAAI,OAAO,EAAE,MAAA,EAAQ,IAAI,YAAA,CAAa,IAAI,CAAA,EAAE,GAAI,EAAC;AAAA,IACjD,GAAI,OAAO,EAAE,OAAA,EAAS,IAAI,YAAA,CAAa,IAAI,CAAA,EAAE,GAAI;AAAC,GACpD;AACF","file":"index.js","sourcesContent":["/**\n * The anchor parameters `(A, B, t)` of a point a fraction `frac` of the way\n * from one polyline point to the next: `t` interpolated when both lie between\n * the same two anchors, otherwise the nearer point's own.\n */\nexport function anchorParamsBetween(\n  a0: number, b0: number, t0: number,\n  a1: number, b1: number, t1: number,\n  frac: number,\n): [number, number, number] {\n  if (a0 === a1 && b0 === b1) return [a0, b0, t0 + (t1 - t0) * frac];\n  return frac < 0.5 ? [a0, b0, t0] : [a1, b1, t1];\n}\n","/**\n * Shortening a flattened subpath so a filled marker is not speared by its own\n * line. SVG has no equivalent — it paints the marker over a full-length\n * stroke — so this is the one place our rendering deliberately differs.\n *\n * Runs before dash splitting, so a dash pattern fits the visible line rather\n * than running off under the head.\n */\n\nimport { anchorParamsBetween } from './anchorParams';\nimport type { Polyline } from './polyline';\n\nconst EPS = 1e-9;\n\ninterface Sample {\n  x: number; y: number;\n  a: number; b: number; t: number;\n  w: number;\n  o: number;\n  /** Index of the first original point at or after this sample. */\n  next: number;\n}\n\nfunction sampleAt(\n  pl: Polyline, cum: Float64Array,\n  A: Uint32Array, B: Uint32Array, T: Float32Array, W: Float32Array | undefined, O: Float32Array | undefined,\n  dist: number,\n  /** For a cut landing exactly on a vertex: whether the vertex belongs to the\n   *  run after the sample (a head) or before it (a tail), so it is kept once. */\n  vertexFollows: boolean,\n): Sample {\n  const n = cum.length;\n  let i = 1;\n  while (i < n - 1 && (vertexFollows ? cum[i] <= dist : cum[i] < dist)) i++;\n  const segStart = cum[i - 1];\n  const segLen = cum[i] - segStart;\n  const f = segLen > EPS ? (dist - segStart) / segLen : 0;\n\n  const px = pl.points[(i - 1) * 2], py = pl.points[(i - 1) * 2 + 1];\n  const qx = pl.points[i * 2], qy = pl.points[i * 2 + 1];\n\n  const [a, b, t] = anchorParamsBetween(A[i - 1], B[i - 1], T[i - 1], A[i], B[i], T[i], f);\n\n  const w = W ? W[i - 1] + (W[i] - W[i - 1]) * f : 0;\n  const o = O ? O[i - 1] + (O[i] - O[i - 1]) * f : 0;\n  return { x: px + (qx - px) * f, y: py + (qy - py) * f, a, b, t, w, o, next: i };\n}\n\n/**\n * Shorten `pl` by `startInset` from its first point and `endInset` from its\n * last, both in the same world units as the points.\n *\n * Returns `pl` itself when there is nothing to do (both insets zero, or the\n * subpath is closed and so has no free ends), and `null` when the insets\n * consume the whole run — a caller should then draw no ribbon at all.\n */\nexport function trimPolyline(\n  pl: Polyline,\n  startInset: number,\n  endInset: number,\n): Polyline | null {\n  const from = Math.max(0, startInset);\n  const to = Math.max(0, endInset);\n  if (from <= 0 && to <= 0) return pl;\n  if (pl.closed) return pl;\n\n  const n = pl.points.length / 2;\n  if (n < 2) return null;\n\n  const A = pl.anchorA ?? new Uint32Array(n);\n  const B = pl.anchorB ?? new Uint32Array(n);\n  const T = pl.anchorT ?? new Float32Array(n);\n  const W = pl.widths;\n  const O = pl.offsets;\n\n  const cum = new Float64Array(n);\n  for (let i = 1; i < n; i++) {\n    const dx = pl.points[i * 2] - pl.points[(i - 1) * 2];\n    const dy = pl.points[i * 2 + 1] - pl.points[(i - 1) * 2 + 1];\n    cum[i] = cum[i - 1] + Math.hypot(dx, dy);\n  }\n  const total = cum[n - 1];\n  const cutA = from;\n  const cutB = total - to;\n  if (cutB - cutA <= EPS) return null;\n\n  const head = sampleAt(pl, cum, A, B, T, W, O, cutA, true);\n  const tail = sampleAt(pl, cum, A, B, T, W, O, cutB, false);\n\n  const points: number[] = [head.x, head.y];\n  const aOut: number[] = [head.a];\n  const bOut: number[] = [head.b];\n  const tOut: number[] = [head.t];\n  const wOut: number[] | undefined = W ? [head.w] : undefined;\n  const oOut: number[] | undefined = O ? [head.o] : undefined;\n\n  for (let i = head.next; i < tail.next; i++) {\n    points.push(pl.points[i * 2], pl.points[i * 2 + 1]);\n    aOut.push(A[i]); bOut.push(B[i]); tOut.push(T[i]);\n    if (wOut) wOut.push(W![i]);\n    if (oOut) oOut.push(O![i]);\n  }\n\n  points.push(tail.x, tail.y);\n  aOut.push(tail.a); bOut.push(tail.b); tOut.push(tail.t);\n  if (wOut) wOut.push(tail.w);\n  if (oOut) oOut.push(tail.o);\n\n  return {\n    points,\n    closed: false,\n    anchorA: new Uint32Array(aOut),\n    anchorB: new Uint32Array(bOut),\n    anchorT: new Float32Array(tOut),\n    ...(wOut ? { widths: new Float32Array(wOut) } : {}),\n    ...(oOut ? { offsets: new Float32Array(oOut) } : {}),\n  };\n}\n"]}
+{"version":3,"sources":["../../src/tessellate/anchorParams.ts","../../src/tessellate/trim.ts"],"names":[],"mappings":";;;;;;;;;AAKO,SAAS,oBACd,EAAA,EAAY,EAAA,EAAY,IACxB,EAAA,EAAY,EAAA,EAAY,IACxB,IAAA,EAC0B;AAC1B,EAAA,IAAI,EAAA,KAAO,EAAA,IAAM,EAAA,KAAO,EAAA,EAAI,OAAO,CAAC,EAAA,EAAI,EAAA,EAAI,EAAA,GAAA,CAAM,EAAA,GAAK,EAAA,IAAM,IAAI,CAAA;AACjE,EAAA,OAAO,IAAA,GAAO,GAAA,GAAM,CAAC,EAAA,EAAI,EAAA,EAAI,EAAE,CAAA,GAAI,CAAC,EAAA,EAAI,EAAA,EAAI,EAAE,CAAA;AAChD;;;ACAA,IAAM,GAAA,GAAM,IAAA;AAWZ,SAAS,QAAA,CACP,IAAc,GAAA,EACd,CAAA,EAAgB,GAAgB,CAAA,EAAiB,CAAA,EAA6B,CAAA,EAC9E,IAAA,EAGA,aAAA,EACQ;AACR,EAAA,MAAM,IAAI,GAAA,CAAI,MAAA;AACd,EAAA,IAAI,CAAA,GAAI,CAAA;AACR,EAAA,OAAO,CAAA,GAAI,CAAA,GAAI,CAAA,KAAM,aAAA,GAAgB,GAAA,CAAI,CAAC,CAAA,IAAK,IAAA,GAAO,GAAA,CAAI,CAAC,CAAA,GAAI,IAAA,CAAA,EAAO,CAAA,EAAA;AACtE,EAAA,MAAM,QAAA,GAAW,GAAA,CAAI,CAAA,GAAI,CAAC,CAAA;AAC1B,EAAA,MAAM,MAAA,GAAS,GAAA,CAAI,CAAC,CAAA,GAAI,QAAA;AACxB,EAAA,MAAM,CAAA,GAAI,MAAA,GAAS,GAAA,GAAA,CAAO,IAAA,GAAO,YAAY,MAAA,GAAS,CAAA;AAEtD,EAAA,MAAM,EAAA,GAAK,EAAA,CAAG,MAAA,CAAA,CAAQ,CAAA,GAAI,CAAA,IAAK,CAAC,CAAA,EAAG,EAAA,GAAK,EAAA,CAAG,MAAA,CAAA,CAAQ,CAAA,GAAI,CAAA,IAAK,IAAI,CAAC,CAAA;AACjE,EAAA,MAAM,EAAA,GAAK,EAAA,CAAG,MAAA,CAAO,CAAA,GAAI,CAAC,CAAA,EAAG,EAAA,GAAK,EAAA,CAAG,MAAA,CAAO,CAAA,GAAI,CAAA,GAAI,CAAC,CAAA;AAErD,EAAA,MAAM,CAAC,CAAA,EAAG,CAAA,EAAG,CAAC,CAAA,GAAI,mBAAA,CAAoB,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,EAAG,CAAA,CAAE,CAAC,CAAA,EAAG,CAAA,CAAE,CAAC,CAAA,EAAG,CAAA,CAAE,CAAC,CAAA,EAAG,CAAC,CAAA;AAEvF,EAAA,MAAM,CAAA,GAAI,CAAA,GAAI,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,GAAA,CAAK,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,CAAE,CAAA,GAAI,CAAC,KAAK,CAAA,GAAI,CAAA;AACjD,EAAA,MAAM,CAAA,GAAI,CAAA,GAAI,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,GAAA,CAAK,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,CAAE,CAAA,GAAI,CAAC,KAAK,CAAA,GAAI,CAAA;AACjD,EAAA,OAAO,EAAE,CAAA,EAAG,EAAA,GAAA,CAAM,EAAA,GAAK,EAAA,IAAM,GAAG,CAAA,EAAG,EAAA,GAAA,CAAM,EAAA,GAAK,EAAA,IAAM,GAAG,CAAA,EAAG,CAAA,EAAG,GAAG,CAAA,EAAG,CAAA,EAAG,MAAM,CAAA,EAAE;AAChF;AAIA,IAAM,QAAA,GAAW,IAAI,CAAA,IAAK,GAAA;AAE1B,SAAS,UAAA,CAAW,EAAA,EAAc,CAAA,EAAW,CAAA,EAAoB;AAC/D,EAAA,MAAM,CAAA,GAAI,EAAA,CAAG,MAAA,CAAO,CAAA,GAAI,CAAC,CAAA,EAAG,CAAA,GAAI,EAAA,CAAG,MAAA,CAAO,CAAA,GAAI,CAAA,GAAI,CAAC,CAAA;AACnD,EAAA,OAAO,IAAA,CAAK,MAAM,CAAA,CAAE,CAAA,GAAI,GAAG,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,IAAK,QAAA,GAAW,KAAK,GAAA,CAAI,CAAA,EAAG,KAAK,GAAA,CAAI,CAAC,GAAG,IAAA,CAAK,GAAA,CAAI,CAAC,CAAC,CAAA;AACxF;AAUO,SAAS,YAAA,CACd,EAAA,EACA,UAAA,EACA,QAAA,EACiB;AACjB,EAAA,MAAM,IAAA,GAAO,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,UAAU,CAAA;AACnC,EAAA,MAAM,EAAA,GAAK,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,QAAQ,CAAA;AAC/B,EAAA,IAAI,IAAA,IAAQ,CAAA,IAAK,EAAA,IAAM,CAAA,EAAG,OAAO,EAAA;AACjC,EAAA,IAAI,EAAA,CAAG,QAAQ,OAAO,EAAA;AAEtB,EAAA,MAAM,CAAA,GAAI,EAAA,CAAG,MAAA,CAAO,MAAA,GAAS,CAAA;AAC7B,EAAA,IAAI,CAAA,GAAI,GAAG,OAAO,IAAA;AAElB,EAAA,MAAM,CAAA,GAAI,EAAA,CAAG,OAAA,IAAW,IAAI,YAAY,CAAC,CAAA;AACzC,EAAA,MAAM,CAAA,GAAI,EAAA,CAAG,OAAA,IAAW,IAAI,YAAY,CAAC,CAAA;AACzC,EAAA,MAAM,CAAA,GAAI,EAAA,CAAG,OAAA,IAAW,IAAI,aAAa,CAAC,CAAA;AAC1C,EAAA,MAAM,IAAI,EAAA,CAAG,MAAA;AACb,EAAA,MAAM,IAAI,EAAA,CAAG,OAAA;AAEb,EAAA,MAAM,GAAA,GAAM,IAAI,YAAA,CAAa,CAAC,CAAA;AAC9B,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA,EAAA,EAAK;AAC1B,IAAA,MAAM,EAAA,GAAK,EAAA,CAAG,MAAA,CAAO,CAAA,GAAI,CAAC,IAAI,EAAA,CAAG,MAAA,CAAA,CAAQ,CAAA,GAAI,CAAA,IAAK,CAAC,CAAA;AACnD,IAAA,MAAM,EAAA,GAAK,EAAA,CAAG,MAAA,CAAO,CAAA,GAAI,CAAA,GAAI,CAAC,CAAA,GAAI,EAAA,CAAG,MAAA,CAAA,CAAQ,CAAA,GAAI,CAAA,IAAK,CAAA,GAAI,CAAC,CAAA;AAC3D,IAAA,GAAA,CAAI,CAAC,IAAI,GAAA,CAAI,CAAA,GAAI,CAAC,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,EAAA,EAAI,EAAE,CAAA;AAAA,EACzC;AACA,EAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,CAAA,GAAI,CAAC,CAAA;AACvB,EAAA,MAAM,IAAA,GAAO,IAAA;AACb,EAAA,MAAM,OAAO,KAAA,GAAQ,EAAA;AACrB,EAAA,IAAI,IAAA,GAAO,IAAA,IAAQ,GAAA,EAAK,OAAO,IAAA;AAE/B,EAAA,MAAM,IAAA,GAAO,QAAA,CAAS,EAAA,EAAI,GAAA,EAAK,CAAA,EAAG,GAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,IAAA,EAAM,IAAI,CAAA;AACxD,EAAA,MAAM,IAAA,GAAO,QAAA,CAAS,EAAA,EAAI,GAAA,EAAK,CAAA,EAAG,GAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,IAAA,EAAM,KAAK,CAAA;AAGzD,EAAA,MAAM,QAAA,GAAW,IAAA,CAAK,IAAA,GAAO,IAAA,CAAK,IAAA;AAClC,EAAA,MAAM,eAAe,QAAA,GAAW,CAAA,IAAK,WAAW,EAAA,EAAI,IAAA,EAAM,KAAK,IAAI,CAAA;AACnE,EAAA,MAAM,YAAA,GAAe,QAAA,GAAW,CAAA,IAAK,UAAA,CAAW,EAAA,EAAI,IAAA,EAAM,IAAA,CAAK,IAAA,GAAO,CAAC,CAAA,IAAK,QAAA,IAAY,YAAA,GAAe,IAAI,CAAA,CAAA,IAAM,CAAA;AAEjH,EAAA,MAAM,SAAmB,EAAC;AAC1B,EAAA,MAAM,OAAiB,EAAC;AACxB,EAAA,MAAM,OAAiB,EAAC;AACxB,EAAA,MAAM,OAAiB,EAAC;AACxB,EAAA,MAAM,IAAA,GAA6B,CAAA,GAAI,EAAC,GAAI,MAAA;AAC5C,EAAA,MAAM,IAAA,GAA6B,CAAA,GAAI,EAAC,GAAI,MAAA;AAC5C,EAAA,MAAM,IAAA,GAAO,CAAC,CAAA,KAAc;AAC1B,IAAA,MAAA,CAAO,IAAA,CAAK,CAAA,CAAE,CAAA,EAAG,CAAA,CAAE,CAAC,CAAA;AACpB,IAAA,IAAA,CAAK,IAAA,CAAK,EAAE,CAAC,CAAA;AAAG,IAAA,IAAA,CAAK,IAAA,CAAK,EAAE,CAAC,CAAA;AAAG,IAAA,IAAA,CAAK,IAAA,CAAK,EAAE,CAAC,CAAA;AAC7C,IAAA,IAAI,IAAA,EAAM,IAAA,CAAK,IAAA,CAAK,CAAA,CAAE,CAAC,CAAA;AACvB,IAAA,IAAI,IAAA,EAAM,IAAA,CAAK,IAAA,CAAK,CAAA,CAAE,CAAC,CAAA;AAAA,EACzB,CAAA;AAEA,EAAA,IAAI,CAAC,YAAA,EAAc,IAAA,CAAK,IAAI,CAAA;AAC5B,EAAA,KAAA,IAAS,IAAI,IAAA,CAAK,IAAA,EAAM,CAAA,GAAI,IAAA,CAAK,MAAM,CAAA,EAAA,EAAK;AAC1C,IAAA,MAAA,CAAO,IAAA,CAAK,EAAA,CAAG,MAAA,CAAO,CAAA,GAAI,CAAC,CAAA,EAAG,EAAA,CAAG,MAAA,CAAO,CAAA,GAAI,CAAA,GAAI,CAAC,CAAC,CAAA;AAClD,IAAA,IAAA,CAAK,IAAA,CAAK,CAAA,CAAE,CAAC,CAAC,CAAA;AAAG,IAAA,IAAA,CAAK,IAAA,CAAK,CAAA,CAAE,CAAC,CAAC,CAAA;AAAG,IAAA,IAAA,CAAK,IAAA,CAAK,CAAA,CAAE,CAAC,CAAC,CAAA;AAChD,IAAA,IAAI,IAAA,EAAM,IAAA,CAAK,IAAA,CAAK,CAAA,CAAG,CAAC,CAAC,CAAA;AACzB,IAAA,IAAI,IAAA,EAAM,IAAA,CAAK,IAAA,CAAK,CAAA,CAAG,CAAC,CAAC,CAAA;AAAA,EAC3B;AACA,EAAA,IAAI,CAAC,YAAA,EAAc,IAAA,CAAK,IAAI,CAAA;AAE5B,EAAA,OAAO;AAAA,IACL,MAAA;AAAA,IACA,MAAA,EAAQ,KAAA;AAAA,IACR,OAAA,EAAS,IAAI,WAAA,CAAY,IAAI,CAAA;AAAA,IAC7B,OAAA,EAAS,IAAI,WAAA,CAAY,IAAI,CAAA;AAAA,IAC7B,OAAA,EAAS,IAAI,YAAA,CAAa,IAAI,CAAA;AAAA,IAC9B,GAAI,OAAO,EAAE,MAAA,EAAQ,IAAI,YAAA,CAAa,IAAI,CAAA,EAAE,GAAI,EAAC;AAAA,IACjD,GAAI,OAAO,EAAE,OAAA,EAAS,IAAI,YAAA,CAAa,IAAI,CAAA,EAAE,GAAI;AAAC,GACpD;AACF","file":"index.js","sourcesContent":["/**\n * The anchor parameters `(A, B, t)` of a point a fraction `frac` of the way\n * from one polyline point to the next: `t` interpolated when both lie between\n * the same two anchors, otherwise the nearer point's own.\n */\nexport function anchorParamsBetween(\n  a0: number, b0: number, t0: number,\n  a1: number, b1: number, t1: number,\n  frac: number,\n): [number, number, number] {\n  if (a0 === a1 && b0 === b1) return [a0, b0, t0 + (t1 - t0) * frac];\n  return frac < 0.5 ? [a0, b0, t0] : [a1, b1, t1];\n}\n","/**\n * Shortening a flattened subpath so a filled marker is not speared by its own\n * line. SVG has no equivalent — it paints the marker over a full-length\n * stroke — so this is the one place our rendering deliberately differs.\n *\n * Runs before dash splitting, so a dash pattern fits the visible line rather\n * than running off under the head.\n */\n\nimport { anchorParamsBetween } from './anchorParams';\nimport type { Polyline } from './polyline';\n\nconst EPS = 1e-9;\n\ninterface Sample {\n  x: number; y: number;\n  a: number; b: number; t: number;\n  w: number;\n  o: number;\n  /** Index of the first original point at or after this sample. */\n  next: number;\n}\n\nfunction sampleAt(\n  pl: Polyline, cum: Float64Array,\n  A: Uint32Array, B: Uint32Array, T: Float32Array, W: Float32Array | undefined, O: Float32Array | undefined,\n  dist: number,\n  /** For a cut landing exactly on a vertex: whether the vertex belongs to the\n   *  run after the sample (a head) or before it (a tail), so it is kept once. */\n  vertexFollows: boolean,\n): Sample {\n  const n = cum.length;\n  let i = 1;\n  while (i < n - 1 && (vertexFollows ? cum[i] <= dist : cum[i] < dist)) i++;\n  const segStart = cum[i - 1];\n  const segLen = cum[i] - segStart;\n  const f = segLen > EPS ? (dist - segStart) / segLen : 0;\n\n  const px = pl.points[(i - 1) * 2], py = pl.points[(i - 1) * 2 + 1];\n  const qx = pl.points[i * 2], qy = pl.points[i * 2 + 1];\n\n  const [a, b, t] = anchorParamsBetween(A[i - 1], B[i - 1], T[i - 1], A[i], B[i], T[i], f);\n\n  const w = W ? W[i - 1] + (W[i] - W[i - 1]) * f : 0;\n  const o = O ? O[i - 1] + (O[i] - O[i - 1]) * f : 0;\n  return { x: px + (qx - px) * f, y: py + (qy - py) * f, a, b, t, w, o, next: i };\n}\n\n/** Float32 rounding at a coordinate's magnitude, with headroom: what points stored as\n *  `Float32Array` and lengths summed in doubles can disagree by. */\nconst ROUNDING = 4 * 2 ** -23;\n\nfunction nearVertex(pl: Polyline, s: Sample, i: number): boolean {\n  const x = pl.points[i * 2], y = pl.points[i * 2 + 1];\n  return Math.hypot(s.x - x, s.y - y) <= ROUNDING * Math.max(1, Math.abs(x), Math.abs(y));\n}\n\n/**\n * Shorten `pl` by `startInset` from its first point and `endInset` from its\n * last, both in the same world units as the points.\n *\n * Returns `pl` itself when there is nothing to do (both insets zero, or the\n * subpath is closed and so has no free ends), and `null` when the insets\n * consume the whole run — a caller should then draw no ribbon at all.\n */\nexport function trimPolyline(\n  pl: Polyline,\n  startInset: number,\n  endInset: number,\n): Polyline | null {\n  const from = Math.max(0, startInset);\n  const to = Math.max(0, endInset);\n  if (from <= 0 && to <= 0) return pl;\n  if (pl.closed) return pl;\n\n  const n = pl.points.length / 2;\n  if (n < 2) return null;\n\n  const A = pl.anchorA ?? new Uint32Array(n);\n  const B = pl.anchorB ?? new Uint32Array(n);\n  const T = pl.anchorT ?? new Float32Array(n);\n  const W = pl.widths;\n  const O = pl.offsets;\n\n  const cum = new Float64Array(n);\n  for (let i = 1; i < n; i++) {\n    const dx = pl.points[i * 2] - pl.points[(i - 1) * 2];\n    const dy = pl.points[i * 2 + 1] - pl.points[(i - 1) * 2 + 1];\n    cum[i] = cum[i - 1] + Math.hypot(dx, dy);\n  }\n  const total = cum[n - 1];\n  const cutA = from;\n  const cutB = total - to;\n  if (cutB - cutA <= EPS) return null;\n\n  const head = sampleAt(pl, cum, A, B, T, W, O, cutA, true);\n  const tail = sampleAt(pl, cum, A, B, T, W, O, cutB, false);\n  // A cut within float rounding of a kept vertex is that vertex: the sliver\n  // between them has a direction made of noise, which skews a cap or a head.\n  const interior = tail.next - head.next;\n  const headOnVertex = interior > 0 && nearVertex(pl, head, head.next);\n  const tailOnVertex = interior > 0 && nearVertex(pl, tail, tail.next - 1) && interior + (headOnVertex ? 0 : 1) >= 2;\n\n  const points: number[] = [];\n  const aOut: number[] = [];\n  const bOut: number[] = [];\n  const tOut: number[] = [];\n  const wOut: number[] | undefined = W ? [] : undefined;\n  const oOut: number[] | undefined = O ? [] : undefined;\n  const push = (s: Sample) => {\n    points.push(s.x, s.y);\n    aOut.push(s.a); bOut.push(s.b); tOut.push(s.t);\n    if (wOut) wOut.push(s.w);\n    if (oOut) oOut.push(s.o);\n  };\n\n  if (!headOnVertex) push(head);\n  for (let i = head.next; i < tail.next; i++) {\n    points.push(pl.points[i * 2], pl.points[i * 2 + 1]);\n    aOut.push(A[i]); bOut.push(B[i]); tOut.push(T[i]);\n    if (wOut) wOut.push(W![i]);\n    if (oOut) oOut.push(O![i]);\n  }\n  if (!tailOnVertex) push(tail);\n\n  return {\n    points,\n    closed: false,\n    anchorA: new Uint32Array(aOut),\n    anchorB: new Uint32Array(bOut),\n    anchorT: new Float32Array(tOut),\n    ...(wOut ? { widths: new Float32Array(wOut) } : {}),\n    ...(oOut ? { offsets: new Float32Array(oOut) } : {}),\n  };\n}\n"]}

package/dist/warp/index.js

@@ -1,7 +1,8 @@
-import { boundsOfPath, keepCorner, fitPointRun } from '../chunk-STYO7J4Y.js';
+import { boundsOfPath, keepCorner, fitPointRun } from '../chunk-ZV24QZ6X.js';
 import { pathToAnchors, anchorsToPath } from '../chunk-HTT5AQIU.js';
-import { nestRings, flattenPolygon, resolveCrossings } from '../chunk-MIKP4V2C.js';
-import { pointInPolygon } from '../chunk-GA5R5KWD.js';
+import { nestRings, flattenPolygon, resolveCrossings } from '../chunk-VJG5ZWCR.js';
+import { pointInPolygon } from '../chunk-TBS4NHGQ.js';
+import '../chunk-IOD2NFHQ.js';
 import { cubicPointAt, addOrigin, nearestOnLine, pointSegmentDist } from '../chunk-346XYYMX.js';
 import '../chunk-DNX24KBT.js';
 import earcut from 'earcut';