pragmastat 6.0.1 → 7.0.1

package/README.md

@@ -3,10 +3,10 @@
 Install from npm:
 
 ```bash
-npm i pragmastat@6.0.1
+npm i pragmastat@7.0.1
 ```
 
-Source code: https://github.com/AndreyAkinshin/pragmastat/tree/v6.0.1/ts
+Source code: https://github.com/AndreyAkinshin/pragmastat/tree/v7.0.1/ts
 
 Pragmastat on npm: https://www.npmjs.com/package/pragmastat
 
@@ -14,7 +14,9 @@ Pragmastat on npm: https://www.npmjs.com/package/pragmastat
 
 ```typescript
 import {
-    median, center, spread, relSpread, shift, ratio, avgSpread, disparity, shiftBounds, ratioBounds, pairwiseMargin,
+    median, center, spread, relSpread, shift, ratio, avgSpread, disparity,
+    signedRankMargin, pairwiseMargin,
+    centerBounds, shiftBounds, ratioBounds,
     Rng, Uniform, Additive, Exp, Power, Multiplic
 } from '../src';
 
@@ -31,6 +33,9 @@ function main() {
     rng = new Rng("demo-shuffle");
     console.log(rng.shuffle([1, 2, 3, 4, 5])); // [4, 2, 3, 5, 1]
 
+    rng = new Rng("demo-resample");
+    console.log(rng.resample([1, 2, 3, 4, 5], 7)); // [5, 1, 1, 3, 3, 4, 5]
+
     // --- Distribution Sampling ---
 
     rng = new Rng("demo-dist-uniform");
@@ -80,7 +85,15 @@ function main() {
     console.log(ratio(x, y)); // 0.5
     console.log(ratio(y, x)); // 2
 
-    // --- Confidence Bounds ---
+    // --- One-Sample Bounds ---
+
+    x = Array.from({ length: 10 }, (_, i) => i + 1);
+
+    console.log(signedRankMargin(10, 0.05)); // 18
+    console.log(center(x)); // 5.5
+    console.log(centerBounds(x, 0.05)); // { lower: 3.5, upper: 7.5 }
+
+    // --- Two-Sample Bounds ---
 
     x = Array.from({ length: 30 }, (_, i) => i + 1);
     y = Array.from({ length: 30 }, (_, i) => i + 21);

package/dist/assumptions.d.ts

@@ -3,19 +3,21 @@
  *
  * Assumption IDs (canonical priority order):
  *   1. validity - non-empty input with finite defined real values
- *   2. positivity - values must be strictly positive
- *   3. sparity - sample must be non tie-dominant (Spread > 0)
+ *   2. domain - parameter is outside its valid domain
+ *   3. positivity - values must be strictly positive
+ *   4. sparity - sample must be non tie-dominant (Spread > 0)
  *
  * When multiple assumptions are violated, the violation with highest priority
  * is reported. For two-sample functions, subject X is checked before Y.
  */
 export declare const AssumptionId: {
     readonly VALIDITY: "validity";
+    readonly DOMAIN: "domain";
     readonly POSITIVITY: "positivity";
     readonly SPARITY: "sparity";
 };
 export type AssumptionId = (typeof AssumptionId)[keyof typeof AssumptionId];
-export type Subject = 'x' | 'y';
+export type Subject = 'x' | 'y' | 'misrate';
 export interface Violation {
     id: AssumptionId;
     subject: Subject;
@@ -23,15 +25,16 @@ export interface Violation {
 export declare class AssumptionError extends Error {
     readonly violation: Violation;
     constructor(violation: Violation);
-    static validity(_functionName: string, subject: Subject): AssumptionError;
-    static positivity(_functionName: string, subject: Subject): AssumptionError;
-    static sparity(_functionName: string, subject: Subject): AssumptionError;
+    static validity(subject: Subject): AssumptionError;
+    static positivity(subject: Subject): AssumptionError;
+    static sparity(subject: Subject): AssumptionError;
+    static domain(subject: Subject): AssumptionError;
 }
-export declare function checkValidity(values: number[], subject: Subject, functionName: string): void;
-export declare function checkPositivity(values: number[], subject: Subject, functionName: string): void;
-export declare function checkSparity(values: number[], subject: Subject, functionName: string): void;
+export declare function checkValidity(values: number[], subject: Subject): void;
+export declare function checkPositivity(values: number[], subject: Subject): void;
+export declare function checkSparity(values: number[], subject: Subject): void;
 /**
  * Log-transforms an array. Throws AssumptionError if any value is non-positive.
  */
-export declare function log(values: number[], subject: Subject, functionName: string): number[];
+export declare function log(values: number[], subject: Subject): number[];
 //# sourceMappingURL=assumptions.d.ts.map

package/dist/assumptions.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"assumptions.d.ts","sourceRoot":"","sources":["../src/assumptions.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;GAUG;AAEH,eAAO,MAAM,YAAY;;;;CAIf,CAAC;AAEX,MAAM,MAAM,YAAY,GAAG,CAAC,OAAO,YAAY,CAAC,CAAC,MAAM,OAAO,YAAY,CAAC,CAAC;AAE5E,MAAM,MAAM,OAAO,GAAG,GAAG,GAAG,GAAG,CAAC;AAEhC,MAAM,WAAW,SAAS;IACxB,EAAE,EAAE,YAAY,CAAC;IACjB,OAAO,EAAE,OAAO,CAAC;CAClB;AAED,qBAAa,eAAgB,SAAQ,KAAK;IACxC,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC;gBAElB,SAAS,EAAE,SAAS;IAMhC,MAAM,CAAC,QAAQ,CAAC,aAAa,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,eAAe;IAIzE,MAAM,CAAC,UAAU,CAAC,aAAa,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,eAAe;IAI3E,MAAM,CAAC,OAAO,CAAC,aAAa,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,eAAe;CAGzE;AAED,wBAAgB,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,GAAG,IAAI,CAO5F;AAED,wBAAgB,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,GAAG,IAAI,CAI9F;AAED,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,GAAG,IAAI,CAQ3F;AAED;;GAEG;AACH,wBAAgB,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,GAAG,MAAM,EAAE,CAStF"}
+{"version":3,"file":"assumptions.d.ts","sourceRoot":"","sources":["../src/assumptions.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;GAWG;AAEH,eAAO,MAAM,YAAY;;;;;CAKf,CAAC;AAEX,MAAM,MAAM,YAAY,GAAG,CAAC,OAAO,YAAY,CAAC,CAAC,MAAM,OAAO,YAAY,CAAC,CAAC;AAE5E,MAAM,MAAM,OAAO,GAAG,GAAG,GAAG,GAAG,GAAG,SAAS,CAAC;AAE5C,MAAM,WAAW,SAAS;IACxB,EAAE,EAAE,YAAY,CAAC;IACjB,OAAO,EAAE,OAAO,CAAC;CAClB;AAED,qBAAa,eAAgB,SAAQ,KAAK;IACxC,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC;gBAElB,SAAS,EAAE,SAAS;IAOhC,MAAM,CAAC,QAAQ,CAAC,OAAO,EAAE,OAAO,GAAG,eAAe;IAIlD,MAAM,CAAC,UAAU,CAAC,OAAO,EAAE,OAAO,GAAG,eAAe;IAIpD,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,GAAG,eAAe;IAIjD,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,GAAG,eAAe;CAGjD;AAED,wBAAgB,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI,CAOtE;AAED,wBAAgB,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI,CAIxE;AAED,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI,CAQrE;AAED;;GAEG;AACH,wBAAgB,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,OAAO,GAAG,MAAM,EAAE,CAShE"}

package/dist/assumptions.js

@@ -11,64 +11,70 @@ const fastSpread_1 = require("./fastSpread");
  *
  * Assumption IDs (canonical priority order):
  *   1. validity - non-empty input with finite defined real values
- *   2. positivity - values must be strictly positive
- *   3. sparity - sample must be non tie-dominant (Spread > 0)
+ *   2. domain - parameter is outside its valid domain
+ *   3. positivity - values must be strictly positive
+ *   4. sparity - sample must be non tie-dominant (Spread > 0)
  *
  * When multiple assumptions are violated, the violation with highest priority
  * is reported. For two-sample functions, subject X is checked before Y.
  */
 exports.AssumptionId = {
     VALIDITY: 'validity',
+    DOMAIN: 'domain',
     POSITIVITY: 'positivity',
     SPARITY: 'sparity',
 };
 class AssumptionError extends Error {
     constructor(violation) {
-        super(`${violation.id}(${violation.subject})`);
+        const violationStr = `${violation.id}(${violation.subject})`;
+        super(violationStr);
         this.name = 'AssumptionError';
         this.violation = violation;
     }
-    static validity(_functionName, subject) {
+    static validity(subject) {
         return new AssumptionError({ id: exports.AssumptionId.VALIDITY, subject });
     }
-    static positivity(_functionName, subject) {
+    static positivity(subject) {
         return new AssumptionError({ id: exports.AssumptionId.POSITIVITY, subject });
     }
-    static sparity(_functionName, subject) {
+    static sparity(subject) {
         return new AssumptionError({ id: exports.AssumptionId.SPARITY, subject });
     }
+    static domain(subject) {
+        return new AssumptionError({ id: exports.AssumptionId.DOMAIN, subject });
+    }
 }
 exports.AssumptionError = AssumptionError;
-function checkValidity(values, subject, functionName) {
+function checkValidity(values, subject) {
     if (values.length === 0) {
-        throw AssumptionError.validity(functionName, subject);
+        throw AssumptionError.validity(subject);
     }
     if (!values.every((v) => Number.isFinite(v))) {
-        throw AssumptionError.validity(functionName, subject);
+        throw AssumptionError.validity(subject);
     }
 }
-function checkPositivity(values, subject, functionName) {
+function checkPositivity(values, subject) {
     if (values.some((v) => v <= 0)) {
-        throw AssumptionError.positivity(functionName, subject);
+        throw AssumptionError.positivity(subject);
     }
 }
-function checkSparity(values, subject, functionName) {
+function checkSparity(values, subject) {
     if (values.length < 2) {
-        throw AssumptionError.sparity(functionName, subject);
+        throw AssumptionError.sparity(subject);
     }
     const spread = (0, fastSpread_1.fastSpread)(values);
     if (spread <= 0) {
-        throw AssumptionError.sparity(functionName, subject);
+        throw AssumptionError.sparity(subject);
     }
 }
 /**
  * Log-transforms an array. Throws AssumptionError if any value is non-positive.
  */
-function log(values, subject, functionName) {
+function log(values, subject) {
     const result = new Array(values.length);
     for (let i = 0; i < values.length; i++) {
         if (values[i] <= 0) {
-            throw AssumptionError.positivity(functionName, subject);
+            throw AssumptionError.positivity(subject);
         }
         result[i] = Math.log(values[i]);
     }

package/dist/assumptions.js.map

@@ -1 +1 @@
-{"version":3,"file":"assumptions.js","sourceRoot":"","sources":["../src/assumptions.ts"],"names":[],"mappings":";;;AAmDA,sCAOC;AAED,0CAIC;AAED,oCAQC;AAKD,kBASC;AAxFD,6CAA0C;AAE1C;;;;;;;;;;GAUG;AAEU,QAAA,YAAY,GAAG;IAC1B,QAAQ,EAAE,UAAU;IACpB,UAAU,EAAE,YAAY;IACxB,OAAO,EAAE,SAAS;CACV,CAAC;AAWX,MAAa,eAAgB,SAAQ,KAAK;IAGxC,YAAY,SAAoB;QAC9B,KAAK,CAAC,GAAG,SAAS,CAAC,EAAE,IAAI,SAAS,CAAC,OAAO,GAAG,CAAC,CAAC;QAC/C,IAAI,CAAC,IAAI,GAAG,iBAAiB,CAAC;QAC9B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC7B,CAAC;IAED,MAAM,CAAC,QAAQ,CAAC,aAAqB,EAAE,OAAgB;QACrD,OAAO,IAAI,eAAe,CAAC,EAAE,EAAE,EAAE,oBAAY,CAAC,QAAQ,EAAE,OAAO,EAAE,CAAC,CAAC;IACrE,CAAC;IAED,MAAM,CAAC,UAAU,CAAC,aAAqB,EAAE,OAAgB;QACvD,OAAO,IAAI,eAAe,CAAC,EAAE,EAAE,EAAE,oBAAY,CAAC,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC;IACvE,CAAC;IAED,MAAM,CAAC,OAAO,CAAC,aAAqB,EAAE,OAAgB;QACpD,OAAO,IAAI,eAAe,CAAC,EAAE,EAAE,EAAE,oBAAY,CAAC,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC;IACpE,CAAC;CACF;AApBD,0CAoBC;AAED,SAAgB,aAAa,CAAC,MAAgB,EAAE,OAAgB,EAAE,YAAoB;IACpF,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,MAAM,eAAe,CAAC,QAAQ,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;IACxD,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7C,MAAM,eAAe,CAAC,QAAQ,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;IACxD,CAAC;AACH,CAAC;AAED,SAAgB,eAAe,CAAC,MAAgB,EAAE,OAAgB,EAAE,YAAoB;IACtF,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;QAC/B,MAAM,eAAe,CAAC,UAAU,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;IAC1D,CAAC;AACH,CAAC;AAED,SAAgB,YAAY,CAAC,MAAgB,EAAE,OAAgB,EAAE,YAAoB;IACnF,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,eAAe,CAAC,OAAO,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;IACvD,CAAC;IACD,MAAM,MAAM,GAAG,IAAA,uBAAU,EAAC,MAAM,CAAC,CAAC;IAClC,IAAI,MAAM,IAAI,CAAC,EAAE,CAAC;QAChB,MAAM,eAAe,CAAC,OAAO,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;IACvD,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAgB,GAAG,CAAC,MAAgB,EAAE,OAAgB,EAAE,YAAoB;IAC1E,MAAM,MAAM,GAAG,IAAI,KAAK,CAAS,MAAM,CAAC,MAAM,CAAC,CAAC;IAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,IAAI,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACnB,MAAM,eAAe,CAAC,UAAU,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;QAC1D,CAAC;QACD,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}
+{"version":3,"file":"assumptions.js","sourceRoot":"","sources":["../src/assumptions.ts"],"names":[],"mappings":";;;AA0DA,sCAOC;AAED,0CAIC;AAED,oCAQC;AAKD,kBASC;AA/FD,6CAA0C;AAE1C;;;;;;;;;;;GAWG;AAEU,QAAA,YAAY,GAAG;IAC1B,QAAQ,EAAE,UAAU;IACpB,MAAM,EAAE,QAAQ;IAChB,UAAU,EAAE,YAAY;IACxB,OAAO,EAAE,SAAS;CACV,CAAC;AAWX,MAAa,eAAgB,SAAQ,KAAK;IAGxC,YAAY,SAAoB;QAC9B,MAAM,YAAY,GAAG,GAAG,SAAS,CAAC,EAAE,IAAI,SAAS,CAAC,OAAO,GAAG,CAAC;QAC7D,KAAK,CAAC,YAAY,CAAC,CAAC;QACpB,IAAI,CAAC,IAAI,GAAG,iBAAiB,CAAC;QAC9B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC7B,CAAC;IAED,MAAM,CAAC,QAAQ,CAAC,OAAgB;QAC9B,OAAO,IAAI,eAAe,CAAC,EAAE,EAAE,EAAE,oBAAY,CAAC,QAAQ,EAAE,OAAO,EAAE,CAAC,CAAC;IACrE,CAAC;IAED,MAAM,CAAC,UAAU,CAAC,OAAgB;QAChC,OAAO,IAAI,eAAe,CAAC,EAAE,EAAE,EAAE,oBAAY,CAAC,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC;IACvE,CAAC;IAED,MAAM,CAAC,OAAO,CAAC,OAAgB;QAC7B,OAAO,IAAI,eAAe,CAAC,EAAE,EAAE,EAAE,oBAAY,CAAC,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC;IACpE,CAAC;IAED,MAAM,CAAC,MAAM,CAAC,OAAgB;QAC5B,OAAO,IAAI,eAAe,CAAC,EAAE,EAAE,EAAE,oBAAY,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC;IACnE,CAAC;CACF;AAzBD,0CAyBC;AAED,SAAgB,aAAa,CAAC,MAAgB,EAAE,OAAgB;IAC9D,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,MAAM,eAAe,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;IAC1C,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7C,MAAM,eAAe,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;IAC1C,CAAC;AACH,CAAC;AAED,SAAgB,eAAe,CAAC,MAAgB,EAAE,OAAgB;IAChE,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;QAC/B,MAAM,eAAe,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;IAC5C,CAAC;AACH,CAAC;AAED,SAAgB,YAAY,CAAC,MAAgB,EAAE,OAAgB;IAC7D,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,eAAe,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IACzC,CAAC;IACD,MAAM,MAAM,GAAG,IAAA,uBAAU,EAAC,MAAM,CAAC,CAAC;IAClC,IAAI,MAAM,IAAI,CAAC,EAAE,CAAC;QAChB,MAAM,eAAe,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IACzC,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAgB,GAAG,CAAC,MAAgB,EAAE,OAAgB;IACpD,MAAM,MAAM,GAAG,IAAI,KAAK,CAAS,MAAM,CAAC,MAAM,CAAC,CAAC;IAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,IAAI,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACnB,MAAM,eAAe,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QAC5C,CAAC;QACD,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/estimators.d.ts

@@ -1,6 +1,12 @@
 /**
  * Pragmastat estimators implementation
  */
+/**
+ * Calculate the median of an array of numbers
+ * @param values Array of numbers
+ * @returns The median value
+ */
+export declare function median(values: number[]): number;
 /**
  * Calculate the Center - median of all pairwise averages (x[i] + x[j])/2
  * Uses fast O(n log n) algorithm.
@@ -117,4 +123,15 @@ export declare function shiftBounds(x: number[], y: number[], misrate: number):
  * @throws AssumptionError if either sample is empty, contains NaN/Inf, or contains non-positive values
  */
 export declare function ratioBounds(x: number[], y: number[], misrate: number): Bounds;
+/**
+ * Provides exact bounds on the Center (Hodges-Lehmann pseudomedian) with specified misclassification rate
+ *
+ * Uses SignedRankMargin to determine which pairwise averages form the bounds.
+ *
+ * @param x Sample array
+ * @param misrate Misclassification rate (probability that true center falls outside bounds)
+ * @returns An object containing the lower and upper bounds
+ * @throws AssumptionError if sample is empty or contains NaN/Inf
+ */
+export declare function centerBounds(x: number[], misrate: number): Bounds;
 //# sourceMappingURL=estimators.d.ts.map

package/dist/estimators.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"estimators.d.ts","sourceRoot":"","sources":["../src/estimators.ts"],"names":[],"mappings":"AAAA;;GAEG;AAQH;;;;;GAKG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAI1C;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAM1C;AAED;;;;;;;;;GASG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAW7C;AAED;;;;;;GAMG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAMtD;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAWtD;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAkB1D;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAqB1D;AAED;;GAEG;AACH,MAAM,WAAW,MAAM;IACrB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;CACf;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,CAqC7E;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,CAgB7E"}
+{"version":3,"file":"estimators.d.ts","sourceRoot":"","sources":["../src/estimators.ts"],"names":[],"mappings":"AAAA;;GAEG;AAWH;;;;GAIG;AACH,wBAAgB,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,CAY/C;AAED;;;;;GAKG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAI1C;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAM1C;AAED;;;;;;;;;GASG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAW7C;AAED;;;;;;GAMG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAMtD;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAWtD;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAkB1D;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAqB1D;AAED;;GAEG;AACH,MAAM,WAAW,MAAM;IACrB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;CACf;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,CA8C7E;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,CAyB7E;AAED;;;;;;;;;GASG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,CAmCjE"}

package/dist/estimators.js

@@ -3,6 +3,7 @@
  * Pragmastat estimators implementation
  */
 Object.defineProperty(exports, "__esModule", { value: true });
+exports.median = median;
 exports.center = center;
 exports.spread = spread;
 exports.relSpread = relSpread;
@@ -12,11 +13,32 @@ exports.avgSpread = avgSpread;
 exports.disparity = disparity;
 exports.shiftBounds = shiftBounds;
 exports.ratioBounds = ratioBounds;
+exports.centerBounds = centerBounds;
 const fastCenter_1 = require("./fastCenter");
 const fastSpread_1 = require("./fastSpread");
 const fastShift_1 = require("./fastShift");
 const pairwiseMargin_1 = require("./pairwiseMargin");
+const signedRankMargin_1 = require("./signedRankMargin");
+const fastCenterQuantiles_1 = require("./fastCenterQuantiles");
+const minMisrate_1 = require("./minMisrate");
 const assumptions_1 = require("./assumptions");
+/**
+ * Calculate the median of an array of numbers
+ * @param values Array of numbers
+ * @returns The median value
+ */
+function median(values) {
+    // Check validity (priority 0)
+    (0, assumptions_1.checkValidity)(values, 'x');
+    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];
+    }
+}
 /**
  * Calculate the Center - median of all pairwise averages (x[i] + x[j])/2
  * Uses fast O(n log n) algorithm.
@@ -25,7 +47,7 @@ const assumptions_1 = require("./assumptions");
  */
 function center(x) {
     // Check validity (priority 0)
-    (0, assumptions_1.checkValidity)(x, 'x', 'Center');
+    (0, assumptions_1.checkValidity)(x, 'x');
     return (0, fastCenter_1.fastCenter)(x);
 }
 /**
@@ -41,9 +63,9 @@ function center(x) {
  */
 function spread(x) {
     // Check validity (priority 0)
-    (0, assumptions_1.checkValidity)(x, 'x', 'Spread');
+    (0, assumptions_1.checkValidity)(x, 'x');
     // Check sparity (priority 2)
-    (0, assumptions_1.checkSparity)(x, 'x', 'Spread');
+    (0, assumptions_1.checkSparity)(x, 'x');
     return (0, fastSpread_1.fastSpread)(x);
 }
 /**
@@ -58,9 +80,9 @@ function spread(x) {
  */
 function relSpread(x) {
     // Check validity (priority 0)
-    (0, assumptions_1.checkValidity)(x, 'x', 'RelSpread');
+    (0, assumptions_1.checkValidity)(x, 'x');
     // Check positivity (priority 1)
-    (0, assumptions_1.checkPositivity)(x, 'x', 'RelSpread');
+    (0, assumptions_1.checkPositivity)(x, 'x');
     // Calculate center (we know x is valid, center should succeed)
     const c = (0, fastCenter_1.fastCenter)(x);
     // Calculate spread (using internal implementation since we already validated)
@@ -77,8 +99,8 @@ function relSpread(x) {
  */
 function shift(x, y) {
     // Check validity (priority 0)
-    (0, assumptions_1.checkValidity)(x, 'x', 'Shift');
-    (0, assumptions_1.checkValidity)(y, 'y', 'Shift');
+    (0, assumptions_1.checkValidity)(x, 'x');
+    (0, assumptions_1.checkValidity)(y, 'y');
     return (0, fastShift_1.fastShift)(x, y, [0.5], false)[0];
 }
 /**
@@ -97,13 +119,13 @@ function shift(x, y) {
  */
 function ratio(x, y) {
     // Check validity for x (priority 0, subject x)
-    (0, assumptions_1.checkValidity)(x, 'x', 'Ratio');
+    (0, assumptions_1.checkValidity)(x, 'x');
     // Check validity for y (priority 0, subject y)
-    (0, assumptions_1.checkValidity)(y, 'y', 'Ratio');
+    (0, assumptions_1.checkValidity)(y, 'y');
     // Check positivity for x (priority 1, subject x)
-    (0, assumptions_1.checkPositivity)(x, 'x', 'Ratio');
+    (0, assumptions_1.checkPositivity)(x, 'x');
     // Check positivity for y (priority 1, subject y)
-    (0, assumptions_1.checkPositivity)(y, 'y', 'Ratio');
+    (0, assumptions_1.checkPositivity)(y, 'y');
     return (0, fastShift_1.fastRatio)(x, y, [0.5], false)[0];
 }
 /**
@@ -120,13 +142,13 @@ function ratio(x, y) {
  */
 function avgSpread(x, y) {
     // Check validity for x (priority 0, subject x)
-    (0, assumptions_1.checkValidity)(x, 'x', 'AvgSpread');
+    (0, assumptions_1.checkValidity)(x, 'x');
     // Check validity for y (priority 0, subject y)
-    (0, assumptions_1.checkValidity)(y, 'y', 'AvgSpread');
+    (0, assumptions_1.checkValidity)(y, 'y');
     // Check sparity for x (priority 2, subject x)
-    (0, assumptions_1.checkSparity)(x, 'x', 'AvgSpread');
+    (0, assumptions_1.checkSparity)(x, 'x');
     // Check sparity for y (priority 2, subject y)
-    (0, assumptions_1.checkSparity)(y, 'y', 'AvgSpread');
+    (0, assumptions_1.checkSparity)(y, 'y');
     const nx = x.length;
     const ny = y.length;
     // Calculate spreads (using internal implementation since we already validated)
@@ -148,13 +170,13 @@ function avgSpread(x, y) {
  */
 function disparity(x, y) {
     // Check validity for x (priority 0, subject x)
-    (0, assumptions_1.checkValidity)(x, 'x', 'Disparity');
+    (0, assumptions_1.checkValidity)(x, 'x');
     // Check validity for y (priority 0, subject y)
-    (0, assumptions_1.checkValidity)(y, 'y', 'Disparity');
+    (0, assumptions_1.checkValidity)(y, 'y');
     // Check sparity for x (priority 2, subject x)
-    (0, assumptions_1.checkSparity)(x, 'x', 'Disparity');
+    (0, assumptions_1.checkSparity)(x, 'x');
     // Check sparity for y (priority 2, subject y)
-    (0, assumptions_1.checkSparity)(y, 'y', 'Disparity');
+    (0, assumptions_1.checkSparity)(y, 'y');
     const nx = x.length;
     const ny = y.length;
     // Calculate shift (we know inputs are valid)
@@ -179,11 +201,18 @@ function disparity(x, y) {
  */
 function shiftBounds(x, y, misrate) {
     // Check validity for x
-    (0, assumptions_1.checkValidity)(x, 'x', 'ShiftBounds');
+    (0, assumptions_1.checkValidity)(x, 'x');
     // Check validity for y
-    (0, assumptions_1.checkValidity)(y, 'y', 'ShiftBounds');
+    (0, assumptions_1.checkValidity)(y, 'y');
     const n = x.length;
     const m = y.length;
+    if (isNaN(misrate) || misrate < 0 || misrate > 1) {
+        throw assumptions_1.AssumptionError.domain('misrate');
+    }
+    const minMisrate = (0, minMisrate_1.minAchievableMisrateTwoSample)(n, m);
+    if (misrate < minMisrate) {
+        throw assumptions_1.AssumptionError.domain('misrate');
+    }
     // Sort both arrays
     const xs = [...x].sort((a, b) => a - b);
     const ys = [...y].sort((a, b) => a - b);
@@ -224,11 +253,18 @@ function shiftBounds(x, y, misrate) {
  * @throws AssumptionError if either sample is empty, contains NaN/Inf, or contains non-positive values
  */
 function ratioBounds(x, y, misrate) {
-    (0, assumptions_1.checkValidity)(x, 'x', 'RatioBounds');
-    (0, assumptions_1.checkValidity)(y, 'y', 'RatioBounds');
+    (0, assumptions_1.checkValidity)(x, 'x');
+    (0, assumptions_1.checkValidity)(y, 'y');
+    if (isNaN(misrate) || misrate < 0 || misrate > 1) {
+        throw assumptions_1.AssumptionError.domain('misrate');
+    }
+    const minMisrate = (0, minMisrate_1.minAchievableMisrateTwoSample)(x.length, y.length);
+    if (misrate < minMisrate) {
+        throw assumptions_1.AssumptionError.domain('misrate');
+    }
     // Log-transform samples (includes positivity check)
-    const logX = (0, assumptions_1.log)(x, 'x', 'RatioBounds');
-    const logY = (0, assumptions_1.log)(y, 'y', 'RatioBounds');
+    const logX = (0, assumptions_1.log)(x, 'x');
+    const logY = (0, assumptions_1.log)(y, 'y');
     // Delegate to shiftBounds in log-space
     const logBounds = shiftBounds(logX, logY, misrate);
     // Exp-transform back to ratio-space
@@ -237,4 +273,41 @@ function ratioBounds(x, y, misrate) {
         upper: Math.exp(logBounds.upper),
     };
 }
+/**
+ * Provides exact bounds on the Center (Hodges-Lehmann pseudomedian) with specified misclassification rate
+ *
+ * Uses SignedRankMargin to determine which pairwise averages form the bounds.
+ *
+ * @param x Sample array
+ * @param misrate Misclassification rate (probability that true center falls outside bounds)
+ * @returns An object containing the lower and upper bounds
+ * @throws AssumptionError if sample is empty or contains NaN/Inf
+ */
+function centerBounds(x, misrate) {
+    (0, assumptions_1.checkValidity)(x, 'x');
+    if (isNaN(misrate) || misrate < 0 || misrate > 1) {
+        throw assumptions_1.AssumptionError.domain('misrate');
+    }
+    const n = x.length;
+    if (n < 2) {
+        throw assumptions_1.AssumptionError.domain('x');
+    }
+    // Validate misrate
+    const minMisrate = (0, minMisrate_1.minAchievableMisrateOneSample)(n);
+    if (misrate < minMisrate) {
+        throw assumptions_1.AssumptionError.domain('misrate');
+    }
+    // Total number of pairwise averages (including self-pairs)
+    const totalPairs = (n * (n + 1)) / 2;
+    // Get signed-rank margin
+    const margin = (0, signedRankMargin_1.signedRankMargin)(n, misrate);
+    const halfMargin = Math.min(Math.floor(margin / 2), Math.floor((totalPairs - 1) / 2));
+    // k_left and k_right are 1-based ranks
+    const kLeft = halfMargin + 1;
+    const kRight = totalPairs - halfMargin;
+    // Sort the input
+    const sorted = [...x].sort((a, b) => a - b);
+    const [lo, hi] = (0, fastCenterQuantiles_1.fastCenterQuantileBounds)(sorted, kLeft, kRight);
+    return { lower: lo, upper: hi };
+}
 //# sourceMappingURL=estimators.js.map

package/dist/estimators.js.map

@@ -1 +1 @@
-{"version":3,"file":"estimators.js","sourceRoot":"","sources":["../src/estimators.ts"],"names":[],"mappings":";AAAA;;GAEG;;AAcH,wBAIC;AAaD,wBAMC;AAYD,8BAWC;AASD,sBAMC;AAgBD,sBAWC;AAcD,8BAkBC;AAcD,8BAqBC;AAsBD,kCAqCC;AAkBD,kCAgBC;AApQD,6CAA0C;AAC1C,6CAA0C;AAC1C,2CAAmD;AACnD,qDAAkD;AAClD,+CAAkF;AAElF;;;;;GAKG;AACH,SAAgB,MAAM,CAAC,CAAW;IAChC,8BAA8B;IAC9B,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;IAChC,OAAO,IAAA,uBAAU,EAAC,CAAC,CAAC,CAAC;AACvB,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAgB,MAAM,CAAC,CAAW;IAChC,8BAA8B;IAC9B,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;IAChC,6BAA6B;IAC7B,IAAA,0BAAY,EAAC,CAAC,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;IAC/B,OAAO,IAAA,uBAAU,EAAC,CAAC,CAAC,CAAC;AACvB,CAAC;AAED;;;;;;;;;GASG;AACH,SAAgB,SAAS,CAAC,CAAW;IACnC,8BAA8B;IAC9B,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC;IACnC,gCAAgC;IAChC,IAAA,6BAAe,EAAC,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC;IACrC,+DAA+D;IAC/D,MAAM,CAAC,GAAG,IAAA,uBAAU,EAAC,CAAC,CAAC,CAAC;IACxB,8EAA8E;IAC9E,MAAM,CAAC,GAAG,IAAA,uBAAU,EAAC,CAAC,CAAC,CAAC;IACxB,gEAAgE;IAChE,OAAO,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACzB,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,KAAK,CAAC,CAAW,EAAE,CAAW;IAC5C,8BAA8B;IAC9B,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAC/B,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAE/B,OAAO,IAAA,qBAAS,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1C,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,SAAgB,KAAK,CAAC,CAAW,EAAE,CAAW;IAC5C,+CAA+C;IAC/C,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAC/B,+CAA+C;IAC/C,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAC/B,iDAAiD;IACjD,IAAA,6BAAe,EAAC,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IACjC,iDAAiD;IACjD,IAAA,6BAAe,EAAC,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAEjC,OAAO,IAAA,qBAAS,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1C,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAgB,SAAS,CAAC,CAAW,EAAE,CAAW;IAChD,+CAA+C;IAC/C,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC;IACnC,+CAA+C;IAC/C,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC;IACnC,8CAA8C;IAC9C,IAAA,0BAAY,EAAC,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC;IAClC,8CAA8C;IAC9C,IAAA,0BAAY,EAAC,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC;IAElC,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC;IACpB,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC;IAEpB,+EAA+E;IAC/E,MAAM,OAAO,GAAG,IAAA,uBAAU,EAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,OAAO,GAAG,IAAA,uBAAU,EAAC,CAAC,CAAC,CAAC;IAE9B,OAAO,CAAC,EAAE,GAAG,OAAO,GAAG,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;AACnD,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAgB,SAAS,CAAC,CAAW,EAAE,CAAW;IAChD,+CAA+C;IAC/C,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC;IACnC,+CAA+C;IAC/C,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC;IACnC,8CAA8C;IAC9C,IAAA,0BAAY,EAAC,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC;IAClC,8CAA8C;IAC9C,IAAA,0BAAY,EAAC,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC;IAElC,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC;IACpB,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC;IAEpB,6CAA6C;IAC7C,MAAM,QAAQ,GAAG,IAAA,qBAAS,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAClD,kFAAkF;IAClF,MAAM,OAAO,GAAG,IAAA,uBAAU,EAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,OAAO,GAAG,IAAA,uBAAU,EAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,YAAY,GAAG,CAAC,EAAE,GAAG,OAAO,GAAG,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IAE/D,OAAO,QAAQ,GAAG,YAAY,CAAC;AACjC,CAAC;AAUD;;;;;;;;;;;GAWG;AACH,SAAgB,WAAW,CAAC,CAAW,EAAE,CAAW,EAAE,OAAe;IACnE,uBAAuB;IACvB,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,EAAE,aAAa,CAAC,CAAC;IACrC,uBAAuB;IACvB,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,EAAE,aAAa,CAAC,CAAC;IAErC,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IAEnB,mBAAmB;IACnB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACxC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAExC,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;IAEpB,6FAA6F;IAC7F,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QAChB,MAAM,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAC5B,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;IACxC,CAAC;IAED,MAAM,MAAM,GAAG,IAAA,+BAAc,EAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;IAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjF,MAAM,KAAK,GAAG,UAAU,CAAC;IACzB,MAAM,MAAM,GAAG,KAAK,GAAG,CAAC,GAAG,UAAU,CAAC;IAEtC,6BAA6B;IAC7B,MAAM,WAAW,GAAG,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;IACnC,MAAM,KAAK,GAAG,KAAK,GAAG,WAAW,CAAC;IAClC,MAAM,MAAM,GAAG,MAAM,GAAG,WAAW,CAAC;IAEpC,6DAA6D;IAC7D,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,IAAA,qBAAS,EAAC,EAAE,EAAE,EAAE,EAAE,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC;IAC/D,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACpC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAEpC,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AAC1B,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,SAAgB,WAAW,CAAC,CAAW,EAAE,CAAW,EAAE,OAAe;IACnE,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,EAAE,aAAa,CAAC,CAAC;IACrC,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,EAAE,aAAa,CAAC,CAAC;IAErC,oDAAoD;IACpD,MAAM,IAAI,GAAG,IAAA,iBAAG,EAAC,CAAC,EAAE,GAAG,EAAE,aAAa,CAAC,CAAC;IACxC,MAAM,IAAI,GAAG,IAAA,iBAAG,EAAC,CAAC,EAAE,GAAG,EAAE,aAAa,CAAC,CAAC;IAExC,uCAAuC;IACvC,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;IAEnD,oCAAoC;IACpC,OAAO;QACL,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC;QAChC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC;KACjC,CAAC;AACJ,CAAC"}
+{"version":3,"file":"estimators.js","sourceRoot":"","sources":["../src/estimators.ts"],"names":[],"mappings":";AAAA;;GAEG;;AAgBH,wBAYC;AAQD,wBAIC;AAaD,wBAMC;AAYD,8BAWC;AASD,sBAMC;AAgBD,sBAWC;AAcD,8BAkBC;AAcD,8BAqBC;AAsBD,kCA8CC;AAkBD,kCAyBC;AAYD,oCAmCC;AA3VD,6CAA0C;AAC1C,6CAA0C;AAC1C,2CAAmD;AACnD,qDAAkD;AAClD,yDAAsD;AACtD,+DAAiE;AACjE,6CAA4F;AAC5F,+CAAmG;AAEnG;;;;GAIG;AACH,SAAgB,MAAM,CAAC,MAAgB;IACrC,8BAA8B;IAC9B,IAAA,2BAAa,EAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IAE3B,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,MAAM,CAAC,CAAW;IAChC,8BAA8B;IAC9B,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACtB,OAAO,IAAA,uBAAU,EAAC,CAAC,CAAC,CAAC;AACvB,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAgB,MAAM,CAAC,CAAW;IAChC,8BAA8B;IAC9B,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACtB,6BAA6B;IAC7B,IAAA,0BAAY,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACrB,OAAO,IAAA,uBAAU,EAAC,CAAC,CAAC,CAAC;AACvB,CAAC;AAED;;;;;;;;;GASG;AACH,SAAgB,SAAS,CAAC,CAAW;IACnC,8BAA8B;IAC9B,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACtB,gCAAgC;IAChC,IAAA,6BAAe,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACxB,+DAA+D;IAC/D,MAAM,CAAC,GAAG,IAAA,uBAAU,EAAC,CAAC,CAAC,CAAC;IACxB,8EAA8E;IAC9E,MAAM,CAAC,GAAG,IAAA,uBAAU,EAAC,CAAC,CAAC,CAAC;IACxB,gEAAgE;IAChE,OAAO,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACzB,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,KAAK,CAAC,CAAW,EAAE,CAAW;IAC5C,8BAA8B;IAC9B,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACtB,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAEtB,OAAO,IAAA,qBAAS,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1C,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,SAAgB,KAAK,CAAC,CAAW,EAAE,CAAW;IAC5C,+CAA+C;IAC/C,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACtB,+CAA+C;IAC/C,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACtB,iDAAiD;IACjD,IAAA,6BAAe,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACxB,iDAAiD;IACjD,IAAA,6BAAe,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAExB,OAAO,IAAA,qBAAS,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1C,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAgB,SAAS,CAAC,CAAW,EAAE,CAAW;IAChD,+CAA+C;IAC/C,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACtB,+CAA+C;IAC/C,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACtB,8CAA8C;IAC9C,IAAA,0BAAY,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACrB,8CAA8C;IAC9C,IAAA,0BAAY,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAErB,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC;IACpB,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC;IAEpB,+EAA+E;IAC/E,MAAM,OAAO,GAAG,IAAA,uBAAU,EAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,OAAO,GAAG,IAAA,uBAAU,EAAC,CAAC,CAAC,CAAC;IAE9B,OAAO,CAAC,EAAE,GAAG,OAAO,GAAG,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;AACnD,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAgB,SAAS,CAAC,CAAW,EAAE,CAAW;IAChD,+CAA+C;IAC/C,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACtB,+CAA+C;IAC/C,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACtB,8CAA8C;IAC9C,IAAA,0BAAY,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACrB,8CAA8C;IAC9C,IAAA,0BAAY,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAErB,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC;IACpB,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC;IAEpB,6CAA6C;IAC7C,MAAM,QAAQ,GAAG,IAAA,qBAAS,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAClD,kFAAkF;IAClF,MAAM,OAAO,GAAG,IAAA,uBAAU,EAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,OAAO,GAAG,IAAA,uBAAU,EAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,YAAY,GAAG,CAAC,EAAE,GAAG,OAAO,GAAG,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IAE/D,OAAO,QAAQ,GAAG,YAAY,CAAC;AACjC,CAAC;AAUD;;;;;;;;;;;GAWG;AACH,SAAgB,WAAW,CAAC,CAAW,EAAE,CAAW,EAAE,OAAe;IACnE,uBAAuB;IACvB,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACtB,uBAAuB;IACvB,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAEtB,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IAEnB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,OAAO,GAAG,CAAC,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;QACjD,MAAM,6BAAe,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAC1C,CAAC;IAED,MAAM,UAAU,GAAG,IAAA,0CAA6B,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACvD,IAAI,OAAO,GAAG,UAAU,EAAE,CAAC;QACzB,MAAM,6BAAe,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAC1C,CAAC;IAED,mBAAmB;IACnB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACxC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAExC,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;IAEpB,6FAA6F;IAC7F,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QAChB,MAAM,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAC5B,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;IACxC,CAAC;IAED,MAAM,MAAM,GAAG,IAAA,+BAAc,EAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;IAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjF,MAAM,KAAK,GAAG,UAAU,CAAC;IACzB,MAAM,MAAM,GAAG,KAAK,GAAG,CAAC,GAAG,UAAU,CAAC;IAEtC,6BAA6B;IAC7B,MAAM,WAAW,GAAG,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;IACnC,MAAM,KAAK,GAAG,KAAK,GAAG,WAAW,CAAC;IAClC,MAAM,MAAM,GAAG,MAAM,GAAG,WAAW,CAAC;IAEpC,6DAA6D;IAC7D,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,IAAA,qBAAS,EAAC,EAAE,EAAE,EAAE,EAAE,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC;IAC/D,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACpC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAEpC,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AAC1B,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,SAAgB,WAAW,CAAC,CAAW,EAAE,CAAW,EAAE,OAAe;IACnE,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACtB,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAEtB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,OAAO,GAAG,CAAC,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;QACjD,MAAM,6BAAe,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAC1C,CAAC;IAED,MAAM,UAAU,GAAG,IAAA,0CAA6B,EAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;IACrE,IAAI,OAAO,GAAG,UAAU,EAAE,CAAC;QACzB,MAAM,6BAAe,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAC1C,CAAC;IAED,oDAAoD;IACpD,MAAM,IAAI,GAAG,IAAA,iBAAG,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACzB,MAAM,IAAI,GAAG,IAAA,iBAAG,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAEzB,uCAAuC;IACvC,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;IAEnD,oCAAoC;IACpC,OAAO;QACL,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC;QAChC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC;KACjC,CAAC;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,SAAgB,YAAY,CAAC,CAAW,EAAE,OAAe;IACvD,IAAA,2BAAa,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAEtB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,OAAO,GAAG,CAAC,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;QACjD,MAAM,6BAAe,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAC1C,CAAC;IAED,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IAEnB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACV,MAAM,6BAAe,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACpC,CAAC;IAED,mBAAmB;IACnB,MAAM,UAAU,GAAG,IAAA,0CAA6B,EAAC,CAAC,CAAC,CAAC;IACpD,IAAI,OAAO,GAAG,UAAU,EAAE,CAAC;QACzB,MAAM,6BAAe,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAC1C,CAAC;IAED,2DAA2D;IAC3D,MAAM,UAAU,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAErC,yBAAyB;IACzB,MAAM,MAAM,GAAG,IAAA,mCAAgB,EAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAEtF,uCAAuC;IACvC,MAAM,KAAK,GAAG,UAAU,GAAG,CAAC,CAAC;IAC7B,MAAM,MAAM,GAAG,UAAU,GAAG,UAAU,CAAC;IAEvC,iBAAiB;IACjB,MAAM,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAE5C,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,IAAA,8CAAwB,EAAC,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IACjE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;AAClC,CAAC"}

package/dist/fastCenterQuantiles.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Fast algorithm for finding quantiles of pairwise averages (x[i] + x[j])/2.
+ *
+ * Uses binary search with counting function to find exact quantiles in O(n log(range)) time.
+ */
+/**
+ * Finds both lower and upper quantile bounds for pairwise averages.
+ *
+ * @param sorted Sorted array of values
+ * @param kLo 1-based rank for lower bound
+ * @param kHi 1-based rank for upper bound
+ * @returns Tuple of [lower bound, upper bound]
+ */
+export declare function fastCenterQuantileBounds(sorted: number[], kLo: number, kHi: number): [number, number];
+//# sourceMappingURL=fastCenterQuantiles.d.ts.map

package/dist/fastCenterQuantiles.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"fastCenterQuantiles.d.ts","sourceRoot":"","sources":["../src/fastCenterQuantiles.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAkHH;;;;;;;GAOG;AACH,wBAAgB,wBAAwB,CACtC,MAAM,EAAE,MAAM,EAAE,EAChB,GAAG,EAAE,MAAM,EACX,GAAG,EAAE,MAAM,GACV,CAAC,MAAM,EAAE,MAAM,CAAC,CAalB"}

package/dist/fastCenterQuantiles.js

@@ -0,0 +1,125 @@
+"use strict";
+/**
+ * Fast algorithm for finding quantiles of pairwise averages (x[i] + x[j])/2.
+ *
+ * Uses binary search with counting function to find exact quantiles in O(n log(range)) time.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.fastCenterQuantileBounds = fastCenterQuantileBounds;
+/** Relative epsilon for floating-point comparisons in binary search convergence. */
+const RELATIVE_EPSILON = 1e-14;
+/**
+ * Counts how many pairwise averages (sorted[i] + sorted[j])/2 where i <= j are <= threshold.
+ *
+ * @param sorted Sorted array of values
+ * @param threshold Threshold to count against
+ * @returns Number of pairwise averages <= threshold
+ */
+function countPairsLessOrEqual(sorted, threshold) {
+    const n = sorted.length;
+    let count = 0;
+    // j is not reset: as i increases, threshold decreases monotonically
+    let j = n - 1;
+    for (let i = 0; i < n; i++) {
+        const target = 2 * threshold - sorted[i];
+        while (j >= 0 && sorted[j] > target) {
+            j--;
+        }
+        if (j >= i) {
+            count += j - i + 1;
+        }
+    }
+    return count;
+}
+/**
+ * Finds the k-th smallest pairwise average using binary search.
+ *
+ * @param sorted Sorted array of values
+ * @param k 1-based rank of the desired quantile
+ * @returns The k-th smallest pairwise average
+ */
+function findExactQuantile(sorted, k) {
+    const n = sorted.length;
+    const totalPairs = (n * (n + 1)) / 2;
+    if (n === 1)
+        return sorted[0];
+    if (k === 1)
+        return sorted[0];
+    if (k === totalPairs)
+        return sorted[n - 1];
+    const min = sorted[0];
+    const max = sorted[n - 1];
+    // Binary search on value range
+    let lo = min;
+    let hi = max;
+    while (hi - lo > RELATIVE_EPSILON * Math.max(1.0, Math.abs(lo), Math.abs(hi))) {
+        const mid = (lo + hi) / 2;
+        const count = countPairsLessOrEqual(sorted, mid);
+        if (count < k) {
+            lo = mid;
+        }
+        else {
+            hi = mid;
+        }
+    }
+    const target = (lo + hi) / 2;
+    // Extract candidates that are close to the target
+    const candidates = [];
+    for (let i = 0; i < n; i++) {
+        const threshold = 2 * target - sorted[i];
+        // Find left boundary using binary search
+        let left = i;
+        let right = n;
+        while (left < right) {
+            const m = Math.floor((left + right) / 2);
+            if (sorted[m] < threshold - RELATIVE_EPSILON) {
+                left = m + 1;
+            }
+            else {
+                right = m;
+            }
+        }
+        if (left < n &&
+            left >= i &&
+            Math.abs(sorted[left] - threshold) < RELATIVE_EPSILON * Math.max(1.0, Math.abs(threshold))) {
+            candidates.push((sorted[i] + sorted[left]) / 2);
+        }
+        if (left > i) {
+            const avgBefore = (sorted[i] + sorted[left - 1]) / 2;
+            if (avgBefore <= target + RELATIVE_EPSILON) {
+                candidates.push(avgBefore);
+            }
+        }
+    }
+    if (candidates.length === 0) {
+        return target;
+    }
+    candidates.sort((a, b) => a - b);
+    // Return the candidate that gives exactly k pairs <= it
+    for (const c of candidates) {
+        if (countPairsLessOrEqual(sorted, c) >= k) {
+            return c;
+        }
+    }
+    return target;
+}
+/**
+ * Finds both lower and upper quantile bounds for pairwise averages.
+ *
+ * @param sorted Sorted array of values
+ * @param kLo 1-based rank for lower bound
+ * @param kHi 1-based rank for upper bound
+ * @returns Tuple of [lower bound, upper bound]
+ */
+function fastCenterQuantileBounds(sorted, kLo, kHi) {
+    const n = sorted.length;
+    const totalPairs = (n * (n + 1)) / 2;
+    // Clamp ranks to valid range
+    const clampedLo = Math.max(1, Math.min(kLo, totalPairs));
+    const clampedHi = Math.max(1, Math.min(kHi, totalPairs));
+    const lower = findExactQuantile(sorted, clampedLo);
+    const upper = findExactQuantile(sorted, clampedHi);
+    // Ensure lower <= upper
+    return lower > upper ? [upper, lower] : [lower, upper];
+}
+//# sourceMappingURL=fastCenterQuantiles.js.map