@danielsimonjr/mathts-functions 0.14.0 → 0.15.0

package/dist/descriptive-stats.d.ts

@@ -56,5 +56,16 @@ export declare function cov(x: Vec | number[][], y?: Vec, ddof?: number): number
  * columns = variables). Diagonal is 1; off-diagonals are Pearson r.
  */
 export declare function corrcoef(matrix: number[][]): number[][];
+/**
+ * Kendall's τ_b rank correlation coefficient — a tie-corrected measure of
+ * ordinal association based on the difference between concordant and discordant
+ * pairs. Complements {@link spearman} (rank Pearson) and Pearson `corr`.
+ * Returns τ_b = (P − Q) / √((n₀ − n₁)(n₀ − n₂)), matching `scipy.stats.kendalltau`
+ * (`variant='b'`, its default), where n₀ = n(n−1)/2 and n₁/n₂ are the tie-pair
+ * counts in x and y respectively.
+ *
+ * @example kendallTau([1,2,3,4,5], [2,1,4,3,5]) // 0.6
+ */
+export declare function kendallTau(x: Vec, y: Vec): number;
 export {};
 //# sourceMappingURL=descriptive-stats.d.ts.map

package/dist/descriptive-stats.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"descriptive-stats.d.ts","sourceRoot":"","sources":["../src/descriptive-stats.ts"],"names":[],"mappings":"AAsBA,KAAK,GAAG,GAAG,SAAS,MAAM,EAAE,GAAG,YAAY,CAAC;AAiB5C;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,GAAG,GAAG,MAAM,EAAE,CAazC;AAED;;;;;;;GAOG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,GAAG,MAAM,CAsB/C;AAED,gFAAgF;AAChF,wBAAgB,KAAK,CAAC,CAAC,EAAE,GAAG,GAAG,MAAM,CAKpC;AAED,6DAA6D;AAC7D,wBAAgB,KAAK,CAAC,CAAC,EAAE,GAAG,GAAG,MAAM,CAKpC;AAED,qFAAqF;AACrF,wBAAgB,MAAM,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,UAAO,GAAG,MAAM,CAOhE;AAED;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,GAAE;IAAE,IAAI,CAAC,EAAE,OAAO,CAAA;CAAO,GAAG,MAAM,CAatE;AAED;;;;GAIG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,GAAE;IAAE,MAAM,CAAC,EAAE,OAAO,CAAC;IAAC,IAAI,CAAC,EAAE,OAAO,CAAA;CAAO,GAAG,MAAM,CAaxF;AAED,wDAAwD;AACxD,wBAAgB,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,MAAM,CAGlC;AAED,oDAAoD;AACpD,wBAAgB,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,MAAM,CAIlC;AAED;;;GAGG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,GAAG,GAAG,MAAM,EAAE,CAOvC;AAED;;;;;GAKG;AACH,wBAAgB,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,SAAI,GAAG,MAAM,GAAG,MAAM,EAAE,EAAE,CAgC/E;AAED;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE,CAOvD"}
+{"version":3,"file":"descriptive-stats.d.ts","sourceRoot":"","sources":["../src/descriptive-stats.ts"],"names":[],"mappings":"AAsBA,KAAK,GAAG,GAAG,SAAS,MAAM,EAAE,GAAG,YAAY,CAAC;AAiB5C;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,GAAG,GAAG,MAAM,EAAE,CAazC;AAED;;;;;;;GAOG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,GAAG,MAAM,CAsB/C;AAED,gFAAgF;AAChF,wBAAgB,KAAK,CAAC,CAAC,EAAE,GAAG,GAAG,MAAM,CAKpC;AAED,6DAA6D;AAC7D,wBAAgB,KAAK,CAAC,CAAC,EAAE,GAAG,GAAG,MAAM,CAKpC;AAED,qFAAqF;AACrF,wBAAgB,MAAM,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,UAAO,GAAG,MAAM,CAOhE;AAED;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,GAAE;IAAE,IAAI,CAAC,EAAE,OAAO,CAAA;CAAO,GAAG,MAAM,CAatE;AAED;;;;GAIG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,GAAE;IAAE,MAAM,CAAC,EAAE,OAAO,CAAC;IAAC,IAAI,CAAC,EAAE,OAAO,CAAA;CAAO,GAAG,MAAM,CAaxF;AAED,wDAAwD;AACxD,wBAAgB,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,MAAM,CAGlC;AAED,oDAAoD;AACpD,wBAAgB,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,MAAM,CAIlC;AAED;;;GAGG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,GAAG,GAAG,MAAM,EAAE,CAOvC;AAED;;;;;GAKG;AACH,wBAAgB,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,SAAI,GAAG,MAAM,GAAG,MAAM,EAAE,EAAE,CAgC/E;AAED;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE,CAOvD;AAED;;;;;;;;;GASG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,GAAG,MAAM,CA0BjD"}

package/dist/index.d.ts

@@ -17,7 +17,7 @@ export { evaluate, compileExpr, parse, parser, reviver, replacer } from './facto
 export { help } from './help.js';
 export { derivativeAt, valueAndDerivativeAt, gradientAt } from './grad-forward.js';
 export type { DualFn } from './grad-forward.js';
