@json-schema-engine/core 0.0.1

package/dist/engine.js

@@ -0,0 +1,493 @@
+// Evaluation engine: frame-scoped record channel (DESIGN.md §4, normative),
+// evaluation-path tracking with lazy string materialization, cycle guard,
+// annotation retention.
+//
+// Channel rules implemented here and nowhere else:
+//  1. each schema application pushes a frame;
+//  2. annotate() appends an annotation record (the keyword's own value) and
+//     produce() a dependency record (computed data for other keywords) to
+//     the current frame;
+//  3. on success the frame merges into its parent, on failure it is
+//     discarded;
+//  4. visibility = the current frame's dependency records filtered by
+//     cursor identity;
+//  5. the annotation result is the root frame's annotation records filtered
+//     by the annotation selection; selection never affects rule 4;
+//  6. relevance (draft-03 §12.2): a keyword that accepts makes the errors of
+//     its rejecting sub-evaluations irrelevant — evaluateKeyword drops them
+//     (kept aside only when tracing, for verbose output); rule 3 is the same
+//     transition for a rejecting schema object's accepting sub-evaluations.
+import { isObject, escapeSegment } from "./json.js";
+import { resolveUri, splitFragment } from "./uri.js";
+import { rootCursor } from "./cursor.js";
+import { unknownKeywordId, } from "./dialect.js";
+import { DEFAULT_MAX_DEPTH, InvalidSchemaError, MaxDepthExceededError, describeNonSchema, } from "./registry.js";
+import { RegexCache } from "./regex.js";
+/** Thrown when a schema is re-entered at the same instance location (D8/cycle guard). */
+export class InfiniteLoopError extends Error {
+}
+/** Thrown when a dialect disallows unknown keywords and one is present. */
+export class UnknownKeywordError extends Error {
+}
+/** Thrown when a keyword reads a dependency behavior id it never declared via `analyze().consumes`. */
+export class UndeclaredConsumptionError extends Error {
+}
+/** Thrown when a keyword produces dependency data without declaring its own id via `analyze().produces`. */
+export class UndeclaredProductionError extends Error {
+}
+/** Thrown when a keyword reports an error through `ctx.error()` yet accepts the input. */
+export class KeywordContractError extends Error {
+}
+/** Materializes a path node chain into its JSON Pointer string. */
+export function materializePath(node) {
+    let s = "";
+    for (let n = node; n !== null; n = n.parent)
+        s = "/" + n.segment + s;
+    return s;
+}
+// Appends with a loop: an argument spread puts every element on the native
+// stack, so `dst.push(...src)` throws past ~120k elements — a ceiling a wide
+// instance reaches long before maxDepth does.
+function appendAll(dst, src) {
+    for (const x of src)
+        dst.push(x);
+}
+/** Mutable state for one evaluation run: frames, errors, dynamic scope, and tracing. */
+export class EvalState {
+    registry;
+    shouldRecord;
+    regexCache;
+    maxDepth;
+    frames = [{ annotations: [], dependencies: [] }];
+    /** Relevant errors, in encounter order (rule 6). */
+    errors = [];
+    // Errors made irrelevant by an accepting ancestor keyword (rule 6), kept
+    // only when tracing so verbose output can show them.
+    droppedErrors = null;
+    // Dynamic scope (D8): resources entered by schema application, outermost
+    // first. Duplicates are fine — resolution takes the first (outermost) hit.
+    dynamicScope = [];
+    // Tracing (opt-in, zero cost when off): every application as a tree, and
+    // every record regardless of frame discard — failed-branch annotations
+    // surface as droppedAnnotations in verbose outputs; dependency records are
+    // kept for diagnostics and never rendered.
+    traceRoot = null;
+    allAnnotations = null;
+    allDependencies = null;
+    // Active schema-application nesting, bounded by maxDepth (see applySchema).
+    depth = 0;
+    traceStack = [];
+    active = new Map();
+    constructor(registry, tracing = false, shouldRecord = null, regexCache = new RegexCache(), maxDepth = DEFAULT_MAX_DEPTH) {
+        this.registry = registry;
+        this.shouldRecord = shouldRecord;
+        this.regexCache = regexCache;
+        this.maxDepth = maxDepth;
+        if (tracing) {
+            this.allAnnotations = [];
+            this.allDependencies = [];
+            this.droppedErrors = [];
+        }
+    }
+    /** True when tracing is active for this run. */
+    get tracing() {
+        return this.allAnnotations !== null;
+    }
+    /** Removes the errors pushed since `mark`: rejecting sub-evaluations of a keyword that accepted (rule 6). */
+    dropErrorsFrom(mark) {
+        const dropped = this.errors.splice(mark);
+        if (this.droppedErrors !== null)
+            appendAll(this.droppedErrors, dropped);
+    }
+    /** Opens a trace node for a schema application and links it under the current one. */
+    traceEnter(schemaRef, pathNode, cursor) {
+        const node = {
+            schemaRef,
+            pathNode,
+            cursor,
+            valid: true,
+            keywords: [],
+            children: [],
+        };
+        const parent = this.traceStack[this.traceStack.length - 1];
+        if (parent)
+            parent.children.push(node);
+        else
+            this.traceRoot = node;
+        this.traceStack.push(node);
+        return node;
+    }
+    /** Closes the current trace node with its final validity. */
+    traceExit(node, valid) {
+        node.valid = valid;
+        this.traceStack.pop();
+    }
+    /** Records one keyword evaluation's verdict on the current trace node. */
+    traceKeyword(name, valid) {
+        this.traceStack[this.traceStack.length - 1]?.keywords.push({ name, valid });
+    }
+    /** The innermost open frame. */
+    get frame() {
+        return this.frames[this.frames.length - 1];
+    }
+    /** Annotations surviving at the root frame — the annotation result before retention filtering. */
+    get rootAnnotations() {
+        return this.frames[0].annotations;
+    }
+    /** Dependency records surviving at the root frame. */
+    get rootDependencies() {
+        return this.frames[0].dependencies;
+    }
+    /**
+     * Records entry into a schema application for cycle detection.
+     * @throws InfiniteLoopError if this schema is already active at this cursor.
+     */
+    enter(schemaRef, cursor) {
+        const key = `${schemaRef.baseUri}#${schemaRef.pointer}`;
+        let keys = this.active.get(cursor);
+        if (keys === undefined) {
+            keys = new Set();
+            this.active.set(cursor, keys);
+        }
+        else if (keys.has(key)) {
+            throw new InfiniteLoopError(`schema '${key}' re-entered at the same instance location`);
+        }
+        keys.add(key);
+    }
+    /** Records exit from a schema application, releasing its cycle-detection entry. */
+    exit(schemaRef, cursor) {
+        const keys = this.active.get(cursor);
+        keys.delete(`${schemaRef.baseUri}#${schemaRef.pointer}`);
+        if (keys.size === 0)
+            this.active.delete(cursor);
+    }
+}
+class KeywordContextImpl {
+    state;
+    schemaRef;
+    entry;
+    cursor;
+    pathNode;
+    /** Set once this keyword reports an error of its own (the contract check in evaluateKeyword). */
+    reported = false;
+    constructor(state, schemaRef, entry, cursor, pathNode) {
+        this.state = state;
+        this.schemaRef = schemaRef;
+        this.entry = entry;
+        this.cursor = cursor;
+        this.pathNode = pathNode;
+    }
+    get schema() {
+        return this.schemaRef.node;
+    }
+    apply(segments, cursor) {
+        const child = this.state.registry.child(this.schemaRef, segments);
+        let pathNode = this.pathNode;
+        for (const seg of segments) {
+            pathNode = { parent: pathNode, segment: escapeSegment(String(seg)) };
+        }
+        return applySchema(this.state, child, cursor, pathNode);
+    }
+    resolveRef(ref) {
+        return this.state.registry.resolveRef(ref, this.schemaRef.baseUri);
+    }
+    resolveDynamic(ref) {
+        const registry = this.state.registry;
+        // Lexical resolution first (spec: the initial target must exist); the
+        // rebinding below only applies to plain-name fragments minted by a
+        // dynamic anchor — pointer fragments behave exactly like $ref.
+        const target = registry.resolveRef(ref, this.schemaRef.baseUri);
+        const { resource, fragment } = splitFragment(resolveUri(ref, this.schemaRef.baseUri));
+        if (fragment === null || fragment === "" || fragment.startsWith("/"))
+            return target;
+        if (registry.dynamicAnchor(resource, fragment) === undefined)
+            return target;
+        for (const scopeUri of this.state.dynamicScope) {
+            const hit = registry.dynamicAnchor(scopeUri, fragment);
+            if (hit !== undefined)
+                return hit;
+        }
+        return target;
+    }
+    resolveRecursive(ref) {
+        const registry = this.state.registry;
+        // 2019-09: the reference is "#"; anything with a non-empty fragment
+        // behaves like $ref. Rebinding is all-or-nothing on the root-level
+        // $recursiveAnchor flag rather than a named anchor.
+        const target = registry.resolveRef(ref, this.schemaRef.baseUri);
+        const { resource, fragment } = splitFragment(resolveUri(ref, this.schemaRef.baseUri));
+        if (fragment !== null && fragment !== "")
+            return target;
+        if (!registry.hasRecursiveRoot(resource))
+            return target;
+        for (const scopeUri of this.state.dynamicScope) {
+            if (registry.hasRecursiveRoot(scopeUri))
+                return registry.rootRef(scopeUri);
+        }
+        return target;
+    }
+    applyResolved(target) {
+        const pathNode = {
+            parent: this.pathNode,
+            segment: escapeSegment(this.entry.name),
+        };
+        return applySchema(this.state, target, this.cursor, pathNode);
+    }
+    compileRegex(pattern) {
+        return this.state.regexCache.compile(pattern);
+    }
+    annotate() {
+        const record = this.state.shouldRecord;
+        if (record &&
+            !record(this.entry.behaviorId, this.entry.name, this.entry.vocabularyUri)) {
+            return;
+        }
+        const annotation = {
+            kind: "annotation",
+            behaviorId: this.entry.behaviorId,
+            keywordName: this.entry.name,
+            vocabularyUri: this.entry.vocabularyUri,
+            schemaRef: this.schemaRef,
+            pathNode: this.pathNode,
+            cursor: this.cursor,
+            value: this.entry.value,
+        };
+        this.state.frame.annotations.push(annotation);
+        // Frames discard on failure; the trace keeps everything so verbose
+        // outputs can report droppedAnnotations.
+        this.state.allAnnotations?.push(annotation);
+    }
+    produce(data) {
+        // A producer nobody declared is invisible to elision analysis and to the
+        // compiler's channel routing — fail loud, not wrong. The check is per
+        // behavior id: the registry unions every occurrence's declarations.
+        const registry = this.state.registry;
+        if (!registry.producedIds().has(this.entry.behaviorId)) {
+            throw new UndeclaredProductionError(`'${this.entry.behaviorId}' produces dependency data without declaring it in analyze().produces`);
+        }
+        // Under elision, dependency data nobody consumes is never read.
+        if (this.state.shouldRecord !== null &&
+            !registry.consumedIds().has(this.entry.behaviorId)) {
+            return;
+        }
+        const dependency = {
+            kind: "dependency",
+            behaviorId: this.entry.behaviorId,
+            keywordName: this.entry.name,
+            schemaRef: this.schemaRef,
+            pathNode: this.pathNode,
+            cursor: this.cursor,
+            data,
+        };
+        this.state.frame.dependencies.push(dependency);
+        this.state.allDependencies?.push(dependency);
+    }
+    visible(behaviorIds, scope = "all") {
+        // Under elision, reading an id nobody declared via StaticFacts.consumes
+        // means the records may already be gone — fail loud, not wrong.
+        if (this.state.shouldRecord !== null) {
+            const consumed = this.state.registry.consumedIds();
+            for (const id of behaviorIds) {
+                if (!consumed.has(id)) {
+                    throw new UndeclaredConsumptionError(`'${this.entry.behaviorId}' reads '${id}' without declaring it in analyze().consumes`);
+                }
+            }
+        }
+        // Every keyword of one schema application shares its pathNode, so
+        // identity picks out the adjacent keywords' records.
+        return this.state.frame.dependencies.filter((d) => d.cursor === this.cursor &&
+            behaviorIds.includes(d.behaviorId) &&
+            (scope === "all" || d.pathNode === this.pathNode));
+    }
+    error(message, params) {
+        this.reported = true;
+        this.state.errors.push({
+            keywordName: this.entry.name,
+            vocabularyUri: this.entry.vocabularyUri,
+            schemaRef: this.schemaRef,
+            pathNode: this.pathNode,
+            cursor: this.cursor,
+            message,
+            ...(params === undefined ? {} : { params }),
+        });
+    }
+}
+/**
+ * Applies one schema to one instance cursor: pushes a frame, evaluates the
+ * dialect's keywords in order, merges or discards the frame per DESIGN.md §4.
+ * @throws InfiniteLoopError if the schema is already active at this cursor.
+ * @throws UnknownKeywordError if the dialect disallows an unknown keyword present in the schema.
+ */
+export function applySchema(state, schemaRef, cursor, pathNode) {
+    if (state.depth >= state.maxDepth) {
+        throw new MaxDepthExceededError(`schema application exceeds maxDepth (${state.maxDepth}) at ` +
+            `'${schemaRef.baseUri}#${schemaRef.pointer}'`);
+    }
+    state.depth++;
+    try {
+        return applySchemaAtDepth(state, schemaRef, cursor, pathNode);
+    }
+    finally {
+        state.depth--;
+    }
+}
+function applySchemaAtDepth(state, schemaRef, cursor, pathNode) {
+    const node = schemaRef.node;
+    if (typeof node === "boolean") {
+        if (!node) {
+            state.errors.push({
+                keywordName: null,
+                vocabularyUri: null,
+                schemaRef,
+                pathNode,
+                cursor,
+                message: "schema is false",
+            });
+        }
+        if (state.tracing) {
+            state.traceExit(state.traceEnter(schemaRef, pathNode, cursor), node);
+        }
+        return node;
+    }
+    // Backstop for the registration walk's eager D19 check: a position the
+    // walk never saw (e.g. a $ref whose pointer lands inside an unknown
+    // keyword's value) still fails loud when applied, never silently passes.
+    if (!isObject(node)) {
+        throw new InvalidSchemaError(`non-schema value (${describeNonSchema(node)}) applied as a schema ` +
+            `at '${schemaRef.baseUri}#${schemaRef.pointer}'`);
+    }
+    const dialect = state.registry.dialectFor(schemaRef.baseUri);
+    // draft-07/06 (D18): a $ref makes every sibling keyword act as if absent.
+    const refOnly = dialect.refIgnoresSiblings && Object.hasOwn(node, "$ref");
+    state.enter(schemaRef, cursor);
+    state.dynamicScope.push(schemaRef.baseUri);
+    state.frames.push({ annotations: [], dependencies: [] });
+    const traceNode = state.tracing
+        ? state.traceEnter(schemaRef, pathNode, cursor)
+        : null;
+    let valid = true;
+    try {
+        for (const entry of dialect.ordered) {
+            if (refOnly && entry.name !== "$ref")
+                continue;
+            if (!Object.hasOwn(node, entry.name))
+                continue;
+            if (!evaluateKeyword(state, schemaRef, entry, cursor, pathNode))
+                valid = false;
+        }
+        for (const name of Object.keys(node)) {
+            if (refOnly)
+                break;
+            if (dialect.keywords.has(name))
+                continue;
+            if (!dialect.allowUnknownKeywords) {
+                throw new UnknownKeywordError(`dialect '${dialect.uri}' does not allow unknown keyword '${name}'`);
+            }
+            // Unknown keywords are collected as annotations: the keyword's value is
+            // the annotation value (spec SHOULD).
+            const behaviorId = unknownKeywordId(name);
+            if (state.tracing)
+                state.traceKeyword(name, true);
+            if (state.shouldRecord && !state.shouldRecord(behaviorId, name, null))
+                continue;
+            const annotation = {
+                kind: "annotation",
+                behaviorId,
+                keywordName: name,
+                vocabularyUri: null,
+                schemaRef,
+                pathNode,
+                cursor,
+                value: node[name],
+            };
+            state.frame.annotations.push(annotation);
+            state.allAnnotations?.push(annotation);
+        }
+    }
+    finally {
+        const frame = state.frames.pop();
+        if (valid) {
+            const parent = state.frame;
+            appendAll(parent.annotations, frame.annotations);
+            appendAll(parent.dependencies, frame.dependencies);
+        }
+        if (traceNode)
+            state.traceExit(traceNode, valid);
+        state.dynamicScope.pop();
+        state.exit(schemaRef, cursor);
+    }
+    return valid;
+}
+function evaluateKeyword(state, schemaRef, entry, cursor, pathNode) {
+    const value = schemaRef.node[entry.name];
+    const ctx = new KeywordContextImpl(state, schemaRef, {
+        name: entry.name,
+        behaviorId: entry.behavior.id,
+        vocabularyUri: entry.vocabularyUri,
+        value,
+    }, cursor, pathNode);
+    const mark = state.errors.length;
+    const ok = entry.behavior.evaluate(value, cursor, ctx);
+    if (ok) {
+        // Rule 6 keys on the keyword's verdict, so a keyword that reports and
+        // still accepts would have its own error silently dropped — fail loud.
+        if (ctx.reported) {
+            throw new KeywordContractError(`'${entry.behavior.id}' reported an error but accepted the input`);
+        }
+        if (state.errors.length > mark)
+            state.dropErrorsFrom(mark);
+    }
+    // Identifier and reserved-location keywords evaluate to nothing and appear
+    // in no output unit (draft-03 §12.6, §12.10).
+    if (state.tracing && entry.behavior.structural !== true) {
+        state.traceKeyword(entry.name, ok);
+    }
+    return ok;
+}
+/** Evaluates an instance against a registered root schema, returning validity and final state. */
+export function runEvaluation(registry, schemaUri, instance, tracing = false, shouldRecord = null, regexCache = new RegexCache(), maxDepth = DEFAULT_MAX_DEPTH) {
+    const state = new EvalState(registry, tracing, shouldRecord, regexCache, maxDepth);
+    const valid = applyWithOverflowBackstop(state, registry.rootRef(schemaUri), rootCursor(instance), null, maxDepth);
+    return { valid, state };
+}
+// Backstop: if maxDepth is set above the runtime's own stack ceiling, a
+// native overflow surfaces as a RangeError. Convert it to the same typed,
+// catchable error so callers never face an uncatchable-by-type crash.
+function applyWithOverflowBackstop(state, target, cursor, pathNode, maxDepth) {
+    try {
+        return applySchema(state, target, cursor, pathNode);
+    }
+    catch (err) {
+        if (err instanceof RangeError && /call stack/i.test(err.message)) {
+            throw new MaxDepthExceededError(`evaluation exceeded the native call stack (maxDepth=${maxDepth}); ` +
+                `reduce nesting or lower maxDepth`);
+        }
+        throw err;
+    }
+}
+/**
+ * Evaluates one schema fragment with pre-seeded state: the compiled tier's
+ * trampoline into the interpreter (M6), used for dynamic islands and for
+ * fallback units alike. Returns the fragment's verdict, its errors, and its
+ * root frame's surviving annotation and dependency records — cursor
+ * identities intact, so a compiled caller can merge them under channel rule
+ * 3 and filter under rule 4 exactly as an interpreted parent would. With
+ * `tracing`, also the trace and the retained irrelevant records.
+ */
+export function evaluateFragment(registry, target, cursor, options = {}) {
+    const maxDepth = options.maxDepth ?? DEFAULT_MAX_DEPTH;
+    const state = new EvalState(registry, options.tracing === true, options.shouldRecord ?? null, options.regexCache ?? new RegexCache(), maxDepth);
+    state.dynamicScope.push(...(options.dynamicScope ?? []));
+    state.depth = options.depth ?? 0;
+    const valid = applyWithOverflowBackstop(state, target, cursor, options.pathNode ?? null, maxDepth);
+    return {
+        valid,
+        errors: state.errors,
+        annotations: state.rootAnnotations,
+        dependencies: state.rootDependencies,
+        traceRoot: state.traceRoot,
+        droppedErrors: state.droppedErrors ?? [],
+        allAnnotations: state.allAnnotations ?? [],
+    };
+}
+//# sourceMappingURL=engine.js.map

