@mark1russell7/service 0.8.14 → 0.8.15

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.
@@ -0,0 +1 @@
1
+ {"version":3,"file":"limiter-sT9fUFdW.js","names":["r","isPromise"],"sources":["../src/limiter/store.ts","../src/limiter/machine.ts","../src/limiter/quota.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, overCapacity, unitsOf } 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 * This count is the units of the take: 1 when it is absent. A store takes all of them in its one\n * atomic step, or none. `keyedLimiter` always gives it, and it refuses a take over the capacity\n * before the store. A store also refuses such a take with the cause `capacity`.\n */\n readonly units?: number | undefined;\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 of `units` units. It removes a key only when its state is equal to\n * the state of a new key. It holds at most `maxKeys` keys for each limiter. A failure of a shared\n * store rejects 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, units }) {\n const n = unitsOf(units);\n // a take over the capacity is refused at each time: it reads no state, and it adds no key\n const over = overCapacity(rule, n);\n if (over !== undefined) return over;\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);\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 `units` units for a key (1 when absent), and gives the decision of the store.\n * When a shared store fails, it gives the decision of `onStoreFailure`, with the failure as text.\n * A take over the capacity of the policy is refused with the cause `capacity`, before the store.\n * It rejects units that are not a whole number of 1 or more.\n */\n take(key: string, units?: number): Promise<Decision>;\n /**\n * This method takes `units` units for a key (1 when absent), and gives the decision at once, with\n * no promise. Only a local store whose take gives its decision at once permits it, for example\n * `memoryStore`. A shared store throws.\n */\n tryTakeSync?(key: string, units?: number): Decision;\n}\n\n/** A local limiter is a keyed limiter on a memory store: its take can give the decision at once. */\nexport interface LocalLimiter extends KeyedLimiter {\n tryTakeSync(key: string, units?: number): 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 * - A take over the capacity of the policy is refused with the cause `capacity`, before the store.\n * Thus a store of your own that does not read `units` cannot let it in.\n * - `tryTakeSync` gives the decision at once. A shared store throws, and so does a local store that gives a promise.\n */\nexport function keyedLimiter(name: string, spec: LimiterSpec, store: MemoryStore): LocalLimiter;\nexport function keyedLimiter(name: string, spec: LimiterSpec, store: LimiterStore): KeyedLimiter;\nexport function 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, units?: number): Promise<Decision> => {\n const n = unitsOf(units);\n const over = overCapacity(rule, n);\n if (over !== undefined) return over;\n const request: TakeRequest = { limiter: name, key, rule, maxKeys, units: n };\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 const tryTakeSync = (key: string, units?: number): Decision => {\n if (store.kind === \"shared\")\n throw new Error(`limiter ${name} has a shared store, which decides in a promise: tryTakeSync needs a memory store, thus use take()`);\n const n = unitsOf(units);\n const over = overCapacity(rule, n);\n if (over !== undefined) return over;\n const decision = store.take({ limiter: name, key, rule, maxKeys, units: n });\n if (isPromise(decision)) {\n // the take of the store happened: its promise has the decision, and its rejection is not left unhandled\n decision.then(undefined, () => {});\n throw new Error(`limiter ${name} has a store whose take gives a promise: tryTakeSync needs a memory store, thus use take()`);\n }\n return decision;\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 tryTakeSync,\n };\n}\n\n/** This function tells if a decision of a store is a promise. */\nconst isPromise = (value: Decision | Promise<Decision>): value is Promise<Decision> =>\n typeof (value as { then?: unknown }).then === \"function\";\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","// 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\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}\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 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 } = 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 };\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\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 *\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 const record = prune(buckets, recordOf(stored), 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 = { ...next, blockedUntil: Math.max(next.blockedUntil ?? resetAt, resetAt) };\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 } = 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 },\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/** A quota part is one take of a multi-quota take: a quota, a key, and the units of the take. */\nexport interface QuotaPart<Sync extends boolean = boolean> {\n readonly quota: KeyedQuota<Sync>;\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/** A request of the walk of a multi-quota take: a call of one method of a quota. */\ntype Request = () => unknown;\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/** This walk takes each part in order, then gives back the counted parts of a refused take. The driver answers each request. */\nfunction* walk(parts: readonly QuotaPart[]): Generator<Request, QuotasVerdict, unknown> {\n const verdicts: QuotaVerdict[] = [];\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) {\n const verdict = verdicts[index]!;\n const part = parts[index]!;\n if (!verdict.allowed || part.units === 0) continue;\n try {\n yield () => part.quota.giveBack(part.key, part.units, verdict.state.at);\n } catch {\n // the first error tells why the take failed: a later error of a give-back does not hide it\n }\n }\n throw error;\n }\n const index = decisive(verdicts);\n if (index < 0) return { allowed: true, states: verdicts.map((verdict) => verdict.state) };\n const states: QuotaState[] = [];\n for (let at = 0; at < parts.length; at += 1) {\n const verdict = verdicts[at]!;\n const part = parts[at]!;\n if (!verdict.allowed || part.units === 0) states.push(verdict.state);\n else states.push((yield () => part.quota.giveBack(part.key, part.units, verdict.state.at)) as QuotaState);\n }\n return { allowed: false, index, refusal: verdicts[index] as QuotaRefused, states };\n}\n\nconst driveSync = (parts: readonly QuotaPart[]): 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 next.value;\n};\n\nconst driveAsync = async (parts: readonly QuotaPart[]): 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 next.value;\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 * With quotas that answer at once, it answers at once. Else it gives a promise.\n */\nexport function takeQuotas(parts: readonly QuotaPart<true>[]): QuotasVerdict;\nexport function takeQuotas(parts: readonly QuotaPart[]): QuotasVerdict | Promise<QuotasVerdict>;\nexport function takeQuotas(parts: readonly QuotaPart[]): QuotasVerdict | Promise<QuotasVerdict> {\n return parts.every((part) => part.quota.sync) ? driveSync(parts) : driveAsync(parts);\n}\n"],"mappings":";;;;AAyDA,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,SAAS,SAAS;GAC3C,MAAM,IAAI,QAAQ,KAAK;GAEvB,MAAM,OAAO,aAAa,MAAM,CAAC;GACjC,IAAI,SAAS,KAAA,GAAW,OAAO;GAC/B,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,KAAK,CAAC;GACvC,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;;AA+BA,MAAM,aAAa,UAA4B,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAgBpG,SAAgB,aAAa,MAAc,MAAmB,OAAmC;CAC/F,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,KAAa,UAAsC;EACrE,MAAM,IAAI,QAAQ,KAAK;EACvB,MAAM,OAAO,aAAa,MAAM,CAAC;EACjC,IAAI,SAAS,KAAA,GAAW,OAAO;EAC/B,MAAM,UAAuB;GAAE,SAAS;GAAM;GAAK;GAAM;GAAS,OAAO;EAAE;EAC3E,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,MAAM,eAAe,KAAa,UAA6B;EAC7D,IAAI,MAAM,SAAS,UACjB,MAAM,IAAI,MAAM,WAAW,KAAK,mGAAmG;EACrI,MAAM,IAAI,QAAQ,KAAK;EACvB,MAAM,OAAO,aAAa,MAAM,CAAC;EACjC,IAAI,SAAS,KAAA,GAAW,OAAO;EAC/B,MAAM,WAAW,MAAM,KAAK;GAAE,SAAS;GAAM;GAAK;GAAM;GAAS,OAAO;EAAE,CAAC;EAC3E,IAAIC,YAAU,QAAQ,GAAG;GAEvB,SAAS,KAAK,KAAA,SAAiB,CAAC,CAAC;GACjC,MAAM,IAAI,MAAM,WAAW,KAAK,2FAA2F;EAC7H;EACA,OAAO;CACT;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;EACA;CACF;AACF;;AAGA,MAAMA,eAAa,UACjB,OAAQ,MAA6B,SAAS;;ACpNhD,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;;AC/BA,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,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,WAAW;CACnB,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;CACpG;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;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;AAkBA,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;CACrC,MAAM,SAAS,MAAM,SAAS,SAAS,MAAM,GAAG,OAAO;CACvD,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;IAAE,GAAG;IAAM,cAAc,KAAK,IAAI,KAAK,gBAAgB,SAAS,OAAO;GAAE;GAClF,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,WAAW;CACnB,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;EAC7F;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;;AAwBA,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;;AAGA,UAAU,KAAK,OAAyE;CACtF,MAAM,WAA2B,CAAC;CAClC,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;GACvD,MAAM,UAAU,SAAS;GACzB,MAAM,OAAO,MAAM;GACnB,IAAI,CAAC,QAAQ,WAAW,KAAK,UAAU,GAAG;GAC1C,IAAI;IACF,YAAY,KAAK,MAAM,SAAS,KAAK,KAAK,KAAK,OAAO,QAAQ,MAAM,EAAE;GACxE,QAAQ,CAER;EACF;EACA,MAAM;CACR;CACA,MAAM,QAAQ,SAAS,QAAQ;CAC/B,IAAI,QAAQ,GAAG,OAAO;EAAE,SAAS;EAAM,QAAQ,SAAS,KAAK,YAAY,QAAQ,KAAK;CAAE;CACxF,MAAM,SAAuB,CAAC;CAC9B,KAAK,IAAI,KAAK,GAAG,KAAK,MAAM,QAAQ,MAAM,GAAG;EAC3C,MAAM,UAAU,SAAS;EACzB,MAAM,OAAO,MAAM;EACnB,IAAI,CAAC,QAAQ,WAAW,KAAK,UAAU,GAAG,OAAO,KAAK,QAAQ,KAAK;OAC9D,OAAO,KAAM,YAAY,KAAK,MAAM,SAAS,KAAK,KAAK,KAAK,OAAO,QAAQ,MAAM,EAAE,CAAgB;CAC1G;CACA,OAAO;EAAE,SAAS;EAAO;EAAO,SAAS,SAAS;EAAwB;CAAO;AACnF;AAEA,MAAM,aAAa,UAA+C;CAChE,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,KAAK;AACd;AAEA,MAAM,aAAa,OAAO,UAAwD;CAChF,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,KAAK;AACd;AAYA,SAAgB,WAAW,OAAqE;CAC9F,OAAO,MAAM,OAAO,SAAS,KAAK,MAAM,IAAI,IAAI,UAAU,KAAK,IAAI,WAAW,KAAK;AACrF"}
@@ -1,4 +1,4 @@
1
1
  import { C as limitRule, D as retryAfterSeconds, E as overCapacity, O as unitsOf, S as idleSpan, T as longestRetryAfter, _ as WaitCause, a as LimitPolicy, b as decide, c as LimiterEviction, d as RefusalCause, f as Refused, g as TokenBucket, h as TakeStep, i as KeyState, l as LimiterSpec, m as StoreFailure, n as CapacityRefused, o as LimitRule, p as SlidingWindow, r as Decision, s as Limiter, t as Allowed, u as LimiterStoreSpec, v as WaitRefused, w as limiterProblems, x as freeAt, y as capacityOf } from "./policy-CBcK2XGg.js";
