@mark1russell7/service 0.8.18 → 0.8.20

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.
Files changed (332) hide show
  1. package/README.md +19 -0
  2. package/build/backoff.d.ts +44 -2
  3. package/build/{builder-zO48Vgoj.d.ts → builder.d.ts} +14 -101
  4. package/build/builder.js +499 -0
  5. package/build/builder.js.map +1 -0
  6. package/build/{call-context-DDhcVvn5.d.ts → call-context.d.ts} +3 -4
  7. package/build/channel.d.ts +1 -1
  8. package/build/{core-BSzt4RI2.d.ts → client/core.d.ts} +32 -61
  9. package/build/{machine-BhVeHr_m.js → client/core.js} +4 -153
  10. package/build/client/core.js.map +1 -0
  11. package/build/{dial-ChwIcvd4.d.ts → client/dial.d.ts} +3 -4
  12. package/build/client/dial.js +52 -0
  13. package/build/client/dial.js.map +1 -0
  14. package/build/client/machine.js +29 -0
  15. package/build/client/machine.js.map +1 -0
  16. package/build/client/meets.d.ts +35 -0
  17. package/build/client/meets.js +78 -0
  18. package/build/client/meets.js.map +1 -0
  19. package/build/clock.d.ts +1 -1
  20. package/build/conformance.d.ts +122 -0
  21. package/build/conformance.js +470 -0
  22. package/build/conformance.js.map +1 -0
  23. package/build/contract.d.ts +28 -0
  24. package/build/contract.js +184 -0
  25. package/build/contract.js.map +1 -0
  26. package/build/description.d.ts +161 -0
  27. package/build/description.js +11 -0
  28. package/build/description.js.map +1 -0
  29. package/build/drains.js +35 -0
  30. package/build/drains.js.map +1 -0
  31. package/build/events.d.ts +25 -0
  32. package/build/fakes.d.ts +43 -0
  33. package/build/fakes.js +93 -0
  34. package/build/fakes.js.map +1 -0
  35. package/build/grpc/client.d.ts +153 -0
  36. package/build/grpc/client.js +474 -0
  37. package/build/grpc/client.js.map +1 -0
  38. package/build/grpc/connection.d.ts +97 -0
  39. package/build/grpc/connection.js +59 -0
  40. package/build/grpc/connection.js.map +1 -0
  41. package/build/grpc/machine.d.ts +12 -0
  42. package/build/grpc/machine.js +149 -0
  43. package/build/grpc/machine.js.map +1 -0
  44. package/build/grpc/meets.d.ts +14 -0
  45. package/build/grpc/meets.js +105 -0
  46. package/build/grpc/meets.js.map +1 -0
  47. package/build/grpc/starting.d.ts +33 -0
  48. package/build/grpc/starting.js +89 -0
  49. package/build/grpc/starting.js.map +1 -0
  50. package/build/grpc.d.ts +9 -303
  51. package/build/grpc.js +7 -854
  52. package/build/health.d.ts +93 -0
  53. package/build/health.js +223 -0
  54. package/build/health.js.map +1 -0
  55. package/build/heartbeat.d.ts +1 -1
  56. package/build/host/discovery.d.ts +61 -0
  57. package/build/host/discovery.js +113 -0
  58. package/build/host/discovery.js.map +1 -0
  59. package/build/host/env.d.ts +14 -0
  60. package/build/host/env.js +57 -0
  61. package/build/host/env.js.map +1 -0
  62. package/build/host/fakes.d.ts +82 -0
  63. package/build/host/fakes.js +239 -0
  64. package/build/host/fakes.js.map +1 -0
  65. package/build/host/group.d.ts +142 -0
  66. package/build/host/group.js +517 -0
  67. package/build/host/group.js.map +1 -0
  68. package/build/host/install.d.ts +96 -0
  69. package/build/host/install.js +330 -0
  70. package/build/host/install.js.map +1 -0
  71. package/build/host/lock.d.ts +78 -0
  72. package/build/host/lock.js +190 -0
  73. package/build/host/lock.js.map +1 -0
  74. package/build/host/logs.d.ts +26 -0
  75. package/build/host/logs.js +48 -0
  76. package/build/host/logs.js.map +1 -0
  77. package/build/host/node.d.ts +14 -0
  78. package/build/host/node.js +309 -0
  79. package/build/host/node.js.map +1 -0
  80. package/build/{ports-B1ayTL-j.d.ts → host/ports.d.ts} +15 -16
  81. package/build/host/ports.js +17 -0
  82. package/build/host/ports.js.map +1 -0
  83. package/build/host/probes.d.ts +51 -0
  84. package/build/host/probes.js +139 -0
  85. package/build/host/probes.js.map +1 -0
  86. package/build/host/processes.d.ts +32 -0
  87. package/build/host/processes.js +63 -0
  88. package/build/host/processes.js.map +1 -0
  89. package/build/host/render.d.ts +84 -0
  90. package/build/host/render.js +235 -0
  91. package/build/host/render.js.map +1 -0
  92. package/build/host/watch.d.ts +90 -0
  93. package/build/host/watch.js +165 -0
  94. package/build/host/watch.js.map +1 -0
  95. package/build/host.d.ts +13 -671
  96. package/build/host.js +12 -2126
  97. package/build/http/answers.js +29 -0
  98. package/build/http/answers.js.map +1 -0
  99. package/build/http/fake-server.js +61 -0
  100. package/build/http/fake-server.js.map +1 -0
  101. package/build/http/outcome.d.ts +115 -0
  102. package/build/http/outcome.js +325 -0
  103. package/build/http/outcome.js.map +1 -0
  104. package/build/http/probes.d.ts +83 -0
  105. package/build/http/probes.js +232 -0
  106. package/build/http/probes.js.map +1 -0
  107. package/build/http/transport.d.ts +165 -0
  108. package/build/http/transport.js +517 -0
  109. package/build/http/transport.js.map +1 -0
  110. package/build/http-client/client.d.ts +121 -0
  111. package/build/http-client/client.js +330 -0
  112. package/build/http-client/client.js.map +1 -0
  113. package/build/http-client/connection.d.ts +78 -0
  114. package/build/http-client/connection.js +54 -0
  115. package/build/http-client/connection.js.map +1 -0
  116. package/build/http-client/machine.d.ts +14 -0
  117. package/build/http-client/machine.js +109 -0
  118. package/build/http-client/machine.js.map +1 -0
  119. package/build/http-client/meets.d.ts +11 -0
  120. package/build/http-client/meets.js +74 -0
  121. package/build/http-client/meets.js.map +1 -0
  122. package/build/http-client/session.d.ts +87 -0
  123. package/build/http-client/session.js +99 -0
  124. package/build/http-client/session.js.map +1 -0
  125. package/build/http-client/starting.d.ts +25 -0
  126. package/build/http-client/starting.js +65 -0
  127. package/build/http-client/starting.js.map +1 -0
  128. package/build/http-client.d.ts +9 -330
  129. package/build/http-client.js +8 -707
  130. package/build/http.d.ts +5 -353
  131. package/build/http.js +3 -1086
  132. package/build/identity.d.ts +16 -0
  133. package/build/identity.js +44 -0
  134. package/build/identity.js.map +1 -0
  135. package/build/index.d.ts +35 -412
  136. package/build/index.js +24 -3277
  137. package/build/knobs.d.ts +1 -0
  138. package/build/{knobs-BJcz6m01.js → knobs.js} +2 -34
  139. package/build/knobs.js.map +1 -0
  140. package/build/latch.d.ts +29 -0
  141. package/build/latch.js +122 -0
  142. package/build/latch.js.map +1 -0
  143. package/build/{rules-HyFCBStQ.d.ts → law.d.ts} +19 -37
  144. package/build/law.js +149 -0
  145. package/build/law.js.map +1 -0
  146. package/build/lifecycle.d.ts +144 -0
  147. package/build/lifecycle.js +411 -0
  148. package/build/lifecycle.js.map +1 -0
  149. package/build/limiter/machine.d.ts +40 -0
  150. package/build/limiter/machine.js +279 -0
  151. package/build/limiter/machine.js.map +1 -0
  152. package/build/{policy-CBcK2XGg.d.ts → limiter/policy.d.ts} +28 -29
  153. package/build/{policy-UYALkqVq.js → limiter/policy.js} +10 -9
  154. package/build/limiter/policy.js.map +1 -0
  155. package/build/{limiter-Cm8nC-Gd.d.ts → limiter/quota.d.ts} +50 -76
  156. package/build/{limiter-Bgy6Gmvl.js → limiter/quota.js} +32 -425
  157. package/build/limiter/quota.js.map +1 -0
  158. package/build/{store-DFwFKrsB.d.ts → limiter/store.d.ts} +10 -11
  159. package/build/limiter/store.js +145 -0
  160. package/build/limiter/store.js.map +1 -0
  161. package/build/limiter.d.ts +4 -3
  162. package/build/limiter.js +4 -2
  163. package/build/lint.d.ts +152 -0
  164. package/build/lint.js +576 -0
  165. package/build/lint.js.map +1 -0
  166. package/build/logger.d.ts +71 -0
  167. package/build/logger.js +183 -0
  168. package/build/logger.js.map +1 -0
  169. package/build/machines.d.ts +41 -0
  170. package/build/machines.js +451 -0
  171. package/build/machines.js.map +1 -0
  172. package/build/metrics.d.ts +53 -0
  173. package/build/metrics.js +111 -0
  174. package/build/metrics.js.map +1 -0
  175. package/build/mongodb/client.d.ts +131 -0
  176. package/build/mongodb/client.js +388 -0
  177. package/build/mongodb/client.js.map +1 -0
  178. package/build/mongodb/connection.d.ts +112 -0
  179. package/build/mongodb/connection.js +12 -0
  180. package/build/mongodb/connection.js.map +1 -0
  181. package/build/mongodb/machine.d.ts +14 -0
  182. package/build/mongodb/machine.js +122 -0
  183. package/build/mongodb/machine.js.map +1 -0
  184. package/build/mongodb/meets.d.ts +15 -0
  185. package/build/mongodb/meets.js +103 -0
  186. package/build/mongodb/meets.js.map +1 -0
  187. package/build/mongodb/starting.d.ts +29 -0
  188. package/build/mongodb/starting.js +77 -0
  189. package/build/mongodb/starting.js.map +1 -0
  190. package/build/mongodb.d.ts +8 -296
  191. package/build/mongodb.js +7 -682
  192. package/build/operation.d.ts +27 -0
  193. package/build/{operation-DF73RZOI.js → operation.js} +2 -2
  194. package/build/operation.js.map +1 -0
  195. package/build/otel.d.ts +2 -2
  196. package/build/pg/client.d.ts +96 -0
  197. package/build/pg/client.js +277 -0
  198. package/build/pg/client.js.map +1 -0
  199. package/build/pg/connection.d.ts +75 -0
  200. package/build/pg/connection.js +11 -0
  201. package/build/pg/connection.js.map +1 -0
  202. package/build/pg/machine.d.ts +13 -0
  203. package/build/pg/machine.js +111 -0
  204. package/build/pg/machine.js.map +1 -0
  205. package/build/pg/meets.d.ts +14 -0
  206. package/build/pg/meets.js +83 -0
  207. package/build/pg/meets.js.map +1 -0
  208. package/build/pg/starting.d.ts +26 -0
  209. package/build/pg/starting.js +62 -0
  210. package/build/pg/starting.js.map +1 -0
  211. package/build/pg.d.ts +8 -219
  212. package/build/pg.js +7 -525
  213. package/build/poller.d.ts +9 -0
  214. package/build/poller.js +152 -0
  215. package/build/poller.js.map +1 -0
  216. package/build/process.d.ts +114 -0
  217. package/build/process.js +170 -0
  218. package/build/process.js.map +1 -0
  219. package/build/profiles.d.ts +68 -0
  220. package/build/profiles.js +120 -0
  221. package/build/profiles.js.map +1 -0
  222. package/build/{queue-DXdw1vLO.d.ts → queue.d.ts} +16 -29
  223. package/build/queue.js +279 -0
  224. package/build/queue.js.map +1 -0
  225. package/build/rabbitmq/client.d.ts +144 -0
  226. package/build/rabbitmq/client.js +426 -0
  227. package/build/rabbitmq/client.js.map +1 -0
  228. package/build/rabbitmq/connection.d.ts +91 -0
  229. package/build/rabbitmq/connection.js +15 -0
  230. package/build/rabbitmq/connection.js.map +1 -0
  231. package/build/rabbitmq/machine.d.ts +13 -0
  232. package/build/rabbitmq/machine.js +159 -0
  233. package/build/rabbitmq/machine.js.map +1 -0
  234. package/build/rabbitmq/meets.d.ts +12 -0
  235. package/build/rabbitmq/meets.js +96 -0
  236. package/build/rabbitmq/meets.js.map +1 -0
  237. package/build/rabbitmq/starting.d.ts +27 -0
  238. package/build/rabbitmq/starting.js +67 -0
  239. package/build/rabbitmq/starting.js.map +1 -0
  240. package/build/rabbitmq.d.ts +8 -283
  241. package/build/rabbitmq.js +7 -742
  242. package/build/redis/client.d.ts +86 -0
  243. package/build/redis/client.js +285 -0
  244. package/build/redis/client.js.map +1 -0
  245. package/build/redis/connection.d.ts +57 -0
  246. package/build/redis/connection.js +11 -0
  247. package/build/redis/connection.js.map +1 -0
  248. package/build/redis/limiter.d.ts +43 -0
  249. package/build/redis/limiter.js +164 -0
  250. package/build/redis/limiter.js.map +1 -0
  251. package/build/redis/machine.d.ts +12 -0
  252. package/build/redis/machine.js +144 -0
  253. package/build/redis/machine.js.map +1 -0
  254. package/build/redis/meets.d.ts +11 -0
  255. package/build/redis/meets.js +75 -0
  256. package/build/redis/meets.js.map +1 -0
  257. package/build/redis/operations.d.ts +5 -0
  258. package/build/redis/operations.js +114 -0
  259. package/build/redis/operations.js.map +1 -0
  260. package/build/redis.d.ts +10 -207
  261. package/build/redis.js +9 -771
  262. package/build/requests.d.ts +66 -0
  263. package/build/requests.js +279 -0
  264. package/build/requests.js.map +1 -0
  265. package/build/retrier.d.ts +62 -0
  266. package/build/{retrier-Dnjhvxol.js → retrier.js} +2 -2
  267. package/build/retrier.js.map +1 -0
  268. package/build/routes.d.ts +35 -0
  269. package/build/routes.js +77 -0
  270. package/build/routes.js.map +1 -0
  271. package/build/rules.d.ts +19 -2
  272. package/build/stops.d.ts +51 -0
  273. package/build/stops.js +86 -0
  274. package/build/stops.js.map +1 -0
  275. package/build/testing.d.ts +8 -270
  276. package/build/testing.js +4 -1027
  277. package/build/testing.js.map +1 -1
  278. package/build/timing.d.ts +63 -0
  279. package/build/{timing-DZl36uXs.js → timing.js} +2 -2
  280. package/build/timing.js.map +1 -0
  281. package/build/units.d.ts +17 -0
  282. package/build/units.js +236 -0
  283. package/build/units.js.map +1 -0
  284. package/build/watchdog.d.ts +34 -0
  285. package/build/watchdog.js +53 -0
  286. package/build/watchdog.js.map +1 -0
  287. package/build/websocket/client.d.ts +136 -0
  288. package/build/websocket/client.js +422 -0
  289. package/build/websocket/client.js.map +1 -0
  290. package/build/websocket/connection.d.ts +83 -0
  291. package/build/websocket/connection.js +57 -0
  292. package/build/websocket/connection.js.map +1 -0
  293. package/build/websocket/machine.d.ts +12 -0
  294. package/build/websocket/machine.js +155 -0
  295. package/build/websocket/machine.js.map +1 -0
  296. package/build/websocket/meets.d.ts +14 -0
  297. package/build/websocket/meets.js +92 -0
  298. package/build/websocket/meets.js.map +1 -0
  299. package/build/websocket/starting.d.ts +25 -0
  300. package/build/websocket/starting.js +69 -0
  301. package/build/websocket/starting.js.map +1 -0
  302. package/build/websocket.d.ts +9 -264
  303. package/build/websocket.js +8 -774
  304. package/build/worker.d.ts +92 -0
  305. package/build/worker.js +153 -0
  306. package/build/worker.js.map +1 -0
  307. package/package.json +4 -3
  308. package/build/backoff-QTRGfkEK.d.ts +0 -45
  309. package/build/clock-DpVgpY4h.d.ts +0 -2
  310. package/build/grpc.js.map +0 -1
  311. package/build/host.js.map +0 -1
  312. package/build/http-client.js.map +0 -1
  313. package/build/http.js.map +0 -1
  314. package/build/index.js.map +0 -1
  315. package/build/knobs-BJcz6m01.js.map +0 -1
  316. package/build/lifecycle-D0J-zwZF.d.ts +0 -374
  317. package/build/limiter-Bgy6Gmvl.js.map +0 -1
  318. package/build/logger-B6drv9w0.d.ts +0 -488
  319. package/build/machine-BhVeHr_m.js.map +0 -1
  320. package/build/mongodb.js.map +0 -1
  321. package/build/operation-DF73RZOI.js.map +0 -1
  322. package/build/pg.js.map +0 -1
  323. package/build/policy-UYALkqVq.js.map +0 -1
  324. package/build/process-7R9M29wN.js +0 -437
  325. package/build/process-7R9M29wN.js.map +0 -1
  326. package/build/rabbitmq.js.map +0 -1
  327. package/build/redis.js.map +0 -1
  328. package/build/requests-DD2ALv0_.js +0 -583
  329. package/build/requests-DD2ALv0_.js.map +0 -1
  330. package/build/retrier-Dnjhvxol.js.map +0 -1
  331. package/build/timing-DZl36uXs.js.map +0 -1
  332. package/build/websocket.js.map +0 -1
