data-structure-typed 2.0.5 → 2.1.1

package/tsconfig-base.json

@@ -1,24 +1,24 @@
 {
   "compilerOptions": {
-    "allowJs": true,                      // Allow the compiler to compile JavaScript files (.js).
-    "allowSyntheticDefaultImports": true, // Allow synthetic default imports to improve module interoperability.
-    "baseUrl": "./",                      // Specify the base path of the root directory for module import.
-    "declaration": true,                  // Generate declaration files (.d.ts) for type checking and code hints.
-    "esModuleInterop": true,              // Enable ECMAScript module interop for correct handling of CommonJS modules.
-    "inlineSourceMap": false,             // Whether to map inline sources to compiled JavaScript files.
-    "lib": ["esnext"],                    // Specify the standard library version of the compilation target.
-    "listEmittedFiles": false,            // List generated output files.
-    "listFiles": false,                   // List source files compiled by the compiler.
-    "noFallthroughCasesInSwitch": true,   // Forced to check whether the case statement in the switch statement has the fallthrough mark.
-    "pretty": true,                       // Output a pretty error message.
-    "resolveJsonModule": true,            // Enable parsing of the JSON module.
-    "skipLibCheck": true,                 // Skip type checking of type libraries.
-    "strict": true,                       // Enable strict type checking, including enabling all strict options.
-    "traceResolution": false,             // Whether to trace the module resolution process.
-    "types": ["node", "jest"],            // Specifies the name of the type declaration file to include.
+    "allowJs": true,
+    "allowSyntheticDefaultImports": true,
+    "baseUrl": "./",
+    "declaration": true,
+    "esModuleInterop": true,
+    "inlineSourceMap": false,
+    "lib": ["esnext"],
+    "listEmittedFiles": false,
+    "listFiles": false,
+    "noFallthroughCasesInSwitch": true,
+    "pretty": true,
+    "resolveJsonModule": true,
+    "skipLibCheck": true,
+    "strict": true,
+    "traceResolution": false,
     "noImplicitOverride": true,
-    "typeRoots": ["node_modules/@types", "src/types", "test/types"]
+
+    "types": ["node"]
   },
-  "compileOnSave": false,                 // Whether to automatically compile when saving.
-  "exclude": ["node_modules", "dist"],    // Specify files or directories that should not be included in the compilation.
-}
+  "compileOnSave": false,
+  "exclude": ["node_modules", "dist"]
+}

package/tsconfig-types.json

@@ -0,0 +1,17 @@
+{
+  "extends": "./tsconfig-base.json",
+  "compilerOptions": {
+    "target": "ES2018",
+    "lib": ["ES2018", "DOM"],
+
+    "module": "NodeNext",
+    "moduleResolution": "NodeNext",
+
+    "declaration": true,
+    "emitDeclarationOnly": true,
+    "declarationMap": false,
+    "outDir": "dist/types"
+  },
+  "include": ["./src/**/*.ts"],
+  "exclude": ["dist", "node_modules", "test"]
+}

package/tsconfig.test.json

@@ -0,0 +1,8 @@
+{
+  "extends": "./tsconfig.json",
+  "compilerOptions": {
+    "noEmit": true,
+    "types": ["node", "jest"]
+  },
+  "include": ["./test/**/*.ts"]
+}

package/tsup.config.js

