@amcharts/amcharts5 5.3.16 → 5.4.0

package/.internal/charts/hierarchy/VoronoiTreemap.d.ts

@@ -0,0 +1,117 @@
+import type { HierarchyNode } from "../hierarchy/HierarchyNode";
+import type { DataItem } from "../../core/render/Component";
+import { Hierarchy, IHierarchyPrivate, IHierarchySettings, IHierarchyDataItem } from "../hierarchy/Hierarchy";
+import { ListTemplate } from "../../core/util/List";
+import { Polygon } from "../../core/render/Polygon";
+export interface IVoronoiTreemapDataObject {
+    name?: string;
+    value?: number;
+    children?: IVoronoiTreemapDataObject[];
+    dataItem?: DataItem<IVoronoiTreemapDataItem>;
+}
+export interface IVoronoiTreemapDataItem extends IHierarchyDataItem {
+    /**
+     * Data items of child nodes.
+     */
+    children: Array<DataItem<IVoronoiTreemapDataItem>>;
+    /**
+     * Data it of a parent node.
+     */
+    parent: DataItem<IVoronoiTreemapDataItem>;
+    /**
+     * A [[Polygon]] element of a node.
+     */
+    polygon: Polygon;
+}
+export interface IVoronoiTreemapSettings extends IHierarchySettings {
+    /**
+     * Type of the diagram's shape.
+     *
+     * @see {@link https://www.amcharts.com/docs/v5/charts/hierarchy/voronoi-treemap/#Diagram_type} for more info
+     * @default "polygon"
+     */
+    type?: "rectangle" | "polygon";
+    /**
+     * Number of corners when type is `"polygon"`.
+     *
+     * `120` means the polygoon will look like a circle.
+     *
+     * NOTE: this setting is ignored if `type="rectangle"`.
+     *
+     * @default 120
+     */
+    cornerCount?: number;
+    /**
+     * Minimum weight ratio which allows computing the minimum allowed
+     * weight (`= [maximum weight] * minWeightRatio`).
+     *
+     * Setting very small `minWeigtRatio` might result flickering.
+     *
+     * NOTE: the nodes that have smaller weight will be scaled up and will not
+     * represent their true value correctly.
+     *
+     * @default 0.005
+     */
+    minWeightRatio?: number;
+    /**
+     * The convergence ratio in Voronoi treemaps measures how well the treemap
+     * layout represents the hierarchical structure of the underlying data.
+     *
+     * It is calculated as the ratio of the summed area of the smallest enclosing
+     * rectangle for each cell to the total area of the treemap. A lower
+     * convergence ratio indicates a better representation of the hierarchy,
+     * meaning that the cells are closely packed and the treemap effectively
+     * captures the nested relationships between the data elements.
+     *
+     * @default 0.005
+     */
+    convergenceRatio?: number;
+    /**
+     * Maximum allowed number of iterations when computing the layout.
+     *
+     * Computation is stopped when it number of iterations is reached, even if
+     * the `convergenceRatio` is not yet reached.
+     *
+     * Bigger number means finer results, but slower performance.
+     *
+     * @default 100
+     */
+    maxIterationCount?: number;
+}
+export interface IVoronoiTreemapPrivate extends IHierarchyPrivate {
+}
+/**
+ * A Weighted Voronoi Treemap series.
+ *
+ * NOTE: Try to avoid a big number of data items with very big value
+ * differences. Better group small items into "Other" item.
+ *
+ * @see {@link https://www.amcharts.com/docs/v5/charts/hierarchy/voronoi-treemap/} for more info
+ * @since 5.4.0
+ */
+export declare class VoronoiTreemap extends Hierarchy {
+    _settings: IVoronoiTreemapSettings;
+    _privateSettings: IVoronoiTreemapPrivate;
+    _dataItemSettings: IVoronoiTreemapDataItem;
+    protected _tag: string;
+    static className: string;
+    static classNames: Array<string>;
+    /**
+     * A list of node graphics elements in a [[VoronoiTreemap]] chart.
+     *
+     * @default new ListTemplate<RoundedRectangle>
+     */
+    readonly polygons: ListTemplate<Polygon>;
+    voronoi: any;
+    protected _afterNew(): void;
+    _prepareChildren(): void;
+    protected _updateNode(dataItem: DataItem<this["_dataItemSettings"]>): void;
+    protected _handleSingle(dataItem: DataItem<this["_dataItemSettings"]>): void;
+    /**
+     * @ignore
+     */
+    makeNode(dataItem: DataItem<this["_dataItemSettings"]>): HierarchyNode;
+    protected _makeNode(dataItem: DataItem<this["_dataItemSettings"]>, node: HierarchyNode): void;
+    protected getCirclePolygon(radius: number): number[][];
+}
+//# sourceMappingURL=VoronoiTreemap.d.ts.map

