@mark1russell7/kind 0.12.5 → 0.13.1

package/build/{judge-DiEmspMx.d.ts → judge-CSWVew2-.d.ts}

@@ -180,8 +180,11 @@ type Stack = "service" | "grpc";
  * - `latency` delays each packet that Redis sends by `delay`, for the hold (T07). Thus each command
  *   of each replica takes that much longer, but Redis answers it. The heal sets the delay to zero.
  * - `none` injects nothing: a calibration measures the path itself.
+ * - `dns-blackhole` drops each answer of a DNS server in the network namespace of each client pod,
+ *   for the hold (S2, CoreDNS). CoreDNS still answers, but no answer gets to a client. The heal
+ *   removes the rules. A client that resolves the name of the Service (`byName`) sees it.
  */
-type TriggerKind = "pod-deletion" | "rolling-update" | "node-drain" | "scale-in" | "crash" | "liveness-restart" | "freeze-process" | "rst" | "blackhole" | "peer-gone-without-close" | "app-stall" | "rollout" | "cpu-throttle" | "authorization-policy" | "idle" | "ztunnel-restart" | "certificate-expiry" | "cannot-serve" | "zone-loss" | "latency";
+type TriggerKind = "pod-deletion" | "rolling-update" | "node-drain" | "scale-in" | "crash" | "liveness-restart" | "freeze-process" | "rst" | "blackhole" | "peer-gone-without-close" | "app-stall" | "rollout" | "cpu-throttle" | "authorization-policy" | "idle" | "ztunnel-restart" | "certificate-expiry" | "cannot-serve" | "zone-loss" | "latency" | "dns-blackhole";
 /**
  * A trigger is its kind and the settings of its fault. The parameter `A` is the form of an amount:
  * a quantity in the format `/2`, a number in the format `/1`.
@@ -366,6 +369,12 @@ interface Workload {
    * until its first answer comes from its backend. With no value, the rules pick the backend of each session.
    */
   readonly onTarget?: number | undefined;
+  /**
+   * This flag gives each client the name of the Service as its target, not the ClusterIP. Thus each
+   * new connection of a client starts with a lookup of the name in the cluster DNS (S2, CoreDNS).
+   * With no value, the target is the ClusterIP, and a client does no lookup.
+   */
+  readonly byName?: boolean | undefined;
 }
 /**
  * A band is a range of times after a reference event of the run. The format `/1` gives each end
@@ -710,11 +719,6 @@ declare const CLIENT = "client";
 declare const REDIS = "redis";
 //#endregion
 //#region src/observe.d.ts
-/**
- * This module reads a run from its lines. Each time is in milliseconds on CLOCK_MONOTONIC. All the
- * containers of the VM share that clock: the clients, the service, the agents, the injector, the
- * watcher and the prober.
- */
 /**
  * A line is one JSON line of a source of a run, with its stamp `t` in milliseconds on
  * CLOCK_MONOTONIC. It is a request of a client, a record of the service, a line of grpc-go or a probe answer. It is
@@ -1320,16 +1324,23 @@ declare const readRecord: (data: unknown) => KindCellRecord;
 //#region src/stats.d.ts
 /** This fraction, δ_rel, is how far the median of a cell can be outside its band and stay equivalent. */
 declare const RELATIVE = .05;
-/** This function gives the median of sorted values: the middle value, or the mean of the two middle values. */
+/**
+ * This function gives the median of sorted values: the middle value, or the mean of the two middle values.
+ * It is `median` of @mark1russell7/rigor-statistics, which throws a RangeError for an empty list.
+ */
 declare const middle: (sorted: readonly number[]) => number;
