data-structure-typed 2.1.0 → 2.1.1

package/test/unit/data-structures/binary-tree/tree-multi-map.test.ts

@@ -1,6 +1,6 @@
 import { BinaryTreeNode, BSTNode, IBinaryTree, TreeMultiMap, TreeMultiMapNode } from '../../../../src';
 import { getRandomInt } from '../../../utils';
-
+import { Range } from '../../../../src';
 import { isDebugTest } from '../../../config';
 import { costOfLiving } from './data/cost-of-living-by-country';
 
@@ -1003,3 +1003,111 @@ describe('classic use', () => {
     ]);
   });
 });
+
+interface Product {
+  id: string;
+  name: string;
+  price: number;
+}
+
+// Build a TreeMultiMap in "multi" mode: price -> Product[]
+function buildIndex(sample: Product[]): TreeMultiMap<number, Product, Product> {
+  return new TreeMultiMap<number, Product, Product>(sample, {
+    toEntryFn: raw => [raw.price, [raw]],
+    isMapMode: false // ensure multi-value per key
+  });
+}
+
+// Helper: normalize getLeftMost/getRightMost return (key or node.key)
+function leftKey(tmm: TreeMultiMap<number, Product, Product>): number | undefined {
+  const v = tmm.getLeftMost();
+  return v == null ? undefined : typeof v === 'object' ? v.key : v;
+}
+function rightKey(tmm: TreeMultiMap<number, Product, Product>): number | undefined {
+  const v = tmm.getRightMost();
+  return v == null ? undefined : typeof v === 'object' ? v.key : v;
+}
+
+describe('TreeMultiMap — rangeSearch-driven semantics', () => {
+  const sample: Product[] = [
+    { id: 'p1', name: 'Basic Tee', price: 35.5 },
+    { id: 'p2', name: 'Sport Socks', price: 12.9 },
+    { id: 'p3', name: 'Denim Jeans', price: 79.9 },
+    { id: 'p4', name: 'Hoodie', price: 79.9 },
+    { id: 'p5', name: 'Sneakers', price: 99.0 },
+    { id: 'p6', name: 'Backpack', price: 120.0 },
+    { id: 'p7', name: 'Watch', price: 199.0 },
+    { id: 'p8', name: 'Hat', price: 35.5 }
+  ];
+
+  it('stores multiple values under the same key and preserves insertion order in the bucket', () => {
+    const tmm = buildIndex(sample);
+    // Use rangeSearch on the single key [35.5, 35.5]
+    const groups = tmm.rangeSearch(new Range(35.5, 35.5, true, true), node => node.value).flat();
+    expect(groups.map(p => p!.id)).toEqual(['p1', 'p8']); // insertion order kept
+  });
+
+  it('iterates keys in ascending order (via keys())', () => {
+    const tmm = buildIndex(sample);
+    expect([...tmm.keys()]).toEqual([12.9, 35.5, 79.9, 99, 120, 199]);
+  });
+
+  it('rangeSearch respects inclusive/exclusive bounds — flat result', () => {
+    const tmm = buildIndex(sample);
+
+    // [35.5, 100): include 35.5, exclude 100
+    const res = tmm.rangeSearch(new Range(35.5, 100, true, false), node => node.value).flat();
+
+    expect(res.map(p => `${p!.name}($${p!.price})`)).toEqual([
+      'Basic Tee($35.5)',
+      'Hat($35.5)',
+      'Denim Jeans($79.9)',
+      'Hoodie($79.9)',
+      'Sneakers($99)'
+    ]);
+    expect(res.map(p => p!.id)).toEqual(['p1', 'p8', 'p3', 'p4', 'p5']);
+  });
+
+  it('rangeSearch returns grouped buckets — both ends exclusive', () => {
+    const tmm = buildIndex(sample);
+
+    // (80, 200) → keys 99, 120, 199
+    const groups = tmm.rangeSearch(new Range(80, 200, false, false), node => ({ key: node.key, bucket: node.value }));
+
+    expect(groups.map(g => g.key)).toEqual([99, 120, 199]);
+    expect(groups.map(g => g.bucket!.map(i => i.id))).toEqual([['p5'], ['p6'], ['p7']]);
+  });
+
+  it('rangeSearch across full domain by using current min/max keys (no Infinity)', () => {
+    const tmm = buildIndex(sample);
+    const lo = tmm.getLeftMost(); // expected 12.9
+    const hi = tmm.getRightMost(); // expected 199
+
+    const groups = tmm.rangeSearch(new Range(lo, hi, true, true), node => ({
+      key: node.key,
+      count: node.value!.length
+    }));
+
+    // 12.9:1 | 35.5:2 | 79.9:2 | 99:1 | 120:1 | 199:1
+    expect(groups.map(g => `${g.key}:${g.count}`).join(' | ')).toBe('12.9:1 | 35.5:2 | 79.9:2 | 99:1 | 120:1 | 199:1');
+  });
+
+  it('empty TreeMultiMap → rangeSearch returns empty results', () => {
+    const tmm = buildIndex([]);
+    // Any finite range should yield empty
+    const flat = tmm.rangeSearch(new Range(0, 100, true, true), n => n.value).flat();
+    expect(flat).toEqual([]);
+
+    const groups = tmm.rangeSearch(new Range(0, 100, true, true), (node: any) => ({
+      key: node.key,
+      bucket: node.value as Product[]
+    }));
+    expect(groups).toEqual([]);
+  });
+
+  it('left-most/right-most key helpers (if API returns node, unwrap .key)', () => {
+    const tmm = buildIndex(sample);
+    expect(leftKey(tmm)).toBe(12.9);
+    expect(rightKey(tmm)).toBe(199);
+  });
+});

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.js

