pragmastat 3.1.10

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2025 Andrey Akinshin
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,134 @@
+# Pragmastat TypeScript Implementation
+
+[![DOI](https://zenodo.org/badge/doi/10.5281/zenodo.17236778.svg)](https://doi.org/10.5281/zenodo.17236778)
+
+This is the TypeScript implementation of Pragmastat, a pragmatic statistical toolkit designed for analyzing real-world data.
+
+## Installation
+
+```bash
+npm install pragmastat
+```
+
+## Usage
+
+```typescript
+import {
+  center,
+  spread,
+  relSpread,
+  shift,
+  ratio,
+  avgSpread,
+  disparity
+} from 'pragmastat';
+
+// One-sample estimators
+const data = [1, 2, 3, 4, 5];
+console.log('Center:', center(data));
+console.log('Spread:', spread(data));
+console.log('RelSpread:', relSpread(data));
+
+// Two-sample estimators
+const x = [1, 2, 3];
+const y = [4, 5, 6];
+console.log('Shift:', shift(x, y));
+console.log('Ratio:', ratio(x, y));
+console.log('AvgSpread:', avgSpread(x, y));
+console.log('Disparity:', disparity(x, y));
+```
+
+## Estimators
+
+### One-Sample Estimators
+
+- **center**: Hodges-Lehmann location estimator - robust measure of average
+- **spread**: Shamos scale estimator - robust measure of dispersion
+- **relSpread**: Relative dispersion measure - spread normalized by center
+
+### Two-Sample Estimators
+
+- **shift**: Hodges-Lehmann shift estimator - robust measure of location difference
+- **ratio**: Robust ratio estimator - median of all pairwise ratios
+- **avgSpread**: Pooled spread estimator - combined measure of dispersion
+- **disparity**: Effect size measure - normalized difference between samples
+
+## Development
+
+### Building
+
+```bash
+# Build TypeScript to JavaScript
+npm run build
+
+# Or use the build script
+./build.sh build
+```
+
+### Testing
+
+```bash
+# Run all tests
+npm test
+
+# Run tests with coverage
+npm run test:coverage
+
+# Run tests in watch mode
+npm run test:watch
+```
+
+### Code Quality
+
+```bash
+# Run ESLint
+npm run lint
+
+# Format code with Prettier
+npm run format
+
+# Check formatting
+npm run format:check
+```
+
+### Build Script
+
+The `build.sh` script provides convenient commands:
+
+```bash
+./build.sh test      # Run all tests
+./build.sh build     # Build TypeScript to JavaScript
+./build.sh check     # Run linting and format checking
+./build.sh clean     # Clean build artifacts
+./build.sh format    # Format code with Prettier
+./build.sh install   # Install npm dependencies
+./build.sh coverage  # Run tests with coverage report
+./build.sh watch     # Run tests in watch mode
+./build.sh all       # Run all tasks
+```
+
+## Project Structure
+
+```
+ts/
+├── src/                 # Source code
+│   ├── index.ts        # Main entry point
+│   ├── estimators.ts   # Estimator implementations
+│   └── utils.ts        # Utility functions
+├── tests/              # Test files
+│   ├── estimators.test.ts    # Unit tests
+│   ├── invariance.test.ts    # Mathematical invariance tests
+│   └── reference.test.ts     # Reference tests against JSON data
+├── dist/               # Compiled JavaScript (generated)
+├── package.json        # NPM package configuration
+├── tsconfig.json       # TypeScript configuration
+├── jest.config.js      # Jest test configuration
+├── .eslintrc.js        # ESLint configuration
+├── .prettierrc         # Prettier configuration
+├── build.sh           # Build script
+└── README.md          # This file
+```
+
+## License
+
+This project is licensed under the MIT License - see the LICENSE file for details.

package/dist/estimators.d.ts

@@ -0,0 +1,52 @@
+/**
+ * Pragmastat estimators implementation
+ */
+/**
+ * Calculate the Center - median of all pairwise averages (x[i] + x[j])/2
+ * Uses fast O(n log n) algorithm.
+ * @param x Array of sample values
+ * @returns The center estimate
+ */
+export declare function center(x: number[]): number;
+/**
+ * Calculate the Spread - median of all pairwise absolute differences |x[i] - x[j]|
+ * Uses fast O(n log n) algorithm.
+ * @param x Array of sample values
+ * @returns The spread estimate
+ */
+export declare function spread(x: number[]): number;
+/**
+ * Calculate the RelSpread - ratio of Spread to absolute Center
+ * @param x Array of sample values
+ * @returns The relative spread estimate
+ */
+export declare function relSpread(x: number[]): number;
+/**
+ * Calculate the Shift - median of all pairwise differences (x[i] - y[j])
+ * @param x First sample
+ * @param y Second sample
+ * @returns The shift estimate
+ */
+export declare function shift(x: number[], y: number[]): number;
+/**
+ * Calculate the Ratio - median of all pairwise ratios (x[i] / y[j])
+ * @param x First sample
+ * @param y Second sample
+ * @returns The ratio estimate
+ */
+export declare function ratio(x: number[], y: number[]): number;
+/**
+ * Calculate the AvgSpread - weighted average of spreads: (n*Spread(x) + m*Spread(y))/(n+m)
+ * @param x First sample
+ * @param y Second sample
+ * @returns The combined spread estimate
+ */
+export declare function avgSpread(x: number[], y: number[]): number;
+/**
+ * Calculate the Disparity - Shift / AvgSpread
+ * @param x First sample
+ * @param y Second sample
+ * @returns The disparity estimate
+ */
+export declare function disparity(x: number[], y: number[]): number;
+//# sourceMappingURL=estimators.d.ts.map

package/dist/estimators.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"estimators.d.ts","sourceRoot":"","sources":["../src/estimators.ts"],"names":[],"mappings":"AAAA;;GAEG;AAMH;;;;;GAKG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAE1C;AAED;;;;;GAKG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAE1C;AAED;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAa7C;AAED;;;;;GAKG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAgBtD;AAED;;;;;GAKG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAqBtD;AAED;;;;;GAKG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAa1D;AAED;;;;;GAKG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAa1D"}

package/dist/estimators.js

@@ -0,0 +1,128 @@
+"use strict";
+/**
+ * Pragmastat estimators implementation
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.center = center;
+exports.spread = spread;
+exports.relSpread = relSpread;
+exports.shift = shift;
+exports.ratio = ratio;
+exports.avgSpread = avgSpread;
+exports.disparity = disparity;
+const utils_1 = require("./utils");
+const fastCenter_1 = require("./fastCenter");
+const fastSpread_1 = require("./fastSpread");
+/**
+ * Calculate the Center - median of all pairwise averages (x[i] + x[j])/2
+ * Uses fast O(n log n) algorithm.
+ * @param x Array of sample values
+ * @returns The center estimate
+ */
+function center(x) {
+    return (0, fastCenter_1.fastCenter)(x);
+}
+/**
+ * Calculate the Spread - median of all pairwise absolute differences |x[i] - x[j]|
+ * Uses fast O(n log n) algorithm.
+ * @param x Array of sample values
+ * @returns The spread estimate
+ */
+function spread(x) {
+    return (0, fastSpread_1.fastSpread)(x);
+}
+/**
+ * Calculate the RelSpread - ratio of Spread to absolute Center
+ * @param x Array of sample values
+ * @returns The relative spread estimate
+ */
+function relSpread(x) {
+    if (x.length === 0) {
+        throw new Error('Input array cannot be empty');
+    }
+    const s = spread(x);
+    const c = center(x);
+    if (c === 0) {
+        throw new Error('RelSpread is undefined when Center equals zero');
+    }
+    return s / Math.abs(c);
+}
+/**
+ * Calculate the Shift - median of all pairwise differences (x[i] - y[j])
+ * @param x First sample
+ * @param y Second sample
+ * @returns The shift estimate
+ */
+function shift(x, y) {
+    const nx = x.length;
+    const ny = y.length;
+    if (nx === 0 || ny === 0) {
+        throw new Error('Input arrays cannot be empty');
+    }
+    const pairwiseDifferences = [];
+    for (let i = 0; i < nx; i++) {
+        for (let j = 0; j < ny; j++) {
+            pairwiseDifferences.push(x[i] - y[j]);
+        }
+    }
+    return (0, utils_1.median)(pairwiseDifferences);
+}
+/**
+ * Calculate the Ratio - median of all pairwise ratios (x[i] / y[j])
+ * @param x First sample
+ * @param y Second sample
+ * @returns The ratio estimate
+ */
+function ratio(x, y) {
+    const nx = x.length;
+    const ny = y.length;
+    if (nx === 0 || ny === 0) {
+        throw new Error('Input arrays cannot be empty');
+    }
+    // Check that all y values are strictly positive
+    if (y.some((val) => val <= 0)) {
+        throw new Error('All values in y must be strictly positive');
+    }
+    const pairwiseRatios = [];
+    for (let i = 0; i < nx; i++) {
+        for (let j = 0; j < ny; j++) {
+            pairwiseRatios.push(x[i] / y[j]);
+        }
+    }
+    return (0, utils_1.median)(pairwiseRatios);
+}
+/**
+ * Calculate the AvgSpread - weighted average of spreads: (n*Spread(x) + m*Spread(y))/(n+m)
+ * @param x First sample
+ * @param y Second sample
+ * @returns The combined spread estimate
+ */
+function avgSpread(x, y) {
+    const nx = x.length;
+    const ny = y.length;
+    if (nx === 0 || ny === 0) {
+        throw new Error('Input arrays cannot be empty');
+    }
+    // Calculate weighted average of individual spreads
+    const spreadX = spread(x);
+    const spreadY = spread(y);
+    return (nx * spreadX + ny * spreadY) / (nx + ny);
+}
+/**
+ * Calculate the Disparity - Shift / AvgSpread
+ * @param x First sample
+ * @param y Second sample
+ * @returns The disparity estimate
+ */
+function disparity(x, y) {
+    if (x.length === 0 || y.length === 0) {
+        throw new Error('Input arrays cannot be empty');
+    }
+    const shiftVal = shift(x, y);
+    const combinedSpread = avgSpread(x, y);
+    if (combinedSpread === 0) {
+        return Infinity;
+    }
+    return shiftVal / combinedSpread;
+}
+//# sourceMappingURL=estimators.js.map

package/dist/estimators.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"estimators.js","sourceRoot":"","sources":["../src/estimators.ts"],"names":[],"mappings":";AAAA;;GAEG;;AAYH,wBAEC;AAQD,wBAEC;AAOD,8BAaC;AAQD,sBAgBC;AAQD,sBAqBC;AAQD,8BAaC;AAQD,8BAaC;AAzID,mCAAiC;AACjC,6CAA0C;AAC1C,6CAA0C;AAE1C;;;;;GAKG;AACH,SAAgB,MAAM,CAAC,CAAW;IAChC,OAAO,IAAA,uBAAU,EAAC,CAAC,CAAC,CAAC;AACvB,CAAC;AAED;;;;;GAKG;AACH,SAAgB,MAAM,CAAC,CAAW;IAChC,OAAO,IAAA,uBAAU,EAAC,CAAC,CAAC,CAAC;AACvB,CAAC;AAED;;;;GAIG;AACH,SAAgB,SAAS,CAAC,CAAW;IACnC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACnB,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;IACjD,CAAC;IAED,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACpB,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAEpB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC;IACpE,CAAC;IAED,OAAO,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACzB,CAAC;AAED;;;;;GAKG;AACH,SAAgB,KAAK,CAAC,CAAW,EAAE,CAAW;IAC5C,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC;IACpB,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC;IAEpB,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;IAClD,CAAC;IAED,MAAM,mBAAmB,GAAa,EAAE,CAAC;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,mBAAmB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,CAAC;IACH,CAAC;IAED,OAAO,IAAA,cAAM,EAAC,mBAAmB,CAAC,CAAC;AACrC,CAAC;AAED;;;;;GAKG;AACH,SAAgB,KAAK,CAAC,CAAW,EAAE,CAAW;IAC5C,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC;IACpB,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC;IAEpB,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;IAClD,CAAC;IAED,gDAAgD;IAChD,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC;QAC9B,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;IAC/D,CAAC;IAED,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;IAED,OAAO,IAAA,cAAM,EAAC,cAAc,CAAC,CAAC;AAChC,CAAC;AAED;;;;;GAKG;AACH,SAAgB,SAAS,CAAC,CAAW,EAAE,CAAW;IAChD,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC;IACpB,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC;IAEpB,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;IAClD,CAAC;IAED,mDAAmD;IACnD,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAC1B,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAE1B,OAAO,CAAC,EAAE,GAAG,OAAO,GAAG,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;AACnD,CAAC;AAED;;;;;GAKG;AACH,SAAgB,SAAS,CAAC,CAAW,EAAE,CAAW;IAChD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACrC,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;IAClD,CAAC;IAED,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7B,MAAM,cAAc,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEvC,IAAI,cAAc,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,OAAO,QAAQ,GAAG,cAAc,CAAC;AACnC,CAAC"}