-/** 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"`.
+ */
 declare const quantileOf: (sorted: readonly number[], p: number) => number;
 /**
  * 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.
  */
 declare const medianInterval: (sorted: readonly number[]) => [number, number];
 //#endregion
 export { unitOf as $, scenario as $n, REDIS as $t, TriggerV1 as A, Template as An, recordsOf as At, RunCheck as B, KubeProxyMode as Bn, sliceReadyAt as Bt, KindCellResult as C, PodSettings as Cn, intakeOf as Ct, PredictionV1 as D, Replica as Dn, periodOf as Dt, LoadSample as E, Reference as En, outcomesOf as Et, KIND_NOISE as F, DATAPLANES as Fn, sessionsAt as Ft, factsOf as G, ZONE_LOST as Gn, transitionOf as Gt, checkRun as H, NodeImage as Hn, slicesOf as Ht, KindDecision as I, Dataplane as In, signalOf as It, observationEnd as J, goDuration as Jn, ztunnelReplaced as Jt, judgeKind as K, cidrOverlap as Kn, tunnelsOf as Kt, KindVerdict as L, KUBE_PROXY_MODES as Ln, signalsOf as Lt, upgrade as M, TriggerKind as Mn, restartOf as Mt, upgradeCell as N, WindowPrediction as Nn, restartsAt as Nt, RunCheckV1 as O, ResetReuse as On, podsAt as Ot, Deleted as P, Workload as Pn, rulesOf as Pt, reusesReset as Q, nodeNames as Qn, PORT as Qt, LAST_SLACK as R, KindConfig as Rn, sliceDropOf as Rt, KindCellRecordV1 as S, NonePrediction as Sn, failuresOf as St, KindVerdictV1 as T, RedisDeclaration as Tn, kernelCounts as Tt, cyclesOf as U, ZONE_KEPT as Un, socketsOf as Ut, RunFacts as V, NODE_IMAGES as Vn, sliceReadyOf as Vt, deletionsOf as W, ZONE_LABEL as Wn, stoppingOf as Wt, propagationSource as X, kindConfig as Xn, HEALTH_PORT as Xt, propagationOf as Y, isKubeProxyMode as Yn, CLIENT as Yt, referenceOf as Z, kubeProxyPatch as Zn, LOG_LABEL as Zt, ClusterManifest as _, KindRun as _n, byClients as _t, STAGES as a, overshootBand as an, PodLine as at, FORMAT_V1 as b, MeshFlavor as bn, dropOf as bt, readRecord as c, secondsOf as cn, Request as ct, calibrationOf as d, Band as dn, SliceLine as dt, SERVER as en, scenarioProblems as er, updatesOf as et, cellsTable as f, Cycle as fn, SocketLine as ft, BandV1 as g, KindCell as gn, backendsAt as gt, timeSpread as h, Flap as hn, ZtunnelPodLine as ht, quantileOf as i, drainBand as in, Period as it, judge as j, Trigger as jn, requestsOf as jt, RunFactsV1 as k, Stack as kn, podsOf as kt, Judged as l, showBand as ln, RulesLine as lt, predictionText as m, EdgeProtocol as mn, TunnelLine as mt, medianInterval as n, backlogEnd as nn, HBONE_PORT as nt, kindCellRecordSchema as o, requestBand as on, PropagationSource as ot, medianText as p, Declaration as pn, TCP_STATE as pt, observationAfter as q, cidrRange as qn, ztunnelPodsOf as qt, middle as r, bandOf as rn, Line as rt, kindCellRecordV1Schema as s, seconds as sn, RecordLine as st, RELATIVE as t, CountBand as tn, zoneOf as tr, Endpoint as tt, TimeSpread as u, BacklogTerm as un, Sessions as ut, EnvironmentManifest as v, KubeletProbe as vn, byNode as vt, KindCellV1 as w, Prediction as wn, isTunnelState as wt, KindCellRecord as x, MeshMode as xn, emptyOf as xt, FORMAT as y, Mesh as yn, deletionOf as yt, Propagated as z, KindScenario as zn, sliceEmptyOf as zt };
-//# sourceMappingURL=judge-DiEmspMx.d.ts.map
+//# sourceMappingURL=judge-CSWVew2-.d.ts.map

package/build/{judge-B6cyI41-.js → judge-DA754h1o.js}

@@ -1,4 +1,5 @@
 import { format, valueIn } from "@mark1russell7/quantity";
+import { median, medianInterval, quantileSorted } from "@mark1russell7/rigor-statistics";
 import { extentSchema, quantitySchema } from "@mark1russell7/quantity/schema";
 import { z } from "zod";
 //#region src/bands.ts
@@ -119,7 +120,36 @@ const SERVER = "lab";
 const CLIENT = "client";
 const REDIS = "redis";
 //#endregion
