Repository Public
1import Foundation23/// Small numeric helpers private to the resampling routines.4enum ResamplingMath {5 /// Quantile of an ascending-sorted array by linear interpolation between order statistics6 /// (Hyndman–Fan type 7: the Excel PERCENTILE.INC / NumPy default method). `p` in [0, 1].7 static func quantileSorted(_ s: [Double], _ p: Double) -> Double {8 guard !s.isEmpty, !p.isNaN else { return .nan }9 let h = Swift.min(Swift.max(p, 0), 1) * Double(s.count - 1)10 let lo = Int(h.rounded(.down))11 let hi = Swift.min(lo + 1, s.count - 1)12 let frac = h - Double(lo)13 return frac == 0 ? s[lo] : s[lo] + frac * (s[hi] - s[lo])14 }1516 /// Spearman rank correlation (Pearson correlation of average ranks); NaN when a series is constant.17 static func spearman(_ x: [Double], _ y: [Double]) -> Double {18 Descriptive.pearson(Descriptive.ranks(x), Descriptive.ranks(y))19 }2021 /// Spearman rank-correlation matrix of the given columns.22 static func spearmanMatrix(_ columns: [[Double]]) -> [[Double]] {23 let ranks = columns.map { Descriptive.ranks($0) }24 let k = columns.count25 var out = Array(repeating: Array(repeating: 1.0, count: k), count: k)26 for i in 0..<k {27 for j in 0..<i {28 let r = Descriptive.pearson(ranks[i], ranks[j])29 out[i][j] = r; out[j][i] = r30 }31 }32 return out33 }3435 /// Population skewness g1 = m3 / m2^1.5 and excess kurtosis g2 = m4 / m2² − 3 (biased moment36 /// estimators: `scipy.stats.skew` / `kurtosis` defaults).37 static func shape(_ x: [Double], mean: Double) -> (skewness: Double, excessKurtosis: Double) {38 let n = Double(x.count)39 guard n > 0 else { return (.nan, .nan) }40 var m2 = 0.0, m3 = 0.0, m4 = 0.041 for v in x {42 let d = v - mean, d2 = d * d43 m2 += d2; m3 += d2 * d; m4 += d2 * d244 }45 m2 /= n; m3 /= n; m4 /= n46 guard m2 > 0 else { return (.nan, .nan) }47 return (m3 / (m2 * m2.squareRoot()), m4 / (m2 * m2) - 3)48 }4950 /// Binomial coefficient as a Double (exact while it fits in 2⁵³), ∞ when it overflows.51 static func choose(_ n: Int, _ k: Int) -> Double {52 guard k >= 0, k <= n else { return 0 }53 var r = 1.054 let kk = Swift.min(k, n - k)55 if kk == 0 { return 1 }56 for i in 1...kk {57 r = r * Double(n - kk + i) / Double(i)58 if !r.isFinite { return .infinity }59 }60 return r.rounded()61 }62}63