@hegeldev/hegel 0.1.0

package/dist/generators.d.ts

@@ -0,0 +1,408 @@
+/**
+ * Generator infrastructure for the Hegel SDK.
+ *
+ * Provides the {@link Generator} abstract class, {@link BasicGenerator},
+ * composite generators (Mapped, FlatMapped, Filtered), collection protocol,
+ * span helpers, and the initial set of generators.
+ *
+ * @packageDocumentation
+ */
+import type { TestCaseData } from "./runner.js";
+/**
+ * Base class for all generators.
+ *
+ * Subclasses implement `doDraw` to produce a value. The {@link map},
+ * {@link flatMap}, and {@link filter} combinators produce new generators.
+ *
+ * {@link BasicGenerator} is special: its {@link BasicGenerator.map} preserves
+ * the schema (stays basic), enabling the server to see the original schema for
+ * better shrinking.
+ */
+export declare abstract class Generator<T = unknown> {
+    /** @internal */
+    abstract doDraw(data: TestCaseData): Promise<T>;
+    /**
+     * Transform each generated value with `f`.
+     *
+     * On a {@link BasicGenerator} this stays basic (preserves schema).
+     * On any other generator it returns a MappedGenerator.
+     */
+    map<U>(f: (value: T) => U): Generator<U>;
+    /**
+     * Dependent generation: generate a value then use it to choose a second generator.
+     */
+    flatMap<U>(f: (value: T) => Generator<U>): Generator<U>;
+    /**
+     * Filter generated values. Tries up to 3 times before giving up.
+     *
+     * Prefer narrow schemas over filters when possible — filters slow shrinking.
+     */
+    filter(predicate: (value: T) => boolean): Generator<T>;
+}
+/**
+ * A generator backed by a raw schema sent to the server.
+ *
+ * `map()` on a BasicGenerator **preserves the schema** — it composes the
+ * transform client-side so the server still sees the original schema. This is
+ * the key optimization: the server can shrink within the original schema space.
+ */
+export declare class BasicGenerator<T = unknown> extends Generator<T> {
+    /** @internal */
+    readonly _rawSchema: Record<string, unknown>;
+    /** @internal */
+    readonly _transform: ((raw: unknown) => T) | null;
+    constructor(rawSchema: Record<string, unknown>, transform?: ((raw: unknown) => T) | null);
+    /** The raw schema sent to the server. */
+    schema(): Record<string, unknown>;
+    /** @internal */
+    doDraw(data: TestCaseData): Promise<T>;
+    /**
+     * Transform values while **preserving the schema**.
+     *
+     * If this generator already has a transform `t`, the new transform is
+     * `f(t(raw))`. This keeps the generator basic (server sees original schema).
+     */
+    map<U>(f: (value: T) => U): BasicGenerator<U>;
+}
+/**
+ * A generator that applies a transform to values from another generator.
+ * Uses a MAPPED span so the server can track the transformation.
+ */
+export declare class MappedGenerator<T, U> extends Generator<U> {
+    private readonly _source;
+    private readonly _f;
+    constructor(source: Generator<T>, f: (value: T) => U);
+    doDraw(data: TestCaseData): Promise<U>;
+}
+/**
+ * A generator for dependent generation.
+ * Generates a first value, uses it to choose a second generator, then generates from that.
+ */
+export declare class FlatMappedGenerator<T, U> extends Generator<U> {
+    private readonly _source;
+    private readonly _f;
+    constructor(source: Generator<T>, f: (value: T) => Generator<U>);
+    doDraw(data: TestCaseData): Promise<U>;
+}
+/**
+ * A generator that filters values from another generator.
+ *
+ * Tries up to 3 times. Each failed attempt discards the span.
+ * After all attempts fail, calls `assume(false)` to mark the test case as invalid.
+ */
+export declare class FilteredGenerator<T> extends Generator<T> {
+    private readonly _source;
+    private readonly _predicate;
+    constructor(source: Generator<T>, predicate: (value: T) => boolean);
+    doDraw(data: TestCaseData): Promise<T>;
+}
+/**
+ * Run `fn` inside a span with the given label.
+ *
+ * Starts the span before calling `fn`, then stops it (with `discard=false`)
+ * after `fn` returns. Returns the value returned by `fn`.
+ *
+ * @param label - Span label constant (see `Labels`).
+ * @param fn - Function to run inside the span.
+ */
+export declare function group<T>(label: number, fn: () => T | Promise<T>, data: TestCaseData): Promise<T>;
+/**
+ * Run `fn` inside a discardable span.
+ *
+ * If `fn` throws, stops the span with `discard=true`. Otherwise stops with
+ * `discard=false`. The exception (if any) is re-thrown.
+ *
+ * @param label - Span label constant (see `Labels`).
+ * @param fn - Function to run inside the span.
+ */
+export declare function discardableGroup<T>(label: number, fn: () => T | Promise<T>, data: TestCaseData): Promise<T>;
+/**
+ * Server-managed collection for generating variable-length sequences.
+ *
+ * The server decides how many elements to generate based on the configured
+ * size constraints. Call `more()` in a loop; when it returns false, the
+ * collection is done. Call `reject()` to discard the most recently
+ * generated element.
+ *
+ * StopTest errors from any collection command propagate as {@link DataExhausted}
+ * (same as in `generateFromSchema`).
+ */
+export declare class Collection {
+    private _baseName;
+    private _serverName;
+    private _serverNameResolved;
+    private _finished;
+    /** Minimum number of elements. */
+    readonly minSize: number;
+    /** Maximum number of elements (null = unlimited). */
+    readonly maxSize: number | null;
+    constructor(name: string | null, minSize?: number, maxSize?: number | null);
+    /**
+     * Get (or lazily initialize) the server-side collection name.
+     * Sends `new_collection` on first call.
+     */
+    private _getServerName;
+    /** @internal */
+    more(data: TestCaseData): Promise<boolean>;
+    /** @internal */
+    reject(data: TestCaseData, why?: string | null): Promise<void>;
+}
+/**
+ * Generate integers.
+ *
+ * @param minValue - Minimum value (inclusive), or null for unbounded.
+ * @param maxValue - Maximum value (inclusive), or null for unbounded.
+ */
+export declare function integers(minValue?: number | null, maxValue?: number | null): BasicGenerator<number>;
+/**
+ * Generate floating-point numbers.
+ *
+ * By default, allows NaN and infinity unless a range is given. When a min or
+ * max is provided the defaults tighten: NaN becomes disallowed, and infinity
+ * is disallowed on the bounded side.
+ *
+ * @param minValue - Minimum value (inclusive), or null for unbounded.
+ * @param maxValue - Maximum value (inclusive), or null for unbounded.
+ * @param allowNan - Whether to allow NaN. Defaults to true only when both bounds are absent.
+ * @param allowInfinity - Whether to allow ±Infinity. Defaults to true when at least one bound is absent.
+ * @param excludeMin - Whether to exclude the minimum value (open interval on the left).
+ * @param excludeMax - Whether to exclude the maximum value (open interval on the right).
+ */
+export declare function floats(minValue?: number | null, maxValue?: number | null, allowNan?: boolean | null, allowInfinity?: boolean | null, excludeMin?: boolean, excludeMax?: boolean): BasicGenerator<number>;
+/**
+ * Generate booleans.
+ *
+ * @param p - Probability of generating `true`. Defaults to 0.5.
+ */
+export declare function booleans(p?: number): BasicGenerator<boolean>;
+/**
+ * Generate text strings.
+ *
+ * @param minSize - Minimum number of Unicode codepoints. Defaults to 0.
+ * @param maxSize - Maximum number of Unicode codepoints, or null for unbounded.
+ */
+export declare function text(minSize?: number, maxSize?: number | null): BasicGenerator<string>;
+/**
+ * Generate binary data (byte strings).
+ *
+ * The server returns CBOR byte strings which are decoded directly as
+ * `Uint8Array`. No transform is needed.
+ *
+ * @param minSize - Minimum byte length. Defaults to 0.
+ * @param maxSize - Maximum byte length, or null for unbounded.
+ */
+export declare function binary(minSize?: number, maxSize?: number | null): BasicGenerator<Uint8Array>;
+/**
+ * Always return the same constant value, ignoring the server's suggestion.
+ *
+ * @param value - The constant to always return.
+ */
+export declare function just<T>(value: T): BasicGenerator<T>;
+/**
+ * Pick uniformly at random from a list of values.
+ *
+ * The server generates an integer index; the transform maps it to the
+ * corresponding element of `values`.
+ *
+ * @param values - The list to sample from. Must be non-empty.
+ * @throws {Error} If `values` is empty.
+ */
+export declare function sampledFrom<T>(values: readonly T[]): BasicGenerator<T>;
+/**
+ * Generate strings matching a regular expression pattern.
+ *
+ * @param pattern - The regex pattern to match.
+ * @param fullmatch - If true (default), the entire string must match the pattern.
+ *                    If false, a substring match is sufficient.
+ */
+export declare function fromRegex(pattern: string, fullmatch?: boolean): BasicGenerator<string>;
+/**
+ * Generate email addresses.
+ *
+ * Each generated value is a valid email address string containing '@'.
+ */
+export declare function emails(): BasicGenerator<string>;
+/**
+ * Generate URLs.
+ *
+ * Each generated value is a valid URL string starting with "http://" or "https://".
+ */
+export declare function urls(): BasicGenerator<string>;
+/**
+ * Generate domain names.
+ *
+ * @param maxLength - Optional maximum length for generated domain names.
+ */
+export declare function domains(maxLength?: number | null): BasicGenerator<string>;
+/**
+ * Generate dates.
+ *
+ * Each generated value is an ISO 8601 date string in YYYY-MM-DD format.
+ */
+export declare function dates(): BasicGenerator<string>;
+/**
+ * Generate times.
+ *
+ * Each generated value is a time string containing ':'.
+ */
+export declare function times(): BasicGenerator<string>;
+/**
+ * Generate datetimes.
+ *
+ * Each generated value is a datetime string containing 'T'.
+ */
+export declare function datetimes(): BasicGenerator<string>;
+/**
+ * A tuple generator for elements that are not all basic.
+ *
+ * Generates each element in sequence inside a TUPLE span (label 7).
+ * Used when at least one element cannot be represented as a basic schema.
+ */
+export declare class CompositeTupleGenerator<T extends unknown[]> extends Generator<T> {
+    private readonly _elements;
+    constructor(elements: {
+        [K in keyof T]: Generator<T[K]>;
+    });
+    doDraw(data: TestCaseData): Promise<T>;
+}
+/**
+ * Generate a 2-tuple (pair).
+ *
+ * If both elements are {@link BasicGenerator}s, returns a BasicGenerator with
+ * a tuple schema so the server can see and shrink both components. Otherwise
+ * returns a CompositeTupleGenerator that generates each element inside
+ * a TUPLE span.
+ *
+ * @param g1 - Generator for the first element.
+ * @param g2 - Generator for the second element.
+ */
+export declare function tuples2<A, B>(g1: Generator<A>, g2: Generator<B>): Generator<[A, B]>;
+/**
+ * Generate a 3-tuple.
+ *
+ * If all elements are {@link BasicGenerator}s, returns a BasicGenerator with
+ * a tuple schema. Otherwise returns a CompositeTupleGenerator.
+ *
+ * @param g1 - Generator for the first element.
+ * @param g2 - Generator for the second element.
+ * @param g3 - Generator for the third element.
+ */
+export declare function tuples3<A, B, C>(g1: Generator<A>, g2: Generator<B>, g3: Generator<C>): Generator<[A, B, C]>;
+/**
+ * Generate a 4-tuple.
+ *
+ * If all elements are {@link BasicGenerator}s, returns a BasicGenerator with
+ * a tuple schema. Otherwise returns a CompositeTupleGenerator.
+ *
+ * @param g1 - Generator for the first element.
+ * @param g2 - Generator for the second element.
+ * @param g3 - Generator for the third element.
+ * @param g4 - Generator for the fourth element.
+ */
+export declare function tuples4<A, B, C, D>(g1: Generator<A>, g2: Generator<B>, g3: Generator<C>, g4: Generator<D>): Generator<[A, B, C, D]>;
+/**
+ * A list generator for elements that are not basic (e.g., filtered or mapped
+ * through a non-basic path). Uses the collection protocol in a LIST span.
+ *
+ * @typeParam T - The element type.
+ */
+export declare class CompositeListGenerator<T = unknown> extends Generator<T[]> {
+    private readonly _elements;
+    private readonly _minSize;
+    private readonly _maxSize;
+    constructor(elements: Generator<T>, minSize?: number, maxSize?: number | null);
+    doDraw(data: TestCaseData): Promise<T[]>;
+}
+/**
+ * Generate lists of elements.
+ *
+ * When `elements` is a {@link BasicGenerator}, the list schema is sent to the
+ * server directly (optimal shrinking). If the element generator has a transform,
+ * a list-level transform is composed that applies it to each item. When elements
+ * is a composite generator (e.g., filtered or mapped), the collection protocol
+ * is used in a LIST span via CompositeListGenerator.
+ *
+ * @param elements - Generator for list elements.
+ * @param minSize - Minimum list length. Defaults to 0.
+ * @param maxSize - Maximum list length, or null for unbounded.
+ */
+export declare function lists<T>(elements: Generator<T>, minSize?: number, maxSize?: number | null): Generator<T[]>;
+/**
+ * A one_of generator for generators that cannot be represented as a single schema
+ * (i.e., when at least one branch is not a {@link BasicGenerator}).
+ *
+ * Generates an integer index then delegates to the selected generator. Wrapped
+ * in a ONE_OF span (label `Labels.ONE_OF`) so the server tracks the choice.
+ */
+export declare class CompositeOneOfGenerator<T = unknown> extends Generator<T> {
+    /** @internal */
+    readonly _generators: Generator<T>[];
+    constructor(generators: Generator<T>[]);
+    doDraw(data: TestCaseData): Promise<T>;
+}
+/**
+ * Choose uniformly between two or more generators.
+ *
+ * There are three implementation paths depending on the inputs:
+ *
+ * - **Path 1** — all branches are {@link BasicGenerator} with no transform:
+ *   returns a `BasicGenerator` with `{"one_of": [...schemas]}`.
+ * - **Path 2** — all branches are {@link BasicGenerator} but some have transforms:
+ *   returns a `BasicGenerator` using tagged-tuple schemas so each branch can
+ *   carry its own transform.
+ * - **Path 3** — any branch is not a `BasicGenerator`:
+ *   returns a CompositeOneOfGenerator that generates an index then
+ *   delegates to the selected generator inside a ONE_OF span.
+ *
+ * @param generators - Two or more generators to choose between.
+ * @throws {Error} If fewer than 2 generators are provided.
+ */
+export declare function oneOf<T>(...generators: Generator<T>[]): Generator<T>;
+/**
+ * Optionally generate a value — returns `null` or a value from `element`.
+ *
+ * Equivalent to `oneOf(just(null), element)`.
+ *
+ * @param element - Generator for the non-null case.
+ */
+export declare function optional<T>(element: Generator<T>): Generator<T | null>;
+/**
+ * Generate IP addresses.
+ *
+ * @param version - IP version: `4` for IPv4, `6` for IPv6, or `null` (default)
+ *   to generate both versions mixed.
+ */
+export declare function ipAddresses(version?: 4 | 6 | null): Generator<string>;
+/**
+ * A dict generator for keys or values that are not basic (have no server schema).
+ *
+ * Uses the MAP span (label 5) for the whole dict and MAP_ENTRY spans (label 6)
+ * for each key-value pair. The server decides the size via generateFromSchema.
+ */
+export declare class CompositeDictGenerator<K, V> extends Generator<Map<K, V>> {
+    /** @internal */
+    readonly _keys: Generator<K>;
+    /** @internal */
+    readonly _values: Generator<V>;
+    /** @internal */
+    readonly _minSize: number;
+    /** @internal */
+    readonly _maxSize: number | null;
+    constructor(keys: Generator<K>, values: Generator<V>, minSize: number, maxSize: number | null);
+    doDraw(data: TestCaseData): Promise<Map<K, V>>;
+}
+/**
+ * Generate dictionaries with keys and values from the given generators.
+ *
+ * When both `keys` and `values` are {@link BasicGenerator}s, the server handles
+ * the full dict generation (basic path) and the result is a plain
+ * `Record<string, unknown>`. Otherwise a CompositeDictGenerator is used
+ * (non-basic path) which returns a `Map<K, V>`.
+ *
+ * @param keys - Generator for dictionary keys.
+ * @param values - Generator for dictionary values.
+ * @param minSize - Minimum number of entries. Defaults to 0.
+ * @param maxSize - Maximum number of entries, or null for unbounded.
+ */
+export declare function dicts<K, V>(keys: Generator<K>, values: Generator<V>, minSize?: number, maxSize?: number | null): Generator<Record<string, unknown>> | Generator<Map<K, V>>;
+//# sourceMappingURL=generators.d.ts.map