package/.internal/charts/hierarchy/VoronoiTreemap.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"VoronoiTreemap.d.ts","sourceRoot":"","sources":["../../../../../src/.internal/charts/hierarchy/VoronoiTreemap.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAEhE,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAC5D,OAAO,EAAE,SAAS,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,MAAM,wBAAwB,CAAC;AAE9G,OAAO,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AACpD,OAAO,EAAE,OAAO,EAAE,MAAM,2BAA2B,CAAC;AAMpD,MAAM,WAAW,yBAAyB;IACzC,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE,yBAAyB,EAAE,CAAC;IACvC,QAAQ,CAAC,EAAE,QAAQ,CAAC,uBAAuB,CAAC,CAAA;CAC5C;AAED,MAAM,WAAW,uBAAwB,SAAQ,kBAAkB;IAClE;;OAEG;IACH,QAAQ,EAAE,KAAK,CAAC,QAAQ,CAAC,uBAAuB,CAAC,CAAC,CAAC;IAEnD;;OAEG;IACH,MAAM,EAAE,QAAQ,CAAC,uBAAuB,CAAC,CAAC;IAE1C;;OAEG;IACH,OAAO,EAAE,OAAO,CAAC;CAEjB;AAED,MAAM,WAAW,uBAAwB,SAAQ,kBAAkB;IAElE;;;;;OAKG;IACH,IAAI,CAAC,EAAE,WAAW,GAAG,SAAS,CAAA;IAE9B;;;;;;;;OAQG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;IAErB;;;;;;;;;;OAUG;IACH,cAAc,CAAC,EAAE,MAAM,CAAC;IAExB;;;;;;;;;;;OAWG;IACH,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAE1B;;;;;;;;;OASG;IACH,iBAAiB,CAAC,EAAE,MAAM,CAAC;CAE3B;AAED,MAAM,WAAW,sBAAuB,SAAQ,iBAAiB;CAChE;AAED;;;;;;;;GAQG;AACH,qBAAa,cAAe,SAAQ,SAAS;IAE7B,SAAS,EAAE,uBAAuB,CAAC;IACnC,gBAAgB,EAAE,sBAAsB,CAAC;IACzC,iBAAiB,EAAE,uBAAuB,CAAC;IAE1D,SAAS,CAAC,IAAI,EAAE,MAAM,CAAoB;IAE1C,OAAc,SAAS,EAAE,MAAM,CAAoB;IACnD,OAAc,UAAU,EAAE,KAAK,CAAC,MAAM,CAAC,CAA2D;IAElG;;;;OAIG;IACH,SAAgB,QAAQ,EAAE,YAAY,CAAC,OAAO,CAAC,CAK7C;IAEK,OAAO,MAAoB;IAElC,SAAS,CAAC,SAAS;IAYZ,gBAAgB;IAuCvB,SAAS,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;IAgDnE,SAAS,CAAC,aAAa,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;IAgBrE;;OAEG;IACI,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC,GAAG,aAAa;IAM7E,SAAS,CAAC,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC,EAAE,IAAI,EAAE,aAAa;IAOtF,SAAS,CAAC,gBAAgB,CAAC,MAAM,EAAE,MAAM;CAYzC"}

package/.internal/charts/hierarchy/VoronoiTreemap.js

