@vielzeug/atlas 0.0.0-stage → 26.11.23

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (73) hide show
  1. package/LICENSE +21 -0
  2. package/README.md +49 -2
  3. package/dist/atlas.cjs +2 -0
  4. package/dist/atlas.cjs.map +1 -0
  5. package/dist/atlas.iife.js +2 -0
  6. package/dist/atlas.iife.js.map +1 -0
  7. package/dist/atlas.js +751 -0
  8. package/dist/atlas.js.map +1 -0
  9. package/dist/camera.cjs +2 -0
  10. package/dist/camera.cjs.map +1 -0
  11. package/dist/camera.d.ts +66 -0
  12. package/dist/camera.d.ts.map +1 -0
  13. package/dist/camera.js +216 -0
  14. package/dist/camera.js.map +1 -0
  15. package/dist/errors.cjs +2 -0
  16. package/dist/errors.cjs.map +1 -0
  17. package/dist/errors.d.ts +6 -0
  18. package/dist/errors.d.ts.map +1 -0
  19. package/dist/errors.js +9 -0
  20. package/dist/errors.js.map +1 -0
  21. package/dist/geometry.cjs +2 -0
  22. package/dist/geometry.cjs.map +1 -0
  23. package/dist/geometry.d.ts +19 -0
  24. package/dist/geometry.d.ts.map +1 -0
  25. package/dist/geometry.js +35 -0
  26. package/dist/geometry.js.map +1 -0
  27. package/dist/grid/fov.cjs +2 -0
  28. package/dist/grid/fov.cjs.map +1 -0
  29. package/dist/grid/fov.d.ts +56 -0
  30. package/dist/grid/fov.d.ts.map +1 -0
  31. package/dist/grid/fov.js +105 -0
  32. package/dist/grid/fov.js.map +1 -0
  33. package/dist/grid/index.cjs +1 -0
  34. package/dist/grid/index.d.ts +9 -0
  35. package/dist/grid/index.d.ts.map +1 -0
  36. package/dist/grid/index.js +4 -0
  37. package/dist/grid/tile.cjs +2 -0
  38. package/dist/grid/tile.cjs.map +1 -0
  39. package/dist/grid/tile.d.ts +30 -0
  40. package/dist/grid/tile.d.ts.map +1 -0
  41. package/dist/grid/tile.js +45 -0
  42. package/dist/grid/tile.js.map +1 -0
  43. package/dist/index.cjs +1 -0
  44. package/dist/index.d.ts +9 -0
  45. package/dist/index.d.ts.map +1 -0
  46. package/dist/index.js +8 -0
  47. package/dist/matrix.cjs +2 -0
  48. package/dist/matrix.cjs.map +1 -0
  49. package/dist/matrix.d.ts +17 -0
  50. package/dist/matrix.d.ts.map +1 -0
  51. package/dist/matrix.js +81 -0
  52. package/dist/matrix.js.map +1 -0
  53. package/dist/rect.cjs +2 -0
  54. package/dist/rect.cjs.map +1 -0
  55. package/dist/rect.d.ts +20 -0
  56. package/dist/rect.d.ts.map +1 -0
  57. package/dist/rect.js +61 -0
  58. package/dist/rect.js.map +1 -0
  59. package/dist/shapes.d.ts +26 -0
  60. package/dist/shapes.d.ts.map +1 -0
  61. package/dist/snap.cjs +2 -0
  62. package/dist/snap.cjs.map +1 -0
  63. package/dist/snap.d.ts +65 -0
  64. package/dist/snap.d.ts.map +1 -0
  65. package/dist/snap.js +208 -0
  66. package/dist/snap.js.map +1 -0
  67. package/dist/spatial-index.cjs +2 -0
  68. package/dist/spatial-index.cjs.map +1 -0
  69. package/dist/spatial-index.d.ts +38 -0
  70. package/dist/spatial-index.d.ts.map +1 -0
  71. package/dist/spatial-index.js +169 -0
  72. package/dist/spatial-index.js.map +1 -0
  73. package/package.json +60 -4
package/LICENSE ADDED
@@ -0,0 +1,21 @@
1
+ MIT License
2
+
3
+ Copyright (c) 2025 Helmuth Saatkamp
4
+
5
+ Permission is hereby granted, free of charge, to any person obtaining a copy
6
+ of this software and associated documentation files (the "Software"), to deal
7
+ in the Software without restriction, including without limitation the rights
8
+ to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
9
+ copies of the Software, and to permit persons to whom the Software is
10
+ furnished to do so, subject to the following conditions:
11
+
12
+ The above copyright notice and this permission notice shall be included in all
13
+ copies or substantial portions of the Software.
14
+
15
+ THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16
+ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17
+ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
18
+ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19
+ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20
+ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
21
+ SOFTWARE.
package/README.md CHANGED
@@ -1,3 +1,50 @@
1
- # Temporary Holding Version
1
+ # @vielzeug/atlas
2
2
 
