@milaboratories/miplots4 1.0.176 → 1.0.178

package/dist/_virtual/client2.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"client2.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/_virtual/debug.js

@@ -1,5 +0,0 @@
-var e = { exports: {} };
-export {
-  e as __module
-};
-//# sourceMappingURL=debug.js.map

package/dist/_virtual/debug.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"debug.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/_virtual/index.js

@@ -1,9 +0,0 @@
-import { getDefaultExportFromCjs as r } from "./_commonjsHelpers.js";
-import { __require as t } from "../node_modules/.pnpm/react@19.2.4/node_modules/react/index.js";
-var e = t();
-const s = /* @__PURE__ */ r(e);
-export {
-  s as default,
-  e as r
-};
-//# sourceMappingURL=index.js.map

package/dist/_virtual/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;"}

package/dist/_virtual/index10.js

@@ -1,8 +0,0 @@
-import { getDefaultExportFromCjs as r } from "./_commonjsHelpers.js";
-import { __require as o } from "../node_modules/.pnpm/@stdlib_stats-wilcoxon@0.2.2/node_modules/@stdlib/stats-wilcoxon/lib/index.js";
-var t = o();
-const a = /* @__PURE__ */ r(t);
-export {
-  a as default
-};
-//# sourceMappingURL=index10.js.map

package/dist/_virtual/index10.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index10.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;"}

package/dist/_virtual/index2.js

@@ -1,6 +0,0 @@
-import { __require as r } from "../node_modules/.pnpm/react-dom@19.2.4_react@19.2.4/node_modules/react-dom/index.js";
-var o = r();
-export {
-  o as r
-};
-//# sourceMappingURL=index2.js.map

package/dist/_virtual/index2.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index2.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;"}

package/dist/_virtual/index3.js

@@ -1,5 +0,0 @@
-var e = { exports: {} };
-export {
-  e as __module
-};
-//# sourceMappingURL=index3.js.map

package/dist/_virtual/index3.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index3.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/_virtual/index4.js

@@ -1,5 +0,0 @@
-var e = { exports: {} };
-export {
-  e as __module
-};
-//# sourceMappingURL=index4.js.map

package/dist/_virtual/index4.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index4.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/_virtual/index5.js

@@ -1,5 +0,0 @@
-var e = { exports: {} };
-export {
-  e as __module
-};
-//# sourceMappingURL=index5.js.map

package/dist/_virtual/index5.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index5.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/_virtual/index6.js

@@ -1,8 +0,0 @@
-import { getDefaultExportFromCjs as r } from "./_commonjsHelpers.js";
-import { __require as o } from "../node_modules/.pnpm/@stdlib_stats-anova1@0.2.2/node_modules/@stdlib/stats-anova1/lib/index.js";
-var t = o();
-const i = /* @__PURE__ */ r(t);
-export {
-  i as default
-};
-//# sourceMappingURL=index6.js.map

package/dist/_virtual/index6.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index6.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;"}

package/dist/_virtual/index7.js

@@ -1,8 +0,0 @@
-import { getDefaultExportFromCjs as r } from "./_commonjsHelpers.js";
-import { __require as t } from "../node_modules/.pnpm/@stdlib_stats-ttest@0.2.2/node_modules/@stdlib/stats-ttest/lib/index.js";
-var e = t();
-const s = /* @__PURE__ */ r(e);
-export {
-  s as default
-};
-//# sourceMappingURL=index7.js.map

package/dist/_virtual/index7.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index7.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;"}

package/dist/_virtual/index8.js

@@ -1,8 +0,0 @@
-import { getDefaultExportFromCjs as r } from "./_commonjsHelpers.js";
-import { __require as t } from "../node_modules/.pnpm/@stdlib_stats-ttest2@0.2.2/node_modules/@stdlib/stats-ttest2/lib/index.js";
-var e = t();
-const s = /* @__PURE__ */ r(e);
-export {
-  s as default
-};
-//# sourceMappingURL=index8.js.map

package/dist/_virtual/index8.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index8.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;"}

package/dist/_virtual/index9.js

@@ -1,8 +0,0 @@
-import { getDefaultExportFromCjs as r } from "./_commonjsHelpers.js";
-import { __require as o } from "../node_modules/.pnpm/@stdlib_stats-kruskal-test@0.2.2/node_modules/@stdlib/stats-kruskal-test/lib/index.js";
-var t = o();
-const i = /* @__PURE__ */ r(t);
-export {
-  i as default
-};
-//# sourceMappingURL=index9.js.map

package/dist/_virtual/index9.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index9.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;"}

package/dist/_virtual/jsx-runtime.js

@@ -1,6 +0,0 @@
-import { __require as r } from "../node_modules/.pnpm/react@19.2.4/node_modules/react/jsx-runtime.js";
-var i = r();
-export {
-  i as j
-};
-//# sourceMappingURL=jsx-runtime.js.map

package/dist/_virtual/jsx-runtime.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"jsx-runtime.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;"}

package/dist/_virtual/jsx-runtime2.js

@@ -1,5 +0,0 @@
-var e = { exports: {} };
-export {
-  e as __module
-};
-//# sourceMappingURL=jsx-runtime2.js.map

package/dist/_virtual/jsx-runtime2.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"jsx-runtime2.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/_virtual/lodash.js

@@ -1,9 +0,0 @@
-import { getDefaultExportFromCjs as r } from "./_commonjsHelpers.js";
-import { __require as o } from "../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/lodash.js";
-var a = o();
-const e = /* @__PURE__ */ r(a);
-export {
-  e as default,
-  a as l
-};
-//# sourceMappingURL=lodash.js.map

package/dist/_virtual/lodash.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"lodash.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;"}

package/dist/_virtual/lodash2.js

@@ -1,5 +0,0 @@
-var o = { exports: {} };
-export {
-  o as __module
-};
-//# sourceMappingURL=lodash2.js.map

package/dist/_virtual/lodash2.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"lodash2.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/_virtual/react-dom-client.development.js

@@ -1,5 +0,0 @@
-var e = {};
-export {
-  e as __exports
-};
-//# sourceMappingURL=react-dom-client.development.js.map

package/dist/_virtual/react-dom-client.development.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"react-dom-client.development.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/_virtual/react-dom-client.production.js

@@ -1,5 +0,0 @@
-var o = {};
-export {
-  o as __exports
-};
-//# sourceMappingURL=react-dom-client.production.js.map

package/dist/_virtual/react-dom-client.production.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"react-dom-client.production.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/_virtual/react-dom-server-legacy.browser.development.js

@@ -1,5 +0,0 @@
-var e = {};
-export {
-  e as __exports
-};
-//# sourceMappingURL=react-dom-server-legacy.browser.development.js.map

package/dist/_virtual/react-dom-server-legacy.browser.development.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"react-dom-server-legacy.browser.development.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/_virtual/react-dom-server-legacy.browser.production.js

@@ -1,5 +0,0 @@
-var r = {};
-export {
-  r as __exports
-};
-//# sourceMappingURL=react-dom-server-legacy.browser.production.js.map

package/dist/_virtual/react-dom-server-legacy.browser.production.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"react-dom-server-legacy.browser.production.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/_virtual/react-dom-server.browser.development.js

@@ -1,5 +0,0 @@
-var e = {};
-export {
-  e as __exports
-};
-//# sourceMappingURL=react-dom-server.browser.development.js.map

package/dist/_virtual/react-dom-server.browser.development.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"react-dom-server.browser.development.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/_virtual/react-dom-server.browser.production.js

@@ -1,5 +0,0 @@
-var r = {};
-export {
-  r as __exports
-};
-//# sourceMappingURL=react-dom-server.browser.production.js.map

package/dist/_virtual/react-dom-server.browser.production.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"react-dom-server.browser.production.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/_virtual/react-dom.development.js

@@ -1,5 +0,0 @@
-var e = {};
-export {
-  e as __exports
-};
-//# sourceMappingURL=react-dom.development.js.map

package/dist/_virtual/react-dom.development.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"react-dom.development.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/_virtual/react-dom.production.js

@@ -1,5 +0,0 @@
-var o = {};
-export {
-  o as __exports
-};
-//# sourceMappingURL=react-dom.production.js.map

package/dist/_virtual/react-dom.production.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"react-dom.production.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/_virtual/react-jsx-runtime.development.js

@@ -1,5 +0,0 @@
-var e = {};
-export {
-  e as __exports
-};
-//# sourceMappingURL=react-jsx-runtime.development.js.map

package/dist/_virtual/react-jsx-runtime.development.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"react-jsx-runtime.development.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/_virtual/react-jsx-runtime.production.js

@@ -1,5 +0,0 @@
-var r = {};
-export {
-  r as __exports
-};
-//# sourceMappingURL=react-jsx-runtime.production.js.map

package/dist/_virtual/react-jsx-runtime.production.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"react-jsx-runtime.production.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/_virtual/react.development.js

@@ -1,5 +0,0 @@
-var e = { exports: {} };
-export {
-  e as __module
-};
-//# sourceMappingURL=react.development.js.map

package/dist/_virtual/react.development.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"react.development.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/_virtual/react.production.js

@@ -1,5 +0,0 @@
-var r = {};
-export {
-  r as __exports
-};
-//# sourceMappingURL=react.production.js.map

package/dist/_virtual/react.production.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"react.production.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/_virtual/scheduler.development.js

@@ -1,5 +0,0 @@
-var e = {};
-export {
-  e as __exports
-};
-//# sourceMappingURL=scheduler.development.js.map

package/dist/_virtual/scheduler.development.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"scheduler.development.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/_virtual/scheduler.production.js

@@ -1,5 +0,0 @@
-var r = {};
-export {
-  r as __exports
-};
-//# sourceMappingURL=scheduler.production.js.map

package/dist/_virtual/scheduler.production.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"scheduler.production.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/_virtual/server.browser.js

@@ -1,6 +0,0 @@
-import { __require as r } from "../node_modules/.pnpm/react-dom@19.2.4_react@19.2.4/node_modules/react-dom/server.browser.js";
-var s = r();
-export {
-  s
-};
-//# sourceMappingURL=server.browser.js.map

package/dist/_virtual/server.browser.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"server.browser.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;"}

package/dist/_virtual/server.browser2.js

@@ -1,5 +0,0 @@
-var r = {};
-export {
-  r as __exports
-};
-//# sourceMappingURL=server.browser2.js.map