@@ -0,0 +1,176 @@
+import { voronoiTreemap } from 'd3-voronoi-treemap';
+import seedrandom from "seedrandom";
+import { Hierarchy } from "../hierarchy/Hierarchy";
+import { Template } from "../../core/util/Template";
+import { ListTemplate } from "../../core/util/List";
+import { Polygon } from "../../core/render/Polygon";
+import * as $utils from "../../core/util/Utils";
+import * as $array from "../../core/util/Array";
+import { p50 } from "../../core/util/Percent";
+;
+/**
+ * A Weighted Voronoi Treemap series.
+ *
+ * NOTE: Try to avoid a big number of data items with very big value
+ * differences. Better group small items into "Other" item.
+ *
+ * @see {@link https://www.amcharts.com/docs/v5/charts/hierarchy/voronoi-treemap/} for more info
+ * @since 5.4.0
+ */
+export class VoronoiTreemap extends Hierarchy {
+    constructor() {
+        super(...arguments);
+        Object.defineProperty(this, "_tag", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: "voronoitreemap"
+        });
+        /**
+         * A list of node graphics elements in a [[VoronoiTreemap]] chart.
+         *
+         * @default new ListTemplate<RoundedRectangle>
+         */
+        Object.defineProperty(this, "polygons", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: new ListTemplate(Template.new({}), () => Polygon._new(this._root, {
+                themeTags: $utils.mergeTags(this.polygons.template.get("themeTags", []), [this._tag, "shape"])
+            }, [this.polygons.template]))
+        });
+        Object.defineProperty(this, "voronoi", {
+            enumerable: true,
+            configurable: true,
+            writable: true,
+            value: voronoiTreemap()
+        });
+    }
+    _afterNew() {
+        this.nodesContainer.setAll({
+            x: p50,
+            y: p50,
+            centerX: p50,
+            centerY: p50
+        });
+        super._afterNew();
+    }
+    _prepareChildren() {
+        super._prepareChildren();
+        const width = this.innerWidth() / 2;
+        const height = this.innerHeight() / 2;
+        let node = this._rootNode;
+        const selectedDataItem = this.get("selectedDataItem");
+        if (selectedDataItem) {
+            node = selectedDataItem.get("d3HierarchyNode");
+        }
+        this.voronoi.convergenceRatio((this.get("convergenceRatio", 0.005)));
+        this.voronoi.maxIterationCount((this.get("maxIterationCount", 100)));
+        this.voronoi.minWeightRatio((this.get("minWeightRatio", 0.005)));
+        if (this.isDirty("type")) {
+            if (this.get("type") == "polygon") {
+                this.voronoi.clip(this.getCirclePolygon(1));
+                this._updateVisuals();
+            }
+        }
+        if (this._sizeDirty) {
+            if (this.get("type") == "rectangle") {
+                this.voronoi.prng(seedrandom("X"));
+                this.voronoi.clip([[-width, -height], [-width, height], [width, height], [width, -height]])(node);
+                this._updateVisuals();
+            }
+        }
+        if ((this._valuesDirty || this.isDirty("selectedDataItem")) && node) {
+            this.voronoi.prng(seedrandom("X"));
+            this.voronoi(node);
+            this._updateVisuals();
+        }
+    }
+    _updateNode(dataItem) {
+        const coords = dataItem.get("d3HierarchyNode").polygon;
+        const polygon = dataItem.get("polygon");
+        if (coords && polygon) {
+            let coordinates = [];
+            let d = 1;
+            if (this.get("type") == "polygon") {
+                d = Math.min(this.innerWidth(), this.innerHeight()) / 2;
+            }
+            let minX = Infinity;
+            let maxX = -Infinity;
+            for (let i = 0, len = coords.length; i < len; i++) {
+                const point = coords[i];
+                let x = point[0] * d;
+                let y = point[1] * d;
+                coordinates.push([x, y]);
+                minX = Math.min(minX, x);
+                maxX = Math.max(maxX, x);
+            }
+            polygon.set("coordinates", coordinates);
+            const fill = dataItem.get("fill");
+            polygon._setDefault("fill", fill);
+            const label = dataItem.get("label");
+            if (label) {
+                const site = coords.site;
+                if (site) {
+                    label.setAll({
+                        x: site.x * d,
+                        y: site.y * d,
+                        maxWidth: Math.abs(maxX - minX)
+                    });
+                }
+            }
+        }
+    }
+    _handleSingle(dataItem) {
+        const parent = dataItem.get("parent");
+        if (parent) {
+            const children = parent.get("children");
+            if (children) {
+                $array.each(children, (child) => {
+                    if (child != dataItem) {
+                        this.disableDataItem(child);
+                        child.get("node").hide();
+                    }
+                });
+            }
+            this._handleSingle(parent);
+        }
+    }
+    /**
+     * @ignore
+     */
+    makeNode(dataItem) {
+        const node = super.makeNode(dataItem);
+        this._makeNode(dataItem, node);
+        return node;
+    }
+    _makeNode(dataItem, node) {
+        const polygon = node.children.moveValue(this.polygons.make(), 0);
+        node.setPrivate("tooltipTarget", polygon);
+        dataItem.setRaw("polygon", polygon);
+        polygon._setDataItem(dataItem);
+    }
+    getCirclePolygon(radius) {
+        const points = this.get("cornerCount", 120);
+        const dAngle = Math.PI * 2 / points;
+        const polygon = [];
+        for (let i = 0; i < points; i++) {
+            let angle = i * dAngle;
+            polygon.push([radius * Math.cos(angle), radius * Math.sin(angle)]);
+        }
+        return polygon;
+    }
+}
+Object.defineProperty(VoronoiTreemap, "className", {
+    enumerable: true,
+    configurable: true,
+    writable: true,
+    value: "VoronoiTreemap"
+});
+Object.defineProperty(VoronoiTreemap, "classNames", {
+    enumerable: true,
+    configurable: true,
+    writable: true,
+    value: Hierarchy.classNames.concat([VoronoiTreemap.className])
+});
+//# sourceMappingURL=VoronoiTreemap.js.map

