effect-dynamodb 1.36.0 → 1.37.0

package/dist/internal/RangePlanner.d.ts

@@ -0,0 +1,394 @@
+/**
+ * @internal RangePlanner — the pure half of a planned query (#171, design §9).
+ *
+ * A planner never sends a request. It turns a plan and each response into the
+ * next *step* — a `Read` of one key range, a `Probe` that locates where to read
+ * next, or `Done` — and the terminal's loop (`Query.ts`) sends every request,
+ * so every request counts against `maxPages`, is observed by `onRequest` and
+ * is never sent once the call is about to return.
+ *
+ * Plans over a composite sort key (§7):
+ *
+ * - `key` — the bounds reach the key condition directly: one range.
+ * - `skip-scan` — composites left of the first bound have no bound (the
+ *   *skip tuple*): a probe (`Limit: 1`) finds each distinct tuple `T`, then
+ *   `T`'s own range is read, then a probe from just past `T`, and so on.
+ * - `filter` — one range over everything under the pinned prefix, every bound
+ *   checked per row: when skip-scan is not sound (§7.3), after the probe budget
+ *   is spent (§7.4) or at a key the tuple parse can't read.
+ *
+ * Plans over a Z-order sort key (§5): inside each prefix tuple, `naive` reads
+ * the box's hull, `jump` follows the last examined key to the next in-box
+ * address, `precise` reads a capped range plan; a missing prefix composite is
+ * walked by a binary skip-scan (§7.5).
+ *
+ * Positions are what a cursor records (§10): what has been **completed**, never
+ * a range to trust. Resume recomputes the plan and places the position in it.
+ */
+import type { AttributeValue } from "@aws-sdk/client-dynamodb";
+import { ValidationError } from "@effect-dynamodb/schema/Errors.js";
+import { type AddressRange, type Box, type Layout } from "@effect-dynamodb/schema/internal/ZOrderCurve.js";
+import type { KeyCondition, KeyValue, PlanMode, QueryExplain, ZOrderOptions } from "../Query.js";
+import * as Cursor from "./Cursor.js";
+import { type Expr } from "./Expr.js";
+/** A key range, both ends inclusive; `undefined` is open. */
+export interface KeyRange {
+    readonly lower: KeyValue | undefined;
+    readonly upper: KeyValue | undefined;
+    /** Sent instead of the bounds: a whole, unclipped subtree. */
+    readonly beginsWith?: KeyValue | undefined;
+    /** `false`: rows inside the range may still fall outside the bounds (a row check runs). */
+    readonly exact: boolean;
+}
+/** What is done inside a position's tuple (or the whole plan without one). */
+export type Boundary = 
+/** Nothing delivered yet. */
+{
+    readonly _tag: "Start";
+}
+/** Every in-plan row up to `through` (in scan direction) is done. */
+ | {
+    readonly _tag: "Through";
+    readonly through: KeyValue;
+}
+/** Inside a range, after this key. */
+ | {
+    readonly _tag: "At";
+    readonly startKey: Record<string, AttributeValue>;
+}
+/** The whole tuple is finished. */
+ | {
+    readonly _tag: "TupleDone";
+};
+export interface Position {
+    readonly mode: PlanMode;
+    /** The skip tuple `T` (`undefined`: none). */
+    readonly tuple: KeyValue | undefined;
+    readonly boundary: Boundary;
+    /** Probes sent by this terminal call (§7.4). Never in a cursor: a resumed query starts afresh. */
+    readonly skips: number;
+    /** The key pass of a {@link keyPassesPlanner} plan: `1` the 1.36 key, `0` the current one. */
+    readonly pass?: 0 | 1 | undefined;
+}
+/** How a read's `Limit` is sized: the pass-rate estimator (§8), or a jump run (§8.5, Z-order). */
+export type Sizing = {
+    readonly _tag: "estimator";
+} | {
+    readonly _tag: "jump";
+    readonly run: number;
+};
+export interface ReadStep {
+    readonly _tag: "Read";
+    /** What a cursor taken before this read's next request records. */
+    readonly at: Position;
+    readonly range: KeyRange;
+    /** The partition this read is sent to, when not the query's own (a 1.36 key pass, #171). */
+    readonly pkValue?: string | undefined;
+    readonly startKey: Record<string, AttributeValue> | undefined;
+    /** The range's index in a precomputed plan (Z-order precise plans); `undefined` otherwise. */
+    readonly planIndex: number | undefined;
+    readonly sizing: Sizing;
+    /** Bounds this read's key condition can't express (§11). */
+    readonly rowCheck: RowCheck | undefined;
+}
+export interface ProbeStep {
+    readonly _tag: "Probe";
+    readonly at: Position;
+    readonly lower: KeyValue | undefined;
+    readonly upper: KeyValue | undefined;
+}
+export interface DoneStep {
+    readonly _tag: "Done";
+}
+export type Step = ReadStep | ProbeStep | DoneStep;
+/**
+ * A library-owned raw-row predicate (§11), evaluated before decode beside the
+ * history-row exclusion. Its attributes are borrowed into an active projection
+ * and stripped again afterwards.
+ */
+export interface RowCheck {
+    /** The fields it checks (`explain().rowChecks`). */
+    readonly fields: ReadonlyArray<string>;
+    /** The stored attributes it reads. */
+    readonly reads: ReadonlyArray<string>;
+    readonly accepts: (row: Record<string, AttributeValue>) => boolean;
+}
+/** What the query around a planner decides: resolved when a terminal runs. */
+export interface PlanContext {
+    readonly reverse: boolean;
+    readonly maxSkips: number;
+    /** `.zorder()` options (Z-order plans only). */
+    readonly zorder?: ZOrderOptions | undefined;
+}
+export interface RangePlanner {
+    readonly fingerprint: string;
+    /** The plan a fresh query starts in. */
+    readonly mode: PlanMode;
+    /** ANDed into every read's `FilterExpression` (Z-order dimension bounds; none for composites). */
+    readonly filter: Expr | undefined;
+    /** The row check of the reads a fresh query starts with. */
+    readonly rowCheck: RowCheck | undefined;
+    /** The first step; `[EDD-9094]` for a cursor that doesn't belong to this plan. */
+    readonly start: (cursor: Cursor.CursorV2 | undefined) => Step | ValidationError;
+    readonly afterRead: (step: ReadStep, lastEvaluatedKey: Record<string, AttributeValue> | undefined) => Step;
+    readonly afterProbe: (step: ProbeStep, key: KeyValue | undefined) => Step;
+    /** The precise ranges following `step` in the same tuple, for a window (§9.2). */
+    readonly following: (step: ReadStep, n: number) => ReadonlyArray<ReadStep>;
+    /** The cursor resuming at `step` (`null` only for `Done`). */
+    readonly cursor: (step: Step) => Cursor.CursorV2 | null;
+    readonly explain: (sizing: QueryExplain["sizing"]) => QueryExplain;
+}
+/** A planner, resolved from the final query state when a terminal runs. */
+export type PlannerFactory = (context: PlanContext) => RangePlanner;
+/** Default skip-scan probe budget per terminal call (§7.4). */
+export declare const DEFAULT_MAX_SKIPS = 32;
+/** Default range cap of a Z-order `precise` plan and of `auto`'s choice (§3.4). */
+export declare const DEFAULT_MAX_RANGES = 16;
+/** A jump run's first `Limit`, and what it resets to after a jump (§8.5). */
+export declare const JUMP_INITIAL = 16;
+/** The largest `Limit` a jump run grows to (§8.5). */
+export declare const JUMP_MAX_LIMIT = 1000;
+/**
+ * `SK_MAX_SENTINEL` (`DynamoClient.ts`): above every character key
+ * composition emits, so `prefix + MAX` bounds every key under `prefix`.
+ */
+export declare const KEY_MAX = "\uFFFF";
+/**
+ * Order two key values as DynamoDB does: by UTF-8 bytes. For text that is
+ * code point order, which JS string comparison (UTF-16 code units) is not
+ * above U+FFFF — so it is never used for keys.
+ */
+export declare const compareUtf8: (a: KeyValue, b: KeyValue) => number;
+/**
+ * The highest code point: above every character a key can hold but itself.
+ * Where the text after a prefix is a value's own (no label precedes it),
+ * `prefix + KEY_TOP` bounds every key under the prefix; {@link KEY_MAX} does
+ * not, since an emoji (UTF-8 `F0 …`) outsorts it.
+ */
+export declare const KEY_TOP: string;
+/**
+ * An inclusive high end for a strict `<` on key text: below `key`, and at or
+ * above every key below `key` that does not hold U+10FFFF. Its last code
+ * point is stepped down one (past the surrogates) and followed by U+10FFFF: a
+ * key below `key` either stops short of it — a prefix, which the bound keeps —
+ * or is smaller at some character, and from there sorts under the bound. A
+ * last code point of U+0000 has no predecessor; `key` without it is then the
+ * bound. (U+10FFFF rather than {@link KEY_MAX}, which an emoji outsorts.)
+ */
+export declare const keyJustBelow: (key: string) => string;
+/** Does `value` satisfy a sort key condition, as DynamoDB evaluates it? */
+export declare const keyConditionHolds: (condition: KeyCondition, value: KeyValue) => boolean;
+/**
+ * The key condition a read of `range` sends; `undefined` reads the whole
+ * partition. A zero-length operand is a defect: DynamoDB rejects it, and no
+ * plan should ever compose one.
+ */
+export declare const toKeyCondition: (range: KeyRange) => KeyCondition | undefined;
+/** Is `value` inside `range` (as its key condition selects)? */
+export declare const rangeContains: (range: KeyRange, value: KeyValue) => boolean;
+/** A key value as `explain` and `onRequest` show it: text as is, bytes as `0x…` hex. */
+export declare const displayKeyValue: (value: KeyValue) => string;
+/**
+ * The display bounds of a sort key condition: `eq` as `[v, v]`, `between` as
+ * `[a, b]`, one-sided operators open on the other side, `begins_with` as
+ * `[prefix, undefined]`, none as `[undefined, undefined]`.
+ */
+export declare const displayKeyCondition: (condition: KeyCondition | undefined) => readonly [lower: string | undefined, upper: string | undefined];
+/** JSON with every object's keys sorted, so equal inputs give equal text. */
+export declare const canonicalJson: (value: unknown) => string;
+/**
+ * An expression as `explain` shows it: its compiled text with every name and
+ * value placeholder replaced by what it stands for.
+ */
+export declare const displayExpr: (expr: Expr) => string;
+/** FNV-1a (32-bit) of `text`'s UTF-8 bytes, as 8 hex digits. */
+export declare const fnv1a32: (text: string) => string;
+/**
+ * `[EDD-9094]`: a cursor that doesn't belong to the query it was given to —
+ * malformed, from another query, or a position outside the recomputed plan.
+ * Raised by the terminal (cursors are decoded there), never by `startFrom`.
+ */
+export declare const cursorRefusal: (entityType: string, why: string) => ValidationError;
+/**
+ * `step` resumed after `startKey`: what a read that returned a
+ * `LastEvaluatedKey`, or stopped inside its page, continues with. A filter
+ * read's position drops its tuple — `ExclusiveStartKey` alone places it.
+ */
+export declare const readFrom: (step: ReadStep, startKey: Record<string, AttributeValue>) => ReadStep;
+/**
+ * The composites a skip-scan walks: none (a `key` plan), or a `string` tuple —
+ * the composites between the pinned prefix `P` and the first bounded
+ * composite, parsed from the key text (§7.2). A Z-order prefix is walked by {@link zorderPlanner}.
+ */
+export type TupleSpace = {
+    readonly _tag: "none";
+} | {
+    readonly _tag: "string";
+    /** `P`: the key text every tuple extends; ends with the delimiter. */
+    readonly prefix: string;
+    /** The tuple composites' labels (`<cased name>_`), in key order. */
+    readonly labels: ReadonlyArray<string>;
+    /** The label of the first composite after the tuple. */
+    readonly next: string;
+    /** The tuple composites' names (`explain`'s reason). */
+    readonly fields: ReadonlyArray<string>;
+};
+/**
+ * What is read inside each tuple (or the whole plan, without one): a single
+ * range per tuple. (Z-order range plans: {@link zorderPlanner}.)
+ */
+export type InnerPlan = {
+    readonly _tag: "single";
+    /** The range under tuple `T` (`undefined`: the `key` plan's one range). */
+    readonly conditionFor: (tuple: string | undefined) => KeyRange;
+    /** The bounds that range can't express: the same for every tuple. */
+    readonly rowCheck: RowCheck | undefined;
+    /** No value satisfies the bounds (`{ gt: 3, lte: 3 }`): the plan is `empty`, and reads nothing. */
+    readonly empty: boolean;
+};
+/** A composite sort key plan, as the accessor's `.within()` builds it. */
+export interface CompositePlanSpec {
+    readonly entityType: string;
+    /** The physical index, or `"primary"`. */
+    readonly index: string;
+    readonly pkField: string;
+    readonly pkValue: string;
+    readonly skField: string;
+    /** What must not change between calls: the pinned and composed bounds (§10.3). */
+    readonly fingerprint: unknown;
+    readonly space: TupleSpace;
+    readonly inner: InnerPlan;
+    /** The filter plan: one range under `P`, every bound in the row check (§7.4). */
+    readonly filterPlan: {
+        /** `P`: the filter range runs from `P` to `P + MAX`. */
+        readonly prefix: string;
+        readonly rowCheck: RowCheck | undefined;
+    };
+    /** Why skip-scan isn't sound for this tuple (§7.3); the plan is then `filter`. */
+    readonly ineligible: string | undefined;
+}
+/**
+ * A planner for a composite sort key plan. `start` places a cursor in the
+ * recomputed plan (§10.3): string ranges are kept or dropped whole, never cut.
+ */
+export declare const compositePlanner: (spec: CompositePlanSpec) => PlannerFactory;
+/** One key a query reads: a partition, and the sort key condition under it. */
+export interface KeyPass {
+    readonly pkValue: string;
+    /** `eq` or `beginsWith` — the pins — or none: the whole partition. */
+    readonly condition: KeyCondition | undefined;
+    /**
+     * The 1.36 key's only: where each row's values key it now, which sorts
+     * the rows of both passes by form. The current pass keeps a row stored at
+     * its key now — another value's 1.36 row can sit under the current key
+     * (`a%20b`'s 1.36 text is `a b`'s escaped text). The 1.36 pass keeps a row
+     * stored elsewhere whose key now the current pass selects — so not a row
+     * 1.36 keyed there for another value (`a` then `b` under pins on `a#b`).
+     * Without it, the current pass keeps every row and the 1.36 pass every
+     * row the current condition does not select.
+     */
+    readonly rows?: KeyPassRows | undefined;
+}
+/** {@link KeyPass.rows}: where a stored row's values key it now. */
+export interface KeyPassRows {
+    /** The stored attributes it reads. */
+    readonly reads: ReadonlyArray<string>;
+    /** The row's partition and sort key text now; `undefined` when its values compose none. */
+    readonly composed: (row: Record<string, AttributeValue>) => {
+        readonly pk: string;
+        readonly sk: string | undefined;
+    } | undefined;
+    /**
+     * The row's key text as 1.36 composed it. A row stored elsewhere than its key now
+     * is another value's only if it is stored at this: otherwise an index policy left
+     * its key, and it belongs where it is. Without it, every row stored elsewhere than
+     * its key now is another value's.
+     */
+    readonly composed136?: ((row: Record<string, AttributeValue>) => {
+        readonly pk: string;
+        readonly sk: string | undefined;
+    } | undefined) | undefined;
+    /**
+     * Read both passes when the two keys are one: rows of both forms share it
+     * (a time-series item's events, whose orderBy text changed) and the passes
+     * split them by form.
+     */
+    readonly split?: boolean | undefined;
+}
+/** A plan reading a query's own key and its 1.36 key, as `Query.alsoRead136` installs it. */
+export interface KeyPassesSpec {
+    readonly entityType: string;
+    /** The physical index, or `"primary"`. */
+    readonly index: string;
+    readonly pkField: string;
+    readonly skField: string | undefined;
+    /** The query's own key, as its terminal sends it. */
+    readonly current: KeyPass;
+    /** The key 1.36 composed for the same pins; its text differs from `current`'s. */
+    readonly legacy: KeyPass;
+}
+/**
+ * A planner reading a query's own key and the key 1.36 composed for the same
+ * pins, one after the other (#171): rows 1.36 wrote whose key text changed
+ * stay under the 1.36 key until they are written again or `rekey` moves
+ * them. Those are the older rows, so a forward read takes the 1.36 key first
+ * and `.reverse()` takes it last; each key is read in the query's direction.
+ * The plan is `key`. When both keys are in one partition, a read of the 1.36
+ * key drops the rows the current key selects too (a value whose 1.36 text
+ * prefixes its escaped text: `50%` of `50%25`), so no row is read twice.
+ *
+ * A position is the start of a pass or a key inside one; its cursor names the
+ * pass in `p`. A cursor without a fingerprint (a plain query's `{ k }`, from
+ * before the fallback had anything to read, or from 1.36) is placed by its
+ * key: in the 1.36 pass when the key lies under the 1.36 key and not the
+ * current one.
+ */
+export declare const keyPassesPlanner: (spec: KeyPassesSpec) => PlannerFactory;
+/** A prefix composite of a binary skip tuple (§7.5). */
+export interface BinarySegment {
+    readonly field: string;
+    /** Hash width in bytes; `undefined`: stored length-prefixed. */
+    readonly hash: number | undefined;
+    /** The encoded segment `.within()` gave it, if any. */
+    readonly given: Uint8Array | undefined;
+}
+/** A Z-order sort key plan, as the accessor's `.within()` builds it. */
+export interface ZOrderPlanSpec {
+    readonly entityType: string;
+    readonly index: string;
+    readonly pkField: string;
+    readonly pkValue: string;
+    readonly skField: string;
+    /** What must not change between calls: the prefix values, the box and the layout (§10.3). */
+    readonly fingerprint: unknown;
+    readonly layout: Layout;
+    /** The quantized box (§5.1); `"empty"` when nothing can match. */
+    readonly box: Box | "empty";
+    /** Whether any dimension is bounded: without one, each tuple is read whole. */
+    readonly bounded: boolean;
+    /** `P`: the given leading prefix segments (possibly none). */
+    readonly prefix: Uint8Array;
+    /** The skip tuple: the prefix segments from the first one not given through the last. */
+    readonly tuple: ReadonlyArray<BinarySegment>;
+    /** The exact dimension bounds DynamoDB can compare on the stored attributes (§11). */
+    readonly filter: Expr | undefined;
+    /** The bounds checked per row inside a tuple: dimensions no filter compares, hashed prefixes. */
+    readonly rowCheck: RowCheck | undefined;
+    /** The filter plan's row check: every given prefix composite as well (§7.4). */
+    readonly filterRowCheck: RowCheck | undefined;
+    /** The capped range plan of the box (§5.4), cached per accessor. */
+    readonly ranges: (maxRanges: number, refineFactor: number) => {
+        readonly ranges: ReadonlyArray<AddressRange>;
+        readonly exact: boolean;
+    };
+}
+/**
+ * A planner for a Z-order sort key plan. Inside each tuple `T` (the given
+ * prefix, or each one a binary skip-scan finds), a range `[lo, hi]` of
+ * addresses is read as `BETWEEN T‖lo AND T‖hi`; the strategy decides which
+ * ranges (§5.5). `start` places a cursor by clipping the recomputed plan at
+ * its address (§10.3), so a cursor resumes under any `maxRanges` or
+ * strategy.
+ */
+export declare const zorderPlanner: (spec: ZOrderPlanSpec) => PlannerFactory;
+//# sourceMappingURL=RangePlanner.d.ts.map