package/dist/_virtual/server.browser2.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"server.browser2.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/assets/getClusters-BScJvejf.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"getClusters-BScJvejf.js","sources":["../../../node_modules/.pnpm/d3-random@3.0.1/node_modules/d3-random/src/lcg.js","../../../node_modules/.pnpm/comlink@4.4.2/node_modules/comlink/src/comlink.ts","../src/heatmap/getClusters.ts"],"sourcesContent":["// https://en.wikipedia.org/wiki/Linear_congruential_generator#Parameters_in_common_use\nconst mul = 0x19660D;\nconst inc = 0x3C6EF35F;\nconst eps = 1 / 0x100000000;\n\nexport default function lcg(seed = Math.random()) {\n  let state = (0 <= seed && seed < 1 ? seed / eps : Math.abs(seed)) | 0;\n  return () => (state = mul * state + inc | 0, eps * (state >>> 0));\n}\n",null,"import type { Cluster } from './components/types';\nimport type { DendrogramDistance, DendrogramLinkage } from '../types';\nimport { randomLcg } from 'd3-random';\nimport { expose } from 'comlink';\n\n/* DISTANCE FUNCTIONS - Calculate similarity between two data points */\n\n/**\n * Calculate squared Euclidean distance between two vectors\n * This is faster than regular Euclidean distance since it avoids the square root\n * Formula: Σ(p[i] - q[i])²\n * @param p First vector\n * @param q Second vector\n * @returns Squared distance (always positive)\n */\nexport function squaredEuclidean(p: number[], q: number[]) {\n    let d = 0;\n    // Sum the squared differences for each dimension\n    for (let i = 0; i < p.length; i++) {\n        d += (p[i] - q[i]) * (p[i] - q[i]);\n    }\n    return d;\n}\n\n/**\n * Calculate Euclidean distance between two vectors\n * This is the standard geometric distance in n-dimensional space\n * Formula: √(Σ(p[i] - q[i])²)\n * @param p First vector\n * @param q Second vector\n * @returns Euclidean distance\n */\nexport function euclidean(p: number[], q: number[]) {\n    return Math.sqrt(squaredEuclidean(p, q));\n}\n\n/* LINKAGE FUNCTIONS - Define how to measure distance between two clusters */\n\n/**\n * Average Linkage\n * Calculates the average distance between all pairs of points in the two clusters\n * This is the most commonly used linkage method as it balances between single and complete linkage\n * @param setA Indexes of points in first cluster\n * @param setB Indexes of points in second cluster  \n * @param getDistance Function to get distance between two point indexes\n * @returns Average distance between clusters\n */\nexport const averageLinkage = (setA: number[], setB: number[], getDistance: (i: number, j: number) => number) => {\n    let distance = 0;\n    // Sum all pairwise distances between clusters\n    for (const a of setA) {\n        for (const b of setB) distance += getDistance(a, b);\n    }\n\n    // Return average distance\n    return distance / setA.length / setB.length;\n};\n\n/**\n * Complete Linkage (Maximum Linkage)\n * Uses the maximum distance between any pair of points in the two clusters\n * Tends to create compact, well-separated clusters\n * Formula: max{d(a,b)} for all a in A, b in B\n * @param setA Indexes of points in first cluster\n * @param setB Indexes of points in second cluster\n * @param getDistance Function to get distance between two point indexes\n * @returns Maximum distance between clusters\n */\nexport const completeLinkage = (setA: number[], setB: number[], getDistance: (i: number, j: number) => number) => {\n    let distance = 0;\n    // Find maximum distance between any pair of points\n    for (const a of setA) {\n        for (const b of setB) distance = Math.max(distance, getDistance(a, b));\n    }\n\n    return distance;\n};\n\n/**\n * Single Linkage (Minimum Linkage)\n * Uses the minimum distance between any pair of points in the two clusters\n * Tends to create elongated, chain-like clusters\n * Formula: min{d(a,b)} for all a in A, b in B\n * @param setA Indexes of points in first cluster\n * @param setB Indexes of points in second cluster\n * @param getDistance Function to get distance between two point indexes\n * @returns Minimum distance between clusters\n */\nexport const singleLinkage = (setA: number[], setB: number[], getDistance: (i: number, j: number) => number) => {\n    let distance = Infinity;\n    // Find minimum distance between any pair of points\n    for (const a of setA) {\n        for (const b of setB) distance = Math.min(distance, getDistance(a, b));\n    }\n\n    return distance;\n};\n\n/* HELPER FUNCTIONS - Factory functions for distance and linkage methods */\n\n/**\n * Get the appropriate linkage function based on the linkage type\n * @param linkage Type of linkage method to use\n * @returns Function that calculates distance between two clusters\n */\nfunction getLinkageFn(linkage: DendrogramLinkage) {\n    switch (linkage) {\n        case 'average': return averageLinkage;\n        case 'complete': return completeLinkage;\n        case 'single': return singleLinkage;\n        default: return averageLinkage; // Default to average linkage\n    }\n}\n\n/**\n * Get the appropriate distance function based on the distance type\n * @param distance Type of distance metric to use\n * @returns Function that calculates distance between two points\n */\nfunction getDistanceFn(distance: DendrogramDistance) {\n    switch (distance) {\n        case 'euclidean': return euclidean;\n        case 'squaredEuclidean': return squaredEuclidean;\n        default: return euclidean; // Default to euclidean distance\n    }\n}\n\n/* UTILITY FUNCTIONS - Helper functions for cluster manipulation and sorting */\n\n/**\n * Extract indexes from a cluster hierarchy in the correct hierarchical order\n * This function traverses the cluster tree and collects all indexes in the order\n * they appear in the dendrogram (left-to-right traversal)\n * @param cluster The root cluster to extract indexes from\n * @returns Array of indexes in hierarchical order\n */\nexport function extractOrderedIndexes(cluster: Cluster): number[] {\n    const orderedIndexes: number[] = [];\n    \n    const traverse = (c: Cluster) => {\n        if (c.children.length === 0) {\n            // Leaf node - add all indexes from this cluster\n            orderedIndexes.push(...c.indexes);\n        } else {\n            // Internal node - traverse children in order (left to right)\n            for (const child of c.children) {\n                traverse(child);\n            }\n        }\n    };\n    \n    traverse(cluster);\n    return orderedIndexes;\n}\n\nconst MAX_CLUSTER_SIZE = 2000;\n\n// Approximate clustering using sampling for very large datasets\nexport function getClustersApproximate(\n    dataValues: number[][], \n    distanceType: DendrogramDistance = 'euclidean', \n    linkageType: DendrogramLinkage = 'average',\n): Cluster {    \n    if (dataValues.length <= MAX_CLUSTER_SIZE) {\n        return getClusters(dataValues, distanceType, linkageType);\n    }\n    \n    const N = dataValues.length;\n    const getRandom = randomLcg(1);\n    // Step 1: Random sampling\n    const sampleIndices = new Set<number>();\n    while (sampleIndices.size < MAX_CLUSTER_SIZE) {\n        sampleIndices.add(Math.floor(getRandom() * N));\n    }\n    \n    const sampleIndicesArray = Array.from(sampleIndices);\n    const sampleValues = sampleIndicesArray.map(i => dataValues[i]);\n    \n    // Step 2: Cluster the sample\n    const sampleCluster = getClusters(sampleValues, distanceType, linkageType);\n    \n    // Step 3: Assign remaining points to nearest cluster\n    return assignRemainingPoints(sampleCluster, dataValues, sampleIndicesArray, distanceType);\n}\n\n// Assign remaining points to the nearest cluster from the sample\nfunction assignRemainingPoints(\n    sampleCluster: Cluster, \n    dataValues: number[][], \n    sampleIndices: number[],\n    distanceType: DendrogramDistance\n): Cluster {\n    // console.log('assignRemainingPoints');\n\n    const distanceFn = getDistanceFn(distanceType);\n    const sampleSet = new Set(sampleIndices);\n    \n    // Assign each non-sample point to nearest sample point\n    const assignments = new Map<number, number>(); // point -> sample point\n    for (let i = 0; i < dataValues.length; i++) {\n        if (sampleSet.has(i)) continue;\n        \n        let minDistance = Infinity;\n        let nearestSample = -1;\n        \n        for (const sampleIdx of sampleIndices) {\n            const distance = distanceFn(dataValues[i], dataValues[sampleIdx]);\n            if (distance < minDistance) {\n                minDistance = distance;\n                nearestSample = sampleIdx;\n            }\n        }\n        \n        assignments.set(i, nearestSample);\n    }\n    // Reconstruct cluster with all points\n    return reconstructWithAssignments(sampleCluster, assignments, sampleIndices);\n}\n\n// Reconstruct cluster hierarchy with assigned points\nfunction reconstructWithAssignments(\n    sampleCluster: Cluster, \n    assignments: Map<number, number>, \n    sampleIndices: number[]\n): Cluster {\n    // Create a map of sample indices to their clusters\n    const sampleToCluster = new Map<number, Cluster>();\n    const findSampleClusters = (cluster: Cluster) => {\n        if (cluster.indexes.length === 1) {\n            sampleToCluster.set(sampleIndices[cluster.indexes[0]], cluster);\n        }\n        for (const child of cluster.children) {\n            findSampleClusters(child);\n        }\n    };\n    findSampleClusters(sampleCluster);\n    \n    // Group assigned points by their sample cluster\n    const assignedPointsByCluster = new Map<Cluster, number[]>();\n    for (const [pointIdx, sampleIdx] of assignments) {\n        const sampleCluster = sampleToCluster.get(sampleIdx);\n        if (sampleCluster) {\n            if (!assignedPointsByCluster.has(sampleCluster)) {\n                assignedPointsByCluster.set(sampleCluster, []);\n            }\n            const cluster = assignedPointsByCluster.get(sampleCluster);\n            if (cluster) {\n                cluster.push(pointIdx);\n            }\n        }\n    }\n\n    const fillCorrectIndexes = (c: Cluster) => {\n        c.indexes = c.indexes.map(i => sampleIndices[i]);\n        for (const child of c.children) {\n            fillCorrectIndexes(child);\n        }\n    };\n    fillCorrectIndexes(sampleCluster);\n    for (const [cluster, assignedPoints] of assignedPointsByCluster) {\n        cluster.indexes = [...cluster.indexes, ...assignedPoints];\n    }\n    \n    return {\n        ...sampleCluster,\n        indexes: extractOrderedIndexes(sampleCluster)\n    };\n}\n\n/* MAIN HIERARCHICAL CLUSTERING FUNCTION - Standard agglomerative clustering */\n\n/**\n * Main hierarchical clustering function using agglomerative approach\n * \n * This implements the standard agglomerative hierarchical clustering algorithm:\n * 1. Start with each point as its own cluster\n * 2. Compute pairwise distances between all points\n * 3. Iteratively merge the two closest clusters\n * 4. Continue until only one cluster remains\n * \n * Algorithm complexity:\n * - Time: O(n³) - for each of n-1 iterations, scan all n² cluster pairs\n * - Space: O(n²) - store upper triangular distance matrix\n * \n * Memory optimization:\n * - Uses upper triangular matrix storage (50% memory reduction)\n * - Only stores distances where i < j since distance matrix is symmetric\n * \n * @param dataKeys Labels for each data point\n * @param dataValues Feature vectors for each data point (n×d matrix)\n * @param distanceType Distance metric to use between points\n * @param linkageType Linkage method to use between clusters\n * @returns Root cluster containing the complete hierarchy\n */\nexport function getClusters(dataValues: number[][], distanceType: DendrogramDistance = 'euclidean', linkageType: DendrogramLinkage = 'average'): Cluster {\n    const distanceFn = getDistanceFn(distanceType);\n    const linkageFn = getLinkageFn(linkageType);\n    \n    const N = dataValues.length;\n    \n    // STEP 1: Precompute pairwise distances using upper triangular matrix\n    // This reduces memory usage from O(n²) to O(n²/2) by only storing upper triangle\n    // Since distance matrix is symmetric: d(i,j) = d(j,i)\n    const distances: number[] = [];\n    \n    // Helper function to access distances in upper triangular matrix\n    // Maps 2D coordinates (i,j) to 1D array index\n    const getDistance = (i: number, j: number): number => {\n        if (i === j) return 0; // Distance to self is always 0\n        if (i > j) [i, j] = [j, i]; // Swap to ensure i < j (upper triangular)\n        const index = i * N - (i * (i + 1)) / 2 + (j - i - 1);\n        return distances[index];\n    };\n    \n    // Helper function to set distances in upper triangular matrix\n    const setDistance = (i: number, j: number, value: number): void => {\n        if (i > j) [i, j] = [j, i]; // Swap to ensure i < j (upper triangular)\n        const index = i * N - (i * (i + 1)) / 2 + (j - i - 1);\n        distances[index] = value;\n    };\n    \n    // Calculate all pairwise distances (only upper triangular)\n    // This is the most expensive step: O(n²) distance calculations\n    for (let i1 = 0; i1 < N; i1++) {\n        for (let i2 = i1 + 1; i2 < N; i2++) {\n            const v = distanceFn(dataValues[i1], dataValues[i2]);\n            setDistance(i1, i2, v);\n        }   \n    }\n\n    // STEP 2: Initialize clusters - each point starts as its own cluster\n    // This creates the leaf nodes of the dendrogram\n    const clusters: Cluster[] = dataValues.map((_, index) => ({\n        height: 0, // Height 0 for leaf nodes\n        indexes: [index], // Single index per cluster initially\n        children: [] // No children for leaf nodes\n    }));\n\n    // STEP 3: Agglomerative clustering - merge clusters iteratively\n    // This is the main clustering loop that builds the hierarchy\n    for (let iteration = 0; iteration < N; iteration++) {\n        // Stop when only one cluster remains (root of dendrogram)\n        if (iteration >= N - 1) break;\n\n        // Find the two closest clusters using the selected linkage method\n        let nearestDistance = Infinity;\n        let nearest1 = 0;\n        let nearest2 = 0;\n\n        // Check all pairs of clusters (upper triangular to avoid duplicates)\n        for (let clusterIdx1 = 0; clusterIdx1 < clusters.length; clusterIdx1++) {\n            for (let clusterIdx2 = clusterIdx1 + 1; clusterIdx2 < clusters.length; clusterIdx2++) {\n                // Calculate distance between clusters using linkage method\n                const distance = linkageFn(clusters[clusterIdx1].indexes, clusters[clusterIdx2].indexes, getDistance);\n                \n                // Keep track of the closest pair\n                if (distance < nearestDistance) {\n                    nearestDistance = distance;\n                    nearest1 = clusterIdx1;\n                    nearest2 = clusterIdx2;\n                }\n            }\n        }\n\n        // STEP 4: Merge the two closest clusters\n        // Create a new cluster that combines the two closest clusters\n        const newCluster = {\n            indexes: [...clusters[nearest1].indexes, ...clusters[nearest2].indexes], // Combine all indexes\n            height: nearestDistance, // Height is the distance at which clusters were merged\n            children: [clusters[nearest1], clusters[nearest2]], // Store the two merged clusters as children\n        };\n\n        // STEP 5: Update cluster list\n        // Remove the two merged clusters and add the new merged cluster\n        // Remove higher index first to avoid index shifting issues\n        clusters.splice(Math.max(nearest1, nearest2), 1);\n        clusters.splice(Math.min(nearest1, nearest2), 1);\n        clusters.push(newCluster);\n    }\n\n    // STEP 6: Return the root cluster with properly ordered keys and indexes\n    // The root cluster contains the complete hierarchy\n    const rootCluster = clusters[0];\n    return {\n        ...rootCluster,\n        indexes: extractOrderedIndexes(rootCluster) // Ensure indexes are in hierarchical order\n    };\n}\n\nexpose({getClustersApproximate});"],"names":["eps","lcg","seed","state","proxyMarker","createEndpoint","releaseProxy","finalizer","throwMarker","isObject","val","proxyTransferHandler","obj","port1","port2","expose","port","wrap","throwTransferHandler","value","serialized","transferHandlers","isAllowedOrigin","allowedOrigins","origin","allowedOrigin","ep","callback","ev","id","type","path","argumentList","fromWireValue","returnValue","parent","prop","rawValue","proxy","transfer","wireValue","transferables","toWireValue","closeEndPoint","error","isMessagePort","endpoint","target","pendingListeners","data","resolver","createProxy","throwIfProxyReleased","isReleased","releaseEndpoint","requestResponseMessage","proxyCounter","proxyFinalizers","newCount","registerProxy","unregisterProxy","isProxyReleased","_target","r","p","_thisArg","rawArgumentList","last","processArguments","myFlat","arr","processed","v","transferCache","transfers","name","handler","serializedValue","msg","resolve","generateUUID","squaredEuclidean","q","d","euclidean","averageLinkage","setA","setB","getDistance","distance","b","completeLinkage","singleLinkage","getLinkageFn","linkage","getDistanceFn","extractOrderedIndexes","cluster","orderedIndexes","traverse","c","child","MAX_CLUSTER_SIZE","getClustersApproximate","dataValues","distanceType","linkageType","getClusters","N","getRandom","randomLcg","sampleIndices","sampleIndicesArray","sampleValues","i","sampleCluster","assignRemainingPoints","distanceFn","sampleSet","assignments","minDistance","nearestSample","sampleIdx","reconstructWithAssignments","sampleToCluster","findSampleClusters","assignedPointsByCluster","pointIdx","fillCorrectIndexes","assignedPoints","linkageFn","distances","j","index","setDistance","i1","i2","clusters","_","iteration","nearestDistance","nearest1","nearest2","clusterIdx1","clusterIdx2","newCluster","rootCluster"],"mappings":"yBAGA,MAAMA,EAAM,sBAEG,SAASC,EAAIC,EAAO,KAAK,SAAU,CAChD,IAAIC,GAAS,GAAKD,GAAQA,EAAO,EAAIA,EAAOF,EAAM,KAAK,IAAIE,CAAI,GAAK,EACpE,MAAO,KAAOC,EAAQ,QAAMA,EAAQ,WAAM,EAAGH,GAAOG,IAAU,GAChE,CCRA;AAAA;AAAA;AAAA;AAAA,GAiBa,MAAAC,EAAc,OAAO,eAAe,EACpCC,EAAiB,OAAO,kBAAkB,EAC1CC,EAAe,OAAO,sBAAsB,EAC5CC,EAAY,OAAO,mBAAmB,EAE7CC,EAAc,OAAO,gBAAgB,EAuJrCC,EAAYC,GACf,OAAOA,GAAQ,UAAYA,IAAQ,MAAS,OAAOA,GAAQ,WAkCxDC,EAA6D,CACjE,UAAYD,GACVD,EAASC,CAAG,GAAMA,EAAoBN,CAAW,EACnD,UAAUQ,EAAG,CACX,KAAM,CAAE,MAAAC,EAAO,MAAAC,CAAK,EAAK,IAAI,eAC7B,OAAAC,EAAOH,EAAKC,CAAK,EACV,CAACC,EAAO,CAACA,CAAK,CAAC,CACvB,EACD,YAAYE,EAAI,CACd,OAAAA,EAAK,MAAK,EACHC,EAAKD,CAAI,CACjB,GAkBGE,EAGF,CACF,UAAYC,GACVV,EAASU,CAAK,GAAKX,KAAeW,EACpC,UAAU,CAAE,MAAAA,GAAO,CACjB,IAAIC,EACJ,OAAID,aAAiB,MACnBC,EAAa,CACX,QAAS,GACT,MAAO,CACL,QAASD,EAAM,QACf,KAAMA,EAAM,KACZ,MAAOA,EAAM,KACd,GAGHC,EAAa,CAAE,QAAS,GAAO,MAAAD,CAAK,EAE/B,CAACC,EAAY,EAAE,CACvB,EACD,YAAYA,EAAU,CACpB,MAAIA,EAAW,QACP,OAAO,OACX,IAAI,MAAMA,EAAW,MAAM,OAAO,EAClCA,EAAW,KAAK,EAGdA,EAAW,KAClB,GAMUC,EAAmB,IAAI,IAGlC,CACA,CAAC,QAASV,CAAoB,EAC9B,CAAC,QAASO,CAAoB,CAC/B,CAAA,EAED,SAASI,EACPC,EACAC,EAAc,CAEd,UAAWC,KAAiBF,EAI1B,GAHIC,IAAWC,GAAiBA,IAAkB,KAG9CA,aAAyB,QAAUA,EAAc,KAAKD,CAAM,EAC9D,MAAO,GAGX,MAAO,EACT,CAEM,SAAUT,EACdH,EACAc,EAAe,WACfH,EAAsC,CAAC,GAAG,EAAC,CAE3CG,EAAG,iBAAiB,UAAW,SAASC,EAASC,EAAgB,CAC/D,GAAI,CAACA,GAAM,CAACA,EAAG,KACb,OAEF,GAAI,CAACN,EAAgBC,EAAgBK,EAAG,MAAM,EAAG,CAC/C,QAAQ,KAAK,mBAAmBA,EAAG,MAAM,qBAAqB,EAC9D,MACD,CACD,KAAM,CAAE,GAAAC,EAAI,KAAAC,EAAM,KAAAC,CAAI,EAAE,OAAA,OAAA,CACtB,KAAM,CAAA,GACFH,EAAG,IAAgB,EAEnBI,GAAgBJ,EAAG,KAAK,cAAgB,CAAA,GAAI,IAAIK,CAAa,EACnE,IAAIC,EACJ,GAAI,CACF,MAAMC,EAASJ,EAAK,MAAM,EAAG,EAAE,EAAE,OAAO,CAACnB,EAAKwB,IAASxB,EAAIwB,CAAI,EAAGxB,CAAG,EAC/DyB,EAAWN,EAAK,OAAO,CAACnB,EAAKwB,IAASxB,EAAIwB,CAAI,EAAGxB,CAAG,EAC1D,OAAQkB,EAAI,CACV,IAAA,MAEII,EAAcG,EAEhB,MACF,IAAA,MAEIF,EAAOJ,EAAK,MAAM,EAAE,EAAE,CAAC,CAAC,EAAIE,EAAcL,EAAG,KAAK,KAAK,EACvDM,EAAc,GAEhB,MACF,IAAA,QAEIA,EAAcG,EAAS,MAAMF,EAAQH,CAAY,EAEnD,MACF,IAAA,YACE,CACE,MAAMb,EAAQ,IAAIkB,EAAS,GAAGL,CAAY,EAC1CE,EAAcI,GAAMnB,CAAK,CAC1B,CACD,MACF,IAAA,WACE,CACE,KAAM,CAAE,MAAAN,EAAO,MAAAC,CAAK,EAAK,IAAI,eAC7BC,EAAOH,EAAKE,CAAK,EACjBoB,EAAcK,GAAS1B,EAAO,CAACA,CAAK,CAAC,CACtC,CACD,MACF,IAAA,UAEIqB,EAAc,OAEhB,MACF,QACE,MACH,CACF,OAAQf,EAAO,CACde,EAAc,CAAE,MAAAf,EAAO,CAACX,CAAW,EAAG,CAAC,CACxC,CACD,QAAQ,QAAQ0B,CAAW,EACxB,MAAOf,IACC,CAAE,MAAAA,EAAO,CAACX,CAAW,EAAG,CAAC,EACjC,EACA,KAAM0B,GAAe,CACpB,KAAM,CAACM,EAAWC,CAAa,EAAIC,EAAYR,CAAW,EAC1DR,EAAG,YAAiB,OAAA,OAAA,OAAA,OAAA,CAAA,EAAAc,CAAS,EAAA,CAAE,GAAAX,CAAE,CAAA,EAAIY,CAAa,EAC9CX,IAAI,YAENJ,EAAG,oBAAoB,UAAWC,CAAe,EACjDgB,EAAcjB,CAAE,EACZnB,KAAaK,GAAO,OAAOA,EAAIL,CAAS,GAAM,YAChDK,EAAIL,CAAS,EAAC,EAGpB,CAAC,EACA,MAAOqC,GAAS,CAEf,KAAM,CAACJ,EAAWC,CAAa,EAAIC,EAAY,CAC7C,MAAO,IAAI,UAAU,6BAA6B,EAClD,CAAClC,CAAW,EAAG,CAChB,CAAA,EACDkB,EAAG,YAAiB,OAAA,OAAA,OAAA,OAAA,CAAA,EAAAc,CAAS,EAAA,CAAE,GAAAX,CAAE,CAAA,EAAIY,CAAa,CACpD,CAAC,CACL,CAAQ,EACJf,EAAG,OACLA,EAAG,MAAK,CAEZ,CAEA,SAASmB,EAAcC,EAAkB,CACvC,OAAOA,EAAS,YAAY,OAAS,aACvC,CAEA,SAASH,EAAcG,EAAkB,CACnCD,EAAcC,CAAQ,GAAGA,EAAS,MAAK,CAC7C,CAEgB,SAAA7B,EAAQS,EAAcqB,EAAY,CAChD,MAAMC,EAAyC,IAAI,IAEnD,OAAAtB,EAAG,iBAAiB,UAAW,SAAuBE,EAAS,CAC7D,KAAM,CAAE,KAAAqB,CAAI,EAAKrB,EACjB,GAAI,CAACqB,GAAQ,CAACA,EAAK,GACjB,OAEF,MAAMC,EAAWF,EAAiB,IAAIC,EAAK,EAAE,EAC7C,GAAKC,EAIL,GAAI,CACFA,EAASD,CAAI,CACd,QAAS,CACRD,EAAiB,OAAOC,EAAK,EAAE,CAChC,CACH,CAAC,EAEME,EAAezB,EAAIsB,EAAkB,CAAA,EAAID,CAAM,CACxD,CAEA,SAASK,EAAqBC,EAAmB,CAC/C,GAAIA,EACF,MAAM,IAAI,MAAM,4CAA4C,CAEhE,CAEA,SAASC,EAAgB5B,EAAY,CACnC,OAAO6B,EAAuB7B,EAAI,IAAI,IAAO,CAC3C,KAAyB,SAC1B,CAAA,EAAE,KAAK,IAAK,CACXiB,EAAcjB,CAAE,CAClB,CAAC,CACH,CAaA,MAAM8B,EAAe,IAAI,QACnBC,EACJ,yBAA0B,YAC1B,IAAI,qBAAsB/B,GAAgB,CACxC,MAAMgC,GAAYF,EAAa,IAAI9B,CAAE,GAAK,GAAK,EAC/C8B,EAAa,IAAI9B,EAAIgC,CAAQ,EACzBA,IAAa,GACfJ,EAAgB5B,CAAE,CAEtB,CAAC,EAEH,SAASiC,EAAcrB,EAAeZ,EAAY,CAChD,MAAMgC,GAAYF,EAAa,IAAI9B,CAAE,GAAK,GAAK,EAC/C8B,EAAa,IAAI9B,EAAIgC,CAAQ,EACzBD,GACFA,EAAgB,SAASnB,EAAOZ,EAAIY,CAAK,CAE7C,CAEA,SAASsB,EAAgBtB,EAAa,CAChCmB,GACFA,EAAgB,WAAWnB,CAAK,CAEpC,CAEA,SAASa,EACPzB,EACAsB,EACAjB,EAAqC,CAAA,EACrCgB,EAAiB,UAAA,GAAc,CAE/B,IAAIc,EAAkB,GACtB,MAAMvB,EAAQ,IAAI,MAAMS,EAAQ,CAC9B,IAAIe,EAAS1B,EAAI,CAEf,GADAgB,EAAqBS,CAAe,EAChCzB,IAAS9B,EACX,MAAO,IAAK,CACVsD,EAAgBtB,CAAK,EACrBgB,EAAgB5B,CAAE,EAClBsB,EAAiB,MAAK,EACtBa,EAAkB,EACpB,EAEF,GAAIzB,IAAS,OAAQ,CACnB,GAAIL,EAAK,SAAW,EAClB,MAAO,CAAE,KAAM,IAAMO,CAAK,EAE5B,MAAMyB,EAAIR,EAAuB7B,EAAIsB,EAAkB,CACrD,KAAqB,MACrB,KAAMjB,EAAK,IAAKiC,GAAMA,EAAE,UAAU,CACnC,CAAA,EAAE,KAAK/B,CAAa,EACrB,OAAO8B,EAAE,KAAK,KAAKA,CAAC,CACrB,CACD,OAAOZ,EAAYzB,EAAIsB,EAAkB,CAAC,GAAGjB,EAAMK,CAAI,CAAC,CACzD,EACD,IAAI0B,EAAS1B,EAAMC,EAAQ,CACzBe,EAAqBS,CAAe,EAGpC,KAAM,CAAC1C,EAAOsB,CAAa,EAAIC,EAAYL,CAAQ,EACnD,OAAOkB,EACL7B,EACAsB,EACA,CACE,KAAqB,MACrB,KAAM,CAAC,GAAGjB,EAAMK,CAAI,EAAE,IAAK4B,GAAMA,EAAE,UAAU,EAC7C,MAAA7C,CACD,EACDsB,CAAa,EACb,KAAKR,CAAa,CACrB,EACD,MAAM6B,EAASG,EAAUC,EAAe,CACtCd,EAAqBS,CAAe,EACpC,MAAMM,EAAOpC,EAAKA,EAAK,OAAS,CAAC,EACjC,GAAKoC,IAAiB9D,EACpB,OAAOkD,EAAuB7B,EAAIsB,EAAkB,CAClD,KAA0B,UAC3B,CAAA,EAAE,KAAKf,CAAa,EAGvB,GAAIkC,IAAS,OACX,OAAOhB,EAAYzB,EAAIsB,EAAkBjB,EAAK,MAAM,EAAG,EAAE,CAAC,EAE5D,KAAM,CAACC,EAAcS,CAAa,EAAI2B,EAAiBF,CAAe,EACtE,OAAOX,EACL7B,EACAsB,EACA,CACE,KAAuB,QACvB,KAAMjB,EAAK,IAAKiC,GAAMA,EAAE,UAAU,EAClC,aAAAhC,CACD,EACDS,CAAa,EACb,KAAKR,CAAa,CACrB,EACD,UAAU6B,EAASI,EAAe,CAChCd,EAAqBS,CAAe,EACpC,KAAM,CAAC7B,EAAcS,CAAa,EAAI2B,EAAiBF,CAAe,EACtE,OAAOX,EACL7B,EACAsB,EACA,CACE,KAA2B,YAC3B,KAAMjB,EAAK,IAAKiC,GAAMA,EAAE,UAAU,EAClC,aAAAhC,CACD,EACDS,CAAa,EACb,KAAKR,CAAa,CACrB,CACF,CAAA,EACD,OAAA0B,EAAcrB,EAAOZ,CAAE,EAChBY,CACT,CAEA,SAAS+B,EAAUC,EAAgB,CACjC,OAAO,MAAM,UAAU,OAAO,MAAM,CAAA,EAAIA,CAAG,CAC7C,CAEA,SAASF,EAAiBpC,EAAmB,CAC3C,MAAMuC,EAAYvC,EAAa,IAAIU,CAAW,EAC9C,MAAO,CAAC6B,EAAU,IAAKC,GAAMA,EAAE,CAAC,CAAC,EAAGH,EAAOE,EAAU,IAAKC,GAAMA,EAAE,CAAC,CAAC,CAAC,CAAC,CACxE,CAEA,MAAMC,EAAgB,IAAI,QACV,SAAAlC,GAAY3B,EAAQ8D,EAAyB,CAC3D,OAAAD,EAAc,IAAI7D,EAAK8D,CAAS,EACzB9D,CACT,CAEM,SAAU0B,GAAoB1B,EAAM,CACxC,OAAO,OAAO,OAAOA,EAAK,CAAE,CAACR,CAAW,EAAG,GAAM,CACnD,CAeA,SAASsC,EAAYvB,EAAU,CAC7B,SAAW,CAACwD,EAAMC,CAAO,IAAKvD,EAC5B,GAAIuD,EAAQ,UAAUzD,CAAK,EAAG,CAC5B,KAAM,CAAC0D,EAAiBpC,CAAa,EAAImC,EAAQ,UAAUzD,CAAK,EAChE,MAAO,CACL,CACE,KAA2B,UAC3B,KAAAwD,EACA,MAAOE,CACR,EACDpC,EAEH,CAEH,MAAO,CACL,CACE,KAAuB,MACvB,MAAAtB,CACD,EACDsD,EAAc,IAAItD,CAAK,GAAK,CAAA,EAEhC,CAEA,SAASc,EAAcd,EAAgB,CACrC,OAAQA,EAAM,KAAI,CAChB,IAAA,UACE,OAAOE,EAAiB,IAAIF,EAAM,IAAI,EAAG,YAAYA,EAAM,KAAK,EAClE,IAAA,MACE,OAAOA,EAAM,KAChB,CACH,CAEA,SAASoC,EACP7B,EACAsB,EACA8B,EACAJ,EAA0B,CAE1B,OAAO,IAAI,QAASK,GAAW,CAC7B,MAAMlD,EAAKmD,GAAY,EACvBhC,EAAiB,IAAInB,EAAIkD,CAAO,EAC5BrD,EAAG,OACLA,EAAG,MAAK,EAEVA,EAAG,YAAc,OAAA,OAAA,CAAA,GAAAG,GAAOiD,CAAG,EAAIJ,CAAS,CAC5C,CAAC,CACD,CAEA,SAASM,IAAY,CACnB,OAAO,IAAI,MAAM,CAAC,EACf,KAAK,CAAC,EACN,IAAI,IAAM,KAAK,MAAM,KAAK,SAAW,OAAO,gBAAgB,EAAE,SAAS,EAAE,CAAC,EAC1E,KAAK,GAAG,CACb,CCrnBO,SAASC,EAAiBjB,EAAakB,EAAa,CACvD,IAAIC,EAAI,EAER,QAAS,EAAI,EAAG,EAAInB,EAAE,OAAQ,IAC1BmB,IAAMnB,EAAE,CAAC,EAAIkB,EAAE,CAAC,IAAMlB,EAAE,CAAC,EAAIkB,EAAE,CAAC,GAEpC,OAAOC,CACX,CAUO,SAASC,EAAUpB,EAAakB,EAAa,CAChD,OAAO,KAAK,KAAKD,EAAiBjB,EAAGkB,CAAC,CAAC,CAC3C,CAaO,MAAMG,EAAiB,CAACC,EAAgBC,EAAgBC,IAAkD,CAC7G,IAAIC,EAAW,EAEf,UAAW,KAAKH,EACZ,UAAWI,KAAKH,EAAME,GAAYD,EAAY,EAAGE,CAAC,EAItD,OAAOD,EAAWH,EAAK,OAASC,EAAK,MACzC,EAYaI,GAAkB,CAACL,EAAgBC,EAAgBC,IAAkD,CAC9G,IAAIC,EAAW,EAEf,UAAW,KAAKH,EACZ,UAAWI,KAAKH,EAAME,EAAW,KAAK,IAAIA,EAAUD,EAAY,EAAGE,CAAC,CAAC,EAGzE,OAAOD,CACX,EAYaG,GAAgB,CAACN,EAAgBC,EAAgBC,IAAkD,CAC5G,IAAIC,EAAW,IAEf,UAAW,KAAKH,EACZ,UAAWI,KAAKH,EAAME,EAAW,KAAK,IAAIA,EAAUD,EAAY,EAAGE,CAAC,CAAC,EAGzE,OAAOD,CACX,EASA,SAASI,GAAaC,EAA4B,CAC9C,OAAQA,EAAA,CACJ,IAAK,UAAW,OAAOT,EACvB,IAAK,WAAY,OAAOM,GACxB,IAAK,SAAU,OAAOC,GACtB,QAAS,OAAOP,CAAA,CAExB,CAOA,SAASU,EAAcN,EAA8B,CACjD,OAAQA,EAAA,CACJ,IAAK,YAAa,OAAOL,EACzB,IAAK,mBAAoB,OAAOH,EAChC,QAAS,OAAOG,CAAA,CAExB,CAWO,SAASY,EAAsBC,EAA4B,CAC9D,MAAMC,EAA2B,CAAA,EAE3BC,EAAYC,GAAe,CAC7B,GAAIA,EAAE,SAAS,SAAW,EAEtBF,EAAe,KAAK,GAAGE,EAAE,OAAO,MAGhC,WAAWC,KAASD,EAAE,SAClBD,EAASE,CAAK,CAG1B,EAEA,OAAAF,EAASF,CAAO,EACTC,CACX,CAEA,MAAMI,EAAmB,IAGlB,SAASC,GACZC,EACAC,EAAmC,YACnCC,EAAiC,UAC1B,CACP,GAAIF,EAAW,QAAUF,EACrB,OAAOK,EAAYH,EAAYC,EAAcC,CAAW,EAG5D,MAAME,EAAIJ,EAAW,OACfK,EAAYC,EAAU,CAAC,EAEvBC,MAAoB,IAC1B,KAAOA,EAAc,KAAOT,GACxBS,EAAc,IAAI,KAAK,MAAMF,EAAA,EAAcD,CAAC,CAAC,EAGjD,MAAMI,EAAqB,MAAM,KAAKD,CAAa,EAC7CE,EAAeD,EAAmB,IAAIE,GAAKV,EAAWU,CAAC,CAAC,EAGxDC,EAAgBR,EAAYM,EAAcR,EAAcC,CAAW,EAGzE,OAAOU,GAAsBD,EAAeX,EAAYQ,EAAoBP,CAAY,CAC5F,CAGA,SAASW,GACLD,EACAX,EACAO,EACAN,EACO,CAGP,MAAMY,EAAatB,EAAcU,CAAY,EACvCa,EAAY,IAAI,IAAIP,CAAa,EAGjCQ,MAAkB,IACxB,QAASL,EAAI,EAAGA,EAAIV,EAAW,OAAQU,IAAK,CACxC,GAAII,EAAU,IAAIJ,CAAC,EAAG,SAEtB,IAAIM,EAAc,IACdC,EAAgB,GAEpB,UAAWC,KAAaX,EAAe,CACnC,MAAMtB,EAAW4B,EAAWb,EAAWU,CAAC,EAAGV,EAAWkB,CAAS,CAAC,EAC5DjC,EAAW+B,IACXA,EAAc/B,EACdgC,EAAgBC,EAExB,CAEAH,EAAY,IAAIL,EAAGO,CAAa,CACpC,CAEA,OAAOE,GAA2BR,EAAeI,EAAaR,CAAa,CAC/E,CAGA,SAASY,GACLR,EACAI,EACAR,EACO,CAEP,MAAMa,MAAsB,IACtBC,EAAsB5B,GAAqB,CACzCA,EAAQ,QAAQ,SAAW,GAC3B2B,EAAgB,IAAIb,EAAcd,EAAQ,QAAQ,CAAC,CAAC,EAAGA,CAAO,EAElE,UAAWI,KAASJ,EAAQ,SACxB4B,EAAmBxB,CAAK,CAEhC,EACAwB,EAAmBV,CAAa,EAGhC,MAAMW,MAA8B,IACpC,SAAW,CAACC,EAAUL,CAAS,IAAKH,EAAa,CAC7C,MAAMJ,EAAgBS,EAAgB,IAAIF,CAAS,EACnD,GAAIP,EAAe,CACVW,EAAwB,IAAIX,CAAa,GAC1CW,EAAwB,IAAIX,EAAe,EAAE,EAEjD,MAAMlB,EAAU6B,EAAwB,IAAIX,CAAa,EACrDlB,GACAA,EAAQ,KAAK8B,CAAQ,CAE7B,CACJ,CAEA,MAAMC,EAAsB,GAAe,CACvC,EAAE,QAAU,EAAE,QAAQ,IAAId,GAAKH,EAAcG,CAAC,CAAC,EAC/C,UAAWb,KAAS,EAAE,SAClB2B,EAAmB3B,CAAK,CAEhC,EACA2B,EAAmBb,CAAa,EAChC,SAAW,CAAClB,EAASgC,CAAc,IAAKH,EACpC7B,EAAQ,QAAU,CAAC,GAAGA,EAAQ,QAAS,GAAGgC,CAAc,EAG5D,MAAO,CACH,GAAGd,EACH,QAASnB,EAAsBmB,CAAa,CAAA,CAEpD,CA2BO,SAASR,EAAYH,EAAwBC,EAAmC,YAAaC,EAAiC,UAAoB,CACrJ,MAAMW,EAAatB,EAAcU,CAAY,EACvCyB,EAAYrC,GAAaa,CAAW,EAEpCE,EAAIJ,EAAW,OAKf2B,EAAsB,CAAA,EAItB3C,EAAc,CAAC0B,EAAWkB,IAAsB,CAClD,GAAIlB,IAAMkB,EAAG,MAAO,GAChBlB,EAAIkB,IAAG,CAAClB,EAAGkB,CAAC,EAAI,CAACA,EAAGlB,CAAC,GACzB,MAAMmB,EAAQnB,EAAIN,EAAKM,GAAKA,EAAI,GAAM,GAAKkB,EAAIlB,EAAI,GACnD,OAAOiB,EAAUE,CAAK,CAC1B,EAGMC,EAAc,CAACpB,EAAWkB,EAAWjH,IAAwB,CAC3D+F,EAAIkB,IAAG,CAAClB,EAAGkB,CAAC,EAAI,CAACA,EAAGlB,CAAC,GACzB,MAAMmB,EAAQnB,EAAIN,EAAKM,GAAKA,EAAI,GAAM,GAAKkB,EAAIlB,EAAI,GACnDiB,EAAUE,CAAK,EAAIlH,CACvB,EAIA,QAASoH,EAAK,EAAGA,EAAK3B,EAAG2B,IACrB,QAASC,EAAKD,EAAK,EAAGC,EAAK5B,EAAG4B,IAAM,CAChC,MAAMhE,EAAI6C,EAAWb,EAAW+B,CAAE,EAAG/B,EAAWgC,CAAE,CAAC,EACnDF,EAAYC,EAAIC,EAAIhE,CAAC,CACzB,CAKJ,MAAMiE,EAAsBjC,EAAW,IAAI,CAACkC,EAAGL,KAAW,CACtD,OAAQ,EACR,QAAS,CAACA,CAAK,EACf,SAAU,CAAA,CAAC,EACb,EAIF,QAASM,EAAY,EAAGA,EAAY/B,GAE5B,EAAA+B,GAAa/B,EAAI,GAFc+B,IAAa,CAKhD,IAAIC,EAAkB,IAClBC,EAAW,EACXC,EAAW,EAGf,QAASC,EAAc,EAAGA,EAAcN,EAAS,OAAQM,IACrD,QAASC,EAAcD,EAAc,EAAGC,EAAcP,EAAS,OAAQO,IAAe,CAElF,MAAMvD,EAAWyC,EAAUO,EAASM,CAAW,EAAE,QAASN,EAASO,CAAW,EAAE,QAASxD,CAAW,EAGhGC,EAAWmD,IACXA,EAAkBnD,EAClBoD,EAAWE,EACXD,EAAWE,EAEnB,CAKJ,MAAMC,GAAa,CACf,QAAS,CAAC,GAAGR,EAASI,CAAQ,EAAE,QAAS,GAAGJ,EAASK,CAAQ,EAAE,OAAO,EACtE,OAAQF,EACR,SAAU,CAACH,EAASI,CAAQ,EAAGJ,EAASK,CAAQ,CAAC,CAAA,EAMrDL,EAAS,OAAO,KAAK,IAAII,EAAUC,CAAQ,EAAG,CAAC,EAC/CL,EAAS,OAAO,KAAK,IAAII,EAAUC,CAAQ,EAAG,CAAC,EAC/CL,EAAS,KAAKQ,EAAU,CAC5B,CAIA,MAAMC,EAAcT,EAAS,CAAC,EAC9B,MAAO,CACH,GAAGS,EACH,QAASlD,EAAsBkD,CAAW,CAAA,CAElD,CAEAnI,EAAO,CAAC,uBAAAwF,GAAuB","x_google_ignoreList":[0,1]}