-export { gmean, hmean, moment, skewness, kurtosis, iqr, sem, zscore, cov, corrcoef, rankdata, spearman, } from './descriptive-stats.js';
+export { gmean, hmean, moment, skewness, kurtosis, iqr, sem, zscore, cov, corrcoef, rankdata, spearman, kendallTau, } from './descriptive-stats.js';
 export { clamp, sigmoid, logsumexp, softmax, cumprod, cummax, cummin, cumtrapz, } from './numeric-extra.js';
 export { normalQuantile, studentTCDF, studentTQuantile, chiSquaredCDF, chiSquaredQuantile, fCDF, fQuantile, gammaCDF, gammaQuantile, betaCDF, betaQuantile, cauchyPDF, cauchyCDF, cauchyQuantile, laplacePDF, laplaceCDF, laplaceQuantile, logisticPDF, logisticCDF, logisticQuantile, } from './distribution-functions.js';
 export { fTest, jarqueBera, kruskalWallis, wilcoxon, fisherExact, studentizedRangeCDF, studentizedRangeQuantile, tukeyHSD, } from './hypothesis-extra.js';

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAGH,cAAc,kBAAkB,CAAC;AAKjC,cAAc,gBAAgB,CAAC;AAG/B,cAAc,sBAAsB,CAAC;AACrC,OAAO,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAC;AAOzC,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAC;AAG7C,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AAGlG,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAGjC,OAAO,EAAE,YAAY,EAAE,oBAAoB,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AACnF,YAAY,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAGhD,OAAO,EACL,KAAK,EACL,KAAK,EACL,MAAM,EACN,QAAQ,EACR,QAAQ,EACR,GAAG,EACH,GAAG,EACH,MAAM,EACN,GAAG,EACH,QAAQ,EACR,QAAQ,EACR,QAAQ,GACT,MAAM,wBAAwB,CAAC;AAGhC,OAAO,EACL,KAAK,EACL,OAAO,EACP,SAAS,EACT,OAAO,EACP,OAAO,EACP,MAAM,EACN,MAAM,EACN,QAAQ,GACT,MAAM,oBAAoB,CAAC;AAG5B,OAAO,EACL,cAAc,EACd,WAAW,EACX,gBAAgB,EAChB,aAAa,EACb,kBAAkB,EAClB,IAAI,EACJ,SAAS,EACT,QAAQ,EACR,aAAa,EACb,OAAO,EACP,YAAY,EACZ,SAAS,EACT,SAAS,EACT,cAAc,EACd,UAAU,EACV,UAAU,EACV,eAAe,EACf,WAAW,EACX,WAAW,EACX,gBAAgB,GACjB,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EACL,KAAK,EACL,UAAU,EACV,aAAa,EACb,QAAQ,EACR,WAAW,EACX,mBAAmB,EACnB,wBAAwB,EACxB,QAAQ,GACT,MAAM,uBAAuB,CAAC;AAC/B,YAAY,EACV,WAAW,EACX,gBAAgB,EAChB,aAAa,EACb,cAAc,EACd,iBAAiB,EACjB,eAAe,GAChB,MAAM,uBAAuB,CAAC;AAI/B,OAAO,EACL,IAAI,EACJ,IAAI,EACJ,MAAM,EACN,QAAQ,EACR,SAAS,EACT,SAAS,EACT,MAAM,EACN,eAAe,EACf,cAAc,EACd,EAAE,GACH,MAAM,mBAAmB,CAAC;AAG3B,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAGxD,OAAO,EAAE,aAAa,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,uBAAuB,CAAC;AAG1E,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,YAAY,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAG9D,OAAO,EAAE,UAAU,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AAC1F,YAAY,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AAGxE,OAAO,EAAE,MAAM,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AACnE,YAAY,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAG1D,OAAO,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AAGxD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAGxF,OAAO,EACL,SAAS,EACT,eAAe,EACf,KAAK,EACL,kBAAkB,EAClB,mBAAmB,EACnB,mBAAmB,EACnB,uBAAuB,EACvB,gBAAgB,EAChB,0BAA0B,GAC3B,MAAM,qBAAqB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAGH,cAAc,kBAAkB,CAAC;AAKjC,cAAc,gBAAgB,CAAC;AAG/B,cAAc,sBAAsB,CAAC;AACrC,OAAO,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAC;AAOzC,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAC;AAG7C,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AAGlG,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAGjC,OAAO,EAAE,YAAY,EAAE,oBAAoB,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AACnF,YAAY,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAGhD,OAAO,EACL,KAAK,EACL,KAAK,EACL,MAAM,EACN,QAAQ,EACR,QAAQ,EACR,GAAG,EACH,GAAG,EACH,MAAM,EACN,GAAG,EACH,QAAQ,EACR,QAAQ,EACR,QAAQ,EACR,UAAU,GACX,MAAM,wBAAwB,CAAC;AAGhC,OAAO,EACL,KAAK,EACL,OAAO,EACP,SAAS,EACT,OAAO,EACP,OAAO,EACP,MAAM,EACN,MAAM,EACN,QAAQ,GACT,MAAM,oBAAoB,CAAC;AAG5B,OAAO,EACL,cAAc,EACd,WAAW,EACX,gBAAgB,EAChB,aAAa,EACb,kBAAkB,EAClB,IAAI,EACJ,SAAS,EACT,QAAQ,EACR,aAAa,EACb,OAAO,EACP,YAAY,EACZ,SAAS,EACT,SAAS,EACT,cAAc,EACd,UAAU,EACV,UAAU,EACV,eAAe,EACf,WAAW,EACX,WAAW,EACX,gBAAgB,GACjB,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EACL,KAAK,EACL,UAAU,EACV,aAAa,EACb,QAAQ,EACR,WAAW,EACX,mBAAmB,EACnB,wBAAwB,EACxB,QAAQ,GACT,MAAM,uBAAuB,CAAC;AAC/B,YAAY,EACV,WAAW,EACX,gBAAgB,EAChB,aAAa,EACb,cAAc,EACd,iBAAiB,EACjB,eAAe,GAChB,MAAM,uBAAuB,CAAC;AAI/B,OAAO,EACL,IAAI,EACJ,IAAI,EACJ,MAAM,EACN,QAAQ,EACR,SAAS,EACT,SAAS,EACT,MAAM,EACN,eAAe,EACf,cAAc,EACd,EAAE,GACH,MAAM,mBAAmB,CAAC;AAG3B,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAGxD,OAAO,EAAE,aAAa,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,uBAAuB,CAAC;AAG1E,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,YAAY,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAG9D,OAAO,EAAE,UAAU,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AAC1F,YAAY,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AAGxE,OAAO,EAAE,MAAM,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AACnE,YAAY,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAG1D,OAAO,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AAGxD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAGxF,OAAO,EACL,SAAS,EACT,eAAe,EACf,KAAK,EACL,kBAAkB,EAClB,mBAAmB,EACnB,mBAAmB,EACnB,uBAAuB,EACvB,gBAAgB,EAChB,0BAA0B,GAC3B,MAAM,qBAAqB,CAAC"}

package/dist/index.js