package/dist/fastCenter.d.ts

@@ -0,0 +1,18 @@
+/**
+ * Fast O(n log n) implementation of the Center (Hodges-Lehmann) estimator.
+ * Based on Monahan's Algorithm 616 (1984).
+ *
+ * Internal implementation - not part of public API.
+ */
+/**
+ * Compute the median of all pairwise averages (xi + xj)/2 efficiently.
+ *
+ * Time complexity: O(n log n) expected
+ * Space complexity: O(n)
+ *
+ * @param values Array of numeric values
+ * @returns The center estimate (Hodges-Lehmann estimator)
+ * @internal
+ */
+export declare function fastCenter(values: number[]): number;
+//# sourceMappingURL=fastCenter.d.ts.map

package/dist/fastCenter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"fastCenter.d.ts","sourceRoot":"","sources":["../src/fastCenter.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH;;;;;;;;;GASG;AACH,wBAAgB,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,CAmMnD"}

package/dist/fastCenter.js

@@ -0,0 +1,183 @@
+"use strict";
+/**
+ * Fast O(n log n) implementation of the Center (Hodges-Lehmann) estimator.
+ * Based on Monahan's Algorithm 616 (1984).
+ *
+ * Internal implementation - not part of public API.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.fastCenter = fastCenter;
+/**
+ * Compute the median of all pairwise averages (xi + xj)/2 efficiently.
+ *
+ * Time complexity: O(n log n) expected
+ * Space complexity: O(n)
+ *
+ * @param values Array of numeric values
+ * @returns The center estimate (Hodges-Lehmann estimator)
+ * @internal
+ */
+function fastCenter(values) {
+    const n = values.length;
+    if (n === 0) {
+        throw new Error('Input array cannot be empty');
+    }
+    if (n === 1) {
+        return values[0];
+    }
+    if (n === 2) {
+        return (values[0] + values[1]) / 2;
+    }
+    // Sort the values
+    const sortedValues = [...values].sort((a, b) => a - b);
+    // Calculate target median rank(s) among all pairwise sums
+    const totalPairs = Math.floor((n * (n + 1)) / 2);
+    const medianRankLow = Math.floor((totalPairs + 1) / 2); // 1-based rank
+    const medianRankHigh = Math.floor((totalPairs + 2) / 2);
+    // Initialize search bounds for each row (1-based indexing)
+    const leftBounds = Array.from({ length: n }, (_, i) => i + 1);
+    const rightBounds = Array(n).fill(n);
+    // Start with a good pivot: sum of middle elements
+    let pivot = sortedValues[Math.floor((n - 1) / 2)] + sortedValues[Math.floor(n / 2)];
+    let activeSetSize = totalPairs;
+    let previousCount = 0;
+    while (true) {
+        // === PARTITION STEP ===
+        let countBelowPivot = 0;
+        let currentColumn = n;
+        const partitionCounts = [];
+        for (let row = 1; row <= n; row++) {
+            // Move left from current column until we find sums < pivot
+            while (currentColumn >= row &&
+                sortedValues[row - 1] + sortedValues[currentColumn - 1] >= pivot) {
+                currentColumn--;
+            }
+            // Count elements in this row that are < pivot
+            const elementsBelow = currentColumn >= row ? currentColumn - row + 1 : 0;
+            partitionCounts.push(elementsBelow);
+            countBelowPivot += elementsBelow;
+        }
+        // === CONVERGENCE CHECK ===
+        if (countBelowPivot === previousCount) {
+            let minActiveSum = Infinity;
+            let maxActiveSum = -Infinity;
+            for (let i = 0; i < n; i++) {
+                if (leftBounds[i] > rightBounds[i]) {
+                    continue;
+                }
+                const rowValue = sortedValues[i];
+                const smallestInRow = sortedValues[leftBounds[i] - 1] + rowValue;
+                const largestInRow = sortedValues[rightBounds[i] - 1] + rowValue;
+                minActiveSum = Math.min(minActiveSum, smallestInRow);
+                maxActiveSum = Math.max(maxActiveSum, largestInRow);
+            }
+            pivot = (minActiveSum + maxActiveSum) / 2;
+            if (pivot <= minActiveSum || pivot > maxActiveSum) {
+                pivot = maxActiveSum;
+            }
+            if (minActiveSum === maxActiveSum || activeSetSize <= 2) {
+                return pivot / 2;
+            }
+            continue;
+        }
+        // === TARGET CHECK ===
+        const atTargetRank = countBelowPivot === medianRankLow || countBelowPivot === medianRankHigh - 1;
+        if (atTargetRank) {
+            let largestBelowPivot = -Infinity;
+            let smallestAtOrAbovePivot = Infinity;
+            for (let i = 0; i < n; i++) {
+                const countInRow = partitionCounts[i];
+                const rowValue = sortedValues[i];
+                const totalInRow = n - i;
+                // Find largest sum in this row that's < pivot
+                if (countInRow > 0) {
+                    const lastBelowIndex = i + countInRow;
+                    const lastBelowValue = rowValue + sortedValues[lastBelowIndex - 1];
+                    largestBelowPivot = Math.max(largestBelowPivot, lastBelowValue);
+                }
+                // Find smallest sum in this row that's >= pivot
+                if (countInRow < totalInRow) {
+                    const firstAtOrAboveIndex = i + countInRow + 1;
+                    const firstAtOrAboveValue = rowValue + sortedValues[firstAtOrAboveIndex - 1];
+                    smallestAtOrAbovePivot = Math.min(smallestAtOrAbovePivot, firstAtOrAboveValue);
+                }
+            }
+            // Calculate final result
+            if (medianRankLow < medianRankHigh) {
+                // Even total: average the two middle values
+                return (smallestAtOrAbovePivot + largestBelowPivot) / 4;
+            }
+            else {
+                // Odd total: return the single middle value
+                const needLargest = countBelowPivot === medianRankLow;
+                return (needLargest ? largestBelowPivot : smallestAtOrAbovePivot) / 2;
+            }
+        }
+        // === UPDATE BOUNDS ===
+        if (countBelowPivot < medianRankLow) {
+            // Too few values below pivot - search higher
+            for (let i = 0; i < n; i++) {
+                leftBounds[i] = i + partitionCounts[i] + 1;
+            }
+        }
+        else {
+            // Too many values below pivot - search lower
+            for (let i = 0; i < n; i++) {
+                rightBounds[i] = i + partitionCounts[i];
+            }
+        }
+        // === PREPARE NEXT ITERATION ===
+        previousCount = countBelowPivot;
+        // Recalculate active set size
+        activeSetSize = 0;
+        for (let i = 0; i < n; i++) {
+            const rowSize = rightBounds[i] - leftBounds[i] + 1;
+            if (rowSize > 0) {
+                activeSetSize += rowSize;
+            }
+        }
+        // Choose next pivot
+        if (activeSetSize > 2) {
+            // Use randomized row median strategy
+            const targetIndex = Math.floor(Math.random() * activeSetSize);
+            let cumulativeSize = 0;
+            let selectedRow = 0;
+            for (let i = 0; i < n; i++) {
+                const rowSize = rightBounds[i] - leftBounds[i] + 1;
+                if (rowSize > 0) {
+                    if (targetIndex < cumulativeSize + rowSize) {
+                        selectedRow = i;
+                        break;
+                    }
+                    cumulativeSize += rowSize;
+                }
+            }
+            // Use median element of the selected row as pivot
+            const medianColumnInRow = Math.floor((leftBounds[selectedRow] + rightBounds[selectedRow]) / 2);
+            pivot = sortedValues[selectedRow] + sortedValues[medianColumnInRow - 1];
+        }
+        else {
+            // Few elements remain - use midrange strategy
+            let minRemainingSum = Infinity;
+            let maxRemainingSum = -Infinity;
+            for (let i = 0; i < n; i++) {
+                if (leftBounds[i] > rightBounds[i]) {
+                    continue;
+                }
+                const rowValue = sortedValues[i];
+                const minInRow = sortedValues[leftBounds[i] - 1] + rowValue;
+                const maxInRow = sortedValues[rightBounds[i] - 1] + rowValue;
+                minRemainingSum = Math.min(minRemainingSum, minInRow);
+                maxRemainingSum = Math.max(maxRemainingSum, maxInRow);
+            }
+            pivot = (minRemainingSum + maxRemainingSum) / 2;
+            if (pivot <= minRemainingSum || pivot > maxRemainingSum) {
+                pivot = maxRemainingSum;
+            }
+            if (minRemainingSum === maxRemainingSum) {
+                return pivot / 2;
+            }
+        }
+    }
+}
+//# sourceMappingURL=fastCenter.js.map

