@jesscss/core 2.0.0-alpha.1

package/lib/tree/node-base.d.ts

@@ -0,0 +1,359 @@
+import { type TreeContext, type Context } from '../context.js';
+import { type Visitor } from '../visitor/index.js';
+import { type Operator } from './util/calculate.js';
+import type { Class, AbstractClass, Tagged } from 'type-fest';
+import type { Comment } from './comment.js';
+import { type PrintOptions } from './util/print.js';
+import { type MaybePromise } from '@jesscss/awaitable-pipe';
+import type { Rules } from './rules.js';
+import type { Nil } from './nil.js';
+export type { TreeContext };
+type AllNodeOptions = {
+    /**
+     * This seems harder to implement. For now, for anything that needs
+     * to be flattened, we hoist it to the root.
+     */
+    /**
+     * For statements with optional semis,
+     * we flag this for accurate re-serialization.
+     *
+     * @todo - Not sure if we actually need this, but it's here
+     * if we wanted a concrete syntax tree.
+     */
+    semi?: boolean;
+};
+/**
+ * @todo - Clean up and delete these types and symbols, if not used.
+ */
+export type Primitive = undefined | boolean | string | number;
+export type PrimitiveOrFunc = Primitive | ((...args: any[]) => any);
+export declare const ABORT: unique symbol;
+export declare const REMOVE: unique symbol;
+export declare const IS_PROXY: unique symbol;
+export type NodeVisitReturn = void | Node | symbol;
+export type NodeOptions = Record<string, any> & AllNodeOptions;
+export declare const DEFAULT_DATA = "value";
+type BasicNodeTypes = PrimitiveOrFunc | Node;
+type NodeRecordValue = BasicNodeTypes | Array<BasicNodeTypes | PrimitiveOrFunc[]> | Record<string, any>;
+export type NodeValueObject = Record<string, NodeRecordValue>;
+export type NodeValue = BasicNodeTypes | BasicNodeTypes[] | NodeValueObject;
+export type NodeMapArray<T extends NodeValueObject = NodeValueObject, K = keyof T, V = T[string]> = Array<[K, V]>;
+export type LocationInfo = [
+    startOffset: number,
+    startLine: number,
+    startColumn: number,
+    endOffset: number,
+    endLine: number,
+    endColumn: number
+];
+/**
+ * Utility type to mark a node's value as generated
+ */
+export type GeneratedNodeValue<T> = T extends object ? T & {
+    generated: true;
+} : T;
+/**
+ * @todo I think the only utility for this now is we collect
+ * the types of nodes in the tree at first evaluation time.
+ */
+export declare const defineType: <V = never, T extends AbstractClass<Node> = AbstractClass<Node>, P extends ConstructorParameters<T> = ConstructorParameters<T>>(Clazz: T, type: string, shortType?: string) => (...args: [value?: V | P[0] | undefined, options?: P[1] | undefined, location?: P[2] | undefined]) => T extends Class<infer C> ? C : never;
+export type ConditionOperator = 'and' | 'or' | '=' | '>' | '<' | '>=' | '<=';
+export type NoOverride<T> = Tagged<T, 'NoOverride'>;
+export declare const F_VISIBLE = 1;
+export declare const F_MAY_ASYNC = 2;
+/**
+ * @todo - The plan is to use these as signals for evaluation. If we
+ * bubble these correctly, then we can exit early from evaluation for
+ * a speed boost. However, bubbling is not yet water-tight and needs
+ * test coverage.
+ */
+export declare const F_STATIC = 4;
+export declare const F_NON_STATIC = 8;
+/** Whether or not a physical ampersand is in this selector */
+export declare const F_AMPERSAND = 16;
+/** Whether an ampersand was implicitly added (not written by user) */
+export declare const F_IMPLICIT_AMPERSAND = 32;
+/** Selector item produced by extend and eligible for reference-mode rendering. */
+export declare const F_EXTENDED = 64;
+/** Selector item that matches an extend target and should be suppressed in reference-mode output. */
+export declare const F_EXTEND_TARGET = 128;
+export declare const F_DEFAULT = 1;
+/**
+ * The underlying type for all Jess nodes
+ */
+export declare abstract class Node<Data = unknown, O extends NodeOptions = NodeOptions> {
+    _location: LocationInfo | [] | undefined;
+    get location(): LocationInfo | [];
+    private _treeContext;
+    /** Assigned in index to avoid circularity */
+    readonly treeContext: TreeContext;
+    private _options;
+    get options(): O & AllNodeOptions;
+    set options(options: O & AllNodeOptions);
+    /**
+     * Assigned on the prototype, make sure we don't initialize
+     */
+    abstract type: string;
+    abstract shortType: string;
+    get types(): Set<string>;
+    /**
+     * Whitespace or comments before or after a Node.
+     *
+     * If this is `1`, it represents a single space character (' ').
+     * If it's 0, it means there were no pre/post tokens when parsed.
+     * If undefined, it means this was created using the API, and default
+     * formatting can be used.
+     * In a NodeList, any whitespace tokens outside of comments are individually represented,
+     * because they are preserved while the comment may not be.
+     */
+    /** Nil type is resolved at runtime via prototype patching */
+    pre: Array<Comment | Node | string> | 1 | 0 | undefined;
+    post: Array<Comment | Node | string> | 1 | 0 | undefined;
+    /** Will be copied during inherit */
+    state: number;
+    /** Runtime tracking: has preEval been run on this node? */
+    preEvaluated: boolean;
+    /** Runtime tracking: has eval been run on this node? */
+    evaluated: boolean;
+    get visible(): boolean;
+    fullRender: boolean;
+    allowRoot: boolean;
+    allowRuleRoot: boolean;
+    hoistToRoot: boolean | undefined;
+    /**
+     * Code internally should call .create() when making new
+     * nodes, which will automatically mark the node as generated.
+     */
+    generated: boolean;
+    /**
+     * If the node must have a semi separator before
+     * the next node when in a declaration list or main
+     * rules list.
+     */
+    _requiredSemi: boolean;
+    get requiredSemi(): boolean;
+    set requiredSemi(value: boolean);
+    /**
+     * Track the original source when cloned / copied,
+     * rather than keeping the entire tree
+     * Note: This property is defined in constructor as non-enumerable
+     */
+    sourceNode: Node;
+    /**
+     * When evaluating, nodes are assigned an index and depth by the Rules node.
+     * This is used for lookup order. Note, this _will_ be undefined
+     * initially, but we assign it in the Rules node, which is also
+     * where we read it, so this makes the type easier.
+     */
+    index: number;
+    /** @todo - Is there a reliable way to cache this? */
+    get depth(): number;
+    /**
+     * If true, prevents re-parenting of this node.
+     * This is used to maintain source lookup chains.
+     */
+    frozen: boolean;
+    /**
+     * The parent node of this node. Usually, this
+     * shouldn't be set directly. Instead, a parent should use
+     * parent.adopt(thisNode);
+     */
+    readonly parent: Node | undefined;
+    sourceParent: Node | undefined;
+    /** Patched at runtime in node.ts to return Nil instance */
+    nil: () => Nil;
+    protected _value: Data;
+    /**
+     * This is the internal `data` of the node.
+     */
+    get value(): Data;
+    set value(val: Data);
+    /**
+     * This wraps the value in a proxy if it's an object or array.
+     * We do this so that assignment to the sub-nodes will properly
+     * set the parent of the sub-nodes.
+     *
+     * @todo - Test parent setting for objects / arrays.
+     */
+    private _tryProxyWrap;
+    /**
+     * Add a flag to the node's state
+     * Handles STATIC/NON_STATIC exclusivity automatically
+     */
+    addFlag(flag: number): void;
+    /**
+     * Remove a flag from the node's state
+     */
+    removeFlag(flag: number): void;
+    /**
+     * Check if the node has a specific flag
+     */
+    hasFlag(flag: number): boolean;
+    /**
+     * Add multiple flags to the node's state
+     */
+    addFlags(...flags: number[]): void;
+    adopt(node: Node): void;
+    /**
+     * Assign parent to sub-nodes
+     * @note - This will not process the children nodes of children nodes.
+     */
+    private _processNodes;
+    constructor(value: Data, options?: O, location?: LocationInfo, treeContext?: TreeContext);
+    /**
+     * Static factory method to create a generated node.
+     * Has the exact same signature as the constructor but automatically marks the node as generated.
+     *
+     * @param value - The node's value data
+     * @param options - Node options
+     * @param location - Location information
+     * @param treeContext - Tree context
+     * @returns A new node instance with generated flag set if applicable
+     */
+    static create<T extends new (...args: any[]) => Node>(this: T, value: ConstructorParameters<T>[0], options?: ConstructorParameters<T>[1], location?: ConstructorParameters<T>[2], treeContext?: ConstructorParameters<T>[3]): InstanceType<T>;
+    get rulesParent(): Rules | undefined;
+    get sourceRulesParent(): Rules | undefined;
+    /**
+     * Mutates node children in place. Used by eval()?
+     *
+     * Processed nodes must always return a Node.
+     */
+    forEachNode(func: (n: Node, idx?: number) => MaybePromise<Node>): MaybePromise<void | undefined>;
+    static nodeAndPrePost(node: Node): Generator<Node<unknown, NodeOptions> | Comment, void, unknown>;
+    /**
+     * Return an iterator for all nodes / children nodes, including this one
+     */
+    nodes(reverse?: boolean, includePrePost?: boolean): Generator<Node, void, unknown>;
+    /**
+     * An iterator for all node children
+     * @todo - Replace `walkNodes` with this?
+     */
+    children(deep?: boolean, reverse?: boolean, includePrePost?: boolean): Generator<Node, void, unknown>;
+    /**
+     * @todo - Remove?
+     */
+    /**
+     * Accept a visitor (classic visitor pattern).
+     *
+     * Visits the node itself first, then recursively visits children.
+     * This matches the Less.js visitor pattern and allows nodes to control
+     * their own traversal if needed by overriding this method.
+     *
+     * @param visitor - The visitor to accept
+     * @returns The result from visiting this node (may be a replacement node)
+     */
+    accept(visitor: Visitor): Node;
+    /**
+     * @todo
+     * Write tests that make sure that a maybe clone without preserveOriginalNodes
+     * does not clone the nodes, but a maybeClone with preserveOriginalNodes
+     * does clone the nodes all through the tree.
+     */
+    maybeClone(context: Context, deep?: boolean, cloneFn?: (n: Node) => Node): this;
+    clonedEval(context: Context): MaybePromise<Node>;
+    /**
+     * Creates a copy of the current node.
+     *
+     * @note - In the Less source, nodes were always cloned before
+     * mutating, which is why I did it here. However... the only
+     * utility for cloning is to preserve the original node,
+     * or (maybe?) to create a copy which is output differently.
+     *
+     * But... considering the high cost of cloning in terms of
+     * object creation, and the low utility of preserving the original
+     * node, I think we should just only clone when we need to.
+     */
+    clone(deep?: boolean, cloneFn?: (n: Node) => Node): this;
+    /** Remove comments from pre/post */
+    stripPrePost(n: Node, preOrPost: 'pre' | 'post'): void;
+    /** Minimal nil fallback for edge cases where prototype method isn't attached yet */
+    private _createMinimalNil;
+    /**
+     * Same as clone except comments are stripped.
+     * This is used for variable referencing and
+     * selector extending.
+     */
+    copy(deep?: boolean, cloneFn?: (n: Node) => Node): this;
+    /**
+     * `preEval` takes the following steps, which are extended in subclasses:
+     * 1. Clone the node (if the source node is wanted/needed)
+     * 2. Set `preEvaluated` to true
+     * 3. pre-evaluate all children
+     * 4. Return the node
+     *
+     * Mostly this is overridden to resolve names before registering.
+     *
+     * @todo - Update preEval / eval to use static evaluation based on flags.
+     */
+    preEval(context: Context): MaybePromise<Node>;
+    /**
+     * This is the method all nodes will override.
+     * Individual nodes will specify / narrow return type
+     *
+     * By default, evals all children
+     */
+    protected evalNode(context: Context): MaybePromise<Node>;
+    static evalStatic(node: Node, context: Context): MaybePromise<Node>;
+    /**
+     * @note - Make sure you don't call super.eval while evaluating a node. Call it indirectly
+     * from another node.
+     */
+    eval(context: Context): MaybePromise<Node>;
+    /**
+     * This is used when a Node will replace another node.
+     */
+    inherit(node: Node): this;
+    /**
+     * Represents the normalized string value of the node,
+     * for the purposes of comparison with other nodes,
+     * regardless of type.
+     *
+     * Derived nodes will override this with different
+     * normalization algorithms.
+     */
+    valueOf(): Primitive;
+    processPrePost(key: 'pre' | 'post', defaultVal: string | undefined, options: PrintOptions): string;
+    /**
+     * This re-serializes the node, if needed. Will
+     * likely be over-ridden in some cases.
+     *
+     * Note that this is the "as-is" representation of the
+     * node, not the "evaluated" version.
+     *
+     * Note that the ToCssVisitor will be a little
+     * more sophisticated, as it will re-format
+     * to some extent by replacing newlines + spacing
+     * with the appropriate amount of whitespace.
+     *
+     * @note toString() will, by default, include pre/post
+     * white-space and comments, to make serialization
+     * easy.
+     *
+     * In almost all Node cases, this should not be overriden,
+     * and toTrimmedString() should be overridden instead.
+     */
+    toString(options?: PrintOptions): string;
+    /**
+     * The form of the node without pre/post comments and white-space
+     *
+     * @note - Internally, this still calls `toString()` on each value,
+     * so that the internal spacing of the node serialization is
+     * correct. This method just serializes a node without the outer
+     * pre/post nodes.
+     */
+    toTrimmedString(options?: PrintOptions): string;
+    /**
+     * Individual node types will override this.
+     *
+     * This is just a default implementation.
+     * 0 = equal (==)
+     * 1 = greater than (>)
+     * -1 = less than (<)
+     * undefined = not comparable
+     */
+    compare(b: Node, context?: Context): 0 | 1 | -1 | undefined;
+    /** Overridden in index.ts to avoid circularity */
+    operate(b: Node, op: Operator, context: Context): Node;
+    static numericCompare(a: number, b: number): 0 | 1 | -1;
+}
+//# sourceMappingURL=node-base.d.ts.map

