@databehave/schema 0.1.2 → 0.1.4

package/dist/generator/engine.js

@@ -0,0 +1,575 @@
+/**
+ * Generator engine — turns a SchemaNode + context into a deterministic value.
+ *
+ * Wires the data-schema axes into the sampling pipeline.
+ * Resolution priority during sampling:
+ *
+ *   1. invariants   (rejection-sample until they hold; bounded by MAX_ATTEMPTS)
+ *   2. identity     (handled at dataset layer; not seen here)
+ *   3. derived      (computed from sibling/root context — skip sampling entirely)
+ *   4. conditional  (union / discriminated branch selection)
+ *   5. domain       (closed candidate set)
+ *   6. distribution (weighted / normal / typical)
+ *   7. type         (fall-back bounds from the IR)
+ */
+import { SchemaConflictError } from '../foundation/errors.js';
+import { mulberry32, rngFromString, seedFromString } from '../foundation/prng.js';
+const DEFAULT_SEED = 'databehave';
+const MAX_ATTEMPTS = 100;
+const DEFAULT_MODIFIER_PROBS = { default: 0, optional: 0, nullable: 0 };
+/**
+ * Generate a value that conforms to the given schema.
+ *
+ * Deterministic: identical `schema` + `options.seed` always yields the same
+ * value, on every machine, every run.
+ */
+export const mock = (schema, options = {}) => {
+    const seedKey = typeof options.seed === 'number' ? String(options.seed) : (options.seed ?? DEFAULT_SEED);
+    const prngFactory = options.prng ?? mulberry32;
+    const rng = typeof options.seed === 'number'
+        ? prngFactory(options.seed)
+        : options.prng !== undefined
+            ? prngFactory(seedFromString(seedKey))
+            : rngFromString(seedKey);
+    const probs = {
+        ...DEFAULT_MODIFIER_PROBS,
+        ...(options.modifierProbs ?? {}),
+    };
+    for (const k of ['default', 'optional', 'nullable']) {
+        const p = probs[k];
+        if (!(p >= 0 && p <= 1)) {
+            throw new RangeError(`modifierProbs.${k} must be in [0, 1], got ${p}`);
+        }
+    }
+    const state = {
+        rng,
+        rootSeed: seedKey,
+        root: undefined,
+        modifierProbs: probs,
+        ...(options.input !== undefined ? { input: options.input } : {}),
+        ...(options.index !== undefined ? { rootIndex: options.index } : {}),
+        ...(options.trace !== undefined ? { trace: options.trace } : {}),
+        ...(options.stableBy !== undefined ? { stableBy: options.stableBy } : {}),
+    };
+    const value = generateNode(schema._node, [], EMPTY_PARENT, state);
+    state.root = value;
+    return value;
+};
+/**
+ * Pick the rng to use for a single leaf sample.
+ *
+ * Falls back to the shared `state.rng` unless `stableBy` is configured and
+ * returns a non-empty string for the current node — in which case a fresh
+ * deterministic rng is seeded by `${key}:${path}`.
+ */
+const pickLeafRng = (state, parent, path) => {
+    if (state.stableBy === undefined)
+        return state.rng;
+    const key = state.stableBy(makeCtx(state, parent, path));
+    if (key == null || key === '')
+        return state.rng;
+    return rngFromString(`${key}:${path.join('.')}`);
+};
+const EMPTY_PARENT = Object.freeze({});
+/** Find the nearest numeric element walking the path from the end. */
+const nearestNumericIndex = (path) => {
+    for (let i = path.length - 1; i >= 0; i -= 1) {
+        const seg = path[i];
+        if (typeof seg === 'number')
+            return seg;
+    }
+    return undefined;
+};
+const makeCtx = (state, parent, path) => {
+    const pathIndex = nearestNumericIndex(path);
+    const effectiveIndex = pathIndex ?? state.rootIndex;
+    const ctx = {
+        root: state.root,
+        parent,
+        seed: `${state.rootSeed}:${path.join('.')}`,
+    };
+    if (effectiveIndex !== undefined)
+        ctx.index = effectiveIndex;
+    if (state.input !== undefined)
+        ctx.input = state.input;
+    return ctx;
+};
+// ──────────────────────────────────────────────────────────────────────────
+// pipeline entry
+// ──────────────────────────────────────────────────────────────────────────
+export const generateNode = (node, path, parent, state) => {
+    const mods = node.mods;
+    const axes = mods?.axes;
+    const trace = state.trace;
+    const probs = state.modifierProbs;
+    if (mods?.hasDefault === true && probs.default > 0 && state.rng.next() < probs.default) {
+        trace?.emit({ path, axis: 'default' });
+        return mods.defaultValue;
+    }
+    if (mods?.optional === true && probs.optional > 0 && state.rng.next() < probs.optional) {
+        trace?.emit({ path, axis: 'optional-skip' });
+        return undefined;
+    }
+    if (mods?.nullable === true && probs.nullable > 0 && state.rng.next() < probs.nullable) {
+        trace?.emit({ path, axis: 'nullable-null' });
+        return null;
+    }
+    // derived field — bypass sampling entirely.
+    if (axes?.derived !== undefined) {
+        const v = runDerived(axes.derived, parent, path, state);
+        trace?.emit({ path, axis: 'derived' });
+        return v;
+    }
+    // eventually overrides — fire when ctx.index hits the cadence.
+    const idx = nearestNumericIndex(path) ?? state.rootIndex;
+    const eve = applyEventually(axes?.eventually, idx);
+    if (eve.hit) {
+        trace?.emit({ path, axis: 'eventually' });
+        return eve.value;
+    }
+    // occasionally overrides — stack before base sampling.
+    const occ = applyOccasionally(axes?.occasionally, state.rng);
+    if (occ.hit) {
+        trace?.emit({ path, axis: 'occasionally' });
+        return occ.value;
+    }
+    const invariants = axes?.invariants ?? [];
+    for (let attempt = 0; attempt < MAX_ATTEMPTS; attempt += 1) {
+        const value = sampleByKind(node, axes, path, parent, state);
+        if (invariants.length === 0) {
+            trace?.emit({ path, axis: axisOfSample(node, axes) });
+            return value;
+        }
+        const ctx = makeCtx(state, parent, path);
+        if (invariants.every((inv) => inv(value, ctx))) {
+            trace?.emit({ path, axis: 'invariant-pass', attempts: attempt + 1 });
+            return value;
+        }
+    }
+    trace?.emit({ path, axis: 'invariant-fail', attempts: MAX_ATTEMPTS });
+    throw new SchemaConflictError(`invariant unsatisfied after ${MAX_ATTEMPTS} attempts`, path, 'relax the invariant or narrow the distribution / domain');
+};
+/** Classify which sampling axis was used (for trace annotations). */
+const axisOfSample = (node, axes) => {
+    if (axes?.domain !== undefined)
+        return 'domain';
+    if (axes?.distribution !== undefined)
+        return 'distribution';
+    // composite kinds are bucketed under 'type' since their children get their own entries.
+    void node;
+    return 'type';
+};
+const runDerived = (fn, parent, path, state) => {
+    return fn(makeCtx(state, parent, path));
+};
+const applyOccasionally = (overrides, rng) => {
+    if (overrides === undefined)
+        return { hit: false };
+    for (const o of overrides) {
+        if (rng.next() < o.p)
+            return { hit: true, value: o.value };
+    }
+    return { hit: false };
+};
+const applyEventually = (overrides, index) => {
+    if (overrides === undefined || index === undefined)
+        return { hit: false };
+    for (const o of overrides) {
+        const offset = o.offset ?? 0;
+        if (((index - offset) % o.every + o.every) % o.every === 0 && index >= offset) {
+            return { hit: true, value: o.value };
+        }
+    }
+    return { hit: false };
+};
+// ──────────────────────────────────────────────────────────────────────────
+// per-kind sampling
+// ──────────────────────────────────────────────────────────────────────────
+const sampleByKind = (node, axes, path, parent, state) => {
+    // Leaf sampling may use a stable per-path rng if `stableBy` opts in.
+    // Composites (object/array/tuple/union) keep using `state.rng` for shape
+    // decisions (length, branch); their children re-enter this fn and may opt-in.
+    const leafRng = () => pickLeafRng(state, parent, path);
+    if (axes?.domain !== undefined) {
+        const fromDomain = sampleFromDomain(axes.domain, axes.distribution, parent, leafRng());
+        if (fromDomain !== undefined)
+            return fromDomain;
+    }
+    switch (node.kind) {
+        case 'string':
+            return genString(node, leafRng());
+        case 'number':
+            return genNumber(node, axes?.distribution, leafRng(), path);
+        case 'decimal':
+            return genDecimal(node, axes?.distribution, leafRng(), path);
+        case 'boolean':
+            return leafRng().next() < 0.5;
+        case 'null':
+            return null;
+        case 'literal':
+            return node.value;
+        case 'enum':
+            return sampleDiscrete(node.values, axes?.distribution, leafRng());
+        case 'array':
+            return genArray(node, path, state);
+        case 'object':
+            return genObject(node, path, state);
+        case 'tuple':
+            return node.items.map((item, i) => generateNode(item, [...path, i], parent, state));
+        case 'union': {
+            const choice = state.rng.pick(node.options);
+            return generateNode(choice, path, parent, state);
+        }
+        case 'discriminated': {
+            const tags = Object.keys(node.branches);
+            if (tags.length === 0) {
+                throw new SchemaConflictError(`discriminated: empty branches map`, path, 'declare at least one branch in `discriminated({...})`');
+            }
+            // Branch selection honours a weighted distribution on tags when declared.
+            let tag;
+            if (axes?.distribution?.kind === 'weighted') {
+                const filtered = axes.distribution.weights.filter(([v]) => tags.includes(String(v)));
+                const picked = filtered.length > 0 ? pickWeighted(filtered, state.rng) : undefined;
+                tag = picked ?? state.rng.pick(tags);
+            }
+            else {
+                tag = state.rng.pick(tags);
+            }
+            const branch = node.branches[tag];
+            return generateNode(branch, path, parent, state);
+        }
+    }
+};
+// ──────────────────────────────────────────────────────────────────────────
+// domain / distribution helpers
+// ──────────────────────────────────────────────────────────────────────────
+const sampleFromDomain = (domain, dist, parent, rng) => {
+    if (domain.kind === 'values') {
+        if (domain.values.length === 0)
+            return undefined;
+        // If a weighted distribution is declared, honour it by picking only
+        // weights whose value also lives in the domain.
+        if (dist?.kind === 'weighted') {
+            const filtered = dist.weights.filter(([v]) => domain.values.includes(v));
+            if (filtered.length > 0) {
+                const picked = pickWeighted(filtered, rng);
+                if (picked !== undefined)
+                    return picked;
+            }
+        }
+        return rng.pick(domain.values);
+    }
+    const keyVal = parent[domain.fromField];
+    if (typeof keyVal !== 'string')
+        return undefined;
+    const candidates = domain.map[keyVal];
+    if (candidates === undefined || candidates.length === 0)
+        return undefined;
+    if (dist?.kind === 'weighted') {
+        const filtered = dist.weights.filter(([v]) => candidates.includes(v));
+        if (filtered.length > 0) {
+            const picked = pickWeighted(filtered, rng);
+            if (picked !== undefined)
+                return picked;
+        }
+    }
+    return rng.pick(candidates);
+};
+const sampleDiscrete = (values, dist, rng) => {
+    if (dist?.kind === 'weighted') {
+        const picked = pickWeighted(dist.weights, rng);
+        if (picked !== undefined && (typeof picked === 'string' || typeof picked === 'number')) {
+            return picked;
+        }
+    }
+    return rng.pick(values);
+};
+const pickWeighted = (weights, rng) => {
+    let total = 0;
+    for (const [, w] of weights)
+        total += Math.max(0, w);
+    if (total <= 0)
+        return undefined;
+    let r = rng.next() * total;
+    for (const [v, w] of weights) {
+        r -= Math.max(0, w);
+        if (r <= 0)
+            return v;
+    }
+    return weights[weights.length - 1]?.[0];
+};
+const sampleNormal = (mean, stddev, rng) => {
+    const u1 = Math.max(rng.next(), Number.EPSILON);
+    const u2 = rng.next();
+    const z = Math.sqrt(-2 * Math.log(u1)) * Math.cos(2 * Math.PI * u2);
+    return mean + z * stddev;
+};
+const clamp = (n, min, max) => n < min ? min : n > max ? max : n;
+// ──────────────────────────────────────────────────────────────────────────
+// per-type
+// ──────────────────────────────────────────────────────────────────────────
+const ALPHANUM = 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789';
+// Slightly extended alphabet used only when a `pattern` is declared. Adds
+// digits-only / lowercase-only fragments more aggressively so common
+// rejection-sampler targets (`^\d+$`, `^[a-z0-9_-]+$`, hyphen-separated
+// slugs) converge within `PATTERN_MAX_ATTEMPTS`. Keep ASCII-only so the
+// produced length matches the requested `min`/`max` byte-for-byte.
+//
+// Uppercase letters and `.` are included so common patterns like
+// `^[A-Z]+$`, `^[A-Z0-9_]+$` and dotted version-like tokens can
+// converge — without them the rejection sampler exhausts
+// `PATTERN_MAX_ATTEMPTS` and throws. Callers who want a stricter
+// alphabet should still prefer `.in([...])` for exact enumerations.
+const PATTERN_ALPHABET = 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789-_.';
+// Bumped from 200 → 1000. Patterns that include literal characters
+// occurring rarely in the alphabet (e.g. `(a+)+b` requiring "a..b" as a
+// substring of a length-8 random string has ~0.2% per-attempt match
+// probability) converge unreliably at 200. 1000 attempts still complete
+// in well under a millisecond on a satisfiable pattern and only delay
+// the error path on unsatisfiable ones — the failure mode the test
+// suite cares about (`.in([...])` hint surfaces in the thrown message).
+const PATTERN_MAX_ATTEMPTS = 1000;
+/**
+ * Bias the random-sampling alphabet toward literal characters that
+ * appear in the regex source. Each ASCII alphanumeric literal that
+ * survives a *very* shallow parse (skipping escapes and char-class
+ * bodies — we only need rough bias, not correctness) is repeated
+ * `PATTERN_LITERAL_BIAS_WEIGHT` times in the working alphabet so that
+ * uniform-index draws hit it more often. This is intentionally crude:
+ * patterns that need exact enumeration belong on `.in([...])`.
+ */
+const PATTERN_LITERAL_BIAS_WEIGHT = 8;
+const biasAlphabetForPattern = (pattern) => {
+    const literals = new Set();
+    for (let i = 0; i < pattern.length; i += 1) {
+        const ch = pattern[i];
+        // Skip backslash-escaped sequences entirely — they encode meta
+        // classes (`\d`, `\w`) not literal characters.
+        if (ch === '\\') {
+            i += 1;
+            continue;
+        }
+        // Regex metacharacters that are never literal matches.
+        if ('()[]{}|.+*?^$'.includes(ch))
+            continue;
+        // Use only ASCII alphanumerics to bias; symbols introduce noise.
+        if (/[A-Za-z0-9]/.test(ch))
+            literals.add(ch);
+    }
+    if (literals.size === 0)
+        return PATTERN_ALPHABET;
+    return PATTERN_ALPHABET + [...literals].join('').repeat(PATTERN_LITERAL_BIAS_WEIGHT);
+};
+const genString = (node, rng) => {
+    const minLen = node.min ?? 4;
+    const maxLen = node.max ?? Math.max(minLen, 12);
+    if (node.pattern !== undefined) {
+        let re;
+        try {
+            re = new RegExp(node.pattern);
+        }
+        catch (err) {
+            throw new SchemaConflictError(`string: invalid pattern /${node.pattern}/: ${err.message}`, [], 'fix the pattern or drop it');
+        }
+        // Bias the alphabet toward literal characters appearing in the
+        // regex source. For patterns like `(a+)+b` requiring "a..b" in
+        // the output, uniform sampling from a 64-char alphabet has a
+        // ~0.2% per-attempt match rate; biasing toward 'a' and 'b'
+        // raises convergence to >95% within ~50 attempts. The bias is
+        // intentionally crude (literal ASCII chars only, no char-class
+        // analysis) — patterns that need precise enumeration should
+        // still prefer `.in([...])`.
+        const biased = biasAlphabetForPattern(node.pattern);
+        for (let attempt = 0; attempt < PATTERN_MAX_ATTEMPTS; attempt += 1) {
+            const len = rng.int(minLen, maxLen);
+            let candidate = '';
+            for (let i = 0; i < len; i += 1) {
+                candidate += biased[rng.int(0, biased.length - 1)];
+            }
+            if (re.test(candidate))
+                return candidate;
+        }
+        throw new SchemaConflictError(`string: could not satisfy pattern /${node.pattern}/ after ${PATTERN_MAX_ATTEMPTS} attempts`, [], 'use `.in([...])` to enumerate concrete values, or relax the pattern');
+    }
+    const len = rng.int(minLen, maxLen);
+    let out = '';
+    for (let i = 0; i < len; i += 1)
+        out += ALPHANUM[rng.int(0, ALPHANUM.length - 1)];
+    return out;
+};
+const genNumber = (node, dist, rng, path) => {
+    const min = node.min ?? 0;
+    const max = node.max ?? (node.int ? 100 : 1);
+    if (min > max) {
+        throw new SchemaConflictError(`number: min (${min}) > max (${max})`, path, 'swap min/max');
+    }
+    let raw;
+    if (dist?.kind === 'normal') {
+        raw = clamp(sampleNormal(dist.mean, dist.stddev, rng), min, max);
+    }
+    else if (dist?.kind === 'typical') {
+        const from = clamp(dist.from, min, max);
+        const to = clamp(dist.to, min, max);
+        raw = from + rng.next() * (to - from);
+    }
+    else if (node.int) {
+        return rng.int(min, max);
+    }
+    else {
+        return min + rng.next() * (max - min);
+    }
+    return node.int ? Math.round(raw) : raw;
+};
+const genDecimal = (node, dist, rng, path) => {
+    const minStr = node.min ?? '0';
+    const maxStr = node.max ?? defaultDecimalMax(node.precision, node.scale);
+    if (!isNumericString(minStr) || !isNumericString(maxStr)) {
+        throw new SchemaConflictError(`decimal: non-numeric bounds min=${minStr} max=${maxStr}`, path);
+    }
+    const scale = node.scale;
+    const scaleFactor = 10n ** BigInt(scale);
+    const minScaled = toScaledBigInt(minStr, scale);
+    const maxScaled = toScaledBigInt(maxStr, scale);
+    if (minScaled > maxScaled) {
+        throw new SchemaConflictError(`decimal: min (${minStr}) > max (${maxStr})`, path, 'swap min/max');
+    }
+    // For weighted distributions on decimals we honour the discrete-value path
+    // upstream; here we focus on continuous distributions.
+    let scaledValue;
+    if (dist?.kind === 'normal' || dist?.kind === 'typical') {
+        // Continuous distributions remain double-precision (approximate); the
+        // result is rounded to the declared scale.
+        const minN = Number(minStr);
+        const maxN = Number(maxStr);
+        let v;
+        if (dist.kind === 'normal') {
+            v = clamp(sampleNormal(dist.mean, dist.stddev, rng), minN, maxN);
+        }
+        else {
+            const from = clamp(dist.from, minN, maxN);
+            const to = clamp(dist.to, minN, maxN);
+            v = from + rng.next() * (to - from);
+        }
+        // Round half-away-from-zero in BigInt space to preserve the requested scale.
+        scaledValue = roundToScaledBigInt(v, scale);
+        // Clamp into integer bounds in case of double rounding error.
+        if (scaledValue < minScaled)
+            scaledValue = minScaled;
+        if (scaledValue > maxScaled)
+            scaledValue = maxScaled;
+    }
+    else {
+        // Uniform over [minScaled, maxScaled] in BigInt space → full precision.
+        scaledValue = randomBigIntInclusive(rng, minScaled, maxScaled);
+    }
+    return formatScaledBigInt(scaledValue, scaleFactor, scale);
+};
+const isNumericString = (s) => /^-?\d+(\.\d+)?$/.test(s);
+const toScaledBigInt = (s, scale) => {
+    const negative = s.startsWith('-');
+    const body = negative ? s.slice(1) : s;
+    const [intPart, fracPart = ''] = body.split('.');
+    const fracTrunc = fracPart.slice(0, scale);
+    const fracPadded = fracTrunc + '0'.repeat(scale - fracTrunc.length);
+    const digits = (intPart ?? '0') + fracPadded;
+    const magnitude = BigInt(digits.length === 0 ? '0' : digits);
+    return negative ? -magnitude : magnitude;
+};
+const roundToScaledBigInt = (v, scale) => {
+    // Use a string round-trip so we don't truncate magnitudes above 2^53.
+    const fixed = v.toFixed(scale);
+    return toScaledBigInt(fixed, scale);
+};
+const randomBigIntInclusive = (rng, lo, hi) => {
+    if (lo === hi)
+        return lo;
+    const range = hi - lo + 1n;
+    // Rejection-sample a non-negative BigInt < range using 32-bit RNG chunks.
+    let bits = 0;
+    for (let tmp = range - 1n; tmp > 0n; tmp >>= 1n)
+        bits += 1;
+    const chunks = Math.ceil(bits / 32);
+    for (let attempt = 0; attempt < 64; attempt += 1) {
+        let r = 0n;
+        for (let i = 0; i < chunks; i += 1) {
+            // rng.next() ∈ [0, 1); multiply by 2^32 → integer u32.
+            const u32 = BigInt(Math.floor(rng.next() * 0x100000000));
+            r = (r << 32n) | u32;
+        }
+        // Mask to the smallest power of two ≥ range.
+        const mask = (1n << BigInt(bits)) - 1n;
+        r &= mask;
+        if (r < range)
+            return lo + r;
+    }
+    /* node:coverage disable */
+    // Fallback (statistically improbable: 64 consecutive rejections imply the
+    // bit-mask is at most a hair larger than `range`, i.e. probability ≤ 2^-64).
+    // Modulo bias is acceptable given the negligible activation rate.
+    return lo + ((randomU64(rng) % range + range) % range);
+};
+const randomU64 = (rng) => {
+    const hi = BigInt(Math.floor(rng.next() * 0x100000000));
+    const lo = BigInt(Math.floor(rng.next() * 0x100000000));
+    return (hi << 32n) | lo;
+};
+/* node:coverage enable */
+const formatScaledBigInt = (scaled, scaleFactor, scale) => {
+    const negative = scaled < 0n;
+    const abs = negative ? -scaled : scaled;
+    if (scale === 0)
+        return (negative ? '-' : '') + abs.toString();
+    const intPart = abs / scaleFactor;
+    const fracPart = abs % scaleFactor;
+    const fracStr = fracPart.toString().padStart(scale, '0');
+    return (negative ? '-' : '') + intPart.toString() + '.' + fracStr;
+};
+const defaultDecimalMax = (precision, scale) => {
+    const intDigits = precision - scale;
+    return '9'.repeat(Math.max(intDigits, 1));
+};
+const genArray = (node, path, state) => {
+    let len;
+    if (node.length !== undefined) {
+        len = node.length;
+    }
+    else {
+        const minL = node.minLength ?? 1;
+        const maxL = node.maxLength ?? Math.max(minL, 5);
+        if (minL > maxL) {
+            throw new SchemaConflictError(`array: minLength (${minL}) > maxLength (${maxL})`, path);
+        }
+        len = state.rng.int(minL, maxL);
+    }
+    const out = [];
+    for (let i = 0; i < len; i += 1) {
+        out.push(generateNode(node.item, [...path, i], EMPTY_PARENT, state));
+    }
+    return out;
+};
+const genObject = (node, path, state) => {
+    // Two-pass: non-derived first (so derived can read them), derived last.
+    const keys = Object.keys(node.fields);
+    const derivedKeys = [];
+    const out = {};
+    for (const key of keys) {
+        const field = node.fields[key];
+        if (field.mods?.axes?.derived !== undefined) {
+            derivedKeys.push(key);
+            continue;
+        }
+        const value = generateNode(field, [...path, key], out, state);
+        if (value === undefined && field.mods?.optional === true)
+            continue;
+        out[key] = value;
+    }
+    for (const key of derivedKeys) {
+        const field = node.fields[key];
+        const value = generateNode(field, [...path, key], out, state);
+        if (value === undefined && field.mods?.optional === true)
+            continue;
+        out[key] = value;
+    }
+    return out;
+};
+//# sourceMappingURL=engine.js.map