package/dist/fastCenter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fastCenter.js","sourceRoot":"","sources":["../src/fastCenter.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;AAYH,gCAmMC;AA7MD;;;;;;;;;GASG;AACH,SAAgB,UAAU,CAAC,MAAgB;IACzC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACxB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;IACjD,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACrC,CAAC;IAED,kBAAkB;IAClB,MAAM,YAAY,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAEvD,0DAA0D;IAC1D,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACjD,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,eAAe;IACvE,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAExD,2DAA2D;IAC3D,MAAM,UAAU,GAAa,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACxE,MAAM,WAAW,GAAa,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAE/C,kDAAkD;IAClD,IAAI,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACpF,IAAI,aAAa,GAAG,UAAU,CAAC;IAC/B,IAAI,aAAa,GAAG,CAAC,CAAC;IAEtB,OAAO,IAAI,EAAE,CAAC;QACZ,yBAAyB;QACzB,IAAI,eAAe,GAAG,CAAC,CAAC;QACxB,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,MAAM,eAAe,GAAa,EAAE,CAAC;QAErC,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;YAClC,2DAA2D;YAC3D,OACE,aAAa,IAAI,GAAG;gBACpB,YAAY,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,YAAY,CAAC,aAAa,GAAG,CAAC,CAAC,IAAI,KAAK,EAChE,CAAC;gBACD,aAAa,EAAE,CAAC;YAClB,CAAC;YAED,8CAA8C;YAC9C,MAAM,aAAa,GAAG,aAAa,IAAI,GAAG,CAAC,CAAC,CAAC,aAAa,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzE,eAAe,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YACpC,eAAe,IAAI,aAAa,CAAC;QACnC,CAAC;QAED,4BAA4B;QAC5B,IAAI,eAAe,KAAK,aAAa,EAAE,CAAC;YACtC,IAAI,YAAY,GAAG,QAAQ,CAAC;YAC5B,IAAI,YAAY,GAAG,CAAC,QAAQ,CAAC;YAE7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;oBACnC,SAAS;gBACX,CAAC;gBAED,MAAM,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;gBACjC,MAAM,aAAa,GAAG,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC;gBACjE,MAAM,YAAY,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC;gBAEjE,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,aAAa,CAAC,CAAC;gBACrD,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;YACtD,CAAC;YAED,KAAK,GAAG,CAAC,YAAY,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;YAC1C,IAAI,KAAK,IAAI,YAAY,IAAI,KAAK,GAAG,YAAY,EAAE,CAAC;gBAClD,KAAK,GAAG,YAAY,CAAC;YACvB,CAAC;YAED,IAAI,YAAY,KAAK,YAAY,IAAI,aAAa,IAAI,CAAC,EAAE,CAAC;gBACxD,OAAO,KAAK,GAAG,CAAC,CAAC;YACnB,CAAC;YAED,SAAS;QACX,CAAC;QAED,uBAAuB;QACvB,MAAM,YAAY,GAChB,eAAe,KAAK,aAAa,IAAI,eAAe,KAAK,cAAc,GAAG,CAAC,CAAC;QAE9E,IAAI,YAAY,EAAE,CAAC;YACjB,IAAI,iBAAiB,GAAG,CAAC,QAAQ,CAAC;YAClC,IAAI,sBAAsB,GAAG,QAAQ,CAAC;YAEtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,UAAU,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;gBACjC,MAAM,UAAU,GAAG,CAAC,GAAG,CAAC,CAAC;gBAEzB,8CAA8C;gBAC9C,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;oBACnB,MAAM,cAAc,GAAG,CAAC,GAAG,UAAU,CAAC;oBACtC,MAAM,cAAc,GAAG,QAAQ,GAAG,YAAY,CAAC,cAAc,GAAG,CAAC,CAAC,CAAC;oBACnE,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,iBAAiB,EAAE,cAAc,CAAC,CAAC;gBAClE,CAAC;gBAED,gDAAgD;gBAChD,IAAI,UAAU,GAAG,UAAU,EAAE,CAAC;oBAC5B,MAAM,mBAAmB,GAAG,CAAC,GAAG,UAAU,GAAG,CAAC,CAAC;oBAC/C,MAAM,mBAAmB,GAAG,QAAQ,GAAG,YAAY,CAAC,mBAAmB,GAAG,CAAC,CAAC,CAAC;oBAC7E,sBAAsB,GAAG,IAAI,CAAC,GAAG,CAAC,sBAAsB,EAAE,mBAAmB,CAAC,CAAC;gBACjF,CAAC;YACH,CAAC;YAED,yBAAyB;YACzB,IAAI,aAAa,GAAG,cAAc,EAAE,CAAC;gBACnC,4CAA4C;gBAC5C,OAAO,CAAC,sBAAsB,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC;YAC1D,CAAC;iBAAM,CAAC;gBACN,4CAA4C;gBAC5C,MAAM,WAAW,GAAG,eAAe,KAAK,aAAa,CAAC;gBACtD,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC;YACxE,CAAC;QACH,CAAC;QAED,wBAAwB;QACxB,IAAI,eAAe,GAAG,aAAa,EAAE,CAAC;YACpC,6CAA6C;YAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;aAAM,CAAC;YACN,6CAA6C;YAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;QAED,iCAAiC;QACjC,aAAa,GAAG,eAAe,CAAC;QAEhC,8BAA8B;QAC9B,aAAa,GAAG,CAAC,CAAC;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,OAAO,GAAG,WAAW,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACnD,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;gBAChB,aAAa,IAAI,OAAO,CAAC;YAC3B,CAAC;QACH,CAAC;QAED,oBAAoB;QACpB,IAAI,aAAa,GAAG,CAAC,EAAE,CAAC;YACtB,qCAAqC;YACrC,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,aAAa,CAAC,CAAC;YAC9D,IAAI,cAAc,GAAG,CAAC,CAAC;YACvB,IAAI,WAAW,GAAG,CAAC,CAAC;YAEpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,OAAO,GAAG,WAAW,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACnD,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;oBAChB,IAAI,WAAW,GAAG,cAAc,GAAG,OAAO,EAAE,CAAC;wBAC3C,WAAW,GAAG,CAAC,CAAC;wBAChB,MAAM;oBACR,CAAC;oBACD,cAAc,IAAI,OAAO,CAAC;gBAC5B,CAAC;YACH,CAAC;YAED,kDAAkD;YAClD,MAAM,iBAAiB,GAAG,IAAI,CAAC,KAAK,CAClC,CAAC,UAAU,CAAC,WAAW,CAAC,GAAG,WAAW,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CACzD,CAAC;YACF,KAAK,GAAG,YAAY,CAAC,WAAW,CAAC,GAAG,YAAY,CAAC,iBAAiB,GAAG,CAAC,CAAC,CAAC;QAC1E,CAAC;aAAM,CAAC;YACN,8CAA8C;YAC9C,IAAI,eAAe,GAAG,QAAQ,CAAC;YAC/B,IAAI,eAAe,GAAG,CAAC,QAAQ,CAAC;YAEhC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;oBACnC,SAAS;gBACX,CAAC;gBAED,MAAM,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;gBACjC,MAAM,QAAQ,GAAG,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC;gBAC5D,MAAM,QAAQ,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC;gBAE7D,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,QAAQ,CAAC,CAAC;gBACtD,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,QAAQ,CAAC,CAAC;YACxD,CAAC;YAED,KAAK,GAAG,CAAC,eAAe,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;YAChD,IAAI,KAAK,IAAI,eAAe,IAAI,KAAK,GAAG,eAAe,EAAE,CAAC;gBACxD,KAAK,GAAG,eAAe,CAAC;YAC1B,CAAC;YAED,IAAI,eAAe,KAAK,eAAe,EAAE,CAAC;gBACxC,OAAO,KAAK,GAAG,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC"}