package/dist/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;"}

package/dist/node_modules/.pnpm/@d3fc_d3fc-axis@3.0.7_d3-scale@4.0.2_d3-selection@3.0.0_d3-shape@3.2.0/node_modules/@d3fc/d3fc-axis/src/axis.js

@@ -1,21 +0,0 @@
-import h from "../../../../../@d3fc_d3fc-rebind@6.0.1/node_modules/@d3fc/d3fc-rebind/src/rebindAll.js";
-import { axisBase as m } from "./axisBase.js";
-const s = (t, o) => {
-  let r = !1;
-  const n = m(t, o, { labelOffset: (e, l, f) => {
-    let a = 0, c = n.tickSizeInner() + n.tickPadding(), x = !1;
-    if (r) {
-      const b = o(e), g = l < f.length - 1 ? o(f[l + 1]) : o.range()[1];
-      a = (g - b) / 2, c = n.tickPadding(), x = l === f.length - 1 && b === g;
-    }
-    return { offset: [a, c], hidden: x };
-  } }), i = (e) => n(e);
-  return i.tickCenterLabel = (...e) => e.length ? (r = e[0], i) : r, h(i, n), i;
-}, P = (t) => s("top", t), k = (t) => s("bottom", t), L = (t) => s("left", t), B = (t) => s("right", t);
-export {
-  k as axisBottom,
-  L as axisLeft,
-  B as axisRight,
-  P as axisTop
-};
-//# sourceMappingURL=axis.js.map

