@revolugo/common 7.7.2-alpha.2 → 7.7.2-alpha.3

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@revolugo/common",
-  "version": "7.7.2-alpha.2",
+  "version": "7.7.2-alpha.3",
   "private": false,
   "description": "Revolugo common",
   "author": "Revolugo",

package/src/utils/index.ts

@@ -29,6 +29,7 @@ export * from './get-sanitized-room-count.ts'
 export * from './get-user-ip-address.ts'
 export * from './group-by.ts'
 export * from './images.ts'
+export * from './iqr.ts'
 export * from './is-empty.ts'
 export * from './is-equal.ts'
 export * from './is-nil.ts'

package/src/utils/iqr.ts

@@ -0,0 +1,30 @@
+/**
+ * Compute the value at quantile `p` (0–1) of a pre-sorted numeric array
+ * using linear interpolation (same method as R's type-7 / Excel PERCENTILE).
+ */
+export function quartile(sorted: number[], p: number): number {
+  const n = sorted.length
+  const pos = (n - 1) * p
+  const base = Math.floor(pos)
+  const rest = pos - base
+  const baseValue = sorted[base] ?? 0
+  const nextValue = sorted[base + 1]
+
+  return (
+    baseValue + (nextValue === undefined ? 0 : rest * (nextValue - baseValue))
+  )
+}
+
+/**
+ * Compute the Tukey IQR upper bound for an array of values.
+ * upperBound = Q3 + coefficient × (Q3 − Q1)
+ *
+ * @param values      Unsorted array of numbers (must have ≥ 4 elements).
+ * @param coefficient IQR multiplier (e.g. 1.5 = mild, 3 = extreme, 100 = ultra-permissive).
+ */
+export function iqrUpperBound(values: number[], coefficient: number): number {
+  const sorted = [...values].sort((a, b) => a - b)
+  const q1 = quartile(sorted, 0.25)
+  const q3 = quartile(sorted, 0.75)
+  return q3 + coefficient * (q3 - q1)
+}