package/dist/fastSpread.d.ts

@@ -0,0 +1,18 @@
+/**
+ * Fast O(n log n) implementation of the Spread (Shamos) estimator.
+ * Based on Monahan's selection algorithm adapted for pairwise differences.
+ *
+ * Internal implementation - not part of public API.
+ */
+/**
+ * Compute the median of all pairwise absolute differences |xi - xj| efficiently.
+ *
+ * Time complexity: O(n log n) expected
+ * Space complexity: O(n)
+ *
+ * @param values Array of numeric values
+ * @returns The spread estimate (Shamos estimator)
+ * @internal
+ */
+export declare function fastSpread(values: number[]): number;
+//# sourceMappingURL=fastSpread.d.ts.map

package/dist/fastSpread.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"fastSpread.d.ts","sourceRoot":"","sources":["../src/fastSpread.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH;;;;;;;;;GASG;AACH,wBAAgB,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,CA2MnD"}

package/dist/fastSpread.js

@@ -0,0 +1,201 @@
+"use strict";
+/**
+ * Fast O(n log n) implementation of the Spread (Shamos) estimator.
+ * Based on Monahan's selection algorithm adapted for pairwise differences.
+ *
+ * Internal implementation - not part of public API.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.fastSpread = fastSpread;
+/**
+ * Compute the median of all pairwise absolute differences |xi - xj| efficiently.
+ *
+ * Time complexity: O(n log n) expected
+ * Space complexity: O(n)
+ *
+ * @param values Array of numeric values
+ * @returns The spread estimate (Shamos estimator)
+ * @internal
+ */
+function fastSpread(values) {
+    const n = values.length;
+    if (n === 0) {
+        throw new Error('Input array cannot be empty');
+    }
+    if (n === 1) {
+        return 0;
+    }
+    if (n === 2) {
+        return Math.abs(values[1] - values[0]);
+    }
+    // Sort the values
+    const a = [...values].sort((a, b) => a - b);
+    // Total number of pairwise differences with i < j
+    const N = Math.floor((n * (n - 1)) / 2);
+    const kLow = Math.floor((N + 1) / 2); // 1-based rank of lower middle
+    const kHigh = Math.floor((N + 2) / 2); // 1-based rank of upper middle
+    // Per-row active bounds over columns j (0-based indices)
+    // Row i allows j in [i+1, n-1] initially
+    const L = Array.from({ length: n }, (_, i) => Math.min(i + 1, n));
+    const R = Array(n).fill(n - 1);
+    for (let i = 0; i < n; i++) {
+        if (L[i] > R[i]) {
+            L[i] = 1;
+            R[i] = 0; // mark empty
+        }
+    }
+    const rowCounts = Array(n).fill(0);
+    // Initial pivot: a central gap
+    let pivot = a[Math.floor(n / 2)] - a[Math.floor((n - 1) / 2)];
+    let prevCountBelow = -1;
+    while (true) {
+        // === PARTITION: count how many differences are < pivot ===
+        let countBelow = 0;
+        let largestBelow = -Infinity;
+        let smallestAtOrAbove = Infinity;
+        let j = 1; // global two-pointer (non-decreasing across rows)
+        for (let i = 0; i < n - 1; i++) {
+            if (j < i + 1) {
+                j = i + 1;
+            }
+            while (j < n && a[j] - a[i] < pivot) {
+                j++;
+            }
+            const cntRow = Math.max(0, j - (i + 1));
+            rowCounts[i] = cntRow;
+            countBelow += cntRow;
+            // boundary elements for this row
+            if (cntRow > 0) {
+                const candBelow = a[j - 1] - a[i];
+                largestBelow = Math.max(largestBelow, candBelow);
+            }
+            if (j < n) {
+                const candAtOrAbove = a[j] - a[i];
+                smallestAtOrAbove = Math.min(smallestAtOrAbove, candAtOrAbove);
+            }
+        }
+        // === TARGET CHECK ===
+        const atTarget = countBelow === kLow || countBelow === kHigh - 1;
+        if (atTarget) {
+            if (kLow < kHigh) {
+                // Even N: average the two central order stats
+                return 0.5 * (largestBelow + smallestAtOrAbove);
+            }
+            else {
+                // Odd N: pick the single middle
+                const needLargest = countBelow === kLow;
+                return needLargest ? largestBelow : smallestAtOrAbove;
+            }
+        }
+        // === STALL HANDLING ===
+        if (countBelow === prevCountBelow) {
+            let minActive = Infinity;
+            let maxActive = -Infinity;
+            let active = 0;
+            for (let i = 0; i < n - 1; i++) {
+                const Li = L[i];
+                const Ri = R[i];
+                if (Li > Ri) {
+                    continue;
+                }
+                const rowMin = a[Li] - a[i];
+                const rowMax = a[Ri] - a[i];
+                minActive = Math.min(minActive, rowMin);
+                maxActive = Math.max(maxActive, rowMax);
+                active += Ri - Li + 1;
+            }
+            if (active <= 0) {
+                if (kLow < kHigh) {
+                    return 0.5 * (largestBelow + smallestAtOrAbove);
+                }
+                return countBelow >= kLow ? largestBelow : smallestAtOrAbove;
+            }
+            if (maxActive <= minActive) {
+                return minActive;
+            }
+            const mid = 0.5 * (minActive + maxActive);
+            pivot = mid > minActive && mid <= maxActive ? mid : maxActive;
+            prevCountBelow = countBelow;
+            continue;
+        }
+        // === SHRINK ACTIVE WINDOW ===
+        if (countBelow < kLow) {
+            // Need larger differences: discard all strictly below pivot
+            for (let i = 0; i < n - 1; i++) {
+                const newL = i + 1 + rowCounts[i];
+                if (newL > L[i]) {
+                    L[i] = newL;
+                }
+                if (L[i] > R[i]) {
+                    L[i] = 1;
+                    R[i] = 0;
+                }
+            }
+        }
+        else {
+            // Too many below: keep only those strictly below pivot
+            for (let i = 0; i < n - 1; i++) {
+                const newR = i + rowCounts[i];
+                if (newR < R[i]) {
+                    R[i] = newR;
+                }
+                if (R[i] < i + 1) {
+                    L[i] = 1;
+                    R[i] = 0;
+                }
+            }
+        }
+        prevCountBelow = countBelow;
+        // === CHOOSE NEXT PIVOT FROM ACTIVE SET ===
+        let activeSize = 0;
+        for (let i = 0; i < n - 1; i++) {
+            if (L[i] <= R[i]) {
+                activeSize += R[i] - L[i] + 1;
+            }
+        }
+        if (activeSize <= 2) {
+            // Few candidates left: return midrange of remaining
+            let minRem = Infinity;
+            let maxRem = -Infinity;
+            for (let i = 0; i < n - 1; i++) {
+                if (L[i] > R[i]) {
+                    continue;
+                }
+                const lo = a[L[i]] - a[i];
+                const hi = a[R[i]] - a[i];
+                minRem = Math.min(minRem, lo);
+                maxRem = Math.max(maxRem, hi);
+            }
+            if (activeSize <= 0) {
+                if (kLow < kHigh) {
+                    return 0.5 * (largestBelow + smallestAtOrAbove);
+                }
+                return countBelow >= kLow ? largestBelow : smallestAtOrAbove;
+            }
+            if (kLow < kHigh) {
+                return 0.5 * (minRem + maxRem);
+            }
+            return Math.abs(kLow - 1 - countBelow) <= Math.abs(countBelow - kLow) ? minRem : maxRem;
+        }
+        else {
+            // Weighted random row selection
+            const t = Math.floor(Math.random() * activeSize);
+            let acc = 0;
+            let row = 0;
+            for (row = 0; row < n - 1; row++) {
+                if (L[row] > R[row]) {
+                    continue;
+                }
+                const size = R[row] - L[row] + 1;
+                if (t < acc + size) {
+                    break;
+                }
+                acc += size;
+            }
+            // Median column of the selected row
+            const col = Math.floor((L[row] + R[row]) / 2);
+            pivot = a[col] - a[row];
+        }
+    }
+}
+//# sourceMappingURL=fastSpread.js.map