+//#region src/stats.ts
+/** This fraction, δ_rel, is how far the median of a cell can be outside its band and stay equivalent. */
+const RELATIVE = .05;
+/**
+* This function gives the median of sorted values: the middle value, or the mean of the two middle values.
+* It is `median` of @mark1russell7/rigor-statistics, which throws a RangeError for an empty list.
+*/
+const middle = (sorted) => median(sorted);
+/**
+* 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 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 %. It is `medianInterval` of @mark1russell7/rigor-statistics at the level 0.95. An
+* empty list throws a RangeError.
+*/
+const medianInterval$1 = (sorted) => {
+	const interval = medianInterval(sorted, .95);
+	return [interval.low, interval.high];
+};
+//#endregion
 //#region src/observe.ts
+/**
+* This module reads a run from its lines. Each time is in milliseconds on CLOCK_MONOTONIC. All the
+* containers of the VM share that clock: the clients, the service, the agents, the injector, the
+* watcher and the prober.
+*/
 /** This port is the HBONE port of ztunnel in each pod of the ambient mesh of Istio 1.31.3: the mesh leg ends there. */
 const HBONE_PORT = 15008;
 /** These are the states of a TCP socket of Linux that a tunnel line names (include/net/tcp_states.h of Linux v6.17, lines 12–28). */
@@ -181,10 +211,6 @@ const sessionsAt = (lines, at, target, connections) => {
 		byClient
 	};
 };
