@weasel-js/core 1.7.2 → 1.8.0

package/dist/renderer/batchClip.js

@@ -0,0 +1,46 @@
+//#region src/renderer/batchClip.ts
+function e(e, t) {
+	if (e.kind !== "rect" || !(t[1] === 0 && t[3] === 0 || t[0] === 0 && t[4] === 0)) return null;
+	let n = t[0] * e.x + t[3] * e.y + t[6], r = t[1] * e.x + t[4] * e.y + t[7], i = e.x + e.width, a = e.y + e.height, o = t[0] * i + t[3] * a + t[6], s = t[1] * i + t[4] * a + t[7];
+	return {
+		x0: Math.min(n, o),
+		y0: Math.min(r, s),
+		x1: Math.max(n, o),
+		y1: Math.max(r, s)
+	};
+}
+function t(e, t) {
+	return {
+		x0: Math.max(e.x0, t.x0),
+		y0: Math.max(e.y0, t.y0),
+		x1: Math.min(e.x1, t.x1),
+		y1: Math.min(e.y1, t.y1)
+	};
+}
+function n(e, t, n, i, a, o) {
+	let s = r(e, t, n, 0, i.x0, 1, o);
+	return s = r(o, s, n, 0, i.x1, -1, a), s = r(a, s, n, 1, i.y0, 1, o), r(o, s, n, 1, i.y1, -1, a);
+}
+function r(e, t, n, r, i, a, o) {
+	if (t === 0) return 0;
+	let s = 0, c = t - 1, l = a * (e[c * n + r] - i) >= 0;
+	for (let u = 0; u < t; u++) {
+		let t = a * (e[u * n + r] - i) >= 0;
+		if (t !== l) {
+			let t = c * n, a = u * n, l = (i - e[t + r]) / (e[a + r] - e[t + r]), d = s * n;
+			for (let r = 0; r < n; r++) o[d + r] = e[t + r] + l * (e[a + r] - e[t + r]);
+			o[d + r] = i, s++;
+		}
+		if (t) {
+			let t = s * n, r = u * n;
+			for (let i = 0; i < n; i++) o[t + i] = e[r + i];
+			s++;
+		}
+		c = u, l = t;
+	}
+	return s;
+}
+//#endregion
+export { e as axisAlignedClipRect, n as clipConvexPolygon, t as intersectClipRects };
+
+//# sourceMappingURL=batchClip.js.map