package/lib/tree/node-base.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"node-base.d.ts","sourceRoot":"","sources":["../../src/tree/node-base.ts"],"names":[],"mappings":"AACA,OAAO,EACL,KAAK,WAAW,EAChB,KAAK,OAAO,EACb,MAAM,eAAe,CAAC;AACvB,OAAO,EAAE,KAAK,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,KAAK,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AACpD,OAAO,KAAK,EAAE,KAAK,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AAE9D,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAC5C,OAAO,EAAE,KAAK,YAAY,EAAmB,MAAM,iBAAiB,CAAC;AACrE,OAAO,EAAE,KAAK,YAAY,EAAmC,MAAM,yBAAyB,CAAC;AAC7F,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACxC,OAAO,KAAK,EAAE,GAAG,EAAE,MAAM,UAAU,CAAC;AACpC,YAAY,EAAE,WAAW,EAAE,CAAC;AAG5B,KAAK,cAAc,GAAG;IACpB;;;OAGG;IAGH;;;;;;OAMG;IACH,IAAI,CAAC,EAAE,OAAO,CAAC;CAChB,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,SAAS,GAAG,SAAS,GAAG,OAAO,GAAG,MAAM,GAAG,MAAM,CAAC;AAC9D,MAAM,MAAM,eAAe,GAAG,SAAS,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,GAAG,CAAC,CAAC;AAIpE,eAAO,MAAM,KAAK,EAAE,OAAO,MAAwB,CAAC;AACpD,eAAO,MAAM,MAAM,EAAE,OAAO,MAAyB,CAAC;AACtD,eAAO,MAAM,QAAQ,EAAE,OAAO,MAA2B,CAAC;AAC1D,MAAM,MAAM,eAAe,GAAG,IAAI,GAAG,IAAI,GAAG,MAAM,CAAC;AACnD,MAAM,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,cAAc,CAAC;AAC/D,eAAO,MAAM,YAAY,UAAU,CAAC;AAEpC,KAAK,cAAc,GAAG,eAAe,GAAG,IAAI,CAAC;AAC7C,KAAK,eAAe,GAAG,cAAc,GAAG,KAAK,CAAC,cAAc,GAAG,eAAe,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AACxG,MAAM,MAAM,eAAe,GAAG,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;AAC9D,MAAM,MAAM,SAAS,GAAG,cAAc,GAAG,cAAc,EAAE,GAAG,eAAe,CAAC;AAE5E,MAAM,MAAM,YAAY,CACtB,CAAC,SAAS,eAAe,GAAG,eAAe,EAC3C,CAAC,GAAG,MAAM,CAAC,EACX,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,IACX,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AAElB,MAAM,MAAM,YAAY,GAAG;IACzB,WAAW,EAAE,MAAM;IACnB,SAAS,EAAE,MAAM;IACjB,WAAW,EAAE,MAAM;IACnB,SAAS,EAAE,MAAM;IACjB,OAAO,EAAE,MAAM;IACf,SAAS,EAAE,MAAM;CAClB,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,kBAAkB,CAAC,CAAC,IAAI,CAAC,SAAS,MAAM,GAAG,CAAC,GAAG;IAAE,SAAS,EAAE,IAAI,CAAA;CAAE,GAAG,CAAC,CAAC;AAEnF;;;GAGG;AACH,eAAO,MAAM,UAAU,GACrB,CAAC,GAAG,KAAK,EACT,CAAC,SAAS,aAAa,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC,IAAI,CAAC,EACnD,CAAC,SAAS,qBAAqB,CAAC,CAAC,CAAC,GAAG,qBAAqB,CAAC,CAAC,CAAC,EAE7D,OAAO,CAAC,EACR,MAAM,MAAM,EACZ,YAAY,MAAM,MAcV,GAAG,6FAAU,2BAC+C,CAAC,aAKtE,CAAC;AAEF,MAAM,MAAM,iBAAiB,GAAG,KAAK,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,CAAC;AAE7E,MAAM,MAAM,UAAU,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;AAGpD,eAAO,MAAM,SAAS,IAAM,CAAC;AAC7B,eAAO,MAAM,WAAW,IAAO,CAAC;AAChC;;;;;GAKG;AACH,eAAO,MAAM,QAAQ,IAAQ,CAAC;AAC9B,eAAO,MAAM,YAAY,IAAS,CAAC;AACnC,8DAA8D;AAC9D,eAAO,MAAM,WAAW,KAAU,CAAC;AACnC,sEAAsE;AACtE,eAAO,MAAM,oBAAoB,KAAW,CAAC;AAC7C,kFAAkF;AAClF,eAAO,MAAM,UAAU,KAAY,CAAC;AACpC,qGAAqG;AACrG,eAAO,MAAM,eAAe,MAAa,CAAC;AAG1C,eAAO,MAAM,SAAS,IAAY,CAAC;AASnC;;GAEG;AACH,8BAAsB,IAAI,CACxB,IAAI,GAAG,OAAO,EACd,CAAC,SAAS,WAAW,GAAG,WAAW;IAEnC,SAAS,EAAE,YAAY,GAAG,EAAE,GAAG,SAAS,CAAC;IACzC,IAAI,QAAQ,sBAEX;IAED,OAAO,CAAC,YAAY,CAA0B;IAC9C,6CAA6C;IAC7C,SAAiB,WAAW,EAAE,WAAW,CAAC;IAE1C,OAAO,CAAC,QAAQ,CAAiC;IACjD,IAAI,OAAO,IAAI,CAAC,GAAG,cAAc,CAEhC;IAED,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC,GAAG,cAAc,EAEtC;IAED;;OAEG;IACH,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,IAAI,KAAK,IAAI,GAAG,CAAC,MAAM,CAAC,CAEvB;IAED;;;;;;;;;OASG;IACH,6DAA6D;IAC7D,GAAG,EAAE,KAAK,CAAC,OAAO,GAAG,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IACxD,IAAI,EAAE,KAAK,CAAC,OAAO,GAAG,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IAEzD,oCAAoC;IACpC,KAAK,SAAa;IAElB,2DAA2D;IAC3D,YAAY,UAAS;IACrB,wDAAwD;IACxD,SAAS,UAAS;IAElB,IAAI,OAAO,YAEV;IAEO,UAAU,EAAE,OAAO,CAAC;IAE5B,SAAS,UAAS;IAClB,aAAa,UAAS;IACtB,WAAW,EAAE,OAAO,GAAG,SAAS,CAAa;IAE7C;;;OAGG;IACH,SAAS,UAAS;IAElB;;;;OAIG;IACH,aAAa,UAAS;IACtB,IAAI,YAAY,IAIQ,OAAO,CAF9B;IAED,IAAI,YAAY,CAAC,KAAK,EAAE,OAAO,EAE9B;IAED;;;;OAIG;IACK,UAAU,EAAE,IAAI,CAAC;IAEzB;;;;;OAKG;IACH,KAAK,EAAG,MAAM,CAAC;IAEf,qDAAqD;IACrD,IAAI,KAAK,WAQR;IAED;;;OAGG;IACH,MAAM,UAAS;IAEf;;;;OAIG;IACH,SAAiB,MAAM,EAAE,IAAI,GAAG,SAAS,CAAC;IAClC,YAAY,EAAE,IAAI,GAAG,SAAS,CAAC;IAEvC,2DAA2D;IACnD,GAAG,EAAE,MAAM,GAAG,CAAC;IAEvB,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC;IAEvB;;OAEG;IACH,IAAI,KAAK,IAAI,IAAI,CAEhB;IAED,IAAI,KAAK,CAAC,GAAG,EAAE,IAAI,EAMlB;IAED;;;;;;OAMG;IACH,OAAO,CAAC,aAAa;IAiCrB;;;OAGG;IACH,OAAO,CAAC,IAAI,EAAE,MAAM;IAYpB;;OAEG;IACH,UAAU,CAAC,IAAI,EAAE,MAAM;IAIvB;;OAEG;IACH,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAI9B;;OAEG;IACH,QAAQ,CAAC,GAAG,KAAK,EAAE,MAAM,EAAE;IAM3B,KAAK,CAAC,IAAI,EAAE,IAAI;IAmBhB;;;OAGG;IACH,OAAO,CAAC,aAAa;gBAUnB,KAAK,EAAE,IAAI,EACX,OAAO,CAAC,EAAE,CAAC,EACX,QAAQ,CAAC,EAAE,YAAY,EACvB,WAAW,CAAC,EAAE,WAAW;IA6B3B;;;;;;;;;OASG;IACH,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,KAAK,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,IAAI,EAClD,IAAI,EAAE,CAAC,EACP,KAAK,EAAE,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAClC,OAAO,CAAC,EAAE,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EACrC,QAAQ,CAAC,EAAE,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EACtC,WAAW,CAAC,EAAE,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GACxC,YAAY,CAAC,CAAC,CAAC;IAYlB,IAAI,WAAW,IAAI,KAAK,GAAG,SAAS,CAMnC;IAED,IAAI,iBAAiB,IAAI,KAAK,GAAG,SAAS,CAQzC;IAED;;;;OAIG;IACH,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,EAAE,MAAM,KAAK,YAAY,CAAC,IAAI,CAAC;IAgB/D,MAAM,CAAE,cAAc,CAAC,IAAI,EAAE,IAAI;IAkBjC;;OAEG;IACD,KAAK,CAAC,OAAO,CAAC,EAAE,OAAO,EAAE,cAAc,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC;IASpF;;;OAGG;IACD,QAAQ,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,OAAO,EAAE,cAAc,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC;IAevG;;OAEG;IAiBH;;;;;;;;;OASG;IACH,MAAM,CAAC,OAAO,EAAE,OAAO,GAAG,IAAI;IA2C9B;;;;;OAKG;IACH,UAAU,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,KAAK,IAAI,GAAG,IAAI;IAO/E,UAAU,CAAC,OAAO,EAAE,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC;IAchD;;;;;;;;;;;OAWG;IACH,KAAK,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,KAAK,IAAI,GAAG,IAAI;IAoCxD,oCAAoC;IACpC,YAAY,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,GAAG,MAAM;IAc/C,oFAAoF;IACpF,OAAO,CAAC,iBAAiB;IAqBzB;;;;OAIG;IACH,IAAI,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,KAAK,IAAI,GAAG,IAAI;IAwBvD;;;;;;;;;;OAUG;IACH,OAAO,CAAC,OAAO,EAAE,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC;IAuB7C;;;;;OAKG;IACH,SAAS,CAAC,QAAQ,CAAC,OAAO,EAAE,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC;IAYxD,MAAM,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC;IA+BnE;;;OAGG;IACH,IAAI,CAAC,OAAO,EAAE,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC;IAO1C;;OAEG;IACH,OAAO,CAAC,IAAI,EAAE,IAAI;IA4ClB;;;;;;;OAOG;IACH,OAAO,IAAI,SAAS;IAapB,cAAc,CAAC,GAAG,EAAE,KAAK,GAAG,MAAM,EAAE,UAAU,EAAE,MAAM,YAAK,EAAE,OAAO,EAAE,YAAY;IAsClF;;;;;;;;;;;;;;;;;;OAkBG;IACH,QAAQ,CAAC,OAAO,CAAC,EAAE,YAAY,GAAG,MAAM;IAiBxC;;;;;;;OAOG;IACH,eAAe,CAAC,OAAO,CAAC,EAAE,YAAY;IAiBtC;;;;;;;;OAQG;IACH,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,EAAE,OAAO,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS;IAY3D,kDAAkD;IAClD,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI;IAItD,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM;CAmB3C"}