3
- This version is a temporary placeholder for this package. An operational version to replace this has been submitted for review and is awaiting a staged release.
3
+ > Spatial math, camera, and indexing primitives for 2D canvases
4
+
5
+ ## Installation
6
+
7
+ ```sh
8
+ pnpm add @vielzeug/atlas
9
+ npm install @vielzeug/atlas
10
+ yarn add @vielzeug/atlas
11
+ ```
12
+
13
+ ## Quick Start
14
+
15
+ ```ts
16
+ import { createCamera, createSpatialIndex } from '@vielzeug/atlas';
17
+
18
+ // state.x/y is the world point at the viewport centre
19
+ const camera = createCamera();
20
+ camera.resize({ height: 600, width: 800 });
21
+ camera.zoomAt({ x: 400, y: 300 }, 1.2); // world point under the cursor stays fixed
22
+
23
+ const index = createSpatialIndex();
24
+ index.set('a', { height: 10, width: 10, x: 0, y: 0 });
25
+ index.queryRect(camera.visibleRect); // viewport culling, returns ids
26
+ ```
27
+
28
+ ## Features
29
+
30
+ - `createCamera()`: viewport-centred state, anchor-preserving zoom/rotate, screen-space pan, `fitBounds()`, rotated `visibleRect`, and `animateTo()` with an injectable frame scheduler
31
+ - `createSpatialIndex()`: dynamic R-tree with `set`/`delete`/`get`/`queryRect`/`queryPoint` over ids
32
+ - Matrix helpers in Canvas2D element order, including `invert()` and `toCssMatrix()`
33
+ - Rect/AABB math: union, closed-interval intersection, containment, inflation, bounds-from-points
34
+ - Narrow-phase geometry: `pointInPolygon`, `distanceToPolyline`, `pointNearPolygon`
35
+ - Snapping: `snapRect()` with candidate, grid, and equal-gap (`spacing`) targets and kind-tagged guide descriptors, plus pure `alignRects()`/`distributeRects()`
36
+ - `@vielzeug/atlas/grid` subpath: square-tile coordinate math, viewport tile ranges, 8-octant shadowcasting `computeFov()`, and three-state `createFog()`
37
+ - Typed errors; the camera follows the Vielzeug disposal contract
38
+ - Zero runtime dependencies, no DOM requirement
39
+
40
+ ## Documentation
41
+
42
+ - [Overview](https://vielzeug.dev/atlas/)
43
+ - [Usage Guide](https://vielzeug.dev/atlas/usage)
44
+ - [API Reference](https://vielzeug.dev/atlas/api)
45
+ - [Examples](https://vielzeug.dev/atlas/examples)
46
+ - [Migration Guide](https://vielzeug.dev/atlas/migration)
47
+
48
+ ## License
49
+
50
+ MIT © [Helmuth Saatkamp](https://github.com/helmuthdu): part of the [Vielzeug](https://github.com/helmuthdu/vielzeug) monorepo.
package/dist/atlas.cjs ADDED
@@ -0,0 +1,2 @@
1
+ Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});var AtlasError=class extends Error{constructor(e,t){super(e,t),this.name=new.target.name,Object.setPrototypeOf(this,new.target.prototype)}},AtlasConfigError=class extends AtlasError{},e=Object.freeze([1,0,0,1,0,0]);function multiply(e,t){return[e[0]*t[0]+e[2]*t[1],e[1]*t[0]+e[3]*t[1],e[0]*t[2]+e[2]*t[3],e[1]*t[2]+e[3]*t[3],e[0]*t[4]+e[2]*t[5]+e[4],e[1]*t[4]+e[3]*t[5]+e[5]]}function apply(e,t){return{x:e[0]*t.x+e[2]*t.y+e[4],y:e[1]*t.x+e[3]*t.y+e[5]}}function translate(e,t){return[1,0,0,1,e,t]}function scale(e,t=e){return[e,0,0,t,0,0]}function rotate(e){let t=Math.cos(e),n=Math.sin(e);return[t,n,-n,t,0,0]}function around(e,t){return multiply(multiply(translate(e.x,e.y),t),translate(-e.x,-e.y))}function scaleOf(e){return(Math.hypot(e[0],e[1])+Math.hypot(e[2],e[3]))/2}function toCssMatrix(e){return`matrix(${e.join(`,`)})`}function invert(e){let t=e[0]*e[3]-e[2]*e[1];if(!Number.isFinite(t)||t===0)return null;let n=1/t;return[e[3]*n,-e[1]*n,-e[2]*n,e[0]*n,(e[2]*e[5]-e[3]*e[4])*n,(e[1]*e[4]-e[0]*e[5])*n]}function rectFromPoints(e){let t=1/0,n=1/0,r=-1/0,i=-1/0,a=!1;for(let o of e)a=!0,o.x<t&&(t=o.x),o.y<n&&(n=o.y),o.x>r&&(r=o.x),o.y>i&&(i=o.y);return a?{height:i-n,width:r-t,x:t,y:n}:null}function rectRight(e){return e.x+e.width}function rectBottom(e){return e.y+e.height}function rectCenter(e){return{x:e.x+e.width/2,y:e.y+e.height/2}}function unionRect(e,t){let n=Math.min(e.x,t.x),r=Math.min(e.y,t.y);return{height:Math.max(rectBottom(e),rectBottom(t))-r,width:Math.max(rectRight(e),rectRight(t))-n,x:n,y:r}}function intersectRect(e,t){let n=Math.max(e.x,t.x),r=Math.max(e.y,t.y),i=Math.min(rectRight(e),rectRight(t)),a=Math.min(rectBottom(e),rectBottom(t));return i<n||a<r?null:{height:a-r,width:i-n,x:n,y:r}}function containsRect(e,t){return e.x<=t.x&&e.y<=t.y&&rectRight(e)>=rectRight(t)&&rectBottom(e)>=rectBottom(t)}function containsPoint(e,t){return t.x>=e.x&&t.x<=rectRight(e)&&t.y>=e.y&&t.y<=rectBottom(e)}function inflateRect(e,t){return{height:e.height+t*2,width:e.width+t*2,x:e.x-t,y:e.y-t}}function rectsIntersect(e,t){return intersectRect(e,t)!==null}var t={cancelFrame:e=>cancelAnimationFrame(e),now:()=>performance.now(),requestFrame:e=>requestAnimationFrame(e)};function assertFinite(e,t){if(!Number.isFinite(t))throw new AtlasConfigError(`${e} must be a finite number, received ${t}`)}function easeInOut(e){return e<.5?2*e*e:1-(-2*e+2)**2/2}function normalizeAngle(e){return((e+Math.PI)%(2*Math.PI)+2*Math.PI)%(2*Math.PI)-Math.PI}function shortestAngle(e,t){return normalizeAngle(t-e)}function screenDeltaToWorld(e,t,n){return apply(multiply(rotate(-n),scale(1/t)),e)}function matrixOf(e,t){let n=multiply(multiply(scale(e.zoom),rotate(e.rotation)),translate(-e.x,-e.y));return multiply(translate(t.width/2,t.height/2),n)}function inverseOf(e,t){let n=multiply(rotate(-e.rotation),scale(1/e.zoom)),r=screenDeltaToWorld({x:t.width/2,y:t.height/2},e.zoom,e.rotation);return multiply(translate(e.x-r.x,e.y-r.y),n)}function createCamera(e={}){let n=e.minZoom??.01,r=e.maxZoom??1e3;if(!(n>0&&n<=r))throw new AtlasConfigError(`Zoom clamps must satisfy 0 < minZoom <= maxZoom, received ${n} and ${r}`);let i=e.scheduler??t,a=e.initial??{},o=e.viewport??{height:0,width:0},s={rotation:normalizeAngle(a.rotation??0),x:a.x??0,y:a.y??0,zoom:Math.min(r,Math.max(n,a.zoom??1))};for(let[e,t]of[[`camera.x`,s.x],[`camera.y`,s.y],[`camera.rotation`,s.rotation]])assertFinite(e,t);let c=new AbortController,l=!1,u=null,d=new Set,f=null,p=null,matrix=()=>(f??=matrixOf(s,o),f),inverse=()=>(p??=inverseOf(s,o),p),invalidate=()=>{f=null,p=null},relativeToCentre=e=>({x:e.x-o.width/2,y:e.y-o.height/2}),emit=()=>{for(let e of[...d])e(s)},set=e=>{if(l)return;let t={rotation:normalizeAngle(e.rotation??s.rotation),x:e.x??s.x,y:e.y??s.y,zoom:Math.min(r,Math.max(n,e.zoom??s.zoom))};(t.x!==s.x||t.y!==s.y||t.zoom!==s.zoom||t.rotation!==s.rotation)&&(s=t,invalidate(),emit())},stop=()=>{u&&=(i.cancelFrame(u.frame),u.cleanup(),null)},dispose=()=>{l||(l=!0,stop(),d.clear(),c.abort())},animateTo=(e,t={})=>{if(stop(),l)return;let a=t.duration??250,o=t.easing??easeInOut,c=t.signal;if(c?.aborted)return;if(a<=0){set(e);return}let d=s,f={rotation:d.rotation+shortestAngle(d.rotation,e.rotation??s.rotation),x:e.x??s.x,y:e.y??s.y,zoom:Math.min(r,Math.max(n,e.zoom??s.zoom))},p=i.now(),m=Math.log(d.zoom),h=Math.log(f.zoom),g={cleanup:()=>{},frame:0};u=g;let abort=()=>{u===g&&stop()};c&&(c.addEventListener(`abort`,abort,{once:!0}),g.cleanup=()=>c.removeEventListener(`abort`,abort));let step=e=>{if(u!==g)return;let t=Math.min(1,(e-p)/a),n=o(t);set({rotation:d.rotation+(f.rotation-d.rotation)*n,x:d.x+(f.x-d.x)*n,y:d.y+(f.y-d.y)*n,zoom:Math.exp(m+(h-m)*n)}),t>=1?(u=null,g.cleanup()):g.frame=i.requestFrame(step)};g.frame=i.requestFrame(step)};return{animateTo,get disposalSignal(){return c.signal},dispose,get disposed(){return l},fitBounds(e,t={}){if(l)return;stop();let i=t.padding??0,a=Math.max(1,o.width-i*2),s=Math.max(1,o.height-i*2),c=Math.min(r,Math.max(n,Math.min(e.width===0?r:a/e.width,e.height===0?r:s/e.height)));set({x:e.x+e.width/2,y:e.y+e.height/2,zoom:c})},get inverse(){return inverse()},get matrix(){return matrix()},panBy(e,t){if(l)return;stop();let n=screenDeltaToWorld({x:e,y:t},s.zoom,s.rotation);set({x:s.x-n.x,y:s.y-n.y})},resize(e){l||(e.width!==o.width||e.height!==o.height)&&(o={height:e.height,width:e.width},invalidate(),emit())},rotateAt(e,t){if(l)return;stop();let n=apply(inverse(),e),r=s.rotation+t,i=screenDeltaToWorld(relativeToCentre(e),s.zoom,r);set({rotation:r,x:n.x-i.x,y:n.y-i.y})},set(e){stop(),set(e)},[Symbol.dispose]:dispose,get state(){return s},stop,subscribe(e,t){return l||t?.signal?.aborted?()=>{}:(d.add(e),t?.signal?.addEventListener(`abort`,()=>d.delete(e),{once:!0}),()=>d.delete(e))},toScreen(e){return apply(matrix(),e)},toWorld(e){return apply(inverse(),e)},get viewport(){return o},get visibleRect(){let e=inverse();return rectFromPoints([apply(e,{x:0,y:0}),apply(e,{x:o.width,y:0}),apply(e,{x:0,y:o.height}),apply(e,{x:o.width,y:o.height})])},zoomAt(e,t){if(!Number.isFinite(t)||t<=0)throw new AtlasConfigError(`zoomAt factor must be a positive finite number, received ${t}`);if(l)return;stop();let i=apply(inverse(),e),a=Math.min(r,Math.max(n,s.zoom*t)),o=screenDeltaToWorld(relativeToCentre(e),a,s.rotation);set({x:i.x-o.x,y:i.y-o.y,zoom:a})}}}function pointInPolygon(e,t){let n=!1,r=e.length;for(let i=0,a=r-1;i<r;a=i++){let r=e[i],o=e[a];if(r.y>t.y==o.y>t.y)continue;let s=(o.x-r.x)*(t.y-r.y)/(o.y-r.y)+r.x;t.x<s&&(n=!n)}return n}function distanceToSegment(e,t,n){let r=n.x-t.x,i=n.y-t.y,a=r*r+i*i;if(a===0)return Math.hypot(e.x-t.x,e.y-t.y);let o=((e.x-t.x)*r+(e.y-t.y)*i)/a;return o=Math.max(0,Math.min(1,o)),Math.hypot(e.x-(t.x+o*r),e.y-(t.y+o*i))}function distanceToPolyline(e,t){if(e.length===0)return 1/0;if(e.length===1)return Math.hypot(t.x-e[0].x,t.y-e[0].y);let n=1/0;for(let r=0,i=1;i<e.length;r=i++){let a=distanceToSegment(t,e[r],e[i]);a<n&&(n=a)}return n}function pointNearPolygon(e,t,n){if(!(n>=0))throw new AtlasConfigError(`tolerance must be a non-negative finite number; received ${String(n)}.`);return distanceToPolyline(e.length>0?[...e,e[0]]:e,t)<=n||pointInPolygon(e,t)}function xAnchors(e){return[e.x,e.x+e.width/2,rectRight(e)]}function yAnchors(e){return[e.y,e.y+e.height/2,rectBottom(e)]}function bestAxisSnap(e,t,n){let r=null;for(let i of e)for(let e of t){let t=e.value-i;Math.abs(t)>n||(r===null||Math.abs(t)<Math.abs(r.delta))&&(r={delta:t,kind:e.kind,position:e.value})}return r}function gridTargets(e,t,n,r){if(n===void 0||!Number.isFinite(n)||n<=0)return[];let i=[];for(let a=Math.floor((e-r)/n)*n;a<=t+r;a+=n)i.push({kind:`grid`,value:a});return i}function spanFor(e,t,n,r){let i=[];for(let t of n)(r===`x`?xAnchors(t):yAnchors(t)).some(t=>t===e)&&i.push(t);let a=rectFromPoints([t,...i].flatMap(e=>[{x:e.x,y:e.y},{x:rectRight(e),y:rectBottom(e)}]))??{height:0,width:0,x:e,y:e};return r===`x`?{from:a.y,to:rectBottom(a)}:{from:a.x,to:rectRight(a)}}function overlapsPerpendicular(e,t,n){return n===`x`?e.y<rectBottom(t)&&t.y<rectBottom(e):e.x<rectRight(t)&&t.x<rectRight(e)}function axisSpacingSnap(e,t,n,r){let i=n===`x`?e=>e.x:e=>e.y,a=n===`x`?e=>rectRight(e):e=>rectBottom(e),o=-1/0,s=1/0;for(let r of t)overlapsPerpendicular(e,r,n)&&(a(r)<=i(e)&&a(r)>o&&(o=a(r)),i(r)>=a(e)&&i(r)<s&&(s=i(r)));if(o===-1/0||s===1/0)return null;let c=s-o-(n===`x`?e.width:e.height);if(c<0)return null;let l=o+c/2-i(e);if(Math.abs(l)>r)return null;let u=c/2;return{delta:l,marks:[o+u/2,s-u/2],position:n===`x`?rectCenter(e).y:rectCenter(e).x,span:[o,s]}}function snapRect(e,t){let{candidates:n,grid:r,spacing:i,threshold:a}=t;if(!(a>=0))throw new AtlasConfigError(`threshold must be a non-negative finite number; received ${String(a)}.`);let o=e.x,s=e.y,c={x:0,y:0},l=n.flatMap(e=>xAnchors(e).map(e=>({kind:`object`,value:e})));l.push(...gridTargets(e.x,rectRight(e),r?.x,a));let u=bestAxisSnap(xAnchors(e),l,a);u!==null&&(c.x=u.delta,o+=u.delta);let d=n.flatMap(e=>yAnchors(e).map(e=>({kind:`object`,value:e})));d.push(...gridTargets(e.y,rectBottom(e),r?.y,a));let f=bestAxisSnap(yAnchors(e),d,a);f!==null&&(c.y=f.delta,s+=f.delta);let p={...e,x:o,y:s},m=[];if(u!==null){let e=spanFor(u.position,p,n,`x`);m.push({axis:`x`,from:e.from,kind:u.kind,position:u.position,to:e.to})}if(f!==null){let e=spanFor(f.position,p,n,`y`);m.push({axis:`y`,from:e.from,kind:f.kind,position:f.position,to:e.to})}if(i){if(u===null){let e=axisSpacingSnap(p,n,`x`,a);e!==null&&(c.x=e.delta,m.push({axis:`y`,from:e.span[0],kind:`spacing`,marks:e.marks,position:e.position,to:e.span[1]}))}if(f===null){let e=axisSpacingSnap(p,n,`y`,a);e!==null&&(c.y=e.delta,m.push({axis:`x`,from:e.span[0],kind:`spacing`,marks:e.marks,position:e.position,to:e.span[1]}))}}return{delta:c,guides:m}}function alignRects(e,t){if(e.length===0)return[];let n=rectFromPoints(e.flatMap(e=>[{x:e.x,y:e.y},{x:rectRight(e),y:rectBottom(e)}]));return n===null?[]:e.map(e=>{switch(t){case`left`:return{...e,x:n.x};case`horizontal-center`:return{...e,x:rectCenter(n).x-e.width/2};case`right`:return{...e,x:rectRight(n)-e.width};case`top`:return{...e,y:n.y};case`vertical-center`:return{...e,y:rectCenter(n).y-e.height/2};case`bottom`:return{...e,y:rectBottom(n)-e.height};default:throw new AtlasConfigError(`unknown align edge: ${String(t)}.`)}})}function distributeRects(e,t){if(e.length<=2)return e.map(e=>({...e}));let n=t===`x`?e=>e.x:e=>e.y,r=t===`x`?e=>e.width:e=>e.height,i=e.map((e,t)=>({index:t,rect:e})).sort((e,t)=>n(e.rect)-n(t.rect)||e.index-t.index),a=i[0].rect,o=i[i.length-1].rect,s=(n(o)+r(o)-n(a)-i.reduce((e,t)=>e+r(t.rect),0))/(i.length-1),c=e.map(e=>({...e})),l=n(a);for(let e of i){let n={...e.rect};t===`x`?n.x=l:n.y=l,c[e.index]=n,l+=r(e.rect)+s}return c}function rectOf(e){return e.rect}function unionRects(e,t){let n=Math.min(e.x,t.x),r=Math.min(e.y,t.y);return{height:Math.max(e.y+e.height,t.y+t.height)-r,width:Math.max(e.x+e.width,t.x+t.width)-n,x:n,y:r}}function area(e){return e.width*e.height}function rectsEqual(e,t){return e.x===t.x&&e.y===t.y&&e.width===t.width&&e.height===t.height}function recompute(e){let t=null;for(let n of e.children)t=t===null?{...rectOf(n)}:unionRects(t,rectOf(n));e.rect=t}function createSpatialIndex(e={}){let t=e.maxEntriesPerNode??8;if(!Number.isInteger(t)||t<4)throw new AtlasConfigError(`maxEntriesPerNode must be an integer >= 4, received ${t}`);let n=Math.max(2,Math.ceil(t/3)),r=new Map,i={children:[],leaf:!0,rect:null},pickChild=(e,t)=>{let n=null,r=1/0,i=1/0;for(let a of e.children){let e=a.rect??t,o=area(unionRects(e,t))-area(e);(o<r||o===r&&area(e)<i)&&(n=a,r=o,i=area(e))}return n},split=e=>{let r=e.children,i=0,a=1,o=-1/0;for(let e=0;e<r.length;e++)for(let t=e+1;t<r.length;t++){let n=area(unionRects(rectOf(r[e]),rectOf(r[t])))-area(rectOf(r[e]))-area(rectOf(r[t]));n>o&&(o=n,i=e,a=t)}let s=[r[i]],c=[r[a]],l=rectOf(r[i]),u=rectOf(r[a]),d=r.filter((e,t)=>t!==i&&t!==a);for(let[e,r]of d.entries()){let i=s.length+(d.length-e)>t||c.length+(d.length-e)-1<n,a=c.length+(d.length-e)>t||s.length+(d.length-e)-1<n,o;if(i)o=!0;else if(a)o=!1;else{let e=area(unionRects(l,rectOf(r)))-area(l),t=area(unionRects(u,rectOf(r)))-area(u);o=e<t||e===t&&area(l)<=area(u)}o?(s.push(r),l=unionRects(l,rectOf(r))):(c.push(r),u=unionRects(u,rectOf(r)))}let f=e.leaf?{children:s,leaf:!0,rect:null}:{children:s,leaf:!1,rect:null},p=e.leaf?{children:c,leaf:!0,rect:null}:{children:c,leaf:!1,rect:null};return recompute(f),recompute(p),[f,p]},insertInto=(e,n)=>{if(e.leaf)return e.children.push(n),e.rect=e.rect===null?{...rectOf(n)}:unionRects(e.rect,rectOf(n)),e.children.length>t?split(e):null;let r=e,i=pickChild(r,rectOf(n)),a=insertInto(i,n);if(recompute(e),a){let t=r.children.indexOf(i);r.children.splice(t,1,a[0],a[1]),recompute(e)}return e.children.length>t?split(e):null},insertEntry=e=>{!i.leaf&&i.children.length===0&&(i={children:[],leaf:!0,rect:null});let t=insertInto(i,e);t&&(i={children:t,leaf:!1,rect:null},recompute(i))},removeFrom=(e,t)=>{if(e.leaf){let n=e.children.indexOf(t);return n!==-1&&e.children.splice(n,1),recompute(e),e.children.length===0}let n=e;for(let e=n.children.length-1;e>=0;e--){let r=n.children[e];r.rect&&containsRect(r.rect,t.rect)&&removeFrom(r,t)&&n.children.splice(e,1)}return recompute(e),n.children.length===0},deleteEntry=e=>{let t=r.get(e);if(!t)return!1;for(r.delete(e),removeFrom(i,t);!i.leaf&&i.children.length===1;)i=i.children[0];return!0},queryInto=(e,t,n)=>{if(e.rect&&t(e.rect)){if(e.leaf)for(let r of e.children)t(r.rect)&&n.push(r.id);else for(let r of e.children)queryInto(r,t,n)}};return{get bounds(){return i.rect},clear(){r.clear(),i={children:[],leaf:!0,rect:null}},delete:deleteEntry,get(e){return r.get(e)?.rect},has(e){return r.has(e)},queryPoint(e,t){let n=t?.tolerance??0;if(!(n>=0))throw new AtlasConfigError(`tolerance must be a non-negative finite number, received ${n}`);let r=inflateRect({...e,height:0,width:0},n),a=[];return queryInto(i,e=>rectsIntersect(e,r),a),a},queryRect(e){let t=[];return queryInto(i,t=>rectsIntersect(t,e),t),t},set(e,t){let n=r.get(e);if(n){if(rectsEqual(n.rect,t))return;deleteEntry(e)}let i={id:e,rect:{...t}};r.set(e,i),insertEntry(i)},get size(){return r.size}}}exports.AtlasConfigError=AtlasConfigError,exports.AtlasError=AtlasError,exports.IDENTITY=e,exports.alignRects=alignRects,exports.apply=apply,exports.around=around,exports.containsPoint=containsPoint,exports.containsRect=containsRect,exports.createCamera=createCamera,exports.createSpatialIndex=createSpatialIndex,exports.distanceToPolyline=distanceToPolyline,exports.distributeRects=distributeRects,exports.inflateRect=inflateRect,exports.intersectRect=intersectRect,exports.invert=invert,exports.multiply=multiply,exports.pointInPolygon=pointInPolygon,exports.pointNearPolygon=pointNearPolygon,exports.rectBottom=rectBottom,exports.rectCenter=rectCenter,exports.rectFromPoints=rectFromPoints,exports.rectRight=rectRight,exports.rectsIntersect=rectsIntersect,exports.rotate=rotate,exports.scale=scale,exports.scaleOf=scaleOf,exports.snapRect=snapRect,exports.toCssMatrix=toCssMatrix,exports.translate=translate,exports.unionRect=unionRect;
2
+ //# sourceMappingURL=atlas.cjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"atlas.cjs","names":["message","opts","IDENTITY","a","b","matrix","point","tx","ty","sx","sy","cos","radians","sin","anchor","det","inv","minX","minY","maxX","maxY","found","points","rect","x","y","right","bottom","outer","inner","amount","DEFAULT_SCHEDULER","handle","callback","value","name","t","angle","to","from","rotation","zoom","delta","m","s","viewport","minZoom","options","maxZoom","scheduler","initial","state","controller","disposed","animation","listeners","cachedMatrix","cachedInverse","screenPoint","listener","candidate","next","duration","animateOptions","easing","signal","target","start","logFrom","logTo","frame","time","e","padding","fitOptions","availableWidth","availableHeight","bounds","offset","dx","dy","size","world","subscribeOptions","factor","inside","n","polygon","j","xAtY","lengthSq","path","best","i","d","tolerance","anchors","targets","threshold","spacing","line","min","max","touching","candidates","axis","position","moved","r","end","leftEnd","rightStart","free","gap","movedX","movedY","xTargets","grid","xSnap","yTargets","ySnap","movedRect","guides","span","rects","edge","order","first","last","sum","entry","result","cursor","node","child","maxEntries","minEntries","entries","root","bestEnlargement","bestArea","current","enlargement","items","si","sj","worst","waste","groupA","groupB","rectA","rectB","remaining","index","item","mustA","mustB","toA","enlargeA","enlargeB","branch","overflow","id","hits","out","queryOptions","box","existing"],"sources":["../src/errors.ts","../src/matrix.ts","../src/rect.ts","../src/camera.ts","../src/geometry.ts","../src/snap.ts","../src/spatial-index.ts"],"sourcesContent":["export class AtlasError extends Error {\n constructor(message: string, opts?: ErrorOptions) {\n super(message, opts);\n this.name = new.target.name;\n Object.setPrototypeOf(this, new.target.prototype);\n }\n}\n\nexport class AtlasConfigError extends AtlasError {}\n","import type { Matrix, Point } from './shapes.js';\n\nexport const IDENTITY: Matrix = Object.freeze([1, 0, 0, 1, 0, 0]) as Matrix;\n\nexport function multiply(a: Matrix, b: Matrix): Matrix {\n return [\n a[0] * b[0] + a[2] * b[1],\n a[1] * b[0] + a[3] * b[1],\n a[0] * b[2] + a[2] * b[3],\n a[1] * b[2] + a[3] * b[3],\n a[0] * b[4] + a[2] * b[5] + a[4],\n a[1] * b[4] + a[3] * b[5] + a[5],\n ];\n}\n\nexport function apply(matrix: Matrix, point: Point): Point {\n return {\n x: matrix[0] * point.x + matrix[2] * point.y + matrix[4],\n y: matrix[1] * point.x + matrix[3] * point.y + matrix[5],\n };\n}\n\nexport function translate(tx: number, ty: number): Matrix {\n return [1, 0, 0, 1, tx, ty];\n}\n\nexport function scale(sx: number, sy: number = sx): Matrix {\n return [sx, 0, 0, sy, 0, 0];\n}\n\n/** Rotation in radians; positive is clockwise on screen (y grows downward). */\nexport function rotate(radians: number): Matrix {\n const cos = Math.cos(radians);\n const sin = Math.sin(radians);\n return [cos, sin, -sin, cos, 0, 0];\n}\n\n/** Transform applied around an anchor point: translate(anchor) · matrix · translate(-anchor). */\nexport function around(anchor: Point, matrix: Matrix): Matrix {\n return multiply(multiply(translate(anchor.x, anchor.y), matrix), translate(-anchor.x, -anchor.y));\n}\n\n/** Average axis scale of a matrix; 0 for degenerate matrices. */\nexport function scaleOf(matrix: Matrix): number {\n const sx = Math.hypot(matrix[0], matrix[1]);\n const sy = Math.hypot(matrix[2], matrix[3]);\n return (sx + sy) / 2;\n}\n\n/** Serializes to a CSS `matrix()` value usable in a DOM element's `transform`. */\nexport function toCssMatrix(matrix: Matrix): string {\n return `matrix(${matrix.join(',')})`;\n}\n\n/** Returns null for non-invertible matrices (zero determinant). */\nexport function invert(matrix: Matrix): Matrix | null {\n const det = matrix[0] * matrix[3] - matrix[2] * matrix[1];\n if (!Number.isFinite(det) || det === 0) return null;\n const inv = 1 / det;\n return [\n matrix[3] * inv,\n -matrix[1] * inv,\n -matrix[2] * inv,\n matrix[0] * inv,\n (matrix[2] * matrix[5] - matrix[3] * matrix[4]) * inv,\n (matrix[1] * matrix[4] - matrix[0] * matrix[5]) * inv,\n ];\n}\n","import type { Point, Rect } from './shapes.js';\n\nexport function rectFromPoints(points: readonly [Point, ...Point[]]): Rect;\nexport function rectFromPoints(points: Iterable<Point>): Rect | null;\nexport function rectFromPoints(points: Iterable<Point>): Rect | null {\n let minX = Infinity;\n let minY = Infinity;\n let maxX = -Infinity;\n let maxY = -Infinity;\n let found = false;\n for (const point of points) {\n found = true;\n if (point.x < minX) minX = point.x;\n if (point.y < minY) minY = point.y;\n if (point.x > maxX) maxX = point.x;\n if (point.y > maxY) maxY = point.y;\n }\n if (!found) return null;\n return { height: maxY - minY, width: maxX - minX, x: minX, y: minY };\n}\n\nexport function rectRight(rect: Rect): number {\n return rect.x + rect.width;\n}\n\nexport function rectBottom(rect: Rect): number {\n return rect.y + rect.height;\n}\n\nexport function rectCenter(rect: Rect): Point {\n return { x: rect.x + rect.width / 2, y: rect.y + rect.height / 2 };\n}\n\nexport function unionRect(a: Rect, b: Rect): Rect {\n const x = Math.min(a.x, b.x);\n const y = Math.min(a.y, b.y);\n return {\n height: Math.max(rectBottom(a), rectBottom(b)) - y,\n width: Math.max(rectRight(a), rectRight(b)) - x,\n x,\n y,\n };\n}\n\n/**\n * Overlap of two rects using closed intervals: touching rects (or a zero-area\n * rect on another's edge) intersect and may yield a zero-area result.\n * Returns null only when the rects are disjoint.\n */\nexport function intersectRect(a: Rect, b: Rect): Rect | null {\n const x = Math.max(a.x, b.x);\n const y = Math.max(a.y, b.y);\n const right = Math.min(rectRight(a), rectRight(b));\n const bottom = Math.min(rectBottom(a), rectBottom(b));\n if (right < x || bottom < y) return null;\n return { height: bottom - y, width: right - x, x, y };\n}\n\nexport function containsRect(outer: Rect, inner: Rect): boolean {\n return (\n outer.x <= inner.x &&\n outer.y <= inner.y &&\n rectRight(outer) >= rectRight(inner) &&\n rectBottom(outer) >= rectBottom(inner)\n );\n}\n\nexport function containsPoint(rect: Rect, point: Point): boolean {\n return point.x >= rect.x && point.x <= rectRight(rect) && point.y >= rect.y && point.y <= rectBottom(rect);\n}\n\n/** Grows (positive) or shrinks (negative) every edge; a shrink past the center yields a negative-size rect. */\nexport function inflateRect(rect: Rect, amount: number): Rect {\n return { height: rect.height + amount * 2, width: rect.width + amount * 2, x: rect.x - amount, y: rect.y - amount };\n}\n\n/** Whether two rects overlap or merely touch (closed intervals). */\nexport function rectsIntersect(a: Rect, b: Rect): boolean {\n return intersectRect(a, b) !== null;\n}\n","import { AtlasConfigError } from './errors.js';\nimport { apply, multiply, rotate, scale, translate } from './matrix.js';\nimport { rectFromPoints } from './rect.js';\nimport type { Matrix, Point, Rect, Size } from './shapes.js';\n\nexport type CameraState = Readonly<{\n /** World point at the viewport centre. */\n x: number;\n y: number;\n /** Screen pixels per world unit. */\n zoom: number;\n /** Radians in (-π, π]; positive is clockwise on screen. */\n rotation: number;\n}>;\n\nexport type CameraOptions = Readonly<{\n initial?: Partial<CameraState>;\n minZoom?: number;\n maxZoom?: number;\n /** Viewport size in CSS px. Default 0×0, where the centre is the origin. */\n viewport?: Size;\n scheduler?: FrameScheduler;\n}>;\n\nexport type FrameScheduler = Readonly<{\n requestFrame: (callback: (time: number) => void) => number;\n cancelFrame: (handle: number) => void;\n now: () => number;\n}>;\n\nexport type AnimationOptions = Readonly<{\n duration?: number;\n easing?: (t: number) => number;\n signal?: AbortSignal;\n}>;\n\nexport type Camera = Readonly<{\n readonly state: CameraState;\n /** Viewport size in CSS px; the world point at its centre is `state.x/y`. */\n readonly viewport: Size;\n /** world → screen. */\n readonly matrix: Matrix;\n /** screen → world. Zoom is clamped above zero, so this always exists. */\n readonly inverse: Matrix;\n toScreen(point: Point): Point;\n toWorld(point: Point): Point;\n /** Jump to `target` immediately, cancelling any animation. */\n set(target: Partial<CameraState>): void;\n /** Change the viewport size, keeping the world point at its centre fixed. */\n resize(size: Size): void;\n panBy(dx: number, dy: number): void;\n /** Zoom keeping the world point under `screenPoint` fixed. `factor` multiplies current zoom. */\n zoomAt(screenPoint: Point, factor: number): void;\n /** Rotate keeping the world point under `screenPoint` fixed. `delta` radians. */\n rotateAt(screenPoint: Point, delta: number): void;\n /** Fit `bounds` into the current viewport with inner `padding`. */\n fitBounds(bounds: Rect, options?: Readonly<{ padding?: number }>): void;\n /** Axis-aligned world bounds of the visible viewport, honouring rotation. */\n readonly visibleRect: Rect;\n /** Animate to `target`; concurrent calls replace the running animation. */\n animateTo(target: Partial<CameraState>, options?: AnimationOptions): void;\n stop(): void;\n subscribe(listener: (state: CameraState) => void, options?: Readonly<{ signal?: AbortSignal }>): () => void;\n dispose(): void;\n readonly disposed: boolean;\n readonly disposalSignal: AbortSignal;\n [Symbol.dispose]: () => void;\n}>;\n\nconst DEFAULT_SCHEDULER: FrameScheduler = {\n cancelFrame: (handle) => cancelAnimationFrame(handle),\n now: () => performance.now(),\n requestFrame: (callback) => requestAnimationFrame(callback),\n};\n\nfunction assertFinite(name: string, value: number): void {\n if (!Number.isFinite(value)) throw new AtlasConfigError(`${name} must be a finite number, received ${value}`);\n}\n\nfunction easeInOut(t: number): number {\n return t < 0.5 ? 2 * t * t : 1 - (-2 * t + 2) ** 2 / 2;\n}\n\n/** Normalize an angle to (-π, π]. */\nfunction normalizeAngle(angle: number): number {\n const wrapped = (angle + Math.PI) % (2 * Math.PI);\n return ((wrapped + 2 * Math.PI) % (2 * Math.PI)) - Math.PI;\n}\n\n/** Shortest signed path from `from` to `to`, in (-π, π]. */\nfunction shortestAngle(from: number, to: number): number {\n return normalizeAngle(to - from);\n}\n\n/** World-space offset that a screen-space offset corresponds to at `zoom`/`rotation`. */\nfunction screenDeltaToWorld(delta: Point, zoom: number, rotation: number): Point {\n return apply(multiply(rotate(-rotation), scale(1 / zoom)), delta);\n}\n\n/**\n * world → screen: translate(viewport centre) · scale(zoom) · rotate(rotation) · translate(-state).\n * With the state point at the viewport centre, saved states no longer depend\n * on the screen size.\n */\nfunction matrixOf(s: CameraState, viewport: Size): Matrix {\n const rotated = multiply(scale(s.zoom), rotate(s.rotation));\n const m = multiply(rotated, translate(-s.x, -s.y));\n return multiply(translate(viewport.width / 2, viewport.height / 2), m);\n}\n\n/**\n * screen → world in closed form: translate(state) · rotate(-r) · scale(1/z) · translate(-centre).\n * Zoom is clamped above zero, so the camera matrix is always invertible.\n */\nfunction inverseOf(s: CameraState, viewport: Size): Matrix {\n const m = multiply(rotate(-s.rotation), scale(1 / s.zoom));\n const t = screenDeltaToWorld({ x: viewport.width / 2, y: viewport.height / 2 }, s.zoom, s.rotation);\n return multiply(translate(s.x - t.x, s.y - t.y), m);\n}\n\nexport function createCamera(options: CameraOptions = {}): Camera {\n const minZoom = options.minZoom ?? 0.01;\n const maxZoom = options.maxZoom ?? 1000;\n if (!(minZoom > 0 && minZoom <= maxZoom)) {\n throw new AtlasConfigError(`Zoom clamps must satisfy 0 < minZoom <= maxZoom, received ${minZoom} and ${maxZoom}`);\n }\n const scheduler = options.scheduler ?? DEFAULT_SCHEDULER;\n const initial = options.initial ?? {};\n let viewport: Size = options.viewport ?? { height: 0, width: 0 };\n let state: CameraState = {\n rotation: normalizeAngle(initial.rotation ?? 0),\n x: initial.x ?? 0,\n y: initial.y ?? 0,\n zoom: Math.min(maxZoom, Math.max(minZoom, initial.zoom ?? 1)),\n };\n for (const [name, value] of [\n ['camera.x', state.x],\n ['camera.y', state.y],\n ['camera.rotation', state.rotation],\n ] as const) {\n assertFinite(name, value);\n }\n\n const controller = new AbortController();\n let disposed = false;\n let animation: { cleanup: () => void; frame: number } | null = null;\n const listeners = new Set<(state: CameraState) => void>();\n\n // Derived transforms are recomputed at most once per state or viewport change.\n let cachedMatrix: Matrix | null = null;\n let cachedInverse: Matrix | null = null;\n\n const matrix = (): Matrix => {\n cachedMatrix ??= matrixOf(state, viewport);\n return cachedMatrix;\n };\n const inverse = (): Matrix => {\n cachedInverse ??= inverseOf(state, viewport);\n return cachedInverse;\n };\n\n const invalidate = (): void => {\n cachedMatrix = null;\n cachedInverse = null;\n };\n\n /** Screen point measured from the viewport centre, where the state point sits. */\n const relativeToCentre = (screenPoint: Point): Point => ({\n x: screenPoint.x - viewport.width / 2,\n y: screenPoint.y - viewport.height / 2,\n });\n\n const emit = (): void => {\n for (const listener of [...listeners]) listener(state);\n };\n\n const set = (next: Partial<CameraState>): void => {\n if (disposed) return;\n const candidate: CameraState = {\n rotation: normalizeAngle(next.rotation ?? state.rotation),\n x: next.x ?? state.x,\n y: next.y ?? state.y,\n zoom: Math.min(maxZoom, Math.max(minZoom, next.zoom ?? state.zoom)),\n };\n if (\n candidate.x === state.x &&\n candidate.y === state.y &&\n candidate.zoom === state.zoom &&\n candidate.rotation === state.rotation\n ) {\n return;\n }\n state = candidate;\n invalidate();\n emit();\n };\n\n /** Cancel any running animation; direct manipulation always wins. */\n const stop = (): void => {\n if (!animation) return;\n scheduler.cancelFrame(animation.frame);\n animation.cleanup();\n animation = null;\n };\n\n const dispose = (): void => {\n if (disposed) return;\n disposed = true;\n stop();\n listeners.clear();\n controller.abort();\n };\n\n const animateTo: Camera['animateTo'] = (target, animateOptions = {}) => {\n stop();\n if (disposed) return;\n const duration = animateOptions.duration ?? 250;\n const easing = animateOptions.easing ?? easeInOut;\n const signal = animateOptions.signal;\n if (signal?.aborted) return;\n if (duration <= 0) {\n set(target);\n return;\n }\n const from = state;\n const to: CameraState = {\n rotation: from.rotation + shortestAngle(from.rotation, target.rotation ?? state.rotation),\n x: target.x ?? state.x,\n y: target.y ?? state.y,\n zoom: Math.min(maxZoom, Math.max(minZoom, target.zoom ?? state.zoom)),\n };\n const start = scheduler.now();\n // Log-space zoom interpolation keeps multiplicative zoom visually linear.\n const logFrom = Math.log(from.zoom);\n const logTo = Math.log(to.zoom);\n const frame = { cleanup: () => {}, frame: 0 };\n animation = frame;\n const abort = (): void => {\n if (animation !== frame) return;\n stop();\n };\n if (signal) {\n signal.addEventListener('abort', abort, { once: true });\n frame.cleanup = () => signal.removeEventListener('abort', abort);\n }\n const step = (time: number): void => {\n if (animation !== frame) return;\n const t = Math.min(1, (time - start) / duration);\n const e = easing(t);\n set({\n rotation: from.rotation + (to.rotation - from.rotation) * e,\n x: from.x + (to.x - from.x) * e,\n y: from.y + (to.y - from.y) * e,\n zoom: Math.exp(logFrom + (logTo - logFrom) * e),\n });\n if (t >= 1) {\n animation = null;\n frame.cleanup();\n return;\n }\n frame.frame = scheduler.requestFrame(step);\n };\n frame.frame = scheduler.requestFrame(step);\n };\n\n return {\n animateTo,\n get disposalSignal() {\n return controller.signal;\n },\n dispose,\n get disposed() {\n return disposed;\n },\n fitBounds(bounds, fitOptions = {}) {\n if (disposed) return;\n stop();\n const padding = fitOptions.padding ?? 0;\n const availableWidth = Math.max(1, viewport.width - padding * 2);\n const availableHeight = Math.max(1, viewport.height - padding * 2);\n const zoom = Math.min(\n maxZoom,\n Math.max(\n minZoom,\n Math.min(\n bounds.width === 0 ? maxZoom : availableWidth / bounds.width,\n bounds.height === 0 ? maxZoom : availableHeight / bounds.height,\n ),\n ),\n );\n // The state point is the world point at the viewport centre, so fitting\n // the bounds centre on screen means moving the state to it directly.\n set({ x: bounds.x + bounds.width / 2, y: bounds.y + bounds.height / 2, zoom });\n },\n get inverse() {\n return inverse();\n },\n get matrix() {\n return matrix();\n },\n panBy(dx, dy) {\n if (disposed) return;\n stop();\n // Screen-space pan: move the world centre opposite to the drag.\n const offset = screenDeltaToWorld({ x: dx, y: dy }, state.zoom, state.rotation);\n set({ x: state.x - offset.x, y: state.y - offset.y });\n },\n resize(size) {\n if (disposed) return;\n if (size.width === viewport.width && size.height === viewport.height) return;\n viewport = { height: size.height, width: size.width };\n // The state point is the world centre, so it stays fixed by definition;\n // only the derived transforms change.\n invalidate();\n emit();\n },\n rotateAt(screenPoint, delta) {\n if (disposed) return;\n stop();\n const world = apply(inverse(), screenPoint);\n // Anchor math must use the new rotation, so compute before set() normalizes it.\n const rotation = state.rotation + delta;\n const offset = screenDeltaToWorld(relativeToCentre(screenPoint), state.zoom, rotation);\n set({ rotation, x: world.x - offset.x, y: world.y - offset.y });\n },\n set(target) {\n stop();\n set(target);\n },\n [Symbol.dispose]: dispose,\n get state() {\n return state;\n },\n stop,\n subscribe(listener, subscribeOptions) {\n if (disposed || subscribeOptions?.signal?.aborted) return () => {};\n listeners.add(listener);\n subscribeOptions?.signal?.addEventListener('abort', () => listeners.delete(listener), { once: true });\n return () => listeners.delete(listener);\n },\n toScreen(point) {\n return apply(matrix(), point);\n },\n toWorld(point) {\n return apply(inverse(), point);\n },\n get viewport() {\n return viewport;\n },\n get visibleRect() {\n const to = inverse();\n const corners = [\n apply(to, { x: 0, y: 0 }),\n apply(to, { x: viewport.width, y: 0 }),\n apply(to, { x: 0, y: viewport.height }),\n apply(to, { x: viewport.width, y: viewport.height }),\n ] as const;\n // A finite viewport always produces a rect.\n return rectFromPoints(corners);\n },\n zoomAt(screenPoint, factor) {\n if (!Number.isFinite(factor) || factor <= 0) {\n throw new AtlasConfigError(`zoomAt factor must be a positive finite number, received ${factor}`);\n }\n if (disposed) return;\n stop();\n const world = apply(inverse(), screenPoint);\n const zoom = Math.min(maxZoom, Math.max(minZoom, state.zoom * factor));\n // Anchor math must use the new zoom, so compute before set().\n const offset = screenDeltaToWorld(relativeToCentre(screenPoint), zoom, state.rotation);\n set({ x: world.x - offset.x, y: world.y - offset.y, zoom });\n },\n };\n}\n","import { AtlasConfigError } from './errors.js';\nimport type { Point } from './shapes.js';\n\n/**\n * Ray-casting point-in-polygon test. `polygon` is an open ring; an implicit closing\n * edge connects the last point to the first. Boundary behavior follows the standard\n * ray-cast convention (edge hits depend on the ray's crossing parity).\n */\nexport function pointInPolygon(polygon: readonly Point[], point: Point): boolean {\n let inside = false;\n const n = polygon.length;\n for (let i = 0, j = n - 1; i < n; j = i++) {\n const a = polygon[i];\n const b = polygon[j];\n const crosses = a.y > point.y !== b.y > point.y;\n if (!crosses) continue;\n const xAtY = ((b.x - a.x) * (point.y - a.y)) / (b.y - a.y) + a.x;\n if (point.x < xAtY) inside = !inside;\n }\n return inside;\n}\n\nfunction distanceToSegment(point: Point, a: Point, b: Point): number {\n const dx = b.x - a.x;\n const dy = b.y - a.y;\n const lengthSq = dx * dx + dy * dy;\n if (lengthSq === 0) return Math.hypot(point.x - a.x, point.y - a.y);\n let t = ((point.x - a.x) * dx + (point.y - a.y) * dy) / lengthSq;\n t = Math.max(0, Math.min(1, t));\n return Math.hypot(point.x - (a.x + t * dx), point.y - (a.y + t * dy));\n}\n\n/**\n * Shortest distance from a point to a polyline (an open path; no implicit closing\n * edge). Returns Infinity for an empty path and the point-to-point distance for\n * a single-point path.\n */\nexport function distanceToPolyline(path: readonly Point[], point: Point): number {\n if (path.length === 0) return Infinity;\n if (path.length === 1) return Math.hypot(point.x - path[0].x, point.y - path[0].y);\n let best = Infinity;\n for (let i = 0, j = 1; j < path.length; i = j++) {\n const d = distanceToSegment(point, path[i], path[j]);\n if (d < best) best = d;\n }\n return best;\n}\n\n/**\n * Whether a point lies within `tolerance` of a polygon's outline or inside it —\n * the hit test for stroked shapes (outlines, wires rendered as strokes).\n */\nexport function pointNearPolygon(polygon: readonly Point[], point: Point, tolerance: number): boolean {\n if (!(tolerance >= 0)) {\n throw new AtlasConfigError(`tolerance must be a non-negative finite number; received ${String(tolerance)}.`);\n }\n const closed = polygon.length > 0 ? [...polygon, polygon[0]] : polygon;\n if (distanceToPolyline(closed, point) <= tolerance) return true;\n return pointInPolygon(polygon, point);\n}\n","import { AtlasConfigError } from './errors.js';\nimport { rectBottom, rectCenter, rectFromPoints, rectRight } from './rect.js';\nimport type { Point, Rect } from './shapes.js';\n\n/** What a guide was snapped to: a grid line, another shape's anchor, or an equal-spacing gap. */\nexport type SnapGuideKind = 'grid' | 'object' | 'spacing';\n\n/**\n * A guide line to render. `axis` names the axis the line is perpendicular to:\n * an `'x'` guide is a vertical line at `position = x`, spanning `from..to` on\n * y. Spacing guides carry `marks`: the centers of the two equal gaps, measured\n * along the span axis, drawn as markers.\n */\nexport interface SnapGuide {\n axis: 'x' | 'y';\n /** Span endpoints along the line's own direction (world coordinates). */\n from: number;\n /** Render hint: draw grid and spacing guides dashed, object guides solid. */\n kind: SnapGuideKind;\n /** Spacing guides only: centers of the two equal gaps, on the span axis. */\n marks?: readonly [number, number];\n /** The coordinate the line sits on, on `axis`. */\n position: number;\n to: number;\n}\n\nexport interface SnapOptions {\n /** Other shapes to snap against. The moving rect itself must not be included. */\n candidates: readonly Rect[];\n /** Optional grid spacing per axis; lines run through multiples of the spacing. */\n grid?: { x?: number; y?: number };\n /**\n * Also snap for equal gaps between neighbors (img.ly-style spacing guides)\n * on each axis where no alignment snap engaged. Default false.\n */\n spacing?: boolean;\n /** Maximum world-unit distance for a snap to engage. */\n threshold: number;\n}\n\nexport interface SnapResult {\n /** Offset to apply to the moving rect; zero on an axis with no snap. */\n delta: Point;\n /** Guides for the snaps that engaged, at most one per axis. */\n guides: SnapGuide[];\n}\n\n/** The three x coordinates (left, center, right) a rect can snap with. */\nfunction xAnchors(rect: Rect): number[] {\n return [rect.x, rect.x + rect.width / 2, rectRight(rect)];\n}\n\nfunction yAnchors(rect: Rect): number[] {\n return [rect.y, rect.y + rect.height / 2, rectBottom(rect)];\n}\n\n/** A snap target with the kind of guide it produced. */\ninterface Target {\n kind: SnapGuideKind;\n value: number;\n}\n\ninterface AxisSnap {\n delta: number;\n kind: SnapGuideKind;\n /** Target coordinate that produced the snap. */\n position: number;\n}\n\nfunction bestAxisSnap(anchors: readonly number[], targets: readonly Target[], threshold: number): AxisSnap | null {\n let best: AxisSnap | null = null;\n for (const anchor of anchors) {\n for (const target of targets) {\n const delta = target.value - anchor;\n if (Math.abs(delta) > threshold) continue;\n if (best === null || Math.abs(delta) < Math.abs(best.delta)) {\n best = { delta, kind: target.kind, position: target.value };\n }\n }\n }\n return best;\n}\n\nfunction gridTargets(min: number, max: number, spacing: number | undefined, threshold: number): Target[] {\n if (spacing === undefined || !Number.isFinite(spacing) || spacing <= 0) return [];\n const targets: Target[] = [];\n for (let line = Math.floor((min - threshold) / spacing) * spacing; line <= max + threshold; line += spacing) {\n targets.push({ kind: 'grid', value: line });\n }\n return targets;\n}\n\nfunction spanFor(\n position: number,\n moved: Rect,\n candidates: readonly Rect[],\n axis: 'x' | 'y',\n): { from: number; to: number } {\n const touching: Rect[] = [];\n for (const candidate of candidates) {\n const anchors = axis === 'x' ? xAnchors(candidate) : yAnchors(candidate);\n if (anchors.some((anchor) => anchor === position)) touching.push(candidate);\n }\n const points: Point[] = [moved, ...touching].flatMap((rect) => [\n { x: rect.x, y: rect.y },\n { x: rectRight(rect), y: rectBottom(rect) },\n ]);\n const bounds = rectFromPoints(points) ?? { height: 0, width: 0, x: position, y: position };\n return axis === 'x' ? { from: bounds.y, to: rectBottom(bounds) } : { from: bounds.x, to: rectRight(bounds) };\n}\n\n/** Overlap test on the axis perpendicular to `axis`. */\nfunction overlapsPerpendicular(a: Rect, b: Rect, axis: 'x' | 'y'): boolean {\n return axis === 'x' ? a.y < rectBottom(b) && b.y < rectBottom(a) : a.x < rectRight(b) && b.x < rectRight(a);\n}\n\n/**\n * Equal-gap snap along `axis`: centers the rect between the nearest\n * perpendicular-overlapping neighbors when the gaps can be made equal within\n * `threshold`. `position` is the moving rect's center on the perpendicular\n * axis; `span` and `marks` are along `axis`.\n */\nfunction axisSpacingSnap(\n rect: Rect,\n candidates: readonly Rect[],\n axis: 'x' | 'y',\n threshold: number,\n): { delta: number; marks: readonly [number, number]; position: number; span: readonly [number, number] } | null {\n const start = axis === 'x' ? (r: Rect) => r.x : (r: Rect) => r.y;\n const end = axis === 'x' ? (r: Rect) => rectRight(r) : (r: Rect) => rectBottom(r);\n let leftEnd = -Infinity;\n let rightStart = Infinity;\n for (const candidate of candidates) {\n if (!overlapsPerpendicular(rect, candidate, axis)) continue;\n if (end(candidate) <= start(rect) && end(candidate) > leftEnd) leftEnd = end(candidate);\n if (start(candidate) >= end(rect) && start(candidate) < rightStart) rightStart = start(candidate);\n }\n if (leftEnd === -Infinity || rightStart === Infinity) return null;\n const free = rightStart - leftEnd - (axis === 'x' ? rect.width : rect.height);\n if (free < 0) return null;\n const ideal = leftEnd + free / 2;\n const delta = ideal - start(rect);\n if (Math.abs(delta) > threshold) return null;\n const gap = free / 2;\n return {\n delta,\n marks: [leftEnd + gap / 2, rightStart - gap / 2],\n // `rect` is the already-moved rect, so the guide sits at the position the\n // shape actually occupies after both axes snapped.\n position: axis === 'x' ? rectCenter(rect).y : rectCenter(rect).x,\n span: [leftEnd, rightStart],\n };\n}\n\n/**\n * Snap a moving rect against candidate shapes, an optional grid, and (with\n * `spacing`) equal gaps between neighbors. Each axis snaps independently to\n * the nearest alignment target within `threshold`; when an axis finds no\n * alignment snap and `spacing` is enabled, it falls back to centering the rect\n * between its nearest neighbors on that axis.\n */\nexport function snapRect(rect: Rect, options: SnapOptions): SnapResult {\n const { candidates, grid, spacing, threshold } = options;\n if (!(threshold >= 0)) {\n throw new AtlasConfigError(`threshold must be a non-negative finite number; received ${String(threshold)}.`);\n }\n let movedX = rect.x;\n let movedY = rect.y;\n const delta = { x: 0, y: 0 };\n\n const xTargets: Target[] = candidates.flatMap((candidate) =>\n xAnchors(candidate).map((value): Target => ({ kind: 'object', value })),\n );\n xTargets.push(...gridTargets(rect.x, rectRight(rect), grid?.x, threshold));\n const xSnap = bestAxisSnap(xAnchors(rect), xTargets, threshold);\n if (xSnap !== null) {\n delta.x = xSnap.delta;\n movedX += xSnap.delta;\n }\n\n const yTargets: Target[] = candidates.flatMap((candidate) =>\n yAnchors(candidate).map((value): Target => ({ kind: 'object', value })),\n );\n yTargets.push(...gridTargets(rect.y, rectBottom(rect), grid?.y, threshold));\n const ySnap = bestAxisSnap(yAnchors(rect), yTargets, threshold);\n if (ySnap !== null) {\n delta.y = ySnap.delta;\n movedY += ySnap.delta;\n }\n\n // Guides span the union of the moved rect and every candidate sharing the snapped coordinate.\n const movedRect: Rect = { ...rect, x: movedX, y: movedY };\n const guides: SnapGuide[] = [];\n if (xSnap !== null) {\n const span = spanFor(xSnap.position, movedRect, candidates, 'x');\n guides.push({ axis: 'x', from: span.from, kind: xSnap.kind, position: xSnap.position, to: span.to });\n }\n if (ySnap !== null) {\n const span = spanFor(ySnap.position, movedRect, candidates, 'y');\n guides.push({ axis: 'y', from: span.from, kind: ySnap.kind, position: ySnap.position, to: span.to });\n }\n\n // Equal-spacing fallback fills the axes where no alignment snap engaged.\n // It runs on the moved rect so its perpendicular position honours the other\n // axis's snap.\n if (spacing) {\n if (xSnap === null) {\n const gap = axisSpacingSnap(movedRect, candidates, 'x', threshold);\n if (gap !== null) {\n delta.x = gap.delta;\n guides.push({\n axis: 'y',\n from: gap.span[0],\n kind: 'spacing',\n marks: gap.marks,\n position: gap.position,\n to: gap.span[1],\n });\n }\n }\n if (ySnap === null) {\n const gap = axisSpacingSnap(movedRect, candidates, 'y', threshold);\n if (gap !== null) {\n delta.y = gap.delta;\n guides.push({\n axis: 'x',\n from: gap.span[0],\n kind: 'spacing',\n marks: gap.marks,\n position: gap.position,\n to: gap.span[1],\n });\n }\n }\n }\n return { delta, guides };\n}\n\n/** Which edge/center line to align rects on. */\nexport type AlignEdge = 'left' | 'horizontal-center' | 'right' | 'top' | 'vertical-center' | 'bottom';\n\n/**\n * Align rects on a shared line derived from their combined bounds, preserving\n * sizes. Returns new rects in input order; the input is untouched.\n */\nexport function alignRects(rects: readonly Rect[], edge: AlignEdge): Rect[] {\n if (rects.length === 0) return [];\n const bounds = rectFromPoints(\n rects.flatMap((rect) => [\n { x: rect.x, y: rect.y },\n { x: rectRight(rect), y: rectBottom(rect) },\n ]),\n );\n if (bounds === null) return [];\n return rects.map((rect) => {\n switch (edge) {\n case 'left':\n return { ...rect, x: bounds.x };\n case 'horizontal-center':\n return { ...rect, x: rectCenter(bounds).x - rect.width / 2 };\n case 'right':\n return { ...rect, x: rectRight(bounds) - rect.width };\n case 'top':\n return { ...rect, y: bounds.y };\n case 'vertical-center':\n return { ...rect, y: rectCenter(bounds).y - rect.height / 2 };\n case 'bottom':\n return { ...rect, y: rectBottom(bounds) - rect.height };\n default:\n throw new AtlasConfigError(`unknown align edge: ${String(edge)}.`);\n }\n });\n}\n\n/**\n * Equalize the gaps between rects along an axis. The outermost rects stay\n * fixed; middle rects move in sorted order along the axis. Fewer than three\n * rects are returned as copies unchanged.\n */\nexport function distributeRects(rects: readonly Rect[], axis: 'x' | 'y'): Rect[] {\n if (rects.length <= 2) return rects.map((rect) => ({ ...rect }));\n const start = axis === 'x' ? (rect: Rect) => rect.x : (rect: Rect) => rect.y;\n const size = axis === 'x' ? (rect: Rect) => rect.width : (rect: Rect) => rect.height;\n const order = rects\n .map((rect, index) => ({ index, rect }))\n .sort((a, b) => start(a.rect) - start(b.rect) || a.index - b.index);\n const first = order[0].rect;\n const last = order[order.length - 1].rect;\n const totalSpan = start(last) + size(last) - start(first);\n const totalSize = order.reduce((sum, entry) => sum + size(entry.rect), 0);\n const gap = (totalSpan - totalSize) / (order.length - 1);\n const result = rects.map((rect) => ({ ...rect }));\n let cursor = start(first);\n for (const entry of order) {\n const moved = { ...entry.rect };\n if (axis === 'x') moved.x = cursor;\n else moved.y = cursor;\n result[entry.index] = moved;\n cursor += size(entry.rect) + gap;\n }\n return result;\n}\n","import { AtlasConfigError } from './errors.js';\nimport { containsRect, inflateRect, rectsIntersect } from './rect.js';\nimport type { Point, Rect } from './shapes.js';\n\nexport type SpatialIndexOptions = Readonly<{\n /** Maximum children per node before a split. Default 8. */\n maxEntriesPerNode?: number;\n}>;\n\nexport type SpatialQueryOptions = Readonly<{\n /** Expand the query point into a box of this half-size. Default 0. */\n tolerance?: number;\n}>;\n\n/**\n * A Map-like index over ids and their bounding rects. The index stores only\n * geometry — the caller owns the data and looks it up from returned ids —\n * so stored values can never go stale.\n */\nexport type SpatialIndex<K = string> = Readonly<{\n /** Insert `id`, or move it to `rect` when it already exists. */\n set(id: K, rect: Rect): void;\n delete(id: K): boolean;\n /** Current rect for `id`, or undefined. */\n get(id: K): Rect | undefined;\n has(id: K): boolean;\n clear(): void;\n readonly size: number;\n /** Bounding box of all entries; null when empty. */\n readonly bounds: Rect | null;\n /** Ids whose rect overlaps or touches `rect`. */\n queryRect(rect: Rect): K[];\n /** Ids whose rect contains `point`, or comes within `tolerance` of it. */\n queryPoint(point: Point, options?: SpatialQueryOptions): K[];\n}>;\n\ninterface LeafEntry<K> {\n id: K;\n rect: Rect;\n}\n\ntype Leaf<K> = { children: LeafEntry<K>[]; leaf: true; rect: Rect | null };\ntype Branch<K> = { children: Node<K>[]; leaf: false; rect: Rect | null };\ntype Node<K> = Leaf<K> | Branch<K>;\n\nfunction rectOf<K>(node: Node<K> | LeafEntry<K>): Rect {\n return node.rect as Rect;\n}\n\nfunction unionRects(a: Rect, b: Rect): Rect {\n const x = Math.min(a.x, b.x);\n const y = Math.min(a.y, b.y);\n return {\n height: Math.max(a.y + a.height, b.y + b.height) - y,\n width: Math.max(a.x + a.width, b.x + b.width) - x,\n x,\n y,\n };\n}\n\nfunction area(rect: Rect): number {\n return rect.width * rect.height;\n}\n\nfunction rectsEqual(a: Rect, b: Rect): boolean {\n return a.x === b.x && a.y === b.y && a.width === b.width && a.height === b.height;\n}\n\nfunction recompute<K>(node: Node<K>): void {\n let rect: Rect | null = null;\n for (const child of node.children) {\n rect = rect === null ? { ...rectOf(child) } : unionRects(rect, rectOf(child));\n }\n node.rect = rect;\n}\n\n/**\n * Dynamic R-tree (Guttman, quadratic split) over axis-aligned rectangles:\n * O(log n) rect and point queries for hit-testing, marquee selection, and\n * viewport culling over thousands of items. Rect intersection uses closed\n * intervals, so zero-area entries (lines, points) are findable.\n */\nexport function createSpatialIndex<K = string>(options: SpatialIndexOptions = {}): SpatialIndex<K> {\n const maxEntries = options.maxEntriesPerNode ?? 8;\n if (!Number.isInteger(maxEntries) || maxEntries < 4) {\n throw new AtlasConfigError(`maxEntriesPerNode must be an integer >= 4, received ${maxEntries}`);\n }\n const minEntries = Math.max(2, Math.ceil(maxEntries / 3));\n const entries = new Map<K, LeafEntry<K>>();\n let root: Node<K> = { children: [], leaf: true, rect: null };\n\n const pickChild = (node: Branch<K>, rect: Rect): Node<K> => {\n let best: Node<K> | null = null;\n let bestEnlargement = Infinity;\n let bestArea = Infinity;\n for (const child of node.children) {\n const current = child.rect ?? rect;\n const enlargement = area(unionRects(current, rect)) - area(current);\n if (enlargement < bestEnlargement || (enlargement === bestEnlargement && area(current) < bestArea)) {\n best = child;\n bestEnlargement = enlargement;\n bestArea = area(current);\n }\n }\n return best as Node<K>;\n };\n\n const split = (node: Node<K>): [Node<K>, Node<K>] => {\n const items = node.children;\n // Quadratic pick-seeds: the pair wasting the most area when combined.\n let si = 0;\n let sj = 1;\n let worst = -Infinity;\n for (let i = 0; i < items.length; i++) {\n for (let j = i + 1; j < items.length; j++) {\n const waste =\n area(unionRects(rectOf(items[i]), rectOf(items[j]))) - area(rectOf(items[i])) - area(rectOf(items[j]));\n if (waste > worst) {\n worst = waste;\n si = i;\n sj = j;\n }\n }\n }\n const groupA: Array<Node<K> | LeafEntry<K>> = [items[si]];\n const groupB: Array<Node<K> | LeafEntry<K>> = [items[sj]];\n let rectA = rectOf(items[si]);\n let rectB = rectOf(items[sj]);\n const remaining = items.filter((_, index) => index !== si && index !== sj);\n for (const [index, item] of remaining.entries()) {\n // Force distribution so neither group can exceed maxEntries or fall below minEntries.\n const mustA =\n groupA.length + (remaining.length - index) > maxEntries ||\n groupB.length + (remaining.length - index) - 1 < minEntries;\n const mustB =\n groupB.length + (remaining.length - index) > maxEntries ||\n groupA.length + (remaining.length - index) - 1 < minEntries;\n let toA: boolean;\n if (mustA) toA = true;\n else if (mustB) toA = false;\n else {\n const enlargeA = area(unionRects(rectA, rectOf(item))) - area(rectA);\n const enlargeB = area(unionRects(rectB, rectOf(item))) - area(rectB);\n toA = enlargeA < enlargeB || (enlargeA === enlargeB && area(rectA) <= area(rectB));\n }\n if (toA) {\n groupA.push(item);\n rectA = unionRects(rectA, rectOf(item));\n } else {\n groupB.push(item);\n rectB = unionRects(rectB, rectOf(item));\n }\n }\n const a = (\n node.leaf\n ? { children: groupA as LeafEntry<K>[], leaf: true, rect: null }\n : { children: groupA as Node<K>[], leaf: false, rect: null }\n ) as Node<K>;\n const b = (\n node.leaf\n ? { children: groupB as LeafEntry<K>[], leaf: true, rect: null }\n : { children: groupB as Node<K>[], leaf: false, rect: null }\n ) as Node<K>;\n recompute(a);\n recompute(b);\n return [a, b];\n };\n\n /** Insert `item` under `node`; returns the split pair when `node` overflows. */\n const insertInto = (node: Node<K>, item: Node<K> | LeafEntry<K>): [Node<K>, Node<K>] | null => {\n if (node.leaf) {\n node.children.push(item as LeafEntry<K>);\n node.rect = node.rect === null ? { ...rectOf(item) } : unionRects(node.rect, rectOf(item));\n if (node.children.length > maxEntries) return split(node);\n return null;\n }\n const branch = node as Branch<K>;\n const child = pickChild(branch, rectOf(item));\n const overflow = insertInto(child, item);\n recompute(node);\n if (overflow) {\n const index = branch.children.indexOf(child);\n branch.children.splice(index, 1, overflow[0], overflow[1]);\n recompute(node);\n }\n if (node.children.length > maxEntries) return split(node);\n return null;\n };\n\n const insertEntry = (entry: LeafEntry<K>): void => {\n // A fully emptied root stays as an empty branch after removals; revive it as a leaf.\n if (!root.leaf && root.children.length === 0) {\n root = { children: [], leaf: true, rect: null };\n }\n const overflow = insertInto(root, entry);\n if (overflow) {\n root = { children: overflow, leaf: false, rect: null };\n recompute(root);\n }\n };\n\n /** Depth-first remove; returns true when `node` became empty. */\n const removeFrom = (node: Node<K>, entry: LeafEntry<K>): boolean => {\n if (node.leaf) {\n const index = node.children.indexOf(entry);\n if (index !== -1) node.children.splice(index, 1);\n recompute(node);\n return node.children.length === 0;\n }\n const branch = node as Branch<K>;\n for (let i = branch.children.length - 1; i >= 0; i--) {\n const child = branch.children[i];\n // Prune by containment, not intersection: a branch rect is the union of\n // its children, so the entry's rect is always contained in the child\n // that holds it.\n if (child.rect && containsRect(child.rect, entry.rect)) {\n if (removeFrom(child, entry)) branch.children.splice(i, 1);\n }\n }\n recompute(node);\n return branch.children.length === 0;\n };\n\n const deleteEntry = (id: K): boolean => {\n const entry = entries.get(id);\n if (!entry) return false;\n entries.delete(id);\n removeFrom(root, entry);\n // Collapse a root branch that ended up with a single child.\n while (!root.leaf && root.children.length === 1) {\n root = root.children[0];\n }\n return true;\n };\n\n const queryInto = (node: Node<K>, hits: (rect: Rect) => boolean, out: K[]): void => {\n if (!node.rect || !hits(node.rect)) return;\n if (node.leaf) {\n for (const entry of node.children) {\n if (hits(entry.rect)) out.push(entry.id);\n }\n return;\n }\n for (const child of (node as Branch<K>).children) queryInto(child, hits, out);\n };\n\n return {\n get bounds() {\n return root.rect;\n },\n clear() {\n entries.clear();\n root = { children: [], leaf: true, rect: null };\n },\n delete: deleteEntry,\n get(id) {\n return entries.get(id)?.rect;\n },\n has(id) {\n return entries.has(id);\n },\n queryPoint(point, queryOptions) {\n const tolerance = queryOptions?.tolerance ?? 0;\n if (!(tolerance >= 0)) {\n throw new AtlasConfigError(`tolerance must be a non-negative finite number, received ${tolerance}`);\n }\n // A point is a zero-size box; closed-interval intersection makes it hit\n // rects that merely touch it, so one shared path covers both query kinds.\n const box: Rect = inflateRect({ ...point, height: 0, width: 0 }, tolerance);\n const out: K[] = [];\n queryInto(root, (rect) => rectsIntersect(rect, box), out);\n return out;\n },\n queryRect(rect) {\n const out: K[] = [];\n queryInto(root, (candidate) => rectsIntersect(candidate, rect), out);\n return out;\n },\n set(id, rect) {\n const existing = entries.get(id);\n if (existing) {\n if (rectsEqual(existing.rect, rect)) return;\n deleteEntry(id);\n }\n const entry: LeafEntry<K> = { id, rect: { ...rect } };\n entries.set(id, entry);\n insertEntry(entry);\n },\n get size() {\n return entries.size;\n },\n };\n}\n"],"mappings":"A,mEAAA,IAAa,WAAb,cAAgC,KAAM,CACpC,YAAY,EAAiB,EAAqB,CAChD,MAAMA,EAASC,CAAI,EACnB,KAAK,KAAO,WAAW,KACvB,OAAO,eAAe,KAAM,WAAW,SAAS,CAClD,CACF,EAEa,iBAAb,cAAsC,UAAW,CAAC,ECNrCC,EAAmB,OAAO,OAAO,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,CAAC,EAEhE,SAAgB,SAAS,EAAW,EAAmB,CACrD,MAAO,CACLC,EAAE,GAAKC,EAAE,GAAKD,EAAE,GAAKC,EAAE,GACvBD,EAAE,GAAKC,EAAE,GAAKD,EAAE,GAAKC,EAAE,GACvBD,EAAE,GAAKC,EAAE,GAAKD,EAAE,GAAKC,EAAE,GACvBD,EAAE,GAAKC,EAAE,GAAKD,EAAE,GAAKC,EAAE,GACvBD,EAAE,GAAKC,EAAE,GAAKD,EAAE,GAAKC,EAAE,GAAKD,EAAE,GAC9BA,EAAE,GAAKC,EAAE,GAAKD,EAAE,GAAKC,EAAE,GAAKD,EAAE,EAChC,CACF,CAEA,SAAgB,MAAM,EAAgB,EAAqB,CACzD,MAAO,CACL,EAAGE,EAAO,GAAKC,EAAM,EAAID,EAAO,GAAKC,EAAM,EAAID,EAAO,GACtD,EAAGA,EAAO,GAAKC,EAAM,EAAID,EAAO,GAAKC,EAAM,EAAID,EAAO,EACxD,CACF,CAEA,SAAgB,UAAU,EAAY,EAAoB,CACxD,MAAO,CAAC,EAAG,EAAG,EAAG,EAAGE,EAAIC,CAAE,CAC5B,CAEA,SAAgB,MAAM,EAAY,EAAaC,EAAY,CACzD,MAAO,CAACA,EAAI,EAAG,EAAGC,EAAI,EAAG,CAAC,CAC5B,CAGA,SAAgB,OAAO,EAAyB,CAC9C,IAAMC,EAAM,KAAK,IAAIC,CAAO,EACtBC,EAAM,KAAK,IAAID,CAAO,EAC5B,MAAO,CAACD,EAAKE,EAAK,CAACA,EAAKF,EAAK,EAAG,CAAC,CACnC,CAGA,SAAgB,OAAO,EAAe,EAAwB,CAC5D,OAAO,SAAS,SAAS,UAAUG,EAAO,EAAGA,EAAO,CAAC,EAAGT,CAAM,EAAG,UAAU,CAACS,EAAO,EAAG,CAACA,EAAO,CAAC,CAAC,CAClG,CAGA,SAAgB,QAAQ,EAAwB,CAG9C,OAFW,KAAK,MAAMT,EAAO,GAAIA,EAAO,EAEhC,EADG,KAAK,MAAMA,EAAO,GAAIA,EAAO,EAC3B,GAAM,CACrB,CAGA,SAAgB,YAAY,EAAwB,CAClD,MAAO,UAAUA,EAAO,KAAK,GAAG,EAAE,EACpC,CAGA,SAAgB,OAAO,EAA+B,CACpD,IAAMU,EAAMV,EAAO,GAAKA,EAAO,GAAKA,EAAO,GAAKA,EAAO,GACvD,GAAI,CAAC,OAAO,SAASU,CAAG,GAAKA,IAAQ,EAAG,OAAO,KAC/C,IAAMC,EAAM,EAAID,EAChB,MAAO,CACLV,EAAO,GAAKW,EACZ,CAACX,EAAO,GAAKW,EACb,CAACX,EAAO,GAAKW,EACbX,EAAO,GAAKW,GACXX,EAAO,GAAKA,EAAO,GAAKA,EAAO,GAAKA,EAAO,IAAMW,GACjDX,EAAO,GAAKA,EAAO,GAAKA,EAAO,GAAKA,EAAO,IAAMW,CACpD,CACF,CC/DA,SAAgB,eAAe,EAAsC,CACnE,IAAIC,EAAO,IACPC,EAAO,IACPC,EAAO,KACPC,EAAO,KACPC,EAAQ,GACZ,IAAK,IAAMf,KAASgB,EAClB,EAAQ,GACJhB,EAAM,EAAIW,IAAM,EAAOX,EAAM,GAC7BA,EAAM,EAAIY,IAAM,EAAOZ,EAAM,GAC7BA,EAAM,EAAIa,IAAM,EAAOb,EAAM,GAC7BA,EAAM,EAAIc,IAAM,EAAOd,EAAM,GAGnC,OADKe,EACE,CAAE,OAAQD,EAAOF,EAAM,MAAOC,EAAOF,EAAM,EAAGA,EAAM,EAAGC,CAAK,EADhD,IAErB,CAEA,SAAgB,UAAU,EAAoB,CAC5C,OAAOK,EAAK,EAAIA,EAAK,KACvB,CAEA,SAAgB,WAAW,EAAoB,CAC7C,OAAOA,EAAK,EAAIA,EAAK,MACvB,CAEA,SAAgB,WAAW,EAAmB,CAC5C,MAAO,CAAE,EAAGA,EAAK,EAAIA,EAAK,MAAQ,EAAG,EAAGA,EAAK,EAAIA,EAAK,OAAS,CAAE,CACnE,CAEA,SAAgB,UAAU,EAAS,EAAe,CAChD,IAAMC,EAAI,KAAK,IAAIrB,EAAE,EAAGC,EAAE,CAAC,EACrBqB,EAAI,KAAK,IAAItB,EAAE,EAAGC,EAAE,CAAC,EAC3B,MAAO,CACL,OAAQ,KAAK,IAAI,WAAWD,CAAC,EAAG,WAAWC,CAAC,CAAC,EAAIqB,EACjD,MAAO,KAAK,IAAI,UAAUtB,CAAC,EAAG,UAAUC,CAAC,CAAC,EAAIoB,EAC9C,IACA,GACF,CACF,CAOA,SAAgB,cAAc,EAAS,EAAsB,CAC3D,IAAMA,EAAI,KAAK,IAAIrB,EAAE,EAAGC,EAAE,CAAC,EACrBqB,EAAI,KAAK,IAAItB,EAAE,EAAGC,EAAE,CAAC,EACrBsB,EAAQ,KAAK,IAAI,UAAUvB,CAAC,EAAG,UAAUC,CAAC,CAAC,EAC3CuB,EAAS,KAAK,IAAI,WAAWxB,CAAC,EAAG,WAAWC,CAAC,CAAC,EAEpD,OADIsB,EAAQF,GAAKG,EAASF,EAAU,KAC7B,CAAE,OAAQE,EAASF,EAAG,MAAOC,EAAQF,EAAG,IAAG,GAAE,CACtD,CAEA,SAAgB,aAAa,EAAa,EAAsB,CAC9D,OACEI,EAAM,GAAKC,EAAM,GACjBD,EAAM,GAAKC,EAAM,GACjB,UAAUD,CAAK,GAAK,UAAUC,CAAK,GACnC,WAAWD,CAAK,GAAK,WAAWC,CAAK,CAEzC,CAEA,SAAgB,cAAc,EAAY,EAAuB,CAC/D,OAAOvB,EAAM,GAAKiB,EAAK,GAAKjB,EAAM,GAAK,UAAUiB,CAAI,GAAKjB,EAAM,GAAKiB,EAAK,GAAKjB,EAAM,GAAK,WAAWiB,CAAI,CAC3G,CAGA,SAAgB,YAAY,EAAY,EAAsB,CAC5D,MAAO,CAAE,OAAQA,EAAK,OAASO,EAAS,EAAG,MAAOP,EAAK,MAAQO,EAAS,EAAG,EAAGP,EAAK,EAAIO,EAAQ,EAAGP,EAAK,EAAIO,CAAO,CACpH,CAGA,SAAgB,eAAe,EAAS,EAAkB,CACxD,OAAO,cAAc3B,EAAGC,CAAC,IAAM,IACjC,CCVA,IAAM2B,EAAoC,CACxC,YAAc,GAAW,qBAAqBC,CAAM,EACpD,QAAW,YAAY,IAAI,EAC3B,aAAe,GAAa,sBAAsBC,CAAQ,CAC5D,EAEA,SAAS,aAAa,EAAc,EAAqB,CACvD,GAAI,CAAC,OAAO,SAASC,CAAK,EAAG,MAAM,IAAI,iBAAiB,GAAGC,EAAK,qCAAqCD,GAAO,CAC9G,CAEA,SAAS,UAAU,EAAmB,CACpC,OAAOE,EAAI,GAAM,EAAIA,EAAIA,EAAI,GAAK,GAAKA,EAAI,IAAM,EAAI,CACvD,CAGA,SAAS,eAAe,EAAuB,CAE7C,QADiBC,EAAQ,KAAK,KAAO,EAAI,KAAK,IAC3B,EAAI,KAAK,KAAO,EAAI,KAAK,IAAO,KAAK,EAC1D,CAGA,SAAS,cAAc,EAAc,EAAoB,CACvD,OAAO,eAAeC,EAAKC,CAAI,CACjC,CAGA,SAAS,mBAAmB,EAAc,EAAc,EAAyB,CAC/E,OAAO,MAAM,SAAS,OAAO,CAACC,CAAQ,EAAG,MAAM,EAAIC,CAAI,CAAC,EAAGC,CAAK,CAClE,CAOA,SAAS,SAAS,EAAgB,EAAwB,CAExD,IAAMC,EAAI,SADM,SAAS,MAAMC,EAAE,IAAI,EAAG,OAAOA,EAAE,QAAQ,CACtC,EAAS,UAAU,CAACA,EAAE,EAAG,CAACA,EAAE,CAAC,CAAC,EACjD,OAAO,SAAS,UAAUC,EAAS,MAAQ,EAAGA,EAAS,OAAS,CAAC,EAAGF,CAAC,CACvE,CAMA,SAAS,UAAU,EAAgB,EAAwB,CACzD,IAAMA,EAAI,SAAS,OAAO,CAACC,EAAE,QAAQ,EAAG,MAAM,EAAIA,EAAE,IAAI,CAAC,EACnDR,EAAI,mBAAmB,CAAE,EAAGS,EAAS,MAAQ,EAAG,EAAGA,EAAS,OAAS,CAAE,EAAGD,EAAE,KAAMA,EAAE,QAAQ,EAClG,OAAO,SAAS,UAAUA,EAAE,EAAIR,EAAE,EAAGQ,EAAE,EAAIR,EAAE,CAAC,EAAGO,CAAC,CACpD,CAEA,SAAgB,aAAa,EAAyB,CAAC,EAAW,CAChE,IAAMG,EAAUC,EAAQ,SAAW,IAC7BC,EAAUD,EAAQ,SAAW,IACnC,GAAI,EAAED,EAAU,GAAKA,GAAWE,GAC9B,MAAM,IAAI,iBAAiB,6DAA6DF,EAAQ,OAAOE,GAAS,EAElH,IAAMC,EAAYF,EAAQ,WAAahB,EACjCmB,EAAUH,EAAQ,SAAW,CAAC,EAChCF,EAAiBE,EAAQ,UAAY,CAAE,OAAQ,EAAG,MAAO,CAAE,EAC3DI,EAAqB,CACvB,SAAU,eAAeD,EAAQ,UAAY,CAAC,EAC9C,EAAGA,EAAQ,GAAK,EAChB,EAAGA,EAAQ,GAAK,EAChB,KAAM,KAAK,IAAIF,EAAS,KAAK,IAAIF,EAASI,EAAQ,MAAQ,CAAC,CAAC,CAC9D,EACA,IAAK,GAAM,CAACf,EAAMD,IAAU,CAC1B,CAAC,WAAYiB,EAAM,CAAC,EACpB,CAAC,WAAYA,EAAM,CAAC,EACpB,CAAC,kBAAmBA,EAAM,QAAQ,CACpC,EACE,aAAahB,EAAMD,CAAK,EAG1B,IAAMkB,EAAa,IAAI,gBACnBC,EAAW,GACXC,EAA2D,KACzDC,EAAY,IAAI,IAGlBC,EAA8B,KAC9BC,EAA+B,KAE7B,YACJ,IAAiB,SAASN,EAAON,CAAQ,EAClCW,GAEH,aACJ,IAAkB,UAAUL,EAAON,CAAQ,EACpCY,GAGH,eAAyB,CAC7B,EAAe,KACf,EAAgB,IAClB,EAGM,iBAAoB,IAA+B,CACvD,EAAGC,EAAY,EAAIb,EAAS,MAAQ,EACpC,EAAGa,EAAY,EAAIb,EAAS,OAAS,CACvC,GAEM,SAAmB,CACvB,IAAK,IAAMc,IAAY,CAAC,GAAGJ,CAAS,EAAGI,EAASR,CAAK,CACvD,EAEM,IAAO,GAAqC,CAChD,GAAIE,EAAU,OACd,IAAMO,EAAyB,CAC7B,SAAU,eAAeC,EAAK,UAAYV,EAAM,QAAQ,EACxD,EAAGU,EAAK,GAAKV,EAAM,EACnB,EAAGU,EAAK,GAAKV,EAAM,EACnB,KAAM,KAAK,IAAIH,EAAS,KAAK,IAAIF,EAASe,EAAK,MAAQV,EAAM,IAAI,CAAC,CACpE,GAEES,EAAU,IAAMT,EAAM,GACtBS,EAAU,IAAMT,EAAM,GACtBS,EAAU,OAAST,EAAM,MACzBS,EAAU,WAAaT,EAAM,YAI/B,EAAQS,EACR,WAAW,EACX,KAAK,EACP,EAGM,SAAmB,CACvB,AAGAN,KAFAL,EAAU,YAAYK,EAAU,KAAK,EACrCA,EAAU,QAAQ,EACN,KACd,EAEM,YAAsB,CACtBD,IACJ,EAAW,GACX,KAAK,EACLE,EAAU,MAAM,EAChBH,EAAW,MAAM,EACnB,EAEM,WAAkC,EAAQ,EAAiB,CAAC,IAAM,CAEtE,GADA,KAAK,EACDC,EAAU,OACd,IAAMS,EAAWC,EAAe,UAAY,IACtCC,EAASD,EAAe,QAAU,UAClCE,EAASF,EAAe,OAC9B,GAAIE,GAAQ,QAAS,OACrB,GAAIH,GAAY,EAAG,CACjB,IAAII,CAAM,EACV,MACF,CACA,IAAM3B,EAAOY,EACPb,EAAkB,CACtB,SAAUC,EAAK,SAAW,cAAcA,EAAK,SAAU2B,EAAO,UAAYf,EAAM,QAAQ,EACxF,EAAGe,EAAO,GAAKf,EAAM,EACrB,EAAGe,EAAO,GAAKf,EAAM,EACrB,KAAM,KAAK,IAAIH,EAAS,KAAK,IAAIF,EAASoB,EAAO,MAAQf,EAAM,IAAI,CAAC,CACtE,EACMgB,EAAQlB,EAAU,IAAI,EAEtBmB,EAAU,KAAK,IAAI7B,EAAK,IAAI,EAC5B8B,EAAQ,KAAK,IAAI/B,EAAG,IAAI,EACxBgC,EAAQ,CAAE,YAAe,CAAC,EAAG,MAAO,CAAE,EAC5C,EAAYA,EACZ,IAAM,UAAoB,CACpBhB,IAAcgB,GAClB,KAAK,CACP,EACIL,IACFA,EAAO,iBAAiB,QAAS,MAAO,CAAE,KAAM,EAAK,CAAC,EACtD,EAAM,YAAgBA,EAAO,oBAAoB,QAAS,KAAK,GAEjE,IAAM,KAAQ,GAAuB,CACnC,GAAIX,IAAcgB,EAAO,OACzB,IAAM,EAAI,KAAK,IAAI,GAAIC,EAAOJ,GAASL,CAAQ,EACzCU,EAAIR,EAAO,CAAC,EAClB,IAAI,CACF,SAAUzB,EAAK,UAAYD,EAAG,SAAWC,EAAK,UAAYiC,EAC1D,EAAGjC,EAAK,GAAKD,EAAG,EAAIC,EAAK,GAAKiC,EAC9B,EAAGjC,EAAK,GAAKD,EAAG,EAAIC,EAAK,GAAKiC,EAC9B,KAAM,KAAK,IAAIJ,GAAWC,EAAQD,GAAWI,CAAC,CAChD,CAAC,EACG,GAAK,GACP,EAAY,KACZF,EAAM,QAAQ,GAGhB,EAAM,MAAQrB,EAAU,aAAa,IAAI,CAC3C,EACA,EAAM,MAAQA,EAAU,aAAa,IAAI,CAC3C,EAEA,MAAO,CACL,UACA,IAAI,gBAAiB,CACnB,OAAOG,EAAW,MACpB,EACA,QACA,IAAI,UAAW,CACb,OAAOC,CACT,EACA,UAAU,EAAQ,EAAa,CAAC,EAAG,CACjC,GAAIA,EAAU,OACd,KAAK,EACL,IAAMoB,EAAUC,EAAW,SAAW,EAChCC,EAAiB,KAAK,IAAI,EAAG9B,EAAS,MAAQ4B,EAAU,CAAC,EACzDG,EAAkB,KAAK,IAAI,EAAG/B,EAAS,OAAS4B,EAAU,CAAC,EAC3DhC,EAAO,KAAK,IAChBO,EACA,KAAK,IACHF,EACA,KAAK,IACH+B,EAAO,QAAU,EAAI7B,EAAU2B,EAAiBE,EAAO,MACvDA,EAAO,SAAW,EAAI7B,EAAU4B,EAAkBC,EAAO,MAC3D,CACF,CACF,EAGA,IAAI,CAAE,EAAGA,EAAO,EAAIA,EAAO,MAAQ,EAAG,EAAGA,EAAO,EAAIA,EAAO,OAAS,EAAG,MAAK,CAAC,CAC/E,EACA,IAAI,SAAU,CACZ,OAAO,QAAQ,CACjB,EACA,IAAI,QAAS,CACX,OAAO,OAAO,CAChB,EACA,MAAM,EAAI,EAAI,CACZ,GAAIxB,EAAU,OACd,KAAK,EAEL,IAAMyB,EAAS,mBAAmB,CAAE,EAAGC,EAAI,EAAGC,CAAG,EAAG7B,EAAM,KAAMA,EAAM,QAAQ,EAC9E,IAAI,CAAE,EAAGA,EAAM,EAAI2B,EAAO,EAAG,EAAG3B,EAAM,EAAI2B,EAAO,CAAE,CAAC,CACtD,EACA,OAAO,EAAM,CACPzB,IACA4B,EAAK,QAAUpC,EAAS,OAASoC,EAAK,SAAWpC,EAAS,UAC9D,EAAW,CAAE,OAAQoC,EAAK,OAAQ,MAAOA,EAAK,KAAM,EAGpD,WAAW,EACX,KAAK,EACP,EACA,SAAS,EAAa,EAAO,CAC3B,GAAI5B,EAAU,OACd,KAAK,EACL,IAAM6B,EAAQ,MAAM,QAAQ,EAAGxB,CAAW,EAEpClB,EAAWW,EAAM,SAAWT,EAC5BoC,EAAS,mBAAmB,iBAAiBpB,CAAW,EAAGP,EAAM,KAAMX,CAAQ,EACrF,IAAI,CAAE,WAAU,EAAG0C,EAAM,EAAIJ,EAAO,EAAG,EAAGI,EAAM,EAAIJ,EAAO,CAAE,CAAC,CAChE,EACA,IAAI,EAAQ,CACV,KAAK,EACL,IAAIZ,CAAM,CACZ,GACC,OAAO,SAAU,QAClB,IAAI,OAAQ,CACV,OAAOf,CACT,EACA,KACA,UAAU,EAAU,EAAkB,CAIpC,OAHIE,GAAY8B,GAAkB,QAAQ,YAAsB,CAAC,GACjE5B,EAAU,IAAII,CAAQ,EACtBwB,GAAkB,QAAQ,iBAAiB,YAAe5B,EAAU,OAAOI,CAAQ,EAAG,CAAE,KAAM,EAAK,CAAC,MACvFJ,EAAU,OAAOI,CAAQ,EACxC,EACA,SAAS,EAAO,CACd,OAAO,MAAM,OAAO,EAAGrD,CAAK,CAC9B,EACA,QAAQ,EAAO,CACb,OAAO,MAAM,QAAQ,EAAGA,CAAK,CAC/B,EACA,IAAI,UAAW,CACb,OAAOuC,CACT,EACA,IAAI,aAAc,CAChB,IAAMP,EAAK,QAAQ,EAQnB,OAAO,eAAe,CANpB,MAAMA,EAAI,CAAE,EAAG,EAAG,EAAG,CAAE,CAAC,EACxB,MAAMA,EAAI,CAAE,EAAGO,EAAS,MAAO,EAAG,CAAE,CAAC,EACrC,MAAMP,EAAI,CAAE,EAAG,EAAG,EAAGO,EAAS,MAAO,CAAC,EACtC,MAAMP,EAAI,CAAE,EAAGO,EAAS,MAAO,EAAGA,EAAS,MAAO,CAAC,CAG/B,CAAO,CAC/B,EACA,OAAO,EAAa,EAAQ,CAC1B,GAAI,CAAC,OAAO,SAASuC,CAAM,GAAKA,GAAU,EACxC,MAAM,IAAI,iBAAiB,4DAA4DA,GAAQ,EAEjG,GAAI/B,EAAU,OACd,KAAK,EACL,IAAM6B,EAAQ,MAAM,QAAQ,EAAGxB,CAAW,EACpCjB,EAAO,KAAK,IAAIO,EAAS,KAAK,IAAIF,EAASK,EAAM,KAAOiC,CAAM,CAAC,EAE/DN,EAAS,mBAAmB,iBAAiBpB,CAAW,EAAGjB,EAAMU,EAAM,QAAQ,EACrF,IAAI,CAAE,EAAG+B,EAAM,EAAIJ,EAAO,EAAG,EAAGI,EAAM,EAAIJ,EAAO,EAAG,MAAK,CAAC,CAC5D,CACF,CACF,CC7WA,SAAgB,eAAe,EAA2B,EAAuB,CAC/E,IAAIO,EAAS,GACPC,EAAIC,EAAQ,OAClB,IAAK,IAAI,EAAI,EAAGC,EAAIF,EAAI,EAAG,EAAIA,EAAG,EAAI,IAAK,CACzC,IAAMnF,EAAIoF,EAAQ,GACZnF,EAAImF,EAAQC,GAElB,GADgBrF,EAAE,EAAIG,EAAM,GAAMF,EAAE,EAAIE,EAAM,EAChC,SACd,IAAMmF,GAASrF,EAAE,EAAID,EAAE,IAAMG,EAAM,EAAIH,EAAE,IAAOC,EAAE,EAAID,EAAE,GAAKA,EAAE,EAC3DG,EAAM,EAAImF,IAAM,EAAS,CAACJ,EAChC,CACA,OAAOA,CACT,CAEA,SAAS,kBAAkB,EAAc,EAAU,EAAkB,CACnE,IAAMN,EAAK3E,EAAE,EAAID,EAAE,EACb6E,EAAK5E,EAAE,EAAID,EAAE,EACbuF,EAAWX,EAAKA,EAAKC,EAAKA,EAChC,GAAIU,IAAa,EAAG,OAAO,KAAK,MAAMpF,EAAM,EAAIH,EAAE,EAAGG,EAAM,EAAIH,EAAE,CAAC,EAClE,IAAIiC,IAAM9B,EAAM,EAAIH,EAAE,GAAK4E,GAAMzE,EAAM,EAAIH,EAAE,GAAK6E,GAAMU,EAExD,MADA,GAAI,KAAK,IAAI,EAAG,KAAK,IAAI,EAAGtD,CAAC,CAAC,EACvB,KAAK,MAAM9B,EAAM,GAAKH,EAAE,EAAIiC,EAAI2C,GAAKzE,EAAM,GAAKH,EAAE,EAAIiC,EAAI4C,EAAG,CACtE,CAOA,SAAgB,mBAAmB,EAAwB,EAAsB,CAC/E,GAAIW,EAAK,SAAW,EAAG,MAAO,KAC9B,GAAIA,EAAK,SAAW,EAAG,OAAO,KAAK,MAAMrF,EAAM,EAAIqF,EAAK,EAAE,CAAC,EAAGrF,EAAM,EAAIqF,EAAK,EAAE,CAAC,CAAC,EACjF,IAAIC,EAAO,IACX,IAAK,IAAIC,EAAI,EAAGL,EAAI,EAAGA,EAAIG,EAAK,OAAQ,EAAI,IAAK,CAC/C,IAAMG,EAAI,kBAAkBxF,EAAOqF,EAAKE,GAAIF,EAAKH,EAAE,EAC/CM,EAAIF,IAAM,EAAOE,EACvB,CACA,OAAOF,CACT,CAMA,SAAgB,iBAAiB,EAA2B,EAAc,EAA4B,CACpG,GAAI,EAAEG,GAAa,GACjB,MAAM,IAAI,iBAAiB,4DAA4D,OAAOA,CAAS,EAAE,EAAE,EAI7G,OADI,mBADWR,EAAQ,OAAS,EAAI,CAAC,GAAGA,EAASA,EAAQ,EAAE,EAAIA,EAChCjF,CAAK,GAAKyF,GAClC,eAAeR,EAASjF,CAAK,CACtC,CCXA,SAAS,SAAS,EAAsB,CACtC,MAAO,CAACiB,EAAK,EAAGA,EAAK,EAAIA,EAAK,MAAQ,EAAG,UAAUA,CAAI,CAAC,CAC1D,CAEA,SAAS,SAAS,EAAsB,CACtC,MAAO,CAACA,EAAK,EAAGA,EAAK,EAAIA,EAAK,OAAS,EAAG,WAAWA,CAAI,CAAC,CAC5D,CAeA,SAAS,aAAa,EAA4B,EAA4B,EAAoC,CAChH,IAAIqE,EAAwB,KAC5B,IAAK,IAAM9E,KAAUkF,EACnB,IAAK,IAAM9B,KAAU+B,EAAS,CAC5B,IAAMvD,EAAQwB,EAAO,MAAQpD,EACzB,KAAK,IAAI4B,CAAK,EAAIwD,IAClBN,IAAS,MAAQ,KAAK,IAAIlD,CAAK,EAAI,KAAK,IAAIkD,EAAK,KAAK,KACxD,EAAO,CAAE,QAAO,KAAM1B,EAAO,KAAM,SAAUA,EAAO,KAAM,EAE9D,CAEF,OAAO0B,CACT,CAEA,SAAS,YAAY,EAAa,EAAa,EAA6B,EAA6B,CACvG,GAAIO,IAAY,IAAA,IAAa,CAAC,OAAO,SAASA,CAAO,GAAKA,GAAW,EAAG,MAAO,CAAC,EAChF,IAAMF,EAAoB,CAAC,EAC3B,IAAK,IAAIG,EAAO,KAAK,OAAOC,EAAMH,GAAaC,CAAO,EAAIA,EAASC,GAAQE,EAAMJ,EAAW,GAAQC,EAClGF,EAAQ,KAAK,CAAE,KAAM,OAAQ,MAAOG,CAAK,CAAC,EAE5C,OAAOH,CACT,CAEA,SAAS,QACP,EACA,EACA,EACA,EAC8B,CAC9B,IAAMM,EAAmB,CAAC,EAC1B,IAAK,IAAM3C,KAAa4C,GACNC,IAAS,IAAM,SAAS7C,CAAS,EAAI,SAASA,CAAS,EAAA,CAC3D,KAAM,GAAW9C,IAAW4F,CAAQ,GAAGH,EAAS,KAAK3C,CAAS,EAM5E,IAAMiB,EAAS,eAJS,CAAC8B,EAAO,GAAGJ,CAAQ,CAAC,CAAC,QAAS,GAAS,CAC7D,CAAE,EAAGhF,EAAK,EAAG,EAAGA,EAAK,CAAE,EACvB,CAAE,EAAG,UAAUA,CAAI,EAAG,EAAG,WAAWA,CAAI,CAAE,CAC5C,CAC8B,CAAM,GAAK,CAAE,OAAQ,EAAG,MAAO,EAAG,EAAGmF,EAAU,EAAGA,CAAS,EACzF,OAAOD,IAAS,IAAM,CAAE,KAAM5B,EAAO,EAAG,GAAI,WAAWA,CAAM,CAAE,EAAI,CAAE,KAAMA,EAAO,EAAG,GAAI,UAAUA,CAAM,CAAE,CAC7G,CAGA,SAAS,sBAAsB,EAAS,EAAS,EAA0B,CACzE,OAAO4B,IAAS,IAAMtG,EAAE,EAAI,WAAWC,CAAC,GAAKA,EAAE,EAAI,WAAWD,CAAC,EAAIA,EAAE,EAAI,UAAUC,CAAC,GAAKA,EAAE,EAAI,UAAUD,CAAC,CAC5G,CAQA,SAAS,gBACP,EACA,EACA,EACA,EAC+G,CAC/G,IAAMgE,EAAQsC,IAAS,IAAO,GAAYG,EAAE,EAAK,GAAYA,EAAE,EACzDC,EAAMJ,IAAS,IAAO,GAAY,UAAUG,CAAC,EAAK,GAAY,WAAWA,CAAC,EAC5EE,EAAU,KACVC,EAAa,IACjB,IAAK,IAAMnD,KAAa4C,EACjB,sBAAsBjF,EAAMqC,EAAW6C,CAAI,IAC5CI,EAAIjD,CAAS,GAAKO,EAAM5C,CAAI,GAAKsF,EAAIjD,CAAS,EAAIkD,IAAS,EAAUD,EAAIjD,CAAS,GAClFO,EAAMP,CAAS,GAAKiD,EAAItF,CAAI,GAAK4C,EAAMP,CAAS,EAAImD,IAAY,EAAa5C,EAAMP,CAAS,IAElG,GAAIkD,IAAY,MAAaC,IAAe,IAAU,OAAO,KAC7D,IAAMC,EAAOD,EAAaD,GAAWL,IAAS,IAAMlF,EAAK,MAAQA,EAAK,QACtE,GAAIyF,EAAO,EAAG,OAAO,KAErB,IAAMtE,EADQoE,EAAUE,EAAO,EACT7C,EAAM5C,CAAI,EAChC,GAAI,KAAK,IAAImB,CAAK,EAAIwD,EAAW,OAAO,KACxC,IAAMe,EAAMD,EAAO,EACnB,MAAO,CACL,QACA,MAAO,CAACF,EAAUG,EAAM,EAAGF,EAAaE,EAAM,CAAC,EAG/C,SAAUR,IAAS,IAAM,WAAWlF,CAAI,CAAC,CAAC,EAAI,WAAWA,CAAI,CAAC,CAAC,EAC/D,KAAM,CAACuF,EAASC,CAAU,CAC5B,CACF,CASA,SAAgB,SAAS,EAAY,EAAkC,CACrE,GAAM,CAAE,aAAY,OAAM,UAAS,aAAchE,EACjD,GAAI,EAAEmD,GAAa,GACjB,MAAM,IAAI,iBAAiB,4DAA4D,OAAOA,CAAS,EAAE,EAAE,EAE7G,IAAIgB,EAAS3F,EAAK,EACd4F,EAAS5F,EAAK,EACZmB,EAAQ,CAAE,EAAG,EAAG,EAAG,CAAE,EAErB0E,EAAqBZ,EAAW,QAAS,GAC7C,SAAS5C,CAAS,CAAC,CAAC,IAAK,IAAmB,CAAE,KAAM,SAAU,OAAM,EAAE,CACxE,EACAwD,EAAS,KAAK,GAAG,YAAY7F,EAAK,EAAG,UAAUA,CAAI,EAAG8F,GAAM,EAAGnB,CAAS,CAAC,EACzE,IAAMoB,EAAQ,aAAa,SAAS/F,CAAI,EAAG6F,EAAUlB,CAAS,EAC1DoB,IAAU,OACZ,EAAM,EAAIA,EAAM,MAChB,GAAUA,EAAM,OAGlB,IAAMC,EAAqBf,EAAW,QAAS,GAC7C,SAAS5C,CAAS,CAAC,CAAC,IAAK,IAAmB,CAAE,KAAM,SAAU,OAAM,EAAE,CACxE,EACA2D,EAAS,KAAK,GAAG,YAAYhG,EAAK,EAAG,WAAWA,CAAI,EAAG8F,GAAM,EAAGnB,CAAS,CAAC,EAC1E,IAAMsB,EAAQ,aAAa,SAASjG,CAAI,EAAGgG,EAAUrB,CAAS,EAC1DsB,IAAU,OACZ,EAAM,EAAIA,EAAM,MAChB,GAAUA,EAAM,OAIlB,IAAMC,EAAkB,CAAE,GAAGlG,EAAM,EAAG2F,EAAQ,EAAGC,CAAO,EAClDO,EAAsB,CAAC,EAC7B,GAAIJ,IAAU,KAAM,CAClB,IAAMK,EAAO,QAAQL,EAAM,SAAUG,EAAWjB,EAAY,GAAG,EAC/DkB,EAAO,KAAK,CAAE,KAAM,IAAK,KAAMC,EAAK,KAAM,KAAML,EAAM,KAAM,SAAUA,EAAM,SAAU,GAAIK,EAAK,EAAG,CAAC,CACrG,CACA,GAAIH,IAAU,KAAM,CAClB,IAAMG,EAAO,QAAQH,EAAM,SAAUC,EAAWjB,EAAY,GAAG,EAC/DkB,EAAO,KAAK,CAAE,KAAM,IAAK,KAAMC,EAAK,KAAM,KAAMH,EAAM,KAAM,SAAUA,EAAM,SAAU,GAAIG,EAAK,EAAG,CAAC,CACrG,CAKA,GAAIxB,EAAS,CACX,GAAImB,IAAU,KAAM,CAClB,IAAML,EAAM,gBAAgBQ,EAAWjB,EAAY,IAAKN,CAAS,EAC7De,IAAQ,OACV,EAAM,EAAIA,EAAI,MACdS,EAAO,KAAK,CACV,KAAM,IACN,KAAMT,EAAI,KAAK,GACf,KAAM,UACN,MAAOA,EAAI,MACX,SAAUA,EAAI,SACd,GAAIA,EAAI,KAAK,EACf,CAAC,EAEL,CACA,GAAIO,IAAU,KAAM,CAClB,IAAMP,EAAM,gBAAgBQ,EAAWjB,EAAY,IAAKN,CAAS,EAC7De,IAAQ,OACV,EAAM,EAAIA,EAAI,MACdS,EAAO,KAAK,CACV,KAAM,IACN,KAAMT,EAAI,KAAK,GACf,KAAM,UACN,MAAOA,EAAI,MACX,SAAUA,EAAI,SACd,GAAIA,EAAI,KAAK,EACf,CAAC,EAEL,CACF,CACA,MAAO,CAAE,QAAO,QAAO,CACzB,CASA,SAAgB,WAAW,EAAwB,EAAyB,CAC1E,GAAIW,EAAM,SAAW,EAAG,MAAO,CAAC,EAChC,IAAM/C,EAAS,eACb+C,EAAM,QAAS,GAAS,CACtB,CAAE,EAAGrG,EAAK,EAAG,EAAGA,EAAK,CAAE,EACvB,CAAE,EAAG,UAAUA,CAAI,EAAG,EAAG,WAAWA,CAAI,CAAE,CAC5C,CAAC,CACH,EAEA,OADIsD,IAAW,KAAa,CAAC,EACtB+C,EAAM,IAAK,GAAS,CACzB,OAAQC,EAAR,CACE,IAAK,OACH,MAAO,CAAE,GAAGtG,EAAM,EAAGsD,EAAO,CAAE,EAChC,IAAK,oBACH,MAAO,CAAE,GAAGtD,EAAM,EAAG,WAAWsD,CAAM,CAAC,CAAC,EAAItD,EAAK,MAAQ,CAAE,EAC7D,IAAK,QACH,MAAO,CAAE,GAAGA,EAAM,EAAG,UAAUsD,CAAM,EAAItD,EAAK,KAAM,EACtD,IAAK,MACH,MAAO,CAAE,GAAGA,EAAM,EAAGsD,EAAO,CAAE,EAChC,IAAK,kBACH,MAAO,CAAE,GAAGtD,EAAM,EAAG,WAAWsD,CAAM,CAAC,CAAC,EAAItD,EAAK,OAAS,CAAE,EAC9D,IAAK,SACH,MAAO,CAAE,GAAGA,EAAM,EAAG,WAAWsD,CAAM,EAAItD,EAAK,MAAO,EACxD,QACE,MAAM,IAAI,iBAAiB,uBAAuB,OAAOsG,CAAI,EAAE,EAAE,CACrE,CACF,CAAC,CACH,CAOA,SAAgB,gBAAgB,EAAwB,EAAyB,CAC/E,GAAID,EAAM,QAAU,EAAG,OAAOA,EAAM,IAAK,IAAU,CAAE,GAAGrG,CAAK,EAAE,EAC/D,IAAM4C,EAAQsC,IAAS,IAAO,GAAelF,EAAK,EAAK,GAAeA,EAAK,EACrE0D,EAAOwB,IAAS,IAAO,GAAelF,EAAK,MAAS,GAAeA,EAAK,OACxEuG,EAAQF,EACX,KAAK,EAAM,KAAW,CAAE,QAAO,MAAK,EAAE,CAAC,CACvC,MAAM,EAAG,IAAMzD,EAAMhE,EAAE,IAAI,EAAIgE,EAAM/D,EAAE,IAAI,GAAKD,EAAE,MAAQC,EAAE,KAAK,EAC9D2H,EAAQD,EAAM,EAAE,CAAC,KACjBE,EAAOF,EAAMA,EAAM,OAAS,EAAE,CAAC,KAG/Bb,GAFY9C,EAAM6D,CAAI,EAAI/C,EAAK+C,CAAI,EAAI7D,EAAM4D,CAAK,EACtCD,EAAM,QAAQ,EAAK,IAAUG,EAAMhD,EAAKiD,EAAM,IAAI,EAAG,CAC9C,IAAcJ,EAAM,OAAS,GAChDK,EAASP,EAAM,IAAK,IAAU,CAAE,GAAGrG,CAAK,EAAE,EAC5C6G,EAASjE,EAAM4D,CAAK,EACxB,IAAK,IAAMG,KAASJ,EAAO,CACzB,IAAMnB,EAAQ,CAAE,GAAGuB,EAAM,IAAK,EAC1BzB,IAAS,IAAK,EAAM,EAAI2B,EACvB,EAAM,EAAIA,EACf,EAAOF,EAAM,OAASvB,EACtB,GAAU1B,EAAKiD,EAAM,IAAI,EAAIjB,CAC/B,CACA,OAAOkB,CACT,CChQA,SAAS,OAAU,EAAoC,CACrD,OAAOE,EAAK,IACd,CAEA,SAAS,WAAW,EAAS,EAAe,CAC1C,IAAM7G,EAAI,KAAK,IAAIrB,EAAE,EAAGC,EAAE,CAAC,EACrBqB,EAAI,KAAK,IAAItB,EAAE,EAAGC,EAAE,CAAC,EAC3B,MAAO,CACL,OAAQ,KAAK,IAAID,EAAE,EAAIA,EAAE,OAAQC,EAAE,EAAIA,EAAE,MAAM,EAAIqB,EACnD,MAAO,KAAK,IAAItB,EAAE,EAAIA,EAAE,MAAOC,EAAE,EAAIA,EAAE,KAAK,EAAIoB,EAChD,IACA,GACF,CACF,CAEA,SAAS,KAAK,EAAoB,CAChC,OAAOD,EAAK,MAAQA,EAAK,MAC3B,CAEA,SAAS,WAAW,EAAS,EAAkB,CAC7C,OAAOpB,EAAE,IAAMC,EAAE,GAAKD,EAAE,IAAMC,EAAE,GAAKD,EAAE,QAAUC,EAAE,OAASD,EAAE,SAAWC,EAAE,MAC7E,CAEA,SAAS,UAAa,EAAqB,CACzC,IAAImB,EAAoB,KACxB,IAAK,IAAM+G,KAASD,EAAK,SACvB,EAAO9G,IAAS,KAAO,CAAE,GAAG,OAAO+G,CAAK,CAAE,EAAI,WAAW/G,EAAM,OAAO+G,CAAK,CAAC,EAE9E,EAAK,KAAO/G,CACd,CAQA,SAAgB,mBAA+B,EAA+B,CAAC,EAAoB,CACjG,IAAMgH,EAAaxF,EAAQ,mBAAqB,EAChD,GAAI,CAAC,OAAO,UAAUwF,CAAU,GAAKA,EAAa,EAChD,MAAM,IAAI,iBAAiB,uDAAuDA,GAAY,EAEhG,IAAMC,EAAa,KAAK,IAAI,EAAG,KAAK,KAAKD,EAAa,CAAC,CAAC,EAClDE,EAAU,IAAI,IAChBC,EAAgB,CAAE,SAAU,CAAC,EAAG,KAAM,GAAM,KAAM,IAAK,EAErD,WAAa,EAAiB,IAAwB,CAC1D,IAAI9C,EAAuB,KACvB+C,EAAkB,IAClBC,EAAW,IACf,IAAK,IAAMN,KAASD,EAAK,SAAU,CACjC,IAAMQ,EAAUP,EAAM,MAAQ/G,EACxBuH,EAAc,KAAK,WAAWD,EAAStH,CAAI,CAAC,EAAI,KAAKsH,CAAO,GAC9DC,EAAcH,GAAoBG,IAAgBH,GAAmB,KAAKE,CAAO,EAAID,KACvF,EAAON,EACP,EAAkBQ,EAClB,EAAW,KAAKD,CAAO,EAE3B,CACA,OAAOjD,CACT,EAEM,MAAS,GAAsC,CACnD,IAAMmD,EAAQV,EAAK,SAEfW,EAAK,EACLC,EAAK,EACLC,EAAQ,KACZ,IAAK,IAAIrD,EAAI,EAAGA,EAAIkD,EAAM,OAAQ,IAChC,IAAK,IAAIvD,EAAIK,EAAI,EAAGL,EAAIuD,EAAM,OAAQ,IAAK,CACzC,IAAMI,EACJ,KAAK,WAAW,OAAOJ,EAAMlD,EAAE,EAAG,OAAOkD,EAAMvD,EAAE,CAAC,CAAC,EAAI,KAAK,OAAOuD,EAAMlD,EAAE,CAAC,EAAI,KAAK,OAAOkD,EAAMvD,EAAE,CAAC,EACnG2D,EAAQD,IACV,EAAQC,EACR,EAAKtD,EACL,EAAKL,EAET,CAEF,IAAM4D,EAAwC,CAACL,EAAMC,EAAG,EAClDK,EAAwC,CAACN,EAAME,EAAG,EACpDK,EAAQ,OAAOP,EAAMC,EAAG,EACxBO,EAAQ,OAAOR,EAAME,EAAG,EACtBO,EAAYT,EAAM,QAAQ,EAAG,IAAUU,IAAUT,GAAMS,IAAUR,CAAE,EACzE,IAAK,GAAM,CAACQ,EAAOC,KAASF,EAAU,QAAQ,EAAG,CAE/C,IAAMG,EACJP,EAAO,QAAUI,EAAU,OAASC,GAASlB,GAC7Cc,EAAO,QAAUG,EAAU,OAASC,GAAS,EAAIjB,EAC7CoB,EACJP,EAAO,QAAUG,EAAU,OAASC,GAASlB,GAC7Ca,EAAO,QAAUI,EAAU,OAASC,GAAS,EAAIjB,EAC/CqB,EACJ,GAAIF,EAAO,EAAM,QACZ,GAAIC,EAAO,EAAM,OACjB,CACH,IAAME,EAAW,KAAK,WAAWR,EAAO,OAAOI,CAAI,CAAC,CAAC,EAAI,KAAKJ,CAAK,EAC7DS,EAAW,KAAK,WAAWR,EAAO,OAAOG,CAAI,CAAC,CAAC,EAAI,KAAKH,CAAK,EACnE,EAAMO,EAAWC,GAAaD,IAAaC,GAAY,KAAKT,CAAK,GAAK,KAAKC,CAAK,CAClF,CACIM,GACFT,EAAO,KAAKM,CAAI,EAChB,EAAQ,WAAWJ,EAAO,OAAOI,CAAI,CAAC,IAEtCL,EAAO,KAAKK,CAAI,EAChB,EAAQ,WAAWH,EAAO,OAAOG,CAAI,CAAC,EAE1C,CACA,IAAMvJ,EACJkI,EAAK,KACD,CAAE,SAAUe,EAA0B,KAAM,GAAM,KAAM,IAAK,EAC7D,CAAE,SAAUA,EAAqB,KAAM,GAAO,KAAM,IAAK,EAEzDhJ,EACJiI,EAAK,KACD,CAAE,SAAUgB,EAA0B,KAAM,GAAM,KAAM,IAAK,EAC7D,CAAE,SAAUA,EAAqB,KAAM,GAAO,KAAM,IAAK,EAI/D,OAFA,UAAUlJ,CAAC,EACX,UAAUC,CAAC,EACJ,CAACD,EAAGC,CAAC,CACd,EAGM,YAAc,EAAe,IAA4D,CAC7F,GAAIiI,EAAK,KAIP,OAHAA,EAAK,SAAS,KAAKqB,CAAoB,EACvC,EAAK,KAAOrB,EAAK,OAAS,KAAO,CAAE,GAAG,OAAOqB,CAAI,CAAE,EAAI,WAAWrB,EAAK,KAAM,OAAOqB,CAAI,CAAC,EACrFrB,EAAK,SAAS,OAASE,EAAmB,MAAMF,CAAI,EACjD,KAET,IAAM2B,EAAS3B,EACTC,EAAQ,UAAU0B,EAAQ,OAAON,CAAI,CAAC,EACtCO,EAAW,WAAW3B,EAAOoB,CAAI,EAEvC,GADA,UAAUrB,CAAI,EACV4B,EAAU,CACZ,IAAMR,EAAQO,EAAO,SAAS,QAAQ1B,CAAK,EAC3C0B,EAAO,SAAS,OAAOP,EAAO,EAAGQ,EAAS,GAAIA,EAAS,EAAE,EACzD,UAAU5B,CAAI,CAChB,CAEA,OADIA,EAAK,SAAS,OAASE,EAAmB,MAAMF,CAAI,EACjD,IACT,EAEM,YAAe,GAA8B,CAE7C,CAACK,EAAK,MAAQA,EAAK,SAAS,SAAW,IACzC,EAAO,CAAE,SAAU,CAAC,EAAG,KAAM,GAAM,KAAM,IAAK,GAEhD,IAAMuB,EAAW,WAAWvB,EAAMR,CAAK,EACnC+B,IACF,EAAO,CAAE,SAAUA,EAAU,KAAM,GAAO,KAAM,IAAK,EACrD,UAAUvB,CAAI,EAElB,EAGM,YAAc,EAAe,IAAiC,CAClE,GAAIL,EAAK,KAAM,CACb,IAAMoB,EAAQpB,EAAK,SAAS,QAAQH,CAAK,EAGzC,OAFIuB,IAAU,IAAIpB,EAAK,SAAS,OAAOoB,EAAO,CAAC,EAC/C,UAAUpB,CAAI,EACPA,EAAK,SAAS,SAAW,CAClC,CACA,IAAM2B,EAAS3B,EACf,IAAK,IAAIxC,EAAImE,EAAO,SAAS,OAAS,EAAGnE,GAAK,EAAG,IAAK,CACpD,IAAMyC,EAAQ0B,EAAO,SAASnE,GAI1ByC,EAAM,MAAQ,aAAaA,EAAM,KAAMJ,EAAM,IAAI,GAC/C,WAAWI,EAAOJ,CAAK,GAAG8B,EAAO,SAAS,OAAOnE,EAAG,CAAC,CAE7D,CAEA,OADA,UAAUwC,CAAI,EACP2B,EAAO,SAAS,SAAW,CACpC,EAEM,YAAe,GAAmB,CACtC,IAAM9B,EAAQO,EAAQ,IAAIyB,CAAE,EAC5B,GAAI,CAAChC,EAAO,MAAO,GAInB,IAHAO,EAAQ,OAAOyB,CAAE,EACjB,WAAWxB,EAAMR,CAAK,EAEf,CAACQ,EAAK,MAAQA,EAAK,SAAS,SAAW,GAC5C,EAAOA,EAAK,SAAS,GAEvB,MAAO,EACT,EAEM,WAAa,EAAe,EAA+B,IAAmB,CAClF,GAAKL,EAAK,MAAS8B,EAAK9B,EAAK,IAAI,EACjC,IAAIA,EAAK,KACP,IAAK,IAAMH,KAASG,EAAK,SACnB8B,EAAKjC,EAAM,IAAI,GAAGkC,EAAI,KAAKlC,EAAM,EAAE,OAI3C,IAAK,IAAMI,KAAUD,EAAmB,SAAU,UAAUC,EAAO6B,EAAMC,CAAG,CAD5E,CAEF,EAEA,MAAO,CACL,IAAI,QAAS,CACX,OAAO1B,EAAK,IACd,EACA,OAAQ,CACND,EAAQ,MAAM,EACd,EAAO,CAAE,SAAU,CAAC,EAAG,KAAM,GAAM,KAAM,IAAK,CAChD,EACA,OAAQ,YACR,IAAI,EAAI,CACN,OAAOA,EAAQ,IAAIyB,CAAE,CAAC,EAAE,IAC1B,EACA,IAAI,EAAI,CACN,OAAOzB,EAAQ,IAAIyB,CAAE,CACvB,EACA,WAAW,EAAO,EAAc,CAC9B,IAAMnE,EAAYsE,GAAc,WAAa,EAC7C,GAAI,EAAEtE,GAAa,GACjB,MAAM,IAAI,iBAAiB,4DAA4DA,GAAW,EAIpG,IAAMuE,EAAY,YAAY,CAAE,GAAGhK,EAAO,OAAQ,EAAG,MAAO,CAAE,EAAGyF,CAAS,EACpEqE,EAAW,CAAC,EAElB,OADA,UAAU1B,EAAO,GAAS,eAAenH,EAAM+I,CAAG,EAAGF,CAAG,EACjDA,CACT,EACA,UAAU,EAAM,CACd,IAAMA,EAAW,CAAC,EAElB,OADA,UAAU1B,EAAO,GAAc,eAAe9E,EAAWrC,CAAI,EAAG6I,CAAG,EAC5DA,CACT,EACA,IAAI,EAAI,EAAM,CACZ,IAAMG,EAAW9B,EAAQ,IAAIyB,CAAE,EAC/B,GAAIK,EAAU,CACZ,GAAI,WAAWA,EAAS,KAAMhJ,CAAI,EAAG,OACrC,YAAY2I,CAAE,CAChB,CACA,IAAMhC,EAAsB,CAAE,KAAI,KAAM,CAAE,GAAG3G,CAAK,CAAE,EACpDkH,EAAQ,IAAIyB,EAAIhC,CAAK,EACrB,YAAYA,CAAK,CACnB,EACA,IAAI,MAAO,CACT,OAAOO,EAAQ,IACjB,CACF,CACF,C"}
@@ -0,0 +1,2 @@
1
+ var Atlas=(function(e){Object.defineProperty(e,Symbol.toStringTag,{value:`Module`});var AtlasError=class extends Error{constructor(e,t){super(e,t),this.name=new.target.name,Object.setPrototypeOf(this,new.target.prototype)}},AtlasConfigError=class extends AtlasError{},t=Object.freeze([1,0,0,1,0,0]);function multiply(e,t){return[e[0]*t[0]+e[2]*t[1],e[1]*t[0]+e[3]*t[1],e[0]*t[2]+e[2]*t[3],e[1]*t[2]+e[3]*t[3],e[0]*t[4]+e[2]*t[5]+e[4],e[1]*t[4]+e[3]*t[5]+e[5]]}function apply(e,t){return{x:e[0]*t.x+e[2]*t.y+e[4],y:e[1]*t.x+e[3]*t.y+e[5]}}function translate(e,t){return[1,0,0,1,e,t]}function scale(e,t=e){return[e,0,0,t,0,0]}function rotate(e){let t=Math.cos(e),n=Math.sin(e);return[t,n,-n,t,0,0]}function around(e,t){return multiply(multiply(translate(e.x,e.y),t),translate(-e.x,-e.y))}function scaleOf(e){return(Math.hypot(e[0],e[1])+Math.hypot(e[2],e[3]))/2}function toCssMatrix(e){return`matrix(${e.join(`,`)})`}function invert(e){let t=e[0]*e[3]-e[2]*e[1];if(!Number.isFinite(t)||t===0)return null;let n=1/t;return[e[3]*n,-e[1]*n,-e[2]*n,e[0]*n,(e[2]*e[5]-e[3]*e[4])*n,(e[1]*e[4]-e[0]*e[5])*n]}function rectFromPoints(e){let t=1/0,n=1/0,r=-1/0,i=-1/0,a=!1;for(let o of e)a=!0,o.x<t&&(t=o.x),o.y<n&&(n=o.y),o.x>r&&(r=o.x),o.y>i&&(i=o.y);return a?{height:i-n,width:r-t,x:t,y:n}:null}function rectRight(e){return e.x+e.width}function rectBottom(e){return e.y+e.height}function rectCenter(e){return{x:e.x+e.width/2,y:e.y+e.height/2}}function unionRect(e,t){let n=Math.min(e.x,t.x),r=Math.min(e.y,t.y);return{height:Math.max(rectBottom(e),rectBottom(t))-r,width:Math.max(rectRight(e),rectRight(t))-n,x:n,y:r}}function intersectRect(e,t){let n=Math.max(e.x,t.x),r=Math.max(e.y,t.y),i=Math.min(rectRight(e),rectRight(t)),a=Math.min(rectBottom(e),rectBottom(t));return i<n||a<r?null:{height:a-r,width:i-n,x:n,y:r}}function containsRect(e,t){return e.x<=t.x&&e.y<=t.y&&rectRight(e)>=rectRight(t)&&rectBottom(e)>=rectBottom(t)}function containsPoint(e,t){return t.x>=e.x&&t.x<=rectRight(e)&&t.y>=e.y&&t.y<=rectBottom(e)}function inflateRect(e,t){return{height:e.height+t*2,width:e.width+t*2,x:e.x-t,y:e.y-t}}function rectsIntersect(e,t){return intersectRect(e,t)!==null}var n={cancelFrame:e=>cancelAnimationFrame(e),now:()=>performance.now(),requestFrame:e=>requestAnimationFrame(e)};function assertFinite(e,t){if(!Number.isFinite(t))throw new AtlasConfigError(`${e} must be a finite number, received ${t}`)}function easeInOut(e){return e<.5?2*e*e:1-(-2*e+2)**2/2}function normalizeAngle(e){return((e+Math.PI)%(2*Math.PI)+2*Math.PI)%(2*Math.PI)-Math.PI}function shortestAngle(e,t){return normalizeAngle(t-e)}function screenDeltaToWorld(e,t,n){return apply(multiply(rotate(-n),scale(1/t)),e)}function matrixOf(e,t){let n=multiply(multiply(scale(e.zoom),rotate(e.rotation)),translate(-e.x,-e.y));return multiply(translate(t.width/2,t.height/2),n)}function inverseOf(e,t){let n=multiply(rotate(-e.rotation),scale(1/e.zoom)),r=screenDeltaToWorld({x:t.width/2,y:t.height/2},e.zoom,e.rotation);return multiply(translate(e.x-r.x,e.y-r.y),n)}function createCamera(e={}){let t=e.minZoom??.01,r=e.maxZoom??1e3;if(!(t>0&&t<=r))throw new AtlasConfigError(`Zoom clamps must satisfy 0 < minZoom <= maxZoom, received ${t} and ${r}`);let i=e.scheduler??n,a=e.initial??{},o=e.viewport??{height:0,width:0},s={rotation:normalizeAngle(a.rotation??0),x:a.x??0,y:a.y??0,zoom:Math.min(r,Math.max(t,a.zoom??1))};for(let[e,t]of[[`camera.x`,s.x],[`camera.y`,s.y],[`camera.rotation`,s.rotation]])assertFinite(e,t);let c=new AbortController,l=!1,u=null,d=new Set,f=null,p=null,matrix=()=>(f??=matrixOf(s,o),f),inverse=()=>(p??=inverseOf(s,o),p),invalidate=()=>{f=null,p=null},relativeToCentre=e=>({x:e.x-o.width/2,y:e.y-o.height/2}),emit=()=>{for(let e of[...d])e(s)},set=e=>{if(l)return;let n={rotation:normalizeAngle(e.rotation??s.rotation),x:e.x??s.x,y:e.y??s.y,zoom:Math.min(r,Math.max(t,e.zoom??s.zoom))};(n.x!==s.x||n.y!==s.y||n.zoom!==s.zoom||n.rotation!==s.rotation)&&(s=n,invalidate(),emit())},stop=()=>{u&&=(i.cancelFrame(u.frame),u.cleanup(),null)},dispose=()=>{l||(l=!0,stop(),d.clear(),c.abort())},animateTo=(e,n={})=>{if(stop(),l)return;let a=n.duration??250,o=n.easing??easeInOut,c=n.signal;if(c?.aborted)return;if(a<=0){set(e);return}let d=s,f={rotation:d.rotation+shortestAngle(d.rotation,e.rotation??s.rotation),x:e.x??s.x,y:e.y??s.y,zoom:Math.min(r,Math.max(t,e.zoom??s.zoom))},p=i.now(),m=Math.log(d.zoom),h=Math.log(f.zoom),g={cleanup:()=>{},frame:0};u=g;let abort=()=>{u===g&&stop()};c&&(c.addEventListener(`abort`,abort,{once:!0}),g.cleanup=()=>c.removeEventListener(`abort`,abort));let step=e=>{if(u!==g)return;let t=Math.min(1,(e-p)/a),n=o(t);set({rotation:d.rotation+(f.rotation-d.rotation)*n,x:d.x+(f.x-d.x)*n,y:d.y+(f.y-d.y)*n,zoom:Math.exp(m+(h-m)*n)}),t>=1?(u=null,g.cleanup()):g.frame=i.requestFrame(step)};g.frame=i.requestFrame(step)};return{animateTo,get disposalSignal(){return c.signal},dispose,get disposed(){return l},fitBounds(e,n={}){if(l)return;stop();let i=n.padding??0,a=Math.max(1,o.width-i*2),s=Math.max(1,o.height-i*2),c=Math.min(r,Math.max(t,Math.min(e.width===0?r:a/e.width,e.height===0?r:s/e.height)));set({x:e.x+e.width/2,y:e.y+e.height/2,zoom:c})},get inverse(){return inverse()},get matrix(){return matrix()},panBy(e,t){if(l)return;stop();let n=screenDeltaToWorld({x:e,y:t},s.zoom,s.rotation);set({x:s.x-n.x,y:s.y-n.y})},resize(e){l||(e.width!==o.width||e.height!==o.height)&&(o={height:e.height,width:e.width},invalidate(),emit())},rotateAt(e,t){if(l)return;stop();let n=apply(inverse(),e),r=s.rotation+t,i=screenDeltaToWorld(relativeToCentre(e),s.zoom,r);set({rotation:r,x:n.x-i.x,y:n.y-i.y})},set(e){stop(),set(e)},[Symbol.dispose]:dispose,get state(){return s},stop,subscribe(e,t){return l||t?.signal?.aborted?()=>{}:(d.add(e),t?.signal?.addEventListener(`abort`,()=>d.delete(e),{once:!0}),()=>d.delete(e))},toScreen(e){return apply(matrix(),e)},toWorld(e){return apply(inverse(),e)},get viewport(){return o},get visibleRect(){let e=inverse();return rectFromPoints([apply(e,{x:0,y:0}),apply(e,{x:o.width,y:0}),apply(e,{x:0,y:o.height}),apply(e,{x:o.width,y:o.height})])},zoomAt(e,n){if(!Number.isFinite(n)||n<=0)throw new AtlasConfigError(`zoomAt factor must be a positive finite number, received ${n}`);if(l)return;stop();let i=apply(inverse(),e),a=Math.min(r,Math.max(t,s.zoom*n)),o=screenDeltaToWorld(relativeToCentre(e),a,s.rotation);set({x:i.x-o.x,y:i.y-o.y,zoom:a})}}}function pointInPolygon(e,t){let n=!1,r=e.length;for(let i=0,a=r-1;i<r;a=i++){let r=e[i],o=e[a];if(r.y>t.y==o.y>t.y)continue;let s=(o.x-r.x)*(t.y-r.y)/(o.y-r.y)+r.x;t.x<s&&(n=!n)}return n}function distanceToSegment(e,t,n){let r=n.x-t.x,i=n.y-t.y,a=r*r+i*i;if(a===0)return Math.hypot(e.x-t.x,e.y-t.y);let o=((e.x-t.x)*r+(e.y-t.y)*i)/a;return o=Math.max(0,Math.min(1,o)),Math.hypot(e.x-(t.x+o*r),e.y-(t.y+o*i))}function distanceToPolyline(e,t){if(e.length===0)return 1/0;if(e.length===1)return Math.hypot(t.x-e[0].x,t.y-e[0].y);let n=1/0;for(let r=0,i=1;i<e.length;r=i++){let a=distanceToSegment(t,e[r],e[i]);a<n&&(n=a)}return n}function pointNearPolygon(e,t,n){if(!(n>=0))throw new AtlasConfigError(`tolerance must be a non-negative finite number; received ${String(n)}.`);return distanceToPolyline(e.length>0?[...e,e[0]]:e,t)<=n||pointInPolygon(e,t)}function xAnchors(e){return[e.x,e.x+e.width/2,rectRight(e)]}function yAnchors(e){return[e.y,e.y+e.height/2,rectBottom(e)]}function bestAxisSnap(e,t,n){let r=null;for(let i of e)for(let e of t){let t=e.value-i;Math.abs(t)>n||(r===null||Math.abs(t)<Math.abs(r.delta))&&(r={delta:t,kind:e.kind,position:e.value})}return r}function gridTargets(e,t,n,r){if(n===void 0||!Number.isFinite(n)||n<=0)return[];let i=[];for(let a=Math.floor((e-r)/n)*n;a<=t+r;a+=n)i.push({kind:`grid`,value:a});return i}function spanFor(e,t,n,r){let i=[];for(let t of n)(r===`x`?xAnchors(t):yAnchors(t)).some(t=>t===e)&&i.push(t);let a=rectFromPoints([t,...i].flatMap(e=>[{x:e.x,y:e.y},{x:rectRight(e),y:rectBottom(e)}]))??{height:0,width:0,x:e,y:e};return r===`x`?{from:a.y,to:rectBottom(a)}:{from:a.x,to:rectRight(a)}}function overlapsPerpendicular(e,t,n){return n===`x`?e.y<rectBottom(t)&&t.y<rectBottom(e):e.x<rectRight(t)&&t.x<rectRight(e)}function axisSpacingSnap(e,t,n,r){let i=n===`x`?e=>e.x:e=>e.y,a=n===`x`?e=>rectRight(e):e=>rectBottom(e),o=-1/0,s=1/0;for(let r of t)overlapsPerpendicular(e,r,n)&&(a(r)<=i(e)&&a(r)>o&&(o=a(r)),i(r)>=a(e)&&i(r)<s&&(s=i(r)));if(o===-1/0||s===1/0)return null;let c=s-o-(n===`x`?e.width:e.height);if(c<0)return null;let l=o+c/2-i(e);if(Math.abs(l)>r)return null;let u=c/2;return{delta:l,marks:[o+u/2,s-u/2],position:n===`x`?rectCenter(e).y:rectCenter(e).x,span:[o,s]}}function snapRect(e,t){let{candidates:n,grid:r,spacing:i,threshold:a}=t;if(!(a>=0))throw new AtlasConfigError(`threshold must be a non-negative finite number; received ${String(a)}.`);let o=e.x,s=e.y,c={x:0,y:0},l=n.flatMap(e=>xAnchors(e).map(e=>({kind:`object`,value:e})));l.push(...gridTargets(e.x,rectRight(e),r?.x,a));let u=bestAxisSnap(xAnchors(e),l,a);u!==null&&(c.x=u.delta,o+=u.delta);let d=n.flatMap(e=>yAnchors(e).map(e=>({kind:`object`,value:e})));d.push(...gridTargets(e.y,rectBottom(e),r?.y,a));let f=bestAxisSnap(yAnchors(e),d,a);f!==null&&(c.y=f.delta,s+=f.delta);let p={...e,x:o,y:s},m=[];if(u!==null){let e=spanFor(u.position,p,n,`x`);m.push({axis:`x`,from:e.from,kind:u.kind,position:u.position,to:e.to})}if(f!==null){let e=spanFor(f.position,p,n,`y`);m.push({axis:`y`,from:e.from,kind:f.kind,position:f.position,to:e.to})}if(i){if(u===null){let e=axisSpacingSnap(p,n,`x`,a);e!==null&&(c.x=e.delta,m.push({axis:`y`,from:e.span[0],kind:`spacing`,marks:e.marks,position:e.position,to:e.span[1]}))}if(f===null){let e=axisSpacingSnap(p,n,`y`,a);e!==null&&(c.y=e.delta,m.push({axis:`x`,from:e.span[0],kind:`spacing`,marks:e.marks,position:e.position,to:e.span[1]}))}}return{delta:c,guides:m}}function alignRects(e,t){if(e.length===0)return[];let n=rectFromPoints(e.flatMap(e=>[{x:e.x,y:e.y},{x:rectRight(e),y:rectBottom(e)}]));return n===null?[]:e.map(e=>{switch(t){case`left`:return{...e,x:n.x};case`horizontal-center`:return{...e,x:rectCenter(n).x-e.width/2};case`right`:return{...e,x:rectRight(n)-e.width};case`top`:return{...e,y:n.y};case`vertical-center`:return{...e,y:rectCenter(n).y-e.height/2};case`bottom`:return{...e,y:rectBottom(n)-e.height};default:throw new AtlasConfigError(`unknown align edge: ${String(t)}.`)}})}function distributeRects(e,t){if(e.length<=2)return e.map(e=>({...e}));let n=t===`x`?e=>e.x:e=>e.y,r=t===`x`?e=>e.width:e=>e.height,i=e.map((e,t)=>({index:t,rect:e})).sort((e,t)=>n(e.rect)-n(t.rect)||e.index-t.index),a=i[0].rect,o=i[i.length-1].rect,s=(n(o)+r(o)-n(a)-i.reduce((e,t)=>e+r(t.rect),0))/(i.length-1),c=e.map(e=>({...e})),l=n(a);for(let e of i){let n={...e.rect};t===`x`?n.x=l:n.y=l,c[e.index]=n,l+=r(e.rect)+s}return c}function rectOf(e){return e.rect}function unionRects(e,t){let n=Math.min(e.x,t.x),r=Math.min(e.y,t.y);return{height:Math.max(e.y+e.height,t.y+t.height)-r,width:Math.max(e.x+e.width,t.x+t.width)-n,x:n,y:r}}function area(e){return e.width*e.height}function rectsEqual(e,t){return e.x===t.x&&e.y===t.y&&e.width===t.width&&e.height===t.height}function recompute(e){let t=null;for(let n of e.children)t=t===null?{...rectOf(n)}:unionRects(t,rectOf(n));e.rect=t}function createSpatialIndex(e={}){let t=e.maxEntriesPerNode??8;if(!Number.isInteger(t)||t<4)throw new AtlasConfigError(`maxEntriesPerNode must be an integer >= 4, received ${t}`);let n=Math.max(2,Math.ceil(t/3)),r=new Map,i={children:[],leaf:!0,rect:null},pickChild=(e,t)=>{let n=null,r=1/0,i=1/0;for(let a of e.children){let e=a.rect??t,o=area(unionRects(e,t))-area(e);(o<r||o===r&&area(e)<i)&&(n=a,r=o,i=area(e))}return n},split=e=>{let r=e.children,i=0,a=1,o=-1/0;for(let e=0;e<r.length;e++)for(let t=e+1;t<r.length;t++){let n=area(unionRects(rectOf(r[e]),rectOf(r[t])))-area(rectOf(r[e]))-area(rectOf(r[t]));n>o&&(o=n,i=e,a=t)}let s=[r[i]],c=[r[a]],l=rectOf(r[i]),u=rectOf(r[a]),d=r.filter((e,t)=>t!==i&&t!==a);for(let[e,r]of d.entries()){let i=s.length+(d.length-e)>t||c.length+(d.length-e)-1<n,a=c.length+(d.length-e)>t||s.length+(d.length-e)-1<n,o;if(i)o=!0;else if(a)o=!1;else{let e=area(unionRects(l,rectOf(r)))-area(l),t=area(unionRects(u,rectOf(r)))-area(u);o=e<t||e===t&&area(l)<=area(u)}o?(s.push(r),l=unionRects(l,rectOf(r))):(c.push(r),u=unionRects(u,rectOf(r)))}let f=e.leaf?{children:s,leaf:!0,rect:null}:{children:s,leaf:!1,rect:null},p=e.leaf?{children:c,leaf:!0,rect:null}:{children:c,leaf:!1,rect:null};return recompute(f),recompute(p),[f,p]},insertInto=(e,n)=>{if(e.leaf)return e.children.push(n),e.rect=e.rect===null?{...rectOf(n)}:unionRects(e.rect,rectOf(n)),e.children.length>t?split(e):null;let r=e,i=pickChild(r,rectOf(n)),a=insertInto(i,n);if(recompute(e),a){let t=r.children.indexOf(i);r.children.splice(t,1,a[0],a[1]),recompute(e)}return e.children.length>t?split(e):null},insertEntry=e=>{!i.leaf&&i.children.length===0&&(i={children:[],leaf:!0,rect:null});let t=insertInto(i,e);t&&(i={children:t,leaf:!1,rect:null},recompute(i))},removeFrom=(e,t)=>{if(e.leaf){let n=e.children.indexOf(t);return n!==-1&&e.children.splice(n,1),recompute(e),e.children.length===0}let n=e;for(let e=n.children.length-1;e>=0;e--){let r=n.children[e];r.rect&&containsRect(r.rect,t.rect)&&removeFrom(r,t)&&n.children.splice(e,1)}return recompute(e),n.children.length===0},deleteEntry=e=>{let t=r.get(e);if(!t)return!1;for(r.delete(e),removeFrom(i,t);!i.leaf&&i.children.length===1;)i=i.children[0];return!0},queryInto=(e,t,n)=>{if(e.rect&&t(e.rect)){if(e.leaf)for(let r of e.children)t(r.rect)&&n.push(r.id);else for(let r of e.children)queryInto(r,t,n)}};return{get bounds(){return i.rect},clear(){r.clear(),i={children:[],leaf:!0,rect:null}},delete:deleteEntry,get(e){return r.get(e)?.rect},has(e){return r.has(e)},queryPoint(e,t){let n=t?.tolerance??0;if(!(n>=0))throw new AtlasConfigError(`tolerance must be a non-negative finite number, received ${n}`);let r=inflateRect({...e,height:0,width:0},n),a=[];return queryInto(i,e=>rectsIntersect(e,r),a),a},queryRect(e){let t=[];return queryInto(i,t=>rectsIntersect(t,e),t),t},set(e,t){let n=r.get(e);if(n){if(rectsEqual(n.rect,t))return;deleteEntry(e)}let i={id:e,rect:{...t}};r.set(e,i),insertEntry(i)},get size(){return r.size}}}return e.AtlasConfigError=AtlasConfigError,e.AtlasError=AtlasError,e.IDENTITY=t,e.alignRects=alignRects,e.apply=apply,e.around=around,e.containsPoint=containsPoint,e.containsRect=containsRect,e.createCamera=createCamera,e.createSpatialIndex=createSpatialIndex,e.distanceToPolyline=distanceToPolyline,e.distributeRects=distributeRects,e.inflateRect=inflateRect,e.intersectRect=intersectRect,e.invert=invert,e.multiply=multiply,e.pointInPolygon=pointInPolygon,e.pointNearPolygon=pointNearPolygon,e.rectBottom=rectBottom,e.rectCenter=rectCenter,e.rectFromPoints=rectFromPoints,e.rectRight=rectRight,e.rectsIntersect=rectsIntersect,e.rotate=rotate,e.scale=scale,e.scaleOf=scaleOf,e.snapRect=snapRect,e.toCssMatrix=toCssMatrix,e.translate=translate,e.unionRect=unionRect,e})({});
2
+ //# sourceMappingURL=atlas.iife.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"atlas.iife.js","names":["exports","message","opts","IDENTITY","a","b","matrix","point","tx","ty","sx","sy","cos","radians","sin","anchor","det","inv","minX","minY","maxX","maxY","found","points","rect","x","y","right","bottom","outer","inner","amount","DEFAULT_SCHEDULER","handle","callback","value","name","t","angle","to","from","rotation","zoom","delta","m","s","viewport","minZoom","options","maxZoom","scheduler","initial","state","controller","disposed","animation","listeners","cachedMatrix","cachedInverse","screenPoint","listener","candidate","next","duration","animateOptions","easing","signal","target","start","logFrom","logTo","frame","time","e","padding","fitOptions","availableWidth","availableHeight","bounds","offset","dx","dy","size","world","subscribeOptions","factor","inside","n","polygon","j","xAtY","lengthSq","path","best","i","d","tolerance","anchors","targets","threshold","spacing","line","min","max","touching","candidates","axis","position","moved","r","end","leftEnd","rightStart","free","gap","movedX","movedY","xTargets","grid","xSnap","yTargets","ySnap","movedRect","guides","span","rects","edge","order","first","last","sum","entry","result","cursor","node","child","maxEntries","minEntries","entries","root","bestEnlargement","bestArea","current","enlargement","items","si","sj","worst","waste","groupA","groupB","rectA","rectB","remaining","index","item","mustA","mustB","toA","enlargeA","enlargeB","branch","overflow","id","hits","out","queryOptions","box","existing"],"sources":["../src/errors.ts","../src/matrix.ts","../src/rect.ts","../src/camera.ts","../src/geometry.ts","../src/snap.ts","../src/spatial-index.ts"],"sourcesContent":["export class AtlasError extends Error {\n constructor(message: string, opts?: ErrorOptions) {\n super(message, opts);\n this.name = new.target.name;\n Object.setPrototypeOf(this, new.target.prototype);\n }\n}\n\nexport class AtlasConfigError extends AtlasError {}\n","import type { Matrix, Point } from './shapes.js';\n\nexport const IDENTITY: Matrix = Object.freeze([1, 0, 0, 1, 0, 0]) as Matrix;\n\nexport function multiply(a: Matrix, b: Matrix): Matrix {\n return [\n a[0] * b[0] + a[2] * b[1],\n a[1] * b[0] + a[3] * b[1],\n a[0] * b[2] + a[2] * b[3],\n a[1] * b[2] + a[3] * b[3],\n a[0] * b[4] + a[2] * b[5] + a[4],\n a[1] * b[4] + a[3] * b[5] + a[5],\n ];\n}\n\nexport function apply(matrix: Matrix, point: Point): Point {\n return {\n x: matrix[0] * point.x + matrix[2] * point.y + matrix[4],\n y: matrix[1] * point.x + matrix[3] * point.y + matrix[5],\n };\n}\n\nexport function translate(tx: number, ty: number): Matrix {\n return [1, 0, 0, 1, tx, ty];\n}\n\nexport function scale(sx: number, sy: number = sx): Matrix {\n return [sx, 0, 0, sy, 0, 0];\n}\n\n/** Rotation in radians; positive is clockwise on screen (y grows downward). */\nexport function rotate(radians: number): Matrix {\n const cos = Math.cos(radians);\n const sin = Math.sin(radians);\n return [cos, sin, -sin, cos, 0, 0];\n}\n\n/** Transform applied around an anchor point: translate(anchor) · matrix · translate(-anchor). */\nexport function around(anchor: Point, matrix: Matrix): Matrix {\n return multiply(multiply(translate(anchor.x, anchor.y), matrix), translate(-anchor.x, -anchor.y));\n}\n\n/** Average axis scale of a matrix; 0 for degenerate matrices. */\nexport function scaleOf(matrix: Matrix): number {\n const sx = Math.hypot(matrix[0], matrix[1]);\n const sy = Math.hypot(matrix[2], matrix[3]);\n return (sx + sy) / 2;\n}\n\n/** Serializes to a CSS `matrix()` value usable in a DOM element's `transform`. */\nexport function toCssMatrix(matrix: Matrix): string {\n return `matrix(${matrix.join(',')})`;\n}\n\n/** Returns null for non-invertible matrices (zero determinant). */\nexport function invert(matrix: Matrix): Matrix | null {\n const det = matrix[0] * matrix[3] - matrix[2] * matrix[1];\n if (!Number.isFinite(det) || det === 0) return null;\n const inv = 1 / det;\n return [\n matrix[3] * inv,\n -matrix[1] * inv,\n -matrix[2] * inv,\n matrix[0] * inv,\n (matrix[2] * matrix[5] - matrix[3] * matrix[4]) * inv,\n (matrix[1] * matrix[4] - matrix[0] * matrix[5]) * inv,\n ];\n}\n","import type { Point, Rect } from './shapes.js';\n\nexport function rectFromPoints(points: readonly [Point, ...Point[]]): Rect;\nexport function rectFromPoints(points: Iterable<Point>): Rect | null;\nexport function rectFromPoints(points: Iterable<Point>): Rect | null {\n let minX = Infinity;\n let minY = Infinity;\n let maxX = -Infinity;\n let maxY = -Infinity;\n let found = false;\n for (const point of points) {\n found = true;\n if (point.x < minX) minX = point.x;\n if (point.y < minY) minY = point.y;\n if (point.x > maxX) maxX = point.x;\n if (point.y > maxY) maxY = point.y;\n }\n if (!found) return null;\n return { height: maxY - minY, width: maxX - minX, x: minX, y: minY };\n}\n\nexport function rectRight(rect: Rect): number {\n return rect.x + rect.width;\n}\n\nexport function rectBottom(rect: Rect): number {\n return rect.y + rect.height;\n}\n\nexport function rectCenter(rect: Rect): Point {\n return { x: rect.x + rect.width / 2, y: rect.y + rect.height / 2 };\n}\n\nexport function unionRect(a: Rect, b: Rect): Rect {\n const x = Math.min(a.x, b.x);\n const y = Math.min(a.y, b.y);\n return {\n height: Math.max(rectBottom(a), rectBottom(b)) - y,\n width: Math.max(rectRight(a), rectRight(b)) - x,\n x,\n y,\n };\n}\n\n/**\n * Overlap of two rects using closed intervals: touching rects (or a zero-area\n * rect on another's edge) intersect and may yield a zero-area result.\n * Returns null only when the rects are disjoint.\n */\nexport function intersectRect(a: Rect, b: Rect): Rect | null {\n const x = Math.max(a.x, b.x);\n const y = Math.max(a.y, b.y);\n const right = Math.min(rectRight(a), rectRight(b));\n const bottom = Math.min(rectBottom(a), rectBottom(b));\n if (right < x || bottom < y) return null;\n return { height: bottom - y, width: right - x, x, y };\n}\n\nexport function containsRect(outer: Rect, inner: Rect): boolean {\n return (\n outer.x <= inner.x &&\n outer.y <= inner.y &&\n rectRight(outer) >= rectRight(inner) &&\n rectBottom(outer) >= rectBottom(inner)\n );\n}\n\nexport function containsPoint(rect: Rect, point: Point): boolean {\n return point.x >= rect.x && point.x <= rectRight(rect) && point.y >= rect.y && point.y <= rectBottom(rect);\n}\n\n/** Grows (positive) or shrinks (negative) every edge; a shrink past the center yields a negative-size rect. */\nexport function inflateRect(rect: Rect, amount: number): Rect {\n return { height: rect.height + amount * 2, width: rect.width + amount * 2, x: rect.x - amount, y: rect.y - amount };\n}\n\n/** Whether two rects overlap or merely touch (closed intervals). */\nexport function rectsIntersect(a: Rect, b: Rect): boolean {\n return intersectRect(a, b) !== null;\n}\n","import { AtlasConfigError } from './errors.js';\nimport { apply, multiply, rotate, scale, translate } from './matrix.js';\nimport { rectFromPoints } from './rect.js';\nimport type { Matrix, Point, Rect, Size } from './shapes.js';\n\nexport type CameraState = Readonly<{\n /** World point at the viewport centre. */\n x: number;\n y: number;\n /** Screen pixels per world unit. */\n zoom: number;\n /** Radians in (-π, π]; positive is clockwise on screen. */\n rotation: number;\n}>;\n\nexport type CameraOptions = Readonly<{\n initial?: Partial<CameraState>;\n minZoom?: number;\n maxZoom?: number;\n /** Viewport size in CSS px. Default 0×0, where the centre is the origin. */\n viewport?: Size;\n scheduler?: FrameScheduler;\n}>;\n\nexport type FrameScheduler = Readonly<{\n requestFrame: (callback: (time: number) => void) => number;\n cancelFrame: (handle: number) => void;\n now: () => number;\n}>;\n\nexport type AnimationOptions = Readonly<{\n duration?: number;\n easing?: (t: number) => number;\n signal?: AbortSignal;\n}>;\n\nexport type Camera = Readonly<{\n readonly state: CameraState;\n /** Viewport size in CSS px; the world point at its centre is `state.x/y`. */\n readonly viewport: Size;\n /** world → screen. */\n readonly matrix: Matrix;\n /** screen → world. Zoom is clamped above zero, so this always exists. */\n readonly inverse: Matrix;\n toScreen(point: Point): Point;\n toWorld(point: Point): Point;\n /** Jump to `target` immediately, cancelling any animation. */\n set(target: Partial<CameraState>): void;\n /** Change the viewport size, keeping the world point at its centre fixed. */\n resize(size: Size): void;\n panBy(dx: number, dy: number): void;\n /** Zoom keeping the world point under `screenPoint` fixed. `factor` multiplies current zoom. */\n zoomAt(screenPoint: Point, factor: number): void;\n /** Rotate keeping the world point under `screenPoint` fixed. `delta` radians. */\n rotateAt(screenPoint: Point, delta: number): void;\n /** Fit `bounds` into the current viewport with inner `padding`. */\n fitBounds(bounds: Rect, options?: Readonly<{ padding?: number }>): void;\n /** Axis-aligned world bounds of the visible viewport, honouring rotation. */\n readonly visibleRect: Rect;\n /** Animate to `target`; concurrent calls replace the running animation. */\n animateTo(target: Partial<CameraState>, options?: AnimationOptions): void;\n stop(): void;\n subscribe(listener: (state: CameraState) => void, options?: Readonly<{ signal?: AbortSignal }>): () => void;\n dispose(): void;\n readonly disposed: boolean;\n readonly disposalSignal: AbortSignal;\n [Symbol.dispose]: () => void;\n}>;\n\nconst DEFAULT_SCHEDULER: FrameScheduler = {\n cancelFrame: (handle) => cancelAnimationFrame(handle),\n now: () => performance.now(),\n requestFrame: (callback) => requestAnimationFrame(callback),\n};\n\nfunction assertFinite(name: string, value: number): void {\n if (!Number.isFinite(value)) throw new AtlasConfigError(`${name} must be a finite number, received ${value}`);\n}\n\nfunction easeInOut(t: number): number {\n return t < 0.5 ? 2 * t * t : 1 - (-2 * t + 2) ** 2 / 2;\n}\n\n/** Normalize an angle to (-π, π]. */\nfunction normalizeAngle(angle: number): number {\n const wrapped = (angle + Math.PI) % (2 * Math.PI);\n return ((wrapped + 2 * Math.PI) % (2 * Math.PI)) - Math.PI;\n}\n\n/** Shortest signed path from `from` to `to`, in (-π, π]. */\nfunction shortestAngle(from: number, to: number): number {\n return normalizeAngle(to - from);\n}\n\n/** World-space offset that a screen-space offset corresponds to at `zoom`/`rotation`. */\nfunction screenDeltaToWorld(delta: Point, zoom: number, rotation: number): Point {\n return apply(multiply(rotate(-rotation), scale(1 / zoom)), delta);\n}\n\n/**\n * world → screen: translate(viewport centre) · scale(zoom) · rotate(rotation) · translate(-state).\n * With the state point at the viewport centre, saved states no longer depend\n * on the screen size.\n */\nfunction matrixOf(s: CameraState, viewport: Size): Matrix {\n const rotated = multiply(scale(s.zoom), rotate(s.rotation));\n const m = multiply(rotated, translate(-s.x, -s.y));\n return multiply(translate(viewport.width / 2, viewport.height / 2), m);\n}\n\n/**\n * screen → world in closed form: translate(state) · rotate(-r) · scale(1/z) · translate(-centre).\n * Zoom is clamped above zero, so the camera matrix is always invertible.\n */\nfunction inverseOf(s: CameraState, viewport: Size): Matrix {\n const m = multiply(rotate(-s.rotation), scale(1 / s.zoom));\n const t = screenDeltaToWorld({ x: viewport.width / 2, y: viewport.height / 2 }, s.zoom, s.rotation);\n return multiply(translate(s.x - t.x, s.y - t.y), m);\n}\n\nexport function createCamera(options: CameraOptions = {}): Camera {\n const minZoom = options.minZoom ?? 0.01;\n const maxZoom = options.maxZoom ?? 1000;\n if (!(minZoom > 0 && minZoom <= maxZoom)) {\n throw new AtlasConfigError(`Zoom clamps must satisfy 0 < minZoom <= maxZoom, received ${minZoom} and ${maxZoom}`);\n }\n const scheduler = options.scheduler ?? DEFAULT_SCHEDULER;\n const initial = options.initial ?? {};\n let viewport: Size = options.viewport ?? { height: 0, width: 0 };\n let state: CameraState = {\n rotation: normalizeAngle(initial.rotation ?? 0),\n x: initial.x ?? 0,\n y: initial.y ?? 0,\n zoom: Math.min(maxZoom, Math.max(minZoom, initial.zoom ?? 1)),\n };\n for (const [name, value] of [\n ['camera.x', state.x],\n ['camera.y', state.y],\n ['camera.rotation', state.rotation],\n ] as const) {\n assertFinite(name, value);\n }\n\n const controller = new AbortController();\n let disposed = false;\n let animation: { cleanup: () => void; frame: number } | null = null;\n const listeners = new Set<(state: CameraState) => void>();\n\n // Derived transforms are recomputed at most once per state or viewport change.\n let cachedMatrix: Matrix | null = null;\n let cachedInverse: Matrix | null = null;\n\n const matrix = (): Matrix => {\n cachedMatrix ??= matrixOf(state, viewport);\n return cachedMatrix;\n };\n const inverse = (): Matrix => {\n cachedInverse ??= inverseOf(state, viewport);\n return cachedInverse;\n };\n\n const invalidate = (): void => {\n cachedMatrix = null;\n cachedInverse = null;\n };\n\n /** Screen point measured from the viewport centre, where the state point sits. */\n const relativeToCentre = (screenPoint: Point): Point => ({\n x: screenPoint.x - viewport.width / 2,\n y: screenPoint.y - viewport.height / 2,\n });\n\n const emit = (): void => {\n for (const listener of [...listeners]) listener(state);\n };\n\n const set = (next: Partial<CameraState>): void => {\n if (disposed) return;\n const candidate: CameraState = {\n rotation: normalizeAngle(next.rotation ?? state.rotation),\n x: next.x ?? state.x,\n y: next.y ?? state.y,\n zoom: Math.min(maxZoom, Math.max(minZoom, next.zoom ?? state.zoom)),\n };\n if (\n candidate.x === state.x &&\n candidate.y === state.y &&\n candidate.zoom === state.zoom &&\n candidate.rotation === state.rotation\n ) {\n return;\n }\n state = candidate;\n invalidate();\n emit();\n };\n\n /** Cancel any running animation; direct manipulation always wins. */\n const stop = (): void => {\n if (!animation) return;\n scheduler.cancelFrame(animation.frame);\n animation.cleanup();\n animation = null;\n };\n\n const dispose = (): void => {\n if (disposed) return;\n disposed = true;\n stop();\n listeners.clear();\n controller.abort();\n };\n\n const animateTo: Camera['animateTo'] = (target, animateOptions = {}) => {\n stop();\n if (disposed) return;\n const duration = animateOptions.duration ?? 250;\n const easing = animateOptions.easing ?? easeInOut;\n const signal = animateOptions.signal;\n if (signal?.aborted) return;\n if (duration <= 0) {\n set(target);\n return;\n }\n const from = state;\n const to: CameraState = {\n rotation: from.rotation + shortestAngle(from.rotation, target.rotation ?? state.rotation),\n x: target.x ?? state.x,\n y: target.y ?? state.y,\n zoom: Math.min(maxZoom, Math.max(minZoom, target.zoom ?? state.zoom)),\n };\n const start = scheduler.now();\n // Log-space zoom interpolation keeps multiplicative zoom visually linear.\n const logFrom = Math.log(from.zoom);\n const logTo = Math.log(to.zoom);\n const frame = { cleanup: () => {}, frame: 0 };\n animation = frame;\n const abort = (): void => {\n if (animation !== frame) return;\n stop();\n };\n if (signal) {\n signal.addEventListener('abort', abort, { once: true });\n frame.cleanup = () => signal.removeEventListener('abort', abort);\n }\n const step = (time: number): void => {\n if (animation !== frame) return;\n const t = Math.min(1, (time - start) / duration);\n const e = easing(t);\n set({\n rotation: from.rotation + (to.rotation - from.rotation) * e,\n x: from.x + (to.x - from.x) * e,\n y: from.y + (to.y - from.y) * e,\n zoom: Math.exp(logFrom + (logTo - logFrom) * e),\n });\n if (t >= 1) {\n animation = null;\n frame.cleanup();\n return;\n }\n frame.frame = scheduler.requestFrame(step);\n };\n frame.frame = scheduler.requestFrame(step);\n };\n\n return {\n animateTo,\n get disposalSignal() {\n return controller.signal;\n },\n dispose,\n get disposed() {\n return disposed;\n },\n fitBounds(bounds, fitOptions = {}) {\n if (disposed) return;\n stop();\n const padding = fitOptions.padding ?? 0;\n const availableWidth = Math.max(1, viewport.width - padding * 2);\n const availableHeight = Math.max(1, viewport.height - padding * 2);\n const zoom = Math.min(\n maxZoom,\n Math.max(\n minZoom,\n Math.min(\n bounds.width === 0 ? maxZoom : availableWidth / bounds.width,\n bounds.height === 0 ? maxZoom : availableHeight / bounds.height,\n ),\n ),\n );\n // The state point is the world point at the viewport centre, so fitting\n // the bounds centre on screen means moving the state to it directly.\n set({ x: bounds.x + bounds.width / 2, y: bounds.y + bounds.height / 2, zoom });\n },\n get inverse() {\n return inverse();\n },\n get matrix() {\n return matrix();\n },\n panBy(dx, dy) {\n if (disposed) return;\n stop();\n // Screen-space pan: move the world centre opposite to the drag.\n const offset = screenDeltaToWorld({ x: dx, y: dy }, state.zoom, state.rotation);\n set({ x: state.x - offset.x, y: state.y - offset.y });\n },\n resize(size) {\n if (disposed) return;\n if (size.width === viewport.width && size.height === viewport.height) return;\n viewport = { height: size.height, width: size.width };\n // The state point is the world centre, so it stays fixed by definition;\n // only the derived transforms change.\n invalidate();\n emit();\n },\n rotateAt(screenPoint, delta) {\n if (disposed) return;\n stop();\n const world = apply(inverse(), screenPoint);\n // Anchor math must use the new rotation, so compute before set() normalizes it.\n const rotation = state.rotation + delta;\n const offset = screenDeltaToWorld(relativeToCentre(screenPoint), state.zoom, rotation);\n set({ rotation, x: world.x - offset.x, y: world.y - offset.y });\n },\n set(target) {\n stop();\n set(target);\n },\n [Symbol.dispose]: dispose,\n get state() {\n return state;\n },\n stop,\n subscribe(listener, subscribeOptions) {\n if (disposed || subscribeOptions?.signal?.aborted) return () => {};\n listeners.add(listener);\n subscribeOptions?.signal?.addEventListener('abort', () => listeners.delete(listener), { once: true });\n return () => listeners.delete(listener);\n },\n toScreen(point) {\n return apply(matrix(), point);\n },\n toWorld(point) {\n return apply(inverse(), point);\n },\n get viewport() {\n return viewport;\n },\n get visibleRect() {\n const to = inverse();\n const corners = [\n apply(to, { x: 0, y: 0 }),\n apply(to, { x: viewport.width, y: 0 }),\n apply(to, { x: 0, y: viewport.height }),\n apply(to, { x: viewport.width, y: viewport.height }),\n ] as const;\n // A finite viewport always produces a rect.\n return rectFromPoints(corners);\n },\n zoomAt(screenPoint, factor) {\n if (!Number.isFinite(factor) || factor <= 0) {\n throw new AtlasConfigError(`zoomAt factor must be a positive finite number, received ${factor}`);\n }\n if (disposed) return;\n stop();\n const world = apply(inverse(), screenPoint);\n const zoom = Math.min(maxZoom, Math.max(minZoom, state.zoom * factor));\n // Anchor math must use the new zoom, so compute before set().\n const offset = screenDeltaToWorld(relativeToCentre(screenPoint), zoom, state.rotation);\n set({ x: world.x - offset.x, y: world.y - offset.y, zoom });\n },\n };\n}\n","import { AtlasConfigError } from './errors.js';\nimport type { Point } from './shapes.js';\n\n/**\n * Ray-casting point-in-polygon test. `polygon` is an open ring; an implicit closing\n * edge connects the last point to the first. Boundary behavior follows the standard\n * ray-cast convention (edge hits depend on the ray's crossing parity).\n */\nexport function pointInPolygon(polygon: readonly Point[], point: Point): boolean {\n let inside = false;\n const n = polygon.length;\n for (let i = 0, j = n - 1; i < n; j = i++) {\n const a = polygon[i];\n const b = polygon[j];\n const crosses = a.y > point.y !== b.y > point.y;\n if (!crosses) continue;\n const xAtY = ((b.x - a.x) * (point.y - a.y)) / (b.y - a.y) + a.x;\n if (point.x < xAtY) inside = !inside;\n }\n return inside;\n}\n\nfunction distanceToSegment(point: Point, a: Point, b: Point): number {\n const dx = b.x - a.x;\n const dy = b.y - a.y;\n const lengthSq = dx * dx + dy * dy;\n if (lengthSq === 0) return Math.hypot(point.x - a.x, point.y - a.y);\n let t = ((point.x - a.x) * dx + (point.y - a.y) * dy) / lengthSq;\n t = Math.max(0, Math.min(1, t));\n return Math.hypot(point.x - (a.x + t * dx), point.y - (a.y + t * dy));\n}\n\n/**\n * Shortest distance from a point to a polyline (an open path; no implicit closing\n * edge). Returns Infinity for an empty path and the point-to-point distance for\n * a single-point path.\n */\nexport function distanceToPolyline(path: readonly Point[], point: Point): number {\n if (path.length === 0) return Infinity;\n if (path.length === 1) return Math.hypot(point.x - path[0].x, point.y - path[0].y);\n let best = Infinity;\n for (let i = 0, j = 1; j < path.length; i = j++) {\n const d = distanceToSegment(point, path[i], path[j]);\n if (d < best) best = d;\n }\n return best;\n}\n\n/**\n * Whether a point lies within `tolerance` of a polygon's outline or inside it —\n * the hit test for stroked shapes (outlines, wires rendered as strokes).\n */\nexport function pointNearPolygon(polygon: readonly Point[], point: Point, tolerance: number): boolean {\n if (!(tolerance >= 0)) {\n throw new AtlasConfigError(`tolerance must be a non-negative finite number; received ${String(tolerance)}.`);\n }\n const closed = polygon.length > 0 ? [...polygon, polygon[0]] : polygon;\n if (distanceToPolyline(closed, point) <= tolerance) return true;\n return pointInPolygon(polygon, point);\n}\n","import { AtlasConfigError } from './errors.js';\nimport { rectBottom, rectCenter, rectFromPoints, rectRight } from './rect.js';\nimport type { Point, Rect } from './shapes.js';\n\n/** What a guide was snapped to: a grid line, another shape's anchor, or an equal-spacing gap. */\nexport type SnapGuideKind = 'grid' | 'object' | 'spacing';\n\n/**\n * A guide line to render. `axis` names the axis the line is perpendicular to:\n * an `'x'` guide is a vertical line at `position = x`, spanning `from..to` on\n * y. Spacing guides carry `marks`: the centers of the two equal gaps, measured\n * along the span axis, drawn as markers.\n */\nexport interface SnapGuide {\n axis: 'x' | 'y';\n /** Span endpoints along the line's own direction (world coordinates). */\n from: number;\n /** Render hint: draw grid and spacing guides dashed, object guides solid. */\n kind: SnapGuideKind;\n /** Spacing guides only: centers of the two equal gaps, on the span axis. */\n marks?: readonly [number, number];\n /** The coordinate the line sits on, on `axis`. */\n position: number;\n to: number;\n}\n\nexport interface SnapOptions {\n /** Other shapes to snap against. The moving rect itself must not be included. */\n candidates: readonly Rect[];\n /** Optional grid spacing per axis; lines run through multiples of the spacing. */\n grid?: { x?: number; y?: number };\n /**\n * Also snap for equal gaps between neighbors (img.ly-style spacing guides)\n * on each axis where no alignment snap engaged. Default false.\n */\n spacing?: boolean;\n /** Maximum world-unit distance for a snap to engage. */\n threshold: number;\n}\n\nexport interface SnapResult {\n /** Offset to apply to the moving rect; zero on an axis with no snap. */\n delta: Point;\n /** Guides for the snaps that engaged, at most one per axis. */\n guides: SnapGuide[];\n}\n\n/** The three x coordinates (left, center, right) a rect can snap with. */\nfunction xAnchors(rect: Rect): number[] {\n return [rect.x, rect.x + rect.width / 2, rectRight(rect)];\n}\n\nfunction yAnchors(rect: Rect): number[] {\n return [rect.y, rect.y + rect.height / 2, rectBottom(rect)];\n}\n\n/** A snap target with the kind of guide it produced. */\ninterface Target {\n kind: SnapGuideKind;\n value: number;\n}\n\ninterface AxisSnap {\n delta: number;\n kind: SnapGuideKind;\n /** Target coordinate that produced the snap. */\n position: number;\n}\n\nfunction bestAxisSnap(anchors: readonly number[], targets: readonly Target[], threshold: number): AxisSnap | null {\n let best: AxisSnap | null = null;\n for (const anchor of anchors) {\n for (const target of targets) {\n const delta = target.value - anchor;\n if (Math.abs(delta) > threshold) continue;\n if (best === null || Math.abs(delta) < Math.abs(best.delta)) {\n best = { delta, kind: target.kind, position: target.value };\n }\n }\n }\n return best;\n}\n\nfunction gridTargets(min: number, max: number, spacing: number | undefined, threshold: number): Target[] {\n if (spacing === undefined || !Number.isFinite(spacing) || spacing <= 0) return [];\n const targets: Target[] = [];\n for (let line = Math.floor((min - threshold) / spacing) * spacing; line <= max + threshold; line += spacing) {\n targets.push({ kind: 'grid', value: line });\n }\n return targets;\n}\n\nfunction spanFor(\n position: number,\n moved: Rect,\n candidates: readonly Rect[],\n axis: 'x' | 'y',\n): { from: number; to: number } {\n const touching: Rect[] = [];\n for (const candidate of candidates) {\n const anchors = axis === 'x' ? xAnchors(candidate) : yAnchors(candidate);\n if (anchors.some((anchor) => anchor === position)) touching.push(candidate);\n }\n const points: Point[] = [moved, ...touching].flatMap((rect) => [\n { x: rect.x, y: rect.y },\n { x: rectRight(rect), y: rectBottom(rect) },\n ]);\n const bounds = rectFromPoints(points) ?? { height: 0, width: 0, x: position, y: position };\n return axis === 'x' ? { from: bounds.y, to: rectBottom(bounds) } : { from: bounds.x, to: rectRight(bounds) };\n}\n\n/** Overlap test on the axis perpendicular to `axis`. */\nfunction overlapsPerpendicular(a: Rect, b: Rect, axis: 'x' | 'y'): boolean {\n return axis === 'x' ? a.y < rectBottom(b) && b.y < rectBottom(a) : a.x < rectRight(b) && b.x < rectRight(a);\n}\n\n/**\n * Equal-gap snap along `axis`: centers the rect between the nearest\n * perpendicular-overlapping neighbors when the gaps can be made equal within\n * `threshold`. `position` is the moving rect's center on the perpendicular\n * axis; `span` and `marks` are along `axis`.\n */\nfunction axisSpacingSnap(\n rect: Rect,\n candidates: readonly Rect[],\n axis: 'x' | 'y',\n threshold: number,\n): { delta: number; marks: readonly [number, number]; position: number; span: readonly [number, number] } | null {\n const start = axis === 'x' ? (r: Rect) => r.x : (r: Rect) => r.y;\n const end = axis === 'x' ? (r: Rect) => rectRight(r) : (r: Rect) => rectBottom(r);\n let leftEnd = -Infinity;\n let rightStart = Infinity;\n for (const candidate of candidates) {\n if (!overlapsPerpendicular(rect, candidate, axis)) continue;\n if (end(candidate) <= start(rect) && end(candidate) > leftEnd) leftEnd = end(candidate);\n if (start(candidate) >= end(rect) && start(candidate) < rightStart) rightStart = start(candidate);\n }\n if (leftEnd === -Infinity || rightStart === Infinity) return null;\n const free = rightStart - leftEnd - (axis === 'x' ? rect.width : rect.height);\n if (free < 0) return null;\n const ideal = leftEnd + free / 2;\n const delta = ideal - start(rect);\n if (Math.abs(delta) > threshold) return null;\n const gap = free / 2;\n return {\n delta,\n marks: [leftEnd + gap / 2, rightStart - gap / 2],\n // `rect` is the already-moved rect, so the guide sits at the position the\n // shape actually occupies after both axes snapped.\n position: axis === 'x' ? rectCenter(rect).y : rectCenter(rect).x,\n span: [leftEnd, rightStart],\n };\n}\n\n/**\n * Snap a moving rect against candidate shapes, an optional grid, and (with\n * `spacing`) equal gaps between neighbors. Each axis snaps independently to\n * the nearest alignment target within `threshold`; when an axis finds no\n * alignment snap and `spacing` is enabled, it falls back to centering the rect\n * between its nearest neighbors on that axis.\n */\nexport function snapRect(rect: Rect, options: SnapOptions): SnapResult {\n const { candidates, grid, spacing, threshold } = options;\n if (!(threshold >= 0)) {\n throw new AtlasConfigError(`threshold must be a non-negative finite number; received ${String(threshold)}.`);\n }\n let movedX = rect.x;\n let movedY = rect.y;\n const delta = { x: 0, y: 0 };\n\n const xTargets: Target[] = candidates.flatMap((candidate) =>\n xAnchors(candidate).map((value): Target => ({ kind: 'object', value })),\n );\n xTargets.push(...gridTargets(rect.x, rectRight(rect), grid?.x, threshold));\n const xSnap = bestAxisSnap(xAnchors(rect), xTargets, threshold);\n if (xSnap !== null) {\n delta.x = xSnap.delta;\n movedX += xSnap.delta;\n }\n\n const yTargets: Target[] = candidates.flatMap((candidate) =>\n yAnchors(candidate).map((value): Target => ({ kind: 'object', value })),\n );\n yTargets.push(...gridTargets(rect.y, rectBottom(rect), grid?.y, threshold));\n const ySnap = bestAxisSnap(yAnchors(rect), yTargets, threshold);\n if (ySnap !== null) {\n delta.y = ySnap.delta;\n movedY += ySnap.delta;\n }\n\n // Guides span the union of the moved rect and every candidate sharing the snapped coordinate.\n const movedRect: Rect = { ...rect, x: movedX, y: movedY };\n const guides: SnapGuide[] = [];\n if (xSnap !== null) {\n const span = spanFor(xSnap.position, movedRect, candidates, 'x');\n guides.push({ axis: 'x', from: span.from, kind: xSnap.kind, position: xSnap.position, to: span.to });\n }\n if (ySnap !== null) {\n const span = spanFor(ySnap.position, movedRect, candidates, 'y');\n guides.push({ axis: 'y', from: span.from, kind: ySnap.kind, position: ySnap.position, to: span.to });\n }\n\n // Equal-spacing fallback fills the axes where no alignment snap engaged.\n // It runs on the moved rect so its perpendicular position honours the other\n // axis's snap.\n if (spacing) {\n if (xSnap === null) {\n const gap = axisSpacingSnap(movedRect, candidates, 'x', threshold);\n if (gap !== null) {\n delta.x = gap.delta;\n guides.push({\n axis: 'y',\n from: gap.span[0],\n kind: 'spacing',\n marks: gap.marks,\n position: gap.position,\n to: gap.span[1],\n });\n }\n }\n if (ySnap === null) {\n const gap = axisSpacingSnap(movedRect, candidates, 'y', threshold);\n if (gap !== null) {\n delta.y = gap.delta;\n guides.push({\n axis: 'x',\n from: gap.span[0],\n kind: 'spacing',\n marks: gap.marks,\n position: gap.position,\n to: gap.span[1],\n });\n }\n }\n }\n return { delta, guides };\n}\n\n/** Which edge/center line to align rects on. */\nexport type AlignEdge = 'left' | 'horizontal-center' | 'right' | 'top' | 'vertical-center' | 'bottom';\n\n/**\n * Align rects on a shared line derived from their combined bounds, preserving\n * sizes. Returns new rects in input order; the input is untouched.\n */\nexport function alignRects(rects: readonly Rect[], edge: AlignEdge): Rect[] {\n if (rects.length === 0) return [];\n const bounds = rectFromPoints(\n rects.flatMap((rect) => [\n { x: rect.x, y: rect.y },\n { x: rectRight(rect), y: rectBottom(rect) },\n ]),\n );\n if (bounds === null) return [];\n return rects.map((rect) => {\n switch (edge) {\n case 'left':\n return { ...rect, x: bounds.x };\n case 'horizontal-center':\n return { ...rect, x: rectCenter(bounds).x - rect.width / 2 };\n case 'right':\n return { ...rect, x: rectRight(bounds) - rect.width };\n case 'top':\n return { ...rect, y: bounds.y };\n case 'vertical-center':\n return { ...rect, y: rectCenter(bounds).y - rect.height / 2 };\n case 'bottom':\n return { ...rect, y: rectBottom(bounds) - rect.height };\n default:\n throw new AtlasConfigError(`unknown align edge: ${String(edge)}.`);\n }\n });\n}\n\n/**\n * Equalize the gaps between rects along an axis. The outermost rects stay\n * fixed; middle rects move in sorted order along the axis. Fewer than three\n * rects are returned as copies unchanged.\n */\nexport function distributeRects(rects: readonly Rect[], axis: 'x' | 'y'): Rect[] {\n if (rects.length <= 2) return rects.map((rect) => ({ ...rect }));\n const start = axis === 'x' ? (rect: Rect) => rect.x : (rect: Rect) => rect.y;\n const size = axis === 'x' ? (rect: Rect) => rect.width : (rect: Rect) => rect.height;\n const order = rects\n .map((rect, index) => ({ index, rect }))\n .sort((a, b) => start(a.rect) - start(b.rect) || a.index - b.index);\n const first = order[0].rect;\n const last = order[order.length - 1].rect;\n const totalSpan = start(last) + size(last) - start(first);\n const totalSize = order.reduce((sum, entry) => sum + size(entry.rect), 0);\n const gap = (totalSpan - totalSize) / (order.length - 1);\n const result = rects.map((rect) => ({ ...rect }));\n let cursor = start(first);\n for (const entry of order) {\n const moved = { ...entry.rect };\n if (axis === 'x') moved.x = cursor;\n else moved.y = cursor;\n result[entry.index] = moved;\n cursor += size(entry.rect) + gap;\n }\n return result;\n}\n","import { AtlasConfigError } from './errors.js';\nimport { containsRect, inflateRect, rectsIntersect } from './rect.js';\nimport type { Point, Rect } from './shapes.js';\n\nexport type SpatialIndexOptions = Readonly<{\n /** Maximum children per node before a split. Default 8. */\n maxEntriesPerNode?: number;\n}>;\n\nexport type SpatialQueryOptions = Readonly<{\n /** Expand the query point into a box of this half-size. Default 0. */\n tolerance?: number;\n}>;\n\n/**\n * A Map-like index over ids and their bounding rects. The index stores only\n * geometry — the caller owns the data and looks it up from returned ids —\n * so stored values can never go stale.\n */\nexport type SpatialIndex<K = string> = Readonly<{\n /** Insert `id`, or move it to `rect` when it already exists. */\n set(id: K, rect: Rect): void;\n delete(id: K): boolean;\n /** Current rect for `id`, or undefined. */\n get(id: K): Rect | undefined;\n has(id: K): boolean;\n clear(): void;\n readonly size: number;\n /** Bounding box of all entries; null when empty. */\n readonly bounds: Rect | null;\n /** Ids whose rect overlaps or touches `rect`. */\n queryRect(rect: Rect): K[];\n /** Ids whose rect contains `point`, or comes within `tolerance` of it. */\n queryPoint(point: Point, options?: SpatialQueryOptions): K[];\n}>;\n\ninterface LeafEntry<K> {\n id: K;\n rect: Rect;\n}\n\ntype Leaf<K> = { children: LeafEntry<K>[]; leaf: true; rect: Rect | null };\ntype Branch<K> = { children: Node<K>[]; leaf: false; rect: Rect | null };\ntype Node<K> = Leaf<K> | Branch<K>;\n\nfunction rectOf<K>(node: Node<K> | LeafEntry<K>): Rect {\n return node.rect as Rect;\n}\n\nfunction unionRects(a: Rect, b: Rect): Rect {\n const x = Math.min(a.x, b.x);\n const y = Math.min(a.y, b.y);\n return {\n height: Math.max(a.y + a.height, b.y + b.height) - y,\n width: Math.max(a.x + a.width, b.x + b.width) - x,\n x,\n y,\n };\n}\n\nfunction area(rect: Rect): number {\n return rect.width * rect.height;\n}\n\nfunction rectsEqual(a: Rect, b: Rect): boolean {\n return a.x === b.x && a.y === b.y && a.width === b.width && a.height === b.height;\n}\n\nfunction recompute<K>(node: Node<K>): void {\n let rect: Rect | null = null;\n for (const child of node.children) {\n rect = rect === null ? { ...rectOf(child) } : unionRects(rect, rectOf(child));\n }\n node.rect = rect;\n}\n\n/**\n * Dynamic R-tree (Guttman, quadratic split) over axis-aligned rectangles:\n * O(log n) rect and point queries for hit-testing, marquee selection, and\n * viewport culling over thousands of items. Rect intersection uses closed\n * intervals, so zero-area entries (lines, points) are findable.\n */\nexport function createSpatialIndex<K = string>(options: SpatialIndexOptions = {}): SpatialIndex<K> {\n const maxEntries = options.maxEntriesPerNode ?? 8;\n if (!Number.isInteger(maxEntries) || maxEntries < 4) {\n throw new AtlasConfigError(`maxEntriesPerNode must be an integer >= 4, received ${maxEntries}`);\n }\n const minEntries = Math.max(2, Math.ceil(maxEntries / 3));\n const entries = new Map<K, LeafEntry<K>>();\n let root: Node<K> = { children: [], leaf: true, rect: null };\n\n const pickChild = (node: Branch<K>, rect: Rect): Node<K> => {\n let best: Node<K> | null = null;\n let bestEnlargement = Infinity;\n let bestArea = Infinity;\n for (const child of node.children) {\n const current = child.rect ?? rect;\n const enlargement = area(unionRects(current, rect)) - area(current);\n if (enlargement < bestEnlargement || (enlargement === bestEnlargement && area(current) < bestArea)) {\n best = child;\n bestEnlargement = enlargement;\n bestArea = area(current);\n }\n }\n return best as Node<K>;\n };\n\n const split = (node: Node<K>): [Node<K>, Node<K>] => {\n const items = node.children;\n // Quadratic pick-seeds: the pair wasting the most area when combined.\n let si = 0;\n let sj = 1;\n let worst = -Infinity;\n for (let i = 0; i < items.length; i++) {\n for (let j = i + 1; j < items.length; j++) {\n const waste =\n area(unionRects(rectOf(items[i]), rectOf(items[j]))) - area(rectOf(items[i])) - area(rectOf(items[j]));\n if (waste > worst) {\n worst = waste;\n si = i;\n sj = j;\n }\n }\n }\n const groupA: Array<Node<K> | LeafEntry<K>> = [items[si]];\n const groupB: Array<Node<K> | LeafEntry<K>> = [items[sj]];\n let rectA = rectOf(items[si]);\n let rectB = rectOf(items[sj]);\n const remaining = items.filter((_, index) => index !== si && index !== sj);\n for (const [index, item] of remaining.entries()) {\n // Force distribution so neither group can exceed maxEntries or fall below minEntries.\n const mustA =\n groupA.length + (remaining.length - index) > maxEntries ||\n groupB.length + (remaining.length - index) - 1 < minEntries;\n const mustB =\n groupB.length + (remaining.length - index) > maxEntries ||\n groupA.length + (remaining.length - index) - 1 < minEntries;\n let toA: boolean;\n if (mustA) toA = true;\n else if (mustB) toA = false;\n else {\n const enlargeA = area(unionRects(rectA, rectOf(item))) - area(rectA);\n const enlargeB = area(unionRects(rectB, rectOf(item))) - area(rectB);\n toA = enlargeA < enlargeB || (enlargeA === enlargeB && area(rectA) <= area(rectB));\n }\n if (toA) {\n groupA.push(item);\n rectA = unionRects(rectA, rectOf(item));\n } else {\n groupB.push(item);\n rectB = unionRects(rectB, rectOf(item));\n }\n }\n const a = (\n node.leaf\n ? { children: groupA as LeafEntry<K>[], leaf: true, rect: null }\n : { children: groupA as Node<K>[], leaf: false, rect: null }\n ) as Node<K>;\n const b = (\n node.leaf\n ? { children: groupB as LeafEntry<K>[], leaf: true, rect: null }\n : { children: groupB as Node<K>[], leaf: false, rect: null }\n ) as Node<K>;\n recompute(a);\n recompute(b);\n return [a, b];\n };\n\n /** Insert `item` under `node`; returns the split pair when `node` overflows. */\n const insertInto = (node: Node<K>, item: Node<K> | LeafEntry<K>): [Node<K>, Node<K>] | null => {\n if (node.leaf) {\n node.children.push(item as LeafEntry<K>);\n node.rect = node.rect === null ? { ...rectOf(item) } : unionRects(node.rect, rectOf(item));\n if (node.children.length > maxEntries) return split(node);\n return null;\n }\n const branch = node as Branch<K>;\n const child = pickChild(branch, rectOf(item));\n const overflow = insertInto(child, item);\n recompute(node);\n if (overflow) {\n const index = branch.children.indexOf(child);\n branch.children.splice(index, 1, overflow[0], overflow[1]);\n recompute(node);\n }\n if (node.children.length > maxEntries) return split(node);\n return null;\n };\n\n const insertEntry = (entry: LeafEntry<K>): void => {\n // A fully emptied root stays as an empty branch after removals; revive it as a leaf.\n if (!root.leaf && root.children.length === 0) {\n root = { children: [], leaf: true, rect: null };\n }\n const overflow = insertInto(root, entry);\n if (overflow) {\n root = { children: overflow, leaf: false, rect: null };\n recompute(root);\n }\n };\n\n /** Depth-first remove; returns true when `node` became empty. */\n const removeFrom = (node: Node<K>, entry: LeafEntry<K>): boolean => {\n if (node.leaf) {\n const index = node.children.indexOf(entry);\n if (index !== -1) node.children.splice(index, 1);\n recompute(node);\n return node.children.length === 0;\n }\n const branch = node as Branch<K>;\n for (let i = branch.children.length - 1; i >= 0; i--) {\n const child = branch.children[i];\n // Prune by containment, not intersection: a branch rect is the union of\n // its children, so the entry's rect is always contained in the child\n // that holds it.\n if (child.rect && containsRect(child.rect, entry.rect)) {\n if (removeFrom(child, entry)) branch.children.splice(i, 1);\n }\n }\n recompute(node);\n return branch.children.length === 0;\n };\n\n const deleteEntry = (id: K): boolean => {\n const entry = entries.get(id);\n if (!entry) return false;\n entries.delete(id);\n removeFrom(root, entry);\n // Collapse a root branch that ended up with a single child.\n while (!root.leaf && root.children.length === 1) {\n root = root.children[0];\n }\n return true;\n };\n\n const queryInto = (node: Node<K>, hits: (rect: Rect) => boolean, out: K[]): void => {\n if (!node.rect || !hits(node.rect)) return;\n if (node.leaf) {\n for (const entry of node.children) {\n if (hits(entry.rect)) out.push(entry.id);\n }\n return;\n }\n for (const child of (node as Branch<K>).children) queryInto(child, hits, out);\n };\n\n return {\n get bounds() {\n return root.rect;\n },\n clear() {\n entries.clear();\n root = { children: [], leaf: true, rect: null };\n },\n delete: deleteEntry,\n get(id) {\n return entries.get(id)?.rect;\n },\n has(id) {\n return entries.has(id);\n },\n queryPoint(point, queryOptions) {\n const tolerance = queryOptions?.tolerance ?? 0;\n if (!(tolerance >= 0)) {\n throw new AtlasConfigError(`tolerance must be a non-negative finite number, received ${tolerance}`);\n }\n // A point is a zero-size box; closed-interval intersection makes it hit\n // rects that merely touch it, so one shared path covers both query kinds.\n const box: Rect = inflateRect({ ...point, height: 0, width: 0 }, tolerance);\n const out: K[] = [];\n queryInto(root, (rect) => rectsIntersect(rect, box), out);\n return out;\n },\n queryRect(rect) {\n const out: K[] = [];\n queryInto(root, (candidate) => rectsIntersect(candidate, rect), out);\n return out;\n },\n set(id, rect) {\n const existing = entries.get(id);\n if (existing) {\n if (rectsEqual(existing.rect, rect)) return;\n deleteEntry(id);\n }\n const entry: LeafEntry<K> = { id, rect: { ...rect } };\n entries.set(id, entry);\n insertEntry(entry);\n },\n get size() {\n return entries.size;\n },\n };\n}\n"],"mappings":"A,oFAAA,IAAa,WAAb,cAAgC,KAAM,CACpC,YAAY,EAAiB,EAAqB,CAChD,MAAMC,EAASC,CAAI,EACnB,KAAK,KAAO,WAAW,KACvB,OAAO,eAAe,KAAM,WAAW,SAAS,CAClD,CACF,EAEa,iBAAb,cAAsC,UAAW,CAAC,ECNrCC,EAAmB,OAAO,OAAO,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,CAAC,EAEhE,SAAgB,SAAS,EAAW,EAAmB,CACrD,MAAO,CACLC,EAAE,GAAKC,EAAE,GAAKD,EAAE,GAAKC,EAAE,GACvBD,EAAE,GAAKC,EAAE,GAAKD,EAAE,GAAKC,EAAE,GACvBD,EAAE,GAAKC,EAAE,GAAKD,EAAE,GAAKC,EAAE,GACvBD,EAAE,GAAKC,EAAE,GAAKD,EAAE,GAAKC,EAAE,GACvBD,EAAE,GAAKC,EAAE,GAAKD,EAAE,GAAKC,EAAE,GAAKD,EAAE,GAC9BA,EAAE,GAAKC,EAAE,GAAKD,EAAE,GAAKC,EAAE,GAAKD,EAAE,EAChC,CACF,CAEA,SAAgB,MAAM,EAAgB,EAAqB,CACzD,MAAO,CACL,EAAGE,EAAO,GAAKC,EAAM,EAAID,EAAO,GAAKC,EAAM,EAAID,EAAO,GACtD,EAAGA,EAAO,GAAKC,EAAM,EAAID,EAAO,GAAKC,EAAM,EAAID,EAAO,EACxD,CACF,CAEA,SAAgB,UAAU,EAAY,EAAoB,CACxD,MAAO,CAAC,EAAG,EAAG,EAAG,EAAGE,EAAIC,CAAE,CAC5B,CAEA,SAAgB,MAAM,EAAY,EAAaC,EAAY,CACzD,MAAO,CAACA,EAAI,EAAG,EAAGC,EAAI,EAAG,CAAC,CAC5B,CAGA,SAAgB,OAAO,EAAyB,CAC9C,IAAMC,EAAM,KAAK,IAAIC,CAAO,EACtBC,EAAM,KAAK,IAAID,CAAO,EAC5B,MAAO,CAACD,EAAKE,EAAK,CAACA,EAAKF,EAAK,EAAG,CAAC,CACnC,CAGA,SAAgB,OAAO,EAAe,EAAwB,CAC5D,OAAO,SAAS,SAAS,UAAUG,EAAO,EAAGA,EAAO,CAAC,EAAGT,CAAM,EAAG,UAAU,CAACS,EAAO,EAAG,CAACA,EAAO,CAAC,CAAC,CAClG,CAGA,SAAgB,QAAQ,EAAwB,CAG9C,OAFW,KAAK,MAAMT,EAAO,GAAIA,EAAO,EAEhC,EADG,KAAK,MAAMA,EAAO,GAAIA,EAAO,EAC3B,GAAM,CACrB,CAGA,SAAgB,YAAY,EAAwB,CAClD,MAAO,UAAUA,EAAO,KAAK,GAAG,EAAE,EACpC,CAGA,SAAgB,OAAO,EAA+B,CACpD,IAAMU,EAAMV,EAAO,GAAKA,EAAO,GAAKA,EAAO,GAAKA,EAAO,GACvD,GAAI,CAAC,OAAO,SAASU,CAAG,GAAKA,IAAQ,EAAG,OAAO,KAC/C,IAAMC,EAAM,EAAID,EAChB,MAAO,CACLV,EAAO,GAAKW,EACZ,CAACX,EAAO,GAAKW,EACb,CAACX,EAAO,GAAKW,EACbX,EAAO,GAAKW,GACXX,EAAO,GAAKA,EAAO,GAAKA,EAAO,GAAKA,EAAO,IAAMW,GACjDX,EAAO,GAAKA,EAAO,GAAKA,EAAO,GAAKA,EAAO,IAAMW,CACpD,CACF,CC/DA,SAAgB,eAAe,EAAsC,CACnE,IAAIC,EAAO,IACPC,EAAO,IACPC,EAAO,KACPC,EAAO,KACPC,EAAQ,GACZ,IAAK,IAAMf,KAASgB,EAClB,EAAQ,GACJhB,EAAM,EAAIW,IAAM,EAAOX,EAAM,GAC7BA,EAAM,EAAIY,IAAM,EAAOZ,EAAM,GAC7BA,EAAM,EAAIa,IAAM,EAAOb,EAAM,GAC7BA,EAAM,EAAIc,IAAM,EAAOd,EAAM,GAGnC,OADKe,EACE,CAAE,OAAQD,EAAOF,EAAM,MAAOC,EAAOF,EAAM,EAAGA,EAAM,EAAGC,CAAK,EADhD,IAErB,CAEA,SAAgB,UAAU,EAAoB,CAC5C,OAAOK,EAAK,EAAIA,EAAK,KACvB,CAEA,SAAgB,WAAW,EAAoB,CAC7C,OAAOA,EAAK,EAAIA,EAAK,MACvB,CAEA,SAAgB,WAAW,EAAmB,CAC5C,MAAO,CAAE,EAAGA,EAAK,EAAIA,EAAK,MAAQ,EAAG,EAAGA,EAAK,EAAIA,EAAK,OAAS,CAAE,CACnE,CAEA,SAAgB,UAAU,EAAS,EAAe,CAChD,IAAMC,EAAI,KAAK,IAAIrB,EAAE,EAAGC,EAAE,CAAC,EACrBqB,EAAI,KAAK,IAAItB,EAAE,EAAGC,EAAE,CAAC,EAC3B,MAAO,CACL,OAAQ,KAAK,IAAI,WAAWD,CAAC,EAAG,WAAWC,CAAC,CAAC,EAAIqB,EACjD,MAAO,KAAK,IAAI,UAAUtB,CAAC,EAAG,UAAUC,CAAC,CAAC,EAAIoB,EAC9C,IACA,GACF,CACF,CAOA,SAAgB,cAAc,EAAS,EAAsB,CAC3D,IAAMA,EAAI,KAAK,IAAIrB,EAAE,EAAGC,EAAE,CAAC,EACrBqB,EAAI,KAAK,IAAItB,EAAE,EAAGC,EAAE,CAAC,EACrBsB,EAAQ,KAAK,IAAI,UAAUvB,CAAC,EAAG,UAAUC,CAAC,CAAC,EAC3CuB,EAAS,KAAK,IAAI,WAAWxB,CAAC,EAAG,WAAWC,CAAC,CAAC,EAEpD,OADIsB,EAAQF,GAAKG,EAASF,EAAU,KAC7B,CAAE,OAAQE,EAASF,EAAG,MAAOC,EAAQF,EAAG,IAAG,GAAE,CACtD,CAEA,SAAgB,aAAa,EAAa,EAAsB,CAC9D,OACEI,EAAM,GAAKC,EAAM,GACjBD,EAAM,GAAKC,EAAM,GACjB,UAAUD,CAAK,GAAK,UAAUC,CAAK,GACnC,WAAWD,CAAK,GAAK,WAAWC,CAAK,CAEzC,CAEA,SAAgB,cAAc,EAAY,EAAuB,CAC/D,OAAOvB,EAAM,GAAKiB,EAAK,GAAKjB,EAAM,GAAK,UAAUiB,CAAI,GAAKjB,EAAM,GAAKiB,EAAK,GAAKjB,EAAM,GAAK,WAAWiB,CAAI,CAC3G,CAGA,SAAgB,YAAY,EAAY,EAAsB,CAC5D,MAAO,CAAE,OAAQA,EAAK,OAASO,EAAS,EAAG,MAAOP,EAAK,MAAQO,EAAS,EAAG,EAAGP,EAAK,EAAIO,EAAQ,EAAGP,EAAK,EAAIO,CAAO,CACpH,CAGA,SAAgB,eAAe,EAAS,EAAkB,CACxD,OAAO,cAAc3B,EAAGC,CAAC,IAAM,IACjC,CCVA,IAAM2B,EAAoC,CACxC,YAAc,GAAW,qBAAqBC,CAAM,EACpD,QAAW,YAAY,IAAI,EAC3B,aAAe,GAAa,sBAAsBC,CAAQ,CAC5D,EAEA,SAAS,aAAa,EAAc,EAAqB,CACvD,GAAI,CAAC,OAAO,SAASC,CAAK,EAAG,MAAM,IAAI,iBAAiB,GAAGC,EAAK,qCAAqCD,GAAO,CAC9G,CAEA,SAAS,UAAU,EAAmB,CACpC,OAAOE,EAAI,GAAM,EAAIA,EAAIA,EAAI,GAAK,GAAKA,EAAI,IAAM,EAAI,CACvD,CAGA,SAAS,eAAe,EAAuB,CAE7C,QADiBC,EAAQ,KAAK,KAAO,EAAI,KAAK,IAC3B,EAAI,KAAK,KAAO,EAAI,KAAK,IAAO,KAAK,EAC1D,CAGA,SAAS,cAAc,EAAc,EAAoB,CACvD,OAAO,eAAeC,EAAKC,CAAI,CACjC,CAGA,SAAS,mBAAmB,EAAc,EAAc,EAAyB,CAC/E,OAAO,MAAM,SAAS,OAAO,CAACC,CAAQ,EAAG,MAAM,EAAIC,CAAI,CAAC,EAAGC,CAAK,CAClE,CAOA,SAAS,SAAS,EAAgB,EAAwB,CAExD,IAAMC,EAAI,SADM,SAAS,MAAMC,EAAE,IAAI,EAAG,OAAOA,EAAE,QAAQ,CACtC,EAAS,UAAU,CAACA,EAAE,EAAG,CAACA,EAAE,CAAC,CAAC,EACjD,OAAO,SAAS,UAAUC,EAAS,MAAQ,EAAGA,EAAS,OAAS,CAAC,EAAGF,CAAC,CACvE,CAMA,SAAS,UAAU,EAAgB,EAAwB,CACzD,IAAMA,EAAI,SAAS,OAAO,CAACC,EAAE,QAAQ,EAAG,MAAM,EAAIA,EAAE,IAAI,CAAC,EACnDR,EAAI,mBAAmB,CAAE,EAAGS,EAAS,MAAQ,EAAG,EAAGA,EAAS,OAAS,CAAE,EAAGD,EAAE,KAAMA,EAAE,QAAQ,EAClG,OAAO,SAAS,UAAUA,EAAE,EAAIR,EAAE,EAAGQ,EAAE,EAAIR,EAAE,CAAC,EAAGO,CAAC,CACpD,CAEA,SAAgB,aAAa,EAAyB,CAAC,EAAW,CAChE,IAAMG,EAAUC,EAAQ,SAAW,IAC7BC,EAAUD,EAAQ,SAAW,IACnC,GAAI,EAAED,EAAU,GAAKA,GAAWE,GAC9B,MAAM,IAAI,iBAAiB,6DAA6DF,EAAQ,OAAOE,GAAS,EAElH,IAAMC,EAAYF,EAAQ,WAAahB,EACjCmB,EAAUH,EAAQ,SAAW,CAAC,EAChCF,EAAiBE,EAAQ,UAAY,CAAE,OAAQ,EAAG,MAAO,CAAE,EAC3DI,EAAqB,CACvB,SAAU,eAAeD,EAAQ,UAAY,CAAC,EAC9C,EAAGA,EAAQ,GAAK,EAChB,EAAGA,EAAQ,GAAK,EAChB,KAAM,KAAK,IAAIF,EAAS,KAAK,IAAIF,EAASI,EAAQ,MAAQ,CAAC,CAAC,CAC9D,EACA,IAAK,GAAM,CAACf,EAAMD,IAAU,CAC1B,CAAC,WAAYiB,EAAM,CAAC,EACpB,CAAC,WAAYA,EAAM,CAAC,EACpB,CAAC,kBAAmBA,EAAM,QAAQ,CACpC,EACE,aAAahB,EAAMD,CAAK,EAG1B,IAAMkB,EAAa,IAAI,gBACnBC,EAAW,GACXC,EAA2D,KACzDC,EAAY,IAAI,IAGlBC,EAA8B,KAC9BC,EAA+B,KAE7B,YACJ,IAAiB,SAASN,EAAON,CAAQ,EAClCW,GAEH,aACJ,IAAkB,UAAUL,EAAON,CAAQ,EACpCY,GAGH,eAAyB,CAC7B,EAAe,KACf,EAAgB,IAClB,EAGM,iBAAoB,IAA+B,CACvD,EAAGC,EAAY,EAAIb,EAAS,MAAQ,EACpC,EAAGa,EAAY,EAAIb,EAAS,OAAS,CACvC,GAEM,SAAmB,CACvB,IAAK,IAAMc,IAAY,CAAC,GAAGJ,CAAS,EAAGI,EAASR,CAAK,CACvD,EAEM,IAAO,GAAqC,CAChD,GAAIE,EAAU,OACd,IAAMO,EAAyB,CAC7B,SAAU,eAAeC,EAAK,UAAYV,EAAM,QAAQ,EACxD,EAAGU,EAAK,GAAKV,EAAM,EACnB,EAAGU,EAAK,GAAKV,EAAM,EACnB,KAAM,KAAK,IAAIH,EAAS,KAAK,IAAIF,EAASe,EAAK,MAAQV,EAAM,IAAI,CAAC,CACpE,GAEES,EAAU,IAAMT,EAAM,GACtBS,EAAU,IAAMT,EAAM,GACtBS,EAAU,OAAST,EAAM,MACzBS,EAAU,WAAaT,EAAM,YAI/B,EAAQS,EACR,WAAW,EACX,KAAK,EACP,EAGM,SAAmB,CACvB,AAGAN,KAFAL,EAAU,YAAYK,EAAU,KAAK,EACrCA,EAAU,QAAQ,EACN,KACd,EAEM,YAAsB,CACtBD,IACJ,EAAW,GACX,KAAK,EACLE,EAAU,MAAM,EAChBH,EAAW,MAAM,EACnB,EAEM,WAAkC,EAAQ,EAAiB,CAAC,IAAM,CAEtE,GADA,KAAK,EACDC,EAAU,OACd,IAAMS,EAAWC,EAAe,UAAY,IACtCC,EAASD,EAAe,QAAU,UAClCE,EAASF,EAAe,OAC9B,GAAIE,GAAQ,QAAS,OACrB,GAAIH,GAAY,EAAG,CACjB,IAAII,CAAM,EACV,MACF,CACA,IAAM3B,EAAOY,EACPb,EAAkB,CACtB,SAAUC,EAAK,SAAW,cAAcA,EAAK,SAAU2B,EAAO,UAAYf,EAAM,QAAQ,EACxF,EAAGe,EAAO,GAAKf,EAAM,EACrB,EAAGe,EAAO,GAAKf,EAAM,EACrB,KAAM,KAAK,IAAIH,EAAS,KAAK,IAAIF,EAASoB,EAAO,MAAQf,EAAM,IAAI,CAAC,CACtE,EACMgB,EAAQlB,EAAU,IAAI,EAEtBmB,EAAU,KAAK,IAAI7B,EAAK,IAAI,EAC5B8B,EAAQ,KAAK,IAAI/B,EAAG,IAAI,EACxBgC,EAAQ,CAAE,YAAe,CAAC,EAAG,MAAO,CAAE,EAC5C,EAAYA,EACZ,IAAM,UAAoB,CACpBhB,IAAcgB,GAClB,KAAK,CACP,EACIL,IACFA,EAAO,iBAAiB,QAAS,MAAO,CAAE,KAAM,EAAK,CAAC,EACtD,EAAM,YAAgBA,EAAO,oBAAoB,QAAS,KAAK,GAEjE,IAAM,KAAQ,GAAuB,CACnC,GAAIX,IAAcgB,EAAO,OACzB,IAAM,EAAI,KAAK,IAAI,GAAIC,EAAOJ,GAASL,CAAQ,EACzCU,EAAIR,EAAO,CAAC,EAClB,IAAI,CACF,SAAUzB,EAAK,UAAYD,EAAG,SAAWC,EAAK,UAAYiC,EAC1D,EAAGjC,EAAK,GAAKD,EAAG,EAAIC,EAAK,GAAKiC,EAC9B,EAAGjC,EAAK,GAAKD,EAAG,EAAIC,EAAK,GAAKiC,EAC9B,KAAM,KAAK,IAAIJ,GAAWC,EAAQD,GAAWI,CAAC,CAChD,CAAC,EACG,GAAK,GACP,EAAY,KACZF,EAAM,QAAQ,GAGhB,EAAM,MAAQrB,EAAU,aAAa,IAAI,CAC3C,EACA,EAAM,MAAQA,EAAU,aAAa,IAAI,CAC3C,EAEA,MAAO,CACL,UACA,IAAI,gBAAiB,CACnB,OAAOG,EAAW,MACpB,EACA,QACA,IAAI,UAAW,CACb,OAAOC,CACT,EACA,UAAU,EAAQ,EAAa,CAAC,EAAG,CACjC,GAAIA,EAAU,OACd,KAAK,EACL,IAAMoB,EAAUC,EAAW,SAAW,EAChCC,EAAiB,KAAK,IAAI,EAAG9B,EAAS,MAAQ4B,EAAU,CAAC,EACzDG,EAAkB,KAAK,IAAI,EAAG/B,EAAS,OAAS4B,EAAU,CAAC,EAC3DhC,EAAO,KAAK,IAChBO,EACA,KAAK,IACHF,EACA,KAAK,IACH+B,EAAO,QAAU,EAAI7B,EAAU2B,EAAiBE,EAAO,MACvDA,EAAO,SAAW,EAAI7B,EAAU4B,EAAkBC,EAAO,MAC3D,CACF,CACF,EAGA,IAAI,CAAE,EAAGA,EAAO,EAAIA,EAAO,MAAQ,EAAG,EAAGA,EAAO,EAAIA,EAAO,OAAS,EAAG,MAAK,CAAC,CAC/E,EACA,IAAI,SAAU,CACZ,OAAO,QAAQ,CACjB,EACA,IAAI,QAAS,CACX,OAAO,OAAO,CAChB,EACA,MAAM,EAAI,EAAI,CACZ,GAAIxB,EAAU,OACd,KAAK,EAEL,IAAMyB,EAAS,mBAAmB,CAAE,EAAGC,EAAI,EAAGC,CAAG,EAAG7B,EAAM,KAAMA,EAAM,QAAQ,EAC9E,IAAI,CAAE,EAAGA,EAAM,EAAI2B,EAAO,EAAG,EAAG3B,EAAM,EAAI2B,EAAO,CAAE,CAAC,CACtD,EACA,OAAO,EAAM,CACPzB,IACA4B,EAAK,QAAUpC,EAAS,OAASoC,EAAK,SAAWpC,EAAS,UAC9D,EAAW,CAAE,OAAQoC,EAAK,OAAQ,MAAOA,EAAK,KAAM,EAGpD,WAAW,EACX,KAAK,EACP,EACA,SAAS,EAAa,EAAO,CAC3B,GAAI5B,EAAU,OACd,KAAK,EACL,IAAM6B,EAAQ,MAAM,QAAQ,EAAGxB,CAAW,EAEpClB,EAAWW,EAAM,SAAWT,EAC5BoC,EAAS,mBAAmB,iBAAiBpB,CAAW,EAAGP,EAAM,KAAMX,CAAQ,EACrF,IAAI,CAAE,WAAU,EAAG0C,EAAM,EAAIJ,EAAO,EAAG,EAAGI,EAAM,EAAIJ,EAAO,CAAE,CAAC,CAChE,EACA,IAAI,EAAQ,CACV,KAAK,EACL,IAAIZ,CAAM,CACZ,GACC,OAAO,SAAU,QAClB,IAAI,OAAQ,CACV,OAAOf,CACT,EACA,KACA,UAAU,EAAU,EAAkB,CAIpC,OAHIE,GAAY8B,GAAkB,QAAQ,YAAsB,CAAC,GACjE5B,EAAU,IAAII,CAAQ,EACtBwB,GAAkB,QAAQ,iBAAiB,YAAe5B,EAAU,OAAOI,CAAQ,EAAG,CAAE,KAAM,EAAK,CAAC,MACvFJ,EAAU,OAAOI,CAAQ,EACxC,EACA,SAAS,EAAO,CACd,OAAO,MAAM,OAAO,EAAGrD,CAAK,CAC9B,EACA,QAAQ,EAAO,CACb,OAAO,MAAM,QAAQ,EAAGA,CAAK,CAC/B,EACA,IAAI,UAAW,CACb,OAAOuC,CACT,EACA,IAAI,aAAc,CAChB,IAAMP,EAAK,QAAQ,EAQnB,OAAO,eAAe,CANpB,MAAMA,EAAI,CAAE,EAAG,EAAG,EAAG,CAAE,CAAC,EACxB,MAAMA,EAAI,CAAE,EAAGO,EAAS,MAAO,EAAG,CAAE,CAAC,EACrC,MAAMP,EAAI,CAAE,EAAG,EAAG,EAAGO,EAAS,MAAO,CAAC,EACtC,MAAMP,EAAI,CAAE,EAAGO,EAAS,MAAO,EAAGA,EAAS,MAAO,CAAC,CAG/B,CAAO,CAC/B,EACA,OAAO,EAAa,EAAQ,CAC1B,GAAI,CAAC,OAAO,SAASuC,CAAM,GAAKA,GAAU,EACxC,MAAM,IAAI,iBAAiB,4DAA4DA,GAAQ,EAEjG,GAAI/B,EAAU,OACd,KAAK,EACL,IAAM6B,EAAQ,MAAM,QAAQ,EAAGxB,CAAW,EACpCjB,EAAO,KAAK,IAAIO,EAAS,KAAK,IAAIF,EAASK,EAAM,KAAOiC,CAAM,CAAC,EAE/DN,EAAS,mBAAmB,iBAAiBpB,CAAW,EAAGjB,EAAMU,EAAM,QAAQ,EACrF,IAAI,CAAE,EAAG+B,EAAM,EAAIJ,EAAO,EAAG,EAAGI,EAAM,EAAIJ,EAAO,EAAG,MAAK,CAAC,CAC5D,CACF,CACF,CC7WA,SAAgB,eAAe,EAA2B,EAAuB,CAC/E,IAAIO,EAAS,GACPC,EAAIC,EAAQ,OAClB,IAAK,IAAI,EAAI,EAAGC,EAAIF,EAAI,EAAG,EAAIA,EAAG,EAAI,IAAK,CACzC,IAAMnF,EAAIoF,EAAQ,GACZnF,EAAImF,EAAQC,GAElB,GADgBrF,EAAE,EAAIG,EAAM,GAAMF,EAAE,EAAIE,EAAM,EAChC,SACd,IAAMmF,GAASrF,EAAE,EAAID,EAAE,IAAMG,EAAM,EAAIH,EAAE,IAAOC,EAAE,EAAID,EAAE,GAAKA,EAAE,EAC3DG,EAAM,EAAImF,IAAM,EAAS,CAACJ,EAChC,CACA,OAAOA,CACT,CAEA,SAAS,kBAAkB,EAAc,EAAU,EAAkB,CACnE,IAAMN,EAAK3E,EAAE,EAAID,EAAE,EACb6E,EAAK5E,EAAE,EAAID,EAAE,EACbuF,EAAWX,EAAKA,EAAKC,EAAKA,EAChC,GAAIU,IAAa,EAAG,OAAO,KAAK,MAAMpF,EAAM,EAAIH,EAAE,EAAGG,EAAM,EAAIH,EAAE,CAAC,EAClE,IAAIiC,IAAM9B,EAAM,EAAIH,EAAE,GAAK4E,GAAMzE,EAAM,EAAIH,EAAE,GAAK6E,GAAMU,EAExD,MADA,GAAI,KAAK,IAAI,EAAG,KAAK,IAAI,EAAGtD,CAAC,CAAC,EACvB,KAAK,MAAM9B,EAAM,GAAKH,EAAE,EAAIiC,EAAI2C,GAAKzE,EAAM,GAAKH,EAAE,EAAIiC,EAAI4C,EAAG,CACtE,CAOA,SAAgB,mBAAmB,EAAwB,EAAsB,CAC/E,GAAIW,EAAK,SAAW,EAAG,MAAO,KAC9B,GAAIA,EAAK,SAAW,EAAG,OAAO,KAAK,MAAMrF,EAAM,EAAIqF,EAAK,EAAE,CAAC,EAAGrF,EAAM,EAAIqF,EAAK,EAAE,CAAC,CAAC,EACjF,IAAIC,EAAO,IACX,IAAK,IAAIC,EAAI,EAAGL,EAAI,EAAGA,EAAIG,EAAK,OAAQ,EAAI,IAAK,CAC/C,IAAMG,EAAI,kBAAkBxF,EAAOqF,EAAKE,GAAIF,EAAKH,EAAE,EAC/CM,EAAIF,IAAM,EAAOE,EACvB,CACA,OAAOF,CACT,CAMA,SAAgB,iBAAiB,EAA2B,EAAc,EAA4B,CACpG,GAAI,EAAEG,GAAa,GACjB,MAAM,IAAI,iBAAiB,4DAA4D,OAAOA,CAAS,EAAE,EAAE,EAI7G,OADI,mBADWR,EAAQ,OAAS,EAAI,CAAC,GAAGA,EAASA,EAAQ,EAAE,EAAIA,EAChCjF,CAAK,GAAKyF,GAClC,eAAeR,EAASjF,CAAK,CACtC,CCXA,SAAS,SAAS,EAAsB,CACtC,MAAO,CAACiB,EAAK,EAAGA,EAAK,EAAIA,EAAK,MAAQ,EAAG,UAAUA,CAAI,CAAC,CAC1D,CAEA,SAAS,SAAS,EAAsB,CACtC,MAAO,CAACA,EAAK,EAAGA,EAAK,EAAIA,EAAK,OAAS,EAAG,WAAWA,CAAI,CAAC,CAC5D,CAeA,SAAS,aAAa,EAA4B,EAA4B,EAAoC,CAChH,IAAIqE,EAAwB,KAC5B,IAAK,IAAM9E,KAAUkF,EACnB,IAAK,IAAM9B,KAAU+B,EAAS,CAC5B,IAAMvD,EAAQwB,EAAO,MAAQpD,EACzB,KAAK,IAAI4B,CAAK,EAAIwD,IAClBN,IAAS,MAAQ,KAAK,IAAIlD,CAAK,EAAI,KAAK,IAAIkD,EAAK,KAAK,KACxD,EAAO,CAAE,QAAO,KAAM1B,EAAO,KAAM,SAAUA,EAAO,KAAM,EAE9D,CAEF,OAAO0B,CACT,CAEA,SAAS,YAAY,EAAa,EAAa,EAA6B,EAA6B,CACvG,GAAIO,IAAY,IAAA,IAAa,CAAC,OAAO,SAASA,CAAO,GAAKA,GAAW,EAAG,MAAO,CAAC,EAChF,IAAMF,EAAoB,CAAC,EAC3B,IAAK,IAAIG,EAAO,KAAK,OAAOC,EAAMH,GAAaC,CAAO,EAAIA,EAASC,GAAQE,EAAMJ,EAAW,GAAQC,EAClGF,EAAQ,KAAK,CAAE,KAAM,OAAQ,MAAOG,CAAK,CAAC,EAE5C,OAAOH,CACT,CAEA,SAAS,QACP,EACA,EACA,EACA,EAC8B,CAC9B,IAAMM,EAAmB,CAAC,EAC1B,IAAK,IAAM3C,KAAa4C,GACNC,IAAS,IAAM,SAAS7C,CAAS,EAAI,SAASA,CAAS,EAAA,CAC3D,KAAM,GAAW9C,IAAW4F,CAAQ,GAAGH,EAAS,KAAK3C,CAAS,EAM5E,IAAMiB,EAAS,eAJS,CAAC8B,EAAO,GAAGJ,CAAQ,CAAC,CAAC,QAAS,GAAS,CAC7D,CAAE,EAAGhF,EAAK,EAAG,EAAGA,EAAK,CAAE,EACvB,CAAE,EAAG,UAAUA,CAAI,EAAG,EAAG,WAAWA,CAAI,CAAE,CAC5C,CAC8B,CAAM,GAAK,CAAE,OAAQ,EAAG,MAAO,EAAG,EAAGmF,EAAU,EAAGA,CAAS,EACzF,OAAOD,IAAS,IAAM,CAAE,KAAM5B,EAAO,EAAG,GAAI,WAAWA,CAAM,CAAE,EAAI,CAAE,KAAMA,EAAO,EAAG,GAAI,UAAUA,CAAM,CAAE,CAC7G,CAGA,SAAS,sBAAsB,EAAS,EAAS,EAA0B,CACzE,OAAO4B,IAAS,IAAMtG,EAAE,EAAI,WAAWC,CAAC,GAAKA,EAAE,EAAI,WAAWD,CAAC,EAAIA,EAAE,EAAI,UAAUC,CAAC,GAAKA,EAAE,EAAI,UAAUD,CAAC,CAC5G,CAQA,SAAS,gBACP,EACA,EACA,EACA,EAC+G,CAC/G,IAAMgE,EAAQsC,IAAS,IAAO,GAAYG,EAAE,EAAK,GAAYA,EAAE,EACzDC,EAAMJ,IAAS,IAAO,GAAY,UAAUG,CAAC,EAAK,GAAY,WAAWA,CAAC,EAC5EE,EAAU,KACVC,EAAa,IACjB,IAAK,IAAMnD,KAAa4C,EACjB,sBAAsBjF,EAAMqC,EAAW6C,CAAI,IAC5CI,EAAIjD,CAAS,GAAKO,EAAM5C,CAAI,GAAKsF,EAAIjD,CAAS,EAAIkD,IAAS,EAAUD,EAAIjD,CAAS,GAClFO,EAAMP,CAAS,GAAKiD,EAAItF,CAAI,GAAK4C,EAAMP,CAAS,EAAImD,IAAY,EAAa5C,EAAMP,CAAS,IAElG,GAAIkD,IAAY,MAAaC,IAAe,IAAU,OAAO,KAC7D,IAAMC,EAAOD,EAAaD,GAAWL,IAAS,IAAMlF,EAAK,MAAQA,EAAK,QACtE,GAAIyF,EAAO,EAAG,OAAO,KAErB,IAAMtE,EADQoE,EAAUE,EAAO,EACT7C,EAAM5C,CAAI,EAChC,GAAI,KAAK,IAAImB,CAAK,EAAIwD,EAAW,OAAO,KACxC,IAAMe,EAAMD,EAAO,EACnB,MAAO,CACL,QACA,MAAO,CAACF,EAAUG,EAAM,EAAGF,EAAaE,EAAM,CAAC,EAG/C,SAAUR,IAAS,IAAM,WAAWlF,CAAI,CAAC,CAAC,EAAI,WAAWA,CAAI,CAAC,CAAC,EAC/D,KAAM,CAACuF,EAASC,CAAU,CAC5B,CACF,CASA,SAAgB,SAAS,EAAY,EAAkC,CACrE,GAAM,CAAE,aAAY,OAAM,UAAS,aAAchE,EACjD,GAAI,EAAEmD,GAAa,GACjB,MAAM,IAAI,iBAAiB,4DAA4D,OAAOA,CAAS,EAAE,EAAE,EAE7G,IAAIgB,EAAS3F,EAAK,EACd4F,EAAS5F,EAAK,EACZmB,EAAQ,CAAE,EAAG,EAAG,EAAG,CAAE,EAErB0E,EAAqBZ,EAAW,QAAS,GAC7C,SAAS5C,CAAS,CAAC,CAAC,IAAK,IAAmB,CAAE,KAAM,SAAU,OAAM,EAAE,CACxE,EACAwD,EAAS,KAAK,GAAG,YAAY7F,EAAK,EAAG,UAAUA,CAAI,EAAG8F,GAAM,EAAGnB,CAAS,CAAC,EACzE,IAAMoB,EAAQ,aAAa,SAAS/F,CAAI,EAAG6F,EAAUlB,CAAS,EAC1DoB,IAAU,OACZ,EAAM,EAAIA,EAAM,MAChB,GAAUA,EAAM,OAGlB,IAAMC,EAAqBf,EAAW,QAAS,GAC7C,SAAS5C,CAAS,CAAC,CAAC,IAAK,IAAmB,CAAE,KAAM,SAAU,OAAM,EAAE,CACxE,EACA2D,EAAS,KAAK,GAAG,YAAYhG,EAAK,EAAG,WAAWA,CAAI,EAAG8F,GAAM,EAAGnB,CAAS,CAAC,EAC1E,IAAMsB,EAAQ,aAAa,SAASjG,CAAI,EAAGgG,EAAUrB,CAAS,EAC1DsB,IAAU,OACZ,EAAM,EAAIA,EAAM,MAChB,GAAUA,EAAM,OAIlB,IAAMC,EAAkB,CAAE,GAAGlG,EAAM,EAAG2F,EAAQ,EAAGC,CAAO,EAClDO,EAAsB,CAAC,EAC7B,GAAIJ,IAAU,KAAM,CAClB,IAAMK,EAAO,QAAQL,EAAM,SAAUG,EAAWjB,EAAY,GAAG,EAC/DkB,EAAO,KAAK,CAAE,KAAM,IAAK,KAAMC,EAAK,KAAM,KAAML,EAAM,KAAM,SAAUA,EAAM,SAAU,GAAIK,EAAK,EAAG,CAAC,CACrG,CACA,GAAIH,IAAU,KAAM,CAClB,IAAMG,EAAO,QAAQH,EAAM,SAAUC,EAAWjB,EAAY,GAAG,EAC/DkB,EAAO,KAAK,CAAE,KAAM,IAAK,KAAMC,EAAK,KAAM,KAAMH,EAAM,KAAM,SAAUA,EAAM,SAAU,GAAIG,EAAK,EAAG,CAAC,CACrG,CAKA,GAAIxB,EAAS,CACX,GAAImB,IAAU,KAAM,CAClB,IAAML,EAAM,gBAAgBQ,EAAWjB,EAAY,IAAKN,CAAS,EAC7De,IAAQ,OACV,EAAM,EAAIA,EAAI,MACdS,EAAO,KAAK,CACV,KAAM,IACN,KAAMT,EAAI,KAAK,GACf,KAAM,UACN,MAAOA,EAAI,MACX,SAAUA,EAAI,SACd,GAAIA,EAAI,KAAK,EACf,CAAC,EAEL,CACA,GAAIO,IAAU,KAAM,CAClB,IAAMP,EAAM,gBAAgBQ,EAAWjB,EAAY,IAAKN,CAAS,EAC7De,IAAQ,OACV,EAAM,EAAIA,EAAI,MACdS,EAAO,KAAK,CACV,KAAM,IACN,KAAMT,EAAI,KAAK,GACf,KAAM,UACN,MAAOA,EAAI,MACX,SAAUA,EAAI,SACd,GAAIA,EAAI,KAAK,EACf,CAAC,EAEL,CACF,CACA,MAAO,CAAE,QAAO,QAAO,CACzB,CASA,SAAgB,WAAW,EAAwB,EAAyB,CAC1E,GAAIW,EAAM,SAAW,EAAG,MAAO,CAAC,EAChC,IAAM/C,EAAS,eACb+C,EAAM,QAAS,GAAS,CACtB,CAAE,EAAGrG,EAAK,EAAG,EAAGA,EAAK,CAAE,EACvB,CAAE,EAAG,UAAUA,CAAI,EAAG,EAAG,WAAWA,CAAI,CAAE,CAC5C,CAAC,CACH,EAEA,OADIsD,IAAW,KAAa,CAAC,EACtB+C,EAAM,IAAK,GAAS,CACzB,OAAQC,EAAR,CACE,IAAK,OACH,MAAO,CAAE,GAAGtG,EAAM,EAAGsD,EAAO,CAAE,EAChC,IAAK,oBACH,MAAO,CAAE,GAAGtD,EAAM,EAAG,WAAWsD,CAAM,CAAC,CAAC,EAAItD,EAAK,MAAQ,CAAE,EAC7D,IAAK,QACH,MAAO,CAAE,GAAGA,EAAM,EAAG,UAAUsD,CAAM,EAAItD,EAAK,KAAM,EACtD,IAAK,MACH,MAAO,CAAE,GAAGA,EAAM,EAAGsD,EAAO,CAAE,EAChC,IAAK,kBACH,MAAO,CAAE,GAAGtD,EAAM,EAAG,WAAWsD,CAAM,CAAC,CAAC,EAAItD,EAAK,OAAS,CAAE,EAC9D,IAAK,SACH,MAAO,CAAE,GAAGA,EAAM,EAAG,WAAWsD,CAAM,EAAItD,EAAK,MAAO,EACxD,QACE,MAAM,IAAI,iBAAiB,uBAAuB,OAAOsG,CAAI,EAAE,EAAE,CACrE,CACF,CAAC,CACH,CAOA,SAAgB,gBAAgB,EAAwB,EAAyB,CAC/E,GAAID,EAAM,QAAU,EAAG,OAAOA,EAAM,IAAK,IAAU,CAAE,GAAGrG,CAAK,EAAE,EAC/D,IAAM4C,EAAQsC,IAAS,IAAO,GAAelF,EAAK,EAAK,GAAeA,EAAK,EACrE0D,EAAOwB,IAAS,IAAO,GAAelF,EAAK,MAAS,GAAeA,EAAK,OACxEuG,EAAQF,EACX,KAAK,EAAM,KAAW,CAAE,QAAO,MAAK,EAAE,CAAC,CACvC,MAAM,EAAG,IAAMzD,EAAMhE,EAAE,IAAI,EAAIgE,EAAM/D,EAAE,IAAI,GAAKD,EAAE,MAAQC,EAAE,KAAK,EAC9D2H,EAAQD,EAAM,EAAE,CAAC,KACjBE,EAAOF,EAAMA,EAAM,OAAS,EAAE,CAAC,KAG/Bb,GAFY9C,EAAM6D,CAAI,EAAI/C,EAAK+C,CAAI,EAAI7D,EAAM4D,CAAK,EACtCD,EAAM,QAAQ,EAAK,IAAUG,EAAMhD,EAAKiD,EAAM,IAAI,EAAG,CAC9C,IAAcJ,EAAM,OAAS,GAChDK,EAASP,EAAM,IAAK,IAAU,CAAE,GAAGrG,CAAK,EAAE,EAC5C6G,EAASjE,EAAM4D,CAAK,EACxB,IAAK,IAAMG,KAASJ,EAAO,CACzB,IAAMnB,EAAQ,CAAE,GAAGuB,EAAM,IAAK,EAC1BzB,IAAS,IAAK,EAAM,EAAI2B,EACvB,EAAM,EAAIA,EACf,EAAOF,EAAM,OAASvB,EACtB,GAAU1B,EAAKiD,EAAM,IAAI,EAAIjB,CAC/B,CACA,OAAOkB,CACT,CChQA,SAAS,OAAU,EAAoC,CACrD,OAAOE,EAAK,IACd,CAEA,SAAS,WAAW,EAAS,EAAe,CAC1C,IAAM7G,EAAI,KAAK,IAAIrB,EAAE,EAAGC,EAAE,CAAC,EACrBqB,EAAI,KAAK,IAAItB,EAAE,EAAGC,EAAE,CAAC,EAC3B,MAAO,CACL,OAAQ,KAAK,IAAID,EAAE,EAAIA,EAAE,OAAQC,EAAE,EAAIA,EAAE,MAAM,EAAIqB,EACnD,MAAO,KAAK,IAAItB,EAAE,EAAIA,EAAE,MAAOC,EAAE,EAAIA,EAAE,KAAK,EAAIoB,EAChD,IACA,GACF,CACF,CAEA,SAAS,KAAK,EAAoB,CAChC,OAAOD,EAAK,MAAQA,EAAK,MAC3B,CAEA,SAAS,WAAW,EAAS,EAAkB,CAC7C,OAAOpB,EAAE,IAAMC,EAAE,GAAKD,EAAE,IAAMC,EAAE,GAAKD,EAAE,QAAUC,EAAE,OAASD,EAAE,SAAWC,EAAE,MAC7E,CAEA,SAAS,UAAa,EAAqB,CACzC,IAAImB,EAAoB,KACxB,IAAK,IAAM+G,KAASD,EAAK,SACvB,EAAO9G,IAAS,KAAO,CAAE,GAAG,OAAO+G,CAAK,CAAE,EAAI,WAAW/G,EAAM,OAAO+G,CAAK,CAAC,EAE9E,EAAK,KAAO/G,CACd,CAQA,SAAgB,mBAA+B,EAA+B,CAAC,EAAoB,CACjG,IAAMgH,EAAaxF,EAAQ,mBAAqB,EAChD,GAAI,CAAC,OAAO,UAAUwF,CAAU,GAAKA,EAAa,EAChD,MAAM,IAAI,iBAAiB,uDAAuDA,GAAY,EAEhG,IAAMC,EAAa,KAAK,IAAI,EAAG,KAAK,KAAKD,EAAa,CAAC,CAAC,EAClDE,EAAU,IAAI,IAChBC,EAAgB,CAAE,SAAU,CAAC,EAAG,KAAM,GAAM,KAAM,IAAK,EAErD,WAAa,EAAiB,IAAwB,CAC1D,IAAI9C,EAAuB,KACvB+C,EAAkB,IAClBC,EAAW,IACf,IAAK,IAAMN,KAASD,EAAK,SAAU,CACjC,IAAMQ,EAAUP,EAAM,MAAQ/G,EACxBuH,EAAc,KAAK,WAAWD,EAAStH,CAAI,CAAC,EAAI,KAAKsH,CAAO,GAC9DC,EAAcH,GAAoBG,IAAgBH,GAAmB,KAAKE,CAAO,EAAID,KACvF,EAAON,EACP,EAAkBQ,EAClB,EAAW,KAAKD,CAAO,EAE3B,CACA,OAAOjD,CACT,EAEM,MAAS,GAAsC,CACnD,IAAMmD,EAAQV,EAAK,SAEfW,EAAK,EACLC,EAAK,EACLC,EAAQ,KACZ,IAAK,IAAIrD,EAAI,EAAGA,EAAIkD,EAAM,OAAQ,IAChC,IAAK,IAAIvD,EAAIK,EAAI,EAAGL,EAAIuD,EAAM,OAAQ,IAAK,CACzC,IAAMI,EACJ,KAAK,WAAW,OAAOJ,EAAMlD,EAAE,EAAG,OAAOkD,EAAMvD,EAAE,CAAC,CAAC,EAAI,KAAK,OAAOuD,EAAMlD,EAAE,CAAC,EAAI,KAAK,OAAOkD,EAAMvD,EAAE,CAAC,EACnG2D,EAAQD,IACV,EAAQC,EACR,EAAKtD,EACL,EAAKL,EAET,CAEF,IAAM4D,EAAwC,CAACL,EAAMC,EAAG,EAClDK,EAAwC,CAACN,EAAME,EAAG,EACpDK,EAAQ,OAAOP,EAAMC,EAAG,EACxBO,EAAQ,OAAOR,EAAME,EAAG,EACtBO,EAAYT,EAAM,QAAQ,EAAG,IAAUU,IAAUT,GAAMS,IAAUR,CAAE,EACzE,IAAK,GAAM,CAACQ,EAAOC,KAASF,EAAU,QAAQ,EAAG,CAE/C,IAAMG,EACJP,EAAO,QAAUI,EAAU,OAASC,GAASlB,GAC7Cc,EAAO,QAAUG,EAAU,OAASC,GAAS,EAAIjB,EAC7CoB,EACJP,EAAO,QAAUG,EAAU,OAASC,GAASlB,GAC7Ca,EAAO,QAAUI,EAAU,OAASC,GAAS,EAAIjB,EAC/CqB,EACJ,GAAIF,EAAO,EAAM,QACZ,GAAIC,EAAO,EAAM,OACjB,CACH,IAAME,EAAW,KAAK,WAAWR,EAAO,OAAOI,CAAI,CAAC,CAAC,EAAI,KAAKJ,CAAK,EAC7DS,EAAW,KAAK,WAAWR,EAAO,OAAOG,CAAI,CAAC,CAAC,EAAI,KAAKH,CAAK,EACnE,EAAMO,EAAWC,GAAaD,IAAaC,GAAY,KAAKT,CAAK,GAAK,KAAKC,CAAK,CAClF,CACIM,GACFT,EAAO,KAAKM,CAAI,EAChB,EAAQ,WAAWJ,EAAO,OAAOI,CAAI,CAAC,IAEtCL,EAAO,KAAKK,CAAI,EAChB,EAAQ,WAAWH,EAAO,OAAOG,CAAI,CAAC,EAE1C,CACA,IAAMvJ,EACJkI,EAAK,KACD,CAAE,SAAUe,EAA0B,KAAM,GAAM,KAAM,IAAK,EAC7D,CAAE,SAAUA,EAAqB,KAAM,GAAO,KAAM,IAAK,EAEzDhJ,EACJiI,EAAK,KACD,CAAE,SAAUgB,EAA0B,KAAM,GAAM,KAAM,IAAK,EAC7D,CAAE,SAAUA,EAAqB,KAAM,GAAO,KAAM,IAAK,EAI/D,OAFA,UAAUlJ,CAAC,EACX,UAAUC,CAAC,EACJ,CAACD,EAAGC,CAAC,CACd,EAGM,YAAc,EAAe,IAA4D,CAC7F,GAAIiI,EAAK,KAIP,OAHAA,EAAK,SAAS,KAAKqB,CAAoB,EACvC,EAAK,KAAOrB,EAAK,OAAS,KAAO,CAAE,GAAG,OAAOqB,CAAI,CAAE,EAAI,WAAWrB,EAAK,KAAM,OAAOqB,CAAI,CAAC,EACrFrB,EAAK,SAAS,OAASE,EAAmB,MAAMF,CAAI,EACjD,KAET,IAAM2B,EAAS3B,EACTC,EAAQ,UAAU0B,EAAQ,OAAON,CAAI,CAAC,EACtCO,EAAW,WAAW3B,EAAOoB,CAAI,EAEvC,GADA,UAAUrB,CAAI,EACV4B,EAAU,CACZ,IAAMR,EAAQO,EAAO,SAAS,QAAQ1B,CAAK,EAC3C0B,EAAO,SAAS,OAAOP,EAAO,EAAGQ,EAAS,GAAIA,EAAS,EAAE,EACzD,UAAU5B,CAAI,CAChB,CAEA,OADIA,EAAK,SAAS,OAASE,EAAmB,MAAMF,CAAI,EACjD,IACT,EAEM,YAAe,GAA8B,CAE7C,CAACK,EAAK,MAAQA,EAAK,SAAS,SAAW,IACzC,EAAO,CAAE,SAAU,CAAC,EAAG,KAAM,GAAM,KAAM,IAAK,GAEhD,IAAMuB,EAAW,WAAWvB,EAAMR,CAAK,EACnC+B,IACF,EAAO,CAAE,SAAUA,EAAU,KAAM,GAAO,KAAM,IAAK,EACrD,UAAUvB,CAAI,EAElB,EAGM,YAAc,EAAe,IAAiC,CAClE,GAAIL,EAAK,KAAM,CACb,IAAMoB,EAAQpB,EAAK,SAAS,QAAQH,CAAK,EAGzC,OAFIuB,IAAU,IAAIpB,EAAK,SAAS,OAAOoB,EAAO,CAAC,EAC/C,UAAUpB,CAAI,EACPA,EAAK,SAAS,SAAW,CAClC,CACA,IAAM2B,EAAS3B,EACf,IAAK,IAAIxC,EAAImE,EAAO,SAAS,OAAS,EAAGnE,GAAK,EAAG,IAAK,CACpD,IAAMyC,EAAQ0B,EAAO,SAASnE,GAI1ByC,EAAM,MAAQ,aAAaA,EAAM,KAAMJ,EAAM,IAAI,GAC/C,WAAWI,EAAOJ,CAAK,GAAG8B,EAAO,SAAS,OAAOnE,EAAG,CAAC,CAE7D,CAEA,OADA,UAAUwC,CAAI,EACP2B,EAAO,SAAS,SAAW,CACpC,EAEM,YAAe,GAAmB,CACtC,IAAM9B,EAAQO,EAAQ,IAAIyB,CAAE,EAC5B,GAAI,CAAChC,EAAO,MAAO,GAInB,IAHAO,EAAQ,OAAOyB,CAAE,EACjB,WAAWxB,EAAMR,CAAK,EAEf,CAACQ,EAAK,MAAQA,EAAK,SAAS,SAAW,GAC5C,EAAOA,EAAK,SAAS,GAEvB,MAAO,EACT,EAEM,WAAa,EAAe,EAA+B,IAAmB,CAClF,GAAKL,EAAK,MAAS8B,EAAK9B,EAAK,IAAI,EACjC,IAAIA,EAAK,KACP,IAAK,IAAMH,KAASG,EAAK,SACnB8B,EAAKjC,EAAM,IAAI,GAAGkC,EAAI,KAAKlC,EAAM,EAAE,OAI3C,IAAK,IAAMI,KAAUD,EAAmB,SAAU,UAAUC,EAAO6B,EAAMC,CAAG,CAD5E,CAEF,EAEA,MAAO,CACL,IAAI,QAAS,CACX,OAAO1B,EAAK,IACd,EACA,OAAQ,CACND,EAAQ,MAAM,EACd,EAAO,CAAE,SAAU,CAAC,EAAG,KAAM,GAAM,KAAM,IAAK,CAChD,EACA,OAAQ,YACR,IAAI,EAAI,CACN,OAAOA,EAAQ,IAAIyB,CAAE,CAAC,EAAE,IAC1B,EACA,IAAI,EAAI,CACN,OAAOzB,EAAQ,IAAIyB,CAAE,CACvB,EACA,WAAW,EAAO,EAAc,CAC9B,IAAMnE,EAAYsE,GAAc,WAAa,EAC7C,GAAI,EAAEtE,GAAa,GACjB,MAAM,IAAI,iBAAiB,4DAA4DA,GAAW,EAIpG,IAAMuE,EAAY,YAAY,CAAE,GAAGhK,EAAO,OAAQ,EAAG,MAAO,CAAE,EAAGyF,CAAS,EACpEqE,EAAW,CAAC,EAElB,OADA,UAAU1B,EAAO,GAAS,eAAenH,EAAM+I,CAAG,EAAGF,CAAG,EACjDA,CACT,EACA,UAAU,EAAM,CACd,IAAMA,EAAW,CAAC,EAElB,OADA,UAAU1B,EAAO,GAAc,eAAe9E,EAAWrC,CAAI,EAAG6I,CAAG,EAC5DA,CACT,EACA,IAAI,EAAI,EAAM,CACZ,IAAMG,EAAW9B,EAAQ,IAAIyB,CAAE,EAC/B,GAAIK,EAAU,CACZ,GAAI,WAAWA,EAAS,KAAMhJ,CAAI,EAAG,OACrC,YAAY2I,CAAE,CAChB,CACA,IAAMhC,EAAsB,CAAE,KAAI,KAAM,CAAE,GAAG3G,CAAK,CAAE,EACpDkH,EAAQ,IAAIyB,EAAIhC,CAAK,EACrB,YAAYA,CAAK,CACnB,EACA,IAAI,MAAO,CACT,OAAOO,EAAQ,IACjB,CACF,CACF,C"}