package/dist/node_modules/.pnpm/@d3fc_d3fc-axis@3.0.7_d3-scale@4.0.2_d3-selection@3.0.0_d3-shape@3.2.0/node_modules/@d3fc/d3fc-axis/src/axis.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"axis.js","sources":["../../../../../../../../../../node_modules/.pnpm/@d3fc+d3fc-axis@3.0.7_d3-scale@4.0.2_d3-selection@3.0.0_d3-shape@3.2.0/node_modules/@d3fc/d3fc-axis/src/axis.js"],"sourcesContent":["import { rebindAll } from '@d3fc/d3fc-rebind';\nimport { axisBase } from './axisBase';\n\nconst axis = (orient, scale) => {\n    let tickCenterLabel = false;\n\n    const labelOffset = (tick, index, ticksArray) => {\n        let x = 0;\n        let y = base.tickSizeInner() + base.tickPadding();\n        let hidden = false;\n        if (tickCenterLabel) {\n            const thisPosition = scale(tick);\n            const nextPosition = index < ticksArray.length - 1 ? scale(ticksArray[index + 1]) : scale.range()[1];\n            x = (nextPosition - thisPosition) / 2;\n\n            y = base.tickPadding();\n            hidden = (index === ticksArray.length - 1) && (thisPosition === nextPosition);\n        }\n        return { offset: [x, y], hidden };\n    };\n\n    const base = axisBase(orient, scale, {labelOffset});\n\n    const axis = (selection) => {\n        return base(selection);\n    };\n\n    axis.tickCenterLabel = (...args) => {\n        if (!args.length) {\n            return tickCenterLabel;\n        }\n        tickCenterLabel = args[0];\n        return axis;\n    };\n\n    rebindAll(axis, base);\n    return axis;\n};\n\nexport const axisTop = (scale) => axis('top', scale);\n\nexport const axisBottom = (scale) => axis('bottom', scale);\n\nexport const axisLeft = (scale) => axis('left', scale);\n\nexport const axisRight = (scale) => axis('right', scale);\n"],"names":["axis","orient","scale","tickCenterLabel","base","axisBase","tick","index","ticksArray","x","y","hidden","thisPosition","nextPosition","selection","args","rebindAll","axisTop","axisBottom","axisLeft","axisRight"],"mappings":";;AAGA,MAAMA,IAAO,CAACC,GAAQC,MAAU;AAC5B,MAAIC,IAAkB;AAiBtB,QAAMC,IAAOC,EAASJ,GAAQC,GAAO,EAAC,aAflB,CAACI,GAAMC,GAAOC,MAAe;AAC7C,QAAIC,IAAI,GACJC,IAAIN,EAAK,cAAa,IAAKA,EAAK,YAAW,GAC3CO,IAAS;AACb,QAAIR,GAAiB;AACjB,YAAMS,IAAeV,EAAMI,CAAI,GACzBO,IAAeN,IAAQC,EAAW,SAAS,IAAIN,EAAMM,EAAWD,IAAQ,CAAC,CAAC,IAAIL,EAAM,MAAK,EAAG,CAAC;AACnG,MAAAO,KAAKI,IAAeD,KAAgB,GAEpCF,IAAIN,EAAK,YAAW,GACpBO,IAAUJ,MAAUC,EAAW,SAAS,KAAOI,MAAiBC;AAAA,IACpE;AACA,WAAO,EAAE,QAAQ,CAACJ,GAAGC,CAAC,GAAG,QAAAC,EAAM;AAAA,EACnC,EAEiD,CAAC,GAE5CX,IAAO,CAACc,MACHV,EAAKU,CAAS;AAGzB,SAAAd,EAAK,kBAAkB,IAAIe,MAClBA,EAAK,UAGVZ,IAAkBY,EAAK,CAAC,GACjBf,KAHIG,GAMfa,EAAUhB,GAAMI,CAAI,GACbJ;AACX,GAEaiB,IAAU,CAACf,MAAUF,EAAK,OAAOE,CAAK,GAEtCgB,IAAa,CAAChB,MAAUF,EAAK,UAAUE,CAAK,GAE5CiB,IAAW,CAACjB,MAAUF,EAAK,QAAQE,CAAK,GAExCkB,IAAY,CAAClB,MAAUF,EAAK,SAASE,CAAK;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@d3fc_d3fc-axis@3.0.7_d3-scale@4.0.2_d3-selection@3.0.0_d3-shape@3.2.0/node_modules/@d3fc/d3fc-axis/src/axisBase.js

