@mark1russell7/service 0.6.1 → 0.6.2
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +26 -3
- package/build/{builder-BNAkpeTT.d.ts → builder-0OlfomVU.d.ts} +2 -2
- package/build/{core-CWsGgr9J.d.ts → core-Iy9rIXOT.d.ts} +3 -3
- package/build/{dial-JEJavY0U.d.ts → dial-DLT7bTlA.d.ts} +2 -2
- package/build/grpc.d.ts +3 -3
- package/build/grpc.js +1 -1
- package/build/http-client.d.ts +3 -3
- package/build/http-client.js +1 -1
- package/build/http.d.ts +17 -3
- package/build/http.js +53 -10
- package/build/http.js.map +1 -1
- package/build/index.d.ts +43 -6
- package/build/index.js +92 -6
- package/build/index.js.map +1 -1
- package/build/{lifecycle-CCDLvXLF.d.ts → lifecycle-DXK880vG.d.ts} +44 -3
- package/build/{limiter-B0849Vhp.d.ts → limiter-BoZkXIxk.d.ts} +2 -2
- package/build/{limiter-pkBZUp-t.js → limiter-CmC4vCjk.js} +21 -13
- package/build/limiter-CmC4vCjk.js.map +1 -0
- package/build/limiter.d.ts +3 -3
- package/build/limiter.js +1 -1
- package/build/{machine-DZMb_QEU.js → machine-Dq2OlzCG.js} +7 -20
- package/build/machine-Dq2OlzCG.js.map +1 -0
- package/build/mongodb.d.ts +3 -3
- package/build/mongodb.js +1 -1
- package/build/pg.d.ts +2 -2
- package/build/pg.js +1 -1
- package/build/{queue-eLs5IruM.d.ts → queue-CvBNNZZJ.d.ts} +2 -2
- package/build/rabbitmq.d.ts +4 -4
- package/build/rabbitmq.js +1 -1
- package/build/redis.d.ts +3 -3
- package/build/redis.js +1 -1
- package/build/retrier-CRda6z9G.js +73 -0
- package/build/retrier-CRda6z9G.js.map +1 -0
- package/build/{store-D5HLgBnW.d.ts → store-Cwuepb-z.d.ts} +14 -3
- package/build/testing.d.ts +4 -2
- package/build/testing.js +12 -1
- package/build/testing.js.map +1 -1
- package/build/websocket.d.ts +3 -3
- package/build/websocket.js +1 -1
- package/package.json +2 -2
- package/build/limiter-pkBZUp-t.js.map +0 -1
- package/build/machine-DZMb_QEU.js.map +0 -1
- package/build/operation-DL5RxFds.js +0 -25
- package/build/operation-DL5RxFds.js.map +0 -1
|
@@ -0,0 +1,73 @@
|
|
|
1
|
+
import { realClock } from "./clock.js";
|
|
2
|
+
import { backoffDelay, backoffProblems } from "./backoff.js";
|
|
3
|
+
import { compare, convertible } from "@mark1russell7/quantity";
|
|
4
|
+
//#region src/operation.ts
|
|
5
|
+
/**
|
|
6
|
+
* This function tells if an operation can go again `since` its first issue. An idempotent
|
|
7
|
+
* operation can always go again, and other operations cannot. A keyed operation can go again
|
|
8
|
+
* while the server keeps its key.
|
|
9
|
+
*/
|
|
10
|
+
const mayReissue = (operation, since) => {
|
|
11
|
+
const { idempotent } = operation;
|
|
12
|
+
if (typeof idempotent === "boolean") return idempotent;
|
|
13
|
+
return compare(since, idempotent.window) < 0;
|
|
14
|
+
};
|
|
15
|
+
/** This function gives the problems in the declaration of an operation that `describe()` refuses. */
|
|
16
|
+
const operationProblems = (owner, name, operation) => {
|
|
17
|
+
const { idempotent } = operation;
|
|
18
|
+
if (typeof idempotent === "boolean") return [];
|
|
19
|
+
const problems = [];
|
|
20
|
+
if (idempotent.key.trim().length === 0) problems.push(`${owner}'s ${name} names no key`);
|
|
21
|
+
if (!convertible(idempotent.window.unit, "s")) problems.push(`${owner}'s ${name} holds its key for a span that is not a time`);
|
|
22
|
+
return problems;
|
|
23
|
+
};
|
|
24
|
+
//#endregion
|
|
25
|
+
//#region src/retrier.ts
|
|
26
|
+
/** This function makes a retrier with no check of its policy. A client of the package uses it with its own knobs. */
|
|
27
|
+
const retrierOn = (clock, backoff, random, signal) => {
|
|
28
|
+
let tries = 0;
|
|
29
|
+
let timer = null;
|
|
30
|
+
const cancel = () => {
|
|
31
|
+
timer?.();
|
|
32
|
+
timer = null;
|
|
33
|
+
};
|
|
34
|
+
signal?.addEventListener("abort", cancel, { once: true });
|
|
35
|
+
return {
|
|
36
|
+
get attempts() {
|
|
37
|
+
return tries;
|
|
38
|
+
},
|
|
39
|
+
get pending() {
|
|
40
|
+
return timer !== null;
|
|
41
|
+
},
|
|
42
|
+
schedule(run) {
|
|
43
|
+
if (signal?.aborted === true) return null;
|
|
44
|
+
tries += 1;
|
|
45
|
+
const delay = Math.round(backoffDelay(backoff, tries, random));
|
|
46
|
+
timer?.();
|
|
47
|
+
timer = clock.after(delay, () => {
|
|
48
|
+
timer = null;
|
|
49
|
+
run();
|
|
50
|
+
});
|
|
51
|
+
return delay;
|
|
52
|
+
},
|
|
53
|
+
cancel,
|
|
54
|
+
reset() {
|
|
55
|
+
tries = 0;
|
|
56
|
+
}
|
|
57
|
+
};
|
|
58
|
+
};
|
|
59
|
+
/**
|
|
60
|
+
* This function makes a retrier over `backoffDelay`. The first try waits `base`, and each try after
|
|
61
|
+
* it waits `factor` times more, to the `cap`, with the jitter of the policy. It refuses a policy
|
|
62
|
+
* with a problem of `backoffProblems`.
|
|
63
|
+
*/
|
|
64
|
+
const retrier = (options) => {
|
|
65
|
+
const { clock = realClock, random = Math.random, signal, ...backoff } = options;
|
|
66
|
+
const problems = backoffProblems(backoff);
|
|
67
|
+
if (problems.length > 0) throw new Error(`the retrier has a bad backoff: ${problems.join("; ")}`);
|
|
68
|
+
return retrierOn(clock, backoff, random, signal);
|
|
69
|
+
};
|
|
70
|
+
//#endregion
|
|
71
|
+
export { operationProblems as i, retrierOn as n, mayReissue as r, retrier as t };
|
|
72
|
+
|
|
73
|
+
//# sourceMappingURL=retrier-CRda6z9G.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"retrier-CRda6z9G.js","names":[],"sources":["../src/operation.ts","../src/retrier.ts"],"sourcesContent":["import type { Extent, Quantity } from \"@mark1russell7/quantity\";\nimport { compare, convertible } from \"@mark1russell7/quantity\";\n\n/**\n * This type tells if an operation can go again after a failure. It is a property of the\n * operation, not of the dependency. One Redis client sends a GET, which is safe to send again. It\n * also sends an INCR, which counts two times when it goes again after a timeout. Each operation\n * declares its idempotency:\n * - `true`: a second issue has the same effect. Examples are an HTTP GET or PUT, a SELECT, a\n * Redis GET or SET, and a write that the server removes when it is a copy.\n * - `false`: the client does not send it again after it can have reached the server.\n * - keyed: the server keeps a key for a window, as with an `Idempotency-Key` header, and it\n * ignores a copy in that window. A copy after the window is a second operation. Thus the\n * window is a timer, and it must be longer than all retries of the operation.\n */\nexport type Idempotency = boolean | { readonly key: string; readonly window: Extent };\n\n/** An operation is an endpoint that the service calls or serves, a command, or a query. */\nexport interface Operation {\n readonly idempotent: Idempotency;\n}\n\n/**\n * This function tells if an operation can go again `since` its first issue. An idempotent\n * operation can always go again, and other operations cannot. A keyed operation can go again\n * while the server keeps its key.\n */\nexport const mayReissue = (operation: Operation, since: Quantity): boolean => {\n const { idempotent } = operation;\n if (typeof idempotent === \"boolean\") return idempotent;\n return compare(since, idempotent.window) < 0;\n};\n\n/** This function gives the problems in the declaration of an operation that `describe()` refuses. */\nexport const operationProblems = (owner: string, name: string, operation: Operation): string[] => {\n const { idempotent } = operation;\n if (typeof idempotent === \"boolean\") return [];\n const problems: string[] = [];\n if (idempotent.key.trim().length === 0) problems.push(`${owner}'s ${name} names no key`);\n if (!convertible(idempotent.window.unit, \"s\"))\n problems.push(`${owner}'s ${name} holds its key for a span that is not a time`);\n return problems;\n};\n","import type { Backoff } from \"./backoff.ts\";\nimport { backoffDelay, backoffProblems } from \"./backoff.ts\";\nimport type { Cancel, Clock } from \"./clock.ts\";\nimport { realClock } from \"./clock.ts\";\n\n/** These options make a retrier: a backoff policy, the clock of its timers, and the signal that cancels it. */\nexport interface RetrierOptions extends Backoff {\n /** This clock starts each retry. The default is the real clock. A test gives a fake clock. */\n readonly clock?: Clock | undefined;\n /** This function gives a number in [0, 1) for the jitter of each delay. The default is `Math.random`. */\n readonly random?: (() => number) | undefined;\n /**\n * This signal cancels the retrier when it aborts, for example the `signal` of the lifecycle, which\n * aborts in the drain. After the abort, `schedule` starts nothing.\n */\n readonly signal?: AbortSignal | undefined;\n}\n\n/** A retrier starts a function again after the backoff of each try, on its clock. */\nexport interface Retrier {\n /** This count is the number of tries since the last reset. */\n readonly attempts: number;\n /** This flag tells if a retry waits for its timer. */\n readonly pending: boolean;\n /**\n * This method counts one more try, and starts `run` after the backoff delay of that try. It gives\n * the delay in milliseconds. A retry that waits stops, thus one retry at most waits. After the\n * abort of the signal, it starts nothing and gives null. The function catches its own errors.\n */\n schedule(run: () => void): number | null;\n /** This method sets the count of tries to 0, for example after a start that succeeded. A retry that waits stays. */\n reset(): void;\n /** This method stops the retry that waits. The count of tries stays. */\n cancel(): void;\n}\n\n/** This function makes a retrier with no check of its policy. A client of the package uses it with its own knobs. */\nexport const retrierOn = (clock: Clock, backoff: Backoff, random: () => number, signal?: AbortSignal): Retrier => {\n let tries = 0;\n let timer: Cancel | null = null;\n const cancel = (): void => {\n timer?.();\n timer = null;\n };\n signal?.addEventListener(\"abort\", cancel, { once: true });\n return {\n get attempts() {\n return tries;\n },\n get pending() {\n return timer !== null;\n },\n schedule(run) {\n if (signal?.aborted === true) return null;\n tries += 1;\n const delay = Math.round(backoffDelay(backoff, tries, random));\n timer?.();\n timer = clock.after(delay, () => {\n timer = null;\n run();\n });\n return delay;\n },\n cancel,\n reset() {\n tries = 0;\n },\n };\n};\n\n/**\n * This function makes a retrier over `backoffDelay`. The first try waits `base`, and each try after\n * it waits `factor` times more, to the `cap`, with the jitter of the policy. It refuses a policy\n * with a problem of `backoffProblems`.\n */\nexport const retrier = (options: RetrierOptions): Retrier => {\n const { clock = realClock, random = Math.random, signal, ...backoff } = options;\n const problems = backoffProblems(backoff);\n if (problems.length > 0) throw new Error(`the retrier has a bad backoff: ${problems.join(\"; \")}`);\n return retrierOn(clock, backoff, random, signal);\n};\n"],"mappings":";;;;;;;;;AA2BA,MAAa,cAAc,WAAsB,UAA6B;CAC5E,MAAM,EAAE,eAAe;CACvB,IAAI,OAAO,eAAe,WAAW,OAAO;CAC5C,OAAO,QAAQ,OAAO,WAAW,MAAM,IAAI;AAC7C;;AAGA,MAAa,qBAAqB,OAAe,MAAc,cAAmC;CAChG,MAAM,EAAE,eAAe;CACvB,IAAI,OAAO,eAAe,WAAW,OAAO,CAAC;CAC7C,MAAM,WAAqB,CAAC;CAC5B,IAAI,WAAW,IAAI,KAAK,CAAC,CAAC,WAAW,GAAG,SAAS,KAAK,GAAG,MAAM,KAAK,KAAK,cAAc;CACvF,IAAI,CAAC,YAAY,WAAW,OAAO,MAAM,GAAG,GAC1C,SAAS,KAAK,GAAG,MAAM,KAAK,KAAK,6CAA6C;CAChF,OAAO;AACT;;;;ACLA,MAAa,aAAa,OAAc,SAAkB,QAAsB,WAAkC;CAChH,IAAI,QAAQ;CACZ,IAAI,QAAuB;CAC3B,MAAM,eAAqB;EACzB,QAAQ;EACR,QAAQ;CACV;CACA,QAAQ,iBAAiB,SAAS,QAAQ,EAAE,MAAM,KAAK,CAAC;CACxD,OAAO;EACL,IAAI,WAAW;GACb,OAAO;EACT;EACA,IAAI,UAAU;GACZ,OAAO,UAAU;EACnB;EACA,SAAS,KAAK;GACZ,IAAI,QAAQ,YAAY,MAAM,OAAO;GACrC,SAAS;GACT,MAAM,QAAQ,KAAK,MAAM,aAAa,SAAS,OAAO,MAAM,CAAC;GAC7D,QAAQ;GACR,QAAQ,MAAM,MAAM,aAAa;IAC/B,QAAQ;IACR,IAAI;GACN,CAAC;GACD,OAAO;EACT;EACA;EACA,QAAQ;GACN,QAAQ;EACV;CACF;AACF;;;;;;AAOA,MAAa,WAAW,YAAqC;CAC3D,MAAM,EAAE,QAAQ,WAAW,SAAS,KAAK,QAAQ,QAAQ,GAAG,YAAY;CACxE,MAAM,WAAW,gBAAgB,OAAO;CACxC,IAAI,SAAS,SAAS,GAAG,MAAM,IAAI,MAAM,kCAAkC,SAAS,KAAK,IAAI,GAAG;CAChG,OAAO,UAAU,OAAO,SAAS,QAAQ,MAAM;AACjD"}
|
|
@@ -56,6 +56,15 @@ interface KeyedLimiter {
|
|
|
56
56
|
* fails, it gives the decision of `onStoreFailure`, with the failure as text.
|
|
57
57
|
*/
|
|
58
58
|
take(key: string): Promise<Decision>;
|
|
59
|
+
/**
|
|
60
|
+
* This method takes one unit for a key, and gives the decision at once, with no promise. Only a
|
|
61
|
+
* local store whose take gives its decision at once permits it, for example `memoryStore`. A shared store throws.
|
|
62
|
+
*/
|
|
63
|
+
tryTakeSync?(key: string): Decision;
|
|
64
|
+
}
|
|
65
|
+
/** A local limiter is a keyed limiter on a memory store: its take can give the decision at once. */
|
|
66
|
+
interface LocalLimiter extends KeyedLimiter {
|
|
67
|
+
tryTakeSync(key: string): Decision;
|
|
59
68
|
}
|
|
60
69
|
/**
|
|
61
70
|
* This function makes the runtime of a limiter from its spec and its store. It refuses a spec with a
|
|
@@ -65,8 +74,10 @@ interface KeyedLimiter {
|
|
|
65
74
|
* permitted with `remaining` 0. With `closed`, it is refused with the cause `store`.
|
|
66
75
|
* - The `retryAfter` of the cause `store` is the longest `retryAfter` of the policy.
|
|
67
76
|
* - A failure of a local store rejects the take, because a local store has no `onStoreFailure`.
|
|
77
|
+
* - `tryTakeSync` gives the decision at once. A shared store throws, and so does a local store that gives a promise.
|
|
68
78
|
*/
|
|
69
|
-
declare
|
|
79
|
+
declare function keyedLimiter(name: string, spec: LimiterSpec, store: MemoryStore): LocalLimiter;
|
|
80
|
+
declare function keyedLimiter(name: string, spec: LimiterSpec, store: LimiterStore): KeyedLimiter;
|
|
70
81
|
//#endregion
|
|
71
|
-
export {
|
|
72
|
-
//# sourceMappingURL=store-
|
|
82
|
+
export { TakeRequest as a, MemoryStore as i, LimiterStore as n, keyedLimiter as o, LocalLimiter as r, memoryStore as s, KeyedLimiter as t };
|
|
83
|
+
//# sourceMappingURL=store-Cwuepb-z.d.ts.map
|
package/build/testing.d.ts
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
import { n as Clock } from "./clock-mVqhXD0b.js";
|
|
2
|
-
import {
|
|
3
|
-
import { n as ServiceBuilder } from "./builder-
|
|
2
|
+
import { D as CheckFn, Dt as ExitSignal, H as Logger, It as UncaughtOrigin, K as Outcome, Nt as ProcessPort, Ot as ExitTrigger, R as LogEntry, V as LogLevel, d as TransportImpl, r as Lifecycle } from "./lifecycle-DXK880vG.js";
|
|
3
|
+
import { n as ServiceBuilder } from "./builder-0OlfomVU.js";
|
|
4
4
|
//#region src/fakes.d.ts
|
|
5
5
|
/** A fake clock moves only when a test tells it to. */
|
|
6
6
|
interface FakeClock extends Clock {
|
|
@@ -24,6 +24,8 @@ interface FakeProcess extends ProcessPort {
|
|
|
24
24
|
trigger(name: ExitTrigger): void;
|
|
25
25
|
/** This method sends a message of the IPC channel to each handler of the trigger `ipc-message`. */
|
|
26
26
|
message(value: unknown): void;
|
|
27
|
+
/** This method sends an error that no code caught to each handler of `onUncaught`. The default origin is `uncaughtException`. */
|
|
28
|
+
uncaught(error: unknown, origin?: UncaughtOrigin): void;
|
|
27
29
|
/** These are the exit codes, in sequence. A correct runtime exits one time. */
|
|
28
30
|
readonly exits: readonly number[];
|
|
29
31
|
/** This count is the number of handlers that are registered. */
|
package/build/testing.js
CHANGED
|
@@ -57,6 +57,7 @@ const fakeClock = (start = 0) => {
|
|
|
57
57
|
/** This function makes a fake process. */
|
|
58
58
|
const fakeProcess = (options = {}) => {
|
|
59
59
|
const handlers = /* @__PURE__ */ new Map();
|
|
60
|
+
const uncaughtHandlers = /* @__PURE__ */ new Set();
|
|
60
61
|
const exits = [];
|
|
61
62
|
const log = [];
|
|
62
63
|
let flushes = 0;
|
|
@@ -77,6 +78,13 @@ const fakeProcess = (options = {}) => {
|
|
|
77
78
|
set.delete(handler);
|
|
78
79
|
};
|
|
79
80
|
},
|
|
81
|
+
onUncaught(handler) {
|
|
82
|
+
const own = (error, origin) => handler(error, origin);
|
|
83
|
+
uncaughtHandlers.add(own);
|
|
84
|
+
return () => {
|
|
85
|
+
uncaughtHandlers.delete(own);
|
|
86
|
+
};
|
|
87
|
+
},
|
|
80
88
|
async flush() {
|
|
81
89
|
stamp("flush");
|
|
82
90
|
await options.flush?.();
|
|
@@ -100,11 +108,14 @@ const fakeProcess = (options = {}) => {
|
|
|
100
108
|
signal: (name) => send(name),
|
|
101
109
|
trigger: (name) => send(name),
|
|
102
110
|
message: (value) => send("ipc-message", value),
|
|
111
|
+
uncaught: (error, origin = "uncaughtException") => {
|
|
112
|
+
for (const handler of [...uncaughtHandlers]) handler(error, origin);
|
|
113
|
+
},
|
|
103
114
|
get exits() {
|
|
104
115
|
return [...exits];
|
|
105
116
|
},
|
|
106
117
|
get handlers() {
|
|
107
|
-
let count =
|
|
118
|
+
let count = uncaughtHandlers.size;
|
|
108
119
|
for (const set of handlers.values()) count += set.size;
|
|
109
120
|
return count;
|
|
110
121
|
},
|
package/build/testing.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"testing.js","names":[],"sources":["../src/fakes.ts","../src/contract.ts","../src/conformance.ts","../src/testing.ts"],"sourcesContent":["// The fakes of the runtime for tests: a fake clock gives exact, repeatable timing, a seeded random\n// gives the same jitter on each run, and a fake process takes signals and keeps the exit codes.\n\nimport type { Cancel, Clock } from \"./clock.ts\";\nimport type { ExitSignal, ExitTrigger, ProcessPort } from \"./process.ts\";\n\n/** A fake clock moves only when a test tells it to. */\nexport interface FakeClock extends Clock {\n /** This method moves the clock forward by `ms`, and it starts each timer that comes due, in sequence. */\n advance(ms: number): Promise<void>;\n /**\n * This method moves the clock forward by `ms` and starts no timer, as a blocked event loop does.\n * The next `advance` then starts each timer that came due during the block, late.\n */\n block(ms: number): void;\n /** This count is the number of timers that are not stopped and not called. */\n readonly pending: number;\n}\n\n/** This function lets the promises that are ready continue, before the clock moves again. */\nconst settle = async (): Promise<void> => {\n for (let turn = 0; turn < 64; turn += 1) await Promise.resolve();\n};\n\n/** This function makes a fake clock. Its time starts at `start` milliseconds. */\nexport const fakeClock = (start = 0): FakeClock => {\n let now = start;\n let sequence = 0;\n const timers: Array<{ at: number; order: number; run: () => void; live: boolean }> = [];\n const due = (end: number) => {\n let best: (typeof timers)[number] | undefined;\n for (const timer of timers)\n if (timer.live && timer.at <= end && (best === undefined || timer.at < best.at || (timer.at === best.at && timer.order < best.order)))\n best = timer;\n return best;\n };\n return {\n now: () => now,\n after(ms, run): Cancel {\n const timer = { at: now + Math.max(0, ms), order: sequence++, run, live: true };\n timers.push(timer);\n return () => {\n timer.live = false;\n };\n },\n async advance(ms) {\n // a monotonic clock does not go back\n const end = now + Math.max(0, ms);\n await settle();\n for (;;) {\n const timer = due(end);\n if (timer === undefined) break;\n timer.live = false;\n // a timer that came due during a block runs late, at the time of the clock\n now = Math.max(now, timer.at);\n timer.run();\n await settle();\n }\n now = Math.max(now, end);\n for (let at = timers.length - 1; at >= 0; at -= 1) if (!timers[at]!.live) timers.splice(at, 1);\n await settle();\n },\n block(ms) {\n now += Math.max(0, ms);\n },\n get pending() {\n return timers.filter((timer) => timer.live).length;\n },\n };\n};\n\n/** A fake process receives triggers from a test, and keeps each exit code in place of an exit. */\nexport interface FakeProcess extends ProcessPort {\n /** This method sends a signal to each handler of it. */\n signal(name: ExitSignal): void;\n /** This method sends a trigger to each handler of it: a signal, or a process trigger, for example `stdin-close`. */\n trigger(name: ExitTrigger): void;\n /** This method sends a message of the IPC channel to each handler of the trigger `ipc-message`. */\n message(value: unknown): void;\n /** These are the exit codes, in sequence. A correct runtime exits one time. */\n readonly exits: readonly number[];\n /** This count is the number of handlers that are registered. */\n readonly handlers: number;\n /** These are the triggers that have a handler, in the sequence of their first handler. */\n readonly triggers: readonly ExitTrigger[];\n /** These are the times of the clock of the options at each flush and each exit, when the options give a clock. */\n readonly log: readonly string[];\n /** This count is the number of flushes of the output. */\n readonly flushes: number;\n /** This count is the number of holds of the process that are not released. */\n readonly holds: number;\n /** These counts are the holds that were not released at each exit, in sequence. */\n readonly heldAtExit: readonly number[];\n}\n\n/** These options shape a fake process. */\nexport interface FakeProcessOptions {\n /** This function is the flush of the output, for example a wait on a fake clock. Without it, a flush ends at once. */\n readonly flush?: (() => Promise<void> | void) | undefined;\n /** This clock stamps each line of the log. */\n readonly clock?: Clock | undefined;\n}\n\n/** This function makes a fake process. */\nexport const fakeProcess = (options: FakeProcessOptions = {}): FakeProcess => {\n const handlers = new Map<ExitTrigger, Set<(message?: unknown) => void>>();\n const exits: number[] = [];\n const log: string[] = [];\n let flushes = 0;\n let holds = 0;\n const heldAtExit: number[] = [];\n const stamp = (what: string): void => {\n log.push(options.clock === undefined ? what : `${options.clock.now()} ${what}`);\n };\n const send = (name: ExitTrigger, message?: unknown): void => {\n for (const handler of [...(handlers.get(name) ?? [])]) handler(message);\n };\n return {\n on(trigger, handler) {\n const set = handlers.get(trigger) ?? new Set();\n set.add(handler);\n handlers.set(trigger, set);\n return () => {\n set.delete(handler);\n };\n },\n async flush() {\n stamp(\"flush\");\n await options.flush?.();\n flushes += 1;\n stamp(\"flushed\");\n },\n hold() {\n holds += 1;\n let held = true;\n return () => {\n if (!held) return;\n held = false;\n holds -= 1;\n };\n },\n exit(code) {\n stamp(`exit ${code}`);\n heldAtExit.push(holds);\n exits.push(code);\n },\n signal: (name) => send(name),\n trigger: (name) => send(name),\n message: (value) => send(\"ipc-message\", value),\n get exits() {\n return [...exits];\n },\n get handlers() {\n let count = 0;\n for (const set of handlers.values()) count += set.size;\n return count;\n },\n get triggers() {\n return [...handlers.keys()];\n },\n get log() {\n return [...log];\n },\n get flushes() {\n return flushes;\n },\n get holds() {\n return holds;\n },\n get heldAtExit() {\n return [...heldAtExit];\n },\n };\n};\n\n/** This function gives a seeded random number generator (mulberry32), with numbers in [0, 1). */\nexport const seeded = (seed: number): (() => number) => {\n let state = seed >>> 0;\n return () => {\n state = (state + 0x6d2b79f5) >>> 0;\n let t = state;\n t = Math.imul(t ^ (t >>> 15), t | 1);\n t ^= t + Math.imul(t ^ (t >>> 7), t | 61);\n return ((t ^ (t >>> 14)) >>> 0) / 4294967296;\n };\n};\n","import { valueIn } from \"@mark1russell7/quantity\";\nimport type { ServiceBuilder } from \"./builder.ts\";\nimport type { Check, ServiceDescription } from \"./description.ts\";\nimport type { FakeClock } from \"./fakes.ts\";\nimport { fakeClock, seeded } from \"./fakes.ts\";\nimport type { Health, HealthVerdict, StartOptions } from \"./health.ts\";\nimport { failSpan, recoverSpan } from \"./timing.ts\";\n\n/** A contract case is one generated case of the contract test of a declaration. It throws on a failure. */\nexport interface ContractCase {\n readonly name: string;\n run(): Promise<void>;\n}\n\n/** These options tune the contract test. */\nexport interface ContractOptions {\n /** This number is the latency that a degraded dependency adds to each check, in milliseconds. The default of the contract is 100. */\n readonly degradeBy?: number | undefined;\n /** This number is the seed of the jitter. */\n readonly seed?: number | undefined;\n}\n\nconst ms = (amount: { readonly value: number; readonly unit: string }): number => valueIn(amount, \"ms\");\n\n/** The part of a verdict that the contract compares: what a caller and the platform see. */\nconst visible = (verdict: HealthVerdict) => ({\n ready: verdict.ready,\n alive: verdict.alive,\n controllers: verdict.controllers,\n dependencies: verdict.dependencies,\n});\n\nconst same = (expected: unknown, actual: unknown): boolean => JSON.stringify(expected) === JSON.stringify(actual);\n\nconst failure = (what: string, expected: unknown, actual: unknown): Error =>\n new Error(`${what}: expected ${JSON.stringify(expected)}, but the verdict was ${JSON.stringify(actual)}`);\n\n/**\n * This function generates the contract test of a declaration. `declare` gives a new builder with\n * the declaration and the function of each check, each time. The checks must pass at rest. The\n * cases are:\n * - The service at rest: each controller and each dependency is ready, and the service is alive.\n * - Each dependency unavailable: its polls fail at once (the force-fail list). The dependency and\n * each controller that needs it become not ready, and the other controllers stay ready. Liveness\n * stays, unless a liveness check exercises the dependency.\n * - Each dependency degraded: each call of its checks takes the latency longer. Nothing can fail.\n * - Each dependency recovers: after it is unavailable, the service is again at rest.\n * - A negative control: a client that the declaration does not name fails, and nothing changes.\n *\n * A dependency that no check exercises is a finding: the service cannot see it fail.\n */\nexport const contractCases = (declare: () => ServiceBuilder, options: ContractOptions = {}): ContractCase[] => {\n const degradeBy = options.degradeBy ?? 100;\n const seed = options.seed ?? 1;\n const description: ServiceDescription = declare().describe();\n const service = description.name;\n const gating = description.checks.filter((check) => check.gates !== null);\n const timingOf = (check: Check) => description.policies[check.gates!];\n const failMax = (check: Check): number => ms(failSpan(timingOf(check), check.poll, \"error\").max);\n const recoverMax = (check: Check): number => ms(recoverSpan(timingOf(check), check.poll).max);\n const most = (values: readonly number[]): number => values.reduce((a, b) => Math.max(a, b), 0);\n const settleTime = most(gating.filter((check) => check.gates === \"readiness\").map(recoverMax)) + 1;\n const quietTime = most(gating.map(failMax)) + 1;\n\n /** This function starts the declaration on a fake clock, and moves it to rest. */\n const boot = async (\n extra: (clock: FakeClock) => Partial<StartOptions> = () => ({}),\n ): Promise<{ health: Health; clock: FakeClock; rest: ReturnType<typeof visible> }> => {\n const clock = fakeClock();\n // the warm-up sweep can wait on the clock (a degraded check), thus the clock moves while it starts\n const starting = declare().start({ clock, random: seeded(seed), ...extra(clock) });\n let started = false;\n void starting.then(\n () => (started = true),\n () => (started = true),\n );\n for (let step = 0; step < 1000 && !started; step += 1) await clock.advance(10);\n const health = await starting;\n await clock.advance(settleTime);\n return { health, clock, rest: visible(health.verdict()) };\n };\n const stop = (health: Health): void => health.stop();\n\n const cases: ContractCase[] = [\n {\n name: `${service}: at rest, each controller and each dependency is ready, and the service is alive`,\n async run() {\n const { health, rest } = await boot();\n try {\n const expected = {\n ready: true,\n alive: true,\n controllers: Object.fromEntries(description.controllers.map((each) => [each.name, true])),\n dependencies: Object.fromEntries(description.dependencies.map((each) => [each.name, true])),\n };\n if (!same(expected, rest)) throw failure(\"at rest\", expected, rest);\n } finally {\n stop(health);\n }\n },\n },\n ];\n\n for (const dependency of description.dependencies) {\n const on = gating.filter((check) => check.dependency === dependency.name);\n const readiness = on.filter((check) => check.gates === \"readiness\");\n const liveness = on.filter((check) => check.gates === \"liveness\");\n const unavailable = (rest: ReturnType<typeof visible>) => ({\n ready: readiness.length === 0 ? rest.ready : false,\n alive: liveness.length === 0 ? rest.alive : false,\n controllers: Object.fromEntries(\n description.controllers.map((each) => [\n each.name,\n each.requires.includes(dependency.name) && readiness.length > 0 ? false : rest.controllers[each.name],\n ]),\n ),\n dependencies: { ...rest.dependencies, [dependency.name]: readiness.length === 0 },\n });\n\n cases.push({\n name: `${service}: ${dependency.name} unavailable`,\n async run() {\n if (on.length === 0)\n throw new Error(`no check that gates a policy exercises ${dependency.name}: the service cannot see it fail`);\n const { health, clock, rest } = await boot();\n try {\n health.forceFail(dependency.name, true);\n await clock.advance(most(on.map(failMax)) + 1);\n const now = visible(health.verdict());\n const expected = unavailable(rest);\n if (!same(expected, now)) throw failure(`${dependency.name} unavailable`, expected, now);\n } finally {\n stop(health);\n }\n },\n });\n\n cases.push({\n name: `${service}: ${dependency.name} degraded by ${degradeBy} ms, and nothing fails`,\n async run() {\n const tight = on.filter((check) => ms(check.poll.timeout) <= degradeBy);\n if (tight.length > 0)\n throw new Error(\n `${tight.map((check) => `${check.name} times out in ${ms(check.poll.timeout)} ms`).join(\", \")}: a latency of ${degradeBy} ms fails it`,\n );\n const { health, clock, rest } = await boot((at) => ({\n wrapCheck: (check, run) =>\n check.dependency !== dependency.name\n ? run\n : (signal) => new Promise((resolve) => at.after(degradeBy, () => resolve(run(signal)))),\n }));\n try {\n await clock.advance(quietTime + most(on.map((check) => ms(check.poll.interval))));\n const now = visible(health.verdict());\n if (!same(rest, now)) throw failure(`${dependency.name} degraded`, rest, now);\n } finally {\n stop(health);\n }\n },\n });\n\n cases.push({\n name: `${service}: ${dependency.name} recovers`,\n async run() {\n if (on.length === 0)\n throw new Error(`no check that gates a policy exercises ${dependency.name}: the service cannot see it recover`);\n const { health, clock, rest } = await boot();\n try {\n health.forceFail(dependency.name, true);\n await clock.advance(most(on.map(failMax)) + 1);\n health.forceFail(dependency.name, false);\n await clock.advance(most(on.map(recoverMax)) + 1);\n const now = visible(health.verdict());\n if (!same(rest, now)) throw failure(`${dependency.name} recovered`, rest, now);\n } finally {\n stop(health);\n }\n },\n });\n }\n\n const never = `${service}.client-never-registered`;\n cases.push({\n name: `${service}: a client never registered fails, and nothing changes (the negative control)`,\n async run() {\n if (description.dependencies.some((each) => each.name === never))\n throw new Error(`the declaration has a dependency named ${never}`);\n const { health, clock, rest } = await boot();\n try {\n health.forceFail(never, true);\n await clock.advance(quietTime);\n const now = visible(health.verdict());\n if (!same(rest, now)) throw failure(\"the negative control\", rest, now);\n } finally {\n stop(health);\n }\n // and a check on a client never registered is refused before the start\n let refused = false;\n try {\n declare()\n .check({\n name: `${never}.check`,\n dependency: never,\n step: \"round-trip\",\n ownConnection: true,\n gates: null,\n poll: gating[0]?.poll ?? { interval: { value: 1, unit: \"s\" }, jitter: 0, timeout: { value: 0.5, unit: \"s\" } },\n })\n .describe();\n } catch {\n refused = true;\n }\n if (!refused) throw new Error(`the declaration accepted a check on ${never}, which is not a dependency`);\n },\n });\n\n return cases;\n};\n","import type { Clock } from \"./clock.ts\";\nimport { realClock } from \"./clock.ts\";\nimport type { ContractCase } from \"./contract.ts\";\nimport { fakeClock } from \"./fakes.ts\";\nimport type { Health } from \"./health.ts\";\nimport type { Lifecycle, TransportImpl } from \"./lifecycle.ts\";\n\n/** A held work is one unit of work that stays in flight until the test releases it. */\nexport interface HeldWork {\n /** This method lets the work end. Its promise ends when the caller of the work has its answer, or its error. */\n release(): Promise<void>;\n /** This flag tells if the work got the cooperative abort of the drain. */\n readonly aborted: boolean;\n}\n\n/**\n * A transport subject is a transport and the client side of its work. The kit offers work through\n * it, holds work in flight through it, and reads the count of the transport.\n */\nexport interface TransportSubject {\n readonly impl: TransportImpl;\n /** This lifecycle goes to `start()`. Without it, the kit gives a detached lifecycle. */\n readonly life?: Lifecycle | undefined;\n /** This method offers one unit of new work. It gives true when the transport took it, and false when it refused it. */\n offer(): Promise<boolean>;\n /** This method starts one unit of work that stays in flight until its release. The promise ends when the transport has it. */\n hold(): Promise<HeldWork>;\n /** This method frees what the subject holds outside the transport: its clients and their sockets. */\n dispose?(): Promise<void> | void;\n}\n\n/**\n * This function gives a detached lifecycle: a lifecycle with no service, for the start of a\n * transport in a test. Its state is `running`, it keeps each connection, and nothing is in flight. Each request\n * and each use of its health throws, because no service declares a route.\n */\nexport const detachedLifecycle = (): Lifecycle => {\n const none = (): never => {\n throw new Error(\"a detached lifecycle has no service: give the transport the lifecycle of a service\");\n };\n const health = { verdict: none, probe: none, metrics: none, subscribe: none, forceFail: none, drain: none, stop: none } as Health;\n return {\n health,\n state: \"running\",\n exitCode: null,\n errors: [],\n started: Promise.resolve(),\n done: new Promise<number>(() => {}),\n signal: new AbortController().signal,\n shutdown: none,\n request: none,\n inFlight: () => 0,\n keepAlive: () => true,\n };\n};\n\n/** A subject factory makes a new subject for each case, on the clock of the case. */\nexport type SubjectFactory = (clock: Clock) => TransportSubject | Promise<TransportSubject>;\n\n/** A conformance record is one measurement of a case, for the raw records of a run in CI. */\nexport interface ConformanceRecord {\n readonly case: string;\n readonly what: string;\n /** This time is the limit of the contract, in milliseconds. */\n readonly expected: number;\n /** This time is what the case measured, in milliseconds of the real clock. */\n readonly measured: number;\n}\n\n/** These options tune the conformance kit. */\nexport interface ConformanceOptions {\n /** This name goes before the name of each case. */\n readonly name?: string | undefined;\n /** This clock moves the cases: `fake` gives exact and fast cases, and `real` measures the timing. The default is `fake`. */\n readonly clock?: \"fake\" | \"real\" | undefined;\n /** This time is the cap of each drain of the cases, in milliseconds. The default is 1000. */\n readonly cap?: number | undefined;\n /** This time is the most that a close can take, in milliseconds of the real clock. The default is 1000. */\n readonly closeBound?: number | undefined;\n /** This time is the most that an event can take to reach the transport, in real milliseconds. The default is 100. */\n readonly slack?: number | undefined;\n /** False tells that the work of the transport cannot see the cooperative abort. The default is true. */\n readonly cooperative?: boolean | undefined;\n /** This count is the number of works that the count case holds. The default is 3. */\n readonly holds?: number | undefined;\n /** This function receives each measurement, for the raw records of a run. */\n readonly record?: ((record: ConformanceRecord) => void) | undefined;\n}\n\ninterface Time {\n readonly clock: Clock;\n pass(ms: number): Promise<void>;\n}\n\ninterface Tracked {\n readonly settled: boolean;\n readonly error: unknown;\n readonly failed: boolean;\n}\n\nconst realNow = (): number => performance.now();\nconst turn = (): Promise<void> => new Promise((resolve) => setTimeout(resolve, 0));\nconst sleep = (ms: number): Promise<void> => new Promise((resolve) => setTimeout(resolve, ms));\n\n/** This function waits on the real clock, until the test is true or the bound ends. It gives the test at the end. */\nconst within = async (bound: number, test: () => boolean): Promise<boolean> => {\n const end = realNow() + bound;\n for (;;) {\n if (test()) return true;\n if (realNow() > end) return test();\n await turn();\n }\n};\n\n/** This function lets the events that are ready reach the transport, with no move of the clock of the case. */\nconst quiet = async (): Promise<void> => {\n for (let at = 0; at < 8; at += 1) await turn();\n};\n\n/** This function uses a method of the transport, and gives a throw of the method as a rejection. */\nconst attempt = (call: () => Promise<void> | void): Promise<void> => {\n try {\n return Promise.resolve(call());\n } catch (error) {\n return Promise.reject(error);\n }\n};\n\nconst track = (promise: Promise<unknown>): Tracked => {\n const state = { settled: false, error: undefined as unknown, failed: false };\n promise.then(\n () => {\n state.settled = true;\n },\n (error: unknown) => {\n state.settled = true;\n state.failed = true;\n state.error = error;\n },\n );\n return state;\n};\n\n/**\n * This function generates the conformance cases of a transport (S6 A9). `make` gives a new subject\n * for each case. Each case throws on a failure, and its message names the part of the contract.\n * - The start: nothing is in flight, and the transport takes work.\n * - The count: it follows each work from its events, with no move of the clock.\n * - `stopIntake` refuses new work, keeps the work in flight, and a second stop has no effect.\n * - `drain` ends at once with no work, ends with the last work, and holds to its deadline and not\n * past it. It gives the cooperative abort to the work, and it does not throw.\n * - `close` ends the work in flight in its bound, and a second close has no effect.\n * - The stages in their sequence, as the lifecycle does them.\n */\nexport const transportConformance = (make: SubjectFactory, options: ConformanceOptions = {}): ContractCase[] => {\n const name = options.name ?? \"transport\";\n const fake = (options.clock ?? \"fake\") === \"fake\";\n const cap = options.cap ?? 1000;\n const closeBound = options.closeBound ?? 1000;\n const slack = options.slack ?? 100;\n const cooperative = options.cooperative ?? true;\n const holds = options.holds ?? 3;\n\n const timeOf = (): Time => {\n if (!fake) return { clock: realClock, pass: sleep };\n const clock = fakeClock();\n return { clock, pass: (ms) => clock.advance(ms) };\n };\n\n const check = (ok: boolean, what: string): void => {\n if (!ok) throw new Error(`${name}: ${what}`);\n };\n\n const each = (title: string, body: (subject: TransportSubject, time: Time, title: string) => Promise<void>): ContractCase => ({\n name: `${name}: ${title}`,\n async run() {\n const time = timeOf();\n const subject = await make(time.clock);\n try {\n await subject.impl.start(new AbortController().signal, subject.life ?? detachedLifecycle());\n await body(subject, time, title);\n } finally {\n try {\n await subject.impl.close();\n } finally {\n await subject.dispose?.();\n }\n }\n },\n });\n\n const count = (subject: TransportSubject, expected: number, what: string): Promise<void> =>\n within(slack, () => subject.impl.inFlight() === expected).then((ok) =>\n check(ok, `${what}: inFlight() gives ${subject.impl.inFlight()}, not ${expected}`),\n );\n\n const closes = async (subject: TransportSubject, title: string): Promise<void> => {\n const began = realNow();\n const closed = track(attempt(() => subject.impl.close()));\n const inBound = await within(closeBound, () => closed.settled);\n const took = realNow() - began;\n options.record?.({ case: title, what: \"close\", expected: closeBound, measured: took });\n check(inBound, `close did not end in its bound of ${closeBound} ms`);\n check(!closed.failed, `close threw: ${String(closed.error)}`);\n };\n\n const cases: ContractCase[] = [\n each(\"nothing is in flight after the start, and it takes new work\", async (subject) => {\n check(subject.impl.inFlight() === 0, `inFlight() gives ${subject.impl.inFlight()} after the start, not 0`);\n check(await subject.offer(), \"the transport refused new work after its start\");\n await count(subject, 0, \"the work ended\");\n }),\n\n each(\"the count follows each work in flight from its events, with no move of the clock\", async (subject) => {\n const held: HeldWork[] = [];\n for (let at = 1; at <= holds; at += 1) {\n held.push(await subject.hold());\n await count(subject, at, `${at} works are in flight`);\n }\n for (let at = holds - 1; at >= 0; at -= 1) {\n await held[at]!.release();\n await count(subject, at, `${at} works are in flight after a release`);\n }\n }),\n\n each(\"stopIntake refuses new work, keeps the work in flight, and a second stop has no effect\", async (subject) => {\n const work = await subject.hold();\n await subject.impl.stopIntake();\n check(!(await subject.offer()), \"the transport took new work after stopIntake\");\n await count(subject, 1, \"stopIntake cut the work in flight\");\n await subject.impl.stopIntake();\n check(!(await subject.offer()), \"the transport took new work after a second stopIntake\");\n await work.release();\n await count(subject, 0, \"the work in flight ended after stopIntake\");\n }),\n\n each(\"drain ends at once when nothing is in flight\", async (subject, time) => {\n await subject.impl.stopIntake();\n const drained = track(attempt(() => subject.impl.drain(time.clock.now() + cap, new AbortController().signal)));\n check(await within(slack, () => drained.settled), \"drain did not end with nothing in flight\");\n check(!drained.failed, `drain threw: ${String(drained.error)}`);\n }),\n\n each(\"drain ends when the last work ends, before its deadline\", async (subject, time) => {\n const work = await subject.hold();\n await subject.impl.stopIntake();\n const deadline = time.clock.now() + cap;\n const drained = track(attempt(() => subject.impl.drain(deadline, new AbortController().signal)));\n await time.pass(cap / 4);\n await quiet();\n check(!drained.settled, \"drain ended while work was in flight, before its deadline\");\n await work.release();\n check(await within(slack, () => drained.settled), \"drain did not end when the last work ended\");\n check(!drained.failed, `drain threw: ${String(drained.error)}`);\n check(time.clock.now() < deadline, \"drain waited until its deadline after the last work ended\");\n }),\n\n each(\"drain holds to its deadline and not past it, and does not throw\", async (subject, time, title) => {\n await subject.hold();\n await subject.impl.stopIntake();\n const began = realNow();\n const deadline = time.clock.now() + cap;\n const drained = track(attempt(() => subject.impl.drain(deadline, new AbortController().signal)));\n if (fake) {\n await time.pass(cap - 1);\n await quiet();\n check(!drained.settled, \"drain ended before its deadline, with work in flight\");\n await time.pass(1);\n check(await within(slack, () => drained.settled), \"drain did not end at its deadline\");\n } else {\n const ended = await within(cap + slack, () => drained.settled);\n const took = realNow() - began;\n options.record?.({ case: title, what: \"drain to its deadline\", expected: cap, measured: took });\n check(ended, `drain did not end in ${cap + slack} ms, with a deadline at ${cap} ms`);\n check(took >= cap - slack, `drain ended after ${Math.round(took)} ms, before its deadline at ${cap} ms`);\n }\n check(!drained.failed, `drain threw at its deadline: ${String(drained.error)}`);\n }),\n\n ...(cooperative\n ? [\n each(\"drain gives the cooperative abort to the work in flight\", async (subject, time) => {\n const work = await subject.hold();\n await subject.impl.stopIntake();\n const abort = new AbortController();\n const drained = track(attempt(() => subject.impl.drain(time.clock.now() + cap, abort.signal)));\n await time.pass(cap / 2);\n await quiet();\n check(!work.aborted, \"the work got an abort before the signal of the drain aborted\");\n abort.abort(new Error(\"the cooperative abort of the conformance kit\"));\n check(await within(slack, () => work.aborted), \"the work did not get the cooperative abort\");\n await time.pass(cap / 2);\n check(await within(slack, () => drained.settled), \"drain did not end at its deadline after the cooperative abort\");\n check(!drained.failed, `drain threw after the cooperative abort: ${String(drained.error)}`);\n }),\n ]\n : []),\n\n each(\"drain with an aborted signal and a deadline in the past ends at once\", async (subject, time) => {\n const work = await subject.hold();\n await subject.impl.stopIntake();\n const abort = new AbortController();\n abort.abort(new Error(\"the cooperative abort of the conformance kit\"));\n const drained = track(attempt(() => subject.impl.drain(time.clock.now() - 1, abort.signal)));\n check(await within(slack, () => drained.settled), \"drain did not end at once with its deadline in the past\");\n check(!drained.failed, `drain threw: ${String(drained.error)}`);\n if (cooperative) check(await within(slack, () => work.aborted), \"the work did not get an abort that came before the drain\");\n }),\n\n each(\"close ends the work in flight, in its bound\", async (subject, _time, title) => {\n for (let at = 0; at < holds; at += 1) await subject.hold();\n await count(subject, holds, \"the works are in flight before the close\");\n await closes(subject, title);\n await count(subject, 0, \"close left work in flight\");\n }),\n\n each(\"close is idempotent: a second close has no effect\", async (subject, _time, title) => {\n await subject.hold();\n const first = track(attempt(() => subject.impl.close()));\n const second = track(attempt(() => subject.impl.close()));\n check(await within(closeBound, () => first.settled && second.settled), \"two closes did not end in the bound\");\n check(!first.failed && !second.failed, `a close threw: ${String(first.error ?? second.error)}`);\n await closes(subject, title);\n await count(subject, 0, \"the closes left work in flight\");\n }),\n\n each(\"close right after the start ends in its bound\", async (subject, _time, title) => {\n await closes(subject, title);\n check(subject.impl.inFlight() === 0, \"inFlight() is not 0 after a close with no work\");\n }),\n\n each(\"the stages in their sequence: stop intake, drain with its cooperative abort, close\", async (subject, time, title) => {\n const short = await subject.hold();\n const long = await subject.hold();\n await subject.impl.stopIntake();\n check(!(await subject.offer()), \"the transport took new work after stopIntake\");\n const abort = new AbortController();\n const drained = track(attempt(() => subject.impl.drain(time.clock.now() + cap, abort.signal)));\n await short.release();\n await count(subject, 1, \"one work ended in the drain\");\n await time.pass(cap / 2);\n abort.abort(new Error(\"the cooperative abort of the conformance kit\"));\n if (cooperative) check(await within(slack, () => long.aborted), \"the long work did not get the cooperative abort\");\n await time.pass(cap / 2);\n check(await within(slack, () => drained.settled), \"drain did not end at its deadline\");\n await closes(subject, title);\n await count(subject, 0, \"close left work in flight\");\n }),\n ];\n return cases;\n};\n","// @mark1russell7/service/testing: the seams of the runtime for tests. A fake clock gives exact,\n// repeatable timing. A seeded random gives the same jitter on each run. A fake process takes\n// signals and keeps the exit codes. A quiet server answers until it goes quiet, and then it holds\n// its connections open without an answer. A test logger keeps each log entry. `contractCases` generates the contract test of a\n// declaration, and `transportConformance` generates the conformance test of a transport.\n\nimport type { AddressInfo, Server, Socket } from \"node:net\";\nimport { createServer } from \"node:net\";\nimport type { Outcome } from \"./latch.ts\";\nimport type { LogEntry, LogLevel, Logger } from \"./logger.ts\";\nimport type { CheckFn } from \"./poller.ts\";\n\nexport type { FakeClock, FakeProcess, FakeProcessOptions } from \"./fakes.ts\";\nexport { fakeClock, fakeProcess, seeded } from \"./fakes.ts\";\nexport type { ContractCase, ContractOptions } from \"./contract.ts\";\nexport { contractCases } from \"./contract.ts\";\nexport type {\n ConformanceOptions,\n ConformanceRecord,\n HeldWork,\n SubjectFactory,\n TransportSubject,\n} from \"./conformance.ts\";\nexport { detachedLifecycle, transportConformance } from \"./conformance.ts\";\n\n/**\n * A behavior is what a scripted check does when the runtime starts it:\n * - `\"ok\"`, `\"error\"` and `\"indeterminate\"` give that outcome at once.\n * - `\"throw\"` throws at once.\n * - `\"timeout\"` gives no answer until the runtime aborts the use at the timeout of the poll.\n * - `\"hang\"` gives no answer, and it ignores the abort, until `heal()`.\n */\nexport type Behavior = Outcome | \"throw\" | \"timeout\" | \"hang\";\n\n/** A scripted check is a check function whose behavior a test sets. */\nexport interface ScriptedCheck {\n readonly run: CheckFn;\n /** This behavior applies to each later call. */\n behavior: Behavior;\n /** This count is the number of calls of the check. */\n readonly calls: number;\n /** This count is the number of calls that are pending. */\n readonly hung: number;\n /** This method ends each hung call with a pass, as when a driver gets its answer late. */\n heal(): void;\n}\n\n/** This function makes a scripted check with a behavior at the start. */\nexport const scriptedCheck = (behavior: Behavior = \"ok\"): ScriptedCheck => {\n let calls = 0;\n const hung = new Set<() => void>();\n const script: ScriptedCheck = {\n behavior,\n get calls() {\n return calls;\n },\n get hung() {\n return hung.size;\n },\n heal() {\n for (const end of [...hung]) end();\n },\n run: (signal) => {\n calls += 1;\n const now = script.behavior;\n if (now === \"throw\") throw new Error(\"the scripted check threw\");\n if (now === \"timeout\")\n return new Promise<Outcome>((_, reject) =>\n signal.addEventListener(\"abort\", () => reject(new Error(\"aborted at the timeout\"))),\n );\n if (now === \"hang\")\n return new Promise<Outcome>((resolve) => {\n const end = (): void => {\n hung.delete(end);\n resolve(\"ok\");\n };\n hung.add(end);\n });\n return now;\n },\n };\n return script;\n};\n\n/** A test logger is a logger that keeps each entry, thus a test can examine the log of the runtime. */\nexport interface TestLogger extends Logger {\n /** These are the entries, in the sequence of their calls. */\n readonly entries: readonly LogEntry[];\n /** This method gives the message of each entry, or of each entry at one level. */\n messages(level?: LogLevel): string[];\n /** This method removes each entry. */\n clear(): void;\n}\n\n/** This function makes a test logger with no entries. */\nexport const testLogger = (): TestLogger => {\n const entries: LogEntry[] = [];\n return {\n entries,\n log(level, message, fields) {\n entries.push({ level, message, fields });\n },\n messages: (level) => entries.filter((entry) => level === undefined || entry.level === level).map((entry) => entry.message),\n clear() {\n entries.length = 0;\n },\n };\n};\n\n/** A quiet server is a TCP echo server that can stop its answers and keep its connections open. */\nexport interface QuietServer {\n readonly port: number;\n /** This method stops the answers. The connections stay open, and the server reads and discards the data. */\n quiet(): void;\n /** This method starts the answers again. */\n speak(): void;\n /** This count is the number of open connections. */\n readonly connections: number;\n close(): Promise<void>;\n}\n\n/**\n * This function starts a quiet server on the loopback address. A check against it passes while it\n * answers. When it goes quiet, the check sees a connection that is open but silent. A frozen peer\n * and a black hole that keeps the connection look the same.\n */\nexport const quietServer = async (): Promise<QuietServer> => {\n let silent = false;\n const sockets = new Set<Socket>();\n const server: Server = createServer((socket) => {\n sockets.add(socket);\n socket.on(\"close\", () => sockets.delete(socket));\n socket.on(\"error\", () => sockets.delete(socket));\n socket.on(\"data\", (chunk) => {\n if (!silent) socket.write(chunk);\n });\n });\n await new Promise<void>((resolve, reject) => {\n server.once(\"error\", reject);\n server.listen(0, \"127.0.0.1\", () => resolve());\n });\n return {\n port: (server.address() as AddressInfo).port,\n quiet: () => {\n silent = true;\n },\n speak: () => {\n silent = false;\n },\n get connections() {\n return sockets.size;\n },\n close: () =>\n new Promise<void>((resolve) => {\n for (const socket of sockets) socket.destroy();\n server.close(() => resolve());\n }),\n };\n};\n"],"mappings":";;;;;;AAoBA,MAAM,SAAS,YAA2B;CACxC,KAAK,IAAI,OAAO,GAAG,OAAO,IAAI,QAAQ,GAAG,MAAM,QAAQ,QAAQ;AACjE;;AAGA,MAAa,aAAa,QAAQ,MAAiB;CACjD,IAAI,MAAM;CACV,IAAI,WAAW;CACf,MAAM,SAA+E,CAAC;CACtF,MAAM,OAAO,QAAgB;EAC3B,IAAI;EACJ,KAAK,MAAM,SAAS,QAClB,IAAI,MAAM,QAAQ,MAAM,MAAM,QAAQ,SAAS,KAAA,KAAa,MAAM,KAAK,KAAK,MAAO,MAAM,OAAO,KAAK,MAAM,MAAM,QAAQ,KAAK,QAC5H,OAAO;EACX,OAAO;CACT;CACA,OAAO;EACL,WAAW;EACX,MAAM,IAAI,KAAa;GACrB,MAAM,QAAQ;IAAE,IAAI,MAAM,KAAK,IAAI,GAAG,EAAE;IAAG,OAAO;IAAY;IAAK,MAAM;GAAK;GAC9E,OAAO,KAAK,KAAK;GACjB,aAAa;IACX,MAAM,OAAO;GACf;EACF;EACA,MAAM,QAAQ,IAAI;GAEhB,MAAM,MAAM,MAAM,KAAK,IAAI,GAAG,EAAE;GAChC,MAAM,OAAO;GACb,SAAS;IACP,MAAM,QAAQ,IAAI,GAAG;IACrB,IAAI,UAAU,KAAA,GAAW;IACzB,MAAM,OAAO;IAEb,MAAM,KAAK,IAAI,KAAK,MAAM,EAAE;IAC5B,MAAM,IAAI;IACV,MAAM,OAAO;GACf;GACA,MAAM,KAAK,IAAI,KAAK,GAAG;GACvB,KAAK,IAAI,KAAK,OAAO,SAAS,GAAG,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC,OAAO,GAAG,CAAE,MAAM,OAAO,OAAO,IAAI,CAAC;GAC7F,MAAM,OAAO;EACf;EACA,MAAM,IAAI;GACR,OAAO,KAAK,IAAI,GAAG,EAAE;EACvB;EACA,IAAI,UAAU;GACZ,OAAO,OAAO,QAAQ,UAAU,MAAM,IAAI,CAAC,CAAC;EAC9C;CACF;AACF;;AAmCA,MAAa,eAAe,UAA8B,CAAC,MAAmB;CAC5E,MAAM,2BAAW,IAAI,IAAmD;CACxE,MAAM,QAAkB,CAAC;CACzB,MAAM,MAAgB,CAAC;CACvB,IAAI,UAAU;CACd,IAAI,QAAQ;CACZ,MAAM,aAAuB,CAAC;CAC9B,MAAM,SAAS,SAAuB;EACpC,IAAI,KAAK,QAAQ,UAAU,KAAA,IAAY,OAAO,GAAG,QAAQ,MAAM,IAAI,EAAE,GAAG,MAAM;CAChF;CACA,MAAM,QAAQ,MAAmB,YAA4B;EAC3D,KAAK,MAAM,WAAW,CAAC,GAAI,SAAS,IAAI,IAAI,KAAK,CAAC,CAAE,GAAG,QAAQ,OAAO;CACxE;CACA,OAAO;EACL,GAAG,SAAS,SAAS;GACnB,MAAM,MAAM,SAAS,IAAI,OAAO,qBAAK,IAAI,IAAI;GAC7C,IAAI,IAAI,OAAO;GACf,SAAS,IAAI,SAAS,GAAG;GACzB,aAAa;IACX,IAAI,OAAO,OAAO;GACpB;EACF;EACA,MAAM,QAAQ;GACZ,MAAM,OAAO;GACb,MAAM,QAAQ,QAAQ;GACtB,WAAW;GACX,MAAM,SAAS;EACjB;EACA,OAAO;GACL,SAAS;GACT,IAAI,OAAO;GACX,aAAa;IACX,IAAI,CAAC,MAAM;IACX,OAAO;IACP,SAAS;GACX;EACF;EACA,KAAK,MAAM;GACT,MAAM,QAAQ,MAAM;GACpB,WAAW,KAAK,KAAK;GACrB,MAAM,KAAK,IAAI;EACjB;EACA,SAAS,SAAS,KAAK,IAAI;EAC3B,UAAU,SAAS,KAAK,IAAI;EAC5B,UAAU,UAAU,KAAK,eAAe,KAAK;EAC7C,IAAI,QAAQ;GACV,OAAO,CAAC,GAAG,KAAK;EAClB;EACA,IAAI,WAAW;GACb,IAAI,QAAQ;GACZ,KAAK,MAAM,OAAO,SAAS,OAAO,GAAG,SAAS,IAAI;GAClD,OAAO;EACT;EACA,IAAI,WAAW;GACb,OAAO,CAAC,GAAG,SAAS,KAAK,CAAC;EAC5B;EACA,IAAI,MAAM;GACR,OAAO,CAAC,GAAG,GAAG;EAChB;EACA,IAAI,UAAU;GACZ,OAAO;EACT;EACA,IAAI,QAAQ;GACV,OAAO;EACT;EACA,IAAI,aAAa;GACf,OAAO,CAAC,GAAG,UAAU;EACvB;CACF;AACF;;AAGA,MAAa,UAAU,SAAiC;CACtD,IAAI,QAAQ,SAAS;CACrB,aAAa;EACX,QAAS,QAAQ,eAAgB;EACjC,IAAI,IAAI;EACR,IAAI,KAAK,KAAK,IAAK,MAAM,IAAK,IAAI,CAAC;EACnC,KAAK,IAAI,KAAK,KAAK,IAAK,MAAM,GAAI,IAAI,EAAE;EACxC,SAAS,IAAK,MAAM,QAAS,KAAK;CACpC;AACF;;;ACnKA,MAAM,MAAM,WAAsE,QAAQ,QAAQ,IAAI;;AAGtG,MAAM,WAAW,aAA4B;CAC3C,OAAO,QAAQ;CACf,OAAO,QAAQ;CACf,aAAa,QAAQ;CACrB,cAAc,QAAQ;AACxB;AAEA,MAAM,QAAQ,UAAmB,WAA6B,KAAK,UAAU,QAAQ,MAAM,KAAK,UAAU,MAAM;AAEhH,MAAM,WAAW,MAAc,UAAmB,2BAChD,IAAI,MAAM,GAAG,KAAK,aAAa,KAAK,UAAU,QAAQ,EAAE,wBAAwB,KAAK,UAAU,MAAM,GAAG;;;;;;;;;;;;;;;AAgB1G,MAAa,iBAAiB,SAA+B,UAA2B,CAAC,MAAsB;CAC7G,MAAM,YAAY,QAAQ,aAAa;CACvC,MAAM,OAAO,QAAQ,QAAQ;CAC7B,MAAM,cAAkC,QAAQ,CAAC,CAAC,SAAS;CAC3D,MAAM,UAAU,YAAY;CAC5B,MAAM,SAAS,YAAY,OAAO,QAAQ,UAAU,MAAM,UAAU,IAAI;CACxE,MAAM,YAAY,UAAiB,YAAY,SAAS,MAAM;CAC9D,MAAM,WAAW,UAAyB,GAAG,SAAS,SAAS,KAAK,GAAG,MAAM,MAAM,OAAO,CAAC,CAAC,GAAG;CAC/F,MAAM,cAAc,UAAyB,GAAG,YAAY,SAAS,KAAK,GAAG,MAAM,IAAI,CAAC,CAAC,GAAG;CAC5F,MAAM,QAAQ,WAAsC,OAAO,QAAQ,GAAG,MAAM,KAAK,IAAI,GAAG,CAAC,GAAG,CAAC;CAC7F,MAAM,aAAa,KAAK,OAAO,QAAQ,UAAU,MAAM,UAAU,WAAW,CAAC,CAAC,IAAI,UAAU,CAAC,IAAI;CACjG,MAAM,YAAY,KAAK,OAAO,IAAI,OAAO,CAAC,IAAI;;CAG9C,MAAM,OAAO,OACX,eAA4D,CAAC,OACuB;EACpF,MAAM,QAAQ,UAAU;EAExB,MAAM,WAAW,QAAQ,CAAC,CAAC,MAAM;GAAE;GAAO,QAAQ,OAAO,IAAI;GAAG,GAAG,MAAM,KAAK;EAAE,CAAC;EACjF,IAAI,UAAU;EACd,SAAc,WACL,UAAU,YACV,UAAU,IACnB;EACA,KAAK,IAAI,OAAO,GAAG,OAAO,OAAQ,CAAC,SAAS,QAAQ,GAAG,MAAM,MAAM,QAAQ,EAAE;EAC7E,MAAM,SAAS,MAAM;EACrB,MAAM,MAAM,QAAQ,UAAU;EAC9B,OAAO;GAAE;GAAQ;GAAO,MAAM,QAAQ,OAAO,QAAQ,CAAC;EAAE;CAC1D;CACA,MAAM,QAAQ,WAAyB,OAAO,KAAK;CAEnD,MAAM,QAAwB,CAC5B;EACE,MAAM,GAAG,QAAQ;EACjB,MAAM,MAAM;GACV,MAAM,EAAE,QAAQ,SAAS,MAAM,KAAK;GACpC,IAAI;IACF,MAAM,WAAW;KACf,OAAO;KACP,OAAO;KACP,aAAa,OAAO,YAAY,YAAY,YAAY,KAAK,SAAS,CAAC,KAAK,MAAM,IAAI,CAAC,CAAC;KACxF,cAAc,OAAO,YAAY,YAAY,aAAa,KAAK,SAAS,CAAC,KAAK,MAAM,IAAI,CAAC,CAAC;IAC5F;IACA,IAAI,CAAC,KAAK,UAAU,IAAI,GAAG,MAAM,QAAQ,WAAW,UAAU,IAAI;GACpE,UAAU;IACR,KAAK,MAAM;GACb;EACF;CACF,CACF;CAEA,KAAK,MAAM,cAAc,YAAY,cAAc;EACjD,MAAM,KAAK,OAAO,QAAQ,UAAU,MAAM,eAAe,WAAW,IAAI;EACxE,MAAM,YAAY,GAAG,QAAQ,UAAU,MAAM,UAAU,WAAW;EAClE,MAAM,WAAW,GAAG,QAAQ,UAAU,MAAM,UAAU,UAAU;EAChE,MAAM,eAAe,UAAsC;GACzD,OAAO,UAAU,WAAW,IAAI,KAAK,QAAQ;GAC7C,OAAO,SAAS,WAAW,IAAI,KAAK,QAAQ;GAC5C,aAAa,OAAO,YAClB,YAAY,YAAY,KAAK,SAAS,CACpC,KAAK,MACL,KAAK,SAAS,SAAS,WAAW,IAAI,KAAK,UAAU,SAAS,IAAI,QAAQ,KAAK,YAAY,KAAK,KAClG,CAAC,CACH;GACA,cAAc;IAAE,GAAG,KAAK;KAAe,WAAW,OAAO,UAAU,WAAW;GAAE;EAClF;EAEA,MAAM,KAAK;GACT,MAAM,GAAG,QAAQ,IAAI,WAAW,KAAK;GACrC,MAAM,MAAM;IACV,IAAI,GAAG,WAAW,GAChB,MAAM,IAAI,MAAM,0CAA0C,WAAW,KAAK,iCAAiC;IAC7G,MAAM,EAAE,QAAQ,OAAO,SAAS,MAAM,KAAK;IAC3C,IAAI;KACF,OAAO,UAAU,WAAW,MAAM,IAAI;KACtC,MAAM,MAAM,QAAQ,KAAK,GAAG,IAAI,OAAO,CAAC,IAAI,CAAC;KAC7C,MAAM,MAAM,QAAQ,OAAO,QAAQ,CAAC;KACpC,MAAM,WAAW,YAAY,IAAI;KACjC,IAAI,CAAC,KAAK,UAAU,GAAG,GAAG,MAAM,QAAQ,GAAG,WAAW,KAAK,eAAe,UAAU,GAAG;IACzF,UAAU;KACR,KAAK,MAAM;IACb;GACF;EACF,CAAC;EAED,MAAM,KAAK;GACT,MAAM,GAAG,QAAQ,IAAI,WAAW,KAAK,eAAe,UAAU;GAC9D,MAAM,MAAM;IACV,MAAM,QAAQ,GAAG,QAAQ,UAAU,GAAG,MAAM,KAAK,OAAO,KAAK,SAAS;IACtE,IAAI,MAAM,SAAS,GACjB,MAAM,IAAI,MACR,GAAG,MAAM,KAAK,UAAU,GAAG,MAAM,KAAK,gBAAgB,GAAG,MAAM,KAAK,OAAO,EAAE,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE,iBAAiB,UAAU,aAC3H;IACF,MAAM,EAAE,QAAQ,OAAO,SAAS,MAAM,MAAM,QAAQ,EAClD,YAAY,OAAO,QACjB,MAAM,eAAe,WAAW,OAC5B,OACC,WAAW,IAAI,SAAS,YAAY,GAAG,MAAM,iBAAiB,QAAQ,IAAI,MAAM,CAAC,CAAC,CAAC,EAC5F,EAAE;IACF,IAAI;KACF,MAAM,MAAM,QAAQ,YAAY,KAAK,GAAG,KAAK,UAAU,GAAG,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC;KAChF,MAAM,MAAM,QAAQ,OAAO,QAAQ,CAAC;KACpC,IAAI,CAAC,KAAK,MAAM,GAAG,GAAG,MAAM,QAAQ,GAAG,WAAW,KAAK,YAAY,MAAM,GAAG;IAC9E,UAAU;KACR,KAAK,MAAM;IACb;GACF;EACF,CAAC;EAED,MAAM,KAAK;GACT,MAAM,GAAG,QAAQ,IAAI,WAAW,KAAK;GACrC,MAAM,MAAM;IACV,IAAI,GAAG,WAAW,GAChB,MAAM,IAAI,MAAM,0CAA0C,WAAW,KAAK,oCAAoC;IAChH,MAAM,EAAE,QAAQ,OAAO,SAAS,MAAM,KAAK;IAC3C,IAAI;KACF,OAAO,UAAU,WAAW,MAAM,IAAI;KACtC,MAAM,MAAM,QAAQ,KAAK,GAAG,IAAI,OAAO,CAAC,IAAI,CAAC;KAC7C,OAAO,UAAU,WAAW,MAAM,KAAK;KACvC,MAAM,MAAM,QAAQ,KAAK,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC;KAChD,MAAM,MAAM,QAAQ,OAAO,QAAQ,CAAC;KACpC,IAAI,CAAC,KAAK,MAAM,GAAG,GAAG,MAAM,QAAQ,GAAG,WAAW,KAAK,aAAa,MAAM,GAAG;IAC/E,UAAU;KACR,KAAK,MAAM;IACb;GACF;EACF,CAAC;CACH;CAEA,MAAM,QAAQ,GAAG,QAAQ;CACzB,MAAM,KAAK;EACT,MAAM,GAAG,QAAQ;EACjB,MAAM,MAAM;GACV,IAAI,YAAY,aAAa,MAAM,SAAS,KAAK,SAAS,KAAK,GAC7D,MAAM,IAAI,MAAM,0CAA0C,OAAO;GACnE,MAAM,EAAE,QAAQ,OAAO,SAAS,MAAM,KAAK;GAC3C,IAAI;IACF,OAAO,UAAU,OAAO,IAAI;IAC5B,MAAM,MAAM,QAAQ,SAAS;IAC7B,MAAM,MAAM,QAAQ,OAAO,QAAQ,CAAC;IACpC,IAAI,CAAC,KAAK,MAAM,GAAG,GAAG,MAAM,QAAQ,wBAAwB,MAAM,GAAG;GACvE,UAAU;IACR,KAAK,MAAM;GACb;GAEA,IAAI,UAAU;GACd,IAAI;IACF,QAAQ,CAAC,CACN,MAAM;KACL,MAAM,GAAG,MAAM;KACf,YAAY;KACZ,MAAM;KACN,eAAe;KACf,OAAO;KACP,MAAM,OAAO,EAAE,EAAE,QAAQ;MAAE,UAAU;OAAE,OAAO;OAAG,MAAM;MAAI;MAAG,QAAQ;MAAG,SAAS;OAAE,OAAO;OAAK,MAAM;MAAI;KAAE;IAC9G,CAAC,CAAC,CACD,SAAS;GACd,QAAQ;IACN,UAAU;GACZ;GACA,IAAI,CAAC,SAAS,MAAM,IAAI,MAAM,uCAAuC,MAAM,4BAA4B;EACzG;CACF,CAAC;CAED,OAAO;AACT;;;;;;;;ACrLA,MAAa,0BAAqC;CAChD,MAAM,aAAoB;EACxB,MAAM,IAAI,MAAM,oFAAoF;CACtG;CAEA,OAAO;EACL,QAAA;GAFe,SAAS;GAAM,OAAO;GAAM,SAAS;GAAM,WAAW;GAAM,WAAW;GAAM,OAAO;GAAM,MAAM;EAE1G;EACL,OAAO;EACP,UAAU;EACV,QAAQ,CAAC;EACT,SAAS,QAAQ,QAAQ;EACzB,MAAM,IAAI,cAAsB,CAAC,CAAC;EAClC,QAAQ,IAAI,gBAAgB,CAAC,CAAC;EAC9B,UAAU;EACV,SAAS;EACT,gBAAgB;EAChB,iBAAiB;CACnB;AACF;AA8CA,MAAM,gBAAwB,YAAY,IAAI;AAC9C,MAAM,aAA4B,IAAI,SAAS,YAAY,WAAW,SAAS,CAAC,CAAC;AACjF,MAAM,SAAS,OAA8B,IAAI,SAAS,YAAY,WAAW,SAAS,EAAE,CAAC;;AAG7F,MAAM,SAAS,OAAO,OAAe,SAA0C;CAC7E,MAAM,MAAM,QAAQ,IAAI;CACxB,SAAS;EACP,IAAI,KAAK,GAAG,OAAO;EACnB,IAAI,QAAQ,IAAI,KAAK,OAAO,KAAK;EACjC,MAAM,KAAK;CACb;AACF;;AAGA,MAAM,QAAQ,YAA2B;CACvC,KAAK,IAAI,KAAK,GAAG,KAAK,GAAG,MAAM,GAAG,MAAM,KAAK;AAC/C;;AAGA,MAAM,WAAW,SAAoD;CACnE,IAAI;EACF,OAAO,QAAQ,QAAQ,KAAK,CAAC;CAC/B,SAAS,OAAO;EACd,OAAO,QAAQ,OAAO,KAAK;CAC7B;AACF;AAEA,MAAM,SAAS,YAAuC;CACpD,MAAM,QAAQ;EAAE,SAAS;EAAO,OAAO,KAAA;EAAsB,QAAQ;CAAM;CAC3E,QAAQ,WACA;EACJ,MAAM,UAAU;CAClB,IACC,UAAmB;EAClB,MAAM,UAAU;EAChB,MAAM,SAAS;EACf,MAAM,QAAQ;CAChB,CACF;CACA,OAAO;AACT;;;;;;;;;;;;AAaA,MAAa,wBAAwB,MAAsB,UAA8B,CAAC,MAAsB;CAC9G,MAAM,OAAO,QAAQ,QAAQ;CAC7B,MAAM,QAAQ,QAAQ,SAAS,YAAY;CAC3C,MAAM,MAAM,QAAQ,OAAO;CAC3B,MAAM,aAAa,QAAQ,cAAc;CACzC,MAAM,QAAQ,QAAQ,SAAS;CAC/B,MAAM,cAAc,QAAQ,eAAe;CAC3C,MAAM,QAAQ,QAAQ,SAAS;CAE/B,MAAM,eAAqB;EACzB,IAAI,CAAC,MAAM,OAAO;GAAE,OAAO;GAAW,MAAM;EAAM;EAClD,MAAM,QAAQ,UAAU;EACxB,OAAO;GAAE;GAAO,OAAO,OAAO,MAAM,QAAQ,EAAE;EAAE;CAClD;CAEA,MAAM,SAAS,IAAa,SAAuB;EACjD,IAAI,CAAC,IAAI,MAAM,IAAI,MAAM,GAAG,KAAK,IAAI,MAAM;CAC7C;CAEA,MAAM,QAAQ,OAAe,UAAiG;EAC5H,MAAM,GAAG,KAAK,IAAI;EAClB,MAAM,MAAM;GACV,MAAM,OAAO,OAAO;GACpB,MAAM,UAAU,MAAM,KAAK,KAAK,KAAK;GACrC,IAAI;IACF,MAAM,QAAQ,KAAK,MAAM,IAAI,gBAAgB,CAAC,CAAC,QAAQ,QAAQ,QAAQ,kBAAkB,CAAC;IAC1F,MAAM,KAAK,SAAS,MAAM,KAAK;GACjC,UAAU;IACR,IAAI;KACF,MAAM,QAAQ,KAAK,MAAM;IAC3B,UAAU;KACR,MAAM,QAAQ,UAAU;IAC1B;GACF;EACF;CACF;CAEA,MAAM,SAAS,SAA2B,UAAkB,SAC1D,OAAO,aAAa,QAAQ,KAAK,SAAS,MAAM,QAAQ,CAAC,CAAC,MAAM,OAC9D,MAAM,IAAI,GAAG,KAAK,qBAAqB,QAAQ,KAAK,SAAS,EAAE,QAAQ,UAAU,CACnF;CAEF,MAAM,SAAS,OAAO,SAA2B,UAAiC;EAChF,MAAM,QAAQ,QAAQ;EACtB,MAAM,SAAS,MAAM,cAAc,QAAQ,KAAK,MAAM,CAAC,CAAC;EACxD,MAAM,UAAU,MAAM,OAAO,kBAAkB,OAAO,OAAO;EAC7D,MAAM,OAAO,QAAQ,IAAI;EACzB,QAAQ,SAAS;GAAE,MAAM;GAAO,MAAM;GAAS,UAAU;GAAY,UAAU;EAAK,CAAC;EACrF,MAAM,SAAS,qCAAqC,WAAW,IAAI;EACnE,MAAM,CAAC,OAAO,QAAQ,gBAAgB,OAAO,OAAO,KAAK,GAAG;CAC9D;CAiJA,OAAO;EA9IL,KAAK,+DAA+D,OAAO,YAAY;GACrF,MAAM,QAAQ,KAAK,SAAS,MAAM,GAAG,oBAAoB,QAAQ,KAAK,SAAS,EAAE,wBAAwB;GACzG,MAAM,MAAM,QAAQ,MAAM,GAAG,gDAAgD;GAC7E,MAAM,MAAM,SAAS,GAAG,gBAAgB;EAC1C,CAAC;EAED,KAAK,oFAAoF,OAAO,YAAY;GAC1G,MAAM,OAAmB,CAAC;GAC1B,KAAK,IAAI,KAAK,GAAG,MAAM,OAAO,MAAM,GAAG;IACrC,KAAK,KAAK,MAAM,QAAQ,KAAK,CAAC;IAC9B,MAAM,MAAM,SAAS,IAAI,GAAG,GAAG,qBAAqB;GACtD;GACA,KAAK,IAAI,KAAK,QAAQ,GAAG,MAAM,GAAG,MAAM,GAAG;IACzC,MAAM,KAAK,GAAG,CAAE,QAAQ;IACxB,MAAM,MAAM,SAAS,IAAI,GAAG,GAAG,qCAAqC;GACtE;EACF,CAAC;EAED,KAAK,0FAA0F,OAAO,YAAY;GAChH,MAAM,OAAO,MAAM,QAAQ,KAAK;GAChC,MAAM,QAAQ,KAAK,WAAW;GAC9B,MAAM,CAAE,MAAM,QAAQ,MAAM,GAAI,8CAA8C;GAC9E,MAAM,MAAM,SAAS,GAAG,mCAAmC;GAC3D,MAAM,QAAQ,KAAK,WAAW;GAC9B,MAAM,CAAE,MAAM,QAAQ,MAAM,GAAI,uDAAuD;GACvF,MAAM,KAAK,QAAQ;GACnB,MAAM,MAAM,SAAS,GAAG,2CAA2C;EACrE,CAAC;EAED,KAAK,gDAAgD,OAAO,SAAS,SAAS;GAC5E,MAAM,QAAQ,KAAK,WAAW;GAC9B,MAAM,UAAU,MAAM,cAAc,QAAQ,KAAK,MAAM,KAAK,MAAM,IAAI,IAAI,KAAK,IAAI,gBAAgB,CAAC,CAAC,MAAM,CAAC,CAAC;GAC7G,MAAM,MAAM,OAAO,aAAa,QAAQ,OAAO,GAAG,0CAA0C;GAC5F,MAAM,CAAC,QAAQ,QAAQ,gBAAgB,OAAO,QAAQ,KAAK,GAAG;EAChE,CAAC;EAED,KAAK,2DAA2D,OAAO,SAAS,SAAS;GACvF,MAAM,OAAO,MAAM,QAAQ,KAAK;GAChC,MAAM,QAAQ,KAAK,WAAW;GAC9B,MAAM,WAAW,KAAK,MAAM,IAAI,IAAI;GACpC,MAAM,UAAU,MAAM,cAAc,QAAQ,KAAK,MAAM,UAAU,IAAI,gBAAgB,CAAC,CAAC,MAAM,CAAC,CAAC;GAC/F,MAAM,KAAK,KAAK,MAAM,CAAC;GACvB,MAAM,MAAM;GACZ,MAAM,CAAC,QAAQ,SAAS,2DAA2D;GACnF,MAAM,KAAK,QAAQ;GACnB,MAAM,MAAM,OAAO,aAAa,QAAQ,OAAO,GAAG,4CAA4C;GAC9F,MAAM,CAAC,QAAQ,QAAQ,gBAAgB,OAAO,QAAQ,KAAK,GAAG;GAC9D,MAAM,KAAK,MAAM,IAAI,IAAI,UAAU,2DAA2D;EAChG,CAAC;EAED,KAAK,mEAAmE,OAAO,SAAS,MAAM,UAAU;GACtG,MAAM,QAAQ,KAAK;GACnB,MAAM,QAAQ,KAAK,WAAW;GAC9B,MAAM,QAAQ,QAAQ;GACtB,MAAM,WAAW,KAAK,MAAM,IAAI,IAAI;GACpC,MAAM,UAAU,MAAM,cAAc,QAAQ,KAAK,MAAM,UAAU,IAAI,gBAAgB,CAAC,CAAC,MAAM,CAAC,CAAC;GAC/F,IAAI,MAAM;IACR,MAAM,KAAK,KAAK,MAAM,CAAC;IACvB,MAAM,MAAM;IACZ,MAAM,CAAC,QAAQ,SAAS,sDAAsD;IAC9E,MAAM,KAAK,KAAK,CAAC;IACjB,MAAM,MAAM,OAAO,aAAa,QAAQ,OAAO,GAAG,mCAAmC;GACvF,OAAO;IACL,MAAM,QAAQ,MAAM,OAAO,MAAM,aAAa,QAAQ,OAAO;IAC7D,MAAM,OAAO,QAAQ,IAAI;IACzB,QAAQ,SAAS;KAAE,MAAM;KAAO,MAAM;KAAyB,UAAU;KAAK,UAAU;IAAK,CAAC;IAC9F,MAAM,OAAO,wBAAwB,MAAM,MAAM,0BAA0B,IAAI,IAAI;IACnF,MAAM,QAAQ,MAAM,OAAO,qBAAqB,KAAK,MAAM,IAAI,EAAE,8BAA8B,IAAI,IAAI;GACzG;GACA,MAAM,CAAC,QAAQ,QAAQ,gCAAgC,OAAO,QAAQ,KAAK,GAAG;EAChF,CAAC;EAED,GAAI,cACA,CACE,KAAK,2DAA2D,OAAO,SAAS,SAAS;GACvF,MAAM,OAAO,MAAM,QAAQ,KAAK;GAChC,MAAM,QAAQ,KAAK,WAAW;GAC9B,MAAM,QAAQ,IAAI,gBAAgB;GAClC,MAAM,UAAU,MAAM,cAAc,QAAQ,KAAK,MAAM,KAAK,MAAM,IAAI,IAAI,KAAK,MAAM,MAAM,CAAC,CAAC;GAC7F,MAAM,KAAK,KAAK,MAAM,CAAC;GACvB,MAAM,MAAM;GACZ,MAAM,CAAC,KAAK,SAAS,8DAA8D;GACnF,MAAM,sBAAM,IAAI,MAAM,8CAA8C,CAAC;GACrE,MAAM,MAAM,OAAO,aAAa,KAAK,OAAO,GAAG,4CAA4C;GAC3F,MAAM,KAAK,KAAK,MAAM,CAAC;GACvB,MAAM,MAAM,OAAO,aAAa,QAAQ,OAAO,GAAG,+DAA+D;GACjH,MAAM,CAAC,QAAQ,QAAQ,4CAA4C,OAAO,QAAQ,KAAK,GAAG;EAC5F,CAAC,CACH,IACA,CAAC;EAEL,KAAK,wEAAwE,OAAO,SAAS,SAAS;GACpG,MAAM,OAAO,MAAM,QAAQ,KAAK;GAChC,MAAM,QAAQ,KAAK,WAAW;GAC9B,MAAM,QAAQ,IAAI,gBAAgB;GAClC,MAAM,sBAAM,IAAI,MAAM,8CAA8C,CAAC;GACrE,MAAM,UAAU,MAAM,cAAc,QAAQ,KAAK,MAAM,KAAK,MAAM,IAAI,IAAI,GAAG,MAAM,MAAM,CAAC,CAAC;GAC3F,MAAM,MAAM,OAAO,aAAa,QAAQ,OAAO,GAAG,yDAAyD;GAC3G,MAAM,CAAC,QAAQ,QAAQ,gBAAgB,OAAO,QAAQ,KAAK,GAAG;GAC9D,IAAI,aAAa,MAAM,MAAM,OAAO,aAAa,KAAK,OAAO,GAAG,0DAA0D;EAC5H,CAAC;EAED,KAAK,+CAA+C,OAAO,SAAS,OAAO,UAAU;GACnF,KAAK,IAAI,KAAK,GAAG,KAAK,OAAO,MAAM,GAAG,MAAM,QAAQ,KAAK;GACzD,MAAM,MAAM,SAAS,OAAO,0CAA0C;GACtE,MAAM,OAAO,SAAS,KAAK;GAC3B,MAAM,MAAM,SAAS,GAAG,2BAA2B;EACrD,CAAC;EAED,KAAK,qDAAqD,OAAO,SAAS,OAAO,UAAU;GACzF,MAAM,QAAQ,KAAK;GACnB,MAAM,QAAQ,MAAM,cAAc,QAAQ,KAAK,MAAM,CAAC,CAAC;GACvD,MAAM,SAAS,MAAM,cAAc,QAAQ,KAAK,MAAM,CAAC,CAAC;GACxD,MAAM,MAAM,OAAO,kBAAkB,MAAM,WAAW,OAAO,OAAO,GAAG,qCAAqC;GAC5G,MAAM,CAAC,MAAM,UAAU,CAAC,OAAO,QAAQ,kBAAkB,OAAO,MAAM,SAAS,OAAO,KAAK,GAAG;GAC9F,MAAM,OAAO,SAAS,KAAK;GAC3B,MAAM,MAAM,SAAS,GAAG,gCAAgC;EAC1D,CAAC;EAED,KAAK,iDAAiD,OAAO,SAAS,OAAO,UAAU;GACrF,MAAM,OAAO,SAAS,KAAK;GAC3B,MAAM,QAAQ,KAAK,SAAS,MAAM,GAAG,gDAAgD;EACvF,CAAC;EAED,KAAK,sFAAsF,OAAO,SAAS,MAAM,UAAU;GACzH,MAAM,QAAQ,MAAM,QAAQ,KAAK;GACjC,MAAM,OAAO,MAAM,QAAQ,KAAK;GAChC,MAAM,QAAQ,KAAK,WAAW;GAC9B,MAAM,CAAE,MAAM,QAAQ,MAAM,GAAI,8CAA8C;GAC9E,MAAM,QAAQ,IAAI,gBAAgB;GAClC,MAAM,UAAU,MAAM,cAAc,QAAQ,KAAK,MAAM,KAAK,MAAM,IAAI,IAAI,KAAK,MAAM,MAAM,CAAC,CAAC;GAC7F,MAAM,MAAM,QAAQ;GACpB,MAAM,MAAM,SAAS,GAAG,6BAA6B;GACrD,MAAM,KAAK,KAAK,MAAM,CAAC;GACvB,MAAM,sBAAM,IAAI,MAAM,8CAA8C,CAAC;GACrE,IAAI,aAAa,MAAM,MAAM,OAAO,aAAa,KAAK,OAAO,GAAG,iDAAiD;GACjH,MAAM,KAAK,KAAK,MAAM,CAAC;GACvB,MAAM,MAAM,OAAO,aAAa,QAAQ,OAAO,GAAG,mCAAmC;GACrF,MAAM,OAAO,SAAS,KAAK;GAC3B,MAAM,MAAM,SAAS,GAAG,2BAA2B;EACrD,CAAC;CAEQ;AACb;;;;AC9SA,MAAa,iBAAiB,WAAqB,SAAwB;CACzE,IAAI,QAAQ;CACZ,MAAM,uBAAO,IAAI,IAAgB;CACjC,MAAM,SAAwB;EAC5B;EACA,IAAI,QAAQ;GACV,OAAO;EACT;EACA,IAAI,OAAO;GACT,OAAO,KAAK;EACd;EACA,OAAO;GACL,KAAK,MAAM,OAAO,CAAC,GAAG,IAAI,GAAG,IAAI;EACnC;EACA,MAAM,WAAW;GACf,SAAS;GACT,MAAM,MAAM,OAAO;GACnB,IAAI,QAAQ,SAAS,MAAM,IAAI,MAAM,0BAA0B;GAC/D,IAAI,QAAQ,WACV,OAAO,IAAI,SAAkB,GAAG,WAC9B,OAAO,iBAAiB,eAAe,uBAAO,IAAI,MAAM,wBAAwB,CAAC,CAAC,CACpF;GACF,IAAI,QAAQ,QACV,OAAO,IAAI,SAAkB,YAAY;IACvC,MAAM,YAAkB;KACtB,KAAK,OAAO,GAAG;KACf,QAAQ,IAAI;IACd;IACA,KAAK,IAAI,GAAG;GACd,CAAC;GACH,OAAO;EACT;CACF;CACA,OAAO;AACT;;AAaA,MAAa,mBAA+B;CAC1C,MAAM,UAAsB,CAAC;CAC7B,OAAO;EACL;EACA,IAAI,OAAO,SAAS,QAAQ;GAC1B,QAAQ,KAAK;IAAE;IAAO;IAAS;GAAO,CAAC;EACzC;EACA,WAAW,UAAU,QAAQ,QAAQ,UAAU,UAAU,KAAA,KAAa,MAAM,UAAU,KAAK,CAAC,CAAC,KAAK,UAAU,MAAM,OAAO;EACzH,QAAQ;GACN,QAAQ,SAAS;EACnB;CACF;AACF;;;;;;AAmBA,MAAa,cAAc,YAAkC;CAC3D,IAAI,SAAS;CACb,MAAM,0BAAU,IAAI,IAAY;CAChC,MAAM,SAAiB,cAAc,WAAW;EAC9C,QAAQ,IAAI,MAAM;EAClB,OAAO,GAAG,eAAe,QAAQ,OAAO,MAAM,CAAC;EAC/C,OAAO,GAAG,eAAe,QAAQ,OAAO,MAAM,CAAC;EAC/C,OAAO,GAAG,SAAS,UAAU;GAC3B,IAAI,CAAC,QAAQ,OAAO,MAAM,KAAK;EACjC,CAAC;CACH,CAAC;CACD,MAAM,IAAI,SAAe,SAAS,WAAW;EAC3C,OAAO,KAAK,SAAS,MAAM;EAC3B,OAAO,OAAO,GAAG,mBAAmB,QAAQ,CAAC;CAC/C,CAAC;CACD,OAAO;EACL,MAAO,OAAO,QAAQ,CAAC,CAAiB;EACxC,aAAa;GACX,SAAS;EACX;EACA,aAAa;GACX,SAAS;EACX;EACA,IAAI,cAAc;GAChB,OAAO,QAAQ;EACjB;EACA,aACE,IAAI,SAAe,YAAY;GAC7B,KAAK,MAAM,UAAU,SAAS,OAAO,QAAQ;GAC7C,OAAO,YAAY,QAAQ,CAAC;EAC9B,CAAC;CACL;AACF"}
|
|
1
|
+
{"version":3,"file":"testing.js","names":[],"sources":["../src/fakes.ts","../src/contract.ts","../src/conformance.ts","../src/testing.ts"],"sourcesContent":["// The fakes of the runtime for tests: a fake clock gives exact, repeatable timing, a seeded random\n// gives the same jitter on each run, and a fake process takes signals and keeps the exit codes.\n\nimport type { Cancel, Clock } from \"./clock.ts\";\nimport type { ExitSignal, ExitTrigger, ProcessPort, UncaughtOrigin } from \"./process.ts\";\n\n/** A fake clock moves only when a test tells it to. */\nexport interface FakeClock extends Clock {\n /** This method moves the clock forward by `ms`, and it starts each timer that comes due, in sequence. */\n advance(ms: number): Promise<void>;\n /**\n * This method moves the clock forward by `ms` and starts no timer, as a blocked event loop does.\n * The next `advance` then starts each timer that came due during the block, late.\n */\n block(ms: number): void;\n /** This count is the number of timers that are not stopped and not called. */\n readonly pending: number;\n}\n\n/** This function lets the promises that are ready continue, before the clock moves again. */\nconst settle = async (): Promise<void> => {\n for (let turn = 0; turn < 64; turn += 1) await Promise.resolve();\n};\n\n/** This function makes a fake clock. Its time starts at `start` milliseconds. */\nexport const fakeClock = (start = 0): FakeClock => {\n let now = start;\n let sequence = 0;\n const timers: Array<{ at: number; order: number; run: () => void; live: boolean }> = [];\n const due = (end: number) => {\n let best: (typeof timers)[number] | undefined;\n for (const timer of timers)\n if (timer.live && timer.at <= end && (best === undefined || timer.at < best.at || (timer.at === best.at && timer.order < best.order)))\n best = timer;\n return best;\n };\n return {\n now: () => now,\n after(ms, run): Cancel {\n const timer = { at: now + Math.max(0, ms), order: sequence++, run, live: true };\n timers.push(timer);\n return () => {\n timer.live = false;\n };\n },\n async advance(ms) {\n // a monotonic clock does not go back\n const end = now + Math.max(0, ms);\n await settle();\n for (;;) {\n const timer = due(end);\n if (timer === undefined) break;\n timer.live = false;\n // a timer that came due during a block runs late, at the time of the clock\n now = Math.max(now, timer.at);\n timer.run();\n await settle();\n }\n now = Math.max(now, end);\n for (let at = timers.length - 1; at >= 0; at -= 1) if (!timers[at]!.live) timers.splice(at, 1);\n await settle();\n },\n block(ms) {\n now += Math.max(0, ms);\n },\n get pending() {\n return timers.filter((timer) => timer.live).length;\n },\n };\n};\n\n/** A fake process receives triggers from a test, and keeps each exit code in place of an exit. */\nexport interface FakeProcess extends ProcessPort {\n /** This method sends a signal to each handler of it. */\n signal(name: ExitSignal): void;\n /** This method sends a trigger to each handler of it: a signal, or a process trigger, for example `stdin-close`. */\n trigger(name: ExitTrigger): void;\n /** This method sends a message of the IPC channel to each handler of the trigger `ipc-message`. */\n message(value: unknown): void;\n /** This method sends an error that no code caught to each handler of `onUncaught`. The default origin is `uncaughtException`. */\n uncaught(error: unknown, origin?: UncaughtOrigin): void;\n /** These are the exit codes, in sequence. A correct runtime exits one time. */\n readonly exits: readonly number[];\n /** This count is the number of handlers that are registered. */\n readonly handlers: number;\n /** These are the triggers that have a handler, in the sequence of their first handler. */\n readonly triggers: readonly ExitTrigger[];\n /** These are the times of the clock of the options at each flush and each exit, when the options give a clock. */\n readonly log: readonly string[];\n /** This count is the number of flushes of the output. */\n readonly flushes: number;\n /** This count is the number of holds of the process that are not released. */\n readonly holds: number;\n /** These counts are the holds that were not released at each exit, in sequence. */\n readonly heldAtExit: readonly number[];\n}\n\n/** These options shape a fake process. */\nexport interface FakeProcessOptions {\n /** This function is the flush of the output, for example a wait on a fake clock. Without it, a flush ends at once. */\n readonly flush?: (() => Promise<void> | void) | undefined;\n /** This clock stamps each line of the log. */\n readonly clock?: Clock | undefined;\n}\n\n/** This function makes a fake process. */\nexport const fakeProcess = (options: FakeProcessOptions = {}): FakeProcess => {\n const handlers = new Map<ExitTrigger, Set<(message?: unknown) => void>>();\n const uncaughtHandlers = new Set<(error: unknown, origin: UncaughtOrigin) => void>();\n const exits: number[] = [];\n const log: string[] = [];\n let flushes = 0;\n let holds = 0;\n const heldAtExit: number[] = [];\n const stamp = (what: string): void => {\n log.push(options.clock === undefined ? what : `${options.clock.now()} ${what}`);\n };\n const send = (name: ExitTrigger, message?: unknown): void => {\n for (const handler of [...(handlers.get(name) ?? [])]) handler(message);\n };\n return {\n on(trigger, handler) {\n const set = handlers.get(trigger) ?? new Set();\n set.add(handler);\n handlers.set(trigger, set);\n return () => {\n set.delete(handler);\n };\n },\n onUncaught(handler) {\n // each registration is a handler of its own, as with `on`\n const own = (error: unknown, origin: UncaughtOrigin): void => handler(error, origin);\n uncaughtHandlers.add(own);\n return () => {\n uncaughtHandlers.delete(own);\n };\n },\n async flush() {\n stamp(\"flush\");\n await options.flush?.();\n flushes += 1;\n stamp(\"flushed\");\n },\n hold() {\n holds += 1;\n let held = true;\n return () => {\n if (!held) return;\n held = false;\n holds -= 1;\n };\n },\n exit(code) {\n stamp(`exit ${code}`);\n heldAtExit.push(holds);\n exits.push(code);\n },\n signal: (name) => send(name),\n trigger: (name) => send(name),\n message: (value) => send(\"ipc-message\", value),\n uncaught: (error, origin = \"uncaughtException\") => {\n for (const handler of [...uncaughtHandlers]) handler(error, origin);\n },\n get exits() {\n return [...exits];\n },\n get handlers() {\n let count = uncaughtHandlers.size;\n for (const set of handlers.values()) count += set.size;\n return count;\n },\n get triggers() {\n return [...handlers.keys()];\n },\n get log() {\n return [...log];\n },\n get flushes() {\n return flushes;\n },\n get holds() {\n return holds;\n },\n get heldAtExit() {\n return [...heldAtExit];\n },\n };\n};\n\n/** This function gives a seeded random number generator (mulberry32), with numbers in [0, 1). */\nexport const seeded = (seed: number): (() => number) => {\n let state = seed >>> 0;\n return () => {\n state = (state + 0x6d2b79f5) >>> 0;\n let t = state;\n t = Math.imul(t ^ (t >>> 15), t | 1);\n t ^= t + Math.imul(t ^ (t >>> 7), t | 61);\n return ((t ^ (t >>> 14)) >>> 0) / 4294967296;\n };\n};\n","import { valueIn } from \"@mark1russell7/quantity\";\nimport type { ServiceBuilder } from \"./builder.ts\";\nimport type { Check, ServiceDescription } from \"./description.ts\";\nimport type { FakeClock } from \"./fakes.ts\";\nimport { fakeClock, seeded } from \"./fakes.ts\";\nimport type { Health, HealthVerdict, StartOptions } from \"./health.ts\";\nimport { failSpan, recoverSpan } from \"./timing.ts\";\n\n/** A contract case is one generated case of the contract test of a declaration. It throws on a failure. */\nexport interface ContractCase {\n readonly name: string;\n run(): Promise<void>;\n}\n\n/** These options tune the contract test. */\nexport interface ContractOptions {\n /** This number is the latency that a degraded dependency adds to each check, in milliseconds. The default of the contract is 100. */\n readonly degradeBy?: number | undefined;\n /** This number is the seed of the jitter. */\n readonly seed?: number | undefined;\n}\n\nconst ms = (amount: { readonly value: number; readonly unit: string }): number => valueIn(amount, \"ms\");\n\n/** The part of a verdict that the contract compares: what a caller and the platform see. */\nconst visible = (verdict: HealthVerdict) => ({\n ready: verdict.ready,\n alive: verdict.alive,\n controllers: verdict.controllers,\n dependencies: verdict.dependencies,\n});\n\nconst same = (expected: unknown, actual: unknown): boolean => JSON.stringify(expected) === JSON.stringify(actual);\n\nconst failure = (what: string, expected: unknown, actual: unknown): Error =>\n new Error(`${what}: expected ${JSON.stringify(expected)}, but the verdict was ${JSON.stringify(actual)}`);\n\n/**\n * This function generates the contract test of a declaration. `declare` gives a new builder with\n * the declaration and the function of each check, each time. The checks must pass at rest. The\n * cases are:\n * - The service at rest: each controller and each dependency is ready, and the service is alive.\n * - Each dependency unavailable: its polls fail at once (the force-fail list). The dependency and\n * each controller that needs it become not ready, and the other controllers stay ready. Liveness\n * stays, unless a liveness check exercises the dependency.\n * - Each dependency degraded: each call of its checks takes the latency longer. Nothing can fail.\n * - Each dependency recovers: after it is unavailable, the service is again at rest.\n * - A negative control: a client that the declaration does not name fails, and nothing changes.\n *\n * A dependency that no check exercises is a finding: the service cannot see it fail.\n */\nexport const contractCases = (declare: () => ServiceBuilder, options: ContractOptions = {}): ContractCase[] => {\n const degradeBy = options.degradeBy ?? 100;\n const seed = options.seed ?? 1;\n const description: ServiceDescription = declare().describe();\n const service = description.name;\n const gating = description.checks.filter((check) => check.gates !== null);\n const timingOf = (check: Check) => description.policies[check.gates!];\n const failMax = (check: Check): number => ms(failSpan(timingOf(check), check.poll, \"error\").max);\n const recoverMax = (check: Check): number => ms(recoverSpan(timingOf(check), check.poll).max);\n const most = (values: readonly number[]): number => values.reduce((a, b) => Math.max(a, b), 0);\n const settleTime = most(gating.filter((check) => check.gates === \"readiness\").map(recoverMax)) + 1;\n const quietTime = most(gating.map(failMax)) + 1;\n\n /** This function starts the declaration on a fake clock, and moves it to rest. */\n const boot = async (\n extra: (clock: FakeClock) => Partial<StartOptions> = () => ({}),\n ): Promise<{ health: Health; clock: FakeClock; rest: ReturnType<typeof visible> }> => {\n const clock = fakeClock();\n // the warm-up sweep can wait on the clock (a degraded check), thus the clock moves while it starts\n const starting = declare().start({ clock, random: seeded(seed), ...extra(clock) });\n let started = false;\n void starting.then(\n () => (started = true),\n () => (started = true),\n );\n for (let step = 0; step < 1000 && !started; step += 1) await clock.advance(10);\n const health = await starting;\n await clock.advance(settleTime);\n return { health, clock, rest: visible(health.verdict()) };\n };\n const stop = (health: Health): void => health.stop();\n\n const cases: ContractCase[] = [\n {\n name: `${service}: at rest, each controller and each dependency is ready, and the service is alive`,\n async run() {\n const { health, rest } = await boot();\n try {\n const expected = {\n ready: true,\n alive: true,\n controllers: Object.fromEntries(description.controllers.map((each) => [each.name, true])),\n dependencies: Object.fromEntries(description.dependencies.map((each) => [each.name, true])),\n };\n if (!same(expected, rest)) throw failure(\"at rest\", expected, rest);\n } finally {\n stop(health);\n }\n },\n },\n ];\n\n for (const dependency of description.dependencies) {\n const on = gating.filter((check) => check.dependency === dependency.name);\n const readiness = on.filter((check) => check.gates === \"readiness\");\n const liveness = on.filter((check) => check.gates === \"liveness\");\n const unavailable = (rest: ReturnType<typeof visible>) => ({\n ready: readiness.length === 0 ? rest.ready : false,\n alive: liveness.length === 0 ? rest.alive : false,\n controllers: Object.fromEntries(\n description.controllers.map((each) => [\n each.name,\n each.requires.includes(dependency.name) && readiness.length > 0 ? false : rest.controllers[each.name],\n ]),\n ),\n dependencies: { ...rest.dependencies, [dependency.name]: readiness.length === 0 },\n });\n\n cases.push({\n name: `${service}: ${dependency.name} unavailable`,\n async run() {\n if (on.length === 0)\n throw new Error(`no check that gates a policy exercises ${dependency.name}: the service cannot see it fail`);\n const { health, clock, rest } = await boot();\n try {\n health.forceFail(dependency.name, true);\n await clock.advance(most(on.map(failMax)) + 1);\n const now = visible(health.verdict());\n const expected = unavailable(rest);\n if (!same(expected, now)) throw failure(`${dependency.name} unavailable`, expected, now);\n } finally {\n stop(health);\n }\n },\n });\n\n cases.push({\n name: `${service}: ${dependency.name} degraded by ${degradeBy} ms, and nothing fails`,\n async run() {\n const tight = on.filter((check) => ms(check.poll.timeout) <= degradeBy);\n if (tight.length > 0)\n throw new Error(\n `${tight.map((check) => `${check.name} times out in ${ms(check.poll.timeout)} ms`).join(\", \")}: a latency of ${degradeBy} ms fails it`,\n );\n const { health, clock, rest } = await boot((at) => ({\n wrapCheck: (check, run) =>\n check.dependency !== dependency.name\n ? run\n : (signal) => new Promise((resolve) => at.after(degradeBy, () => resolve(run(signal)))),\n }));\n try {\n await clock.advance(quietTime + most(on.map((check) => ms(check.poll.interval))));\n const now = visible(health.verdict());\n if (!same(rest, now)) throw failure(`${dependency.name} degraded`, rest, now);\n } finally {\n stop(health);\n }\n },\n });\n\n cases.push({\n name: `${service}: ${dependency.name} recovers`,\n async run() {\n if (on.length === 0)\n throw new Error(`no check that gates a policy exercises ${dependency.name}: the service cannot see it recover`);\n const { health, clock, rest } = await boot();\n try {\n health.forceFail(dependency.name, true);\n await clock.advance(most(on.map(failMax)) + 1);\n health.forceFail(dependency.name, false);\n await clock.advance(most(on.map(recoverMax)) + 1);\n const now = visible(health.verdict());\n if (!same(rest, now)) throw failure(`${dependency.name} recovered`, rest, now);\n } finally {\n stop(health);\n }\n },\n });\n }\n\n const never = `${service}.client-never-registered`;\n cases.push({\n name: `${service}: a client never registered fails, and nothing changes (the negative control)`,\n async run() {\n if (description.dependencies.some((each) => each.name === never))\n throw new Error(`the declaration has a dependency named ${never}`);\n const { health, clock, rest } = await boot();\n try {\n health.forceFail(never, true);\n await clock.advance(quietTime);\n const now = visible(health.verdict());\n if (!same(rest, now)) throw failure(\"the negative control\", rest, now);\n } finally {\n stop(health);\n }\n // and a check on a client never registered is refused before the start\n let refused = false;\n try {\n declare()\n .check({\n name: `${never}.check`,\n dependency: never,\n step: \"round-trip\",\n ownConnection: true,\n gates: null,\n poll: gating[0]?.poll ?? { interval: { value: 1, unit: \"s\" }, jitter: 0, timeout: { value: 0.5, unit: \"s\" } },\n })\n .describe();\n } catch {\n refused = true;\n }\n if (!refused) throw new Error(`the declaration accepted a check on ${never}, which is not a dependency`);\n },\n });\n\n return cases;\n};\n","import type { Clock } from \"./clock.ts\";\nimport { realClock } from \"./clock.ts\";\nimport type { ContractCase } from \"./contract.ts\";\nimport { fakeClock } from \"./fakes.ts\";\nimport type { Health } from \"./health.ts\";\nimport type { Lifecycle, TransportImpl } from \"./lifecycle.ts\";\n\n/** A held work is one unit of work that stays in flight until the test releases it. */\nexport interface HeldWork {\n /** This method lets the work end. Its promise ends when the caller of the work has its answer, or its error. */\n release(): Promise<void>;\n /** This flag tells if the work got the cooperative abort of the drain. */\n readonly aborted: boolean;\n}\n\n/**\n * A transport subject is a transport and the client side of its work. The kit offers work through\n * it, holds work in flight through it, and reads the count of the transport.\n */\nexport interface TransportSubject {\n readonly impl: TransportImpl;\n /** This lifecycle goes to `start()`. Without it, the kit gives a detached lifecycle. */\n readonly life?: Lifecycle | undefined;\n /** This method offers one unit of new work. It gives true when the transport took it, and false when it refused it. */\n offer(): Promise<boolean>;\n /** This method starts one unit of work that stays in flight until its release. The promise ends when the transport has it. */\n hold(): Promise<HeldWork>;\n /** This method frees what the subject holds outside the transport: its clients and their sockets. */\n dispose?(): Promise<void> | void;\n}\n\n/**\n * This function gives a detached lifecycle: a lifecycle with no service, for the start of a\n * transport in a test. Its state is `running`, it keeps each connection, and nothing is in flight. Each request\n * and each use of its health throws, because no service declares a route.\n */\nexport const detachedLifecycle = (): Lifecycle => {\n const none = (): never => {\n throw new Error(\"a detached lifecycle has no service: give the transport the lifecycle of a service\");\n };\n const health = { verdict: none, probe: none, metrics: none, subscribe: none, forceFail: none, drain: none, stop: none } as Health;\n return {\n health,\n state: \"running\",\n exitCode: null,\n errors: [],\n started: Promise.resolve(),\n done: new Promise<number>(() => {}),\n signal: new AbortController().signal,\n shutdown: none,\n request: none,\n inFlight: () => 0,\n keepAlive: () => true,\n };\n};\n\n/** A subject factory makes a new subject for each case, on the clock of the case. */\nexport type SubjectFactory = (clock: Clock) => TransportSubject | Promise<TransportSubject>;\n\n/** A conformance record is one measurement of a case, for the raw records of a run in CI. */\nexport interface ConformanceRecord {\n readonly case: string;\n readonly what: string;\n /** This time is the limit of the contract, in milliseconds. */\n readonly expected: number;\n /** This time is what the case measured, in milliseconds of the real clock. */\n readonly measured: number;\n}\n\n/** These options tune the conformance kit. */\nexport interface ConformanceOptions {\n /** This name goes before the name of each case. */\n readonly name?: string | undefined;\n /** This clock moves the cases: `fake` gives exact and fast cases, and `real` measures the timing. The default is `fake`. */\n readonly clock?: \"fake\" | \"real\" | undefined;\n /** This time is the cap of each drain of the cases, in milliseconds. The default is 1000. */\n readonly cap?: number | undefined;\n /** This time is the most that a close can take, in milliseconds of the real clock. The default is 1000. */\n readonly closeBound?: number | undefined;\n /** This time is the most that an event can take to reach the transport, in real milliseconds. The default is 100. */\n readonly slack?: number | undefined;\n /** False tells that the work of the transport cannot see the cooperative abort. The default is true. */\n readonly cooperative?: boolean | undefined;\n /** This count is the number of works that the count case holds. The default is 3. */\n readonly holds?: number | undefined;\n /** This function receives each measurement, for the raw records of a run. */\n readonly record?: ((record: ConformanceRecord) => void) | undefined;\n}\n\ninterface Time {\n readonly clock: Clock;\n pass(ms: number): Promise<void>;\n}\n\ninterface Tracked {\n readonly settled: boolean;\n readonly error: unknown;\n readonly failed: boolean;\n}\n\nconst realNow = (): number => performance.now();\nconst turn = (): Promise<void> => new Promise((resolve) => setTimeout(resolve, 0));\nconst sleep = (ms: number): Promise<void> => new Promise((resolve) => setTimeout(resolve, ms));\n\n/** This function waits on the real clock, until the test is true or the bound ends. It gives the test at the end. */\nconst within = async (bound: number, test: () => boolean): Promise<boolean> => {\n const end = realNow() + bound;\n for (;;) {\n if (test()) return true;\n if (realNow() > end) return test();\n await turn();\n }\n};\n\n/** This function lets the events that are ready reach the transport, with no move of the clock of the case. */\nconst quiet = async (): Promise<void> => {\n for (let at = 0; at < 8; at += 1) await turn();\n};\n\n/** This function uses a method of the transport, and gives a throw of the method as a rejection. */\nconst attempt = (call: () => Promise<void> | void): Promise<void> => {\n try {\n return Promise.resolve(call());\n } catch (error) {\n return Promise.reject(error);\n }\n};\n\nconst track = (promise: Promise<unknown>): Tracked => {\n const state = { settled: false, error: undefined as unknown, failed: false };\n promise.then(\n () => {\n state.settled = true;\n },\n (error: unknown) => {\n state.settled = true;\n state.failed = true;\n state.error = error;\n },\n );\n return state;\n};\n\n/**\n * This function generates the conformance cases of a transport (S6 A9). `make` gives a new subject\n * for each case. Each case throws on a failure, and its message names the part of the contract.\n * - The start: nothing is in flight, and the transport takes work.\n * - The count: it follows each work from its events, with no move of the clock.\n * - `stopIntake` refuses new work, keeps the work in flight, and a second stop has no effect.\n * - `drain` ends at once with no work, ends with the last work, and holds to its deadline and not\n * past it. It gives the cooperative abort to the work, and it does not throw.\n * - `close` ends the work in flight in its bound, and a second close has no effect.\n * - The stages in their sequence, as the lifecycle does them.\n */\nexport const transportConformance = (make: SubjectFactory, options: ConformanceOptions = {}): ContractCase[] => {\n const name = options.name ?? \"transport\";\n const fake = (options.clock ?? \"fake\") === \"fake\";\n const cap = options.cap ?? 1000;\n const closeBound = options.closeBound ?? 1000;\n const slack = options.slack ?? 100;\n const cooperative = options.cooperative ?? true;\n const holds = options.holds ?? 3;\n\n const timeOf = (): Time => {\n if (!fake) return { clock: realClock, pass: sleep };\n const clock = fakeClock();\n return { clock, pass: (ms) => clock.advance(ms) };\n };\n\n const check = (ok: boolean, what: string): void => {\n if (!ok) throw new Error(`${name}: ${what}`);\n };\n\n const each = (title: string, body: (subject: TransportSubject, time: Time, title: string) => Promise<void>): ContractCase => ({\n name: `${name}: ${title}`,\n async run() {\n const time = timeOf();\n const subject = await make(time.clock);\n try {\n await subject.impl.start(new AbortController().signal, subject.life ?? detachedLifecycle());\n await body(subject, time, title);\n } finally {\n try {\n await subject.impl.close();\n } finally {\n await subject.dispose?.();\n }\n }\n },\n });\n\n const count = (subject: TransportSubject, expected: number, what: string): Promise<void> =>\n within(slack, () => subject.impl.inFlight() === expected).then((ok) =>\n check(ok, `${what}: inFlight() gives ${subject.impl.inFlight()}, not ${expected}`),\n );\n\n const closes = async (subject: TransportSubject, title: string): Promise<void> => {\n const began = realNow();\n const closed = track(attempt(() => subject.impl.close()));\n const inBound = await within(closeBound, () => closed.settled);\n const took = realNow() - began;\n options.record?.({ case: title, what: \"close\", expected: closeBound, measured: took });\n check(inBound, `close did not end in its bound of ${closeBound} ms`);\n check(!closed.failed, `close threw: ${String(closed.error)}`);\n };\n\n const cases: ContractCase[] = [\n each(\"nothing is in flight after the start, and it takes new work\", async (subject) => {\n check(subject.impl.inFlight() === 0, `inFlight() gives ${subject.impl.inFlight()} after the start, not 0`);\n check(await subject.offer(), \"the transport refused new work after its start\");\n await count(subject, 0, \"the work ended\");\n }),\n\n each(\"the count follows each work in flight from its events, with no move of the clock\", async (subject) => {\n const held: HeldWork[] = [];\n for (let at = 1; at <= holds; at += 1) {\n held.push(await subject.hold());\n await count(subject, at, `${at} works are in flight`);\n }\n for (let at = holds - 1; at >= 0; at -= 1) {\n await held[at]!.release();\n await count(subject, at, `${at} works are in flight after a release`);\n }\n }),\n\n each(\"stopIntake refuses new work, keeps the work in flight, and a second stop has no effect\", async (subject) => {\n const work = await subject.hold();\n await subject.impl.stopIntake();\n check(!(await subject.offer()), \"the transport took new work after stopIntake\");\n await count(subject, 1, \"stopIntake cut the work in flight\");\n await subject.impl.stopIntake();\n check(!(await subject.offer()), \"the transport took new work after a second stopIntake\");\n await work.release();\n await count(subject, 0, \"the work in flight ended after stopIntake\");\n }),\n\n each(\"drain ends at once when nothing is in flight\", async (subject, time) => {\n await subject.impl.stopIntake();\n const drained = track(attempt(() => subject.impl.drain(time.clock.now() + cap, new AbortController().signal)));\n check(await within(slack, () => drained.settled), \"drain did not end with nothing in flight\");\n check(!drained.failed, `drain threw: ${String(drained.error)}`);\n }),\n\n each(\"drain ends when the last work ends, before its deadline\", async (subject, time) => {\n const work = await subject.hold();\n await subject.impl.stopIntake();\n const deadline = time.clock.now() + cap;\n const drained = track(attempt(() => subject.impl.drain(deadline, new AbortController().signal)));\n await time.pass(cap / 4);\n await quiet();\n check(!drained.settled, \"drain ended while work was in flight, before its deadline\");\n await work.release();\n check(await within(slack, () => drained.settled), \"drain did not end when the last work ended\");\n check(!drained.failed, `drain threw: ${String(drained.error)}`);\n check(time.clock.now() < deadline, \"drain waited until its deadline after the last work ended\");\n }),\n\n each(\"drain holds to its deadline and not past it, and does not throw\", async (subject, time, title) => {\n await subject.hold();\n await subject.impl.stopIntake();\n const began = realNow();\n const deadline = time.clock.now() + cap;\n const drained = track(attempt(() => subject.impl.drain(deadline, new AbortController().signal)));\n if (fake) {\n await time.pass(cap - 1);\n await quiet();\n check(!drained.settled, \"drain ended before its deadline, with work in flight\");\n await time.pass(1);\n check(await within(slack, () => drained.settled), \"drain did not end at its deadline\");\n } else {\n const ended = await within(cap + slack, () => drained.settled);\n const took = realNow() - began;\n options.record?.({ case: title, what: \"drain to its deadline\", expected: cap, measured: took });\n check(ended, `drain did not end in ${cap + slack} ms, with a deadline at ${cap} ms`);\n check(took >= cap - slack, `drain ended after ${Math.round(took)} ms, before its deadline at ${cap} ms`);\n }\n check(!drained.failed, `drain threw at its deadline: ${String(drained.error)}`);\n }),\n\n ...(cooperative\n ? [\n each(\"drain gives the cooperative abort to the work in flight\", async (subject, time) => {\n const work = await subject.hold();\n await subject.impl.stopIntake();\n const abort = new AbortController();\n const drained = track(attempt(() => subject.impl.drain(time.clock.now() + cap, abort.signal)));\n await time.pass(cap / 2);\n await quiet();\n check(!work.aborted, \"the work got an abort before the signal of the drain aborted\");\n abort.abort(new Error(\"the cooperative abort of the conformance kit\"));\n check(await within(slack, () => work.aborted), \"the work did not get the cooperative abort\");\n await time.pass(cap / 2);\n check(await within(slack, () => drained.settled), \"drain did not end at its deadline after the cooperative abort\");\n check(!drained.failed, `drain threw after the cooperative abort: ${String(drained.error)}`);\n }),\n ]\n : []),\n\n each(\"drain with an aborted signal and a deadline in the past ends at once\", async (subject, time) => {\n const work = await subject.hold();\n await subject.impl.stopIntake();\n const abort = new AbortController();\n abort.abort(new Error(\"the cooperative abort of the conformance kit\"));\n const drained = track(attempt(() => subject.impl.drain(time.clock.now() - 1, abort.signal)));\n check(await within(slack, () => drained.settled), \"drain did not end at once with its deadline in the past\");\n check(!drained.failed, `drain threw: ${String(drained.error)}`);\n if (cooperative) check(await within(slack, () => work.aborted), \"the work did not get an abort that came before the drain\");\n }),\n\n each(\"close ends the work in flight, in its bound\", async (subject, _time, title) => {\n for (let at = 0; at < holds; at += 1) await subject.hold();\n await count(subject, holds, \"the works are in flight before the close\");\n await closes(subject, title);\n await count(subject, 0, \"close left work in flight\");\n }),\n\n each(\"close is idempotent: a second close has no effect\", async (subject, _time, title) => {\n await subject.hold();\n const first = track(attempt(() => subject.impl.close()));\n const second = track(attempt(() => subject.impl.close()));\n check(await within(closeBound, () => first.settled && second.settled), \"two closes did not end in the bound\");\n check(!first.failed && !second.failed, `a close threw: ${String(first.error ?? second.error)}`);\n await closes(subject, title);\n await count(subject, 0, \"the closes left work in flight\");\n }),\n\n each(\"close right after the start ends in its bound\", async (subject, _time, title) => {\n await closes(subject, title);\n check(subject.impl.inFlight() === 0, \"inFlight() is not 0 after a close with no work\");\n }),\n\n each(\"the stages in their sequence: stop intake, drain with its cooperative abort, close\", async (subject, time, title) => {\n const short = await subject.hold();\n const long = await subject.hold();\n await subject.impl.stopIntake();\n check(!(await subject.offer()), \"the transport took new work after stopIntake\");\n const abort = new AbortController();\n const drained = track(attempt(() => subject.impl.drain(time.clock.now() + cap, abort.signal)));\n await short.release();\n await count(subject, 1, \"one work ended in the drain\");\n await time.pass(cap / 2);\n abort.abort(new Error(\"the cooperative abort of the conformance kit\"));\n if (cooperative) check(await within(slack, () => long.aborted), \"the long work did not get the cooperative abort\");\n await time.pass(cap / 2);\n check(await within(slack, () => drained.settled), \"drain did not end at its deadline\");\n await closes(subject, title);\n await count(subject, 0, \"close left work in flight\");\n }),\n ];\n return cases;\n};\n","// @mark1russell7/service/testing: the seams of the runtime for tests. A fake clock gives exact,\n// repeatable timing. A seeded random gives the same jitter on each run. A fake process takes\n// signals and keeps the exit codes. A quiet server answers until it goes quiet, and then it holds\n// its connections open without an answer. A test logger keeps each log entry. `contractCases` generates the contract test of a\n// declaration, and `transportConformance` generates the conformance test of a transport.\n\nimport type { AddressInfo, Server, Socket } from \"node:net\";\nimport { createServer } from \"node:net\";\nimport type { Outcome } from \"./latch.ts\";\nimport type { LogEntry, LogLevel, Logger } from \"./logger.ts\";\nimport type { CheckFn } from \"./poller.ts\";\n\nexport type { FakeClock, FakeProcess, FakeProcessOptions } from \"./fakes.ts\";\nexport { fakeClock, fakeProcess, seeded } from \"./fakes.ts\";\nexport type { ContractCase, ContractOptions } from \"./contract.ts\";\nexport { contractCases } from \"./contract.ts\";\nexport type {\n ConformanceOptions,\n ConformanceRecord,\n HeldWork,\n SubjectFactory,\n TransportSubject,\n} from \"./conformance.ts\";\nexport { detachedLifecycle, transportConformance } from \"./conformance.ts\";\n\n/**\n * A behavior is what a scripted check does when the runtime starts it:\n * - `\"ok\"`, `\"error\"` and `\"indeterminate\"` give that outcome at once.\n * - `\"throw\"` throws at once.\n * - `\"timeout\"` gives no answer until the runtime aborts the use at the timeout of the poll.\n * - `\"hang\"` gives no answer, and it ignores the abort, until `heal()`.\n */\nexport type Behavior = Outcome | \"throw\" | \"timeout\" | \"hang\";\n\n/** A scripted check is a check function whose behavior a test sets. */\nexport interface ScriptedCheck {\n readonly run: CheckFn;\n /** This behavior applies to each later call. */\n behavior: Behavior;\n /** This count is the number of calls of the check. */\n readonly calls: number;\n /** This count is the number of calls that are pending. */\n readonly hung: number;\n /** This method ends each hung call with a pass, as when a driver gets its answer late. */\n heal(): void;\n}\n\n/** This function makes a scripted check with a behavior at the start. */\nexport const scriptedCheck = (behavior: Behavior = \"ok\"): ScriptedCheck => {\n let calls = 0;\n const hung = new Set<() => void>();\n const script: ScriptedCheck = {\n behavior,\n get calls() {\n return calls;\n },\n get hung() {\n return hung.size;\n },\n heal() {\n for (const end of [...hung]) end();\n },\n run: (signal) => {\n calls += 1;\n const now = script.behavior;\n if (now === \"throw\") throw new Error(\"the scripted check threw\");\n if (now === \"timeout\")\n return new Promise<Outcome>((_, reject) =>\n signal.addEventListener(\"abort\", () => reject(new Error(\"aborted at the timeout\"))),\n );\n if (now === \"hang\")\n return new Promise<Outcome>((resolve) => {\n const end = (): void => {\n hung.delete(end);\n resolve(\"ok\");\n };\n hung.add(end);\n });\n return now;\n },\n };\n return script;\n};\n\n/** A test logger is a logger that keeps each entry, thus a test can examine the log of the runtime. */\nexport interface TestLogger extends Logger {\n /** These are the entries, in the sequence of their calls. */\n readonly entries: readonly LogEntry[];\n /** This method gives the message of each entry, or of each entry at one level. */\n messages(level?: LogLevel): string[];\n /** This method removes each entry. */\n clear(): void;\n}\n\n/** This function makes a test logger with no entries. */\nexport const testLogger = (): TestLogger => {\n const entries: LogEntry[] = [];\n return {\n entries,\n log(level, message, fields) {\n entries.push({ level, message, fields });\n },\n messages: (level) => entries.filter((entry) => level === undefined || entry.level === level).map((entry) => entry.message),\n clear() {\n entries.length = 0;\n },\n };\n};\n\n/** A quiet server is a TCP echo server that can stop its answers and keep its connections open. */\nexport interface QuietServer {\n readonly port: number;\n /** This method stops the answers. The connections stay open, and the server reads and discards the data. */\n quiet(): void;\n /** This method starts the answers again. */\n speak(): void;\n /** This count is the number of open connections. */\n readonly connections: number;\n close(): Promise<void>;\n}\n\n/**\n * This function starts a quiet server on the loopback address. A check against it passes while it\n * answers. When it goes quiet, the check sees a connection that is open but silent. A frozen peer\n * and a black hole that keeps the connection look the same.\n */\nexport const quietServer = async (): Promise<QuietServer> => {\n let silent = false;\n const sockets = new Set<Socket>();\n const server: Server = createServer((socket) => {\n sockets.add(socket);\n socket.on(\"close\", () => sockets.delete(socket));\n socket.on(\"error\", () => sockets.delete(socket));\n socket.on(\"data\", (chunk) => {\n if (!silent) socket.write(chunk);\n });\n });\n await new Promise<void>((resolve, reject) => {\n server.once(\"error\", reject);\n server.listen(0, \"127.0.0.1\", () => resolve());\n });\n return {\n port: (server.address() as AddressInfo).port,\n quiet: () => {\n silent = true;\n },\n speak: () => {\n silent = false;\n },\n get connections() {\n return sockets.size;\n },\n close: () =>\n new Promise<void>((resolve) => {\n for (const socket of sockets) socket.destroy();\n server.close(() => resolve());\n }),\n };\n};\n"],"mappings":";;;;;;AAoBA,MAAM,SAAS,YAA2B;CACxC,KAAK,IAAI,OAAO,GAAG,OAAO,IAAI,QAAQ,GAAG,MAAM,QAAQ,QAAQ;AACjE;;AAGA,MAAa,aAAa,QAAQ,MAAiB;CACjD,IAAI,MAAM;CACV,IAAI,WAAW;CACf,MAAM,SAA+E,CAAC;CACtF,MAAM,OAAO,QAAgB;EAC3B,IAAI;EACJ,KAAK,MAAM,SAAS,QAClB,IAAI,MAAM,QAAQ,MAAM,MAAM,QAAQ,SAAS,KAAA,KAAa,MAAM,KAAK,KAAK,MAAO,MAAM,OAAO,KAAK,MAAM,MAAM,QAAQ,KAAK,QAC5H,OAAO;EACX,OAAO;CACT;CACA,OAAO;EACL,WAAW;EACX,MAAM,IAAI,KAAa;GACrB,MAAM,QAAQ;IAAE,IAAI,MAAM,KAAK,IAAI,GAAG,EAAE;IAAG,OAAO;IAAY;IAAK,MAAM;GAAK;GAC9E,OAAO,KAAK,KAAK;GACjB,aAAa;IACX,MAAM,OAAO;GACf;EACF;EACA,MAAM,QAAQ,IAAI;GAEhB,MAAM,MAAM,MAAM,KAAK,IAAI,GAAG,EAAE;GAChC,MAAM,OAAO;GACb,SAAS;IACP,MAAM,QAAQ,IAAI,GAAG;IACrB,IAAI,UAAU,KAAA,GAAW;IACzB,MAAM,OAAO;IAEb,MAAM,KAAK,IAAI,KAAK,MAAM,EAAE;IAC5B,MAAM,IAAI;IACV,MAAM,OAAO;GACf;GACA,MAAM,KAAK,IAAI,KAAK,GAAG;GACvB,KAAK,IAAI,KAAK,OAAO,SAAS,GAAG,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC,OAAO,GAAG,CAAE,MAAM,OAAO,OAAO,IAAI,CAAC;GAC7F,MAAM,OAAO;EACf;EACA,MAAM,IAAI;GACR,OAAO,KAAK,IAAI,GAAG,EAAE;EACvB;EACA,IAAI,UAAU;GACZ,OAAO,OAAO,QAAQ,UAAU,MAAM,IAAI,CAAC,CAAC;EAC9C;CACF;AACF;;AAqCA,MAAa,eAAe,UAA8B,CAAC,MAAmB;CAC5E,MAAM,2BAAW,IAAI,IAAmD;CACxE,MAAM,mCAAmB,IAAI,IAAsD;CACnF,MAAM,QAAkB,CAAC;CACzB,MAAM,MAAgB,CAAC;CACvB,IAAI,UAAU;CACd,IAAI,QAAQ;CACZ,MAAM,aAAuB,CAAC;CAC9B,MAAM,SAAS,SAAuB;EACpC,IAAI,KAAK,QAAQ,UAAU,KAAA,IAAY,OAAO,GAAG,QAAQ,MAAM,IAAI,EAAE,GAAG,MAAM;CAChF;CACA,MAAM,QAAQ,MAAmB,YAA4B;EAC3D,KAAK,MAAM,WAAW,CAAC,GAAI,SAAS,IAAI,IAAI,KAAK,CAAC,CAAE,GAAG,QAAQ,OAAO;CACxE;CACA,OAAO;EACL,GAAG,SAAS,SAAS;GACnB,MAAM,MAAM,SAAS,IAAI,OAAO,qBAAK,IAAI,IAAI;GAC7C,IAAI,IAAI,OAAO;GACf,SAAS,IAAI,SAAS,GAAG;GACzB,aAAa;IACX,IAAI,OAAO,OAAO;GACpB;EACF;EACA,WAAW,SAAS;GAElB,MAAM,OAAO,OAAgB,WAAiC,QAAQ,OAAO,MAAM;GACnF,iBAAiB,IAAI,GAAG;GACxB,aAAa;IACX,iBAAiB,OAAO,GAAG;GAC7B;EACF;EACA,MAAM,QAAQ;GACZ,MAAM,OAAO;GACb,MAAM,QAAQ,QAAQ;GACtB,WAAW;GACX,MAAM,SAAS;EACjB;EACA,OAAO;GACL,SAAS;GACT,IAAI,OAAO;GACX,aAAa;IACX,IAAI,CAAC,MAAM;IACX,OAAO;IACP,SAAS;GACX;EACF;EACA,KAAK,MAAM;GACT,MAAM,QAAQ,MAAM;GACpB,WAAW,KAAK,KAAK;GACrB,MAAM,KAAK,IAAI;EACjB;EACA,SAAS,SAAS,KAAK,IAAI;EAC3B,UAAU,SAAS,KAAK,IAAI;EAC5B,UAAU,UAAU,KAAK,eAAe,KAAK;EAC7C,WAAW,OAAO,SAAS,wBAAwB;GACjD,KAAK,MAAM,WAAW,CAAC,GAAG,gBAAgB,GAAG,QAAQ,OAAO,MAAM;EACpE;EACA,IAAI,QAAQ;GACV,OAAO,CAAC,GAAG,KAAK;EAClB;EACA,IAAI,WAAW;GACb,IAAI,QAAQ,iBAAiB;GAC7B,KAAK,MAAM,OAAO,SAAS,OAAO,GAAG,SAAS,IAAI;GAClD,OAAO;EACT;EACA,IAAI,WAAW;GACb,OAAO,CAAC,GAAG,SAAS,KAAK,CAAC;EAC5B;EACA,IAAI,MAAM;GACR,OAAO,CAAC,GAAG,GAAG;EAChB;EACA,IAAI,UAAU;GACZ,OAAO;EACT;EACA,IAAI,QAAQ;GACV,OAAO;EACT;EACA,IAAI,aAAa;GACf,OAAO,CAAC,GAAG,UAAU;EACvB;CACF;AACF;;AAGA,MAAa,UAAU,SAAiC;CACtD,IAAI,QAAQ,SAAS;CACrB,aAAa;EACX,QAAS,QAAQ,eAAgB;EACjC,IAAI,IAAI;EACR,IAAI,KAAK,KAAK,IAAK,MAAM,IAAK,IAAI,CAAC;EACnC,KAAK,IAAI,KAAK,KAAK,IAAK,MAAM,GAAI,IAAI,EAAE;EACxC,SAAS,IAAK,MAAM,QAAS,KAAK;CACpC;AACF;;;ACjLA,MAAM,MAAM,WAAsE,QAAQ,QAAQ,IAAI;;AAGtG,MAAM,WAAW,aAA4B;CAC3C,OAAO,QAAQ;CACf,OAAO,QAAQ;CACf,aAAa,QAAQ;CACrB,cAAc,QAAQ;AACxB;AAEA,MAAM,QAAQ,UAAmB,WAA6B,KAAK,UAAU,QAAQ,MAAM,KAAK,UAAU,MAAM;AAEhH,MAAM,WAAW,MAAc,UAAmB,2BAChD,IAAI,MAAM,GAAG,KAAK,aAAa,KAAK,UAAU,QAAQ,EAAE,wBAAwB,KAAK,UAAU,MAAM,GAAG;;;;;;;;;;;;;;;AAgB1G,MAAa,iBAAiB,SAA+B,UAA2B,CAAC,MAAsB;CAC7G,MAAM,YAAY,QAAQ,aAAa;CACvC,MAAM,OAAO,QAAQ,QAAQ;CAC7B,MAAM,cAAkC,QAAQ,CAAC,CAAC,SAAS;CAC3D,MAAM,UAAU,YAAY;CAC5B,MAAM,SAAS,YAAY,OAAO,QAAQ,UAAU,MAAM,UAAU,IAAI;CACxE,MAAM,YAAY,UAAiB,YAAY,SAAS,MAAM;CAC9D,MAAM,WAAW,UAAyB,GAAG,SAAS,SAAS,KAAK,GAAG,MAAM,MAAM,OAAO,CAAC,CAAC,GAAG;CAC/F,MAAM,cAAc,UAAyB,GAAG,YAAY,SAAS,KAAK,GAAG,MAAM,IAAI,CAAC,CAAC,GAAG;CAC5F,MAAM,QAAQ,WAAsC,OAAO,QAAQ,GAAG,MAAM,KAAK,IAAI,GAAG,CAAC,GAAG,CAAC;CAC7F,MAAM,aAAa,KAAK,OAAO,QAAQ,UAAU,MAAM,UAAU,WAAW,CAAC,CAAC,IAAI,UAAU,CAAC,IAAI;CACjG,MAAM,YAAY,KAAK,OAAO,IAAI,OAAO,CAAC,IAAI;;CAG9C,MAAM,OAAO,OACX,eAA4D,CAAC,OACuB;EACpF,MAAM,QAAQ,UAAU;EAExB,MAAM,WAAW,QAAQ,CAAC,CAAC,MAAM;GAAE;GAAO,QAAQ,OAAO,IAAI;GAAG,GAAG,MAAM,KAAK;EAAE,CAAC;EACjF,IAAI,UAAU;EACd,SAAc,WACL,UAAU,YACV,UAAU,IACnB;EACA,KAAK,IAAI,OAAO,GAAG,OAAO,OAAQ,CAAC,SAAS,QAAQ,GAAG,MAAM,MAAM,QAAQ,EAAE;EAC7E,MAAM,SAAS,MAAM;EACrB,MAAM,MAAM,QAAQ,UAAU;EAC9B,OAAO;GAAE;GAAQ;GAAO,MAAM,QAAQ,OAAO,QAAQ,CAAC;EAAE;CAC1D;CACA,MAAM,QAAQ,WAAyB,OAAO,KAAK;CAEnD,MAAM,QAAwB,CAC5B;EACE,MAAM,GAAG,QAAQ;EACjB,MAAM,MAAM;GACV,MAAM,EAAE,QAAQ,SAAS,MAAM,KAAK;GACpC,IAAI;IACF,MAAM,WAAW;KACf,OAAO;KACP,OAAO;KACP,aAAa,OAAO,YAAY,YAAY,YAAY,KAAK,SAAS,CAAC,KAAK,MAAM,IAAI,CAAC,CAAC;KACxF,cAAc,OAAO,YAAY,YAAY,aAAa,KAAK,SAAS,CAAC,KAAK,MAAM,IAAI,CAAC,CAAC;IAC5F;IACA,IAAI,CAAC,KAAK,UAAU,IAAI,GAAG,MAAM,QAAQ,WAAW,UAAU,IAAI;GACpE,UAAU;IACR,KAAK,MAAM;GACb;EACF;CACF,CACF;CAEA,KAAK,MAAM,cAAc,YAAY,cAAc;EACjD,MAAM,KAAK,OAAO,QAAQ,UAAU,MAAM,eAAe,WAAW,IAAI;EACxE,MAAM,YAAY,GAAG,QAAQ,UAAU,MAAM,UAAU,WAAW;EAClE,MAAM,WAAW,GAAG,QAAQ,UAAU,MAAM,UAAU,UAAU;EAChE,MAAM,eAAe,UAAsC;GACzD,OAAO,UAAU,WAAW,IAAI,KAAK,QAAQ;GAC7C,OAAO,SAAS,WAAW,IAAI,KAAK,QAAQ;GAC5C,aAAa,OAAO,YAClB,YAAY,YAAY,KAAK,SAAS,CACpC,KAAK,MACL,KAAK,SAAS,SAAS,WAAW,IAAI,KAAK,UAAU,SAAS,IAAI,QAAQ,KAAK,YAAY,KAAK,KAClG,CAAC,CACH;GACA,cAAc;IAAE,GAAG,KAAK;KAAe,WAAW,OAAO,UAAU,WAAW;GAAE;EAClF;EAEA,MAAM,KAAK;GACT,MAAM,GAAG,QAAQ,IAAI,WAAW,KAAK;GACrC,MAAM,MAAM;IACV,IAAI,GAAG,WAAW,GAChB,MAAM,IAAI,MAAM,0CAA0C,WAAW,KAAK,iCAAiC;IAC7G,MAAM,EAAE,QAAQ,OAAO,SAAS,MAAM,KAAK;IAC3C,IAAI;KACF,OAAO,UAAU,WAAW,MAAM,IAAI;KACtC,MAAM,MAAM,QAAQ,KAAK,GAAG,IAAI,OAAO,CAAC,IAAI,CAAC;KAC7C,MAAM,MAAM,QAAQ,OAAO,QAAQ,CAAC;KACpC,MAAM,WAAW,YAAY,IAAI;KACjC,IAAI,CAAC,KAAK,UAAU,GAAG,GAAG,MAAM,QAAQ,GAAG,WAAW,KAAK,eAAe,UAAU,GAAG;IACzF,UAAU;KACR,KAAK,MAAM;IACb;GACF;EACF,CAAC;EAED,MAAM,KAAK;GACT,MAAM,GAAG,QAAQ,IAAI,WAAW,KAAK,eAAe,UAAU;GAC9D,MAAM,MAAM;IACV,MAAM,QAAQ,GAAG,QAAQ,UAAU,GAAG,MAAM,KAAK,OAAO,KAAK,SAAS;IACtE,IAAI,MAAM,SAAS,GACjB,MAAM,IAAI,MACR,GAAG,MAAM,KAAK,UAAU,GAAG,MAAM,KAAK,gBAAgB,GAAG,MAAM,KAAK,OAAO,EAAE,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE,iBAAiB,UAAU,aAC3H;IACF,MAAM,EAAE,QAAQ,OAAO,SAAS,MAAM,MAAM,QAAQ,EAClD,YAAY,OAAO,QACjB,MAAM,eAAe,WAAW,OAC5B,OACC,WAAW,IAAI,SAAS,YAAY,GAAG,MAAM,iBAAiB,QAAQ,IAAI,MAAM,CAAC,CAAC,CAAC,EAC5F,EAAE;IACF,IAAI;KACF,MAAM,MAAM,QAAQ,YAAY,KAAK,GAAG,KAAK,UAAU,GAAG,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC;KAChF,MAAM,MAAM,QAAQ,OAAO,QAAQ,CAAC;KACpC,IAAI,CAAC,KAAK,MAAM,GAAG,GAAG,MAAM,QAAQ,GAAG,WAAW,KAAK,YAAY,MAAM,GAAG;IAC9E,UAAU;KACR,KAAK,MAAM;IACb;GACF;EACF,CAAC;EAED,MAAM,KAAK;GACT,MAAM,GAAG,QAAQ,IAAI,WAAW,KAAK;GACrC,MAAM,MAAM;IACV,IAAI,GAAG,WAAW,GAChB,MAAM,IAAI,MAAM,0CAA0C,WAAW,KAAK,oCAAoC;IAChH,MAAM,EAAE,QAAQ,OAAO,SAAS,MAAM,KAAK;IAC3C,IAAI;KACF,OAAO,UAAU,WAAW,MAAM,IAAI;KACtC,MAAM,MAAM,QAAQ,KAAK,GAAG,IAAI,OAAO,CAAC,IAAI,CAAC;KAC7C,OAAO,UAAU,WAAW,MAAM,KAAK;KACvC,MAAM,MAAM,QAAQ,KAAK,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC;KAChD,MAAM,MAAM,QAAQ,OAAO,QAAQ,CAAC;KACpC,IAAI,CAAC,KAAK,MAAM,GAAG,GAAG,MAAM,QAAQ,GAAG,WAAW,KAAK,aAAa,MAAM,GAAG;IAC/E,UAAU;KACR,KAAK,MAAM;IACb;GACF;EACF,CAAC;CACH;CAEA,MAAM,QAAQ,GAAG,QAAQ;CACzB,MAAM,KAAK;EACT,MAAM,GAAG,QAAQ;EACjB,MAAM,MAAM;GACV,IAAI,YAAY,aAAa,MAAM,SAAS,KAAK,SAAS,KAAK,GAC7D,MAAM,IAAI,MAAM,0CAA0C,OAAO;GACnE,MAAM,EAAE,QAAQ,OAAO,SAAS,MAAM,KAAK;GAC3C,IAAI;IACF,OAAO,UAAU,OAAO,IAAI;IAC5B,MAAM,MAAM,QAAQ,SAAS;IAC7B,MAAM,MAAM,QAAQ,OAAO,QAAQ,CAAC;IACpC,IAAI,CAAC,KAAK,MAAM,GAAG,GAAG,MAAM,QAAQ,wBAAwB,MAAM,GAAG;GACvE,UAAU;IACR,KAAK,MAAM;GACb;GAEA,IAAI,UAAU;GACd,IAAI;IACF,QAAQ,CAAC,CACN,MAAM;KACL,MAAM,GAAG,MAAM;KACf,YAAY;KACZ,MAAM;KACN,eAAe;KACf,OAAO;KACP,MAAM,OAAO,EAAE,EAAE,QAAQ;MAAE,UAAU;OAAE,OAAO;OAAG,MAAM;MAAI;MAAG,QAAQ;MAAG,SAAS;OAAE,OAAO;OAAK,MAAM;MAAI;KAAE;IAC9G,CAAC,CAAC,CACD,SAAS;GACd,QAAQ;IACN,UAAU;GACZ;GACA,IAAI,CAAC,SAAS,MAAM,IAAI,MAAM,uCAAuC,MAAM,4BAA4B;EACzG;CACF,CAAC;CAED,OAAO;AACT;;;;;;;;ACrLA,MAAa,0BAAqC;CAChD,MAAM,aAAoB;EACxB,MAAM,IAAI,MAAM,oFAAoF;CACtG;CAEA,OAAO;EACL,QAAA;GAFe,SAAS;GAAM,OAAO;GAAM,SAAS;GAAM,WAAW;GAAM,WAAW;GAAM,OAAO;GAAM,MAAM;EAE1G;EACL,OAAO;EACP,UAAU;EACV,QAAQ,CAAC;EACT,SAAS,QAAQ,QAAQ;EACzB,MAAM,IAAI,cAAsB,CAAC,CAAC;EAClC,QAAQ,IAAI,gBAAgB,CAAC,CAAC;EAC9B,UAAU;EACV,SAAS;EACT,gBAAgB;EAChB,iBAAiB;CACnB;AACF;AA8CA,MAAM,gBAAwB,YAAY,IAAI;AAC9C,MAAM,aAA4B,IAAI,SAAS,YAAY,WAAW,SAAS,CAAC,CAAC;AACjF,MAAM,SAAS,OAA8B,IAAI,SAAS,YAAY,WAAW,SAAS,EAAE,CAAC;;AAG7F,MAAM,SAAS,OAAO,OAAe,SAA0C;CAC7E,MAAM,MAAM,QAAQ,IAAI;CACxB,SAAS;EACP,IAAI,KAAK,GAAG,OAAO;EACnB,IAAI,QAAQ,IAAI,KAAK,OAAO,KAAK;EACjC,MAAM,KAAK;CACb;AACF;;AAGA,MAAM,QAAQ,YAA2B;CACvC,KAAK,IAAI,KAAK,GAAG,KAAK,GAAG,MAAM,GAAG,MAAM,KAAK;AAC/C;;AAGA,MAAM,WAAW,SAAoD;CACnE,IAAI;EACF,OAAO,QAAQ,QAAQ,KAAK,CAAC;CAC/B,SAAS,OAAO;EACd,OAAO,QAAQ,OAAO,KAAK;CAC7B;AACF;AAEA,MAAM,SAAS,YAAuC;CACpD,MAAM,QAAQ;EAAE,SAAS;EAAO,OAAO,KAAA;EAAsB,QAAQ;CAAM;CAC3E,QAAQ,WACA;EACJ,MAAM,UAAU;CAClB,IACC,UAAmB;EAClB,MAAM,UAAU;EAChB,MAAM,SAAS;EACf,MAAM,QAAQ;CAChB,CACF;CACA,OAAO;AACT;;;;;;;;;;;;AAaA,MAAa,wBAAwB,MAAsB,UAA8B,CAAC,MAAsB;CAC9G,MAAM,OAAO,QAAQ,QAAQ;CAC7B,MAAM,QAAQ,QAAQ,SAAS,YAAY;CAC3C,MAAM,MAAM,QAAQ,OAAO;CAC3B,MAAM,aAAa,QAAQ,cAAc;CACzC,MAAM,QAAQ,QAAQ,SAAS;CAC/B,MAAM,cAAc,QAAQ,eAAe;CAC3C,MAAM,QAAQ,QAAQ,SAAS;CAE/B,MAAM,eAAqB;EACzB,IAAI,CAAC,MAAM,OAAO;GAAE,OAAO;GAAW,MAAM;EAAM;EAClD,MAAM,QAAQ,UAAU;EACxB,OAAO;GAAE;GAAO,OAAO,OAAO,MAAM,QAAQ,EAAE;EAAE;CAClD;CAEA,MAAM,SAAS,IAAa,SAAuB;EACjD,IAAI,CAAC,IAAI,MAAM,IAAI,MAAM,GAAG,KAAK,IAAI,MAAM;CAC7C;CAEA,MAAM,QAAQ,OAAe,UAAiG;EAC5H,MAAM,GAAG,KAAK,IAAI;EAClB,MAAM,MAAM;GACV,MAAM,OAAO,OAAO;GACpB,MAAM,UAAU,MAAM,KAAK,KAAK,KAAK;GACrC,IAAI;IACF,MAAM,QAAQ,KAAK,MAAM,IAAI,gBAAgB,CAAC,CAAC,QAAQ,QAAQ,QAAQ,kBAAkB,CAAC;IAC1F,MAAM,KAAK,SAAS,MAAM,KAAK;GACjC,UAAU;IACR,IAAI;KACF,MAAM,QAAQ,KAAK,MAAM;IAC3B,UAAU;KACR,MAAM,QAAQ,UAAU;IAC1B;GACF;EACF;CACF;CAEA,MAAM,SAAS,SAA2B,UAAkB,SAC1D,OAAO,aAAa,QAAQ,KAAK,SAAS,MAAM,QAAQ,CAAC,CAAC,MAAM,OAC9D,MAAM,IAAI,GAAG,KAAK,qBAAqB,QAAQ,KAAK,SAAS,EAAE,QAAQ,UAAU,CACnF;CAEF,MAAM,SAAS,OAAO,SAA2B,UAAiC;EAChF,MAAM,QAAQ,QAAQ;EACtB,MAAM,SAAS,MAAM,cAAc,QAAQ,KAAK,MAAM,CAAC,CAAC;EACxD,MAAM,UAAU,MAAM,OAAO,kBAAkB,OAAO,OAAO;EAC7D,MAAM,OAAO,QAAQ,IAAI;EACzB,QAAQ,SAAS;GAAE,MAAM;GAAO,MAAM;GAAS,UAAU;GAAY,UAAU;EAAK,CAAC;EACrF,MAAM,SAAS,qCAAqC,WAAW,IAAI;EACnE,MAAM,CAAC,OAAO,QAAQ,gBAAgB,OAAO,OAAO,KAAK,GAAG;CAC9D;CAiJA,OAAO;EA9IL,KAAK,+DAA+D,OAAO,YAAY;GACrF,MAAM,QAAQ,KAAK,SAAS,MAAM,GAAG,oBAAoB,QAAQ,KAAK,SAAS,EAAE,wBAAwB;GACzG,MAAM,MAAM,QAAQ,MAAM,GAAG,gDAAgD;GAC7E,MAAM,MAAM,SAAS,GAAG,gBAAgB;EAC1C,CAAC;EAED,KAAK,oFAAoF,OAAO,YAAY;GAC1G,MAAM,OAAmB,CAAC;GAC1B,KAAK,IAAI,KAAK,GAAG,MAAM,OAAO,MAAM,GAAG;IACrC,KAAK,KAAK,MAAM,QAAQ,KAAK,CAAC;IAC9B,MAAM,MAAM,SAAS,IAAI,GAAG,GAAG,qBAAqB;GACtD;GACA,KAAK,IAAI,KAAK,QAAQ,GAAG,MAAM,GAAG,MAAM,GAAG;IACzC,MAAM,KAAK,GAAG,CAAE,QAAQ;IACxB,MAAM,MAAM,SAAS,IAAI,GAAG,GAAG,qCAAqC;GACtE;EACF,CAAC;EAED,KAAK,0FAA0F,OAAO,YAAY;GAChH,MAAM,OAAO,MAAM,QAAQ,KAAK;GAChC,MAAM,QAAQ,KAAK,WAAW;GAC9B,MAAM,CAAE,MAAM,QAAQ,MAAM,GAAI,8CAA8C;GAC9E,MAAM,MAAM,SAAS,GAAG,mCAAmC;GAC3D,MAAM,QAAQ,KAAK,WAAW;GAC9B,MAAM,CAAE,MAAM,QAAQ,MAAM,GAAI,uDAAuD;GACvF,MAAM,KAAK,QAAQ;GACnB,MAAM,MAAM,SAAS,GAAG,2CAA2C;EACrE,CAAC;EAED,KAAK,gDAAgD,OAAO,SAAS,SAAS;GAC5E,MAAM,QAAQ,KAAK,WAAW;GAC9B,MAAM,UAAU,MAAM,cAAc,QAAQ,KAAK,MAAM,KAAK,MAAM,IAAI,IAAI,KAAK,IAAI,gBAAgB,CAAC,CAAC,MAAM,CAAC,CAAC;GAC7G,MAAM,MAAM,OAAO,aAAa,QAAQ,OAAO,GAAG,0CAA0C;GAC5F,MAAM,CAAC,QAAQ,QAAQ,gBAAgB,OAAO,QAAQ,KAAK,GAAG;EAChE,CAAC;EAED,KAAK,2DAA2D,OAAO,SAAS,SAAS;GACvF,MAAM,OAAO,MAAM,QAAQ,KAAK;GAChC,MAAM,QAAQ,KAAK,WAAW;GAC9B,MAAM,WAAW,KAAK,MAAM,IAAI,IAAI;GACpC,MAAM,UAAU,MAAM,cAAc,QAAQ,KAAK,MAAM,UAAU,IAAI,gBAAgB,CAAC,CAAC,MAAM,CAAC,CAAC;GAC/F,MAAM,KAAK,KAAK,MAAM,CAAC;GACvB,MAAM,MAAM;GACZ,MAAM,CAAC,QAAQ,SAAS,2DAA2D;GACnF,MAAM,KAAK,QAAQ;GACnB,MAAM,MAAM,OAAO,aAAa,QAAQ,OAAO,GAAG,4CAA4C;GAC9F,MAAM,CAAC,QAAQ,QAAQ,gBAAgB,OAAO,QAAQ,KAAK,GAAG;GAC9D,MAAM,KAAK,MAAM,IAAI,IAAI,UAAU,2DAA2D;EAChG,CAAC;EAED,KAAK,mEAAmE,OAAO,SAAS,MAAM,UAAU;GACtG,MAAM,QAAQ,KAAK;GACnB,MAAM,QAAQ,KAAK,WAAW;GAC9B,MAAM,QAAQ,QAAQ;GACtB,MAAM,WAAW,KAAK,MAAM,IAAI,IAAI;GACpC,MAAM,UAAU,MAAM,cAAc,QAAQ,KAAK,MAAM,UAAU,IAAI,gBAAgB,CAAC,CAAC,MAAM,CAAC,CAAC;GAC/F,IAAI,MAAM;IACR,MAAM,KAAK,KAAK,MAAM,CAAC;IACvB,MAAM,MAAM;IACZ,MAAM,CAAC,QAAQ,SAAS,sDAAsD;IAC9E,MAAM,KAAK,KAAK,CAAC;IACjB,MAAM,MAAM,OAAO,aAAa,QAAQ,OAAO,GAAG,mCAAmC;GACvF,OAAO;IACL,MAAM,QAAQ,MAAM,OAAO,MAAM,aAAa,QAAQ,OAAO;IAC7D,MAAM,OAAO,QAAQ,IAAI;IACzB,QAAQ,SAAS;KAAE,MAAM;KAAO,MAAM;KAAyB,UAAU;KAAK,UAAU;IAAK,CAAC;IAC9F,MAAM,OAAO,wBAAwB,MAAM,MAAM,0BAA0B,IAAI,IAAI;IACnF,MAAM,QAAQ,MAAM,OAAO,qBAAqB,KAAK,MAAM,IAAI,EAAE,8BAA8B,IAAI,IAAI;GACzG;GACA,MAAM,CAAC,QAAQ,QAAQ,gCAAgC,OAAO,QAAQ,KAAK,GAAG;EAChF,CAAC;EAED,GAAI,cACA,CACE,KAAK,2DAA2D,OAAO,SAAS,SAAS;GACvF,MAAM,OAAO,MAAM,QAAQ,KAAK;GAChC,MAAM,QAAQ,KAAK,WAAW;GAC9B,MAAM,QAAQ,IAAI,gBAAgB;GAClC,MAAM,UAAU,MAAM,cAAc,QAAQ,KAAK,MAAM,KAAK,MAAM,IAAI,IAAI,KAAK,MAAM,MAAM,CAAC,CAAC;GAC7F,MAAM,KAAK,KAAK,MAAM,CAAC;GACvB,MAAM,MAAM;GACZ,MAAM,CAAC,KAAK,SAAS,8DAA8D;GACnF,MAAM,sBAAM,IAAI,MAAM,8CAA8C,CAAC;GACrE,MAAM,MAAM,OAAO,aAAa,KAAK,OAAO,GAAG,4CAA4C;GAC3F,MAAM,KAAK,KAAK,MAAM,CAAC;GACvB,MAAM,MAAM,OAAO,aAAa,QAAQ,OAAO,GAAG,+DAA+D;GACjH,MAAM,CAAC,QAAQ,QAAQ,4CAA4C,OAAO,QAAQ,KAAK,GAAG;EAC5F,CAAC,CACH,IACA,CAAC;EAEL,KAAK,wEAAwE,OAAO,SAAS,SAAS;GACpG,MAAM,OAAO,MAAM,QAAQ,KAAK;GAChC,MAAM,QAAQ,KAAK,WAAW;GAC9B,MAAM,QAAQ,IAAI,gBAAgB;GAClC,MAAM,sBAAM,IAAI,MAAM,8CAA8C,CAAC;GACrE,MAAM,UAAU,MAAM,cAAc,QAAQ,KAAK,MAAM,KAAK,MAAM,IAAI,IAAI,GAAG,MAAM,MAAM,CAAC,CAAC;GAC3F,MAAM,MAAM,OAAO,aAAa,QAAQ,OAAO,GAAG,yDAAyD;GAC3G,MAAM,CAAC,QAAQ,QAAQ,gBAAgB,OAAO,QAAQ,KAAK,GAAG;GAC9D,IAAI,aAAa,MAAM,MAAM,OAAO,aAAa,KAAK,OAAO,GAAG,0DAA0D;EAC5H,CAAC;EAED,KAAK,+CAA+C,OAAO,SAAS,OAAO,UAAU;GACnF,KAAK,IAAI,KAAK,GAAG,KAAK,OAAO,MAAM,GAAG,MAAM,QAAQ,KAAK;GACzD,MAAM,MAAM,SAAS,OAAO,0CAA0C;GACtE,MAAM,OAAO,SAAS,KAAK;GAC3B,MAAM,MAAM,SAAS,GAAG,2BAA2B;EACrD,CAAC;EAED,KAAK,qDAAqD,OAAO,SAAS,OAAO,UAAU;GACzF,MAAM,QAAQ,KAAK;GACnB,MAAM,QAAQ,MAAM,cAAc,QAAQ,KAAK,MAAM,CAAC,CAAC;GACvD,MAAM,SAAS,MAAM,cAAc,QAAQ,KAAK,MAAM,CAAC,CAAC;GACxD,MAAM,MAAM,OAAO,kBAAkB,MAAM,WAAW,OAAO,OAAO,GAAG,qCAAqC;GAC5G,MAAM,CAAC,MAAM,UAAU,CAAC,OAAO,QAAQ,kBAAkB,OAAO,MAAM,SAAS,OAAO,KAAK,GAAG;GAC9F,MAAM,OAAO,SAAS,KAAK;GAC3B,MAAM,MAAM,SAAS,GAAG,gCAAgC;EAC1D,CAAC;EAED,KAAK,iDAAiD,OAAO,SAAS,OAAO,UAAU;GACrF,MAAM,OAAO,SAAS,KAAK;GAC3B,MAAM,QAAQ,KAAK,SAAS,MAAM,GAAG,gDAAgD;EACvF,CAAC;EAED,KAAK,sFAAsF,OAAO,SAAS,MAAM,UAAU;GACzH,MAAM,QAAQ,MAAM,QAAQ,KAAK;GACjC,MAAM,OAAO,MAAM,QAAQ,KAAK;GAChC,MAAM,QAAQ,KAAK,WAAW;GAC9B,MAAM,CAAE,MAAM,QAAQ,MAAM,GAAI,8CAA8C;GAC9E,MAAM,QAAQ,IAAI,gBAAgB;GAClC,MAAM,UAAU,MAAM,cAAc,QAAQ,KAAK,MAAM,KAAK,MAAM,IAAI,IAAI,KAAK,MAAM,MAAM,CAAC,CAAC;GAC7F,MAAM,MAAM,QAAQ;GACpB,MAAM,MAAM,SAAS,GAAG,6BAA6B;GACrD,MAAM,KAAK,KAAK,MAAM,CAAC;GACvB,MAAM,sBAAM,IAAI,MAAM,8CAA8C,CAAC;GACrE,IAAI,aAAa,MAAM,MAAM,OAAO,aAAa,KAAK,OAAO,GAAG,iDAAiD;GACjH,MAAM,KAAK,KAAK,MAAM,CAAC;GACvB,MAAM,MAAM,OAAO,aAAa,QAAQ,OAAO,GAAG,mCAAmC;GACrF,MAAM,OAAO,SAAS,KAAK;GAC3B,MAAM,MAAM,SAAS,GAAG,2BAA2B;EACrD,CAAC;CAEQ;AACb;;;;AC9SA,MAAa,iBAAiB,WAAqB,SAAwB;CACzE,IAAI,QAAQ;CACZ,MAAM,uBAAO,IAAI,IAAgB;CACjC,MAAM,SAAwB;EAC5B;EACA,IAAI,QAAQ;GACV,OAAO;EACT;EACA,IAAI,OAAO;GACT,OAAO,KAAK;EACd;EACA,OAAO;GACL,KAAK,MAAM,OAAO,CAAC,GAAG,IAAI,GAAG,IAAI;EACnC;EACA,MAAM,WAAW;GACf,SAAS;GACT,MAAM,MAAM,OAAO;GACnB,IAAI,QAAQ,SAAS,MAAM,IAAI,MAAM,0BAA0B;GAC/D,IAAI,QAAQ,WACV,OAAO,IAAI,SAAkB,GAAG,WAC9B,OAAO,iBAAiB,eAAe,uBAAO,IAAI,MAAM,wBAAwB,CAAC,CAAC,CACpF;GACF,IAAI,QAAQ,QACV,OAAO,IAAI,SAAkB,YAAY;IACvC,MAAM,YAAkB;KACtB,KAAK,OAAO,GAAG;KACf,QAAQ,IAAI;IACd;IACA,KAAK,IAAI,GAAG;GACd,CAAC;GACH,OAAO;EACT;CACF;CACA,OAAO;AACT;;AAaA,MAAa,mBAA+B;CAC1C,MAAM,UAAsB,CAAC;CAC7B,OAAO;EACL;EACA,IAAI,OAAO,SAAS,QAAQ;GAC1B,QAAQ,KAAK;IAAE;IAAO;IAAS;GAAO,CAAC;EACzC;EACA,WAAW,UAAU,QAAQ,QAAQ,UAAU,UAAU,KAAA,KAAa,MAAM,UAAU,KAAK,CAAC,CAAC,KAAK,UAAU,MAAM,OAAO;EACzH,QAAQ;GACN,QAAQ,SAAS;EACnB;CACF;AACF;;;;;;AAmBA,MAAa,cAAc,YAAkC;CAC3D,IAAI,SAAS;CACb,MAAM,0BAAU,IAAI,IAAY;CAChC,MAAM,SAAiB,cAAc,WAAW;EAC9C,QAAQ,IAAI,MAAM;EAClB,OAAO,GAAG,eAAe,QAAQ,OAAO,MAAM,CAAC;EAC/C,OAAO,GAAG,eAAe,QAAQ,OAAO,MAAM,CAAC;EAC/C,OAAO,GAAG,SAAS,UAAU;GAC3B,IAAI,CAAC,QAAQ,OAAO,MAAM,KAAK;EACjC,CAAC;CACH,CAAC;CACD,MAAM,IAAI,SAAe,SAAS,WAAW;EAC3C,OAAO,KAAK,SAAS,MAAM;EAC3B,OAAO,OAAO,GAAG,mBAAmB,QAAQ,CAAC;CAC/C,CAAC;CACD,OAAO;EACL,MAAO,OAAO,QAAQ,CAAC,CAAiB;EACxC,aAAa;GACX,SAAS;EACX;EACA,aAAa;GACX,SAAS;EACX;EACA,IAAI,cAAc;GAChB,OAAO,QAAQ;EACjB;EACA,aACE,IAAI,SAAe,YAAY;GAC7B,KAAK,MAAM,UAAU,SAAS,OAAO,QAAQ;GAC7C,OAAO,YAAY,QAAQ,CAAC;EAC9B,CAAC;CACL;AACF"}
|
package/build/websocket.d.ts
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
|
-
import {
|
|
2
|
-
import { C as MANIFESTATIONS, D as firstDetector, E as Situation, O as unwatched, S as Detector, T as Meeting, _ as Sent, a as ClientKnobs, b as retryProblems, c as ClientSpec, d as Factory, f as ReadyWait, g as SendOptions, h as STARTING_POLL, i as ClientJoin, l as ClientStep, m as RetrySchedule, n as CheckOptions, o as ClientOptions, p as RetryKnobs, r as Client, s as ClientSocket, t as Attempt, u as DialFn, v as readyWait, w as Manifestation, x as retrySchedule, y as retryBackoff } from "./core-
|
|
3
|
-
import { n as statusLineJudge, t as Judge } from "./dial-
|
|
1
|
+
import { Gt as Operation, mt as Poll } from "./lifecycle-DXK880vG.js";
|
|
2
|
+
import { C as MANIFESTATIONS, D as firstDetector, E as Situation, O as unwatched, S as Detector, T as Meeting, _ as Sent, a as ClientKnobs, b as retryProblems, c as ClientSpec, d as Factory, f as ReadyWait, g as SendOptions, h as STARTING_POLL, i as ClientJoin, l as ClientStep, m as RetrySchedule, n as CheckOptions, o as ClientOptions, p as RetryKnobs, r as Client, s as ClientSocket, t as Attempt, u as DialFn, v as readyWait, w as Manifestation, x as retrySchedule, y as retryBackoff } from "./core-Iy9rIXOT.js";
|
|
3
|
+
import { n as statusLineJudge, t as Judge } from "./dial-DLT7bTlA.js";
|
|
4
4
|
import { Extent, Quantity } from "@mark1russell7/quantity";
|
|
5
5
|
import { Machine } from "@mark1russell7/algebra";
|
|
6
6
|
//#region src/websocket/connection.d.ts
|
package/build/websocket.js
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
import { realClock } from "./clock.js";
|
|
2
2
|
import { heartbeat } from "./heartbeat.js";
|
|
3
3
|
import { i as heartbeatDetection } from "./timing-DGRi3XCI.js";
|
|
4
|
-
import { A as retrySchedule, B as zeroProblems, C as notSent, D as readyWait, F as timeProblems, G as immediate, H as NEVER, I as trackWithTimer, J as keepaliveSilent, K as keepaliveAnswered, L as wholeProblems, M as sendWithReissue, N as socketEnds, O as retryBackoff, P as stepChecks, R as withinBound, S as ms, U as WHAT, V as MANIFESTATIONS, W as firstDetector, X as unwatched, Y as kernelGiveUp, _ as inFlight, a as helloDial, b as message, c as ageProblems, d as clientProblems, f as clientRecorder, h as finiteMs, i as authority, j as roundTripCheck, k as retryProblems, l as attachClient, m as dialCheck, n as closeTimer, o as statusLineJudge, q as keepaliveReset, r as transition, s as STARTING_POLL, t as clientKnob, u as clientBounds, w as operationTable, x as missesProblems, y as localStateCheck, z as wrapperTimerProblems } from "./machine-
|
|
4
|
+
import { A as retrySchedule, B as zeroProblems, C as notSent, D as readyWait, F as timeProblems, G as immediate, H as NEVER, I as trackWithTimer, J as keepaliveSilent, K as keepaliveAnswered, L as wholeProblems, M as sendWithReissue, N as socketEnds, O as retryBackoff, P as stepChecks, R as withinBound, S as ms, U as WHAT, V as MANIFESTATIONS, W as firstDetector, X as unwatched, Y as kernelGiveUp, _ as inFlight, a as helloDial, b as message, c as ageProblems, d as clientProblems, f as clientRecorder, h as finiteMs, i as authority, j as roundTripCheck, k as retryProblems, l as attachClient, m as dialCheck, n as closeTimer, o as statusLineJudge, q as keepaliveReset, r as transition, s as STARTING_POLL, t as clientKnob, u as clientBounds, w as operationTable, x as missesProblems, y as localStateCheck, z as wrapperTimerProblems } from "./machine-Dq2OlzCG.js";
|
|
5
5
|
//#region src/websocket/connection.ts
|
|
6
6
|
/** This function gives a message of ws as one buffer. At the default `binaryType` of ws, a message is a buffer already. */
|
|
7
7
|
const asBuffer = (data) => {
|
package/package.json
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
{
|
|
2
2
|
"$schema": "https://json.schemastore.org/package",
|
|
3
3
|
"name": "@mark1russell7/service",
|
|
4
|
-
"version": "0.6.
|
|
4
|
+
"version": "0.6.2",
|
|
5
5
|
"description": "A service declared as data before it starts, and its runtime: checks on jittered loops, a latch for each policy, probes from the cache, the startup in its sequence, and a staged, capped drain. The timer-ordering law checks the declaration. Its clock, heartbeat and backoff also work alone, in a browser too.",
|
|
6
6
|
"keywords": [
|
|
7
7
|
"service",
|
|
@@ -139,7 +139,7 @@
|
|
|
139
139
|
"devDependencies": {
|
|
140
140
|
"@grpc/grpc-js": "1.14.6",
|
|
141
141
|
"@mark1russell7/cue": "github:mark1russell7/cue",
|
|
142
|
-
"@mark1russell7/harness": "^0.
|
|
142
|
+
"@mark1russell7/harness": "^0.13.0",
|
|
143
143
|
"@types/node": "^26.6.4",
|
|
144
144
|
"ioredis": "6.0.0",
|
|
145
145
|
"testcontainers": "12.2.0",
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"limiter-pkBZUp-t.js","names":["r"],"sources":["../src/limiter/store.ts","../src/limiter/machine.ts"],"sourcesContent":["import type { Quantity } from \"@mark1russell7/quantity\";\nimport { convertExact, rationals as r } from \"@mark1russell7/quantity\";\nimport type { Clock } from \"../clock.ts\";\nimport type { Decision, KeyState, LimiterSpec, LimitRule } from \"./policy.ts\";\nimport { decide, freeAt, limitRule, limiterProblems, longestRetryAfter } from \"./policy.ts\";\n\n/** A take request is one take of one key, with the rule and the cap of its limiter in numbers. */\nexport interface TakeRequest {\n /** This name is the limiter. A store keeps the keys of each limiter apart. */\n readonly limiter: string;\n readonly key: string;\n readonly rule: LimitRule;\n /** This count is the most keys that the store holds for the limiter. */\n readonly maxKeys: number;\n}\n\n/**\n * A limiter store keeps the state of each key, and it decides each take in one atomic step, on its\n * own clock. Thus two takes of one key do not read the same state at any time. A store in this\n * process uses `decide`. A store that the replicas share does the same arithmetic in one step of its\n * own, for example one script of Redis that reads `TIME`.\n */\nexport interface LimiterStore {\n /** This kind tells where the counts are: in the memory of this replica, or in a store that the replicas share. */\n readonly kind: \"local\" | \"shared\";\n /**\n * This method decides one take. It removes a key only when its state is equal to the state of a\n * new key. It holds at most `maxKeys` keys for each limiter. A failure of a shared store rejects\n * the take, and the limiter then applies the `onStoreFailure` of its spec.\n */\n take(request: TakeRequest): Decision | Promise<Decision>;\n}\n\n/** A memory store is the store of one replica, on the injected monotonic clock. */\nexport interface MemoryStore extends LimiterStore {\n readonly kind: \"local\";\n /** This method gives the count of keys that the store holds for a limiter. */\n size(limiter: string): number;\n}\n\n/** A table is the keys of one limiter in a memory store. */\ninterface Table {\n readonly states: Map<string, KeyState>;\n /**\n * This time is at or before the earliest time at which a held key is equal to a new key. An\n * insert lowers it, and a sweep sets it again. A take of a held key only moves the time of that\n * key later, thus the bound stays true.\n */\n next: number;\n}\n\nconst ms = (value: number): Quantity => ({ value, unit: \"ms\" });\n\n/**\n * This function makes the store of one replica. It reads time only through the clock. Thus a step\n * of the wall clock does not move a count, and a fake clock gives exact decisions in a test.\n * - The eviction is exact. A key whose bucket is full again, or whose window has no take, is equal\n * to a new key. The store removes it at its next take, or at a sweep.\n * - The count of keys has a bound. At the cap, a take of a new key sweeps the table, but only when\n * a held key can be free. Each sweep reads each key one time. When no key is free, the store\n * refuses the new key with the cause `cap`. Its `retryAfter` is at most the time until the\n * earliest held key is free, and that time is at most `idleSpan` of the policy.\n */\nexport const memoryStore = (clock: Clock): MemoryStore => {\n const tables = new Map<string, Table>();\n const sweep = (table: Table, rule: LimitRule, now: number): void => {\n let next = Number.POSITIVE_INFINITY;\n for (const [key, state] of table.states) {\n const free = freeAt(rule, state);\n if (free <= now) table.states.delete(key);\n else next = Math.min(next, free);\n }\n table.next = next;\n };\n return {\n kind: \"local\",\n take({ limiter, key, rule, maxKeys }) {\n const now = clock.now();\n let table = tables.get(limiter);\n if (table === undefined) {\n table = { states: new Map(), next: Number.POSITIVE_INFINITY };\n tables.set(limiter, table);\n }\n let state = table.states.get(key);\n // a key that is equal to a new key goes: the decision is the same, and it frees its slot\n if (state !== undefined && freeAt(rule, state) <= now) {\n table.states.delete(key);\n state = undefined;\n }\n if (state === undefined && table.states.size >= maxKeys) {\n if (table.next <= now) sweep(table, rule, now);\n if (table.states.size >= maxKeys) return { allowed: false, retryAfter: ms(table.next - now), cause: \"cap\" };\n }\n const step = decide(rule, state, now);\n if (state === undefined) {\n // a new key is never refused by its policy: a full bucket, or an empty window\n table.states.set(key, step.state);\n table.next = Math.min(table.next, freeAt(rule, step.state));\n } else table.states.set(key, step.state);\n return step.decision;\n },\n size(limiter) {\n return tables.get(limiter)?.states.size ?? 0;\n },\n };\n};\n\n/** A keyed limiter is the runtime of one declared limiter: its spec, its rule in numbers, and its store. */\nexport interface KeyedLimiter {\n readonly name: string;\n /** This spec is the declaration, the same data that `svc.limiter(name, spec)` takes and `describe()` shows. */\n readonly spec: LimiterSpec;\n readonly rule: LimitRule;\n /** This count is the most keys that the store holds for the limiter. */\n readonly maxKeys: number;\n /**\n * This method takes one unit for a key, and gives the decision of the store. When a shared store\n * fails, it gives the decision of `onStoreFailure`, with the failure as text.\n */\n take(key: string): Promise<Decision>;\n}\n\n/** This function gives the text of a failure. */\nconst failureOf = (error: unknown): string => (error instanceof Error ? error.message : String(error));\n\n/**\n * This function makes the runtime of a limiter from its spec and its store. It refuses a spec with a\n * problem, because the limiter has no defaults. It also refuses a store of the wrong kind: a spec\n * with a shared store needs a store that the replicas share.\n * - A failure of a shared store gives the decision of `onStoreFailure`. With `open`, the take is\n * permitted with `remaining` 0. With `closed`, it is refused with the cause `store`.\n * - The `retryAfter` of the cause `store` is the longest `retryAfter` of the policy.\n * - A failure of a local store rejects the take, because a local store has no `onStoreFailure`.\n */\nexport const keyedLimiter = (name: string, spec: LimiterSpec, store: LimiterStore): KeyedLimiter => {\n const problems = limiterProblems(name, spec);\n if (problems.length > 0) throw new Error(problems.join(\"; \"));\n if (store.kind !== spec.store.kind)\n throw new Error(`limiter ${name} declares a ${spec.store.kind} store, but the store that it got is ${store.kind}`);\n const rule = limitRule(spec.policy);\n const maxKeys = r.toNumber(convertExact(r.fromNumber(spec.evict.maxKeys.value), spec.evict.maxKeys.unit, \"count\"));\n const onStoreFailure = spec.store.kind === \"shared\" ? spec.store.onStoreFailure : undefined;\n const closedAfter = longestRetryAfter(spec.policy);\n const take = async (key: string): Promise<Decision> => {\n const request: TakeRequest = { limiter: name, key, rule, maxKeys };\n if (onStoreFailure === undefined) return store.take(request);\n try {\n return await store.take(request);\n } catch (error) {\n const failure = failureOf(error);\n if (onStoreFailure === \"open\") return { allowed: true, remaining: 0, failure };\n return { allowed: false, retryAfter: { ...closedAfter }, cause: \"store\", failure };\n }\n };\n return {\n name,\n spec: {\n key: spec.key,\n policy: { ...spec.policy },\n store: { ...spec.store },\n evict: { maxKeys: { ...spec.evict.maxKeys } },\n },\n rule,\n maxKeys,\n take,\n };\n};\n","import type { Machine, TransitionDef } from \"@mark1russell7/algebra\";\nimport type { KeyState, LimitPolicy, LimitRule } from \"./policy.ts\";\nimport { decide, freeAt } from \"./policy.ts\";\n\nconst t = (id: string, from: string | readonly string[], on: string | readonly string[], to: string, extra: Partial<TransitionDef> = {}): TransitionDef => ({\n id,\n from,\n on,\n to,\n ...extra,\n});\nconst count = (key: string) => ({ key, scope: \"limiter\", unit: \"count\", default: null }) as const;\n\n/**\n * A limiter state is the state of one key of a keyed limiter, as its machine document names it:\n * - `new`: the store holds no state for the key, or a state that is equal to the state of a new key.\n * - `open`: the key holds a count, and its next take is permitted.\n * - `limited`: the next take of the key is refused with the cause `limit`, until a unit is back.\n */\nexport type LimiterState = \"new\" | \"open\" | \"limited\";\n\n/** These are the states of a key that a store can hold. A store fails in each of them. */\nconst HELD = [\"new\", \"open\", \"limited\"] as const;\n\n/** These are the parts of each document of a limiter that do not change with its policy. */\nconst COMMON = {\n format: \"mark1russell7.machine/1\",\n layer: \"self\",\n version: \"0.1.0\",\n sources: [\n { ref: \"packages/service/src/limiter (the runtime implements this document: decide, memoryStore, keyedLimiter)\", rung: \"implemented\" },\n { ref: \"RFC 6585 §4: 429 Too Many Requests, which can carry Retry-After\", rung: \"normative\" },\n { ref: \"RFC 9110 §10.2.3: Retry-After, as delay-seconds or an HTTP-date\", rung: \"normative\" },\n ],\n conditions: {\n \"store.local\": \"the counts are in the memory of one replica: a limit L over N replicas is L / N on each replica, and that sum holds only on average\",\n \"store.shared\": \"the counts are in a store that the replicas share: one atomic step on the clock of the store decides each take\",\n },\n states: {\n new: { initial: true, note: \"the store holds no state for the key, or a state equal to a new key. The store can remove the key\" },\n open: { note: \"the key holds a count, and its next take is permitted\" },\n limited: { note: \"the next take is refused with the cause limit, until a unit is back\" },\n },\n} as const;\n\n/** These are the events of each document of a limiter. */\nconst EVENTS = {\n take: { kind: \"app\", note: \"one call of take(key): one request of the key. A permitted take uses one unit\" },\n \"unit.back\": { kind: \"timer\", note: \"the next take of a limited key is permitted again\" },\n idle: { kind: \"timer\", note: \"the key is equal to a new key. The store can remove it, and no decision changes\" },\n \"store.fail\": { kind: \"local\", note: \"a shared store fails the take. The state of the key does not change\" },\n} as const;\n\n/** These are the knobs of each document of a limiter that do not change with its policy. */\nconst KNOBS = {\n max_keys: count(\"limiters.<name>.evict.maxKeys\"),\n on_store_failure: { key: \"limiters.<name>.store.onStoreFailure\", scope: \"limiter\", unit: null, default: null },\n} as const;\n\n/**\n * These are the transitions of each document of a limiter that do not change with its policy. They\n * are the refusal of a limited key, a new key at the cap of keys, and a failure of a shared store.\n */\nconst COMMON_TRANSITIONS: readonly TransitionDef[] = [\n t(\"refuse\", \"limited\", \"take\", \"limited\", {\n emits: [\"429 limit\"],\n note: \"Retry-After is the time until the next take is permitted, in whole seconds, rounded up. The count of the key does not change\",\n }),\n t(\"cap\", \"new\", \"take\", \"new\", {\n guard: \"the store holds max_keys keys for the limiter, and no held key is equal to a new key\",\n emits: [\"429 cap\"],\n note: \"Retry-After is the time until the earliest held key is free: at most the idle span. A held key keeps its count\",\n }),\n ...HELD.map((state) =>\n t(`store-failed-${state}`, state, \"store.fail\", state, {\n guard: \"the store is shared\",\n emits: [\"allow, or 429 store\"],\n note: \"on_store_failure open lets the take in, with remaining 0. closed refuses it with the cause store, and its Retry-After is the longest of the policy\",\n }),\n ),\n];\n\n/**\n * A token bucket of one key (GCRA), as a `mark1russell7.machine/1` document. The bucket holds\n * `burst` tokens, and it gets one token back in each interval, `1 / rate`. The store keeps one time\n * for the key: when its bucket is full again.\n * - A take is permitted when, with the take, the bucket is full again in at most `burst` intervals.\n * - A refused take waits until one token is back: at most one interval. That interval is the\n * longest `Retry-After` of the policy (`retry_after@limiter` of the law).\n * - After `burst / rate` with no take, the bucket is full, and the key is equal to a new key. That\n * span is the idle span, and the longest wait of a new key at the cap of keys\n * (`retry_after_at_cap@limiter`).\n */\nexport const TOKEN_BUCKET_MACHINE: Machine = {\n ...COMMON,\n id: \"service.machine.limiter.token-bucket\",\n title: \"A token bucket of one key of the keyed limiter\",\n events: EVENTS,\n knobs: {\n rate: { key: \"limiters.<name>.policy.rate\", scope: \"limiter\", unit: \"count/s\", default: null },\n burst: count(\"limiters.<name>.policy.burst\"),\n ...KNOBS,\n },\n timers: {\n token: {\n duration: { expr: \"1 / rate\", unit: \"s\" },\n early: { expr: \"1 / rate\", unit: \"s\" },\n arms: [\"enter:limited\"],\n cancels: [\"idle\"],\n fires: \"unit.back\",\n note: \"one token comes back at most one interval after the take that used the last token. The Retry-After of each refusal is the time to this firing\",\n },\n full: {\n duration: { expr: \"burst / rate\", unit: \"s\" },\n early: { expr: \"(burst - 1) / rate\", unit: \"s\" },\n arms: [\"take\"],\n fires: \"idle\",\n note: \"the bucket is full again from one to burst intervals after a permitted take. A refused take does not move it\",\n },\n },\n transitions: [\n t(\"first\", \"new\", \"take\", \"open\", { guard: \"burst > 1\", emits: [\"allow\"] }),\n t(\"first-last\", \"new\", \"take\", \"limited\", { guard: \"burst = 1\", emits: [\"allow\"] }),\n t(\"take\", \"open\", \"take\", \"open\", { guard: \"a token remains after the take\", emits: [\"allow\"] }),\n t(\"take-last\", \"open\", \"take\", \"limited\", { guard: \"the take uses the last token\", emits: [\"allow\"] }),\n ...COMMON_TRANSITIONS,\n t(\"token-back\", \"limited\", \"unit.back\", \"open\", { timer: \"token\", guard: \"burst > 1\" }),\n t(\"full\", \"open\", \"idle\", \"new\", { timer: \"full\" }),\n t(\"full-at-once\", \"limited\", \"idle\", \"new\", {\n timer: \"full\",\n guard: \"burst = 1: the one token is back when the bucket is full\",\n }),\n ],\n};\n\n/**\n * A sliding window of one key, as a `mark1russell7.machine/1` document. The store keeps the time of\n * each permitted take of the key in the window, and each take counts for one window from its time.\n * - A take is permitted when fewer than `limit` takes are in the window.\n * - A refused take waits until the oldest take leaves the window: at most one window. That window is\n * the longest `Retry-After` of the policy (`retry_after@limiter` of the law).\n * - One window after the last take, no take is in the window, and the key is equal to a new key.\n * That window is the idle span, and the longest wait of a new key at the cap of keys\n * (`retry_after_at_cap@limiter`).\n */\nexport const SLIDING_WINDOW_MACHINE: Machine = {\n ...COMMON,\n id: \"service.machine.limiter.sliding-window\",\n title: \"A sliding window of one key of the keyed limiter\",\n events: EVENTS,\n knobs: {\n limit: count(\"limiters.<name>.policy.limit\"),\n window: { key: \"limiters.<name>.policy.window\", scope: \"limiter\", unit: \"s\", default: null },\n ...KNOBS,\n },\n timers: {\n oldest: {\n duration: { knob: \"window\", unit: \"s\" },\n early: { knob: \"window\", unit: \"s\" },\n arms: [\"enter:limited\"],\n cancels: [\"idle\"],\n fires: \"unit.back\",\n note: \"the oldest take leaves the window at most one window after the take that filled it. The Retry-After of each refusal is the time to this firing\",\n },\n last: {\n duration: { knob: \"window\", unit: \"s\" },\n arms: [\"take\"],\n fires: \"idle\",\n note: \"the last permitted take leaves the window one window after its time. A refused take does not move it\",\n },\n },\n transitions: [\n t(\"first\", \"new\", \"take\", \"open\", { guard: \"limit > 1\", emits: [\"allow\"] }),\n t(\"first-last\", \"new\", \"take\", \"limited\", { guard: \"limit = 1\", emits: [\"allow\"] }),\n t(\"take\", \"open\", \"take\", \"open\", { guard: \"fewer than limit - 1 takes are in the window before the take\", emits: [\"allow\"] }),\n t(\"take-last\", \"open\", \"take\", \"limited\", { guard: \"the take is the limit-th take in the window\", emits: [\"allow\"] }),\n ...COMMON_TRANSITIONS,\n t(\"oldest-leaves\", \"limited\", \"unit.back\", \"open\", { timer: \"oldest\", guard: \"a later take stays in the window\" }),\n t(\"last-leaves\", \"open\", \"idle\", \"new\", { timer: \"last\" }),\n t(\"all-leave\", \"limited\", \"idle\", \"new\", {\n timer: \"last\",\n guard: \"each take of the window has one time: limit = 1, or each take came at once\",\n }),\n ],\n};\n\n/** This function gives the machine document of the policy of a limiter. */\nexport const limiterMachine = (policy: LimitPolicy): Machine =>\n policy.type === \"token-bucket\" ? TOKEN_BUCKET_MACHINE : SLIDING_WINDOW_MACHINE;\n\n/**\n * This function gives the state of a key of a store as its machine document names it, at the time\n * `now` in milliseconds. `state` is what the store keeps for the key, or `undefined` when it keeps\n * nothing. A key equal to a new key is `new`, and a key whose next take `decide` refuses is `limited`.\n */\nexport const limiterStateOf = (rule: LimitRule, state: KeyState | undefined, now: number): LimiterState => {\n if (state === undefined || freeAt(rule, state) <= now) return \"new\";\n return decide(rule, state, now).decision.allowed ? \"open\" : \"limited\";\n};\n"],"mappings":";;;AAmDA,MAAM,MAAM,WAA6B;CAAE;CAAO,MAAM;AAAK;;;;;;;;;;;AAY7D,MAAa,eAAe,UAA8B;CACxD,MAAM,yBAAS,IAAI,IAAmB;CACtC,MAAM,SAAS,OAAc,MAAiB,QAAsB;EAClE,IAAI,OAAO,OAAO;EAClB,KAAK,MAAM,CAAC,KAAK,UAAU,MAAM,QAAQ;GACvC,MAAM,OAAO,OAAO,MAAM,KAAK;GAC/B,IAAI,QAAQ,KAAK,MAAM,OAAO,OAAO,GAAG;QACnC,OAAO,KAAK,IAAI,MAAM,IAAI;EACjC;EACA,MAAM,OAAO;CACf;CACA,OAAO;EACL,MAAM;EACN,KAAK,EAAE,SAAS,KAAK,MAAM,WAAW;GACpC,MAAM,MAAM,MAAM,IAAI;GACtB,IAAI,QAAQ,OAAO,IAAI,OAAO;GAC9B,IAAI,UAAU,KAAA,GAAW;IACvB,QAAQ;KAAE,wBAAQ,IAAI,IAAI;KAAG,MAAM,OAAO;IAAkB;IAC5D,OAAO,IAAI,SAAS,KAAK;GAC3B;GACA,IAAI,QAAQ,MAAM,OAAO,IAAI,GAAG;GAEhC,IAAI,UAAU,KAAA,KAAa,OAAO,MAAM,KAAK,KAAK,KAAK;IACrD,MAAM,OAAO,OAAO,GAAG;IACvB,QAAQ,KAAA;GACV;GACA,IAAI,UAAU,KAAA,KAAa,MAAM,OAAO,QAAQ,SAAS;IACvD,IAAI,MAAM,QAAQ,KAAK,MAAM,OAAO,MAAM,GAAG;IAC7C,IAAI,MAAM,OAAO,QAAQ,SAAS,OAAO;KAAE,SAAS;KAAO,YAAY,GAAG,MAAM,OAAO,GAAG;KAAG,OAAO;IAAM;GAC5G;GACA,MAAM,OAAO,OAAO,MAAM,OAAO,GAAG;GACpC,IAAI,UAAU,KAAA,GAAW;IAEvB,MAAM,OAAO,IAAI,KAAK,KAAK,KAAK;IAChC,MAAM,OAAO,KAAK,IAAI,MAAM,MAAM,OAAO,MAAM,KAAK,KAAK,CAAC;GAC5D,OAAO,MAAM,OAAO,IAAI,KAAK,KAAK,KAAK;GACvC,OAAO,KAAK;EACd;EACA,KAAK,SAAS;GACZ,OAAO,OAAO,IAAI,OAAO,CAAC,EAAE,OAAO,QAAQ;EAC7C;CACF;AACF;;AAkBA,MAAM,aAAa,UAA4B,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;;;;;;;;;;AAWpG,MAAa,gBAAgB,MAAc,MAAmB,UAAsC;CAClG,MAAM,WAAW,gBAAgB,MAAM,IAAI;CAC3C,IAAI,SAAS,SAAS,GAAG,MAAM,IAAI,MAAM,SAAS,KAAK,IAAI,CAAC;CAC5D,IAAI,MAAM,SAAS,KAAK,MAAM,MAC5B,MAAM,IAAI,MAAM,WAAW,KAAK,cAAc,KAAK,MAAM,KAAK,uCAAuC,MAAM,MAAM;CACnH,MAAM,OAAO,UAAU,KAAK,MAAM;CAClC,MAAM,UAAUA,UAAE,SAAS,aAAaA,UAAE,WAAW,KAAK,MAAM,QAAQ,KAAK,GAAG,KAAK,MAAM,QAAQ,MAAM,OAAO,CAAC;CACjH,MAAM,iBAAiB,KAAK,MAAM,SAAS,WAAW,KAAK,MAAM,iBAAiB,KAAA;CAClF,MAAM,cAAc,kBAAkB,KAAK,MAAM;CACjD,MAAM,OAAO,OAAO,QAAmC;EACrD,MAAM,UAAuB;GAAE,SAAS;GAAM;GAAK;GAAM;EAAQ;EACjE,IAAI,mBAAmB,KAAA,GAAW,OAAO,MAAM,KAAK,OAAO;EAC3D,IAAI;GACF,OAAO,MAAM,MAAM,KAAK,OAAO;EACjC,SAAS,OAAO;GACd,MAAM,UAAU,UAAU,KAAK;GAC/B,IAAI,mBAAmB,QAAQ,OAAO;IAAE,SAAS;IAAM,WAAW;IAAG;GAAQ;GAC7E,OAAO;IAAE,SAAS;IAAO,YAAY,EAAE,GAAG,YAAY;IAAG,OAAO;IAAS;GAAQ;EACnF;CACF;CACA,OAAO;EACL;EACA,MAAM;GACJ,KAAK,KAAK;GACV,QAAQ,EAAE,GAAG,KAAK,OAAO;GACzB,OAAO,EAAE,GAAG,KAAK,MAAM;GACvB,OAAO,EAAE,SAAS,EAAE,GAAG,KAAK,MAAM,QAAQ,EAAE;EAC9C;EACA;EACA;EACA;CACF;AACF;;;AClKA,MAAM,KAAK,IAAY,MAAkC,IAAgC,IAAY,QAAgC,CAAC,OAAsB;CAC1J;CACA;CACA;CACA;CACA,GAAG;AACL;AACA,MAAM,SAAS,SAAiB;CAAE;CAAK,OAAO;CAAW,MAAM;CAAS,SAAS;AAAK;;AAWtF,MAAM,OAAO;CAAC;CAAO;CAAQ;AAAS;;AAGtC,MAAM,SAAS;CACb,QAAQ;CACR,OAAO;CACP,SAAS;CACT,SAAS;EACP;GAAE,KAAK;GAA0G,MAAM;EAAc;EACrI;GAAE,KAAK;GAAmE,MAAM;EAAY;EAC5F;GAAE,KAAK;GAAmE,MAAM;EAAY;CAC9F;CACA,YAAY;EACV,eAAe;EACf,gBAAgB;CAClB;CACA,QAAQ;EACN,KAAK;GAAE,SAAS;GAAM,MAAM;EAAoG;EAChI,MAAM,EAAE,MAAM,wDAAwD;EACtE,SAAS,EAAE,MAAM,sEAAsE;CACzF;AACF;;AAGA,MAAM,SAAS;CACb,MAAM;EAAE,MAAM;EAAO,MAAM;CAAgF;CAC3G,aAAa;EAAE,MAAM;EAAS,MAAM;CAAoD;CACxF,MAAM;EAAE,MAAM;EAAS,MAAM;CAAkF;CAC/G,cAAc;EAAE,MAAM;EAAS,MAAM;CAAsE;AAC7G;;AAGA,MAAM,QAAQ;CACZ,UAAU,MAAM,+BAA+B;CAC/C,kBAAkB;EAAE,KAAK;EAAwC,OAAO;EAAW,MAAM;EAAM,SAAS;CAAK;AAC/G;;;;;AAMA,MAAM,qBAA+C;CACnD,EAAE,UAAU,WAAW,QAAQ,WAAW;EACxC,OAAO,CAAC,WAAW;EACnB,MAAM;CACR,CAAC;CACD,EAAE,OAAO,OAAO,QAAQ,OAAO;EAC7B,OAAO;EACP,OAAO,CAAC,SAAS;EACjB,MAAM;CACR,CAAC;CACD,GAAG,KAAK,KAAK,UACX,EAAE,gBAAgB,SAAS,OAAO,cAAc,OAAO;EACrD,OAAO;EACP,OAAO,CAAC,qBAAqB;EAC7B,MAAM;CACR,CAAC,CACH;AACF;;;;;;;;;;;;AAaA,MAAa,uBAAgC;CAC3C,GAAG;CACH,IAAI;CACJ,OAAO;CACP,QAAQ;CACR,OAAO;EACL,MAAM;GAAE,KAAK;GAA+B,OAAO;GAAW,MAAM;GAAW,SAAS;EAAK;EAC7F,OAAO,MAAM,8BAA8B;EAC3C,GAAG;CACL;CACA,QAAQ;EACN,OAAO;GACL,UAAU;IAAE,MAAM;IAAY,MAAM;GAAI;GACxC,OAAO;IAAE,MAAM;IAAY,MAAM;GAAI;GACrC,MAAM,CAAC,eAAe;GACtB,SAAS,CAAC,MAAM;GAChB,OAAO;GACP,MAAM;EACR;EACA,MAAM;GACJ,UAAU;IAAE,MAAM;IAAgB,MAAM;GAAI;GAC5C,OAAO;IAAE,MAAM;IAAsB,MAAM;GAAI;GAC/C,MAAM,CAAC,MAAM;GACb,OAAO;GACP,MAAM;EACR;CACF;CACA,aAAa;EACX,EAAE,SAAS,OAAO,QAAQ,QAAQ;GAAE,OAAO;GAAa,OAAO,CAAC,OAAO;EAAE,CAAC;EAC1E,EAAE,cAAc,OAAO,QAAQ,WAAW;GAAE,OAAO;GAAa,OAAO,CAAC,OAAO;EAAE,CAAC;EAClF,EAAE,QAAQ,QAAQ,QAAQ,QAAQ;GAAE,OAAO;GAAkC,OAAO,CAAC,OAAO;EAAE,CAAC;EAC/F,EAAE,aAAa,QAAQ,QAAQ,WAAW;GAAE,OAAO;GAAgC,OAAO,CAAC,OAAO;EAAE,CAAC;EACrG,GAAG;EACH,EAAE,cAAc,WAAW,aAAa,QAAQ;GAAE,OAAO;GAAS,OAAO;EAAY,CAAC;EACtF,EAAE,QAAQ,QAAQ,QAAQ,OAAO,EAAE,OAAO,OAAO,CAAC;EAClD,EAAE,gBAAgB,WAAW,QAAQ,OAAO;GAC1C,OAAO;GACP,OAAO;EACT,CAAC;CACH;AACF;;;;;;;;;;;AAYA,MAAa,yBAAkC;CAC7C,GAAG;CACH,IAAI;CACJ,OAAO;CACP,QAAQ;CACR,OAAO;EACL,OAAO,MAAM,8BAA8B;EAC3C,QAAQ;GAAE,KAAK;GAAiC,OAAO;GAAW,MAAM;GAAK,SAAS;EAAK;EAC3F,GAAG;CACL;CACA,QAAQ;EACN,QAAQ;GACN,UAAU;IAAE,MAAM;IAAU,MAAM;GAAI;GACtC,OAAO;IAAE,MAAM;IAAU,MAAM;GAAI;GACnC,MAAM,CAAC,eAAe;GACtB,SAAS,CAAC,MAAM;GAChB,OAAO;GACP,MAAM;EACR;EACA,MAAM;GACJ,UAAU;IAAE,MAAM;IAAU,MAAM;GAAI;GACtC,MAAM,CAAC,MAAM;GACb,OAAO;GACP,MAAM;EACR;CACF;CACA,aAAa;EACX,EAAE,SAAS,OAAO,QAAQ,QAAQ;GAAE,OAAO;GAAa,OAAO,CAAC,OAAO;EAAE,CAAC;EAC1E,EAAE,cAAc,OAAO,QAAQ,WAAW;GAAE,OAAO;GAAa,OAAO,CAAC,OAAO;EAAE,CAAC;EAClF,EAAE,QAAQ,QAAQ,QAAQ,QAAQ;GAAE,OAAO;GAAgE,OAAO,CAAC,OAAO;EAAE,CAAC;EAC7H,EAAE,aAAa,QAAQ,QAAQ,WAAW;GAAE,OAAO;GAA+C,OAAO,CAAC,OAAO;EAAE,CAAC;EACpH,GAAG;EACH,EAAE,iBAAiB,WAAW,aAAa,QAAQ;GAAE,OAAO;GAAU,OAAO;EAAmC,CAAC;EACjH,EAAE,eAAe,QAAQ,QAAQ,OAAO,EAAE,OAAO,OAAO,CAAC;EACzD,EAAE,aAAa,WAAW,QAAQ,OAAO;GACvC,OAAO;GACP,OAAO;EACT,CAAC;CACH;AACF;;AAGA,MAAa,kBAAkB,WAC7B,OAAO,SAAS,iBAAiB,uBAAuB;;;;;;AAO1D,MAAa,kBAAkB,MAAiB,OAA6B,QAA8B;CACzG,IAAI,UAAU,KAAA,KAAa,OAAO,MAAM,KAAK,KAAK,KAAK,OAAO;CAC9D,OAAO,OAAO,MAAM,OAAO,GAAG,CAAC,CAAC,SAAS,UAAU,SAAS;AAC9D"}
|