@mark1russell7/service 0.6.7 → 0.7.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +10 -6
- package/build/{builder-bXJqMe2p.d.ts → builder-DPsy9XVN.d.ts} +4 -4
- package/build/{core-B1zbS4WY.d.ts → core-BkdE4pz1.d.ts} +4 -4
- package/build/{dial-CSGKVlZe.d.ts → dial-CyVazFF-.d.ts} +2 -2
- package/build/grpc.d.ts +3 -3
- package/build/host.d.ts +5 -3
- package/build/host.js +13 -3
- package/build/host.js.map +1 -1
- package/build/http-client.d.ts +3 -3
- package/build/http.d.ts +8 -6
- package/build/http.js +19 -5
- package/build/http.js.map +1 -1
- package/build/index.d.ts +8 -8
- package/build/index.js +3 -3
- package/build/{lifecycle-Ks9Yd5CM.d.ts → lifecycle-BuFfbY3s.d.ts} +2 -2
- package/build/{limiter-CmC4vCjk.js → limiter-BTgM4aXZ.js} +19 -8
- package/build/limiter-BTgM4aXZ.js.map +1 -0
- package/build/{limiter-BoZkXIxk.d.ts → limiter-CkJ_QVFj.d.ts} +3 -3
- package/build/limiter.d.ts +4 -4
- package/build/limiter.js +3 -3
- package/build/{logger-DhFgh48y.d.ts → logger-BY1RFLzq.d.ts} +2 -2
- package/build/mongodb.d.ts +3 -3
- package/build/pg.d.ts +2 -2
- package/build/{policy-G4QJ1ZZq.d.ts → policy-CwYR95Sz.d.ts} +51 -15
- package/build/{policy-CgS4y94U.js → policy-G-Y3Meku.js} +55 -14
- package/build/policy-G-Y3Meku.js.map +1 -0
- package/build/{ports-CZLzYK5d.d.ts → ports-D1U2EHmR.d.ts} +2 -2
- package/build/{queue-BjiGodqh.d.ts → queue-CDYBywuU.d.ts} +3 -3
- package/build/rabbitmq.d.ts +4 -4
- package/build/redis.d.ts +9 -6
- package/build/redis.js +17 -8
- package/build/redis.js.map +1 -1
- package/build/{store-Cwuepb-z.d.ts → store-KWQVA3mp.d.ts} +23 -12
- package/build/testing.d.ts +4 -4
- package/build/websocket.d.ts +3 -3
- package/package.json +1 -1
- package/build/limiter-CmC4vCjk.js.map +0 -1
- package/build/policy-CgS4y94U.js.map +0 -1
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"policy-CgS4y94U.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 refusal cause tells why a take is refused:\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 RefusalCause = \"limit\" | \"cap\" | \"store\";\n\n/** A permitted take used one unit of its key. `remaining` is the count of takes that the key can make at this time. */\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 refused take 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 Refused {\n readonly allowed: false;\n readonly retryAfter: Quantity;\n readonly cause: RefusalCause;\n /** This text is the failure of a shared store, for the cause `store`. */\n readonly failure?: string | undefined;\n}\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\nconst isCount = (amount: Quantity | undefined): boolean => amount !== undefined && convertible(amount.unit, \"count\");\nconst 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. */\nconst safely = (test: (amount: Quantity | undefined) => boolean, amount: Quantity | undefined): boolean => {\n try {\n return test(amount);\n } catch {\n return false;\n }\n};\nconst finiteAbove = (amount: Quantity): boolean => typeof amount.value === \"number\" && Number.isFinite(amount.value) && amount.value > 0;\nconst 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. */\nconst milliseconds = (amount: Quantity): number => r.toNumber(convertExact(r.fromNumber(amount.value), amount.unit, \"ms\"));\n/** This function gives a count as one number. */\nconst 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/**\n * This function decides one take of a key at the time `now`, in milliseconds, from the state of the\n * key (`undefined` for a new key). It is the one decision of each store in this process. A store in\n * another process does the same arithmetic in its own atomic step.\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 one token is back.\n * - A sliding window: the store lets the take in when fewer than `limit` takes are in the window.\n * A refusal waits until the oldest take leaves the window.\n */\nexport const decide = (rule: LimitRule, state: KeyState | undefined, now: number): TakeStep => {\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 const next = full + rule.interval;\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 (live.length >= rule.limit)\n return { decision: { allowed: false, retryAfter: ms(live[0]! + rule.window - now), cause: \"limit\" }, state: { type: \"sliding-window\", stamps: live } };\n return { decision: { allowed: true, remaining: rule.limit - live.length - 1 }, state: { type: \"sliding-window\", stamps: [...live, now] } };\n};\n"],"mappings":";;;;;;AAmJA,MAAM,YAAY;AAElB,MAAM,WAAW,WAA0C,WAAW,KAAA,KAAa,YAAY,OAAO,MAAM,OAAO;AACnH,MAAM,UAAU,WAA0C,WAAW,KAAA,KAAa,YAAY,OAAO,MAAM,GAAG;AAC9G,MAAM,UAAU,WAA0C,WAAW,KAAA,KAAa,YAAY,OAAO,MAAM,SAAS;;AAEpH,MAAM,UAAU,MAAiD,WAA0C;CACzG,IAAI;EACF,OAAO,KAAK,MAAM;CACpB,QAAQ;EACN,OAAO;CACT;AACF;AACA,MAAM,eAAe,WAA8B,OAAO,OAAO,UAAU,YAAY,OAAO,SAAS,OAAO,KAAK,KAAK,OAAO,QAAQ;AACvI,MAAM,cAAc,WAA8B,YAAY,MAAM,KAAK,OAAO,UAAUA,UAAE,SAAS,aAAaA,UAAE,WAAW,OAAO,KAAK,GAAG,OAAO,MAAM,OAAO,CAAC,CAAC;;;;;AAepK,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,MAAM,gBAAgB,WAA6BA,UAAE,SAAS,aAAaA,UAAE,WAAW,OAAO,KAAK,GAAG,OAAO,MAAM,IAAI,CAAC;;AAEzH,MAAM,WAAW,WAA6BA,UAAE,SAAS,aAAaA,UAAE,WAAW,OAAO,KAAK,GAAG,OAAO,MAAM,OAAO,CAAC;;;;;AAMvH,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;;;;;;;;;;AAWA,MAAa,UAAU,MAAiB,OAA6B,QAA0B;CAC7F,IAAI,KAAK,SAAS,gBAAgB;EAChC,MAAM,OAAO,KAAK,WAAW,KAAK;EAClC,MAAM,OAAO,OAAO,SAAS,iBAAiB,KAAK,IAAI,MAAM,MAAM,GAAG,IAAI;EAC1E,MAAM,OAAO,OAAO,KAAK;EACzB,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,KAAK,UAAU,KAAK,OACtB,OAAO;EAAE,UAAU;GAAE,SAAS;GAAO,YAAY,GAAG,KAAK,KAAM,KAAK,SAAS,GAAG;GAAG,OAAO;EAAQ;EAAG,OAAO;GAAE,MAAM;GAAkB,QAAQ;EAAK;CAAE;CACvJ,OAAO;EAAE,UAAU;GAAE,SAAS;GAAM,WAAW,KAAK,QAAQ,KAAK,SAAS;EAAE;EAAG,OAAO;GAAE,MAAM;GAAkB,QAAQ,CAAC,GAAG,MAAM,GAAG;EAAE;CAAE;AAC3I"}
|