effect 4.0.0-rc.111 → 4.0.0-rc.113

package/dist/unstable/arbitrary/Arbitrary.d.ts

@@ -0,0 +1,626 @@
+import type * as Effect from "../../Effect.ts";
+import type * as Filter from "../../Filter.ts";
+import type { Pipeable } from "../../Pipeable.ts";
+import { type Predicate, type Refinement } from "../../Predicate.ts";
+import type * as Schema_ from "../../Schema.ts";
+import type * as Types from "../../Types.ts";
+/**
+ * Runtime type identifier for `Arbitrary` values.
+ *
+ * @category type IDs
+ * @since 4.0.0
+ */
+export declare const TypeId: TypeId;
+/**
+ * Type of the runtime identifier for `Arbitrary` values.
+ *
+ * @category type IDs
+ * @since 4.0.0
+ */
+export type TypeId = "~effect/arbitrary/Arbitrary";
+/**
+ * Represents a pure description of values that can be generated and shrunk.
+ *
+ * **When to use**
+ *
+ * Use as the result of {@link schema}, {@link Constant}, and composition, and as the input to {@link sampleEffect} or
+ * {@link checkEffect}.
+ *
+ * **Details**
+ *
+ * Arbitraries implement `Pipeable`, so data-last combinators can be composed with `.pipe(...)`.
+ *
+ * @category models
+ * @since 4.0.0
+ */
+export interface Arbitrary<out A> extends Pipeable {
+    readonly [TypeId]: TypeId;
+    readonly "~A": Types.Covariant<A>;
+}
+/**
+ * Configures Schema-derived generation.
+ *
+ * **Details**
+ *
+ * `shrink` returns the immediate semantic simplifications of a failing value. Each returned candidate is validated
+ * against the decoded side of the original Schema before it can reach the property.
+ *
+ * @category models
+ * @since 4.0.0
+ */
+export interface SchemaOptions<A> {
+    readonly shrink?: ((value: A) => ReadonlyArray<A>) | undefined;
+}
+/**
+ * Checks whether a value is an `Arbitrary`.
+ *
+ * **When to use**
+ *
+ * Use when accepting both Arbitrary values and other input descriptions.
+ *
+ * @category guards
+ * @since 4.0.0
+ */
+export declare const isArbitrary: (u: unknown) => u is Arbitrary<unknown>;
+/**
+ * Configures direct sampling from an `Arbitrary`.
+ *
+ * **Details**
+ *
+ * `size` is a local complexity scale, not a global bound on the complete value. Each unconstrained string, collection,
+ * or object property observes the same size independently, while recursive branches share one recursion allowance.
+ * Explicit Schema minima and required members are still honored, while explicit maxima clamp generation.
+ *
+ * @category models
+ * @since 4.0.0
+ */
+export interface SampleOptions {
+    readonly count?: number | undefined;
+    readonly size?: number | undefined;
+    readonly maxDiscards?: number | undefined;
+    readonly seed?: string | number | undefined;
+}
+/**
+ * Describes sampling exhaustion before the requested number of values was generated.
+ *
+ * **Details**
+ *
+ * The effective `seed` can be passed to {@link sampleEffect} to reproduce the exhausted run, including when sampling
+ * originally selected a seed from the Effect `Random` service.
+ *
+ * @category errors
+ * @since 4.0.0
+ */
+export interface SampleError {
+    readonly _tag: "SampleError";
+    readonly generated: number;
+    readonly discards: number;
+    readonly seed: string | number;
+}
+/**
+ * Opaque string token that replays a falsification and its complete shrink path.
+ *
+ * **When to use**
+ *
+ * Use with {@link CheckOptions.replay} to copy, store, and reproduce a `Falsified` result from the same
+ * implementation.
+ *
+ * **Details**
+ *
+ * The token records whether the property returned `false` or failed its Effect, but does not record a typed error value
+ * or input fingerprint.
+ *
+ * **Gotchas**
+ *
+ * Replay compatibility is not guaranteed across releases of this unstable module.
+ *
+ * @category models
+ * @since 4.0.0
+ */
+export type Replay = string;
+/**
+ * Configures property checking, shrinking, and replay.
+ *
+ * **Details**
+ *
+ * `size` is the maximum local complexity scale. Checking starts with smaller values and grows to that size according
+ * to completed runs; discarded attempts do not advance the progression. A single-run check uses the configured size.
+ * Each unconstrained string, collection, or object property observes the current size independently. Recursive
+ * branches instead consume one shared recursion allowance. Explicit Schema bounds and required members still apply.
+ *
+ * `maxShrinks` bounds the number of shrink candidates inspected after the initial failure. Candidates rejected by a
+ * Schema check, `filter`, `filterMap`, or dependent generation consume the same budget even though the property is not
+ * evaluated. Candidates that produce a different failure class also consume the budget. When the budget is exhausted,
+ * checking returns the best shrunk input found so far. The `shrinks` field in a `Falsified` result counts only
+ * candidates that were accepted as smaller failures.
+ *
+ * **Gotchas**
+ *
+ * When `replay` is present, its recorded seed, attempt, size, and shrink path control the run. The `runs`, `size`,
+ * `maxDiscards`, `maxShrinks`, and `seed` options are ignored.
+ *
+ * @category models
+ * @since 4.0.0
+ */
+export interface CheckOptions {
+    readonly runs?: number | undefined;
+    readonly size?: number | undefined;
+    readonly maxDiscards?: number | undefined;
+    readonly maxShrinks?: number | undefined;
+    readonly seed?: string | number | undefined;
+    readonly replay?: Replay | undefined;
+}
+/**
+ * Identifies a property that returned `false`.
+ *
+ * @category models
+ * @since 4.0.0
+ */
+export interface ReturnedFalse {
+    readonly _tag: "ReturnedFalse";
+}
+/**
+ * Preserves a typed failure produced by an effectful property.
+ *
+ * @category models
+ * @since 4.0.0
+ */
+export interface PropertyError<out E> {
+    readonly _tag: "PropertyError";
+    readonly error: E;
+}
+/**
+ * Represents the reason a property was falsified.
+ *
+ * @category models
+ * @since 4.0.0
+ */
+export type PropertyFailure<E> = ReturnedFalse | PropertyError<E>;
+/**
+ * Reports that every requested property run passed.
+ *
+ * @category models
+ * @since 4.0.0
+ */
+export interface Passed {
+    readonly _tag: "Passed";
+    readonly runs: number;
+    readonly discards: number;
+}
+/**
+ * Reports a generated failure and its shrunk input.
+ *
+ * **Details**
+ *
+ * `initialInput` is the generated value that first falsified the property. `shrunkInput` is the best failing value found
+ * by the bounded shrink search and may be equal to `initialInput`.
+ *
+ * `runs` counts main property evaluations through the falsifying evaluation. It excludes evaluations performed while
+ * shrinking. A replay reports one run.
+ *
+ * @category models
+ * @since 4.0.0
+ */
+export interface Falsified<out A, out E> {
+    readonly _tag: "Falsified";
+    readonly initialInput: A;
+    readonly shrunkInput: A;
+    readonly failure: PropertyFailure<E>;
+    readonly runs: number;
+    readonly discards: number;
+    readonly shrinks: number;
+    readonly replay: Replay;
+}
+/**
+ * Reports that bounded generation discarded too many candidates.
+ *
+ * **Details**
+ *
+ * The effective `seed` can be passed to {@link checkEffect} to reproduce the exhausted run, including when checking
+ * originally selected a seed from the Effect `Random` service.
+ *
+ * @category models
+ * @since 4.0.0
+ */
+export interface Exhausted {
+    readonly _tag: "Exhausted";
+    readonly runs: number;
+    readonly discards: number;
+    readonly seed: string | number;
+}
+/**
+ * Reports that replay coordinates no longer reproduce the recorded failure class.
+ *
+ * **Details**
+ *
+ * - `PropertyPassed` means that the regenerated root passed.
+ * - `ShrinkPassed` means that the root switched failure class, or that a recorded shrink either passed or switched
+ *   failure class.
+ *
+ * @category models
+ * @since 4.0.0
+ */
+export interface ReplayMismatch {
+    readonly _tag: "ReplayMismatch";
+    readonly reason: "AttemptDiscarded" | "PropertyPassed" | "ShrinkPathUnavailable" | "ShrinkPassed";
+}
+/**
+ * Represents every ordinary outcome of property checking.
+ *
+ * **Details**
+ *
+ * Defects and fiber interruption are not converted to this data type and continue through the returned `Effect`.
+ *
+ * @category models
+ * @since 4.0.0
+ */
+export type CheckResult<A, E> = Passed | Falsified<A, E> | Exhausted | ReplayMismatch;
+/**
+ * Formats an unsuccessful property-check result as a diagnostic message, returning `undefined` for a passed result.
+ *
+ * **When to use**
+ *
+ * Use when integrating `checkEffect` with a test runner or another reporting interface.
+ *
+ * @category converting
+ * @since 4.0.0
+ */
+export declare function formatCheckFailure<A, E>(result: CheckResult<A, E>): string | undefined;
+/**
+ * Derives an `Arbitrary` from the decoded `Type` of a Schema.
+ *
+ * **When to use**
+ *
+ * Use when you want Schema-aware generation without exposing a third-party property-testing engine.
+ *
+ * **Details**
+ *
+ * When `options.shrink` is provided, generated roots still come from Schema derivation, while the callback defines the
+ * complete shrink tree. Invalid candidates are skipped and count against `maxShrinks` without reaching the property.
+ *
+ * **Gotchas**
+ *
+ * Derivation is immediate and throws when the current unstable implementation cannot compile the Schema or prove a
+ * finite route through a recursive component.
+ *
+ * A custom shrinker replaces Schema-derived shrinking. It is evaluated lazily after a property failure and must be
+ * synchronous, deterministic, terminating, and free of mutation.
+ *
+ * @category constructors
+ * @since 4.0.0
+ */
+export declare function schema<S extends Schema_.Constraint>(schema: S, options?: SchemaOptions<S["Type"]>): Arbitrary<S["Type"]>;
+/**
+ * Creates an `Arbitrary` that always generates `value` and has no shrink candidates.
+ *
+ * **When to use**
+ *
+ * Use when a branch of dependent generation should produce an already constructed value.
+ *
+ * **Gotchas**
+ *
+ * Every generation returns the same value. Objects are not cloned, so properties must not mutate them.
+ *
+ * @see {@link flatMap} for selecting dependent Arbitraries
+ * @category constructors
+ * @since 4.0.0
+ */
+export declare function Constant<const A>(value: A): Arbitrary<A>;
+/**
+ * Transforms every generated value and its shrink candidates.
+ *
+ * **When to use**
+ *
+ * Use when you want to derive generated values from an existing `Arbitrary` without changing its generation or shrink
+ * structure.
+ *
+ * @category mapping
+ * @since 4.0.0
+ */
+export declare const map: {
+    /**
+     * Transforms every generated value and its shrink candidates.
+     *
+     * **When to use**
+     *
+     * Use when you want to derive generated values from an existing `Arbitrary` without changing its generation or shrink
+     * structure.
+     *
+     * @category mapping
+     * @since 4.0.0
+     */
+    <A, B>(f: (value: A) => B): (self: Arbitrary<A>) => Arbitrary<B>;
+    /**
+     * Transforms every generated value and its shrink candidates.
+     *
+     * **When to use**
+     *
+     * Use when you want to derive generated values from an existing `Arbitrary` without changing its generation or shrink
+     * structure.
+     *
+     * @category mapping
+     * @since 4.0.0
+     */
+    <A, B>(self: Arbitrary<A>, f: (value: A) => B): Arbitrary<B>;
+};
+/**
+ * Keeps generated values and shrink candidates that satisfy a predicate or refinement.
+ *
+ * **When to use**
+ *
+ * Use when a condition cannot be expressed constructively by the source Schema or after values have been transformed.
+ *
+ * **Gotchas**
+ *
+ * Rejected generated values count against `maxDiscards`. Prefer Schema checks when possible because the Schema compiler
+ * may generate matching values directly.
+ *
+ * @see {@link filterMap} for transforming and filtering simultaneously
+ * @category filtering
+ * @since 4.0.0
+ */
+export declare const filter: {
+    /**
+     * Keeps generated values and shrink candidates that satisfy a predicate or refinement.
+     *
+     * **When to use**
+     *
+     * Use when a condition cannot be expressed constructively by the source Schema or after values have been transformed.
+     *
+     * **Gotchas**
+     *
+     * Rejected generated values count against `maxDiscards`. Prefer Schema checks when possible because the Schema compiler
+     * may generate matching values directly.
+     *
+     * @see {@link filterMap} for transforming and filtering simultaneously
+     * @category filtering
+     * @since 4.0.0
+     */
+    <A, B extends A>(refinement: Refinement<A, B>): (self: Arbitrary<A>) => Arbitrary<B>;
+    /**
+     * Keeps generated values and shrink candidates that satisfy a predicate or refinement.
+     *
+     * **When to use**
+     *
+     * Use when a condition cannot be expressed constructively by the source Schema or after values have been transformed.
+     *
+     * **Gotchas**
+     *
+     * Rejected generated values count against `maxDiscards`. Prefer Schema checks when possible because the Schema compiler
+     * may generate matching values directly.
+     *
+     * @see {@link filterMap} for transforming and filtering simultaneously
+     * @category filtering
+     * @since 4.0.0
+     */
+    <A>(predicate: Predicate<A>): <B extends A>(self: Arbitrary<B>) => Arbitrary<B>;
+    /**
+     * Keeps generated values and shrink candidates that satisfy a predicate or refinement.
+     *
+     * **When to use**
+     *
+     * Use when a condition cannot be expressed constructively by the source Schema or after values have been transformed.
+     *
+     * **Gotchas**
+     *
+     * Rejected generated values count against `maxDiscards`. Prefer Schema checks when possible because the Schema compiler
+     * may generate matching values directly.
+     *
+     * @see {@link filterMap} for transforming and filtering simultaneously
+     * @category filtering
+     * @since 4.0.0
+     */
+    <A, B extends A>(self: Arbitrary<A>, refinement: Refinement<A, B>): Arbitrary<B>;
+    /**
+     * Keeps generated values and shrink candidates that satisfy a predicate or refinement.
+     *
+     * **When to use**
+     *
+     * Use when a condition cannot be expressed constructively by the source Schema or after values have been transformed.
+     *
+     * **Gotchas**
+     *
+     * Rejected generated values count against `maxDiscards`. Prefer Schema checks when possible because the Schema compiler
+     * may generate matching values directly.
+     *
+     * @see {@link filterMap} for transforming and filtering simultaneously
+     * @category filtering
+     * @since 4.0.0
+     */
+    <A>(self: Arbitrary<A>, predicate: Predicate<A>): Arbitrary<A>;
+};
+/**
+ * Transforms accepted generated values and discards rejected values.
+ *
+ * **When to use**
+ *
+ * Use when transformation and validation need to happen in one step after constructing an `Arbitrary`.
+ *
+ * **Gotchas**
+ *
+ * Failed filters discard generated roots and count against `maxDiscards`. Failures are not exposed in sampling or
+ * checking results.
+ *
+ * @see {@link map} for transformations that cannot reject
+ * @see {@link filter} for retaining original values that satisfy a condition
+ * @category filtering
+ * @since 4.0.0
+ */
+export declare const filterMap: {
+    /**
+     * Transforms accepted generated values and discards rejected values.
+     *
+     * **When to use**
+     *
+     * Use when transformation and validation need to happen in one step after constructing an `Arbitrary`.
+     *
+     * **Gotchas**
+     *
+     * Failed filters discard generated roots and count against `maxDiscards`. Failures are not exposed in sampling or
+     * checking results.
+     *
+     * @see {@link map} for transformations that cannot reject
+     * @see {@link filter} for retaining original values that satisfy a condition
+     * @category filtering
+     * @since 4.0.0
+     */
+    <A, B, X>(f: Filter.Filter<A, B, X>): (self: Arbitrary<A>) => Arbitrary<B>;
+    /**
+     * Transforms accepted generated values and discards rejected values.
+     *
+     * **When to use**
+     *
+     * Use when transformation and validation need to happen in one step after constructing an `Arbitrary`.
+     *
+     * **Gotchas**
+     *
+     * Failed filters discard generated roots and count against `maxDiscards`. Failures are not exposed in sampling or
+     * checking results.
+     *
+     * @see {@link map} for transformations that cannot reject
+     * @see {@link filter} for retaining original values that satisfy a condition
+     * @category filtering
+     * @since 4.0.0
+     */
+    <A, B, X>(self: Arbitrary<A>, f: Filter.Filter<A, B, X>): Arbitrary<B>;
+};
+/**
+ * Sequentially selects an `Arbitrary` from a generated value.
+ *
+ * **When to use**
+ *
+ * Use when the domain or shape of a generated value depends on another generated value.
+ *
+ * **Details**
+ *
+ * Shrinking first tries smaller source values and regenerates their dependent Arbitraries. It then shrinks the
+ * selected dependent value. After a dependent shrink is selected, source shrinking is closed for that branch.
+ *
+ * **Gotchas**
+ *
+ * The callback must be synchronous, deterministic, and terminating. It can be evaluated again during shrinking and
+ * replay. Deriving a Schema inside the callback also repeats that derivation, so precompile finite dependent
+ * Arbitraries when possible.
+ *
+ * @see {@link map} for total transformations that do not select another Arbitrary
+ * @see {@link Constant} for dependent branches that return an existing value
+ * @category sequencing
+ * @since 4.0.0
+ */
+export declare const flatMap: {
+    /**
+     * Sequentially selects an `Arbitrary` from a generated value.
+     *
+     * **When to use**
+     *
+     * Use when the domain or shape of a generated value depends on another generated value.
+     *
+     * **Details**
+     *
+     * Shrinking first tries smaller source values and regenerates their dependent Arbitraries. It then shrinks the
+     * selected dependent value. After a dependent shrink is selected, source shrinking is closed for that branch.
+     *
+     * **Gotchas**
+     *
+     * The callback must be synchronous, deterministic, and terminating. It can be evaluated again during shrinking and
+     * replay. Deriving a Schema inside the callback also repeats that derivation, so precompile finite dependent
+     * Arbitraries when possible.
+     *
+     * @see {@link map} for total transformations that do not select another Arbitrary
+     * @see {@link Constant} for dependent branches that return an existing value
+     * @category sequencing
+     * @since 4.0.0
+     */
+    <A, B>(f: (value: A) => Arbitrary<B>): (self: Arbitrary<A>) => Arbitrary<B>;
+    /**
+     * Sequentially selects an `Arbitrary` from a generated value.
+     *
+     * **When to use**
+     *
+     * Use when the domain or shape of a generated value depends on another generated value.
+     *
+     * **Details**
+     *
+     * Shrinking first tries smaller source values and regenerates their dependent Arbitraries. It then shrinks the
+     * selected dependent value. After a dependent shrink is selected, source shrinking is closed for that branch.
+     *
+     * **Gotchas**
+     *
+     * The callback must be synchronous, deterministic, and terminating. It can be evaluated again during shrinking and
+     * replay. Deriving a Schema inside the callback also repeats that derivation, so precompile finite dependent
+     * Arbitraries when possible.
+     *
+     * @see {@link map} for total transformations that do not select another Arbitrary
+     * @see {@link Constant} for dependent branches that return an existing value
+     * @category sequencing
+     * @since 4.0.0
+     */
+    <A, B>(self: Arbitrary<A>, f: (value: A) => Arbitrary<B>): Arbitrary<B>;
+};
+/**
+ * Combines Arbitraries into one `Arbitrary` whose generated value mirrors the input shape.
+ *
+ * **When to use**
+ *
+ * Use when you need to generate several independent values together.
+ *
+ * **Details**
+ *
+ * Accepts a tuple or array, an iterable, or a record of Arbitraries. Tuple positions and record keys are preserved in
+ * the generated value. Members are generated in a randomized internal order so recursive members share the generation
+ * budget fairly, while shrinking changes one member at a time.
+ *
+ * **Gotchas**
+ *
+ * Iterable inputs are consumed when `all` is called. If any member discards a generated root, the complete generated
+ * value is discarded.
+ *
+ * @category constructors
+ * @since 4.0.0
+ */
+export declare function all<const Input extends Iterable<Arbitrary<any>> | Record<string, Arbitrary<any>>>(input: Input): Arbitrary<[
+    Input
+] extends [ReadonlyArray<Arbitrary<any>>] ? {
+    -readonly [K in keyof Input]: [Input[K]] extends [Arbitrary<infer A>] ? A : never;
+} : [Input] extends [Iterable<Arbitrary<infer A>>] ? Array<A> : [Input] extends [Record<string, Arbitrary<any>>] ? {
+    -readonly [K in keyof Input]: [Input[K]] extends [Arbitrary<infer A>] ? A : never;
+} : never>;
+/**
+ * Generates a bounded collection of values from an `Arbitrary`.
+ *
+ * **When to use**
+ *
+ * Use when you need generated examples without running a property.
+ *
+ * @category running
+ * @since 4.0.0
+ */
+export declare function sampleEffect<A>(self: Arbitrary<A>, options?: SampleOptions): Effect.Effect<ReadonlyArray<A>, SampleError>;
+/**
+ * Checks a pure or effectful property and shrinks the first falsification.
+ *
+ * **When to use**
+ *
+ * Use when you want deterministic, interruptible property checking with typed property failures and replay.
+ *
+ * **Details**
+ *
+ * Returning `false` and failing an Effect are shrinkable falsifications. Shrinking preserves which of these two
+ * failure classes caused the initial falsification. Typed error values may change while shrinking and are not compared
+ * for equality. Defects and interruption continue through the returned Effect instead of becoming `CheckResult`
+ * values.
+ *
+ * **Gotchas**
+ *
+ * Properties must treat generated values as immutable. The runner does not clone values before evaluation, so
+ * mutation can change reported shrunk inputs or interfere with shrinking and replay.
+ *
+ * A property must also produce the same outcome for the same input and initial environment. The runner may evaluate
+ * it repeatedly and does not restore mutable services between evaluations. Stateful properties should acquire and
+ * release an independent fixture inside each evaluation.
+ *
+ * @category running
+ * @since 4.0.0
+ */
+export declare function checkEffect<A, E = never, R = never>(self: Arbitrary<A>, property: (value: A) => boolean | Effect.Effect<boolean, E, R>, options?: CheckOptions): Effect.Effect<CheckResult<A, E>, never, R>;
+//# sourceMappingURL=Arbitrary.d.ts.map