package/dist/fastSpread.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fastSpread.js","sourceRoot":"","sources":["../src/fastSpread.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;AAYH,gCA2MC;AArND;;;;;;;;;GASG;AACH,SAAgB,UAAU,CAAC,MAAgB;IACzC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACxB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;IACjD,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,OAAO,CAAC,CAAC;IACX,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC;IAED,kBAAkB;IAClB,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAE5C,kDAAkD;IAClD,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACxC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,+BAA+B;IACrE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,+BAA+B;IAEtE,yDAAyD;IACzD,yCAAyC;IACzC,MAAM,CAAC,GAAa,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC5E,MAAM,CAAC,GAAa,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAEzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAChB,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACT,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,aAAa;QACzB,CAAC;IACH,CAAC;IAED,MAAM,SAAS,GAAa,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAE7C,+BAA+B;IAC/B,IAAI,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC9D,IAAI,cAAc,GAAG,CAAC,CAAC,CAAC;IAExB,OAAO,IAAI,EAAE,CAAC;QACZ,4DAA4D;QAC5D,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,YAAY,GAAG,CAAC,QAAQ,CAAC;QAC7B,IAAI,iBAAiB,GAAG,QAAQ,CAAC;QAEjC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,kDAAkD;QAC7D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACd,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACZ,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC;gBACpC,CAAC,EAAE,CAAC;YACN,CAAC;YAED,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACxC,SAAS,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;YACtB,UAAU,IAAI,MAAM,CAAC;YAErB,iCAAiC;YACjC,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;gBACf,MAAM,SAAS,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAClC,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,SAAS,CAAC,CAAC;YACnD,CAAC;YAED,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBACV,MAAM,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAClC,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,iBAAiB,EAAE,aAAa,CAAC,CAAC;YACjE,CAAC;QACH,CAAC;QAED,uBAAuB;QACvB,MAAM,QAAQ,GAAG,UAAU,KAAK,IAAI,IAAI,UAAU,KAAK,KAAK,GAAG,CAAC,CAAC;QAEjE,IAAI,QAAQ,EAAE,CAAC;YACb,IAAI,IAAI,GAAG,KAAK,EAAE,CAAC;gBACjB,8CAA8C;gBAC9C,OAAO,GAAG,GAAG,CAAC,YAAY,GAAG,iBAAiB,CAAC,CAAC;YAClD,CAAC;iBAAM,CAAC;gBACN,gCAAgC;gBAChC,MAAM,WAAW,GAAG,UAAU,KAAK,IAAI,CAAC;gBACxC,OAAO,WAAW,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,iBAAiB,CAAC;YACxD,CAAC;QACH,CAAC;QAED,yBAAyB;QACzB,IAAI,UAAU,KAAK,cAAc,EAAE,CAAC;YAClC,IAAI,SAAS,GAAG,QAAQ,CAAC;YACzB,IAAI,SAAS,GAAG,CAAC,QAAQ,CAAC;YAC1B,IAAI,MAAM,GAAG,CAAC,CAAC;YAEf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAChB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAChB,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;oBACZ,SAAS;gBACX,CAAC;gBAED,MAAM,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5B,MAAM,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5B,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;gBACxC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;gBACxC,MAAM,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,CAAC;YAED,IAAI,MAAM,IAAI,CAAC,EAAE,CAAC;gBAChB,IAAI,IAAI,GAAG,KAAK,EAAE,CAAC;oBACjB,OAAO,GAAG,GAAG,CAAC,YAAY,GAAG,iBAAiB,CAAC,CAAC;gBAClD,CAAC;gBACD,OAAO,UAAU,IAAI,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,iBAAiB,CAAC;YAC/D,CAAC;YAED,IAAI,SAAS,IAAI,SAAS,EAAE,CAAC;gBAC3B,OAAO,SAAS,CAAC;YACnB,CAAC;YAED,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC,CAAC;YAC1C,KAAK,GAAG,GAAG,GAAG,SAAS,IAAI,GAAG,IAAI,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC;YAC9D,cAAc,GAAG,UAAU,CAAC;YAC5B,SAAS;QACX,CAAC;QAED,+BAA+B;QAC/B,IAAI,UAAU,GAAG,IAAI,EAAE,CAAC;YACtB,4DAA4D;YAC5D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;gBAClC,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBAChB,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;gBACd,CAAC;gBACD,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBAChB,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBACT,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACX,CAAC;YACH,CAAC;QACH,CAAC;aAAM,CAAC;YACN,uDAAuD;YACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,MAAM,IAAI,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;gBAC9B,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBAChB,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;gBACd,CAAC;gBACD,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACjB,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBACT,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACX,CAAC;YACH,CAAC;QACH,CAAC;QAED,cAAc,GAAG,UAAU,CAAC;QAE5B,4CAA4C;QAC5C,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACjB,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;QAED,IAAI,UAAU,IAAI,CAAC,EAAE,CAAC;YACpB,oDAAoD;YACpD,IAAI,MAAM,GAAG,QAAQ,CAAC;YACtB,IAAI,MAAM,GAAG,CAAC,QAAQ,CAAC;YACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBAChB,SAAS;gBACX,CAAC;gBACD,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1B,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1B,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;gBAC9B,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YAChC,CAAC;YAED,IAAI,UAAU,IAAI,CAAC,EAAE,CAAC;gBACpB,IAAI,IAAI,GAAG,KAAK,EAAE,CAAC;oBACjB,OAAO,GAAG,GAAG,CAAC,YAAY,GAAG,iBAAiB,CAAC,CAAC;gBAClD,CAAC;gBACD,OAAO,UAAU,IAAI,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,iBAAiB,CAAC;YAC/D,CAAC;YAED,IAAI,IAAI,GAAG,KAAK,EAAE,CAAC;gBACjB,OAAO,GAAG,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC;YACjC,CAAC;YACD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,GAAG,UAAU,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;QAC1F,CAAC;aAAM,CAAC;YACN,gCAAgC;YAChC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC;YACjD,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,KAAK,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;gBACjC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;oBACpB,SAAS;gBACX,CAAC;gBACD,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACjC,IAAI,CAAC,GAAG,GAAG,GAAG,IAAI,EAAE,CAAC;oBACnB,MAAM;gBACR,CAAC;gBACD,GAAG,IAAI,IAAI,CAAC;YACd,CAAC;YAED,oCAAoC;YACpC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9C,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;AACH,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Pragmastat: Unified Statistical Toolkit
+ *
+ * A collection of robust statistical estimators for real-world data analysis.
+ */
+export { center, spread, relSpread, shift, ratio, avgSpread, disparity } from './estimators';
+export { median } from './utils';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AAE7F,OAAO,EAAE,MAAM,EAAE,MAAM,SAAS,CAAC"}

