@milaboratories/graph-maker 1.1.174 → 1.1.176

package/dist/node_modules/@milaboratories/miplots4/dist/heatmap/getClusters.js

@@ -1,169 +0,0 @@
-import E from "../node_modules/d3-random/src/lcg.js";
-function L(e, r) {
-  let o = 0;
-  for (let n = 0; n < e.length; n++)
-    o += (e[n] - r[n]) * (e[n] - r[n]);
-  return o;
-}
-function M(e, r) {
-  return Math.sqrt(L(e, r));
-}
-const w = (e, r, o) => {
-  let n = 0;
-  for (const l of e)
-    for (const s of r) n += o(l, s);
-  return n / e.length / r.length;
-}, S = (e, r, o) => {
-  let n = 0;
-  for (const l of e)
-    for (const s of r) n = Math.max(n, o(l, s));
-  return n;
-}, y = (e, r, o) => {
-  let n = 1 / 0;
-  for (const l of e)
-    for (const s of r) n = Math.min(n, o(l, s));
-  return n;
-};
-function I(e) {
-  switch (e) {
-    case "average":
-      return w;
-    case "complete":
-      return S;
-    case "single":
-      return y;
-    default:
-      return w;
-  }
-}
-function q(e) {
-  switch (e) {
-    case "euclidean":
-      return M;
-    case "squaredEuclidean":
-      return L;
-    default:
-      return M;
-  }
-}
-function A(e) {
-  const r = [], o = (n) => {
-    if (n.children.length === 0)
-      r.push(...n.indexes);
-    else
-      for (const l of n.children)
-        o(l);
-  };
-  return o(e), r;
-}
-const v = 2e3;
-function O(e, r = "euclidean", o = "average") {
-  if (e.length <= v)
-    return k(e, r, o);
-  const n = e.length, l = E(1), s = /* @__PURE__ */ new Set();
-  for (; s.size < v; )
-    s.add(Math.floor(l() * n));
-  const f = Array.from(s), c = f.map((a) => e[a]), u = k(c, r, o);
-  return b(u, e, f, r);
-}
-function b(e, r, o, n) {
-  const l = q(n), s = new Set(o), f = /* @__PURE__ */ new Map();
-  for (let c = 0; c < r.length; c++) {
-    if (s.has(c)) continue;
-    let u = 1 / 0, a = -1;
-    for (const h of o) {
-      const t = l(r[c], r[h]);
-      t < u && (u = t, a = h);
-    }
-    f.set(c, a);
-  }
-  return z(e, f, o);
-}
-function z(e, r, o) {
-  const n = /* @__PURE__ */ new Map(), l = (c) => {
-    c.indexes.length === 1 && n.set(o[c.indexes[0]], c);
-    for (const u of c.children)
-      l(u);
-  };
-  l(e);
-  const s = /* @__PURE__ */ new Map();
-  for (const [c, u] of r) {
-    const a = n.get(u);
-    if (a) {
-      s.has(a) || s.set(a, []);
-      const h = s.get(a);
-      h && h.push(c);
-    }
-  }
-  const f = (c) => {
-    c.indexes = c.indexes.map((u) => o[u]);
-    for (const u of c.children)
-      f(u);
-  };
-  f(e);
-  for (const [c, u] of s)
-    c.indexes = [...c.indexes, ...u];
-  return {
-    ...e,
-    indexes: A(e)
-  };
-}
-function k(e, r = "euclidean", o = "average") {
-  const n = q(r), l = I(o), s = e.length, f = [], c = (t, i) => {
-    if (t === i) return 0;
-    t > i && ([t, i] = [i, t]);
-    const d = t * s - t * (t + 1) / 2 + (i - t - 1);
-    return f[d];
-  }, u = (t, i, d) => {
-    t > i && ([t, i] = [i, t]);
-    const g = t * s - t * (t + 1) / 2 + (i - t - 1);
-    f[g] = d;
-  };
-  for (let t = 0; t < s; t++)
-    for (let i = t + 1; i < s; i++) {
-      const d = n(e[t], e[i]);
-      u(t, i, d);
-    }
-  const a = e.map((t, i) => ({
-    height: 0,
-    // Height 0 for leaf nodes
-    indexes: [i],
-    // Single index per cluster initially
-    children: []
-    // No children for leaf nodes
-  }));
-  for (let t = 0; t < s && !(t >= s - 1); t++) {
-    let i = 1 / 0, d = 0, g = 0;
-    for (let x = 0; x < a.length; x++)
-      for (let p = x + 1; p < a.length; p++) {
-        const m = l(a[x].indexes, a[p].indexes, c);
-        m < i && (i = m, d = x, g = p);
-      }
-    const C = {
-      indexes: [...a[d].indexes, ...a[g].indexes],
-      // Combine all indexes
-      height: i,
-      // Height is the distance at which clusters were merged
-      children: [a[d], a[g]]
-      // Store the two merged clusters as children
-    };
-    a.splice(Math.max(d, g), 1), a.splice(Math.min(d, g), 1), a.push(C);
-  }
-  const h = a[0];
-  return {
-    ...h,
-    indexes: A(h)
-    // Ensure indexes are in hierarchical order
-  };
-}
-export {
-  w as averageLinkage,
-  S as completeLinkage,
-  M as euclidean,
-  A as extractOrderedIndexes,
-  k as getClusters,
-  O as getClustersApproximate,
-  y as singleLinkage,
-  L as squaredEuclidean
-};
-//# sourceMappingURL=getClusters.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/heatmap/getClusters.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"getClusters.js","sources":["../../../../../../node_modules/@milaboratories/miplots4/src/heatmap/getClusters.ts"],"sourcesContent":["import type { Cluster } from './components/types';\nimport type { DendrogramDistance, DendrogramLinkage } from '../types';\nimport { randomLcg } from 'd3-random';\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"],"names":["squaredEuclidean","p","q","d","i","euclidean","averageLinkage","setA","setB","getDistance","distance","a","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","sampleCluster","assignRemainingPoints","distanceFn","sampleSet","assignments","minDistance","nearestSample","sampleIdx","reconstructWithAssignments","sampleToCluster","findSampleClusters","assignedPointsByCluster","pointIdx","fillCorrectIndexes","assignedPoints","linkageFn","distances","j","index","setDistance","value","i1","i2","v","clusters","_","iteration","nearestDistance","nearest1","nearest2","clusterIdx1","clusterIdx2","newCluster","rootCluster"],"mappings":";AAcO,SAASA,EAAiBC,GAAaC,GAAa;AACvD,MAAIC,IAAI;AAER,WAASC,IAAI,GAAGA,IAAIH,EAAE,QAAQG;AAC1BD,UAAMF,EAAEG,CAAC,IAAIF,EAAEE,CAAC,MAAMH,EAAEG,CAAC,IAAIF,EAAEE,CAAC;AAEpC,SAAOD;AACX;AAUO,SAASE,EAAUJ,GAAaC,GAAa;AAChD,SAAO,KAAK,KAAKF,EAAiBC,GAAGC,CAAC,CAAC;AAC3C;AAaO,MAAMI,IAAiB,CAACC,GAAgBC,GAAgBC,MAAkD;AAC7G,MAAIC,IAAW;AAEf,aAAWC,KAAKJ;AACZ,eAAWK,KAAKJ,EAAME,MAAYD,EAAYE,GAAGC,CAAC;AAItD,SAAOF,IAAWH,EAAK,SAASC,EAAK;AACzC,GAYaK,IAAkB,CAACN,GAAgBC,GAAgBC,MAAkD;AAC9G,MAAIC,IAAW;AAEf,aAAWC,KAAKJ;AACZ,eAAWK,KAAKJ,EAAME,KAAW,KAAK,IAAIA,GAAUD,EAAYE,GAAGC,CAAC,CAAC;AAGzE,SAAOF;AACX,GAYaI,IAAgB,CAACP,GAAgBC,GAAgBC,MAAkD;AAC5G,MAAIC,IAAW;AAEf,aAAWC,KAAKJ;AACZ,eAAWK,KAAKJ,EAAME,KAAW,KAAK,IAAIA,GAAUD,EAAYE,GAAGC,CAAC,CAAC;AAGzE,SAAOF;AACX;AASA,SAASK,EAAaC,GAA4B;AAC9C,UAAQA,GAAAA;AAAAA,IACJ,KAAK;AAAW,aAAOV;AAAAA,IACvB,KAAK;AAAY,aAAOO;AAAAA,IACxB,KAAK;AAAU,aAAOC;AAAAA,IACtB;AAAS,aAAOR;AAAAA,EAAA;AAExB;AAOA,SAASW,EAAcP,GAA8B;AACjD,UAAQA,GAAAA;AAAAA,IACJ,KAAK;AAAa,aAAOL;AAAAA,IACzB,KAAK;AAAoB,aAAOL;AAAAA,IAChC;AAAS,aAAOK;AAAAA,EAAA;AAExB;AAWO,SAASa,EAAsBC,GAA4B;AAC9D,QAAMC,IAA2B,CAAA,GAE3BC,IAAW,CAACC,MAAe;AAC7B,QAAIA,EAAE,SAAS,WAAW;AAEtBF,MAAAA,EAAe,KAAK,GAAGE,EAAE,OAAO;AAAA;AAGhC,iBAAWC,KAASD,EAAE;AAClBD,UAASE,CAAK;AAAA,EAG1B;AAEA,SAAAF,EAASF,CAAO,GACTC;AACX;AAEA,MAAMI,IAAmB;AAGlB,SAASC,EACZC,GACAC,IAAmC,aACnCC,IAAiC,WAC1B;AACP,MAAIF,EAAW,UAAUF;AACrB,WAAOK,EAAYH,GAAYC,GAAcC,CAAW;AAG5D,QAAME,IAAIJ,EAAW,QACfK,IAAYC,EAAU,CAAC,GAEvBC,wBAAoB,IAAA;AAC1B,SAAOA,EAAc,OAAOT;AACxBS,IAAAA,EAAc,IAAI,KAAK,MAAMF,EAAAA,IAAcD,CAAC,CAAC;AAGjD,QAAMI,IAAqB,MAAM,KAAKD,CAAa,GAC7CE,IAAeD,EAAmB,IAAI,CAAA9B,MAAKsB,EAAWtB,CAAC,CAAC,GAGxDgC,IAAgBP,EAAYM,GAAcR,GAAcC,CAAW;AAGzE,SAAOS,EAAsBD,GAAeV,GAAYQ,GAAoBP,CAAY;AAC5F;AAGA,SAASU,EACLD,GACAV,GACAO,GACAN,GACO;AAGP,QAAMW,IAAarB,EAAcU,CAAY,GACvCY,IAAY,IAAI,IAAIN,CAAa,GAGjCO,IAAAA,oBAAkB,IAAA;AACxB,WAASpC,IAAI,GAAGA,IAAIsB,EAAW,QAAQtB,KAAK;AACxC,QAAImC,EAAU,IAAInC,CAAC,EAAG;AAEtB,QAAIqC,IAAc,OACdC,IAAgB;AAEpB,eAAWC,KAAaV,GAAe;AACnC,YAAMvB,IAAW4B,EAAWZ,EAAWtB,CAAC,GAAGsB,EAAWiB,CAAS,CAAC;AAC5DjC,UAAW+B,MACXA,IAAc/B,GACdgC,IAAgBC;AAAAA,IAExB;AAEAH,IAAAA,EAAY,IAAIpC,GAAGsC,CAAa;AAAA,EACpC;AAEA,SAAOE,EAA2BR,GAAeI,GAAaP,CAAa;AAC/E;AAGA,SAASW,EACLR,GACAI,GACAP,GACO;AAEP,QAAMY,IAAAA,oBAAsB,IAAA,GACtBC,IAAqB,CAAC3B,MAAqB;AACzCA,IAAAA,EAAQ,QAAQ,WAAW,KAC3B0B,EAAgB,IAAIZ,EAAcd,EAAQ,QAAQ,CAAC,CAAC,GAAGA,CAAO;AAElE,eAAWI,KAASJ,EAAQ;AACxB2B,QAAmBvB,CAAK;AAAA,EAEhC;AACAuB,IAAmBV,CAAa;AAGhC,QAAMW,wBAA8B,IAAA;AACpC,aAAW,CAACC,GAAUL,CAAS,KAAKH,GAAa;AAC7C,UAAMJ,IAAgBS,EAAgB,IAAIF,CAAS;AACnD,QAAIP,GAAe;AACVW,MAAAA,EAAwB,IAAIX,CAAa,KAC1CW,EAAwB,IAAIX,GAAe,EAAE;AAEjD,YAAMjB,IAAU4B,EAAwB,IAAIX,CAAa;AACrDjB,WACAA,EAAQ,KAAK6B,CAAQ;AAAA,IAE7B;AAAA,EACJ;AAEA,QAAMC,IAAqB,CAAC3B,MAAe;AACvCA,IAAAA,EAAE,UAAUA,EAAE,QAAQ,IAAI,CAAAlB,MAAK6B,EAAc7B,CAAC,CAAC;AAC/C,eAAWmB,KAASD,EAAE;AAClB2B,MAAAA,EAAmB1B,CAAK;AAAA,EAEhC;AACA0B,EAAAA,EAAmBb,CAAa;AAChC,aAAW,CAACjB,GAAS+B,CAAc,KAAKH;AACpC5B,IAAAA,EAAQ,UAAU,CAAC,GAAGA,EAAQ,SAAS,GAAG+B,CAAc;AAG5D,SAAO;AAAA,IACH,GAAGd;AAAAA,IACH,SAASlB,EAAsBkB,CAAa;AAAA,EAAA;AAEpD;AA2BO,SAASP,EAAYH,GAAwBC,IAAmC,aAAaC,IAAiC,WAAoB;AACrJ,QAAMU,IAAarB,EAAcU,CAAY,GACvCwB,IAAYpC,EAAaa,CAAW,GAEpCE,IAAIJ,EAAW,QAKf0B,IAAsB,CAAA,GAItB3C,IAAc,CAACL,GAAWiD,MAAsB;AAClD,QAAIjD,MAAMiD,EAAG,QAAO;AAChBjD,QAAIiD,MAAG,CAACjD,GAAGiD,CAAC,IAAI,CAACA,GAAGjD,CAAC;AACzB,UAAMkD,IAAQlD,IAAI0B,IAAK1B,KAAKA,IAAI,KAAM,KAAKiD,IAAIjD,IAAI;AACnD,WAAOgD,EAAUE,CAAK;AAAA,EAC1B,GAGMC,IAAc,CAACnD,GAAWiD,GAAWG,MAAwB;AAC3DpD,QAAIiD,MAAG,CAACjD,GAAGiD,CAAC,IAAI,CAACA,GAAGjD,CAAC;AACzB,UAAMkD,IAAQlD,IAAI0B,IAAK1B,KAAKA,IAAI,KAAM,KAAKiD,IAAIjD,IAAI;AACnDgD,IAAAA,EAAUE,CAAK,IAAIE;AAAAA,EACvB;AAIA,WAASC,IAAK,GAAGA,IAAK3B,GAAG2B;AACrB,aAASC,IAAKD,IAAK,GAAGC,IAAK5B,GAAG4B,KAAM;AAChC,YAAMC,IAAIrB,EAAWZ,EAAW+B,CAAE,GAAG/B,EAAWgC,CAAE,CAAC;AACnDH,MAAAA,EAAYE,GAAIC,GAAIC,CAAC;AAAA,IACzB;AAKJ,QAAMC,IAAsBlC,EAAW,IAAI,CAACmC,GAAGP,OAAW;AAAA,IACtD,QAAQ;AAAA;AAAA,IACR,SAAS,CAACA,CAAK;AAAA;AAAA,IACf,UAAU,CAAA;AAAA;AAAA,EAAA,EACZ;AAIF,WAASQ,IAAY,GAAGA,IAAYhC,KAE5B,EAAAgC,KAAahC,IAAI,IAFcgC,KAAa;AAKhD,QAAIC,IAAkB,OAClBC,IAAW,GACXC,IAAW;AAGf,aAASC,IAAc,GAAGA,IAAcN,EAAS,QAAQM;AACrD,eAASC,IAAcD,IAAc,GAAGC,IAAcP,EAAS,QAAQO,KAAe;AAElF,cAAMzD,IAAWyC,EAAUS,EAASM,CAAW,EAAE,SAASN,EAASO,CAAW,EAAE,SAAS1D,CAAW;AAGhGC,QAAAA,IAAWqD,MACXA,IAAkBrD,GAClBsD,IAAWE,GACXD,IAAWE;AAAAA,MAEnB;AAKJ,UAAMC,IAAa;AAAA,MACf,SAAS,CAAC,GAAGR,EAASI,CAAQ,EAAE,SAAS,GAAGJ,EAASK,CAAQ,EAAE,OAAO;AAAA;AAAA,MACtE,QAAQF;AAAAA;AAAAA,MACR,UAAU,CAACH,EAASI,CAAQ,GAAGJ,EAASK,CAAQ,CAAC;AAAA;AAAA,IAAA;AAMrDL,IAAAA,EAAS,OAAO,KAAK,IAAII,GAAUC,CAAQ,GAAG,CAAC,GAC/CL,EAAS,OAAO,KAAK,IAAII,GAAUC,CAAQ,GAAG,CAAC,GAC/CL,EAAS,KAAKQ,CAAU;AAAA,EAC5B;AAIA,QAAMC,IAAcT,EAAS,CAAC;AAC9B,SAAO;AAAA,IACH,GAAGS;AAAAA,IACH,SAASnD,EAAsBmD,CAAW;AAAA;AAAA,EAAA;AAElD;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/heatmap/getDendrograms.js