package/.internal/charts/hierarchy/VoronoiTreemap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"VoronoiTreemap.js","sourceRoot":"","sources":["../../../../../src/.internal/charts/hierarchy/VoronoiTreemap.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AACpD,OAAO,UAAU,MAAM,YAAY,CAAC;AAKpC,OAAO,EAAE,SAAS,EAA6D,MAAM,wBAAwB,CAAC;AAC9G,OAAO,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AACpD,OAAO,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AACpD,OAAO,EAAE,OAAO,EAAE,MAAM,2BAA2B,CAAC;AACpD,OAAO,KAAK,MAAM,MAAM,uBAAuB,CAAC;AAChD,OAAO,KAAK,MAAM,MAAM,uBAAuB,CAAC;AAChD,OAAO,EAAE,GAAG,EAAE,MAAM,yBAAyB,CAAC;AAQ7C,CAAC;AAqFF;;;;;;;;GAQG;AACH,MAAM,OAAO,cAAe,SAAQ,SAAS;IAA7C;;QAMC;;;;mBAAyB,gBAAgB;WAAC;QAK1C;;;;WAIG;QACH;;;;mBAAkD,IAAI,YAAY,CACjE,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAChB,GAAG,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;gBAC9B,SAAS,EAAE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;aAC9F,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAC5B;WAAC;QAEF;;;;mBAAiB,cAAc,EAAE;WAAC;IAiJnC,CAAC;IA/IU,SAAS;QAElB,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC;YAC1B,CAAC,EAAE,GAAG;YACN,CAAC,EAAE,GAAG;YACN,OAAO,EAAE,GAAG;YACZ,OAAO,EAAE,GAAG;SACZ,CAAC,CAAA;QAEF,KAAK,CAAC,SAAS,EAAE,CAAC;IACnB,CAAC;IAEM,gBAAgB;QACtB,KAAK,CAAC,gBAAgB,EAAE,CAAC;QAEzB,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC;QACpC,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC;QAEtC,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC;QAC1B,MAAM,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,kBAAkB,CAAsC,CAAC;QAE3F,IAAI,gBAAgB,EAAE;YACrB,IAAI,GAAG,gBAAgB,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAA;SAC9C;QAED,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,kBAAkB,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QACrE,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,mBAAmB,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QACrE,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,gBAAgB,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAEjE,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;YACzB,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,SAAS,EAAE;gBAClC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5C,IAAI,CAAC,cAAc,EAAE,CAAC;aACtB;SACD;QAED,IAAI,IAAI,CAAC,UAAU,EAAE;YACpB,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,WAAW,EAAE;gBACpC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;gBACnC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAClG,IAAI,CAAC,cAAc,EAAE,CAAC;aACtB;SACD;QAED,IAAI,CAAC,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC,IAAI,IAAI,EAAE;YACpE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;YACnC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACnB,IAAI,CAAC,cAAc,EAAE,CAAC;SACtB;IACF,CAAC;IAES,WAAW,CAAC,QAA6C;QAClE,MAAM,MAAM,GAAS,QAAQ,CAAC,GAAG,CAAC,iBAAiB,CAAS,CAAC,OAAO,CAAC;QACrE,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAExC,IAAI,MAAM,IAAI,OAAO,EAAE;YAEtB,IAAI,WAAW,GAAQ,EAAE,CAAC;YAE1B,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,SAAS,EAAE;gBAClC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,GAAG,CAAC,CAAC;aACxD;YAED,IAAI,IAAI,GAAG,QAAQ,CAAC;YACpB,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;YAErB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;gBAClD,MAAM,KAAK,GAAkB,MAAM,CAAC,CAAC,CAAQ,CAAC;gBAC9C,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACrB,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBAErB,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBAEzB,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;gBACzB,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;aACzB;YAED,OAAO,CAAC,GAAG,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;YAExC,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAClC,OAAO,CAAC,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAElC,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACpC,IAAI,KAAK,EAAE;gBACV,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;gBAEzB,IAAI,IAAI,EAAE;oBACT,KAAK,CAAC,MAAM,CAAC;wBACZ,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC;wBACb,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC;wBACb,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC;qBAC/B,CAAC,CAAA;iBACF;aACD;SACD;IACF,CAAC;IAGS,aAAa,CAAC,QAA6C;QACpE,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACtC,IAAI,MAAM,EAAE;YACX,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YACxC,IAAI,QAAQ,EAAE;gBACb,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,KAAK,EAAE,EAAE;oBAC/B,IAAI,KAAK,IAAI,QAAQ,EAAE;wBACtB,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;wBAC5B,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;qBACzB;gBACF,CAAC,CAAC,CAAA;aACF;YACD,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;SAC3B;IACF,CAAC;IAED;;OAEG;IACI,QAAQ,CAAC,QAA6C;QAC5D,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACtC,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QAC/B,OAAO,IAAI,CAAC;IACb,CAAC;IAES,SAAS,CAAC,QAA6C,EAAE,IAAmB;QACrF,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;QACjE,IAAI,CAAC,UAAU,CAAC,eAAe,EAAE,OAAO,CAAC,CAAC;QAC1C,QAAQ,CAAC,MAAM,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QACpC,OAAO,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;IAChC,CAAC;IAES,gBAAgB,CAAC,MAAc;QACxC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC;QACpC,MAAM,OAAO,GAAyB,EAAE,CAAC;QAEzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;YAChC,IAAI,KAAK,GAAG,CAAC,GAAG,MAAM,CAAC;YACvB,OAAO,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;SAClE;QAED,OAAO,OAAO,CAAC;IAChB,CAAC;;AA/JD;;;;WAAkC,gBAAgB;GAAC;AACnD;;;;WAA0C,SAAS,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;GAAC","sourcesContent":["import { voronoiTreemap } from 'd3-voronoi-treemap';\r\nimport seedrandom from \"seedrandom\";\r\n\r\nimport type { HierarchyNode } from \"../hierarchy/HierarchyNode\";\r\n\r\nimport type { DataItem } from \"../../core/render/Component\";\r\nimport { Hierarchy, IHierarchyPrivate, IHierarchySettings, IHierarchyDataItem } from \"../hierarchy/Hierarchy\";\r\nimport { Template } from \"../../core/util/Template\";\r\nimport { ListTemplate } from \"../../core/util/List\";\r\nimport { Polygon } from \"../../core/render/Polygon\";\r\nimport * as $utils from \"../../core/util/Utils\";\r\nimport * as $array from \"../../core/util/Array\";\r\nimport { p50 } from \"../../core/util/Percent\";\r\n\r\n\r\nexport interface IVoronoiTreemapDataObject {\r\n\tname?: string,\r\n\tvalue?: number,\r\n\tchildren?: IVoronoiTreemapDataObject[],\r\n\tdataItem?: DataItem<IVoronoiTreemapDataItem>\r\n};\r\n\r\nexport interface IVoronoiTreemapDataItem extends IHierarchyDataItem {\r\n\t/**\r\n\t * Data items of child nodes.\r\n\t */\r\n\tchildren: Array<DataItem<IVoronoiTreemapDataItem>>;\r\n\r\n\t/**\r\n\t * Data it of a parent node.\r\n\t */\r\n\tparent: DataItem<IVoronoiTreemapDataItem>;\r\n\r\n\t/**\r\n\t * A [[Polygon]] element of a node.\r\n\t */\r\n\tpolygon: Polygon;\r\n\r\n}\r\n\r\nexport interface IVoronoiTreemapSettings extends IHierarchySettings {\r\n\r\n\t/**\r\n\t * Type of the diagram's shape.\r\n\t *\r\n\t * @see {@link https://www.amcharts.com/docs/v5/charts/hierarchy/voronoi-treemap/#Diagram_type} for more info\r\n\t * @default \"polygon\"\r\n\t */\r\n\ttype?: \"rectangle\" | \"polygon\"\r\n\r\n\t/**\r\n\t * Number of corners when type is `\"polygon\"`.\r\n\t * \r\n\t * `120` means the polygoon will look like a circle.\r\n\t *\r\n\t * NOTE: this setting is ignored if `type=\"rectangle\"`.\r\n\t * \r\n\t * @default 120\r\n\t */\r\n\tcornerCount?: number;\r\n\r\n\t/**\r\n\t * Minimum weight ratio which allows computing the minimum allowed\r\n\t * weight (`= [maximum weight] * minWeightRatio`).\r\n\t * \r\n\t * Setting very small `minWeigtRatio` might result flickering.\r\n\t *\r\n\t * NOTE: the nodes that have smaller weight will be scaled up and will not\r\n\t * represent their true value correctly.\r\n\t * \r\n\t * @default 0.005\r\n\t */\r\n\tminWeightRatio?: number;\r\n\r\n\t/**\r\n\t * The convergence ratio in Voronoi treemaps measures how well the treemap\r\n\t * layout represents the hierarchical structure of the underlying data.\r\n\t * \r\n\t * It is calculated as the ratio of the summed area of the smallest enclosing\r\n\t * rectangle for each cell to the total area of the treemap. A lower\r\n\t * convergence ratio indicates a better representation of the hierarchy,\r\n\t * meaning that the cells are closely packed and the treemap effectively\r\n\t * captures the nested relationships between the data elements.\r\n\t * \r\n\t * @default 0.005\r\n\t */\r\n\tconvergenceRatio?: number;\r\n\r\n\t/**\r\n\t * Maximum allowed number of iterations when computing the layout.\r\n\t * \r\n\t * Computation is stopped when it number of iterations is reached, even if\r\n\t * the `convergenceRatio` is not yet reached.\r\n\t *\r\n\t * Bigger number means finer results, but slower performance.\r\n\t * \r\n\t * @default 100\r\n\t */\r\n\tmaxIterationCount?: number;\r\n\r\n}\r\n\r\nexport interface IVoronoiTreemapPrivate extends IHierarchyPrivate {\r\n}\r\n\r\n/**\r\n * A Weighted Voronoi Treemap series.\r\n * \r\n * NOTE: Try to avoid a big number of data items with very big value\r\n * differences. Better group small items into \"Other\" item.\r\n *\r\n * @see {@link https://www.amcharts.com/docs/v5/charts/hierarchy/voronoi-treemap/} for more info\r\n * @since 5.4.0\r\n */\r\nexport class VoronoiTreemap extends Hierarchy {\r\n\r\n\tdeclare public _settings: IVoronoiTreemapSettings;\r\n\tdeclare public _privateSettings: IVoronoiTreemapPrivate;\r\n\tdeclare public _dataItemSettings: IVoronoiTreemapDataItem;\r\n\r\n\tprotected _tag: string = \"voronoitreemap\";\r\n\r\n\tpublic static className: string = \"VoronoiTreemap\";\r\n\tpublic static classNames: Array<string> = Hierarchy.classNames.concat([VoronoiTreemap.className]);\r\n\r\n\t/**\r\n\t * A list of node graphics elements in a [[VoronoiTreemap]] chart.\r\n\t *\r\n\t * @default new ListTemplate<RoundedRectangle>\r\n\t */\r\n\tpublic readonly polygons: ListTemplate<Polygon> = new ListTemplate(\r\n\t\tTemplate.new({}),\r\n\t\t() => Polygon._new(this._root, {\r\n\t\t\tthemeTags: $utils.mergeTags(this.polygons.template.get(\"themeTags\", []), [this._tag, \"shape\"])\r\n\t\t}, [this.polygons.template])\r\n\t);\r\n\r\n\tpublic voronoi = voronoiTreemap();\r\n\r\n\tprotected _afterNew() {\r\n\r\n\t\tthis.nodesContainer.setAll({\r\n\t\t\tx: p50,\r\n\t\t\ty: p50,\r\n\t\t\tcenterX: p50,\r\n\t\t\tcenterY: p50\r\n\t\t})\r\n\r\n\t\tsuper._afterNew();\r\n\t}\r\n\r\n\tpublic _prepareChildren() {\r\n\t\tsuper._prepareChildren();\r\n\r\n\t\tconst width = this.innerWidth() / 2;\r\n\t\tconst height = this.innerHeight() / 2;\r\n\r\n\t\tlet node = this._rootNode;\r\n\t\tconst selectedDataItem = this.get(\"selectedDataItem\") as DataItem<IVoronoiTreemapDataItem>;\r\n\r\n\t\tif (selectedDataItem) {\r\n\t\t\tnode = selectedDataItem.get(\"d3HierarchyNode\")\r\n\t\t}\r\n\r\n\t\tthis.voronoi.convergenceRatio((this.get(\"convergenceRatio\", 0.005)));\r\n\t\tthis.voronoi.maxIterationCount((this.get(\"maxIterationCount\", 100)));\r\n\t\tthis.voronoi.minWeightRatio((this.get(\"minWeightRatio\", 0.005)));\r\n\r\n\t\tif (this.isDirty(\"type\")) {\r\n\t\t\tif (this.get(\"type\") == \"polygon\") {\r\n\t\t\t\tthis.voronoi.clip(this.getCirclePolygon(1));\r\n\t\t\t\tthis._updateVisuals();\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif (this._sizeDirty) {\r\n\t\t\tif (this.get(\"type\") == \"rectangle\") {\r\n\t\t\t\tthis.voronoi.prng(seedrandom(\"X\"));\r\n\t\t\t\tthis.voronoi.clip([[-width, -height], [-width, height], [width, height], [width, -height]])(node);\r\n\t\t\t\tthis._updateVisuals();\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif ((this._valuesDirty || this.isDirty(\"selectedDataItem\")) && node) {\r\n\t\t\tthis.voronoi.prng(seedrandom(\"X\"));\r\n\t\t\tthis.voronoi(node);\r\n\t\t\tthis._updateVisuals();\r\n\t\t}\r\n\t}\r\n\r\n\tprotected _updateNode(dataItem: DataItem<this[\"_dataItemSettings\"]>) {\r\n\t\tconst coords: any = (dataItem.get(\"d3HierarchyNode\") as any).polygon;\r\n\t\tconst polygon = dataItem.get(\"polygon\");\r\n\r\n\t\tif (coords && polygon) {\r\n\r\n\t\t\tlet coordinates: any = [];\r\n\r\n\t\t\tlet d = 1;\r\n\t\t\tif (this.get(\"type\") == \"polygon\") {\r\n\t\t\t\td = Math.min(this.innerWidth(), this.innerHeight()) / 2;\r\n\t\t\t}\r\n\r\n\t\t\tlet minX = Infinity;\r\n\t\t\tlet maxX = -Infinity;\r\n\r\n\t\t\tfor (let i = 0, len = coords.length; i < len; i++) {\r\n\t\t\t\tconst point: Array<number> = coords[i] as any;\r\n\t\t\t\tlet x = point[0] * d;\r\n\t\t\t\tlet y = point[1] * d;\r\n\r\n\t\t\t\tcoordinates.push([x, y]);\r\n\r\n\t\t\t\tminX = Math.min(minX, x);\r\n\t\t\t\tmaxX = Math.max(maxX, x);\r\n\t\t\t}\r\n\r\n\t\t\tpolygon.set(\"coordinates\", coordinates);\r\n\r\n\t\t\tconst fill = dataItem.get(\"fill\");\r\n\t\t\tpolygon._setDefault(\"fill\", fill);\r\n\r\n\t\t\tconst label = dataItem.get(\"label\");\r\n\t\t\tif (label) {\r\n\t\t\t\tconst site = coords.site;\r\n\r\n\t\t\t\tif (site) {\r\n\t\t\t\t\tlabel.setAll({\r\n\t\t\t\t\t\tx: site.x * d,\r\n\t\t\t\t\t\ty: site.y * d,\r\n\t\t\t\t\t\tmaxWidth: Math.abs(maxX - minX)\r\n\t\t\t\t\t})\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\r\n\tprotected _handleSingle(dataItem: DataItem<this[\"_dataItemSettings\"]>) {\r\n\t\tconst parent = dataItem.get(\"parent\");\r\n\t\tif (parent) {\r\n\t\t\tconst children = parent.get(\"children\");\r\n\t\t\tif (children) {\r\n\t\t\t\t$array.each(children, (child) => {\r\n\t\t\t\t\tif (child != dataItem) {\r\n\t\t\t\t\t\tthis.disableDataItem(child);\r\n\t\t\t\t\t\tchild.get(\"node\").hide();\r\n\t\t\t\t\t}\r\n\t\t\t\t})\r\n\t\t\t}\r\n\t\t\tthis._handleSingle(parent);\r\n\t\t}\r\n\t}\r\n\r\n\t/**\r\n\t * @ignore\r\n\t */\r\n\tpublic makeNode(dataItem: DataItem<this[\"_dataItemSettings\"]>): HierarchyNode {\r\n\t\tconst node = super.makeNode(dataItem);\r\n\t\tthis._makeNode(dataItem, node);\r\n\t\treturn node;\r\n\t}\r\n\r\n\tprotected _makeNode(dataItem: DataItem<this[\"_dataItemSettings\"]>, node: HierarchyNode) {\r\n\t\tconst polygon = node.children.moveValue(this.polygons.make(), 0);\r\n\t\tnode.setPrivate(\"tooltipTarget\", polygon);\r\n\t\tdataItem.setRaw(\"polygon\", polygon);\r\n\t\tpolygon._setDataItem(dataItem);\r\n\t}\r\n\r\n\tprotected getCirclePolygon(radius: number) {\r\n\t\tconst points = this.get(\"cornerCount\", 120);\r\n\t\tconst dAngle = Math.PI * 2 / points;\r\n\t\tconst polygon: Array<Array<number>> = [];\r\n\r\n\t\tfor (let i = 0; i < points; i++) {\r\n\t\t\tlet angle = i * dAngle;\r\n\t\t\tpolygon.push([radius * Math.cos(angle), radius * Math.sin(angle)])\r\n\t\t}\r\n\r\n\t\treturn polygon;\r\n\t}\r\n}"]}

