@elarsaks/umap-wasm 0.1.1 → 0.1.4

package/package.json

@@ -1,60 +1,64 @@
-{
-  "name": "@elarsaks/umap-wasm",
-  "version": "0.1.1",
-  "description": "JavaScript implementation of UMAP",
-  "author": {
-    "name": "Andy Coenen",
-    "email": "andycoenen@google.com"
-  },
-  "license": "MIT",
-  "repository": {
-    "type": "git",
-    "url": "git+https://github.com/elarsaks/umap-wasm.git"
-  },
-  "main": "lib/umap-js.js",
-  "module": "lib/umap-js.js",
-  "unpkg": "lib/umap-js.min.js",
-  "jsdelivr": "lib/umap-js.min.js",
-  "types": "dist/index.d.ts",
-  "exports": {
-    ".": {
-      "import": "./lib/umap-js.js",
-      "require": "./lib/umap-js.js"
-    }
-  },
-  "files": [
-    "lib",
-    "dist",
-    "wasm/pkg"
-  ],
-  "packageManager": "yarn@4.12.0",
-  "scripts": {
-    "test": "vitest run",
-    "test:watch": "vitest",
-    "bundle": "rm -rf lib && webpack --config ./webpack/lib.config.ts && webpack --config ./webpack/lib.min.config.ts",
-    "build": "rm -rf dist && tsc && yarn bundle",
-    "build:wasm": "cd wasm && wasm-pack build --target web --out-dir pkg",
-    "prepublishOnly": "yarn build:wasm && yarn build"
-  },
-  "devDependencies": {
-    "@types/jest": "^30.0.0",
-    "@types/node": "^25.0.3",
-    "jest": "^30.2.0",
-    "prando": "^5.1.2",
-    "prettier": "^3.7.4",
-    "ts-jest": "^29.4.6",
-    "ts-loader": "^9.5.4",
-    "ts-node": "^10.9.2",
-    "typescript": "^5.9.3",
-    "vitest": "^1.4.0",
-    "webpack": "^5.104.1",
-    "webpack-cli": "^6.0.1"
-  },
-  "dependencies": {
-    "ml-levenberg-marquardt": "^2.1.1"
-  },
-  "publishConfig": {
-    "access": "public",
-    "registry": "https://registry.npmjs.org/"
-  }
-}
+{
+  "name": "@elarsaks/umap-wasm",
+  "version": "0.1.4",
+  "description": "JavaScript implementation of UMAP",
+  "author": {
+    "name": "Andy Coenen",
+    "email": "andycoenen@google.com"
+  },
+  "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/elarsaks/umap-wasm.git"
+  },
+  "main": "lib/umap-js.js",
+  "module": "dist/index.js",
+  "unpkg": "lib/umap-js.min.js",
+  "jsdelivr": "lib/umap-js.min.js",
+  "types": "dist/src/index.d.ts",
+  "exports": {
+    ".": {
+      "import": "./dist/index.js",
+      "require": "./lib/umap-js.js",
+      "types": "./dist/index.d.ts"
+    }
+  },
+  "files": [
+    "lib",
+    "dist",
+    "wasm/pkg"
+  ],
+  "packageManager": "yarn@4.12.0",
+  "scripts": {
+    "test": "vitest run",
+    "test:watch": "vitest",
+    "test:playwright": "playwright test",
+    "preview": "npx serve . -p 4173",
+    "bundle": "rm -rf lib && webpack --config ./webpack/lib.config.mjs && webpack --config ./webpack/lib.min.config.mjs",
+    "build": "rm -rf dist && tsc && yarn bundle",
+    "build:wasm": "cd wasm && wasm-pack build --target web --out-dir pkg",
+    "prepublishOnly": "yarn build:wasm && yarn build"
+  },
+  "devDependencies": {
+    "@playwright/test": "^1.57.0",
+    "@types/jest": "^30.0.0",
+    "@types/node": "^25.0.3",
+    "jest": "^30.2.0",
+    "prando": "^5.1.2",
+    "prettier": "^3.7.4",
+    "ts-jest": "^29.4.6",
+    "ts-loader": "^9.5.4",
+    "ts-node": "^10.9.2",
+    "typescript": "^5.9.3",
+    "vitest": "^1.4.0",
+    "webpack": "^5.104.1",
+    "webpack-cli": "^6.0.1"
+  },
+  "dependencies": {
+    "ml-levenberg-marquardt": "^2.1.1"
+  },
+  "publishConfig": {
+    "access": "public",
+    "registry": "https://registry.npmjs.org/"
+  }
+}