package/dist/engine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"engine.js","sourceRoot":"","sources":["../src/engine.ts"],"names":[],"mappings":"AAAA,4EAA4E;AAC5E,0EAA0E;AAC1E,wBAAwB;AACxB,EAAE;AACF,mDAAmD;AACnD,8CAA8C;AAC9C,4EAA4E;AAC5E,0EAA0E;AAC1E,yBAAyB;AACzB,oEAAoE;AACpE,iBAAiB;AACjB,sEAAsE;AACtE,uBAAuB;AACvB,4EAA4E;AAC5E,mEAAmE;AACnE,6EAA6E;AAC7E,4EAA4E;AAC5E,6EAA6E;AAC7E,4EAA4E;AAE5E,OAAO,EAAa,QAAQ,EAAE,aAAa,EAAE,MAAM,WAAW,CAAC;AAC/D,OAAO,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AACrD,OAAO,EAAU,UAAU,EAAE,MAAM,aAAa,CAAC;AAEjD,OAAO,EAML,gBAAgB,GACjB,MAAM,cAAc,CAAC;AACtB,OAAO,EACL,iBAAiB,EACjB,kBAAkB,EAClB,qBAAqB,EAErB,iBAAiB,GAClB,MAAM,eAAe,CAAC;AACvB,OAAO,EAAiB,UAAU,EAAE,MAAM,YAAY,CAAC;AAEvD,yFAAyF;AACzF,MAAM,OAAO,iBAAkB,SAAQ,KAAK;CAAG;AAC/C,2EAA2E;AAC3E,MAAM,OAAO,mBAAoB,SAAQ,KAAK;CAAG;AACjD,uGAAuG;AACvG,MAAM,OAAO,0BAA2B,SAAQ,KAAK;CAAG;AACxD,4GAA4G;AAC5G,MAAM,OAAO,yBAA0B,SAAQ,KAAK;CAAG;AACvD,0FAA0F;AAC1F,MAAM,OAAO,oBAAqB,SAAQ,KAAK;CAAG;AAwBlD,mEAAmE;AACnE,MAAM,UAAU,eAAe,CAAC,IAAqB;IACnD,IAAI,CAAC,GAAG,EAAE,CAAC;IACX,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM;QAAE,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC;IACrE,OAAO,CAAC,CAAC;AACX,CAAC;AAgDD,2EAA2E;AAC3E,6EAA6E;AAC7E,8CAA8C;AAC9C,SAAS,SAAS,CAAI,GAAQ,EAAE,GAAiB;IAC/C,KAAK,MAAM,CAAC,IAAI,GAAG;QAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACnC,CAAC;AA+BD,wFAAwF;AACxF,MAAM,OAAO,SAAS;IAuBX;IAEA;IACA;IACA;IA1BT,MAAM,GAAY,CAAC,EAAE,WAAW,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,CAAC,CAAC;IAC1D,oDAAoD;IACpD,MAAM,GAAkB,EAAE,CAAC;IAC3B,yEAAyE;IACzE,qDAAqD;IACrD,aAAa,GAAyB,IAAI,CAAC;IAC3C,yEAAyE;IACzE,2EAA2E;IAC3E,YAAY,GAAa,EAAE,CAAC;IAC5B,yEAAyE;IACzE,uEAAuE;IACvE,2EAA2E;IAC3E,2CAA2C;IAC3C,SAAS,GAAqB,IAAI,CAAC;IACnC,cAAc,GAA8B,IAAI,CAAC;IACjD,eAAe,GAA8B,IAAI,CAAC;IAClD,4EAA4E;IAC5E,KAAK,GAAG,CAAC,CAAC;IACF,UAAU,GAAgB,EAAE,CAAC;IAC7B,MAAM,GAAG,IAAI,GAAG,EAAuB,CAAC;IAEhD,YACS,QAAwB,EAC/B,OAAO,GAAG,KAAK,EACR,eAAuC,IAAI,EAC3C,aAAyB,IAAI,UAAU,EAAE,EACzC,WAAmB,iBAAiB;QAJpC,aAAQ,GAAR,QAAQ,CAAgB;QAExB,iBAAY,GAAZ,YAAY,CAA+B;QAC3C,eAAU,GAAV,UAAU,CAA+B;QACzC,aAAQ,GAAR,QAAQ,CAA4B;QAE3C,IAAI,OAAO,EAAE,CAAC;YACZ,IAAI,CAAC,cAAc,GAAG,EAAE,CAAC;YACzB,IAAI,CAAC,eAAe,GAAG,EAAE,CAAC;YAC1B,IAAI,CAAC,aAAa,GAAG,EAAE,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,gDAAgD;IAChD,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,cAAc,KAAK,IAAI,CAAC;IACtC,CAAC;IAED,6GAA6G;IAC7G,cAAc,CAAC,IAAY;QACzB,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACzC,IAAI,IAAI,CAAC,aAAa,KAAK,IAAI;YAAE,SAAS,CAAC,IAAI,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;IAC1E,CAAC;IAED,sFAAsF;IACtF,UAAU,CACR,SAAoB,EACpB,QAAyB,EACzB,MAAc;QAEd,MAAM,IAAI,GAAc;YACtB,SAAS;YACT,QAAQ;YACR,MAAM;YACN,KAAK,EAAE,IAAI;YACX,QAAQ,EAAE,EAAE;YACZ,QAAQ,EAAE,EAAE;SACb,CAAC;QACF,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC3D,IAAI,MAAM;YAAE,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YAClC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;QAC3B,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,6DAA6D;IAC7D,SAAS,CAAC,IAAe,EAAE,KAAc;QACvC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC;IACxB,CAAC;IAED,0EAA0E;IAC1E,YAAY,CAAC,IAAY,EAAE,KAAc;QACvC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;IAC9E,CAAC;IAED,gCAAgC;IAChC,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;IAC9C,CAAC;IACD,kGAAkG;IAClG,IAAI,eAAe;QACjB,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,WAAW,CAAC;IACrC,CAAC;IACD,sDAAsD;IACtD,IAAI,gBAAgB;QAClB,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,YAAY,CAAC;IACtC,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,SAAoB,EAAE,MAAc;QACxC,MAAM,GAAG,GAAG,GAAG,SAAS,CAAC,OAAO,IAAI,SAAS,CAAC,OAAO,EAAE,CAAC;QACxD,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACnC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;YACjB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAChC,CAAC;aAAM,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACzB,MAAM,IAAI,iBAAiB,CACzB,WAAW,GAAG,4CAA4C,CAC3D,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAChB,CAAC;IAED,mFAAmF;IACnF,IAAI,CAAC,SAAoB,EAAE,MAAc;QACvC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;QACtC,IAAI,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC,OAAO,IAAI,SAAS,CAAC,OAAO,EAAE,CAAC,CAAC;QACzD,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC;YAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAClD,CAAC;CACF;AAED,MAAM,kBAAkB;IAKZ;IACA;IACA;IAMD;IACC;IAbV,iGAAiG;IACjG,QAAQ,GAAG,KAAK,CAAC;IAEjB,YACU,KAAgB,EAChB,SAAoB,EACpB,KAKP,EACM,MAAc,EACb,QAAyB;QATzB,UAAK,GAAL,KAAK,CAAW;QAChB,cAAS,GAAT,SAAS,CAAW;QACpB,UAAK,GAAL,KAAK,CAKZ;QACM,WAAM,GAAN,MAAM,CAAQ;QACb,aAAQ,GAAR,QAAQ,CAAiB;IAChC,CAAC;IAEJ,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,SAAS,CAAC,IAAiC,CAAC;IAC1D,CAAC;IAED,KAAK,CAAC,QAAsC,EAAE,MAAc;QAC1D,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;QAClE,IAAI,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC7B,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,QAAQ,GAAG,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QACvE,CAAC;QACD,OAAO,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;IAC1D,CAAC;IAED,UAAU,CAAC,GAAW;QACpB,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;IACrE,CAAC;IAED,cAAc,CAAC,GAAW;QACxB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC;QACrC,sEAAsE;QACtE,mEAAmE;QACnE,+DAA+D;QAC/D,MAAM,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QAChE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,aAAa,CAC1C,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CACxC,CAAC;QACF,IAAI,QAAQ,KAAK,IAAI,IAAI,QAAQ,KAAK,EAAE,IAAI,QAAQ,CAAC,UAAU,CAAC,GAAG,CAAC;YAClE,OAAO,MAAM,CAAC;QAChB,IAAI,QAAQ,CAAC,aAAa,CAAC,QAAQ,EAAE,QAAQ,CAAC,KAAK,SAAS;YAAE,OAAO,MAAM,CAAC;QAC5E,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC;YAC/C,MAAM,GAAG,GAAG,QAAQ,CAAC,aAAa,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YACvD,IAAI,GAAG,KAAK,SAAS;gBAAE,OAAO,GAAG,CAAC;QACpC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,gBAAgB,CAAC,GAAW;QAC1B,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC;QACrC,oEAAoE;QACpE,mEAAmE;QACnE,oDAAoD;QACpD,MAAM,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QAChE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,aAAa,CAC1C,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CACxC,CAAC;QACF,IAAI,QAAQ,KAAK,IAAI,IAAI,QAAQ,KAAK,EAAE;YAAE,OAAO,MAAM,CAAC;QACxD,IAAI,CAAC,QAAQ,CAAC,gBAAgB,CAAC,QAAQ,CAAC;YAAE,OAAO,MAAM,CAAC;QACxD,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC;YAC/C,IAAI,QAAQ,CAAC,gBAAgB,CAAC,QAAQ,CAAC;gBACrC,OAAO,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACtC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,aAAa,CAAC,MAAiB;QAC7B,MAAM,QAAQ,GAAG;YACf,MAAM,EAAE,IAAI,CAAC,QAAQ;YACrB,OAAO,EAAE,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;SACxC,CAAC;QACF,OAAO,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IAChE,CAAC;IAED,YAAY,CAAC,OAAe;QAC1B,OAAO,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IAChD,CAAC;IAED,QAAQ;QACN,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC;QACvC,IACE,MAAM;YACN,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,EACzE,CAAC;YACD,OAAO;QACT,CAAC;QACD,MAAM,UAAU,GAAqB;YACnC,IAAI,EAAE,YAAY;YAClB,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU;YACjC,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;YAC5B,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC,aAAa;YACvC,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK;SACxB,CAAC;QACF,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC9C,mEAAmE;QACnE,yCAAyC;QACzC,IAAI,CAAC,KAAK,CAAC,cAAc,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;IAC9C,CAAC;IAED,OAAO,CAAC,IAAa;QACnB,yEAAyE;QACzE,sEAAsE;QACtE,oEAAoE;QACpE,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC;QACrC,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC;YACvD,MAAM,IAAI,yBAAyB,CACjC,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,uEAAuE,CACjG,CAAC;QACJ,CAAC;QACD,gEAAgE;QAChE,IACE,IAAI,CAAC,KAAK,CAAC,YAAY,KAAK,IAAI;YAChC,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAClD,CAAC;YACD,OAAO;QACT,CAAC;QACD,MAAM,UAAU,GAAqB;YACnC,IAAI,EAAE,YAAY;YAClB,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU;YACjC,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;YAC5B,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,IAAI;SACL,CAAC;QACF,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC/C,IAAI,CAAC,KAAK,CAAC,eAAe,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;IAC/C,CAAC;IAED,OAAO,CACL,WAA8B,EAC9B,QAA4B,KAAK;QAEjC,wEAAwE;QACxE,gEAAgE;QAChE,IAAI,IAAI,CAAC,KAAK,CAAC,YAAY,KAAK,IAAI,EAAE,CAAC;YACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC;YACnD,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;gBAC7B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;oBACtB,MAAM,IAAI,0BAA0B,CAClC,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,YAAY,EAAE,8CAA8C,CACtF,CAAC;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;QACD,kEAAkE;QAClE,qDAAqD;QACrD,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CACzC,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM;YACxB,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC;YAClC,CAAC,KAAK,KAAK,KAAK,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ,CAAC,CACpD,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,OAAe,EAAE,MAAoB;QACzC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC;YACrB,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;YAC5B,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC,aAAa;YACvC,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,OAAO;YACP,GAAG,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC;SAC5C,CAAC,CAAC;IACL,CAAC;CACF;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CACzB,KAAgB,EAChB,SAAoB,EACpB,MAAc,EACd,QAAyB;IAEzB,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;QAClC,MAAM,IAAI,qBAAqB,CAC7B,wCAAwC,KAAK,CAAC,QAAQ,OAAO;YAC3D,IAAI,SAAS,CAAC,OAAO,IAAI,SAAS,CAAC,OAAO,GAAG,CAChD,CAAC;IACJ,CAAC;IACD,KAAK,CAAC,KAAK,EAAE,CAAC;IACd,IAAI,CAAC;QACH,OAAO,kBAAkB,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;IAChE,CAAC;YAAS,CAAC;QACT,KAAK,CAAC,KAAK,EAAE,CAAC;IAChB,CAAC;AACH,CAAC;AAED,SAAS,kBAAkB,CACzB,KAAgB,EAChB,SAAoB,EACpB,MAAc,EACd,QAAyB;IAEzB,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC;IAC5B,IAAI,OAAO,IAAI,KAAK,SAAS,EAAE,CAAC;QAC9B,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC;gBAChB,WAAW,EAAE,IAAI;gBACjB,aAAa,EAAE,IAAI;gBACnB,SAAS;gBACT,QAAQ;gBACR,MAAM;gBACN,OAAO,EAAE,iBAAiB;aAC3B,CAAC,CAAC;QACL,CAAC;QACD,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YAClB,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC;QACvE,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,uEAAuE;IACvE,oEAAoE;IACpE,yEAAyE;IACzE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QACpB,MAAM,IAAI,kBAAkB,CAC1B,qBAAqB,iBAAiB,CAAC,IAAI,CAAC,wBAAwB;YAClE,OAAO,SAAS,CAAC,OAAO,IAAI,SAAS,CAAC,OAAO,GAAG,CACnD,CAAC;IACJ,CAAC;IAED,MAAM,OAAO,GAAY,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;IAEtE,0EAA0E;IAC1E,MAAM,OAAO,GAAG,OAAO,CAAC,kBAAkB,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAE1E,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;IAC/B,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;IAC3C,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,WAAW,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,CAAC,CAAC;IACzD,MAAM,SAAS,GAAG,KAAK,CAAC,OAAO;QAC7B,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,EAAE,QAAQ,EAAE,MAAM,CAAC;QAC/C,CAAC,CAAC,IAAI,CAAC;IACT,IAAI,KAAK,GAAG,IAAI,CAAC;IACjB,IAAI,CAAC;QACH,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;YACpC,IAAI,OAAO,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM;gBAAE,SAAS;YAC/C,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC;gBAAE,SAAS;YAC/C,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,CAAC;gBAC7D,KAAK,GAAG,KAAK,CAAC;QAClB,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACrC,IAAI,OAAO;gBAAE,MAAM;YACnB,IAAI,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS;YACzC,IAAI,CAAC,OAAO,CAAC,oBAAoB,EAAE,CAAC;gBAClC,MAAM,IAAI,mBAAmB,CAC3B,YAAY,OAAO,CAAC,GAAG,qCAAqC,IAAI,GAAG,CACpE,CAAC;YACJ,CAAC;YACD,wEAAwE;YACxE,sCAAsC;YACtC,MAAM,UAAU,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;YAC1C,IAAI,KAAK,CAAC,OAAO;gBAAE,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAClD,IAAI,KAAK,CAAC,YAAY,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC;gBACnE,SAAS;YACX,MAAM,UAAU,GAAqB;gBACnC,IAAI,EAAE,YAAY;gBAClB,UAAU;gBACV,WAAW,EAAE,IAAI;gBACjB,aAAa,EAAE,IAAI;gBACnB,SAAS;gBACT,QAAQ;gBACR,MAAM;gBACN,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC;aAClB,CAAC;YACF,KAAK,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACzC,KAAK,CAAC,cAAc,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;YAAS,CAAC;QACT,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,EAAG,CAAC;QAClC,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;YAC3B,SAAS,CAAC,MAAM,CAAC,WAAW,EAAE,KAAK,CAAC,WAAW,CAAC,CAAC;YACjD,SAAS,CAAC,MAAM,CAAC,YAAY,EAAE,KAAK,CAAC,YAAY,CAAC,CAAC;QACrD,CAAC;QACD,IAAI,SAAS;YAAE,KAAK,CAAC,SAAS,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QACjD,KAAK,CAAC,YAAY,CAAC,GAAG,EAAE,CAAC;QACzB,KAAK,CAAC,IAAI,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;IAChC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,eAAe,CACtB,KAAgB,EAChB,SAAoB,EACpB,KAAqB,EACrB,MAAc,EACd,QAAyB;IAEzB,MAAM,KAAK,GAAI,SAAS,CAAC,IAAkC,CAAC,KAAK,CAAC,IAAI,CAAE,CAAC;IACzE,MAAM,GAAG,GAAG,IAAI,kBAAkB,CAChC,KAAK,EACL,SAAS,EACT;QACE,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,UAAU,EAAE,KAAK,CAAC,QAAQ,CAAC,EAAE;QAC7B,aAAa,EAAE,KAAK,CAAC,aAAa;QAClC,KAAK;KACN,EACD,MAAM,EACN,QAAQ,CACT,CAAC;IACF,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC;IACjC,MAAM,EAAE,GAAG,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;IACvD,IAAI,EAAE,EAAE,CAAC;QACP,sEAAsE;QACtE,uEAAuE;QACvE,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC;YACjB,MAAM,IAAI,oBAAoB,CAC5B,IAAI,KAAK,CAAC,QAAQ,CAAC,EAAE,4CAA4C,CAClE,CAAC;QACJ,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,IAAI;YAAE,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;IAC7D,CAAC;IACD,2EAA2E;IAC3E,8CAA8C;IAC9C,IAAI,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC,QAAQ,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;QACxD,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IACrC,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,kGAAkG;AAClG,MAAM,UAAU,aAAa,CAC3B,QAAwB,EACxB,SAAiB,EACjB,QAAmB,EACnB,OAAO,GAAG,KAAK,EACf,eAAuC,IAAI,EAC3C,aAAyB,IAAI,UAAU,EAAE,EACzC,WAAmB,iBAAiB;IAEpC,MAAM,KAAK,GAAG,IAAI,SAAS,CACzB,QAAQ,EACR,OAAO,EACP,YAAY,EACZ,UAAU,EACV,QAAQ,CACT,CAAC;IACF,MAAM,KAAK,GAAG,yBAAyB,CACrC,KAAK,EACL,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,EAC3B,UAAU,CAAC,QAAQ,CAAC,EACpB,IAAI,EACJ,QAAQ,CACT,CAAC;IACF,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AAC1B,CAAC;AAED,wEAAwE;AACxE,0EAA0E;AAC1E,sEAAsE;AACtE,SAAS,yBAAyB,CAChC,KAAgB,EAChB,MAAiB,EACjB,MAAc,EACd,QAAyB,EACzB,QAAgB;IAEhB,IAAI,CAAC;QACH,OAAO,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;IACtD,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,IAAI,GAAG,YAAY,UAAU,IAAI,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YACjE,MAAM,IAAI,qBAAqB,CAC7B,uDAAuD,QAAQ,KAAK;gBAClE,kCAAkC,CACrC,CAAC;QACJ,CAAC;QACD,MAAM,GAAG,CAAC;IACZ,CAAC;AACH,CAAC;AAsBD;;;;;;;;GAQG;AACH,MAAM,UAAU,gBAAgB,CAC9B,QAAwB,EACxB,MAAiB,EACjB,MAAc,EACd,UAA2B,EAAE;IAa7B,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,iBAAiB,CAAC;IACvD,MAAM,KAAK,GAAG,IAAI,SAAS,CACzB,QAAQ,EACR,OAAO,CAAC,OAAO,KAAK,IAAI,EACxB,OAAO,CAAC,YAAY,IAAI,IAAI,EAC5B,OAAO,CAAC,UAAU,IAAI,IAAI,UAAU,EAAE,EACtC,QAAQ,CACT,CAAC;IACF,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,YAAY,IAAI,EAAE,CAAC,CAAC,CAAC;IACzD,KAAK,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,CAAC,CAAC;IACjC,MAAM,KAAK,GAAG,yBAAyB,CACrC,KAAK,EACL,MAAM,EACN,MAAM,EACN,OAAO,CAAC,QAAQ,IAAI,IAAI,EACxB,QAAQ,CACT,CAAC;IACF,OAAO;QACL,KAAK;QACL,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,WAAW,EAAE,KAAK,CAAC,eAAe;QAClC,YAAY,EAAE,KAAK,CAAC,gBAAgB;QACpC,SAAS,EAAE,KAAK,CAAC,SAAS;QAC1B,aAAa,EAAE,KAAK,CAAC,aAAa,IAAI,EAAE;QACxC,cAAc,EAAE,KAAK,CAAC,cAAc,IAAI,EAAE;KAC3C,CAAC;AACJ,CAAC"}