@@ -1,420 +1,5 @@
1
- import { _ as wholeCount, a as freeAt, c as isTime, d as longestRetryAfter, f as milliseconds, g as unitsOf, h as safely, i as finiteAbove, l as limitRule, n as countOf, p as overCapacity, r as decide, s as isCount, u as limiterProblems } from "./policy-UYALkqVq.js";
2
- import { convertExact, rationals } from "@mark1russell7/quantity";
1
+ import { countOf, finiteAbove, isCount, isTime, milliseconds, safely, wholeCount } from "./policy.js";
3
2
  import { firstInstantOf, localTime } from "@mark1russell7/algebra/clock";
4
- // src/limiter/store.ts
5
- const ms = (value) => ({
6
- value,
7
- unit: "ms"
8
- });
9
- /**
10
- * This function makes the store of one replica. It reads time only through the clock. Thus a step
11
- * of the wall clock does not move a count, and a fake clock gives exact decisions in a test.
12
- * - The eviction is exact. A key whose bucket is full again, or whose window has no take, is equal
13
- * to a new key. The store removes it at its next take, or at a sweep.
14
- * - The count of keys has a bound. At the cap, a take of a new key sweeps the table, but only when
15
- * a held key can be free. Each sweep reads each key one time. When no key is free, the store
16
- * refuses the new key with the cause `cap`. Its `retryAfter` is at most the time until the
17
- * earliest held key is free, and that time is at most `idleSpan` of the policy.
18
- */
19
- const memoryStore = (clock) => {
20
- const tables = /* @__PURE__ */ new Map();
21
- const sweep = (table, rule, now) => {
22
- let next = Number.POSITIVE_INFINITY;
23
- for (const [key, state] of table.states) {
24
- const free = freeAt(rule, state);
25
- if (free <= now) table.states.delete(key);
26
- else next = Math.min(next, free);
27
- }
28
- table.next = next;
29
- };
30
- return {
31
- kind: "local",
32
- take({ limiter, key, rule, maxKeys, units }) {
33
- const n = unitsOf(units);
34
- const over = overCapacity(rule, n);
35
- if (over !== void 0) return over;
36
- const now = clock.now();
37
- let table = tables.get(limiter);
38
- if (table === void 0) {
39
- table = {
40
- states: /* @__PURE__ */ new Map(),
41
- next: Number.POSITIVE_INFINITY
42
- };
43
- tables.set(limiter, table);
44
- }
45
- let state = table.states.get(key);
46
- if (state !== void 0 && freeAt(rule, state) <= now) {
47
- table.states.delete(key);
48
- state = void 0;
49
- }
50
- if (state === void 0 && table.states.size >= maxKeys) {
51
- if (table.next <= now) sweep(table, rule, now);
52
- if (table.states.size >= maxKeys) return {
53
- allowed: false,
54
- retryAfter: ms(table.next - now),
55
- cause: "cap"
56
- };
57
- }
58
- const step = decide(rule, state, now, n);
59
- if (state === void 0) {
60
- table.states.set(key, step.state);
61
- table.next = Math.min(table.next, freeAt(rule, step.state));
62
- } else table.states.set(key, step.state);
63
- return step.decision;
64
- },
65
- size(limiter) {
66
- return tables.get(limiter)?.states.size ?? 0;
67
- }
68
- };
69
- };
70
- /** This function gives the text of a failure. */
71
- const failureOf = (error) => error instanceof Error ? error.message : String(error);
72
- function keyedLimiter(name, spec, store) {
73
- const problems = limiterProblems(name, spec);
74
- if (problems.length > 0) throw new Error(problems.join("; "));
75
- if (store.kind !== spec.store.kind) throw new Error(`limiter ${name} declares a ${spec.store.kind} store, but the store that it got is ${store.kind}`);
76
- const rule = limitRule(spec.policy);
77
- const maxKeys = rationals.toNumber(convertExact(rationals.fromNumber(spec.evict.maxKeys.value), spec.evict.maxKeys.unit, "count"));
78
- const onStoreFailure = spec.store.kind === "shared" ? spec.store.onStoreFailure : void 0;
79
- const closedAfter = longestRetryAfter(spec.policy);
80
- const take = async (key, units) => {
81
- const n = unitsOf(units);
82
- const over = overCapacity(rule, n);
83
- if (over !== void 0) return over;
84
- const request = {
85
- limiter: name,
86
- key,
87
- rule,
88
- maxKeys,
89
- units: n
90
- };
91
- if (onStoreFailure === void 0) return store.take(request);
92
- try {
93
- return await store.take(request);
94
- } catch (error) {
95
- const failure = failureOf(error);
96
- if (onStoreFailure === "open") return {
97
- allowed: true,
98
- remaining: 0,
99
- failure
100
- };
101
- return {
102
- allowed: false,
103
- retryAfter: { ...closedAfter },
104
- cause: "store",
105
- failure
106
- };
107
- }
108
- };
109
- const tryTakeSync = (key, units) => {
110
- if (store.kind === "shared") throw new Error(`limiter ${name} has a shared store, which decides in a promise: tryTakeSync needs a memory store, thus use take()`);
111
- const n = unitsOf(units);
112
- const over = overCapacity(rule, n);
113
- if (over !== void 0) return over;
114
- const decision = store.take({
115
- limiter: name,
116
- key,
117
- rule,
118
- maxKeys,
119
- units: n
120
- });
121
- if (isPromise$1(decision)) {
122
- decision.then(void 0, () => {});
123
- throw new Error(`limiter ${name} has a store whose take gives a promise: tryTakeSync needs a memory store, thus use take()`);
124
- }
125
- return decision;
126
- };
127
- return {
128
- name,
129
- spec: {
130
- key: spec.key,
131
- policy: { ...spec.policy },
132
- store: { ...spec.store },
133
- evict: { maxKeys: { ...spec.evict.maxKeys } }
134
- },
135
- rule,
136
- maxKeys,
137
- take,
138
- tryTakeSync
139
- };
140
- }
141
- /** This function tells if a decision of a store is a promise. */
142
- const isPromise$1 = (value) => typeof value.then === "function";
143
- // src/limiter/machine.ts
144
- const t = (id, from, on, to, extra = {}) => ({
145
- id,
146
- from,
147
- on,
148
- to,
149
- ...extra
150
- });
151
- const count = (key) => ({
152
- key,
153
- scope: "limiter",
154
- unit: "count",
155
- default: null
156
- });
157
- /** These are the states of a key that a store can hold. A store fails in each of them. */
158
- const HELD = [
159
- "new",
160
- "open",
161
- "limited"
162
- ];
163
- /** These are the parts of each document of a limiter that do not change with its policy. */
164
- const COMMON = {
165
- format: "mark1russell7.machine/1",
166
- layer: "self",
167
- version: "0.1.0",
168
- sources: [
169
- {
170
- ref: "packages/service/src/limiter (the runtime implements this document: decide, memoryStore, keyedLimiter)",
171
- rung: "implemented"
172
- },
173
- {
174
- ref: "RFC 6585 §4: 429 Too Many Requests, which can carry Retry-After",
175
- rung: "normative"
176
- },
177
- {
178
- ref: "RFC 9110 §10.2.3: Retry-After, as delay-seconds or an HTTP-date",
179
- rung: "normative"
180
- }
181
- ],
182
- conditions: {
183
- "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",
184
- "store.shared": "the counts are in a store that the replicas share: one atomic step on the clock of the store decides each take"
185
- },
186
- states: {
187
- new: {
188
- initial: true,
189
- note: "the store holds no state for the key, or a state equal to a new key. The store can remove the key"
190
- },
191
- open: { note: "the key holds a count, and its next take is permitted" },
192
- limited: { note: "the next take is refused with the cause limit, until a unit is back" }
193
- }
194
- };
195
- /** These are the events of each document of a limiter. */
196
- const EVENTS = {
197
- take: {
198
- kind: "app",
199
- note: "one call of take(key): one request of the key. A permitted take uses one unit"
200
- },
201
- "unit.back": {
202
- kind: "timer",
203
- note: "the next take of a limited key is permitted again"
204
- },
205
- idle: {
206
- kind: "timer",
207
- note: "the key is equal to a new key. The store can remove it, and no decision changes"
208
- },
209
- "store.fail": {
210
- kind: "local",
211
- note: "a shared store fails the take. The state of the key does not change"
212
- }
213
- };
214
- /** These are the knobs of each document of a limiter that do not change with its policy. */
215
- const KNOBS = {
216
- max_keys: count("limiters.<name>.evict.maxKeys"),
217
- on_store_failure: {
218
- key: "limiters.<name>.store.onStoreFailure",
219
- scope: "limiter",
220
- unit: null,
221
- default: null
222
- }
223
- };
224
- /**
225
- * These are the transitions of each document of a limiter that do not change with its policy. They
226
- * are the refusal of a limited key, a new key at the cap of keys, and a failure of a shared store.
227
- */
228
- const COMMON_TRANSITIONS = [
229
- t("refuse", "limited", "take", "limited", {
230
- emits: ["429 limit"],
231
- 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"
232
- }),
233
- t("cap", "new", "take", "new", {
234
- guard: "the store holds max_keys keys for the limiter, and no held key is equal to a new key",
235
- emits: ["429 cap"],
236
- note: "Retry-After is the time until the earliest held key is free: at most the idle span. A held key keeps its count"
237
- }),
238
- ...HELD.map((state) => t(`store-failed-${state}`, state, "store.fail", state, {
239
- guard: "the store is shared",
240
- emits: ["allow, or 429 store"],
241
- 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"
242
- }))
243
- ];
244
- /**
245
- * A token bucket of one key (GCRA), as a `mark1russell7.machine/1` document. The bucket holds
246
- * `burst` tokens, and it gets one token back in each interval, `1 / rate`. The store keeps one time
247
- * for the key: when its bucket is full again.
248
- * - A take is permitted when, with the take, the bucket is full again in at most `burst` intervals.
249
- * - A refused take waits until one token is back: at most one interval. That interval is the
250
- * longest `Retry-After` of the policy (`retry_after@limiter` of the law).
251
- * - After `burst / rate` with no take, the bucket is full, and the key is equal to a new key. That
252
- * span is the idle span, and the longest wait of a new key at the cap of keys
253
- * (`retry_after_at_cap@limiter`).
254
- */
255
- const TOKEN_BUCKET_MACHINE = {
256
- ...COMMON,
257
- id: "service.machine.limiter.token-bucket",
258
- title: "A token bucket of one key of the keyed limiter",
259
- events: EVENTS,
260
- knobs: {
261
- rate: {
262
- key: "limiters.<name>.policy.rate",
263
- scope: "limiter",
264
- unit: "count/s",
265
- default: null
266
- },
267
- burst: count("limiters.<name>.policy.burst"),
268
- ...KNOBS
269
- },
270
- timers: {
271
- token: {
272
- duration: {
273
- expr: "1 / rate",
274
- unit: "s"
275
- },
276
- early: {
277
- expr: "1 / rate",
278
- unit: "s"
279
- },
280
- arms: ["enter:limited"],
281
- cancels: ["idle"],
282
- fires: "unit.back",
283
- 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"
284
- },
285
- full: {
286
- duration: {
287
- expr: "burst / rate",
288
- unit: "s"
289
- },
290
- early: {
291
- expr: "(burst - 1) / rate",
292
- unit: "s"
293
- },
294
- arms: ["take"],
295
- fires: "idle",
296
- note: "the bucket is full again from one to burst intervals after a permitted take. A refused take does not move it"
297
- }
298
- },
299
- transitions: [
300
- t("first", "new", "take", "open", {
301
- guard: "burst > 1",
302
- emits: ["allow"]
303
- }),
304
- t("first-last", "new", "take", "limited", {
305
- guard: "burst = 1",
306
- emits: ["allow"]
307
- }),
308
- t("take", "open", "take", "open", {
309
- guard: "a token remains after the take",
310
- emits: ["allow"]
311
- }),
312
- t("take-last", "open", "take", "limited", {
313
- guard: "the take uses the last token",
314
- emits: ["allow"]
315
- }),
316
- ...COMMON_TRANSITIONS,
317
- t("token-back", "limited", "unit.back", "open", {
318
- timer: "token",
319
- guard: "burst > 1"
320
- }),
321
- t("full", "open", "idle", "new", { timer: "full" }),
322
- t("full-at-once", "limited", "idle", "new", {
323
- timer: "full",
324
- guard: "burst = 1: the one token is back when the bucket is full"
325
- })
326
- ]
327
- };
328
- /**
329
- * A sliding window of one key, as a `mark1russell7.machine/1` document. The store keeps the time of
330
- * each permitted take of the key in the window, and each take counts for one window from its time.
331
- * - A take is permitted when fewer than `limit` takes are in the window.
332
- * - A refused take waits until the oldest take leaves the window: at most one window. That window is
333
- * the longest `Retry-After` of the policy (`retry_after@limiter` of the law).
334
- * - One window after the last take, no take is in the window, and the key is equal to a new key.
335
- * That window is the idle span, and the longest wait of a new key at the cap of keys
336
- * (`retry_after_at_cap@limiter`).
337
- */
338
- const SLIDING_WINDOW_MACHINE = {
339
- ...COMMON,
340
- id: "service.machine.limiter.sliding-window",
341
- title: "A sliding window of one key of the keyed limiter",
342
- events: EVENTS,
343
- knobs: {
344
- limit: count("limiters.<name>.policy.limit"),
345
- window: {
346
- key: "limiters.<name>.policy.window",
347
- scope: "limiter",
348
- unit: "s",
349
- default: null
350
- },
351
- ...KNOBS
352
- },
353
- timers: {
354
- oldest: {
355
- duration: {
356
- knob: "window",
357
- unit: "s"
358
- },
359
- early: {
360
- knob: "window",
361
- unit: "s"
362
- },
363
- arms: ["enter:limited"],
364
- cancels: ["idle"],
365
- fires: "unit.back",
366
- 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"
367
- },
368
- last: {
369
- duration: {
370
- knob: "window",
371
- unit: "s"
372
- },
373
- arms: ["take"],
374
- fires: "idle",
375
- note: "the last permitted take leaves the window one window after its time. A refused take does not move it"
376
- }
377
- },
378
- transitions: [
379
- t("first", "new", "take", "open", {
380
- guard: "limit > 1",
381
- emits: ["allow"]
382
- }),
383
- t("first-last", "new", "take", "limited", {
384
- guard: "limit = 1",
385
- emits: ["allow"]
386
- }),
387
- t("take", "open", "take", "open", {
388
- guard: "fewer than limit - 1 takes are in the window before the take",
389
- emits: ["allow"]
390
- }),
391
- t("take-last", "open", "take", "limited", {
392
- guard: "the take is the limit-th take in the window",
393
- emits: ["allow"]
394
- }),
395
- ...COMMON_TRANSITIONS,
396
- t("oldest-leaves", "limited", "unit.back", "open", {
397
- timer: "oldest",
398
- guard: "a later take stays in the window"
399
- }),
400
- t("last-leaves", "open", "idle", "new", { timer: "last" }),
401
- t("all-leave", "limited", "idle", "new", {
402
- timer: "last",
403
- guard: "each take of the window has one time: limit = 1, or each take came at once"
404
- })
405
- ]
406
- };
407
- /** This function gives the machine document of the policy of a limiter. */
408
- const limiterMachine = (policy) => policy.type === "token-bucket" ? TOKEN_BUCKET_MACHINE : SLIDING_WINDOW_MACHINE;
409
- /**
410
- * This function gives the state of a key of a store as its machine document names it, at the time
411
- * `now` in milliseconds. `state` is what the store keeps for the key, or `undefined` when it keeps
412
- * nothing. A key equal to a new key is `new`, and a key whose next take `decide` refuses is `limited`.
413
- */
414
- const limiterStateOf = (rule, state, now) => {
415
- if (state === void 0 || freeAt(rule, state) <= now) return "new";
416
- return decide(rule, state, now).decision.allowed ? "open" : "limited";
417
- };
418
3
  // src/limiter/quota.ts