@@ -1,39 +0,0 @@
-import L, { isTransition as C } from "../../../../../@d3fc_d3fc-data-join@6.0.3_d3-selection@3.0.0/node_modules/@d3fc/d3fc-data-join/src/dataJoin.js";
-import { ticksArrayForAxis as E, tickFormatterForAxis as G } from "./axisTickUtils.js";
-import H from "../../../../../d3-shape@3.2.0/node_modules/d3-shape/src/line.js";
-import K from "../../../../../d3-selection@3.0.0/node_modules/d3-selection/src/select.js";
-const Q = (i) => i, Y = (i, o, F = {}) => {
-  let m = [10], p = null, b = () => {
-  }, S = null, f = 6, c = 6, g = 3;
-  const $ = H(), T = L("g", "tick").key(Q), v = L("path", "domain"), N = () => ({ offset: [0, c + g] }), V = () => ({ path: [[0, 0], [0, c]] }), I = F.labelOffset || N, B = F.tickPath || V, _ = (t, a) => {
-    let s = 0;
-    return t.bandwidth && (s = t.bandwidth() / 2, t.round() && (s = Math.round(s))), (y) => a(t(y) + s, 0);
-  }, u = (t, a) => x() ? `translate(${a}, ${t})` : `translate(${t}, ${a})`, w = (t) => x() ? t.map((a) => [a[1], a[0]]) : t, x = () => i === "left" || i === "right", n = (t) => {
-    C(t) && (T.transition(t), v.transition(t)), t.each((a, s, y) => {
-      const h = y[s], P = K(h);
-      h.__scale__ || P.attr("fill", "none").attr("font-size", 10).attr("font-family", "sans-serif").attr("text-anchor", i === "right" ? "start" : i === "left" ? "end" : "middle");
-      const M = h.__scale__ || o;
-      h.__scale__ = o.copy();
-      const d = E(n), j = G(n), O = i === "bottom" || i === "right" ? 1 : -1, z = ([r, e]) => [r, O * e], k = o.range(), q = w([
-        [k[0], O * f],
-        [k[0], 0],
-        [k[1], 0],
-        [k[1], O * f]
-      ]), D = v(P, [a]);
-      D.enter().attr("stroke", "#000"), D.attr("d", $(q));
-      const l = T(P, d), A = d.map((r, e) => I(r, e, d)), J = d.map((r, e) => B(r, e, d));
-      l.enter().attr("transform", _(M, u)).append("path").attr("stroke", "#000"), l.enter().append("text").attr("transform", (r, e) => u(...z(A[e].offset))).attr("fill", "#000"), l.exit().attr("transform", _(o, u)), l.select("path").attr("visibility", (r, e) => J[e].hidden && "hidden").attr(
-        "d",
-        (r, e) => $(w(J[e].path.map(z)))
-      ), l.select("text").attr("visibility", (r, e) => A[e].hidden && "hidden").attr("transform", (r, e) => u(...z(A[e].offset))).attr("dy", () => {
-        let r = "0em";
-        return x() ? r = "0.32em" : i === "bottom" && (r = "0.71em"), r;
-      }).text(j), l.attr("transform", _(o, u)), b(l, a, s);
-    });
-  };
-  return n.tickFormat = (...t) => t.length ? (S = t[0], n) : S, n.tickSize = (...t) => t.length ? (c = f = Number(t[0]), n) : c, n.tickSizeInner = (...t) => t.length ? (c = Number(t[0]), n) : c, n.tickSizeOuter = (...t) => t.length ? (f = Number(t[0]), n) : f, n.tickPadding = (...t) => t.length ? (g = t[0], n) : g, n.decorate = (...t) => t.length ? (b = t[0], n) : b, n.scale = (...t) => t.length ? (o = t[0], n) : o, n.ticks = (...t) => (m = [...t], n), n.tickArguments = (...t) => t.length ? (m = t[0] == null ? [] : [...t[0]], n) : m !== null ? m.slice() : null, n.tickValues = (...t) => t.length ? (p = t[0] == null ? [] : [...t[0]], n) : p !== null ? p.slice() : null, n.orient = () => i, n;
-};
-export {
-  Y as axisBase
-};
-//# sourceMappingURL=axisBase.js.map