package/dist/unstable/arbitrary/Arbitrary.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Arbitrary.d.ts","sourceRoot":"","sources":["../../../src/unstable/arbitrary/Arbitrary.ts"],"names":[],"mappings":"AAMA,OAAO,KAAK,KAAK,MAAM,MAAM,iBAAiB,CAAA;AAC9C,OAAO,KAAK,KAAK,MAAM,MAAM,iBAAiB,CAAA;AAK9C,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAA;AACjD,OAAO,EAAe,KAAK,SAAS,EAAE,KAAK,UAAU,EAAE,MAAM,oBAAoB,CAAA;AACjF,OAAO,KAAK,KAAK,OAAO,MAAM,iBAAiB,CAAA;AAC/C,OAAO,KAAK,KAAK,KAAK,MAAM,gBAAgB,CAAA;AAE5C;;;;;GAKG;AACH,eAAO,MAAM,MAAM,EAAE,MAAwB,CAAA;AAE7C;;;;;GAKG;AACH,MAAM,MAAM,MAAM,GAAG,6BAA6B,CAAA;AAElD;;;;;;;;;;;;;;GAcG;AACH,MAAM,WAAW,SAAS,CAAC,GAAG,CAAC,CAAC,CAAE,SAAQ,QAAQ;IAChD,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;CAGlC;AAED;;;;;;;;;;GAUG;AACH,MAAM,WAAW,aAAa,CAAC,CAAC;IAC9B,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,KAAK,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,CAAA;CAC/D;AAED;;;;;;;;;GASG;AACH,eAAO,MAAM,WAAW,MAAO,OAAO,KAAG,CAAC,IAAI,SAAS,CAAC,OAAO,CAA2B,CAAA;AAE1F;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACnC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IAClC,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACzC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAAA;CAC5C;AAED;;;;;;;;;;GAUG;AACH,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAA;IAC5B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAA;IAC1B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAAA;CAC/B;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,MAAM,MAAM,GAAG,MAAM,CAAA;AAE3B;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IAClC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IAClC,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACzC,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACxC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAAA;IAC3C,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;CACrC;AAED;;;;;GAKG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAA;CAC/B;AAED;;;;;GAKG;AACH,MAAM,WAAW,aAAa,CAAC,GAAG,CAAC,CAAC;IAClC,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAA;IAC9B,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAA;CAClB;AAED;;;;;GAKG;AACH,MAAM,MAAM,eAAe,CAAC,CAAC,IAAI,aAAa,GAAG,aAAa,CAAC,CAAC,CAAC,CAAA;AAEjE;;;;;GAKG;AACH,MAAM,WAAW,MAAM;IACrB,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAA;IACvB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;CAC1B;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,WAAW,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACrC,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAA;IAC1B,QAAQ,CAAC,YAAY,EAAE,CAAC,CAAA;IACxB,QAAQ,CAAC,WAAW,EAAE,CAAC,CAAA;IACvB,QAAQ,CAAC,OAAO,EAAE,eAAe,CAAC,CAAC,CAAC,CAAA;IACpC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;IACxB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CACxB;AAED;;;;;;;;;;GAUG;AACH,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAA;IAC1B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAAA;CAC/B;AAED;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,IAAI,EAAE,gBAAgB,CAAA;IAC/B,QAAQ,CAAC,MAAM,EAAE,kBAAkB,GAAG,gBAAgB,GAAG,uBAAuB,GAAG,cAAc,CAAA;CAClG;AAED;;;;;;;;;GASG;AACH,MAAM,MAAM,WAAW,CAAC,CAAC,EAAE,CAAC,IAAI,MAAM,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,GAAG,cAAc,CAAA;AAErF;;;;;;;;;GASG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,GAAG,SAAS,CAuBtF;AAED;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,MAAM,CAAC,CAAC,SAAS,OAAO,CAAC,UAAU,EACjD,MAAM,EAAE,CAAC,EACT,OAAO,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GACjC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAEtB;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAExD;AAED;;;;;;;;;;GAUG;AACH,eAAO,MAAM,GAAG,EAAE;IAChB;;;;;;;;;;OAUG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,CAAA;IAChE;;;;;;;;;;OAUG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;CACoC,CAAA;AAElG;;;;;;;;;;;;;;;GAeG;AACH,eAAO,MAAM,MAAM,EAAE;IACnB;;;;;;;;;;;;;;;OAeG;IACH,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,CAAA;IACpF;;;;;;;;;;;;;;;OAeG;IACH,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,CAAA;IAC/E;;;;;;;;;;;;;;;OAeG;IACH,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;IAChF;;;;;;;;;;;;;;;OAeG;IACH,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;CAC+C,CAAA;AAE/G;;;;;;;;;;;;;;;;GAgBG;AACH,eAAO,MAAM,SAAS,EAAE;IACtB;;;;;;;;;;;;;;;;OAgBG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,CAAA;IAC1E;;;;;;;;;;;;;;;;OAgBG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;CAIvE,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,eAAO,MAAM,OAAO,EAAE;IACpB;;;;;;;;;;;;;;;;;;;;;;OAsBG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,CAAA;IAC3E;;;;;;;;;;;;;;;;;;;;;;OAsBG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;CACwC,CAAA;AAEjH;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,GAAG,CAAC,KAAK,CAAC,KAAK,SAAS,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,EAC/F,KAAK,EAAE,KAAK,GACX,SAAS,CACV;IAAC,KAAK;CAAC,SAAS,CAAC,aAAa,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG;IAC9C,CAAC,UAAU,CAAC,IAAI,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK;CAClF,GACC,CAAC,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GACzD,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG;IACjD,CAAC,UAAU,CAAC,IAAI,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK;CAClF,GACD,KAAK,CACV,CAEA;AAED;;;;;;;;;GASG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAC5B,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAClB,OAAO,CAAC,EAAE,aAAa,GACtB,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAE9C;AAED;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EACjD,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAClB,QAAQ,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,EAC9D,OAAO,CAAC,EAAE,YAAY,GACrB,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAE5C"}