2
2
  import { a as TakeRequest, i as MemoryStore, n as LimiterStore, o as keyedLimiter, r as LocalLimiter, s as memoryStore, t as KeyedLimiter } from "./store-DFwFKrsB.js";
3
- import { a as limiterStateOf, i as limiterMachine, n as SLIDING_WINDOW_MACHINE, r as TOKEN_BUCKET_MACHINE, t as LimiterState } from "./limiter-Djw39d_S.js";
4
- export { type Allowed, type CapacityRefused, type Decision, type KeyState, type KeyedLimiter, type LimitPolicy, type LimitRule, type Limiter, type LimiterEviction, type LimiterSpec, type LimiterState, type LimiterStore, type LimiterStoreSpec, type LocalLimiter, type MemoryStore, type RefusalCause, type Refused, SLIDING_WINDOW_MACHINE, type SlidingWindow, type StoreFailure, TOKEN_BUCKET_MACHINE, type TakeRequest, type TakeStep, type TokenBucket, type WaitCause, type WaitRefused, capacityOf, decide, freeAt, idleSpan, keyedLimiter, limitRule, limiterMachine, limiterProblems, limiterStateOf, longestRetryAfter, memoryStore, overCapacity, retryAfterSeconds, unitsOf };
3
+ import { A as LimiterState, C as RollingWindow, D as quotaRule, E as quotaProblems, M as TOKEN_BUCKET_MACHINE, N as limiterMachine, O as quotaStep, P as limiterStateOf, S as QuotasVerdict, T as memoryQuotaStore, _ as QuotaStore, a as QuotaAnswer, b as QuotaWaitRefused, c as QuotaEvent, d as QuotaRecord, f as QuotaRefused, g as QuotaStep, h as QuotaState, i as QuotaAllowed, j as SLIDING_WINDOW_MACHINE, k as takeQuotas, l as QuotaPart, m as QuotaSpec, n as KeyedQuota, o as QuotaCapacityRefused, p as QuotaRule, r as MemoryQuotaStore, s as QuotaChange, t as CalendarWindow, u as QuotaReading, v as QuotaTakeStep, w as keyedQuota, x as QuotaWindow, y as QuotaVerdict } from "./limiter-Dvh0YW25.js";
4
+ export { type Allowed, type CalendarWindow, type CapacityRefused, type Decision, type KeyState, type KeyedLimiter, type KeyedQuota, type LimitPolicy, type LimitRule, type Limiter, type LimiterEviction, type LimiterSpec, type LimiterState, type LimiterStore, type LimiterStoreSpec, type LocalLimiter, type MemoryQuotaStore, type MemoryStore, type QuotaAllowed, type QuotaAnswer, type QuotaCapacityRefused, type QuotaChange, type QuotaEvent, type QuotaPart, type QuotaReading, type QuotaRecord, type QuotaRefused, type QuotaRule, type QuotaSpec, type QuotaState, type QuotaStep, type QuotaStore, type QuotaTakeStep, type QuotaVerdict, type QuotaWaitRefused, type QuotaWindow, type QuotasVerdict, type RefusalCause, type Refused, type RollingWindow, SLIDING_WINDOW_MACHINE, type SlidingWindow, type StoreFailure, TOKEN_BUCKET_MACHINE, type TakeRequest, type TakeStep, type TokenBucket, type WaitCause, type WaitRefused, capacityOf, decide, freeAt, idleSpan, keyedLimiter, keyedQuota, limitRule, limiterMachine, limiterProblems, limiterStateOf, longestRetryAfter, memoryQuotaStore, memoryStore, overCapacity, quotaProblems, quotaRule, quotaStep, retryAfterSeconds, takeQuotas, unitsOf };
package/build/limiter.js CHANGED
@@ -1,3 +1,3 @@
1
- import { a as limitRule, c as overCapacity, i as idleSpan, l as retryAfterSeconds, n as decide, o as limiterProblems, r as freeAt, s as longestRetryAfter, t as capacityOf, u as unitsOf } from "./policy-B23MY52l.js";
2
- import { a as keyedLimiter, i as limiterStateOf, n as TOKEN_BUCKET_MACHINE, o as memoryStore, r as limiterMachine, t as SLIDING_WINDOW_MACHINE } from "./limiter-BwGxEWpP.js";
3
- export { SLIDING_WINDOW_MACHINE, TOKEN_BUCKET_MACHINE, capacityOf, decide, freeAt, idleSpan, keyedLimiter, limitRule, limiterMachine, limiterProblems, limiterStateOf, longestRetryAfter, memoryStore, overCapacity, retryAfterSeconds, unitsOf };
1
+ import { a as freeAt, d as longestRetryAfter, g as unitsOf, l as limitRule, m as retryAfterSeconds, o as idleSpan, p as overCapacity, r as decide, t as capacityOf, u as limiterProblems } from "./policy-UYALkqVq.js";
2
+ import { a as quotaStep, c as TOKEN_BUCKET_MACHINE, d as keyedLimiter, f as memoryStore, i as quotaRule, l as limiterMachine, n as memoryQuotaStore, o as takeQuotas, r as quotaProblems, s as SLIDING_WINDOW_MACHINE, t as keyedQuota, u as limiterStateOf } from "./limiter-sT9fUFdW.js";
3
+ export { SLIDING_WINDOW_MACHINE, TOKEN_BUCKET_MACHINE, capacityOf, decide, freeAt, idleSpan, keyedLimiter, keyedQuota, limitRule, limiterMachine, limiterProblems, limiterStateOf, longestRetryAfter, memoryQuotaStore, memoryStore, overCapacity, quotaProblems, quotaRule, quotaStep, retryAfterSeconds, takeQuotas, unitsOf };
@@ -5,6 +5,7 @@ import { convertExact, convertible, rationals } from "@mark1russell7/quantity";
5
5
  * rate of 3 for each second gives an interval that floating point cannot hold exactly.