package/.internal/charts/stock/toolbar/DateRangeSelector.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"DateRangeSelector.d.ts","sourceRoot":"","sources":["../../../../../../src/.internal/charts/stock/toolbar/DateRangeSelector.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,qBAAqB,EAAE,oBAAoB,EAAE,mBAAmB,EAAE,MAAM,gBAAgB,CAAC;AAChH,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAQtC,MAAM,WAAW,0BAA2B,SAAQ,qBAAqB;IAExE;;;;OAIG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IAEpB;;;;;;;OAOG;IACH,aAAa,CAAC,EAAE,OAAO,CAAC;IAExB;;;;;;;;OAQG;IACH,OAAO,CAAC,EAAE,IAAI,GAAG,MAAM,GAAG,IAAI,CAAC;IAE/B;;;;;;;;OAQG;IACH,OAAO,CAAC,EAAE,IAAI,GAAG,MAAM,GAAG,IAAI,CAAC;CAE/B;AAED,MAAM,WAAW,yBAA0B,SAAQ,oBAAoB;IACtE,QAAQ,EAAE,QAAQ,CAAC;IAEnB,SAAS,EAAE,gBAAgB,CAAC;IAC5B,UAAU,EAAE,GAAG,CAAC;IAChB,QAAQ,CAAC,EAAE,IAAI,CAAC;IAEhB,OAAO,EAAE,gBAAgB,CAAC;IAC1B,QAAQ,EAAE,GAAG,CAAC;IACd,MAAM,CAAC,EAAE,IAAI,CAAC;CACd;AAED,MAAM,WAAW,wBAAyB,SAAQ,mBAAmB;CACpE;AAED;;;;GAIG;AACH,qBAAa,iBAAkB,SAAQ,YAAY;IAClD,OAAc,SAAS,EAAE,MAAM,CAAuB;IACtD,OAAc,UAAU,EAAE,KAAK,CAAC,MAAM,CAAC,CAAiE;IAEzF,SAAS,EAAE,0BAA0B,CAAC;IACtC,gBAAgB,EAAE,yBAAyB,CAAC;IAC5C,OAAO,EAAE,wBAAwB,CAAC;IAEjD,SAAS,CAAC,SAAS;IAyCnB,SAAS,CAAC,aAAa,IAAI,IAAI;IA6I/B,SAAS,CAAC,eAAe,IAAI,UAAU;IAIhC,aAAa;IAIpB,SAAS,CAAC,aAAa,IAAI,IAAI;IAqC/B,SAAS,CAAC,cAAc,IAAI,IAAI;IAkChC,SAAS,CAAC,YAAY,IAAI,IAAI;IAa9B,SAAS,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,GAAG,MAAM;IAIzC,SAAS,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAIxC,SAAS,CAAC,cAAc,IAAI,MAAM;IAKlC,SAAS,CAAC,QAAQ,IAAI,GAAG;IAOzB,SAAS,CAAC,gBAAgB,IAAI,GAAG;IAoEjC;;;;OAIG;IACH,SAAS,CAAC,eAAe,IAAI,IAAI;CA43BjC"}
+{"version":3,"file":"DateRangeSelector.d.ts","sourceRoot":"","sources":["../../../../../../src/.internal/charts/stock/toolbar/DateRangeSelector.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,qBAAqB,EAAE,oBAAoB,EAAE,mBAAmB,EAAE,MAAM,gBAAgB,CAAC;AAChH,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAQtC,MAAM,WAAW,0BAA2B,SAAQ,qBAAqB;IAExE;;;;OAIG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IAEpB;;;;;;;OAOG;IACH,aAAa,CAAC,EAAE,OAAO,CAAC;IAExB;;;;;;;;OAQG;IACH,OAAO,CAAC,EAAE,IAAI,GAAG,MAAM,GAAG,IAAI,CAAC;IAE/B;;;;;;;;OAQG;IACH,OAAO,CAAC,EAAE,IAAI,GAAG,MAAM,GAAG,IAAI,CAAC;CAE/B;AAED,MAAM,WAAW,yBAA0B,SAAQ,oBAAoB;IACtE,QAAQ,EAAE,QAAQ,CAAC;IAEnB,SAAS,EAAE,gBAAgB,CAAC;IAC5B,UAAU,EAAE,GAAG,CAAC;IAChB,QAAQ,CAAC,EAAE,IAAI,CAAC;IAEhB,OAAO,EAAE,gBAAgB,CAAC;IAC1B,QAAQ,EAAE,GAAG,CAAC;IACd,MAAM,CAAC,EAAE,IAAI,CAAC;CACd;AAED,MAAM,WAAW,wBAAyB,SAAQ,mBAAmB;CACpE;AAED;;;;GAIG;AACH,qBAAa,iBAAkB,SAAQ,YAAY;IAClD,OAAc,SAAS,EAAE,MAAM,CAAuB;IACtD,OAAc,UAAU,EAAE,KAAK,CAAC,MAAM,CAAC,CAAiE;IAEzF,SAAS,EAAE,0BAA0B,CAAC;IACtC,gBAAgB,EAAE,yBAAyB,CAAC;IAC5C,OAAO,EAAE,wBAAwB,CAAC;IAEjD,SAAS,CAAC,SAAS;IAyCnB,SAAS,CAAC,aAAa,IAAI,IAAI;IA6I/B,SAAS,CAAC,eAAe,IAAI,UAAU;IAIhC,aAAa;IAIpB,SAAS,CAAC,aAAa,IAAI,IAAI;IAqC/B,SAAS,CAAC,cAAc,IAAI,IAAI;IAyChC,SAAS,CAAC,YAAY,IAAI,IAAI;IAa9B,SAAS,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,GAAG,MAAM;IAIzC,SAAS,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAIxC,SAAS,CAAC,cAAc,IAAI,MAAM;IAKlC,SAAS,CAAC,QAAQ,IAAI,GAAG;IAOzB,SAAS,CAAC,gBAAgB,IAAI,GAAG;IAoEjC;;;;OAIG;IACH,SAAS,CAAC,eAAe,IAAI,IAAI;CA43BjC"}

package/.internal/charts/stock/toolbar/DateRangeSelector.js

@@ -196,31 +196,37 @@ export class DateRangeSelector extends StockControl {
     _updatePickers() {
         const xAxis = this._getAxis();
         const minDate = this.get("minDate");
+        const maxDate = this.get("maxDate");
+        const toPicker = this.getPrivate("toPicker");
         const fromPicker = this.getPrivate("fromPicker");
         if (minDate == "auto") {
             const min = xAxis.getPrivate("minFinal");
             if (min) {
                 fromPicker.set("minDate", new Date(min + 1));
+                toPicker.set("minDate", new Date(min + 1));
             }
         }
         else if (minDate instanceof Date) {
             fromPicker.set("minDate", minDate);
+            toPicker.set("minDate", minDate);
         }
         else {
             fromPicker.set("minDate", undefined);
+            toPicker.set("minDate", undefined);
         }
-        const maxDate = this.get("maxDate");
-        const toPicker = this.getPrivate("toPicker");
         if (maxDate == "auto") {
             const min = xAxis.getPrivate("maxFinal");
             if (min) {
+                fromPicker.set("maxDate", new Date(min));
                 toPicker.set("maxDate", new Date(min));
             }
         }
         else if (maxDate instanceof Date) {
+            fromPicker.set("maxDate", maxDate);
             toPicker.set("maxDate", maxDate);
         }
         else {
+            fromPicker.set("maxDate", undefined);
             toPicker.set("maxDate", undefined);
         }
     }