@@ -1,8 +1,8 @@
-export default [
+import { defineConfig } from 'tsup';
+
+export default defineConfig([
   {
-    entryPoints: {
-      "data-structure-typed": "src/index.ts"
-    },
+    entry: { "data-structure-typed": "src/index.ts" },
     target: 'es6',
     format: ["iife"],
     clean: true,
@@ -11,30 +11,19 @@ export default [
     outDir: "dist/umd",
     globalName: "dataStructureTyped",
     platform: "browser",
-    bundle: true,
-    outExtension() {
-      return {
-        js: `.min.js`,
-      }
-    },
+    outExtension: () => ({ js: '.min.js' }),
   },
+  // 配置 2: Unminified (开发调试用)
   {
-    entryPoints: {
-      "data-structure-typed": "src/index.ts"
-    },
+    entry: { "data-structure-typed": "src/index.ts" },
     target: 'es6',
     format: ["iife"],
-    clean: true,
-    sourcemap: false,
+    clean: false,
+    sourcemap: true,
     minify: false,
     outDir: "dist/umd",
     globalName: "dataStructureTyped",
     platform: "browser",
-    bundle: true,
-    outExtension() {
-      return {
-        js: `.js`,
-      }
-    },
+    outExtension: () => ({ js: '.js' }),
   }
-];
+]);

package/tsup.node.config.ts

@@ -0,0 +1,37 @@
+import { defineConfig } from "tsup";
+
+export default defineConfig([
+  // ESM
+  {
+    entry: { index: "src/index.ts" },
+    format: ["esm"],
+    outDir: "dist/esm",
+    splitting: false,
+    sourcemap: true,
+    minify: false,
+    keepNames: true,
+    treeshake: true,
+    clean: true,
+    target: "es2018",
+    outExtension() {
+      return { js: ".mjs" }
+    },
+  },
+
+  // CJS
+  {
+    entry: { index: "src/index.ts" },
+    format: ["cjs"],
+    outDir: "dist/cjs",
+    splitting: false,
+    sourcemap: true,
+    minify: false,
+    keepNames: true,
+    treeshake: true,
+    clean: false,
+    target: "es2018",
+    outExtension() {
+      return { js: ".cjs" };
+    },
+  },
+]);

package/dist/cjs/common/index.js

@@ -1,29 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Range = exports.DFSOperation = void 0;
-const utils_1 = require("../utils");
-var DFSOperation;
-(function (DFSOperation) {
-    DFSOperation[DFSOperation["VISIT"] = 0] = "VISIT";
-    DFSOperation[DFSOperation["PROCESS"] = 1] = "PROCESS";
-})(DFSOperation || (exports.DFSOperation = DFSOperation = {}));
-class Range {
-    constructor(low, high, includeLow = true, includeHigh = true) {
-        this.low = low;
-        this.high = high;
-        this.includeLow = includeLow;
-        this.includeHigh = includeHigh;
-        if (!((0, utils_1.isComparable)(low) && (0, utils_1.isComparable)(high)))
-            throw new RangeError('low or high is not comparable');
-        if (low > high)
-            throw new RangeError('low must be less than or equal to high');
-    }
-    // Determine whether a key is within the range
-    isInRange(key, comparator) {
-        const lowCheck = this.includeLow ? comparator(key, this.low) >= 0 : comparator(key, this.low) > 0;
-        const highCheck = this.includeHigh ? comparator(key, this.high) <= 0 : comparator(key, this.high) < 0;
-        return lowCheck && highCheck;
-    }
-}
-exports.Range = Range;
-//# sourceMappingURL=index.js.map

package/dist/cjs/common/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/common/index.ts"],"names":[],"mappings":";;;AAAA,oCAAwC;AAExC,IAAY,YAGX;AAHD,WAAY,YAAY;IACtB,iDAAS,CAAA;IACT,qDAAW,CAAA;AACb,CAAC,EAHW,YAAY,4BAAZ,YAAY,QAGvB;AAED,MAAa,KAAK;IAChB,YACS,GAAM,EACN,IAAO,EACP,aAAsB,IAAI,EAC1B,cAAuB,IAAI;QAH3B,QAAG,GAAH,GAAG,CAAG;QACN,SAAI,GAAJ,IAAI,CAAG;QACP,eAAU,GAAV,UAAU,CAAgB;QAC1B,gBAAW,GAAX,WAAW,CAAgB;QAElC,IAAI,CAAC,CAAC,IAAA,oBAAY,EAAC,GAAG,CAAC,IAAI,IAAA,oBAAY,EAAC,IAAI,CAAC,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,+BAA+B,CAAC,CAAC;QACtG,IAAI,GAAG,GAAG,IAAI;YAAE,MAAM,IAAI,UAAU,CAAC,wCAAwC,CAAC,CAAC;IACjF,CAAC;IAED,8CAA8C;IAC9C,SAAS,CAAC,GAAM,EAAE,UAAkC;QAClD,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAClG,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACtG,OAAO,QAAQ,IAAI,SAAS,CAAC;IAC/B,CAAC;CACF;AAjBD,sBAiBC"}

package/dist/cjs/data-structures/base/index.js

@@ -1,19 +0,0 @@
-"use strict";
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    var desc = Object.getOwnPropertyDescriptor(m, k);
-    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
-      desc = { enumerable: true, get: function() { return m[k]; } };
-    }
-    Object.defineProperty(o, k2, desc);
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __exportStar = (this && this.__exportStar) || function(m, exports) {
-    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-__exportStar(require("./iterable-entry-base"), exports);
-__exportStar(require("./iterable-element-base"), exports);
-//# sourceMappingURL=index.js.map

package/dist/cjs/data-structures/base/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/data-structures/base/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,wDAAsC;AACtC,0DAAwC"}

package/dist/cjs/data-structures/base/iterable-element-base.d.ts

@@ -1,116 +0,0 @@
-import { ElementCallback, IterableElementBaseOptions, ReduceElementCallback } from '../../types';
-export declare abstract class IterableElementBase<E, R> {
-    /**
-     * The protected constructor initializes the options for the IterableElementBase class, including the
-     * toElementFn function.
-     * @param [options] - An optional object that contains the following properties:
-     */
-    protected constructor(options?: IterableElementBaseOptions<E, R>);
-    protected _toElementFn?: (rawElement: R) => E;
-    get toElementFn(): ((rawElement: R) => E) | undefined;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     *
-     * The function is an implementation of the Symbol.iterator method that returns an IterableIterator.
-     * @param {any[]} args - The `args` parameter in the code snippet represents a rest parameter. It
-     * allows the function to accept any number of arguments as an array. In this case, the `args`
-     * parameter is used to pass any number of arguments to the `_getIterator` method.
-     */
-    [Symbol.iterator](...args: any[]): IterableIterator<E>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     *
-     * The function returns an iterator that yields all the values in the object.
-     */
-    values(): IterableIterator<E>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     *
-     * The `every` function checks if every element in the array satisfies a given predicate.
-     * @param predicate - The `predicate` parameter is a callback function that takes three arguments:
-     * the current element being processed, its index, and the array it belongs to. It should return a
-     * boolean value indicating whether the element satisfies a certain condition or not.
-     * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value
-     * to be used as `this` when executing the `predicate` function. If `thisArg` is provided, it will be
-     * passed as the `this` value to the `predicate` function. If `thisArg` is
-     * @returns The `every` method is returning a boolean value. It returns `true` if every element in
-     * the array satisfies the provided predicate function, and `false` otherwise.
-     */
-    every(predicate: ElementCallback<E, R, boolean>, thisArg?: any): boolean;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     *
-     * The "some" function checks if at least one element in a collection satisfies a given predicate.
-     * @param predicate - The `predicate` parameter is a callback function that takes three arguments:
-     * `value`, `index`, and `array`. It should return a boolean value indicating whether the current
-     * element satisfies the condition.
-     * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value
-     * to be used as the `this` value when executing the `predicate` function. If `thisArg` is provided,
-     * it will be passed as the `this` value to the `predicate` function. If `thisArg
-     * @returns a boolean value. It returns true if the predicate function returns true for any element
-     * in the collection, and false otherwise.
-     */
-    some(predicate: ElementCallback<E, R, boolean>, thisArg?: any): boolean;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     *
-     * The `forEach` function iterates over each element in an array-like object and calls a callback
-     * function for each element.
-     * @param callbackfn - The callbackfn parameter is a function that will be called for each element in
-     * the array. It takes three arguments: the current element being processed, the index of the current
-     * element, and the array that forEach was called upon.
-     * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value
-     * to be used as `this` when executing the `callbackfn` function. If `thisArg` is provided, it will
-     * be passed as the `this` value to the `callbackfn` function. If `thisArg
-     */
-    forEach(callbackfn: ElementCallback<E, R, void>, thisArg?: any): void;
-    find<S extends E>(predicate: ElementCallback<E, R, S>, thisArg?: any): S | undefined;
-    find(predicate: ElementCallback<E, R, unknown>, thisArg?: any): E | undefined;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     *
-     * The function checks if a given element exists in a collection.
-     * @param {E} element - The parameter "element" is of type E, which means it can be any type. It
-     * represents the element that we want to check for existence in the collection.
-     * @returns a boolean value. It returns true if the element is found in the collection, and false
-     * otherwise.
-     */
-    has(element: E): boolean;
-    reduce(callbackfn: ReduceElementCallback<E, R>): E;
-    reduce(callbackfn: ReduceElementCallback<E, R>, initialValue: E): E;
-    reduce<U>(callbackfn: ReduceElementCallback<E, R, U>, initialValue: U): U;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     *
-     * The `toArray` function converts a linked list into an array.
-     * @returns The `toArray()` method is returning an array of type `E[]`.
-     */
-    toArray(): E[];
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     *
-     * The print function logs the elements of an array to the console.
-     */
-    toVisual(): E[];
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     *
-     * The print function logs the elements of an array to the console.
-     */
-    print(): void;
-    abstract isEmpty(): boolean;
-    abstract clear(): void;
-    abstract clone(): IterableElementBase<E, R>;
-    abstract map(...args: any[]): any;
-    abstract filter(...args: any[]): any;
-    protected abstract _getIterator(...args: any[]): IterableIterator<E>;
-}

package/dist/cjs/data-structures/base/iterable-element-base.js

@@ -1,202 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.IterableElementBase = void 0;
-class IterableElementBase {
-    /**
-     * The protected constructor initializes the options for the IterableElementBase class, including the
-     * toElementFn function.
-     * @param [options] - An optional object that contains the following properties:
-     */
-    constructor(options) {
-        if (options) {
-            const { toElementFn } = options;
-            if (typeof toElementFn === 'function')
-                this._toElementFn = toElementFn;
-            else if (toElementFn)
-                throw new TypeError('toElementFn must be a function type');
-        }
-    }
-    get toElementFn() {
-        return this._toElementFn;
-    }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     *
-     * The function is an implementation of the Symbol.iterator method that returns an IterableIterator.
-     * @param {any[]} args - The `args` parameter in the code snippet represents a rest parameter. It
-     * allows the function to accept any number of arguments as an array. In this case, the `args`
-     * parameter is used to pass any number of arguments to the `_getIterator` method.
-     */
-    *[Symbol.iterator](...args) {
-        yield* this._getIterator(...args);
-    }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     *
-     * The function returns an iterator that yields all the values in the object.
-     */
-    *values() {
-        for (const item of this) {
-            yield item;
-        }
-    }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     *
-     * The `every` function checks if every element in the array satisfies a given predicate.
-     * @param predicate - The `predicate` parameter is a callback function that takes three arguments:
-     * the current element being processed, its index, and the array it belongs to. It should return a
-     * boolean value indicating whether the element satisfies a certain condition or not.
-     * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value
-     * to be used as `this` when executing the `predicate` function. If `thisArg` is provided, it will be
-     * passed as the `this` value to the `predicate` function. If `thisArg` is
-     * @returns The `every` method is returning a boolean value. It returns `true` if every element in
-     * the array satisfies the provided predicate function, and `false` otherwise.
-     */
-    every(predicate, thisArg) {
-        let index = 0;
-        for (const item of this) {
-            if (!predicate.call(thisArg, item, index++, this)) {
-                return false;
-            }
-        }
-        return true;
-    }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     *
-     * The "some" function checks if at least one element in a collection satisfies a given predicate.
-     * @param predicate - The `predicate` parameter is a callback function that takes three arguments:
-     * `value`, `index`, and `array`. It should return a boolean value indicating whether the current
-     * element satisfies the condition.
-     * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value
-     * to be used as the `this` value when executing the `predicate` function. If `thisArg` is provided,
-     * it will be passed as the `this` value to the `predicate` function. If `thisArg
-     * @returns a boolean value. It returns true if the predicate function returns true for any element
-     * in the collection, and false otherwise.
-     */
-    some(predicate, thisArg) {
-        let index = 0;
-        for (const item of this) {
-            if (predicate.call(thisArg, item, index++, this)) {
-                return true;
-            }
-        }
-        return false;
-    }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     *
-     * The `forEach` function iterates over each element in an array-like object and calls a callback
-     * function for each element.
-     * @param callbackfn - The callbackfn parameter is a function that will be called for each element in
-     * the array. It takes three arguments: the current element being processed, the index of the current
-     * element, and the array that forEach was called upon.
-     * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value
-     * to be used as `this` when executing the `callbackfn` function. If `thisArg` is provided, it will
-     * be passed as the `this` value to the `callbackfn` function. If `thisArg
-     */
-    forEach(callbackfn, thisArg) {
-        let index = 0;
-        for (const item of this) {
-            callbackfn.call(thisArg, item, index++, this);
-        }
-    }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     *
-     * The `find` function iterates over the elements of an array-like object and returns the first
-     * element that satisfies the provided callback function.
-     * @param predicate - The predicate parameter is a function that will be called for each element in
-     * the array. It takes three arguments: the current element being processed, the index of the current
-     * element, and the array itself. The function should return a boolean value indicating whether the
-     * current element matches the desired condition.
-     * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value
-     * to be used as `this` when executing the `callbackfn` function. If `thisArg` is provided, it will
-     * be passed as the `this` value to the `callbackfn` function. If `thisArg
-     * @returns The `find` method returns the first element in the array that satisfies the provided
-     * callback function. If no element satisfies the callback function, `undefined` is returned.
-     */
-    find(predicate, thisArg) {
-        let index = 0;
-        for (const item of this) {
-            if (predicate.call(thisArg, item, index++, this))
-                return item;
-        }
-        return;
-    }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     *
-     * The function checks if a given element exists in a collection.
-     * @param {E} element - The parameter "element" is of type E, which means it can be any type. It
-     * represents the element that we want to check for existence in the collection.
-     * @returns a boolean value. It returns true if the element is found in the collection, and false
-     * otherwise.
-     */
-    has(element) {
-        for (const ele of this) {
-            if (ele === element)
-                return true;
-        }
-        return false;
-    }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     *
-     * The `reduce` function iterates over the elements of an array-like object and applies a callback
-     * function to reduce them into a single value.
-     * @param callbackfn - The callbackfn parameter is a function that will be called for each element in
-     * the array. It takes four arguments:
-     * @param {U} initialValue - The initialValue parameter is the initial value of the accumulator. It
-     * is the value that the accumulator starts with before the reduction operation begins.
-     * @returns The `reduce` method is returning the final value of the accumulator after iterating over
-     * all the elements in the array and applying the callback function to each element.
-     */
-    reduce(callbackfn, initialValue) {
-        let accumulator = initialValue !== null && initialValue !== void 0 ? initialValue : 0;
-        let index = 0;
-        for (const item of this) {
-            accumulator = callbackfn(accumulator, item, index++, this);
-        }
-        return accumulator;
-    }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     *
-     * The `toArray` function converts a linked list into an array.
-     * @returns The `toArray()` method is returning an array of type `E[]`.
-     */
-    toArray() {
-        return [...this];
-    }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     *
-     * The print function logs the elements of an array to the console.
-     */
-    toVisual() {
-        return [...this];
-    }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     *
-     * The print function logs the elements of an array to the console.
-     */
-    print() {
-        console.log(this.toVisual());
-    }
-}
-exports.IterableElementBase = IterableElementBase;
-//# sourceMappingURL=iterable-element-base.js.map

package/dist/cjs/data-structures/base/iterable-element-base.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"iterable-element-base.js","sourceRoot":"","sources":["../../../../src/data-structures/base/iterable-element-base.ts"],"names":[],"mappings":";;;AAEA,MAAsB,mBAAmB;IACvC;;;;OAIG;IACH,YAAsB,OAA0C;QAC9D,IAAI,OAAO,EAAE,CAAC;YACZ,MAAM,EAAE,WAAW,EAAE,GAAG,OAAO,CAAC;YAChC,IAAI,OAAO,WAAW,KAAK,UAAU;gBAAE,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;iBAClE,IAAI,WAAW;gBAAE,MAAM,IAAI,SAAS,CAAC,qCAAqC,CAAC,CAAC;QACnF,CAAC;IACH,CAAC;IAID,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED;;;;;;;;OAQG;IACH,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,GAAG,IAAW;QAC/B,KAAK,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,IAAI,CAAC,CAAC;IACpC,CAAC;IAED;;;;;OAKG;IACH,CAAC,MAAM;QACL,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,IAAI,CAAC;QACb,CAAC;IACH,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,KAAK,CAAC,SAAyC,EAAE,OAAa;QAC5D,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;gBAClD,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,IAAI,CAAC,SAAyC,EAAE,OAAa;QAC3D,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;gBACjD,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,OAAO,CAAC,UAAuC,EAAE,OAAa;QAC5D,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,CAAC;QAChD,CAAC;IACH,CAAC;IAKD;;;;;;;;;;;;;;;OAeG;IACH,IAAI,CAAC,SAAyC,EAAE,OAAa;QAC3D,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;QAChE,CAAC;QAED,OAAO;IACT,CAAC;IAED;;;;;;;;;OASG;IACH,GAAG,CAAC,OAAU;QACZ,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,GAAG,KAAK,OAAO;gBAAE,OAAO,IAAI,CAAC;QACnC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAMD;;;;;;;;;;;;OAYG;IACH,MAAM,CAAI,UAA0C,EAAE,YAAgB;QACpE,IAAI,WAAW,GAAG,YAAY,aAAZ,YAAY,cAAZ,YAAY,GAAK,CAAO,CAAC;QAC3C,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,WAAW,GAAG,UAAU,CAAC,WAAW,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,CAAC;QAC7D,CAAC;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IAED;;;;;;OAMG;IACH,OAAO;QACL,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC;IACnB,CAAC;IAED;;;;;OAKG;IACH,QAAQ;QACN,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC;IACnB,CAAC;IAED;;;;;OAKG;IACH,KAAK;QACH,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;IAC/B,CAAC;CAaF;AAlOD,kDAkOC"}