@danielsimonjr/mathts-parallel 0.3.1 → 0.3.2

package/dist/index.d.ts

@@ -24,7 +24,7 @@ export { Transfer } from '@danielsimonjr/mathts-workerpool';
  *   - Special / distribution functions (`erfc`, `besselJ`, `normalCDF`)
  *   - Additional ops exposed via the typed functions layer
  */
-type OpName = 'add' | 'subtract' | 'multiply' | 'divide' | 'pow' | 'scale' | 'abs' | 'negate' | 'sqrt' | 'square' | 'exp' | 'log' | 'sin' | 'cos' | 'tan' | 'sign' | 'tensordot' | 'sum' | 'mean' | 'min' | 'max' | 'minMax' | 'variance' | 'std' | 'norm' | 'histogram' | 'dot' | 'prod' | 'distance' | 'parallelStatProd' | 'matmul' | 'outer' | 'matvec' | 'transpose' | 'matrixPower' | 'characteristicPolynomial' | 'parallelFFT' | 'parallelConv' | 'spectrogram' | 'fft2d' | 'distanceMatrix' | 'erfc' | 'besselJ' | 'normalCDF' | 'chiSquareTest' | 'kolmogorovSmirnovTest' | 'mannWhitneyTest' | 'shapiroWilkTest' | 'integrateChunk' | 'sampleChunk';
+type OpName = 'add' | 'subtract' | 'multiply' | 'divide' | 'pow' | 'scale' | 'abs' | 'negate' | 'sqrt' | 'square' | 'bitAnd' | 'bitOr' | 'bitXor' | 'bitNot' | 'leftShift' | 'rightArithShift' | 'rightLogShift' | 'exp' | 'log' | 'sin' | 'cos' | 'tan' | 'sign' | 'tensordot' | 'sum' | 'mean' | 'min' | 'max' | 'minMax' | 'variance' | 'std' | 'norm' | 'histogram' | 'dot' | 'prod' | 'distance' | 'parallelStatProd' | 'matmul' | 'outer' | 'matvec' | 'transpose' | 'matrixPower' | 'characteristicPolynomial' | 'parallelFFT' | 'parallelConv' | 'spectrogram' | 'fft2d' | 'distanceMatrix' | 'erfc' | 'besselJ' | 'normalCDF' | 'chiSquareTest' | 'kolmogorovSmirnovTest' | 'mannWhitneyTest' | 'shapiroWilkTest' | 'integrateChunk' | 'sampleChunk';
 /**
  * Per-op threshold override.  The value is the minimum element count required
  * before parallelizing the named operation.  Special string aliases:

package/dist/index.js

@@ -401,6 +401,20 @@ var DEFAULT_THRESHOLD_BY_OP = {
   // no shouldParallelize call consults it. Expensive (ms-scale) integrands are the
   // one case where the fan-out pays off.
   integrateChunk: "never",
+  // Added 2026-07-05 (WS-2 addendum): the bitwise family gated via a NAMELESS
+  // shouldParallelize(len) -> the untested global 50k. Benchmarked
+  // (tools/benchmarks/ws2-bitwise-ops.mjs, medians of 9 interleaved reps):
+  // bitAnd 0.07-0.15x, bitNot 0.06-0.09x, leftShift 0.04-0.07x at every size up
+  // to 4M elements - Int32Array element-wise is maximally memory-bound; the
+  // worker path loses 7-25x. All seven -> 'never'; the methods now pass their
+  // op name so these entries actually govern.
+  bitAnd: "never",
+  bitOr: "never",
+  bitXor: "never",
+  bitNot: "never",
+  leftShift: "never",
+  rightArithShift: "never",
+  rightLogShift: "never",
   // signal: overhead dominates or break-even never reached
   parallelFFT: "never",
   parallelConv: "never",
@@ -1281,7 +1295,7 @@ var ComputePool = class {
     if (a.length !== b.length) {
       throw new Error(`Array lengths must match: ${a.length} vs ${b.length}`);
     }
-    if (this.shouldParallelize(a.length)) {
+    if (this.shouldParallelize(a.length, "bitAnd")) {
       return toParallelResult(await this.workerPool.bitwiseBinary(a, b, "bitAnd"));
     }
     const start = performance.now();
@@ -1300,7 +1314,7 @@ var ComputePool = class {
     if (a.length !== b.length) {
       throw new Error(`Array lengths must match: ${a.length} vs ${b.length}`);
     }
-    if (this.shouldParallelize(a.length)) {
+    if (this.shouldParallelize(a.length, "bitOr")) {
       return toParallelResult(await this.workerPool.bitwiseBinary(a, b, "bitOr"));
     }
     const start = performance.now();
@@ -1319,7 +1333,7 @@ var ComputePool = class {
     if (a.length !== b.length) {
       throw new Error(`Array lengths must match: ${a.length} vs ${b.length}`);
     }
-    if (this.shouldParallelize(a.length)) {
+    if (this.shouldParallelize(a.length, "bitXor")) {
       return toParallelResult(await this.workerPool.bitwiseBinary(a, b, "bitXor"));
     }
     const start = performance.now();
@@ -1335,7 +1349,7 @@ var ComputePool = class {
    * Unary bitwise NOT on an `Int32Array`.
    */
   async bitNot(a) {
-    if (this.shouldParallelize(a.length)) {
+    if (this.shouldParallelize(a.length, "bitNot")) {
       return toParallelResult(await this.workerPool.bitwiseNot(a));
     }
     const start = performance.now();
@@ -1355,7 +1369,7 @@ var ComputePool = class {
     if (typeof b !== "number" && a.length !== b.length) {
       throw new Error(`Array lengths must match: ${a.length} vs ${b.length}`);
     }
-    if (this.shouldParallelize(a.length)) {
+    if (this.shouldParallelize(a.length, "leftShift")) {
       const result2 = typeof b === "number" ? await this.workerPool.bitwiseScalar(a, b, "leftShift") : await this.workerPool.bitwiseBinary(a, b, "leftShift");
       return toParallelResult(result2);
     }
@@ -1375,7 +1389,7 @@ var ComputePool = class {
     if (typeof b !== "number" && a.length !== b.length) {
       throw new Error(`Array lengths must match: ${a.length} vs ${b.length}`);
     }
-    if (this.shouldParallelize(a.length)) {
+    if (this.shouldParallelize(a.length, "rightArithShift")) {
       const result2 = typeof b === "number" ? await this.workerPool.bitwiseScalar(a, b, "rightArithShift") : await this.workerPool.bitwiseBinary(a, b, "rightArithShift");
       return toParallelResult(result2);
     }
@@ -1397,7 +1411,7 @@ var ComputePool = class {
     if (typeof b !== "number" && a.length !== b.length) {
       throw new Error(`Array lengths must match: ${a.length} vs ${b.length}`);
     }
-    if (this.shouldParallelize(a.length)) {
+    if (this.shouldParallelize(a.length, "rightLogShift")) {
       const result2 = typeof b === "number" ? await this.workerPool.bitwiseScalar(a, b, "rightLogShift") : await this.workerPool.bitwiseBinary(a, b, "rightLogShift");
       return toParallelResult(result2);
     }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@danielsimonjr/mathts-parallel",
-  "version": "0.3.1",
+  "version": "0.3.2",
   "description": "WebWorker parallelization for MathTS computations",
   "author": "Daniel Simon Jr.",
   "license": "MIT",