package/dist/index.js

@@ -0,0 +1,19 @@
+"use strict";
+/**
+ * Pragmastat: Unified Statistical Toolkit
+ *
+ * A collection of robust statistical estimators for real-world data analysis.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.median = exports.disparity = exports.avgSpread = exports.ratio = exports.shift = exports.relSpread = exports.spread = exports.center = void 0;
+var estimators_1 = require("./estimators");
+Object.defineProperty(exports, "center", { enumerable: true, get: function () { return estimators_1.center; } });
+Object.defineProperty(exports, "spread", { enumerable: true, get: function () { return estimators_1.spread; } });
+Object.defineProperty(exports, "relSpread", { enumerable: true, get: function () { return estimators_1.relSpread; } });
+Object.defineProperty(exports, "shift", { enumerable: true, get: function () { return estimators_1.shift; } });
+Object.defineProperty(exports, "ratio", { enumerable: true, get: function () { return estimators_1.ratio; } });
+Object.defineProperty(exports, "avgSpread", { enumerable: true, get: function () { return estimators_1.avgSpread; } });
+Object.defineProperty(exports, "disparity", { enumerable: true, get: function () { return estimators_1.disparity; } });
+var utils_1 = require("./utils");
+Object.defineProperty(exports, "median", { enumerable: true, get: function () { return utils_1.median; } });
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";AAAA;;;;GAIG;;;AAEH,2CAA6F;AAApF,oGAAA,MAAM,OAAA;AAAE,oGAAA,MAAM,OAAA;AAAE,uGAAA,SAAS,OAAA;AAAE,mGAAA,KAAK,OAAA;AAAE,mGAAA,KAAK,OAAA;AAAE,uGAAA,SAAS,OAAA;AAAE,uGAAA,SAAS,OAAA;AAEtE,iCAAiC;AAAxB,+FAAA,MAAM,OAAA"}

package/dist/utils.d.ts

@@ -0,0 +1,17 @@
+/**
+ * Utility functions for statistical calculations
+ */
+/**
+ * Calculate the median of an array of numbers
+ * @param values Array of numbers
+ * @returns The median value
+ */
+export declare function median(values: number[]): number;
+/**
+ * Generate all pairwise combinations of indices
+ * @param n Number of elements
+ * @param includeDiagonal Whether to include pairs (i, i)
+ * @returns Array of index pairs [i, j]
+ */
+export declare function getPairs(n: number, includeDiagonal?: boolean): [number, number][];
+//# sourceMappingURL=utils.d.ts.map

