@datagrok/eda 1.4.4 → 1.4.6

package/dist/vendors-node_modules_datagrok-libraries_math_src_webGPU_sparse-matrix_webGPU-sparse-matrix_js-07693f.js

@@ -1,1525 +0,0 @@
-"use strict";
-(self["webpackChunkeda"] = self["webpackChunkeda"] || []).push([["vendors-node_modules_datagrok-libraries_math_src_webGPU_sparse-matrix_webGPU-sparse-matrix_js-07693f"],{
-
-/***/ "./node_modules/@datagrok-libraries/math/src/webGPU/getGPUDevice.js":
-/*!**************************************************************************!*\
-  !*** ./node_modules/@datagrok-libraries/math/src/webGPU/getGPUDevice.js ***!
-  \**************************************************************************/
-/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
-
-__webpack_require__.r(__webpack_exports__);
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */   getGPUAdapterDescription: () => (/* binding */ getGPUAdapterDescription),
-/* harmony export */   getGPUDevice: () => (/* binding */ getGPUDevice)
-/* harmony export */ });
-var __awaiter = (undefined && undefined.__awaiter) || function (thisArg, _arguments, P, generator) {
-    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
-    return new (P || (P = Promise))(function (resolve, reject) {
-        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
-        function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
-        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
-        step((generator = generator.apply(thisArg, _arguments || [])).next());
-    });
-};
-let gpuAdapter = null;
-let gpuDevice = null;
-function getGPUDevice() {
-    return __awaiter(this, void 0, void 0, function* () {
-        if (!navigator.gpu) {
-            console.error('WebGPU is not supported in this browser');
-            return null;
-        }
-        if (!gpuAdapter) {
-            //reason: only here we get the gpuAdapter
-            // eslint-disable-next-line no-restricted-syntax
-            gpuAdapter = yield navigator.gpu.requestAdapter({ powerPreference: 'high-performance' });
-            if (gpuAdapter == null)
-                return null;
-        }
-        let isLost = false;
-        if (gpuDevice) {
-            gpuDevice.lost.then(() => {
-                isLost = true;
-            });
-            yield new Promise((r) => setTimeout(r, 10)); // wait to see if the device is lost
-        }
-        if (!gpuDevice || isLost) {
-            const requiredBufferSize = 1000000000; // ~1000MB
-            const adapterLimits = gpuAdapter.limits;
-            const buffferSizeLimit = adapterLimits.maxBufferSize;
-            const storageBufferSizeLimit = adapterLimits.maxStorageBufferBindingSize;
-            try {
-                gpuDevice = yield gpuAdapter.requestDevice({ requiredLimits: {
-                        maxBufferSize: Math.min(buffferSizeLimit, requiredBufferSize),
-                        maxStorageBufferBindingSize: Math.min(storageBufferSizeLimit, requiredBufferSize)
-                    } });
-                return gpuDevice;
-            }
-            catch (e) {
-                console.error('Failed to create device with required limits', e);
-                gpuDevice = yield gpuAdapter.requestDevice();
-                return gpuDevice;
-            }
-        }
-        return gpuDevice;
-    });
-}
-function getGPUAdapterDescription() {
-    return __awaiter(this, void 0, void 0, function* () {
-        if (!navigator.gpu) {
-            console.error('WebGPU is not supported in this browser');
-            return null;
-        }
-        if (!gpuAdapter) {
-            // reason: only here we get the gpuAdapter
-            // eslint-disable-next-line no-restricted-syntax
-            gpuAdapter = yield navigator.gpu.requestAdapter();
-            if (gpuAdapter == null)
-                return null;
-        }
-        let info = null;
-        if ('info' in gpuAdapter)
-            info = gpuAdapter.info;
-        // this option is sort of deprecated but still available in every initial release
-        // else if ('requestAdapterInfo' in gpuAdapter && typeof gpuAdapter.requestAdapterInfo === 'function')
-        //   info = (await gpuAdapter.requestAdapterInfo()) as GPUAdapterInfo;
-        if (!info)
-            return 'No GPU description available';
-        const outString = replaceEmptyString(info.description, replaceEmptyString(info.vendor, 'No GPU description available'));
-        return outString;
-    });
-}
-function replaceEmptyString(str, replacement) {
-    return !str || str == '' ? replacement : str;
-}
-//# sourceMappingURL=getGPUDevice.js.map
-
-/***/ }),
-
-/***/ "./node_modules/@datagrok-libraries/math/src/webGPU/multi-col-distances/webGPU-aggregation.js":
-/*!****************************************************************************************************!*\
-  !*** ./node_modules/@datagrok-libraries/math/src/webGPU/multi-col-distances/webGPU-aggregation.js ***!
-  \****************************************************************************************************/
-/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
-
-__webpack_require__.r(__webpack_exports__);
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */   WEBGSLAGGREGATION: () => (/* binding */ WEBGSLAGGREGATION),
-/* harmony export */   WEBGSLAGGREGATIONFUNCTIONS: () => (/* binding */ WEBGSLAGGREGATIONFUNCTIONS)
-/* harmony export */ });
-function euclideanAggregationWgsl(arraySize) {
-    return `
-        var sum = 0.0;
-        for (var i = 0u; i < ${arraySize}; i = i + 1u) {
-            sum = sum + distances[i] * distances[i] * computeInfo.weights[i] * computeInfo.weights[i];
-        }
-        return sqrt(sum);
-    `;
-}
-;
-function manhattanAggregationWgsl(arraySize) {
-    return `
-        var sum = 0.0;
-        for (var i = 0u; i < ${arraySize}; i = i + 1u) {
-            sum = sum + abs(distances[i]) * computeInfo.weights[i];
-        }
-        return sum;
-    `;
-}
-var WEBGSLAGGREGATION;
-(function (WEBGSLAGGREGATION) {
-    WEBGSLAGGREGATION["EUCLIDEAN"] = "EUCLIDEAN";
-    WEBGSLAGGREGATION["MANHATTAN"] = "MANHATTAN";
-})(WEBGSLAGGREGATION || (WEBGSLAGGREGATION = {}));
-const WEBGSLAGGREGATIONFUNCTIONS = {
-    [WEBGSLAGGREGATION.EUCLIDEAN]: euclideanAggregationWgsl,
-    [WEBGSLAGGREGATION.MANHATTAN]: manhattanAggregationWgsl
-};
-//# sourceMappingURL=webGPU-aggregation.js.map
-
-/***/ }),
-
-/***/ "./node_modules/@datagrok-libraries/math/src/webGPU/multi-col-distances/webGPU-multicol-distances.js":
-/*!***********************************************************************************************************!*\
-  !*** ./node_modules/@datagrok-libraries/math/src/webGPU/multi-col-distances/webGPU-multicol-distances.js ***!
-  \***********************************************************************************************************/
-/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
-
-__webpack_require__.r(__webpack_exports__);
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */   TypeSupportedDistances: () => (/* binding */ TypeSupportedDistances),
-/* harmony export */   WEBGPUDISTANCE: () => (/* binding */ WEBGPUDISTANCE),
-/* harmony export */   distanceFunctionComplexity: () => (/* binding */ distanceFunctionComplexity),
-/* harmony export */   webGPUAsymmetricBitArray: () => (/* binding */ webGPUAsymmetricBitArray),
-/* harmony export */   webGPUCosineBitArray: () => (/* binding */ webGPUCosineBitArray),
-/* harmony export */   webGPUEuclidean: () => (/* binding */ webGPUEuclidean),
-/* harmony export */   webGPUFunctions: () => (/* binding */ webGPUFunctions),
-/* harmony export */   webGPUHamming: () => (/* binding */ webGPUHamming),
-/* harmony export */   webGPULevenstein: () => (/* binding */ webGPULevenstein),
-/* harmony export */   webGPUManhattan: () => (/* binding */ webGPUManhattan),
-/* harmony export */   webGPUMonomerChemicalDistance: () => (/* binding */ webGPUMonomerChemicalDistance),
-/* harmony export */   webGPUNeedlemanWunsch: () => (/* binding */ webGPUNeedlemanWunsch),
-/* harmony export */   webGPUNumericDistance: () => (/* binding */ webGPUNumericDistance),
-/* harmony export */   webGPUOneHotDistance: () => (/* binding */ webGPUOneHotDistance),
-/* harmony export */   webGPUSokalBitArray: () => (/* binding */ webGPUSokalBitArray),
-/* harmony export */   webGPUTanimotoBitArray: () => (/* binding */ webGPUTanimotoBitArray),
-/* harmony export */   webGPUVectorCosine: () => (/* binding */ webGPUVectorCosine)
-/* harmony export */ });
-/* eslint-disable max-len */
-// in all the functions below, the variables a and b are assumed to be arrays of uint32/f32
-//values which are infered from the code this chunk is injected into
-// also, we have access to computeInfo struct, which contains the following fields:
-// computeInfo.entrySizes: array of arrays of u32 containing the sizes of the entries
-// other fields are specific to the distance function should be injected from the main script that calls this function,
-// and should be available in the supplementaryInfo struct
-// like the similarity matrix for monomer chemical distance.
-// the getProcessInfo function should return correct buffer allocation mechanism for the supplementaryInfo,
-// for every entry list
-// the maxDistance variable is also assumed to be available in the
-// scope of the function, in case of knn it is the distance in the last postion of knn on this index,
-// in case of sparse matrix, it can be just the threshold for the distance.
-// hamming distance for sequnences of uint32 arrays of max length ${maxArraySize}
-function webGPUHamming(_maxArraySize, entryIndex) {
-    return `
-  let aLength: u32 = computeInfo.entrySizes[${entryIndex}][aIndex];
-  let bLength: u32 = computeInfo.entrySizes[${entryIndex}][bIndex];
-  let maxLength: u32 = max(aLength, bLength);
-  let minLength: u32 = min(aLength, bLength);
-  let sizeDiff: u32 = maxLength - minLength;
-  
-  let maxIntDistance = ceil(maxDistance * f32(maxLength)) - f32(sizeDiff);
-
-  var diff: f32 = 0.0;
-  for (var i = 0u; i < ${_maxArraySize}; i = i + 1u) {
-      diff = diff + f32(a[i] != b[i]);
-      if (diff > maxIntDistance) {
-            return 1.0;
-        }
-  }
-  diff += f32(sizeDiff);
-  return diff / ${_maxArraySize};
-  `;
-}
-function webGPUMonomerChemicalDistance(_maxArraySize, entryIndex) {
-    // it is assumet that suppInfo struct contains correct matrix called similarityMatrix${entryIndex}, (similarityMatrix0, similarityMatrix1, etc)
-    // this should be guaranteed by the getProcessInfo function.
-    return `
-  let aLength: u32 = computeInfo.entrySizes[${entryIndex}][aIndex];
-  let bLength: u32 = computeInfo.entrySizes[${entryIndex}][bIndex];
-  let maxLength: u32 = max(aLength, bLength);
-  let minLength: u32 = min(aLength, bLength);
-  let sizeDiff: u32 = maxLength - minLength;
-  
-  let maxIntDistance = ceil(maxDistance * f32(maxLength)) - f32(sizeDiff);
-
-  let simMatrix = &(suppInfo.similarityMatrix${entryIndex}); // using pointers make things faster
-  var diff: f32 = 0.0;
-  for (var i = 0u; i < ${_maxArraySize}; i = i + 1u) {
-      diff = diff + 1.0 - (*simMatrix)[u32(a[i])][u32(b[i])];
-      if (diff > maxIntDistance) {
-            return 1.0;
-        }
-  }
-  diff += f32(sizeDiff);
-  return diff / ${_maxArraySize};
-  `;
-}
-function webGPULevenstein(maxArraySize, entryIndex) {
-    return `
-  let aLength: u32 = computeInfo.entrySizes[${entryIndex}][aIndex];
-  let bLength: u32 = computeInfo.entrySizes[${entryIndex}][bIndex];
-  let maxLength: u32 = max(aLength, bLength);
-  let minLength: u32 = min(aLength, bLength);
-
-  let maxIntDistance = ceil(maxDistance * f32(maxLength));
-
-  // we will store two arrays as matrix and swap the working indices per pass.
-  // this way we can reduce memory usage per computation to just O(aLength)
-  // the grid will have aLength + 1 columns and bLength + 1 rows
-  // this will be guaranteed by iteration, but the array sizes must be known at compile time, so we will use a fixed size of maxArraySize
-  var dynamicPassMat: array<array<f32, ${maxArraySize + 1}u>, 2>; // initialize to 0
-  
-  var prevIndex: u32 = 0;
-  var curIndex: u32 = 1; // we will swap these indices per pass
-
-  // initialize the first row
-  for (var i = 0u; i <= aLength; i = i + 1u) {
-      dynamicPassMat[prevIndex][i] = f32(i);
-  }
-
-  // iterate over the rows
-  for (var i = 1u; i <= bLength; i = i + 1u) {
-      dynamicPassMat[curIndex][0] = f32(i);
-      var minEntry: f32 = f32(maxLength);
-      let prevRow = &dynamicPassMat[prevIndex];
-      let curRow = &dynamicPassMat[curIndex];
-      let bMon = u32(b[i - 1]);
-      for (var j = 1u; j <= aLength; j = j + 1u) {
-          var cost: f32 = f32(a[j - 1] != bMon);
-          var res: f32 = min(
-              min(
-                (*prevRow)[j] + 1.0, // deletion
-                (*curRow)[j - 1] + 1.0, // insertion
-              ),
-              (*prevRow)[j - 1] + cost // substitution
-              );
-              (*curRow)[j] = res;
-          if (res < minEntry) {
-              minEntry = res;
-          }
-      }
-      // swap the indices
-      let temp: u32 = prevIndex;
-      prevIndex = curIndex;
-      curIndex = temp;
-      if (minEntry > maxIntDistance) {
-          return 1.0;
-      }
-  }
-
-  return dynamicPassMat[prevIndex][aLength] / f32(maxLength);
-  `;
-}
-function webGPUNeedlemanWunsch(maxArraySize, entryIndex) {
-    // version of the levenshtain where the cost of substitution is customizable
-    // it is assumet that suppInfo struct contains correct matrix called similarityMatrix${entryIndex}, (similarityMatrix0, similarityMatrix1, etc)
-    // and gapOpenPenalty, gapExtensionPenalty
-    // this should be guaranteed by the getProcessInfo function.
-    return `
-      let aLength: u32 = computeInfo.entrySizes[${entryIndex}][aIndex];
-      let bLength: u32 = computeInfo.entrySizes[${entryIndex}][bIndex];
-      let maxLength: u32 = max(aLength, bLength);
-      let minLength: u32 = min(aLength, bLength);
-  
-      let maxIntDistance = ceil(maxDistance * f32(maxLength));
-      // we will store two arrays as matrix and swap the working indices per pass.
-      // this way we can reduce memory usage per computation to just O(aLength)
-      // the grid will have aLength + 1 columns and bLength + 1 rows
-      // this will be guaranteed by iteration, but the array sizes must be known at compile time, so we will use a fixed size of maxArraySize
-      var dynamicPassMat: array<array<f32, ${maxArraySize + 1}u>, 2>; // initialize to 0
-      
-      // we need to keep track of which operation led to the current cell
-      // i.e. whether we came from the left, top or diagonal to assign gap open/gap extend penalty
-      var verticalGaps: array<u32, ${maxArraySize + 1}u>;
-      var horizontalGaps: array<u32, ${maxArraySize + 1}u>;
-
-      let gapOpenPenalty: f32 = suppInfo.gapOpenPenalty${entryIndex};
-      let gapExtensionPenalty: f32 = suppInfo.gapExtensionPenalty${entryIndex};
-      var prevIndex: u32 = 0;
-      var curIndex: u32 = 1; // we will swap these indices per pass
-      // initialize the first row
-      for (var i = 0u; i <= aLength; i = i + 1u) {
-          dynamicPassMat[prevIndex][i] = gapExtensionPenalty + f32(i - 1) * gapExtensionPenalty; // accounting for the fact that left and right gaps are less costly
-          dynamicPassMat[curIndex][i] = 0.0;
-      }
-      dynamicPassMat[0][0] = 0.0;
-
-      let simMatrix = &suppInfo.similarityMatrix${entryIndex}; // using pointers make things faster
-      // iterate over the rows
-      for (var i = 1u; i <= bLength; i = i + 1u) {
-          let prevRow = &dynamicPassMat[prevIndex];
-          let curRow = &dynamicPassMat[curIndex];
-          (*curRow)[0] = gapExtensionPenalty + f32(i - 1) * gapExtensionPenalty;
-          var minEntry: f32 = f32(maxLength);
-          let monB = u32(b[i - 1]);
-          for (var j = 1u; j <= aLength; j = j + 1u) {
-              let monA = u32(a[j - 1]);
-              
-              let cost: f32 = (*prevRow)[j - 1] + 1f - (*simMatrix)[monA][monB];
-              var top = (*prevRow)[j]; // deletion
-              if (verticalGaps[j] > 0 || i == 1 || i == bLength) {
-                  top = top + gapExtensionPenalty;
-              } else {
-                  top = top + gapOpenPenalty;
-              }
-              var left = (*curRow)[j - 1]; // insertion
-              if (horizontalGaps[j - 1] > 0 || j == 1 || j == aLength) {
-                  left = left + gapExtensionPenalty;
-              } else {
-                  left = left + gapOpenPenalty;
-              }
-              var res: f32 = min(
-                  min(
-                      top, // deletion
-                      left, // insertion
-                  ),
-                  cost // substitution
-                  );
-                  (*curRow)[j] = res;
-              if (res < minEntry) {
-                  minEntry = res;
-              }
-              // update the horizontal and vertical gaps
-              if (res == cost) {
-                  verticalGaps[j] = 0;
-                  horizontalGaps[j] = 0;
-              } else if (res == left) {
-                  verticalGaps[j] = 0;
-                  horizontalGaps[j] = 1;
-              } else {
-                  verticalGaps[j] = 1;
-                  horizontalGaps[j] = 0;
-              }
-          }
-          // swap the indices
-          let temp: u32 = prevIndex;
-          prevIndex = curIndex;
-          curIndex = temp;
-          if (minEntry > maxIntDistance) {
-              return 1.0;
-          }
-      }
-      return dynamicPassMat[prevIndex][aLength] / f32(minLength);
-
-  `;
-}
-function webGPUEuclidean(maxArraySize, _entryIndex) {
-    return `
-  var dist: f32 = 0.0;
-  for (var i = 0u; i < ${maxArraySize}; i = i + 1u) {
-    dist = dist + f32(a[i] - b[i]) * f32(a[i] - b[i]);
-  }
-  return sqrt(dist);
-  `;
-}
-function webGPUVectorCosine(maxArraySize, _entryIndex) {
-    return `
-  var dist: f32 = 0.0;
-  var productSum: f32 = 0.0;
-  var aSquareSum: f32 = 0.0;
-  var bSquareSum: f32 = 0.0;
-  for (var i = 0u; i < ${maxArraySize}; i = i + 1u) {
-    productSum = productSum + f32(a[i] * b[i]);
-    aSquareSum = aSquareSum + f32(a[i] * a[i]);
-    bSquareSum = bSquareSum + f32(b[i] * b[i]);
-  }
-  var sim = productSum / (sqrt(aSquareSum) * sqrt(bSquareSum));
-  return (1.0 - sim) / 2.0;
-  `;
-}
-function webGPUManhattan(maxArraySize, _entryIndex) {
-    return `
-  var dist: f32 = 0.0;
-  for (var i = 0u; i < ${maxArraySize}; i = i + 1u) {
-    dist = dist + abs(f32(a[i] - b[i]));
-  }
-  return dist;
-  `;
-}
-function webGPUOneHotDistance(_maxArraySize, entryIndex) {
-    return `
-  let aLength: u32 = computeInfo.entrySizes[${entryIndex}][aIndex];
-  let bLength: u32 = computeInfo.entrySizes[${entryIndex}][bIndex];
-  if (aLength != bLength) {
-    return 1.0;
-  }
-  for (var i = 0u; i < aLength; i = i + 1u) {
-    if(a[i] != b[i]) {
-      return 1.0;
-    }
-  }
-  return 0.0;
-  `;
-}
-function webGPUNumericDistance(_maxArraySize, entryIndex) {
-    // we assume that range${entryIndex} is available in the supplementaryInfo struct
-    return `
-    let range = suppInfo.range${entryIndex};
-    return f32(abs(f32(a[0]) - f32(b[0])) / range);
-  `;
-}
-// tanimoto distance for uint32 arrays of length ${maxArraySize}
-function webGPUTanimotoBitArray(maxArraySize, _entryIndex) {
-    return `
-  var onBitsa: u32 = 0u;
-  var onBitsb: u32 = 0u;
-  for (var i = 0u; i < ${maxArraySize}u; i = i + 1u) {
-      onBitsa = onBitsa + countOneBits(a[i]);
-      onBitsb = onBitsb + countOneBits(b[i]);
-  }
-
-  if (onBitsa == 0u && onBitsb == 0u) {
-      return 0.0;
-  }
-
-  let totalOnBits = onBitsa + onBitsb;
-  var commonBits: u32 = 0u;
-  for (var i = 0u; i < ${maxArraySize}u; i = i + 1u) {
-      commonBits = commonBits + countOneBits(a[i] & b[i]);
-  }
-
-  return 1.0 - f32(commonBits) / f32(totalOnBits - commonBits);
-  `;
-}
-function webGPUAsymmetricBitArray(maxArraySize, _entryIndex) {
-    return `
-  var onBitsa: u32 = 0u;
-  var onBitsb: u32 = 0u;
-  for (var i = 0u; i < ${maxArraySize}u; i = i + 1u) {
-      onBitsa = onBitsa + countOneBits(a[i]);
-      onBitsb = onBitsb + countOneBits(b[i]);
-  }
-  let min = min(onBitsa, onBitsb);
-  if (min == 0u) {
-    return 1.0;
-  }
-  var commonBits: u32 = 0u;
-  for (var i = 0u; i < ${maxArraySize}u; i = i + 1u) {
-      commonBits = commonBits + countOneBits(a[i] & b[i]);
-  }
-  return 1.0 - f32(commonBits) / f32(min);
-  `;
-}
-function webGPUCosineBitArray(maxArraySize, _entryIndex) {
-    return `
-  var onBitsa: u32 = 0u;
-  var onBitsb: u32 = 0u;
-  for (var i = 0u; i < ${maxArraySize}u; i = i + 1u) {
-      onBitsa = onBitsa + countOneBits(a[i]);
-      onBitsb = onBitsb + countOneBits(b[i]);
-  }
-  let total = onBitsa * onBitsb; // p.s. here total is taken by multiplying
-  if (total == 0u) {
-    return 1.0;
-  }
-  var commonBits: u32 = 0u;
-  for (var i = 0u; i < ${maxArraySize}u; i = i + 1u) {
-      commonBits = commonBits + countOneBits(a[i] & b[i]);
-  }
-  return 1.0 - f32(commonBits) / sqrt(f32(total));
-  `;
-}
-function webGPUSokalBitArray(maxArraySize, _entryIndex) {
-    return `
-  var onBitsa: u32 = 0u;
-  var onBitsb: u32 = 0u;
-  for (var i = 0u; i < ${maxArraySize}u; i = i + 1u) {
-      onBitsa = onBitsa + countOneBits(a[i]);
-      onBitsb = onBitsb + countOneBits(b[i]);
-  }
-  let total = onBitsa + onBitsb;
-  if (total == 0u) {
-    return 1.0;
-  }
-  var commonBits: u32 = 0u;
-  for (var i = 0u; i < ${maxArraySize}u; i = i + 1u) {
-      commonBits = commonBits + countOneBits(a[i] & b[i]);
-  }
-  return 1.0 - f32(commonBits) / f32(total * 2 - commonBits * 3);
-  `;
-}
-var WEBGPUDISTANCE;
-(function (WEBGPUDISTANCE) {
-    WEBGPUDISTANCE["HAMMING"] = "Hamming";
-    WEBGPUDISTANCE["EUCLIDEAN"] = "Euclidean";
-    WEBGPUDISTANCE["VECTOR_COSINE"] = "Vector Cosine";
-    WEBGPUDISTANCE["MANHATTAN"] = "Manhattan";
-    WEBGPUDISTANCE["TANIMOTO"] = "Tanimoto";
-    WEBGPUDISTANCE["LEVENSTEIN"] = "Levenshtein";
-    WEBGPUDISTANCE["NEEDLEMAN_WUNSCH"] = "Needlemann-Wunsch";
-    WEBGPUDISTANCE["MONOMER_CHEMICAL_DISTANCE"] = "Monomer chemical distance";
-    WEBGPUDISTANCE["SOKAL"] = "Sokal";
-    WEBGPUDISTANCE["COSINE"] = "Cosine";
-    WEBGPUDISTANCE["ASYMMETRIC"] = "Asymmetric";
-    WEBGPUDISTANCE["Difference"] = "Difference";
-    WEBGPUDISTANCE["OneHot"] = "One-Hot";
-})(WEBGPUDISTANCE || (WEBGPUDISTANCE = {}));
-const webGPUFunctions = {
-    [WEBGPUDISTANCE.HAMMING]: webGPUHamming,
-    [WEBGPUDISTANCE.EUCLIDEAN]: webGPUEuclidean,
-    [WEBGPUDISTANCE.MANHATTAN]: webGPUManhattan,
-    [WEBGPUDISTANCE.VECTOR_COSINE]: webGPUVectorCosine,
-    [WEBGPUDISTANCE.TANIMOTO]: webGPUTanimotoBitArray,
-    [WEBGPUDISTANCE.LEVENSTEIN]: webGPULevenstein,
-    [WEBGPUDISTANCE.NEEDLEMAN_WUNSCH]: webGPUNeedlemanWunsch,
-    [WEBGPUDISTANCE.MONOMER_CHEMICAL_DISTANCE]: webGPUMonomerChemicalDistance,
-    [WEBGPUDISTANCE.SOKAL]: webGPUSokalBitArray,
-    [WEBGPUDISTANCE.COSINE]: webGPUCosineBitArray,
-    [WEBGPUDISTANCE.ASYMMETRIC]: webGPUAsymmetricBitArray,
-    [WEBGPUDISTANCE.Difference]: webGPUNumericDistance,
-    [WEBGPUDISTANCE.OneHot]: webGPUOneHotDistance
-};
-const distanceFunctionComplexity = {
-    [WEBGPUDISTANCE.HAMMING]: (maxEntrySize) => Math.ceil(maxEntrySize / 30),
-    [WEBGPUDISTANCE.EUCLIDEAN]: (maxEntrySize) => Math.ceil(maxEntrySize / 30),
-    [WEBGPUDISTANCE.MANHATTAN]: (maxEntrySize) => Math.ceil(maxEntrySize / 30),
-    [WEBGPUDISTANCE.TANIMOTO]: (maxEntrySize) => Math.ceil(maxEntrySize / 30),
-    [WEBGPUDISTANCE.SOKAL]: (maxEntrySize) => Math.ceil(maxEntrySize / 30),
-    [WEBGPUDISTANCE.COSINE]: (maxEntrySize) => Math.ceil(maxEntrySize / 30),
-    [WEBGPUDISTANCE.ASYMMETRIC]: (maxEntrySize) => Math.ceil(maxEntrySize / 30),
-    [WEBGPUDISTANCE.LEVENSTEIN]: (maxEntrySize) => Math.ceil(maxEntrySize * maxEntrySize / 60),
-    [WEBGPUDISTANCE.NEEDLEMAN_WUNSCH]: (maxEntrySize) => Math.ceil(maxEntrySize * maxEntrySize / 60),
-    [WEBGPUDISTANCE.MONOMER_CHEMICAL_DISTANCE]: (maxEntrySize) => Math.ceil(maxEntrySize / 25),
-    [WEBGPUDISTANCE.Difference]: (_maxEntrySize) => 1,
-    [WEBGPUDISTANCE.OneHot]: (_maxEntrySize) => Math.ceil(_maxEntrySize / 40),
-    [WEBGPUDISTANCE.VECTOR_COSINE]: (maxEntrySize) => Math.ceil(maxEntrySize / 30)
-};
-const TypeSupportedDistances = {
-    ["STRING" /* WGPUENTRYTYPE.STRING */]: new Set([WEBGPUDISTANCE.HAMMING, WEBGPUDISTANCE.LEVENSTEIN, WEBGPUDISTANCE.NEEDLEMAN_WUNSCH, WEBGPUDISTANCE.MONOMER_CHEMICAL_DISTANCE, WEBGPUDISTANCE.OneHot]),
-    ["UINT32ARRAY" /* WGPUENTRYTYPE.UINT32ARRAY */]: new Set([WEBGPUDISTANCE.HAMMING, WEBGPUDISTANCE.EUCLIDEAN, WEBGPUDISTANCE.MANHATTAN, WEBGPUDISTANCE.MONOMER_CHEMICAL_DISTANCE, WEBGPUDISTANCE.LEVENSTEIN, WEBGPUDISTANCE.NEEDLEMAN_WUNSCH, WEBGPUDISTANCE.TANIMOTO, WEBGPUDISTANCE.COSINE, WEBGPUDISTANCE.VECTOR_COSINE, WEBGPUDISTANCE.SOKAL, WEBGPUDISTANCE.ASYMMETRIC, WEBGPUDISTANCE.OneHot, WEBGPUDISTANCE.Difference]),
-    ["INT32ARRAY" /* WGPUENTRYTYPE.INT32ARRAY */]: new Set([WEBGPUDISTANCE.EUCLIDEAN, WEBGPUDISTANCE.MANHATTAN, WEBGPUDISTANCE.OneHot, WEBGPUDISTANCE.Difference, WEBGPUDISTANCE.VECTOR_COSINE]),
-    ["FLOAT32ARRAY" /* WGPUENTRYTYPE.FLOAT32ARRAY */]: new Set([WEBGPUDISTANCE.EUCLIDEAN, WEBGPUDISTANCE.MANHATTAN, WEBGPUDISTANCE.Difference, WEBGPUDISTANCE.VECTOR_COSINE]),
-    ["NUMBER" /* WGPUENTRYTYPE.NUMBER */]: new Set([WEBGPUDISTANCE.EUCLIDEAN, WEBGPUDISTANCE.MANHATTAN, WEBGPUDISTANCE.Difference]),
-    ["BITARRAY" /* WGPUENTRYTYPE.BITARRAY */]: new Set([WEBGPUDISTANCE.TANIMOTO, WEBGPUDISTANCE.COSINE, WEBGPUDISTANCE.SOKAL, WEBGPUDISTANCE.ASYMMETRIC])
-};
-//# sourceMappingURL=webGPU-multicol-distances.js.map
-
-/***/ }),
-
-/***/ "./node_modules/@datagrok-libraries/math/src/webGPU/preprocessing/webGPU-process-info.js":
-/*!***********************************************************************************************!*\
-  !*** ./node_modules/@datagrok-libraries/math/src/webGPU/preprocessing/webGPU-process-info.js ***!
-  \***********************************************************************************************/
-/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
-
-__webpack_require__.r(__webpack_exports__);
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */   webGPUProcessInfo: () => (/* binding */ webGPUProcessInfo)
-/* harmony export */ });
-/* harmony import */ var _multi_col_distances_webGPU_multicol_distances__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../multi-col-distances/webGPU-multicol-distances */ "./node_modules/@datagrok-libraries/math/src/webGPU/multi-col-distances/webGPU-multicol-distances.js");
-/* eslint-disable max-len */
-
-function webGPUProcessInfo(entryList, distanceMetric = _multi_col_distances_webGPU_multicol_distances__WEBPACK_IMPORTED_MODULE_0__.WEBGPUDISTANCE.HAMMING, entryIndex, // index of the entries in the list of lists that we want to process
-options = { gapOpenPenalty: 1.0, gapExtensionPenalty: 0.6 }) {
-    var _a, _b;
-    let entryType = null;
-    const encodedList = (() => {
-        if (entryList.some((e) => typeof e === 'string')) {
-            entryType = "STRING" /* WGPUENTRYTYPE.STRING */;
-            return entryList.map((entry) => new Uint32Array(entry.split('').map((c) => c.charCodeAt(0))));
-        }
-        if (entryList.some((e) => typeof e === 'number')) {
-            entryType = "NUMBER" /* WGPUENTRYTYPE.NUMBER */;
-            return entryList.map((entry) => new Float32Array([entry]));
-        }
-        if (typeof entryList[0] == 'object' && entryList.some((e) => '_data' in e && '_length' in e)) {
-            entryType = "BITARRAY" /* WGPUENTRYTYPE.BITARRAY */;
-            return entryList.map((entry) => entry._data);
-        }
-        if (entryList.some((e) => e instanceof Float32Array)) {
-            entryType = "FLOAT32ARRAY" /* WGPUENTRYTYPE.FLOAT32ARRAY */;
-            return entryList;
-        }
-        if (entryList.some((e) => e instanceof Uint32Array)) {
-            entryType = "UINT32ARRAY" /* WGPUENTRYTYPE.UINT32ARRAY */;
-            return entryList;
-        }
-        if (entryList.some((e) => e instanceof Int32Array)) {
-            entryType = "INT32ARRAY" /* WGPUENTRYTYPE.INT32ARRAY */;
-            return entryList;
-        }
-        //return entryList as Uint32Array[];
-    })();
-    if (!encodedList || !entryType)
-        throw new Error('Invalid entry type, could not determine entry type from input list');
-    const encodedListType = encodedList[0] instanceof Int32Array ? "INT32ARRAY" /* WGPUENTRYTYPE.INT32ARRAY */ :
-        encodedList[0] instanceof Float32Array ? "FLOAT32ARRAY" /* WGPUENTRYTYPE.FLOAT32ARRAY */ : "UINT32ARRAY" /* WGPUENTRYTYPE.UINT32ARRAY */;
-    // sizes of each entries might differ, so we need to keep track of that for some distance metrics, like hamming for example
-    const arraySizes = new Uint32Array(encodedList.map((arr) => arr.length));
-    if (!_multi_col_distances_webGPU_multicol_distances__WEBPACK_IMPORTED_MODULE_0__.TypeSupportedDistances[entryType] || !_multi_col_distances_webGPU_multicol_distances__WEBPACK_IMPORTED_MODULE_0__.TypeSupportedDistances[entryType].has(distanceMetric))
-        throw new Error(`Distance metric '${distanceMetric}' not supported for entry type '${entryType}'`);
-    const maxEntryLen = arraySizes.reduce((a, b) => Math.max(a, b), 0);
-    // get the complexity of used algorithm
-    const complexity = _multi_col_distances_webGPU_multicol_distances__WEBPACK_IMPORTED_MODULE_0__.distanceFunctionComplexity[distanceMetric](maxEntryLen);
-    const EncodedArrayConstructor = encodedListType === "INT32ARRAY" /* WGPUENTRYTYPE.INT32ARRAY */ ? Int32Array :
-        (encodedListType === "FLOAT32ARRAY" /* WGPUENTRYTYPE.FLOAT32ARRAY */ ? Float32Array : Uint32Array);
-    const flatSourceArray = new EncodedArrayConstructor(encodedList.length * maxEntryLen);
-    // when setting, we need to set each array at a specific offset, which is controlled by maxArrayLen because each array might have different sizes.
-    // this way we will get correct matrix representation in the compute shader
-    encodedList.forEach((seq, i) => {
-        flatSourceArray.set(seq, i * maxEntryLen);
-    });
-    // NB! all this before the line was generic, now we need to calculate some specific things for some specific distance metrics
-    // initialize supp info line that will be included in the final shader;
-    let suppInfoStructWgsl = ''; // the code that will be included in the struct of suppInfo
-    let suppInfoSize = 0;
-    let suppInfoType = "FLOAT32ARRAY" /* WGPUENTRYTYPE.FLOAT32ARRAY */;
-    let suppInfoBuffer = null;
-    if (distanceMetric === _multi_col_distances_webGPU_multicol_distances__WEBPACK_IMPORTED_MODULE_0__.WEBGPUDISTANCE.NEEDLEMAN_WUNSCH || distanceMetric === _multi_col_distances_webGPU_multicol_distances__WEBPACK_IMPORTED_MODULE_0__.WEBGPUDISTANCE.MONOMER_CHEMICAL_DISTANCE) {
-        let maxMonomerIndex = options.scoringMatrix && options.alphabetIndexes ?
-            Object.keys(options.alphabetIndexes).reduce((prev, n) => Math.max(prev, n.charCodeAt(0)), 0) : -1;
-        // generate default similarity matrix if it is not provided
-        if (!options.alphabetIndexes || !options.scoringMatrix) {
-            for (let i = 0; i < flatSourceArray.length; i++) {
-                if (flatSourceArray[i] > maxMonomerIndex)
-                    maxMonomerIndex = flatSourceArray[i];
-            }
-            options.scoringMatrix =
-                new Array(maxMonomerIndex + 1).fill(null).map(() => new Array(maxMonomerIndex + 1).fill(0));
-            options.alphabetIndexes = {};
-            for (let i = 0; i < options.scoringMatrix.length; i++) {
-                options.scoringMatrix[i][i] = 1;
-                options.alphabetIndexes[String.fromCharCode(i)] = i;
-            }
-        }
-        const similarityMatrixSize = (maxMonomerIndex + 1) * (maxMonomerIndex + 1);
-        const transferedSimilarityMatrix = new Array(maxMonomerIndex + 1).fill(null).map(() => new Float32Array(maxMonomerIndex + 1));
-        // set diagonal to 1
-        for (let i = 0; i < maxMonomerIndex + 1; i++)
-            transferedSimilarityMatrix[i][i] = 1;
-        const alphabetIndexes = options.alphabetIndexes;
-        for (const key of Object.keys(alphabetIndexes)) {
-            for (const key2 of Object.keys(alphabetIndexes)) {
-                if (key === key2)
-                    continue;
-                transferedSimilarityMatrix[key.charCodeAt(0)][key2.charCodeAt(0)] =
-                    options.scoringMatrix[alphabetIndexes[key]][alphabetIndexes[key2]];
-            }
-        }
-        // in memory layout, we will have 2 float32 s for gapOpen and gapExtension penalties, and then f32 array<array<f32>> for similarity matrix.
-        // because of primitives, there will be no padding, so we can calculate the size directly
-        suppInfoSize = 2 + similarityMatrixSize;
-        suppInfoType = "FLOAT32ARRAY" /* WGPUENTRYTYPE.FLOAT32ARRAY */;
-        suppInfoBuffer = new Float32Array(suppInfoSize);
-        suppInfoBuffer[0] = (_a = options.gapOpenPenalty) !== null && _a !== void 0 ? _a : 1.0;
-        suppInfoBuffer[1] = (_b = options.gapExtensionPenalty) !== null && _b !== void 0 ? _b : 0.6;
-        let offset = 2;
-        for (let i = 0; i < transferedSimilarityMatrix.length; i++) {
-            suppInfoBuffer.set(transferedSimilarityMatrix[i], offset);
-            offset += transferedSimilarityMatrix[i].length;
-        }
-        suppInfoStructWgsl = `
-            gapOpenPenalty${entryIndex}: f32,
-            gapExtensionPenalty${entryIndex}: f32,
-            similarityMatrix${entryIndex}: array<array<f32, ${maxMonomerIndex + 1}>, ${maxMonomerIndex + 1}>`;
-    }
-    else if (distanceMetric === _multi_col_distances_webGPU_multicol_distances__WEBPACK_IMPORTED_MODULE_0__.WEBGPUDISTANCE.Difference) {
-        // for difference, we need range of values for normalization of the difference
-        if (!options.range || typeof options.range !== 'number' || options.range <= 0) {
-            const min = flatSourceArray.reduce((a, b) => Math.min(a, b), flatSourceArray[0]);
-            const max = flatSourceArray.reduce((a, b) => Math.max(a, b), flatSourceArray[0]);
-            options.range = max - min;
-        }
-        if (options.range <= 0)
-            options.range = 1.0; // this means that all values are the same, and all distances will produce 0.
-        suppInfoSize = 1;
-        suppInfoType = "FLOAT32ARRAY" /* WGPUENTRYTYPE.FLOAT32ARRAY */;
-        suppInfoBuffer = new Float32Array([options.range]);
-        suppInfoStructWgsl = `
-            range${entryIndex}: f32`;
-    }
-    const dataTypeWGSL = flatSourceArray instanceof Int32Array ? 'i32' : (flatSourceArray instanceof Float32Array ? 'f32' : 'u32');
-    const dataStructWgsl = `data${entryIndex}: array<array<${dataTypeWGSL}, ${maxEntryLen}>, ${encodedList.length}>`;
-    // for now, other distances do not require any additional information, so we can skip that
-    return {
-        flatSourceArray,
-        sourceArraySize: flatSourceArray.length,
-        maxEntryLen,
-        arraySizes,
-        complexity,
-        suppInfoBuffer,
-        suppInfoSize,
-        suppInfoType: suppInfoType,
-        suppInfoStructWgsl,
-        entryType,
-        dataTypeWGSL,
-        dataStructWgsl,
-        EncodedArrayConstructor
-    };
-}
-//# sourceMappingURL=webGPU-process-info.js.map
-
-/***/ }),
-
-/***/ "./node_modules/@datagrok-libraries/math/src/webGPU/sparse-matrix/webGPU-sparse-matrix.js":
-/*!************************************************************************************************!*\
-  !*** ./node_modules/@datagrok-libraries/math/src/webGPU/sparse-matrix/webGPU-sparse-matrix.js ***!
-  \************************************************************************************************/
-/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
-
-__webpack_require__.r(__webpack_exports__);
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */   multiColWebGPUSparseMatrix: () => (/* binding */ multiColWebGPUSparseMatrix)
-/* harmony export */ });
-/* harmony import */ var _multi_col_distances_webGPU_aggregation__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../multi-col-distances/webGPU-aggregation */ "./node_modules/@datagrok-libraries/math/src/webGPU/multi-col-distances/webGPU-aggregation.js");
-/* harmony import */ var _multi_col_distances_webGPU_multicol_distances__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../multi-col-distances/webGPU-multicol-distances */ "./node_modules/@datagrok-libraries/math/src/webGPU/multi-col-distances/webGPU-multicol-distances.js");
-/* harmony import */ var _preprocessing_webGPU_process_info__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../preprocessing/webGPU-process-info */ "./node_modules/@datagrok-libraries/math/src/webGPU/preprocessing/webGPU-process-info.js");
-/* harmony import */ var _getGPUDevice__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../getGPUDevice */ "./node_modules/@datagrok-libraries/math/src/webGPU/getGPUDevice.js");
-var __awaiter = (undefined && undefined.__awaiter) || function (thisArg, _arguments, P, generator) {
-    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
-    return new (P || (P = Promise))(function (resolve, reject) {
-        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
-        function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
-        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
-        step((generator = generator.apply(thisArg, _arguments || [])).next());
-    });
-};
-
-
-
-
-/** generate sparse matrix based on list of lists of entries.
- *  these entries are each encoded as Uint32Array or FLOAT32Array (depending on their type).
- * for example, sequences would be encoded as Uint32Array based on char code of the letter at each position.
- * [65, 66, 67, 68, 69] would be a sequence of 5 letters.
- * for chemical fingerprints, it would be a binary array of 0s and 1s,
- * represented as Uint32Array(_data property of DG bitarray).
- *
- * Be ware that size of entryList, distanceMetrics, weights and options must be the same.
- * if there are no options for entries i, pass an empty object.
- * for now options are needed for
- * needleman-wunsch and monomer chemical distances: see {@link BioDistanceFnOptions} as for how it should be passed
- * numeric distances (Difference): {range: number} where range is the range of the values in the column (max - min).
- * in both cases, if options are not provided, they will be calculated automatically.
- */
-function multiColWebGPUSparseMatrix(entryList, // list of lists of entries, for multiple columns
-threshold = 0.8, // similarity threshold, be ware that if you use too small threshold, there might be memory overflow...
-distanceMetrics, // distance metrics for each column
-aggregationFunction, // aggregation function for the distances
-weights, // weights for each column
-options // supplementary options for each column
-) {
-    return __awaiter(this, void 0, void 0, function* () {
-        const device = yield (0,_getGPUDevice__WEBPACK_IMPORTED_MODULE_3__.getGPUDevice)();
-        if (!device)
-            return null; // if no device, return null, as we cannot do anything without it.
-        const availableDistanceMetrics = Object.values(_multi_col_distances_webGPU_multicol_distances__WEBPACK_IMPORTED_MODULE_1__.WEBGPUDISTANCE);
-        if (distanceMetrics.some((metric) => !availableDistanceMetrics.includes(metric)))
-            throw new Error('Invalid distance metrics provided: ' + distanceMetrics.join(', '));
-        const availableAggregationFunctions = Object.values(_multi_col_distances_webGPU_aggregation__WEBPACK_IMPORTED_MODULE_0__.WEBGSLAGGREGATION);
-        if (!availableAggregationFunctions.includes(aggregationFunction))
-            throw new Error('Invalid aggregation function provided: ' + aggregationFunction);
-        const maxDistance = 1 - threshold; // maximum distance
-        // first, check that all the supplementary options are provided and are the same length:
-        if (options.length !== entryList.length ||
-            options.length !== distanceMetrics.length ||
-            options.length !== weights.length) {
-            throw new Error('Options, weigths and distance functions must be provided for each column');
-        }
-        // check that all the entry lists are the same length
-        if (entryList.some((list) => list.length !== entryList[0].length))
-            throw new Error('All entry lists must be the same length');
-        const numOfColumns = entryList.length; // number of columns
-        const listSize = entryList[0].length; // size of each list (or column)
-        const processInfo = entryList.map((entry, i) => {
-            return (0,_preprocessing_webGPU_process_info__WEBPACK_IMPORTED_MODULE_2__.webGPUProcessInfo)(entry, distanceMetrics[i], i, options[i]);
-        });
-        if (numOfColumns === 0) {
-            throw new Error('No columns provided. Please provide at least one column of data.');
-        }
-        if (numOfColumns === 1)
-            aggregationFunction = _multi_col_distances_webGPU_aggregation__WEBPACK_IMPORTED_MODULE_0__.WEBGSLAGGREGATION.MANHATTAN; // save a bit of time
-        // combine all struct types into one to put into the suppInfo struct.
-        let suppInfoWgsl = processInfo
-            .map((info) => info.suppInfoStructWgsl)
-            .filter((wgsl) => !!wgsl && wgsl != '')
-            .join(',\n');
-        // structures in wgsl must have at least one member, so if we have no structures, we need to add a dummy one
-        let needsDummy = false;
-        if (!suppInfoWgsl || suppInfoWgsl.trim() == '') {
-            needsDummy = true;
-            suppInfoWgsl = '\ndummy: f32\n';
-        }
-        // combine all data wgsl struct code into one
-        const dataWgsl = processInfo.map((info) => info.dataStructWgsl).filter((wgsl) => !!wgsl && wgsl != '').join(',\n');
-        // combine all array sizes into one array (easier for setting)
-        const arraySizes = new Uint32Array(numOfColumns * listSize);
-        processInfo.forEach((info, i) => {
-            arraySizes.set(info.arraySizes, i * listSize);
-        }); // array.flat is not as optimized as this
-        // if we try to map large arrays directly from GPU, sometimes, device disconnects. so we need to do it in chunks, a good number
-        // we found is 10000. So we will perform computations in chunks of 10000. meaning that we will dispatch 10000 threads at a time.
-        const numOfThreads = 10000;
-        // in this case we do not need to worry about complexity of the algorithm, as the 100 is low enaugh number, which is limited by memory usage.
-        const sparseResultSizePerThread = 100; // number of iterations per thread (number of pair comparisons)
-        const combinedComplexity = processInfo.reduce((a, b) => a + b.complexity, 0); // combined complexity of all the columns
-        const maxIterationsPerThread = Math.ceil(6000 / combinedComplexity); // maximum number of iterations per thread
-        const workGroupDivision = 10; // how many threads inside of one workgroup dimension (in this case 10 * 10 threads per workgroup)
-        const threadsPerWorkgroup = workGroupDivision * workGroupDivision;
-        const workgroupsDim = Math.ceil(Math.sqrt(Math.ceil(numOfThreads / threadsPerWorkgroup))); // how many workgroups per 2d dimension
-        const globalThreadDimSize = workgroupsDim * workGroupDivision; // how many threads per 2d dimension
-        const condensedDistanceMatrixSize = listSize * (listSize - 1) / 2; // size of the condensed distance matrix, this many comparisons will be made.
-        const dmChunkSizePerThread = Math.ceil(condensedDistanceMatrixSize / numOfThreads); // how many comparisons per thread
-        const module = device.createShaderModule({
-            label: 'Sparse matrix compute shader',
-            code: `
-    // each thread will perform ${sparseResultSizePerThread} iterations at one time, comparing ${sparseResultSizePerThread} pairs of entries.
-    // in total, each thread will perform at most ${dmChunkSizePerThread} comparisons.
-    // first is the result struct, containing is, js, and distances. each array with length of ${sparseResultSizePerThread},
-    // and also integer for how many pairs were found to be below threshold.
-    struct SparseResult {
-      i: array<array<u32, ${sparseResultSizePerThread}>, ${numOfThreads}>,
-      j: array<array<u32, ${sparseResultSizePerThread}>, ${numOfThreads}>,
-      distances: array<array<f32, ${sparseResultSizePerThread}>, ${numOfThreads}>,
-      found: array<u32, ${numOfThreads}>,
-      done: array<u32, ${numOfThreads}>
-    }
-    // struct for the data
-    struct ComputeInfo {
-      // start at cols and rows, and end at cols and rows for each thread, these will be calculated on cpu and passed to gpu.
-      startAtCols: array<u32, ${numOfThreads}>,
-      startAtRows: array<u32, ${numOfThreads}>,
-      endAtCols: array<u32, ${numOfThreads}>,
-      endAtRows: array<u32, ${numOfThreads}>,
-
-      // the ACTUALLY sizes of each entry
-      entrySizes: array<array<u32, ${listSize}>, ${numOfColumns}>,
-      // the weights for each entry
-      weights: array<f32, ${numOfColumns}>,
-      // the data for each entry
-      ${dataWgsl} // an example of the dataWgsl would be:
-      //data0: array<array<u32,20>,100>,
-      //data1: array<array<u32,20>,100>
-    }
-
-    // struct for the supplementary information
-    struct SuppInfo {
-      // struct containing all the supplementary info, like scoring matrix, alphabet indexes, range, etc.
-      ${suppInfoWgsl}
-    };
-
-    @group(0) @binding(0) var<storage, read_write> computeInfo: ComputeInfo;
-    @group(0) @binding(1) var<storage, read_write> suppInfo: SuppInfo;
-    @group(0) @binding(2) var<storage, read_write> results: SparseResult;
-    @compute @workgroup_size(${workGroupDivision}, ${workGroupDivision}) fn calcSparseMatrix(
-      @builtin(global_invocation_id) id: vec3<u32>
-    ) {
-      ${needsDummy ? `let otherDummy = suppInfo.dummy * 2;` : ''} // just to make sure that the suppInfo is not optimized out
-      let threadCol = id.x;
-      let threadRow = id.y;
-      let linearIndex = threadRow * ${globalThreadDimSize} + threadCol;
-      if (linearIndex >= ${numOfThreads}) {
-        return; // if we are out of bounds, return
-      }      
-      var startAtCol: u32 = computeInfo.startAtCols[linearIndex];
-      var startAtRow: u32 = computeInfo.startAtRows[linearIndex];
-      let endAtCol: u32 = min(computeInfo.endAtCols[linearIndex], ${listSize}u);
-      let endAtRow: u32 = min(computeInfo.endAtRows[linearIndex], ${listSize}u);
-      let is = &results.i[linearIndex];
-      let js = &results.j[linearIndex];
-      let distances = &results.distances[linearIndex];
-      results.found[linearIndex] = 0; // initialize the found counter
-      var found: u32 = 0;
-      if (results.done[linearIndex] > 0) {
-        return; // if we are done, return
-      }
-      for (var i = 0; i < ${maxIterationsPerThread}; i++) {
-        if (startAtCol >= endAtCol && startAtRow >= endAtRow) {
-          results.done[linearIndex] = 1;
-          break;
-        }
-        if (found >= ${sparseResultSizePerThread}) {
-          break;
-        }
-        let dist = combinedDistance(startAtCol, startAtRow);
-        if (dist <= ${maxDistance}) {
-          (*is)[found] = startAtCol;
-          (*js)[found] = startAtRow;
-          (*distances)[found] = dist;
-          found = found + 1;
-        }
-        startAtCol = startAtCol + 1;
-        if (startAtCol >= ${listSize}u) {
-          startAtRow += 1;
-          startAtCol = startAtRow + 1;
-        }
-      }
-      results.found[linearIndex] = found;
-      // update the startAtCols and startAtRows
-      computeInfo.startAtCols[linearIndex] = startAtCol;
-      computeInfo.startAtRows[linearIndex] = startAtRow;
-
-    }
-
-    // this will generate the distance script for each distance metric and then combine them into one
-    ${getCombinedDistanceScript(distanceMetrics, processInfo.map((info) => info.maxEntryLen), maxDistance, aggregationFunction)}
-
-
-    `
-        });
-        const pipeline = device.createComputePipeline({
-            label: 'sparse matrix compute pipeline',
-            layout: 'auto',
-            compute: {
-                module,
-                entryPoint: 'calcSparseMatrix',
-            },
-        });
-        // generate startAtCols, startAtRows, endAtCols, endAtRows
-        const startAtCols = new Uint32Array(numOfThreads);
-        const startAtRows = new Uint32Array(numOfThreads);
-        const endAtCols = new Uint32Array(numOfThreads);
-        const endAtRows = new Uint32Array(numOfThreads);
-        const chunkSize = Math.floor(condensedDistanceMatrixSize / numOfThreads); // size of the chunk per thread (in total)
-        let startRow = 0;
-        let startCol = 1;
-        console.time('GPUthreadStarts');
-        for (let i = 0; i < numOfThreads; i++) {
-            const endIdx = i === numOfThreads - 1 ? condensedDistanceMatrixSize - 1 : (i + 1) * chunkSize;
-            // fancy formulas to calculate the start and end indices for the condensed distance matrix for each thread start
-            const endRow = listSize - 2 - Math.floor(Math.sqrt(-8 * endIdx + 4 * listSize * (listSize - 1) - 7) / 2 - 0.5);
-            const endCol = endIdx - listSize * endRow + Math.floor((endRow + 1) * (endRow + 2) / 2);
-            startAtCols[i] = startCol;
-            startAtRows[i] = startRow;
-            endAtCols[i] = endCol;
-            endAtRows[i] = endRow;
-            startRow = endRow;
-            startCol = endCol;
-            // const startRow = values[0].length - 2 - Math.floor(
-            //   Math.sqrt(-8 * startIdx + 4 * values[0].length * (values[0].length - 1) - 7) / 2 - 0.5);
-            // const startCol = startIdx - values[0].length * startRow + Math.floor((startRow + 1) * (startRow + 2) / 2);
-        }
-        console.timeEnd('GPUthreadStarts');
-        // size of the computeInfo buffer
-        const computeInfoBuffer32Size = numOfThreads * 4 + // startAtCols, startAtRows, endAtCols, endAtRows
-            listSize * numOfColumns + // entrySizes
-            numOfColumns + // weights
-            processInfo.reduce((a, b) => a + b.sourceArraySize, 0);
-        // size of the suppInfo buffer
-        const suppInfoBuffer32Size = processInfo.reduce((a, b) => a + b.suppInfoSize, 0);
-        // size of the results buffer
-        const sparseMatrixEachArray32Size = sparseResultSizePerThread * numOfThreads;
-        const resultsBuffer32Size = 3 * sparseMatrixEachArray32Size + numOfThreads + numOfThreads; // i, j, distances, found, done
-        // create a buffer on the GPU to hold computeInfo
-        // beware that struct must be padded to 16 bytes, so we need to calculate the size of the struct in 32bit values
-        const computeInfoBufferSize = computeInfoBuffer32Size * Uint32Array.BYTES_PER_ELEMENT;
-        let paddedComputeInfoBufferSize = computeInfoBufferSize;
-        const remainder = computeInfoBufferSize & 15; // check if the size is a multiple of 16
-        if (remainder !== 0)
-            paddedComputeInfoBufferSize += 16 - remainder; // pad the size accordingly
-        const computeInfoBuffer = device.createBuffer({
-            label: 'compute info buffer',
-            size: paddedComputeInfoBufferSize,
-            usage: GPUBufferUsage.STORAGE |
-                GPUBufferUsage.COPY_SRC |
-                GPUBufferUsage.COPY_DST,
-            mappedAtCreation: true,
-        });
-        const mappedComputeInfoArrayBuffer = computeInfoBuffer.getMappedRange(); // get full buffer
-        // dynamic offset for the computeInfo buffer
-        let computeInfoOffSet = 0;
-        // first write the startAtCols, startAtRows, endAtCols, endAtRows
-        const startAtColsBufferView = new Uint32Array(mappedComputeInfoArrayBuffer, computeInfoOffSet, numOfThreads);
-        startAtColsBufferView.set(startAtCols);
-        computeInfoOffSet += numOfThreads * Uint32Array.BYTES_PER_ELEMENT; // array of 32bit values
-        const startAtRowsBufferView = new Uint32Array(mappedComputeInfoArrayBuffer, computeInfoOffSet, numOfThreads);
-        startAtRowsBufferView.set(startAtRows);
-        computeInfoOffSet += numOfThreads * Uint32Array.BYTES_PER_ELEMENT; // array of 32bit values
-        const endAtColsBufferView = new Uint32Array(mappedComputeInfoArrayBuffer, computeInfoOffSet, numOfThreads);
-        endAtColsBufferView.set(endAtCols);
-        computeInfoOffSet += numOfThreads * Uint32Array.BYTES_PER_ELEMENT; // array of 32bit values
-        const endAtRowsBufferView = new Uint32Array(mappedComputeInfoArrayBuffer, computeInfoOffSet, numOfThreads);
-        endAtRowsBufferView.set(endAtRows);
-        computeInfoOffSet += numOfThreads * Uint32Array.BYTES_PER_ELEMENT; // array of 32bit values
-        // then write the entrySizes
-        const entrySizesView = new Uint32Array(mappedComputeInfoArrayBuffer, computeInfoOffSet, arraySizes.length);
-        entrySizesView.set(arraySizes);
-        computeInfoOffSet += arraySizes.length * Uint32Array.BYTES_PER_ELEMENT; // array of 32bit values
-        // then write the weights
-        const weightsView = new Float32Array(mappedComputeInfoArrayBuffer, computeInfoOffSet, numOfColumns);
-        weightsView.set(weights);
-        computeInfoOffSet += numOfColumns * Float32Array.BYTES_PER_ELEMENT;
-        // finally, write the data itself
-        for (const info of processInfo) {
-            const ArrayConstructor = info.EncodedArrayConstructor;
-            const chunkSize = info.sourceArraySize;
-            const dataView = new ArrayConstructor(mappedComputeInfoArrayBuffer, computeInfoOffSet, chunkSize); //new ArrayConstructor(computeInfoBuffer.getMappedRange(computeInfoOffSet, chunkByteSize));
-            dataView.set(info.flatSourceArray);
-            computeInfoOffSet += chunkSize * ArrayConstructor.BYTES_PER_ELEMENT;
-        }
-        // we are done at this point.
-        computeInfoBuffer.unmap();
-        // create a buffer on the GPU to hold suppInfo
-        // same here, we need to pad the size of the struct to 16 bytes
-        const suppInfoBufferSize = suppInfoBuffer32Size * Uint32Array.BYTES_PER_ELEMENT;
-        let paddedSuppInfoBufferSize = suppInfoBufferSize;
-        const suppInfoRemainder = suppInfoBufferSize & 15; // check if the size is a multiple of 16
-        if (suppInfoRemainder !== 0)
-            paddedSuppInfoBufferSize += 16 - suppInfoRemainder; // pad the size accordingly
-        paddedSuppInfoBufferSize = Math.max(paddedSuppInfoBufferSize, 16);
-        const suppInfoBuffer = device.createBuffer({
-            label: 'supp info buffer',
-            size: paddedSuppInfoBufferSize,
-            usage: GPUBufferUsage.STORAGE |
-                GPUBufferUsage.COPY_SRC |
-                GPUBufferUsage.COPY_DST,
-            mappedAtCreation: true,
-        });
-        const mappedSuppInfoArrayBuffer = suppInfoBuffer.getMappedRange(); // get full buffer
-        let suppInfoOffSet = 0;
-        for (const info of processInfo) {
-            if (info.suppInfoBuffer && info.suppInfoBuffer.byteLength > 0 && info.suppInfoSize > 0) {
-                const ArrayConstructor = info.suppInfoType === "UINT32ARRAY" /* WGPUENTRYTYPE.UINT32ARRAY */ ? Uint32Array : Float32Array;
-                const suppInfoView = new ArrayConstructor(mappedSuppInfoArrayBuffer, suppInfoOffSet, info.suppInfoBuffer.length); //new ArrayConstructor(suppInfoBuffer.getMappedRange(suppInfoOffSet, info.suppInfoBuffer.byteLength));
-                suppInfoView.set(info.suppInfoBuffer);
-                suppInfoOffSet += info.suppInfoBuffer.byteLength; // info.suppInfoBuffer.length * ArrayConstructor.BYTES_PER_ELEMENT;
-            }
-        }
-        if (suppInfoOffSet === 0) {
-            const dummyView = new Uint32Array(mappedSuppInfoArrayBuffer, 0, 4); //new Uint32Array(suppInfoBuffer.getMappedRange(0, 16));
-            dummyView.set([1, 1, 1, 1]);
-        }
-        suppInfoBuffer.unmap();
-        // create a buffer for the results
-        const resultsBufferSize = resultsBuffer32Size * Uint32Array.BYTES_PER_ELEMENT;
-        let paddedResultsBufferSize = resultsBufferSize;
-        const resultsRemainder = resultsBufferSize & 15; // check if the size is a multiple of 16
-        if (resultsRemainder !== 0)
-            paddedResultsBufferSize += 16 - resultsRemainder; // pad the size accordingly
-        const resultsBuffer = device.createBuffer({
-            label: 'results buffer',
-            size: paddedResultsBufferSize,
-            usage: GPUBufferUsage.STORAGE |
-                GPUBufferUsage.COPY_SRC
-        });
-        // Setup a bindGroup to tell the shader which
-        // buffer to use for the computation
-        const bindGroup = device.createBindGroup({
-            label: 'bindGroup for sparse matrix buffer',
-            layout: pipeline.getBindGroupLayout(0),
-            entries: [
-                { binding: 0, resource: { buffer: computeInfoBuffer } },
-                { binding: 1, resource: { buffer: suppInfoBuffer } },
-                { binding: 2, resource: { buffer: resultsBuffer } },
-            ],
-        });
-        //const pairComparisonsPerPass = maxIterationsPerThread * numOfThreads;
-        //const passes = Math.ceil(condensedDistanceMatrixSize / pairComparisonsPerPass);
-        // we will distpatch this many passes to the GPU, and it will handle indexes all by itself.
-        // we already copied the start/end information to it, so it will know where to start and end on each pass.
-        const resultsOutBuffer = device.createBuffer({
-            label: 'results out buffer',
-            size: resultsBuffer.size,
-            usage: GPUBufferUsage.MAP_READ | GPUBufferUsage.COPY_DST,
-        });
-        const resultIs = [];
-        const resultJs = [];
-        const resultDistances = [];
-        //let combinedFound = 0;
-        let isAllDone = false;
-        while (!isAllDone) {
-            // Encode commands to do the computation
-            const encoder = device.createCommandEncoder({
-                label: 'distance encoder',
-            });
-            const pass = encoder.beginComputePass({
-                label: 'distance compute pass',
-            });
-            pass.setPipeline(pipeline);
-            pass.setBindGroup(0, bindGroup);
-            pass.dispatchWorkgroups(workgroupsDim, workgroupsDim);
-            pass.end();
-            encoder.copyBufferToBuffer(resultsBuffer, 0, resultsOutBuffer, 0, resultsOutBuffer.size);
-            // Finish encoding and submit the commands
-            const commandBuffer = encoder.finish();
-            device.queue.submit([commandBuffer]);
-            // Read the results
-            yield device.queue.onSubmittedWorkDone();
-            yield resultsOutBuffer.mapAsync(GPUMapMode.READ);
-            const resultsOutArrayBuffer = resultsOutBuffer.getMappedRange();
-            // read the results
-            let resultOffset = 0;
-            const resultsI = new Uint32Array(resultsOutArrayBuffer, resultOffset, sparseMatrixEachArray32Size);
-            resultOffset += sparseMatrixEachArray32Size * Uint32Array.BYTES_PER_ELEMENT;
-            const resultsJ = new Uint32Array(resultsOutArrayBuffer, resultOffset, sparseMatrixEachArray32Size);
-            resultOffset += sparseMatrixEachArray32Size * Uint32Array.BYTES_PER_ELEMENT;
-            const resultsDistances = new Float32Array(resultsOutArrayBuffer, resultOffset, sparseMatrixEachArray32Size);
-            resultOffset += sparseMatrixEachArray32Size * Float32Array.BYTES_PER_ELEMENT;
-            const resultsFound = new Uint32Array(resultsOutArrayBuffer, resultOffset, numOfThreads);
-            resultOffset += numOfThreads * Uint32Array.BYTES_PER_ELEMENT;
-            const resultsDone = new Uint32Array(resultsOutArrayBuffer, resultOffset, numOfThreads);
-            isAllDone = resultsDone.every((d) => d === 1);
-            const totalResults = resultsFound.reduce((a, b) => a + b, 0);
-            const combinedI = new Uint32Array(totalResults);
-            const combinedJ = new Uint32Array(totalResults);
-            const combinedDistances = new Float32Array(totalResults);
-            let combinedOffset = 0;
-            for (let resI = 0; resI < resultsFound.length; resI++) {
-                const found = resultsFound[resI];
-                if (found === 0)
-                    continue;
-                combinedI.set(resultsI.subarray(resI * sparseResultSizePerThread, resI * sparseResultSizePerThread + found), combinedOffset);
-                combinedJ.set(resultsJ.subarray(resI * sparseResultSizePerThread, resI * sparseResultSizePerThread + found), combinedOffset);
-                combinedDistances.set(resultsDistances.subarray(resI * sparseResultSizePerThread, resI * sparseResultSizePerThread + found), combinedOffset);
-                combinedOffset += found;
-            }
-            resultIs.push(combinedI);
-            resultJs.push(combinedJ);
-            resultDistances.push(combinedDistances);
-            resultsOutBuffer.unmap();
-        }
-        const totalSize = resultIs.reduce((a, b) => a + b.length, 0);
-        const finalI = new Uint32Array(totalSize);
-        const finalJ = new Uint32Array(totalSize);
-        const finalDistances = new Float32Array(totalSize);
-        let finalOffset = 0;
-        for (let i = 0; i < resultIs.length; i++) {
-            finalI.set(resultIs[i], finalOffset);
-            finalJ.set(resultJs[i], finalOffset);
-            finalDistances.set(resultDistances[i], finalOffset);
-            finalOffset += resultIs[i].length;
-        }
-        // as rule mandates, destroy all buffers.
-        computeInfoBuffer.destroy();
-        suppInfoBuffer.destroy();
-        resultsBuffer.destroy();
-        resultsOutBuffer.destroy();
-        return { i: finalI, j: finalJ, distance: finalDistances };
-    });
-}
-function getCombinedDistanceScript(distanceMetrics, maxEntryLens, maxDistance, aggregation) {
-    const distanceWgsls = distanceMetrics.map((metric, i) => {
-        return `
-        fn distanceScript${i}(aIndex: u32, bIndex: u32) -> f32 {
-          let a = computeInfo.data${i}[aIndex];
-          let b = computeInfo.data${i}[bIndex];
-          let maxDistance: f32 = ${maxDistance};
-          ${_multi_col_distances_webGPU_multicol_distances__WEBPACK_IMPORTED_MODULE_1__.webGPUFunctions[metric](maxEntryLens[i], i)}
-        }
-      `;
-    });
-    const allDistanceScripts = distanceWgsls.join('\n');
-    const combineDistancesScript = `
-      fn combinedDistance(aIndex: u32, bIndex: u32) -> f32 {
-        var distances: array<f32, ${distanceMetrics.length}>;
-        ${distanceMetrics.map((_, i) => `distances[${i}] = distanceScript${i}(aIndex, bIndex);`).join('\n')}
-        ${_multi_col_distances_webGPU_aggregation__WEBPACK_IMPORTED_MODULE_0__.WEBGSLAGGREGATIONFUNCTIONS[aggregation](distanceMetrics.length)}
-      }
-    
-    `;
-    return allDistanceScripts + '\n' + combineDistancesScript;
-}
-//# sourceMappingURL=webGPU-sparse-matrix.js.map
-
-/***/ }),
-
-/***/ "./node_modules/@datagrok-libraries/ml/src/distance-matrix/sparse-matrix-service.js":
-/*!******************************************************************************************!*\
-  !*** ./node_modules/@datagrok-libraries/ml/src/distance-matrix/sparse-matrix-service.js ***!
-  \******************************************************************************************/
-/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
-
-__webpack_require__.r(__webpack_exports__);
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */   SparseMatrixService: () => (/* binding */ SparseMatrixService)
-/* harmony export */ });
-/* harmony import */ var _types__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./types */ "./node_modules/@datagrok-libraries/ml/src/distance-matrix/types.js");
-/* harmony import */ var _utils__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./utils */ "./node_modules/@datagrok-libraries/ml/src/distance-matrix/utils.js");
-
-
-class SparseMatrixService {
-    constructor() {
-        this._workerCount = Math.max(navigator.hardwareConcurrency - 2, 1);
-    }
-    static pruneSparseMatrix(orig, maxNum = 1000000) {
-        // bin values
-        const mult = 200;
-        const binRanges = new Uint32Array(mult);
-        const len = orig.distance.length;
-        const distances = orig.distance;
-        for (let i = 0; i < len; i++) {
-            const r = Math.floor(distances[i] * mult);
-            binRanges[r]++;
-        }
-        // get the max distance
-        let acum = 0;
-        let maxIndex = 0;
-        for (let i = 0; i < mult; i++) {
-            acum += binRanges[i];
-            maxIndex = i;
-            if (acum >= maxNum)
-                break;
-        }
-        const resIs = new Uint32Array(acum);
-        const resJs = new Uint32Array(acum);
-        const resDs = new Float32Array(acum);
-        const is = orig.i;
-        const js = orig.j;
-        let ind = 0;
-        const maxDistance = (maxIndex + 1) / mult;
-        for (let i = 0; i < len; i++) {
-            if (distances[i] < maxDistance) {
-                resIs[ind] = is[i];
-                resJs[ind] = js[i];
-                resDs[ind] = distances[i];
-                ind++;
-            }
-        }
-        return { i: resIs, j: resJs, distance: resDs };
-    }
-    async calcMultiColumn(values, fnNames, threshold, opts = [{}], weights = [1], aggregationMethod = _types__WEBPACK_IMPORTED_MODULE_0__.DistanceAggregationMethods.EUCLIDEAN) {
-        const matSize = values[0].length * (values[0].length - 1) / 2;
-        const chunkSize = Math.floor(matSize / this._workerCount);
-        const minThreshold = values[0].length > 20000 ?
-            await this.getMinimalThreshold(values, fnNames, opts, weights, aggregationMethod) : 0;
-        if (threshold < minThreshold) {
-            console.log(`using threshold ${minThreshold}`);
-            threshold = minThreshold;
-        }
-        opts.forEach((_, i) => opts[i]['threshold'] = threshold);
-        const promises = new Array(this._workerCount);
-        const workers = new Array(this._workerCount)
-            .fill(null).map(() => new Worker(new URL(/* worker import */ __webpack_require__.p + __webpack_require__.u("node_modules_datagrok-libraries_ml_src_distance-matrix_sparse-matrix-worker_js"), __webpack_require__.b)));
-        for (let idx = 0; idx < this._workerCount; idx++) {
-            promises[idx] = new Promise((resolveWorker, rejectWorker) => {
-                const startIdx = idx * chunkSize;
-                const endIdx = idx === this._workerCount - 1 ? matSize : (idx + 1) * chunkSize;
-                if (endIdx <= startIdx)
-                    resolveWorker({ i: new Int32Array(0), j: new Int32Array(0), distance: new Float32Array(0), idx });
-                workers[idx].postMessage({ values, startIdx, endIdx, threshold, fnNames, opts, weights, aggregationMethod });
-                workers[idx].onmessage = ({ data: { error, i, j, distance } }) => {
-                    if (error) {
-                        workers[idx].terminate();
-                        rejectWorker(error);
-                    }
-                    else {
-                        workers[idx].terminate();
-                        resolveWorker({ i, j, distance, idx });
-                    }
-                };
-            });
-        }
-        const results = await Promise.all(promises);
-        const fullSize = results.reduce((acc, val) => acc + val.i.length, 0);
-        const i = new Int32Array(fullSize);
-        const j = new Int32Array(fullSize);
-        const distance = new Float32Array(fullSize);
-        let offset = 0;
-        // setting the results
-        for (const res of results) {
-            i.set(res.i, offset);
-            j.set(res.j, offset);
-            distance.set(res.distance, offset);
-            offset += res.i.length;
-        }
-        return { i, j, distance };
-    }
-    async calc(values, fnName, threshold, opts = {}) {
-        //size of full matrix
-        return await this.calcMultiColumn([values], [fnName], threshold, [opts], [1]);
-    }
-    async getKNN(values, fnName, nNeighbours = 15, opts = {}) {
-        return await this.multiColumnKNN([values], [fnName], nNeighbours, [opts], [1]);
-    }
-    async getThresholdKNN(values, fnName, threshold = 0.8, opts = {}) {
-        return await this.multiColumnThresholdKnn([values], [fnName], threshold, [opts], [1]);
-    }
-    async multiColumnThresholdKnn(values, fnNames, threshold = 0.8, opts, weights, aggregationMethod = _types__WEBPACK_IMPORTED_MODULE_0__.DistanceAggregationMethods.EUCLIDEAN) {
-        if (values.length !== fnNames.length || values.length !== opts.length || values.length !== weights.length)
-            throw new Error('values, distance functions, options and weights arrays should have the same length');
-        if (values.some((v) => v.length !== values[0].length))
-            throw new Error('all values arrays should have the same length');
-        const matSize = values[0].length * (values[0].length - 1) / 2;
-        const chunkSize = Math.floor(matSize / this._workerCount);
-        const promises = new Array(this._workerCount);
-        const workers = new Array(this._workerCount)
-            .fill(null).map(() => new Worker(new URL(/* worker import */ __webpack_require__.p + __webpack_require__.u("vendors-node_modules_datagrok-libraries_ml_src_distance-matrix_knn-threshold-worker_js"), __webpack_require__.b)));
-        for (let idx = 0; idx < this._workerCount; idx++) {
-            promises[idx] = new Promise((resolveWorker, rejectWorker) => {
-                const startIdx = idx * chunkSize;
-                const endIdx = idx === this._workerCount - 1 ? matSize : (idx + 1) * chunkSize;
-                if (endIdx <= startIdx)
-                    resolveWorker({ knnDistances: new Array(0), knnIndexes: new Array(0) });
-                workers[idx].postMessage({ values, startIdx, endIdx, fnNames, opts, threshold, weights, aggregationMethod });
-                workers[idx].onmessage = ({ data: { error, knnDistances, knnIndexes } }) => {
-                    if (error) {
-                        workers[idx].terminate();
-                        rejectWorker(error);
-                    }
-                    else {
-                        workers[idx].terminate();
-                        resolveWorker({ knnDistances, knnIndexes });
-                    }
-                };
-            });
-        }
-        const results = await Promise.all(promises);
-        const knnSizes = new Int32Array(values[0].length);
-        for (const res of results) {
-            for (let i = 0; i < values[0].length; ++i)
-                knnSizes[i] += res.knnIndexes[i]?.length ?? 0;
-        }
-        const knnRes = {
-            knnDistances: new Array(values[0].length).fill(null).map((_, i) => new Array(knnSizes[i])),
-            knnIndexes: new Array(values[0].length).fill(null).map((_, i) => new Array(knnSizes[i]))
-        };
-        for (const res of results) {
-            for (let i = 0; i < values[0].length; ++i) {
-                for (let j = 0; j < (res.knnDistances[i]?.length ?? 0); ++j) {
-                    knnRes.knnDistances[i][knnSizes[i] - 1] = res.knnDistances[i][j];
-                    knnRes.knnIndexes[i][knnSizes[i] - 1] = res.knnIndexes[i][j];
-                    knnSizes[i] -= 1;
-                }
-            }
-        }
-        return knnRes;
-    }
-    async multiColumnSingleValueKNN(values, targetIdx, fnNames, nNeighbours = 15, opts, weights, aggregationMethod = _types__WEBPACK_IMPORTED_MODULE_0__.DistanceAggregationMethods.EUCLIDEAN) {
-        if (values.length !== fnNames.length || values.length !== opts.length || values.length !== weights.length)
-            throw new Error('values, distance functions, options and weights arrays should have the same length');
-        if (values.some((v) => v.length !== values[0].length))
-            throw new Error('all values arrays should have the same length');
-        const workers = new Array(this._workerCount)
-            .fill(null).map(() => new Worker(new URL(/* worker import */ __webpack_require__.p + __webpack_require__.u("node_modules_datagrok-libraries_ml_src_distance-matrix_single-value-knn-worker_js"), __webpack_require__.b)));
-        const promises = new Array(this._workerCount);
-        const fullSize = values[0].length;
-        const target = values.map((v) => v[targetIdx]);
-        const chunkSize = Math.ceil(fullSize / this._workerCount);
-        for (let idx = 0; idx < this._workerCount; idx++) {
-            promises[idx] = new Promise((resolveWorker, rejectWorker) => {
-                const startIdx = idx * chunkSize;
-                const endIdx = idx === this._workerCount - 1 ? fullSize : (idx + 1) * chunkSize;
-                if (endIdx <= startIdx)
-                    resolveWorker({ knnDistances: new Array(0), knnIndexes: new Array(0) });
-                workers[idx].postMessage({ values: values.map((v) => v.slice(startIdx, endIdx)), target, fnNames, opts, nNeighbours, weights, aggregationMethod, startIdx });
-                workers[idx].onmessage = ({ data: { error, knnDistances, knnIndexes } }) => {
-                    if (error) {
-                        workers[idx].terminate();
-                        rejectWorker(error);
-                    }
-                    else {
-                        workers[idx].terminate();
-                        resolveWorker({ knnDistances, knnIndexes });
-                    }
-                };
-            });
-        }
-        const results = await Promise.all(promises);
-        const singleValueKnn = { knnDistances: new Array(nNeighbours).fill(99999), knnIndexes: new Array(nNeighbours).fill(-1) };
-        for (const res of results) {
-            for (let j = 0; j < (res.knnDistances?.length ?? 0); ++j)
-                (0,_utils__WEBPACK_IMPORTED_MODULE_1__.insertSmaller)(singleValueKnn.knnDistances, singleValueKnn.knnIndexes, res.knnDistances[j], res.knnIndexes[j]);
-        }
-        return singleValueKnn;
-    }
-    async multiColumnKNN(values, fnNames, nNeighbours = 15, opts, weights, aggregationMethod = _types__WEBPACK_IMPORTED_MODULE_0__.DistanceAggregationMethods.EUCLIDEAN) {
-        if (values.length !== fnNames.length || values.length !== opts.length || values.length !== weights.length)
-            throw new Error('values, distance functions, options and weights arrays should have the same length');
-        if (values.some((v) => v.length !== values[0].length))
-            throw new Error('all values arrays should have the same length');
-        const matSize = values[0].length * (values[0].length - 1) / 2;
-        const chunkSize = Math.floor(matSize / this._workerCount);
-        const promises = new Array(this._workerCount);
-        const workers = new Array(this._workerCount)
-            .fill(null).map(() => new Worker(new URL(/* worker import */ __webpack_require__.p + __webpack_require__.u("vendors-node_modules_datagrok-libraries_ml_src_distance-matrix_knn-worker_js"), __webpack_require__.b)));
-        for (let idx = 0; idx < this._workerCount; idx++) {
-            promises[idx] = new Promise((resolveWorker, rejectWorker) => {
-                const startIdx = idx * chunkSize;
-                const endIdx = idx === this._workerCount - 1 ? matSize : (idx + 1) * chunkSize;
-                if (endIdx <= startIdx)
-                    resolveWorker({ knnDistances: new Array(0), knnIndexes: new Array(0) });
-                workers[idx].postMessage({ values, startIdx, endIdx, fnNames, opts, nNeighbours, weights, aggregationMethod });
-                workers[idx].onmessage = ({ data: { error, knnDistances, knnIndexes } }) => {
-                    if (error) {
-                        workers[idx].terminate();
-                        rejectWorker(error);
-                    }
-                    else {
-                        workers[idx].terminate();
-                        resolveWorker({ knnDistances, knnIndexes });
-                    }
-                };
-            });
-        }
-        const results = await Promise.all(promises);
-        const knnRes = {
-            knnDistances: new Array(values[0].length).fill(null).map(() => new Array(nNeighbours).fill(99999)),
-            knnIndexes: new Array(values[0].length).fill(null).map(() => new Array(nNeighbours).fill(-1))
-        };
-        for (const res of results) {
-            for (let i = 0; i < values[0].length; ++i) {
-                for (let j = 0; j < (res.knnDistances[i]?.length ?? 0); ++j)
-                    (0,_utils__WEBPACK_IMPORTED_MODULE_1__.insertSmaller)(knnRes.knnDistances[i], knnRes.knnIndexes[i], res.knnDistances[i][j], res.knnIndexes[i][j]);
-            }
-        }
-        return knnRes;
-    }
-    async getSampleDistances(values, fnNames, opts = [], weights, aggregationMethod = _types__WEBPACK_IMPORTED_MODULE_0__.DistanceAggregationMethods.EUCLIDEAN) {
-        const thresholdWorkers = new Array(this._workerCount).fill(null)
-            .map(() => new Worker(new URL(/* worker import */ __webpack_require__.p + __webpack_require__.u("vendors-node_modules_datagrok-libraries_ml_src_distance-matrix_sparse-matrix-threshold-worker_js"), __webpack_require__.b)));
-        try {
-            const matSize = values[0].length * (values[0].length - 1) / 2;
-            const chunkSize = Math.floor(matSize / this._workerCount);
-            const maxSampleSize = 1000000;
-            const sampleSise = Math.max(Math.min(matSize / 1000, maxSampleSize), Math.min(matSize, maxSampleSize));
-            const testSetSizePerWorker = Math.floor(sampleSise / this._workerCount);
-            const tPromises = new Array(this._workerCount);
-            for (let idx = 0; idx < this._workerCount; idx++) {
-                tPromises[idx] = new Promise((resolveWorker, rejectWorker) => {
-                    const startIdx = idx * chunkSize;
-                    const endIdx = idx === this._workerCount - 1 ? matSize : (idx + 1) * chunkSize;
-                    thresholdWorkers[idx].postMessage({
-                        values: values, startIdx, endIdx, sampleLength: testSetSizePerWorker,
-                        fnNames, opts, weights, aggregationMethod
-                    });
-                    thresholdWorkers[idx].onmessage = ({ data: { error, distance } }) => {
-                        thresholdWorkers[idx].terminate();
-                        if (error)
-                            rejectWorker(error);
-                        else
-                            resolveWorker({ distance });
-                    };
-                });
-            }
-            const results = await Promise.all(tPromises);
-            const fullSize = results.reduce((acc, val) => acc + val.distance.length, 0);
-            const distance = new Float32Array(fullSize);
-            let offset = 0;
-            for (const res of results) {
-                distance.set(res.distance, offset);
-                offset += res.distance.length;
-            }
-            distance.sort();
-            return distance;
-        }
-        catch (e) {
-            thresholdWorkers?.forEach((w) => w?.terminate());
-            console.error(e);
-            return new Float32Array(1).fill(0.5);
-        }
-    }
-    async getMinimalThreshold(values, fnNames, opts = [], weights, aggregationMethod = _types__WEBPACK_IMPORTED_MODULE_0__.DistanceAggregationMethods.EUCLIDEAN) {
-        //We need to calculate the minimal threshold first,
-        //in order to get matrix such that it does not exceed the maximum size of 1GB
-        //we have 3 return arrays, each 4 bites per element, so if the maximum size of the matrix is 1GB,
-        const maxSparseMatrixSize = 70000000;
-        try {
-            const matSize = values.length * (values.length - 1) / 2;
-            const distance = await this.getSampleDistances(values, fnNames, opts, weights, aggregationMethod);
-            const fractionIndex = Math.floor(maxSparseMatrixSize / matSize * distance.length);
-            const threshold = 1 - distance[fractionIndex];
-            // threshold = Math.max(threshold, 0.3);
-            return threshold;
-        }
-        catch (e) {
-            console.error(e);
-            return 0.5;
-        }
-    }
-    static calcSync(values, fnName, distanceFn, threshold) {
-        const i = [];
-        const j = [];
-        const distances = [];
-        let cnt = 0;
-        let mi = 0;
-        let mj = 0;
-        const fullSize = values.length * (values.length - 1) / 2;
-        while (cnt < fullSize) {
-            //const value = seq1List[mi] && seq1List[mj] ? hamming(seq1List[mi], seq1List[mj]) : 0;
-            const value = !(0,_utils__WEBPACK_IMPORTED_MODULE_1__.isNil)(values[mi]) && !(0,_utils__WEBPACK_IMPORTED_MODULE_1__.isNil)(values[mj]) ?
-                distanceFn(values[mi], values[mj]) : 1;
-            const similarity = 1 - value;
-            if (similarity >= threshold) {
-                i.push(mi);
-                j.push(mj);
-                distances.push(value);
-            }
-            cnt++;
-            mj++;
-            if (mj === values.length) {
-                mi++;
-                mj = mi + 1;
-            }
-        }
-        const iArray = new Int32Array(i);
-        const jArray = new Int32Array(j);
-        const distanceArray = new Float32Array(distances);
-        return { i: iArray, j: jArray, distance: distanceArray };
-    }
-}
-//# sourceMappingURL=data:application/json;base64,{"version":3,"file":"sparse-matrix-service.js","sourceRoot":"","sources":["sparse-matrix-service.ts"],"names":[],"mappings":"AACA,OAAO,EAA4B,0BAA0B,EAAC,MAAM,SAAS,CAAC;AAC9E,OAAO,EAAC,aAAa,EAAE,KAAK,EAAC,MAAM,SAAS,CAAC;AAa7C,MAAM,OAAO,mBAAmB;IAE5B;QACE,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,mBAAmB,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACrE,CAAC;IAED,MAAM,CAAC,iBAAiB,CAAC,IAAwB,EAAE,MAAM,GAAG,OAAS;QACnE,aAAa;QACb,MAAM,IAAI,GAAG,GAAG,CAAC;QACjB,MAAM,SAAS,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC;QACxC,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QACjC,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;YAC1C,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;QACjB,CAAC;QAED,uBAAuB;QACvB,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,QAAQ,GAAG,CAAC,CAAA;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC;YACrB,QAAQ,GAAG,CAAC,CAAC;YACb,IAAI,IAAI,IAAI,MAAM;gBAChB,MAAM;QACV,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC;QACpC,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC;QACpC,MAAM,KAAK,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC;QACrC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;QAClB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;QAClB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,MAAM,WAAW,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;QAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,SAAS,CAAC,CAAC,CAAC,GAAG,WAAW,EAAE,CAAC;gBAC/B,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;gBACnB,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;gBACnB,KAAK,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;gBAC1B,GAAG,EAAG,CAAC;YACT,CAAC;QACH,CAAC;QACD,OAAO,EAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAC,CAAC;IAC/C,CAAC;IAEM,KAAK,CAAC,eAAe,CAAC,MAAoB,EAAE,OAAuB,EACxE,SAAiB,EAAE,OAA6B,CAAC,EAAE,CAAC,EAAE,UAAoB,CAAC,CAAC,CAAC,EAC7E,oBAA+C,0BAA0B,CAAC,SAAS;QAEnF,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC9D,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC;QAE1D,MAAM,YAAY,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,KAAM,CAAC,CAAC;YAC9C,MAAM,IAAI,CAAC,mBAAmB,CAAC,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxF,IAAI,SAAS,GAAG,YAAY,EAAE,CAAC;YAC7B,OAAO,CAAC,GAAG,CAAC,mBAAmB,YAAY,EAAE,CAAC,CAAC;YAC/C,SAAS,GAAG,YAAY,CAAC;QAC3B,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,SAAS,CAAC,CAAC;QACzD,MAAM,QAAQ,GACZ,IAAI,KAAK,CAA8B,IAAI,CAAC,YAAY,CAAC,CAAC;QAE5D,MAAM,OAAO,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC;aACzC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,MAAM,CAAC,IAAI,GAAG,CAAC,wBAAwB,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACxF,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,YAAY,EAAE,GAAG,EAAE,EAAE,CAAC;YACjD,QAAQ,CAAC,GAAG,CAAC,GAAG,IAAI,OAAO,CAAC,CAAC,aAAa,EAAE,YAAY,EAAE,EAAE;gBAC1D,MAAM,QAAQ,GAAG,GAAG,GAAG,SAAS,CAAC;gBACjC,MAAM,MAAM,GAAG,GAAG,KAAK,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC;gBAC/E,IAAI,MAAM,IAAI,QAAQ;oBACpB,aAAa,CAAC,EAAC,CAAC,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,YAAY,CAAC,CAAC,CAAC,EAAE,GAAG,EAAC,CAAC,CAAC;gBAClG,OAAO,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,EAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,iBAAiB,EAAC,CAAC,CAAC;gBAC3G,OAAO,CAAC,GAAG,CAAC,CAAC,SAAS,GAAG,CAAC,EAAC,IAAI,EAAE,EAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAC,EAAC,EAAQ,EAAE;oBACjE,IAAI,KAAK,EAAE,CAAC;wBACV,OAAO,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC;wBACzB,YAAY,CAAC,KAAK,CAAC,CAAC;oBACtB,CAAC;yBAAM,CAAC;wBACN,OAAO,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC;wBACzB,aAAa,CAAC,EAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAC,CAAC,CAAC;oBACvC,CAAC;gBACH,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;QACL,CAAC;QAED,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC5C,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACrE,MAAM,CAAC,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAC;QACnC,MAAM,CAAC,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAC;QACnC,MAAM,QAAQ,GAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC;QAC5C,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,sBAAsB;QACtB,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC1B,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YACrB,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YACrB,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YACnC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;QACzB,CAAC;QACD,OAAO,EAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAC,CAAC;IAC1B,CAAC;IAEM,KAAK,CAAC,IAAI,CAAI,MAAgB,EAAE,MAAoB,EAAE,SAAiB,EAAE,OAA2B,EAAE;QAC3G,qBAAqB;QACrB,OAAO,MAAM,IAAI,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,SAAS,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAChF,CAAC;IAEM,KAAK,CAAC,MAAM,CACjB,MAAkB,EAAE,MAAoB,EAAE,cAAsB,EAAE,EAAE,OAA2B,EAAE;QAEjG,OAAO,MAAM,IAAI,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,WAAW,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACjF,CAAC;IAEM,KAAK,CAAC,eAAe,CAC1B,MAAkB,EAAE,MAAoB,EAAE,YAAoB,GAAG,EAAE,OAA2B,EAAE;QAEhG,OAAO,MAAM,IAAI,CAAC,uBAAuB,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,SAAS,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACxF,CAAC;IAEM,KAAK,CAAC,uBAAuB,CAAC,MAAyB,EAAE,OAAuB,EAAE,YAAoB,GAAG,EAC9G,IAA0B,EAAE,OAAiB,EAC7C,oBAA+C,0BAA0B,CAAC,SAAS;QAEnF,IAAI,MAAM,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM;YACvG,MAAM,IAAI,KAAK,CAAC,oFAAoF,CAAC,CAAC;QAExG,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YACnD,MAAM,IAAI,KAAK,CAAC,+CAA+C,CAAC,CAAC;QAEnE,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC9D,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC;QAC1D,MAAM,QAAQ,GACZ,IAAI,KAAK,CAAqB,IAAI,CAAC,YAAY,CAAC,CAAC;QACnD,MAAM,OAAO,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC;aACzC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,MAAM,CAAC,IAAI,GAAG,CAAC,wBAAwB,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACxF,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,YAAY,EAAE,GAAG,EAAE,EAAE,CAAC;YACjD,QAAQ,CAAC,GAAG,CAAC,GAAG,IAAI,OAAO,CAAC,CAAC,aAAa,EAAE,YAAY,EAAE,EAAE;gBAC1D,MAAM,QAAQ,GAAG,GAAG,GAAG,SAAS,CAAC;gBACjC,MAAM,MAAM,GAAG,GAAG,KAAK,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC;gBAC/E,IAAI,MAAM,IAAI,QAAQ;oBACpB,aAAa,CAAC,EAAC,YAAY,EAAE,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,IAAI,KAAK,CAAC,CAAC,CAAC,EAAC,CAAC,CAAC;gBACxE,OAAO,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,EAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,iBAAiB,EAAC,CAAC,CAAC;gBAC3G,OAAO,CAAC,GAAG,CAAC,CAAC,SAAS,GAAG,CAAC,EAAC,IAAI,EAAE,EAAC,KAAK,EAAE,YAAY,EAAE,UAAU,EAAC,EAAC,EAAQ,EAAE;oBAC3E,IAAI,KAAK,EAAE,CAAC;wBACV,OAAO,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC;wBACzB,YAAY,CAAC,KAAK,CAAC,CAAC;oBACtB,CAAC;yBAAM,CAAC;wBACN,OAAO,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC;wBACzB,aAAa,CAAC,EAAC,YAAY,EAAE,UAAU,EAAC,CAAC,CAAC;oBAC5C,CAAC;gBACH,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;QACL,CAAC;QAED,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC5C,MAAM,QAAQ,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAClD,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;gBACvC,QAAQ,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC;QAClD,CAAC;QACD,MAAM,MAAM,GAAc;YACxB,YAAY,EAAE,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,KAAK,CAAS,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YAClG,UAAU,EAAE,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,KAAK,CAAS,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;SAAC,CAAC;QACpG,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;gBAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;oBAC5D,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBACjE,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC7D,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBACnB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAEM,KAAK,CAAC,yBAAyB,CAAC,MAAoB,EAAE,SAAiB,EAAE,OAAuB,EAAE,cAAsB,EAAE,EAC/H,IAA0B,EAAE,OAAiB,EAAE,oBAA+C,0BAA0B,CAAC,SAAS;QAElI,IAAI,MAAM,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM;YACvG,MAAM,IAAI,KAAK,CAAC,oFAAoF,CAAC,CAAC;QAExG,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YACnD,MAAM,IAAI,KAAK,CAAC,+CAA+C,CAAC,CAAC;QAEnE,MAAM,OAAO,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC;aACzC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,MAAM,CAAC,IAAI,GAAG,CAAC,2BAA2B,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3F,MAAM,QAAQ,GACZ,IAAI,KAAK,CAAoE,IAAI,CAAC,YAAY,CAAC,CAAC;QAClG,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAClC,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;QAC/C,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC;QAC1D,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,YAAY,EAAE,GAAG,EAAE,EAAE,CAAC;YACjD,QAAQ,CAAC,GAAG,CAAC,GAAG,IAAI,OAAO,CAAC,CAAC,aAAa,EAAE,YAAY,EAAE,EAAE;gBAC1D,MAAM,QAAQ,GAAG,GAAG,GAAG,SAAS,CAAC;gBACjC,MAAM,MAAM,GAAG,GAAG,KAAK,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC;gBAChF,IAAI,MAAM,IAAI,QAAQ;oBACpB,aAAa,CAAC,EAAC,YAAY,EAAE,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,IAAI,KAAK,CAAC,CAAC,CAAC,EAAC,CAAC,CAAC;gBACxE,OAAO,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,EAAC,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,iBAAiB,EAAE,QAAQ,EAAC,CAAC,CAAC;gBAC3J,OAAO,CAAC,GAAG,CAAC,CAAC,SAAS,GAAG,CAAC,EAAC,IAAI,EAAE,EAAC,KAAK,EAAE,YAAY,EAAE,UAAU,EAAC,EAAC,EAAQ,EAAE;oBAC3E,IAAI,KAAK,EAAE,CAAC;wBACV,OAAO,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC;wBACzB,YAAY,CAAC,KAAK,CAAC,CAAC;oBACtB,CAAC;yBAAM,CAAC;wBACN,OAAO,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC;wBACzB,aAAa,CAAC,EAAC,YAAY,EAAE,UAAU,EAAC,CAAC,CAAC;oBAC5C,CAAC;gBACH,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;QACL,CAAC;QAED,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC5C,MAAM,cAAc,GAAG,EAAC,YAAY,EAAE,IAAI,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAG,UAAU,EAAE,IAAI,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAA6D,CAAC;QAEpL,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,YAAY,EAAE,MAAM,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC;gBACtD,aAAa,CAAC,cAAc,CAAC,YAAY,EAAE,cAAc,CAAC,UAAU,EAAE,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QACpH,CAAC;QACD,OAAO,cAAc,CAAC;IACxB,CAAC;IAEM,KAAK,CAAC,cAAc,CAAC,MAAyB,EAAE,OAAuB,EAAE,cAAsB,EAAE,EACtG,IAA0B,EAAE,OAAiB,EAC7C,oBAA+C,0BAA0B,CAAC,SAAS;QAEnF,IAAI,MAAM,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM;YACvG,MAAM,IAAI,KAAK,CAAC,oFAAoF,CAAC,CAAC;QAExG,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YACnD,MAAM,IAAI,KAAK,CAAC,+CAA+C,CAAC,CAAC;QAEnE,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC9D,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC;QAC1D,MAAM,QAAQ,GACZ,IAAI,KAAK,CAAqB,IAAI,CAAC,YAAY,CAAC,CAAC;QACnD,MAAM,OAAO,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC;aACzC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,MAAM,CAAC,IAAI,GAAG,CAAC,cAAc,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9E,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,YAAY,EAAE,GAAG,EAAE,EAAE,CAAC;YACjD,QAAQ,CAAC,GAAG,CAAC,GAAG,IAAI,OAAO,CAAC,CAAC,aAAa,EAAE,YAAY,EAAE,EAAE;gBAC1D,MAAM,QAAQ,GAAG,GAAG,GAAG,SAAS,CAAC;gBACjC,MAAM,MAAM,GAAG,GAAG,KAAK,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC;gBAC/E,IAAI,MAAM,IAAI,QAAQ;oBACpB,aAAa,CAAC,EAAC,YAAY,EAAE,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,IAAI,KAAK,CAAC,CAAC,CAAC,EAAC,CAAC,CAAC;gBACxE,OAAO,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,EAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,iBAAiB,EAAC,CAAC,CAAC;gBAC7G,OAAO,CAAC,GAAG,CAAC,CAAC,SAAS,GAAG,CAAC,EAAC,IAAI,EAAE,EAAC,KAAK,EAAE,YAAY,EAAE,UAAU,EAAC,EAAC,EAAQ,EAAE;oBAC3E,IAAI,KAAK,EAAE,CAAC;wBACV,OAAO,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC;wBACzB,YAAY,CAAC,KAAK,CAAC,CAAC;oBACtB,CAAC;yBAAM,CAAC;wBACN,OAAO,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC;wBACzB,aAAa,CAAC,EAAC,YAAY,EAAE,UAAU,EAAC,CAAC,CAAC;oBAC5C,CAAC;gBACH,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;QACL,CAAC;QAED,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAc;YACxB,YAAY,EAAE,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,KAAK,CAAS,WAAW,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC1G,UAAU,EAAE,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,KAAK,CAAS,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;SAAC,CAAC;QACzG,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;gBAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC;oBACzD,aAAa,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9G,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAEM,KAAK,CAAC,kBAAkB,CAAC,MAAoB,EAClD,OAAuB,EAAE,OAA6B,EAAE,EAAE,OAAiB,EAC3E,oBAA+C,0BAA0B,CAAC,SAAS;QACnF,MAAM,gBAAgB,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;aAC7D,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,MAAM,CAAC,IAAI,GAAG,CAAC,kCAAkC,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAEvF,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YAC9D,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC;YAC1D,MAAM,aAAa,GAAG,OAAS,CAAC;YAChC,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,GAAG,IAAI,EAAE,aAAa,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC,CAAC;YACvG,MAAM,oBAAoB,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC;YACxE,MAAM,SAAS,GAAG,IAAI,KAAK,CAAoC,IAAI,CAAC,YAAY,CAAC,CAAC;YAElF,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,YAAY,EAAE,GAAG,EAAE,EAAE,CAAC;gBACjD,SAAS,CAAC,GAAG,CAAC,GAAG,IAAI,OAAO,CAAC,CAAC,aAAa,EAAE,YAAY,EAAE,EAAE;oBAC3D,MAAM,QAAQ,GAAG,GAAG,GAAG,SAAS,CAAC;oBACjC,MAAM,MAAM,GAAG,GAAG,KAAK,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC;oBAC/E,gBAAgB,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC;wBAChC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,YAAY,EAAE,oBAAoB;wBACpE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,iBAAiB;qBAC1C,CAAC,CAAC;oBACH,gBAAgB,CAAC,GAAG,CAAC,CAAC,SAAS,GAAG,CAAC,EAAC,IAAI,EAAE,EAAC,KAAK,EAAE,QAAQ,EAAC,EAAC,EAAQ,EAAE;wBACpE,gBAAgB,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC;wBAClC,IAAI,KAAK;4BAAE,YAAY,CAAC,KAAK,CAAC,CAAC;;4BAC7B,aAAa,CAAC,EAAC,QAAQ,EAAC,CAAC,CAAC;oBAC9B,CAAC,CAAC;gBACJ,CAAC,CAAC,CAAC;YACL,CAAC;YAED,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAC7C,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAC5E,MAAM,QAAQ,GAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC;YAC5C,IAAI,MAAM,GAAG,CAAC,CAAC;YACf,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;gBAC1B,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;gBACnC,MAAM,IAAI,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC;YAChC,CAAC;YACD,QAAQ,CAAC,IAAI,EAAE,CAAC;YAEhB,OAAO,QAAQ,CAAC;QAClB,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,gBAAgB,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC;YACjD,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACjB,OAAO,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IAEO,KAAK,CAAC,mBAAmB,CAAC,MAAoB,EACpD,OAAuB,EAAE,OAA6B,EAAE,EAAE,OAAiB,EAC3E,oBAA+C,0BAA0B,CAAC,SAAS;QACnF,mDAAmD;QACnD,6EAA6E;QAC7E,iGAAiG;QACjG,MAAM,mBAAmB,GAAG,QAAU,CAAC;QACvC,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YACxD,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,iBAAiB,CAAC,CAAC;YAClG,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,mBAAmB,GAAG,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;YAClF,MAAM,SAAS,GAAG,CAAC,GAAG,QAAQ,CAAC,aAAa,CAAC,CAAC;YAC9C,wCAAwC;YACxC,OAAO,SAAS,CAAC;QACnB,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACjB,OAAO,GAAG,CAAC;QACb,CAAC;IACH,CAAC;IAEM,MAAM,CAAC,QAAQ,CACpB,MAA+B,EAAE,MAAoB,EAAE,UAAoB,EAAE,SAAiB;QAE9F,MAAM,CAAC,GAAa,EAAE,CAAC;QACvB,MAAM,CAAC,GAAa,EAAE,CAAC;QACvB,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACzD,OAAO,GAAG,GAAG,QAAQ,EAAE,CAAC;YACtB,uFAAuF;YACvF,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACtD,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzC,MAAM,UAAU,GAAG,CAAC,GAAG,KAAK,CAAC;YAC7B,IAAI,UAAU,IAAI,SAAS,EAAE,CAAC;gBAC5B,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACX,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACX,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACxB,CAAC;YACD,GAAG,EAAE,CAAC;YACN,EAAE,EAAE,CAAC;YACL,IAAI,EAAE,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC;gBACzB,EAAE,EAAE,CAAC;gBACL,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YACd,CAAC;QACH,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,aAAa,GAAG,IAAI,YAAY,CAAC,SAAS,CAAC,CAAC;QAElD,OAAO,EAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,aAAa,EAAC,CAAC;IACzD,CAAC;CACJ","sourcesContent":["import {KnownMetrics} from '../typed-metrics';\nimport {DistanceAggregationMethod, DistanceAggregationMethods} from './types';\nimport {insertSmaller, isNil} from './utils';\n\nexport type SparseMatrixResult = {\n  i: Int32Array | Uint32Array,\n  j: Int32Array | Uint32Array,\n  distance: Float32Array,\n  idx?: number\n};\n\nexport type KnnResult = {\n  knnDistances: number[][],\n  knnIndexes: number[][]\n}\nexport class SparseMatrixService {\n    private _workerCount: number;\n    constructor() {\n      this._workerCount = Math.max(navigator.hardwareConcurrency - 2, 1);\n    }\n\n    static pruneSparseMatrix(orig: SparseMatrixResult, maxNum = 1_000_000): SparseMatrixResult {\n      // bin values\n      const mult = 200;\n      const binRanges = new Uint32Array(mult);\n      const len = orig.distance.length;\n      const distances = orig.distance;\n      for (let i = 0; i < len; i++) {\n        const r = Math.floor(distances[i] * mult);\n        binRanges[r]++;\n      }\n\n      // get the max distance\n      let acum = 0;\n      let maxIndex = 0\n      for (let i = 0; i < mult; i++) {\n        acum += binRanges[i];\n        maxIndex = i;\n        if (acum >= maxNum)\n          break;\n      }\n      \n      const resIs = new Uint32Array(acum);\n      const resJs = new Uint32Array(acum);\n      const resDs = new Float32Array(acum);\n      const is = orig.i;\n      const js = orig.j;\n      let ind = 0;\n      const maxDistance = (maxIndex + 1) / mult;\n      for (let i = 0; i < len; i++) {\n        if (distances[i] < maxDistance) {\n          resIs[ind] = is[i];\n          resJs[ind] = js[i];\n          resDs[ind] = distances[i];\n          ind ++;\n        }\n      }\n      return {i: resIs, j: resJs, distance: resDs};\n    }\n\n    public async calcMultiColumn(values: Array<any[]>, fnNames: KnownMetrics[],\n      threshold: number, opts: {[_: string]: any}[] = [{}], weights: number[] = [1],\n      aggregationMethod: DistanceAggregationMethod = DistanceAggregationMethods.EUCLIDEAN\n    ) {\n      const matSize = values[0].length * (values[0].length - 1) / 2;\n      const chunkSize = Math.floor(matSize / this._workerCount);\n\n      const minThreshold = values[0].length > 20_000 ?\n        await this.getMinimalThreshold(values, fnNames, opts, weights, aggregationMethod) : 0;\n      if (threshold < minThreshold) {\n        console.log(`using threshold ${minThreshold}`);\n        threshold = minThreshold;\n      }\n      opts.forEach((_, i) => opts[i]['threshold'] = threshold);\n      const promises =\n        new Array<Promise<SparseMatrixResult>>(this._workerCount);\n\n      const workers = new Array(this._workerCount)\n        .fill(null).map(() => new Worker(new URL('./sparse-matrix-worker', import.meta.url)));\n      for (let idx = 0; idx < this._workerCount; idx++) {\n        promises[idx] = new Promise((resolveWorker, rejectWorker) => {\n          const startIdx = idx * chunkSize;\n          const endIdx = idx === this._workerCount - 1 ? matSize : (idx + 1) * chunkSize;\n          if (endIdx <= startIdx)\n            resolveWorker({i: new Int32Array(0), j: new Int32Array(0), distance: new Float32Array(0), idx});\n          workers[idx].postMessage({values, startIdx, endIdx, threshold, fnNames, opts, weights, aggregationMethod});\n          workers[idx].onmessage = ({data: {error, i, j, distance}}): void => {\n            if (error) {\n              workers[idx].terminate();\n              rejectWorker(error);\n            } else {\n              workers[idx].terminate();\n              resolveWorker({i, j, distance, idx});\n            }\n          };\n        });\n      }\n\n      const results = await Promise.all(promises);\n      const fullSize = results.reduce((acc, val) => acc + val.i.length, 0);\n      const i = new Int32Array(fullSize);\n      const j = new Int32Array(fullSize);\n      const distance = new Float32Array(fullSize);\n      let offset = 0;\n      // setting the results\n      for (const res of results) {\n        i.set(res.i, offset);\n        j.set(res.j, offset);\n        distance.set(res.distance, offset);\n        offset += res.i.length;\n      }\n      return {i, j, distance};\n    }\n\n    public async calc<T>(values: Array<T>, fnName: KnownMetrics, threshold: number, opts: {[_: string]: any} = {}) {\n      //size of full matrix\n      return await this.calcMultiColumn([values], [fnName], threshold, [opts], [1]);\n    }\n\n    public async getKNN(\n      values: Array<any>, fnName: KnownMetrics, nNeighbours: number = 15, opts: {[_: string]: any} = {}\n    ) {\n      return await this.multiColumnKNN([values], [fnName], nNeighbours, [opts], [1]);\n    }\n\n    public async getThresholdKNN(\n      values: Array<any>, fnName: KnownMetrics, threshold: number = 0.8, opts: {[_: string]: any} = {}\n    ) {\n      return await this.multiColumnThresholdKnn([values], [fnName], threshold, [opts], [1]);\n    }\n\n    public async multiColumnThresholdKnn(values: Array<Array<any>>, fnNames: KnownMetrics[], threshold: number = 0.8,\n      opts: {[_: string]: any}[], weights: number[],\n      aggregationMethod: DistanceAggregationMethod = DistanceAggregationMethods.EUCLIDEAN\n    ) {\n      if (values.length !== fnNames.length || values.length !== opts.length || values.length !== weights.length)\n        throw new Error('values, distance functions, options and weights arrays should have the same length');\n\n      if (values.some((v) => v.length !== values[0].length))\n        throw new Error('all values arrays should have the same length');\n\n      const matSize = values[0].length * (values[0].length - 1) / 2;\n      const chunkSize = Math.floor(matSize / this._workerCount);\n      const promises =\n        new Array<Promise<KnnResult>>(this._workerCount);\n      const workers = new Array(this._workerCount)\n        .fill(null).map(() => new Worker(new URL('./knn-threshold-worker', import.meta.url)));\n      for (let idx = 0; idx < this._workerCount; idx++) {\n        promises[idx] = new Promise((resolveWorker, rejectWorker) => {\n          const startIdx = idx * chunkSize;\n          const endIdx = idx === this._workerCount - 1 ? matSize : (idx + 1) * chunkSize;\n          if (endIdx <= startIdx)\n            resolveWorker({knnDistances: new Array(0), knnIndexes: new Array(0)});\n          workers[idx].postMessage({values, startIdx, endIdx, fnNames, opts, threshold, weights, aggregationMethod});\n          workers[idx].onmessage = ({data: {error, knnDistances, knnIndexes}}): void => {\n            if (error) {\n              workers[idx].terminate();\n              rejectWorker(error);\n            } else {\n              workers[idx].terminate();\n              resolveWorker({knnDistances, knnIndexes});\n            }\n          };\n        });\n      }\n\n      const results = await Promise.all(promises);\n      const knnSizes = new Int32Array(values[0].length);\n      for (const res of results) {\n        for (let i = 0; i < values[0].length; ++i)\n          knnSizes[i] += res.knnIndexes[i]?.length ?? 0;\n      }\n      const knnRes: KnnResult = {\n        knnDistances: new Array(values[0].length).fill(null).map((_, i) => new Array<number>(knnSizes[i])),\n        knnIndexes: new Array(values[0].length).fill(null).map((_, i) => new Array<number>(knnSizes[i]))};\n      for (const res of results) {\n        for (let i = 0; i < values[0].length; ++i) {\n          for (let j = 0; j < (res.knnDistances[i]?.length ?? 0); ++j) {\n            knnRes.knnDistances[i][knnSizes[i] - 1] = res.knnDistances[i][j];\n            knnRes.knnIndexes[i][knnSizes[i] - 1] = res.knnIndexes[i][j];\n            knnSizes[i] -= 1;\n          }\n        }\n      }\n      return knnRes;\n    }\n\n    public async multiColumnSingleValueKNN(values: Array<any[]>, targetIdx: number, fnNames: KnownMetrics[], nNeighbours: number = 15,\n      opts: {[_: string]: any}[], weights: number[], aggregationMethod: DistanceAggregationMethod = DistanceAggregationMethods.EUCLIDEAN\n    ) {\n      if (values.length !== fnNames.length || values.length !== opts.length || values.length !== weights.length)\n        throw new Error('values, distance functions, options and weights arrays should have the same length');\n\n      if (values.some((v) => v.length !== values[0].length))\n        throw new Error('all values arrays should have the same length');\n\n      const workers = new Array(this._workerCount)\n        .fill(null).map(() => new Worker(new URL('./single-value-knn-worker', import.meta.url)));\n      const promises =\n        new Array<Promise<{knnDistances: Array<number>, knnIndexes: Array<number>}>>(this._workerCount);\n      const fullSize = values[0].length;\n      const target = values.map((v) => v[targetIdx]);\n      const chunkSize = Math.ceil(fullSize / this._workerCount);\n      for (let idx = 0; idx < this._workerCount; idx++) {\n        promises[idx] = new Promise((resolveWorker, rejectWorker) => {\n          const startIdx = idx * chunkSize;\n          const endIdx = idx === this._workerCount - 1 ? fullSize : (idx + 1) * chunkSize;\n          if (endIdx <= startIdx)\n            resolveWorker({knnDistances: new Array(0), knnIndexes: new Array(0)});\n          workers[idx].postMessage({values: values.map((v) => v.slice(startIdx, endIdx)), target, fnNames, opts, nNeighbours, weights, aggregationMethod, startIdx});\n          workers[idx].onmessage = ({data: {error, knnDistances, knnIndexes}}): void => {\n            if (error) {\n              workers[idx].terminate();\n              rejectWorker(error);\n            } else {\n              workers[idx].terminate();\n              resolveWorker({knnDistances, knnIndexes});\n            }\n          };\n        });\n      }\n\n      const results = await Promise.all(promises);\n      const singleValueKnn = {knnDistances: new Array(nNeighbours).fill(99999) , knnIndexes: new Array(nNeighbours).fill(-1)} as {knnDistances: Array<number>, knnIndexes: Array<number>};\n\n      for (const res of results) {\n          for (let j = 0; j < (res.knnDistances?.length ?? 0); ++j)\n            insertSmaller(singleValueKnn.knnDistances, singleValueKnn.knnIndexes, res.knnDistances[j], res.knnIndexes[j]);\n      }\n      return singleValueKnn;\n    }\n\n    public async multiColumnKNN(values: Array<Array<any>>, fnNames: KnownMetrics[], nNeighbours: number = 15,\n      opts: {[_: string]: any}[], weights: number[],\n      aggregationMethod: DistanceAggregationMethod = DistanceAggregationMethods.EUCLIDEAN\n    ) {\n      if (values.length !== fnNames.length || values.length !== opts.length || values.length !== weights.length)\n        throw new Error('values, distance functions, options and weights arrays should have the same length');\n\n      if (values.some((v) => v.length !== values[0].length))\n        throw new Error('all values arrays should have the same length');\n\n      const matSize = values[0].length * (values[0].length - 1) / 2;\n      const chunkSize = Math.floor(matSize / this._workerCount);\n      const promises =\n        new Array<Promise<KnnResult>>(this._workerCount);\n      const workers = new Array(this._workerCount)\n        .fill(null).map(() => new Worker(new URL('./knn-worker', import.meta.url)));\n      for (let idx = 0; idx < this._workerCount; idx++) {\n        promises[idx] = new Promise((resolveWorker, rejectWorker) => {\n          const startIdx = idx * chunkSize;\n          const endIdx = idx === this._workerCount - 1 ? matSize : (idx + 1) * chunkSize;\n          if (endIdx <= startIdx)\n            resolveWorker({knnDistances: new Array(0), knnIndexes: new Array(0)});\n          workers[idx].postMessage({values, startIdx, endIdx, fnNames, opts, nNeighbours, weights, aggregationMethod});\n          workers[idx].onmessage = ({data: {error, knnDistances, knnIndexes}}): void => {\n            if (error) {\n              workers[idx].terminate();\n              rejectWorker(error);\n            } else {\n              workers[idx].terminate();\n              resolveWorker({knnDistances, knnIndexes});\n            }\n          };\n        });\n      }\n\n      const results = await Promise.all(promises);\n      const knnRes: KnnResult = {\n        knnDistances: new Array(values[0].length).fill(null).map(() => new Array<number>(nNeighbours).fill(99999)),\n        knnIndexes: new Array(values[0].length).fill(null).map(() => new Array<number>(nNeighbours).fill(-1))};\n      for (const res of results) {\n        for (let i = 0; i < values[0].length; ++i) {\n          for (let j = 0; j < (res.knnDistances[i]?.length ?? 0); ++j)\n            insertSmaller(knnRes.knnDistances[i], knnRes.knnIndexes[i], res.knnDistances[i][j], res.knnIndexes[i][j]);\n        }\n      }\n      return knnRes;\n    }\n\n    public async getSampleDistances(values: Array<any[]>,\n      fnNames: KnownMetrics[], opts: {[_: string]: any}[] = [], weights: number[],\n      aggregationMethod: DistanceAggregationMethod = DistanceAggregationMethods.EUCLIDEAN): Promise<Float32Array> {\n      const thresholdWorkers = new Array(this._workerCount).fill(null)\n        .map(() => new Worker(new URL('./sparse-matrix-threshold-worker', import.meta.url)));\n\n      try {\n        const matSize = values[0].length * (values[0].length - 1) / 2;\n        const chunkSize = Math.floor(matSize / this._workerCount);\n        const maxSampleSize = 1_000_000;\n        const sampleSise = Math.max(Math.min(matSize / 1000, maxSampleSize), Math.min(matSize, maxSampleSize));\n        const testSetSizePerWorker = Math.floor(sampleSise / this._workerCount);\n        const tPromises = new Array<Promise<{distance: Float32Array}>>(this._workerCount);\n\n        for (let idx = 0; idx < this._workerCount; idx++) {\n          tPromises[idx] = new Promise((resolveWorker, rejectWorker) => {\n            const startIdx = idx * chunkSize;\n            const endIdx = idx === this._workerCount - 1 ? matSize : (idx + 1) * chunkSize;\n            thresholdWorkers[idx].postMessage({\n              values: values, startIdx, endIdx, sampleLength: testSetSizePerWorker,\n              fnNames, opts, weights, aggregationMethod\n            });\n            thresholdWorkers[idx].onmessage = ({data: {error, distance}}): void => {\n              thresholdWorkers[idx].terminate();\n              if (error) rejectWorker(error); else\n                resolveWorker({distance});\n            };\n          });\n        }\n\n        const results = await Promise.all(tPromises);\n        const fullSize = results.reduce((acc, val) => acc + val.distance.length, 0);\n        const distance = new Float32Array(fullSize);\n        let offset = 0;\n        for (const res of results) {\n          distance.set(res.distance, offset);\n          offset += res.distance.length;\n        }\n        distance.sort();\n\n        return distance;\n      } catch (e) {\n        thresholdWorkers?.forEach((w) => w?.terminate());\n        console.error(e);\n        return new Float32Array(1).fill(0.5);\n      }\n    }\n\n    private async getMinimalThreshold(values: Array<any[]>,\n      fnNames: KnownMetrics[], opts: {[_: string]: any}[] = [], weights: number[],\n      aggregationMethod: DistanceAggregationMethod = DistanceAggregationMethods.EUCLIDEAN) {\n      //We need to calculate the minimal threshold first,\n      //in order to get matrix such that it does not exceed the maximum size of 1GB\n      //we have 3 return arrays, each 4 bites per element, so if the maximum size of the matrix is 1GB,\n      const maxSparseMatrixSize = 70_000_000;\n      try {\n        const matSize = values.length * (values.length - 1) / 2;\n        const distance = await this.getSampleDistances(values, fnNames, opts, weights, aggregationMethod);\n        const fractionIndex = Math.floor(maxSparseMatrixSize / matSize * distance.length);\n        const threshold = 1 - distance[fractionIndex];\n        // threshold = Math.max(threshold, 0.3);\n        return threshold;\n      } catch (e) {\n        console.error(e);\n        return 0.5;\n      }\n    }\n\n    public static calcSync<T>(\n      values: Array<T> | ArrayLike<T>, fnName: KnownMetrics, distanceFn: Function, threshold: number\n    ) {\n      const i: number[] = [];\n      const j: number[] = [];\n      const distances: number[] = [];\n      let cnt = 0;\n      let mi = 0;\n      let mj = 0;\n      const fullSize = values.length * (values.length - 1) / 2;\n      while (cnt < fullSize) {\n        //const value = seq1List[mi] && seq1List[mj] ? hamming(seq1List[mi], seq1List[mj]) : 0;\n        const value = !isNil(values[mi]) && !isNil(values[mj]) ?\n          distanceFn(values[mi], values[mj]) : 1;\n        const similarity = 1 - value;\n        if (similarity >= threshold) {\n          i.push(mi);\n          j.push(mj);\n          distances.push(value);\n        }\n        cnt++;\n        mj++;\n        if (mj === values.length) {\n          mi++;\n          mj = mi + 1;\n        }\n      }\n\n      const iArray = new Int32Array(i);\n      const jArray = new Int32Array(j);\n      const distanceArray = new Float32Array(distances);\n\n      return {i: iArray, j: jArray, distance: distanceArray};\n    }\n}\n"]}
-
-/***/ })
-
-}]);
-//# sourceMappingURL=vendors-node_modules_datagrok-libraries_math_src_webGPU_sparse-matrix_webGPU-sparse-matrix_js-07693f.js.map