@@ -1,244 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.IterableElementBase = void 0;
-/**
- * Base class that makes a data structure iterable and provides common
- * element-wise utilities (e.g., map/filter/reduce/find).
- *
- * @template E The public element type yielded by the structure.
- * @template R The underlying "raw" element type used internally or by converters.
- *
- * @remarks
- * This class implements the JavaScript iteration protocol (via `Symbol.iterator`)
- * and offers array-like helpers with predictable time/space complexity.
- */
-class IterableElementBase {
-    /**
-     * Create a new iterable base.
-     *
-     * @param options Optional behavior overrides. When provided, a `toElementFn`
-     * is used to convert a raw element (`R`) into a public element (`E`).
-     *
-     * @remarks
-     * Time O(1), Space O(1).
-     */
-    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');
-        }
-    }
-    /**
-     * Exposes the current `toElementFn`, if configured.
-     *
-     * @returns The converter function or `undefined` when not set.
-     * @remarks
-     * Time O(1), Space O(1).
-     */
-    get toElementFn() {
-        return this._toElementFn;
-    }
-    /**
-     * Returns an iterator over the structure's elements.
-     *
-     * @param args Optional iterator arguments forwarded to the internal iterator.
-     * @returns An `IterableIterator<E>` that yields the elements in traversal order.
-     *
-     * @remarks
-     * Producing the iterator is O(1); consuming the entire iterator is Time O(n) with O(1) extra space.
-     */
-    *[Symbol.iterator](...args) {
-        yield* this._getIterator(...args);
-    }
-    /**
-     * Returns an iterator over the values (alias of the default iterator).
-     *
-     * @returns An `IterableIterator<E>` over all elements.
-     * @remarks
-     * Creating the iterator is O(1); full iteration is Time O(n), Space O(1).
-     */
-    *values() {
-        for (const item of this)
-            yield item;
-    }
-    /**
-     * Tests whether all elements satisfy the predicate.
-     *
-     * @template TReturn
-     * @param predicate Function invoked for each element with signature `(value, index, self)`.
-     * @param thisArg Optional `this` binding for the predicate.
-     * @returns `true` if every element passes; otherwise `false`.
-     *
-     * @remarks
-     * Time O(n) in the worst case; may exit early when the first failure is found. Space O(1).
-     */
-    every(predicate, thisArg) {
-        let index = 0;
-        for (const item of this) {
-            if (thisArg === undefined) {
-                if (!predicate(item, index++, this))
-                    return false;
-            }
-            else {
-                const fn = predicate;
-                if (!fn.call(thisArg, item, index++, this))
-                    return false;
-            }
-        }
-        return true;
-    }
-    /**
-     * Tests whether at least one element satisfies the predicate.
-     *
-     * @param predicate Function invoked for each element with signature `(value, index, self)`.
-     * @param thisArg Optional `this` binding for the predicate.
-     * @returns `true` if any element passes; otherwise `false`.
-     *
-     * @remarks
-     * Time O(n) in the worst case; may exit early on first success. Space O(1).
-     */
-    some(predicate, thisArg) {
-        let index = 0;
-        for (const item of this) {
-            if (thisArg === undefined) {
-                if (predicate(item, index++, this))
-                    return true;
-            }
-            else {
-                const fn = predicate;
-                if (fn.call(thisArg, item, index++, this))
-                    return true;
-            }
-        }
-        return false;
-    }
-    /**
-     * Invokes a callback for each element in iteration order.
-     *
-     * @param callbackfn Function invoked per element with signature `(value, index, self)`.
-     * @param thisArg Optional `this` binding for the callback.
-     * @returns `void`.
-     *
-     * @remarks
-     * Time O(n), Space O(1).
-     */
-    forEach(callbackfn, thisArg) {
-        let index = 0;
-        for (const item of this) {
-            if (thisArg === undefined) {
-                callbackfn(item, index++, this);
-            }
-            else {
-                const fn = callbackfn;
-                fn.call(thisArg, item, index++, this);
-            }
-        }
-    }
-    // Implementation signature
-    find(predicate, thisArg) {
-        let index = 0;
-        for (const item of this) {
-            if (thisArg === undefined) {
-                if (predicate(item, index++, this))
-                    return item;
-            }
-            else {
-                const fn = predicate;
-                if (fn.call(thisArg, item, index++, this))
-                    return item;
-            }
-        }
-        return;
-    }
-    /**
-     * Checks whether a strictly-equal element exists in the structure.
-     *
-     * @param element The element to test with `===` equality.
-     * @returns `true` if an equal element is found; otherwise `false`.
-     *
-     * @remarks
-     * Time O(n) in the worst case. Space O(1).
-     */
-    has(element) {
-        for (const ele of this)
-            if (ele === element)
-                return true;
-        return false;
-    }
-    /**
-     * Reduces all elements to a single accumulated value.
-     *
-     * @overload
-     * @param callbackfn Reducer of signature `(acc, value, index, self) => nextAcc`. The first element is used as the initial accumulator.
-     * @returns The final accumulated value typed as `E`.
-     *
-     * @overload
-     * @param callbackfn Reducer of signature `(acc, value, index, self) => nextAcc`.
-     * @param initialValue The initial accumulator value of type `E`.
-     * @returns The final accumulated value typed as `E`.
-     *
-     * @overload
-     * @template U The accumulator type when it differs from `E`.
-     * @param callbackfn Reducer of signature `(acc: U, value, index, self) => U`.
-     * @param initialValue The initial accumulator value of type `U`.
-     * @returns The final accumulated value typed as `U`.
-     *
-     * @remarks
-     * Time O(n), Space O(1). Throws if called on an empty structure without `initialValue`.
-     */
-    reduce(callbackfn, initialValue) {
-        let index = 0;
-        const iter = this[Symbol.iterator]();
-        let acc;
-        if (arguments.length >= 2) {
-            acc = initialValue;
-        }
-        else {
-            const first = iter.next();
-            if (first.done)
-                throw new TypeError('Reduce of empty structure with no initial value');
-            acc = first.value;
-            index = 1;
-        }
-        for (const value of iter) {
-            acc = callbackfn(acc, value, index++, this);
-        }
-        return acc;
-    }
-    /**
-     * Materializes the elements into a new array.
-     *
-     * @returns A shallow array copy of the iteration order.
-     * @remarks
-     * Time O(n), Space O(n).
-     */
-    toArray() {
-        return [...this];
-    }
-    /**
-     * Returns a representation of the structure suitable for quick visualization.
-     * Defaults to an array of elements; subclasses may override to provide richer visuals.
-     *
-     * @returns A visual representation (array by default).
-     * @remarks
-     * Time O(n), Space O(n).
-     */
-    toVisual() {
-        return [...this];
-    }
-    /**
-     * Prints `toVisual()` to the console. Intended for quick debugging.
-     *
-     * @returns `void`.
-     * @remarks
-     * Time O(n) due to materialization, Space O(n) for the intermediate representation.
-     */
-    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;;;;;;;;;;GAUG;AACH,MAAsB,mBAAmB;IACvC;;;;;;;;OAQG;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;IAUD;;;;;;OAMG;IACH,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED;;;;;;;;OAQG;IACH,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,GAAG,IAAe;QACnC,KAAK,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,IAAI,CAAC,CAAC;IACpC,CAAC;IAED;;;;;;OAMG;IACH,CAAC,MAAM;QACL,KAAK,MAAM,IAAI,IAAI,IAAI;YAAE,MAAM,IAAI,CAAC;IACtC,CAAC;IAED;;;;;;;;;;OAUG;IACH,KAAK,CAAC,SAAyC,EAAE,OAAiB;QAChE,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC1B,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC;oBAAE,OAAO,KAAK,CAAC;YACpD,CAAC;iBAAM,CAAC;gBACN,MAAM,EAAE,GAAG,SAAoE,CAAC;gBAChF,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC;oBAAE,OAAO,KAAK,CAAC;YAC3D,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;;OASG;IACH,IAAI,CAAC,SAAyC,EAAE,OAAiB;QAC/D,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC1B,IAAI,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC;oBAAE,OAAO,IAAI,CAAC;YAClD,CAAC;iBAAM,CAAC;gBACN,MAAM,EAAE,GAAG,SAAoE,CAAC;gBAChF,IAAI,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC;oBAAE,OAAO,IAAI,CAAC;YACzD,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;;;OASG;IACH,OAAO,CAAC,UAAuC,EAAE,OAAiB;QAChE,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC1B,UAAU,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,CAAC;YAClC,CAAC;iBAAM,CAAC;gBACN,MAAM,EAAE,GAAG,UAAkE,CAAC;gBAC9E,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,CAAC;YACxC,CAAC;QACH,CAAC;IACH,CAAC;IAuBD,2BAA2B;IAC3B,IAAI,CAAC,SAAyC,EAAE,OAAiB;QAC/D,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC1B,IAAI,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC;oBAAE,OAAO,IAAI,CAAC;YAClD,CAAC;iBAAM,CAAC;gBACN,MAAM,EAAE,GAAG,SAAoE,CAAC;gBAChF,IAAI,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC;oBAAE,OAAO,IAAI,CAAC;YACzD,CAAC;QACH,CAAC;QACD,OAAO;IACT,CAAC;IAED;;;;;;;;OAQG;IACH,GAAG,CAAC,OAAU;QACZ,KAAK,MAAM,GAAG,IAAI,IAAI;YAAE,IAAI,GAAG,KAAK,OAAO;gBAAE,OAAO,IAAI,CAAC;QACzD,OAAO,KAAK,CAAC;IACf,CAAC;IAMD;;;;;;;;;;;;;;;;;;;;OAoBG;IACH,MAAM,CAAI,UAA0C,EAAE,YAAgB;QACpE,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;QACrC,IAAI,GAAM,CAAC;QAEX,IAAI,SAAS,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAC1B,GAAG,GAAG,YAAiB,CAAC;QAC1B,CAAC;aAAM,CAAC;YACN,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YAC1B,IAAI,KAAK,CAAC,IAAI;gBAAE,MAAM,IAAI,SAAS,CAAC,iDAAiD,CAAC,CAAC;YACvF,GAAG,GAAG,KAAK,CAAC,KAAqB,CAAC;YAClC,KAAK,GAAG,CAAC,CAAC;QACZ,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,IAA8B,EAAE,CAAC;YACnD,GAAG,GAAG,UAAU,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,CAAC;QAC9C,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;;;OAMG;IACH,OAAO;QACL,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC;IACnB,CAAC;IAED;;;;;;;OAOG;IACH,QAAQ;QACN,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC;IACnB,CAAC;IAED;;;;;;OAMG;IACH,KAAK;QACH,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;IAC/B,CAAC;CAkFF;AAlVD,kDAkVC"}