@@ -1,46 +0,0 @@
-import { getClustersApproximate as d } from "./getClusters.js";
-import x from "../node_modules/d3-hierarchy/src/hierarchy/index.js";
-function X(r, y, l, G) {
-  const { facetKeys: K, xGroupKeys: B, yGroupKeys: g } = r.meta, m = {};
-  if (y && G.sharedX)
-    throw Error("Dendrogram on X axis is not available with shared by facets X axis");
-  return K.forEach((s) => {
-    const f = {
-      hierarchyByGroupX: {},
-      hierarchyByGroupY: {}
-    }, o = r.facets[s];
-    if (y) {
-      const i = [];
-      B.forEach((e) => {
-        const n = o.xKeysByGroups[e], p = o.yKeys, t = d(
-          n.map((a) => p.map((h) => {
-            var c;
-            return ((c = o.cells[a][h]) == null ? void 0 : c.normalizedValue.dataSource) ?? y.fillNA;
-          })),
-          y.distance,
-          y.linkage
-        ), u = t.indexes.map((a) => n[a]);
-        r.facets[s].xKeysByGroups[e] = u, i.push(...u), f.hierarchyByGroupX[e] = x(t);
-      }), r.facets[s].xKeys = i;
-    }
-    if (l) {
-      const i = [];
-      g.forEach((e) => {
-        const n = o.yKeysByGroups[e], p = o.xKeys, t = d(
-          n.map((a) => p.map((h) => {
-            var c;
-            return ((c = o.cells[h][a]) == null ? void 0 : c.normalizedValue.dataSource) ?? l.fillNA;
-          })),
-          l.distance,
-          l.linkage
-        ), u = t.indexes.map((a) => n[a]);
-        r.facets[s].yKeysByGroups[e] = u, i.push(...u), f.hierarchyByGroupY[e] = x(t);
-      }), r.facets[s].yKeys = i;
-    }
-    m[s] = f;
-  }), m;
-}
-export {
-  X as getDendrograms
-};
-//# sourceMappingURL=getDendrograms.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/heatmap/getDendrograms.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"getDendrograms.js","sources":["../../../../../../node_modules/@milaboratories/miplots4/src/heatmap/getDendrograms.ts"],"sourcesContent":["import type { Cluster } from './components/types';\nimport type { GroupedCellsHeatmap } from './getCells';\nimport type { HeatmapSettingsImpl } from './HeatmapSettingsImpl';\nimport { getClustersApproximate } from './getClusters';\nimport type { HierarchyNode } from 'd3-hierarchy';\nimport { hierarchy } from 'd3-hierarchy';\n\nexport type DendrogramsData = Record<string, {\n    hierarchyByGroupX: Record<string, HierarchyNode<Cluster>>;\n    hierarchyByGroupY: Record<string, HierarchyNode<Cluster>>;\n}>\n\nconst DEBUG = false;\n\nexport function getDendrograms(\n    groupedCellsData: GroupedCellsHeatmap,\n    dendrogramX: HeatmapSettingsImpl['dendrogramX'],\n    dendrogramY: HeatmapSettingsImpl['dendrogramY'],\n    facetSettings: HeatmapSettingsImpl['facetSettings']\n): DendrogramsData {\n    const { facetKeys, xGroupKeys, yGroupKeys } = groupedCellsData.meta;\n    const result: DendrogramsData = {};\n\n    if (dendrogramX && facetSettings.sharedX) {\n        throw Error('Dendrogram on X axis is not available with shared by facets X axis');\n    }\n\n    facetKeys.forEach(facetKey => {\n        const facetResult: DendrogramsData[string] = {\n            hierarchyByGroupX: {},\n            hierarchyByGroupY: {},\n        };\n        const cellsGroup = groupedCellsData.facets[facetKey];\n        if (DEBUG) {\n            // eslint-disable-next-line no-console\n            console.time('start x');\n        }\n        if (dendrogramX) {\n            const updatedXKeys: string[] = [];\n            xGroupKeys.forEach(xGroupKey => {\n                const xKeys = cellsGroup.xKeysByGroups[xGroupKey];\n                const yKeys = cellsGroup.yKeys;\n                if(DEBUG) {\n                    // eslint-disable-next-line no-console\n                    console.log('xKeys source', xKeys.length);\n                }\n                const rootCluster = getClustersApproximate(\n                    xKeys.map(x => yKeys.map(y => (cellsGroup.cells[x][y]?.normalizedValue.dataSource ?? dendrogramX.fillNA) as number)),\n                    dendrogramX.distance,\n                    dendrogramX.linkage\n                );\n                if (DEBUG) {\n                    // eslint-disable-next-line no-console\n                    console.log('rootCluster', rootCluster);\n                }\n                //set sorted group keys\n                const newXKeys = rootCluster.indexes.map(i => xKeys[i]);\n                groupedCellsData.facets[facetKey].xKeysByGroups[xGroupKey] = newXKeys;\n                updatedXKeys.push(...newXKeys);\n                facetResult.hierarchyByGroupX[xGroupKey] = hierarchy(rootCluster);\n            });\n            // set sorted group keys of all groups\n            groupedCellsData.facets[facetKey].xKeys = updatedXKeys;\n        }\n        if (DEBUG) {\n            // eslint-disable-next-line no-console\n            console.timeEnd('start x');\n        }\n        if (dendrogramY) {\n            const updatedYKeys: string[] = [];\n            yGroupKeys.forEach(yGroupKey => {\n                const yKeys = cellsGroup.yKeysByGroups[yGroupKey];\n                const xKeys = cellsGroup.xKeys;\n                const rootCluster = getClustersApproximate(\n                    yKeys.map(y => xKeys.map(x => (cellsGroup.cells[x][y]?.normalizedValue.dataSource ?? dendrogramY.fillNA) as number)),\n                    dendrogramY.distance,\n                    dendrogramY.linkage\n                );\n                const newYKeys = rootCluster.indexes.map(i => yKeys[i]);\n                //set sorted group keys\n                groupedCellsData.facets[facetKey].yKeysByGroups[yGroupKey] = newYKeys;\n                updatedYKeys.push(...newYKeys);\n                facetResult.hierarchyByGroupY[yGroupKey] = hierarchy(rootCluster);\n            });\n            // set sorted group keys of all groups\n            groupedCellsData.facets[facetKey].yKeys = updatedYKeys;\n        }\n        result[facetKey] = facetResult;\n    });\n\n    return result;\n}\n"],"names":["getDendrograms","groupedCellsData","dendrogramX","dendrogramY","facetSettings","facetKeys","xGroupKeys","yGroupKeys","result","facetKey","facetResult","cellsGroup","updatedXKeys","xGroupKey","xKeys","yKeys","rootCluster","getClustersApproximate","x","l","_a","y","newXKeys","i","hierarchy","updatedYKeys","yGroupKey","newYKeys"],"mappings":";;AAcO,SAASA,EACZC,GACAC,GACAC,GACAC,GACe;AACf,QAAM,EAAE,WAAAC,GAAW,YAAAC,GAAY,YAAAC,MAAeN,EAAiB,MACzDO,IAA0B,CAAA;AAEhC,MAAIN,KAAeE,EAAc;AAC7B,UAAM,MAAM,oEAAoE;AAGpF,SAAAC,EAAU,QAAQ,CAAAI,MAAY;AAC1B,UAAMC,IAAuC;AAAA,MACzC,mBAAmB,CAAA;AAAA,MACnB,mBAAmB,CAAA;AAAA,IAAA,GAEjBC,IAAaV,EAAiB,OAAOQ,CAAQ;AAKnD,QAAIP,GAAa;AACb,YAAMU,IAAyB,CAAA;AAC/BN,MAAAA,EAAW,QAAQ,CAAAO,MAAa;AAC5B,cAAMC,IAAQH,EAAW,cAAcE,CAAS,GAC1CE,IAAQJ,EAAW,OAKnBK,IAAcC;AAAAA,UAChBH,EAAM,IAAI,CAAAI,MAAKH,EAAM,IAAI,CAAAI,MAAA;;AAAM,qBAAAC,IAAAT,EAAW,MAAMO,CAAC,EAAEG,CAAC,MAArB,OAAA,SAAAD,EAAwB,gBAAgB,eAAclB,EAAY;AAAA,UAAA,CAAiB,CAAC;AAAA,UACnHA,EAAY;AAAA,UACZA,EAAY;AAAA,QAAA,GAOVoB,IAAWN,EAAY,QAAQ,IAAI,CAAAO,MAAKT,EAAMS,CAAC,CAAC;AACtDtB,QAAAA,EAAiB,OAAOQ,CAAQ,EAAE,cAAcI,CAAS,IAAIS,GAC7DV,EAAa,KAAK,GAAGU,CAAQ,GAC7BZ,EAAY,kBAAkBG,CAAS,IAAIW,EAAUR,CAAW;AAAA,MACpE,CAAC,GAEDf,EAAiB,OAAOQ,CAAQ,EAAE,QAAQG;AAAAA,IAC9C;AAKA,QAAIT,GAAa;AACb,YAAMsB,IAAyB,CAAA;AAC/BlB,MAAAA,EAAW,QAAQ,CAAAmB,MAAa;AAC5B,cAAMX,IAAQJ,EAAW,cAAce,CAAS,GAC1CZ,IAAQH,EAAW,OACnBK,IAAcC;AAAAA,UAChBF,EAAM,IAAI,CAAAM,MAAKP,EAAM,IAAI,CAAAK,MAAA;;AAAM,qBAAAC,IAAAT,EAAW,MAAMO,CAAC,EAAEG,CAAC,MAArB,OAAA,SAAAD,EAAwB,gBAAgB,eAAcjB,EAAY;AAAA,UAAA,CAAiB,CAAC;AAAA,UACnHA,EAAY;AAAA,UACZA,EAAY;AAAA,QAAA,GAEVwB,IAAWX,EAAY,QAAQ,IAAI,CAAAO,MAAKR,EAAMQ,CAAC,CAAC;AAEtDtB,QAAAA,EAAiB,OAAOQ,CAAQ,EAAE,cAAciB,CAAS,IAAIC,GAC7DF,EAAa,KAAK,GAAGE,CAAQ,GAC7BjB,EAAY,kBAAkBgB,CAAS,IAAIF,EAAUR,CAAW;AAAA,MACpE,CAAC,GAEDf,EAAiB,OAAOQ,CAAQ,EAAE,QAAQgB;AAAAA,IAC9C;AACAjB,IAAAA,EAAOC,CAAQ,IAAIC;AAAAA,EACvB,CAAC,GAEMF;AACX;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/heatmap/index.js

