aw-highstock_rails 7.0.3

data/vendor/assets/javascripts/highstock/modules/venn.js

@@ -0,0 +1,30 @@
+/*
+ Highcharts JS v7.0.3 (2019-02-06)
+
+ (c) 2017-2019 Highsoft AS
+ Authors: Jon Arild Nygard
+
+ License: www.highcharts.com/license
+*/
+(function(k){"object"===typeof module&&module.exports?(k["default"]=k,module.exports=k):"function"===typeof define&&define.amd?define(function(){return k}):k("undefined"!==typeof Highcharts?Highcharts:void 0)})(function(k){var B=function(){return function(c){var g=this,h=g.graphic,q=c.animatableAttribs,p=c.onComplete,k=c.css,v=c.renderer;g.shouldDraw()?(h||(g.graphic=h=v[c.shapeType](c.shapeArgs).add(c.group)),h.css(k).attr(c.attribs).animate(q,c.isNew?!1:void 0,p)):h&&h.animate(q,void 0,function(){g.graphic=
+h=h.destroy();"function"===typeof p&&p()});h&&h.addClass(g.getClassName(),!0)}}(),z=function(){return{getAngleBetweenPoints:function(c,g){return Math.atan2(g.x-c.x,g.y-c.y)},getCenterOfPoints:function(c){var g=c.reduce(function(c,g){c.x+=g.x;c.y+=g.y;return c},{x:0,y:0});return{x:g.x/c.length,y:g.y/c.length}},getDistanceBetweenPoints:function(c,g){return Math.sqrt(Math.pow(g.x-c.x,2)+Math.pow(g.y-c.y,2))}}}(),D=function(c){var g=c.getAngleBetweenPoints,h=c.getCenterOfPoints,q=c.getDistanceBetweenPoints,
+p=function(f,a){a=Math.pow(10,a);return Math.round(f*a)/a},k=function(f,a){return f*f*Math.acos(1-a/f)-(f-a)*Math.sqrt(a*(2*f-a))},v=function(f,a){var m=q(f,a),n=f.r,c=a.r,g=[];if(m<n+c&&m>Math.abs(n-c)){var n=n*n,r=(n-c*c+m*m)/(2*m),c=Math.sqrt(n-r*r),n=f.x,g=a.x;f=f.y;var h=a.y;a=n+r*(g-n)/m;r=f+r*(h-f)/m;f=c/m*-(h-f);m=c/m*-(g-n);g=[{x:p(a+f,14),y:p(r-m,14)},{x:p(a-f,14),y:p(r+m,14)}]}return g},A=function(f){return f.reduce(function(a,f,c,g){g=g.slice(c+1).reduce(function(a,g,m){var n=[c,m+c+1];
+return a.concat(v(f,g).map(function(a){a.indexes=n;return a}))},[]);return a.concat(g)},[])},x=function(c,a){return q(c,a)<=a.r+1e-10},w=function(c,a){return!a.some(function(a){return!x(c,a)})};return{getAreaOfIntersectionBetweenCircles:function(c){var a=A(c).filter(function(a){return w(a,c)}),f;if(1<a.length){var n=h(a),a=a.map(function(a){a.angle=g(n,a);return a}).sort(function(a,c){return c.angle-a.angle}),k=a[a.length-1],a=a.reduce(function(a,f){var m=a.startPoint,n=h([m,f]),k=f.indexes.filter(function(a){return-1<
+m.indexes.indexOf(a)}).reduce(function(a,k){k=c[k];var h=g(k,f),p=g(k,m),h=p-(p-h+(p<h?2*Math.PI:0))/2,h=q(n,{x:k.x+k.r*Math.sin(h),y:k.y+k.r*Math.cos(h)});k=k.r;h>2*k&&(h=2*k);if(!a||a.width>h)a={r:k,largeArc:h>k?1:0,width:h,x:f.x,y:f.y};return a},null);if(k){var p=k.r;a.arcs.push(["A",p,p,0,k.largeArc,1,k.x,k.y]);a.startPoint=f}return a},{startPoint:k,arcs:[]}).arcs;0!==a.length&&1!==a.length&&(a.unshift(["M",k.x,k.y]),f={center:n,d:a})}return f},getCircleCircleIntersection:v,getCirclesIntersectionPoints:A,
+getCircularSegmentArea:k,getOverlapBetweenCircles:function(c,a,g){var f=0;if(g<c+a){var f=c*c,h=a*a;g<=Math.abs(a-c)?f=Math.PI*Math.min(f,h):(f=(f-h+g*g)/(2*g),g-=f,f=k(c,c-f)+k(a,a-g));f=p(f,14)}return f},isPointInsideCircle:x,isPointInsideAllCircles:w,isPointOutsideAllCircles:function(c,a){return!a.some(function(a){return x(c,a)})},round:p}}(z);(function(c,g,k,q){var h=q.Color,z=q.extend,v=k.getAreaOfIntersectionBetweenCircles,A=k.getCircleCircleIntersection,x=g.getCenterOfPoints,w=g.getDistanceBetweenPoints,
+f=k.getOverlapBetweenCircles,a=q.isArray,m=q.isNumber,n=q.isObject,B=k.isPointInsideAllCircles,D=k.isPointOutsideAllCircles,r=q.isString,M=q.merge,N=q.seriesType,O=function(b){return Object.keys(b).map(function(e){return b[e]})},Q=function(b){var e=0;2===b.length&&(e=b[0],b=b[1],e=f(e.r,b.r,w(e,b)));return e},F=function(b,e){return e.reduce(function(e,a){var d=0;1<a.sets.length&&(d=a.value,a=Q(a.sets.map(function(d){return b[d]})),a=d-a,d=Math.round(a*a*1E11)/1E11);return e+d},0)},P=function(b,e,
+a,t,d){var l=b(e),c=b(a);d=d||100;t=t||1e-10;var E=a-e,f=1,k,g;if(e>=a)throw Error("a must be smaller than b.");if(0<l*c)throw Error("f(a) and f(b) must have opposite signs.");if(0===l)k=e;else if(0===c)k=a;else for(;f++<=d&&0!==g&&E>t;)E=(a-e)/2,k=e+E,g=b(k),0<l*g?e=k:a=k;return k},C=function(a,e,l){var b=a+e,d=b;0<l&&(d=P(function(b){b=f(a,e,b);return l-b},0,b));return d},y=function(b){return a(b.sets)&&1===b.sets.length},R=function(b,a){var l=function(a,b){return a.fx-b.fx},e=function(a,b,d,l){return b.map(function(b,
+e){return a*b+d*l[e]})},d=function(a,d){d.fx=b(d);a[a.length-1]=d;return a},c=function(a){var d=a[0];return a.map(function(a){a=e(.5,d,.5,a);a.fx=b(a);return a})},k=function(a){for(var b=a.slice(0,-1).length,d=[],l=function(a,b){a.sum+=b[a.i];return a},e=0;e<b;e++)d[e]=a.reduce(l,{sum:0,i:e}).sum/b;return d},f=function(a,d,l,c){a=e(l,a,c,d);a.fx=b(a);return a};a=function(a){var d=a.length,l=Array(d+1);l[0]=a;l[0].fx=b(a);for(var e=0;e<d;++e){var c=a.slice();c[e]=c[e]?1.05*c[e]:.001;c.fx=b(c);l[e+
+1]=c}return l}(a);for(var g=0;100>g;g++){a.sort(l);var u=a[a.length-1],h=k(a),m=f(h,u,2,-1);m.fx<a[0].fx?(u=f(h,u,3,-2),a=d(a,u.fx<m.fx?u:m)):m.fx>=a[a.length-2].fx?m.fx>u.fx?(h=f(h,u,.5,.5),a=h.fx<u.fx?d(a,h):c(a)):(h=f(h,u,1.5,-.5),a=h.fx<m.fx?d(a,h):c(a)):a=d(a,m)}return a[0]},G=function(a,e,l){e=e.reduce(function(b,d){d=d.r-w(a,d);return d<=b?d:b},Number.MAX_VALUE);return e=l.reduce(function(b,d){d=w(a,d)-d.r;return d<=b?d:b},e)},S=function(a,e){var b=a.reduce(function(b,d){var l=d.r/2;return[{x:d.x,
+y:d.y},{x:d.x+l,y:d.y},{x:d.x-l,y:d.y},{x:d.x,y:d.y+l},{x:d.x,y:d.y-l}].reduce(function(b,d){var l=G(d,a,e);b.margin<l&&(b.point=d,b.margin=l);return b},b)},{point:void 0,margin:-Number.MAX_VALUE}).point,b=R(function(b){return-G({x:b[0],y:b[1]},a,e)},[b.x,b.y]),b={x:b[0],y:b[1]};B(b,a)&&D(b,e)||(b=x(a));return b},T=function(a){var b=a.filter(y);return a.reduce(function(a,e){if(e.value){var d=e.sets;e=d.join();var l=b.reduce(function(a,b){var e=-1<d.indexOf(b.sets[0]);a[e?"internal":"external"].push(b.circle);
+return a},{internal:[],external:[]});a[e]=S(l.internal,l.external)}return a},{})},H=function(a){var b=a.filter(function(a){return 2===a.sets.length}).reduce(function(a,b){b.sets.forEach(function(d,e,l){n(a[d])||(a[d]={overlapping:{},totalOverlap:0});a[d].totalOverlap+=b.value;a[d].overlapping[l[1-e]]=b.value});return a},{});a.filter(y).forEach(function(a){z(a,b[a.sets[0]])});return a},I=function(a,e){return e.totalOverlap-a.totalOverlap},J=function(a){var b=[],l={};a.filter(function(a){return 1===
+a.sets.length}).forEach(function(a){l[a.sets[0]]=a.circle={x:Number.MAX_VALUE,y:Number.MAX_VALUE,r:Math.sqrt(a.value/Math.PI)}});var c=function(a,d){var e=a.circle;e.x=d.x;e.y=d.y;b.push(a)};H(a);var d=a.filter(y).sort(I);c(d.shift(),{x:0,y:0});var k=a.filter(function(a){return 2===a.sets.length});d.forEach(function(a){var d=a.circle,e=d.r,f=a.overlapping,g=b.reduce(function(a,c,g){var h=c.circle,t=C(e,h.r,f[c.sets[0]]),m=[{x:h.x+t,y:h.y},{x:h.x-t,y:h.y},{x:h.x,y:h.y+t},{x:h.x,y:h.y-t}];b.slice(g+
+1).forEach(function(a){var b=a.circle;a=C(e,b.r,f[a.sets[0]]);m=m.concat(A({x:h.x,y:h.y,r:t},{x:b.x,y:b.y,r:a}))});m.forEach(function(b){d.x=b.x;d.y=b.y;var e=F(l,k);e<a.loss&&(a.loss=e,a.coordinates=b)});return a},{loss:Number.MAX_VALUE,coordinates:void 0});c(a,g.coordinates)});return l},U=function(a){var b={};0<a.length&&(b=J(a),a.filter(function(a){return!y(a)}).forEach(function(a){var e=a.sets;a=e.join();e=e.map(function(a){return b[a]});b[a]=v(e)}));return b},K=function(b){var e={};return n(b)&&
+m(b.value)&&-1<b.value&&a(b.sets)&&0<b.sets.length&&!b.sets.some(function(a){var b=!1;!e[a]&&r(a)?e[a]=!0:b=!0;return b})},L=function(b){b=a(b)?b:[];var e=b.reduce(function(a,b){K(b)&&y(b)&&0<b.value&&-1===a.indexOf(b.sets[0])&&a.push(b.sets[0]);return a},[]).sort(),c=b.reduce(function(a,b){K(b)&&!b.sets.some(function(a){return-1===e.indexOf(a)})&&(a[b.sets.sort().join()]=b);return a},{});e.reduce(function(a,b,e,c){c.slice(e+1).forEach(function(d){a.push(b+","+d)});return a},[]).forEach(function(a){if(!c[a]){var b=
+{sets:a.split(","),value:0};c[a]=b}});return O(c)},V=function(a,e,c){var b=c.bottom-c.top,d=c.right-c.left,b=Math.min(0<d?1/d*a:1,0<b?1/b*e:1);return{scale:b,centerX:a/2-(c.right+c.left)/2*b,centerY:e/2-(c.top+c.bottom)/2*b}};N("venn","scatter",{borderColor:"#cccccc",borderDashStyle:"solid",borderWidth:1,brighten:0,clip:!1,colorByPoint:!0,dataLabels:{enabled:!0,formatter:function(){return this.point.name}},marker:!1,opacity:.75,showInLegend:!1,states:{hover:{opacity:1,halo:!1,borderColor:"#333333"},
+select:{color:"#cccccc",borderColor:"#000000",animation:!1}},tooltip:{pointFormat:"{point.name}: {point.value}"}},{isCartesian:!1,axisTypes:[],directTouch:!0,pointArrayMap:["value"],translate:function(){var b=this.chart;this.processedXData=this.xData;this.generatePoints();var c=L(this.options.data),f=U(c),k=T(c),c=Object.keys(f).filter(function(a){return(a=f[a])&&m(a.r)}).reduce(function(a,b){var d=f[b];b=d.x-d.r;var c=d.x+d.r,e=d.y+d.r,d=d.y-d.r;if(!m(a.left)||a.left>b)a.left=b;if(!m(a.right)||a.right<
+c)a.right=c;if(!m(a.top)||a.top>d)a.top=d;if(!m(a.bottom)||a.bottom<e)a.bottom=e;return a},{top:0,bottom:0,left:0,right:0}),b=V(b.plotWidth,b.plotHeight,c),d=b.scale,g=b.centerX,h=b.centerY;this.points.forEach(function(b){var c=a(b.sets)?b.sets:[],e=c.join(),l=f[e],m,e=k[e];l&&(l.r?m={x:g+l.x*d,y:h+l.y*d,r:l.r*d}:l.d&&(m={d:l.d.reduce(function(a,b){"M"===b[0]?(b[1]=g+b[1]*d,b[2]=h+b[2]*d):"A"===b[0]&&(b[1]*=d,b[2]*=d,b[6]=g+b[6]*d,b[7]=h+b[7]*d);return a.concat(b)},[]).join(" ")}),e?(e.x=g+e.x*d,
+e.y=h+e.y*d):e={});b.shapeArgs=m;e&&m&&(b.plotX=e.x,b.plotY=e.y);b.name=b.options.name||c.join("\u2229")})},drawPoints:function(){var a=this,c=a.chart,f=a.group,g=c.renderer;(a.points||[]).forEach(function(b){var d,e=b.shapeArgs;c.styledMode||(d=a.pointAttribs(b,b.state));b.draw({isNew:!b.graphic,animatableAttribs:e,attribs:d,group:f,renderer:g,shapeType:e&&e.d?"path":"circle"})})},pointAttribs:function(a,c){var b=this.options||{};a=M(b,{color:a&&a.color},a&&a.options||{},c&&b.states[c]||{});return{fill:h(a.color).setOpacity(a.opacity).brighten(a.brightness).get(),
+stroke:a.borderColor,"stroke-width":a.borderWidth,dashstyle:a.borderDashStyle}},animate:function(a){if(!a){var b=q.animObject(this.options.animation);this.points.forEach(function(a){var c=a.shapeArgs;if(a.graphic&&c){var d={},e={};c.d?d.opacity=.001:(d.r=0,e.r=c.r);a.graphic.attr(d).animate(e,b);c.d&&setTimeout(function(){a&&a.graphic&&a.graphic.animate({opacity:1})},b.duration)}},this);this.animate=null}},utils:{addOverlapToSets:H,geometry:g,geometryCircles:k,getDistanceBetweenCirclesByOverlap:C,
+layoutGreedyVenn:J,loss:F,processVennData:L,sortByTotalOverlap:I}},{draw:c,shouldDraw:function(){return!!this.shapeArgs},isValid:function(){return m(this.value)}})})(B,z,D,k)});
+//# sourceMappingURL=venn.js.map