-const medianOf = (sorted) => {
-	const middle = Math.floor(sorted.length / 2);
-	return sorted.length % 2 === 1 ? sorted[middle] : (sorted[middle - 1] + sorted[middle]) / 2;
-};
 /**
 * This function gives the measured period of the clients from their request lines that start from
 * `from` to `to`. The timer of a client is late by a different amount at each tick. Thus the median
@@ -210,12 +236,12 @@ const periodOf = (lines, from, to) => {
 		const intervals = mine.slice(1).map((t, at) => t - mine[at]);
 		span += mine.at(-1) - mine[0];
 		all.push(...intervals);
-		byClient[client] = medianOf(intervals.sort((a, b) => a - b));
+		byClient[client] = middle(intervals.sort((a, b) => a - b));
 	}
 	if (all.length === 0) return null;
 	all.sort((a, b) => a - b);
 	return {
-		median: medianOf(all),
+		median: middle(all),
 		mean: span / all.length,
 		low: all[0],
 		high: all.at(-1),
@@ -324,38 +350,6 @@ const restartsAt = (lines, at) => {
 	return out;
 };
 //#endregion
-//#region src/stats.ts
-/** This fraction, δ_rel, is how far the median of a cell can be outside its band and stay equivalent. */
-const RELATIVE = .05;
-/** This function gives the median of sorted values: the middle value, or the mean of the two middle values. */
-const middle = (sorted) => {
-	const half = Math.floor(sorted.length / 2);
-	return sorted.length % 2 === 1 ? sorted[half] : (sorted[half - 1] + sorted[half]) / 2;
-};
-/** 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 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 %.
-*/
-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]];
-};
-//#endregion
 //#region src/verdict.ts
 /**
 * This time is δ for kind: each time of a run lands in its band ± δ. Its parts are the interval of
@@ -1201,7 +1195,7 @@ const judgeKind = (cell, runs) => {
 	};
 	if (band !== null && values.length > 0) {
 		const ends = secondsOf(band);
-		const [from, to] = medianInterval(values);
+		const [from, to] = medianInterval$1(values);
 		const wide = {
 			lo: ends.lo * .95,
 			hi: ends.hi * 1.05
@@ -1421,8 +1415,7 @@ const judge = (record) => {
 const timeSpread = (times) => {
 	if (times.length === 0) return null;
 	const sorted = times.map((each) => valueIn(each, "s")).sort((a, b) => a - b);
-	const half = Math.floor(sorted.length / 2);
-	const median = sorted.length % 2 === 1 ? sorted[half] : (sorted[half - 1] + sorted[half]) / 2;
+	const median = middle(sorted);
 	return {
 		count: sorted.length,
 		min: seconds(sorted[0]),
@@ -1557,7 +1550,8 @@ const TRIGGERS = [
 	"certificate-expiry",
 	"cannot-serve",
 	"zone-loss",
-	"latency"
+	"latency",
+	"dns-blackhole"
 ];
 const KUBE_PROXY = [
 	"iptables",
@@ -1857,7 +1851,8 @@ const recordOf = (a, main) => {
 				keepalive_time: extent,
 				keepalive_timeout: time
 			}).optional(),
-			onTarget: count.optional()
+			onTarget: count.optional(),
+			byName: z.boolean().optional()
 		}),
 		prediction,
 		calibrates: z.boolean(),
@@ -1976,6 +1971,6 @@ const readRecord = (data) => {
 	throw new Error(`a kind cell record has the format ${FORMAT} or ${FORMAT_V1}, not ${String(format)}`);
 };
 //#endregion
-export { restartsAt as $, RELATIVE as A, dropOf as B, observationEnd as C, drainBand as Ct, reusesReset as D, secondsOf as Dt, referenceOf as E, seconds as Et, TCP_STATE as F, kernelCounts as G, failuresOf as H, backendsAt as I, podsAt as J, outcomesOf as K, byClients as L, middle as M, quantileOf as N, unitOf as O, showBand as Ot, HBONE_PORT as P, restartOf as Q, byNode as R, observationAfter as S, bandOf as St, propagationSource as T, requestBand as Tt, intakeOf as U, emptyOf as V, isTunnelState as W, recordsOf as X, podsOf as Y, requestsOf as Z, checkRun as _, LOG_LABEL as _t, calibrationOf as a, sliceEmptyOf as at, factsOf as b, SERVER as bt, predictionText as c, slicesOf as ct, FORMAT_V1 as d, transitionOf as dt, rulesOf as et, judge as f, tunnelsOf as ft, LAST_SLACK as g, HEALTH_PORT as gt, KIND_NOISE as h, CLIENT as ht, readRecord as i, sliceDropOf as it, medianInterval as j, updatesOf as k, timeSpread as l, socketsOf as lt, upgradeCell as m, ztunnelReplaced as mt, kindCellRecordSchema as n, signalOf as nt, cellsTable as o, sliceReadyAt as ot, upgrade as p, ztunnelPodsOf as pt, periodOf as q, kindCellRecordV1Schema as r, signalsOf as rt, medianText as s, sliceReadyOf as st, STAGES as t, sessionsAt as tt, FORMAT as u, stoppingOf as ut, cyclesOf as v, PORT as vt, propagationOf as w, overshootBand as wt, judgeKind as x, backlogEnd as xt, deletionsOf as y, REDIS as yt, deletionOf as z };
+export { signalsOf as $, HBONE_PORT as A, isTunnelState as B, observationEnd as C, drainBand as Ct, reusesReset as D, secondsOf as Dt, referenceOf as E, seconds as Et, deletionOf as F, podsOf as G, outcomesOf as H, dropOf as I, restartOf as J, recordsOf as K, emptyOf as L, backendsAt as M, byClients as N, unitOf as O, showBand as Ot, byNode as P, signalOf as Q, failuresOf as R, observationAfter as S, bandOf as St, propagationSource as T, requestBand as Tt, periodOf as U, kernelCounts as V, podsAt as W, rulesOf as X, restartsAt as Y, sessionsAt as Z, checkRun as _, LOG_LABEL as _t, calibrationOf as a, socketsOf as at, factsOf as b, SERVER as bt, predictionText as c, tunnelsOf as ct, FORMAT_V1 as d, RELATIVE as dt, sliceDropOf as et, judge as f, medianInterval$1 as ft, LAST_SLACK as g, HEALTH_PORT as gt, KIND_NOISE as h, CLIENT as ht, readRecord as i, slicesOf as it, TCP_STATE as j, updatesOf as k, timeSpread as l, ztunnelPodsOf as lt, upgradeCell as m, quantileOf as mt, kindCellRecordSchema as n, sliceReadyAt as nt, cellsTable as o, stoppingOf as ot, upgrade as p, middle as pt, requestsOf as q, kindCellRecordV1Schema as r, sliceReadyOf as rt, medianText as s, transitionOf as st, STAGES as t, sliceEmptyOf as tt, FORMAT as u, ztunnelReplaced as ut, cyclesOf as v, PORT as vt, propagationOf as w, overshootBand as wt, judgeKind as x, backlogEnd as xt, deletionsOf as y, REDIS as yt, intakeOf as z };
 
-//# sourceMappingURL=judge-B6cyI41-.js.map
+//# sourceMappingURL=judge-DA754h1o.js.map