https://www.neubau-aichwald.de/frontend/hestia/assets/js/chunks/82.8b66267ffc6c3266f824.js

1/*! For license information please see 82.8b66267ffc6c3266f824.js.LICENSE.txt */
2(self.webpackChunkfrontend_setup=self.webpackChunkfrontend_setup||[]).push([[82],{2676:function(t){t.exports=function(){"use strict";function __generator(t,e){var n,r,i,o,s={label:0,sent:function(){if(1&i[0])throw i[1];return i[1]},trys:[],ops:[]};return o={next:verb(0),throw:verb(1),return:verb(2)},"function"==typeof Symbol&&(o[Symbol.iterator]=function(){return this}),o;function verb(t){return function(e){return step([t,e])}}function step(o){if(n)throw new TypeError("Generator is already executing.");for(;s;)try{if(n=1,r&&(i=2&o[0]?r.return:o[0]?r.throw||((i=r.return)&&i.call(r),0):r.next)&&!(i=i.call(r,o[1])).done)return i;switch(r=0,i&&(o=[2&o[0],i.value]),o[0]){case 0:case 1:i=o;break;case 4:return s.label++,{value:o[1],done:!1};case 5:s.label++,r=o[1],o=[0];continue;case 7:o=s.ops.pop(),s.trys.pop();continue;default:if(!((i=(i=s.trys).length>0&&i[i.length-1])||6!==o[0]&&2!==o[0])){s=0;continue}if(3===o[0]&&(!i||o[1]>i[0]&&o[1]<i[3])){s.label=o[1];break}if(6===o[0]&&s.label<i[1]){s.label=i[1],i=o;break}if(i&&s.label<i[2]){s.label=i[2],s.ops.push(o);break}i[2]&&s.ops.pop(),s.trys.pop();continue}o=e.call(t,s)}catch(t){o=[6,t],r=0}finally{n=i=0}if(5&o[0])throw o[1];return{value:o[0]?o[1]:void 0,done:!0}}}var t=function(){function Node(t,e){this.next=null,this.key=t,this.data=e,this.left=null,this.right=null}return Node}();function DEFAULT_COMPARE(t,e){return t>e?1:t<e?-1:0}function splay(e,n,r){for(var i=new t(null,null),o=i,s=i;;){var l=r(e,n.key);if(l<0){if(null===n.left)break;if(r(e,n.left.key)<0){var u=n.left;if(n.left=u.right,u.right=n,null===(n=u).left)break}s.left=n,s=n,n=n.left}else{if(!(l>0))break;if(null===n.right)break;if(r(e,n.right.key)>0&&(u=n.right,n.right=u.left,u.left=n,null===(n=u).right))break;o.right=n,o=n,n=n.right}}return o.right=n.left,s.left=n.right,n.left=i.right,n.right=i.left,n}function insert(e,n,r,i){var o=new t(e,n);if(null===r)return o.left=o.right=null,o;var s=i(e,(r=splay(e,r,i)).key);return s<0?(o.left=r.left,o.right=r,r.left=null):s>=0&&(o.right=r.right,o.left=r,r.right=null),o}function split(t,e,n){var r=null,i=null;if(e){var o=n((e=splay(t,e,n)).key,t);0===o?(r=e.left,i=e.right):o<0?(i=e.right,e.right=null,r=e):(r=e.left,e.left=null,i=e)}return{left:r,right:i}}function merge(t,e,n){return null===e?t:(null===t||((e=splay(t.key,e,n)).left=t),e)}function printRow(t,e,n,r,i){if(t){r(e+(n?"└── ":"├── ")+i(t)+"\n");var o=e+(n?"    ":"│   ");t.left&&printRow(t.left,o,!1,r,i),t.right&&printRow(t.right,o,!0,r,i)}}var e=function(){function Tree(t){void 0===t&&(t=DEFAULT_COMPARE),this._root=null,this._size=0,this._comparator=t}return Tree.prototype.insert=function(t,e){return this._size++,this._root=insert(t,e,this._root,this._comparator)},Tree.prototype.add=function(e,n){var r=new t(e,n);null===this._root&&(r.left=r.right=null,this._size++,this._root=r);var i=this._comparator,o=splay(e,this._root,i),s=i(e,o.key);return 0===s?this._root=o:(s<0?(r.left=o.left,r.right=o,o.left=null):s>0&&(r.right=o.right,r.left=o,o.right=null),this._size++,this._root=r),this._root},Tree.prototype.remove=function(t){this._root=this._remove(t,this._root,this._comparator)},Tree.prototype._remove=function(t,e,n){var r;return null===e?null:0===n(t,(e=splay(t,e,n)).key)?(null===e.left?r=e.right:(r=splay(t,e.left,n)).right=e.right,this._size--,r):e},Tree.prototype.pop=function(){var t=this._root;if(t){for(;t.left;)t=t.left;return this._root=splay(t.key,this._root,this._comparator),this._root=this._remove(t.key,this._root,this._comparator),{key:t.key,data:t.data}}return null},Tree.prototype.findStatic=function(t){for(var e=this._root,n=this._comparator;e;){var r=n(t,e.key);if(0===r)return e;e=r<0?e.left:e.right}return null},Tree.prototype.find=function(t){return this._root&&(this._root=splay(t,this._root,this._comparator),0!==this._comparator(t,this._root.key))?null:this._root},Tree.prototype.contains=function(t){for(var e=this._root,n=this._comparator;e;){var r=n(t,e.key);if(0===r)return!0;e=r<0?e.left:e.right}return!1},Tree.prototype.forEach=function(t,e){for(var n=this._root,r=[],i=!1;!i;)null!==n?(r.push(n),n=n.left):0!==r.length?(n=r.pop(),t.call(e,n),n=n.right):i=!0;return this},Tree.prototype.range=function(t,e,n,r){for(var i=[],o=this._comparator,s=this._root;0!==i.length||s;)if(s)i.push(s),s=s.left;else{if(o((s=i.pop()).key,e)>0)break;if(o(s.key,t)>=0&&n.call(r,s))return this;s=s.right}return this},Tree.prototype.keys=function(){var t=[];return this.forEach(function(e){var n=e.key;return t.push(n)}),t},Tree.prototype.values=function(){var t=[];return this.forEach(function(e){var n=e.data;return t.push(n)}),t},Tree.prototype.min=function(){return this._root?this.minNode(this._root).key:null},Tree.prototype.max=function(){return this._root?this.maxNode(this._root).key:null},Tree.prototype.minNode=function(t){if(void 0===t&&(t=this._root),t)for(;t.left;)t=t.left;return t},Tree.prototype.maxNode=function(t){if(void 0===t&&(t=this._root),t)for(;t.right;)t=t.right;return t},Tree.prototype.at=function(t){for(var e=this._root,n=!1,r=0,i=[];!n;)if(e)i.push(e),e=e.left;else if(i.length>0){if(e=i.pop(),r===t)return e;r++,e=e.right}else n=!0;return null},Tree.prototype.next=function(t){var e=this._root,n=null;if(t.right){for(n=t.right;n.left;)n=n.left;return n}for(var r=this._comparator;e;){var i=r(t.key,e.key);if(0===i)break;i<0?(n=e,e=e.left):e=e.right}return n},Tree.prototype.prev=function(t){var e=this._root,n=null;if(null!==t.left){for(n=t.left;n.right;)n=n.right;return n}for(var r=this._comparator;e;){var i=r(t.key,e.key);if(0===i)break;i<0?e=e.left:(n=e,e=e.right)}return n},Tree.prototype.clear=function(){return this._root=null,this._size=0,this},Tree.prototype.toList=function(){return toList(this._root)},Tree.prototype.load=function(t,e,n){void 0===e&&(e=[]),void 0===n&&(n=!1);var r=t.length,i=this._comparator;if(n&&sort(t,e,0,r-1,i),null===this._root)this._root=loadRecursive(t,e,0,r),this._size=r;else{var o=mergeLists(this.toList(),createList(t,e),i);r=this._size+r,this._root=sortedListToBST({head:o},0,r)}return this},Tree.prototype.isEmpty=function(){return null===this._root},Object.defineProperty(Tree.prototype,"size",{get:function(){return this._size},enumerable:!0,configurable:!0}),Object.defineProperty(Tree.prototype,"root",{get:function(){return this._root},enumerable:!0,configurable:!0}),Tree.prototype.toString=function(t){void 0===t&&(t=function(t){return String(t.key)});var e=[];return printRow(this._root,"",!0,function(t){return e.push(t)},t),e.join("")},Tree.prototype.update=function(t,e,n){var r=this._comparator,i=split(t,this._root,r),o=i.left,s=i.right;r(t,e)<0?s=insert(e,n,s,r):o=insert(e,n,o,r),this._root=merge(o,s,r)},Tree.prototype.split=function(t){return split(t,this._root,this._comparator)},Tree.prototype[Symbol.iterator]=function(){var t,e,n;return __generator(this,function(r){switch(r.label){case 0:t=this._root,e=[],n=!1,r.label=1;case 1:return n?[3,6]:null===t?[3,2]:(e.push(t),t=t.left,[3,5]);case 2:return 0===e.length?[3,4]:[4,t=e.pop()];case 3:return r.sent(),t=t.right,[3,5];case 4:n=!0,r.label=5;case 5:return[3,1];case 6:return[2]}})},Tree}();function loadRecursive(e,n,r,i){var o=i-r;if(o>0){var s=r+Math.floor(o/2),l=e[s],u=n[s],h=new t(l,u);return h.left=loadRecursive(e,n,r,s),h.right=loadRecursive(e,n,s+1,i),h}return null}function createList(e,n){for(var r=new t(null,null),i=r,o=0;o<e.length;o++)i=i.next=new t(e[o],n[o]);return i.next=null,r.next}function toList(e){for(var n=e,r=[],i=!1,o=new t(null,null),s=o;!i;)n?(r.push(n),n=n.left):r.length>0?n=(n=s=s.next=r.pop()).right:i=!0;return s.next=null,o.next}function sortedListToBST(t,e,n){var r=n-e;if(r>0){var i=e+Math.floor(r/2),o=sortedListToBST(t,e,i),s=t.head;return s.left=o,t.head=t.head.next,s.right=sortedListToBST(t,i+1,n),s}return null}function mergeLists(e,n,r){for(var i=new t(null,null),o=i,s=e,l=n;null!==s&&null!==l;)r(s.key,l.key)<0?(o.next=s,s=s.next):(o.next=l,l=l.next),o=o.next;return null!==s?o.next=s:null!==l&&(o.next=l),i.next}function sort(t,e,n,r,i){if(!(n>=r)){for(var o=t[n+r>>1],s=n-1,l=r+1;;){do{s++}while(i(t[s],o)<0);do{l--}while(i(t[l],o)>0);if(s>=l)break;var u=t[s];t[s]=t[l],t[l]=u,u=e[s],e[s]=e[l],e[l]=u}sort(t,e,n,l,i),sort(t,e,l+1,r,i)}}const isInBbox=(t,e)=>t.ll.x<=e.x&&e.x<=t.ur.x&&t.ll.y<=e.y&&e.y<=t.ur.y,getBboxOverlap=(t,e)=>{if(e.ur.x<t.ll.x||t.ur.x<e.ll.x||e.ur.y<t.ll.y||t.ur.y<e.ll.y)return null;const n=t.ll.x<e.ll.x?e.ll.x:t.ll.x,r=t.ur.x<e.ur.x?t.ur.x:e.ur.x;return{ll:{x:n,y:t.ll.y<e.ll.y?e.ll.y:t.ll.y}

2),k=O-N,b=O-k,p[0]=O-(k+b)+(b-N),P=T+k,b=P-T,I=T-(P-b)+(k-b),k=I-L,b=I-k,p[1]=I-(k+b)+(b-L),A=P+k,b=A-P,p[2]=P-(A-b)+(k-b),p[3]=A;let z=estimate(4,p),F=h*u;if(z>=F||-z>=F)return z;if(b=t-M,x=t-(M+b)+(b-i),b=n-B,m=n-(B+b)+(b-i),b=e-$,d=e-($+b)+(b-o),b=r-C,v=r-(C+b)+(b-o),0===x&&0===d&&0===m&&0===v)return z;if(F=f*u+l*Math.abs(z),z+=M*v+C*x-($*m+B*d),z>=F||-z>=F)return z;T=x*C,E=s*x,S=E-(E-x),_=x-S,E=s*C,w=E-(E-C),R=C-w,O=_*R-(T-S*w-_*w-S*R),L=d*B,E=s*d,S=E-(E-d),_=d-S,E=s*B,w=E-(E-B),R=B-w,N=_*R-(L-S*w-_*w-S*R),k=O-N,b=O-k,y[0]=O-(k+b)+(b-N),P=T+k,b=P-T,I=T-(P-b)+(k-b),k=I-L,b=I-k,y[1]=I-(k+b)+(b-L),A=P+k,b=A-P,y[2]=P-(A-b)+(k-b),y[3]=A;const G=sum(4,p,4,y,c);T=M*v,E=s*M,S=E-(E-M),_=M-S,E=s*v,w=E-(E-v),R=v-w,O=_*R-(T-S*w-_*w-S*R),L=$*m,E=s*$,S=E-(E-$),_=$-S,E=s*m,w=E-(E-m),R=m-w,N=_*R-(L-S*w-_*w-S*R),k=O-N,b=O-k,y[0]=O-(k+b)+(b-N),P=T+k,b=P-T,I=T-(P-b)+(k-b),k=I-L,b=I-k,y[1]=I-(k+b)+(b-L),A=P+k,b=A-P,y[2]=P-(A-b)+(k-b),y[3]=A;const q=sum(G,c,4,y,a);T=x*v,E=s*x,S=E-(E-x),_=x-S,E=s*v,w=E-(E-v),R=v-w,O=_*R-(T-S*w-_*w-S*R),L=d*m,E=s*d,S=E-(E-d),_=d-S,E=s*m,w=E-(E-m),R=m-w,N=_*R-(L-S*w-_*w-S*R

2),k=O-N,b=O-k,y[0]=O-(k+b)+(b-N),P=T+k,b=P-T,I=T-(P-b)+(k-b),k=I-L,b=I-k,y[1]=I-(k+b)+(b-L),A=P+k,b=A-P,y[2]=P-(A-b)+(k-b),y[3]=A;const U=sum(q,a,4,y,g);return g[U-1]}function orient2d(t,e,n,r,i,o){const s=(e-o)*(n-i),l=(t-i)*(r-o),h=s-l,f=Math.abs(s+l);return Math.abs(h)>=u*f?h:-orient2dadapt(t,e,n,r,i,o,f)}const crossProduct=(t,e)=>t.x*e.y-t.y*e.x,dotProduct=(t,e)=>t.x*e.x+t.y*e.y,compareVectorAngles=(t,e,n)=>{const r=orient2d(t.x,t.y,e.x,e.y,n.x,n.y);return r>0?-1:r<0?1:0},length=t=>Math.sqrt(dotProduct(t,t)),sineOfAngle=(t,e,n)=>{const r={x:e.x-t.x,y:e.y-t.y},i={x:n.x-t.x,y:n.y-t.y};return crossProduct(i,r)/length(i)/length(r)},cosineOfAngle=(t,e,n)=>{const r={x:e.x-t.x,y:e.y-t.y},i={x:n.x-t.x,y:n.y-t.y};return dotProduct(i,r)/length(i)/length(r)},horizontalIntersection=(t,e,n)=>0===e.y?null:{x:t.x+e.x/e.y*(n-t.y),y:n},verticalIntersection=(t,e,n)=>0===e.x?null:{x:n,y:t.y+e.y/e.x*(n-t.x)},intersection$1=(t,e,n,r)=>{if(0===e.x)return verticalIntersection(n,r,t.x);if(0===r.x)return verticalIntersection(t,e,n.x);if(0===e.y)return horizontalIntersection(n,r,t.y);if(0===r.y)return horizontalIntersection(t,e,n.y);const i=crossProduct(e,r);if(0==i)return null;const o={x:n.x-t.x,y:n.y-t.y},s=crossProduct(o,e)/i,l=crossProduct(o,r)/i;return{x:(t.x+l*e.x+(n.x+s*r.x))/2,y:(t.y+l*e.y+(n.y+s*r.y))/2}};class SweepEvent{static compare(t,e){const n=SweepEvent.comparePoints(t.point,e.point);return 0!==n?n:(t.point!==e.point&&t.link(e),t.isLeft!==e.isLeft?t.isLeft?1:-1:Segment.compare(t.segment,e.segment))}static comparePoints(t,e){return t.x<e.x?-1:t.x>e.x?1:t.y<e.y?-1:t.y>e.y?1:0}constructor(t,e){void 0===t.events?t.events=[this]:t.events.push(this),this.point=t,this.isLeft=e}link(t){if(t.point===this.point)throw new Error("Tried to link already linked events");const e=t.point.events;for(let t=0,n=e.length;t<n;t++){const n=e[t];this.point.events.push(n),n.point=this.point}this.checkForConsuming()}checkForConsuming(){const t=this.point.events.length;for(let e=0;e<t;e++){const n=this.point.events[e];if(void 0===n.segment.consumedBy)for(let r=e+1;r<t;r++){const t=this.point.events[r];void 0===t.consumedBy&&n.otherSE.point.events===t.otherSE.point.events&&n.segment.consume(t.segment)}}}getAvailableLinkedEvents(){const t=[];for(let e=0,n=this.point.events.length;e<n;e++){const n=this.point.events[e];n!==this&&!n.segment.ringOut&&n.segment.isInResult()&&t.push(n)}return t}getLeftmostComparator(t){const e=new Map,fillCache=n=>{const r=n.otherSE;e.set(n,{sine:sineOfAngle(this.point,t.point,r.point),cosine:cosineOfAngle(this.point,t.point,r.point)})};return(t,n)=>{e.has(t)||fillCache(t),e.has(n)||fillCache(n);const{sine:r,cosine:i}=e.get(t),{sine:o,cosine:s}=e.get(n);return r>=0&&o>=0?i<s?1:i>s?-1:0:r<0&&o<0?i<s?-1:i>s?1:0:o<r?-1:o>r?1:0}}}let x=0;class Segment{static compare(t,e){const n=t.leftSE.point.x,r=e.leftSE.point.x,i=t.rightSE.point.x,o=e.rightSE.point.x;if(o<n)return 1;if(i<r)return-1;const s=t.leftSE.point.y,l=e.leftSE.point.y,u=t.rightSE.point.y,h=e.rightSE.point.y;if(n<r){if(l<s&&l<u)return 1;if(l>s&&l>u)return-1;const n=t.comparePoint(e.leftSE.point);if(n<0)return 1;if(n>0)return-1;const r=e.comparePoint(t.rightSE.point);return 0!==r?r:-1}if(n>r){if(s<l&&s<h)return-1;if(s>l&&s>h)return 1;const n=e.comparePoint(t.leftSE.point);if(0!==n)return n;const r=t.comparePoint(e.rightSE.point);return r<0?1:r>0?-1:1}if(s<l)return-1;if(s>l)return 1;if(i<o){const n=e.comparePoint(t.rightSE.point);if(0!==n)return n}if(i>o){const n=t.comparePoint(e.rightSE.point);if(n<0)return 1;if(n>0)return-1}if(i!==o){const t=u-s,e=i-n,f=h-l,p=o-r;if(t>e&&f<p)return 1;if(t<e&&f>p)return-1}return i>o?1:i<o||u<h?-1:u>h?1:t.id<e.id?-1:t.id>e.id?1:0}constructor(t,e,n,r){this.id=++x,this.leftSE=t,t.segment=this,t.otherSE=e,this.rightSE=e,e.segment=this,e.otherSE=t,this.rings=n,this.windings=r}static fromRing(t,e,n){let r,i,o;const s=SweepEvent.comparePoints(t,e);if(s<0)r=t,i=e,o=1;else{if(!(s>0))throw new Error(`Tried to create degenerate segment at [${t.x}, ${t.y}]`);r=e,i=t,o=-1}const l=new SweepEvent(r,!0),u=new SweepEvent(i,!1);return new Segment(l,u,[n],[o])}replaceRightSE(t){this.rightSE=t,this.rightSE.segment=this,this.rightSE.otherSE=this.leftSE,this.leftSE.otherSE=this.rightSE}bbox(){const t=this.leftSE.point.y,e=this.rightSE.point.y;return{ll:{x:this.leftSE.point.x,y:t<e?t:e},ur:{x:this.rightSE.point.x,y:t>e?t:e}}}vector(){return{x:this.rightSE.point.x-this.leftSE.point.x,y:this.rightSE.point.y-this.leftSE.point.y}}isAnEndpoint(t){return t.x===this.leftSE.point.x&&t.y===this.leftSE.point.y||t.x===this.rightSE.point.x&&t.y===this.rightSE.point.y}comparePoint(t){if(this.isAnEndpoint(t))return 0;const e=this.leftSE.point,n=this.rightSE.point,r=this.vector();if(e.x===n.x)return t.x===e.x?0:t.x<e.x?1:-1;const i=(t.y-e.y)/r.y,o=e.x+i*r.x;if(t.x===o)return 0;const s=(t.x-e.x)/r.x,l=e.y+s*r.y;return t.y===l?0:t.y<l?-1:1}getIntersection(t){const e=this.bbox(),n=t.bbox(),r=getBboxOverlap(e,n);if(null===r)return null;const o=this.leftSE.point,s=this.rightSE.point,l=t.leftSE.point,u=t.rightSE.point,h=isInBbox(e,l)&&0===this.comparePoint(l),f=isInBbox(n,o)&&0===t.comparePoint(o),p=isInBbox(e,u)&&0===this.comparePoint(u),c=isInBbox(n,s)&&0===t.comparePoint(s);if(f&&h)return c&&!p?s:!c&&p?u:null;if(f)return p&&o.x===u.x&&o.y===u.y?null:o;if(h)return c&&s.x===l.x&&s.y===l.y?null:l;if(c&&p)return null;if(c)return s;if(p)return u;const a=intersection$1(o,this.vector(),l,t.vector());return null===a?null:isInBbox(r,a)?i.round(a.x,a.y):null}split(t){const e=[],n=void 0!==t.events,r=new SweepEvent(t,!0),i=new SweepEvent(t,!1),o=this.rightSE;this.replaceRightSE(i),e.push(i),e.push(r);const s=new Segment(r,o,this.rings.slice(),this.windings.slice());return SweepEvent.comparePoints(s.leftSE.point,s.rightSE.point)>0&&s.swapEvents(),SweepEvent.comparePoints(this.leftSE.point,this.rightSE.point)>0&&this.swapEvents(),n&&(r.checkForConsuming(),i.checkForConsuming()),e}swapEvents(){const t=this.rightSE;this.rightSE=this.leftSE,this.leftSE=t,this.leftSE.isLeft=!0,this.rightSE.isLeft=!1;for(let t=0,e=this.windings.length;t<e;t++)this.windings[t]*=-1}consume(t){let e=this,n=t;for(;e.consumedBy;)e=e.consumedBy;for(;n.consumedBy;)n=n.consumedBy;const r=Segment.compare(e,n);if(0!==r){if(r>0){const t=e;e=n,n=t}if(e.prev===n){const t=e;e=n,n=t}for(let t=0,r=n.rings.length;t<r;t++){const r=n.rings[t],i=n.windings[t],o=e.rings.indexOf(r);-1===o?(e.rings.push(r),e.windings.push(i)):e.windings[o]+=i}n.rings=null,n.windings=null,n.consumedBy=e,n.leftSE.consumedBy=e.leftSE,n.rightSE.consumedBy=e.rightSE}}prevInResult(){return void 0!==this._prevInResult||(this.prev?this.prev.isInResult()?this._prevInResult=this.prev:this._prevInResult=this.prev.prevInResult():this._prevInResult=null),this._prevInResult}beforeState(){if(void 0!==this._beforeState)return this._beforeState;if(this.prev){const t=this.prev.consumedBy||this.prev;this._beforeState=t.afterState()}else this._beforeState={rings:[],windings:[],multiPolys:[]};return this._beforeState}afterState(){if(void 0!==this._afterState)return this._afterState;const t=this.beforeState();this._afterState={rings:t.rings.slice(0),windings:t.windings.slice(0),multiPolys:[]};const e=this._afterState.rings,n=this._afterState.windings,r=this._afterState.multiPolys;for(let t=0,r=this.rings.length;t<r;t++){const r=this.rings[t],i=this.windings[t],o=e.indexOf(r);-1===o?(e.push(r),n.push(i)):n[o]+=i}const i=[],o=[];for(let t=0,r=e.length;t<r;t++){if(0===n[t])continue;const r=e[t],s=r.poly;if(-1===o.indexOf(s))if(r.isExterior)i.push(s);else{-1===o.indexOf(s)&&o.push(s);const t=i.indexOf(r.poly);-1!==t&&i.splice(t,1)}}for(let t=0,e=i.length;t<e;t++){const e=i[t].multiPoly;-1===r.indexOf(e)&&r.push(e)}return this._afterState}isInResult(){if(this.consumedBy)return!1;if(void 0!==this._isInResult)return this._isInResult;const t=this.beforeState().multiPolys,e=this.afterState().multiPolys;switch(v.type){case"union":{const n=0===t.length,r=0===e.length;this._isInResult=n!==r;break}case"intersection":{let n,r;t.length<e.length?(n=t.length,r=e.length):(n=e.length,r=t.length),this._isInResult=r===v.numMultiPolys&&n<r;break}case"xor":{const n=Math.abs(t.length-e.length);this._isInResult=n%2==1;break}case"difference":{const isJustSubject=t=>1===t.length&&t[0].isSubject;this._isInResult=isJustSubject(t)!==isJustSubject(e);break}default:throw new Error(`Unrecognized operation type found ${v.type}`)}return this._isInResult}}class RingIn{constructor(t,e,n){if(!Array.isArray(t)||0===t.length)throw new Error("Input geometry is not a valid Polygon or MultiPolygon");if(this.poly=e,this.isExterior=n,this.segments=[],"number"!=typeof t[0][0]||"number"!=typeof t[0][1])throw new Error("Input geometry is not a valid Polygon or MultiPolygon");const r=i.round(t[0][0],t[0][1]);this.bbox={ll:{x:r.x,y:r.y},ur:{x:r.x,y:r.y}};let o=r;for(let e=1,n=t.length;e<n;e++){if("number"!=typeof t[e][0]||"number"!=typeof t[e][1])throw new Error("Input geometry is not a valid Polygon or MultiPolygon");let n=i.round(t[e][0],t[e][1]);n.x===o.x&&n.y===o.y||(this.segments.push(Segment.fromRing(o,n,this)),n.x<this.bbox.ll.x&&(this.bbox.ll.x=n.x),n.y<this.bbox.ll.y&&(this.bbox.ll.y=n.y),n.x>this.bbox.ur.x&&(this.bbox.ur.x=n.x),n.y>this.bbox.ur.y&&(this.bbox.ur.y=n.y),o=n)}r.x===o.x&&r.y===o.y||this.segments.push(Segment.fromRing(o,r,this))}getSweepEvents(){const t=[];for(let e=0,n=this.segments.length;e<n;e++){const n=this.segments[e];t.push(n.leftSE),t.push(n.rightSE)}return t}}class PolyIn{constructor(t,e){if(!Array.isArray(t))throw new Error("Input geometry is not a valid Polygon or MultiPolygon");this.exteriorRing=new RingIn(t[0],this,!0),this.bbox={ll:{x:this.exteriorRing.bbox.ll.x,y:this.exteriorRing.bbox.ll.y},ur:{x:this.exteriorRing.bbox.ur.x,y:this.exteriorRing.bbox.ur.y}},this.interiorRings=[];for(let e=1,n=t.length;e<n;e++){const n=new RingIn(t[e],this,!1);n.bbox.ll.x<this.bbox.ll.x&&(this.bbox.ll.x=n.bbox.ll.x),n.bbox.ll.y<this.bbox.ll.y&&(this.bbox.ll.y=n.bbox.ll.y),n.bbox.ur.x>this.bbox.ur.x&&(this.bbox.ur.x=n.bbox.ur.x),n.bbox.ur.y>this.bbox.ur.y&&(this.bbox.ur.y=n.bbox.ur.y),this.interiorRings.push(n)}this.multiPoly=e}getSweepEvents(){const t=this.exteriorRing.getSweepEvents();for(let e=0,n=this.interiorRings.length;e<n;e++){const n=this.interiorRings[e].getSweepEvents();for(let e=0,r=n.length;e<r;e++)t.push(n[e])}return t}}class MultiPolyIn{constructor(t,e){if(!Array.isArray(t))throw new Error("Input geometry is not a valid Polygon or MultiPolygon");try{"number"==typeof t[0][0][0]&&(t=[t])}catch(t){}this.polys=[],this.bbox={ll:{x:Number.POSITIVE_INFINITY,y:Number.POSITIVE_INFINITY},ur:{x:Number.NEGATIVE_INFINITY,y:Number.NEGATIVE_INFINITY}};for(let e=0,n=t.length;e<n;e++){const n=new PolyIn(t[e],this);n.bbox.ll.x<this.bbox.ll.x&&(this.bbox.ll.x=n.bbox.ll.x),n.bbox.ll.y<this.bbox.ll.y&&(this.bbox.ll.y=n.bbox.ll.y),n.bbox.ur.x>this.bbox.ur.x&&(this.bbox.ur.x=n.bbox.ur.x),n.bbox.ur.y>this.bbox.ur.y&&(this.bbox.ur.y=n.bbox.ur.y),this.polys.push(n)}this.isSubject=e}getSweepEvents(){const t=[];for(let e=0,n=this.polys.length;e<n;e++){const n=this.polys[e].getSweepEvents();for(let e=0,r=n.length;e<r;e++)t.push(n[e])}return t}}class RingOut{static factory(t){const e=[];for(let n=0,r=t.length;n<r;n++){const r=t[n];if(!r.isInResult()||r.ringOut)continue;let i=null,o=r.leftSE,s=r.rightSE;const l=[o],u=o.point,h=[];for(;i=o,o=s,l.push(o),o.point!==u;)for(;;){const t=o.getAvailableLinkedEvents();if(0===t.length){const t=l[0].point,e=l[l.length-1].point;throw new Error(`Unable to complete output ring starting at [${t.x}, ${t.y}]. Last matching segment found ends at [${e.x}, ${e.y}].`)}if(1===t.length){s=t[0].otherSE;break}let n=null;for(let t=0,e=h.length;t<e;t++)if(h[t].point===o.point){n=t;break}if(null!==n){const t=h.splice(n)[0],r=l.splice(t.index);r.unshift(r[0].otherSE),e.push(new RingOut(r.reverse()));continue}h.push({index:l.length,point:o.point});const r=o.getLeftmostComparator(i);s=t.sort(r)[0].otherSE;break}e.push(new RingOut(l))}return e}constructor(t){this.events=t;for(let e=0,n=t.length;e<n;e++)t[e].segment.ringOut=this;this.poly=null}getGeom(){let t=this.events[0].point;const e=[t];for(let n=1,r=this.events.length-1;n<r;n++){const r=this.events[n].point,i=this.events[n+1].point;0!==compareVectorAngles(r,t,i)&&(e.push(r),t=r)}if(1===e.length)return null;const n=e[0],r=e[1];0===compareVectorAngles(n,t,r)&&e.shift(),e.push(e[0]);const i=this.isExteriorRing()?1:-1,o=this.isExteriorRing()?0:e.length-1,s=this.isExteriorRing()?e.length:-1,l=[];for(let t=o;t!=s;t+=i)l.push([e[t].x,e[t].y]);return l}isExteriorRing(){if(void 0===this._isExteriorRing){const t=this.enclosingRing();this._isExteriorRing=!t||!t.isExteriorRing()}return this._isExteriorRing}enclosingRing(){return void 0===this._enclosingRing&&(this._enclosingRing=this._calcEnclosingRing()),this._enclosingRing}_calcEnclosingRing(){let t=this.events[0];for(let e=1,n=this.events.length;e<n;e++){const n=this.events[e];SweepEvent.compare(t,n)>0&&(t=n)}let e=t.segment.prevInResult(),n=e?e.prevInResult():null;for(;;){if(!e)return null;if(!n)return e.ringOut;if(n.ringOut!==e.ringOut)return n.ringOut.enclosingRing()!==e.ringOut?e.ringOut:e.ringOut.enclosingRing();e=n.prevInResult(),n=e?e.prevInResult():null}}}class PolyOut{constructor(t){this.exteriorRing=t,t.poly=this,this.interiorRings=[]}addInterior(t){this.interiorRings.push(t),t.poly=this}getGeom(){const t=[this.exteriorRing.getGeom()];if(null===t[0])return null;for(let e=0,n=this.interiorRings.length;e<n;e++){const n=this.interiorRings[e].getGeom();null!==n&&t.push(n)}return t}}class MultiPolyOut{constructor(t){this.rings=t,this.polys=this._composePolys(t)}getGeom(){const t=[];for(let e=0,n=this.polys.length;e<n;e++){const n=this.polys[e].getGeom();null!==n&&t.push(n)}return t}_composePolys(t){const e=[];for(let n=0,r=t.length;n<r;n++){const r=t[n];if(!r.poly)if(r.isExteriorRing())e.push(new PolyOut(r));else{const t=r.enclosingRing();t.poly||e.push(new PolyOut(t)),t.poly.addInterior(r)}}return e}}class SweepLine{constructor(t){let n=arguments.length>1&&void 0!==arguments[1]?arguments[1]:Segment.compare;this.queue=t,this.tree=new e(n),this.segments=[]}process(t){const e=t.segment,n=[];if(t.consumedBy)return t.isLeft?this.queue.remove(t.otherSE):this.tree.remove(e),n;const r=t.isLeft?this.tree.add(e):this.tree.find(e);if(!r)throw new Error(`Unable to find segment #${e.id} [${e.leftSE.point.x}, ${e.leftSE.point.y}] -> [${e.rightSE.point.x}, ${e.rightSE.point.y}] in SweepLine tree.`);let i,o,s=r,l=r;for(;void 0===i;)s=this.tree.prev(s),null===s?i=null:void 0===s.key.consumedBy&&(i=s.key);for(;void 0===o;