package/dist/utils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"utils.d.ts","sourceRoot":"","sources":["../src/utils.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH;;;;GAIG;AACH,wBAAgB,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,CAa/C;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,eAAe,GAAE,OAAc,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAWvF"}

package/dist/utils.js

@@ -0,0 +1,42 @@
+"use strict";
+/**
+ * Utility functions for statistical calculations
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.median = median;
+exports.getPairs = getPairs;
+/**
+ * Calculate the median of an array of numbers
+ * @param values Array of numbers
+ * @returns The median value
+ */
+function median(values) {
+    if (values.length === 0) {
+        return 0;
+    }
+    const sorted = [...values].sort((a, b) => a - b);
+    const mid = Math.floor(sorted.length / 2);
+    if (sorted.length % 2 === 0) {
+        return (sorted[mid - 1] + sorted[mid]) / 2;
+    }
+    else {
+        return sorted[mid];
+    }
+}
+/**
+ * Generate all pairwise combinations of indices
+ * @param n Number of elements
+ * @param includeDiagonal Whether to include pairs (i, i)
+ * @returns Array of index pairs [i, j]
+ */
+function getPairs(n, includeDiagonal = true) {
+    const pairs = [];
+    for (let i = 0; i < n; i++) {
+        const startJ = includeDiagonal ? i : i + 1;
+        for (let j = startJ; j < n; j++) {
+            pairs.push([i, j]);
+        }
+    }
+    return pairs;
+}
+//# sourceMappingURL=utils.js.map