package/dist/internal/RangePlanner.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"RangePlanner.d.ts","sourceRoot":"","sources":["../../src/internal/RangePlanner.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAA;AAE9D,OAAO,EAAE,eAAe,EAAE,MAAM,mCAAmC,CAAA;AACnE,OAAO,EACL,KAAK,YAAY,EACjB,KAAK,GAAG,EAMR,KAAK,MAAM,EAOZ,MAAM,iDAAiD,CAAA;AACxD,OAAO,KAAK,EAAE,YAAY,EAAE,QAAQ,EAAE,QAAQ,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,aAAa,CAAA;AAChG,OAAO,KAAK,MAAM,MAAM,aAAa,CAAA;AACrC,OAAO,EAAe,KAAK,IAAI,EAAE,MAAM,WAAW,CAAA;AAMlD,6DAA6D;AAC7D,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,KAAK,EAAE,QAAQ,GAAG,SAAS,CAAA;IACpC,QAAQ,CAAC,KAAK,EAAE,QAAQ,GAAG,SAAS,CAAA;IACpC,8DAA8D;IAC9D,QAAQ,CAAC,UAAU,CAAC,EAAE,QAAQ,GAAG,SAAS,CAAA;IAC1C,2FAA2F;IAC3F,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAA;CACxB;AAED,8EAA8E;AAC9E,MAAM,MAAM,QAAQ;AAClB,6BAA6B;AAC3B;IAAE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;CAAE;AAC5B,qEAAqE;GACnE;IAAE,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IAAC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAA;CAAE;AAC1D,sCAAsC;GACpC;IAAE,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;IAAC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,CAAA;CAAE;AAC5E,mCAAmC;GACjC;IAAE,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAA;CAAE,CAAA;AAElC,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAA;IACvB,8CAA8C;IAC9C,QAAQ,CAAC,KAAK,EAAE,QAAQ,GAAG,SAAS,CAAA;IACpC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAA;IAC3B,kGAAkG;IAClG,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,8FAA8F;IAC9F,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAAA;CAClC;AAED,kGAAkG;AAClG,MAAM,MAAM,MAAM,GACd;IAAE,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAA;CAAE,GAC9B;IAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAA;CAAE,CAAA;AAEnD,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,mEAAmE;IACnE,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAA;IACrB,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAA;IACxB,4FAA4F;IAC5F,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACrC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,GAAG,SAAS,CAAA;IAC7D,8FAA8F;IAC9F,QAAQ,CAAC,SAAS,EAAE,MAAM,GAAG,SAAS,CAAA;IACtC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;IACvB,4DAA4D;IAC5D,QAAQ,CAAC,QAAQ,EAAE,QAAQ,GAAG,SAAS,CAAA;CACxC;AAED,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;IACtB,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAA;IACrB,QAAQ,CAAC,KAAK,EAAE,QAAQ,GAAG,SAAS,CAAA;IACpC,QAAQ,CAAC,KAAK,EAAE,QAAQ,GAAG,SAAS,CAAA;CACrC;AAED,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;CACtB;AAED,MAAM,MAAM,IAAI,GAAG,QAAQ,GAAG,SAAS,GAAG,QAAQ,CAAA;AAElD;;;;GAIG;AACH,MAAM,WAAW,QAAQ;IACvB,oDAAoD;IACpD,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC,MAAM,CAAC,CAAA;IACtC,sCAAsC;IACtC,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC,MAAM,CAAC,CAAA;IACrC,QAAQ,CAAC,OAAO,EAAE,CAAC,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,KAAK,OAAO,CAAA;CACnE;AAED,8EAA8E;AAC9E,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAA;IACzB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,gDAAgD;IAChD,QAAQ,CAAC,MAAM,CAAC,EAAE,aAAa,GAAG,SAAS,CAAA;CAC5C;AAED,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAA;IAC5B,wCAAwC;IACxC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAA;IACvB,kGAAkG;IAClG,QAAQ,CAAC,MAAM,EAAE,IAAI,GAAG,SAAS,CAAA;IACjC,4DAA4D;IAC5D,QAAQ,CAAC,QAAQ,EAAE,QAAQ,GAAG,SAAS,CAAA;IACvC,kFAAkF;IAClF,QAAQ,CAAC,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,QAAQ,GAAG,SAAS,KAAK,IAAI,GAAG,eAAe,CAAA;IAC/E,QAAQ,CAAC,SAAS,EAAE,CAClB,IAAI,EAAE,QAAQ,EACd,gBAAgB,EAAE,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,GAAG,SAAS,KACzD,IAAI,CAAA;IACT,QAAQ,CAAC,UAAU,EAAE,CAAC,IAAI,EAAE,SAAS,EAAE,GAAG,EAAE,QAAQ,GAAG,SAAS,KAAK,IAAI,CAAA;IACzE,kFAAkF;IAClF,QAAQ,CAAC,SAAS,EAAE,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,KAAK,aAAa,CAAC,QAAQ,CAAC,CAAA;IAC1E,8DAA8D;IAC9D,QAAQ,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,IAAI,KAAK,MAAM,CAAC,QAAQ,GAAG,IAAI,CAAA;IACvD,QAAQ,CAAC,OAAO,EAAE,CAAC,MAAM,EAAE,YAAY,CAAC,QAAQ,CAAC,KAAK,YAAY,CAAA;CACnE;AAED,2EAA2E;AAC3E,MAAM,MAAM,cAAc,GAAG,CAAC,OAAO,EAAE,WAAW,KAAK,YAAY,CAAA;AAEnE,+DAA+D;AAC/D,eAAO,MAAM,iBAAiB,KAAK,CAAA;AAEnC,mFAAmF;AACnF,eAAO,MAAM,kBAAkB,KAAK,CAAA;AAEpC,6EAA6E;AAC7E,eAAO,MAAM,YAAY,KAAK,CAAA;AAE9B,sDAAsD;AACtD,eAAO,MAAM,cAAc,OAAQ,CAAA;AAMnC;;;GAGG;AACH,eAAO,MAAM,OAAO,WAAM,CAAA;AAY1B;;;;GAIG;AACH,eAAO,MAAM,WAAW,GAAI,GAAG,QAAQ,EAAE,GAAG,QAAQ,KAAG,MAiBtD,CAAA;AAED;;;;;GAKG;AACH,eAAO,MAAM,OAAO,QAAiC,CAAA;AAErD;;;;;;;;GAQG;AACH,eAAO,MAAM,YAAY,GAAI,KAAK,MAAM,KAAG,MAO1C,CAAA;AASD,2EAA2E;AAC3E,eAAO,MAAM,iBAAiB,GAAI,WAAW,YAAY,EAAE,OAAO,QAAQ,KAAG,OAY5E,CAAA;AAID;;;;GAIG;AACH,eAAO,MAAM,cAAc,GAAI,OAAO,QAAQ,KAAG,YAAY,GAAG,SAyB/D,CAAA;AAED,gEAAgE;AAChE,eAAO,MAAM,aAAa,GAAI,OAAO,QAAQ,EAAE,OAAO,QAAQ,KAAG,OAGhE,CAAA;AAED,wFAAwF;AACxF,eAAO,MAAM,eAAe,GAAI,OAAO,QAAQ,KAAG,MAKjD,CAAA;AAED;;;;GAIG;AACH,eAAO,MAAM,mBAAmB,GAC9B,WAAW,YAAY,GAAG,SAAS,KAClC,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,EAAE,KAAK,EAAE,MAAM,GAAG,SAAS,CAUhE,CAAA;AAMD,6EAA6E;AAC7E,eAAO,MAAM,aAAa,GAAI,OAAO,OAAO,KAAG,MAW9C,CAAA;AAED;;;GAGG;AACH,eAAO,MAAM,WAAW,GAAI,MAAM,IAAI,KAAG,MAiBxC,CAAA;AAED,gEAAgE;AAChE,eAAO,MAAM,OAAO,GAAI,MAAM,MAAM,KAAG,MAOtC,CAAA;AAMD;;;;GAIG;AACH,eAAO,MAAM,aAAa,GAAI,YAAY,MAAM,EAAE,KAAK,MAAM,KAAG,eAQ5D,CAAA;AAEJ;;;;GAIG;AACH,eAAO,MAAM,QAAQ,GAAI,MAAM,QAAQ,EAAE,UAAU,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,KAAG,QAQlF,CAAA;AAqCF;;;;GAIG;AACH,MAAM,MAAM,UAAU,GAClB;IAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GACzB;IACE,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAA;IACvB,sEAAsE;IACtE,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;IACvB,oEAAoE;IACpE,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC,MAAM,CAAC,CAAA;IACtC,wDAAwD;IACxD,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,wDAAwD;IACxD,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC,MAAM,CAAC,CAAA;CACvC,CAAA;AAEL;;;GAGG;AACH,MAAM,MAAM,SAAS,GAAG;IACtB,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAA;IACvB,2EAA2E;IAC3E,QAAQ,CAAC,YAAY,EAAE,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,KAAK,QAAQ,CAAA;IAC9D,qEAAqE;IACrE,QAAQ,CAAC,QAAQ,EAAE,QAAQ,GAAG,SAAS,CAAA;IACvC,mGAAmG;IACnG,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAA;CACxB,CAAA;AAED,0EAA0E;AAC1E,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAA;IAC3B,0CAA0C;IAC1C,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;IACxB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;IACxB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;IACxB,kFAAkF;IAClF,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAA;IAC7B,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAA;IAC1B,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAA;IACzB,iFAAiF;IACjF,QAAQ,CAAC,UAAU,EAAE;QACnB,wDAAwD;QACxD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;QACvB,QAAQ,CAAC,QAAQ,EAAE,QAAQ,GAAG,SAAS,CAAA;KACxC,CAAA;IACD,kFAAkF;IAClF,QAAQ,CAAC,UAAU,EAAE,MAAM,GAAG,SAAS,CAAA;CACxC;AAED;;;GAGG;AACH,eAAO,MAAM,gBAAgB,GAC1B,MAAM,iBAAiB,KAAG,cA4U1B,CAAA;AAMH,+EAA+E;AAC/E,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;IACxB,sEAAsE;IACtE,QAAQ,CAAC,SAAS,EAAE,YAAY,GAAG,SAAS,CAAA;IAC5C;;;;;;;;;OASG;IACH,QAAQ,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,SAAS,CAAA;CACxC;AAED,oEAAoE;AACpE,MAAM,WAAW,WAAW;IAC1B,sCAAsC;IACtC,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC,MAAM,CAAC,CAAA;IACrC,2FAA2F;IAC3F,QAAQ,CAAC,QAAQ,EAAE,CACjB,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,KAChC;QAAE,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,SAAS,CAAA;KAAE,GAAG,SAAS,CAAA;IACzE;;;;;OAKG;IACH,QAAQ,CAAC,WAAW,CAAC,EACjB,CAAC,CACC,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,KAChC;QAAE,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,SAAS,CAAA;KAAE,GAAG,SAAS,CAAC,GAC1E,SAAS,CAAA;IACb;;;;OAIG;IACH,QAAQ,CAAC,KAAK,CAAC,EAAE,OAAO,GAAG,SAAS,CAAA;CACrC;AAED,6FAA6F;AAC7F,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAA;IAC3B,0CAA0C;IAC1C,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;IACxB,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,SAAS,CAAA;IACpC,qDAAqD;IACrD,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAA;IACzB,kFAAkF;IAClF,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAA;CACzB;AAiBD;;;;;;;;;;;;;;;GAeG;AACH,eAAO,MAAM,gBAAgB,GAC1B,MAAM,aAAa,KAAG,cAmLtB,CAAA;AAMH,wDAAwD;AACxD,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,gEAAgE;IAChE,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,SAAS,CAAA;IACjC,uDAAuD;IACvD,QAAQ,CAAC,KAAK,EAAE,UAAU,GAAG,SAAS,CAAA;CACvC;AAED,wEAAwE;AACxE,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAA;IAC3B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;IACxB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;IACxB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;IACxB,6FAA6F;IAC7F,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAA;IAC7B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;IACvB,kEAAkE;IAClE,QAAQ,CAAC,GAAG,EAAE,GAAG,GAAG,OAAO,CAAA;IAC3B,+EAA+E;IAC/E,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAA;IACzB,8DAA8D;IAC9D,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAA;IAC3B,yFAAyF;IACzF,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC,aAAa,CAAC,CAAA;IAC5C,sFAAsF;IACtF,QAAQ,CAAC,MAAM,EAAE,IAAI,GAAG,SAAS,CAAA;IACjC,iGAAiG;IACjG,QAAQ,CAAC,QAAQ,EAAE,QAAQ,GAAG,SAAS,CAAA;IACvC,gFAAgF;IAChF,QAAQ,CAAC,cAAc,EAAE,QAAQ,GAAG,SAAS,CAAA;IAC7C,oEAAoE;IACpE,QAAQ,CAAC,MAAM,EAAE,CACf,SAAS,EAAE,MAAM,EACjB,YAAY,EAAE,MAAM,KACjB;QAAE,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC,YAAY,CAAC,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAA;KAAE,CAAA;CAC/E;AAYD;;;;;;;GAOG;AACH,eAAO,MAAM,aAAa,GACvB,MAAM,cAAc,KAAG,cA+kBvB,CAAA"}