419
4
  const MAX_BUCKETS = 1e3;
420
5
  const DAY_MS = 864e5;
@@ -468,13 +53,18 @@ const quotaProblems = (name, spec) => {
468
53
  else if (!safely(isTime, window.start)) problems.push(`${owner}'s start is not a time`);
469
54
  else if (!atLeastZero(window.start) || !Number.isInteger(milliseconds(window.start)) || milliseconds(window.start) >= DAY_MS) problems.push(`${owner}'s start is not a whole count of milliseconds from 0 to less than 24 h`);
470
55
  } else problems.push(`${owner}'s window is not rolling or calendar`);
56
+ const { maxBlock } = spec;
57
+ if (maxBlock !== void 0 && maxBlock !== "window") {
58
+ if (typeof maxBlock !== "object" || maxBlock === null || !safely(isTime, maxBlock)) problems.push(`${owner}'s maxBlock is not a time or "window"`);
59
+ else if (!finiteAbove(maxBlock)) problems.push(`${owner}'s maxBlock is not a finite time above zero`);
60
+ }
471
61
  return problems;
472
62
  };
473
63
  /** This function gives the rule of a quota spec. It throws an error with the problems of a spec that has a problem. */
474
64
  const quotaRule = (name, spec) => {
475
65
  const problems = quotaProblems(name, spec);
476
66
  if (problems.length > 0) throw new Error(problems.join("; "));
477
- const { window } = spec;
67
+ const { window, maxBlock } = spec;
478
68
  return {
479
69
  limit: countOf(spec.limit),
480
70
  reserve: countOf(spec.reserve),
@@ -487,7 +77,8 @@ const quotaRule = (name, spec) => {
487
77
  unit: window.unit,
488
78
  zone: window.zone,
489
79
  start: milliseconds(window.start)
490
- }
80
+ },
81
+ ...maxBlock === void 0 ? {} : { maxBlock: maxBlock === "window" ? "window" : milliseconds(maxBlock) }
491
82
  };
492
83
  };
493
84
  /** This function gives the calendar window of the instant `t`: its start, and the start of the next window. */
@@ -557,6 +148,21 @@ const prune = (buckets, record, t) => {
557
148
  ...readAt !== void 0 && counts(buckets.bucket(readAt)[0]) ? { readAt } : {}
558
149
  };
559
150
  };
151
+ /**
152
+ * This function applies the bound of the rule to the block of a record at the instant `t`. The
153
+ * block ends at `t` plus the longest block at the latest. With `window`, it ends at the latest when
154
+ * the bucket of `t` stops counting. The bound is after `t`, thus a capped block stays a block.
155
+ */
156
+ const capBlock = (rule, buckets, record, t) => {
157
+ const { maxBlock } = rule;
158
+ const { blockedUntil } = record;
159
+ if (maxBlock === void 0 || blockedUntil === void 0) return record;
160
+ const bound = maxBlock === "window" ? buckets.freeAt(buckets.bucket(t)[0]) : t + maxBlock;
161
+ return blockedUntil > bound ? {
162
+ ...record,
163
+ blockedUntil: bound
164
+ } : record;
165
+ };
560
166
  const usedOf = (record) => record.spent.reduce((sum, [, units]) => sum + units, 0);
561
167
  /** This function adds units to the bucket of the instant `t`. */