package/dist/generator/engine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"engine.js","sourceRoot":"","sources":["../../src/generator/engine.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAWH,OAAO,EAAE,mBAAmB,EAAE,MAAM,yBAAyB,CAAA;AAE7D,OAAO,EAAE,UAAU,EAAE,aAAa,EAAE,cAAc,EAAY,MAAM,uBAAuB,CAAA;AAqE3F,MAAM,YAAY,GAAG,YAAY,CAAA;AACjC,MAAM,YAAY,GAAG,GAAG,CAAA;AACxB,MAAM,sBAAsB,GAA4B,EAAE,OAAO,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAA;AAEhG;;;;;GAKG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAAmB,MAAS,EAAE,UAAuB,EAAE,EAAY,EAAE;IACvF,MAAM,OAAO,GACX,OAAO,OAAO,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,IAAI,YAAY,CAAC,CAAA;IAC1F,MAAM,WAAW,GAAG,OAAO,CAAC,IAAI,IAAI,UAAU,CAAA;IAC9C,MAAM,GAAG,GACP,OAAO,OAAO,CAAC,IAAI,KAAK,QAAQ;QAC9B,CAAC,CAAC,WAAW,CAAC,OAAO,CAAC,IAAI,CAAC;QAC3B,CAAC,CAAC,OAAO,CAAC,IAAI,KAAK,SAAS;YAC1B,CAAC,CAAC,WAAW,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;YACtC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAA;IAC9B,MAAM,KAAK,GAA4B;QACrC,GAAG,sBAAsB;QACzB,GAAG,CAAC,OAAO,CAAC,aAAa,IAAI,EAAE,CAAC;KACjC,CAAA;IACD,KAAK,MAAM,CAAC,IAAI,CAAC,SAAS,EAAE,UAAU,EAAE,UAAU,CAAU,EAAE,CAAC;QAC7D,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;QAClB,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,UAAU,CAAC,iBAAiB,CAAC,2BAA2B,CAAC,EAAE,CAAC,CAAA;QACxE,CAAC;IACH,CAAC;IACD,MAAM,KAAK,GAAa;QACtB,GAAG;QACH,QAAQ,EAAE,OAAO;QACjB,IAAI,EAAE,SAAS;QACf,aAAa,EAAE,KAAK;QACpB,GAAG,CAAC,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAChE,GAAG,CAAC,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACpE,GAAG,CAAC,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAChE,GAAG,CAAC,OAAO,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC1E,CAAA;IACD,MAAM,KAAK,GAAG,YAAY,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,EAAE,YAAY,EAAE,KAAK,CAAC,CAAA;IACjE,KAAK,CAAC,IAAI,GAAG,KAAK,CAAA;IAClB,OAAO,KAAiB,CAAA;AAC1B,CAAC,CAAA;AAiBD;;;;;;GAMG;AACH,MAAM,WAAW,GAAG,CAClB,KAAe,EACf,MAAyC,EACzC,IAAkC,EAC7B,EAAE;IACP,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC,GAAG,CAAA;IAClD,MAAM,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,CAAA;IACxD,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,KAAK,EAAE;QAAE,OAAO,KAAK,CAAC,GAAG,CAAA;IAC/C,OAAO,aAAa,CAAC,GAAG,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;AAClD,CAAC,CAAA;AAED,MAAM,YAAY,GAAsC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;AAEzE,sEAAsE;AACtE,MAAM,mBAAmB,GAAG,CAAC,IAAkC,EAAsB,EAAE;IACrF,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC7C,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;QACnB,IAAI,OAAO,GAAG,KAAK,QAAQ;YAAE,OAAO,GAAG,CAAA;IACzC,CAAC;IACD,OAAO,SAAS,CAAA;AAClB,CAAC,CAAA;AAED,MAAM,OAAO,GAAG,CACd,KAAe,EACf,MAAyC,EACzC,IAAkC,EACtB,EAAE;IACd,MAAM,SAAS,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAA;IAC3C,MAAM,cAAc,GAAG,SAAS,IAAI,KAAK,CAAC,SAAS,CAAA;IACnD,MAAM,GAAG,GAML;QACF,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,MAAM;QACN,IAAI,EAAE,GAAG,KAAK,CAAC,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE;KAC5C,CAAA;IACD,IAAI,cAAc,KAAK,SAAS;QAAE,GAAG,CAAC,KAAK,GAAG,cAAc,CAAA;IAC5D,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS;QAAE,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAA;IACtD,OAAO,GAAG,CAAA;AACZ,CAAC,CAAA;AAED,6EAA6E;AAC7E,iBAAiB;AACjB,6EAA6E;AAE7E,MAAM,CAAC,MAAM,YAAY,GAAG,CAC1B,IAAgB,EAChB,IAAkC,EAClC,MAAyC,EACzC,KAAe,EACN,EAAE;IACX,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;IACtB,MAAM,IAAI,GAAqB,IAAI,EAAE,IAAI,CAAA;IACzC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAA;IAEzB,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAA;IACjC,IAAI,IAAI,EAAE,UAAU,KAAK,IAAI,IAAI,KAAK,CAAC,OAAO,GAAG,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;QACvF,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAA;QACtC,OAAO,IAAI,CAAC,YAAY,CAAA;IAC1B,CAAC;IACD,IAAI,IAAI,EAAE,QAAQ,KAAK,IAAI,IAAI,KAAK,CAAC,QAAQ,GAAG,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;QACvF,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,eAAe,EAAE,CAAC,CAAA;QAC5C,OAAO,SAAS,CAAA;IAClB,CAAC;IACD,IAAI,IAAI,EAAE,QAAQ,KAAK,IAAI,IAAI,KAAK,CAAC,QAAQ,GAAG,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;QACvF,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,eAAe,EAAE,CAAC,CAAA;QAC5C,OAAO,IAAI,CAAA;IACb,CAAC;IAED,4CAA4C;IAC5C,IAAI,IAAI,EAAE,OAAO,KAAK,SAAS,EAAE,CAAC;QAChC,MAAM,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;QACvD,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAA;QACtC,OAAO,CAAC,CAAA;IACV,CAAC;IAED,+DAA+D;IAC/D,MAAM,GAAG,GAAG,mBAAmB,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,SAAS,CAAA;IACxD,MAAM,GAAG,GAAG,eAAe,CAAC,IAAI,EAAE,UAAU,EAAE,GAAG,CAAC,CAAA;IAClD,IAAI,GAAG,CAAC,GAAG,EAAE,CAAC;QACZ,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC,CAAA;QACzC,OAAO,GAAG,CAAC,KAAK,CAAA;IAClB,CAAC;IAED,uDAAuD;IACvD,MAAM,GAAG,GAAG,iBAAiB,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,CAAC,GAAG,CAAC,CAAA;IAC5D,IAAI,GAAG,CAAC,GAAG,EAAE,CAAC;QACZ,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC,CAAA;QAC3C,OAAO,GAAG,CAAC,KAAK,CAAA;IAClB,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,EAAE,UAAU,IAAI,EAAE,CAAA;IACzC,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,YAAY,EAAE,OAAO,IAAI,CAAC,EAAE,CAAC;QAC3D,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAA;QAC3D,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,CAAA;YACrD,OAAO,KAAK,CAAA;QACd,CAAC;QACD,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,CAAA;QACxC,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;YAC/C,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,gBAAgB,EAAE,QAAQ,EAAE,OAAO,GAAG,CAAC,EAAE,CAAC,CAAA;YACpE,OAAO,KAAK,CAAA;QACd,CAAC;IACH,CAAC;IAED,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,gBAAgB,EAAE,QAAQ,EAAE,YAAY,EAAE,CAAC,CAAA;IACrE,MAAM,IAAI,mBAAmB,CAC3B,+BAA+B,YAAY,WAAW,EACtD,IAAI,EACJ,yDAAyD,CAC1D,CAAA;AACH,CAAC,CAAA;AAED,qEAAqE;AACrE,MAAM,YAAY,GAAG,CAAC,IAAgB,EAAE,IAAsB,EAAsC,EAAE;IACpG,IAAI,IAAI,EAAE,MAAM,KAAK,SAAS;QAAE,OAAO,QAAQ,CAAA;IAC/C,IAAI,IAAI,EAAE,YAAY,KAAK,SAAS;QAAE,OAAO,cAAc,CAAA;IAC3D,wFAAwF;IACxF,KAAK,IAAI,CAAA;IACT,OAAO,MAAM,CAAA;AACf,CAAC,CAAA;AAED,MAAM,UAAU,GAAG,CACjB,EAAa,EACb,MAAyC,EACzC,IAAkC,EAClC,KAAe,EACN,EAAE;IACX,OAAO,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,CAAA;AACzC,CAAC,CAAA;AAED,MAAM,iBAAiB,GAAG,CACxB,SAAoD,EACpD,GAAQ,EACwC,EAAE;IAClD,IAAI,SAAS,KAAK,SAAS;QAAE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,CAAA;IAClD,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,IAAI,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAA;IAC5D,CAAC;IACD,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,CAAA;AACvB,CAAC,CAAA;AAED,MAAM,eAAe,GAAG,CACtB,SAAoD,EACpD,KAAyB,EACuB,EAAE;IAClD,IAAI,SAAS,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,CAAA;IACzE,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAA;QAC5B,IAAI,CAAC,CAAC,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,KAAK,CAAC,IAAI,KAAK,IAAI,MAAM,EAAE,CAAC;YAC9E,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAA;QACtC,CAAC;IACH,CAAC;IACD,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,CAAA;AACvB,CAAC,CAAA;AAED,6EAA6E;AAC7E,oBAAoB;AACpB,6EAA6E;AAE7E,MAAM,YAAY,GAAG,CACnB,IAAgB,EAChB,IAAsB,EACtB,IAAkC,EAClC,MAAyC,EACzC,KAAe,EACN,EAAE;IACX,qEAAqE;IACrE,yEAAyE;IACzE,8EAA8E;IAC9E,MAAM,OAAO,GAAG,GAAQ,EAAE,CAAC,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,CAAA;IAE3D,IAAI,IAAI,EAAE,MAAM,KAAK,SAAS,EAAE,CAAC;QAC/B,MAAM,UAAU,GAAG,gBAAgB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,CAAA;QACtF,IAAI,UAAU,KAAK,SAAS;YAAE,OAAO,UAAU,CAAA;IACjD,CAAC;IAED,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,QAAQ;YACX,OAAO,SAAS,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,CAAA;QACnC,KAAK,QAAQ;YACX,OAAO,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,YAAY,EAAE,OAAO,EAAE,EAAE,IAAI,CAAC,CAAA;QAC7D,KAAK,SAAS;YACZ,OAAO,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,YAAY,EAAE,OAAO,EAAE,EAAE,IAAI,CAAC,CAAA;QAC9D,KAAK,SAAS;YACZ,OAAO,OAAO,EAAE,CAAC,IAAI,EAAE,GAAG,GAAG,CAAA;QAC/B,KAAK,MAAM;YACT,OAAO,IAAI,CAAA;QACb,KAAK,SAAS;YACZ,OAAO,IAAI,CAAC,KAAK,CAAA;QACnB,KAAK,MAAM;YACT,OAAO,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC,CAAA;QACnE,KAAK,OAAO;YACV,OAAO,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;QACpC,KAAK,QAAQ;YACX,OAAO,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;QACrC,KAAK,OAAO;YACV,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC,CAAA;QACrF,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;YAC3C,OAAO,YAAY,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAA;QAClD,CAAC;QACD,KAAK,eAAe,CAAC,CAAC,CAAC;YACrB,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;YACvC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACtB,MAAM,IAAI,mBAAmB,CAC3B,mCAAmC,EACnC,IAAI,EACJ,uDAAuD,CACxD,CAAA;YACH,CAAC;YACD,0EAA0E;YAC1E,IAAI,GAAW,CAAA;YACf,IAAI,IAAI,EAAE,YAAY,EAAE,IAAI,KAAK,UAAU,EAAE,CAAC;gBAC5C,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;gBACpF,MAAM,MAAM,GACV,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAE,YAAY,CAAC,QAAQ,EAAE,KAAK,CAAC,GAAG,CAAwB,CAAC,CAAC,CAAC,SAAS,CAAA;gBAC7F,GAAG,GAAG,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACtC,CAAC;iBAAM,CAAC;gBACN,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAC5B,CAAC;YACD,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAe,CAAA;YAC/C,OAAO,YAAY,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAA;QAClD,CAAC;IACH,CAAC;AACH,CAAC,CAAA;AAED,6EAA6E;AAC7E,gCAAgC;AAChC,6EAA6E;AAE7E,MAAM,gBAAgB,GAAG,CACvB,MAAwB,EACxB,IAA8B,EAC9B,MAAyC,EACzC,GAAQ,EACa,EAAE;IACvB,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC7B,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAA;QAChD,oEAAoE;QACpE,gDAAgD;QAChD,IAAI,IAAI,EAAE,IAAI,KAAK,UAAU,EAAE,CAAC;YAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAY,CAAC,CAAC,CAAA;YACnF,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,MAAM,MAAM,GAAG,YAAY,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAA;gBAC1C,IAAI,MAAM,KAAK,SAAS;oBAAE,OAAO,MAAM,CAAA;YACzC,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;IAChC,CAAC;IACD,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAA;IACvC,IAAI,OAAO,MAAM,KAAK,QAAQ;QAAE,OAAO,SAAS,CAAA;IAChD,MAAM,UAAU,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;IACrC,IAAI,UAAU,KAAK,SAAS,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAA;IACzE,IAAI,IAAI,EAAE,IAAI,KAAK,UAAU,EAAE,CAAC;QAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAY,CAAC,CAAC,CAAA;QAChF,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,YAAY,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAA;YAC1C,IAAI,MAAM,KAAK,SAAS;gBAAE,OAAO,MAAM,CAAA;QACzC,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;AAC7B,CAAC,CAAA;AAED,MAAM,cAAc,GAAG,CACrB,MAAoC,EACpC,IAA8B,EAC9B,GAAQ,EACS,EAAE;IACnB,IAAI,IAAI,EAAE,IAAI,KAAK,UAAU,EAAE,CAAC;QAC9B,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,CAAC,CAAA;QAC9C,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,OAAO,MAAM,KAAK,QAAQ,IAAI,OAAO,MAAM,KAAK,QAAQ,CAAC,EAAE,CAAC;YACvF,OAAO,MAAM,CAAA;QACf,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;AACzB,CAAC,CAAA;AAED,MAAM,YAAY,GAAG,CACnB,OAAkD,EAClD,GAAQ,EACa,EAAE;IACvB,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO;QAAE,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACpD,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,SAAS,CAAA;IAChC,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,GAAG,KAAK,CAAA;IAC1B,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO,EAAE,CAAC;QAC7B,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QACnB,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO,CAAC,CAAA;IACtB,CAAC;IACD,OAAO,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;AACzC,CAAC,CAAA;AAED,MAAM,YAAY,GAAG,CAAC,IAAY,EAAE,MAAc,EAAE,GAAQ,EAAU,EAAE;IACtE,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,MAAM,CAAC,OAAO,CAAC,CAAA;IAC/C,MAAM,EAAE,GAAG,GAAG,CAAC,IAAI,EAAE,CAAA;IACrB,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAA;IACnE,OAAO,IAAI,GAAG,CAAC,GAAG,MAAM,CAAA;AAC1B,CAAC,CAAA;AAED,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,GAAW,EAAE,GAAW,EAAU,EAAE,CAC5D,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;AAEnC,6EAA6E;AAC7E,WAAW;AACX,6EAA6E;AAE7E,MAAM,QAAQ,GAAG,gEAAgE,CAAA;AACjF,0EAA0E;AAC1E,qEAAqE;AACrE,wEAAwE;AACxE,wEAAwE;AACxE,mEAAmE;AACnE,EAAE;AACF,iEAAiE;AACjE,gEAAgE;AAChE,yDAAyD;AACzD,iEAAiE;AACjE,oEAAoE;AACpE,MAAM,gBAAgB,GAAG,mEAAmE,CAAA;AAC5F,mEAAmE;AACnE,wEAAwE;AACxE,oEAAoE;AACpE,wEAAwE;AACxE,sEAAsE;AACtE,mEAAmE;AACnE,wEAAwE;AACxE,MAAM,oBAAoB,GAAG,IAAI,CAAA;AAEjC;;;;;;;;GAQG;AACH,MAAM,2BAA2B,GAAG,CAAC,CAAA;AAErC,MAAM,sBAAsB,GAAG,CAAC,OAAe,EAAU,EAAE;IACzD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAA;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3C,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAE,CAAA;QACtB,+DAA+D;QAC/D,+CAA+C;QAC/C,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;YAChB,CAAC,IAAI,CAAC,CAAA;YACN,SAAQ;QACV,CAAC;QACD,uDAAuD;QACvD,IAAI,eAAe,CAAC,QAAQ,CAAC,EAAE,CAAC;YAAE,SAAQ;QAC1C,iEAAiE;QACjE,IAAI,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;IAC9C,CAAC;IACD,IAAI,QAAQ,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,gBAAgB,CAAA;IAChD,OAAO,gBAAgB,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,2BAA2B,CAAC,CAAA;AACtF,CAAC,CAAA;AAED,MAAM,SAAS,GAAG,CAChB,IAA6C,EAC7C,GAAQ,EACA,EAAE;IACV,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,CAAA;IAC5B,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,CAAA;IAE/C,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;QAC/B,IAAI,EAAU,CAAA;QACd,IAAI,CAAC;YACH,EAAE,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QAC/B,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,MAAM,IAAI,mBAAmB,CAC3B,4BAA4B,IAAI,CAAC,OAAO,MAAO,GAAa,CAAC,OAAO,EAAE,EACtE,EAAE,EACF,4BAA4B,CAC7B,CAAA;QACH,CAAC;QACD,+DAA+D;QAC/D,+DAA+D;QAC/D,6DAA6D;QAC7D,2DAA2D;QAC3D,8DAA8D;QAC9D,+DAA+D;QAC/D,4DAA4D;QAC5D,6BAA6B;QAC7B,MAAM,MAAM,GAAG,sBAAsB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QACnD,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,oBAAoB,EAAE,OAAO,IAAI,CAAC,EAAE,CAAC;YACnE,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;YACnC,IAAI,SAAS,GAAG,EAAE,CAAA;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBAChC,SAAS,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAA;YACpD,CAAC;YACD,IAAI,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC;gBAAE,OAAO,SAAS,CAAA;QAC1C,CAAC;QACD,MAAM,IAAI,mBAAmB,CAC3B,sCAAsC,IAAI,CAAC,OAAO,WAAW,oBAAoB,WAAW,EAC5F,EAAE,EACF,qEAAqE,CACtE,CAAA;IACH,CAAC;IAED,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IACnC,IAAI,GAAG,GAAG,EAAE,CAAA;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC;QAAE,GAAG,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAA;IACjF,OAAO,GAAG,CAAA;AACZ,CAAC,CAAA;AAED,MAAM,SAAS,GAAG,CAChB,IAA6C,EAC7C,IAA8B,EAC9B,GAAQ,EACR,IAAkC,EAC1B,EAAE;IACV,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,CAAA;IACzB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAC5C,IAAI,GAAG,GAAG,GAAG,EAAE,CAAC;QACd,MAAM,IAAI,mBAAmB,CAAC,gBAAgB,GAAG,YAAY,GAAG,GAAG,EAAE,IAAI,EAAE,cAAc,CAAC,CAAA;IAC5F,CAAC;IACD,IAAI,GAAW,CAAA;IACf,IAAI,IAAI,EAAE,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC5B,GAAG,GAAG,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;IAClE,CAAC;SAAM,IAAI,IAAI,EAAE,IAAI,KAAK,SAAS,EAAE,CAAC;QACpC,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;QACvC,MAAM,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;QACnC,GAAG,GAAG,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,CAAA;IACvC,CAAC;SAAM,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;QACpB,OAAO,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;IAC1B,CAAC;SAAM,CAAC;QACN,OAAO,GAAG,GAAG,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAA;IACvC,CAAC;IACD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAA;AACzC,CAAC,CAAA;AAED,MAAM,UAAU,GAAG,CACjB,IAA8C,EAC9C,IAA8B,EAC9B,GAAQ,EACR,IAAkC,EAC1B,EAAE;IACV,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,IAAI,GAAG,CAAA;IAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,IAAI,iBAAiB,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;IACxE,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,EAAE,CAAC;QACzD,MAAM,IAAI,mBAAmB,CAC3B,mCAAmC,MAAM,QAAQ,MAAM,EAAE,EACzD,IAAI,CACL,CAAA;IACH,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAA;IACxB,MAAM,WAAW,GAAG,GAAG,IAAI,MAAM,CAAC,KAAK,CAAC,CAAA;IACxC,MAAM,SAAS,GAAG,cAAc,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;IAC/C,MAAM,SAAS,GAAG,cAAc,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;IAC/C,IAAI,SAAS,GAAG,SAAS,EAAE,CAAC;QAC1B,MAAM,IAAI,mBAAmB,CAAC,iBAAiB,MAAM,YAAY,MAAM,GAAG,EAAE,IAAI,EAAE,cAAc,CAAC,CAAA;IACnG,CAAC;IAED,2EAA2E;IAC3E,uDAAuD;IACvD,IAAI,WAAmB,CAAA;IACvB,IAAI,IAAI,EAAE,IAAI,KAAK,QAAQ,IAAI,IAAI,EAAE,IAAI,KAAK,SAAS,EAAE,CAAC;QACxD,sEAAsE;QACtE,2CAA2C;QAC3C,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,CAAA;QAC3B,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,CAAA;QAC3B,IAAI,CAAS,CAAA;QACb,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC3B,CAAC,GAAG,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;QAClE,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;YACzC,MAAM,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;YACrC,CAAC,GAAG,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,CAAA;QACrC,CAAC;QACD,6EAA6E;QAC7E,WAAW,GAAG,mBAAmB,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;QAC3C,8DAA8D;QAC9D,IAAI,WAAW,GAAG,SAAS;YAAE,WAAW,GAAG,SAAS,CAAA;QACpD,IAAI,WAAW,GAAG,SAAS;YAAE,WAAW,GAAG,SAAS,CAAA;IACtD,CAAC;SAAM,CAAC;QACN,wEAAwE;QACxE,WAAW,GAAG,qBAAqB,CAAC,GAAG,EAAE,SAAS,EAAE,SAAS,CAAC,CAAA;IAChE,CAAC;IACD,OAAO,kBAAkB,CAAC,WAAW,EAAE,WAAW,EAAE,KAAK,CAAC,CAAA;AAC5D,CAAC,CAAA;AAED,MAAM,eAAe,GAAG,CAAC,CAAS,EAAW,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;AAEzE,MAAM,cAAc,GAAG,CAAC,CAAS,EAAE,KAAa,EAAU,EAAE;IAC1D,MAAM,QAAQ,GAAG,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAA;IAClC,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACtC,MAAM,CAAC,OAAO,EAAE,QAAQ,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;IAChD,MAAM,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;IAC1C,MAAM,UAAU,GAAG,SAAS,GAAG,GAAG,CAAC,MAAM,CAAC,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC,CAAA;IACnE,MAAM,MAAM,GAAG,CAAC,OAAO,IAAI,GAAG,CAAC,GAAG,UAAU,CAAA;IAC5C,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;IAC5D,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAA;AAC1C,CAAC,CAAA;AAED,MAAM,mBAAmB,GAAG,CAAC,CAAS,EAAE,KAAa,EAAU,EAAE;IAC/D,sEAAsE;IACtE,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;IAC9B,OAAO,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;AACrC,CAAC,CAAA;AAED,MAAM,qBAAqB,GAAG,CAAC,GAAQ,EAAE,EAAU,EAAE,EAAU,EAAU,EAAE;IACzE,IAAI,EAAE,KAAK,EAAE;QAAE,OAAO,EAAE,CAAA;IACxB,MAAM,KAAK,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAA;IAC1B,0EAA0E;IAC1E,IAAI,IAAI,GAAG,CAAC,CAAA;IACZ,KAAK,IAAI,GAAG,GAAG,KAAK,GAAG,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,KAAK,EAAE;QAAE,IAAI,IAAI,CAAC,CAAA;IAC1D,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC,CAAA;IACnC,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,EAAE,EAAE,OAAO,IAAI,CAAC,EAAE,CAAC;QACjD,IAAI,CAAC,GAAG,EAAE,CAAA;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACnC,uDAAuD;YACvD,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,WAAW,CAAC,CAAC,CAAA;YACxD,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,GAAG,GAAG,CAAA;QACtB,CAAC;QACD,6CAA6C;QAC7C,MAAM,IAAI,GAAG,CAAC,EAAE,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAA;QACtC,CAAC,IAAI,IAAI,CAAA;QACT,IAAI,CAAC,GAAG,KAAK;YAAE,OAAO,EAAE,GAAG,CAAC,CAAA;IAC9B,CAAC;IACD,2BAA2B;IAC3B,0EAA0E;IAC1E,6EAA6E;IAC7E,kEAAkE;IAClE,OAAO,EAAE,GAAG,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,KAAK,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,CAAA;AACxD,CAAC,CAAA;AAED,MAAM,SAAS,GAAG,CAAC,GAAQ,EAAU,EAAE;IACrC,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,WAAW,CAAC,CAAC,CAAA;IACvD,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,WAAW,CAAC,CAAC,CAAA;IACvD,OAAO,CAAC,EAAE,IAAI,GAAG,CAAC,GAAG,EAAE,CAAA;AACzB,CAAC,CAAA;AACD,0BAA0B;AAE1B,MAAM,kBAAkB,GAAG,CAAC,MAAc,EAAE,WAAmB,EAAE,KAAa,EAAU,EAAE;IACxF,MAAM,QAAQ,GAAG,MAAM,GAAG,EAAE,CAAA;IAC5B,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAA;IACvC,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAA;IAC9D,MAAM,OAAO,GAAG,GAAG,GAAG,WAAW,CAAA;IACjC,MAAM,QAAQ,GAAG,GAAG,GAAG,WAAW,CAAA;IAClC,MAAM,OAAO,GAAG,QAAQ,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;IACxD,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,QAAQ,EAAE,GAAG,GAAG,GAAG,OAAO,CAAA;AACnE,CAAC,CAAA;AAED,MAAM,iBAAiB,GAAG,CAAC,SAAiB,EAAE,KAAa,EAAU,EAAE;IACrE,MAAM,SAAS,GAAG,SAAS,GAAG,KAAK,CAAA;IACnC,OAAO,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,CAAA;AAC3C,CAAC,CAAA;AAED,MAAM,QAAQ,GAAG,CACf,IAA4C,EAC5C,IAAkC,EAClC,KAAe,EACJ,EAAE;IACb,IAAI,GAAW,CAAA;IACf,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QAC9B,GAAG,GAAG,IAAI,CAAC,MAAM,CAAA;IACnB,CAAC;SAAM,CAAC;QACN,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,IAAI,CAAC,CAAA;QAChC,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;QAChD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC;YAChB,MAAM,IAAI,mBAAmB,CAAC,qBAAqB,IAAI,kBAAkB,IAAI,GAAG,EAAE,IAAI,CAAC,CAAA;QACzF,CAAC;QACD,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IACjC,CAAC;IACD,MAAM,GAAG,GAAc,EAAE,CAAA;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAChC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAA;IACtE,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC,CAAA;AAED,MAAM,SAAS,GAAG,CAChB,IAA6C,EAC7C,IAAkC,EAClC,KAAe,EACU,EAAE;IAC3B,wEAAwE;IACxE,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IACrC,MAAM,WAAW,GAAa,EAAE,CAAA;IAChC,MAAM,GAAG,GAA4B,EAAE,CAAA;IAEvC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAE,CAAA;QAC/B,IAAI,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,KAAK,SAAS,EAAE,CAAC;YAC5C,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YACrB,SAAQ;QACV,CAAC;QACD,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAA;QAC7D,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,IAAI,EAAE,QAAQ,KAAK,IAAI;YAAE,SAAQ;QAClE,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,CAAA;IAClB,CAAC;IACD,KAAK,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAE,CAAA;QAC/B,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAA;QAC7D,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,IAAI,EAAE,QAAQ,KAAK,IAAI;YAAE,SAAQ;QAClE,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,CAAA;IAClB,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC,CAAA"}