@@ -1,175 +0,0 @@
-import { renderToString as q } from "../node_modules/react-dom/server.browser.js";
-import { AbstractChart as F } from "../AbstractChart.js";
-import { isColumnName as A } from "../utils/index.js";
-import L from "./ChartRenderer.js";
-import { getCells as J } from "./getCells.js";
-import { getDendrograms as K } from "./getDendrograms.js";
-import { HeatmapSettingsImpl as k } from "./HeatmapSettingsImpl.js";
-import { MAX_SVG_RENDERED_CELLS_COUNT as M } from "./constants.js";
-var P = Object.defineProperty, W = (g, t, e) => t in g ? P(g, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : g[t] = e, X = (g, t, e) => W(g, typeof t != "symbol" ? t + "" : t, e);
-class lt extends F {
-  constructor(t, e, a) {
-    super(t, e), X(this, "settings"), X(this, "chartRenderer", new L()), X(this, "onTooltipHintSwitch", () => {
-    }), X(this, "calculatedData", null), this.settings = new k(e), a && (this.onTooltipHintSwitch = a[0]);
-  }
-  mount(t) {
-    try {
-      this.chartRenderer.init(t), this._updateData(), this._updateChart(), this.hasError = !1;
-    } catch (e) {
-      this.hasError = !0, e instanceof Error && (this.chartRenderer.renderError(e.message), console.error(e));
-    }
-  }
-  unmount() {
-    this.chartRenderer.clear();
-  }
-  updateSettingsAndData(t, e) {
-    try {
-      const a = this.settings, r = this.data;
-      this.settings = new k(e), this.data = t, this._needUpdateCalculatedDataBySettings(a, this.settings) || this._needUpdateCalculatedDataByData(r, this.data) ? this._updateData() : this._updateAesInData(), this._updateChart();
-    } catch (a) {
-      a instanceof Error && (this.chartRenderer.renderError(a.message), console.error(a));
-    }
-  }
-  updateChartState(t, e) {
-    console.warn("no chart state for heatmap");
-  }
-  export() {
-    return this._updateChart(), q(this.chartRenderer.component);
-  }
-  _needUpdateCalculatedDataBySettings(t, e) {
-    var a, r, n, o, i, m, c, d, s, v, l, p, y, u, C;
-    const {
-      xColumn: S,
-      yColumn: b,
-      valueColumn: G,
-      xGroupBy: _,
-      yGroupBy: h,
-      facetBy: w,
-      annotations: N,
-      chartSettings: T,
-      facetSettings: Y,
-      dendrogramX: E,
-      dendrogramY: O,
-      normalization: B,
-      aggregation: D,
-      NAValueAs: j
-    } = e, U = Object.values(((a = t.dendrogramX) == null ? void 0 : a.aes) || {}).filter(
-      A
-    ), V = Object.values((E == null ? void 0 : E.aes) || {}).filter(A), H = Object.values(((r = t.dendrogramY) == null ? void 0 : r.aes) || {}).filter(
-      A
-    ), z = Object.values((O == null ? void 0 : O.aes) || {}).filter(A);
-    function f(x, R) {
-      return x.length !== R.length || x.some((I, $) => I.value !== R[$].value);
-    }
-    return t.xColumn.value !== S.value || t.yColumn.value !== b.value || t.valueColumn.value !== G.value || f(t.xGroupBy, _) || f(t.yGroupBy, h) || f(t.facetBy, w) || f(
-      t.annotations.map((x) => x.valueColumn),
-      N.map((x) => x.valueColumn)
-    ) || f(U, V) || f(H, z) || (e.dendrogramX || t.dendrogramX) && (((n = t.dendrogramX) == null ? void 0 : n.distance) !== ((o = e.dendrogramX) == null ? void 0 : o.distance) || ((i = t.dendrogramX) == null ? void 0 : i.linkage) !== ((m = e.dendrogramX) == null ? void 0 : m.linkage)) || (e.dendrogramY || t.dendrogramY) && (((c = t.dendrogramY) == null ? void 0 : c.distance) !== ((d = e.dendrogramY) == null ? void 0 : d.distance) || ((s = t.dendrogramY) == null ? void 0 : s.linkage) !== ((v = e.dendrogramY) == null ? void 0 : v.linkage)) || t.chartSettings.valueType !== T.valueType || t.facetSettings.sharedX !== Y.sharedX || t.facetSettings.sharedY !== Y.sharedY || ((l = t.normalization) == null ? void 0 : l.method) !== (B == null ? void 0 : B.method) || ((p = t.normalization) == null ? void 0 : p.direction) !== (B == null ? void 0 : B.direction) || t.NAValueAs !== j || ((y = t.aggregation) == null ? void 0 : y.method) !== (D == null ? void 0 : D.method) || ((u = t.aggregation) == null ? void 0 : u.x) !== (D == null ? void 0 : D.x) || ((C = t.aggregation) == null ? void 0 : C.y) !== (D == null ? void 0 : D.y);
-  }
-  _needUpdateCalculatedDataByData(t, e) {
-    const a = Object.keys(t.data), r = Object.keys(e.data);
-    return t.id !== e.id || a.length !== r.length || a.some((n) => {
-      var o;
-      return t.data[n].length !== ((o = e.data[n]) == null ? void 0 : o.length);
-    });
-  }
-  _updateData() {
-    const {
-      xColumn: t,
-      yColumn: e,
-      valueColumn: a,
-      xGroupBy: r,
-      yGroupBy: n,
-      facetBy: o,
-      chartSettings: i,
-      facetSettings: m,
-      annotations: c,
-      dendrogramX: d,
-      dendrogramY: s,
-      normalization: v,
-      NAValueAs: l,
-      keysOrder: p,
-      aggregation: y
-    } = this.settings, u = J(
-      this.data,
-      t,
-      e,
-      { dataSource: a },
-      o,
-      r,
-      n,
-      c,
-      d,
-      s,
-      v,
-      l,
-      p,
-      i.xAxis,
-      i.yAxis,
-      y
-    ), C = K(u, d, s, m), S = i.valueType === "discrete" ? this.data.getColumnCategories(a.value) : [];
-    this.calculatedData = {
-      groupedCellsData: u,
-      dendrogramsData: C,
-      cellUniqValues: S
-    };
-  }
-  _updateAesInData() {
-  }
-  _updateChart() {
-    var t, e;
-    if (!this.calculatedData)
-      return;
-    const {
-      id: a,
-      valueColumn: r,
-      chartSettings: n,
-      facetSettings: o,
-      aes: i,
-      annotations: m,
-      dendrogramX: c,
-      dendrogramY: d,
-      inheritedDendrogramAes: s,
-      normalization: v,
-      keysOrder: l,
-      xColumn: p,
-      yColumn: y,
-      xGroupBy: u,
-      yGroupBy: C
-    } = this.settings, S = {
-      x: ((t = l[p.value]) == null ? void 0 : t.length) > 0,
-      y: ((e = l[y.value]) == null ? void 0 : e.length) > 0,
-      xGroup: u.some((_) => {
-        var h;
-        return ((h = l[_.value]) == null ? void 0 : h.length) > 0;
-      }),
-      yGroup: C.some((_) => {
-        var h;
-        return ((h = l[_.value]) == null ? void 0 : h.length) > 0;
-      })
-    }, b = this.data.columnNames.length ? this.data.getColumn(this.data.columnNames[0]).length : 0, G = this.settings.cellsRenderingMode ?? (b > M ? "canvas" : "svg");
-    this.chartRenderer.render(
-      this.data,
-      a,
-      n,
-      o,
-      i,
-      this.calculatedData.groupedCellsData,
-      m,
-      r,
-      c,
-      d,
-      this.calculatedData.dendrogramsData,
-      s,
-      this.calculatedData.cellUniqValues,
-      v,
-      this.onTooltipHintSwitch,
-      S,
-      G
-    );
-  }
-}
-export {
-  lt as ChartHeatmap
-};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/heatmap/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../node_modules/@milaboratories/miplots4/src/heatmap/index.ts"],"sourcesContent":["import { renderToString } from 'react-dom/server';\nimport { AbstractChart } from '../AbstractChart';\nimport type { DataFrame } from '../DataFrame';\nimport type { ColumnName, DataValue, HeatmapEventHandlers, HeatmapSettings } from '../types';\nimport { isColumnName } from '../utils';\nimport ChartRenderer from './ChartRenderer';\nimport type { GroupedCellsHeatmap } from './getCells';\nimport { getCells } from './getCells';\nimport type { DendrogramsData } from './getDendrograms';\nimport { getDendrograms } from './getDendrograms';\nimport { HeatmapSettingsImpl } from './HeatmapSettingsImpl';\nimport { MAX_SVG_RENDERED_CELLS_COUNT } from './constants';\n\nexport class ChartHeatmap extends AbstractChart {\n    settings: HeatmapSettingsImpl;\n    chartRenderer = new ChartRenderer();\n\n    onTooltipHintSwitch: (v:boolean) => void = () => undefined;\n    calculatedData: {\n        groupedCellsData: GroupedCellsHeatmap;\n        dendrogramsData: DendrogramsData;\n        cellUniqValues: DataValue[];\n    } | null = null;\n\n    constructor(data: DataFrame, settings: HeatmapSettings, eventHandlers?:HeatmapEventHandlers) {\n        super(data, settings);\n\n        this.settings = new HeatmapSettingsImpl(settings);\n        if (eventHandlers) {\n            this.onTooltipHintSwitch = eventHandlers[0];\n        }\n    }\n\n    mount(node: HTMLElement) {\n        try {\n            this.chartRenderer.init(node);\n            this._updateData();\n            this._updateChart();\n            this.hasError = false;\n        } catch (err) {\n            this.hasError = true;\n            if (err instanceof Error) {\n                this.chartRenderer.renderError(err.message as string);\n                console.error(err);\n            }\n        }\n    }\n\n    unmount() {\n        this.chartRenderer.clear();\n    }\n\n    updateSettingsAndData(data: DataFrame, settings: HeatmapSettings) {\n        try {\n            const previousSettings = this.settings;\n            const previousData = this.data;\n            this.settings = new HeatmapSettingsImpl(settings);\n            this.data = data;\n            if (\n                this._needUpdateCalculatedDataBySettings(previousSettings, this.settings) ||\n                this._needUpdateCalculatedDataByData(previousData, this.data)\n            ) {\n                this._updateData();\n            } else {\n                this._updateAesInData();\n            }\n            this._updateChart();\n        } catch (err) {\n            if (err instanceof Error) {\n                this.chartRenderer.renderError(err.message as string);\n                console.error(err);\n            }\n        }\n    }\n\n    updateChartState(_field: string, _value: unknown) {\n        console.warn('no chart state for heatmap');\n    }\n\n    export(): string {\n        this._updateChart();\n        return renderToString(this.chartRenderer.component);\n    }\n\n    _needUpdateCalculatedDataBySettings(prevSettings: HeatmapSettingsImpl, settings: HeatmapSettingsImpl) {\n        const {\n            xColumn,\n            yColumn,\n            valueColumn,\n            xGroupBy,\n            yGroupBy,\n            facetBy,\n            annotations,\n            chartSettings,\n            facetSettings,\n            dendrogramX,\n            dendrogramY,\n            normalization,\n            aggregation,\n            NAValueAs,\n        } = settings;\n\n        const prevDendrogramXColumns: ColumnName[] = Object.values(prevSettings.dendrogramX?.aes || {}).filter(\n            isColumnName\n        );\n        const currentDendrogramXColumns: ColumnName[] = Object.values(dendrogramX?.aes || {}).filter(isColumnName);\n        const prevDendrogramYColumns: ColumnName[] = Object.values(prevSettings.dendrogramY?.aes || {}).filter(\n            isColumnName\n        );\n        const currentDendrogramYColumns: ColumnName[] = Object.values(dendrogramY?.aes || {}).filter(isColumnName);\n\n        function compareColumnGroups(columns1: ColumnName[], columns2: ColumnName[]) {\n            return (\n                columns1.length !== columns2.length ||\n                columns1.some((column, idx) => column.value !== columns2[idx].value)\n            );\n        }\n\n        return (\n            prevSettings.xColumn.value !== xColumn.value ||\n            prevSettings.yColumn.value !== yColumn.value ||\n            prevSettings.valueColumn.value !== valueColumn.value ||\n            compareColumnGroups(prevSettings.xGroupBy, xGroupBy) ||\n            compareColumnGroups(prevSettings.yGroupBy, yGroupBy) ||\n            compareColumnGroups(prevSettings.facetBy, facetBy) ||\n            compareColumnGroups(\n                prevSettings.annotations.map(a => a.valueColumn),\n                annotations.map(a => a.valueColumn)\n            ) ||\n            compareColumnGroups(prevDendrogramXColumns, currentDendrogramXColumns) ||\n            compareColumnGroups(prevDendrogramYColumns, currentDendrogramYColumns) ||\n            ((settings.dendrogramX || prevSettings.dendrogramX) &&\n                (prevSettings.dendrogramX?.distance !== settings.dendrogramX?.distance ||\n                    prevSettings.dendrogramX?.linkage !== settings.dendrogramX?.linkage)) ||\n            ((settings.dendrogramY || prevSettings.dendrogramY) &&\n                (prevSettings.dendrogramY?.distance !== settings.dendrogramY?.distance ||\n                    prevSettings.dendrogramY?.linkage !== settings.dendrogramY?.linkage)) ||\n            prevSettings.chartSettings.valueType !== chartSettings.valueType ||\n            prevSettings.facetSettings.sharedX !== facetSettings.sharedX ||\n            prevSettings.facetSettings.sharedY !== facetSettings.sharedY ||\n            prevSettings.normalization?.method !== normalization?.method ||\n            prevSettings.normalization?.direction !== normalization?.direction ||\n            prevSettings.NAValueAs !== NAValueAs ||\n            prevSettings.aggregation?.method !== aggregation?.method ||\n            prevSettings.aggregation?.x !== aggregation?.x ||\n            prevSettings.aggregation?.y !== aggregation?.y\n        );\n    }\n\n    _needUpdateCalculatedDataByData(prevData: DataFrame, data: DataFrame) {\n        const prevKeys = Object.keys(prevData.data);\n        const keys = Object.keys(data.data);\n        return (\n            prevData.id !== data.id ||\n            prevKeys.length !== keys.length ||\n            prevKeys.some(key => prevData.data[key].length !== data.data[key]?.length)\n        );\n    }\n\n    _updateData() {\n        const {\n            xColumn,\n            yColumn,\n            valueColumn,\n            xGroupBy,\n            yGroupBy,\n            facetBy,\n            chartSettings,\n            facetSettings,\n            annotations,\n            dendrogramX,\n            dendrogramY,\n            normalization,\n            NAValueAs,\n            keysOrder,\n            aggregation\n        } = this.settings;\n\n        const groupedCellsData = getCells(\n            this.data,\n            xColumn,\n            yColumn,\n            {dataSource: valueColumn},\n            facetBy,\n            xGroupBy,\n            yGroupBy,\n            annotations,\n            dendrogramX,\n            dendrogramY,\n            normalization,\n            NAValueAs,\n            keysOrder,\n            chartSettings.xAxis,\n            chartSettings.yAxis,\n            aggregation\n        );\n        const dendrogramsData = getDendrograms(groupedCellsData, dendrogramX, dendrogramY, facetSettings);\n        const cellUniqValues =\n            chartSettings.valueType === 'discrete' ? this.data.getColumnCategories(valueColumn.value) : [];\n\n        this.calculatedData = {\n            groupedCellsData,\n            dendrogramsData,\n            cellUniqValues,\n        };\n    }\n\n    _updateAesInData() {\n        return;\n    }\n\n    _updateChart() {\n        if (!this.calculatedData) {\n            return;\n        }\n        const {\n            id,\n            valueColumn,\n            chartSettings,\n            facetSettings,\n            aes,\n            annotations,\n            dendrogramX,\n            dendrogramY,\n            inheritedDendrogramAes,\n            normalization,\n            keysOrder,\n            xColumn,\n            yColumn,\n            xGroupBy,\n            yGroupBy,\n        } = this.settings;\n        const customOrder = {\n            x: keysOrder[xColumn.value]?.length > 0,\n            y: keysOrder[yColumn.value]?.length > 0,\n            xGroup: xGroupBy.some((v) => keysOrder[v.value]?.length > 0),\n            yGroup: yGroupBy.some((v) => keysOrder[v.value]?.length > 0),\n        };\n        const dataSize = this.data.columnNames.length ? this.data.getColumn(this.data.columnNames[0]).length : 0;\n        const cellsRenderingMode = this.settings.cellsRenderingMode ?? (dataSize > MAX_SVG_RENDERED_CELLS_COUNT ? 'canvas' : 'svg');\n        \n        this.chartRenderer.render(\n            this.data,\n            id,\n            chartSettings,\n            facetSettings,\n            aes,\n            this.calculatedData.groupedCellsData,\n            annotations,\n            valueColumn,\n            dendrogramX,\n            dendrogramY,\n            this.calculatedData.dendrogramsData,\n            inheritedDendrogramAes,\n            this.calculatedData.cellUniqValues,\n            normalization,\n            this.onTooltipHintSwitch,\n            customOrder,\n            cellsRenderingMode\n        );\n    }\n}\n"],"names":["ChartHeatmap","AbstractChart","data","settings","eventHandlers","__publicField","ChartRenderer","HeatmapSettingsImpl","node","err","previousSettings","previousData","_field","_value","renderToString","prevSettings","xColumn","yColumn","valueColumn","xGroupBy","yGroupBy","facetBy","annotations","chartSettings","facetSettings","dendrogramX","dendrogramY","normalization","aggregation","NAValueAs","prevDendrogramXColumns","_a","isColumnName","currentDendrogramXColumns","prevDendrogramYColumns","_b","currentDendrogramYColumns","compareColumnGroups","columns1","columns2","column","idx","a","_c","_d","_e","_f","_g","_h","_i","_j","_k","_l","_m","_n","_o","prevData","prevKeys","keys","u","key","keysOrder","groupedCellsData","getCells","dendrogramsData","getDendrograms","cellUniqValues","id","aes","inheritedDendrogramAes","customOrder","v","dataSize","cellsRenderingMode","MAX_SVG_RENDERED_CELLS_COUNT"],"mappings":";;;;;;;;;AAaO,MAAMA,WAAqBC,EAAc;AAAA,EAW5C,YAAYC,GAAiBC,GAA2BC,GAAqC;AACzF,UAAMF,GAAMC,CAAQ,GAXxBE,EAAA,MAAA,UAAA,GACAA,EAAA,MAAA,iBAAgB,IAAIC,EAAAA,CAAA,GAEpBD,EAAA,6BAA2C,MAAA;AAAA,IAAA,CAAA,GAC3CA,EAAA,MAAA,kBAIW,IAAA,GAKP,KAAK,WAAW,IAAIE,EAAoBJ,CAAQ,GAC5CC,MACA,KAAK,sBAAsBA,EAAc,CAAC;AAAA,EAElD;AAAA,EAEA,MAAMI,GAAmB;AACrB,QAAI;AACA,WAAK,cAAc,KAAKA,CAAI,GAC5B,KAAK,eACL,KAAK,aAAA,GACL,KAAK,WAAW;AAAA,IACpB,SAASC,GAAK;AACV,WAAK,WAAW,IACZA,aAAe,UACf,KAAK,cAAc,YAAYA,EAAI,OAAiB,GACpD,QAAQ,MAAMA,CAAG;AAAA,IAEzB;AAAA,EACJ;AAAA,EAEA,UAAU;AACN,SAAK,cAAc,MAAA;AAAA,EACvB;AAAA,EAEA,sBAAsBP,GAAiBC,GAA2B;AAC9D,QAAI;AACA,YAAMO,IAAmB,KAAK,UACxBC,IAAe,KAAK;AAC1B,WAAK,WAAW,IAAIJ,EAAoBJ,CAAQ,GAChD,KAAK,OAAOD,GAER,KAAK,oCAAoCQ,GAAkB,KAAK,QAAQ,KACxE,KAAK,gCAAgCC,GAAc,KAAK,IAAI,IAE5D,KAAK,YAAA,IAEL,KAAK,oBAET,KAAK,aAAA;AAAA,IACT,SAASF,GAAK;AACNA,MAAAA,aAAe,UACf,KAAK,cAAc,YAAYA,EAAI,OAAiB,GACpD,QAAQ,MAAMA,CAAG;AAAA,IAEzB;AAAA,EACJ;AAAA,EAEA,iBAAiBG,GAAgBC,GAAiB;AAC9C,YAAQ,KAAK,4BAA4B;AAAA,EAC7C;AAAA,EAEA,SAAiB;AACb,WAAA,KAAK,aAAA,GACEC,EAAe,KAAK,cAAc,SAAS;AAAA,EACtD;AAAA,EAEA,oCAAoCC,GAAmCZ,GAA+B;;AAClG,UAAM;AAAA,MACF,SAAAa;AAAAA,MACA,SAAAC;AAAAA,MACA,aAAAC;AAAAA,MACA,UAAAC;AAAAA,MACA,UAAAC;AAAAA,MACA,SAAAC;AAAAA,MACA,aAAAC;AAAAA,MACA,eAAAC;AAAAA,MACA,eAAAC;AAAAA,MACA,aAAAC;AAAAA,MACA,aAAAC;AAAAA,MACA,eAAAC;AAAAA,MACA,aAAAC;AAAAA,MACA,WAAAC;AAAAA,IAAA,IACA1B,GAEE2B,IAAuC,OAAO,SAAOC,IAAAhB,EAAa,gBAAb,OAAA,SAAAgB,EAA0B,QAAO,CAAA,CAAE,EAAE;AAAA,MAC5FC;AAAAA,IAAA,GAEEC,IAA0C,OAAO,QAAOR,KAAA,gBAAAA,EAAa,QAAO,EAAE,EAAE,OAAOO,CAAY,GACnGE,IAAuC,OAAO,SAAOC,IAAApB,EAAa,gBAAb,OAAA,SAAAoB,EAA0B,QAAO,CAAA,CAAE,EAAE;AAAA,MAC5FH;AAAAA,IAAA,GAEEI,IAA0C,OAAO,QAAOV,KAAA,OAAA,SAAAA,EAAa,QAAO,CAAA,CAAE,EAAE,OAAOM,CAAY;AAEzG,aAASK,EAAoBC,GAAwBC,GAAwB;AACzE,aACID,EAAS,WAAWC,EAAS,UAC7BD,EAAS,KAAK,CAACE,GAAQC,MAAQD,EAAO,UAAUD,EAASE,CAAG,EAAE,KAAK;AAAA,IAE3E;AAEA,WACI1B,EAAa,QAAQ,UAAUC,EAAQ,SACvCD,EAAa,QAAQ,UAAUE,EAAQ,SACvCF,EAAa,YAAY,UAAUG,EAAY,SAC/CmB,EAAoBtB,EAAa,UAAUI,CAAQ,KACnDkB,EAAoBtB,EAAa,UAAUK,CAAQ,KACnDiB,EAAoBtB,EAAa,SAASM,CAAO,KACjDgB;AAAAA,MACItB,EAAa,YAAY,IAAI,CAAA2B,MAAKA,EAAE,WAAW;AAAA,MAC/CpB,EAAY,IAAI,CAAAoB,MAAKA,EAAE,WAAW;AAAA,IAAA,KAEtCL,EAAoBP,GAAwBG,CAAyB,KACrEI,EAAoBH,GAAwBE,CAAyB,MACnEjC,EAAS,eAAeY,EAAa,mBAClC4B,IAAA5B,EAAa,gBAAb,OAAA,SAAA4B,EAA0B,gBAAaC,IAAAzC,EAAS,gBAAT,OAAA,SAAAyC,EAAsB,eAC1DC,IAAA9B,EAAa,gBAAb,gBAAA8B,EAA0B,eAAYC,IAAA3C,EAAS,gBAAT,OAAA,SAAA2C,EAAsB,cAClE3C,EAAS,eAAeY,EAAa,mBAClCgC,IAAAhC,EAAa,gBAAb,OAAA,SAAAgC,EAA0B,gBAAaC,IAAA7C,EAAS,gBAAT,OAAA,SAAA6C,EAAsB,eAC1DC,IAAAlC,EAAa,gBAAb,OAAA,SAAAkC,EAA0B,eAAYC,IAAA/C,EAAS,gBAAT,gBAAA+C,EAAsB,aACpEnC,EAAa,cAAc,cAAcQ,EAAc,aACvDR,EAAa,cAAc,YAAYS,EAAc,WACrDT,EAAa,cAAc,YAAYS,EAAc,aACrD2B,IAAApC,EAAa,kBAAb,OAAA,SAAAoC,EAA4B,aAAWxB,KAAA,OAAA,SAAAA,EAAe,aACtDyB,IAAArC,EAAa,kBAAb,OAAA,SAAAqC,EAA4B,gBAAczB,KAAA,OAAA,SAAAA,EAAe,cACzDZ,EAAa,cAAcc,OAC3BwB,IAAAtC,EAAa,gBAAb,OAAA,SAAAsC,EAA0B,aAAWzB,KAAA,OAAA,SAAAA,EAAa,aAClD0B,IAAAvC,EAAa,gBAAb,OAAA,SAAAuC,EAA0B,QAAM1B,KAAA,OAAA,SAAAA,EAAa,QAC7C2B,IAAAxC,EAAa,gBAAb,OAAA,SAAAwC,EAA0B,QAAM3B,KAAA,gBAAAA,EAAa;AAAA,EAErD;AAAA,EAEA,gCAAgC4B,GAAqBtD,GAAiB;AAClE,UAAMuD,IAAW,OAAO,KAAKD,EAAS,IAAI,GACpCE,IAAO,OAAO,KAAKxD,EAAK,IAAI;AAClC,WACIsD,EAAS,OAAOtD,EAAK,MACrBuD,EAAS,WAAWC,EAAK,UACzBD,EAAS,KAAK,CAAAE,MAAA;;AAAO,aAAAH,EAAS,KAAKI,CAAG,EAAE,aAAW7B,IAAA7B,EAAK,KAAK0D,CAAG,MAAb,OAAA,SAAA7B,EAAgB;AAAA,IAAA,CAAM;AAAA,EAEjF;AAAA,EAEA,cAAc;AACV,UAAM;AAAA,MACF,SAAAf;AAAAA,MACA,SAAAC;AAAAA,MACA,aAAAC;AAAAA,MACA,UAAAC;AAAAA,MACA,UAAAC;AAAAA,MACA,SAAAC;AAAAA,MACA,eAAAE;AAAAA,MACA,eAAAC;AAAAA,MACA,aAAAF;AAAAA,MACA,aAAAG;AAAAA,MACA,aAAAC;AAAAA,MACA,eAAAC;AAAAA,MACA,WAAAE;AAAAA,MACA,WAAAgC;AAAAA,MACA,aAAAjC;AAAAA,IAAA,IACA,KAAK,UAEHkC,IAAmBC;AAAAA,MACrB,KAAK;AAAA,MACL/C;AAAAA,MACAC;AAAAA,MACA,EAAC,YAAYC,EAAAA;AAAAA,MACbG;AAAAA,MACAF;AAAAA,MACAC;AAAAA,MACAE;AAAAA,MACAG;AAAAA,MACAC;AAAAA,MACAC;AAAAA,MACAE;AAAAA,MACAgC;AAAAA,MACAtC,EAAc;AAAA,MACdA,EAAc;AAAA,MACdK;AAAAA,IAAA,GAEEoC,IAAkBC,EAAeH,GAAkBrC,GAAaC,GAAaF,CAAa,GAC1F0C,IACF3C,EAAc,cAAc,aAAa,KAAK,KAAK,oBAAoBL,EAAY,KAAK,IAAI,CAAA;AAEhG,SAAK,iBAAiB;AAAA,MAClB,kBAAA4C;AAAAA,MACA,iBAAAE;AAAAA,MACA,gBAAAE;AAAAA,IAAA;AAAA,EAER;AAAA,EAEA,mBAAmB;AAAA,EAEnB;AAAA,EAEA,eAAe;;AACX,QAAI,CAAC,KAAK;AACN;AAEJ,UAAM;AAAA,MACF,IAAAC;AAAAA,MACA,aAAAjD;AAAAA,MACA,eAAAK;AAAAA,MACA,eAAAC;AAAAA,MACA,KAAA4C;AAAAA,MACA,aAAA9C;AAAAA,MACA,aAAAG;AAAAA,MACA,aAAAC;AAAAA,MACA,wBAAA2C;AAAAA,MACA,eAAA1C;AAAAA,MACA,WAAAkC;AAAAA,MACA,SAAA7C;AAAAA,MACA,SAAAC;AAAAA,MACA,UAAAE;AAAAA,MACA,UAAAC;AAAAA,IAAA,IACA,KAAK,UACHkD,IAAc;AAAA,MAChB,KAAGvC,IAAA8B,EAAU7C,EAAQ,KAAK,MAAvB,OAAA,SAAAe,EAA0B,UAAS;AAAA,MACtC,KAAGI,IAAA0B,EAAU5C,EAAQ,KAAK,MAAvB,OAAA,SAAAkB,EAA0B,UAAS;AAAA,MACtC,QAAQhB,EAAS,KAAK,CAACoD,MAAA;;AAAM,iBAAAxC,IAAA8B,EAAUU,EAAE,KAAK,MAAjB,OAAA,SAAAxC,EAAoB,UAAS;AAAA,MAAA,CAAC;AAAA,MAC3D,QAAQX,EAAS,KAAK,CAACmD,MAAA;;AAAM,iBAAAxC,IAAA8B,EAAUU,EAAE,KAAK,MAAjB,OAAA,SAAAxC,EAAoB,UAAS;AAAA,MAAA,CAAC;AAAA,IAAA,GAEzDyC,IAAW,KAAK,KAAK,YAAY,SAAS,KAAK,KAAK,UAAU,KAAK,KAAK,YAAY,CAAC,CAAC,EAAE,SAAS,GACjGC,IAAqB,KAAK,SAAS,uBAAuBD,IAAWE,IAA+B,WAAW;AAErH,SAAK,cAAc;AAAA,MACf,KAAK;AAAA,MACLP;AAAAA,MACA5C;AAAAA,MACAC;AAAAA,MACA4C;AAAAA,MACA,KAAK,eAAe;AAAA,MACpB9C;AAAAA,MACAJ;AAAAA,MACAO;AAAAA,MACAC;AAAAA,MACA,KAAK,eAAe;AAAA,MACpB2C;AAAAA,MACA,KAAK,eAAe;AAAA,MACpB1C;AAAAA,MACA,KAAK;AAAA,MACL2C;AAAAA,MACAG;AAAAA,IAAA;AAAA,EAER;AACJ;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/heatmap/utils/calculateAnnotationTitleSizes.js

@@ -1,23 +0,0 @@
-import { TextMeasurer as p } from "../../utils/TextMeasurer/TextMeasurer.js";
-const f = new p("bold 14px Arial");
-function i(n) {
-  let t = 0;
-  for (const u of n) {
-    const o = f.getTextWidth(u);
-    o > t && (t = o);
-  }
-  return t;
-}
-function c(n, t, u, o) {
-  const e = n.filter((l) => l.showTitle && (t.includes(l.position) || !u && ["left", "right"].includes(l.position) || !o && ["top", "bottom"].includes(l.position))), a = e.filter((l) => l.titlePosition === "left").map((l) => l.valueColumn.label ?? l.valueColumn.value), r = e.filter((l) => l.titlePosition === "right").map((l) => l.valueColumn.label ?? l.valueColumn.value), s = e.filter((l) => l.titlePosition === "top").map((l) => l.valueColumn.label ?? l.valueColumn.value), m = e.filter((l) => l.titlePosition === "bottom").map((l) => l.valueColumn.label ?? l.valueColumn.value);
-  return {
-    left: i(a),
-    right: i(r),
-    top: i(s),
-    bottom: i(m)
-  };
-}
-export {
-  c as calculateAnnotationTitleSizes
-};
-//# sourceMappingURL=calculateAnnotationTitleSizes.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/heatmap/utils/calculateAnnotationTitleSizes.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"calculateAnnotationTitleSizes.js","sources":["../../../../../../../node_modules/@milaboratories/miplots4/src/heatmap/utils/calculateAnnotationTitleSizes.ts"],"sourcesContent":["import { TextMeasurer } from '../../utils/TextMeasurer/TextMeasurer';\nimport type { HeatmapSettingsImpl } from '../HeatmapSettingsImpl';\n\nconst textMeasurer = new TextMeasurer('bold 14px Arial');\nfunction getMaxTextLength (titles:string[]) {\n    let maxLabelSize = 0;\n    for (const key of titles) {\n        const l = textMeasurer.getTextWidth(key);\n        if (l > maxLabelSize) {\n            maxLabelSize = l;\n        }\n    }\n    return maxLabelSize;\n}\nexport function calculateAnnotationTitleSizes(\n    annotations: HeatmapSettingsImpl['annotations'],\n    chartSides: ('left' | 'right' | 'top' | 'bottom')[],\n    sharedX: boolean,\n    sharedY: boolean\n) {\n    const usedAnnotations = annotations.filter(item => {\n        return (\n            item.showTitle &&\n            (chartSides.includes(item.position) ||\n                (!sharedX && ['left', 'right'].includes(item.position)) ||\n                (!sharedY && ['top', 'bottom'].includes(item.position)))\n        );\n    });\n    const leftTitles = usedAnnotations\n        .filter(item => item.titlePosition === 'left')\n        .map(item => item.valueColumn.label ?? item.valueColumn.value);\n    const rightTitles = usedAnnotations\n        .filter(item => item.titlePosition === 'right')\n        .map(item => item.valueColumn.label ?? item.valueColumn.value);\n    const topTitles = usedAnnotations\n        .filter(item => item.titlePosition === 'top')\n        .map(item => item.valueColumn.label ?? item.valueColumn.value);\n    const bottomTitles = usedAnnotations\n        .filter(item => item.titlePosition === 'bottom')\n        .map(item => item.valueColumn.label ?? item.valueColumn.value);\n\n    return {\n        left: getMaxTextLength(leftTitles),\n        right: getMaxTextLength(rightTitles),\n        top: getMaxTextLength(topTitles),\n        bottom: getMaxTextLength(bottomTitles)\n    };\n}\n"],"names":["textMeasurer","TextMeasurer","getMaxTextLength","titles","maxLabelSize","key","l","calculateAnnotationTitleSizes","annotations","chartSides","sharedX","sharedY","usedAnnotations","item","leftTitles","t","rightTitles","topTitles","bottomTitles"],"mappings":";AAGA,MAAMA,IAAe,IAAIC,EAAa,iBAAiB;AACvD,SAASC,EAAkBC,GAAiB;AACxC,MAAIC,IAAe;AACnB,aAAWC,KAAOF,GAAQ;AACtB,UAAMG,IAAIN,EAAa,aAAaK,CAAG;AACnCC,QAAIF,MACJA,IAAeE;AAAAA,EAEvB;AACA,SAAOF;AACX;AACO,SAASG,EACZC,GACAC,GACAC,GACAC,GACF;AACE,QAAMC,IAAkBJ,EAAY,OAAO,CAAAK,MAEnCA,EAAK,cACJJ,EAAW,SAASI,EAAK,QAAQ,KAC7B,CAACH,KAAW,CAAC,QAAQ,OAAO,EAAE,SAASG,EAAK,QAAQ,KACpD,CAACF,KAAW,CAAC,OAAO,QAAQ,EAAE,SAASE,EAAK,QAAQ,EAEhE,GACKC,IAAaF,EACd,OAAO,CAAAC,MAAQA,EAAK,kBAAkB,MAAM,EAC5C,IAAI,CAAAE,MAAQF,EAAK,YAAY,SAASA,EAAK,YAAY,KAAK,GAC3DG,IAAcJ,EACf,OAAO,CAAAC,MAAQA,EAAK,kBAAkB,OAAO,EAC7C,IAAI,CAAAE,MAAQF,EAAK,YAAY,SAASA,EAAK,YAAY,KAAK,GAC3DI,IAAYL,EACb,OAAO,CAAAC,MAAQA,EAAK,kBAAkB,KAAK,EAC3C,IAAI,CAAAE,MAAQF,EAAK,YAAY,SAASA,EAAK,YAAY,KAAK,GAC3DK,IAAeN,EAChB,OAAO,CAAAC,MAAQA,EAAK,kBAAkB,QAAQ,EAC9C,IAAI,CAAAE,MAAQF,EAAK,YAAY,SAASA,EAAK,YAAY,KAAK;AAEjE,SAAO;AAAA,IACH,MAAMX,EAAiBY,CAAU;AAAA,IACjC,OAAOZ,EAAiBc,CAAW;AAAA,IACnC,KAAKd,EAAiBe,CAAS;AAAA,IAC/B,QAAQf,EAAiBgB,CAAY;AAAA,EAAA;AAE7C;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/heatmap/utils/calculateCaptionTails.js

@@ -1,101 +0,0 @@
-import { MIN_STEP_FOR_VISIBLE_LABELS as I } from "../constants.js";
-const d = Math.cos(Math.PI / 4);
-function E(e, M, x, c, p, i, s, B, K, T) {
-  const l = i[e], b = l > I;
-  let u = 0;
-  return M.forEach((y) => {
-    const a = p(e, y);
-    if (a.length === 0)
-      return 0;
-    const o = a.length * l / 2, r = B ? T.getTextWidth(x[y] ?? y) * d - o - s(a[0]) : 0, L = K && b ? a.reduce((f, h) => {
-      const G = c[h];
-      return Math.max(f, T.getTextWidth(G) * d - l / 2 - s(h));
-    }, 0) : 0;
-    u = Math.max(u, r, L);
-  }), u;
-}
-function g(e, M, x, c, p, i) {
-  const { facetKeys: s, xGroupKeys: B, yGroupKeys: K, xKeysByGroups: T, yKeysByGroups: l, xLabels: b, yLabels: u, xGroupLabels: y, yGroupLabels: a } = p.meta;
-  let o = 0, r = 0;
-  const L = e.xGroupLabels === 45, f = e.xAxisLabels === 45;
-  if (L || f)
-    if (!M.sharedX)
-      s.forEach((t) => {
-        o = Math.max(
-          E(
-            t,
-            B,
-            y,
-            b,
-            (m, n) => p.facets[m].xKeysByGroups[n],
-            c.x,
-            x.x[t],
-            L,
-            f,
-            i
-          ),
-          o
-        );
-      });
-    else {
-      const t = s[0];
-      o = Math.max(
-        E(
-          t,
-          B,
-          y,
-          b,
-          (m, n) => T[n],
-          c.x,
-          x.x[t],
-          L,
-          f,
-          i
-        ),
-        o
-      );
-    }
-  const h = e.yGroupLabels === 45, G = e.yAxisLabels === 45;
-  if (h || G)
-    if (!M.sharedY)
-      s.forEach((t) => {
-        r = Math.max(
-          E(
-            t,
-            K,
-            a,
-            u,
-            (m, n) => p.facets[m].yKeysByGroups[n],
-            c.y,
-            x.y[t],
-            h,
-            G,
-            i
-          ),
-          r
-        );
-      });
-    else {
-      const t = s[0];
-      r = Math.max(
-        E(
-          t,
-          K,
-          a,
-          u,
-          (m, n) => l[n],
-          c.y,
-          x.y[t],
-          h,
-          G,
-          i
-        ),
-        r
-      );
-    }
-  return { xCaptionTail: o, yCaptionTail: r };
-}
-export {
-  g as calculateCaptionTails
-};
-//# sourceMappingURL=calculateCaptionTails.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/heatmap/utils/calculateCaptionTails.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"calculateCaptionTails.js","sources":["../../../../../../../node_modules/@milaboratories/miplots4/src/heatmap/utils/calculateCaptionTails.ts"],"sourcesContent":["import type { TextMeasurer } from '../../utils/TextMeasurer/TextMeasurer';\nimport type { ChartsScales, LabelAngles } from '../components/types';\nimport { MIN_STEP_FOR_VISIBLE_LABELS } from '../constants';\nimport type { GroupedCellsHeatmap } from '../getCells';\nimport type { HeatmapSettingsImpl } from '../HeatmapSettingsImpl';\n\nconst COS_PI_4 = Math.cos(Math.PI / 4);\nfunction getTailByFacetKey (\n    facetKey: string,\n    groupKeys: string[],\n    groupLabels: Record<string, string>,\n    valueLabels: Record<string, string>,\n    getKeysInGroup: (facetKey:string, groupKey:string) => string[],\n    steps: Record<string, number>,\n    scale: (v:string) => number,\n    groupTitleInclined: boolean,\n    labelTitleInclined: boolean,\n    textMeasurer: TextMeasurer\n): number {\n    const step = steps[facetKey];\n    const labelsVisible = step > MIN_STEP_FOR_VISIBLE_LABELS;\n\n    let maxTail = 0;\n    groupKeys.forEach((groupKey) => {\n        const keysInGroup = getKeysInGroup(facetKey, groupKey);\n        if (keysInGroup.length === 0) {\n            return 0;\n        }\n        const groupHalfWidth = (keysInGroup.length * step) / 2;\n        const groupTail = groupTitleInclined\n            ? textMeasurer.getTextWidth(groupLabels[groupKey] ?? groupKey) * COS_PI_4 - groupHalfWidth - scale(keysInGroup[0])\n            : 0;\n        const labelTail = labelTitleInclined && labelsVisible\n            ? keysInGroup.reduce((res, key) => {\n                const label = valueLabels[key];\n                return Math.max(res, textMeasurer.getTextWidth(label) * COS_PI_4 - step / 2 - scale(key));\n            }, 0)\n            : 0;\n        maxTail = Math.max(maxTail, groupTail, labelTail);\n    });\n    return maxTail;\n}\n\nexport function calculateCaptionTails(\n    labelAngles: LabelAngles,\n    facetSettings: HeatmapSettingsImpl['facetSettings'],\n    scales: ChartsScales,\n    steps: {\n        x: Record<string, number>;\n        y: Record<string, number>;\n    },\n    groupedCells: GroupedCellsHeatmap,\n    textMeasurer: TextMeasurer\n): {xCaptionTail: number; yCaptionTail: number} {\n    const {facetKeys, xGroupKeys, yGroupKeys, xKeysByGroups, yKeysByGroups, xLabels, yLabels, xGroupLabels, yGroupLabels} = groupedCells.meta;\n    let xCaptionTail = 0;\n    let yCaptionTail = 0;\n    // tails from 45deg inclined captions of groups titles/cells labels, that take place on adjacent padding\n    const xGroupTitleInclined = labelAngles.xGroupLabels === 45;\n    const xLabelsInclined = labelAngles.xAxisLabels === 45;\n    if (xGroupTitleInclined || xLabelsInclined) {\n        if (!facetSettings.sharedX) {\n            facetKeys.forEach(facetKey => {\n                xCaptionTail = Math.max(\n                    getTailByFacetKey(\n                        facetKey,\n                        xGroupKeys,\n                        xGroupLabels,\n                        xLabels,\n                        (facetKey:string, groupKey:string) => groupedCells.facets[facetKey].xKeysByGroups[groupKey],\n                        steps.x,\n                        scales.x[facetKey],\n                        xGroupTitleInclined,\n                        xLabelsInclined,\n                        textMeasurer\n                    ),\n                    xCaptionTail\n                );\n            });\n        } else {\n            const facetKey = facetKeys[0]; // there is no difference between facets in this case\n            xCaptionTail = Math.max(\n                getTailByFacetKey(\n                    facetKey,\n                    xGroupKeys,\n                    xGroupLabels,\n                    xLabels,\n                    (facetKey:string, groupKey:string) => xKeysByGroups[groupKey],\n                    steps.x,\n                    scales.x[facetKey],\n                    xGroupTitleInclined,\n                    xLabelsInclined,\n                    textMeasurer\n                ),\n                xCaptionTail\n            );\n        }\n    }\n    const yGroupTitleInclined = labelAngles.yGroupLabels === 45;\n    const yLabelsInclined = labelAngles.yAxisLabels === 45;\n    if (yGroupTitleInclined || yLabelsInclined) {\n        if (!facetSettings.sharedY) {\n            facetKeys.forEach(facetKey => {\n                yCaptionTail = Math.max(\n                    getTailByFacetKey(\n                        facetKey,\n                        yGroupKeys,\n                        yGroupLabels,\n                        yLabels,\n                        (facetKey:string, groupKey:string) => groupedCells.facets[facetKey].yKeysByGroups[groupKey],\n                        steps.y,\n                        scales.y[facetKey],\n                        yGroupTitleInclined,\n                        yLabelsInclined,\n                        textMeasurer\n                    ),\n                    yCaptionTail\n                );\n            });\n        } else {\n            const facetKey = facetKeys[0]; // there is no difference between facets in this case\n            yCaptionTail = Math.max(\n                getTailByFacetKey(\n                    facetKey,\n                    yGroupKeys,\n                    yGroupLabels,\n                    yLabels,\n                    (facetKey:string, groupKey:string) => yKeysByGroups[groupKey],\n                    steps.y,\n                    scales.y[facetKey],\n                    yGroupTitleInclined,\n                    yLabelsInclined,\n                    textMeasurer\n                ),\n                yCaptionTail\n            );\n        }\n    }\n    return {xCaptionTail, yCaptionTail};\n}\n"],"names":["COS_PI_4","getTailByFacetKey","facetKey","groupKeys","groupLabels","valueLabels","getKeysInGroup","steps","scale","groupTitleInclined","labelTitleInclined","textMeasurer","step","labelsVisible","MIN_STEP_FOR_VISIBLE_LABELS","maxTail","groupKey","keysInGroup","groupHalfWidth","groupTail","labelTail","res","key","label","calculateCaptionTails","labelAngles","facetSettings","scales","groupedCells","facetKeys","xGroupKeys","yGroupKeys","xKeysByGroups","yKeysByGroups","xLabels","yLabels","xGroupLabels","yGroupLabels","xCaptionTail","yCaptionTail","xGroupTitleInclined","xLabelsInclined","yGroupTitleInclined","yLabelsInclined"],"mappings":";AAMA,MAAMA,IAAW,KAAK,IAAI,KAAK,KAAK,CAAC;AACrC,SAASC,EACLC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACM;AACN,QAAMC,IAAOL,EAAML,CAAQ,GACrBW,IAAgBD,IAAOE;AAE7B,MAAIC,IAAU;AACd,SAAAZ,EAAU,QAAQ,CAACa,MAAa;AAC5B,UAAMC,IAAcX,EAAeJ,GAAUc,CAAQ;AACrD,QAAIC,EAAY,WAAW;AACvB,aAAO;AAEX,UAAMC,IAAkBD,EAAY,SAASL,IAAQ,GAC/CO,IAAYV,IACZE,EAAa,aAAaP,EAAYY,CAAQ,KAAKA,CAAQ,IAAIhB,IAAWkB,IAAiBV,EAAMS,EAAY,CAAC,CAAC,IAC/G,GACAG,IAAYV,KAAsBG,IAClCI,EAAY,OAAO,CAACI,GAAKC,MAAQ;AAC/B,YAAMC,IAAQlB,EAAYiB,CAAG;AAC7B,aAAO,KAAK,IAAID,GAAKV,EAAa,aAAaY,CAAK,IAAIvB,IAAWY,IAAO,IAAIJ,EAAMc,CAAG,CAAC;AAAA,IAC5F,GAAG,CAAC,IACF;AACNP,IAAAA,IAAU,KAAK,IAAIA,GAASI,GAAWC,CAAS;AAAA,EACpD,CAAC,GACML;AACX;AAEO,SAASS,EACZC,GACAC,GACAC,GACApB,GAIAqB,GACAjB,GAC4C;AAC5C,QAAM,EAAC,WAAAkB,GAAW,YAAAC,GAAY,YAAAC,GAAY,eAAAC,GAAe,eAAAC,GAAe,SAAAC,GAAS,SAAAC,GAAS,cAAAC,GAAc,cAAAC,MAAgBT,EAAa;AACrI,MAAIU,IAAe,GACfC,IAAe;AAEnB,QAAMC,IAAsBf,EAAY,iBAAiB,IACnDgB,IAAkBhB,EAAY,gBAAgB;AACpD,MAAIe,KAAuBC;AACvB,QAAI,CAACf,EAAc;AACfG,MAAAA,EAAU,QAAQ,CAAA3B,MAAY;AAC1BoC,QAAAA,IAAe,KAAK;AAAA,UAChBrC;AAAAA,YACIC;AAAAA,YACA4B;AAAAA,YACAM;AAAAA,YACAF;AAAAA,YACA,CAAChC,GAAiBc,MAAoBY,EAAa,OAAO1B,CAAQ,EAAE,cAAcc,CAAQ;AAAA,YAC1FT,EAAM;AAAA,YACNoB,EAAO,EAAEzB,CAAQ;AAAA,YACjBsC;AAAAA,YACAC;AAAAA,YACA9B;AAAAA,UAAA;AAAA,UAEJ2B;AAAAA,QAAA;AAAA,MAER,CAAC;AAAA,SACE;AACH,YAAMpC,IAAW2B,EAAU,CAAC;AAC5BS,MAAAA,IAAe,KAAK;AAAA,QAChBrC;AAAAA,UACIC;AAAAA,UACA4B;AAAAA,UACAM;AAAAA,UACAF;AAAAA,UACA,CAAChC,GAAiBc,MAAoBgB,EAAchB,CAAQ;AAAA,UAC5DT,EAAM;AAAA,UACNoB,EAAO,EAAEzB,CAAQ;AAAA,UACjBsC;AAAAA,UACAC;AAAAA,UACA9B;AAAAA,QAAA;AAAA,QAEJ2B;AAAAA,MAAA;AAAA,IAER;AAEJ,QAAMI,IAAsBjB,EAAY,iBAAiB,IACnDkB,IAAkBlB,EAAY,gBAAgB;AACpD,MAAIiB,KAAuBC;AACvB,QAAI,CAACjB,EAAc;AACfG,MAAAA,EAAU,QAAQ,CAAA3B,MAAY;AAC1BqC,QAAAA,IAAe,KAAK;AAAA,UAChBtC;AAAAA,YACIC;AAAAA,YACA6B;AAAAA,YACAM;AAAAA,YACAF;AAAAA,YACA,CAACjC,GAAiBc,MAAoBY,EAAa,OAAO1B,CAAQ,EAAE,cAAcc,CAAQ;AAAA,YAC1FT,EAAM;AAAA,YACNoB,EAAO,EAAEzB,CAAQ;AAAA,YACjBwC;AAAAA,YACAC;AAAAA,YACAhC;AAAAA,UAAA;AAAA,UAEJ4B;AAAAA,QAAA;AAAA,MAER,CAAC;AAAA,SACE;AACH,YAAMrC,IAAW2B,EAAU,CAAC;AAC5BU,MAAAA,IAAe,KAAK;AAAA,QAChBtC;AAAAA,UACIC;AAAAA,UACA6B;AAAAA,UACAM;AAAAA,UACAF;AAAAA,UACA,CAACjC,GAAiBc,MAAoBiB,EAAcjB,CAAQ;AAAA,UAC5DT,EAAM;AAAA,UACNoB,EAAO,EAAEzB,CAAQ;AAAA,UACjBwC;AAAAA,UACAC;AAAAA,UACAhC;AAAAA,QAAA;AAAA,QAEJ4B;AAAAA,MAAA;AAAA,IAER;AAEJ,SAAO,EAAC,cAAAD,GAAc,cAAAC,EAAAA;AAC1B;","x_google_ignoreList":[0]}