package/dist/node_modules/.pnpm/@d3fc_d3fc-axis@3.0.7_d3-scale@4.0.2_d3-selection@3.0.0_d3-shape@3.2.0/node_modules/@d3fc/d3fc-axis/src/axisBase.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"axisBase.js","sources":["../../../../../../../../../../node_modules/.pnpm/@d3fc+d3fc-axis@3.0.7_d3-scale@4.0.2_d3-selection@3.0.0_d3-shape@3.2.0/node_modules/@d3fc/d3fc-axis/src/axisBase.js"],"sourcesContent":["import { select } from 'd3-selection';\r\nimport { line } from 'd3-shape';\r\nimport { dataJoin as _dataJoin, isTransition } from '@d3fc/d3fc-data-join';\r\nimport { ticksArrayForAxis, tickFormatterForAxis } from './axisTickUtils';\r\n\r\nconst identity = d => d;\r\n\r\nexport const axisBase = (orient, scale, custom = {}) => {\r\n\r\n    let tickArguments = [10];\r\n    let tickValues = null;\r\n    let decorate = () => {};\r\n    let tickFormat = null;\r\n    let tickSizeOuter = 6;\r\n    let tickSizeInner = 6;\r\n    let tickPadding = 3;\r\n\r\n    const svgDomainLine = line();\r\n\r\n    const dataJoin = _dataJoin('g', 'tick')\r\n        .key(identity);\r\n\r\n    const domainPathDataJoin = _dataJoin('path', 'domain');\r\n\r\n    const defaultLabelOffset = () => ({ offset: [0, tickSizeInner + tickPadding] });\r\n    const defaultTickPath = () => ({ path: [[0, 0], [0, tickSizeInner]] });\r\n\r\n    const labelOffset = custom.labelOffset || defaultLabelOffset;\r\n    const tickPath = custom.tickPath || defaultTickPath;\r\n\r\n    // returns a function that creates a translation based on\r\n    // the bound data\r\n    const containerTranslate = (scale, trans) => {\r\n        let offset = 0;\r\n        if (scale.bandwidth) {\r\n            offset = scale.bandwidth() / 2;\r\n            if (scale.round()) {\r\n                offset = Math.round(offset);\r\n            }\r\n        }\r\n        return d => trans(scale(d) + offset, 0);\r\n    };\r\n\r\n    const translate = (x, y) =>\r\n        isVertical()\r\n            ? `translate(${y}, ${x})`\r\n            : `translate(${x}, ${y})`;\r\n\r\n    const pathTranspose = (arr) =>\r\n        isVertical()\r\n           ? arr.map(d => [d[1], d[0]])\r\n           : arr;\r\n\r\n    const isVertical = () =>\r\n        orient === 'left' || orient === 'right';\r\n\r\n    const axis = (selection) => {\r\n\r\n        if (isTransition(selection)) {\r\n            dataJoin.transition(selection);\r\n            domainPathDataJoin.transition(selection);\r\n        }\r\n\r\n        selection.each((data, index, group) => {\r\n\r\n            const element = group[index];\r\n\r\n            const container = select(element);\r\n            if (!element.__scale__) {\r\n                container\r\n                    .attr('fill', 'none')\r\n                    .attr('font-size', 10)\r\n                    .attr('font-family', 'sans-serif')\r\n                    .attr('text-anchor', orient === 'right' ? 'start' : orient === 'left' ? 'end' : 'middle');\r\n            }\r\n\r\n            // Stash a snapshot of the new scale, and retrieve the old snapshot.\r\n            const scaleOld = element.__scale__ || scale;\r\n            element.__scale__ = scale.copy();\r\n\r\n            const ticksArray = ticksArrayForAxis(axis);\r\n            const tickFormatter = tickFormatterForAxis(axis);\r\n            const sign = orient === 'bottom' || orient === 'right' ? 1 : -1;\r\n            const withSign = ([x, y]) => ([x, sign * y]);\r\n\r\n            // add the domain line\r\n            const range = scale.range();\r\n            const domainPathData = pathTranspose([\r\n                [range[0], sign * tickSizeOuter],\r\n                [range[0], 0],\r\n                [range[1], 0],\r\n                [range[1], sign * tickSizeOuter]\r\n            ]);\r\n\r\n            const domainLine = domainPathDataJoin(container, [data]);\r\n\r\n            domainLine.enter()\r\n                .attr('stroke', '#000');\r\n\r\n            domainLine.attr('d', svgDomainLine(domainPathData));\r\n\r\n            const g = dataJoin(container, ticksArray);\r\n\r\n            const labelOffsets = ticksArray.map((d, i) => labelOffset(d, i, ticksArray));\r\n            const tickPaths = ticksArray.map((d, i) => tickPath(d, i, ticksArray));\r\n\r\n            // enter\r\n            g.enter()\r\n                .attr('transform', containerTranslate(scaleOld, translate))\r\n                .append('path')\r\n                .attr('stroke', '#000');\r\n\r\n            g.enter()\r\n                .append('text')\r\n                .attr('transform', (d, i) => translate(...withSign(labelOffsets[i].offset)))\r\n                .attr('fill', '#000');\r\n\r\n            // exit\r\n            g.exit()\r\n                .attr('transform', containerTranslate(scale, translate));\r\n\r\n            // update\r\n            g.select('path')\r\n                .attr('visibility', (d, i) => tickPaths[i].hidden && 'hidden')\r\n                .attr('d',\r\n                    (d, i) => svgDomainLine(pathTranspose(tickPaths[i].path.map(withSign)))\r\n                );\r\n\r\n            g.select('text')\r\n                .attr('visibility', (d, i) => labelOffsets[i].hidden && 'hidden')\r\n                .attr('transform', (d, i) => translate(...withSign(labelOffsets[i].offset)))\r\n                .attr('dy', () => {\r\n                    let offset = '0em';\r\n                    if (isVertical()) {\r\n                        offset = '0.32em';\r\n                    } else if (orient === 'bottom') {\r\n                        offset = '0.71em';\r\n                    }\r\n                    return offset;\r\n                })\r\n               .text(tickFormatter);\r\n\r\n            g.attr('transform', containerTranslate(scale, translate));\r\n\r\n            decorate(g, data, index);\r\n        });\r\n    };\r\n\r\n    axis.tickFormat = (...args) => {\r\n        if (!args.length) {\r\n            return tickFormat;\r\n        }\r\n        tickFormat = args[0];\r\n        return axis;\r\n    };\r\n\r\n    axis.tickSize = (...args) => {\r\n        if (!args.length) {\r\n            return tickSizeInner;\r\n        }\r\n        tickSizeInner = tickSizeOuter = Number(args[0]);\r\n        return axis;\r\n    };\r\n\r\n    axis.tickSizeInner = (...args) => {\r\n        if (!args.length) {\r\n            return tickSizeInner;\r\n        }\r\n        tickSizeInner = Number(args[0]);\r\n        return axis;\r\n    };\r\n\r\n    axis.tickSizeOuter = (...args) => {\r\n        if (!args.length) {\r\n            return tickSizeOuter;\r\n        }\r\n        tickSizeOuter = Number(args[0]);\r\n        return axis;\r\n    };\r\n\r\n    axis.tickPadding = (...args) => {\r\n        if (!args.length) {\r\n            return tickPadding;\r\n        }\r\n        tickPadding = args[0];\r\n        return axis;\r\n    };\r\n\r\n    axis.decorate = (...args) => {\r\n        if (!args.length) {\r\n            return decorate;\r\n        }\r\n        decorate = args[0];\r\n        return axis;\r\n    };\r\n\r\n    axis.scale = (...args) => {\r\n        if (!args.length) {\r\n            return scale;\r\n        }\r\n        scale = args[0];\r\n        return axis;\r\n    };\r\n\r\n    axis.ticks = (...args) => {\r\n        tickArguments = [...args];\r\n        return axis;\r\n    };\r\n\r\n    axis.tickArguments = (...args) => {\r\n        if (!args.length) {\r\n            return tickArguments !== null ? tickArguments.slice() : null;\r\n        }\r\n        tickArguments = args[0] == null ? [] : [...args[0]];\r\n        return axis;\r\n    };\r\n\r\n    axis.tickValues = (...args) => {\r\n        if (!args.length) {\r\n            return tickValues !== null ? tickValues.slice() : null;\r\n        }\r\n        tickValues = args[0] == null ? [] : [...args[0]];\r\n        return axis;\r\n    };\r\n\r\n    axis.orient = () => orient;\r\n\r\n    return axis;\r\n};\r\n"],"names":["identity","d","axisBase","orient","scale","custom","tickArguments","tickValues","decorate","tickFormat","tickSizeOuter","tickSizeInner","tickPadding","svgDomainLine","line","dataJoin","_dataJoin","domainPathDataJoin","defaultLabelOffset","defaultTickPath","labelOffset","tickPath","containerTranslate","trans","offset","translate","x","y","isVertical","pathTranspose","arr","axis","selection","isTransition","data","index","group","element","container","select","scaleOld","ticksArray","ticksArrayForAxis","tickFormatter","tickFormatterForAxis","sign","withSign","range","domainPathData","domainLine","g","labelOffsets","i","tickPaths","args"],"mappings":";;;;AAKA,MAAMA,IAAW,CAAAC,MAAKA,GAETC,IAAW,CAACC,GAAQC,GAAOC,IAAS,CAAA,MAAO;AAEpD,MAAIC,IAAgB,CAAC,EAAE,GACnBC,IAAa,MACbC,IAAW,MAAM;AAAA,EAAC,GAClBC,IAAa,MACbC,IAAgB,GAChBC,IAAgB,GAChBC,IAAc;AAElB,QAAMC,IAAgBC,KAEhBC,IAAWC,EAAU,KAAK,MAAM,EACjC,IAAIhB,CAAQ,GAEXiB,IAAqBD,EAAU,QAAQ,QAAQ,GAE/CE,IAAqB,OAAO,EAAE,QAAQ,CAAC,GAAGP,IAAgBC,CAAW,EAAC,IACtEO,IAAkB,OAAO,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAGR,CAAa,CAAC,EAAC,IAE7DS,IAAcf,EAAO,eAAea,GACpCG,IAAWhB,EAAO,YAAYc,GAI9BG,IAAqB,CAAClB,GAAOmB,MAAU;AACzC,QAAIC,IAAS;AACb,WAAIpB,EAAM,cACNoB,IAASpB,EAAM,UAAS,IAAK,GACzBA,EAAM,YACNoB,IAAS,KAAK,MAAMA,CAAM,KAG3B,CAAAvB,MAAKsB,EAAMnB,EAAMH,CAAC,IAAIuB,GAAQ,CAAC;AAAA,EAC1C,GAEMC,IAAY,CAACC,GAAGC,MAClBC,EAAU,IACJ,aAAaD,CAAC,KAAKD,CAAC,MACpB,aAAaA,CAAC,KAAKC,CAAC,KAExBE,IAAgB,CAACC,MACnBF,EAAU,IACLE,EAAI,IAAI,CAAA7B,MAAK,CAACA,EAAE,CAAC,GAAGA,EAAE,CAAC,CAAC,CAAC,IACzB6B,GAEHF,IAAa,MACfzB,MAAW,UAAUA,MAAW,SAE9B4B,IAAO,CAACC,MAAc;AAExB,IAAIC,EAAaD,CAAS,MACtBjB,EAAS,WAAWiB,CAAS,GAC7Bf,EAAmB,WAAWe,CAAS,IAG3CA,EAAU,KAAK,CAACE,GAAMC,GAAOC,MAAU;AAEnC,YAAMC,IAAUD,EAAMD,CAAK,GAErBG,IAAYC,EAAOF,CAAO;AAChC,MAAKA,EAAQ,aACTC,EACK,KAAK,QAAQ,MAAM,EACnB,KAAK,aAAa,EAAE,EACpB,KAAK,eAAe,YAAY,EAChC,KAAK,eAAenC,MAAW,UAAU,UAAUA,MAAW,SAAS,QAAQ,QAAQ;AAIhG,YAAMqC,IAAWH,EAAQ,aAAajC;AACtC,MAAAiC,EAAQ,YAAYjC,EAAM;AAE1B,YAAMqC,IAAaC,EAAkBX,CAAI,GACnCY,IAAgBC,EAAqBb,CAAI,GACzCc,IAAO1C,MAAW,YAAYA,MAAW,UAAU,IAAI,IACvD2C,IAAW,CAAC,CAACpB,GAAGC,CAAC,MAAO,CAACD,GAAGmB,IAAOlB,CAAC,GAGpCoB,IAAQ3C,EAAM,SACd4C,IAAiBnB,EAAc;AAAA,QACjC,CAACkB,EAAM,CAAC,GAAGF,IAAOnC,CAAa;AAAA,QAC/B,CAACqC,EAAM,CAAC,GAAG,CAAC;AAAA,QACZ,CAACA,EAAM,CAAC,GAAG,CAAC;AAAA,QACZ,CAACA,EAAM,CAAC,GAAGF,IAAOnC,CAAa;AAAA,MAC/C,CAAa,GAEKuC,IAAahC,EAAmBqB,GAAW,CAACJ,CAAI,CAAC;AAEvD,MAAAe,EAAW,MAAK,EACX,KAAK,UAAU,MAAM,GAE1BA,EAAW,KAAK,KAAKpC,EAAcmC,CAAc,CAAC;AAElD,YAAME,IAAInC,EAASuB,GAAWG,CAAU,GAElCU,IAAeV,EAAW,IAAI,CAACxC,GAAGmD,MAAMhC,EAAYnB,GAAGmD,GAAGX,CAAU,CAAC,GACrEY,IAAYZ,EAAW,IAAI,CAACxC,GAAGmD,MAAM/B,EAASpB,GAAGmD,GAAGX,CAAU,CAAC;AAGrE,MAAAS,EAAE,MAAK,EACF,KAAK,aAAa5B,EAAmBkB,GAAUf,CAAS,CAAC,EACzD,OAAO,MAAM,EACb,KAAK,UAAU,MAAM,GAE1ByB,EAAE,MAAK,EACF,OAAO,MAAM,EACb,KAAK,aAAa,CAACjD,GAAGmD,MAAM3B,EAAU,GAAGqB,EAASK,EAAaC,CAAC,EAAE,MAAM,CAAC,CAAC,EAC1E,KAAK,QAAQ,MAAM,GAGxBF,EAAE,KAAI,EACD,KAAK,aAAa5B,EAAmBlB,GAAOqB,CAAS,CAAC,GAG3DyB,EAAE,OAAO,MAAM,EACV,KAAK,cAAc,CAACjD,GAAGmD,MAAMC,EAAUD,CAAC,EAAE,UAAU,QAAQ,EAC5D;AAAA,QAAK;AAAA,QACF,CAACnD,GAAGmD,MAAMvC,EAAcgB,EAAcwB,EAAUD,CAAC,EAAE,KAAK,IAAIN,CAAQ,CAAC,CAAC;AAAA,MAC1F,GAEYI,EAAE,OAAO,MAAM,EACV,KAAK,cAAc,CAACjD,GAAGmD,MAAMD,EAAaC,CAAC,EAAE,UAAU,QAAQ,EAC/D,KAAK,aAAa,CAACnD,GAAGmD,MAAM3B,EAAU,GAAGqB,EAASK,EAAaC,CAAC,EAAE,MAAM,CAAC,CAAC,EAC1E,KAAK,MAAM,MAAM;AACd,YAAI5B,IAAS;AACb,eAAII,EAAU,IACVJ,IAAS,WACFrB,MAAW,aAClBqB,IAAS,WAENA;AAAA,MACX,CAAC,EACD,KAAKmB,CAAa,GAEtBO,EAAE,KAAK,aAAa5B,EAAmBlB,GAAOqB,CAAS,CAAC,GAExDjB,EAAS0C,GAAGhB,GAAMC,CAAK;AAAA,IAC3B,CAAC;AAAA,EACL;AAEA,SAAAJ,EAAK,aAAa,IAAIuB,MACbA,EAAK,UAGV7C,IAAa6C,EAAK,CAAC,GACZvB,KAHItB,GAMfsB,EAAK,WAAW,IAAIuB,MACXA,EAAK,UAGV3C,IAAgBD,IAAgB,OAAO4C,EAAK,CAAC,CAAC,GACvCvB,KAHIpB,GAMfoB,EAAK,gBAAgB,IAAIuB,MAChBA,EAAK,UAGV3C,IAAgB,OAAO2C,EAAK,CAAC,CAAC,GACvBvB,KAHIpB,GAMfoB,EAAK,gBAAgB,IAAIuB,MAChBA,EAAK,UAGV5C,IAAgB,OAAO4C,EAAK,CAAC,CAAC,GACvBvB,KAHIrB,GAMfqB,EAAK,cAAc,IAAIuB,MACdA,EAAK,UAGV1C,IAAc0C,EAAK,CAAC,GACbvB,KAHInB,GAMfmB,EAAK,WAAW,IAAIuB,MACXA,EAAK,UAGV9C,IAAW8C,EAAK,CAAC,GACVvB,KAHIvB,GAMfuB,EAAK,QAAQ,IAAIuB,MACRA,EAAK,UAGVlD,IAAQkD,EAAK,CAAC,GACPvB,KAHI3B,GAMf2B,EAAK,QAAQ,IAAIuB,OACbhD,IAAgB,CAAC,GAAGgD,CAAI,GACjBvB,IAGXA,EAAK,gBAAgB,IAAIuB,MAChBA,EAAK,UAGVhD,IAAgBgD,EAAK,CAAC,KAAK,OAAO,CAAA,IAAK,CAAC,GAAGA,EAAK,CAAC,CAAC,GAC3CvB,KAHIzB,MAAkB,OAAOA,EAAc,MAAK,IAAK,MAMhEyB,EAAK,aAAa,IAAIuB,MACbA,EAAK,UAGV/C,IAAa+C,EAAK,CAAC,KAAK,OAAO,CAAA,IAAK,CAAC,GAAGA,EAAK,CAAC,CAAC,GACxCvB,KAHIxB,MAAe,OAAOA,EAAW,MAAK,IAAK,MAM1DwB,EAAK,SAAS,MAAM5B,GAEb4B;AACX;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@d3fc_d3fc-axis@3.0.7_d3-scale@4.0.2_d3-selection@3.0.0_d3-shape@3.2.0/node_modules/@d3fc/d3fc-axis/src/axisTickUtils.js

