All Downloads are FREE. Search and download functionalities are using the official Maven repository.

package.modules.broken-axis.js Maven / Gradle / Ivy

The newest version!
!/**
 * Highcharts JS v11.4.8 (2024-08-29)
 *
 * (c) 2009-2024 Torstein Honsi
 *
 * License: www.highcharts.com/license
 */function(t){"object"==typeof module&&module.exports?(t.default=t,module.exports=t):"function"==typeof define&&define.amd?define("highcharts/modules/broken-axis",["highcharts"],function(i){return t(i),t.Highcharts=i,t}):t("undefined"!=typeof Highcharts?Highcharts:void 0)}(function(t){"use strict";var i=t?t._modules:{};function e(i,e,s,n){i.hasOwnProperty(e)||(i[e]=n.apply(null,s),"function"==typeof CustomEvent&&t.win.dispatchEvent(new CustomEvent("HighchartsModuleLoaded",{detail:{path:e,module:i[e]}})))}e(i,"Core/Axis/BrokenAxis.js",[i["Core/Axis/Stacking/StackItem.js"],i["Core/Utilities.js"]],function(t,i){var e;let{addEvent:s,find:n,fireEvent:o,isArray:r,isNumber:a,pick:l}=i;return function(i){function e(){void 0!==this.brokenAxis&&this.brokenAxis.setBreaks(this.options.breaks,!1)}function f(){this.brokenAxis?.hasBreaks&&(this.options.ordinal=!1)}function h(){let t=this.brokenAxis;if(t?.hasBreaks){let i=this.tickPositions,e=this.tickPositions.info,s=[];for(let e=0;ei.to||s>i.from&&ni.from&&ni.from&&n>i.to&&n0){let i,a;for("value"!==this.options.gapUnit&&(o*=this.basePointRange),e&&e>o&&e>=this.basePointRange&&(o=e);r--;)if(a&&!1!==a.visible||(a=s[r+1]),i=s[r],!1!==a.visible&&!1!==i.visible){if(a.x-i.x>o){let e=(i.x+a.x)/2;s.splice(r+1,0,{isNull:!0,x:e}),n.stacking&&this.options.stacking&&((n.stacking.stacks[this.stackKey][e]=new t(n,n.options.stackLabels,!1,e,this.stack)).total=0)}a=i}}return this.getGraphPath(s)}i.compose=function(t,i){if(!t.keepProps.includes("brokenAxis")){t.keepProps.push("brokenAxis"),s(t,"init",u),s(t,"afterInit",e),s(t,"afterSetTickPositions",h),s(t,"afterSetOptions",f);let n=i.prototype;n.drawBreaks=p,n.gappedPath=m,s(i,"afterGeneratePoints",c),s(i,"afterRender",k)}return t};class x{static isInBreak(t,i){let e=t.repeat||1/0,s=t.from,n=t.to-t.from,o=i>=s?(i-s)%e:e-(s-i)%e;return t.inclusive?o<=n:o=s);o++)n.to=t)break;else if(x.isInBreak(n,t)){s-=t-n.from;break}return s}constructor(t){this.hasBreaks=!1,this.axis=t}findBreakAt(t,i){return n(i,function(i){return i.fromc;)p-=u;for(;p




© 2015 - 2024 Weber Informatics LLC | Privacy Policy