package/dist/src/heap.js

@@ -1,226 +0,0 @@
-"use strict";
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    var desc = Object.getOwnPropertyDescriptor(m, k);
-    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
-      desc = { enumerable: true, get: function() { return m[k]; } };
-    }
-    Object.defineProperty(o, k2, desc);
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
-    Object.defineProperty(o, "default", { enumerable: true, value: v });
-}) : function(o, v) {
-    o["default"] = v;
-});
-var __importStar = (this && this.__importStar) || (function () {
-    var ownKeys = function(o) {
-        ownKeys = Object.getOwnPropertyNames || function (o) {
-            var ar = [];
-            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
-            return ar;
-        };
-        return ownKeys(o);
-    };
-    return function (mod) {
-        if (mod && mod.__esModule) return mod;
-        var result = {};
-        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
-        __setModuleDefault(result, mod);
-        return result;
-    };
-})();
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.makeHeap = makeHeap;
-exports.rejectionSample = rejectionSample;
-exports.heapPush = heapPush;
-exports.uncheckedHeapPush = uncheckedHeapPush;
-exports.buildCandidates = buildCandidates;
-exports.deheapSort = deheapSort;
-exports.smallestFlagged = smallestFlagged;
-var utils = __importStar(require("./utils"));
-function makeHeap(nPoints, size) {
-    var makeArrays = function (fillValue) {
-        return utils.empty(nPoints).map(function () {
-            return utils.filled(size, fillValue);
-        });
-    };
-    var heap = [];
-    heap.push(makeArrays(-1));
-    heap.push(makeArrays(Infinity));
-    heap.push(makeArrays(0));
-    return heap;
-}
-function rejectionSample(nSamples, poolSize, random) {
-    var result = utils.zeros(nSamples);
-    for (var i = 0; i < nSamples; i++) {
-        var rejectSample = true;
-        var j = 0;
-        while (rejectSample) {
-            j = utils.tauRandInt(poolSize, random);
-            var broken = false;
-            for (var k = 0; k < i; k++) {
-                if (j === result[k]) {
-                    broken = true;
-                    break;
-                }
-            }
-            if (!broken)
-                rejectSample = false;
-        }
-        result[i] = j;
-    }
-    return result;
-}
-function heapPush(heap, row, weight, index, flag) {
-    row = Math.floor(row);
-    var indices = heap[0][row];
-    var weights = heap[1][row];
-    var isNew = heap[2][row];
-    if (weight >= weights[0]) {
-        return 0;
-    }
-    for (var i = 0; i < indices.length; i++) {
-        if (index === indices[i]) {
-            return 0;
-        }
-    }
-    return uncheckedHeapPush(heap, row, weight, index, flag);
-}
-function uncheckedHeapPush(heap, row, weight, index, flag) {
-    var indices = heap[0][row];
-    var weights = heap[1][row];
-    var isNew = heap[2][row];
-    if (weight >= weights[0]) {
-        return 0;
-    }
-    weights[0] = weight;
-    indices[0] = index;
-    isNew[0] = flag;
-    var i = 0;
-    var iSwap = 0;
-    while (true) {
-        var ic1 = 2 * i + 1;
-        var ic2 = ic1 + 1;
-        var heapShape2 = heap[0][0].length;
-        if (ic1 >= heapShape2) {
-            break;
-        }
-        else if (ic2 >= heapShape2) {
-            if (weights[ic1] > weight) {
-                iSwap = ic1;
-            }
-            else {
-                break;
-            }
-        }
-        else if (weights[ic1] >= weights[ic2]) {
-            if (weight < weights[ic1]) {
-                iSwap = ic1;
-            }
-            else {
-                break;
-            }
-        }
-        else {
-            if (weight < weights[ic2]) {
-                iSwap = ic2;
-            }
-            else {
-                break;
-            }
-        }
-        weights[i] = weights[iSwap];
-        indices[i] = indices[iSwap];
-        isNew[i] = isNew[iSwap];
-        i = iSwap;
-    }
-    weights[i] = weight;
-    indices[i] = index;
-    isNew[i] = flag;
-    return 1;
-}
-function buildCandidates(currentGraph, nVertices, nNeighbors, maxCandidates, random) {
-    var candidateNeighbors = makeHeap(nVertices, maxCandidates);
-    for (var i = 0; i < nVertices; i++) {
-        for (var j = 0; j < nNeighbors; j++) {
-            if (currentGraph[0][i][j] < 0) {
-                continue;
-            }
-            var idx = currentGraph[0][i][j];
-            var isn = currentGraph[2][i][j];
-            var d = utils.tauRand(random);
-            heapPush(candidateNeighbors, i, d, idx, isn);
-            heapPush(candidateNeighbors, idx, d, i, isn);
-            currentGraph[2][i][j] = 0;
-        }
-    }
-    return candidateNeighbors;
-}
-function deheapSort(heap) {
-    var indices = heap[0];
-    var weights = heap[1];
-    for (var i = 0; i < indices.length; i++) {
-        var indHeap = indices[i];
-        var distHeap = weights[i];
-        for (var j = 0; j < indHeap.length - 1; j++) {
-            var indHeapIndex = indHeap.length - j - 1;
-            var distHeapIndex = distHeap.length - j - 1;
-            var temp1 = indHeap[0];
-            indHeap[0] = indHeap[indHeapIndex];
-            indHeap[indHeapIndex] = temp1;
-            var temp2 = distHeap[0];
-            distHeap[0] = distHeap[distHeapIndex];
-            distHeap[distHeapIndex] = temp2;
-            siftDown(distHeap, indHeap, distHeapIndex, 0);
-        }
-    }
-    return { indices: indices, weights: weights };
-}
-function siftDown(heap1, heap2, ceiling, elt) {
-    while (elt * 2 + 1 < ceiling) {
-        var leftChild = elt * 2 + 1;
-        var rightChild = leftChild + 1;
-        var swap = elt;
-        if (heap1[swap] < heap1[leftChild]) {
-            swap = leftChild;
-        }
-        if (rightChild < ceiling && heap1[swap] < heap1[rightChild]) {
-            swap = rightChild;
-        }
-        if (swap === elt) {
-            break;
-        }
-        else {
-            var temp1 = heap1[elt];
-            heap1[elt] = heap1[swap];
-            heap1[swap] = temp1;
-            var temp2 = heap2[elt];
-            heap2[elt] = heap2[swap];
-            heap2[swap] = temp2;
-            elt = swap;
-        }
-    }
-}
-function smallestFlagged(heap, row) {
-    var ind = heap[0][row];
-    var dist = heap[1][row];
-    var flag = heap[2][row];
-    var minDist = Infinity;
-    var resultIndex = -1;
-    for (var i = 0; i > ind.length; i++) {
-        if (flag[i] === 1 && dist[i] < minDist) {
-            minDist = dist[i];
-            resultIndex = i;
-        }
-    }
-    if (resultIndex >= 0) {
-        flag[resultIndex] = 0;
-        return Math.floor(ind[resultIndex]);
-    }
-    else {
-        return -1;
-    }
-}

package/dist/src/index.d.ts

@@ -1 +0,0 @@
-export { UMAP, UMAPParameters } from './umap';

package/dist/src/index.js

@@ -1,5 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.UMAP = void 0;
-var umap_1 = require("./umap");
-Object.defineProperty(exports, "UMAP", { enumerable: true, get: function () { return umap_1.UMAP; } });

package/dist/src/lib.d.ts

@@ -1 +0,0 @@
-export { UMAP } from './umap';

package/dist/src/lib.js

@@ -1,5 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.UMAP = void 0;
-var umap_1 = require("./umap");
-Object.defineProperty(exports, "UMAP", { enumerable: true, get: function () { return umap_1.UMAP; } });