@@ -1,11 +0,0 @@
-const k = (t) => t, r = (t, c, o, i) => t[c] ? t[c].apply(t, o) : i, e = (t) => t.tickValues() ?? r(
-  t.scale(),
-  "ticks",
-  t.tickArguments(),
-  t.scale().domain()
-), n = (t) => t.tickFormat() ?? r(t.scale(), "tickFormat", t.tickArguments(), k);
-export {
-  n as tickFormatterForAxis,
-  e as ticksArrayForAxis
-};
-//# sourceMappingURL=axisTickUtils.js.map

package/dist/node_modules/.pnpm/@d3fc_d3fc-axis@3.0.7_d3-scale@4.0.2_d3-selection@3.0.0_d3-shape@3.2.0/node_modules/@d3fc/d3fc-axis/src/axisTickUtils.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"axisTickUtils.js","sources":["../../../../../../../../../../node_modules/.pnpm/@d3fc+d3fc-axis@3.0.7_d3-scale@4.0.2_d3-selection@3.0.0_d3-shape@3.2.0/node_modules/@d3fc/d3fc-axis/src/axisTickUtils.js"],"sourcesContent":["// these utilities capture some of the relatively complex logic within d3-axis which \n// determines the ticks and tick formatter based on various axis and scale\n// properties: https://github.com/d3/d3-axis#axis_ticks \n\nconst identity = d => d;\n\nconst tryApply = (scale, fn, args, defaultVal) =>\n    scale[fn] ? scale[fn].apply(scale, args) : defaultVal;\n\nconst ticksArrayForAxis = axis =>\n    axis.tickValues() ??\n        tryApply(\n              axis.scale(),\n              'ticks',\n              axis.tickArguments(),\n              axis.scale().domain()\n          );\n\nconst tickFormatterForAxis = axis =>\n    axis.tickFormat() ??\n        tryApply(axis.scale(), 'tickFormat', axis.tickArguments(), identity);\n\nexport { ticksArrayForAxis, tickFormatterForAxis };\n"],"names":["identity","d","tryApply","scale","fn","args","defaultVal","ticksArrayForAxis","axis","tickFormatterForAxis"],"mappings":"AAIA,MAAMA,IAAW,CAAAC,MAAKA,GAEhBC,IAAW,CAACC,GAAOC,GAAIC,GAAMC,MAC/BH,EAAMC,CAAE,IAAID,EAAMC,CAAE,EAAE,MAAMD,GAAOE,CAAI,IAAIC,GAEzCC,IAAoB,CAAAC,MACtBA,EAAK,WAAU,KACXN;AAAA,EACMM,EAAK,MAAK;AAAA,EACV;AAAA,EACAA,EAAK,cAAa;AAAA,EAClBA,EAAK,MAAK,EAAG,OAAM;AACjC,GAEMC,IAAuB,CAAAD,MACzBA,EAAK,WAAU,KACXN,EAASM,EAAK,MAAK,GAAI,cAAcA,EAAK,cAAa,GAAIR,CAAQ;","x_google_ignoreList":[0]}