562
168
  const add = (buckets, record, t, units) => {
@@ -611,7 +217,7 @@ function quotaStep(rule, stored, instant, event) {
611
217
  if (!isInstant(instant)) throw new RangeError(`the instant of a quota step is not a date: ${String(instant)}`);
612
218
  checkEvent(event);
613
219
  const buckets = bucketsOf(rule.window);
614
- const record = prune(buckets, recordOf(stored), instant);
220
+ const record = capBlock(rule, buckets, prune(buckets, recordOf(stored), instant), instant);
615
221
  const done = (next) => ({
616
222
  record: next,
617
223
  state: stateOf(rule, buckets, next, instant)
@@ -629,10 +235,10 @@ function quotaStep(rule, stored, instant, event) {
629
235
  readAt: Math.max(next.readAt ?? instant, instant)
630
236
  };
631
237
  }
632
- if ((remaining === void 0 || remaining <= 0) && isInstant(resetAt) && resetAt > instant) next = {
238
+ if ((remaining === void 0 || remaining <= 0) && isInstant(resetAt) && resetAt > instant) next = capBlock(rule, buckets, {
633
239
  ...next,
634
240
  blockedUntil: Math.max(next.blockedUntil ?? resetAt, resetAt)
635
- };
241
+ }, instant);
636
242
  return done(next);
637
243
  }
638
244
  case "give-back": {
@@ -762,7 +368,7 @@ function keyedQuota(name, spec, store, clock) {
762
368
  });
763
369
  const verdictOf = (step) => step.verdict;
764
370
  const stateOfStep = (step) => step.state;
765
- const { window } = spec;
371
+ const { window, maxBlock } = spec;
766
372
  return {
767
373
  name,
768
374
  spec: {
@@ -777,7 +383,8 @@ function keyedQuota(name, spec, store, clock) {
777
383
  unit: window.unit,
778
384
  zone: window.zone,
779
385
  start: { ...window.start }
780
- }
386
+ },
387
+ ...maxBlock === void 0 ? {} : { maxBlock: maxBlock === "window" ? "window" : { ...maxBlock } }
781
388
  },
782
389
  rule,
783
390
  sync: store.sync,
@@ -901,6 +508,6 @@ const driveAsync = async (parts, options) => {
901
508
  function takeQuotas(parts, options) {
902
509
  return parts.every((part) => part.quota.sync) ? driveSync(parts, options) : driveAsync(parts, options);
903
510
  }
904
- export { quotaStep as a, TOKEN_BUCKET_MACHINE as c, keyedLimiter as d, memoryStore as f, quotaRule as i, limiterMachine as l, memoryQuotaStore as n, takeQuotas as o, quotaProblems as r, SLIDING_WINDOW_MACHINE as s, keyedQuota as t, limiterStateOf as u };
511
+ export { keyedQuota, memoryQuotaStore, quotaProblems, quotaRule, quotaStep, takeQuotas };
905
512
 
906
- //# sourceMappingURL=limiter-Bgy6Gmvl.js.map
513
+ //# sourceMappingURL=quota.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"quota.js","names":[],"sources":["../../src/limiter/quota.ts"],"sourcesContent":["// The quota of a key: at most `limit` units in each window of a calendar or of a rolling span. A\n// provider of an API gives such a quota, and the gate refuses a take over it before the provider\n// does. The count of the gate is not lower than the count of the provider: a reading of the\n// provider can make the count larger, but not smaller.\n//\n// A quota is data before it starts, with no defaults. Its pure step `quotaStep` takes the stored\n// record, an instant and an event, and gives the next record and the state. A store applies the\n// step to the record of one key in one atomic change. The time of a quota is the instant of a wall\n// clock, because a calendar window needs civil time.\n\nimport type { WallClock } from \"@mark1russell7/algebra/clock\";\nimport { firstInstantOf, localTime } from \"@mark1russell7/algebra/clock\";\nimport type { Quantity } from \"@mark1russell7/quantity\";\nimport { countOf, finiteAbove, isCount, isTime, milliseconds, safely, wholeCount } from \"./policy.ts\";\n\n/**\n * A rolling window counts the units of the last `span`. Use it when the provider does not tell when\n * its count starts again. The window puts each take in a time bucket. A unit counts until all of\n * its bucket is out of the window. Thus the count is not lower than the count of a fixed window.\n */\nexport interface RollingWindow {\n readonly kind: \"rolling\";\n /** This time is the length of the window, for example `{ value: 24, unit: \"h\" }`. */\n readonly span: Quantity;\n /** This count is the count of time buckets in the window: a whole count from 1 to 1000. */\n readonly buckets: Quantity;\n}\n\n/**\n * A calendar window counts the units of a day or of a month in a time zone. Each window starts at\n * the time of day `start`, on each day or on the first day of each month. When the clock of the\n * zone skips that time, the window starts at the end of the gap. When the clock shows that time\n * two times, the window starts at the first of the two.\n */\nexport interface CalendarWindow {\n readonly kind: \"calendar\";\n readonly unit: \"day\" | \"month\";\n /** The IANA name of the time zone, for example `America/Chicago` or `UTC`. */\n readonly zone: string;\n /** This time of day starts each window: from 0 to less than 24 hours, in whole milliseconds. */\n readonly start: Quantity;\n}\n\n/** A quota window is a rolling window or a calendar window. */\nexport type QuotaWindow = RollingWindow | CalendarWindow;\n\n/** A quota spec is the declaration of a quota. It has no defaults. */\nexport interface QuotaSpec {\n /** This count is the count of units that the provider gives in one window. */\n readonly limit: Quantity;\n /** The gate keeps this count of units unused: from 0 to less than the limit. */\n readonly reserve: Quantity;\n readonly window: QuotaWindow;\n /**\n * This value is the longest block that a reading of the provider can set: a time above zero, or\n * `window`. A reading at the instant `t` blocks the key until `t` plus the time at the latest. With\n * `window`, the block ends at the latest when the bucket of `t` stops counting. Thus a reset of the\n * provider in a wrong form does not stop a key for much longer than one window. The step also\n * applies this bound to a block that the stored record keeps. When it is absent, no block has a bound.\n */\n readonly maxBlock?: Quantity | \"window\" | undefined;\n}\n\n/** A quota rule is a spec in numbers: each count as a number, and each time in milliseconds. */\nexport interface QuotaRule {\n readonly limit: number;\n readonly reserve: number;\n readonly window:\n | { readonly kind: \"rolling\"; readonly span: number; readonly buckets: number }\n | { readonly kind: \"calendar\"; readonly unit: \"day\" | \"month\"; readonly zone: string; readonly start: number };\n /** This value is the longest block in milliseconds, or `window`. When it is absent, no block has a bound. */\n readonly maxBlock?: number | \"window\" | undefined;\n}\n\n/**\n * A quota record is what a store keeps for one key. A store can keep it as JSON. Each instant is in\n * milliseconds from 1970-01-01T00:00:00Z.\n */\nexport interface QuotaRecord {\n /** Each item is a time bucket: its start, and its count of units. The oldest bucket is first. */\n readonly spent: readonly (readonly [start: number, units: number])[];\n /** The provider refused the key until this instant. */\n readonly blockedUntil?: number | undefined;\n /** This instant is the last reading of the provider with a count. A give-back for a take at or before it changes nothing. */\n readonly readAt?: number | undefined;\n}\n\n/** A quota reading is what an answer of the provider tells of its count. */\nexport interface QuotaReading {\n /** This count is the count of units that the provider gives before its next reset. */\n readonly remaining?: number | undefined;\n /**\n * This instant is the next reset of the provider. When `remaining` is 0 or absent, the gate\n * refuses each take until this instant.\n */\n readonly resetAt?: number | undefined;\n}\n\n/** A quota state is the state of one key at the instant `at`. */\nexport interface QuotaState {\n /** This instant is the instant of the step. */\n readonly at: number;\n /** This count is the count of units in the window. */\n readonly used: number;\n /** This count is the count of units that the gate gives: the limit, less the reserve and `used`. It is 0 while the provider refuses the key. */\n readonly left: number;\n /** The oldest units stop counting at this instant. With no unit in the window, it is absent. */\n readonly resetAt?: number | undefined;\n /** The provider refused the key until this instant. */\n readonly blockedUntil?: number | undefined;\n}\n\n/** A permitted take counted its units at the instant `state.at`. */\nexport interface QuotaAllowed {\n readonly allowed: true;\n readonly state: QuotaState;\n}\n\n/**\n * A wait refusal counted nothing. Its cause is `limit` when the window has no room for the units,\n * and `provider` when the provider refused the key. At `resetAt`, the gate gives the same take,\n * when no other take comes first.\n */\nexport interface QuotaWaitRefused {\n readonly allowed: false;\n readonly cause: \"limit\" | \"provider\";\n readonly resetAt: number;\n /** This time is the time from `state.at` to `resetAt`. It is always above zero. */\n readonly retryAfter: Quantity;\n readonly state: QuotaState;\n}\n\n/**\n * A capacity refusal counted nothing, and the gate refuses the same take at each time. Its units\n * are more than the `capacity` of one window: the limit less the reserve.\n */\nexport interface QuotaCapacityRefused {\n readonly allowed: false;\n readonly cause: \"capacity\";\n readonly units: number;\n readonly capacity: number;\n readonly state: QuotaState;\n}\n\n/** A quota refusal is a wait refusal or a capacity refusal. */\nexport type QuotaRefused = QuotaWaitRefused | QuotaCapacityRefused;\n\n/** A quota verdict is the answer of a quota to one take. */\nexport type QuotaVerdict = QuotaAllowed | QuotaRefused;\n\n/**\n * A quota event is one change of a key:\n * - `take`: count `units` for a call that starts at the instant of the step, or refuse it.\n * - `note`: add what an answer of the provider tells. The count can only become larger.\n * - `give-back`: remove `units` that a take counted at the instant `at`, for a call that did not\n * start. It changes nothing when the bucket of `at` is out of the window, or when a reading of the\n * provider came at or after `at`.\n * - `read`: change nothing, and give the state.\n */\nexport type QuotaEvent =\n | { readonly type: \"take\"; readonly units: number }\n | { readonly type: \"note\"; readonly reading: QuotaReading }\n | { readonly type: \"give-back\"; readonly units: number; readonly at: number }\n | { readonly type: \"read\" };\n\n/** A quota step is the next record of a key and its state. Only a take gives a verdict. */\nexport interface QuotaStep {\n readonly record: QuotaRecord;\n readonly state: QuotaState;\n readonly verdict?: QuotaVerdict | undefined;\n}\n\n/** A take step is the step of a take: it always has a verdict. */\nexport interface QuotaTakeStep extends QuotaStep {\n readonly verdict: QuotaVerdict;\n}\n\nconst MAX_BUCKETS = 1000;\nconst DAY_MS = 86_400_000;\n/** The largest instant of a `Date`, in milliseconds from the epoch. */\nconst MAX_TIME = 8.64e15;\n/**\n * This slack is a part of a count. A comparison of counts permits it. The reason: a sum of units\n * with a fraction is not exact in floating point, and 0.1 + 0.2 is more than 0.3.\n */\nconst SLACK = 1e-9;\n\n/** This function tells if `total` is over `bound` by more than the slack. */\nconst over = (total: number, bound: number): boolean => total - bound > SLACK * Math.max(1, Math.abs(bound));\n\nconst isInstant = (value: unknown): value is number => typeof value === \"number\" && Number.isFinite(value) && Math.abs(value) <= MAX_TIME;\n\nconst iso = (instant: number): string => (isInstant(instant) ? new Date(instant).toISOString() : String(instant));\n\n/** A loose window is a window from any source, with each part optional, for the check of its parts. */\ninterface LooseWindow {\n readonly kind?: string;\n readonly span?: Quantity;\n readonly buckets?: Quantity;\n readonly unit?: string;\n readonly zone?: string;\n readonly start?: Quantity;\n}\n\nconst atLeastZero = (amount: Quantity): boolean => typeof amount.value === \"number\" && Number.isFinite(amount.value) && amount.value >= 0;\n\n/**\n * This function gives the problems of a quota spec. `keyedQuota` and `quotaRule` refuse a spec with\n * a problem. A part that is absent is a problem, because a quota has no defaults.\n */\nexport const quotaProblems = (name: string, spec: Partial<QuotaSpec> | undefined): string[] => {\n const owner = `quota ${name}`;\n if (spec === undefined || (spec as unknown) === null) return [`${owner} has no spec: a quota has no defaults`];\n const problems: string[] = [];\n const missing = (part: string): void => {\n problems.push(`${owner} does not declare ${part}: a quota has no defaults`);\n };\n let limit: number | undefined;\n if (spec.limit === undefined) missing(\"its limit (limit)\");\n else if (!safely(isCount, spec.limit)) problems.push(`${owner}'s limit is not a count`);\n else if (!finiteAbove(spec.limit)) problems.push(`${owner}'s limit is not a finite count above zero`);\n else limit = countOf(spec.limit);\n if (spec.reserve === undefined) missing(\"its reserve (reserve), 0 for no reserve\");\n else if (!safely(isCount, spec.reserve)) problems.push(`${owner}'s reserve is not a count`);\n else if (!atLeastZero(spec.reserve)) problems.push(`${owner}'s reserve is not a finite count of 0 or more`);\n else if (limit !== undefined && countOf(spec.reserve) >= limit) problems.push(`${owner}'s reserve is not less than its limit`);\n const window = spec.window as LooseWindow | undefined;\n if (window === undefined || (window as unknown) === null) missing(\"its window (window)\");\n else if (window.kind === \"rolling\") {\n if (window.span === undefined) missing(\"the span of its window (window.span)\");\n else if (!safely(isTime, window.span)) problems.push(`${owner}'s span is not a time`);\n else if (!finiteAbove(window.span)) problems.push(`${owner}'s span is not a finite time above zero`);\n if (window.buckets === undefined) missing(\"the count of buckets of its window (window.buckets)\");\n else if (!safely(isCount, window.buckets)) problems.push(`${owner}'s buckets is not a count`);\n else if (!wholeCount(window.buckets) || countOf(window.buckets) > MAX_BUCKETS)\n problems.push(`${owner}'s buckets is not a whole count from 1 to ${String(MAX_BUCKETS)}`);\n } else if (window.kind === \"calendar\") {\n if (window.unit === undefined) missing(\"the unit of its window (window.unit)\");\n else if (window.unit !== \"day\" && window.unit !== \"month\") problems.push(`${owner}'s unit is not day or month`);\n if (window.zone === undefined) missing(\"the time zone of its window (window.zone)\");\n else if (typeof window.zone !== \"string\" || localTime(0, window.zone) === undefined)\n problems.push(`${owner}'s zone is not an IANA time zone: ${String(window.zone)}`);\n if (window.start === undefined) missing(\"the time of day that starts its window (window.start), 0 h for midnight\");\n else if (!safely(isTime, window.start)) problems.push(`${owner}'s start is not a time`);\n else if (!atLeastZero(window.start) || !Number.isInteger(milliseconds(window.start)) || milliseconds(window.start) >= DAY_MS)\n problems.push(`${owner}'s start is not a whole count of milliseconds from 0 to less than 24 h`);\n } else problems.push(`${owner}'s window is not rolling or calendar`);\n const { maxBlock } = spec;\n if (maxBlock !== undefined && maxBlock !== \"window\") {\n if (typeof maxBlock !== \"object\" || maxBlock === null || !safely(isTime, maxBlock)) problems.push(`${owner}'s maxBlock is not a time or \"window\"`);\n else if (!finiteAbove(maxBlock)) problems.push(`${owner}'s maxBlock is not a finite time above zero`);\n }\n return problems;\n};\n\n/** This function gives the rule of a quota spec. It throws an error with the problems of a spec that has a problem. */\nexport const quotaRule = (name: string, spec: QuotaSpec): QuotaRule => {\n const problems = quotaProblems(name, spec);\n if (problems.length > 0) throw new Error(problems.join(\"; \"));\n const { window, maxBlock } = spec;\n return {\n limit: countOf(spec.limit),\n reserve: countOf(spec.reserve),\n window:\n window.kind === \"rolling\"\n ? { kind: \"rolling\", span: milliseconds(window.span), buckets: countOf(window.buckets) }\n : { kind: \"calendar\", unit: window.unit, zone: window.zone, start: milliseconds(window.start) },\n ...(maxBlock === undefined ? {} : { maxBlock: maxBlock === \"window\" ? \"window\" : milliseconds(maxBlock) }),\n };\n};\n\n/** The buckets of a window: the bucket of an instant, and the test of a bucket. */\ninterface Buckets {\n /** This function gives the start and the end of the bucket of the instant `t`. */\n bucket(t: number): readonly [start: number, end: number];\n /**\n * This function gives the test of the buckets that count at the instant `t`. A bucket of a later\n * window counts too: after a step back of the clock, the takes of that window still count.\n */\n counting(t: number): (start: number) => boolean;\n /** This function gives the instant at which the bucket that starts at `start` stops counting. */\n freeAt(start: number): number;\n}\n\n/** This function gives the calendar window of the instant `t`: its start, and the start of the next window. */\nconst calendarOf = (unit: \"day\" | \"month\", zone: string, start: number, t: number): readonly [number, number] => {\n const local = localTime(t, zone);\n if (local === undefined) throw new RangeError(`the instant ${String(t)} is not a date in the zone ${zone}`);\n const { year, month, day } = local;\n // the start of the window that is `back` windows before the window of the date of `t`\n const startOf = (back: number): number => {\n const wall = (unit === \"day\" ? Date.UTC(year, month - 1, day - back) : Date.UTC(year, month - 1 - back, 1)) + start;\n const instant = firstInstantOf(wall, zone);\n if (instant === undefined) throw new RangeError(`the clock of ${zone} does not show or skip the local time ${iso(wall)}`);\n return instant;\n };\n const first = startOf(0);\n return first <= t ? [first, startOf(-1)] : [startOf(1), first];\n};\n\nconst bucketsOf = (window: QuotaRule[\"window\"]): Buckets => {\n if (window.kind === \"rolling\") {\n const { span } = window;\n const size = Math.ceil(span / window.buckets);\n return {\n bucket: (t) => {\n const start = Math.floor(t / size) * size;\n return [start, start + size];\n },\n counting: (t) => (start) => start + size + span > t,\n freeAt: (start) => start + size + span,\n };\n }\n const { unit, zone, start } = window;\n return {\n bucket: (t) => calendarOf(unit, zone, start, t),\n // only the windows before the window of `t` stop counting\n counting: (t) => {\n const [first] = calendarOf(unit, zone, start, t);\n return (bucket) => bucket >= first;\n },\n freeAt: (bucket) => calendarOf(unit, zone, start, bucket)[1],\n };\n};\n\n/**\n * This function gives the record of a store. A value that is not a record gives an empty record.\n * The function removes each item that is not valid and keeps the other items, thus the count stays\n * as high as the record lets it. It adds the items of one bucket together.\n */\nconst recordOf = (value: unknown): QuotaRecord => {\n if (typeof value !== \"object\" || value === null) return { spent: [] };\n const { spent, blockedUntil, readAt } = value as { spent?: unknown; blockedUntil?: unknown; readAt?: unknown };\n const counts = new Map<number, number>();\n if (Array.isArray(spent))\n for (const item of spent as unknown[]) {\n if (!Array.isArray(item) || item.length !== 2) continue;\n const [start, units] = item as unknown[];\n if (isInstant(start) && typeof units === \"number\" && Number.isFinite(units) && units > 0) counts.set(start, (counts.get(start) ?? 0) + units);\n }\n const items = [...counts].sort((a, b) => a[0] - b[0]);\n return {\n spent: items,\n ...(isInstant(blockedUntil) ? { blockedUntil } : {}),\n ...(isInstant(readAt) ? { readAt } : {}),\n };\n};\n\n/** This function removes the buckets that do not count at the instant `t`, an ended refusal, and a reading that no give-back can meet. */\nconst prune = (buckets: Buckets, record: QuotaRecord, t: number): QuotaRecord => {\n const counts = buckets.counting(t);\n const { blockedUntil, readAt } = record;\n return {\n spent: record.spent.filter(([start]) => counts(start)),\n ...(blockedUntil !== undefined && blockedUntil > t ? { blockedUntil } : {}),\n // a give-back changes only a bucket that counts, and each such bucket starts after the bucket of an older reading\n ...(readAt !== undefined && counts(buckets.bucket(readAt)[0]) ? { readAt } : {}),\n };\n};\n\n/**\n * This function applies the bound of the rule to the block of a record at the instant `t`. The\n * block ends at `t` plus the longest block at the latest. With `window`, it ends at the latest when\n * the bucket of `t` stops counting. The bound is after `t`, thus a capped block stays a block.\n */\nconst capBlock = (rule: QuotaRule, buckets: Buckets, record: QuotaRecord, t: number): QuotaRecord => {\n const { maxBlock } = rule;\n const { blockedUntil } = record;\n if (maxBlock === undefined || blockedUntil === undefined) return record;\n const bound = maxBlock === \"window\" ? buckets.freeAt(buckets.bucket(t)[0]) : t + maxBlock;\n return blockedUntil > bound ? { ...record, blockedUntil: bound } : record;\n};\n\nconst usedOf = (record: QuotaRecord): number => record.spent.reduce((sum, [, units]) => sum + units, 0);\n\n/** This function adds units to the bucket of the instant `t`. */\nconst add = (buckets: Buckets, record: QuotaRecord, t: number, units: number): QuotaRecord => {\n const [start] = buckets.bucket(t);\n let found = false;\n const spent = record.spent.map(([at, count]): readonly [number, number] => {\n if (at !== start) return [at, count];\n found = true;\n return [at, count + units];\n });\n if (!found) spent.push([start, units]);\n spent.sort((a, b) => a[0] - b[0]);\n return { ...record, spent };\n};\n\n/** This function gives the instant at which `need` units of the oldest buckets stop counting. */\nconst freeTime = (buckets: Buckets, record: QuotaRecord, need: number): number | undefined => {\n let freed = 0;\n for (const [start, units] of record.spent) {\n freed += units;\n if (!over(need, freed)) return buckets.freeAt(start);\n }\n return undefined;\n};\n\nconst stateOf = (rule: QuotaRule, buckets: Buckets, record: QuotaRecord, t: number): QuotaState => {\n const used = usedOf(record);\n const oldest = record.spent[0];\n const { blockedUntil } = record;\n return {\n at: t,\n used,\n left: blockedUntil === undefined ? Math.max(0, rule.limit - rule.reserve - used) : 0,\n ...(oldest === undefined ? {} : { resetAt: buckets.freeAt(oldest[0]) }),\n ...(blockedUntil === undefined ? {} : { blockedUntil }),\n };\n};\n\n/** This function checks the units of a take or of a give-back: a finite count of 0 or more. */\nconst checkUnits = (units: unknown): number => {\n if (typeof units !== \"number\" || !Number.isFinite(units) || units < 0) throw new RangeError(`the units of a quota are not a finite count of 0 or more: ${String(units)}`);\n return units;\n};\n\n/** This function checks an event before a store gets it, thus a store does not start a change for an event that is not valid. */\nconst checkEvent = (event: QuotaEvent): void => {\n if (event.type === \"take\") checkUnits(event.units);\n else if (event.type === \"give-back\") {\n checkUnits(event.units);\n if (!isInstant(event.at)) throw new RangeError(`the instant of a give-back is not a date: ${String(event.at)}`);\n }\n};\n\n/**\n * This function is the pure step of a quota. It reads the stored record of one key at the instant\n * `instant`, applies the event, and gives the next record and the state. It removes what does not\n * count at the instant first. Only a take can be refused, and a refusal counts nothing.\n * - A take of 0 units is permitted and counts nothing, also while the provider refuses the key.\n * - A take over the capacity is refused with the cause `capacity`.\n * - While the provider refuses the key, a take is refused with the cause `provider`. Its `resetAt`\n * is the end of that refusal, or a later instant when the window has room for the units.\n * - A take over the room of the window is refused with the cause `limit`, until enough of the\n * oldest units stop counting.\n * - With `maxBlock` in the rule, a block ends at the latest at the bound of the instant. The step\n * applies the bound to the stored block before the event, and to the block of a note after it.\n *\n * It throws a `RangeError` for an instant that is not a date, and for units that are not a finite\n * count of 0 or more.\n */\nexport function quotaStep(rule: QuotaRule, stored: unknown, instant: number, event: Extract<QuotaEvent, { type: \"take\" }>): QuotaTakeStep;\nexport function quotaStep(rule: QuotaRule, stored: unknown, instant: number, event: QuotaEvent): QuotaStep;\nexport function quotaStep(rule: QuotaRule, stored: unknown, instant: number, event: QuotaEvent): QuotaStep {\n if (!isInstant(instant)) throw new RangeError(`the instant of a quota step is not a date: ${String(instant)}`);\n checkEvent(event);\n const buckets = bucketsOf(rule.window);\n // the bound of the rule applies to the stored block before the event, thus the step writes back the capped record\n const record = capBlock(rule, buckets, prune(buckets, recordOf(stored), instant), instant);\n const done = (next: QuotaRecord): QuotaStep => ({ record: next, state: stateOf(rule, buckets, next, instant) });\n switch (event.type) {\n case \"read\":\n return done(record);\n case \"note\": {\n let next = record;\n const { remaining, resetAt } = event.reading;\n if (typeof remaining === \"number\" && Number.isFinite(remaining) && remaining >= 0) {\n const more = rule.limit - remaining - usedOf(next);\n if (over(more, 0)) next = add(buckets, next, instant, more);\n next = { ...next, readAt: Math.max(next.readAt ?? instant, instant) };\n }\n const exhausted = remaining === undefined || remaining <= 0;\n if (exhausted && isInstant(resetAt) && resetAt > instant)\n next = capBlock(rule, buckets, { ...next, blockedUntil: Math.max(next.blockedUntil ?? resetAt, resetAt) }, instant);\n return done(next);\n }\n case \"give-back\": {\n const { units, at } = event;\n if (units === 0 || (record.readAt !== undefined && record.readAt >= at)) return done(record);\n const [start] = buckets.bucket(at);\n if (!record.spent.some(([bucket]) => bucket === start)) return done(record);\n const spent: (readonly [number, number])[] = [];\n for (const [bucket, count] of record.spent) {\n const left = bucket === start ? count - Math.min(units, count) : count;\n if (over(left, 0)) spent.push([bucket, left]);\n }\n return done({ ...record, spent });\n }\n case \"take\": {\n const { units } = event;\n const allowed = rule.limit - rule.reserve;\n const refuse = (verdict: QuotaRefused): QuotaTakeStep => ({ record, state: verdict.state, verdict });\n const state = stateOf(rule, buckets, record, instant);\n if (units === 0) return { record, state, verdict: { allowed: true, state } };\n if (over(units, allowed)) return refuse({ allowed: false, cause: \"capacity\", units, capacity: allowed, state });\n const used = usedOf(record);\n // the need is not more than the units of the window, because the units are not over the capacity\n const free = over(used + units, allowed) ? (freeTime(buckets, record, used + units - allowed) ?? buckets.bucket(instant)[1]) : undefined;\n const wait = (cause: \"limit\" | \"provider\", resetAt: number): QuotaTakeStep =>\n refuse({ allowed: false, cause, resetAt, retryAfter: { value: resetAt - instant, unit: \"ms\" }, state });\n if (record.blockedUntil !== undefined) return wait(\"provider\", Math.max(record.blockedUntil, free ?? record.blockedUntil));\n if (free !== undefined) return wait(\"limit\", free);\n const next = done(add(buckets, record, instant, units));\n return { ...next, verdict: { allowed: true, state: next.state } };\n }\n }\n}\n\n/** A quota answer is a value at once for a store that answers at once, else a promise. */\nexport type QuotaAnswer<Sync extends boolean, T> = Sync extends true ? T : Promise<T>;\n\n/** A quota change is what a step gives a store: the record to keep, and the result for the caller. */\nexport interface QuotaChange<T> {\n readonly record: QuotaRecord;\n readonly result: T;\n}\n\n/**\n * A quota store keeps the record of each quota and key, and it changes one record in one atomic\n * step. Thus two takes of one key do not read the same record. A store of this process can answer\n * at once (`sync: true`), for example a store in memory or in SQLite. A store that the replicas\n * share answers with a promise (`sync: false`).\n */\nexport interface QuotaStore<Sync extends boolean = boolean> {\n readonly sync: Sync;\n /**\n * This method gives `step` the stored record of the quota and the key, or undefined for a new key.\n * It keeps the record that `step` gives, and it gives the result. The record of a new key is\n * empty: a store can remove a key whose record has no item and no instant. A store can call\n * `step` again, for example after a conflict of a write. Thus `step` must have no other effect.\n */\n change<T>(quota: string, key: string, step: (stored: unknown) => QuotaChange<T>): QuotaAnswer<Sync, T>;\n}\n\n/** A memory quota store is the store of one process. Its records are in memory. */\nexport interface MemoryQuotaStore extends QuotaStore<true> {\n /** This method gives the count of keys that the store holds for a quota. */\n size(quota: string): number;\n}\n\n/** This function tells if a record is equal to the record of a new key. */\nconst isEmpty = (record: QuotaRecord): boolean => record.spent.length === 0 && record.blockedUntil === undefined && record.readAt === undefined;\n\n/**\n * This function makes a store of records in memory. Each quota of one process can share it, and it\n * keeps the records of each quota apart. It removes a key when its record is equal to the record\n * of a new key. It does not sweep the other keys: use it for a set of keys with a bound, for\n * example the accounts of an API.\n */\nexport const memoryQuotaStore = (): MemoryQuotaStore => {\n const tables = new Map<string, Map<string, QuotaRecord>>();\n return {\n sync: true,\n change(quota, key, step) {\n let table = tables.get(quota);\n if (table === undefined) {\n table = new Map();\n tables.set(quota, table);\n }\n const { record, result } = step(table.get(key));\n if (isEmpty(record)) table.delete(key);\n else table.set(key, record);\n if (table.size === 0) tables.delete(quota);\n return result;\n },\n size(quota) {\n return tables.get(quota)?.size ?? 0;\n },\n };\n};\n\n/** A keyed quota is the runtime of one quota: its spec, its rule in numbers, its store and its wall clock. */\nexport interface KeyedQuota<Sync extends boolean = boolean> {\n /** This name is the quota. A store keeps the keys of each quota apart. */\n readonly name: string;\n readonly spec: QuotaSpec;\n readonly rule: QuotaRule;\n /** True: each method gives its answer at once. False: each method gives a promise. */\n readonly sync: Sync;\n /** This method counts `units` units (1 when absent) for a call of the key that starts at this instant, or refuses the call. */\n take(key: string, units?: number): QuotaAnswer<Sync, QuotaVerdict>;\n /** This method adds what an answer of the provider tells. The count can only become larger. */\n note(key: string, reading: QuotaReading): QuotaAnswer<Sync, QuotaState>;\n /** This method removes `units` that a take counted at the instant `at`, for a call that did not start. */\n giveBack(key: string, units: number, at: number): QuotaAnswer<Sync, QuotaState>;\n /** This method gives the state of the key, and changes nothing. */\n state(key: string): QuotaAnswer<Sync, QuotaState>;\n}\n\n/** This function tells if a value is a promise. */\nconst isPromise = (value: unknown): value is Promise<unknown> =>\n typeof value === \"object\" && value !== null && typeof (value as { then?: unknown }).then === \"function\";\n\n/**\n * This function makes the runtime of a quota from its spec, its store and a wall clock. It refuses\n * a spec with a problem, because a quota has no defaults. It reads the instant inside the change of\n * the store, thus a store that waits for a lock reads the instant after the wait.\n * - With a store that answers at once, each method answers at once. A `RangeError` throws, and a\n * store that gives a promise throws an error.\n * - With a store that answers with a promise, each method gives a promise. A `RangeError` rejects.\n */\nexport function keyedQuota<Sync extends boolean>(\n name: string,\n spec: QuotaSpec,\n store: QuotaStore<Sync>,\n clock: Pick<WallClock, \"time\" | \"now\">,\n): KeyedQuota<Sync> {\n const rule = quotaRule(name, spec);\n if (clock.time !== \"wall\") throw new Error(`quota ${name} needs a wall clock, which gives the instant: a calendar window needs civil time`);\n const answer = <T>(compute: () => T | Promise<T>): QuotaAnswer<Sync, T> => {\n if (!store.sync) return (async () => compute())() as QuotaAnswer<Sync, T>;\n const value = compute();\n if (isPromise(value)) {\n // the change of the store happened: its promise has the result, and its rejection is not left unhandled\n value.then(undefined, () => {});\n throw new Error(`quota ${name} has a store that says it answers at once, but its change gave a promise`);\n }\n return value as QuotaAnswer<Sync, T>;\n };\n const change = <T>(key: string, event: QuotaEvent, pick: (step: QuotaStep) => T): QuotaAnswer<Sync, T> =>\n answer(() => {\n checkEvent(event);\n return store.change(name, key, (stored) => {\n const step = quotaStep(rule, stored, clock.now(), event);\n return { record: step.record, result: pick(step) };\n }) as T | Promise<T>;\n });\n const verdictOf = (step: QuotaStep): QuotaVerdict => step.verdict as QuotaVerdict;\n const stateOfStep = (step: QuotaStep): QuotaState => step.state;\n const { window, maxBlock } = spec;\n return {\n name,\n spec: {\n limit: { ...spec.limit },\n reserve: { ...spec.reserve },\n window:\n window.kind === \"rolling\"\n ? { kind: \"rolling\", span: { ...window.span }, buckets: { ...window.buckets } }\n : { kind: \"calendar\", unit: window.unit, zone: window.zone, start: { ...window.start } },\n ...(maxBlock === undefined ? {} : { maxBlock: maxBlock === \"window\" ? \"window\" : { ...maxBlock } }),\n },\n rule,\n sync: store.sync,\n take: (key, units = 1) => change(key, { type: \"take\", units }, verdictOf),\n note: (key, reading) => change(key, { type: \"note\", reading: { ...reading } }, stateOfStep),\n giveBack: (key, units, at) => change(key, { type: \"give-back\", units, at }, stateOfStep),\n state: (key) => change(key, { type: \"read\" }, stateOfStep),\n };\n}\n\n/**\n * A quota part is one take of a multi-quota take: a quota, a key, and the units of the take. The\n * quota needs only `sync`, `take` and `giveBack`. Thus a gate of your own with these members can be\n * a part, and a `KeyedQuota` is one.\n */\nexport interface QuotaPart<Sync extends boolean = boolean> {\n readonly quota: Pick<KeyedQuota<Sync>, \"sync\" | \"take\" | \"giveBack\">;\n readonly key: string;\n readonly units: number;\n}\n\n/**\n * A quotas verdict is the answer of a take of several quotas, all or none. Each state is the state\n * of its part after the take, and after the give-back of a refused take.\n * - A permitted take counted the units of each part.\n * - A refused take counted nothing. `refusal` is the refusal of the part `index`: the first\n * capacity refusal, else the wait refusal with the latest `resetAt`.\n */\nexport type QuotasVerdict =\n | { readonly allowed: true; readonly states: readonly QuotaState[] }\n | { readonly allowed: false; readonly index: number; readonly refusal: QuotaRefused; readonly states: readonly QuotaState[] };\n\n/** The options of `takeQuotas`. */\nexport interface TakeQuotasOptions {\n /**\n * This function gets each error of a give-back, with the index of its part. The units of that\n * part stay counted, thus its quota refuses sooner, not later. It gets the errors after the last\n * give-back, thus its own error stops no give-back. An error that it throws ends the take.\n */\n readonly onGiveBackError?: ((error: unknown, index: number) => void) | undefined;\n}\n\n/** A request of the walk of a multi-quota take: a call of one method of a quota. */\ntype Request = () => unknown;\n\n/** A walk gives a verdict or the error of a failed take, and the errors of the give-backs. */\ntype Walked = { readonly failures: readonly { readonly index: number; readonly error: unknown }[] } & (\n | { readonly verdict: QuotasVerdict }\n | { readonly error: unknown }\n);\n\n/** This function tells which refusal decides: a capacity refusal, else the latest `resetAt`. The first part wins a tie. */\nconst decisive = (verdicts: readonly QuotaVerdict[]): number => {\n let best = -1;\n for (let index = 0; index < verdicts.length; index += 1) {\n const verdict = verdicts[index]!;\n if (verdict.allowed) continue;\n const current = best < 0 ? undefined : (verdicts[best] as QuotaRefused);\n if (current === undefined) best = index;\n else if (current.cause === \"capacity\") continue;\n else if (verdict.cause === \"capacity\" || verdict.resetAt > current.resetAt) best = index;\n }\n return best;\n};\n\n/**\n * This walk takes each part in order, then gives back the counted parts of a refused or failed\n * take. The driver answers each request. A failed give-back does not stop the next give-backs.\n * The walk keeps its error, and the state of its part is the state after the take.\n */\nfunction* walk(parts: readonly QuotaPart[]): Generator<Request, Walked, unknown> {\n const verdicts: QuotaVerdict[] = [];\n const failures: { readonly index: number; readonly error: unknown }[] = [];\n /** This walk gives back the units of a part, and gives the state after the give-back, or after the take when the give-back fails. */\n function* giveBack(index: number): Generator<Request, QuotaState, unknown> {\n const verdict = verdicts[index]!;\n const part = parts[index]!;\n if (!verdict.allowed || part.units === 0) return verdict.state;\n try {\n return (yield () => part.quota.giveBack(part.key, part.units, verdict.state.at)) as QuotaState;\n } catch (error) {\n failures.push({ index, error });\n return verdict.state;\n }\n }\n try {\n for (const part of parts) verdicts.push((yield () => part.quota.take(part.key, part.units)) as QuotaVerdict);\n } catch (error) {\n // a failed take of a part: give back the parts before it, then give its error\n for (let index = 0; index < verdicts.length; index += 1) yield* giveBack(index);\n return { error, failures };\n }\n const index = decisive(verdicts);\n if (index < 0) return { verdict: { allowed: true, states: verdicts.map((verdict) => verdict.state) }, failures };\n const states: QuotaState[] = [];\n for (let at = 0; at < parts.length; at += 1) states.push(yield* giveBack(at));\n return { verdict: { allowed: false, index, refusal: verdicts[index] as QuotaRefused, states }, failures };\n}\n\n/** This function gives each error of a give-back to the option, then gives the verdict or throws the error of the take. */\nconst finish = (walked: Walked, options: TakeQuotasOptions | undefined): QuotasVerdict => {\n for (const failure of walked.failures) options?.onGiveBackError?.(failure.error, failure.index);\n if (\"error\" in walked) throw walked.error;\n return walked.verdict;\n};\n\nconst driveSync = (parts: readonly QuotaPart[], options: TakeQuotasOptions | undefined): QuotasVerdict => {\n const steps = walk(parts);\n let next = steps.next();\n while (!next.done) {\n let value: unknown;\n let failure: { error: unknown } | undefined;\n try {\n value = next.value();\n } catch (error) {\n failure = { error };\n }\n next = failure === undefined ? steps.next(value) : steps.throw(failure.error);\n }\n return finish(next.value, options);\n};\n\nconst driveAsync = async (parts: readonly QuotaPart[], options: TakeQuotasOptions | undefined): Promise<QuotasVerdict> => {\n const steps = walk(parts);\n let next = steps.next();\n while (!next.done) {\n let value: unknown;\n let failure: { error: unknown } | undefined;\n try {\n value = await next.value();\n } catch (error) {\n failure = { error };\n }\n next = failure === undefined ? steps.next(value) : steps.throw(failure.error);\n }\n return finish(next.value, options);\n};\n\n/**\n * This function takes from several quotas, all or none. It takes each part in order. When a part\n * is refused, the next parts still answer, and each part that counted gives back its units. Thus\n * the refusal tells the latest instant at which all parts can have room. When a take fails, the\n * parts before it give back their units, and the error throws.\n *\n * A failed give-back does not change the verdict and does not stop the other give-backs. The units\n * of its part stay counted, and `options.onGiveBackError` gets its error.\n *\n * With quotas that answer at once, it answers at once. Else it gives a promise.\n */\nexport function takeQuotas(parts: readonly QuotaPart<true>[], options?: TakeQuotasOptions): QuotasVerdict;\nexport function takeQuotas(parts: readonly QuotaPart[], options?: TakeQuotasOptions): QuotasVerdict | Promise<QuotasVerdict>;\nexport function takeQuotas(parts: readonly QuotaPart[], options?: TakeQuotasOptions): QuotasVerdict | Promise<QuotasVerdict> {\n return parts.every((part) => part.quota.sync) ? driveSync(parts, options) : driveAsync(parts, options);\n}\n"],"mappings":";;;AAiLA,MAAM,cAAc;AACpB,MAAM,SAAS;;AAEf,MAAM,WAAW;;;;;AAKjB,MAAM,QAAQ;;AAGd,MAAM,QAAQ,OAAe,UAA2B,QAAQ,QAAQ,QAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,KAAK,CAAC;AAE3G,MAAM,aAAa,UAAoC,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK;AAEjI,MAAM,OAAO,YAA6B,UAAU,OAAO,IAAI,IAAI,KAAK,OAAO,CAAC,CAAC,YAAY,IAAI,OAAO,OAAO;AAY/G,MAAM,eAAe,WAA8B,OAAO,OAAO,UAAU,YAAY,OAAO,SAAS,OAAO,KAAK,KAAK,OAAO,SAAS;;;;;AAMxI,MAAa,iBAAiB,MAAc,SAAmD;CAC7F,MAAM,QAAQ,SAAS;CACvB,IAAI,SAAS,KAAA,KAAc,SAAqB,MAAM,OAAO,CAAC,GAAG,MAAM,sCAAsC;CAC7G,MAAM,WAAqB,CAAC;CAC5B,MAAM,WAAW,SAAuB;EACtC,SAAS,KAAK,GAAG,MAAM,oBAAoB,KAAK,0BAA0B;CAC5E;CACA,IAAI;CACJ,IAAI,KAAK,UAAU,KAAA,GAAW,QAAQ,mBAAmB;MACpD,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,GAAG,SAAS,KAAK,GAAG,MAAM,wBAAwB;MACjF,IAAI,CAAC,YAAY,KAAK,KAAK,GAAG,SAAS,KAAK,GAAG,MAAM,0CAA0C;MAC/F,QAAQ,QAAQ,KAAK,KAAK;CAC/B,IAAI,KAAK,YAAY,KAAA,GAAW,QAAQ,yCAAyC;MAC5E,IAAI,CAAC,OAAO,SAAS,KAAK,OAAO,GAAG,SAAS,KAAK,GAAG,MAAM,0BAA0B;MACrF,IAAI,CAAC,YAAY,KAAK,OAAO,GAAG,SAAS,KAAK,GAAG,MAAM,8CAA8C;MACrG,IAAI,UAAU,KAAA,KAAa,QAAQ,KAAK,OAAO,KAAK,OAAO,SAAS,KAAK,GAAG,MAAM,sCAAsC;CAC7H,MAAM,SAAS,KAAK;CACpB,IAAI,WAAW,KAAA,KAAc,WAAuB,MAAM,QAAQ,qBAAqB;MAClF,IAAI,OAAO,SAAS,WAAW;EAClC,IAAI,OAAO,SAAS,KAAA,GAAW,QAAQ,sCAAsC;OACxE,IAAI,CAAC,OAAO,QAAQ,OAAO,IAAI,GAAG,SAAS,KAAK,GAAG,MAAM,sBAAsB;OAC/E,IAAI,CAAC,YAAY,OAAO,IAAI,GAAG,SAAS,KAAK,GAAG,MAAM,wCAAwC;EACnG,IAAI,OAAO,YAAY,KAAA,GAAW,QAAQ,qDAAqD;OAC1F,IAAI,CAAC,OAAO,SAAS,OAAO,OAAO,GAAG,SAAS,KAAK,GAAG,MAAM,0BAA0B;OACvF,IAAI,CAAC,WAAW,OAAO,OAAO,KAAK,QAAQ,OAAO,OAAO,IAAI,aAChE,SAAS,KAAK,GAAG,MAAM,4CAA4C,OAAO,WAAW,GAAG;CAC5F,OAAO,IAAI,OAAO,SAAS,YAAY;EACrC,IAAI,OAAO,SAAS,KAAA,GAAW,QAAQ,sCAAsC;OACxE,IAAI,OAAO,SAAS,SAAS,OAAO,SAAS,SAAS,SAAS,KAAK,GAAG,MAAM,4BAA4B;EAC9G,IAAI,OAAO,SAAS,KAAA,GAAW,QAAQ,2CAA2C;OAC7E,IAAI,OAAO,OAAO,SAAS,YAAY,UAAU,GAAG,OAAO,IAAI,MAAM,KAAA,GACxE,SAAS,KAAK,GAAG,MAAM,oCAAoC,OAAO,OAAO,IAAI,GAAG;EAClF,IAAI,OAAO,UAAU,KAAA,GAAW,QAAQ,yEAAyE;OAC5G,IAAI,CAAC,OAAO,QAAQ,OAAO,KAAK,GAAG,SAAS,KAAK,GAAG,MAAM,uBAAuB;OACjF,IAAI,CAAC,YAAY,OAAO,KAAK,KAAK,CAAC,OAAO,UAAU,aAAa,OAAO,KAAK,CAAC,KAAK,aAAa,OAAO,KAAK,KAAK,QACpH,SAAS,KAAK,GAAG,MAAM,uEAAuE;CAClG,OAAO,SAAS,KAAK,GAAG,MAAM,qCAAqC;CACnE,MAAM,EAAE,aAAa;CACrB,IAAI,aAAa,KAAA,KAAa,aAAa,UAAU;EACnD,IAAI,OAAO,aAAa,YAAY,aAAa,QAAQ,CAAC,OAAO,QAAQ,QAAQ,GAAG,SAAS,KAAK,GAAG,MAAM,sCAAsC;OAC5I,IAAI,CAAC,YAAY,QAAQ,GAAG,SAAS,KAAK,GAAG,MAAM,4CAA4C;CACtG;CACA,OAAO;AACT;;AAGA,MAAa,aAAa,MAAc,SAA+B;CACrE,MAAM,WAAW,cAAc,MAAM,IAAI;CACzC,IAAI,SAAS,SAAS,GAAG,MAAM,IAAI,MAAM,SAAS,KAAK,IAAI,CAAC;CAC5D,MAAM,EAAE,QAAQ,aAAa;CAC7B,OAAO;EACL,OAAO,QAAQ,KAAK,KAAK;EACzB,SAAS,QAAQ,KAAK,OAAO;EAC7B,QACE,OAAO,SAAS,YACZ;GAAE,MAAM;GAAW,MAAM,aAAa,OAAO,IAAI;GAAG,SAAS,QAAQ,OAAO,OAAO;EAAE,IACrF;GAAE,MAAM;GAAY,MAAM,OAAO;GAAM,MAAM,OAAO;GAAM,OAAO,aAAa,OAAO,KAAK;EAAE;EAClG,GAAI,aAAa,KAAA,IAAY,CAAC,IAAI,EAAE,UAAU,aAAa,WAAW,WAAW,aAAa,QAAQ,EAAE;CAC1G;AACF;;AAgBA,MAAM,cAAc,MAAuB,MAAc,OAAe,MAAyC;CAC/G,MAAM,QAAQ,UAAU,GAAG,IAAI;CAC/B,IAAI,UAAU,KAAA,GAAW,MAAM,IAAI,WAAW,eAAe,OAAO,CAAC,EAAE,6BAA6B,MAAM;CAC1G,MAAM,EAAE,MAAM,OAAO,QAAQ;CAE7B,MAAM,WAAW,SAAyB;EACxC,MAAM,QAAQ,SAAS,QAAQ,KAAK,IAAI,MAAM,QAAQ,GAAG,MAAM,IAAI,IAAI,KAAK,IAAI,MAAM,QAAQ,IAAI,MAAM,CAAC,KAAK;EAC9G,MAAM,UAAU,eAAe,MAAM,IAAI;EACzC,IAAI,YAAY,KAAA,GAAW,MAAM,IAAI,WAAW,gBAAgB,KAAK,wCAAwC,IAAI,IAAI,GAAG;EACxH,OAAO;CACT;CACA,MAAM,QAAQ,QAAQ,CAAC;CACvB,OAAO,SAAS,IAAI,CAAC,OAAO,QAAQ,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,KAAK;AAC/D;AAEA,MAAM,aAAa,WAAyC;CAC1D,IAAI,OAAO,SAAS,WAAW;EAC7B,MAAM,EAAE,SAAS;EACjB,MAAM,OAAO,KAAK,KAAK,OAAO,OAAO,OAAO;EAC5C,OAAO;GACL,SAAS,MAAM;IACb,MAAM,QAAQ,KAAK,MAAM,IAAI,IAAI,IAAI;IACrC,OAAO,CAAC,OAAO,QAAQ,IAAI;GAC7B;GACA,WAAW,OAAO,UAAU,QAAQ,OAAO,OAAO;GAClD,SAAS,UAAU,QAAQ,OAAO;EACpC;CACF;CACA,MAAM,EAAE,MAAM,MAAM,UAAU;CAC9B,OAAO;EACL,SAAS,MAAM,WAAW,MAAM,MAAM,OAAO,CAAC;EAE9C,WAAW,MAAM;GACf,MAAM,CAAC,SAAS,WAAW,MAAM,MAAM,OAAO,CAAC;GAC/C,QAAQ,WAAW,UAAU;EAC/B;EACA,SAAS,WAAW,WAAW,MAAM,MAAM,OAAO,MAAM,CAAC,CAAC;CAC5D;AACF;;;;;;AAOA,MAAM,YAAY,UAAgC;CAChD,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM,OAAO,EAAE,OAAO,CAAC,EAAE;CACpE,MAAM,EAAE,OAAO,cAAc,WAAW;CACxC,MAAM,yBAAS,IAAI,IAAoB;CACvC,IAAI,MAAM,QAAQ,KAAK,GACrB,KAAK,MAAM,QAAQ,OAAoB;EACrC,IAAI,CAAC,MAAM,QAAQ,IAAI,KAAK,KAAK,WAAW,GAAG;EAC/C,MAAM,CAAC,OAAO,SAAS;EACvB,IAAI,UAAU,KAAK,KAAK,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK,KAAK,QAAQ,GAAG,OAAO,IAAI,QAAQ,OAAO,IAAI,KAAK,KAAK,KAAK,KAAK;CAC9I;CAEF,OAAO;EACL,OAFY,CAAC,GAAG,MAAM,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,EAErC;EACX,GAAI,UAAU,YAAY,IAAI,EAAE,aAAa,IAAI,CAAC;EAClD,GAAI,UAAU,MAAM,IAAI,EAAE,OAAO,IAAI,CAAC;CACxC;AACF;;AAGA,MAAM,SAAS,SAAkB,QAAqB,MAA2B;CAC/E,MAAM,SAAS,QAAQ,SAAS,CAAC;CACjC,MAAM,EAAE,cAAc,WAAW;CACjC,OAAO;EACL,OAAO,OAAO,MAAM,QAAQ,CAAC,WAAW,OAAO,KAAK,CAAC;EACrD,GAAI,iBAAiB,KAAA,KAAa,eAAe,IAAI,EAAE,aAAa,IAAI,CAAC;EAEzE,GAAI,WAAW,KAAA,KAAa,OAAO,QAAQ,OAAO,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,IAAI,CAAC;CAChF;AACF;;;;;;AAOA,MAAM,YAAY,MAAiB,SAAkB,QAAqB,MAA2B;CACnG,MAAM,EAAE,aAAa;CACrB,MAAM,EAAE,iBAAiB;CACzB,IAAI,aAAa,KAAA,KAAa,iBAAiB,KAAA,GAAW,OAAO;CACjE,MAAM,QAAQ,aAAa,WAAW,QAAQ,OAAO,QAAQ,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI;CACjF,OAAO,eAAe,QAAQ;EAAE,GAAG;EAAQ,cAAc;CAAM,IAAI;AACrE;AAEA,MAAM,UAAU,WAAgC,OAAO,MAAM,QAAQ,KAAK,GAAG,WAAW,MAAM,OAAO,CAAC;;AAGtG,MAAM,OAAO,SAAkB,QAAqB,GAAW,UAA+B;CAC5F,MAAM,CAAC,SAAS,QAAQ,OAAO,CAAC;CAChC,IAAI,QAAQ;CACZ,MAAM,QAAQ,OAAO,MAAM,KAAK,CAAC,IAAI,WAAsC;EACzE,IAAI,OAAO,OAAO,OAAO,CAAC,IAAI,KAAK;EACnC,QAAQ;EACR,OAAO,CAAC,IAAI,QAAQ,KAAK;CAC3B,CAAC;CACD,IAAI,CAAC,OAAO,MAAM,KAAK,CAAC,OAAO,KAAK,CAAC;CACrC,MAAM,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,EAAE;CAChC,OAAO;EAAE,GAAG;EAAQ;CAAM;AAC5B;;AAGA,MAAM,YAAY,SAAkB,QAAqB,SAAqC;CAC5F,IAAI,QAAQ;CACZ,KAAK,MAAM,CAAC,OAAO,UAAU,OAAO,OAAO;EACzC,SAAS;EACT,IAAI,CAAC,KAAK,MAAM,KAAK,GAAG,OAAO,QAAQ,OAAO,KAAK;CACrD;AAEF;AAEA,MAAM,WAAW,MAAiB,SAAkB,QAAqB,MAA0B;CACjG,MAAM,OAAO,OAAO,MAAM;CAC1B,MAAM,SAAS,OAAO,MAAM;CAC5B,MAAM,EAAE,iBAAiB;CACzB,OAAO;EACL,IAAI;EACJ;EACA,MAAM,iBAAiB,KAAA,IAAY,KAAK,IAAI,GAAG,KAAK,QAAQ,KAAK,UAAU,IAAI,IAAI;EACnF,GAAI,WAAW,KAAA,IAAY,CAAC,IAAI,EAAE,SAAS,QAAQ,OAAO,OAAO,EAAE,EAAE;EACrE,GAAI,iBAAiB,KAAA,IAAY,CAAC,IAAI,EAAE,aAAa;CACvD;AACF;;AAGA,MAAM,cAAc,UAA2B;CAC7C,IAAI,OAAO,UAAU,YAAY,CAAC,OAAO,SAAS,KAAK,KAAK,QAAQ,GAAG,MAAM,IAAI,WAAW,6DAA6D,OAAO,KAAK,GAAG;CACxK,OAAO;AACT;;AAGA,MAAM,cAAc,UAA4B;CAC9C,IAAI,MAAM,SAAS,QAAQ,WAAW,MAAM,KAAK;MAC5C,IAAI,MAAM,SAAS,aAAa;EACnC,WAAW,MAAM,KAAK;EACtB,IAAI,CAAC,UAAU,MAAM,EAAE,GAAG,MAAM,IAAI,WAAW,6CAA6C,OAAO,MAAM,EAAE,GAAG;CAChH;AACF;AAoBA,SAAgB,UAAU,MAAiB,QAAiB,SAAiB,OAA8B;CACzG,IAAI,CAAC,UAAU,OAAO,GAAG,MAAM,IAAI,WAAW,8CAA8C,OAAO,OAAO,GAAG;CAC7G,WAAW,KAAK;CAChB,MAAM,UAAU,UAAU,KAAK,MAAM;CAErC,MAAM,SAAS,SAAS,MAAM,SAAS,MAAM,SAAS,SAAS,MAAM,GAAG,OAAO,GAAG,OAAO;CACzF,MAAM,QAAQ,UAAkC;EAAE,QAAQ;EAAM,OAAO,QAAQ,MAAM,SAAS,MAAM,OAAO;CAAE;CAC7G,QAAQ,MAAM,MAAd;EACE,KAAK,QACH,OAAO,KAAK,MAAM;EACpB,KAAK,QAAQ;GACX,IAAI,OAAO;GACX,MAAM,EAAE,WAAW,YAAY,MAAM;GACrC,IAAI,OAAO,cAAc,YAAY,OAAO,SAAS,SAAS,KAAK,aAAa,GAAG;IACjF,MAAM,OAAO,KAAK,QAAQ,YAAY,OAAO,IAAI;IACjD,IAAI,KAAK,MAAM,CAAC,GAAG,OAAO,IAAI,SAAS,MAAM,SAAS,IAAI;IAC1D,OAAO;KAAE,GAAG;KAAM,QAAQ,KAAK,IAAI,KAAK,UAAU,SAAS,OAAO;IAAE;GACtE;GAEA,KADkB,cAAc,KAAA,KAAa,aAAa,MACzC,UAAU,OAAO,KAAK,UAAU,SAC/C,OAAO,SAAS,MAAM,SAAS;IAAE,GAAG;IAAM,cAAc,KAAK,IAAI,KAAK,gBAAgB,SAAS,OAAO;GAAE,GAAG,OAAO;GACpH,OAAO,KAAK,IAAI;EAClB;EACA,KAAK,aAAa;GAChB,MAAM,EAAE,OAAO,OAAO;GACtB,IAAI,UAAU,KAAM,OAAO,WAAW,KAAA,KAAa,OAAO,UAAU,IAAK,OAAO,KAAK,MAAM;GAC3F,MAAM,CAAC,SAAS,QAAQ,OAAO,EAAE;GACjC,IAAI,CAAC,OAAO,MAAM,MAAM,CAAC,YAAY,WAAW,KAAK,GAAG,OAAO,KAAK,MAAM;GAC1E,MAAM,QAAuC,CAAC;GAC9C,KAAK,MAAM,CAAC,QAAQ,UAAU,OAAO,OAAO;IAC1C,MAAM,OAAO,WAAW,QAAQ,QAAQ,KAAK,IAAI,OAAO,KAAK,IAAI;IACjE,IAAI,KAAK,MAAM,CAAC,GAAG,MAAM,KAAK,CAAC,QAAQ,IAAI,CAAC;GAC9C;GACA,OAAO,KAAK;IAAE,GAAG;IAAQ;GAAM,CAAC;EAClC;EACA,KAAK,QAAQ;GACX,MAAM,EAAE,UAAU;GAClB,MAAM,UAAU,KAAK,QAAQ,KAAK;GAClC,MAAM,UAAU,aAA0C;IAAE;IAAQ,OAAO,QAAQ;IAAO;GAAQ;GAClG,MAAM,QAAQ,QAAQ,MAAM,SAAS,QAAQ,OAAO;GACpD,IAAI,UAAU,GAAG,OAAO;IAAE;IAAQ;IAAO,SAAS;KAAE,SAAS;KAAM;IAAM;GAAE;GAC3E,IAAI,KAAK,OAAO,OAAO,GAAG,OAAO,OAAO;IAAE,SAAS;IAAO,OAAO;IAAY;IAAO,UAAU;IAAS;GAAM,CAAC;GAC9G,MAAM,OAAO,OAAO,MAAM;GAE1B,MAAM,OAAO,KAAK,OAAO,OAAO,OAAO,IAAK,SAAS,SAAS,QAAQ,OAAO,QAAQ,OAAO,KAAK,QAAQ,OAAO,OAAO,CAAC,CAAC,KAAM,KAAA;GAC/H,MAAM,QAAQ,OAA6B,YACzC,OAAO;IAAE,SAAS;IAAO;IAAO;IAAS,YAAY;KAAE,OAAO,UAAU;KAAS,MAAM;IAAK;IAAG;GAAM,CAAC;GACxG,IAAI,OAAO,iBAAiB,KAAA,GAAW,OAAO,KAAK,YAAY,KAAK,IAAI,OAAO,cAAc,QAAQ,OAAO,YAAY,CAAC;GACzH,IAAI,SAAS,KAAA,GAAW,OAAO,KAAK,SAAS,IAAI;GACjD,MAAM,OAAO,KAAK,IAAI,SAAS,QAAQ,SAAS,KAAK,CAAC;GACtD,OAAO;IAAE,GAAG;IAAM,SAAS;KAAE,SAAS;KAAM,OAAO,KAAK;IAAM;GAAE;EAClE;CACF;AACF;;AAmCA,MAAM,WAAW,WAAiC,OAAO,MAAM,WAAW,KAAK,OAAO,iBAAiB,KAAA,KAAa,OAAO,WAAW,KAAA;;;;;;;AAQtI,MAAa,yBAA2C;CACtD,MAAM,yBAAS,IAAI,IAAsC;CACzD,OAAO;EACL,MAAM;EACN,OAAO,OAAO,KAAK,MAAM;GACvB,IAAI,QAAQ,OAAO,IAAI,KAAK;GAC5B,IAAI,UAAU,KAAA,GAAW;IACvB,wBAAQ,IAAI,IAAI;IAChB,OAAO,IAAI,OAAO,KAAK;GACzB;GACA,MAAM,EAAE,QAAQ,WAAW,KAAK,MAAM,IAAI,GAAG,CAAC;GAC9C,IAAI,QAAQ,MAAM,GAAG,MAAM,OAAO,GAAG;QAChC,MAAM,IAAI,KAAK,MAAM;GAC1B,IAAI,MAAM,SAAS,GAAG,OAAO,OAAO,KAAK;GACzC,OAAO;EACT;EACA,KAAK,OAAO;GACV,OAAO,OAAO,IAAI,KAAK,CAAC,EAAE,QAAQ;EACpC;CACF;AACF;;AAqBA,MAAM,aAAa,UACjB,OAAO,UAAU,YAAY,UAAU,QAAQ,OAAQ,MAA6B,SAAS;;;;;;;;;AAU/F,SAAgB,WACd,MACA,MACA,OACA,OACkB;CAClB,MAAM,OAAO,UAAU,MAAM,IAAI;CACjC,IAAI,MAAM,SAAS,QAAQ,MAAM,IAAI,MAAM,SAAS,KAAK,iFAAiF;CAC1I,MAAM,UAAa,YAAwD;EACzE,IAAI,CAAC,MAAM,MAAM,QAAQ,YAAY,QAAQ,EAAA,CAAG;EAChD,MAAM,QAAQ,QAAQ;EACtB,IAAI,UAAU,KAAK,GAAG;GAEpB,MAAM,KAAK,KAAA,SAAiB,CAAC,CAAC;GAC9B,MAAM,IAAI,MAAM,SAAS,KAAK,yEAAyE;EACzG;EACA,OAAO;CACT;CACA,MAAM,UAAa,KAAa,OAAmB,SACjD,aAAa;EACX,WAAW,KAAK;EAChB,OAAO,MAAM,OAAO,MAAM,MAAM,WAAW;GACzC,MAAM,OAAO,UAAU,MAAM,QAAQ,MAAM,IAAI,GAAG,KAAK;GACvD,OAAO;IAAE,QAAQ,KAAK;IAAQ,QAAQ,KAAK,IAAI;GAAE;EACnD,CAAC;CACH,CAAC;CACH,MAAM,aAAa,SAAkC,KAAK;CAC1D,MAAM,eAAe,SAAgC,KAAK;CAC1D,MAAM,EAAE,QAAQ,aAAa;CAC7B,OAAO;EACL;EACA,MAAM;GACJ,OAAO,EAAE,GAAG,KAAK,MAAM;GACvB,SAAS,EAAE,GAAG,KAAK,QAAQ;GAC3B,QACE,OAAO,SAAS,YACZ;IAAE,MAAM;IAAW,MAAM,EAAE,GAAG,OAAO,KAAK;IAAG,SAAS,EAAE,GAAG,OAAO,QAAQ;GAAE,IAC5E;IAAE,MAAM;IAAY,MAAM,OAAO;IAAM,MAAM,OAAO;IAAM,OAAO,EAAE,GAAG,OAAO,MAAM;GAAE;GAC3F,GAAI,aAAa,KAAA,IAAY,CAAC,IAAI,EAAE,UAAU,aAAa,WAAW,WAAW,EAAE,GAAG,SAAS,EAAE;EACnG;EACA;EACA,MAAM,MAAM;EACZ,OAAO,KAAK,QAAQ,MAAM,OAAO,KAAK;GAAE,MAAM;GAAQ;EAAM,GAAG,SAAS;EACxE,OAAO,KAAK,YAAY,OAAO,KAAK;GAAE,MAAM;GAAQ,SAAS,EAAE,GAAG,QAAQ;EAAE,GAAG,WAAW;EAC1F,WAAW,KAAK,OAAO,OAAO,OAAO,KAAK;GAAE,MAAM;GAAa;GAAO;EAAG,GAAG,WAAW;EACvF,QAAQ,QAAQ,OAAO,KAAK,EAAE,MAAM,OAAO,GAAG,WAAW;CAC3D;AACF;;AA4CA,MAAM,YAAY,aAA8C;CAC9D,IAAI,OAAO;CACX,KAAK,IAAI,QAAQ,GAAG,QAAQ,SAAS,QAAQ,SAAS,GAAG;EACvD,MAAM,UAAU,SAAS;EACzB,IAAI,QAAQ,SAAS;EACrB,MAAM,UAAU,OAAO,IAAI,KAAA,IAAa,SAAS;EACjD,IAAI,YAAY,KAAA,GAAW,OAAO;OAC7B,IAAI,QAAQ,UAAU,YAAY;OAClC,IAAI,QAAQ,UAAU,cAAc,QAAQ,UAAU,QAAQ,SAAS,OAAO;CACrF;CACA,OAAO;AACT;;;;;;AAOA,UAAU,KAAK,OAAkE;CAC/E,MAAM,WAA2B,CAAC;CAClC,MAAM,WAAkE,CAAC;;CAEzE,UAAU,SAAS,OAAwD;EACzE,MAAM,UAAU,SAAS;EACzB,MAAM,OAAO,MAAM;EACnB,IAAI,CAAC,QAAQ,WAAW,KAAK,UAAU,GAAG,OAAO,QAAQ;EACzD,IAAI;GACF,OAAQ,YAAY,KAAK,MAAM,SAAS,KAAK,KAAK,KAAK,OAAO,QAAQ,MAAM,EAAE;EAChF,SAAS,OAAO;GACd,SAAS,KAAK;IAAE;IAAO;GAAM,CAAC;GAC9B,OAAO,QAAQ;EACjB;CACF;CACA,IAAI;EACF,KAAK,MAAM,QAAQ,OAAO,SAAS,KAAM,YAAY,KAAK,MAAM,KAAK,KAAK,KAAK,KAAK,KAAK,CAAkB;CAC7G,SAAS,OAAO;EAEd,KAAK,IAAI,QAAQ,GAAG,QAAQ,SAAS,QAAQ,SAAS,GAAG,OAAO,SAAS,KAAK;EAC9E,OAAO;GAAE;GAAO;EAAS;CAC3B;CACA,MAAM,QAAQ,SAAS,QAAQ;CAC/B,IAAI,QAAQ,GAAG,OAAO;EAAE,SAAS;GAAE,SAAS;GAAM,QAAQ,SAAS,KAAK,YAAY,QAAQ,KAAK;EAAE;EAAG;CAAS;CAC/G,MAAM,SAAuB,CAAC;CAC9B,KAAK,IAAI,KAAK,GAAG,KAAK,MAAM,QAAQ,MAAM,GAAG,OAAO,KAAK,OAAO,SAAS,EAAE,CAAC;CAC5E,OAAO;EAAE,SAAS;GAAE,SAAS;GAAO;GAAO,SAAS,SAAS;GAAwB;EAAO;EAAG;CAAS;AAC1G;;AAGA,MAAM,UAAU,QAAgB,YAA0D;CACxF,KAAK,MAAM,WAAW,OAAO,UAAU,SAAS,kBAAkB,QAAQ,OAAO,QAAQ,KAAK;CAC9F,IAAI,WAAW,QAAQ,MAAM,OAAO;CACpC,OAAO,OAAO;AAChB;AAEA,MAAM,aAAa,OAA6B,YAA0D;CACxG,MAAM,QAAQ,KAAK,KAAK;CACxB,IAAI,OAAO,MAAM,KAAK;CACtB,OAAO,CAAC,KAAK,MAAM;EACjB,IAAI;EACJ,IAAI;EACJ,IAAI;GACF,QAAQ,KAAK,MAAM;EACrB,SAAS,OAAO;GACd,UAAU,EAAE,MAAM;EACpB;EACA,OAAO,YAAY,KAAA,IAAY,MAAM,KAAK,KAAK,IAAI,MAAM,MAAM,QAAQ,KAAK;CAC9E;CACA,OAAO,OAAO,KAAK,OAAO,OAAO;AACnC;AAEA,MAAM,aAAa,OAAO,OAA6B,YAAmE;CACxH,MAAM,QAAQ,KAAK,KAAK;CACxB,IAAI,OAAO,MAAM,KAAK;CACtB,OAAO,CAAC,KAAK,MAAM;EACjB,IAAI;EACJ,IAAI;EACJ,IAAI;GACF,QAAQ,MAAM,KAAK,MAAM;EAC3B,SAAS,OAAO;GACd,UAAU,EAAE,MAAM;EACpB;EACA,OAAO,YAAY,KAAA,IAAY,MAAM,KAAK,KAAK,IAAI,MAAM,MAAM,QAAQ,KAAK;CAC9E;CACA,OAAO,OAAO,KAAK,OAAO,OAAO;AACnC;AAeA,SAAgB,WAAW,OAA6B,SAAqE;CAC3H,OAAO,MAAM,OAAO,SAAS,KAAK,MAAM,IAAI,IAAI,UAAU,OAAO,OAAO,IAAI,WAAW,OAAO,OAAO;AACvG"}