package/dist/renderer/batchClip.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"batchClip.js","names":["axisAlignedClipRect","path","m","ax","ay","x1","y1","bx","by","intersectClipRects","a","b","clipConvexPolygon","count","clipEdge","src","n","stride","rect","tmp","dst","prev","prevIn","sign","axis","at","cur","curIn","t","o","k","c"],"sources":["../../src/renderer/batchClip.ts"],"sourcesContent":["/**\n * Clipping staged geometry to an axis-aligned rect on the CPU, so a rect clip\n * needs no stencil and does not break the run.\n *\n * A stencil clip is GL state, so content inside one cannot share a draw with\n * content outside it, and every clipped group paid a flush on the way in and\n * another on the way out. A rect under a transform that keeps it axis-aligned\n * is the common clip, and for that one the clip can ride the geometry instead:\n * cut each staged polygon to the rect before it joins the run.\n *\n * Exact, not approximate: every attribute a batch vertex carries is affine\n * across the polygon it belongs to, so interpolating along a cut edge gives\n * the value the rasterizer would have produced there, and the cut polygon\n * covers the same pixel centers the stencil would have passed.\n */\n\nimport type { Path } from '@weasel-js/geom';\nimport type { GlMat3 } from './math/mat3';\n\n/** In the space batch vertices are staged in: after the model transform,\n *  before the projection. */\nexport interface ClipRect {\n  x0: number;\n  y0: number;\n  x1: number;\n  y1: number;\n}\n\n/**\n * `path` under `m` as a `ClipRect`, or `null` when it is not one: not a rect\n * path, or a transform that rotates or skews it off the axes.\n */\nexport function axisAlignedClipRect(path: Path, m: GlMat3): ClipRect | null {\n  if (path.kind !== 'rect') return null;\n  const keepsAxes = (m[1] === 0 && m[3] === 0) || (m[0] === 0 && m[4] === 0);\n  if (!keepsAxes) return null;\n  const ax = m[0] * path.x + m[3] * path.y + m[6];\n  const ay = m[1] * path.x + m[4] * path.y + m[7];\n  const x1 = path.x + path.width;\n  const y1 = path.y + path.height;\n  const bx = m[0] * x1 + m[3] * y1 + m[6];\n  const by = m[1] * x1 + m[4] * y1 + m[7];\n  return {\n    x0: Math.min(ax, bx), y0: Math.min(ay, by),\n    x1: Math.max(ax, bx), y1: Math.max(ay, by),\n  };\n}\n\nexport function intersectClipRects(a: ClipRect, b: ClipRect): ClipRect {\n  return {\n    x0: Math.max(a.x0, b.x0), y0: Math.max(a.y0, b.y0),\n    x1: Math.min(a.x1, b.x1), y1: Math.min(a.y1, b.y1),\n  };\n}\n\n/**\n * Cut the convex polygon of `n` vertices in `src` (each `stride` floats, x and\n * y first) to `rect`, writing the result to `dst`. Returns the vertex count,\n * which is below 3 when nothing is left. `tmp` must hold as many floats as\n * `dst`; both need room for `n + 4` vertices.\n */\nexport function clipConvexPolygon(\n  src: Float32Array, n: number, stride: number, rect: ClipRect,\n  dst: Float32Array, tmp: Float32Array,\n): number {\n  // Four passes, ping-ponging so the last one lands in `dst`.\n  let count = clipEdge(src, n, stride, 0, rect.x0, 1, tmp);\n  count = clipEdge(tmp, count, stride, 0, rect.x1, -1, dst);\n  count = clipEdge(dst, count, stride, 1, rect.y0, 1, tmp);\n  return clipEdge(tmp, count, stride, 1, rect.y1, -1, dst);\n}\n\n/** One Sutherland–Hodgman pass: keep the side of `axis = at` where\n *  `sign * (v - at) >= 0`. */\nfunction clipEdge(\n  src: Float32Array, n: number, stride: number,\n  axis: 0 | 1, at: number, sign: 1 | -1, out: Float32Array,\n): number {\n  if (n === 0) return 0;\n  let m = 0;\n  let prev = n - 1;\n  let prevIn = sign * (src[prev * stride + axis] - at) >= 0;\n  for (let cur = 0; cur < n; cur++) {\n    const curIn = sign * (src[cur * stride + axis] - at) >= 0;\n    if (curIn !== prevIn) {\n      const a = prev * stride;\n      const b = cur * stride;\n      const t = (at - src[a + axis]) / (src[b + axis] - src[a + axis]);\n      const o = m * stride;\n      for (let k = 0; k < stride; k++) out[o + k] = src[a + k] + t * (src[b + k] - src[a + k]);\n      // On the line exactly, whatever the interpolation rounded to.\n      out[o + axis] = at;\n      m++;\n    }\n    if (curIn) {\n      const o = m * stride;\n      const c = cur * stride;\n      for (let k = 0; k < stride; k++) out[o + k] = src[c + k];\n      m++;\n    }\n    prev = cur;\n    prevIn = curIn;\n  }\n  return m;\n}\n"],"mappings":";AAgCA,SAAgBA,EAAoB,GAAY,GAA4B;CAG1E,IAFIC,EAAK,SAAS,UAEd,EADeC,EAAE,OAAO,KAAKA,EAAE,OAAO,KAAOA,EAAE,OAAO,KAAKA,EAAE,OAAO,IACxD,OAAO;CACvB,IAAMC,IAAKD,EAAE,KAAKD,EAAK,IAAIC,EAAE,KAAKD,EAAK,IAAIC,EAAE,IACvCE,IAAKF,EAAE,KAAKD,EAAK,IAAIC,EAAE,KAAKD,EAAK,IAAIC,EAAE,IACvCG,IAAKJ,EAAK,IAAIA,EAAK,OACnBK,IAAKL,EAAK,IAAIA,EAAK,QACnBM,IAAKL,EAAE,KAAKG,IAAKH,EAAE,KAAKI,IAAKJ,EAAE,IAC/BM,IAAKN,EAAE,KAAKG,IAAKH,EAAE,KAAKI,IAAKJ,EAAE;CACrC,OAAO;EACL,IAAI,KAAK,IAAIC,GAAII,CAAE;EAAG,IAAI,KAAK,IAAIH,GAAII,CAAE;EACzC,IAAI,KAAK,IAAIL,GAAII,CAAE;EAAG,IAAI,KAAK,IAAIH,GAAII,CAAE;CAC3C;AACF;AAEA,SAAgBC,EAAmB,GAAa,GAAuB;CACrE,OAAO;EACL,IAAI,KAAK,IAAIC,EAAE,IAAIC,EAAE,EAAE;EAAG,IAAI,KAAK,IAAID,EAAE,IAAIC,EAAE,EAAE;EACjD,IAAI,KAAK,IAAID,EAAE,IAAIC,EAAE,EAAE;EAAG,IAAI,KAAK,IAAID,EAAE,IAAIC,EAAE,EAAE;CACnD;AACF;AAQA,SAAgBC,EACd,GAAmB,GAAW,GAAgB,GAC9C,GAAmB,GACX;CAER,IAAIC,IAAQC,EAASC,GAAKC,GAAGC,GAAQ,GAAGC,EAAK,IAAI,GAAGC,CAAG;CAGvD,OAFA,IAAQL,EAASK,GAAKN,GAAOI,GAAQ,GAAGC,EAAK,IAAI,IAAIE,CAAG,GACxD,IAAQN,EAASM,GAAKP,GAAOI,GAAQ,GAAGC,EAAK,IAAI,GAAGC,CAAG,GAChDL,EAASK,GAAKN,GAAOI,GAAQ,GAAGC,EAAK,IAAI,IAAIE,CAAG;AACzD;AAIA,SAASN,EACP,GAAmB,GAAW,GAC9B,GAAa,GAAY,GAAc,GAC/B;CACR,IAAIE,MAAM,GAAG,OAAO;CACpB,IAAId,IAAI,GACJmB,IAAOL,IAAI,GACXM,IAASC,KAAQR,EAAIM,IAAOJ,IAASO,KAAQC,MAAO;CACxD,KAAK,IAAIC,IAAM,GAAGA,IAAMV,GAAG,KAAO;EAChC,IAAMW,IAAQJ,KAAQR,EAAIW,IAAMT,IAASO,KAAQC,MAAO;EACxD,IAAIE,MAAUL,GAAQ;GACpB,IAAMZ,IAAIW,IAAOJ,GACXN,IAAIe,IAAMT,GACVW,KAAKH,IAAKV,EAAIL,IAAIc,OAAUT,EAAIJ,IAAIa,KAAQT,EAAIL,IAAIc,KACpDK,IAAI3B,IAAIe;GACd,KAAK,IAAIa,IAAI,GAAGA,IAAIb,GAAQ,KAAK,EAAIY,IAAIC,KAAKf,EAAIL,IAAIoB,KAAKF,KAAKb,EAAIJ,IAAImB,KAAKf,EAAIL,IAAIoB;GAGrF,AADA,EAAID,IAAIL,KAAQC,GAChB;EACF;EACA,IAAIE,GAAO;GACT,IAAME,IAAI3B,IAAIe,GACRc,IAAIL,IAAMT;GAChB,KAAK,IAAIa,IAAI,GAAGA,IAAIb,GAAQ,KAAK,EAAIY,IAAIC,KAAKf,EAAIgB,IAAID;GACtD;EACF;EAEA,AADA,IAAOJ,GACP,IAASC;CACX;CACA,OAAOzB;AACT"}