@mark1russell7/harness 0.13.0 → 0.14.0

package/build/index.d.ts

@@ -530,14 +530,18 @@ interface GroupVerdict {
   }>;
   readonly lags?: Spread | null;
 }
-/** This function gives the value at quantile p of sorted values, by nearest rank: x_(⌈p·n⌉). */
+/**
+ * This function gives the value at quantile p of sorted values, by nearest rank: x_(⌈p·n⌉). It is
+ * `quantileSorted` of @mark1russell7/rigor-statistics with the method `"nearest-rank"`.
+ */
 export declare const quantileOf: (sorted: readonly number[], p: number) => number;
 /** This function gives the spread of a set of times, or null for none. */
 export declare const spreadOf: (times: readonly Quantity[]) => Spread | null;
 /**
  * This function gives the distribution-free interval of a median: [x_(k), x_(n+1−k)], for the
  * largest k whose two tails each hold 2.5 % or less. For eleven runs, it gives [x_(2), x_(10)],
- * at 98.8 %.
+ * at 98.8 %. It is `medianInterval` of @mark1russell7/rigor-statistics at the level 0.95. An
+ * empty list throws a RangeError.
  */
 export declare const medianInterval: (sorted: readonly number[]) => [number, number];
 /**

package/build/index.js

@@ -1,5 +1,6 @@
 import { C as targetImageOf, E as unpinnedBases, S as subjectProblems, T as unlockedManifests, _ as pgClientImage, a as SHIPPED_NAMES, b as routerImage, c as grpcClientImage, d as imageOf, f as imageProblems, g as nodeHttpImage, h as nodeClientImage, i as SHIPPED_CLIENTS, l as harnessImage, m as mongoClientImage, n as PINNED, o as amqpClientImage, p as inContext, r as REPOSITORY, s as goHttpImage, t as CLIENT_NAMES, u as hikariClientImage, v as planOf, w as targetSourceOf, x as subjectClient, y as programOf } from "./image-Lg8LL6C3.js";
 import { quantity, valueIn } from "@mark1russell7/quantity";
+import { median, medianInterval as medianInterval$1, quantileSorted } from "@mark1russell7/rigor-statistics";
 import { createHash } from "node:crypto";
 //#region src/cell.ts
 /** This function tells if a fault place is a hop of a topology. */
@@ -86,15 +87,18 @@ const STEPS = [
 ];
 const s = (value) => quantity(Math.round(value * 1e6) / 1e6, "s");
 const name = (run) => `env ${run.environment} run ${run.index}`;