6
6
  */
7
7
  const TOLERANCE = 1e-6;
8
+ /** These checks of an amount are internal: the quota module uses them, and the entry does not export them. */
8
9
  const isCount = (amount) => amount !== void 0 && convertible(amount.unit, "count");
9
10
  const isTime = (amount) => amount !== void 0 && convertible(amount.unit, "s");
10
11
  const isRate = (amount) => amount !== void 0 && convertible(amount.unit, "count/s");
@@ -222,6 +223,6 @@ const decide = (rule, state, now, units) => {
222
223
  }
223
224
  };
224
225
  };
225
- export { limitRule as a, overCapacity as c, idleSpan as i, retryAfterSeconds as l, decide as n, limiterProblems as o, freeAt as r, longestRetryAfter as s, capacityOf as t, unitsOf as u };
226
+ export { wholeCount as _, freeAt as a, isTime as c, longestRetryAfter as d, milliseconds as f, unitsOf as g, safely as h, finiteAbove as i, limitRule as l, retryAfterSeconds as m, countOf as n, idleSpan as o, overCapacity as p, decide as r, isCount as s, capacityOf as t, limiterProblems as u };
226
227
 
227
- //# sourceMappingURL=policy-B23MY52l.js.map
228
+ //# sourceMappingURL=policy-UYALkqVq.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"policy-UYALkqVq.js","names":["r"],"sources":["../src/limiter/policy.ts"],"sourcesContent":["import type { Quantity } from \"@mark1russell7/quantity\";\nimport { convertExact, convertible, rationals as r } from \"@mark1russell7/quantity\";\n\n/**\n * A token bucket gives each key a bucket of `burst` tokens. The bucket refills at `rate`, and each\n * take uses one token. Thus a key can make `burst` takes at once after an idle time, and then\n * `rate` takes in each unit of time.\n */\nexport interface TokenBucket {\n readonly type: \"token-bucket\";\n /** This rate is how fast the bucket refills: a count for each unit of time, for example `{ value: 10, unit: \"count/s\" }`. */\n readonly rate: Quantity;\n /** This count is the size of the bucket: the most takes in a sequence after an idle time. */\n readonly burst: Quantity;\n}\n\n/**\n * A sliding window gives each key at most `limit` takes in each `window`. Each take counts for one\n * window from its time, thus the window moves with the clock and has no fixed edges.\n */\nexport interface SlidingWindow {\n readonly type: \"sliding-window\";\n /** This count is the most takes of one key in one window. */\n readonly limit: Quantity;\n /** This time is the length of the window. */\n readonly window: Quantity;\n}\n\n/** A limit policy is the rule that a keyed limiter applies to each key, as data. It has no defaults. */\nexport type LimitPolicy = TokenBucket | SlidingWindow;\n\n/**\n * A store failure policy tells what a take does when a shared store fails. It has no default.\n * - `open`: the limiter lets the take in. The count is not known, thus `remaining` is 0.\n * - `closed`: the limiter refuses the take with the cause `store`. Its `retryAfter` is the longest\n * `retryAfter` of the policy (`longestRetryAfter`). Thus O29 and O30 apply to it too.\n */\nexport type StoreFailure = \"open\" | \"closed\";\n\n/**\n * A store spec tells where the counts of the keys are:\n * - `local`: in the memory of each replica. A limit L over N replicas is then L / N on each\n * replica. That sum holds only on average, when the balancer spreads the takes of each key evenly.\n * A local store does not fail, thus it has no `onStoreFailure`, and the limiter ignores one.\n * - `shared`: in a store that the replicas share, the dependency of that name. The store decides\n * each take in one atomic step, on its own clock. Thus the limit holds across the replicas.\n * `onStoreFailure` tells what a take does when the store fails.\n */\nexport type LimiterStoreSpec =\n | { readonly kind: \"local\" }\n | { readonly kind: \"shared\"; readonly dependency: string; readonly onStoreFailure: StoreFailure };\n\n/**\n * The eviction of a limiter bounds its keys. A store removes a key only when its state is equal to\n * the state of a new key. That is a bucket that is full again, or a window with no take in it.\n * Thus an eviction changes no decision.\n */\nexport interface LimiterEviction {\n /**\n * This count is the most keys that the store holds. At the cap, the store refuses a take of a new\n * key until a held key is idle for its span (`idleSpan`). A held key keeps its count.\n */\n readonly maxKeys: Quantity;\n}\n\n/** A limiter spec is the declaration of one keyed limiter. Each part is necessary, because the limiter has no defaults. */\nexport interface LimiterSpec {\n /** This text tells what the key of each take is, for example `tenant` or `principal`. The caller gives each key. */\n readonly key: string;\n readonly policy: LimitPolicy;\n readonly store: LimiterStoreSpec;\n readonly evict: LimiterEviction;\n}\n\n/** A limiter is a keyed limiter in the description of a service: its name and its spec. */\nexport interface Limiter extends LimiterSpec {\n readonly name: string;\n}\n\n/**\n * A wait cause tells why a take is refused for a time:\n * - `limit`: the key used its limit.\n * - `cap`: the store holds its cap of keys, and the key is new.\n * - `store`: the shared store failed, and its spec declares `onStoreFailure: \"closed\"`.\n */\nexport type WaitCause = \"limit\" | \"cap\" | \"store\";\n\n/**\n * A refusal cause tells why a take is refused: a wait cause, or `capacity`. The cause `capacity` is\n * a take whose units are over the capacity of the policy. No wait lets it in.\n */\nexport type RefusalCause = WaitCause | \"capacity\";\n\n/**\n * A permitted take used its units of its key. `remaining` is the count of units that the key can\n * take at this time.\n */\nexport interface Allowed {\n readonly allowed: true;\n readonly remaining: number;\n /** This text is the failure of a shared store, when `onStoreFailure: \"open\"` lets the take in. */\n readonly failure?: string | undefined;\n}\n\n/**\n * A wait refusal used nothing. `retryAfter` is the time until the limiter lets the same take in, when\n * no other take comes first. It is always above zero.\n */\nexport interface WaitRefused {\n readonly allowed: false;\n readonly cause: WaitCause;\n readonly retryAfter: Quantity;\n /** This text is the failure of a shared store, for the cause `store`. */\n readonly failure?: string | undefined;\n}\n\n/**\n * A capacity refusal used nothing, and the same take is refused at each time. Its `units` are over\n * the `capacity` of the policy: the `burst` of a bucket, or the `limit` of a window. A caller can\n * split the take into parts of at most `capacity` units.\n */\nexport interface CapacityRefused {\n readonly allowed: false;\n readonly cause: \"capacity\";\n readonly units: number;\n readonly capacity: number;\n}\n\n/**\n * A refused take used nothing. The cause tells the type: a `WaitRefused` has a `retryAfter`, and a\n * `CapacityRefused` has none. Thus a caller examines the cause before it reads `retryAfter`.\n */\nexport type Refused = WaitRefused | CapacityRefused;\n\n/** A decision is the answer of a limiter to one take. */\nexport type Decision = Allowed | Refused;\n\n/**\n * A limit rule is a policy in numbers, which a store applies: each time in milliseconds, and each\n * count as a number. A store in another process, for example a script of Redis, gets these numbers.\n */\nexport type LimitRule =\n | {\n readonly type: \"token-bucket\";\n /** This time is the refill of one token, in milliseconds. */\n readonly interval: number;\n readonly burst: number;\n }\n | {\n readonly type: \"sliding-window\";\n readonly limit: number;\n /** This time is the length of the window, in milliseconds. */\n readonly window: number;\n };\n\n/**\n * A key state is what a store keeps for one key:\n * - A token bucket keeps the time at which its bucket is full again (`full`, in milliseconds).\n * - A sliding window keeps the time of each permitted take in the window, the oldest first.\n */\nexport type KeyState =\n | { readonly type: \"token-bucket\"; readonly full: number }\n | { readonly type: \"sliding-window\"; readonly stamps: readonly number[] };\n\n/** A step is the decision of one take, and the state of its key after the take. A refusal keeps the count of the key. */\nexport interface TakeStep {\n readonly decision: Decision;\n readonly state: KeyState;\n}\n\n/**\n * This tolerance is one nanosecond, in milliseconds. A comparison of times permits it, because a\n * rate of 3 for each second gives an interval that floating point cannot hold exactly.\n */\nconst TOLERANCE = 1e-6;\n\n/** These checks of an amount are internal: the quota module uses them, and the entry does not export them. */\nexport const isCount = (amount: Quantity | undefined): boolean => amount !== undefined && convertible(amount.unit, \"count\");\nexport const isTime = (amount: Quantity | undefined): boolean => amount !== undefined && convertible(amount.unit, \"s\");\nconst isRate = (amount: Quantity | undefined): boolean => amount !== undefined && convertible(amount.unit, \"count/s\");\n/** This function tells if a unit converts, also for a unit that the quantity package does not know. */\nexport const safely = (test: (amount: Quantity | undefined) => boolean, amount: Quantity | undefined): boolean => {\n try {\n return test(amount);\n } catch {\n return false;\n }\n};\nexport const finiteAbove = (amount: Quantity): boolean => typeof amount.value === \"number\" && Number.isFinite(amount.value) && amount.value > 0;\nexport const wholeCount = (amount: Quantity): boolean => finiteAbove(amount) && Number.isInteger(r.toNumber(convertExact(r.fromNumber(amount.value), amount.unit, \"count\")));\n\n/** A loose policy is a policy from any source, with each part optional, for the check of its parts. */\ninterface LoosePolicy {\n readonly type?: string;\n readonly rate?: Quantity;\n readonly burst?: Quantity;\n readonly limit?: Quantity;\n readonly window?: Quantity;\n}\n\n/**\n * This function gives the problems of a limiter spec. `describe()` and `keyedLimiter` refuse a spec\n * with a problem. A part that is absent is a problem, because the limiter has no defaults.\n */\nexport const limiterProblems = (name: string, spec: Partial<LimiterSpec> | undefined): string[] => {\n const owner = `limiter ${name}`;\n if (spec === undefined || (spec as unknown) === null) return [`${owner} has no spec: a limiter has no defaults`];\n const problems: string[] = [];\n const missing = (part: string): void => {\n problems.push(`${owner} does not declare ${part}: a limiter has no defaults`);\n };\n if (typeof spec.key !== \"string\") missing(\"what its key is (key)\");\n else if (spec.key.trim().length === 0) problems.push(`${owner} names no key`);\n const policy = spec.policy as LoosePolicy | undefined;\n if (policy === undefined) missing(\"its policy (policy)\");\n else if (policy.type === \"token-bucket\") {\n if (policy.rate === undefined) missing(\"the rate of its bucket (policy.rate)\");\n else if (!safely(isRate, policy.rate)) problems.push(`${owner}'s rate is not a count for each unit of time, for example count/s`);\n else if (!finiteAbove(policy.rate)) problems.push(`${owner}'s rate is not a finite rate above zero`);\n if (policy.burst === undefined) missing(\"the size of its bucket (policy.burst)\");\n else if (!safely(isCount, policy.burst)) problems.push(`${owner}'s burst is not a count`);\n else if (!wholeCount(policy.burst)) problems.push(`${owner}'s burst is not a whole count above zero`);\n } else if (policy.type === \"sliding-window\") {\n if (policy.limit === undefined) missing(\"the limit of its window (policy.limit)\");\n else if (!safely(isCount, policy.limit)) problems.push(`${owner}'s limit is not a count`);\n else if (!wholeCount(policy.limit)) problems.push(`${owner}'s limit is not a whole count above zero`);\n if (policy.window === undefined) missing(\"the length of its window (policy.window)\");\n else if (!safely(isTime, policy.window)) problems.push(`${owner}'s window is not a time`);\n else if (!finiteAbove(policy.window)) problems.push(`${owner}'s window is not a finite time above zero`);\n } else problems.push(`${owner}'s policy ${String(policy.type)} is not \"token-bucket\" or \"sliding-window\"`);\n const store = spec.store as { kind?: string; dependency?: unknown; onStoreFailure?: unknown } | undefined;\n if (store === undefined) missing(`its store, { kind: \"local\" } or { kind: \"shared\", dependency, onStoreFailure } (store)`);\n else if (store.kind === \"shared\") {\n if (typeof store.dependency !== \"string\" || store.dependency.trim().length === 0)\n problems.push(`${owner}'s shared store names no dependency`);\n if (store.onStoreFailure === undefined) missing(`what a failure of its shared store does, \"open\" or \"closed\" (store.onStoreFailure)`);\n else if (store.onStoreFailure !== \"open\" && store.onStoreFailure !== \"closed\")\n problems.push(`${owner}'s onStoreFailure ${String(store.onStoreFailure)} is not \"open\" or \"closed\"`);\n } else if (store.kind !== \"local\") problems.push(`${owner}'s store ${String(store.kind)} is not \"local\" or \"shared\"`);\n const evict = spec.evict as Partial<LimiterEviction> | undefined;\n if (evict === undefined || evict.maxKeys === undefined) missing(\"the most keys that it holds (evict.maxKeys)\");\n else if (!safely(isCount, evict.maxKeys)) problems.push(`${owner}'s maxKeys is not a count`);\n else if (!wholeCount(evict.maxKeys)) problems.push(`${owner}'s maxKeys is not a whole count above zero: the count of keys has a bound`);\n return problems;\n};\n\n/** This function gives an amount in milliseconds, exactly where the units permit, as one number. */\nexport const milliseconds = (amount: Quantity): number => r.toNumber(convertExact(r.fromNumber(amount.value), amount.unit, \"ms\"));\n/** This function gives a count as one number. */\nexport const countOf = (amount: Quantity): number => r.toNumber(convertExact(r.fromNumber(amount.value), amount.unit, \"count\"));\n\n/**\n * This function gives the rule of a policy in numbers. The interval of a bucket is exact as a\n * rational, and it becomes one number only at the end. Thus 10 for each minute gives 6000 ms.\n */\nexport const limitRule = (policy: LimitPolicy): LimitRule => {\n if (policy.type === \"token-bucket\") {\n const perMs = convertExact(r.fromNumber(policy.rate.value), policy.rate.unit, \"count/ms\");\n return { type: \"token-bucket\", interval: r.toNumber(r.div(r.ONE, perMs)), burst: countOf(policy.burst) };\n }\n return { type: \"sliding-window\", limit: countOf(policy.limit), window: milliseconds(policy.window) };\n};\n\n/** This function gives a time in milliseconds as a quantity. */\nconst ms = (value: number): Quantity => ({ value, unit: \"ms\" });\n\n/**\n * This function gives the span after which an idle key is equal to a new key. That span is\n * `burst / rate` for a token bucket, and one window for a sliding window. A store can remove the key\n * after it, and no decision changes. It is also the longest `retryAfter` of a new key that the store\n * refuses at its cap.\n */\nexport const idleSpan = (policy: LimitPolicy): Quantity => {\n const rule = limitRule(policy);\n return ms(rule.type === \"token-bucket\" ? rule.interval * rule.burst : rule.window);\n};\n\n/**\n * This function gives the longest `retryAfter` of a refusal by the policy: one interval of the\n * bucket (`1 / rate`), or one window. A refusal at the cap of keys can be longer, up to `idleSpan`.\n */\nexport const longestRetryAfter = (policy: LimitPolicy): Quantity => {\n const rule = limitRule(policy);\n return ms(rule.type === \"token-bucket\" ? rule.interval : rule.window);\n};\n\n/**\n * This function gives a `retryAfter` in whole seconds, rounded up, as the header `Retry-After`\n * (RFC 9110) has it. A time over a whole second by less than one nanosecond rounds down to it,\n * because that part is an error of floating point.\n */\nexport const retryAfterSeconds = (retryAfter: Quantity): number => {\n const seconds = r.toNumber(convertExact(r.fromNumber(retryAfter.value), retryAfter.unit, \"s\"));\n return Math.max(0, Math.ceil(seconds - TOLERANCE / 1000));\n};\n\n/** This function gives the time at which a key state is equal to the state of a new key, in milliseconds. */\nexport const freeAt = (rule: LimitRule, state: KeyState): number => {\n if (state.type === \"token-bucket\") return state.full;\n const last = state.stamps[state.stamps.length - 1];\n return last === undefined ? Number.NEGATIVE_INFINITY : last + (rule.type === \"sliding-window\" ? rule.window : 0);\n};\n\n/** This function gives the capacity of a rule: the most units of one take. That is the `burst` of a bucket, or the `limit` of a window. */\nexport const capacityOf = (rule: LimitRule): number => (rule.type === \"token-bucket\" ? rule.burst : rule.limit);\n\n/**\n * This function gives the units of a take: 1 when they are absent. It throws for units that are not\n * a whole number of 1 or more, because such a take has no meaning.\n */\nexport const unitsOf = (units: number | undefined): number => {\n if (units === undefined) return 1;\n if (typeof units !== \"number\" || !Number.isSafeInteger(units) || units < 1)\n throw new RangeError(`the units of a take are a whole number of 1 or more, not ${String(units)}`);\n return units;\n};\n\n/** This function gives the capacity refusal of a take whose units are over the capacity of its rule, or `undefined`. */\nexport const overCapacity = (rule: LimitRule, units: number): CapacityRefused | undefined => {\n const capacity = capacityOf(rule);\n return units > capacity ? { allowed: false, cause: \"capacity\", units, capacity } : undefined;\n};\n\n/**\n * This function decides one take of `units` units (1 when absent) of a key at the time `now`, in\n * milliseconds, from the state of the key (`undefined` for a new key). It is the one decision of each\n * store in this process. A store in another process does the same arithmetic in its own atomic step.\n * - A take over the capacity of the rule (`capacityOf`) is refused with the cause `capacity`, and\n * the state does not change.\n * - A token bucket (GCRA): the store lets the take in when, with the take, the bucket is full\n * again in at most `burst` intervals. A refusal waits until `units` tokens are back.\n * - A sliding window: the store lets the take in when at most `limit - units` takes are in the\n * window. A refusal waits until enough of the oldest takes leave the window.\n * - A take of `units` units is the same as `units` takes of 1 at one time, when all of them are let in.\n */\nexport const decide = (rule: LimitRule, state: KeyState | undefined, now: number, units?: number): TakeStep => {\n const n = unitsOf(units);\n const over = overCapacity(rule, n);\n if (rule.type === \"token-bucket\") {\n const span = rule.interval * rule.burst;\n const full = state?.type === \"token-bucket\" ? Math.max(state.full, now) : now;\n if (over !== undefined) return { decision: over, state: { type: \"token-bucket\", full } };\n const next = full + rule.interval * n;\n if (next - now > span + TOLERANCE)\n return { decision: { allowed: false, retryAfter: ms(next - span - now), cause: \"limit\" }, state: { type: \"token-bucket\", full } };\n const remaining = Math.max(0, Math.floor((span - (next - now)) / rule.interval + TOLERANCE));\n return { decision: { allowed: true, remaining }, state: { type: \"token-bucket\", full: next } };\n }\n const held = state?.type === \"sliding-window\" ? state.stamps : [];\n // a take counts for one window from its time: it leaves the window at stamp + window\n const live = held.filter((stamp) => stamp + rule.window > now + TOLERANCE);\n if (over !== undefined) return { decision: over, state: { type: \"sliding-window\", stamps: live } };\n // the take fits when the oldest (live + n - limit) takes have left the window\n const excess = live.length + n - rule.limit;\n if (excess > 0)\n return { decision: { allowed: false, retryAfter: ms(live[excess - 1]! + rule.window - now), cause: \"limit\" }, state: { type: \"sliding-window\", stamps: live } };\n return {\n decision: { allowed: true, remaining: rule.limit - live.length - n },\n state: { type: \"sliding-window\", stamps: [...live, ...Array.from({ length: n }, () => now)] },\n };\n};\n"],"mappings":";;;;;;AA8KA,MAAM,YAAY;;AAGlB,MAAa,WAAW,WAA0C,WAAW,KAAA,KAAa,YAAY,OAAO,MAAM,OAAO;AAC1H,MAAa,UAAU,WAA0C,WAAW,KAAA,KAAa,YAAY,OAAO,MAAM,GAAG;AACrH,MAAM,UAAU,WAA0C,WAAW,KAAA,KAAa,YAAY,OAAO,MAAM,SAAS;;AAEpH,MAAa,UAAU,MAAiD,WAA0C;CAChH,IAAI;EACF,OAAO,KAAK,MAAM;CACpB,QAAQ;EACN,OAAO;CACT;AACF;AACA,MAAa,eAAe,WAA8B,OAAO,OAAO,UAAU,YAAY,OAAO,SAAS,OAAO,KAAK,KAAK,OAAO,QAAQ;AAC9I,MAAa,cAAc,WAA8B,YAAY,MAAM,KAAK,OAAO,UAAUA,UAAE,SAAS,aAAaA,UAAE,WAAW,OAAO,KAAK,GAAG,OAAO,MAAM,OAAO,CAAC,CAAC;;;;;AAe3K,MAAa,mBAAmB,MAAc,SAAqD;CACjG,MAAM,QAAQ,WAAW;CACzB,IAAI,SAAS,KAAA,KAAc,SAAqB,MAAM,OAAO,CAAC,GAAG,MAAM,wCAAwC;CAC/G,MAAM,WAAqB,CAAC;CAC5B,MAAM,WAAW,SAAuB;EACtC,SAAS,KAAK,GAAG,MAAM,oBAAoB,KAAK,4BAA4B;CAC9E;CACA,IAAI,OAAO,KAAK,QAAQ,UAAU,QAAQ,uBAAuB;MAC5D,IAAI,KAAK,IAAI,KAAK,CAAC,CAAC,WAAW,GAAG,SAAS,KAAK,GAAG,MAAM,cAAc;CAC5E,MAAM,SAAS,KAAK;CACpB,IAAI,WAAW,KAAA,GAAW,QAAQ,qBAAqB;MAClD,IAAI,OAAO,SAAS,gBAAgB;EACvC,IAAI,OAAO,SAAS,KAAA,GAAW,QAAQ,sCAAsC;OACxE,IAAI,CAAC,OAAO,QAAQ,OAAO,IAAI,GAAG,SAAS,KAAK,GAAG,MAAM,kEAAkE;OAC3H,IAAI,CAAC,YAAY,OAAO,IAAI,GAAG,SAAS,KAAK,GAAG,MAAM,wCAAwC;EACnG,IAAI,OAAO,UAAU,KAAA,GAAW,QAAQ,uCAAuC;OAC1E,IAAI,CAAC,OAAO,SAAS,OAAO,KAAK,GAAG,SAAS,KAAK,GAAG,MAAM,wBAAwB;OACnF,IAAI,CAAC,WAAW,OAAO,KAAK,GAAG,SAAS,KAAK,GAAG,MAAM,yCAAyC;CACtG,OAAO,IAAI,OAAO,SAAS,kBAAkB;EAC3C,IAAI,OAAO,UAAU,KAAA,GAAW,QAAQ,wCAAwC;OAC3E,IAAI,CAAC,OAAO,SAAS,OAAO,KAAK,GAAG,SAAS,KAAK,GAAG,MAAM,wBAAwB;OACnF,IAAI,CAAC,WAAW,OAAO,KAAK,GAAG,SAAS,KAAK,GAAG,MAAM,yCAAyC;EACpG,IAAI,OAAO,WAAW,KAAA,GAAW,QAAQ,0CAA0C;OAC9E,IAAI,CAAC,OAAO,QAAQ,OAAO,MAAM,GAAG,SAAS,KAAK,GAAG,MAAM,wBAAwB;OACnF,IAAI,CAAC,YAAY,OAAO,MAAM,GAAG,SAAS,KAAK,GAAG,MAAM,0CAA0C;CACzG,OAAO,SAAS,KAAK,GAAG,MAAM,YAAY,OAAO,OAAO,IAAI,EAAE,2CAA2C;CACzG,MAAM,QAAQ,KAAK;CACnB,IAAI,UAAU,KAAA,GAAW,QAAQ,wFAAwF;MACpH,IAAI,MAAM,SAAS,UAAU;EAChC,IAAI,OAAO,MAAM,eAAe,YAAY,MAAM,WAAW,KAAK,CAAC,CAAC,WAAW,GAC7E,SAAS,KAAK,GAAG,MAAM,oCAAoC;EAC7D,IAAI,MAAM,mBAAmB,KAAA,GAAW,QAAQ,oFAAoF;OAC/H,IAAI,MAAM,mBAAmB,UAAU,MAAM,mBAAmB,UACnE,SAAS,KAAK,GAAG,MAAM,oBAAoB,OAAO,MAAM,cAAc,EAAE,2BAA2B;CACvG,OAAO,IAAI,MAAM,SAAS,SAAS,SAAS,KAAK,GAAG,MAAM,WAAW,OAAO,MAAM,IAAI,EAAE,4BAA4B;CACpH,MAAM,QAAQ,KAAK;CACnB,IAAI,UAAU,KAAA,KAAa,MAAM,YAAY,KAAA,GAAW,QAAQ,6CAA6C;MACxG,IAAI,CAAC,OAAO,SAAS,MAAM,OAAO,GAAG,SAAS,KAAK,GAAG,MAAM,0BAA0B;MACtF,IAAI,CAAC,WAAW,MAAM,OAAO,GAAG,SAAS,KAAK,GAAG,MAAM,0EAA0E;CACtI,OAAO;AACT;;AAGA,MAAa,gBAAgB,WAA6BA,UAAE,SAAS,aAAaA,UAAE,WAAW,OAAO,KAAK,GAAG,OAAO,MAAM,IAAI,CAAC;;AAEhI,MAAa,WAAW,WAA6BA,UAAE,SAAS,aAAaA,UAAE,WAAW,OAAO,KAAK,GAAG,OAAO,MAAM,OAAO,CAAC;;;;;AAM9H,MAAa,aAAa,WAAmC;CAC3D,IAAI,OAAO,SAAS,gBAAgB;EAClC,MAAM,QAAQ,aAAaA,UAAE,WAAW,OAAO,KAAK,KAAK,GAAG,OAAO,KAAK,MAAM,UAAU;EACxF,OAAO;GAAE,MAAM;GAAgB,UAAUA,UAAE,SAASA,UAAE,IAAIA,UAAE,KAAK,KAAK,CAAC;GAAG,OAAO,QAAQ,OAAO,KAAK;EAAE;CACzG;CACA,OAAO;EAAE,MAAM;EAAkB,OAAO,QAAQ,OAAO,KAAK;EAAG,QAAQ,aAAa,OAAO,MAAM;CAAE;AACrG;;AAGA,MAAM,MAAM,WAA6B;CAAE;CAAO,MAAM;AAAK;;;;;;;AAQ7D,MAAa,YAAY,WAAkC;CACzD,MAAM,OAAO,UAAU,MAAM;CAC7B,OAAO,GAAG,KAAK,SAAS,iBAAiB,KAAK,WAAW,KAAK,QAAQ,KAAK,MAAM;AACnF;;;;;AAMA,MAAa,qBAAqB,WAAkC;CAClE,MAAM,OAAO,UAAU,MAAM;CAC7B,OAAO,GAAG,KAAK,SAAS,iBAAiB,KAAK,WAAW,KAAK,MAAM;AACtE;;;;;;AAOA,MAAa,qBAAqB,eAAiC;CACjE,MAAM,UAAUA,UAAE,SAAS,aAAaA,UAAE,WAAW,WAAW,KAAK,GAAG,WAAW,MAAM,GAAG,CAAC;CAC7F,OAAO,KAAK,IAAI,GAAG,KAAK,KAAK,UAAU,YAAY,GAAI,CAAC;AAC1D;;AAGA,MAAa,UAAU,MAAiB,UAA4B;CAClE,IAAI,MAAM,SAAS,gBAAgB,OAAO,MAAM;CAChD,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO,SAAS;CAChD,OAAO,SAAS,KAAA,IAAY,OAAO,oBAAoB,QAAQ,KAAK,SAAS,mBAAmB,KAAK,SAAS;AAChH;;AAGA,MAAa,cAAc,SAA6B,KAAK,SAAS,iBAAiB,KAAK,QAAQ,KAAK;;;;;AAMzG,MAAa,WAAW,UAAsC;CAC5D,IAAI,UAAU,KAAA,GAAW,OAAO;CAChC,IAAI,OAAO,UAAU,YAAY,CAAC,OAAO,cAAc,KAAK,KAAK,QAAQ,GACvE,MAAM,IAAI,WAAW,4DAA4D,OAAO,KAAK,GAAG;CAClG,OAAO;AACT;;AAGA,MAAa,gBAAgB,MAAiB,UAA+C;CAC3F,MAAM,WAAW,WAAW,IAAI;CAChC,OAAO,QAAQ,WAAW;EAAE,SAAS;EAAO,OAAO;EAAY;EAAO;CAAS,IAAI,KAAA;AACrF;;;;;;;;;;;;;AAcA,MAAa,UAAU,MAAiB,OAA6B,KAAa,UAA6B;CAC7G,MAAM,IAAI,QAAQ,KAAK;CACvB,MAAM,OAAO,aAAa,MAAM,CAAC;CACjC,IAAI,KAAK,SAAS,gBAAgB;EAChC,MAAM,OAAO,KAAK,WAAW,KAAK;EAClC,MAAM,OAAO,OAAO,SAAS,iBAAiB,KAAK,IAAI,MAAM,MAAM,GAAG,IAAI;EAC1E,IAAI,SAAS,KAAA,GAAW,OAAO;GAAE,UAAU;GAAM,OAAO;IAAE,MAAM;IAAgB;GAAK;EAAE;EACvF,MAAM,OAAO,OAAO,KAAK,WAAW;EACpC,IAAI,OAAO,MAAM,OAAO,WACtB,OAAO;GAAE,UAAU;IAAE,SAAS;IAAO,YAAY,GAAG,OAAO,OAAO,GAAG;IAAG,OAAO;GAAQ;GAAG,OAAO;IAAE,MAAM;IAAgB;GAAK;EAAE;EAElI,OAAO;GAAE,UAAU;IAAE,SAAS;IAAM,WADlB,KAAK,IAAI,GAAG,KAAK,OAAO,QAAQ,OAAO,QAAQ,KAAK,WAAW,SAAS,CAC9C;GAAE;GAAG,OAAO;IAAE,MAAM;IAAgB,MAAM;GAAK;EAAE;CAC/F;CAGA,MAAM,QAFO,OAAO,SAAS,mBAAmB,MAAM,SAAS,CAAC,EAAA,CAE9C,QAAQ,UAAU,QAAQ,KAAK,SAAS,MAAM,SAAS;CACzE,IAAI,SAAS,KAAA,GAAW,OAAO;EAAE,UAAU;EAAM,OAAO;GAAE,MAAM;GAAkB,QAAQ;EAAK;CAAE;CAEjG,MAAM,SAAS,KAAK,SAAS,IAAI,KAAK;CACtC,IAAI,SAAS,GACX,OAAO;EAAE,UAAU;GAAE,SAAS;GAAO,YAAY,GAAG,KAAK,SAAS,KAAM,KAAK,SAAS,GAAG;GAAG,OAAO;EAAQ;EAAG,OAAO;GAAE,MAAM;GAAkB,QAAQ;EAAK;CAAE;CAChK,OAAO;EACL,UAAU;GAAE,SAAS;GAAM,WAAW,KAAK,QAAQ,KAAK,SAAS;EAAE;EACnE,OAAO;GAAE,MAAM;GAAkB,QAAQ,CAAC,GAAG,MAAM,GAAG,MAAM,KAAK,EAAE,QAAQ,EAAE,SAAS,GAAG,CAAC;EAAE;CAC9F;AACF"}
package/build/redis.js CHANGED
@@ -3,7 +3,7 @@ import { backoffDelay } from "./backoff.js";
3
3
  import { realClock } from "./clock.js";
4
4
  import { heartbeat } from "./heartbeat.js";
5
5
  import { i as heartbeatDetection } from "./timing-DZl36uXs.js";
6
- import { c as overCapacity, u as unitsOf } from "./policy-B23MY52l.js";
6
+ import { g as unitsOf, p as overCapacity } from "./policy-UYALkqVq.js";
7
7
  // src/redis/connection.ts
8
8
  /**
9
9
  * This factory makes an ioredis client. It loads ioredis only when a client connects, thus a
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.8.14",
4
+ "version": "0.8.15",
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",
@@ -113,7 +113,7 @@
113
113
  "node": ">=22.19"
114
114
  },
115
115
  "dependencies": {
116
- "@mark1russell7/algebra": "^0.8.8",
116
+ "@mark1russell7/algebra": "^0.8.9",
117
117
  "@mark1russell7/collections": "^0.11.0",
118
118
  "@mark1russell7/quantity": "^0.4.0",
119
119
  "@mark1russell7/rigor-generators": "^0.1.0",