package/dist/generators.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"generators.d.ts","sourceRoot":"","sources":["../src/generators.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAWH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAMhD;;;;;;;;;GASG;AACH,8BAAsB,SAAS,CAAC,CAAC,GAAG,OAAO;IACzC,gBAAgB;IAChB,QAAQ,CAAC,MAAM,CAAC,IAAI,EAAE,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC;IAE/C;;;;;OAKG;IACH,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;IAIxC;;OAEG;IACH,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;IAIvD;;;;OAIG;IACH,MAAM,CAAC,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,SAAS,CAAC,CAAC,CAAC;CAGvD;AAMD;;;;;;GAMG;AACH,qBAAa,cAAc,CAAC,CAAC,GAAG,OAAO,CAAE,SAAQ,SAAS,CAAC,CAAC,CAAC;IAC3D,gBAAgB;IAChB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC7C,gBAAgB;IAChB,QAAQ,CAAC,UAAU,EAAE,CAAC,CAAC,GAAG,EAAE,OAAO,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC;gBAEtC,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS,GAAE,CAAC,CAAC,GAAG,EAAE,OAAO,KAAK,CAAC,CAAC,GAAG,IAAW;IAM9F,yCAAyC;IACzC,MAAM,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;IAIjC,gBAAgB;IACV,MAAM,CAAC,IAAI,EAAE,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC;IAQ5C;;;;;OAKG;IACM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC;CAMvD;AAMD;;;GAGG;AACH,qBAAa,eAAe,CAAC,CAAC,EAAE,CAAC,CAAE,SAAQ,SAAS,CAAC,CAAC,CAAC;IACrD,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAe;IACvC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAkB;gBAEzB,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC;IAM9C,MAAM,CAAC,IAAI,EAAE,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC;CAS7C;AAMD;;;GAGG;AACH,qBAAa,mBAAmB,CAAC,CAAC,EAAE,CAAC,CAAE,SAAQ,SAAS,CAAC,CAAC,CAAC;IACzD,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAe;IACvC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAA6B;gBAEpC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC;IAMzD,MAAM,CAAC,IAAI,EAAE,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC;CAU7C;AASD;;;;;GAKG;AACH,qBAAa,iBAAiB,CAAC,CAAC,CAAE,SAAQ,SAAS,CAAC,CAAC,CAAC;IACpD,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAe;IACvC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAwB;gBAEvC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO;IAM5D,MAAM,CAAC,IAAI,EAAE,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC;CAc7C;AAMD;;;;;;;;GAQG;AACH,wBAAsB,KAAK,CAAC,CAAC,EAC3B,KAAK,EAAE,MAAM,EACb,EAAE,EAAE,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,EACxB,IAAI,EAAE,YAAY,GACjB,OAAO,CAAC,CAAC,CAAC,CAOZ;AAED;;;;;;;;GAQG;AACH,wBAAsB,gBAAgB,CAAC,CAAC,EACtC,KAAK,EAAE,MAAM,EACb,EAAE,EAAE,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,EACxB,IAAI,EAAE,YAAY,GACjB,OAAO,CAAC,CAAC,CAAC,CAWZ;AAMD;;;;;;;;;;GAUG;AACH,qBAAa,UAAU;IACrB,OAAO,CAAC,SAAS,CAAgB;IACjC,OAAO,CAAC,WAAW,CAAiB;IACpC,OAAO,CAAC,mBAAmB,CAAS;IACpC,OAAO,CAAC,SAAS,CAAS;IAE1B,kCAAkC;IAClC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,qDAAqD;IACrD,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;gBAEpB,IAAI,EAAE,MAAM,GAAG,IAAI,EAAE,OAAO,SAAI,EAAE,OAAO,GAAE,MAAM,GAAG,IAAW;IAM3E;;;OAGG;YACW,cAAc;IAwB5B,gBAAgB;IACV,IAAI,CAAC,IAAI,EAAE,YAAY,GAAG,OAAO,CAAC,OAAO,CAAC;IAoBhD,gBAAgB;IACV,MAAM,CAAC,IAAI,EAAE,YAAY,EAAE,GAAG,GAAE,MAAM,GAAG,IAAW,GAAG,OAAO,CAAC,IAAI,CAAC;CAY3E;AAWD;;;;;GAKG;AACH,wBAAgB,QAAQ,CACtB,QAAQ,GAAE,MAAM,GAAG,IAAW,EAC9B,QAAQ,GAAE,MAAM,GAAG,IAAW,GAC7B,cAAc,CAAC,MAAM,CAAC,CAKxB;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,MAAM,CACpB,QAAQ,GAAE,MAAM,GAAG,IAAW,EAC9B,QAAQ,GAAE,MAAM,GAAG,IAAW,EAC9B,QAAQ,GAAE,OAAO,GAAG,IAAW,EAC/B,aAAa,GAAE,OAAO,GAAG,IAAW,EACpC,UAAU,UAAQ,EAClB,UAAU,UAAQ,GACjB,cAAc,CAAC,MAAM,CAAC,CAgBxB;AAED;;;;GAIG;AACH,wBAAgB,QAAQ,CAAC,CAAC,SAAM,GAAG,cAAc,CAAC,OAAO,CAAC,CAEzD;AAED;;;;;GAKG;AACH,wBAAgB,IAAI,CAAC,OAAO,SAAI,EAAE,OAAO,GAAE,MAAM,GAAG,IAAW,GAAG,cAAc,CAAC,MAAM,CAAC,CAIvF;AAED;;;;;;;;GAQG;AACH,wBAAgB,MAAM,CAAC,OAAO,SAAI,EAAE,OAAO,GAAE,MAAM,GAAG,IAAW,GAAG,cAAc,CAAC,UAAU,CAAC,CAI7F;AAED;;;;GAIG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAEnD;AAED;;;;;;;;GAQG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,GAAG,cAAc,CAAC,CAAC,CAAC,CAWtE;AAED;;;;;;GAMG;AACH,wBAAgB,SAAS,CAAC,OAAO,EAAE,MAAM,EAAE,SAAS,UAAO,GAAG,cAAc,CAAC,MAAM,CAAC,CAEnF;AAED;;;;GAIG;AACH,wBAAgB,MAAM,IAAI,cAAc,CAAC,MAAM,CAAC,CAE/C;AAED;;;;GAIG;AACH,wBAAgB,IAAI,IAAI,cAAc,CAAC,MAAM,CAAC,CAE7C;AAED;;;;GAIG;AACH,wBAAgB,OAAO,CAAC,SAAS,GAAE,MAAM,GAAG,IAAW,GAAG,cAAc,CAAC,MAAM,CAAC,CAI/E;AAED;;;;GAIG;AACH,wBAAgB,KAAK,IAAI,cAAc,CAAC,MAAM,CAAC,CAE9C;AAED;;;;GAIG;AACH,wBAAgB,KAAK,IAAI,cAAc,CAAC,MAAM,CAAC,CAE9C;AAED;;;;GAIG;AACH,wBAAgB,SAAS,IAAI,cAAc,CAAC,MAAM,CAAC,CAElD;AAMD;;;;;GAKG;AACH,qBAAa,uBAAuB,CAAC,CAAC,SAAS,OAAO,EAAE,CAAE,SAAQ,SAAS,CAAC,CAAC,CAAC;IAC5E,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAsC;gBAEpD,QAAQ,EAAE;SAAG,CAAC,IAAI,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KAAE;IAKnD,MAAM,CAAC,IAAI,EAAE,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC;CAY7C;AAMD;;;;;;;;;;GAUG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAKnF;AAED;;;;;;;;;GASG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAC7B,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,EAChB,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,EAChB,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,GACf,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAStB;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAChC,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,EAChB,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,EAChB,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,EAChB,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,GACf,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAUzB;AAMD;;;;;GAKG;AACH,qBAAa,sBAAsB,CAAC,CAAC,GAAG,OAAO,CAAE,SAAQ,SAAS,CAAC,CAAC,EAAE,CAAC;IACrE,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAe;IACzC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAS;IAClC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAgB;gBAE7B,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,SAAI,EAAE,OAAO,GAAE,MAAM,GAAG,IAAW;IAOxE,MAAM,CAAC,IAAI,EAAE,YAAY,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC;CAe/C;AAMD;;;;;;;;;;;;GAYG;AACH,wBAAgB,KAAK,CAAC,CAAC,EACrB,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC,EACtB,OAAO,SAAI,EACX,OAAO,GAAE,MAAM,GAAG,IAAW,GAC5B,SAAS,CAAC,CAAC,EAAE,CAAC,CAmBhB;AAsCD;;;;;;GAMG;AACH,qBAAa,uBAAuB,CAAC,CAAC,GAAG,OAAO,CAAE,SAAQ,SAAS,CAAC,CAAC,CAAC;IACpE,gBAAgB;IAChB,QAAQ,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;gBAEzB,UAAU,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE;IAKhC,MAAM,CAAC,IAAI,EAAE,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC;CAgB7C;AAMD;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,GAAG,UAAU,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,CAsCpE;AAMD;;;;;;GAMG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,CAEtE;AAMD;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,OAAO,GAAE,CAAC,GAAG,CAAC,GAAG,IAAW,GAAG,SAAS,CAAC,MAAM,CAAC,CAS3E;AAMD;;;;;GAKG;AACH,qBAAa,sBAAsB,CAAC,CAAC,EAAE,CAAC,CAAE,SAAQ,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpE,gBAAgB;IAChB,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;IAC7B,gBAAgB;IAChB,QAAQ,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;IAC/B,gBAAgB;IAChB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,gBAAgB;IAChB,QAAQ,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;gBAErB,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,IAAI;IAQvF,MAAM,CAAC,IAAI,EAAE,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CAyBrD;AAMD;;;;;;;;;;;;GAYG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,CAAC,EACxB,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAClB,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,EACpB,OAAO,SAAI,EACX,OAAO,GAAE,MAAM,GAAG,IAAW,GAC5B,SAAS,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CA+B3D"}