-/** This function gives the value at quantile p of sorted values, by nearest rank: x_(⌈p·n⌉). */
-const quantileOf = (sorted, p) => sorted[Math.min(sorted.length, Math.max(1, Math.ceil(p * sorted.length))) - 1];
+/**
+* This function gives the value at quantile p of sorted values, by nearest rank: x_(⌈p·n⌉). It is
+* `quantileSorted` of @mark1russell7/rigor-statistics with the method `"nearest-rank"`.
+*/
+const quantileOf = (sorted, p) => quantileSorted(sorted, p, "nearest-rank");
 /** This function gives the spread of a set of times, or null for none. */
 const spreadOf = (times) => {
 	if (times.length === 0) return null;
 	const sorted = times.map((time) => valueIn(time, "s")).sort((a, b) => a - b);
 	return {
 		count: sorted.length,
-		median: s(middle(sorted)),
+		median: s(median(sorted)),
 		p99: s(quantileOf(sorted, .99)),
 		p999: s(quantileOf(sorted, .999)),
 		max: s(sorted.at(-1))
@@ -135,30 +139,15 @@ const spreadWords = (spread) => {
 	const ms = (time) => Math.round(valueIn(time, "s") * 1e6) / 1e3;
 	return `median ${ms(spread.median)} ms, p99 ${ms(spread.p99)} ms, p99.9 ${ms(spread.p999)} ms, max ${ms(spread.max)} ms of ${spread.count}`;
 };
-/** This function gives P(X ≤ j) for X ~ Binomial(n, 1/2), exactly. */
-const below = (n, j) => {
-	let term = 1;
-	let sum = 0;
-	for (let i = 0; i <= j; i += 1) {
-		sum += term;
-		term = term * (n - i) / (i + 1);
-	}
-	return sum / 2 ** n;
-};
 /**
 * This function gives the distribution-free interval of a median: [x_(k), x_(n+1−k)], for the
 * largest k whose two tails each hold 2.5 % or less. For eleven runs, it gives [x_(2), x_(10)],
-* at 98.8 %.
+* at 98.8 %. It is `medianInterval` of @mark1russell7/rigor-statistics at the level 0.95. An
+* empty list throws a RangeError.
 */
 const medianInterval = (sorted) => {
-	const n = sorted.length;
-	let k = 0;
-	while (k + 1 <= n / 2 && below(n, k) <= .025) k += 1;
-	return k === 0 ? [sorted[0], sorted[n - 1]] : [sorted[k - 1], sorted[n - k]];
-};
-const middle = (sorted) => {
-	const half = Math.floor(sorted.length / 2);
-	return sorted.length % 2 === 1 ? sorted[half] : (sorted[half - 1] + sorted[half]) / 2;
+	const interval = medianInterval$1(sorted, .95);
+	return [interval.low, interval.high];
 };
 /**
 * This function gives the verdict of a cell, from two tests:
@@ -241,7 +230,7 @@ const withRequests = (verdict, counted) => {
 	};
 };
 /** This function gives the median of some counts, or null for none. */
-const medianCount = (values) => values.length === 0 ? null : middle([...values].sort((a, b) => a - b));
+const medianCount = (values) => values.length === 0 ? null : median([...values].sort((a, b) => a - b));
 /** This function sums what the group of a group cell did in its counted runs, and tests each stage that has a band. */
 const groupVerdictOf = (prediction, counted, delta = NOISE) => {
 	const noise = valueIn(delta, "s");
@@ -274,7 +263,7 @@ const groupVerdictOf = (prediction, counted, delta = NOISE) => {
 		return {
 			stage: band.stage,
 			band: interval,
-			median: values.length === 0 ? null : s(middle(values)),
+			median: values.length === 0 ? null : s(median(values)),
 			outside,
 			decision: outside.length === 0 && values.length > 0 ? "holds" : "fails"
 		};
@@ -286,7 +275,7 @@ const groupVerdictOf = (prediction, counted, delta = NOISE) => {
 			const at = run.group?.stages[stage];
 			return at === void 0 ? [] : [valueIn(at, "s")];
 		});
-		medians[stage] = s(middle(values.sort((a, b) => a - b)));
+		medians[stage] = s(median(values.sort((a, b) => a - b)));
 	}
 	const lostCounts = counted.flatMap((run) => run.group?.writes.lost === null || run.group === void 0 ? [] : [run.group.writes.lost.length]);
 	const oldCounts = counted.flatMap((run) => run.group === void 0 ? [] : [run.group.writes.old]);
@@ -314,7 +303,7 @@ const groupVerdictOf = (prediction, counted, delta = NOISE) => {
 		errors: [...errors].map(([error, firsts]) => ({
 			name: error,
 			runs: firsts.length,
-			first: s(middle(firsts.sort((a, b) => a - b)))
+			first: s(median(firsts.sort((a, b) => a - b)))
 		})),
 		...lags.length === 0 ? {} : { lags: spreadOf(lags) }
 	};
@@ -368,7 +357,7 @@ const verdictOfBand = (prediction, runs, delta = NOISE) => {
 				kinds.set(kind, (kinds.get(kind) ?? 0) + 1);
 			}
 			const outcomes = [...kinds].map(([kind, n]) => `${n} ${kind}`).join(", ");
-			const timed = times.length === 0 ? "no time" : `median ${s(middle(times)).value} s from ${prediction.from}, range [${s(times[0]).value}, ${s(times.at(-1)).value}] s`;
+			const timed = times.length === 0 ? "no time" : `median ${s(median(times)).value} s from ${prediction.from}, range [${s(times[0]).value}, ${s(times.at(-1)).value}] s`;
 			const missed = outside.filter((each) => counted.some((run) => name(run) === each.run && run.reconnect !== void 0));
 			const late = missed.length === 0 ? "" : ` ${missed.length} runs had a wait of the reconnect outside its band.`;
 			return {
@@ -376,7 +365,7 @@ const verdictOfBand = (prediction, runs, delta = NOISE) => {
 				decision: "measured",
 				band: null,
 				outside: missed,
-				median: times.length === 0 ? null : s(middle(times)),
+				median: times.length === 0 ? null : s(median(times)),
 				why: `${counted.length} runs measured: ${outcomes}; ${timed}.${late} ${prediction.why}`
 			};
 		}
@@ -393,13 +382,13 @@ const verdictOfBand = (prediction, runs, delta = NOISE) => {
 			reordering.fast,
 			reordering.seen
 		].some((count) => (count ?? 0) > 0) ? ` Reordering: ${reorderingWords(reordering)}.` : "";
-		const why = samples.length === 0 ? `${counted.length} runs measured, with no reply: ${prediction.why}` : `${counted.length} runs, ${samples.length} replies: median ${s(middle(samples)).value} s, p99 ${s(quantileOf(samples, .99)).value} s, slowest ${s(samples.at(-1)).value} s, ${retransmissions} retransmissions, ${ended.length} connections ended.${reordered} ${prediction.why}`;
+		const why = samples.length === 0 ? `${counted.length} runs measured, with no reply: ${prediction.why}` : `${counted.length} runs, ${samples.length} replies: median ${s(median(samples)).value} s, p99 ${s(quantileOf(samples, .99)).value} s, slowest ${s(samples.at(-1)).value} s, ${retransmissions} retransmissions, ${ended.length} connections ended.${reordered} ${prediction.why}`;
 		return {
 			...empty,
 			decision: "measured",
 			band: null,
 			outside: [],
-			median: samples.length === 0 ? null : s(middle(samples)),
+			median: samples.length === 0 ? null : s(median(samples)),
 			...reordering === void 0 ? {} : { reordering },
 			why
 		};
@@ -442,7 +431,7 @@ const verdictOfBand = (prediction, runs, delta = NOISE) => {
 		why: "no run measured its time"
 	};
 	const [from, to] = medianInterval(values);
-	const median = s(middle(values));
+	const median$1 = s(median(values));
 	const interval = {
 		low: s(from),
 		high: s(to)
@@ -455,13 +444,13 @@ const verdictOfBand = (prediction, runs, delta = NOISE) => {
 	const disjoint = to < wide.low || from > wide.high;
 	const off = new Set(outside.map((each) => each.run)).size;
 	const counts = `${counted.length - off} of ${counted.length} runs inside [${band.low.value}, ${band.high.value}] s`;
-	const centre = `median ${median.value} s, its interval [${interval.low.value}, ${interval.high.value}] s`;
+	const centre = `median ${median$1.value} s, its interval [${interval.low.value}, ${interval.high.value}] s`;
 	const result = {
 		counted: counted.length,
 		voided,
 		band,
 		outside,
-		median,
+		median: median$1,
 		medianInterval: interval
 	};
 	if (outside.length > 0 || disjoint) return {