package/dist/utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"utils.js","sourceRoot":"","sources":["../src/utils.ts"],"names":[],"mappings":";AAAA;;GAEG;;AAOH,wBAaC;AAQD,4BAWC;AArCD;;;;GAIG;AACH,SAAgB,MAAM,CAAC,MAAgB;IACrC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,CAAC,CAAC;IACX,CAAC;IAED,MAAM,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACjD,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAE1C,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAC7C,CAAC;SAAM,CAAC;QACN,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC;IACrB,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,SAAgB,QAAQ,CAAC,CAAS,EAAE,kBAA2B,IAAI;IACjE,MAAM,KAAK,GAAuB,EAAE,CAAC;IAErC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC3C,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC"}

package/package.json

@@ -0,0 +1,49 @@
+{
+  "name": "pragmastat",
+  "version": "3.1.10",
+  "description": "Pragmastat: Pragmatic Statistical Toolkit",
+  "main": "dist/index.js",
+  "types": "dist/index.d.ts",
+  "scripts": {
+    "build": "tsc",
+    "test": "jest",
+    "test:watch": "jest --watch",
+    "test:coverage": "jest --coverage",
+    "lint": "eslint src tests --ext .ts",
+    "format": "prettier --write \"src/**/*.ts\" \"tests/**/*.ts\"",
+    "format:check": "prettier --check \"src/**/*.ts\" \"tests/**/*.ts\"",
+    "clean": "rm -rf dist coverage",
+    "prepublishOnly": "npm run clean && npm run build && npm run test"
+  },
+  "keywords": [
+    "statistics",
+    "robust",
+    "estimators",
+    "median",
+    "hodges-lehmann"
+  ],
+  "author": "Andrey Akinshin",
+  "license": "MIT",
+  "devDependencies": {
+    "@types/jest": "^29.5.0",
+    "@types/node": "^20.0.0",
+    "@typescript-eslint/eslint-plugin": "^6.0.0",
+    "@typescript-eslint/parser": "^6.0.0",
+    "eslint": "^8.0.0",
+    "jest": "^29.5.0",
+    "prettier": "^3.0.0",
+    "ts-jest": "^29.1.0",
+    "typescript": "^5.0.0"
+  },
+  "files": [
+    "dist",
+    "LICENSE",
+    "README.md"
+  ],
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/AndreyAkinshin/pragmastat.git"
+  },
+  "homepage": "https://pragmastat.dev",
+  "doi": "10.5281/zenodo.17236778"
+}