@@ -48,6 +48,7 @@ __export(typed_exports, {
   autoCorrelation: () => autoCorrelation,
   bandpassFilter: () => bandpassFilter,
   bartlettPSD: () => bartlettPSD,
+  bartlettTest: () => bartlettTest,
   bernoulli: () => bernoulli,
   bernoulliPMF: () => bernoulliPMF,
   besselI: () => besselI,
@@ -67,6 +68,7 @@ __export(typed_exports, {
   bin: () => bin,
   binomialDist: () => binomialDist,
   binomialPMF: () => binomialPMF,
+  binomialTest: () => binomialTest,
   bitAnd: () => bitAnd,
   bitNot: () => bitNot,
   bitOr: () => bitOr,
@@ -205,6 +207,7 @@ __export(typed_exports, {
   hex: () => hex,
   highpassFilter: () => highpassFilter,
   hilbertTransform: () => hilbertTransform,
+  hypergeometricDist: () => hypergeometricDist,
   hypot: () => hypot,
   idct: () => idct,
   idst: () => idst,
@@ -223,6 +226,7 @@ __export(typed_exports, {
   jsDivergence: () => jsDivergence,
   kdTree: () => kdTree,
   kdTreeNearest: () => kdTreeNearest,
+  kolmogorovSmirnov2Test: () => kolmogorovSmirnov2Test,
   kolmogorovSmirnovTest: () => kolmogorovSmirnovTest,
   lagrangeInterp: () => lagrangeInterp,
   laguerreL: () => laguerreL,
@@ -234,6 +238,7 @@ __export(typed_exports, {
   leftShift: () => leftShift,
   legendreFit: () => legendreFit,
   legendreP: () => legendreP,
+  leveneTest: () => leveneTest,
   lgamma: () => lgamma,
   linearInterp: () => linearInterp,
   linprog: () => linprog,
@@ -277,6 +282,7 @@ __export(typed_exports, {
   multinomial: () => multinomial,
   multiply: () => multiply,
   nearestNeighbor: () => nearestNeighbor,
+  negativeBinomialDist: () => negativeBinomialDist,
   newtonInterp: () => newtonInterp,
   nextPrime: () => nextPrime,
   nintegrate: () => nintegrate,
@@ -354,6 +360,7 @@ __export(typed_exports, {
   principalComponentAnalysis: () => principalComponentAnalysis,
   print: () => print,
   projectVector: () => projectVector,
+  proportionZTest: () => proportionZTest,
   quadprog: () => quadprog,
   quickSelect: () => quickSelect,
   random: () => random,
@@ -410,6 +417,7 @@ __export(typed_exports, {
   stronglyConnectedComponents: () => stronglyConnectedComponents,
   studentTPDF: () => studentTPDF,
   studentTTest: () => studentTTest,
+  studentTTestPaired: () => studentTTestPaired,
   subfactorial: () => subfactorial,
   substitute: () => substitute,
   subtract: () => subtract,
@@ -12813,12 +12821,7 @@ function _normalQuantileStd(p) {
     4.374664141464968,
     2.938163982698783
   ];
-  const d = [
-    0.007784695709041462,
-    0.3224671290700398,
-    2.445134137142996,
-    3.754408661907416
-  ];
+  const d = [0.007784695709041462, 0.3224671290700398, 2.445134137142996, 3.754408661907416];
   const pLow = 0.02425;
   let x;
   if (p < pLow) {
@@ -13489,6 +13492,109 @@ function weibullDist(k, lambda = 1) {
     })
   };
 }
+function _logChoose(n, r) {
+  if (r < 0 || r > n) return -Infinity;
+  return _logFactorial2(n) - _logFactorial2(r) - _logFactorial2(n - r);
+}
+function _choose(n, r) {
+  if (r < 0 || r > n) return 0;
+  const k = Math.min(r, n - r);
+  let c = 1;
+  for (let i = 0; i < k; i++) c = c * (n - i) / (i + 1);
+  return c;
+}
+function _discreteSample(cdf, rng, cap) {
+  const u = rng();
+  for (let k = 0; k <= cap; k++) {
+    if (cdf(k) >= u) return k;
+  }
+  return cap;
+}
+function hypergeometricDist(population, successes, draws) {
+  if (![population, successes, draws].every((v) => Number.isInteger(v) && v >= 0)) {
+    throw new Error(
+      "hypergeometricDist: population, successes, draws must be non-negative integers"
+    );
+  }
+  if (successes > population || draws > population) {
+    throw new Error("hypergeometricDist: successes and draws cannot exceed population");
+  }
+  const M = population;
+  const K = successes;
+  const N = draws;
+  const kMin = Math.max(0, N - (M - K));
+  const kMax = Math.min(K, N);
+  const useExact = M <= 1e3;
+  const pmf = (k) => {
+    if (!Number.isInteger(k) || k < kMin || k > kMax) return 0;
+    return useExact ? _choose(K, k) * _choose(M - K, N - k) / _choose(M, N) : Math.exp(_logChoose(K, k) + _logChoose(M - K, N - k) - _logChoose(M, N));
+  };
+  const cdf = (k) => {
+    if (k < kMin) return 0;
+    const kk = Math.min(Math.floor(k), kMax);
+    let sum3 = 0;
+    for (let i = kMin; i <= kk; i++) sum3 += pmf(i);
+    return Math.min(1, sum3);
+  };
+  const mean6 = N * K / M;
+  const variance2 = N * (K / M) * ((M - K) / M) * ((M - N) / (M - 1));
+  return {
+    pdf: pmf,
+    cdf,
+    quantile: (p) => {
+      if (p <= 0) return kMin;
+      if (p >= 1) return kMax;
+      for (let k = kMin; k <= kMax; k++) if (cdf(k) >= p) return k;
+      return kMax;
+    },
+    mean: mean6,
+    variance: variance2,
+    sample: () => _discreteSample(cdf, Math.random, kMax),
+    sampleN: (n, opts) => _sampleNDispatch(null, [], n, opts, (count2, rng) => {
+      const out = new Float64Array(count2);
+      for (let j = 0; j < count2; j++) out[j] = _discreteSample(cdf, rng, kMax);
+      return out;
+    })
+  };
+}
+function negativeBinomialDist(r, p) {
+  if (!Number.isInteger(r) || r < 1)
+    throw new Error("negativeBinomialDist: r must be a positive integer");
+  if (p <= 0 || p > 1) throw new Error("negativeBinomialDist: p must be in (0, 1]");
+  const pmf = (k) => {
+    if (!Number.isInteger(k) || k < 0) return 0;
+    return Math.exp(_logChoose(k + r - 1, k) + r * Math.log(p) + k * Math.log(1 - p));
+  };
+  const cdf = (k) => {
+    if (k < 0) return 0;
+    return Math.min(1, _betainc(p, r, Math.floor(k) + 1));
+  };
+  const mean6 = r * (1 - p) / p;
+  const variance2 = r * (1 - p) / (p * p);
+  return {
+    pdf: pmf,
+    cdf,
+    quantile: (prob) => {
+      if (prob <= 0) return 0;
+      if (prob >= 1) return Infinity;
+      let cumul = 0;
+      for (let k = 0; k < 1e5; k++) {
+        cumul += pmf(k);
+        if (cumul >= prob) return k;
+      }
+      return Infinity;
+    },
+    mean: mean6,
+    variance: variance2,
+    sample: () => _discreteSample(cdf, Math.random, Math.ceil(mean6 + 20 * Math.sqrt(variance2) + 20)),
+    sampleN: (n, opts) => _sampleNDispatch(null, [], n, opts, (count2, rng) => {
+      const out = new Float64Array(count2);
+      const cap = Math.ceil(mean6 + 20 * Math.sqrt(variance2) + 20);
+      for (let j = 0; j < count2; j++) out[j] = _discreteSample(cdf, rng, cap);
+      return out;
+    })
+  };
+}
 
 // src/typed/hypothesis.ts
 import { computePool as computePool10 } from "@danielsimonjr/mathts-parallel";
@@ -14252,6 +14358,140 @@ function principalComponentAnalysis(data, k) {
   });
   return { components: eigenvectors, explained, scores };
 }
+function _kstwobignSf(x) {
+  if (x <= 0) return 1;
+  let sum3 = 0;
+  for (let k = 1; k <= 100; k++) {
+    const term = 2 * (k % 2 === 1 ? 1 : -1) * Math.exp(-2 * k * k * x * x);
+    sum3 += term;
+    if (Math.abs(term) < 1e-15) break;
+  }
+  return Math.max(0, Math.min(1, sum3));
+}
+function kolmogorovSmirnov2Test(sample1, sample2) {
+  const n16 = sample1.length;
+  const n26 = sample2.length;
+  if (n16 < 1 || n26 < 1) {
+    throw new Error("kolmogorovSmirnov2Test: both samples must be non-empty");
+  }
+  const a = sample1.slice().sort((x, y) => x - y);
+  const b = sample2.slice().sort((x, y) => x - y);
+  let i = 0;
+  let j = 0;
+  let d = 0;
+  while (i < n16 && j < n26) {
+    const x = Math.min(a[i], b[j]);
+    while (i < n16 && a[i] <= x) i++;
+    while (j < n26 && b[j] <= x) j++;
+    d = Math.max(d, Math.abs(i / n16 - j / n26));
+  }
+  const en = Math.sqrt(n16 * n26 / (n16 + n26));
+  return { statistic: d, pValue: _kstwobignSf(en * d) };
+}
+function _median(arr7) {
+  const s = arr7.slice().sort((a, b) => a - b);
+  const n = s.length;
+  const m = n >> 1;
+  return n % 2 === 1 ? s[m] : (s[m - 1] + s[m]) / 2;
+}
+function leveneTest(groups, center = "median") {
+  const k = groups.length;
+  if (k < 2) throw new Error("leveneTest: need at least 2 groups");
+  let N = 0;
+  for (const g of groups) {
+    if (g.length < 1) throw new Error("leveneTest: every group must be non-empty");
+    N += g.length;
+  }
+  const z = groups.map((g) => {
+    const c = center === "median" ? _median(g) : _mean(g);
+    return g.map((x) => Math.abs(x - c));
+  });
+  const allZ = [];
+  for (const zi of z) for (const v of zi) allZ.push(v);
+  const zBarAll = _mean(allZ);
+  let num2 = 0;
+  let den = 0;
+  for (const zi of z) {
+    const zBarI = _mean(zi);
+    num2 += zi.length * (zBarI - zBarAll) * (zBarI - zBarAll);
+    for (const v of zi) den += (v - zBarI) * (v - zBarI);
+  }
+  const W = (N - k) / (k - 1) * (num2 / den);
+  return { statistic: W, pValue: _fPValue(W, k - 1, N - k), degreesOfFreedom: [k - 1, N - k] };
+}
+function bartlettTest(groups) {
+  const k = groups.length;
+  if (k < 2) throw new Error("bartlettTest: need at least 2 groups");
+  let N = 0;
+  for (const g of groups) {
+    if (g.length < 2) throw new Error("bartlettTest: every group needs \u22652 observations");
+    N += g.length;
+  }
+  let pooledNum = 0;
+  let sumLnVar = 0;
+  let sumInv = 0;
+  for (const g of groups) {
+    const ni = g.length;
+    const si2 = _variance(g, 1);
+    pooledNum += (ni - 1) * si2;
+    sumLnVar += (ni - 1) * Math.log(si2);
+    sumInv += 1 / (ni - 1);
+  }
+  const sp2 = pooledNum / (N - k);
+  const numerator = (N - k) * Math.log(sp2) - sumLnVar;
+  const C = 1 + (sumInv - 1 / (N - k)) / (3 * (k - 1));
+  const T = numerator / C;
+  return { statistic: T, pValue: _chiSquaredPValue(T, k - 1), degreesOfFreedom: k - 1 };
+}
+function studentTTestPaired(sample1, sample2) {
+  const n = sample1.length;
+  if (n < 2 || sample2.length !== n) {
+    throw new Error("studentTTestPaired: samples must be the same length \u2265 2");
+  }
+  const d = sample1.map((x, i) => x - sample2[i]);
+  const dBar = _mean(d);
+  const sd = Math.sqrt(_variance(d, 1));
+  const df = n - 1;
+  const t = dBar / (sd / Math.sqrt(n));
+  return { statistic: t, pValue: _tPValue(t, df), degreesOfFreedom: df };
+}
+function proportionZTest(count2, nobs, value) {
+  let z;
+  if (Array.isArray(count2) && Array.isArray(nobs)) {
+    const [c1, c2] = count2;
+    const [n16, n26] = nobs;
+    const p1 = c1 / n16;
+    const p2 = c2 / n26;
+    const pPool = (c1 + c2) / (n16 + n26);
+    z = (p1 - p2) / Math.sqrt(pPool * (1 - pPool) * (1 / n16 + 1 / n26));
+  } else if (typeof count2 === "number" && typeof nobs === "number") {
+    const p0 = value ?? 0.5;
+    const pHat = count2 / nobs;
+    z = (pHat - p0) / Math.sqrt(p0 * (1 - p0) / nobs);
+  } else {
+    throw new Error("proportionZTest: count and nobs must both be numbers or both be [a, b] pairs");
+  }
+  const pValue = erfcScalar(Math.abs(z) / Math.SQRT2);
+  return { statistic: z, pValue };
+}
+function _binomPmf(k, n, p) {
+  if (k < 0 || k > n) return 0;
+  const logC = _lgamma3(n + 1) - _lgamma3(k + 1) - _lgamma3(n - k + 1);
+  return Math.exp(logC + k * Math.log(p) + (n - k) * Math.log(1 - p));
+}
+function binomialTest(successes, n, p = 0.5) {
+  if (!Number.isInteger(successes) || !Number.isInteger(n) || successes < 0 || successes > n) {
+    throw new Error("binomialTest: successes must be an integer in [0, n]");
+  }
+  const dObs = _binomPmf(successes, n, p);
+  const rel = 1 + 1e-7;
+  let pValue = 0;
+  for (let k = 0; k <= n; k++) {
+    const pk = _binomPmf(k, n, p);
+    if (pk <= dObs * rel) pValue += pk;
+  }
+  return { statistic: successes / n, pValue: Math.min(1, pValue) };
+}
 
 // src/typed/matrix-ops.ts
 import {
@@ -33488,7 +33728,7 @@ var createMedian = /* @__PURE__ */ factory(
   name219,
   dependencies219,
   ({ typed: typed3, add: add2, divide: divide2, compare: compare2, partitionSelect: partitionSelect2 }) => {
-    function _median(array) {
+    function _median2(array) {
       try {
         const flat = flatten2(array.valueOf());
         const num2 = flat.length;
@@ -33525,7 +33765,7 @@ var createMedian = /* @__PURE__ */ factory(
     });
     return typed3(name219, {
       // median([a, b, c, d, ...])
-      "Array | Matrix": _median,
+      "Array | Matrix": _median2,
       // median([a, b, c, d, ...], dim)
       "Array | Matrix, number | BigNumber": function(_array, _dim) {
         throw new Error("median(A, dim) is not yet supported");
@@ -33535,7 +33775,7 @@ var createMedian = /* @__PURE__ */ factory(
         if (containsCollections(args)) {
           throw new TypeError("Scalar values expected in function median");
         }
-        return _median(args);
+        return _median2(args);
       }
     });
   }
@@ -42536,6 +42776,33 @@ function corrcoef(matrix2) {
     (_, i) => Array.from({ length: n }, (_2, j) => c[i][j] / (d[i] * d[j]))
   );
 }
+function kendallTau(x, y) {
+  const n = x.length;
+  if (n !== y.length) throw new Error("kendallTau: inputs must have equal length");
+  if (n < 2) return NaN;
+  let P2 = 0;
+  let Q2 = 0;
+  for (let i = 0; i < n; i++) {
+    for (let j = i + 1; j < n; j++) {
+      const s = Math.sign(x[j] - x[i]) * Math.sign(y[j] - y[i]);
+      if (s > 0) P2++;
+      else if (s < 0) Q2++;
+    }
+  }
+  const n0 = n * (n - 1) / 2;
+  const tiePairs = (arr7) => {
+    const counts = /* @__PURE__ */ new Map();
+    for (const v of arr7) counts.set(v, (counts.get(v) ?? 0) + 1);
+    let s = 0;
+    for (const c of counts.values()) s += c * (c - 1) / 2;
+    return s;
+  };
+  const n16 = tiePairs(x);
+  const n26 = tiePairs(y);
+  const denom = Math.sqrt((n0 - n16) * (n0 - n26));
+  if (denom === 0) return NaN;
+  return (P2 - Q2) / denom;
+}
 
 // src/numeric-extra.ts
 var toArr = (x) => Array.isArray(x) ? x : Array.from(x);
@@ -43716,6 +43983,7 @@ export {
   avogadro,
   bandpassFilter,
   bartlettPSD,
+  bartlettTest,
   bellNumbers,
   bernoulli,
   bernoulliPMF,
@@ -43740,6 +44008,7 @@ export {
   bin,
   binomialDist,
   binomialPMF,
+  binomialTest,
   bitAnd,
   bitNot,
   bitOr,
@@ -44057,6 +44326,7 @@ export {
   highpassFilter,
   hilbertTransform,
   hmean,
+  hypergeometricDist,
   hypot,
   idct,
   identity,
@@ -44100,9 +44370,11 @@ export {
   jsDivergence,
   kdTree,
   kdTreeNearest,
+  kendallTau,
   kldivergence,
   klitzing,
   kmeans,
+  kolmogorovSmirnov2Test,
   kolmogorovSmirnovTest,
   kron,
   kruskalWallis,
@@ -44125,6 +44397,7 @@ export {
   legendreFit,
   legendreP,
   levenbergMarquardt,
+  leveneTest,
   lfilter,
   lfilterZi,
   lgamma,
@@ -44203,6 +44476,7 @@ export {
   multiplyScalar,
   multivariateTaylor,
   nearestNeighbor,
+  negativeBinomialDist,
   nelderMead,
   neutronMass,
   newtonInterp,
@@ -44304,6 +44578,7 @@ export {
   print,
   prod,
   projectVector,
+  proportionZTest,
   protonMass,
   qr,
   quadprog,
@@ -44416,6 +44691,7 @@ export {
   studentTPDF,
   studentTQuantile,
   studentTTest,
+  studentTTestPaired,
   studentizedRangeCDF,
   studentizedRangeQuantile,
   subfactorial,

package/dist/typed/dist-objects.d.ts

@@ -215,5 +215,22 @@ export declare function uniformDist(a?: f64, b?: f64): Distribution;
  * d.mean // sqrt(pi) / 2
  */
 export declare function weibullDist(k: f64, lambda?: f64): Distribution;
+/**
+ * Hypergeometric distribution — the number of successes in `draws` samples drawn
+ * WITHOUT replacement from a `population` containing `successes` successes.
+ * `hypergeometricDist(population, successes, draws)` matches
+ * `scipy.stats.hypergeom(M=population, n=successes, N=draws)`.
+ *
+ * @example hypergeometricDist(50, 5, 10).pmf(1) // 0.4313371972
+ */
+export declare function hypergeometricDist(population: number, successes: number, draws: number): Distribution;
+/**
+ * Negative-binomial distribution — the number of failures before the `r`-th
+ * success in i.i.d. Bernoulli(`p`) trials. `negativeBinomialDist(r, p)` matches
+ * `scipy.stats.nbinom(r, p)` (integer `r`).
+ *
+ * @example negativeBinomialDist(5, 0.4).pmf(3) // 0.0774144
+ */
+export declare function negativeBinomialDist(r: number, p: f64): Distribution;
 export {};
 //# sourceMappingURL=dist-objects.d.ts.map

package/dist/typed/dist-objects.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"dist-objects.d.ts","sourceRoot":"","sources":["../../src/typed/dist-objects.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AASH,0CAA0C;AAC1C,KAAK,GAAG,GAAG,MAAM,CAAC;AAElB;;;GAGG;AACH,eAAO,MAAM,qBAAqB,SAAU,CAAC;AAE7C;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B;;;OAGG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;IACd;;;;OAIG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,6CAA6C;IAC7C,GAAG,EAAE,CAAC,CAAC,EAAE,GAAG,KAAK,GAAG,CAAC;IACrB,uCAAuC;IACvC,GAAG,EAAE,CAAC,CAAC,EAAE,GAAG,KAAK,GAAG,CAAC;IACrB,sCAAsC;IACtC,QAAQ,EAAE,CAAC,CAAC,EAAE,GAAG,KAAK,GAAG,CAAC;IAC1B,wBAAwB;IACxB,IAAI,EAAE,GAAG,CAAC;IACV,4BAA4B;IAC5B,QAAQ,EAAE,GAAG,CAAC;IACd,oDAAoD;IACpD,MAAM,EAAE,MAAM,GAAG,CAAC;IAClB;;;;;;;;;OASG;IACH,OAAO,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,cAAc,KAAK,OAAO,CAAC,YAAY,CAAC,CAAC;CACtE;AAsPD;;;;;;;;;;;;GAYG;AACH,wBAAgB,UAAU,CAAC,EAAE,GAAE,GAAO,EAAE,KAAK,GAAE,GAAO,GAAG,YAAY,CA6BpE;AAMD;;;;;;;;;;GAUG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,GAAG,YAAY,CAiD7D;AA6DD;;;;;;;;;;GAUG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,GAAG,YAAY,CAsD5D;AAMD;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,MAAM,GAAG,YAAY,CAsDtD;AAMD;;;;;;;;;GASG;AACH,wBAAgB,eAAe,CAAC,MAAM,GAAE,GAAO,GAAG,YAAY,CAuB7D;AAMD;;;;;;;;;;GAUG;AACH,wBAAgB,KAAK,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,GAAG,YAAY,CAwDpD;AAMD;;;;;;;;;;GAUG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,GAAE,GAAO,GAAG,YAAY,CA8CjE;AAMD;;;;;;;;;;GAUG;AACH,wBAAgB,aAAa,CAAC,EAAE,GAAE,GAAO,EAAE,KAAK,GAAE,GAAO,GAAG,YAAY,CAiCvE;AAMD;;;;;;;;;GASG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,GAAG,GAAG,YAAY,CAoDrD;AAMD;;;;;;;;;GASG;AACH,wBAAgB,KAAK,CAAC,EAAE,EAAE,GAAG,GAAG,YAAY,CAmD3C;AAMD;;;;;;;;;;GAUG;AACH,wBAAgB,WAAW,CAAC,CAAC,GAAE,GAAO,EAAE,CAAC,GAAE,GAAO,GAAG,YAAY,CA2BhE;AAMD;;;;;;;;;;GAUG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,GAAE,GAAO,GAAG,YAAY,CA8BjE"}
+{"version":3,"file":"dist-objects.d.ts","sourceRoot":"","sources":["../../src/typed/dist-objects.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AASH,0CAA0C;AAC1C,KAAK,GAAG,GAAG,MAAM,CAAC;AAElB;;;GAGG;AACH,eAAO,MAAM,qBAAqB,SAAU,CAAC;AAE7C;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B;;;OAGG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;IACd;;;;OAIG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,6CAA6C;IAC7C,GAAG,EAAE,CAAC,CAAC,EAAE,GAAG,KAAK,GAAG,CAAC;IACrB,uCAAuC;IACvC,GAAG,EAAE,CAAC,CAAC,EAAE,GAAG,KAAK,GAAG,CAAC;IACrB,sCAAsC;IACtC,QAAQ,EAAE,CAAC,CAAC,EAAE,GAAG,KAAK,GAAG,CAAC;IAC1B,wBAAwB;IACxB,IAAI,EAAE,GAAG,CAAC;IACV,4BAA4B;IAC5B,QAAQ,EAAE,GAAG,CAAC;IACd,oDAAoD;IACpD,MAAM,EAAE,MAAM,GAAG,CAAC;IAClB;;;;;;;;;OASG;IACH,OAAO,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,cAAc,KAAK,OAAO,CAAC,YAAY,CAAC,CAAC;CACtE;AAuPD;;;;;;;;;;;;GAYG;AACH,wBAAgB,UAAU,CAAC,EAAE,GAAE,GAAO,EAAE,KAAK,GAAE,GAAO,GAAG,YAAY,CA6BpE;AAMD;;;;;;;;;;GAUG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,GAAG,YAAY,CAiD7D;AA6DD;;;;;;;;;;GAUG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,GAAG,YAAY,CAsD5D;AAMD;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,MAAM,GAAG,YAAY,CAsDtD;AAMD;;;;;;;;;GASG;AACH,wBAAgB,eAAe,CAAC,MAAM,GAAE,GAAO,GAAG,YAAY,CAuB7D;AAMD;;;;;;;;;;GAUG;AACH,wBAAgB,KAAK,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,GAAG,YAAY,CAwDpD;AAMD;;;;;;;;;;GAUG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,GAAE,GAAO,GAAG,YAAY,CA8CjE;AAMD;;;;;;;;;;GAUG;AACH,wBAAgB,aAAa,CAAC,EAAE,GAAE,GAAO,EAAE,KAAK,GAAE,GAAO,GAAG,YAAY,CAiCvE;AAMD;;;;;;;;;GASG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,GAAG,GAAG,YAAY,CAoDrD;AAMD;;;;;;;;;GASG;AACH,wBAAgB,KAAK,CAAC,EAAE,EAAE,GAAG,GAAG,YAAY,CAmD3C;AAMD;;;;;;;;;;GAUG;AACH,wBAAgB,WAAW,CAAC,CAAC,GAAE,GAAO,EAAE,CAAC,GAAE,GAAO,GAAG,YAAY,CA2BhE;AAMD;;;;;;;;;;GAUG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,GAAE,GAAO,GAAG,YAAY,CA8BjE;AAmCD;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CAChC,UAAU,EAAE,MAAM,EAClB,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,MAAM,GACZ,YAAY,CAmDd;AAED;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,GAAG,YAAY,CAwCpE"}

package/dist/typed/hypothesis.d.ts

@@ -270,5 +270,83 @@ export declare function shapiroWilkTest(sample: f64[], opts?: BootstrapOptions):
  * result.explained   // [1.0]
  */
 export declare function principalComponentAnalysis(data: f64[][], k?: number): PCAResult;
+/**
+ * Two-sample Kolmogorov–Smirnov test: are two samples drawn from the same
+ * continuous distribution? The statistic is the maximum gap between the two
+ * empirical CDFs, D = maxₓ |F₁(x) − F₂(x)|; the p-value is the large-sample
+ * asymptotic Q(√(n₁n₂/(n₁+n₂))·D) (the `kstwobign` survival function, matching
+ * scipy's asymptotic method for large n). Distinct from the one-sample
+ * {@link kolmogorovSmirnovTest}, which compares one sample to a CDF *function*.
+ *
+ * @param sample1 - first sample (non-empty)
+ * @param sample2 - second sample (non-empty)
+ * @returns `{ statistic: D, pValue }`
+ *
+ * @example
+ * kolmogorovSmirnov2Test([0.1, 0.4, 0.6], [0.3, 0.5, 0.9]) // { statistic, pValue }
+ */
+export declare function kolmogorovSmirnov2Test(sample1: f64[], sample2: f64[]): KSTestResult;
+/** Variance-homogeneity test result. `degreesOfFreedom` is `[d1, d2]` for the
+ *  F-based Levene test, a single number for the χ²-based Bartlett test. */
+export interface VarianceTestResult {
+    statistic: f64;
+    pValue: f64;
+    degreesOfFreedom: number | [number, number];
+}
+/**
+ * Levene's test for equality of variances across ≥2 groups (the ANOVA
+ * prerequisite). Robust to non-normality — it runs a one-way ANOVA F-test on the
+ * absolute deviations from each group's center. `center` defaults to `'median'`
+ * (the Brown–Forsythe variant, scipy's default); `'mean'` gives the original
+ * Levene test. Pinned to `scipy.stats.levene`.
+ *
+ * @example leveneTest([[8.1,8.3,7.9],[9.1,9.5,8.9]]) // { statistic, pValue, degreesOfFreedom }
+ */
+export declare function leveneTest(groups: f64[][], center?: 'median' | 'mean'): VarianceTestResult;
+/**
+ * Bartlett's test for equality of variances across ≥2 groups. More powerful than
+ * Levene when the data are normal, but sensitive to departures from normality.
+ * Statistic is χ²-distributed with k−1 df. Pinned to `scipy.stats.bartlett`.
+ *
+ * @example bartlettTest([[8.1,8.3,7.9],[9.1,9.5,8.9]]) // { statistic, pValue, degreesOfFreedom }
+ */
+export declare function bartlettTest(groups: f64[][]): VarianceTestResult;
+/**
+ * Paired (dependent-samples) t-test: tests whether the mean of the paired
+ * differences x−y is zero. Distinct from the two-sample Welch test in
+ * {@link studentTTest}, which assumes independent samples. Pinned to
+ * `scipy.stats.ttest_rel`.
+ *
+ * @example studentTTestPaired([1.2,2.3,3.1], [1.0,2.0,3.5]) // { statistic, pValue, degreesOfFreedom }
+ */
+export declare function studentTTestPaired(sample1: f64[], sample2: f64[]): TTestResult;
+/** z-test result (statistic + two-tailed p-value). */
+export interface ProportionZResult {
+    statistic: f64;
+    pValue: f64;
+}
+/**
+ * Proportion z-test (large-sample, two-tailed).
+ * - **One-sample**: `proportionZTest(successes, n, p0)` tests p̂ = successes/n
+ *   against a hypothesized proportion `p0`.
+ * - **Two-sample**: `proportionZTest([s1, s2], [n1, n2])` tests p̂₁ = p̂₂ using
+ *   the pooled-variance z (equivalent to `statsmodels.proportions_ztest`).
+ *
+ * @example proportionZTest(40, 100, 0.5)        // one-sample: z=-2, p≈0.0455
+ * @example proportionZTest([40, 30], [100, 100]) // two-sample: z≈1.482, p≈0.138
+ */
+export declare function proportionZTest(count: number | [number, number], nobs: number | [number, number], value?: number): ProportionZResult;
+/**
+ * Exact binomial test — is the observed success count consistent with success
+ * probability `p`? The two-tailed p-value is the total probability of all
+ * outcomes no more likely than the observed one (scipy's method-of-small-p).
+ * Pinned to `scipy.stats.binomtest`.
+ *
+ * @example binomialTest(8, 20, 0.5) // { pValue: 0.5034446716 }
+ */
+export declare function binomialTest(successes: number, n: number, p?: f64): {
+    statistic: f64;
+    pValue: f64;
+};
 export {};
 //# sourceMappingURL=hypothesis.d.ts.map

package/dist/typed/hypothesis.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"hypothesis.d.ts","sourceRoot":"","sources":["../../src/typed/hypothesis.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AASH,mBAAmB;AACnB,KAAK,GAAG,GAAG,MAAM,CAAC;AAElB,MAAM,WAAW,WAAW;IAC1B,SAAS,EAAE,GAAG,CAAC;IACf,MAAM,EAAE,GAAG,CAAC;IACZ,gBAAgB,EAAE,GAAG,CAAC;CACvB;AAED,MAAM,WAAW,eAAe;IAC9B,SAAS,EAAE,GAAG,CAAC;IACf,MAAM,EAAE,GAAG,CAAC;IACZ,gBAAgB,EAAE,GAAG,CAAC;CACvB;AAED,MAAM,WAAW,WAAW;IAC1B,UAAU,EAAE,GAAG,CAAC;IAChB,MAAM,EAAE,GAAG,CAAC;IACZ,SAAS,EAAE,GAAG,CAAC;IACf,QAAQ,EAAE,GAAG,CAAC;CACf;AAED,MAAM,WAAW,YAAY;IAC3B,SAAS,EAAE,GAAG,CAAC;IACf,MAAM,EAAE,GAAG,CAAC;CACb;AAED,MAAM,WAAW,iBAAiB;IAChC,UAAU,EAAE,GAAG,CAAC;IAChB,MAAM,EAAE,GAAG,CAAC;CACb;AAED,MAAM,WAAW,iBAAiB;IAChC,SAAS,EAAE,GAAG,CAAC;IACf,MAAM,EAAE,GAAG,CAAC;CACb;AAED,MAAM,WAAW,SAAS;IACxB,UAAU,EAAE,GAAG,EAAE,EAAE,CAAC;IACpB,SAAS,EAAE,GAAG,EAAE,CAAC;IACjB,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC;CACjB;AAMD;;;;;;;;GAQG;AACH,MAAM,WAAW,gBAAgB;IAC/B;;;OAGG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;;;OAGG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,iBAAiB;IAChC,2DAA2D;IAC3D,SAAS,EAAE,GAAG,CAAC;IACf,yEAAyE;IACzE,eAAe,EAAE,GAAG,CAAC;IACrB,iCAAiC;IACjC,mBAAmB,EAAE,YAAY,CAAC;IAClC,aAAa,EAAE,GAAG,CAAC;IACnB,YAAY,EAAE,GAAG,CAAC;CACnB;AAED,MAAM,WAAW,iBAAiB;IAChC,2DAA2D;IAC3D,UAAU,EAAE,GAAG,CAAC;IAChB,gEAAgE;IAChE,eAAe,EAAE,GAAG,CAAC;IACrB,iCAAiC;IACjC,mBAAmB,EAAE,YAAY,CAAC;IAClC,aAAa,EAAE,GAAG,CAAC;IACnB,YAAY,EAAE,GAAG,CAAC;CACnB;AAED,MAAM,WAAW,iBAAiB;IAChC,2DAA2D;IAC3D,SAAS,EAAE,GAAG,CAAC;IACf;;;OAGG;IACH,eAAe,EAAE,GAAG,CAAC;IACrB,iCAAiC;IACjC,mBAAmB,EAAE,YAAY,CAAC;IAClC,aAAa,EAAE,GAAG,CAAC;IACnB,YAAY,EAAE,GAAG,CAAC;CACnB;AAED,MAAM,WAAW,wBAAwB;IACvC,8DAA8D;IAC9D,SAAS,EAAE,GAAG,CAAC;IACf,4DAA4D;IAC5D,eAAe,EAAE,GAAG,CAAC;IACrB,oCAAoC;IACpC,mBAAmB,EAAE,YAAY,CAAC;IAClC,aAAa,EAAE,GAAG,CAAC;IACnB,YAAY,EAAE,GAAG,CAAC;CACnB;AA6OD;;;;;;;;;;;;;GAaG;AACH,wBAAgB,YAAY,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE,OAAO,CAAC,EAAE,GAAG,EAAE,GAAG,WAAW,CA+BzE;AAMD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,wBAAsB,aAAa,CACjC,QAAQ,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE,EACzB,QAAQ,CAAC,EAAE,GAAG,EAAE,EAChB,IAAI,CAAC,EAAE,gBAAgB,GACtB,OAAO,CAAC,eAAe,GAAG,wBAAwB,CAAC,CA6JrD;AAMD;;;;;;;;;;GAUG;AACH,wBAAgB,KAAK,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE,GAAG,WAAW,CA+ClD;AAMD;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,wBAAsB,qBAAqB,CACzC,MAAM,EAAE,GAAG,EAAE,EACb,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,KAAK,GAAG,EACvB,IAAI,CAAC,EAAE,gBAAgB,GACtB,OAAO,CAAC,YAAY,GAAG,iBAAiB,CAAC,CA8G3C;AAMD;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAsB,eAAe,CACnC,OAAO,EAAE,GAAG,EAAE,EACd,OAAO,EAAE,GAAG,EAAE,EACd,IAAI,CAAC,EAAE,gBAAgB,GACtB,OAAO,CAAC,iBAAiB,GAAG,iBAAiB,CAAC,CAuJhD;AAMD;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAsB,eAAe,CACnC,MAAM,EAAE,GAAG,EAAE,EACb,IAAI,CAAC,EAAE,gBAAgB,GACtB,OAAO,CAAC,iBAAiB,GAAG,iBAAiB,CAAC,CAyKhD;AAyDD;;;;;;;;;;;;;GAaG;AACH,wBAAgB,0BAA0B,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,GAAG,SAAS,CAgG/E"}
+{"version":3,"file":"hypothesis.d.ts","sourceRoot":"","sources":["../../src/typed/hypothesis.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AAUH,mBAAmB;AACnB,KAAK,GAAG,GAAG,MAAM,CAAC;AAElB,MAAM,WAAW,WAAW;IAC1B,SAAS,EAAE,GAAG,CAAC;IACf,MAAM,EAAE,GAAG,CAAC;IACZ,gBAAgB,EAAE,GAAG,CAAC;CACvB;AAED,MAAM,WAAW,eAAe;IAC9B,SAAS,EAAE,GAAG,CAAC;IACf,MAAM,EAAE,GAAG,CAAC;IACZ,gBAAgB,EAAE,GAAG,CAAC;CACvB;AAED,MAAM,WAAW,WAAW;IAC1B,UAAU,EAAE,GAAG,CAAC;IAChB,MAAM,EAAE,GAAG,CAAC;IACZ,SAAS,EAAE,GAAG,CAAC;IACf,QAAQ,EAAE,GAAG,CAAC;CACf;AAED,MAAM,WAAW,YAAY;IAC3B,SAAS,EAAE,GAAG,CAAC;IACf,MAAM,EAAE,GAAG,CAAC;CACb;AAED,MAAM,WAAW,iBAAiB;IAChC,UAAU,EAAE,GAAG,CAAC;IAChB,MAAM,EAAE,GAAG,CAAC;CACb;AAED,MAAM,WAAW,iBAAiB;IAChC,SAAS,EAAE,GAAG,CAAC;IACf,MAAM,EAAE,GAAG,CAAC;CACb;AAED,MAAM,WAAW,SAAS;IACxB,UAAU,EAAE,GAAG,EAAE,EAAE,CAAC;IACpB,SAAS,EAAE,GAAG,EAAE,CAAC;IACjB,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC;CACjB;AAMD;;;;;;;;GAQG;AACH,MAAM,WAAW,gBAAgB;IAC/B;;;OAGG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;;;OAGG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,iBAAiB;IAChC,2DAA2D;IAC3D,SAAS,EAAE,GAAG,CAAC;IACf,yEAAyE;IACzE,eAAe,EAAE,GAAG,CAAC;IACrB,iCAAiC;IACjC,mBAAmB,EAAE,YAAY,CAAC;IAClC,aAAa,EAAE,GAAG,CAAC;IACnB,YAAY,EAAE,GAAG,CAAC;CACnB;AAED,MAAM,WAAW,iBAAiB;IAChC,2DAA2D;IAC3D,UAAU,EAAE,GAAG,CAAC;IAChB,gEAAgE;IAChE,eAAe,EAAE,GAAG,CAAC;IACrB,iCAAiC;IACjC,mBAAmB,EAAE,YAAY,CAAC;IAClC,aAAa,EAAE,GAAG,CAAC;IACnB,YAAY,EAAE,GAAG,CAAC;CACnB;AAED,MAAM,WAAW,iBAAiB;IAChC,2DAA2D;IAC3D,SAAS,EAAE,GAAG,CAAC;IACf;;;OAGG;IACH,eAAe,EAAE,GAAG,CAAC;IACrB,iCAAiC;IACjC,mBAAmB,EAAE,YAAY,CAAC;IAClC,aAAa,EAAE,GAAG,CAAC;IACnB,YAAY,EAAE,GAAG,CAAC;CACnB;AAED,MAAM,WAAW,wBAAwB;IACvC,8DAA8D;IAC9D,SAAS,EAAE,GAAG,CAAC;IACf,4DAA4D;IAC5D,eAAe,EAAE,GAAG,CAAC;IACrB,oCAAoC;IACpC,mBAAmB,EAAE,YAAY,CAAC;IAClC,aAAa,EAAE,GAAG,CAAC;IACnB,YAAY,EAAE,GAAG,CAAC;CACnB;AA6OD;;;;;;;;;;;;;GAaG;AACH,wBAAgB,YAAY,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE,OAAO,CAAC,EAAE,GAAG,EAAE,GAAG,WAAW,CA+BzE;AAMD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,wBAAsB,aAAa,CACjC,QAAQ,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE,EACzB,QAAQ,CAAC,EAAE,GAAG,EAAE,EAChB,IAAI,CAAC,EAAE,gBAAgB,GACtB,OAAO,CAAC,eAAe,GAAG,wBAAwB,CAAC,CA6JrD;AAMD;;;;;;;;;;GAUG;AACH,wBAAgB,KAAK,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE,GAAG,WAAW,CA+ClD;AAMD;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,wBAAsB,qBAAqB,CACzC,MAAM,EAAE,GAAG,EAAE,EACb,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,KAAK,GAAG,EACvB,IAAI,CAAC,EAAE,gBAAgB,GACtB,OAAO,CAAC,YAAY,GAAG,iBAAiB,CAAC,CA8G3C;AAMD;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAsB,eAAe,CACnC,OAAO,EAAE,GAAG,EAAE,EACd,OAAO,EAAE,GAAG,EAAE,EACd,IAAI,CAAC,EAAE,gBAAgB,GACtB,OAAO,CAAC,iBAAiB,GAAG,iBAAiB,CAAC,CAuJhD;AAMD;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAsB,eAAe,CACnC,MAAM,EAAE,GAAG,EAAE,EACb,IAAI,CAAC,EAAE,gBAAgB,GACtB,OAAO,CAAC,iBAAiB,GAAG,iBAAiB,CAAC,CAyKhD;AAyDD;;;;;;;;;;;;;GAaG;AACH,wBAAgB,0BAA0B,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,GAAG,SAAS,CAgG/E;AAsBD;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,sBAAsB,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,YAAY,CAuBnF;AAcD;2EAC2E;AAC3E,MAAM,WAAW,kBAAkB;IACjC,SAAS,EAAE,GAAG,CAAC;IACf,MAAM,EAAE,GAAG,CAAC;IACZ,gBAAgB,EAAE,MAAM,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC7C;AAED;;;;;;;;GAQG;AACH,wBAAgB,UAAU,CACxB,MAAM,EAAE,GAAG,EAAE,EAAE,EACf,MAAM,GAAE,QAAQ,GAAG,MAAiB,GACnC,kBAAkB,CAyBpB;AAED;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE,GAAG,kBAAkB,CAuBhE;AAMD;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,WAAW,CAW9E;AAED,sDAAsD;AACtD,MAAM,WAAW,iBAAiB;IAChC,SAAS,EAAE,GAAG,CAAC;IACf,MAAM,EAAE,GAAG,CAAC;CACb;AAED;;;;;;;;;GASG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,MAAM,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAChC,IAAI,EAAE,MAAM,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAC/B,KAAK,CAAC,EAAE,MAAM,GACb,iBAAiB,CAoBnB;AASD;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAC1B,SAAS,EAAE,MAAM,EACjB,CAAC,EAAE,MAAM,EACT,CAAC,GAAE,GAAS,GACX;IAAE,SAAS,EAAE,GAAG,CAAC;IAAC,MAAM,EAAE,GAAG,CAAA;CAAE,CAYjC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@danielsimonjr/mathts-functions",
-  "version": "0.14.0",
+  "version": "0.15.0",
   "description": "Mathematical functions for MathTS - arithmetic, algebra, trigonometry, statistics, and more",
   "author": "Daniel Simon Jr.",
   "license": "MIT",