@tldraw/editor 3.14.0-canary.8d29afff2d04 → 3.14.0-canary.a2263c31d532

package/dist-esm/lib/primitives/geometry/Stadium2d.mjs

@@ -9,58 +9,58 @@ class Stadium2d extends Geometry2d {
     super({ ...config, isClosed: true });
     this.config = config;
     const { width: w, height: h } = config;
-    this.w = w;
-    this.h = h;
+    this._w = w;
+    this._h = h;
     if (h > w) {
       const r = w / 2;
-      this.a = new Arc2d({
+      this._a = new Arc2d({
         start: new Vec(0, r),
         end: new Vec(w, r),
         center: new Vec(w / 2, r),
         sweepFlag: 1,
         largeArcFlag: 1
       });
-      this.b = new Edge2d({ start: new Vec(w, r), end: new Vec(w, h - r) });
-      this.c = new Arc2d({
+      this._b = new Edge2d({ start: new Vec(w, r), end: new Vec(w, h - r) });
+      this._c = new Arc2d({
         start: new Vec(w, h - r),
         end: new Vec(0, h - r),
         center: new Vec(w / 2, h - r),
         sweepFlag: 1,
         largeArcFlag: 1
       });
-      this.d = new Edge2d({ start: new Vec(0, h - r), end: new Vec(0, r) });
+      this._d = new Edge2d({ start: new Vec(0, h - r), end: new Vec(0, r) });
     } else {
       const r = h / 2;
-      this.a = new Arc2d({
+      this._a = new Arc2d({
         start: new Vec(r, h),
         end: new Vec(r, 0),
         center: new Vec(r, r),
         sweepFlag: 1,
         largeArcFlag: 1
       });
-      this.b = new Edge2d({ start: new Vec(r, 0), end: new Vec(w - r, 0) });
-      this.c = new Arc2d({
+      this._b = new Edge2d({ start: new Vec(r, 0), end: new Vec(w - r, 0) });
+      this._c = new Arc2d({
         start: new Vec(w - r, 0),
         end: new Vec(w - r, h),
         center: new Vec(w - r, r),
         sweepFlag: 1,
         largeArcFlag: 1
       });
-      this.d = new Edge2d({ start: new Vec(w - r, h), end: new Vec(r, h) });
+      this._d = new Edge2d({ start: new Vec(w - r, h), end: new Vec(r, h) });
     }
   }
-  w;
-  h;
-  a;
-  b;
-  c;
-  d;
+  _w;
+  _h;
+  _a;
+  _b;
+  _c;
+  _d;
   nearestPoint(A) {
     let nearest;
     let dist = Infinity;
     let _d;
     let p;
-    const { a, b, c, d } = this;
+    const { _a: a, _b: b, _c: c, _d: d } = this;
     for (const part of [a, b, c, d]) {
       p = part.nearestPoint(A);
       _d = Vec.Dist2(p, A);
@@ -73,26 +73,26 @@ class Stadium2d extends Geometry2d {
     return nearest;
   }
   hitTestLineSegment(A, B) {
-    const { a, b, c, d } = this;
+    const { _a: a, _b: b, _c: c, _d: d } = this;
     return [a, b, c, d].some((edge) => edge.hitTestLineSegment(A, B));
   }
   getVertices() {
-    const { a, b, c, d } = this;
+    const { _a: a, _b: b, _c: c, _d: d } = this;
     return [a, b, c, d].reduce((a2, p) => {
       a2.push(...p.vertices);
       return a2;
     }, []);
   }
   getBounds() {
-    return new Box(0, 0, this.w, this.h);
+    return new Box(0, 0, this._w, this._h);
   }
   getLength() {
-    const { h, w } = this;
+    const { _h: h, _w: w } = this;
     if (h > w) return (PI * (w / 2) + (h - w)) * 2;
     else return (PI * (h / 2) + (w - h)) * 2;
   }
   getSvgPathData() {
-    const { a, b, c, d } = this;
+    const { _a: a, _b: b, _c: c, _d: d } = this;
     return [a, b, c, d].map((p, i) => p.getSvgPathData(i === 0)).join(" ") + " Z";
   }
 }

package/dist-esm/lib/primitives/geometry/Stadium2d.mjs.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../src/lib/primitives/geometry/Stadium2d.ts"],
-  "sourcesContent": ["import { Box } from '../Box'\nimport { Vec, VecLike } from '../Vec'\nimport { PI } from '../utils'\nimport { Arc2d } from './Arc2d'\nimport { Edge2d } from './Edge2d'\nimport { Geometry2d, Geometry2dOptions } from './Geometry2d'\n\n/** @public */\nexport class Stadium2d extends Geometry2d {\n\tw: number\n\th: number\n\n\ta: Arc2d\n\tb: Edge2d\n\tc: Arc2d\n\td: Edge2d\n\n\tconstructor(\n\t\tpublic config: Omit<Geometry2dOptions, 'isClosed'> & {\n\t\t\twidth: number\n\t\t\theight: number\n\t\t}\n\t) {\n\t\tsuper({ ...config, isClosed: true })\n\t\tconst { width: w, height: h } = config\n\t\tthis.w = w\n\t\tthis.h = h\n\n\t\tif (h > w) {\n\t\t\tconst r = w / 2\n\t\t\tthis.a = new Arc2d({\n\t\t\t\tstart: new Vec(0, r),\n\t\t\t\tend: new Vec(w, r),\n\t\t\t\tcenter: new Vec(w / 2, r),\n\t\t\t\tsweepFlag: 1,\n\t\t\t\tlargeArcFlag: 1,\n\t\t\t})\n\t\t\tthis.b = new Edge2d({ start: new Vec(w, r), end: new Vec(w, h - r) })\n\t\t\tthis.c = new Arc2d({\n\t\t\t\tstart: new Vec(w, h - r),\n\t\t\t\tend: new Vec(0, h - r),\n\t\t\t\tcenter: new Vec(w / 2, h - r),\n\t\t\t\tsweepFlag: 1,\n\t\t\t\tlargeArcFlag: 1,\n\t\t\t})\n\t\t\tthis.d = new Edge2d({ start: new Vec(0, h - r), end: new Vec(0, r) })\n\t\t} else {\n\t\t\tconst r = h / 2\n\t\t\tthis.a = new Arc2d({\n\t\t\t\tstart: new Vec(r, h),\n\t\t\t\tend: new Vec(r, 0),\n\t\t\t\tcenter: new Vec(r, r),\n\t\t\t\tsweepFlag: 1,\n\t\t\t\tlargeArcFlag: 1,\n\t\t\t})\n\t\t\tthis.b = new Edge2d({ start: new Vec(r, 0), end: new Vec(w - r, 0) })\n\t\t\tthis.c = new Arc2d({\n\t\t\t\tstart: new Vec(w - r, 0),\n\t\t\t\tend: new Vec(w - r, h),\n\t\t\t\tcenter: new Vec(w - r, r),\n\t\t\t\tsweepFlag: 1,\n\t\t\t\tlargeArcFlag: 1,\n\t\t\t})\n\t\t\tthis.d = new Edge2d({ start: new Vec(w - r, h), end: new Vec(r, h) })\n\t\t}\n\t}\n\n\tnearestPoint(A: VecLike): Vec {\n\t\tlet nearest: Vec | undefined\n\t\tlet dist = Infinity\n\t\tlet _d: number\n\t\tlet p: Vec\n\n\t\tconst { a, b, c, d } = this\n\t\tfor (const part of [a, b, c, d]) {\n\t\t\tp = part.nearestPoint(A)\n\t\t\t_d = Vec.Dist2(p, A)\n\t\t\tif (_d < dist) {\n\t\t\t\tnearest = p\n\t\t\t\tdist = _d\n\t\t\t}\n\t\t}\n\t\tif (!nearest) throw Error('nearest point not found')\n\t\treturn nearest\n\t}\n\n\thitTestLineSegment(A: VecLike, B: VecLike): boolean {\n\t\tconst { a, b, c, d } = this\n\t\treturn [a, b, c, d].some((edge) => edge.hitTestLineSegment(A, B))\n\t}\n\n\tgetVertices() {\n\t\tconst { a, b, c, d } = this\n\t\treturn [a, b, c, d].reduce<Vec[]>((a, p) => {\n\t\t\ta.push(...p.vertices)\n\t\t\treturn a\n\t\t}, [])\n\t}\n\n\tgetBounds() {\n\t\treturn new Box(0, 0, this.w, this.h)\n\t}\n\n\tgetLength() {\n\t\tconst { h, w } = this\n\t\tif (h > w) return (PI * (w / 2) + (h - w)) * 2\n\t\telse return (PI * (h / 2) + (w - h)) * 2\n\t}\n\n\tgetSvgPathData() {\n\t\tconst { a, b, c, d } = this\n\t\treturn [a, b, c, d].map((p, i) => p.getSvgPathData(i === 0)).join(' ') + ' Z'\n\t}\n}\n"],
-  "mappings": "AAAA,SAAS,WAAW;AACpB,SAAS,WAAoB;AAC7B,SAAS,UAAU;AACnB,SAAS,aAAa;AACtB,SAAS,cAAc;AACvB,SAAS,kBAAqC;AAGvC,MAAM,kBAAkB,WAAW;AAAA,EASzC,YACQ,QAIN;AACD,UAAM,EAAE,GAAG,QAAQ,UAAU,KAAK,CAAC;AAL5B;AAMP,UAAM,EAAE,OAAO,GAAG,QAAQ,EAAE,IAAI;AAChC,SAAK,IAAI;AACT,SAAK,IAAI;AAET,QAAI,IAAI,GAAG;AACV,YAAM,IAAI,IAAI;AACd,WAAK,IAAI,IAAI,MAAM;AAAA,QAClB,OAAO,IAAI,IAAI,GAAG,CAAC;AAAA,QACnB,KAAK,IAAI,IAAI,GAAG,CAAC;AAAA,QACjB,QAAQ,IAAI,IAAI,IAAI,GAAG,CAAC;AAAA,QACxB,WAAW;AAAA,QACX,cAAc;AAAA,MACf,CAAC;AACD,WAAK,IAAI,IAAI,OAAO,EAAE,OAAO,IAAI,IAAI,GAAG,CAAC,GAAG,KAAK,IAAI,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC;AACpE,WAAK,IAAI,IAAI,MAAM;AAAA,QAClB,OAAO,IAAI,IAAI,GAAG,IAAI,CAAC;AAAA,QACvB,KAAK,IAAI,IAAI,GAAG,IAAI,CAAC;AAAA,QACrB,QAAQ,IAAI,IAAI,IAAI,GAAG,IAAI,CAAC;AAAA,QAC5B,WAAW;AAAA,QACX,cAAc;AAAA,MACf,CAAC;AACD,WAAK,IAAI,IAAI,OAAO,EAAE,OAAO,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;AAAA,IACrE,OAAO;AACN,YAAM,IAAI,IAAI;AACd,WAAK,IAAI,IAAI,MAAM;AAAA,QAClB,OAAO,IAAI,IAAI,GAAG,CAAC;AAAA,QACnB,KAAK,IAAI,IAAI,GAAG,CAAC;AAAA,QACjB,QAAQ,IAAI,IAAI,GAAG,CAAC;AAAA,QACpB,WAAW;AAAA,QACX,cAAc;AAAA,MACf,CAAC;AACD,WAAK,IAAI,IAAI,OAAO,EAAE,OAAO,IAAI,IAAI,GAAG,CAAC,GAAG,KAAK,IAAI,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;AACpE,WAAK,IAAI,IAAI,MAAM;AAAA,QAClB,OAAO,IAAI,IAAI,IAAI,GAAG,CAAC;AAAA,QACvB,KAAK,IAAI,IAAI,IAAI,GAAG,CAAC;AAAA,QACrB,QAAQ,IAAI,IAAI,IAAI,GAAG,CAAC;AAAA,QACxB,WAAW;AAAA,QACX,cAAc;AAAA,MACf,CAAC;AACD,WAAK,IAAI,IAAI,OAAO,EAAE,OAAO,IAAI,IAAI,IAAI,GAAG,CAAC,GAAG,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;AAAA,IACrE;AAAA,EACD;AAAA,EAxDA;AAAA,EACA;AAAA,EAEA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAoDA,aAAa,GAAiB;AAC7B,QAAI;AACJ,QAAI,OAAO;AACX,QAAI;AACJ,QAAI;AAEJ,UAAM,EAAE,GAAG,GAAG,GAAG,EAAE,IAAI;AACvB,eAAW,QAAQ,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG;AAChC,UAAI,KAAK,aAAa,CAAC;AACvB,WAAK,IAAI,MAAM,GAAG,CAAC;AACnB,UAAI,KAAK,MAAM;AACd,kBAAU;AACV,eAAO;AAAA,MACR;AAAA,IACD;AACA,QAAI,CAAC,QAAS,OAAM,MAAM,yBAAyB;AACnD,WAAO;AAAA,EACR;AAAA,EAEA,mBAAmB,GAAY,GAAqB;AACnD,UAAM,EAAE,GAAG,GAAG,GAAG,EAAE,IAAI;AACvB,WAAO,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,KAAK,CAAC,SAAS,KAAK,mBAAmB,GAAG,CAAC,CAAC;AAAA,EACjE;AAAA,EAEA,cAAc;AACb,UAAM,EAAE,GAAG,GAAG,GAAG,EAAE,IAAI;AACvB,WAAO,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,OAAc,CAACA,IAAG,MAAM;AAC3C,MAAAA,GAAE,KAAK,GAAG,EAAE,QAAQ;AACpB,aAAOA;AAAA,IACR,GAAG,CAAC,CAAC;AAAA,EACN;AAAA,EAEA,YAAY;AACX,WAAO,IAAI,IAAI,GAAG,GAAG,KAAK,GAAG,KAAK,CAAC;AAAA,EACpC;AAAA,EAEA,YAAY;AACX,UAAM,EAAE,GAAG,EAAE,IAAI;AACjB,QAAI,IAAI,EAAG,SAAQ,MAAM,IAAI,MAAM,IAAI,MAAM;AAAA,QACxC,SAAQ,MAAM,IAAI,MAAM,IAAI,MAAM;AAAA,EACxC;AAAA,EAEA,iBAAiB;AAChB,UAAM,EAAE,GAAG,GAAG,GAAG,EAAE,IAAI;AACvB,WAAO,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,MAAM,EAAE,eAAe,MAAM,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI;AAAA,EAC1E;AACD;",
+  "sourcesContent": ["import { Box } from '../Box'\nimport { Vec, VecLike } from '../Vec'\nimport { PI } from '../utils'\nimport { Arc2d } from './Arc2d'\nimport { Edge2d } from './Edge2d'\nimport { Geometry2d, Geometry2dOptions } from './Geometry2d'\n\n/** @public */\nexport class Stadium2d extends Geometry2d {\n\tprivate _w: number\n\tprivate _h: number\n\tprivate _a: Arc2d\n\tprivate _b: Edge2d\n\tprivate _c: Arc2d\n\tprivate _d: Edge2d\n\n\tconstructor(\n\t\tpublic config: Omit<Geometry2dOptions, 'isClosed'> & {\n\t\t\twidth: number\n\t\t\theight: number\n\t\t}\n\t) {\n\t\tsuper({ ...config, isClosed: true })\n\t\tconst { width: w, height: h } = config\n\t\tthis._w = w\n\t\tthis._h = h\n\n\t\tif (h > w) {\n\t\t\tconst r = w / 2\n\t\t\tthis._a = new Arc2d({\n\t\t\t\tstart: new Vec(0, r),\n\t\t\t\tend: new Vec(w, r),\n\t\t\t\tcenter: new Vec(w / 2, r),\n\t\t\t\tsweepFlag: 1,\n\t\t\t\tlargeArcFlag: 1,\n\t\t\t})\n\t\t\tthis._b = new Edge2d({ start: new Vec(w, r), end: new Vec(w, h - r) })\n\t\t\tthis._c = new Arc2d({\n\t\t\t\tstart: new Vec(w, h - r),\n\t\t\t\tend: new Vec(0, h - r),\n\t\t\t\tcenter: new Vec(w / 2, h - r),\n\t\t\t\tsweepFlag: 1,\n\t\t\t\tlargeArcFlag: 1,\n\t\t\t})\n\t\t\tthis._d = new Edge2d({ start: new Vec(0, h - r), end: new Vec(0, r) })\n\t\t} else {\n\t\t\tconst r = h / 2\n\t\t\tthis._a = new Arc2d({\n\t\t\t\tstart: new Vec(r, h),\n\t\t\t\tend: new Vec(r, 0),\n\t\t\t\tcenter: new Vec(r, r),\n\t\t\t\tsweepFlag: 1,\n\t\t\t\tlargeArcFlag: 1,\n\t\t\t})\n\t\t\tthis._b = new Edge2d({ start: new Vec(r, 0), end: new Vec(w - r, 0) })\n\t\t\tthis._c = new Arc2d({\n\t\t\t\tstart: new Vec(w - r, 0),\n\t\t\t\tend: new Vec(w - r, h),\n\t\t\t\tcenter: new Vec(w - r, r),\n\t\t\t\tsweepFlag: 1,\n\t\t\t\tlargeArcFlag: 1,\n\t\t\t})\n\t\t\tthis._d = new Edge2d({ start: new Vec(w - r, h), end: new Vec(r, h) })\n\t\t}\n\t}\n\n\tnearestPoint(A: VecLike): Vec {\n\t\tlet nearest: Vec | undefined\n\t\tlet dist = Infinity\n\t\tlet _d: number\n\t\tlet p: Vec\n\n\t\tconst { _a: a, _b: b, _c: c, _d: d } = this\n\t\tfor (const part of [a, b, c, d]) {\n\t\t\tp = part.nearestPoint(A)\n\t\t\t_d = Vec.Dist2(p, A)\n\t\t\tif (_d < dist) {\n\t\t\t\tnearest = p\n\t\t\t\tdist = _d\n\t\t\t}\n\t\t}\n\t\tif (!nearest) throw Error('nearest point not found')\n\t\treturn nearest\n\t}\n\n\thitTestLineSegment(A: VecLike, B: VecLike): boolean {\n\t\tconst { _a: a, _b: b, _c: c, _d: d } = this\n\t\treturn [a, b, c, d].some((edge) => edge.hitTestLineSegment(A, B))\n\t}\n\n\tgetVertices() {\n\t\tconst { _a: a, _b: b, _c: c, _d: d } = this\n\t\treturn [a, b, c, d].reduce<Vec[]>((a, p) => {\n\t\t\ta.push(...p.vertices)\n\t\t\treturn a\n\t\t}, [])\n\t}\n\n\tgetBounds() {\n\t\treturn new Box(0, 0, this._w, this._h)\n\t}\n\n\tgetLength() {\n\t\tconst { _h: h, _w: w } = this\n\t\tif (h > w) return (PI * (w / 2) + (h - w)) * 2\n\t\telse return (PI * (h / 2) + (w - h)) * 2\n\t}\n\n\tgetSvgPathData() {\n\t\tconst { _a: a, _b: b, _c: c, _d: d } = this\n\t\treturn [a, b, c, d].map((p, i) => p.getSvgPathData(i === 0)).join(' ') + ' Z'\n\t}\n}\n"],
+  "mappings": "AAAA,SAAS,WAAW;AACpB,SAAS,WAAoB;AAC7B,SAAS,UAAU;AACnB,SAAS,aAAa;AACtB,SAAS,cAAc;AACvB,SAAS,kBAAqC;AAGvC,MAAM,kBAAkB,WAAW;AAAA,EAQzC,YACQ,QAIN;AACD,UAAM,EAAE,GAAG,QAAQ,UAAU,KAAK,CAAC;AAL5B;AAMP,UAAM,EAAE,OAAO,GAAG,QAAQ,EAAE,IAAI;AAChC,SAAK,KAAK;AACV,SAAK,KAAK;AAEV,QAAI,IAAI,GAAG;AACV,YAAM,IAAI,IAAI;AACd,WAAK,KAAK,IAAI,MAAM;AAAA,QACnB,OAAO,IAAI,IAAI,GAAG,CAAC;AAAA,QACnB,KAAK,IAAI,IAAI,GAAG,CAAC;AAAA,QACjB,QAAQ,IAAI,IAAI,IAAI,GAAG,CAAC;AAAA,QACxB,WAAW;AAAA,QACX,cAAc;AAAA,MACf,CAAC;AACD,WAAK,KAAK,IAAI,OAAO,EAAE,OAAO,IAAI,IAAI,GAAG,CAAC,GAAG,KAAK,IAAI,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC;AACrE,WAAK,KAAK,IAAI,MAAM;AAAA,QACnB,OAAO,IAAI,IAAI,GAAG,IAAI,CAAC;AAAA,QACvB,KAAK,IAAI,IAAI,GAAG,IAAI,CAAC;AAAA,QACrB,QAAQ,IAAI,IAAI,IAAI,GAAG,IAAI,CAAC;AAAA,QAC5B,WAAW;AAAA,QACX,cAAc;AAAA,MACf,CAAC;AACD,WAAK,KAAK,IAAI,OAAO,EAAE,OAAO,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;AAAA,IACtE,OAAO;AACN,YAAM,IAAI,IAAI;AACd,WAAK,KAAK,IAAI,MAAM;AAAA,QACnB,OAAO,IAAI,IAAI,GAAG,CAAC;AAAA,QACnB,KAAK,IAAI,IAAI,GAAG,CAAC;AAAA,QACjB,QAAQ,IAAI,IAAI,GAAG,CAAC;AAAA,QACpB,WAAW;AAAA,QACX,cAAc;AAAA,MACf,CAAC;AACD,WAAK,KAAK,IAAI,OAAO,EAAE,OAAO,IAAI,IAAI,GAAG,CAAC,GAAG,KAAK,IAAI,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;AACrE,WAAK,KAAK,IAAI,MAAM;AAAA,QACnB,OAAO,IAAI,IAAI,IAAI,GAAG,CAAC;AAAA,QACvB,KAAK,IAAI,IAAI,IAAI,GAAG,CAAC;AAAA,QACrB,QAAQ,IAAI,IAAI,IAAI,GAAG,CAAC;AAAA,QACxB,WAAW;AAAA,QACX,cAAc;AAAA,MACf,CAAC;AACD,WAAK,KAAK,IAAI,OAAO,EAAE,OAAO,IAAI,IAAI,IAAI,GAAG,CAAC,GAAG,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;AAAA,IACtE;AAAA,EACD;AAAA,EAvDQ;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAoDR,aAAa,GAAiB;AAC7B,QAAI;AACJ,QAAI,OAAO;AACX,QAAI;AACJ,QAAI;AAEJ,UAAM,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,EAAE,IAAI;AACvC,eAAW,QAAQ,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG;AAChC,UAAI,KAAK,aAAa,CAAC;AACvB,WAAK,IAAI,MAAM,GAAG,CAAC;AACnB,UAAI,KAAK,MAAM;AACd,kBAAU;AACV,eAAO;AAAA,MACR;AAAA,IACD;AACA,QAAI,CAAC,QAAS,OAAM,MAAM,yBAAyB;AACnD,WAAO;AAAA,EACR;AAAA,EAEA,mBAAmB,GAAY,GAAqB;AACnD,UAAM,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,EAAE,IAAI;AACvC,WAAO,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,KAAK,CAAC,SAAS,KAAK,mBAAmB,GAAG,CAAC,CAAC;AAAA,EACjE;AAAA,EAEA,cAAc;AACb,UAAM,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,EAAE,IAAI;AACvC,WAAO,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,OAAc,CAACA,IAAG,MAAM;AAC3C,MAAAA,GAAE,KAAK,GAAG,EAAE,QAAQ;AACpB,aAAOA;AAAA,IACR,GAAG,CAAC,CAAC;AAAA,EACN;AAAA,EAEA,YAAY;AACX,WAAO,IAAI,IAAI,GAAG,GAAG,KAAK,IAAI,KAAK,EAAE;AAAA,EACtC;AAAA,EAEA,YAAY;AACX,UAAM,EAAE,IAAI,GAAG,IAAI,EAAE,IAAI;AACzB,QAAI,IAAI,EAAG,SAAQ,MAAM,IAAI,MAAM,IAAI,MAAM;AAAA,QACxC,SAAQ,MAAM,IAAI,MAAM,IAAI,MAAM;AAAA,EACxC;AAAA,EAEA,iBAAiB;AAChB,UAAM,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,EAAE,IAAI;AACvC,WAAO,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,MAAM,EAAE,eAAe,MAAM,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI;AAAA,EAC1E;AACD;",
   "names": ["a"]
 }

package/dist-esm/lib/utils/areShapesContentEqual.mjs

@@ -1,4 +1,4 @@
-const areShapesContentEqual = (a, b) => a.props === b.props && a.meta === b.meta;
+const areShapesContentEqual = (a, b) => a.parentId === b.parentId && a.props === b.props && a.meta === b.meta;
 export {
   areShapesContentEqual
 };

package/dist-esm/lib/utils/areShapesContentEqual.mjs.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/lib/utils/areShapesContentEqual.ts"],
-  "sourcesContent": ["import { TLShape } from '@tldraw/tlschema'\n\nexport const areShapesContentEqual = (a: TLShape, b: TLShape) =>\n\ta.props === b.props && a.meta === b.meta\n"],
-  "mappings": "AAEO,MAAM,wBAAwB,CAAC,GAAY,MACjD,EAAE,UAAU,EAAE,SAAS,EAAE,SAAS,EAAE;",
+  "sourcesContent": ["import { TLShape } from '@tldraw/tlschema'\n\n/** @public */\nexport const areShapesContentEqual = (a: TLShape, b: TLShape) =>\n\ta.parentId === b.parentId && a.props === b.props && a.meta === b.meta\n"],
+  "mappings": "AAGO,MAAM,wBAAwB,CAAC,GAAY,MACjD,EAAE,aAAa,EAAE,YAAY,EAAE,UAAU,EAAE,SAAS,EAAE,SAAS,EAAE;",
   "names": []
 }

package/dist-esm/version.mjs

@@ -1,8 +1,8 @@
-const version = "3.14.0-canary.8d29afff2d04";
+const version = "3.14.0-canary.a2263c31d532";
 const publishDates = {
   major: "2024-09-13T14:36:29.063Z",
-  minor: "2025-05-27T13:18:08.385Z",
-  patch: "2025-05-27T13:18:08.385Z"
+  minor: "2025-06-03T15:55:11.843Z",
+  patch: "2025-06-03T15:55:11.843Z"
 };
 export {
   publishDates,

package/dist-esm/version.mjs.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../src/version.ts"],
-  "sourcesContent": ["// This file is automatically generated by internal/scripts/refresh-assets.ts.\n// Do not edit manually. Or do, I'm a comment, not a cop.\n\nexport const version = '3.14.0-canary.8d29afff2d04'\nexport const publishDates = {\n\tmajor: '2024-09-13T14:36:29.063Z',\n\tminor: '2025-05-27T13:18:08.385Z',\n\tpatch: '2025-05-27T13:18:08.385Z',\n}\n"],
+  "sourcesContent": ["// This file is automatically generated by internal/scripts/refresh-assets.ts.\n// Do not edit manually. Or do, I'm a comment, not a cop.\n\nexport const version = '3.14.0-canary.a2263c31d532'\nexport const publishDates = {\n\tmajor: '2024-09-13T14:36:29.063Z',\n\tminor: '2025-06-03T15:55:11.843Z',\n\tpatch: '2025-06-03T15:55:11.843Z',\n}\n"],
   "mappings": "AAGO,MAAM,UAAU;AAChB,MAAM,eAAe;AAAA,EAC3B,OAAO;AAAA,EACP,OAAO;AAAA,EACP,OAAO;AACR;",
   "names": []
 }

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@tldraw/editor",
   "description": "A tiny little drawing app (editor).",
-  "version": "3.14.0-canary.8d29afff2d04",
+  "version": "3.14.0-canary.a2263c31d532",
   "author": {
     "name": "tldraw Inc.",
     "email": "hello@tldraw.com"
@@ -48,12 +48,12 @@
     "@tiptap/core": "^2.9.1",
     "@tiptap/pm": "^2.9.1",
     "@tiptap/react": "^2.9.1",
-    "@tldraw/state": "3.14.0-canary.8d29afff2d04",
-    "@tldraw/state-react": "3.14.0-canary.8d29afff2d04",
-    "@tldraw/store": "3.14.0-canary.8d29afff2d04",
-    "@tldraw/tlschema": "3.14.0-canary.8d29afff2d04",
-    "@tldraw/utils": "3.14.0-canary.8d29afff2d04",
-    "@tldraw/validate": "3.14.0-canary.8d29afff2d04",
+    "@tldraw/state": "3.14.0-canary.a2263c31d532",
+    "@tldraw/state-react": "3.14.0-canary.a2263c31d532",
+    "@tldraw/store": "3.14.0-canary.a2263c31d532",
+    "@tldraw/tlschema": "3.14.0-canary.a2263c31d532",
+    "@tldraw/utils": "3.14.0-canary.a2263c31d532",
+    "@tldraw/validate": "3.14.0-canary.a2263c31d532",
     "@types/core-js": "^2.5.8",
     "@use-gesture/react": "^10.3.1",
     "classnames": "^2.5.1",

package/src/index.ts

@@ -4,6 +4,7 @@ import 'core-js/stable/array/flat-map.js'
 import 'core-js/stable/array/flat.js'
 import 'core-js/stable/string/at.js'
 import 'core-js/stable/string/replace-all.js'
+export { areShapesContentEqual } from './lib/utils/areShapesContentEqual'
 
 // eslint-disable-next-line local/no-export-star
 export * from '@tldraw/state'

package/src/lib/editor/Editor.ts

@@ -506,6 +506,8 @@ export class Editor extends EventEmitter<TLEventMap> {
 				shape: {
 					afterChange: (shapeBefore, shapeAfter) => {
 						for (const binding of this.getBindingsInvolvingShape(shapeAfter)) {
+							if (areShapesContentEqual(shapeBefore, shapeAfter)) continue
+
 							invalidBindingTypes.add(binding.type)
 							if (binding.fromId === shapeAfter.id) {
 								this.getBindingUtil(binding).onAfterChangeFromShape?.({

package/src/lib/editor/derivations/notVisibleShapes.ts

@@ -1,49 +1,48 @@
 import { computed, isUninitialized } from '@tldraw/state'
 import { TLShapeId } from '@tldraw/tlschema'
-import { Box } from '../../primitives/Box'
 import { Editor } from '../Editor'
 
-function isShapeNotVisible(editor: Editor, id: TLShapeId, viewportPageBounds: Box): boolean {
-	const maskedPageBounds = editor.getShapeMaskedPageBounds(id)
-	// if the shape is fully outside of its parent's clipping bounds...
-	if (maskedPageBounds === undefined) return true
-
-	// if the shape is fully outside of the viewport page bounds...
-	return !viewportPageBounds.includes(maskedPageBounds)
+function fromScratch(editor: Editor): Set<TLShapeId> {
+	const shapesIds = editor.getCurrentPageShapeIds()
+	const viewportPageBounds = editor.getViewportPageBounds()
+	const notVisibleShapes = new Set<TLShapeId>()
+	shapesIds.forEach((id) => {
+		// If the shape is fully outside of the viewport page bounds, add it to the set.
+		// We'll ignore masks here, since they're more expensive to compute and the overhead is not worth it.
+		const pageBounds = editor.getShapePageBounds(id)
+		if (pageBounds === undefined || !viewportPageBounds.includes(pageBounds)) {
+			notVisibleShapes.add(id)
+		}
+	})
+	return notVisibleShapes
 }
 
 /**
  * Incremental derivation of not visible shapes.
- * Non visible shapes are shapes outside of the viewport page bounds and shapes outside of parent's clipping bounds.
+ * Non visible shapes are shapes outside of the viewport page bounds.
  *
  * @param editor - Instance of the tldraw Editor.
  * @returns Incremental derivation of non visible shapes.
  */
-export const notVisibleShapes = (editor: Editor) => {
-	function fromScratch(editor: Editor): Set<TLShapeId> {
-		const shapes = editor.getCurrentPageShapeIds()
-		const viewportPageBounds = editor.getViewportPageBounds()
-		const notVisibleShapes = new Set<TLShapeId>()
-		shapes.forEach((id) => {
-			if (isShapeNotVisible(editor, id, viewportPageBounds)) {
-				notVisibleShapes.add(id)
-			}
-		})
-		return notVisibleShapes
-	}
-	return computed<Set<TLShapeId>>('notVisibleShapes', (prevValue) => {
+export function notVisibleShapes(editor: Editor) {
+	return computed<Set<TLShapeId>>('notVisibleShapes', function updateNotVisibleShapes(prevValue) {
+		const nextValue = fromScratch(editor)
+
 		if (isUninitialized(prevValue)) {
-			return fromScratch(editor)
+			return nextValue
 		}
 
-		const nextValue = fromScratch(editor)
-
+		// If there are more or less shapes, we know there's a change
 		if (prevValue.size !== nextValue.size) return nextValue
+
+		// If any of the old shapes are not in the new set, we know there's a change
 		for (const prev of prevValue) {
 			if (!nextValue.has(prev)) {
 				return nextValue
 			}
 		}
+
+		// If we've made it here, we know that the set is the same
 		return prevValue
 	})
 }

package/src/lib/primitives/Box.ts

@@ -591,6 +591,14 @@ export class Box {
 		return b.x === a.x && b.y === a.y && b.w === a.w && b.h === a.h
 	}
 
+	prettyMuchEquals(other: Box | BoxModel) {
+		return this.clone().toFixed().equals(Box.From(other).toFixed())
+	}
+
+	static PrettyMuchEquals(a: Box | BoxModel, b: Box | BoxModel) {
+		return b.x === a.x && b.y === a.y && b.w === a.w && b.h === a.h
+	}
+
 	zeroFix() {
 		this.w = Math.max(1, this.w)
 		this.h = Math.max(1, this.h)

package/src/lib/primitives/Vec.test.ts

@@ -144,8 +144,8 @@ describe('Vec.Uni', () => {
 		expect(Vec.Uni(new Vec(10, 10))).toMatchObject(new Vec(0.7071067811865475, 0.7071067811865475))
 	})
 
-	it('Divide-by-zero spits out NaN (at the moment)', () => {
-		expect(Vec.Uni(new Vec(0, 0))).toMatchObject(new Vec(NaN, NaN))
+	it('Divide-by-zero spits out 0', () => {
+		expect(Vec.Uni(new Vec(0, 0))).toMatchObject(new Vec(0, 0))
 	})
 })
 

package/src/lib/primitives/Vec.ts

@@ -189,11 +189,15 @@ export class Vec {
 	}
 
 	uni() {
-		return Vec.Uni(this)
+		const l = this.len()
+		if (l === 0) return this
+		this.x /= l
+		this.y /= l
+		return this
 	}
 
 	tan(V: VecLike): Vec {
-		return Vec.Tan(this, V)
+		return this.sub(V).uni()
 	}
 
 	dist(V: VecLike): number {
@@ -236,15 +240,15 @@ export class Vec {
 		return Vec.EqualsXY(this, x, y)
 	}
 
+	/** @deprecated use `uni` instead */
 	norm() {
-		const l = this.len()
-		this.x = l === 0 ? 0 : this.x / l
-		this.y = l === 0 ? 0 : this.y / l
-		return this
+		return this.uni()
 	}
 
 	toFixed() {
-		return Vec.ToFixed(this)
+		this.x = toFixed(this.x)
+		this.y = toFixed(this.y)
+		return this
 	}
 
 	toString() {
@@ -375,7 +379,8 @@ export class Vec {
 	 * Get the unit vector of A.
 	 */
 	static Uni(A: VecLike) {
-		return Vec.Div(A, Vec.Len(A))
+		const l = Vec.Len(A)
+		return new Vec(l === 0 ? 0 : A.x / l, l === 0 ? 0 : A.y / l)
 	}
 
 	static Tan(A: VecLike, B: VecLike): Vec {

package/src/lib/primitives/geometry/Arc2d.ts

@@ -6,16 +6,15 @@ import { getVerticesCountForLength } from './geometry-constants'
 
 /** @public */
 export class Arc2d extends Geometry2d {
-	_center: Vec
-	radius: number
-	start: Vec
-	end: Vec
-	largeArcFlag: number
-	sweepFlag: number
-
-	measure: number
-	angleStart: number
-	angleEnd: number
+	private _center: Vec
+	private _radius: number
+	private _start: Vec
+	private _end: Vec
+	private _largeArcFlag: number
+	private _sweepFlag: number
+	private _measure: number
+	private _angleStart: number
+	private _angleEnd: number
 
 	constructor(
 		config: Omit<Geometry2dOptions, 'isFilled' | 'isClosed'> & {
@@ -31,21 +30,29 @@ export class Arc2d extends Geometry2d {
 		if (start.equals(end)) throw Error(`Arc must have different start and end points.`)
 
 		// ensure that the start and end are clockwise
-		this.angleStart = Vec.Angle(center, start)
-		this.angleEnd = Vec.Angle(center, end)
-		this.radius = Vec.Dist(center, start)
-		this.measure = getArcMeasure(this.angleStart, this.angleEnd, sweepFlag, largeArcFlag)
+		this._angleStart = Vec.Angle(center, start)
+		this._angleEnd = Vec.Angle(center, end)
+		this._radius = Vec.Dist(center, start)
+		this._measure = getArcMeasure(this._angleStart, this._angleEnd, sweepFlag, largeArcFlag)
 
-		this.start = start
-		this.end = end
+		this._start = start
+		this._end = end
 
-		this.sweepFlag = sweepFlag
-		this.largeArcFlag = largeArcFlag
+		this._sweepFlag = sweepFlag
+		this._largeArcFlag = largeArcFlag
 		this._center = center
 	}
 
 	nearestPoint(point: VecLike): Vec {
-		const { _center, measure, radius, angleEnd, angleStart, start: A, end: B } = this
+		const {
+			_center,
+			_measure: measure,
+			_radius: radius,
+			_angleEnd: angleEnd,
+			_angleStart: angleStart,
+			_start: A,
+			_end: B,
+		} = this
 		const t = getPointInArcT(measure, angleStart, angleEnd, _center.angle(point))
 		if (t <= 0) return A
 		if (t >= 1) return B
@@ -68,7 +75,13 @@ export class Arc2d extends Geometry2d {
 	}
 
 	hitTestLineSegment(A: VecLike, B: VecLike): boolean {
-		const { _center, radius, measure, angleStart, angleEnd } = this
+		const {
+			_center,
+			_radius: radius,
+			_measure: measure,
+			_angleStart: angleStart,
+			_angleEnd: angleEnd,
+		} = this
 		const intersection = intersectLineSegmentCircle(A, B, _center, radius)
 		if (intersection === null) return false
 
@@ -79,7 +92,7 @@ export class Arc2d extends Geometry2d {
 	}
 
 	getVertices(): Vec[] {
-		const { _center, measure, length, radius, angleStart } = this
+		const { _center, _measure: measure, length, _radius: radius, _angleStart: angleStart } = this
 		const vertices: Vec[] = []
 		for (let i = 0, n = getVerticesCountForLength(Math.abs(length)); i < n + 1; i++) {
 			const t = (i / n) * measure
@@ -90,11 +103,17 @@ export class Arc2d extends Geometry2d {
 	}
 
 	getSvgPathData(first = true) {
-		const { start, end, radius, largeArcFlag, sweepFlag } = this
+		const {
+			_start: start,
+			_end: end,
+			_radius: radius,
+			_largeArcFlag: largeArcFlag,
+			_sweepFlag: sweepFlag,
+		} = this
 		return `${first ? `M${start.toFixed()}` : ``} A${radius} ${radius} 0 ${largeArcFlag} ${sweepFlag} ${end.toFixed()}`
 	}
 
 	override getLength() {
-		return Math.abs(this.measure * this.radius)
+		return Math.abs(this._measure * this._radius)
 	}
 }

package/src/lib/primitives/geometry/Circle2d.ts

@@ -7,10 +7,10 @@ import { getVerticesCountForLength } from './geometry-constants'
 
 /** @public */
 export class Circle2d extends Geometry2d {
-	_center: Vec
-	radius: number
-	x: number
-	y: number
+	private _center: Vec
+	private _radius: number
+	private _x: number
+	private _y: number
 
 	constructor(
 		public config: Omit<Geometry2dOptions, 'isClosed'> & {
@@ -22,18 +22,18 @@ export class Circle2d extends Geometry2d {
 	) {
 		super({ isClosed: true, ...config })
 		const { x = 0, y = 0, radius } = config
-		this.x = x
-		this.y = y
+		this._x = x
+		this._y = y
 		this._center = new Vec(radius + x, radius + y)
-		this.radius = radius
+		this._radius = radius
 	}
 
 	getBounds() {
-		return new Box(this.x, this.y, this.radius * 2, this.radius * 2)
+		return new Box(this._x, this._y, this._radius * 2, this._radius * 2)
 	}
 
 	getVertices(): Vec[] {
-		const { _center, radius } = this
+		const { _center, _radius: radius } = this
 		const perimeter = PI2 * radius
 		const vertices: Vec[] = []
 		for (let i = 0, n = getVerticesCountForLength(perimeter); i < n; i++) {
@@ -44,18 +44,18 @@ export class Circle2d extends Geometry2d {
 	}
 
 	nearestPoint(point: VecLike): Vec {
-		const { _center, radius } = this
+		const { _center, _radius: radius } = this
 		if (_center.equals(point)) return Vec.AddXY(_center, radius, 0)
 		return Vec.Sub(point, _center).uni().mul(radius).add(_center)
 	}
 
 	hitTestLineSegment(A: VecLike, B: VecLike, distance = 0): boolean {
-		const { _center, radius } = this
+		const { _center, _radius: radius } = this
 		return intersectLineSegmentCircle(A, B, _center, radius + distance) !== null
 	}
 
 	getSvgPathData(): string {
-		const { _center, radius } = this
+		const { _center, _radius: radius } = this
 		return `M${_center.x + radius},${_center.y} a${radius},${radius} 0 1,0 ${radius * 2},0a${radius},${radius} 0 1,0 -${radius * 2},0`
 	}
 }

package/src/lib/primitives/geometry/CubicBezier2d.test.ts

@@ -0,0 +1,5 @@
+describe('CubicBezier2d', () => {
+	it('should be tested', () => {
+		expect(true).toBe(true)
+	})
+})

package/src/lib/primitives/geometry/CubicBezier2d.ts

@@ -4,10 +4,10 @@ import { Polyline2d } from './Polyline2d'
 
 /** @public */
 export class CubicBezier2d extends Polyline2d {
-	a: Vec
-	b: Vec
-	c: Vec
-	d: Vec
+	private _a: Vec
+	private _b: Vec
+	private _c: Vec
+	private _d: Vec
 
 	constructor(
 		config: Omit<Geometry2dOptions, 'isFilled' | 'isClosed'> & {
@@ -20,15 +20,15 @@ export class CubicBezier2d extends Polyline2d {
 		const { start: a, cp1: b, cp2: c, end: d } = config
 		super({ ...config, points: [a, d] })
 
-		this.a = a
-		this.b = b
-		this.c = c
-		this.d = d
+		this._a = a
+		this._b = b
+		this._c = c
+		this._d = d
 	}
 
 	override getVertices() {
 		const vertices = [] as Vec[]
-		const { a, b, c, d } = this
+		const { _a: a, _b: b, _c: c, _d: d } = this
 		// we'll always use ten vertices for each bezier curve
 		for (let i = 0, n = 10; i <= n; i++) {
 			const t = i / n
@@ -48,10 +48,6 @@ export class CubicBezier2d extends Polyline2d {
 		return vertices
 	}
 
-	midPoint() {
-		return CubicBezier2d.GetAtT(this, 0.5)
-	}
-
 	nearestPoint(A: VecLike): Vec {
 		let nearest: Vec | undefined
 		let dist = Infinity
@@ -71,12 +67,12 @@ export class CubicBezier2d extends Polyline2d {
 	}
 
 	getSvgPathData(first = true) {
-		const { a, b, c, d } = this
+		const { _a: a, _b: b, _c: c, _d: d } = this
 		return `${first ? `M ${a.toFixed()} ` : ``} C${b.toFixed()} ${c.toFixed()} ${d.toFixed()}`
 	}
 
 	static GetAtT(segment: CubicBezier2d, t: number) {
-		const { a, b, c, d } = segment
+		const { _a: a, _b: b, _c: c, _d: d } = segment
 		return new Vec(
 			(1 - t) * (1 - t) * (1 - t) * a.x +
 				3 * ((1 - t) * (1 - t)) * t * b.x +
@@ -89,9 +85,9 @@ export class CubicBezier2d extends Polyline2d {
 		)
 	}
 
-	override getLength(filters?: Geometry2dFilters, precision = 32) {
+	override getLength(_filters?: Geometry2dFilters, precision = 32) {
 		let n1: Vec,
-			p1 = this.a,
+			p1 = this._a,
 			length = 0
 		for (let i = 1; i <= precision; i++) {
 			n1 = CubicBezier2d.GetAtT(this, i / precision)