data/vendor/assets/javascripts/highstock/modules/venn.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"venn.js.map","lineCount":29,"mappings":"A;;;;;;;;AASC,SAAS,CAACA,CAAD,CAAU,CACM,QAAtB,GAAI,MAAOC,OAAX,EAAkCA,MAAAC,QAAlC,EACIF,CAAA,CAAQ,SAAR,CACA,CADqBA,CACrB,CAAAC,MAAAC,QAAA,CAAiBF,CAFrB,EAG6B,UAAtB,GAAI,MAAOG,OAAX,EAAoCA,MAAAC,IAApC,CACHD,MAAA,CAAO,QAAS,EAAG,CACf,MAAOH,EADQ,CAAnB,CADG,CAKHA,CAAA,CAA8B,WAAtB,GAAA,MAAOK,WAAP,CAAoCA,UAApC,CAAiDC,IAAAA,EAAzD,CATY,CAAnB,CAAA,CAWC,QAAS,CAACD,CAAD,CAAa,CACpB,IAAIE,EAAQ,QAAS,EAAG,CAoDpB,MAnCWA,SAAa,CAACC,CAAD,CAAS,CAAA,IACzBC,EAAQ,IADiB,CAEzBC,EAAUD,CAAAC,QAFe,CAGzBC,EAAoBH,CAAAG,kBAHK,CAIzBC,EAAaJ,CAAAI,WAJY,CAKzBC,EAAML,CAAAK,IALmB,CAMzBC,EAAWN,CAAAM,SAEXL,EAAAM,WAAA,EAAJ,EACSL,CAIL,GAHID,CAAAC,QAGJ,CAHoBA,CAGpB,CAFQI,CAAA,CAASN,CAAAQ,UAAT,CAAA,CAA2BR,CAAAS,UAA3B,CAAAC,IAAA,CAAiDV,CAAAW,MAAjD,CAER,EAAAT,CAAAG,IAAA,CACSA,CADT,CAAAO,KAAA,CAEUZ,CAAAa,QAFV,CAAAC,QAAA,CAIQX,CAJR,CAKQH,CAAAe,MAAA,CAAe,CAAA,CAAf,CAAuBjB,IAAAA,EAL/B,CAMQM,CANR,CALJ,EAaWF,CAbX,EAcIA,CAAAY,QAAA,CAAgBX,CAAhB,CAAmCL,IAAAA,EAAnC,CAA8C,QAAS,EAAG,CACtDG,CAAAC,QAAA;AAAgBA,CAAhB,CAA0BA,CAAAc,QAAA,EAtCd,WAuCZ,GAvCD,MAuCUZ,EAAT,EACIA,CAAA,EAHkD,CAA1D,CAOAF,EAAJ,EACIA,CAAAe,SAAA,CAAiBhB,CAAAiB,aAAA,EAAjB,CAAuC,CAAA,CAAvC,CA9ByB,CAjBb,CAAZ,EAAZ,CAsDIC,EAAY,QAAS,EAAG,CAmDxB,MAPeA,CACXC,sBALwBA,QAA8B,CAACC,CAAD,CAAKC,CAAL,CAAS,CAC/D,MAAOC,KAAAC,MAAA,CAAWF,CAAAG,EAAX,CAAkBJ,CAAAI,EAAlB,CAAwBH,CAAAI,EAAxB,CAA+BL,CAAAK,EAA/B,CADwD,CAIpDP,CAEXQ,kBAxCoBA,QAA0B,CAACC,CAAD,CAAS,CACvD,IAAIC,EAAMD,CAAAE,OAAA,CAAc,QAAS,CAACD,CAAD,CAAM5B,CAAN,CAAa,CAC1C4B,CAAAJ,EAAA,EAASxB,CAAAwB,EACTI,EAAAH,EAAA,EAASzB,CAAAyB,EACT,OAAOG,EAHmC,CAApC,CAIP,CAAEJ,EAAG,CAAL,CAAQC,EAAG,CAAX,CAJO,CAMV,OAAO,CACHD,EAAGI,CAAAJ,EAAHA,CAAWG,CAAAG,OADR,CAEHL,EAAGG,CAAAH,EAAHA,CAAWE,CAAAG,OAFR,CAPgD,CAsC5CZ,CAGXa,yBApB2BA,QAAiC,CAACX,CAAD,CAAKC,CAAL,CAAS,CACrE,MAAOC,KAAAU,KAAA,CAAUV,IAAAW,IAAA,CAASZ,CAAAG,EAAT,CAAgBJ,CAAAI,EAAhB,CAAsB,CAAtB,CAAV,CAAqCF,IAAAW,IAAA,CAASZ,CAAAI,EAAT,CAAgBL,CAAAK,EAAhB,CAAsB,CAAtB,CAArC,CAD8D,CAiB1DP,CA5CS,CAAZ,EAtDhB,CA2GIgB,EAAmB,QAAS,CAAChB,CAAD,CAAW,CAAA,IACnCC,EAAwBD,CAAAC,sBADW,CAEnCO,EAAoBR,CAAAQ,kBAFe,CAGnCK,EAA2Bb,CAAAa,yBAHQ;AAKnCI,EAAQA,QAAc,CAACX,CAAD,CAAIY,CAAJ,CAAc,CAChCC,CAAAA,CAAIf,IAAAW,IAAA,CAAS,EAAT,CAAaG,CAAb,CAER,OAAOd,KAAAa,MAAA,CAAWX,CAAX,CAAea,CAAf,CAAP,CAA2BA,CAHS,CALD,CAoBnCC,EAAyBA,QAA+B,CAACC,CAAD,CAAIC,CAAJ,CAAO,CAC/D,MAAOD,EAAP,CAAWA,CAAX,CAAejB,IAAAmB,KAAA,CAAU,CAAV,CAAcD,CAAd,CAAkBD,CAAlB,CAAf,EAAuCA,CAAvC,CAA2CC,CAA3C,EAAgDlB,IAAAU,KAAA,CAAUQ,CAAV,EAAe,CAAf,CAAmBD,CAAnB,CAAuBC,CAAvB,EADe,CApB5B,CA0EnCE,EACJA,QAAoC,CAACC,CAAD,CAAKC,CAAL,CAAS,CAAA,IACrCC,EAAId,CAAA,CAAyBY,CAAzB,CAA6BC,CAA7B,CADiC,CAErCE,EAAKH,CAAAJ,EAFgC,CAGrCQ,EAAKH,CAAAL,EAHgC,CAIrCZ,EAAS,EAEb,IAAIkB,CAAJ,CAAQC,CAAR,CAAaC,CAAb,EAAmBF,CAAnB,CAAuBvB,IAAA0B,IAAA,CAASF,CAAT,CAAcC,CAAd,CAAvB,CAA0C,CAGlCE,IAAAA,EAAWH,CAAXG,CAAgBH,CAAhBG,CAGAzB,GAAKyB,CAALzB,CAFWuB,CAEXvB,CAFgBuB,CAEhBvB,CAA2BqB,CAA3BrB,CAA+BqB,CAA/BrB,GAAqC,CAArCA,CAAyCqB,CAAzCrB,CAHAyB,CAKAxB,EAAIH,IAAAU,KAAA,CAAUiB,CAAV,CAAqBzB,CAArB,CAAyBA,CAAzB,CALJyB,CAMAC,EAAKP,CAAAnB,EANLyB,CAOAE,EAAKP,CAAApB,EACL4B,EAAAA,CAAKT,CAAAlB,EAX6B,KAYlC4B,EAAKT,CAAAnB,EACL6B,EAAAA,CAAKJ,CAALI,CAAU9B,CAAV8B,EAAeH,CAAfG,CAAoBJ,CAApBI,EAA0BT,CAC1BU,EAAAA,CAAKH,CAALG,CAAU/B,CAAV+B,EAAeF,CAAfE,CAAoBH,CAApBG,EAA0BV,CAC1BW,EAAAA,CAAmB/B,CAAnB+B,CAAuBX,CAAvBW,CAAK,EAAEH,CAAF,CAAOD,CAAP,CACLK,EAAAA,CAAmBhC,CAAnBgC,CAAuBZ,CAAvBY,CAAK,EAAEN,CAAF,CAAOD,CAAP,CAETvB,EAAA,CAAS,CACL,CAAEH,EAAGW,CAAA,CAAMmB,CAAN,CAAWE,CAAX,CAAe,EAAf,CAAL,CAAyB/B,EAAGU,CAAA,CAAMoB,CAAN,CAAWE,CAAX,CAAe,EAAf,CAA5B,CADK,CAEL,CAAEjC,EAAGW,CAAA,CAAMmB,CAAN,CAAWE,CAAX,CAAe,EAAf,CAAL,CAAyB/B,EAAGU,CAAA,CAAMoB,CAAN,CAAWE,CAAX,CAAe,EAAf,CAA5B,CAFK,CAlB6B,CAuB1C,MAAO9B,EA7BkC,CA3EN,CAiHnC+B,EAA+BA,QAA8B,CAACC,CAAD,CAAU,CACvE,MAAOA,EAAA9B,OAAA,CAAe,QAAS,CAACF,CAAD,CAASgB,CAAT,CAAaiB,CAAb,CAAgBC,CAAhB,CAAqB,CAC5CC,CAAAA,CAAaD,CAAAE,MAAA,CAAUH,CAAV,CAAc,CAAd,CAAA/B,OAAA,CACL,QAAS,CAACF,CAAD,CAASiB,CAAT,CAAaoB,CAAb,CAAgB,CAC7B,IAAIC,EAAU,CAACL,CAAD,CAAII,CAAJ,CAAQJ,CAAR,CAAY,CAAZ,CAEd;MAAOjC,EAAAuC,OAAA,CACHxB,CAAA,CAA4BC,CAA5B,CAAgCC,CAAhC,CAAAuB,IAAA,CACS,QAAS,CAACC,CAAD,CAAI,CACdA,CAAAH,QAAA,CAAYA,CACZ,OAAOG,EAFO,CADtB,CADG,CAHsB,CADpB,CAWV,EAXU,CAajB,OAAOzC,EAAAuC,OAAA,CAAcJ,CAAd,CAdyC,CAA7C,CAeJ,EAfI,CADgE,CAjHpC,CA2InCO,EAAsBA,QAA4B,CAACrE,CAAD,CAAQsE,CAAR,CAAgB,CAClE,MAAOvC,EAAA,CAAyB/B,CAAzB,CAAgCsE,CAAhC,CAAP,EAAkDA,CAAA/B,EAAlD,CAA6D,KADK,CA3I/B,CAuJnCgC,EAA0BA,QAAgC,CAACvE,CAAD,CAAQ2D,CAAR,CAAiB,CAC3E,MAAO,CAACA,CAAAa,KAAA,CAAa,QAAS,CAACF,CAAD,CAAS,CACnC,MAAO,CAACD,CAAA,CAAoBrE,CAApB,CAA2BsE,CAA3B,CAD2B,CAA/B,CADmE,CAqJ/E,OAbsBpC,CAClBuC,oCAxGJA,QAA4C,CAACd,CAAD,CAAU,CAAA,IAC9Ce,EAAqBhB,CAAA,CAA6BC,CAA7B,CAAAgB,OAAA,CACT,QAAS,CAACP,CAAD,CAAI,CACjB,MAAOG,EAAA,CAAwBH,CAAxB,CAA2BT,CAA3B,CADU,CADJ,CADyB,CAK9CiB,CAEJ,IAAgC,CAAhC,CAAIF,CAAA5C,OAAJ,CAAmC,CAE/B,IAAI+C,EAASnD,CAAA,CAAkBgD,CAAlB,CAAb,CAEAA,EAAqBA,CAAAP,IAAA,CAEZ,QAAS,CAACC,CAAD,CAAI,CACdA,CAAAU,MAAA,CAAU3D,CAAA,CAAsB0D,CAAtB,CAA8BT,CAA9B,CACV,OAAOA,EAFO,CAFD,CAAAW,KAAA,CAOX,QAAS,CAAC1C,CAAD,CAAI2C,CAAJ,CAAO,CAClB,MAAOA,EAAAF,MAAP,CAAiBzC,CAAAyC,MADC,CAPL,CAFrB,CAaIG,EAAaP,CAAA,CAAmBA,CAAA5C,OAAnB,CAA+C,CAA/C,CAbjB,CAcIoD,EAAOR,CAAA7C,OAAA,CACC,QAAS,CAACsD,CAAD,CAAO/D,CAAP,CAAW,CAAA,IACpB6D,EAAaE,CAAAF,WADO,CAEpBG,EAAW1D,CAAA,CAAkB,CAACuD,CAAD,CAAa7D,CAAb,CAAlB,CAFS,CAMpBiE,EAAMjE,CAAA6C,QAAAU,OAAA,CAGE,QAAS,CAACW,CAAD,CAAQ,CACrB,MAA4C,EAA5C;AAAOL,CAAAhB,QAAAsB,QAAA,CAA2BD,CAA3B,CADc,CAHnB,CAAAzD,OAAA,CAQE,QAAS,CAACwD,CAAD,CAAMC,CAAN,CAAa,CACtBhB,CAAAA,CAASX,CAAA,CAAQ2B,CAAR,CADa,KAEtBE,EAASrE,CAAA,CAAsBmD,CAAtB,CAA8BlD,CAA9B,CAFa,CAGtBqE,EAAStE,CAAA,CAAsBmD,CAAtB,CAA8BW,CAA9B,CAHa,CAMtBH,EAAQW,CAARX,EAFYW,CAEZX,CAFqBU,CAErBV,EADKW,CAAA,CAASD,CAAT,CAAkB,CAAlB,CAAsBlE,IAAAoE,GAAtB,CAAgC,CACrCZ,GAA6B,CANP,CAOtBa,EAAQ5D,CAAA,CACJqD,CADI,CAEJ,CACI5D,EAAG8C,CAAA9C,EAAHA,CAAc8C,CAAA/B,EAAdf,CAAyBF,IAAAsE,IAAA,CAASd,CAAT,CAD7B,CAEIrD,EAAG6C,CAAA7C,EAAHA,CAAc6C,CAAA/B,EAAdd,CAAyBH,IAAAuE,IAAA,CAASf,CAAT,CAF7B,CAFI,CAORvC,EAAAA,CAAI+B,CAAA/B,EAIJoD,EAAJ,CAAgB,CAAhB,CAAYpD,CAAZ,GACIoD,CADJ,CACgB,CADhB,CACYpD,CADZ,CAIA,IAAK8C,CAAAA,CAAL,EAAYA,CAAAM,MAAZ,CAAwBA,CAAxB,CACIN,CAAA,CAAM,CACF9C,EAAGA,CADD,CAEFuD,SAAUH,CAAA,CAAQpD,CAAR,CAAY,CAAZ,CAAgB,CAFxB,CAGFoD,MAAOA,CAHL,CAIFnE,EAAGJ,CAAAI,EAJD,CAKFC,EAAGL,CAAAK,EALD,CAUV,OAAO4D,EAjCmB,CARxB,CA0CH,IA1CG,CA6CV,IAAIA,CAAJ,CAAS,CACL,IAAI9C,EAAI8C,CAAA9C,EAER4C,EAAAD,KAAAa,KAAA,CACI,CAAC,GAAD,CAAMxD,CAAN,CAASA,CAAT,CAAY,CAAZ,CAAe8C,CAAAS,SAAf,CAA6B,CAA7B,CAAgCT,CAAA7D,EAAhC,CAAuC6D,CAAA5D,EAAvC,CADJ,CAGA0D,EAAAF,WAAA,CAAkB7D,CANb,CAQT,MAAO+D,EA3DiB,CADrB,CA6DJ,CACCF,WAAYA,CADb,CAECC,KAAM,EAFP,CA7DI,CAAAA,KAkES,EAApB,GAAIA,CAAApD,OAAJ,EAC2B,CAD3B,GACWoD,CAAApD,OADX,GAGIoD,CAAAc,QAAA,CAAa,CAAC,GAAD,CAAMf,CAAAzD,EAAN,CAAoByD,CAAAxD,EAApB,CAAb,CACA,CAAAmD,CAAA,CAAS,CACLC,OAAQA,CADH,CAELhC,EAAGqC,CAFE,CAJb,CAlF+B,CA6FnC,MAAON,EApG2C,CAuGhC1C,CAElBQ,4BAA6BA,CAFXR,CAGlBwB,6BAA8BA,CAHZxB;AAIlBI,uBAAwBA,CAJNJ,CAKlB+D,yBAjQJA,QAAiC,CAACnD,CAAD,CAAKC,CAAL,CAASF,CAAT,CAAY,CACzC,IAAIqD,EAAU,CAId,IAAIrD,CAAJ,CAAQC,CAAR,CAAaC,CAAb,CAAiB,CACTE,IAAAA,EAAWH,CAAXG,CAAgBH,CAAhBG,CACAkD,EAAWpD,CAAXoD,CAAgBpD,CAEhBF,EAAJ,EAASvB,IAAA0B,IAAA,CAASD,CAAT,CAAcD,CAAd,CAAT,CAGIoD,CAHJ,CAGc5E,IAAAoE,GAHd,CAGwBpE,IAAA8E,IAAA,CAASnD,CAAT,CAAmBkD,CAAnB,CAHxB,EAMQE,CAIJ,EAJUpD,CAIV,CAJqBkD,CAIrB,CAJgCtD,CAIhC,CAJoCA,CAIpC,GAJ0C,CAI1C,CAJ8CA,CAI9C,EAFSA,CAET,EAFawD,CAEb,CAAAH,CAAA,CACI5D,CAAA,CAAuBQ,CAAvB,CAA2BA,CAA3B,CAAgCuD,CAAhC,CADJ,CAEI/D,CAAA,CAAuBS,CAAvB,CAA2BA,CAA3B,CAAgCuD,CAAhC,CAZR,CAgBAJ,EAAA,CAAU/D,CAAA,CAAM+D,CAAN,CAAe,EAAf,CApBG,CAsBjB,MAAOA,EA3BkC,CA4PvBhE,CAMlBmC,oBAAqBA,CANHnC,CAOlBqC,wBAAyBA,CAPPrC,CAQlBqE,yBA/HJA,QAAiC,CAACvG,CAAD,CAAQ2D,CAAR,CAAiB,CAC9C,MAAO,CAACA,CAAAa,KAAA,CAAa,QAAS,CAACF,CAAD,CAAS,CACnC,MAAOD,EAAA,CAAoBrE,CAApB,CAA2BsE,CAA3B,CAD4B,CAA/B,CADsC,CAuH5BpC,CASlBC,MAAOA,CATWD,CA/RiB,CAApB,CA6SrBhB,CA7SqB,CA8StB,UAAS,CAACpB,CAAD,CAAOoB,CAAP,CAAiBgB,CAAjB,CAAkCsE,CAAlC,CAAqC,CAAA,IAgBvCC,EAAQD,CAAAE,MAhB+B,CAiBvCC,EAASH,CAAAG,OAjB8B,CAkBvClC,EACIvC,CAAAuC,oCAnBmC,CAoBvC/B,EAA8BR,CAAAQ,4BApBS,CAqBvChB,EAAoBR,CAAAQ,kBArBmB,CAsBvCK,EAA2Bb,CAAAa,yBAtBY;AAuBvC6E,EACI1E,CAAA+D,yBAxBmC,CAyBvCY,EAAUL,CAAAK,QAzB6B,CA0BvCC,EAAWN,CAAAM,SA1B4B,CA2BvCC,EAAWP,CAAAO,SA3B4B,CA4BvCxC,EAA0BrC,CAAAqC,wBA5Ba,CA6BvCgC,EAA2BrE,CAAAqE,yBA7BY,CA8BvCS,EAAWR,CAAAQ,SA9B4B,CA+BvCC,EAAQT,CAAAS,MA/B+B,CAgCvCC,EAAaV,CAAAU,WAhC0B,CAkCvCC,EAAeA,QAAqB,CAACC,CAAD,CAAM,CAC1C,MAAOC,OAAAC,KAAA,CAAYF,CAAZ,CAAAjD,IAAA,CAAqB,QAAS,CAAC3C,CAAD,CAAI,CACrC,MAAO4F,EAAA,CAAI5F,CAAJ,CAD8B,CAAlC,CADmC,CAlCH,CA+CvCyE,EAA2BA,QAAiC,CAACtC,CAAD,CAAU,CACtE,IAAIuC,EAAU,CAIS,EAAvB,GAAIvC,CAAA7B,OAAJ,GACQyF,CAGJ,CAHc5D,CAAA,CAAQ,CAAR,CAGd,CAFI6D,CAEJ,CAFc7D,CAAA,CAAQ,CAAR,CAEd,CAAAuC,CAAA,CAAUU,CAAA,CACNW,CAAAhF,EADM,CAENiF,CAAAjF,EAFM,CAGNR,CAAA,CAAyBwF,CAAzB,CAAkCC,CAAlC,CAHM,CAJd,CAWA,OAAOtB,EAhB+D,CA/C/B,CA2EvCuB,EAAOA,QAAa,CAACC,CAAD,CAAkBC,CAAlB,CAA6B,CAIjD,MAAOA,EAAA9F,OAAA,CAAiB,QAAS,CAAC+F,CAAD,CAAYC,CAAZ,CAAsB,CACnD,IAAIJ,EAAO,CAEgB,EAA3B,CAAII,CAAAC,KAAAhG,OAAJ,GACQiG,CAWJ,CAXoBF,CAAAG,MAWpB,CATIC,CASJ,CAToBhC,CAAA,CAEhB4B,CAAAC,KAAA3D,IAAA,CAAkB,QAAS,CAAC+D,CAAD,CAAM,CAC7B,MAAOR,EAAA,CAAgBQ,CAAhB,CADsB,CAAjC,CAFgB,CASpB,CAFIC,CAEJ,CAFWJ,CAEX,CAF2BE,CAE3B,CAAAR,CAAA,CAAOnG,IAAAa,MAAA,CAAYgG,CAAZ,CAAmBA,CAAnB,CAlBCC,IAkBD,CAAP,CAlBQA,IAMZ,CAgBA,OAAOR,EAAP,CAAmBH,CAnBgC,CAAhD,CAoBJ,CApBI,CAJ0C,CA3EV,CAqHvCY,EAASA,QAAe,CAACC,CAAD,CAAIjG,CAAJ;AAAO2C,CAAP,CAAUuD,CAAV,CAAqBC,CAArB,CAAoC,CAAA,IACxDC,EAAKH,CAAA,CAAEjG,CAAF,CADmD,CAExDqG,EAAKJ,CAAA,CAAEtD,CAAF,CACL2D,EAAAA,CAAOH,CAAPG,EAAwB,GACxBC,EAAAA,CAAML,CAANK,EAAmB,KAJqC,KAKxDC,EAAQ7D,CAAR6D,CAAYxG,CAL4C,CAMxDyG,EAAI,CANoD,CAOxDtH,CAPwD,CAOrDuH,CAEP,IAAI1G,CAAJ,EAAS2C,CAAT,CACI,KAAUgE,MAAJ,CAAU,2BAAV,CAAN,CACG,GAAc,CAAd,CAAIP,CAAJ,CAASC,CAAT,CACH,KAAUM,MAAJ,CAAU,yCAAV,CAAN,CAGJ,GAAW,CAAX,GAAIP,CAAJ,CACIjH,CAAA,CAAIa,CADR,KAEO,IAAW,CAAX,GAAIqG,CAAJ,CACHlH,CAAA,CAAIwD,CADD,KAGH,KAAA,CAAO8D,CAAA,EAAP,EAAcH,CAAd,EAA6B,CAA7B,GAAsBI,CAAtB,EAAkCF,CAAlC,CAA0CD,CAA1C,CAAA,CACIC,CAKA,EALS7D,CAKT,CALa3C,CAKb,EALkB,CAKlB,CAJAb,CAIA,CAJIa,CAIJ,CAJQwG,CAIR,CAHAE,CAGA,CAHKT,CAAA,CAAE9G,CAAF,CAGL,CAAc,CAAd,CAAIiH,CAAJ,CAASM,CAAT,CACI1G,CADJ,CACQb,CADR,CAGIwD,CAHJ,CAGQxD,CAKhB,OAAOA,EAlCqD,CArHrB,CAsKvCyH,EACJA,QAA2C,CAACnG,CAAD,CAAKC,CAAL,CAASmD,CAAT,CAAkB,CAAA,IACrDgD,EAAcpG,CAAdoG,CAAmBnG,CADkC,CAErDoG,EAAWD,CAED,EAAd,CAAIhD,CAAJ,GACIiD,CADJ,CACed,CAAA,CAAO,QAAS,CAAC7G,CAAD,CAAI,CACvByG,CAAAA,CAAgBrB,CAAA,CAAmC9D,CAAnC,CAAuCC,CAAvC,CAA2CvB,CAA3C,CAGpB,OAAO0E,EAAP,CAAiB+B,CAJU,CAApB,CAKR,CALQ,CAKLiB,CALK,CADf,CAQA,OAAOC,EAZkD,CAvKlB,CAsLvCC,EAAQA,QAAS,CAAC5H,CAAD,CAAI,CACrB,MAAOqF,EAAA,CAAQrF,CAAAsG,KAAR,CAAP,EAA4C,CAA5C,GAA0BtG,CAAAsG,KAAAhG,OADL,CAtLkB,CAmMvCuH,EAAaA,QAAmB,CAACC,CAAD,CAAKC,CAAL,CAAc,CAAA,IAE1CC,EAAWA,QAAS,CAACnH,CAAD,CAAI2C,CAAJ,CAAO,CACvB,MAAO3C,EAAAoH,GAAP,CAAczE,CAAAyE,GADS,CAFe,CAW1CC,EAAcA,QAAoB,CAACC,CAAD,CAAUC,CAAV,CAAcC,CAAd,CAAuBC,CAAvB,CAA2B,CAC7D,MAAOF,EAAAzF,IAAA,CAAO,QAAS,CAAC3C,CAAD;AAAIoC,CAAJ,CAAO,CAC1B,MAAO+F,EAAP,CAAiBnI,CAAjB,CAAqBqI,CAArB,CAA+BC,CAAA,CAAGlG,CAAH,CADL,CAAvB,CADsD,CAXnB,CAoC1CmG,EAAgBA,QAAS,CAACC,CAAD,CAAUhK,CAAV,CAAiB,CAC1CA,CAAAyJ,GAAA,CAAWH,CAAA,CAAGtJ,CAAH,CACXgK,EAAA,CAAQA,CAAAlI,OAAR,CAAyB,CAAzB,CAAA,CAA8B9B,CAC9B,OAAOgK,EAHmC,CApCA,CA0C1CC,EAAgBA,QAAS,CAACD,CAAD,CAAU,CACnC,IAAIE,EAAOF,CAAA,CAAQ,CAAR,CAEX,OAAOA,EAAA7F,IAAA,CAAY,QAAS,CAACnE,CAAD,CAAQ,CAC5BoE,CAAAA,CAAIsF,CAAA,CAAY,EAAZ,CAAyBQ,CAAzB,CArCFC,EAqCE,CAAwCnK,CAAxC,CAERoE,EAAAqF,GAAA,CAAOH,CAAA,CAAGlF,CAAH,CACP,OAAOA,EAJyB,CAA7B,CAH4B,CA1CO,CAqD1CgG,EAAcA,QAAS,CAACJ,CAAD,CAAU,CASjC,IATiC,IAE7BlI,EADMkI,CAAAjG,MAAAF,CAAc,CAAdA,CAAkB,EAAlBA,CACG/B,OAFoB,CAG7B8C,EAAS,EAHoB,CAI7BhD,EAAMA,QAAS,CAACuD,CAAD,CAAOnF,CAAP,CAAc,CACzBmF,CAAAvD,IAAA,EAAY5B,CAAA,CAAMmF,CAAAvB,EAAN,CACZ,OAAOuB,EAFkB,CAJA,CASxBvB,EAAI,CAAb,CAAgBA,CAAhB,CAAoB9B,CAApB,CAA4B8B,CAAA,EAA5B,CACIgB,CAAA,CAAOhB,CAAP,CAAA,CAAYoG,CAAAnI,OAAA,CAAeD,CAAf,CAAoB,CAAEA,IAAK,CAAP,CAAUgC,EAAGA,CAAb,CAApB,CAAAhC,IAAZ,CAAwDE,CAE5D,OAAO8C,EAZ0B,CArDS,CAoE1CyF,EAAWA,QAAS,CAACC,CAAD,CAAWC,CAAX,CAAkBlI,CAAlB,CAAqB2C,CAArB,CAAwB,CACxChF,CAAAA,CAAQ0J,CAAA,CAAYrH,CAAZ,CAAeiI,CAAf,CAAyBtF,CAAzB,CAA4BuF,CAA5B,CAEZvK,EAAAyJ,GAAA,CAAWH,CAAA,CAAGtJ,CAAH,CACX,OAAOA,EAJqC,CAQ5CgK,EAAAA,CA3DaQ,QAAmB,CAACjB,CAAD,CAAU,CAAA,IACtCT,EAAIS,CAAAzH,OADkC,CAEtCkI,EAAcS,KAAJ,CAAU3B,CAAV,CAAc,CAAd,CAGdkB,EAAA,CAAQ,CAAR,CAAA,CAAaT,CACbS,EAAA,CAAQ,CAAR,CAAAP,GAAA,CAAgBH,CAAA,CAAGC,CAAH,CAGhB,KAAK,IAAI3F,EAAI,CAAb,CAAgBA,CAAhB,CAAoBkF,CAApB,CAAuB,EAAElF,CAAzB,CAA4B,CACxB,IAAI5D,EAAQuJ,CAAAxF,MAAA,EAEZ/D,EAAA,CAAM4D,CAAN,CAAA,CAAW5D,CAAA,CAAM4D,CAAN,CAAA,CAAsB,IAAtB,CAAW5D,CAAA,CAAM4D,CAAN,CAAX,CAA6B,IACxC5D,EAAAyJ,GAAA,CAAWH,CAAA,CAAGtJ,CAAH,CACXgK,EAAA,CAAQpG,CAAR;AAAY,CAAZ,CAAA,CAAiB5D,CALO,CAO5B,MAAOgK,EAhBmC,CA2DhC,CAAWT,CAAX,CAGd,KAAK,IAAI3F,EAAI,CAAb,CA9EoB4E,GA8EpB,CAAgB5E,CAAhB,CAAmCA,CAAA,EAAnC,CAAwC,CAEpCoG,CAAAjF,KAAA,CAAayE,CAAb,CAGA,KAAIe,EAAQP,CAAA,CAAQA,CAAAlI,OAAR,CAAyB,CAAzB,CAAZ,CACIwI,EAAWF,CAAA,CAAYJ,CAAZ,CADf,CAIIU,EAAYL,CAAA,CAASC,CAAT,CAAmBC,CAAnB,CAA0B,CAA1B,CAAoC,EAApC,CAEZG,EAAAjB,GAAJ,CAAmBO,CAAA,CAAQ,CAAR,CAAAP,GAAnB,EAEQkB,CAEJ,CAFeN,CAAA,CAASC,CAAT,CAAmBC,CAAnB,CAA0B,CAA1B,CAAoC,EAApC,CAEf,CAAAP,CAAA,CAAUD,CAAA,CACNC,CADM,CAELW,CAAAlB,GAAD,CAAeiB,CAAAjB,GAAf,CAA+BkB,CAA/B,CAA0CD,CAFpC,CAJd,EAQWA,CAAAjB,GAAJ,EAAoBO,CAAA,CAAQA,CAAAlI,OAAR,CAAyB,CAAzB,CAAA2H,GAApB,CAKCiB,CAAAjB,GAAJ,CAAmBc,CAAAd,GAAnB,EAGImB,CAEI,CAFSP,CAAA,CAASC,CAAT,CAAmBC,CAAnB,CAA0B,EAA1B,CAAoC,EAApC,CAET,CAAAP,CAAA,CADAY,CAAAnB,GAAJ,CAAoBc,CAAAd,GAApB,CACcM,CAAA,CAAcC,CAAd,CAAuBY,CAAvB,CADd,CAGcX,CAAA,CAAcD,CAAd,CAPlB,GAWIY,CAEI,CAFSP,CAAA,CAASC,CAAT,CAAmBC,CAAnB,CAA0B,GAA1B,CA1GbM,GA0Ga,CAET,CAAAb,CAAA,CADAY,CAAAnB,GAAJ,CAAoBiB,CAAAjB,GAApB,CACcM,CAAA,CAAcC,CAAd,CAAuBY,CAAvB,CADd,CAGcX,CAAA,CAAcD,CAAd,CAflB,CALG,CAwBHA,CAxBG,CAwBOD,CAAA,CAAcC,CAAd,CAAuBU,CAAvB,CA3CsB,CA+CxC,MAAOV,EAAA,CAAQ,CAAR,CA9HuC,CAnMP,CA+UvCc,EACJA,QAA6B,CAAC9K,CAAD,CAAQ+K,CAAR,CAAkBC,CAAlB,CAA4B,CACjDC,CAAAA,CAASF,CAAAlJ,OAAA,CAAgB,QAAS,CAACoJ,CAAD,CAAS3G,CAAT,CAAiB,CAC/C4G,CAAAA,CAAI5G,CAAA/B,EAAJ2I,CAAenJ,CAAA,CAAyB/B,CAAzB,CAAgCsE,CAAhC,CAEnB,OAAQ4G,EAAD,EAAMD,CAAN,CAAgBC,CAAhB,CAAoBD,CAHwB,CAA1C,CAIVE,MAAAC,UAJU,CAYb,OANAH,EAMA,CANSD,CAAAnJ,OAAA,CAAgB,QAAS,CAACoJ,CAAD,CAAS3G,CAAT,CAAiB,CAC3C4G,CAAAA,CAAInJ,CAAA,CAAyB/B,CAAzB,CAAgCsE,CAAhC,CAAJ4G,CAA8C5G,CAAA/B,EAElD,OAAQ2I,EAAD,EAAMD,CAAN,CAAgBC,CAAhB,CAAoBD,CAHoB,CAA1C,CAINA,CAJM,CAP4C,CAhVd,CA2WvCI,EAAmBA,QAAyB,CAACN,CAAD,CAAWC,CAAX,CAAqB,CAEjE,IAAId,EAAOa,CAAAlJ,OAAA,CAAgB,QAAS,CAACqI,CAAD,CAAO5F,CAAP,CAAe,CAC/C,IAAIzB,EAAIyB,CAAA/B,EAAJM,CAAe,CAInB,OAAO,CACH,CAAErB,EAAG8C,CAAA9C,EAAL;AAAeC,EAAG6C,CAAA7C,EAAlB,CADG,CAEH,CAAED,EAAG8C,CAAA9C,EAAHA,CAAcqB,CAAhB,CAAmBpB,EAAG6C,CAAA7C,EAAtB,CAFG,CAGH,CAAED,EAAG8C,CAAA9C,EAAHA,CAAcqB,CAAhB,CAAmBpB,EAAG6C,CAAA7C,EAAtB,CAHG,CAIH,CAAED,EAAG8C,CAAA9C,EAAL,CAAeC,EAAG6C,CAAA7C,EAAHA,CAAcoB,CAA7B,CAJG,CAKH,CAAErB,EAAG8C,CAAA9C,EAAL,CAAeC,EAAG6C,CAAA7C,EAAHA,CAAcoB,CAA7B,CALG,CAAAhB,OAAA,CAQK,QAAS,CAACqI,CAAD,CAAOlK,CAAP,CAAc,CAC3B,IAAIiL,EAASH,CAAA,CAAqB9K,CAArB,CAA4B+K,CAA5B,CAAsCC,CAAtC,CAGTd,EAAAe,OAAJ,CAAkBA,CAAlB,GACIf,CAAAlK,MACA,CADaA,CACb,CAAAkK,CAAAe,OAAA,CAAcA,CAFlB,CAIA,OAAOf,EARoB,CAR5B,CAiBAA,CAjBA,CALwC,CAAxC,CAuBR,CACClK,MAAOH,IAAAA,EADR,CAECoL,OAAQ,CAACE,MAAAC,UAFV,CAvBQ,CAAApL,MAAX,CA6BIsL,EAAUjC,CAAA,CACV,QAAS,CAACjF,CAAD,CAAI,CACT,MAAO,CACH0G,CAAA,CAAqB,CAAEtJ,EAAG4C,CAAA,CAAE,CAAF,CAAL,CAAW3C,EAAG2C,CAAA,CAAE,CAAF,CAAd,CAArB,CAA2C2G,CAA3C,CAAqDC,CAArD,CAFK,CADH,CAMV,CAACd,CAAA1I,EAAD,CAAS0I,CAAAzI,EAAT,CANU,CA7Bd,CAuCAyI,EAAO,CACH1I,EAAG8J,CAAA,CAAQ,CAAR,CADA,CAEH7J,EAAG6J,CAAA,CAAQ,CAAR,CAFA,CAMH/G,EAAA,CAAwB2F,CAAxB,CAA8Ba,CAA9B,CADJ,EAEIxE,CAAA,CAAyB2D,CAAzB,CAA+Bc,CAA/B,CAFJ,GAMId,CANJ,CAMWxI,CAAA,CAAkBqJ,CAAlB,CANX,CAUA,OAAOb,EAxD0D,CA3W1B,CA8avCqB,EAAoBA,QAA0B,CAAC5D,CAAD,CAAY,CAC1D,IAAI6D,EAAa7D,CAAAhD,OAAA,CAAiByE,CAAjB,CAEjB,OAAOzB,EAAA9F,OAAA,CAAiB,QAAS,CAACsC,CAAD,CAAM0D,CAAN,CAAgB,CAC7C,GAAIA,CAAAG,MAAJ,CAAoB,CAAA,IACZF,EAAOD,CAAAC,KACP2D,EAAAA,CAAK3D,CAAA4D,KAAA,EADT,KAGIvG,EAAOqG,CAAA3J,OAAA,CAAkB,QAAS,CAACsD,CAAD,CAAO+C,CAAP,CAAY,CAAA,IAGtCyD,EAA0C,EAA1CA,CAAa7D,CAAAvC,QAAA,CAAa2C,CAAAJ,KAAA,CAAS,CAAT,CAAb,CAIjB3C,EAAA,CAHewG,CAAAC,CAAa,UAAbA,CAA0B,UAGzC,CAAA7F,KAAA,CAAoBmC,CAAA5D,OAApB,CACA;MAAOa,EARmC,CAAvC,CASJ,CACC4F,SAAU,EADX,CAECC,SAAU,EAFX,CATI,CAeX7G,EAAA,CAAIsH,CAAJ,CAAA,CAAUJ,CAAA,CACNlG,CAAA4F,SADM,CAEN5F,CAAA6F,SAFM,CAnBM,CAwBpB,MAAO7G,EAzBsC,CAA1C,CA0BJ,EA1BI,CAHmD,CA9anB,CAydvC0H,EAAmBA,QAAyB,CAAClE,CAAD,CAAY,CAExD,IAAImE,EAAiBnE,CAAAhD,OAAA,CAET,QAAS,CAACkD,CAAD,CAAW,CACxB,MAAgC,EAAhC,GAAOA,CAAAC,KAAAhG,OADiB,CAFX,CAAAD,OAAA,CAMT,QAAS,CAACsC,CAAD,CAAM0D,CAAN,CAAgB,CAClBA,CAAAC,KAEXiE,QAAA,CAAa,QAAS,CAAC7D,CAAD,CAAMtE,CAAN,CAASC,CAAT,CAAc,CAC3BkD,CAAA,CAAS5C,CAAA,CAAI+D,CAAJ,CAAT,CAAL,GACI/D,CAAA,CAAI+D,CAAJ,CADJ,CACe,CACP8D,YAAa,EADN,CAEPC,aAAc,CAFP,CADf,CAMA9H,EAAA,CAAI+D,CAAJ,CAAA+D,aAAA,EAAyBpE,CAAAG,MACzB7D,EAAA,CAAI+D,CAAJ,CAAA8D,YAAA,CAAqBnI,CAAA,CAAI,CAAJ,CAAQD,CAAR,CAArB,CAAA,CAAmCiE,CAAAG,MARH,CAApC,CAUA,OAAO7D,EAbsB,CANhB,CAoBd,EApBc,CAsBrBwD,EAAAhD,OAAA,CAEYyE,CAFZ,CAAA2C,QAAA,CAIa,QAAS,CAAC7D,CAAD,CAAM,CAGpBvB,CAAA,CAAOuB,CAAP,CAFiB4D,CAAAI,CAAehE,CAAAJ,KAAA,CAAS,CAAT,CAAfoE,CAEjB,CAHoB,CAJ5B,CAWA,OAAOvE,EAnCiD,CAzdjB,CAugBvCwE,EAAqBA,QAA2B,CAAC9J,CAAD,CAAI2C,CAAJ,CAAO,CACvD,MAAOA,EAAAiH,aAAP,CAAwB5J,CAAA4J,aAD+B,CAvgBhB,CAmhBvCG,EAAmBA,QAAyB,CAACzE,CAAD,CAAY,CAAA,IACpD0E,EAAiB,EADmC,CAEpDC,EAAmB,EAGvB3E,EAAAhD,OAAA,CACY,QAAS,CAACkD,CAAD,CAAW,CACxB,MAAgC,EAAhC;AAAOA,CAAAC,KAAAhG,OADiB,CADhC,CAAAiK,QAAA,CAGe,QAAS,CAAClE,CAAD,CAAW,CAC3ByE,CAAA,CAAiBzE,CAAAC,KAAA,CAAc,CAAd,CAAjB,CAAA,CAAqCD,CAAAvD,OAArC,CAAuD,CACnD9C,EAAG2J,MAAAC,UADgD,CAEnD3J,EAAG0J,MAAAC,UAFgD,CAGnD7I,EAAGjB,IAAAU,KAAA,CAAU6F,CAAAG,MAAV,CAA2B1G,IAAAoE,GAA3B,CAHgD,CAD5B,CAHnC,CAkBA,KAAI6G,EAAcA,QAAoB,CAACrE,CAAD,CAAMsE,CAAN,CAAmB,CACrD,IAAIlI,EAAS4D,CAAA5D,OAEbA,EAAA9C,EAAA,CAAWgL,CAAAhL,EACX8C,EAAA7C,EAAA,CAAW+K,CAAA/K,EACX4K,EAAAtG,KAAA,CAAoBmC,CAApB,CALqD,CASzD2D,EAAA,CAAiBlE,CAAjB,CAGA,KAAI8E,EAAkB9E,CAAAhD,OAAA,CACVyE,CADU,CAAArE,KAAA,CAEZoH,CAFY,CAKtBI,EAAA,CAAYE,CAAAC,MAAA,EAAZ,CAAqC,CAAElL,EAAG,CAAL,CAAQC,EAAG,CAAX,CAArC,CAEA,KAAIkL,EAAuBhF,CAAAhD,OAAA,CAAiB,QAAS,CAACnD,CAAD,CAAI,CACrD,MAAyB,EAAzB,GAAOA,CAAAsG,KAAAhG,OAD8C,CAA9B,CAK3B2K,EAAAV,QAAA,CAAwB,QAAS,CAAC7D,CAAD,CAAM,CAAA,IAC/B5D,EAAS4D,CAAA5D,OADsB,CAE/BsI,EAAStI,CAAA/B,EAFsB,CAG/ByJ,EAAc9D,CAAA8D,YAHiB,CAK/Ba,EAAeR,CAAAxK,OAAA,CACP,QAAS,CAACqI,CAAD,CAAO4C,CAAP,CAAsBlJ,CAAtB,CAAyB,CAAA,IAClCmJ,EAAmBD,CAAAxI,OADe,CAMlC6E,EAAWF,CAAA,CACX2D,CADW,CAEXG,CAAAxK,EAFW,CAJDyJ,CAAA9F,CAAY4G,CAAAhF,KAAA,CAAmB,CAAnB,CAAZ5B,CAIC,CANuB,CAclC8G,EAAsB,CACtB,CAAExL,EAAGuL,CAAAvL,EAAHA,CAAwB2H,CAA1B,CAAoC1H,EAAGsL,CAAAtL,EAAvC,CADsB,CAEtB,CAAED,EAAGuL,CAAAvL,EAAHA,CAAwB2H,CAA1B,CAAoC1H,EAAGsL,CAAAtL,EAAvC,CAFsB,CAGtB,CAAED,EAAGuL,CAAAvL,EAAL,CAAyBC,EAAGsL,CAAAtL,EAAHA,CAAwB0H,CAAjD,CAHsB,CAItB,CAAE3H,EAAGuL,CAAAvL,EAAL,CAAyBC,EAAGsL,CAAAtL,EAAHA,CAAwB0H,CAAjD,CAJsB,CAS1BkD,EAAAtI,MAAA,CAAqBH,CAArB;AAAyB,CAAzB,CAAAmI,QAAA,CAAoC,QAAS,CAACkB,CAAD,CAAiB,CAAA,IACtDC,EAAoBD,CAAA3I,OAEpB6I,EAAAA,CAAYlE,CAAA,CACR2D,CADQ,CAERM,CAAA3K,EAFQ,CADDyJ,CAAAoB,CAAYH,CAAAnF,KAAA,CAAoB,CAApB,CAAZsF,CACC,CAOhBJ,EAAA,CAAsBA,CAAA9I,OAAA,CAClBxB,CAAA,CAA4B,CACxBlB,EAAGuL,CAAAvL,EADqB,CAExBC,EAAGsL,CAAAtL,EAFqB,CAGxBc,EAAG4G,CAHqB,CAA5B,CAIG,CACC3H,EAAG0L,CAAA1L,EADJ,CAECC,EAAGyL,CAAAzL,EAFJ,CAGCc,EAAG4K,CAHJ,CAJH,CADkB,CAVoC,CAA9D,CAwBAH,EAAAjB,QAAA,CAA4B,QAAS,CAACS,CAAD,CAAc,CAC/ClI,CAAA9C,EAAA,CAAWgL,CAAAhL,EACX8C,EAAA7C,EAAA,CAAW+K,CAAA/K,EAGX,KAAI4L,EAAc5F,CAAA,CACd6E,CADc,CACIK,CADJ,CAKdU,EAAJ,CAAkBnD,CAAAzC,KAAlB,GACIyC,CAAAzC,KACA,CADY4F,CACZ,CAAAnD,CAAAsC,YAAA,CAAmBA,CAFvB,CAV+C,CAAnD,CAiBA,OAAOtC,EAhE+B,CAD3B,CAkEZ,CACCzC,KAAM0D,MAAAC,UADP,CAECoB,YAAa3M,IAAAA,EAFd,CAlEY,CAwEnB0M,EAAA,CAAYrE,CAAZ,CAAiB2E,CAAAL,YAAjB,CA7EmC,CAAvC,CAiFA,OAAOF,EAhIiD,CAnhBjB,CA8pBvCgB,EAASA,QAAS,CAAC3F,CAAD,CAAY,CAC9B,IAAI4F,EAAiB,EAGE,EAAvB,CAAI5F,CAAA7F,OAAJ,GACIyL,CAEA,CAFiBnB,CAAA,CAAiBzE,CAAjB,CAEjB,CAAAA,CAAAhD,OAAA,CACY,QAAS,CAACnD,CAAD,CAAI,CACjB,MAAO,CAAC4H,CAAA,CAAM5H,CAAN,CADS,CADzB,CAAAuK,QAAA,CAIa,QAAS,CAAClE,CAAD,CAAW,CAAA,IACrBC,EAAOD,CAAAC,KACP2D,EAAAA,CAAK3D,CAAA4D,KAAA,EACL/H,EAAAA,CAAUmE,CAAA3D,IAAA,CAAS,QAAS,CAAC+D,CAAD,CAAM,CAC9B,MAAOqF,EAAA,CAAerF,CAAf,CADuB,CAAxB,CAKdqF,EAAA,CAAe9B,CAAf,CAAA,CACIhH,CAAA,CAAoCd,CAApC,CATqB,CAJjC,CAHJ,CAmBA,OAAO4J,EAvBuB,CA9pBS,CAwrBvCC,EAAkBA,QAAS,CAAChM,CAAD,CAAI,CAC/B,IAAI2C,EAAM,EAEV,OACI4C,EAAA,CAASvF,CAAT,CADJ;AAEKsF,CAAA,CAAStF,CAAAwG,MAAT,CAFL,EAEqC,EAFrC,CAE0BxG,CAAAwG,MAF1B,EAGKnB,CAAA,CAAQrF,CAAAsG,KAAR,CAHL,EAGwC,CAHxC,CAGwBtG,CAAAsG,KAAAhG,OAHxB,EAII,CAACN,CAAAsG,KAAAtD,KAAA,CAAY,QAAS,CAAC0D,CAAD,CAAM,CACxB,IAAIuF,EAAU,CAAA,CAET,EAAAtJ,CAAA,CAAI+D,CAAJ,CAAL,EAAiBlB,CAAA,CAASkB,CAAT,CAAjB,CACI/D,CAAA,CAAI+D,CAAJ,CADJ,CACe,CAAA,CADf,CAGIuF,CAHJ,CAGc,CAAA,CAEd,OAAOA,EARiB,CAA3B,CAP0B,CAxrBQ,CAytBvCC,EAAkBA,QAAwB,CAACvI,CAAD,CAAO,CAC7CtC,CAAAA,CAAIgE,CAAA,CAAQ1B,CAAR,CAAA,CAAgBA,CAAhB,CAAuB,EAE/B,KAAIwI,EAAY9K,CAAAhB,OAAA,CACJ,QAAS,CAACgC,CAAD,CAAMrC,CAAN,CAAS,CAhBtBgM,CAAA,CAkBehM,CAlBf,CAkBA,EAlBsB4H,CAAA,CAkBP5H,CAlBO,CAkBtB,EAlB4C,CAkB5C,CAAeA,CAlBmBwG,MAkBlC,EAAiD,EAAjD,GAAqBnE,CAAA0B,QAAA,CAAY/D,CAAAsG,KAAA,CAAO,CAAP,CAAZ,CAArB,EACIjE,CAAAkC,KAAA,CAASvE,CAAAsG,KAAA,CAAO,CAAP,CAAT,CAEJ,OAAOjE,EALe,CADd,CAOT,EAPS,CAAAkB,KAAA,EAAhB,CAUI6I,EAAoB/K,CAAAhB,OAAA,CAAS,QAAS,CAAC+L,CAAD,CAAoB/F,CAApB,CAA8B,CAChE2F,CAAA,CAAgB3F,CAAhB,CAAJ,EAAkC,CAAAA,CAAAC,KAAAtD,KAAA,CAAmB,QAAS,CAAC0D,CAAD,CAAM,CAChE,MAAmC,EAAnC,GAAOyF,CAAApI,QAAA,CAAkB2C,CAAlB,CADyD,CAAlC,CAAlC,GAGI0F,CAAA,CAAkB/F,CAAAC,KAAA/C,KAAA,EAAA2G,KAAA,EAAlB,CAHJ,CAGqD7D,CAHrD,CAKA,OAAO+F,EAN6D,CAAhD,CAOrB,EAPqB,CASxBD,EAAA9L,OAAA,CAAiB,QAAS,CAACgM,CAAD,CAAe3F,CAAf,CAAoBtE,CAApB,CAAuBC,CAAvB,CAA4B,CAClCA,CAAAE,MAAA+J,CAAUlK,CAAVkK,CAAc,CAAdA,CAEhB/B,QAAA,CAAkB,QAAS,CAACgC,CAAD,CAAO,CAC9BF,CAAA9H,KAAA,CAAkBmC,CAAlB,CAAwB,GAAxB,CAA8B6F,CAA9B,CAD8B,CAAlC,CAGA,OAAOF,EAN2C,CAAtD,CAOG,EAPH,CAAA9B,QAAA,CAOe,QAAS,CAACiC,CAAD,CAAc,CAClC,GAAK,CAAAJ,CAAA,CAAkBI,CAAlB,CAAL,CAAqC,CACjC,IAAI5G;AAAM,CACNU,KAAMkG,CAAAC,MAAA,CAAkB,GAAlB,CADA,CAENjG,MAAO,CAFD,CAKV4F,EAAA,CAAkBI,CAAlB,CAAA,CAAiC5G,CANA,CADH,CAPtC,CAmBA,OAAOD,EAAA,CAAayG,CAAb,CAzC0C,CAztBV,CAgxBvCM,EAAWA,QAAiB,CAACC,CAAD,CAAcC,CAAd,CAA4BC,CAA5B,CAAmC,CAAA,IAC3DC,EAASD,CAAAE,OAATD,CAAwBD,CAAAG,IADmC,CAE3D7I,EAAQ0I,CAAAI,MAAR9I,CAAsB0I,CAAAK,KAFqC,CAO3DC,EAAQrN,IAAA8E,IAAA,CAJS,CAARwI,CAAAjJ,CAAAiJ,CAAY,CAAZA,CAAgBjJ,CAAhBiJ,CAAwBT,CAAxBS,CAAsC,CAIvC,CAHU,CAATC,CAAAP,CAAAO,CAAa,CAAbA,CAAiBP,CAAjBO,CAA0BT,CAA1BS,CAAyC,CAG1C,CAEZ,OAAO,CACHF,MAAOA,CADJ,CAEHG,QAASX,CAATW,CAAuB,CAAvBA,EANWT,CAAAI,MAMXK,CANyBT,CAAAK,KAMzBI,EANuC,CAMvCA,CAAqCH,CAFlC,CAGHI,QAASX,CAATW,CAAwB,CAAxBA,EANWV,CAAAG,IAMXO,CANuBV,CAAAE,OAMvBQ,EANuC,CAMvCA,CAAsCJ,CAHnC,CATwD,CAkZnEzH,EAAA,CAAW,MAAX,CAAmB,SAAnB,CA7UkB8H,CACdC,YAAa,SADCD,CAEdE,gBAAiB,OAFHF,CAGdG,YAAa,CAHCH,CAIdI,SAAU,CAJIJ,CAKdK,KAAM,CAAA,CALQL,CAMdM,aAAc,CAAA,CANAN,CAOdO,WAAY,CACRC,QAAS,CAAA,CADD,CAERC,UAAWA,QAAS,EAAG,CACnB,MAAO,KAAAzP,MAAA0P,KADY,CAFf,CAPEV,CAadW,OAAQ,CAAA,CAbMX,CAcdY,QAAS,GAdKZ,CAeda,aAAc,CAAA,CAfAb,CAgBdc,OAAQ,CACJC,MAAO,CACHH,QAAS,CADN,CAEHI,KAAM,CAAA,CAFH,CAGHf,YAAa,SAHV,CADH;AAMJgB,OAAQ,CACJxJ,MAAO,SADH,CAEJwI,YAAa,SAFT,CAGJiB,UAAW,CAAA,CAHP,CANJ,CAhBMlB,CA4BdmB,QAAS,CACLC,YAAa,6BADR,CA5BKpB,CA6UlB,CA5SiBqB,CACbC,YAAa,CAAA,CADAD,CAEbE,UAAW,EAFEF,CAGbG,YAAa,CAAA,CAHAH,CAIbI,cAAe,CAAC,OAAD,CAJFJ,CAKbK,UAAWA,QAAS,EAAG,CAEnB,IAAIC,EAAQ,IAAAA,MAEZ,KAAAC,eAAA,CAAsB,IAAAC,MACtB,KAAAC,eAAA,EAGA,KAAInJ,EAAY+F,CAAA,CAAgB,IAAAqD,QAAA5L,KAAhB,CAAhB,CAGIoI,EAAiBD,CAAA,CAAO3F,CAAP,CAHrB,CAMIqJ,EAAyBzF,CAAA,CAAkB5D,CAAlB,CAN7B,CASI0G,EAAQhH,MAAAC,KAAA,CAAYiG,CAAZ,CAAA5I,OAAA,CACI,QAAS,CAACsM,CAAD,CAAM,CAGnB,OAFIC,CAEJ,CAFY3D,CAAA,CAAe0D,CAAf,CAEZ,GAAgBnK,CAAA,CAASoK,CAAA3O,EAAT,CAHG,CADnB,CAAAV,OAAA,CAMI,QAAS,CAACwM,CAAD,CAAQ4C,CAAR,CAAa,CACU,IAAA,EAAA1D,CAAA,CAAe0D,CAAf,CAxGhDvC,EAAAA,CAAOpK,CAAA9C,EAAPkN,CAAkBpK,CAAA/B,EADgD,KAElEkM,EAAQnK,CAAA9C,EAARiN,CAAmBnK,CAAA/B,EAF+C,CAGlEgM,EAASjK,CAAA7C,EAAT8M,CAAoBjK,CAAA/B,EAH8C,CAIlEiM,EAAMlK,CAAA7C,EAAN+M,CAAiBlK,CAAA/B,EAGrB,IAAK,CAAAuE,CAAA,CAkGwCuH,CAlG/BK,KAAT,CAAL,EAkG6CL,CAlGhBK,KAA7B,CAA0CA,CAA1C,CAkG6CL,CAjGzCK,KAAA,CAAaA,CAEjB,IAAK,CAAA5H,CAAA,CA+FwCuH,CA/F/BI,MAAT,CAAL,EA+F6CJ,CA/FfI,MAA9B;AAA4CA,CAA5C,CA+F6CJ,CA9FzCI,MAAA,CAAcA,CAElB,IAAK,CAAA3H,CAAA,CA4FwCuH,CA5F/BG,IAAT,CAAL,EA4F6CH,CA5FjBG,IAA5B,CAAwCA,CAAxC,CA4F6CH,CA3FzCG,IAAA,CAAYA,CAEhB,IAAK,CAAA1H,CAAA,CAyFwCuH,CAzF/BE,OAAT,CAAL,EAyF6CF,CAzFdE,OAA/B,CAA8CA,CAA9C,CAyF6CF,CAxFzCE,OAAA,CAAeA,CAwFH,OAA6BF,EADH,CAN1B,CAQD,CAAEG,IAAK,CAAP,CAAUD,OAAQ,CAAlB,CAAqBG,KAAM,CAA3B,CAA8BD,MAAO,CAArC,CARC,CATZ,CAkBI0C,EAAUjD,CAAA,CAASyC,CAAAS,UAAT,CAA0BT,CAAAU,WAA1B,CAA4ChD,CAA5C,CAlBd,CAmBIM,EAAQwC,CAAAxC,MAnBZ,CAoBIG,EAAUqC,CAAArC,QApBd,CAqBIC,EAAUoC,CAAApC,QAGd,KAAApN,OAAAoK,QAAA,CAAoB,QAAS,CAAC/L,CAAD,CAAQ,CAAA,IAC7B8H,EAAOjB,CAAA,CAAQ7G,CAAA8H,KAAR,CAAA,CAAsB9H,CAAA8H,KAAtB,CAAmC,EADb,CAE7B2D,EAAK3D,CAAA4D,KAAA,EAFwB,CAG7BwF,EAAQ3D,CAAA,CAAe9B,CAAf,CAHqB,CAI7BjL,CAJ6B,CAK7B8Q,EAAoBN,CAAA,CAAuBvF,CAAvB,CAEpByF,EAAJ,GACQA,CAAA3O,EAAJ,CACI/B,CADJ,CACgB,CACRgB,EAAGsN,CAAHtN,CAAa0P,CAAA1P,EAAbA,CAAuBmN,CADf,CAERlN,EAAGsN,CAAHtN,CAAayP,CAAAzP,EAAbA,CAAuBkN,CAFf,CAGRpM,EAAG2O,CAAA3O,EAAHA,CAAaoM,CAHL,CADhB,CAMWuC,CAAArO,EANX,GAsBIrC,CAtBJ,CAsBgB,CACRqC,EAfIqO,CAAArO,EAAAhB,OAAA,CAAe,QAAS,CAAC0P,CAAD,CAAO1N,CAAP,CAAY,CACzB,GAAf,GAAIA,CAAA,CAAI,CAAJ,CAAJ,EACIA,CAAA,CAAI,CAAJ,CACA,CADSiL,CACT,CADmBjL,CAAA,CAAI,CAAJ,CACnB,CAD4B8K,CAC5B,CAAA9K,CAAA,CAAI,CAAJ,CAAA,CAASkL,CAAT,CAAmBlL,CAAA,CAAI,CAAJ,CAAnB,CAA4B8K,CAFhC,EAGsB,GAHtB,GAGW9K,CAAA,CAAI,CAAJ,CAHX,GAIIA,CAAA,CAAI,CAAJ,CAGA,EAHkB8K,CAGlB,CAFA9K,CAAA,CAAI,CAAJ,CAEA,EAFkB8K,CAElB,CADA9K,CAAA,CAAI,CAAJ,CACA,CADSiL,CACT,CADmBjL,CAAA,CAAI,CAAJ,CACnB,CAD4B8K,CAC5B,CAAA9K,CAAA,CAAI,CAAJ,CAAA,CAASkL,CAAT,CAAmBlL,CAAA,CAAI,CAAJ,CAAnB,CAA4B8K,CAPhC,CASA,OAAO4C,EAAArN,OAAA,CAAYL,CAAZ,CAViC,CAApC,CAWL,EAXK,CAAA6H,KAAA7I,CAYE,GAZFA,CAcI,CAtBhB,CA4BA,CAAIyO,CAAJ,EACIA,CAAA9P,EACA,CADsBsN,CACtB,CADgCwC,CAAA9P,EAChC,CADsDmN,CACtD;AAAA2C,CAAA7P,EAAA,CAAsBsN,CAAtB,CAAgCuC,CAAA7P,EAAhC,CAAsDkN,CAF1D,EAII2C,CAJJ,CAIwB,EAjC5B,CAqCAtR,EAAAQ,UAAA,CAAkBA,CAGd8Q,EAAJ,EAAyB9Q,CAAzB,GACIR,CAAAwR,MACA,CADcF,CAAA9P,EACd,CAAAxB,CAAAyR,MAAA,CAAcH,CAAA7P,EAFlB,CAMAzB,EAAA0P,KAAA,CAAa1P,CAAA+Q,QAAArB,KAAb,EAAmC5H,CAAA4D,KAAA,CAAU,QAAV,CArDF,CAArC,CAhCmB,CALV2E,CAiGbqB,WAAYA,QAAS,EAAG,CAAA,IAChBC,EAAS,IADO,CAGhBhB,EAAQgB,CAAAhB,MAHQ,CAIhBjQ,EAAQiR,CAAAjR,MAJQ,CAOhBL,EAAWsQ,CAAAtQ,SAGf0L,EALa4F,CAAAhQ,OAKboK,EAL8B,EAK9BA,SAAA,CAAe,QAAS,CAAC/L,CAAD,CAAQ,CAAA,IACxBY,CADwB,CAExBJ,EAAYR,CAAAQ,UAGXmQ,EAAAiB,WAAL,GACIhR,CADJ,CACc+Q,CAAAE,aAAA,CAAoB7R,CAApB,CAA2BA,CAAA8R,MAA3B,CADd,CAIA9R,EAAAF,KAAA,CAAW,CACPgB,MAAO,CAACd,CAAAC,QADD,CAEPC,kBAAmBM,CAFZ,CAGPI,QAASA,CAHF,CAIPF,MAAOA,CAJA,CAKPL,SAAUA,CALH,CAMPE,UAAWC,CAAA,EAAaA,CAAAqC,EAAb,CAA2B,MAA3B,CAAoC,QANxC,CAAX,CAT4B,CAAhC,CAVoB,CAjGXwN,CAuIbwB,aAAcA,QAAS,CAAC7R,CAAD,CAAQ8R,CAAR,CAAe,CAAA,IAE9BC,EADSJ,IACOZ,QAAhBgB,EAAkC,EAGlChB,EAAAA,CAAU9J,CAAA,CACN8K,CADM,CAEN,CAAEtL,MAAOzG,CAAPyG,EAAgBzG,CAAAyG,MAAlB,CAFM,CAFKzG,CAEL,EAFcA,CAAA+Q,QAEd,EAF+B,EAE/B,CADMe,CACN,EADeC,CAAAjC,OAAA,CAAqBgC,CAArB,CACf,EAD+C,EAC/C,CAQd,OAAO,CACH,KAAQrL,CAAA,CAAMsK,CAAAtK,MAAN,CAAAuL,WAAA,CACQjB,CAAAnB,QADR,CAAAR,SAAA,CAEM2B,CAAAkB,WAFN,CAAAC,IAAA,EADL;AAKH,OAAUnB,CAAA9B,YALP,CAMH,eAAgB8B,CAAA5B,YANb,CAOH,UAAa4B,CAAA7B,gBAPV,CAb2B,CAvIzBmB,CA8JbxP,QAASA,QAAS,CAACsR,CAAD,CAAO,CACrB,GAAKA,CAAAA,CAAL,CAAW,CACP,IACIC,EAAc5L,CAAA6L,WAAA,CADLV,IACkBZ,QAAAb,UAAb,CADLyB,KAGbhQ,OAAAoK,QAAA,CAAsB,QAAS,CAAC/L,CAAD,CAAQ,CACnC,IAAIsS,EAAOtS,CAAAQ,UAEX,IAAIR,CAAAC,QAAJ,EAAqBqS,CAArB,CAA2B,CAAA,IACnB3R,EAAO,EADY,CAEnBE,EAAU,EAEVyR,EAAAzP,EAAJ,CAEIlC,CAAAiP,QAFJ,CAEmB,IAFnB,EAKIjP,CAAA4B,EACA,CADS,CACT,CAAA1B,CAAA0B,EAAA,CAAY+P,CAAA/P,EANhB,CASAvC,EAAAC,QAAAU,KAAA,CACUA,CADV,CAAAE,QAAA,CAEaA,CAFb,CAEsBuR,CAFtB,CAMIE,EAAAzP,EAAJ,EACI0P,UAAA,CAAW,QAAS,EAAG,CACfvS,CAAJ,EAAaA,CAAAC,QAAb,EACID,CAAAC,QAAAY,QAAA,CAAsB,CAClB+O,QAAS,CADS,CAAtB,CAFe,CAAvB,CAMGwC,CAAAI,SANH,CApBmB,CAHQ,CAAvC,CAHab,IAGb,CAHaA,KAoCb9Q,QAAA,CAAiB,IArCV,CADU,CA9JZwP,CAuMboC,MAAO,CACH5G,iBAAkBA,CADf,CAEH3K,SAAUA,CAFP,CAGHgB,gBAAiBA,CAHd,CAIH+G,mCAAoCA,CAJjC;AAKHmD,iBAAkBA,CALf,CAMH3E,KAAMA,CANH,CAOHiG,gBAAiBA,CAPd,CAQHvB,mBAAoBA,CARjB,CAvMMkE,CA4SjB,CAzFgBqC,CACZ5S,KAAMA,CADM4S,CAEZpS,WAAYA,QAAS,EAAG,CAIpB,MAAO,CAAEE,CAHGR,IAGHQ,UAJW,CAFZkS,CAQZC,QAASA,QAAS,EAAG,CACjB,MAAO7L,EAAA,CAAS,IAAAkB,MAAT,CADU,CART0K,CAyFhB,CAlqC2C,CAA9C,CAAA,CAoqCC5S,CApqCD,CAoqCOoB,CApqCP,CAoqCiBgB,CApqCjB,CAoqCkCtC,CApqClC,CA1ZmB,CAXvB;","sources":["venn.src.js"],"names":["factory","module","exports","define","amd","Highcharts","undefined","draw","params","point","graphic","animatableAttribs","onComplete","css","renderer","shouldDraw","shapeType","shapeArgs","add","group","attr","attribs","animate","isNew","destroy","addClass","getClassName","geometry","getAngleBetweenPoints","p1","p2","Math","atan2","x","y","getCenterOfPoints","points","sum","reduce","length","getDistanceBetweenPoints","sqrt","pow","geometryCircles","round","decimals","a","getCircularSegmentArea","r","h","acos","getCircleCircleIntersection","c1","c2","d","r1","r2","abs","r1Square","x1","x2","y1","y2","x0","y0","rx","ry","getCirclesIntersectionPoints","circles","i","arr","additional","slice","j","indexes","concat","map","p","isPointInsideCircle","circle","isPointInsideAllCircles","some","getAreaOfIntersectionBetweenCircles","intersectionPoints","filter","result","center","angle","sort","b","startPoint","arcs","data","midPoint","arc","index","indexOf","angle1","angle2","PI","width","sin","cos","largeArc","push","unshift","getOverlapBetweenCircles","overlap","r2Square","min","d1","d2","isPointOutsideAllCircles","H","color","Color","extend","getOverlapBetweenCirclesByDistance","isArray","isNumber","isObject","isString","merge","seriesType","objectValues","obj","Object","keys","circle1","circle2","loss","mapOfIdToCircle","relations","totalLoss","relation","sets","wantedOverlap","value","actualOverlap","set","diff","precision","bisect","f","tolerance","maxIterations","fA","fB","nMax","tol","delta","n","fX","Error","getDistanceBetweenCirclesByOverlap","maxDistance","distance","isSet","nelderMead","fn","initial","sortByFx","fx","weightedSum","weight1","v1","weight2","v2","updateSimplex","simplex","shrinkSimplex","best","pShrink","getCentroid","getPoint","centroid","worst","getSimplex","Array","reflected","expanded","contracted","pOCon","getMarginFromCircles","internal","external","margin","m","Number","MAX_VALUE","getLabelPosition","optimal","getLabelPositions","singleSets","id","join","isInternal","property","addOverlapToSets","mapOfIdToProps","forEach","overlapping","totalOverlap","properties","sortByTotalOverlap","layoutGreedyVenn","positionedSets","mapOfIdToCircles","positionSet","coordinates","sortedByOverlap","shift","relationsWithTwoSets","radius","bestPosition","positionedSet","positionedCircle","possibleCoordinates","positionedSet2","positionedCircle2","distance2","overlap2","currentLoss","layout","mapOfIdToShape","isValidRelation","invalid","processVennData","validSets","mapOfIdToRelation","combinations","remaining","set2","combination","split","getScale","targetWidth","targetHeight","field","height","bottom","top","right","left","scale","scaleX","scaleY","centerX","centerY","vennOptions","borderColor","borderDashStyle","borderWidth","brighten","clip","colorByPoint","dataLabels","enabled","formatter","name","marker","opacity","showInLegend","states","hover","halo","select","animation","tooltip","pointFormat","vennSeries","isCartesian","axisTypes","directTouch","pointArrayMap","translate","chart","processedXData","xData","generatePoints","options","mapOfIdToLabelPosition","key","shape","scaling","plotWidth","plotHeight","dataLabelPosition","path","plotX","plotY","drawPoints","series","styledMode","pointAttribs","state","seriesOptions","setOpacity","brightness","get","init","animOptions","animObject","args","setTimeout","duration","utils","vennPoint","isValid"]}