package/dist/generator/replay.d.ts

@@ -0,0 +1,42 @@
+/**
+ * Replay / snapshot helpers — thin layer over `mock()` for tests.
+ *
+ * `replay(schema, opts)` returns a function bound to a fixed (seed, input)
+ * pair. Calling it twice always returns deep-equal values; the function is
+ * the canonical way to assert determinism in test suites.
+ *
+ * `expectStable(schema, opts)` runs the generator twice and throws if the
+ * outputs differ — surfaces non-determinism introduced by misuse of
+ * `derivedFrom` (e.g. reading `Date.now()`).
+ */
+import { type MockOptions } from './engine.js';
+import type { Infer, Schema } from '../foundation/types.js';
+/** A reusable, deterministic generator bound to a fixed seed/input. */
+export type Replay<S extends Schema> = {
+    /** Generate the value (always identical for identical bound options). */
+    (): Infer<S>;
+    /** The frozen options used by this replay. */
+    readonly options: Readonly<MockOptions>;
+};
+/** Build a deterministic, repeatedly-callable generator. */
+export declare const replay: <S extends Schema>(schema: S, options?: MockOptions) => Replay<S>;
+/**
+ * Run the generator twice with identical inputs and assert deep equality.
+ * Returns the produced value on success; throws on divergence.
+ *
+ * **This is a diagnostic, not a determinism guarantee.** It runs the
+ * schema *twice* with the same seed and compares the outputs
+ * structurally — useful for catching obvious non-determinism (a
+ * `derivedFrom` reading `Date.now()`, a stray `Math.random()`,
+ * iteration over a `Set`), but two iterations cannot prove the entire
+ * RNG sequence is fixed. The strong contract is {@link replay}, which
+ * binds a (seed, input) pair and lets the caller pin the value at the
+ * snapshot site.
+ *
+ * Treat `expectStable` as the equivalent of a smoke test: cheap to
+ * keep in a regression suite, fast to fail loudly when a callback
+ * goes off-piste, but not a substitute for `replay`-backed snapshots
+ * for surfaces that must round-trip across releases.
+ */
+export declare const expectStable: <S extends Schema>(schema: S, options?: MockOptions) => Infer<S>;
+//# sourceMappingURL=replay.d.ts.map

package/dist/generator/replay.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"replay.d.ts","sourceRoot":"","sources":["../../src/generator/replay.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAIH,OAAO,EAAQ,KAAK,WAAW,EAAE,MAAM,aAAa,CAAA;AACpD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,wBAAwB,CAAA;AAE3D,uEAAuE;AACvE,MAAM,MAAM,MAAM,CAAC,CAAC,SAAS,MAAM,IAAI;IACrC,yEAAyE;IACzE,IAAI,KAAK,CAAC,CAAC,CAAC,CAAA;IACZ,8CAA8C;IAC9C,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,WAAW,CAAC,CAAA;CACxC,CAAA;AAED,4DAA4D;AAC5D,eAAO,MAAM,MAAM,GAAI,CAAC,SAAS,MAAM,EAAE,QAAQ,CAAC,EAAE,UAAS,WAAgB,KAAG,MAAM,CAAC,CAAC,CAKvF,CAAA;AAcD;;;;;;;;;;;;;;;;;GAiBG;AACH,eAAO,MAAM,YAAY,GAAI,CAAC,SAAS,MAAM,EAAE,QAAQ,CAAC,EAAE,UAAS,WAAgB,KAAG,KAAK,CAAC,CAAC,CAU5F,CAAA"}