@milaboratories/graph-maker 1.1.132 → 1.1.134

package/dist/node_modules/@milaboratories/miplots4/dist/discrete/layers/stats/pValueCalculation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pValueCalculation.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/src/discrete/layers/stats/pValueCalculation.ts"],"sourcesContent":["import anova1 from '@stdlib/stats-anova1';\nimport ttest from '@stdlib/stats-ttest';\nimport ttest2 from '@stdlib/stats-ttest2';\nimport kruskal from '@stdlib/stats-kruskal-test';\nimport wilcoxon from '@stdlib/stats-wilcoxon';\nimport {MannWhitneyU} from './MannWhitneyU';\nimport type {StatTestMethod} from '../../../types';\nimport lodash from 'lodash';\n\nexport function calculatePValue(groups: number[][], testMethod: StatTestMethod, paired: boolean) {\n    switch (testMethod) {\n        case 'ttest': {\n            if (groups.length > 2) {\n                throw new Error('more than 2 datasets passed');\n            }\n            if (paired) {\n                if (groups[0].length !== groups[1].length) {\n                    throw Error('Different size groups in paired test');\n                }\n                return ttest(groups[0], groups[1]).pValue;\n            }\n\n            const res = ttest2(groups[0], groups[1]).pValue;\n            return isNaN(res) ? 1 : res;\n        }\n        case 'anova': {\n            const res = anova1(\n                lodash.flatten(groups),\n                lodash.flatten(groups.map((g, index) => g.map(() => String(index))))\n            ).pValue;\n            return isNaN(res) ? 1 : res;\n        }\n        case 'wilcoxon': {\n            if (groups.length > 2) {\n                throw new Error('more than 2 datasets passed');\n            }\n            if (paired) {\n                if (groups[0].length !== groups[1].length) {\n                    throw Error('Different size groups in paired test');\n                }\n                return wilcoxon(groups[0], groups[1]).pValue;\n            }\n            const res =  new MannWhitneyU().mannWhitneyUTest(groups[0], groups[1]);\n            return isNaN(res) ? 1 : res;\n        }\n        case 'kruskalWallis': {\n            // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n            // @ts-ignore\n            // NB: kruskal test works correct with more than 3 groups, but only 1,2 or 3 groups in its signature\n            const res = kruskal(...groups).pValue;\n            return isNaN(res) ? 1 : res;\n        }\n        default: {\n            throw new Error('Unknown test method');\n        }\n    }\n}\n"],"names":["calculatePValue","groups","testMethod","paired","ttest","res","ttest2","anova1","lodash","g","index","wilcoxon","MannWhitneyU","kruskal"],"mappings":";;;;;;;AASO,SAASA,EAAgBC,GAAoBC,GAA4BC,GAAiB;AAC7F,UAAQD,GAAAA;AAAAA,IACJ,KAAK,SAAS;AACV,UAAID,EAAO,SAAS;AAChB,cAAM,IAAI,MAAM,6BAA6B;AAEjD,UAAIE,GAAQ;AACR,YAAIF,EAAO,CAAC,EAAE,WAAWA,EAAO,CAAC,EAAE;AAC/B,gBAAM,MAAM,sCAAsC;AAEtD,eAAOG,EAAMH,EAAO,CAAC,GAAGA,EAAO,CAAC,CAAC,EAAE;AAAA,MACvC;AAEA,YAAMI,IAAMC,EAAOL,EAAO,CAAC,GAAGA,EAAO,CAAC,CAAC,EAAE;AACzC,aAAO,MAAMI,CAAG,IAAI,IAAIA;AAAAA,IAC5B;AAAA,IACA,KAAK,SAAS;AACV,YAAMA,IAAME;AAAAA,QACRC,EAAO,QAAQP,CAAM;AAAA,QACrBO,EAAO,QAAQP,EAAO,IAAI,CAACQ,GAAGC,MAAUD,EAAE,IAAI,MAAM,OAAOC,CAAK,CAAC,CAAC,CAAC;AAAA,MAAA,EACrE;AACF,aAAO,MAAML,CAAG,IAAI,IAAIA;AAAAA,IAC5B;AAAA,IACA,KAAK,YAAY;AACb,UAAIJ,EAAO,SAAS;AAChB,cAAM,IAAI,MAAM,6BAA6B;AAEjD,UAAIE,GAAQ;AACR,YAAIF,EAAO,CAAC,EAAE,WAAWA,EAAO,CAAC,EAAE;AAC/B,gBAAM,MAAM,sCAAsC;AAEtD,eAAOU,EAASV,EAAO,CAAC,GAAGA,EAAO,CAAC,CAAC,EAAE;AAAA,MAC1C;AACA,YAAMI,IAAO,IAAIO,EAAAA,EAAe,iBAAiBX,EAAO,CAAC,GAAGA,EAAO,CAAC,CAAC;AACrE,aAAO,MAAMI,CAAG,IAAI,IAAIA;AAAAA,IAC5B;AAAA,IACA,KAAK,iBAAiB;AAIlB,YAAMA,IAAMQ,EAAQ,GAAGZ,CAAM,EAAE;AAC/B,aAAO,MAAMI,CAAG,IAAI,IAAIA;AAAAA,IAC5B;AAAA,IACA;AACI,YAAM,IAAI,MAAM,qBAAqB;AAAA,EAAA;AAGjD;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/discrete/layers/stats/pValueCorrection.js

@@ -0,0 +1,191 @@
+import q from "../../../node_modules/lodash/lodash.js";
+function E(r, e) {
+  let t;
+  if (r == e) {
+    t = new Array(e + 1);
+    for (let n = 0; n < t.length; ++n)
+      t[n] = n + 1;
+  } else if (r < e) {
+    t = new Array(e - r + 1);
+    for (let n = 0; n < t.length; ++n)
+      t[n] = r + n;
+  } else {
+    t = new Array(r - e + 1);
+    for (let n = 0; n < t.length; ++n)
+      t[n] = r - n;
+  }
+  return t;
+}
+function c(r, e) {
+  return q.orderBy(
+    r.map((t, n) => [t, n]),
+    ([t]) => t,
+    [e ? "desc" : "asc"]
+  ).map(([, t]) => t);
+}
+function B(r) {
+  if (r.length < 1)
+    throw new Error("cummin requires at least one element");
+  const e = new Array(r.length);
+  let t = r[0];
+  for (let n = 0; n < r.length; ++n)
+    r[n] < t && (t = r[n]), e[n] = t;
+  return e;
+}
+function H(r) {
+  if (r.length < 1)
+    throw new Error("cummax requires at least one element");
+  const e = new Array(r.length);
+  let t = r[0];
+  for (let n = 0; n < r.length; ++n)
+    r[n] > t && (t = r[n]), e[n] = t;
+  return e;
+}
+function j(r, e) {
+  if (r.length < 1)
+    throw new Error("pmin requires at least one element");
+  return r.map((t) => Math.min(t, e));
+}
+function M(r) {
+  if (r.length < 1)
+    throw new Error("pAdjust requires at least one element");
+  return Math.min(...r);
+}
+function k(r) {
+  const e = r.length;
+  if (e < 1)
+    throw new Error("pAdjust requires at least one element");
+  const t = new Array(e);
+  for (let n = 0; n < e; ++n) {
+    const o = r[n] * e;
+    if (o >= 1)
+      t[n] = 1;
+    else if (0 <= o)
+      t[n] = o;
+    else
+      throw new Error(`${o} is outside [0, 1)`);
+  }
+  return t;
+}
+function x(r) {
+  const e = r.length;
+  if (e < 1)
+    throw new Error("pAdjust requires at least one element");
+  const t = c(r, !1), n = t.slice(), o = new Array(e).fill(0);
+  for (let a = 0; a < e; ++a)
+    o[a] = (e - a) * r[t[a]];
+  const s = c(n, !1), m = H(o), u = j(m, 1), f = new Array(e);
+  for (let a = 0; a < e; ++a)
+    f[a] = u[s[a]];
+  return f;
+}
+function $(r) {
+  const e = r.length;
+  if (e < 1)
+    throw new Error("pAdjust requires at least one element");
+  const t = E(e, e), n = c(r, !1), o = new Array(e);
+  for (let i = 0; i < e; ++i)
+    o[i] = r[n[i]];
+  const s = n.slice(), m = c(s, !1), u = new Array(e), f = new Array(e), a = new Array(e);
+  for (let i = 0; i < e; ++i)
+    a[i] = o[i] * e / t[i];
+  const p = M(a);
+  u.fill(p), f.fill(p);
+  for (let i = e; i >= 2; --i) {
+    const A = E(1, e - i + 1);
+    for (let l = 0; l < e - i + 1; ++l)
+      A[l]--;
+    const w = i - 1, h = new Array(w);
+    for (let l = 0; l < w; ++l)
+      h[l] = e - i + 2 + l - 1;
+    let g = i * o[h[0]] / 2;
+    for (let l = 1; l < w; ++l) {
+      const d = o[h[l]] * i / (2 + l);
+      d < g && (g = d);
+    }
+    for (let l = 0; l < e - i + 1; ++l)
+      u[A[l]] = Math.min(o[A[l]] * i, g);
+    for (let l = 0; l < w; ++l)
+      u[h[l]] = u[e - i];
+    for (let l = 0; l < e; ++l)
+      f[l] < u[l] && (f[l] = u[l]);
+  }
+  for (let i = 0; i < e; ++i)
+    u[i] = f[m[i]];
+  return u;
+}
+class b {
+  constructor(e, t, n) {
+    this.ni = e, this.o = t, this.ro = n;
+  }
+  result(e) {
+    const t = B(e), n = j(t, 1), o = new Array(e.length);
+    for (let s = 0; s < e.length; ++s)
+      o[s] = n[this.ro[s]];
+    return o;
+  }
+}
+function y(r) {
+  const e = r.length, t = new Array(e), n = c(r, !0);
+  for (let s = 0; s < e; ++s) {
+    if (r[s] < 0 || r[s] > 1)
+      throw new Error("array[" + s + "] = " + r[s] + " is outside [0, 1]");
+    t[s] = e / (e - s);
+  }
+  const o = c(n, !1);
+  return new b(t, n, o);
+}
+function v(r) {
+  const e = r.length;
+  if (e < 1)
+    throw new Error("pAdjust requires at least one element");
+  const t = y(r), n = new Array(e);
+  for (let o = 0; o < e; ++o)
+    n[o] = t.ni[o] * r[t.o[o]];
+  return t.result(n);
+}
+function z(r) {
+  const e = r.length;
+  if (e < 1)
+    throw new Error("pAdjust requires at least one element");
+  const t = y(r), n = new Array(e);
+  let o = 0;
+  for (let s = 1; s < e + 1; ++s)
+    o += 1 / s;
+  for (let s = 0; s < e; ++s)
+    n[s] = o * t.ni[s] * r[t.o[s]];
+  return t.result(n);
+}
+function D(r) {
+  const e = r.length;
+  if (e < 1)
+    throw new Error("pAdjust requires at least one element");
+  const t = y(r), n = new Array(e);
+  for (let o = 0; o < e; ++o)
+    n[o] = (o + 1) * r[t.o[o]];
+  return t.result(n);
+}
+function L(r, e) {
+  switch (e) {
+    case "BenjaminiHochberg":
+      return v(r);
+    case "BenjaminiYekutieli":
+      return z(r);
+    case "Bonferroni":
+      return k(r);
+    case "Hochberg":
+      return D(r);
+    case "Holm":
+      return x(r);
+    case "Hommel":
+      return $(r);
+    case null:
+      return r;
+    default:
+      throw new Error(`Unknown p-value correction method: ${e}`);
+  }
+}
+export {
+  L as adjustPValues
+};
+//# sourceMappingURL=pValueCorrection.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/discrete/layers/stats/pValueCorrection.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pValueCorrection.js","sources":["../../../../../../../../node_modules/@milaboratories/miplots4/src/discrete/layers/stats/pValueCorrection.ts"],"sourcesContent":["import type {PValueCorrectionMethod} from '../../../types';\nimport lodash from 'lodash';\n\n// calculations from https://github.com/milaboratory/miplots/blob/559b13065f17dfc7c4dd332247dd1ce0183affcc/src/main/java/com/milaboratory/miplots/stat/util/PValueCorrection.java#L43\nfunction seqLen(start:number, end:number) {\n    let result:number[];\n    if (start == end) {\n        result = new Array(end + 1);\n        for (let i = 0; i < result.length; ++i) {\n            result[i] = i + 1;\n        }\n    } else if (start < end) {\n        result = new Array(end - start + 1);\n        for (let i = 0; i < result.length; ++i) {\n            result[i] = start + i;\n        }\n    } else {\n        result = new Array(start - end + 1);\n        for (let i = 0; i < result.length; ++i) {\n            result[i] = start - i;\n        }\n    }\n    return result;\n}\n\nfunction order(array:number[], decreasing:boolean):number[] {\n    return lodash.orderBy(\n        array.map((value, index) => [value, index]),\n        ([value]) => value,\n        [decreasing ? 'desc' : 'asc']\n    ).map(([, index]) => index);\n}\n\nfunction cummin(array:number[]):number[] {\n    if (array.length < 1)\n        throw new Error('cummin requires at least one element');\n    const output = new Array(array.length);\n    let cumulativeMin = array[0];\n    for (let i = 0; i < array.length; ++i) {\n        if (array[i] < cumulativeMin)\n            cumulativeMin = array[i];\n        output[i] = cumulativeMin;\n    }\n    return output;\n}\n\nfunction cummax(array:number[]):number[] {\n    if (array.length < 1) {\n        throw new Error('cummax requires at least one element');\n    }\n    const output = new Array(array.length);\n    let cumulativeMax = array[0];\n    for (let i = 0; i < array.length; ++i) {\n        if (array[i] > cumulativeMax)\n            cumulativeMax = array[i];\n        output[i] = cumulativeMax;\n    }\n    return output;\n}\n\nfunction pminx(array:number[], x:number):number[] {\n    if (array.length < 1) {\n        throw new Error('pmin requires at least one element');\n    }\n    return array.map((el) => Math.min(el, x));\n}\n\nfunction doubleArrayMin(array:number[]):number {\n    if (array.length < 1)\n        throw new Error('pAdjust requires at least one element');\n    return Math.min(...array);\n}\n\nfunction Bonferoni(pvalues:number[]):number[] {\n    const size = pvalues.length;\n    if (size < 1)\n        throw new Error('pAdjust requires at least one element');\n\n    const result:number[] = new Array(size);\n    for (let i = 0; i < size; ++i) {\n        const b = pvalues[i] * size;\n        if (b >= 1) {\n            result[i] = 1;\n        } else if (0 <= b) {\n            result[i] = b;\n        } else {\n            throw new Error(`${b} is outside [0, 1)`);\n        }\n    }\n    return result;\n}\n\nfunction Holm(pvalues:number[]):number[] {\n    const size = pvalues.length;\n    if (size < 1)\n        throw new Error('pAdjust requires at least one element');\n\n    const o = order(pvalues, false);\n    const o2Double = o.slice();\n    const cummaxInput = new Array(size).fill(0);\n    for (let i = 0; i < size; ++i) {\n        cummaxInput[i] = (size - i) * pvalues[o[i]];\n    }\n    const ro = order(o2Double, false);\n    const cummaxOutput = cummax(cummaxInput);\n    const pmin = pminx(cummaxOutput, 1.0);\n    const result = new Array(size);\n    for (let i = 0; i < size; ++i) {\n        result[i] = pmin[ro[i]];\n    }\n    return result;\n}\n\nfunction Hommel(pvalues:number[]):number[] {\n    const size = pvalues.length;\n    if (size < 1)\n        throw new Error('pAdjust requires at least one element');\n    const indices = seqLen(size, size);\n    const o = order(pvalues, false);\n    const p = new Array(size);\n    for (let i = 0; i < size; ++i) {\n        p[i] = pvalues[o[i]];\n    }\n    const o2Double = o.slice();\n    const ro = order(o2Double, false);\n    const q = new Array(size);\n    const pa = new Array(size);\n    const npi = new Array(size);\n    for (let i = 0; i < size; ++i) {\n        npi[i] = p[i] * size / indices[i];\n    }\n    const min = doubleArrayMin(npi);\n    q.fill(min);\n    pa.fill(min);\n    for (let j = size; j >= 2; --j) {\n        const ij = seqLen(1, size - j + 1);\n        for (let i = 0; i < size - j + 1; ++i) {\n            ij[i]--;\n        }\n        const i2Length = j - 1;\n        const i2 = new Array(i2Length);\n        for (let i = 0; i < i2Length; ++i) {\n            i2[i] = size - j + 2 + i - 1;\n        }\n        let q1 = j * p[i2[0]] / 2.0;\n        for (let i = 1; i < i2Length; ++i) {\n            const temp_q1 = p[i2[i]] * j / (2.0 + i);\n            if (temp_q1 < q1) {\n                q1 = temp_q1;\n            }\n        }\n        for (let i = 0; i < size - j + 1; ++i) {\n            q[ij[i]] = Math.min(p[ij[i]] * j, q1);\n        }\n        for (let i = 0; i < i2Length; ++i) {\n            q[i2[i]] = q[size - j];\n        }\n        for (let i = 0; i < size; ++i) {\n            if (pa[i] < q[i]) {\n                pa[i] = q[i];\n            }\n        }\n    }\n    for (let i = 0; i < size; ++i) {\n        q[i] = pa[ro[i]];\n    }\n    return q;\n}\n\nclass IntermediateData {\n    constructor(readonly ni: number[], readonly o: number[], readonly ro: number[]) {}\n    result(cumminInput:number[]):number[] {\n        const cumminArray:number[] = cummin(cumminInput);\n        const pmin:number[] = pminx(cumminArray, 1);\n        const result:number[] = new Array(cumminInput.length);\n        for (let i = 0; i < cumminInput.length; ++i) {\n            result[i] = pmin[this.ro[i]];\n        }\n        return result;\n    }\n}\n\nfunction computeIntermediateData(pvalues:number[]) {\n    const size = pvalues.length;\n    const ni = new Array(size);\n    const o = order(pvalues, true);\n    for (let i = 0; i < size; ++i) {\n        if (pvalues[i] < 0 || pvalues[i] > 1) {\n            throw new Error('array[' + i + '] = ' + pvalues[i] + ' is outside [0, 1]');\n        }\n        ni[i] = size / (size - i);\n    }\n    const ro = order(o, false);\n    return new IntermediateData(ni, o, ro);\n}\n\nfunction BenjaminiHochberg(pvalues:number[]) {\n    const size = pvalues.length;\n    if (size < 1)\n        throw new Error('pAdjust requires at least one element');\n\n    const data = computeIntermediateData(pvalues);\n    const cumminInput:number[] = new Array(size);\n    for (let i = 0; i < size; ++i) {\n        cumminInput[i] = data.ni[i] * pvalues[data.o[i]];\n    }\n    return data.result(cumminInput);\n}\n\nfunction BenjaminiYekutieli(pvalues:number[]):number[] {\n    const size = pvalues.length;\n    if (size < 1)\n        throw new Error('pAdjust requires at least one element');\n\n    const data:IntermediateData = computeIntermediateData(pvalues);\n    const cumminInput = new Array(size);\n    let q = 0;\n    for (let i = 1; i < size + 1; ++i) {\n        q += 1 / i;\n    }\n    for (let i = 0; i < size; ++i) {\n        cumminInput[i] = q * data.ni[i] * pvalues[data.o[i]];\n    }\n    return data.result(cumminInput);\n}\n\nfunction Hochberg(pvalues:number[]):number[] {\n    const size = pvalues.length;\n    if (size < 1)\n        throw new Error('pAdjust requires at least one element');\n\n    const data:IntermediateData = computeIntermediateData(pvalues);\n    const cumminInput = new Array(size);\n    for (let i = 0; i < size; ++i) {\n        cumminInput[i] = (i + 1) * pvalues[data.o[i]];\n    }\n    return data.result(cumminInput);\n}\n\nexport function adjustPValues(pValues:number[], method:PValueCorrectionMethod | null) {\n    switch (method) {\n        case 'BenjaminiHochberg': {\n            return BenjaminiHochberg(pValues);\n        }\n        case 'BenjaminiYekutieli': {\n            return BenjaminiYekutieli(pValues);\n        }\n        case 'Bonferroni': {\n            return Bonferoni(pValues);\n        }\n        case 'Hochberg': {\n            return Hochberg(pValues);\n        }\n        case 'Holm': {\n            return Holm(pValues);\n        }\n        case 'Hommel': {\n            return Hommel(pValues);\n        }\n        case null: {\n            return pValues;\n        }\n        default:\n            throw new Error(`Unknown p-value correction method: ${method}`);\n    }\n}\n"],"names":["seqLen","start","end","result","i","order","array","decreasing","lodash","value","index","cummin","output","cumulativeMin","cummax","cumulativeMax","pminx","x","el","doubleArrayMin","Bonferoni","pvalues","size","b","Holm","o","o2Double","cummaxInput","ro","cummaxOutput","pmin","Hommel","indices","p","q","pa","npi","min","j","ij","i2Length","i2","q1","temp_q1","IntermediateData","ni","cumminInput","cumminArray","computeIntermediateData","BenjaminiHochberg","data","BenjaminiYekutieli","Hochberg","adjustPValues","pValues","method"],"mappings":";AAIA,SAASA,EAAOC,GAAcC,GAAY;AACtC,MAAIC;AACJ,MAAIF,KAASC,GAAK;AACdC,IAAAA,IAAS,IAAI,MAAMD,IAAM,CAAC;AAC1B,aAASE,IAAI,GAAGA,IAAID,EAAO,QAAQ,EAAEC;AACjCD,MAAAA,EAAOC,CAAC,IAAIA,IAAI;AAAA,EAExB,WAAWH,IAAQC,GAAK;AACpBC,IAAAA,IAAS,IAAI,MAAMD,IAAMD,IAAQ,CAAC;AAClC,aAASG,IAAI,GAAGA,IAAID,EAAO,QAAQ,EAAEC;AACjCD,MAAAA,EAAOC,CAAC,IAAIH,IAAQG;AAAAA,EAE5B,OAAO;AACHD,IAAAA,IAAS,IAAI,MAAMF,IAAQC,IAAM,CAAC;AAClC,aAASE,IAAI,GAAGA,IAAID,EAAO,QAAQ,EAAEC;AACjCD,MAAAA,EAAOC,CAAC,IAAIH,IAAQG;AAAAA,EAE5B;AACA,SAAOD;AACX;AAEA,SAASE,EAAMC,GAAgBC,GAA6B;AACxD,SAAOC,EAAO;AAAA,IACVF,EAAM,IAAI,CAACG,GAAOC,MAAU,CAACD,GAAOC,CAAK,CAAC;AAAA,IAC1C,CAAC,CAACD,CAAK,MAAMA;AAAAA,IACb,CAACF,IAAa,SAAS,KAAK;AAAA,EAAA,EAC9B,IAAI,CAAC,GAAGG,CAAK,MAAMA,CAAK;AAC9B;AAEA,SAASC,EAAOL,GAAyB;AACrC,MAAIA,EAAM,SAAS;AACf,UAAM,IAAI,MAAM,sCAAsC;AAC1D,QAAMM,IAAS,IAAI,MAAMN,EAAM,MAAM;AACrC,MAAIO,IAAgBP,EAAM,CAAC;AAC3B,WAASF,IAAI,GAAGA,IAAIE,EAAM,QAAQ,EAAEF;AAC5BE,IAAAA,EAAMF,CAAC,IAAIS,MACXA,IAAgBP,EAAMF,CAAC,IAC3BQ,EAAOR,CAAC,IAAIS;AAEhB,SAAOD;AACX;AAEA,SAASE,EAAOR,GAAyB;AACrC,MAAIA,EAAM,SAAS;AACf,UAAM,IAAI,MAAM,sCAAsC;AAE1D,QAAMM,IAAS,IAAI,MAAMN,EAAM,MAAM;AACrC,MAAIS,IAAgBT,EAAM,CAAC;AAC3B,WAASF,IAAI,GAAGA,IAAIE,EAAM,QAAQ,EAAEF;AAC5BE,IAAAA,EAAMF,CAAC,IAAIW,MACXA,IAAgBT,EAAMF,CAAC,IAC3BQ,EAAOR,CAAC,IAAIW;AAEhB,SAAOH;AACX;AAEA,SAASI,EAAMV,GAAgBW,GAAmB;AAC9C,MAAIX,EAAM,SAAS;AACf,UAAM,IAAI,MAAM,oCAAoC;AAExD,SAAOA,EAAM,IAAI,CAACY,MAAO,KAAK,IAAIA,GAAID,CAAC,CAAC;AAC5C;AAEA,SAASE,EAAeb,GAAuB;AAC3C,MAAIA,EAAM,SAAS;AACf,UAAM,IAAI,MAAM,uCAAuC;AAC3D,SAAO,KAAK,IAAI,GAAGA,CAAK;AAC5B;AAEA,SAASc,EAAUC,GAA2B;AAC1C,QAAMC,IAAOD,EAAQ;AACrB,MAAIC,IAAO;AACP,UAAM,IAAI,MAAM,uCAAuC;AAE3D,QAAMnB,IAAkB,IAAI,MAAMmB,CAAI;AACtC,WAASlB,IAAI,GAAGA,IAAIkB,GAAM,EAAElB,GAAG;AAC3B,UAAMmB,IAAIF,EAAQjB,CAAC,IAAIkB;AACvB,QAAIC,KAAK;AACLpB,MAAAA,EAAOC,CAAC,IAAI;AAAA,aACL,KAAKmB;AACZpB,MAAAA,EAAOC,CAAC,IAAImB;AAAAA;AAEZ,YAAM,IAAI,MAAM,GAAGA,CAAC,oBAAoB;AAAA,EAEhD;AACA,SAAOpB;AACX;AAEA,SAASqB,EAAKH,GAA2B;AACrC,QAAMC,IAAOD,EAAQ;AACrB,MAAIC,IAAO;AACP,UAAM,IAAI,MAAM,uCAAuC;AAE3D,QAAMG,IAAIpB,EAAMgB,GAAS,EAAK,GACxBK,IAAWD,EAAE,MAAA,GACbE,IAAc,IAAI,MAAML,CAAI,EAAE,KAAK,CAAC;AAC1C,WAASlB,IAAI,GAAGA,IAAIkB,GAAM,EAAElB;AACxBuB,MAAYvB,CAAC,KAAKkB,IAAOlB,KAAKiB,EAAQI,EAAErB,CAAC,CAAC;AAE9C,QAAMwB,IAAKvB,EAAMqB,GAAU,EAAK,GAC1BG,IAAef,EAAOa,CAAW,GACjCG,IAAOd,EAAMa,GAAc,CAAG,GAC9B1B,IAAS,IAAI,MAAMmB,CAAI;AAC7B,WAASlB,IAAI,GAAGA,IAAIkB,GAAM,EAAElB;AACxBD,MAAOC,CAAC,IAAI0B,EAAKF,EAAGxB,CAAC,CAAC;AAE1B,SAAOD;AACX;AAEA,SAAS4B,EAAOV,GAA2B;AACvC,QAAMC,IAAOD,EAAQ;AACrB,MAAIC,IAAO;AACP,UAAM,IAAI,MAAM,uCAAuC;AAC3D,QAAMU,IAAUhC,EAAOsB,GAAMA,CAAI,GAC3BG,IAAIpB,EAAMgB,GAAS,EAAK,GACxBY,IAAI,IAAI,MAAMX,CAAI;AACxB,WAASlB,IAAI,GAAGA,IAAIkB,GAAM,EAAElB;AACxB6B,MAAE7B,CAAC,IAAIiB,EAAQI,EAAErB,CAAC,CAAC;AAEvB,QAAMsB,IAAWD,EAAE,MAAA,GACbG,IAAKvB,EAAMqB,GAAU,EAAK,GAC1BQ,IAAI,IAAI,MAAMZ,CAAI,GAClBa,IAAK,IAAI,MAAMb,CAAI,GACnBc,IAAM,IAAI,MAAMd,CAAI;AAC1B,WAASlB,IAAI,GAAGA,IAAIkB,GAAM,EAAElB;AACxBgC,IAAAA,EAAIhC,CAAC,IAAI6B,EAAE7B,CAAC,IAAIkB,IAAOU,EAAQ5B,CAAC;AAEpC,QAAMiC,IAAMlB,EAAeiB,CAAG;AAC9BF,IAAE,KAAKG,CAAG,GACVF,EAAG,KAAKE,CAAG;AACX,WAASC,IAAIhB,GAAMgB,KAAK,GAAG,EAAEA,GAAG;AAC5B,UAAMC,IAAKvC,EAAO,GAAGsB,IAAOgB,IAAI,CAAC;AACjC,aAASlC,IAAI,GAAGA,IAAIkB,IAAOgB,IAAI,GAAG,EAAElC;AAChCmC,QAAGnC,CAAC;AAER,UAAMoC,IAAWF,IAAI,GACfG,IAAK,IAAI,MAAMD,CAAQ;AAC7B,aAASpC,IAAI,GAAGA,IAAIoC,GAAU,EAAEpC;AAC5BqC,MAAAA,EAAGrC,CAAC,IAAIkB,IAAOgB,IAAI,IAAIlC,IAAI;AAE/B,QAAIsC,IAAKJ,IAAIL,EAAEQ,EAAG,CAAC,CAAC,IAAI;AACxB,aAASrC,IAAI,GAAGA,IAAIoC,GAAU,EAAEpC,GAAG;AAC/B,YAAMuC,IAAUV,EAAEQ,EAAGrC,CAAC,CAAC,IAAIkC,KAAK,IAAMlC;AAClCuC,MAAAA,IAAUD,MACVA,IAAKC;AAAAA,IAEb;AACA,aAASvC,IAAI,GAAGA,IAAIkB,IAAOgB,IAAI,GAAG,EAAElC;AAChC8B,QAAEK,EAAGnC,CAAC,CAAC,IAAI,KAAK,IAAI6B,EAAEM,EAAGnC,CAAC,CAAC,IAAIkC,GAAGI,CAAE;AAExC,aAAStC,IAAI,GAAGA,IAAIoC,GAAU,EAAEpC;AAC5B8B,QAAEO,EAAGrC,CAAC,CAAC,IAAI8B,EAAEZ,IAAOgB,CAAC;AAEzB,aAASlC,IAAI,GAAGA,IAAIkB,GAAM,EAAElB;AACpB+B,QAAG/B,CAAC,IAAI8B,EAAE9B,CAAC,MACX+B,EAAG/B,CAAC,IAAI8B,EAAE9B,CAAC;AAAA,EAGvB;AACA,WAASA,IAAI,GAAGA,IAAIkB,GAAM,EAAElB;AACxB8B,MAAE9B,CAAC,IAAI+B,EAAGP,EAAGxB,CAAC,CAAC;AAEnB,SAAO8B;AACX;AAEA,MAAMU,EAAiB;AAAA,EACnB,YAAqBC,GAAuBpB,GAAsBG,GAAc;AAA3D,SAAA,KAAAiB,GAAuB,KAAA,IAAApB,GAAsB,KAAA,KAAAG;AAAAA,EAAe;AAAA,EACjF,OAAOkB,GAA+B;AAClC,UAAMC,IAAuBpC,EAAOmC,CAAW,GACzChB,IAAgBd,EAAM+B,GAAa,CAAC,GACpC5C,IAAkB,IAAI,MAAM2C,EAAY,MAAM;AACpD,aAAS1C,IAAI,GAAGA,IAAI0C,EAAY,QAAQ,EAAE1C;AACtCD,QAAOC,CAAC,IAAI0B,EAAK,KAAK,GAAG1B,CAAC,CAAC;AAE/B,WAAOD;AAAAA,EACX;AACJ;AAEA,SAAS6C,EAAwB3B,GAAkB;AAC/C,QAAMC,IAAOD,EAAQ,QACfwB,IAAK,IAAI,MAAMvB,CAAI,GACnBG,IAAIpB,EAAMgB,GAAS,EAAI;AAC7B,WAASjB,IAAI,GAAGA,IAAIkB,GAAM,EAAElB,GAAG;AAC3B,QAAIiB,EAAQjB,CAAC,IAAI,KAAKiB,EAAQjB,CAAC,IAAI;AAC/B,YAAM,IAAI,MAAM,WAAWA,IAAI,SAASiB,EAAQjB,CAAC,IAAI,oBAAoB;AAE7EyC,IAAAA,EAAGzC,CAAC,IAAIkB,KAAQA,IAAOlB;AAAAA,EAC3B;AACA,QAAMwB,IAAKvB,EAAMoB,GAAG,EAAK;AACzB,SAAO,IAAImB,EAAiBC,GAAIpB,GAAGG,CAAE;AACzC;AAEA,SAASqB,EAAkB5B,GAAkB;AACzC,QAAMC,IAAOD,EAAQ;AACrB,MAAIC,IAAO;AACP,UAAM,IAAI,MAAM,uCAAuC;AAE3D,QAAM4B,IAAOF,EAAwB3B,CAAO,GACtCyB,IAAuB,IAAI,MAAMxB,CAAI;AAC3C,WAASlB,IAAI,GAAGA,IAAIkB,GAAM,EAAElB;AACxB0C,MAAY1C,CAAC,IAAI8C,EAAK,GAAG9C,CAAC,IAAIiB,EAAQ6B,EAAK,EAAE9C,CAAC,CAAC;AAEnD,SAAO8C,EAAK,OAAOJ,CAAW;AAClC;AAEA,SAASK,EAAmB9B,GAA2B;AACnD,QAAMC,IAAOD,EAAQ;AACrB,MAAIC,IAAO;AACP,UAAM,IAAI,MAAM,uCAAuC;AAE3D,QAAM4B,IAAwBF,EAAwB3B,CAAO,GACvDyB,IAAc,IAAI,MAAMxB,CAAI;AAClC,MAAIY,IAAI;AACR,WAAS9B,IAAI,GAAGA,IAAIkB,IAAO,GAAG,EAAElB;AAC5B8B,SAAK,IAAI9B;AAEb,WAASA,IAAI,GAAGA,IAAIkB,GAAM,EAAElB;AACxB0C,MAAY1C,CAAC,IAAI8B,IAAIgB,EAAK,GAAG9C,CAAC,IAAIiB,EAAQ6B,EAAK,EAAE9C,CAAC,CAAC;AAEvD,SAAO8C,EAAK,OAAOJ,CAAW;AAClC;AAEA,SAASM,EAAS/B,GAA2B;AACzC,QAAMC,IAAOD,EAAQ;AACrB,MAAIC,IAAO;AACP,UAAM,IAAI,MAAM,uCAAuC;AAE3D,QAAM4B,IAAwBF,EAAwB3B,CAAO,GACvDyB,IAAc,IAAI,MAAMxB,CAAI;AAClC,WAASlB,IAAI,GAAGA,IAAIkB,GAAM,EAAElB;AACxB0C,MAAY1C,CAAC,KAAKA,IAAI,KAAKiB,EAAQ6B,EAAK,EAAE9C,CAAC,CAAC;AAEhD,SAAO8C,EAAK,OAAOJ,CAAW;AAClC;AAEO,SAASO,EAAcC,GAAkBC,GAAsC;AAClF,UAAQA,GAAAA;AAAAA,IACJ,KAAK;AACD,aAAON,EAAkBK,CAAO;AAAA,IAEpC,KAAK;AACD,aAAOH,EAAmBG,CAAO;AAAA,IAErC,KAAK;AACD,aAAOlC,EAAUkC,CAAO;AAAA,IAE5B,KAAK;AACD,aAAOF,EAASE,CAAO;AAAA,IAE3B,KAAK;AACD,aAAO9B,EAAK8B,CAAO;AAAA,IAEvB,KAAK;AACD,aAAOvB,EAAOuB,CAAO;AAAA,IAEzB,KAAK;AACD,aAAOA;AAAAA,IAEX;AACI,YAAM,IAAI,MAAM,sCAAsCC,CAAM,EAAE;AAAA,EAAA;AAE1E;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/discrete/layers/violins.js

@@ -0,0 +1,89 @@
+import { getFacetStringKey as _ } from "../utils/getFacetStringKey.js";
+import { quantileSorted as S } from "../../node_modules/d3-array/src/quantile.js";
+import $ from "../../node_modules/d3-scale/src/linear.js";
+import B from "../../node_modules/d3-array/src/max.js";
+import A from "../../node_modules/d3-shape/src/area.js";
+import D from "../../node_modules/d3-shape/src/curve/basis.js";
+import C from "../../node_modules/d3-shape/src/line.js";
+import j from "../../node_modules/d3-array/src/mean.js";
+var I = Object.defineProperty, O = (r, n, i) => n in r ? I(r, n, { enumerable: !0, configurable: !0, writable: !0, value: i }) : r[n] = i, l = (r, n, i) => O(r, typeof n != "symbol" ? n + "" : n, i);
+const L = 40;
+function z(r, n) {
+  return function(i) {
+    return n.map(function(m) {
+      return [m, j(i, (o) => r(m - o))];
+    });
+  };
+}
+function F(r) {
+  return function(n) {
+    return 1 / Math.sqrt(2 * Math.PI) * Math.pow(Math.E, -0.5 * Math.pow(n / r, 2));
+  };
+}
+function K(r) {
+  const n = j(r);
+  return j(r.map((i) => Math.pow(i - n, 2)));
+}
+function N(r) {
+  return Math.sqrt(K(r));
+}
+function R(r, n, i) {
+  const m = (i - n) / 1.34, o = N(r);
+  return 1.06 * Math.min(o, m) * Math.pow(r.length, -1 / 5);
+}
+class X {
+  constructor(n, i, m, o, y, d) {
+    if (l(this, "getArea"), l(this, "getLine"), l(this, "maxDensity"), l(this, "primaryGrouping"), l(this, "secondaryGrouping"), l(this, "key"), l(this, "boundsY"), l(this, "quartiles"), n.length === 0)
+      throw Error("Unable to calculate violin on empty data");
+    if (o !== "auto" && o < 1)
+      throw Error(`Unable to calculate violin with ${o} steps`);
+    this.primaryGrouping = String(y), this.secondaryGrouping = String(d), this.key = `violin_${this.primaryGrouping}_${this.secondaryGrouping}`;
+    const x = (e) => i === "log" ? Math.log10(e) : e, u = (e) => i === "log" ? Math.pow(10, e) : e, a = n.filter((e) => i === "log" && Number(e) === 0 ? (console.warn("Value = 0 on chart with log scale, it was removed from calculation"), !1) : !0).map(x).sort((e, s) => e - s), p = a[0], g = a[a.length - 1], v = g - p, b = S(a, 0.25), c = S(a, 0.5), k = S(a, 0.75);
+    this.quartiles = { q1: u(b), q2: u(c), q3: u(k) };
+    const w = R(a, b, k), P = o !== "auto" ? o : w / 3 > v / L ? L : v / (w / 3), U = m ? p : p - 3 * w, V = m ? g : g + 3 * w, Y = $().domain([U, V]).ticks(P);
+    this.boundsY = {
+      min: u(Y[0]),
+      max: u(Y[Y.length - 1])
+    };
+    const M = z(F(w), Y)(a).map(([e, s]) => [u(e), s]);
+    this.maxDensity = B(M, ([, e]) => e), this.getArea = (e, s, G, E) => {
+      const f = e === "vertical", q = E ?? this.maxDensity, h = $().domain([-q, q]).range([-G / 2, G / 2]);
+      return f ? A().curve(D).x0((t) => h(t[1])).x1((t) => h(-t[1])).y((t) => s(t[0]))(M) : A().curve(D).y0((t) => h(t[1])).y1((t) => h(-t[1])).x((t) => s(t[0]))(M);
+    }, this.getLine = (e, s, G, E) => {
+      const f = e === "vertical", q = E ?? this.maxDensity, h = $().domain([-q, q]).range([-G / 2, G / 2]);
+      return C().curve(D).x(f ? (t) => h(t[1]) : (t) => s(t[0])).y(f ? (t) => s(t[0]) : (t) => h(t[1]))(M) + " " + C().curve(D).x(f ? (t) => h(-t[1]) : (t) => s(t[0])).y(f ? (t) => s(t[0]) : (t) => h(-t[1]))(M);
+    };
+  }
+}
+function nt(r, n, i, m, o) {
+  let y = 0, d = 1 / 0, x = -1 / 0;
+  return {
+    type: "violin",
+    geoms: n.facet.reduce((u, a) => {
+      const p = _(a);
+      return u[p] = [], n.primary.forEach((g) => {
+        n.secondary.forEach((v) => {
+          const b = i.getColumnByGrouping([...a, g, v], m.value);
+          if (!b.length)
+            return;
+          const c = new X(
+            b,
+            o.scale,
+            r.stat.trim,
+            r.stat.stepsCount,
+            g,
+            v
+          );
+          c.maxDensity > y && (y = c.maxDensity), c.boundsY.min < d && (d = c.boundsY.min), c.boundsY.max > x && (x = c.boundsY.max), u[p].push(c);
+        });
+      }), u;
+    }, {}),
+    meta: { maxDensity: y, minY: d, maxY: x },
+    aes: r.aes
+  };
+}
+export {
+  X as Violin,
+  nt as getViolinsData
+};
+//# sourceMappingURL=violins.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/discrete/layers/violins.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"violins.js","sources":["../../../../../../../node_modules/@milaboratories/miplots4/src/discrete/layers/violins.ts"],"sourcesContent":["import type {GroupKey, NO_GROUPED} from '../../DataFrame';\nimport type {DataFrame} from '../../DataFrame';\nimport type {DiscreteSettingsImpl, ViolinLayer} from '../DiscreteSettingsImpl';\nimport type {ViolinsData} from './types';\nimport {getFacetStringKey} from '../utils/getFacetStringKey';\nimport type {DataValue, Orientation} from '../../types';\nimport {max, mean, quantileSorted} from 'd3-array';\nimport {scaleLinear} from 'd3-scale';\nimport {area, curveBasis, line} from 'd3-shape';\n\nconst DEFAULT_STEPS_COUNT = 40;\n\nfunction kernelDensityEstimator(kernel: (v: number) => number, thresholds: number[]) {\n    return function (arr: number[]) {\n        return thresholds.map(function (x) {\n            return [x, mean(arr, v => kernel(x - v))] as [number, number];\n        });\n    };\n}\n\nfunction kernelGaussian(bandwidth: number) {\n    return function (v: number) {\n        return (1 / Math.sqrt(2 * Math.PI)) * Math.pow(Math.E, -0.5 * Math.pow(v / bandwidth, 2));\n    };\n}\n\nfunction getVariance(arr: number[]) {\n    const vMean = mean(arr) as number;\n\n    return mean(arr.map(v => Math.pow(v - vMean, 2))) as number;\n}\nfunction getStandardDeviation(arr: number[]) {\n    return Math.sqrt(getVariance(arr));\n}\nfunction nrdBandwidth(arr: number[], q1:number, q3:number) {\n    const iqr = q3 - q1;\n    const h = iqr / 1.34;\n    const sigma = getStandardDeviation(arr);\n\n    return 1.06 * Math.min(sigma, h) * Math.pow(arr.length, -1 / 5);\n}\n\nexport class Violin {\n    getArea: (\n        orientation: Orientation,\n        yScale: (v: number) => number,\n        width: number,\n        maxDensity?: number\n    ) => string | null;\n    getLine: (\n        orientation: Orientation,\n        yScale: (v: number) => number,\n        width: number,\n        maxDensity?: number\n    ) => string | null;\n\n    maxDensity: number;\n    primaryGrouping: string;\n    secondaryGrouping: string;\n    key: string;\n\n    boundsY: {\n        min: number;\n        max: number;\n    };\n\n    quartiles: {\n        q1: number,\n        q2: number,\n        q3: number,\n    };\n\n    constructor(\n        values: number[],\n        scale: 'linear' | 'log',\n        trim: boolean,\n        steps: 'auto' | number,\n        primaryGrouping: DataValue | typeof NO_GROUPED,\n        secondaryGrouping: DataValue | typeof NO_GROUPED,\n    ) {\n        if (values.length === 0) {\n            throw Error('Unable to calculate violin on empty data');\n        }\n        if (steps !== 'auto' && steps < 1) {\n            throw Error(`Unable to calculate violin with ${steps} steps`);\n        }\n        this.primaryGrouping = String(primaryGrouping);\n        this.secondaryGrouping = String(secondaryGrouping);\n        this.key = `violin_${this.primaryGrouping}_${this.secondaryGrouping}`;\n\n        const convertToScale = (v: number) => (scale === 'log' ? Math.log10(v) : v);\n        const convertFromScale = (v: number) => (scale === 'log' ? Math.pow(10, v) : v);\n\n        const sortedGroup = values\n            .filter(v => {\n                if (scale === 'log' && Number(v) === 0) {\n                    console.warn('Value = 0 on chart with log scale, it was removed from calculation');\n                    return false;\n                }\n                return true;\n            })\n            .map(convertToScale)\n            .sort((a, b) => a - b);\n        const minV = sortedGroup[0];\n        const maxV = sortedGroup[sortedGroup.length - 1];\n        const xRange = maxV - minV;\n\n        const q1 = quantileSorted(sortedGroup, 0.25) as number;\n        const q2 = quantileSorted(sortedGroup, 0.5) as number;\n        const q3 = quantileSorted(sortedGroup, 0.75) as number;\n        this.quartiles = {q1: convertFromScale(q1), q2: convertFromScale(q2), q3: convertFromScale(q3)};\n\n        const bandwidth = nrdBandwidth(sortedGroup, q1, q3);\n        const stepsCount =\n            steps !== 'auto'\n                ? steps\n                : bandwidth / 3 > xRange / DEFAULT_STEPS_COUNT\n                ? DEFAULT_STEPS_COUNT\n                : xRange / (bandwidth / 3);\n        const minThreshold = trim ? minV : minV - 3 * bandwidth;\n        const maxThreshold = trim ? maxV : maxV + 3 * bandwidth;\n        const thresholds = scaleLinear().domain([minThreshold, maxThreshold]).ticks(stepsCount);\n\n        this.boundsY = {\n            min: convertFromScale(thresholds[0]),\n            max: convertFromScale(thresholds[thresholds.length - 1]),\n        };\n\n        const kde = kernelDensityEstimator(kernelGaussian(bandwidth), thresholds);\n        const density = kde(sortedGroup).map(([x, y]) => [convertFromScale(x), y] as [number, number]);\n\n        this.maxDensity = max(density, ([, v]) => v) as number;\n\n        this.getArea = (\n            orientation: Orientation,\n            yScale: (v: number) => number,\n            width: number,\n            maxDensity?: number\n        ) => {\n            const isVertical = orientation === 'vertical';\n            const maxX = maxDensity ?? this.maxDensity;\n            const xScale = scaleLinear()\n                .domain([-maxX, maxX])\n                .range([-width / 2, width / 2]);\n\n            return isVertical\n                ? area()\n                      .curve(curveBasis)\n                      .x0(d => xScale(d[1]))\n                      .x1(d => xScale(-d[1]))\n                      .y(d => yScale(d[0]))(density)\n                : area()\n                      .curve(curveBasis)\n                      .y0(d => xScale(d[1]))\n                      .y1(d => xScale(-d[1]))\n                      .x(d => yScale(d[0]))(density);\n        };\n        this.getLine = (\n            orientation: Orientation,\n            yScale: (v: number) => number,\n            width: number,\n            maxDensity?: number\n        ) => {\n            const isVertical = orientation === 'vertical';\n            const maxX = maxDensity ?? this.maxDensity;\n            const xScale = scaleLinear()\n                .domain([-maxX, maxX])\n                .range([-width / 2, width / 2]);\n\n            return (\n                line()\n                    .curve(curveBasis)\n                    .x(isVertical ? d => xScale(d[1]) : d => yScale(d[0]))\n                    .y(isVertical ? d => yScale(d[0]) : d => xScale(d[1]))(density) +\n                ' ' +\n                line()\n                    .curve(curveBasis)\n                    .x(isVertical ? d => xScale(-d[1]) : d => yScale(d[0]))\n                    .y(isVertical ? d => yScale(d[0]) : d => xScale(-d[1]))(density)\n            );\n        };\n    }\n}\n\nexport function getViolinsData(\n    layer: ViolinLayer,\n    groupingKeys: {\n        facet: GroupKey[][],\n        primary: GroupKey[],\n        secondary: GroupKey[]\n    },\n    data: DataFrame,\n    y: DiscreteSettingsImpl['y'],\n    yAxis: DiscreteSettingsImpl['chartSettings']['yAxis']\n): ViolinsData {\n    let maxDensity = 0;\n    let minY = Infinity;\n    let maxY = -Infinity;\n\n    const violins = groupingKeys.facet.reduce((res: Record<string, Violin[]>, facetKey) => {\n        const strFacetKey = getFacetStringKey(facetKey);\n        res[strFacetKey] = [];\n        groupingKeys.primary.forEach(primaryKey => {\n            groupingKeys.secondary.forEach(secondaryKey => {\n                const values = data.getColumnByGrouping([...facetKey, primaryKey, secondaryKey], y.value);\n                if (!values.length) {\n                    return;\n                }\n                const violin = new Violin(\n                    values,\n                    yAxis.scale,\n                    layer.stat.trim,\n                    layer.stat.stepsCount,\n                    primaryKey,\n                    secondaryKey\n                );\n\n                if (violin.maxDensity > maxDensity) {\n                    maxDensity = violin.maxDensity;\n                }\n                if (violin.boundsY.min < minY) {\n                    minY = violin.boundsY.min;\n                }\n                if (violin.boundsY.max > maxY) {\n                    maxY = violin.boundsY.max;\n                }\n                res[strFacetKey].push(violin);\n            });\n        });\n        return res;\n    }, {});\n\n    return {\n        type: 'violin',\n        geoms: violins,\n        meta: {maxDensity, minY, maxY},\n        aes: layer.aes,\n    };\n}\n"],"names":["DEFAULT_STEPS_COUNT","kernelDensityEstimator","kernel","thresholds","arr","x","mean","v","kernelGaussian","bandwidth","getVariance","vMean","getStandardDeviation","nrdBandwidth","q1","q3","h","sigma","Violin","values","scale","trim","steps","primaryGrouping","secondaryGrouping","__publicField","convertToScale","convertFromScale","sortedGroup","a","b","minV","maxV","xRange","quantileSorted","q2","stepsCount","minThreshold","maxThreshold","scaleLinear","density","y","max","orientation","yScale","width","maxDensity","isVertical","maxX","xScale","area","curveBasis","d","line","getViolinsData","layer","groupingKeys","data","yAxis","minY","maxY","res","facetKey","strFacetKey","getFacetStringKey","primaryKey","secondaryKey","violin"],"mappings":";;;;;;;;;AAUA,MAAMA,IAAsB;AAE5B,SAASC,EAAuBC,GAA+BC,GAAsB;AACjF,SAAO,SAAUC,GAAe;AAC5B,WAAOD,EAAW,IAAI,SAAUE,GAAG;AAC/B,aAAO,CAACA,GAAGC,EAAKF,GAAK,OAAKF,EAAOG,IAAIE,CAAC,CAAC,CAAC;AAAA,IAC5C,CAAC;AAAA,EACL;AACJ;AAEA,SAASC,EAAeC,GAAmB;AACvC,SAAO,SAAUF,GAAW;AACxB,WAAQ,IAAI,KAAK,KAAK,IAAI,KAAK,EAAE,IAAK,KAAK,IAAI,KAAK,GAAG,OAAO,KAAK,IAAIA,IAAIE,GAAW,CAAC,CAAC;AAAA,EAC5F;AACJ;AAEA,SAASC,EAAYN,GAAe;AAChC,QAAMO,IAAQL,EAAKF,CAAG;AAEtB,SAAOE,EAAKF,EAAI,IAAI,CAAAG,MAAK,KAAK,IAAIA,IAAII,GAAO,CAAC,CAAC,CAAC;AACpD;AACA,SAASC,EAAqBR,GAAe;AACzC,SAAO,KAAK,KAAKM,EAAYN,CAAG,CAAC;AACrC;AACA,SAASS,EAAaT,GAAeU,GAAWC,GAAW;AAEvD,QAAMC,KADMD,IAAKD,KACD,MACVG,IAAQL,EAAqBR,CAAG;AAEtC,SAAO,OAAO,KAAK,IAAIa,GAAOD,CAAC,IAAI,KAAK,IAAIZ,EAAI,QAAQ,KAAK,CAAC;AAClE;AAEO,MAAMc,EAAO;AAAA,EA8BhB,YACIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACF;AACE,QArCJC,EAAA,MAAA,SAAA,GAMAA,EAAA,MAAA,SAAA,GAOAA,EAAA,MAAA,YAAA,GACAA,EAAA,MAAA,iBAAA,GACAA,EAAA,MAAA,mBAAA,GACAA,EAAA,MAAA,KAAA,GAEAA,EAAA,MAAA,SAAA,GAKAA,EAAA,MAAA,WAAA,GAcQN,EAAO,WAAW;AAClB,YAAM,MAAM,0CAA0C;AAE1D,QAAIG,MAAU,UAAUA,IAAQ;AAC5B,YAAM,MAAM,mCAAmCA,CAAK,QAAQ;AAEhE,SAAK,kBAAkB,OAAOC,CAAe,GAC7C,KAAK,oBAAoB,OAAOC,CAAiB,GACjD,KAAK,MAAM,UAAU,KAAK,eAAe,IAAI,KAAK,iBAAiB;AAEnE,UAAME,IAAiB,CAACnB,MAAea,MAAU,QAAQ,KAAK,MAAMb,CAAC,IAAIA,GACnEoB,IAAmB,CAACpB,MAAea,MAAU,QAAQ,KAAK,IAAI,IAAIb,CAAC,IAAIA,GAEvEqB,IAAcT,EACf,OAAO,CAAAZ,MACAa,MAAU,SAAS,OAAOb,CAAC,MAAM,KACjC,QAAQ,KAAK,oEAAoE,GAC1E,MAEJ,EACV,EACA,IAAImB,CAAc,EAClB,KAAK,CAACG,GAAGC,MAAMD,IAAIC,CAAC,GACnBC,IAAOH,EAAY,CAAC,GACpBI,IAAOJ,EAAYA,EAAY,SAAS,CAAC,GACzCK,IAASD,IAAOD,GAEhBjB,IAAKoB,EAAeN,GAAa,IAAI,GACrCO,IAAKD,EAAeN,GAAa,GAAG,GACpCb,IAAKmB,EAAeN,GAAa,IAAI;AAC3C,SAAK,YAAY,EAAC,IAAID,EAAiBb,CAAE,GAAG,IAAIa,EAAiBQ,CAAE,GAAG,IAAIR,EAAiBZ,CAAE,EAAA;AAE7F,UAAMN,IAAYI,EAAae,GAAad,GAAIC,CAAE,GAC5CqB,IACFd,MAAU,SACJA,IACAb,IAAY,IAAIwB,IAASjC,IACzBA,IACAiC,KAAUxB,IAAY,IAC1B4B,IAAehB,IAAOU,IAAOA,IAAO,IAAItB,GACxC6B,IAAejB,IAAOW,IAAOA,IAAO,IAAIvB,GACxCN,IAAaoC,EAAAA,EAAc,OAAO,CAACF,GAAcC,CAAY,CAAC,EAAE,MAAMF,CAAU;AAEtF,SAAK,UAAU;AAAA,MACX,KAAKT,EAAiBxB,EAAW,CAAC,CAAC;AAAA,MACnC,KAAKwB,EAAiBxB,EAAWA,EAAW,SAAS,CAAC,CAAC;AAAA,IAAA;AAI3D,UAAMqC,IADMvC,EAAuBO,EAAeC,CAAS,GAAGN,CAAU,EACpDyB,CAAW,EAAE,IAAI,CAAC,CAACvB,GAAGoC,CAAC,MAAM,CAACd,EAAiBtB,CAAC,GAAGoC,CAAC,CAAqB;AAE7F,SAAK,aAAaC,EAAIF,GAAS,CAAC,CAAA,EAAGjC,CAAC,MAAMA,CAAC,GAE3C,KAAK,UAAU,CACXoC,GACAC,GACAC,GACAC,MACC;AACD,YAAMC,IAAaJ,MAAgB,YAC7BK,IAAOF,KAAc,KAAK,YAC1BG,IAASV,IACV,OAAO,CAAC,CAACS,GAAMA,CAAI,CAAC,EACpB,MAAM,CAAC,CAACH,IAAQ,GAAGA,IAAQ,CAAC,CAAC;AAElC,aAAOE,IACDG,EAAAA,EACK,MAAMC,CAAU,EAChB,GAAG,CAAAC,MAAKH,EAAOG,EAAE,CAAC,CAAC,CAAC,EACpB,GAAG,CAAAA,MAAKH,EAAO,CAACG,EAAE,CAAC,CAAC,CAAC,EACrB,EAAE,CAAAA,MAAKR,EAAOQ,EAAE,CAAC,CAAC,CAAC,EAAEZ,CAAO,IACjCU,EAAAA,EACK,MAAMC,CAAU,EAChB,GAAG,CAAAC,MAAKH,EAAOG,EAAE,CAAC,CAAC,CAAC,EACpB,GAAG,CAAAA,MAAKH,EAAO,CAACG,EAAE,CAAC,CAAC,CAAC,EACrB,EAAE,CAAAA,MAAKR,EAAOQ,EAAE,CAAC,CAAC,CAAC,EAAEZ,CAAO;AAAA,IAC3C,GACA,KAAK,UAAU,CACXG,GACAC,GACAC,GACAC,MACC;AACD,YAAMC,IAAaJ,MAAgB,YAC7BK,IAAOF,KAAc,KAAK,YAC1BG,IAASV,IACV,OAAO,CAAC,CAACS,GAAMA,CAAI,CAAC,EACpB,MAAM,CAAC,CAACH,IAAQ,GAAGA,IAAQ,CAAC,CAAC;AAElC,aACIQ,IACK,MAAMF,CAAU,EAChB,EAAEJ,IAAa,CAAAK,MAAKH,EAAOG,EAAE,CAAC,CAAC,IAAI,CAAAA,MAAKR,EAAOQ,EAAE,CAAC,CAAC,CAAC,EACpD,EAAEL,IAAa,CAAAK,MAAKR,EAAOQ,EAAE,CAAC,CAAC,IAAI,CAAAA,MAAKH,EAAOG,EAAE,CAAC,CAAC,CAAC,EAAEZ,CAAO,IAClE,MACAa,EAAAA,EACK,MAAMF,CAAU,EAChB,EAAEJ,IAAa,CAAAK,MAAKH,EAAO,CAACG,EAAE,CAAC,CAAC,IAAI,CAAAA,MAAKR,EAAOQ,EAAE,CAAC,CAAC,CAAC,EACrD,EAAEL,IAAa,CAAAK,MAAKR,EAAOQ,EAAE,CAAC,CAAC,IAAI,CAAAA,MAAKH,EAAO,CAACG,EAAE,CAAC,CAAC,CAAC,EAAEZ,CAAO;AAAA,IAE3E;AAAA,EACJ;AACJ;AAEO,SAASc,GACZC,GACAC,GAKAC,GACAhB,GACAiB,GACW;AACX,MAAIZ,IAAa,GACba,IAAO,OACPC,IAAO;AAmCX,SAAO;AAAA,IACH,MAAM;AAAA,IACN,OAnCYJ,EAAa,MAAM,OAAO,CAACK,GAA+BC,MAAa;AACnF,YAAMC,IAAcC,EAAkBF,CAAQ;AAC9C,aAAAD,EAAIE,CAAW,IAAI,CAAA,GACnBP,EAAa,QAAQ,QAAQ,CAAAS,MAAc;AACvCT,QAAAA,EAAa,UAAU,QAAQ,CAAAU,MAAgB;AAC3C,gBAAM/C,IAASsC,EAAK,oBAAoB,CAAC,GAAGK,GAAUG,GAAYC,CAAY,GAAGzB,EAAE,KAAK;AACxF,cAAI,CAACtB,EAAO;AACR;AAEJ,gBAAMgD,IAAS,IAAIjD;AAAAA,YACfC;AAAAA,YACAuC,EAAM;AAAA,YACNH,EAAM,KAAK;AAAA,YACXA,EAAM,KAAK;AAAA,YACXU;AAAAA,YACAC;AAAAA,UAAA;AAGAC,YAAO,aAAarB,MACpBA,IAAaqB,EAAO,aAEpBA,EAAO,QAAQ,MAAMR,MACrBA,IAAOQ,EAAO,QAAQ,MAEtBA,EAAO,QAAQ,MAAMP,MACrBA,IAAOO,EAAO,QAAQ,MAE1BN,EAAIE,CAAW,EAAE,KAAKI,CAAM;AAAA,QAChC,CAAC;AAAA,MACL,CAAC,GACMN;AAAAA,IACX,GAAG,CAAA,CAAE;AAAA,IAKD,MAAM,EAAC,YAAAf,GAAY,MAAAa,GAAM,MAAAC,EAAAA;AAAAA,IACzB,KAAKL,EAAM;AAAA,EAAA;AAEnB;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/discrete/utils/getChartStatsPadding.js

@@ -0,0 +1,18 @@
+import { P_VALUE_LINE_HEIGHT as m, P_VALUE_OFFSET as l } from "../constants.js";
+import { getPairwiseStatLevelsCount as u } from "./statsPValue.js";
+function f(t, r, i) {
+  const o = Object.keys(t.values), c = t.length ? t.reduce((a, e) => {
+    if (e.meta.statType === "pairwise") {
+      const s = Object.values(e.values).map(
+        (n) => u(n, r, e.meta.significanceLevels, e.meta.ns)
+      );
+      return a + m * Math.max(...s);
+    }
+    return (e.meta.ns ? r.length > 0 : o.some((s) => e.values[s].some(([, n]) => n < e.meta.significanceLevels.one))) ? a + m : a;
+  }, l) : 0;
+  return Math.max(i, c);
+}
+export {
+  f as getChartStatsPadding
+};
+//# sourceMappingURL=getChartStatsPadding.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/discrete/utils/getChartStatsPadding.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"getChartStatsPadding.js","sources":["../../../../../../../node_modules/@milaboratories/miplots4/src/discrete/utils/getChartStatsPadding.ts"],"sourcesContent":["import type {GroupKey} from '../../DataFrame';\nimport {P_VALUE_LINE_HEIGHT, P_VALUE_OFFSET} from '../constants';\nimport type {StatsData} from '../layers/types';\nimport {getPairwiseStatLevelsCount} from './statsPValue';\n\nexport function getChartStatsPadding(statsData: StatsData[], primaryKeys: GroupKey[], topPadding: number) {\n    const facetKeys = Object.keys(statsData.values);\n    const statsPadding = statsData.length ? statsData.reduce((sum, stat) => {\n        if (stat.meta.statType === 'pairwise') {\n            const lineCountsByFacets = Object.values(stat.values).map(pValuesList =>\n                getPairwiseStatLevelsCount(pValuesList, primaryKeys, stat.meta.significanceLevels, stat.meta.ns)\n            );\n            return sum + P_VALUE_LINE_HEIGHT * Math.max(...lineCountsByFacets);\n        }\n        const hasVisibleValues = stat.meta.ns\n            ? primaryKeys.length > 0\n            : facetKeys.some(facetKey => stat.values[facetKey].some(([, v]) => v < stat.meta.significanceLevels.one));\n        return hasVisibleValues ? sum + P_VALUE_LINE_HEIGHT : sum;\n    }, P_VALUE_OFFSET) : 0;\n    return Math.max(topPadding, statsPadding);\n}\n"],"names":["getChartStatsPadding","statsData","primaryKeys","topPadding","facetKeys","statsPadding","sum","stat","lineCountsByFacets","pValuesList","getPairwiseStatLevelsCount","P_VALUE_LINE_HEIGHT","facetKey","v","P_VALUE_OFFSET"],"mappings":";;AAKO,SAASA,EAAqBC,GAAwBC,GAAyBC,GAAoB;AACtG,QAAMC,IAAY,OAAO,KAAKH,EAAU,MAAM,GACxCI,IAAeJ,EAAU,SAASA,EAAU,OAAO,CAACK,GAAKC,MAAS;AACpE,QAAIA,EAAK,KAAK,aAAa,YAAY;AACnC,YAAMC,IAAqB,OAAO,OAAOD,EAAK,MAAM,EAAE;AAAA,QAAI,CAAAE,MACtDC,EAA2BD,GAAaP,GAAaK,EAAK,KAAK,oBAAoBA,EAAK,KAAK,EAAE;AAAA,MAAA;AAEnG,aAAOD,IAAMK,IAAsB,KAAK,IAAI,GAAGH,CAAkB;AAAA,IACrE;AAIA,YAHyBD,EAAK,KAAK,KAC7BL,EAAY,SAAS,IACrBE,EAAU,KAAK,CAAAQ,MAAYL,EAAK,OAAOK,CAAQ,EAAE,KAAK,CAAC,CAAA,EAAGC,CAAC,MAAMA,IAAIN,EAAK,KAAK,mBAAmB,GAAG,CAAC,KAClFD,IAAMK,IAAsBL;AAAAA,EAC1D,GAAGQ,CAAc,IAAI;AACrB,SAAO,KAAK,IAAIX,GAAYE,CAAY;AAC5C;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/discrete/utils/getFacetStringKey.js

@@ -0,0 +1,7 @@
+function t(n) {
+  return n.map(String).join("_");
+}
+export {
+  t as getFacetStringKey
+};
+//# sourceMappingURL=getFacetStringKey.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/discrete/utils/getFacetStringKey.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"getFacetStringKey.js","sources":["../../../../../../../node_modules/@milaboratories/miplots4/src/discrete/utils/getFacetStringKey.ts"],"sourcesContent":["import type {GroupKey} from '../../DataFrame';\n\nexport function getFacetStringKey(keys:GroupKey[]) {\n    return keys.map(String).join('_');\n}"],"names":["getFacetStringKey","keys"],"mappings":"AAEO,SAASA,EAAkBC,GAAiB;AAC/C,SAAOA,EAAK,IAAI,MAAM,EAAE,KAAK,GAAG;AACpC;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/discrete/utils/getOutliersBounds.js

@@ -0,0 +1,9 @@
+import { quantileSorted as u } from "../../node_modules/d3-array/src/quantile.js";
+function d(g, r, i = (o) => o) {
+  const o = (t) => r === "log" ? Math.log10(t) : t, a = (t) => r === "log" ? Math.pow(10, t) : t, e = g.map(i).map(o).sort((t, m) => t - m), s = u(e, 0.25), l = u(e, 0.75), n = l - s, p = 1.5;
+  return [a(s - p * n), a(l + p * n)];
+}
+export {
+  d as getOutliersBounds
+};
+//# sourceMappingURL=getOutliersBounds.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/discrete/utils/getOutliersBounds.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"getOutliersBounds.js","sources":["../../../../../../../node_modules/@milaboratories/miplots4/src/discrete/utils/getOutliersBounds.ts"],"sourcesContent":["import {quantileSorted} from 'd3-array';\n\nexport function getOutliersBounds<ValueType>(values: ValueType[], scale: 'linear' | 'log', yGetter: (v: ValueType) => number = (v) => v as number) {\n    const convertToScale = (v: number) => (scale === 'log' ? Math.log10(v) : v);\n    const convertFromScale = (v: number) => (scale === 'log' ? Math.pow(10, v) : v);\n    const valuesSortedConverted = values\n        .map(yGetter)\n        .map(convertToScale)\n        .sort((a, b) => a - b);\n\n    const q1 = quantileSorted(valuesSortedConverted, 0.25) as number;\n    const q3 = quantileSorted(valuesSortedConverted, 0.75) as number;\n    const interQuantileRange = q3 - q1;\n\n    const k = 1.5;\n    return [convertFromScale(q1 - k * interQuantileRange), convertFromScale(q3 + k * interQuantileRange)];\n}\n"],"names":["getOutliersBounds","values","scale","yGetter","v","convertToScale","convertFromScale","valuesSortedConverted","a","b","q1","quantileSorted","q3","interQuantileRange","k"],"mappings":";AAEO,SAASA,EAA6BC,GAAqBC,GAAyBC,IAAoC,CAACC,MAAMA,GAAa;AAC/I,QAAMC,IAAiB,CAACD,MAAeF,MAAU,QAAQ,KAAK,MAAME,CAAC,IAAIA,GACnEE,IAAmB,CAACF,MAAeF,MAAU,QAAQ,KAAK,IAAI,IAAIE,CAAC,IAAIA,GACvEG,IAAwBN,EACzB,IAAIE,CAAO,EACX,IAAIE,CAAc,EAClB,KAAK,CAACG,GAAGC,MAAMD,IAAIC,CAAC,GAEnBC,IAAKC,EAAeJ,GAAuB,IAAI,GAC/CK,IAAKD,EAAeJ,GAAuB,IAAI,GAC/CM,IAAqBD,IAAKF,GAE1BI,IAAI;AACV,SAAO,CAACR,EAAiBI,IAAKI,IAAID,CAAkB,GAAGP,EAAiBM,IAAKE,IAAID,CAAkB,CAAC;AACxG;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/discrete/utils/splitTextByWidth.js

@@ -0,0 +1,56 @@
+import { TextMeasurer as f } from "../../utils/TextMeasurer.js";
+function d(p, h, a, o = 14) {
+  const i = new f(`600 ${o}px Manrope`), s = [];
+  p.split(new RegExp("(?=[_-])|(?<=[_-])")).forEach((n) => {
+    i.getTextWidth(n) > a ? s.push(...n.split("")) : s.push(n);
+  });
+  let e = "", r = 0, t = 0, u = "";
+  for (; r <= h; ) {
+    const n = i.getTextWidth(e + s[t]);
+    n < h && (e += s[t], u = e, t++), r = n;
+  }
+  e = "", r = 0;
+  const c = [];
+  for (t; t < s.length; t++) {
+    const n = i.getTextWidth(e + s[t]);
+    n < a ? (e += s[t], r = n) : (c.push(e), e = s[t], r = i.getTextWidth(s[t]));
+  }
+  return {
+    firstPart: u,
+    lines: c,
+    lastPart: e,
+    lastPartLength: r
+  };
+}
+function P(p, h, a) {
+  const o = new f(`600 ${a}px Manrope`);
+  if (p.trim() === "")
+    return [];
+  if (o.getTextWidth(p) <= h)
+    return [p];
+  const i = p.split(/\s+/), s = [];
+  let e = "", r = 0;
+  for (let t = 0; t < i.length; t++) {
+    const u = `${e} ${i[t]}`, c = o.getTextWidth(u);
+    if (c <= h)
+      e = u, r = c;
+    else {
+      const n = o.getTextWidth(i[t]);
+      if (n > h) {
+        const {
+          firstPart: g,
+          lines: l,
+          lastPart: x,
+          lastPartLength: T
+        } = d(i[t], h - r, h, a);
+        s.push(`${e} ${g}`), s.push(...l), e = x, r = T;
+      } else
+        s.push(e), e = i[t], r = n;
+    }
+  }
+  return s.push(e), s.filter((t) => t.length > 0);
+}
+export {
+  P as splitTextByWidth
+};
+//# sourceMappingURL=splitTextByWidth.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/discrete/utils/splitTextByWidth.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"splitTextByWidth.js","sources":["../../../../../../../node_modules/@milaboratories/miplots4/src/discrete/utils/splitTextByWidth.ts"],"sourcesContent":["import {TextMeasurer} from '../../utils/TextMeasurer';\n\nfunction splitWord(word:string, startLineLength:number, maxLength:number, fontSize = 14) {\n    const textMeasurer = new TextMeasurer(`600 ${fontSize}px Manrope`);\n    // \"_\" and \"-\" symbols have priority as separation bounds, if this is not enough split by single symbols\n    const parts:string[] = [];\n    word\n        .split(/(?=[_-])|(?<=[_-])/)\n        .forEach((part) => {\n            const length = textMeasurer.getTextWidth(part);\n            if (length > maxLength) {\n                parts.push(...part.split(''));\n            } else {\n                parts.push(part);\n            }\n        });\n    let currentLine = '';\n    let currentLineLength = 0;\n    let i = 0;\n    let firstPart = '';\n    while (currentLineLength <= startLineLength) {\n        const nextLength = textMeasurer.getTextWidth(currentLine + parts[i]);\n        if (nextLength < startLineLength) {\n            currentLine += parts[i];\n            firstPart = currentLine;\n            i++;\n        }\n        currentLineLength = nextLength;\n    }\n    currentLine = '';\n    currentLineLength = 0;\n    const lines:string[] = [];\n    for (i; i < parts.length; i++) {\n        const nextLength = textMeasurer.getTextWidth(currentLine + parts[i]);\n        if (nextLength < maxLength) {\n            currentLine += parts[i];\n            currentLineLength = nextLength;\n        } else {\n            lines.push(currentLine);\n            currentLine = parts[i];\n            currentLineLength = textMeasurer.getTextWidth(parts[i]);\n        }\n    }\n    return {\n        firstPart,\n        lines,\n        lastPart: currentLine,\n        lastPartLength: currentLineLength\n    };\n}\n\nexport function splitTextByWidth (text:string, maxWidth: number, fontSize: number) {\n    const textMeasurer = new TextMeasurer(`600 ${fontSize}px Manrope`);\n    if (text.trim() === '') {\n        return [];\n    }\n    if (textMeasurer.getTextWidth(text) <= maxWidth) {\n        return [text];\n    }\n    const words = text.split(/\\s+/);\n    const result:string[] = [];\n    let currentLine = '';\n    let currentLineLength = 0;\n    for (let i = 0; i < words.length; i++) {\n        const tempLine = `${currentLine} ${words[i]}`;\n        const tempLineLength = textMeasurer.getTextWidth(tempLine);\n        if (tempLineLength <= maxWidth) {\n            currentLine = tempLine;\n            currentLineLength = tempLineLength;\n        } else {\n            const wordLength = textMeasurer.getTextWidth(words[i]);\n            if (wordLength > maxWidth) {\n                const {\n                    firstPart,\n                    lines,\n                    lastPart,\n                    lastPartLength\n                } = splitWord(words[i], maxWidth - currentLineLength, maxWidth, fontSize);\n                result.push(`${currentLine} ${firstPart}`);\n                result.push(...lines);\n                currentLine = lastPart;\n                currentLineLength = lastPartLength;\n            } else {\n                result.push(currentLine);\n                currentLine = words[i];\n                currentLineLength = wordLength;\n            }\n        }\n    }\n    result.push(currentLine);\n    return result.filter((line) => {\n        return line.length > 0;\n    });\n}\n"],"names":["splitWord","word","startLineLength","maxLength","fontSize","textMeasurer","TextMeasurer","parts","part","currentLine","currentLineLength","i","firstPart","nextLength","lines","splitTextByWidth","text","maxWidth","words","result","tempLine","tempLineLength","wordLength","lastPart","lastPartLength","line"],"mappings":";AAEA,SAASA,EAAUC,GAAaC,GAAwBC,GAAkBC,IAAW,IAAI;AACrF,QAAMC,IAAe,IAAIC,EAAa,OAAOF,CAAQ,YAAY,GAE3DG,IAAiB,CAAA;AACvBN,EAAAA,EACK,MAAM,IAAA,OAAA,oBAAoB,CAAA,EAC1B,QAAQ,CAACO,MAAS;AACAH,MAAa,aAAaG,CAAI,IAChCL,IACTI,EAAM,KAAK,GAAGC,EAAK,MAAM,EAAE,CAAC,IAE5BD,EAAM,KAAKC,CAAI;AAAA,EAEvB,CAAC;AACL,MAAIC,IAAc,IACdC,IAAoB,GACpBC,IAAI,GACJC,IAAY;AAChB,SAAOF,KAAqBR,KAAiB;AACzC,UAAMW,IAAaR,EAAa,aAAaI,IAAcF,EAAMI,CAAC,CAAC;AAC/DE,IAAAA,IAAaX,MACbO,KAAeF,EAAMI,CAAC,GACtBC,IAAYH,GACZE,MAEJD,IAAoBG;AAAAA,EACxB;AACAJ,MAAc,IACdC,IAAoB;AACpB,QAAMI,IAAiB,CAAA;AACvB,OAAKH,GAAGA,IAAIJ,EAAM,QAAQI,KAAK;AAC3B,UAAME,IAAaR,EAAa,aAAaI,IAAcF,EAAMI,CAAC,CAAC;AAC/DE,IAAAA,IAAaV,KACbM,KAAeF,EAAMI,CAAC,GACtBD,IAAoBG,MAEpBC,EAAM,KAAKL,CAAW,GACtBA,IAAcF,EAAMI,CAAC,GACrBD,IAAoBL,EAAa,aAAaE,EAAMI,CAAC,CAAC;AAAA,EAE9D;AACA,SAAO;AAAA,IACH,WAAAC;AAAAA,IACA,OAAAE;AAAAA,IACA,UAAUL;AAAAA,IACV,gBAAgBC;AAAAA,EAAA;AAExB;AAEO,SAASK,EAAkBC,GAAaC,GAAkBb,GAAkB;AAC/E,QAAMC,IAAe,IAAIC,EAAa,OAAOF,CAAQ,YAAY;AACjE,MAAIY,EAAK,WAAW;AAChB,WAAO,CAAA;AAEX,MAAIX,EAAa,aAAaW,CAAI,KAAKC;AACnC,WAAO,CAACD,CAAI;AAEhB,QAAME,IAAQF,EAAK,MAAM,KAAK,GACxBG,IAAkB,CAAA;AACxB,MAAIV,IAAc,IACdC,IAAoB;AACxB,WAASC,IAAI,GAAGA,IAAIO,EAAM,QAAQP,KAAK;AACnC,UAAMS,IAAW,GAAGX,CAAW,IAAIS,EAAMP,CAAC,CAAC,IACrCU,IAAiBhB,EAAa,aAAae,CAAQ;AACzD,QAAIC,KAAkBJ;AAClBR,UAAcW,GACdV,IAAoBW;AAAAA,SACjB;AACH,YAAMC,IAAajB,EAAa,aAAaa,EAAMP,CAAC,CAAC;AACrD,UAAIW,IAAaL,GAAU;AACvB,cAAM;AAAA,UACF,WAAAL;AAAAA,UACA,OAAAE;AAAAA,UACA,UAAAS;AAAAA,UACA,gBAAAC;AAAAA,QAAA,IACAxB,EAAUkB,EAAMP,CAAC,GAAGM,IAAWP,GAAmBO,GAAUb,CAAQ;AACxEe,QAAAA,EAAO,KAAK,GAAGV,CAAW,IAAIG,CAAS,EAAE,GACzCO,EAAO,KAAK,GAAGL,CAAK,GACpBL,IAAcc,GACdb,IAAoBc;AAAAA,MACxB;AACIL,QAAAA,EAAO,KAAKV,CAAW,GACvBA,IAAcS,EAAMP,CAAC,GACrBD,IAAoBY;AAAAA,IAE5B;AAAA,EACJ;AACA,SAAAH,EAAO,KAAKV,CAAW,GAChBU,EAAO,OAAO,CAACM,MACXA,EAAK,SAAS,CACxB;AACL;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/discrete/utils/statsPValue.js

@@ -0,0 +1,32 @@
+function l(c, u, i, s) {
+  const r = u.reduce((e, t, o) => (e[t] = o, e), {});
+  return c.filter(([, e]) => s ? e <= i.one : !0).sort(([[e, t]], [[o, n]]) => e !== t ? r[t] - r[e] : r[n] - r[o]);
+}
+function h(c, u) {
+  const i = u.reduce((r, e, t) => (r[e] = t, r), {}), s = [];
+  return c.map(([[r, e]]) => {
+    const t = i[r], o = i[e];
+    for (let n = 0; n < s.length; n++)
+      if (s[n] < t)
+        return s[n] = o, n;
+    return s.push(o), s.length - 1;
+  });
+}
+function g(c, u, i, s) {
+  const r = u.reduce((t, o, n) => (t[o] = n, t), {}), e = [];
+  return l(c, u, i, !s).forEach(([[t, o]]) => {
+    const n = r[t], f = r[o];
+    for (let a = 0; a < e.length; a++)
+      if (e[a] < n) {
+        e[a] = f;
+        return;
+      }
+    e.push(f);
+  }), e.length;
+}
+export {
+  h as getPairwiseStatLevels,
+  g as getPairwiseStatLevelsCount,
+  l as sortPairwiseKeys
+};
+//# sourceMappingURL=statsPValue.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/discrete/utils/statsPValue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"statsPValue.js","sources":["../../../../../../../node_modules/@milaboratories/miplots4/src/discrete/utils/statsPValue.ts"],"sourcesContent":["import type {GroupKey} from '../../DataFrame';\nimport type {SignificanceLevels} from '../../types';\n\nexport function sortPairwiseKeys (values:[GroupKey[], number][], primaryKeys:GroupKey[], significanceLevels:SignificanceLevels, removeNS:boolean) {\n    const idxByKeys:Record<GroupKey, number> = primaryKeys.reduce((res, key, idx) => {\n        res[key] = idx;\n        return res;\n    }, {} as Record<GroupKey, number>);\n    return values.filter(([,value]) => removeNS ? value <= significanceLevels.one : true).sort(([[aKey1, aKey2]], [[bKey1,bKey2]]) => {\n        if (aKey1 !== aKey2) {\n            return idxByKeys[aKey2] - idxByKeys[aKey1];\n        }\n        return idxByKeys[bKey2] - idxByKeys[bKey1];\n    });\n}\n\nexport function getPairwiseStatLevels (valuesSorted:[GroupKey[], number][], primaryKeys:GroupKey[]) {\n    const idxByKeys:Record<GroupKey, number> = primaryKeys.reduce((res, key, idx) => {\n        res[key] = idx;\n        return res;\n    }, {} as Record<GroupKey, number>);\n    const levels:number[] = [];\n    return valuesSorted.map(([[key1,key2]]) => {\n        const leftIdx = idxByKeys[key1];\n        const rightIdx = idxByKeys[key2];\n        for (let i = 0; i < levels.length; i++) {\n            if (levels[i] < leftIdx) {\n                levels[i] = rightIdx;\n                return i;\n            }\n        }\n        levels.push(rightIdx);\n        return levels.length - 1;\n    });\n}\n\nexport function getPairwiseStatLevelsCount (values:[string[], number][], primaryKeys:GroupKey[], significanceLevels:SignificanceLevels, ns: boolean) {\n    const idxByKeys:Record<GroupKey, number> = primaryKeys.reduce((res, key, idx) => {\n        res[key] = idx;\n        return res;\n    }, {} as Record<GroupKey, number>);\n    const levels:number[] = [];\n    sortPairwiseKeys(values, primaryKeys, significanceLevels, !ns).forEach(([[key1,key2]]) => {\n        const leftIdx = idxByKeys[key1];\n        const rightIdx = idxByKeys[key2];\n        for (let i = 0; i < levels.length; i++) {\n            if (levels[i] < leftIdx) {\n                levels[i] = rightIdx;\n                return;\n            }\n        }\n        levels.push(rightIdx);\n    });\n    return levels.length;\n}\n"],"names":["sortPairwiseKeys","values","primaryKeys","significanceLevels","removeNS","idxByKeys","res","key","idx","value","aKey1","aKey2","bKey1","bKey2","getPairwiseStatLevels","valuesSorted","levels","key1","key2","leftIdx","rightIdx","i","getPairwiseStatLevelsCount","ns"],"mappings":"AAGO,SAASA,EAAkBC,GAA+BC,GAAwBC,GAAuCC,GAAkB;AAC9I,QAAMC,IAAqCH,EAAY,OAAO,CAACI,GAAKC,GAAKC,OACrEF,EAAIC,CAAG,IAAIC,GACJF,IACR,CAAA,CAA8B;AACjC,SAAOL,EAAO,OAAO,CAAC,CAAA,EAAEQ,CAAK,MAAML,IAAWK,KAASN,EAAmB,MAAM,EAAI,EAAE,KAAK,CAAC,CAAC,CAACO,GAAOC,CAAK,CAAC,GAAG,CAAC,CAACC,GAAMC,CAAK,CAAC,MACpHH,MAAUC,IACHN,EAAUM,CAAK,IAAIN,EAAUK,CAAK,IAEtCL,EAAUQ,CAAK,IAAIR,EAAUO,CAAK,CAC5C;AACL;AAEO,SAASE,EAAuBC,GAAqCb,GAAwB;AAChG,QAAMG,IAAqCH,EAAY,OAAO,CAACI,GAAKC,GAAKC,OACrEF,EAAIC,CAAG,IAAIC,GACJF,IACR,CAAA,CAA8B,GAC3BU,IAAkB,CAAA;AACxB,SAAOD,EAAa,IAAI,CAAC,CAAC,CAACE,GAAKC,CAAI,CAAC,MAAM;AACvC,UAAMC,IAAUd,EAAUY,CAAI,GACxBG,IAAWf,EAAUa,CAAI;AAC/B,aAASG,IAAI,GAAGA,IAAIL,EAAO,QAAQK;AAC/B,UAAIL,EAAOK,CAAC,IAAIF;AACZ,eAAAH,EAAOK,CAAC,IAAID,GACLC;AAGf,WAAAL,EAAO,KAAKI,CAAQ,GACbJ,EAAO,SAAS;AAAA,EAC3B,CAAC;AACL;AAEO,SAASM,EAA4BrB,GAA6BC,GAAwBC,GAAuCoB,GAAa;AACjJ,QAAMlB,IAAqCH,EAAY,OAAO,CAACI,GAAKC,GAAKC,OACrEF,EAAIC,CAAG,IAAIC,GACJF,IACR,CAAA,CAA8B,GAC3BU,IAAkB,CAAA;AACxB,SAAAhB,EAAiBC,GAAQC,GAAaC,GAAoB,CAACoB,CAAE,EAAE,QAAQ,CAAC,CAAC,CAACN,GAAKC,CAAI,CAAC,MAAM;AACtF,UAAMC,IAAUd,EAAUY,CAAI,GACxBG,IAAWf,EAAUa,CAAI;AAC/B,aAASG,IAAI,GAAGA,IAAIL,EAAO,QAAQK;AAC/B,UAAIL,EAAOK,CAAC,IAAIF,GAAS;AACrBH,QAAAA,EAAOK,CAAC,IAAID;AACZ;AAAA,MACJ;AAEJJ,IAAAA,EAAO,KAAKI,CAAQ;AAAA,EACxB,CAAC,GACMJ,EAAO;AAClB;","x_google_ignoreList":[0]}