data/vendor/assets/javascripts/highstock/modules/venn.src.js

@@ -0,0 +1,1624 @@
+/**
+ * @license Highcharts JS v7.0.3 (2019-02-06)
+ *
+ * (c) 2017-2019 Highsoft AS
+ * Authors: Jon Arild Nygard
+ *
+ * License: www.highcharts.com/license
+ */
+'use strict';
+(function (factory) {
+    if (typeof module === 'object' && module.exports) {
+        factory['default'] = factory;
+        module.exports = factory;
+    } else if (typeof define === 'function' && define.amd) {
+        define(function () {
+            return factory;
+        });
+    } else {
+        factory(typeof Highcharts !== 'undefined' ? Highcharts : undefined);
+    }
+}(function (Highcharts) {
+    var draw = (function () {
+        var isFn = function (x) {
+            return typeof x === 'function';
+        };
+
+        /**
+         * Handles the drawing of a point.
+         *
+         * @private
+         * @function draw
+         *
+         * @param {object} params
+         *        Parameters.
+         *
+         * @todo
+         * - add type checking.
+         */
+        var draw = function draw(params) {
+            var point = this,
+                graphic = point.graphic,
+                animatableAttribs = params.animatableAttribs,
+                onComplete = params.onComplete,
+                css = params.css,
+                renderer = params.renderer;
+
+            if (point.shouldDraw()) {
+                if (!graphic) {
+                    point.graphic = graphic =
+                        renderer[params.shapeType](params.shapeArgs).add(params.group);
+                }
+                graphic
+                    .css(css)
+                    .attr(params.attribs)
+                    .animate(
+                        animatableAttribs,
+                        params.isNew ? false : undefined,
+                        onComplete
+                    );
+            } else if (graphic) {
+                graphic.animate(animatableAttribs, undefined, function () {
+                    point.graphic = graphic = graphic.destroy();
+                    if (isFn(onComplete)) {
+                        onComplete();
+                    }
+                });
+            }
+            if (graphic) {
+                graphic.addClass(point.getClassName(), true);
+            }
+        };
+
+
+        return draw;
+    }());
+    var geometry = (function () {
+        /**
+         * Calculates the center between a list of points.
+         *
+         * @param {array} points A list of points to calculate the center of.
+         */
+        var getCenterOfPoints = function getCenterOfPoints(points) {
+            var sum = points.reduce(function (sum, point) {
+                sum.x += point.x;
+                sum.y += point.y;
+                return sum;
+            }, { x: 0, y: 0 });
+
+            return {
+                x: sum.x / points.length,
+                y: sum.y / points.length
+            };
+        };
+
+        /**
+         * Calculates the distance between two points based on their x and y
+         * coordinates.
+         *
+         * @param {object} p1 The x and y coordinates of the first point.
+         * @param {object} p2 The x and y coordinates of the second point.
+         * @returns {number} Returns the distance between the points.
+         */
+        var getDistanceBetweenPoints = function getDistanceBetweenPoints(p1, p2) {
+            return Math.sqrt(Math.pow(p2.x - p1.x, 2) + Math.pow(p2.y - p1.y, 2));
+        };
+
+        /**
+         * Calculates the angle between two points.
+         *
+         * TODO: add unit tests.
+         *
+         * @param {object} p1 The first point.
+         * @param {object} p2 The second point.
+         * @returns {number} Returns the angle in radians.
+         */
+        var getAngleBetweenPoints = function getAngleBetweenPoints(p1, p2) {
+            return Math.atan2(p2.x - p1.x, p2.y - p1.y);
+        };
+
+        var geometry = {
+            getAngleBetweenPoints: getAngleBetweenPoints,
+            getCenterOfPoints: getCenterOfPoints,
+            getDistanceBetweenPoints: getDistanceBetweenPoints
+        };
+
+
+        return geometry;
+    }());
+    var geometryCircles = (function (geometry) {
+        var getAngleBetweenPoints = geometry.getAngleBetweenPoints,
+            getCenterOfPoints = geometry.getCenterOfPoints,
+            getDistanceBetweenPoints = geometry.getDistanceBetweenPoints;
+
+        var round = function round(x, decimals) {
+            var a = Math.pow(10, decimals);
+
+            return Math.round(x * a) / a;
+        };
+
+        /**
+         * Calculates the area of a circular segment based on the radius of the circle
+         * and the height of the segment.
+         * See http://mathworld.wolfram.com/CircularSegment.html
+         *
+         * @param {number} r The radius of the circle.
+         * @param {number} h The height of the circular segment.
+         * @returns {number} Returns the area of the circular segment.
+         */
+        var getCircularSegmentArea = function getCircularSegmentArea(r, h) {
+            return r * r * Math.acos(1 - h / r) - (r - h) * Math.sqrt(h * (2 * r - h));
+        };
+
+        /**
+         * Calculates the area of overlap between two circles based on their radiuses
+         * and the distance between them.
+         * See http://mathworld.wolfram.com/Circle-CircleIntersection.html
+         *
+         * @param {number} r1 Radius of the first circle.
+         * @param {number} r2 Radius of the second circle.
+         * @param {number} d The distance between the two circles.
+         * @returns {number} Returns the area of overlap between the two circles.
+         */
+        var getOverlapBetweenCircles =
+        function getOverlapBetweenCircles(r1, r2, d) {
+            var overlap = 0;
+
+            // If the distance is larger than the sum of the radiuses then the circles
+            // does not overlap.
+            if (d < r1 + r2) {
+                var r1Square = r1 * r1,
+                    r2Square = r2 * r2;
+
+                if (d <= Math.abs(r2 - r1)) {
+                    // If the circles are completely overlapping, then the overlap
+                    // equals the area of the smallest circle.
+                    overlap = Math.PI * Math.min(r1Square, r2Square);
+                } else {
+                    // Height of first triangle segment.
+                    var d1 = (r1Square - r2Square + d * d) / (2 * d),
+                        // Height of second triangle segment.
+                        d2 = d - d1;
+
+                    overlap = (
+                        getCircularSegmentArea(r1, r1 - d1) +
+                        getCircularSegmentArea(r2, r2 - d2)
+                    );
+                }
+                // Round the result to two decimals.
+                overlap = round(overlap, 14);
+            }
+            return overlap;
+        };
+
+        /**
+         * Calculates the intersection points of two circles.
+         *
+         * NOTE: does not handle floating errors well.
+         *
+         * @param {object} c1 The first circle.s
+         * @param {object} c2 The second sircle.
+         * @returns {array} Returns the resulting intersection points.
+         */
+        var getCircleCircleIntersection =
+        function getCircleCircleIntersection(c1, c2) {
+            var d = getDistanceBetweenPoints(c1, c2),
+                r1 = c1.r,
+                r2 = c2.r,
+                points = [];
+
+            if (d < r1 + r2 && d > Math.abs(r1 - r2)) {
+                // If the circles are overlapping, but not completely overlapping, then
+                // it exists intersecting points.
+                var r1Square = r1 * r1,
+                    r2Square = r2 * r2,
+                    // d^2 - r^2 + R^2 / 2d
+                    x = (r1Square - r2Square + d * d) / (2 * d),
+                    // y^2 = R^2 - x^2
+                    y = Math.sqrt(r1Square - x * x),
+                    x1 = c1.x,
+                    x2 = c2.x,
+                    y1 = c1.y,
+                    y2 = c2.y,
+                    x0 = x1 + x * (x2 - x1) / d,
+                    y0 = y1 + x * (y2 - y1) / d,
+                    rx = -(y2 - y1) * (y / d),
+                    ry = -(x2 - x1) * (y / d);
+
+                points = [
+                    { x: round(x0 + rx, 14), y: round(y0 - ry, 14) },
+                    { x: round(x0 - rx, 14), y: round(y0 + ry, 14) }
+                ];
+            }
+            return points;
+        };
+
+        /**
+         * Calculates all the intersection points for between a list of circles.
+         *
+         * @param {array} circles The circles to calculate the points from.
+         * @returns {array} Returns a list of intersection points.
+         */
+        var getCirclesIntersectionPoints = function getIntersectionPoints(circles) {
+            return circles.reduce(function (points, c1, i, arr) {
+                var additional = arr.slice(i + 1)
+                    .reduce(function (points, c2, j) {
+                        var indexes = [i, j + i + 1];
+
+                        return points.concat(
+                            getCircleCircleIntersection(c1, c2)
+                                .map(function (p) {
+                                    p.indexes = indexes;
+                                    return p;
+                                })
+                        );
+                    }, []);
+
+                return points.concat(additional);
+            }, []);
+        };
+
+        /**
+         * Tests wether a point lies within a given circle.
+         *
+         * @param {object} point The point to test for.
+         * @param {object} circle The circle to test if the point is within.
+         * @returns {boolean} Returns true if the point is inside, false if outside.
+         */
+        var isPointInsideCircle = function isPointInsideCircle(point, circle) {
+            return getDistanceBetweenPoints(point, circle) <= circle.r + 1e-10;
+        };
+
+        /**
+         * Tests wether a point lies within a set of circles.
+         *
+         * @param {object} point The point to test.
+         * @param {array} circles The list of circles to test against.
+         * @returns {boolean} Returns true if the point is inside all the circles, false
+         * if not.
+         */
+        var isPointInsideAllCircles = function isPointInsideAllCircles(point, circles) {
+            return !circles.some(function (circle) {
+                return !isPointInsideCircle(point, circle);
+            });
+        };
+
+        /**
+         * Tests wether a point lies outside a set of circles.
+         *
+         * TODO: add unit tests.
+         *
+         * @param {object} point The point to test.
+         * @param {array} circles The list of circles to test against.
+         * @returns {boolean} Returns true if the point is outside all the circles,
+         * false if not.
+         */
+        var isPointOutsideAllCircles =
+        function isPointOutsideAllCircles(point, circles) {
+            return !circles.some(function (circle) {
+                return isPointInsideCircle(point, circle);
+            });
+        };
+
+        /**
+         * Calculate the path for the area of overlap between a set of circles.
+         *
+         * TODO: handle cases with only 1 or 0 arcs.
+         *
+         * @param {array} circles List of circles to calculate area of.
+         * @returns {string} Returns the path for the area of overlap. Returns an empty
+         * string if there are no intersection between all the circles.
+         */
+        var getAreaOfIntersectionBetweenCircles =
+        function getAreaOfIntersectionBetweenCircles(circles) {
+            var intersectionPoints = getCirclesIntersectionPoints(circles)
+                    .filter(function (p) {
+                        return isPointInsideAllCircles(p, circles);
+                    }),
+                result;
+
+            if (intersectionPoints.length > 1) {
+                // Calculate the center of the intersection points.
+                var center = getCenterOfPoints(intersectionPoints);
+
+                intersectionPoints = intersectionPoints
+                    // Calculate the angle between the center and the points.
+                    .map(function (p) {
+                        p.angle = getAngleBetweenPoints(center, p);
+                        return p;
+                    })
+                    // Sort the points by the angle to the center.
+                    .sort(function (a, b) {
+                        return b.angle - a.angle;
+                    });
+
+                var startPoint = intersectionPoints[intersectionPoints.length - 1];
+                var arcs = intersectionPoints
+                    .reduce(function (data, p1) {
+                        var startPoint = data.startPoint,
+                            midPoint = getCenterOfPoints([startPoint, p1]);
+
+                        // Calculate the arc from the intersection points and their
+                        // circles.
+                        var arc = p1.indexes
+                            // Filter out circles that are not included in both
+                            // intersection points.
+                            .filter(function (index) {
+                                return startPoint.indexes.indexOf(index) > -1;
+                            })
+                            // Iterate the circles of the intersection points and
+                            // calculate arcs.
+                            .reduce(function (arc, index) {
+                                var circle = circles[index],
+                                    angle1 = getAngleBetweenPoints(circle, p1),
+                                    angle2 = getAngleBetweenPoints(circle, startPoint),
+                                    angleDiff = angle2 - angle1 +
+                                        (angle2 < angle1 ? 2 * Math.PI : 0),
+                                    angle = angle2 - angleDiff / 2,
+                                    width = getDistanceBetweenPoints(
+                                        midPoint,
+                                        {
+                                            x: circle.x + circle.r * Math.sin(angle),
+                                            y: circle.y + circle.r * Math.cos(angle)
+                                        }
+                                    ),
+                                    r = circle.r;
+
+                                // Width can sometimes become to large due to floating
+                                // point errors
+                                if (width > r * 2) {
+                                    width = r * 2;
+                                }
+                                // Get the arc with the smallest width.
+                                if (!arc || arc.width > width) {
+                                    arc = {
+                                        r: r,
+                                        largeArc: width > r ? 1 : 0,
+                                        width: width,
+                                        x: p1.x,
+                                        y: p1.y
+                                    };
+                                }
+
+                                // Return the chosen arc.
+                                return arc;
+                            }, null);
+
+                        // If we find an arc then add it to the list and update p2.
+                        if (arc) {
+                            var r = arc.r;
+
+                            data.arcs.push(
+                                ['A', r, r, 0, arc.largeArc, 1, arc.x, arc.y]
+                            );
+                            data.startPoint = p1;
+                        }
+                        return data;
+                    }, {
+                        startPoint: startPoint,
+                        arcs: []
+                    }).arcs;
+
+                if (arcs.length === 0) {
+                } else if (arcs.length === 1) {
+                } else {
+                    arcs.unshift(['M', startPoint.x, startPoint.y]);
+                    result = {
+                        center: center,
+                        d: arcs
+                    };
+                }
+            }
+
+            return result;
+        };
+
+        var geometryCircles = {
+            getAreaOfIntersectionBetweenCircles: getAreaOfIntersectionBetweenCircles,
+            getCircleCircleIntersection: getCircleCircleIntersection,
+            getCirclesIntersectionPoints: getCirclesIntersectionPoints,
+            getCircularSegmentArea: getCircularSegmentArea,
+            getOverlapBetweenCircles: getOverlapBetweenCircles,
+            isPointInsideCircle: isPointInsideCircle,
+            isPointInsideAllCircles: isPointInsideAllCircles,
+            isPointOutsideAllCircles: isPointOutsideAllCircles,
+            round: round
+        };
+
+
+        return geometryCircles;
+    }(geometry));
+    (function (draw, geometry, geometryCircles, H) {
+        /* *
+         * Experimental Highcharts module which enables visualization of a Venn Diagram.
+         *
+         * (c) 2016-2019 Highsoft AS
+         *
+         * Authors: Jon Arild Nygard
+         *
+         * Layout algorithm by Ben Frederickson:
+         * https://www.benfrederickson.com/better-venn-diagrams/
+         *
+         * License: www.highcharts.com/license
+         */
+
+
+
+        var color = H.Color,
+            extend = H.extend,
+            getAreaOfIntersectionBetweenCircles =
+                geometryCircles.getAreaOfIntersectionBetweenCircles,
+            getCircleCircleIntersection = geometryCircles.getCircleCircleIntersection,
+            getCenterOfPoints = geometry.getCenterOfPoints,
+            getDistanceBetweenPoints = geometry.getDistanceBetweenPoints,
+            getOverlapBetweenCirclesByDistance =
+                geometryCircles.getOverlapBetweenCircles,
+            isArray = H.isArray,
+            isNumber = H.isNumber,
+            isObject = H.isObject,
+            isPointInsideAllCircles = geometryCircles.isPointInsideAllCircles,
+            isPointOutsideAllCircles = geometryCircles.isPointOutsideAllCircles,
+            isString = H.isString,
+            merge = H.merge,
+            seriesType = H.seriesType;
+
+        var objectValues = function objectValues(obj) {
+            return Object.keys(obj).map(function (x) {
+                return obj[x];
+            });
+        };
+
+        /**
+         * Calculates the area of overlap between a list of circles.
+         * @private
+         * @todo add support for calculating overlap between more than 2 circles.
+         * @param {Array<object>} circles List of circles with their given positions.
+         * @return {number} Returns the area of overlap between all the circles.
+         */
+        var getOverlapBetweenCircles = function getOverlapBetweenCircles(circles) {
+            var overlap = 0;
+
+            // When there is only two circles we can find the overlap by using their
+            // radiuses and the distance between them.
+            if (circles.length === 2) {
+                var circle1 = circles[0];
+                var circle2 = circles[1];
+
+                overlap = getOverlapBetweenCirclesByDistance(
+                    circle1.r,
+                    circle2.r,
+                    getDistanceBetweenPoints(circle1, circle2)
+                );
+            }
+
+            return overlap;
+        };
+
+        /**
+         * Calculates the difference between the desired overlap and the actual overlap
+         * between two circles.
+         * @private
+         * @param {object} mapOfIdToCircle Map from id to circle.
+         * @param {Array<object>} relations List of relations to calculate the loss of.
+         * @return {number} Returns the loss between positions of the circles for the
+         * given relations.
+         */
+        var loss = function loss(mapOfIdToCircle, relations) {
+            var precision = 10e10;
+
+            // Iterate all the relations and calculate their individual loss.
+            return relations.reduce(function (totalLoss, relation) {
+                var loss = 0;
+
+                if (relation.sets.length > 1) {
+                    var wantedOverlap = relation.value;
+                    // Calculate the actual overlap between the sets.
+                    var actualOverlap = getOverlapBetweenCircles(
+                        // Get the circles for the given sets.
+                        relation.sets.map(function (set) {
+                            return mapOfIdToCircle[set];
+                        })
+                    );
+
+                    var diff = wantedOverlap - actualOverlap;
+
+                    loss = Math.round((diff * diff) * precision) / precision;
+                }
+
+                // Add calculated loss to the sum.
+                return totalLoss + loss;
+            }, 0);
+        };
+
+        /**
+         * Finds the root of a given function. The root is the input value needed for
+         * a function to return 0.
+         *
+         * See https://en.wikipedia.org/wiki/Bisection_method#Algorithm
+         *
+         * TODO: Add unit tests.
+         *
+         * @param {function} f The function to find the root of.
+         * @param {number} a The lowest number in the search range.
+         * @param {number} b The highest number in the search range.
+         * @param {number} [tolerance=1e-10] The allowed difference between the returned
+         * value and root.
+         * @param {number} [maxIterations=100] The maximum iterations allowed.
+         */
+        var bisect = function bisect(f, a, b, tolerance, maxIterations) {
+            var fA = f(a),
+                fB = f(b),
+                nMax = maxIterations || 100,
+                tol = tolerance || 1e-10,
+                delta = b - a,
+                n = 1,
+                x, fX;
+
+            if (a >= b) {
+                throw new Error('a must be smaller than b.');
+            } else if (fA * fB > 0) {
+                throw new Error('f(a) and f(b) must have opposite signs.');
+            }
+
+            if (fA === 0) {
+                x = a;
+            } else if (fB === 0) {
+                x = b;
+            } else {
+                while (n++ <= nMax && fX !== 0 && delta > tol) {
+                    delta = (b - a) / 2;
+                    x = a + delta;
+                    fX = f(x);
+
+                    // Update low and high for next search interval.
+                    if (fA * fX > 0) {
+                        a = x;
+                    } else {
+                        b = x;
+                    }
+                }
+            }
+
+            return x;
+        };
+
+        /**
+         * Uses the bisection method to make a best guess of the ideal distance between
+         * two circles too get the desired overlap.
+         * Currently there is no known formula to calculate the distance from the area
+         * of overlap, which makes the bisection method preferred.
+         * @private
+         * @param {number} r1 Radius of the first circle.
+         * @param {number} r2 Radiues of the second circle.
+         * @param {number} overlap The wanted overlap between the two circles.
+         * @return {number} Returns the distance needed to get the wanted overlap
+         * between the two circles.
+         */
+        var getDistanceBetweenCirclesByOverlap =
+        function getDistanceBetweenCirclesByOverlap(r1, r2, overlap) {
+            var maxDistance = r1 + r2,
+                distance = maxDistance;
+
+            if (overlap > 0) {
+                distance = bisect(function (x) {
+                    var actualOverlap = getOverlapBetweenCirclesByDistance(r1, r2, x);
+
+                    // Return the differance between wanted and actual overlap.
+                    return overlap - actualOverlap;
+                }, 0, maxDistance);
+            }
+            return distance;
+        };
+
+        var isSet = function (x) {
+            return isArray(x.sets) && x.sets.length === 1;
+        };
+
+        /**
+         * Finds an optimal position for a given point.
+         * @private
+         * @todo add unit tests.
+         * @todo add constraints to optimize the algorithm.
+         * @param {Function} fn The function to test a point.
+         * @param {Array<*>} initial The initial point to optimize.
+         * @return {Array<*>} Returns the opimized position of a point.
+         */
+        var nelderMead = function nelderMead(fn, initial) {
+            var maxIterations = 100,
+                sortByFx = function (a, b) {
+                    return a.fx - b.fx;
+                },
+                pRef = 1, // Reflection parameter
+                pExp = 2, // Expansion parameter
+                pCon = -0.5, // Contraction parameter
+                pOCon = pCon * pRef, // Outwards contraction parameter
+                pShrink = 0.5; // Shrink parameter
+
+            var weightedSum = function weightedSum(weight1, v1, weight2, v2) {
+                return v1.map(function (x, i) {
+                    return weight1 * x + weight2 * v2[i];
+                });
+            };
+
+            var getSimplex = function getSimplex(initial) {
+                var n = initial.length,
+                    simplex = new Array(n + 1);
+
+                // Initial point to the simplex.
+                simplex[0] = initial;
+                simplex[0].fx = fn(initial);
+
+                // Create a set of extra points based on the initial.
+                for (var i = 0; i < n; ++i) {
+                    var point = initial.slice();
+
+                    point[i] = point[i] ? point[i] * 1.05 : 0.001;
+                    point.fx = fn(point);
+                    simplex[i + 1] = point;
+                }
+                return simplex;
+            };
+
+            var updateSimplex = function (simplex, point) {
+                point.fx = fn(point);
+                simplex[simplex.length - 1] = point;
+                return simplex;
+            };
+
+            var shrinkSimplex = function (simplex) {
+                var best = simplex[0];
+
+                return simplex.map(function (point) {
+                    var p = weightedSum(1 - pShrink, best, pShrink, point);
+
+                    p.fx = fn(p);
+                    return p;
+                });
+            };
+
+            var getCentroid = function (simplex) {
+                var arr = simplex.slice(0, -1),
+                    length = arr.length,
+                    result = [],
+                    sum = function (data, point) {
+                        data.sum += point[data.i];
+                        return data;
+                    };
+
+                for (var i = 0; i < length; i++) {
+                    result[i] = simplex.reduce(sum, { sum: 0, i: i }).sum / length;
+                }
+                return result;
+            };
+
+            var getPoint = function (centroid, worst, a, b) {
+                var point = weightedSum(a, centroid, b, worst);
+
+                point.fx = fn(point);
+                return point;
+            };
+
+            // Create a simplex
+            var simplex = getSimplex(initial);
+
+            // Iterate from 0 to max iterations
+            for (var i = 0; i < maxIterations; i++) {
+                // Sort the simplex
+                simplex.sort(sortByFx);
+
+                // Create a centroid from the simplex
+                var worst = simplex[simplex.length - 1];
+                var centroid = getCentroid(simplex);
+
+                // Calculate the reflected point.
+                var reflected = getPoint(centroid, worst, 1 + pRef, -pRef);
+
+                if (reflected.fx < simplex[0].fx) {
+                    // If reflected point is the best, then possibly expand.
+                    var expanded = getPoint(centroid, worst, 1 + pExp, -pExp);
+
+                    simplex = updateSimplex(
+                        simplex,
+                        (expanded.fx < reflected.fx) ? expanded : reflected
+                    );
+                } else if (reflected.fx >= simplex[simplex.length - 2].fx) {
+                    // If the reflected point is worse than the second worse, then
+                    // contract.
+                    var contracted;
+
+                    if (reflected.fx > worst.fx) {
+                        // If the reflected is worse than the worst point, do a
+                        // contraction
+                        contracted = getPoint(centroid, worst, 1 + pCon, -pCon);
+                        if (contracted.fx < worst.fx) {
+                            simplex = updateSimplex(simplex, contracted);
+                        } else {
+                            simplex = shrinkSimplex(simplex);
+                        }
+                    } else {
+                        // Otherwise do an outwards contraction
+                        contracted = getPoint(centroid, worst, 1 - pOCon, pOCon);
+                        if (contracted.fx < reflected.fx) {
+                            simplex = updateSimplex(simplex, contracted);
+                        } else {
+                            simplex = shrinkSimplex(simplex);
+                        }
+                    }
+                } else {
+                    simplex = updateSimplex(simplex, reflected);
+                }
+            }
+
+            return simplex[0];
+        };
+
+        /**
+         * Calculates a margin for a point based on the iternal and external circles.
+         * The margin describes if the point is well placed within the internal circles,
+         * and away from the external
+         * @private
+         * @todo add unit tests.
+         * @param {object} point The point to evaluate.
+         * @param {Array<object>} internal The internal circles.
+         * @param {Array<object>} external The external circles.
+         * @return {number} Returns the margin.
+         */
+        var getMarginFromCircles =
+        function getMarginFromCircles(point, internal, external) {
+            var margin = internal.reduce(function (margin, circle) {
+                var m = circle.r - getDistanceBetweenPoints(point, circle);
+
+                return (m <= margin) ? m : margin;
+            }, Number.MAX_VALUE);
+
+            margin = external.reduce(function (margin, circle) {
+                var m = getDistanceBetweenPoints(point, circle) - circle.r;
+
+                return (m <= margin) ? m : margin;
+            }, margin);
+
+            return margin;
+        };
+
+        /**
+         * Finds the optimal label position by looking for a position that has a low
+         * distance from the internal circles, and as large possible distane to the
+         * external circles.
+         * @private
+         * @todo Optimize the intial position.
+         * @todo Add unit tests.
+         * @param {Array<object>} internal Internal circles.
+         * @param {Array<object>} external External circles.
+         * @return {object} Returns the found position.
+         */
+        var getLabelPosition = function getLabelPosition(internal, external) {
+            // Get the best label position within the internal circles.
+            var best = internal.reduce(function (best, circle) {
+                var d = circle.r / 2;
+
+                // Give a set of points with the circle to evaluate as the best label
+                // position.
+                return [
+                    { x: circle.x, y: circle.y },
+                    { x: circle.x + d, y: circle.y },
+                    { x: circle.x - d, y: circle.y },
+                    { x: circle.x, y: circle.y + d },
+                    { x: circle.x, y: circle.y - d }
+                ]
+                // Iterate the given points and return the one with the largest margin.
+                    .reduce(function (best, point) {
+                        var margin = getMarginFromCircles(point, internal, external);
+
+                        // If the margin better than the current best, then update best.
+                        if (best.margin < margin) {
+                            best.point = point;
+                            best.margin = margin;
+                        }
+                        return best;
+                    }, best);
+            }, {
+                point: undefined,
+                margin: -Number.MAX_VALUE
+            }).point;
+
+            // Use nelder mead to optimize the initial label position.
+            var optimal = nelderMead(
+                function (p) {
+                    return -(
+                        getMarginFromCircles({ x: p[0], y: p[1] }, internal, external)
+                    );
+                },
+                [best.x, best.y]
+            );
+
+            // Update best to be the point which was found to have the best margin.
+            best = {
+                x: optimal[0],
+                y: optimal[1]
+            };
+
+            if (!(
+                isPointInsideAllCircles(best, internal) &&
+                isPointOutsideAllCircles(best, external)
+            )) {
+                // If point was either outside one of the internal, or inside one of the
+                // external, then it was invalid and should use a fallback.
+                best = getCenterOfPoints(internal);
+            }
+
+            // Return the best point.
+            return best;
+        };
+
+        /**
+         * Calulates data label positions for a list of relations.
+         * @private
+         * @todo add unit tests
+         * @todo NOTE: may be better suited as a part of the layout function.
+         * @param {Array<object>} relations The list of relations.
+         * @return {object} Returns a map from id to the data label position.
+         */
+        var getLabelPositions = function getLabelPositions(relations) {
+            var singleSets = relations.filter(isSet);
+
+            return relations.reduce(function (map, relation) {
+                if (relation.value) {
+                    var sets = relation.sets,
+                        id = sets.join(),
+                        // Create a list of internal and external circles.
+                        data = singleSets.reduce(function (data, set) {
+                            // If the set exists in this relation, then it is internal,
+                            // otherwise it will be external.
+                            var isInternal = sets.indexOf(set.sets[0]) > -1,
+                                property = isInternal ? 'internal' : 'external';
+
+                            // Add the circle to the list.
+                            data[property].push(set.circle);
+                            return data;
+                        }, {
+                            internal: [],
+                            external: []
+                        });
+
+                    // Calulate the label position.
+                    map[id] = getLabelPosition(
+                        data.internal,
+                        data.external
+                    );
+                }
+                return map;
+            }, {});
+        };
+
+        /**
+         * Takes an array of relations and adds the properties `totalOverlap` and
+         * `overlapping` to each set. The property `totalOverlap` is the sum of value
+         * for each relation where this set is included. The property `overlapping` is
+         * a map of how much this set is overlapping another set.
+         * NOTE: This algorithm ignores relations consisting of more than 2 sets.
+         * @private
+         * @param {Array<object>} relations The list of relations that should be sorted.
+         * @return {Array<object>} Returns the modified input relations with added
+         * properties `totalOverlap` and `overlapping`.
+         */
+        var addOverlapToSets = function addOverlapToSets(relations) {
+            // Calculate the amount of overlap per set.
+            var mapOfIdToProps = relations
+                // Filter out relations consisting of 2 sets.
+                .filter(function (relation) {
+                    return relation.sets.length === 2;
+                })
+                // Sum up the amount of overlap for each set.
+                .reduce(function (map, relation) {
+                    var sets = relation.sets;
+
+                    sets.forEach(function (set, i, arr) {
+                        if (!isObject(map[set])) {
+                            map[set] = {
+                                overlapping: {},
+                                totalOverlap: 0
+                            };
+                        }
+                        map[set].totalOverlap += relation.value;
+                        map[set].overlapping[arr[1 - i]] = relation.value;
+                    });
+                    return map;
+                }, {});
+
+            relations
+                // Filter out single sets
+                .filter(isSet)
+                // Extend the set with the calculated properties.
+                .forEach(function (set) {
+                    var properties = mapOfIdToProps[set.sets[0]];
+
+                    extend(set, properties);
+                });
+
+            // Returns the modified relations.
+            return relations;
+        };
+
+        /**
+         * Takes two sets and finds the one with the largest total overlap.
+         * @private
+         * @param {object} a The first set to compare.
+         * @param {object} b The second set to compare.
+         * @return {number} Returns 0 if a and b are equal, <0 if a is greater, >0 if b
+         * is greater.
+         */
+        var sortByTotalOverlap = function sortByTotalOverlap(a, b) {
+            return b.totalOverlap - a.totalOverlap;
+        };
+
+        /**
+         * Uses a greedy approach to position all the sets. Works well with a small
+         * number of sets, and are in these cases a good choice aesthetically.
+         * @private
+         * @param {Array<object>} relations List of the overlap between two or more
+         * sets, or the size of a single set.
+         * @return {Array<object>} List of circles and their calculated positions.
+         */
+        var layoutGreedyVenn = function layoutGreedyVenn(relations) {
+            var positionedSets = [],
+                mapOfIdToCircles = {};
+
+            // Define a circle for each set.
+            relations
+                .filter(function (relation) {
+                    return relation.sets.length === 1;
+                }).forEach(function (relation) {
+                    mapOfIdToCircles[relation.sets[0]] = relation.circle = {
+                        x: Number.MAX_VALUE,
+                        y: Number.MAX_VALUE,
+                        r: Math.sqrt(relation.value / Math.PI)
+                    };
+                });
+
+            /**
+             * Takes a set and updates the position, and add the set to the list of
+             * positioned sets.
+             * @private
+             * @param {object} set The set to add to its final position.
+             * @param {object} coordinates The coordinates to position the set at.
+             */
+            var positionSet = function positionSet(set, coordinates) {
+                var circle = set.circle;
+
+                circle.x = coordinates.x;
+                circle.y = coordinates.y;
+                positionedSets.push(set);
+            };
+
+            // Find overlap between sets. Ignore relations with more then 2 sets.
+            addOverlapToSets(relations);
+
+            // Sort sets by the sum of their size from large to small.
+            var sortedByOverlap = relations
+                .filter(isSet)
+                .sort(sortByTotalOverlap);
+
+            // Position the most overlapped set at 0,0.
+            positionSet(sortedByOverlap.shift(), { x: 0, y: 0 });
+
+            var relationsWithTwoSets = relations.filter(function (x) {
+                return x.sets.length === 2;
+            });
+
+            // Iterate and position the remaining sets.
+            sortedByOverlap.forEach(function (set) {
+                var circle = set.circle,
+                    radius = circle.r,
+                    overlapping = set.overlapping;
+
+                var bestPosition = positionedSets
+                    .reduce(function (best, positionedSet, i) {
+                        var positionedCircle = positionedSet.circle,
+                            overlap = overlapping[positionedSet.sets[0]];
+
+                        // Calculate the distance between the sets to get the correct
+                        // overlap
+                        var distance = getDistanceBetweenCirclesByOverlap(
+                            radius,
+                            positionedCircle.r,
+                            overlap
+                        );
+
+                        // Create a list of possible coordinates calculated from
+                        // distance.
+                        var possibleCoordinates = [
+                            { x: positionedCircle.x + distance, y: positionedCircle.y },
+                            { x: positionedCircle.x - distance, y: positionedCircle.y },
+                            { x: positionedCircle.x, y: positionedCircle.y + distance },
+                            { x: positionedCircle.x, y: positionedCircle.y - distance }
+                        ];
+
+                        // If there are more circles overlapping, then add the
+                        // intersection points as possible positions.
+                        positionedSets.slice(i + 1).forEach(function (positionedSet2) {
+                            var positionedCircle2 = positionedSet2.circle,
+                                overlap2 = overlapping[positionedSet2.sets[0]],
+                                distance2 = getDistanceBetweenCirclesByOverlap(
+                                    radius,
+                                    positionedCircle2.r,
+                                    overlap2
+                                );
+
+                            // Add intersections to list of coordinates.
+                            possibleCoordinates = possibleCoordinates.concat(
+                                getCircleCircleIntersection({
+                                    x: positionedCircle.x,
+                                    y: positionedCircle.y,
+                                    r: distance
+                                }, {
+                                    x: positionedCircle2.x,
+                                    y: positionedCircle2.y,
+                                    r: distance2
+                                })
+                            );
+                        });
+
+                        // Iterate all suggested coordinates and find the best one.
+                        possibleCoordinates.forEach(function (coordinates) {
+                            circle.x = coordinates.x;
+                            circle.y = coordinates.y;
+
+                            // Calculate loss for the suggested coordinates.
+                            var currentLoss = loss(
+                                mapOfIdToCircles, relationsWithTwoSets
+                            );
+
+                            // If the loss is better, then use these new coordinates.
+                            if (currentLoss < best.loss) {
+                                best.loss = currentLoss;
+                                best.coordinates = coordinates;
+                            }
+                        });
+
+                        // Return resulting coordinates.
+                        return best;
+                    }, {
+                        loss: Number.MAX_VALUE,
+                        coordinates: undefined
+                    });
+
+                // Add the set to its final position.
+                positionSet(set, bestPosition.coordinates);
+            });
+
+            // Return the positions of each set.
+            return mapOfIdToCircles;
+        };
+
+        /**
+         * Calculates the positions of all the sets in the venn diagram.
+         * @private
+         * @todo Add support for constrained MDS.
+         * @param {Array<object>} relations List of the overlap between two or more sets, or the
+         * size of a single set.
+         * @return {Arrat<object>} List of circles and their calculated positions.
+         */
+        var layout = function (relations) {
+            var mapOfIdToShape = {};
+
+            // Calculate best initial positions by using greedy layout.
+            if (relations.length > 0) {
+                mapOfIdToShape = layoutGreedyVenn(relations);
+
+                relations
+                    .filter(function (x) {
+                        return !isSet(x);
+                    })
+                    .forEach(function (relation) {
+                        var sets = relation.sets,
+                            id = sets.join(),
+                            circles = sets.map(function (set) {
+                                return mapOfIdToShape[set];
+                            });
+
+                        // Add intersection shape to map
+                        mapOfIdToShape[id] =
+                            getAreaOfIntersectionBetweenCircles(circles);
+                    });
+            }
+            return mapOfIdToShape;
+        };
+
+        var isValidRelation = function (x) {
+            var map = {};
+
+            return (
+                isObject(x) &&
+                (isNumber(x.value) && x.value > -1) &&
+                (isArray(x.sets) && x.sets.length > 0) &&
+                !x.sets.some(function (set) {
+                    var invalid = false;
+
+                    if (!map[set] && isString(set)) {
+                        map[set] = true;
+                    } else {
+                        invalid = true;
+                    }
+                    return invalid;
+                })
+            );
+        };
+
+        var isValidSet = function (x) {
+            return (isValidRelation(x) && isSet(x) && x.value > 0);
+        };
+
+        /**
+         * Prepares the venn data so that it is usable for the layout function. Filter
+         * out sets, or intersections that includes sets, that are missing in the data
+         * or has (value < 1). Adds missing relations between sets in the data as
+         * value = 0.
+         * @private
+         * @param {Array<object>} data The raw input data.
+         * @return {Array<object>} Returns an array of valid venn data.
+         */
+        var processVennData = function processVennData(data) {
+            var d = isArray(data) ? data : [];
+
+            var validSets = d
+                .reduce(function (arr, x) {
+                    // Check if x is a valid set, and that it is not an duplicate.
+                    if (isValidSet(x) && arr.indexOf(x.sets[0]) === -1) {
+                        arr.push(x.sets[0]);
+                    }
+                    return arr;
+                }, [])
+                .sort();
+
+            var mapOfIdToRelation = d.reduce(function (mapOfIdToRelation, relation) {
+                if (isValidRelation(relation) && !relation.sets.some(function (set) {
+                    return validSets.indexOf(set) === -1;
+                })) {
+                    mapOfIdToRelation[relation.sets.sort().join()] = relation;
+                }
+                return mapOfIdToRelation;
+            }, {});
+
+            validSets.reduce(function (combinations, set, i, arr) {
+                var remaining = arr.slice(i + 1);
+
+                remaining.forEach(function (set2) {
+                    combinations.push(set + ',' + set2);
+                });
+                return combinations;
+            }, []).forEach(function (combination) {
+                if (!mapOfIdToRelation[combination]) {
+                    var obj = {
+                        sets: combination.split(','),
+                        value: 0
+                    };
+
+                    mapOfIdToRelation[combination] = obj;
+                }
+            });
+
+            // Transform map into array.
+            return objectValues(mapOfIdToRelation);
+        };
+
+        /**
+         * Calculates the proper scale to fit the cloud inside the plotting area.
+         * @private
+         * @todo add unit test
+         * @param {number} targetWidth  Width of target area.
+         * @param {number} targetHeight Height of target area.
+         * @param {object} field The playing field.
+         * @param {Highcharts.Series} series Series object.
+         * @return {object} Returns the value to scale the playing field up to the size
+         * of the target area, and center of x and y.
+         */
+        var getScale = function getScale(targetWidth, targetHeight, field) {
+            var height = field.bottom - field.top, // top is smaller than bottom
+                width = field.right - field.left,
+                scaleX = width > 0 ? 1 / width * targetWidth : 1,
+                scaleY = height > 0 ? 1 / height * targetHeight : 1,
+                adjustX = (field.right + field.left) / 2,
+                adjustY = (field.top + field.bottom) / 2,
+                scale = Math.min(scaleX, scaleY);
+
+            return {
+                scale: scale,
+                centerX: targetWidth / 2 - adjustX * scale,
+                centerY: targetHeight / 2 - adjustY * scale
+            };
+        };
+
+        /**
+         * If a circle is outside a give field, then the boundaries of the field is
+         * adjusted accordingly. Modifies the field object which is passed as the first
+         * parameter.
+         * @private
+         * @todo NOTE: Copied from wordcloud, can probably be unified.
+         * @param {object} field The bounding box of a playing field.
+         * @param {object} placement The bounding box for a placed point.
+         * @return {object} Returns a modified field object.
+         */
+        var updateFieldBoundaries = function updateFieldBoundaries(field, circle) {
+            var left = circle.x - circle.r,
+                right = circle.x + circle.r,
+                bottom = circle.y + circle.r,
+                top = circle.y - circle.r;
+
+            // TODO improve type checking.
+            if (!isNumber(field.left) || field.left > left) {
+                field.left = left;
+            }
+            if (!isNumber(field.right) || field.right < right) {
+                field.right = right;
+            }
+            if (!isNumber(field.top) || field.top > top) {
+                field.top = top;
+            }
+            if (!isNumber(field.bottom) || field.bottom < bottom) {
+                field.bottom = bottom;
+            }
+            return field;
+        };
+
+        /**
+         * A Venn diagram displays all possible logical relations between a collection
+         * of different sets. The sets are represented by circles, and the relation
+         * between the sets are displayed by the overlap or lack of overlap between
+         * them. The venn diagram is a special case of Euler diagrams, which can also
+         * be displayed by this series type.
+         *
+         * @sample {highcharts} highcharts/demo/venn-diagram/
+         *         Venn diagram
+         * @sample {highcharts} highcharts/demo/euler-diagram/
+         *         Euler diagram
+         *
+         * @extends      plotOptions.scatter
+         * @excluding    connectEnds, connectNulls, cropThreshold, findNearestPointBy,
+         *               getExtremesFromAll, jitter, label, linecap, lineWidth,
+         *               linkedTo, marker, negativeColor, pointInterval,
+         *               pointIntervalUnit, pointPlacement, pointStart, softThreshold,
+         *               stacking, steps, threshold, xAxis, yAxis, zoneAxis, zones
+         * @product      highcharts
+         * @optionparent plotOptions.venn
+         */
+        var vennOptions = {
+            borderColor: '#cccccc',
+            borderDashStyle: 'solid',
+            borderWidth: 1,
+            brighten: 0,
+            clip: false,
+            colorByPoint: true,
+            dataLabels: {
+                enabled: true,
+                formatter: function () {
+                    return this.point.name;
+                }
+            },
+            marker: false,
+            opacity: 0.75,
+            showInLegend: false,
+            states: {
+                hover: {
+                    opacity: 1,
+                    halo: false,
+                    borderColor: '#333333'
+                },
+                select: {
+                    color: '#cccccc',
+                    borderColor: '#000000',
+                    animation: false
+                }
+            },
+            tooltip: {
+                pointFormat: '{point.name}: {point.value}'
+            }
+        };
+
+        var vennSeries = {
+            isCartesian: false,
+            axisTypes: [],
+            directTouch: true,
+            pointArrayMap: ['value'],
+            translate: function () {
+
+                var chart = this.chart;
+
+                this.processedXData = this.xData;
+                this.generatePoints();
+
+                // Process the data before passing it into the layout function.
+                var relations = processVennData(this.options.data);
+
+                // Calculate the positions of each circle.
+                var mapOfIdToShape = layout(relations);
+
+                // Calculate positions of each data label
+                var mapOfIdToLabelPosition = getLabelPositions(relations);
+
+                // Calculate the scale, and center of the plot area.
+                var field = Object.keys(mapOfIdToShape)
+                        .filter(function (key) {
+                            var shape = mapOfIdToShape[key];
+
+                            return shape && isNumber(shape.r);
+                        })
+                        .reduce(function (field, key) {
+                            return updateFieldBoundaries(field, mapOfIdToShape[key]);
+                        }, { top: 0, bottom: 0, left: 0, right: 0 }),
+                    scaling = getScale(chart.plotWidth, chart.plotHeight, field),
+                    scale = scaling.scale,
+                    centerX = scaling.centerX,
+                    centerY = scaling.centerY;
+
+                // Iterate all points and calculate and draw their graphics.
+                this.points.forEach(function (point) {
+                    var sets = isArray(point.sets) ? point.sets : [],
+                        id = sets.join(),
+                        shape = mapOfIdToShape[id],
+                        shapeArgs,
+                        dataLabelPosition = mapOfIdToLabelPosition[id];
+
+                    if (shape) {
+                        if (shape.r) {
+                            shapeArgs = {
+                                x: centerX + shape.x * scale,
+                                y: centerY + shape.y * scale,
+                                r: shape.r * scale
+                            };
+                        } else if (shape.d) {
+                            // TODO: find a better way to handle scaling of a path.
+                            var d = shape.d.reduce(function (path, arr) {
+                                if (arr[0] === 'M') {
+                                    arr[1] = centerX + arr[1] * scale;
+                                    arr[2] = centerY + arr[2] * scale;
+                                } else if (arr[0] === 'A') {
+                                    arr[1] = arr[1] * scale;
+                                    arr[2] = arr[2] * scale;
+                                    arr[6] = centerX + arr[6] * scale;
+                                    arr[7] = centerY + arr[7] * scale;
+                                }
+                                return path.concat(arr);
+                            }, [])
+                                .join(' ');
+
+                            shapeArgs = {
+                                d: d
+                            };
+                        }
+
+                        // Scale the position for the data label.
+                        if (dataLabelPosition) {
+                            dataLabelPosition.x = centerX + dataLabelPosition.x * scale;
+                            dataLabelPosition.y = centerY + dataLabelPosition.y * scale;
+                        } else {
+                            dataLabelPosition = {};
+                        }
+                    }
+
+                    point.shapeArgs = shapeArgs;
+
+                    // Placement for the data labels
+                    if (dataLabelPosition && shapeArgs) {
+                        point.plotX = dataLabelPosition.x;
+                        point.plotY = dataLabelPosition.y;
+                    }
+
+                    // Set name for usage in tooltip and in data label.
+                    point.name = point.options.name || sets.join('∩');
+                });
+            },
+            /**
+             * Draw the graphics for each point.
+             * @private
+             */
+            drawPoints: function () {
+                var series = this,
+                    // Series properties
+                    chart = series.chart,
+                    group = series.group,
+                    points = series.points || [],
+                    // Chart properties
+                    renderer = chart.renderer;
+
+                // Iterate all points and calculate and draw their graphics.
+                points.forEach(function (point) {
+                    var attribs,
+                        shapeArgs = point.shapeArgs;
+
+                    // Add point attribs
+                    if (!chart.styledMode) {
+                        attribs = series.pointAttribs(point, point.state);
+                    }
+                    // Draw the point graphic.
+                    point.draw({
+                        isNew: !point.graphic,
+                        animatableAttribs: shapeArgs,
+                        attribs: attribs,
+                        group: group,
+                        renderer: renderer,
+                        shapeType: shapeArgs && shapeArgs.d ? 'path' : 'circle'
+                    });
+                });
+
+            },
+            /**
+             * Calculates the style attributes for a point. The attributes can vary
+             * depending on the state of the point.
+             * @private
+             * @param {object} point The point which will get the resulting attributes.
+             * @param {string} state The state of the point.
+             * @return {object} Returns the calculated attributes.
+             */
+            pointAttribs: function (point, state) {
+                var series = this,
+                    seriesOptions = series.options || {},
+                    pointOptions = point && point.options || {},
+                    stateOptions = (state && seriesOptions.states[state]) || {},
+                    options = merge(
+                        seriesOptions,
+                        { color: point && point.color },
+                        pointOptions,
+                        stateOptions
+                    );
+
+                // Return resulting values for the attributes.
+                return {
+                    'fill': color(options.color)
+                        .setOpacity(options.opacity)
+                        .brighten(options.brightness)
+                        .get(),
+                    'stroke': options.borderColor,
+                    'stroke-width': options.borderWidth,
+                    'dashstyle': options.borderDashStyle
+                };
+            },
+            animate: function (init) {
+                if (!init) {
+                    var series = this,
+                        animOptions = H.animObject(series.options.animation);
+
+                    series.points.forEach(function (point) {
+                        var args = point.shapeArgs;
+
+                        if (point.graphic && args) {
+                            var attr = {},
+                                animate = {};
+
+                            if (args.d) {
+                                // If shape is a path, then animate opacity.
+                                attr.opacity = 0.001;
+                            } else {
+                                // If shape is a circle, then animate radius.
+                                attr.r = 0;
+                                animate.r = args.r;
+                            }
+
+                            point.graphic
+                                .attr(attr)
+                                .animate(animate, animOptions);
+
+                            // If shape is path, then fade it in after the circles
+                            // animation
+                            if (args.d) {
+                                setTimeout(function () {
+                                    if (point && point.graphic) {
+                                        point.graphic.animate({
+                                            opacity: 1
+                                        });
+                                    }
+                                }, animOptions.duration);
+                            }
+                        }
+                    }, series);
+                    series.animate = null;
+                }
+            },
+            utils: {
+                addOverlapToSets: addOverlapToSets,
+                geometry: geometry,
+                geometryCircles: geometryCircles,
+                getDistanceBetweenCirclesByOverlap: getDistanceBetweenCirclesByOverlap,
+                layoutGreedyVenn: layoutGreedyVenn,
+                loss: loss,
+                processVennData: processVennData,
+                sortByTotalOverlap: sortByTotalOverlap
+            }
+        };
+
+        var vennPoint = {
+            draw: draw,
+            shouldDraw: function () {
+                var point = this;
+
+                // Only draw points with single sets.
+                return !!point.shapeArgs;
+            },
+            isValid: function () {
+                return isNumber(this.value);
+            }
+        };
+
+        /**
+         * A `venn` series. If the [type](#series.venn.type) option is
+         * not specified, it is inherited from [chart.type](#chart.type).
+         *
+         * @extends   series,plotOptions.venn
+         * @excluding connectEnds, connectNulls, cropThreshold, dataParser, dataURL,
+         *            findNearestPointBy, getExtremesFromAll, label, linecap, lineWidth,
+         *            linkedTo, marker, negativeColor, pointInterval, pointIntervalUnit,
+         *            pointPlacement, pointStart, softThreshold, stack, stacking, steps,
+         *            threshold, xAxis, yAxis, zoneAxis, zones
+         * @product   highcharts
+         * @apioption series.venn
+         */
+
+        /**
+         * @type      {Array<*>}
+         * @extends   series.scatter.data
+         * @excluding marker, x, y
+         * @product   highcharts
+         * @apioption series.venn.data
+         */
+
+        /**
+         * The name of the point. Used in data labels and tooltip. If name is not
+         * defined then it will default to the joined values in
+         * [sets](#series.venn.sets).
+         *
+         * @sample {highcharts} highcharts/demo/venn-diagram/
+         *         Venn diagram
+         * @sample {highcharts} highcharts/demo/euler-diagram/
+         *         Euler diagram
+         *
+         * @type      {number}
+         * @since     7.0.0
+         * @product   highcharts
+         * @apioption series.venn.data.name
+         */
+
+        /**
+         * The value of the point, resulting in a relative area of the circle, or area
+         * of overlap between two sets in the venn or euler diagram.
+         *
+         * @sample {highcharts} highcharts/demo/venn-diagram/
+         *         Venn diagram
+         * @sample {highcharts} highcharts/demo/euler-diagram/
+         *         Euler diagram
+         *
+         * @type      {number}
+         * @since     7.0.0
+         * @product   highcharts
+         * @apioption series.venn.data.value
+         */
+
+        /**
+         * The set or sets the options will be applied to. If a single entry is defined,
+         * then it will create a new set. If more than one entry is defined, then it
+         * will define the overlap between the sets in the array.
+         *
+         * @sample {highcharts} highcharts/demo/venn-diagram/
+         *         Venn diagram
+         * @sample {highcharts} highcharts/demo/euler-diagram/
+         *         Euler diagram
+         *
+         * @type      {Array<string>}
+         * @since     7.0.0
+         * @product   highcharts
+         * @apioption series.venn.data.sets
+         */
+
+        /**
+         * @private
+         * @class
+         * @name Highcharts.seriesTypes.venn
+         *
+         * @augments Highcharts.Series
+         */
+        seriesType('venn', 'scatter', vennOptions, vennSeries, vennPoint);
+
+    }(draw, geometry, geometryCircles, Highcharts));
+    return (function () {
+
+
+    }());
+}));