@simplysm/core-common 13.0.0-beta.1

package/dist/extensions/arr-ext.js

@@ -0,0 +1,546 @@
+import "./map-ext";
+import { objClone, objEqual, objMerge } from "../utils/obj";
+import { DateTime } from "../types/date-time";
+import { DateOnly } from "../types/date-only";
+import { Time } from "../types/time";
+import { Uuid } from "../types/uuid";
+import { ArgumentError } from "../errors/argument-error";
+import { SdError } from "../errors/sd-error";
+import { compareForOrder } from "./arr-ext.helpers";
+const arrayReadonlyExtensions = {
+  single(predicate) {
+    const arr = predicate !== void 0 ? this.filter(predicate) : this;
+    if (arr.length > 1) {
+      throw new ArgumentError("\uBCF5\uC218\uC758 \uACB0\uACFC\uBB3C\uC774 \uC788\uC2B5\uB2C8\uB2E4.", { count: arr.length });
+    }
+    return arr[0];
+  },
+  first(predicate) {
+    return predicate !== void 0 ? this.find(predicate) : this[0];
+  },
+  async filterAsync(predicate) {
+    const arr = [];
+    for (let i = 0; i < this.length; i++) {
+      if (await predicate(this[i], i)) {
+        arr.push(this[i]);
+      }
+    }
+    return arr;
+  },
+  last(predicate) {
+    if (predicate !== void 0) {
+      for (let i = this.length - 1; i >= 0; i--) {
+        if (predicate(this[i], i)) {
+          return this[i];
+        }
+      }
+      return void 0;
+    } else {
+      return this[this.length - 1];
+    }
+  },
+  filterExists() {
+    return this.filter((item) => item != null);
+  },
+  ofType(type) {
+    if (typeof type === "string") {
+      return this.filter((item) => {
+        switch (type) {
+          case "string":
+            return typeof item === "string";
+          case "number":
+            return typeof item === "number";
+          case "boolean":
+            return typeof item === "boolean";
+          case "DateTime":
+            return item instanceof DateTime;
+          case "DateOnly":
+            return item instanceof DateOnly;
+          case "Time":
+            return item instanceof Time;
+          case "Uuid":
+            return item instanceof Uuid;
+          case "Bytes":
+            return item instanceof Uint8Array;
+          default: {
+            const _exhaustive = type;
+            throw new ArgumentError(`\uC9C0\uC6D0\uD558\uC9C0 \uC54A\uB294 \uD0C0\uC785: ${_exhaustive}`);
+          }
+        }
+      });
+    }
+    return this.filter((item) => item instanceof type || (item == null ? void 0 : item.constructor) === type);
+  },
+  async mapAsync(selector) {
+    const result = [];
+    for (let i = 0; i < this.length; i++) {
+      result.push(await selector(this[i], i));
+    }
+    return result;
+  },
+  mapMany(selector) {
+    const arr = selector ? this.map(selector) : this;
+    return arr.flat().filterExists();
+  },
+  async mapManyAsync(selector) {
+    const arr = selector !== void 0 ? await this.mapAsync(selector) : this;
+    return arr.mapMany();
+  },
+  parallelAsync(fn) {
+    return Promise.all(this.map(fn));
+  },
+  // 배열을 키별로 그룹화
+  // 성능 고려사항:
+  // - primitive 키 (string, number 등): O(n) - Map 기반
+  // - 객체 키: O(n²) - objEqual 비교
+  groupBy(keySelector, valueSelector) {
+    const result = [];
+    const primitiveKeyIndex = /* @__PURE__ */ new Map();
+    for (let i = 0; i < this.length; i++) {
+      const keyObj = keySelector(this[i], i);
+      const valueObj = valueSelector !== void 0 ? valueSelector(this[i], i) : this[i];
+      if (keyObj == null || typeof keyObj !== "object") {
+        const keyStr = typeof keyObj + ":" + String(keyObj);
+        const existingIndex = primitiveKeyIndex.get(keyStr);
+        if (existingIndex !== void 0) {
+          result[existingIndex].values.push(valueObj);
+        } else {
+          primitiveKeyIndex.set(keyStr, result.length);
+          result.push({ key: keyObj, values: [valueObj] });
+        }
+        continue;
+      }
+      const existsRecord = result.find((item) => objEqual(item.key, keyObj));
+      if (existsRecord !== void 0) {
+        existsRecord.values.push(valueObj);
+      } else {
+        result.push({ key: keyObj, values: [valueObj] });
+      }
+    }
+    return result;
+  },
+  toMap(keySelector, valueSelector) {
+    const result = /* @__PURE__ */ new Map();
+    for (let i = 0; i < this.length; i++) {
+      const item = this[i];
+      const keyObj = keySelector(item, i);
+      const valueObj = valueSelector !== void 0 ? valueSelector(item, i) : item;
+      if (result.has(keyObj)) {
+        throw new ArgumentError("\uD0A4\uAC00 \uC911\uBCF5\uB418\uC5C8\uC2B5\uB2C8\uB2E4.", { duplicatedKey: keyObj });
+      }
+      result.set(keyObj, valueObj);
+    }
+    return result;
+  },
+  async toMapAsync(keySelector, valueSelector) {
+    const result = /* @__PURE__ */ new Map();
+    for (let i = 0; i < this.length; i++) {
+      const item = this[i];
+      const keyObj = await keySelector(item, i);
+      const valueObj = valueSelector !== void 0 ? await valueSelector(item, i) : item;
+      if (result.has(keyObj)) {
+        throw new ArgumentError("\uD0A4\uAC00 \uC911\uBCF5\uB418\uC5C8\uC2B5\uB2C8\uB2E4.", { duplicatedKey: keyObj });
+      }
+      result.set(keyObj, valueObj);
+    }
+    return result;
+  },
+  toArrayMap(keySelector, valueSelector) {
+    const result = /* @__PURE__ */ new Map();
+    for (let i = 0; i < this.length; i++) {
+      const item = this[i];
+      const keyObj = keySelector(item, i);
+      const valueObj = valueSelector !== void 0 ? valueSelector(item, i) : item;
+      const arr = result.getOrCreate(keyObj, []);
+      arr.push(valueObj);
+    }
+    return result;
+  },
+  toSetMap(keySelector, valueSelector) {
+    const result = /* @__PURE__ */ new Map();
+    for (let i = 0; i < this.length; i++) {
+      const item = this[i];
+      const keyObj = keySelector(item, i);
+      const valueObj = valueSelector !== void 0 ? valueSelector(item, i) : item;
+      const set = result.getOrCreate(keyObj, /* @__PURE__ */ new Set());
+      set.add(valueObj);
+    }
+    return result;
+  },
+  toMapValues(keySelector, valueSelector) {
+    const itemsMap = /* @__PURE__ */ new Map();
+    for (let i = 0; i < this.length; i++) {
+      const item = this[i];
+      const keyObj = keySelector(item, i);
+      const arr = itemsMap.getOrCreate(keyObj, []);
+      arr.push(item);
+    }
+    const result = /* @__PURE__ */ new Map();
+    for (const key of itemsMap.keys()) {
+      result.set(key, valueSelector(itemsMap.get(key)));
+    }
+    return result;
+  },
+  toObject(keySelector, valueSelector) {
+    const result = {};
+    for (let i = 0; i < this.length; i++) {
+      const item = this[i];
+      const key = keySelector(item, i);
+      const valueObj = valueSelector !== void 0 ? valueSelector(item, i) : item;
+      if (result[key] !== void 0) {
+        throw new ArgumentError("\uD0A4\uAC00 \uC911\uBCF5\uB418\uC5C8\uC2B5\uB2C8\uB2E4.", { duplicatedKey: key });
+      }
+      result[key] = valueObj;
+    }
+    return result;
+  },
+  toTree(key, parentKey) {
+    const childrenMap = this.toArrayMap((item) => item[parentKey]);
+    const fn = (items) => {
+      return items.map((item) => ({
+        ...objClone(item),
+        children: fn(childrenMap.get(item[key]) ?? [])
+      }));
+    };
+    const rootItems = this.filter((item1) => item1[parentKey] == null);
+    return fn(rootItems);
+  },
+  distinct(options) {
+    const opts = typeof options === "boolean" ? { matchAddress: options } : options ?? {};
+    if (opts.matchAddress === true) return [...new Set(this)];
+    if (opts.keyFn) {
+      const seen2 = /* @__PURE__ */ new Set();
+      const result2 = [];
+      for (const item of this) {
+        const key = opts.keyFn(item);
+        if (!seen2.has(key)) {
+          seen2.add(key);
+          result2.push(item);
+        }
+      }
+      return result2;
+    }
+    const seen = /* @__PURE__ */ new Map();
+    const seenRefs = /* @__PURE__ */ new Set();
+    const result = [];
+    for (const item of this) {
+      if (item === null || typeof item !== "object") {
+        const type = typeof item;
+        if (type === "symbol" || type === "function") {
+          if (!seenRefs.has(item)) {
+            seenRefs.add(item);
+            result.push(item);
+          }
+          continue;
+        }
+        let key = type + ":";
+        if (Object.is(item, -0)) {
+          key += "-0";
+        } else {
+          key += String(item);
+        }
+        if (!seen.has(key)) {
+          seen.set(key, item);
+          result.push(item);
+        }
+        continue;
+      }
+      if (!result.some((item1) => objEqual(item1, item))) {
+        result.push(item);
+      }
+    }
+    return result;
+  },
+  orderBy(selector) {
+    return [...this].sort((p, n) => {
+      const pp = selector == null ? p : selector(p);
+      const pn = selector == null ? n : selector(n);
+      return compareForOrder(pp, pn, false);
+    });
+  },
+  orderByDesc(selector) {
+    return [...this].sort((p, n) => {
+      const pp = selector == null ? p : selector(p);
+      const pn = selector == null ? n : selector(n);
+      return compareForOrder(pp, pn, true);
+    });
+  },
+  diffs(target, options) {
+    const result = [];
+    const uncheckedTarget = [...target];
+    const uncheckedTargetSet = new Set(uncheckedTarget);
+    const hasKeys = (options == null ? void 0 : options.keys) !== void 0 && options.keys.length > 0;
+    const excludeOpts = { topLevelExcludes: options == null ? void 0 : options.excludes };
+    const keyIndexedTarget = hasKeys ? /* @__PURE__ */ new Map() : void 0;
+    if (keyIndexedTarget) {
+      for (const targetItem of uncheckedTarget) {
+        const keyStr = JSON.stringify(options.keys.map((k) => targetItem[k]));
+        const arr = keyIndexedTarget.get(keyStr);
+        if (arr) {
+          arr.push(targetItem);
+        } else {
+          keyIndexedTarget.set(keyStr, [targetItem]);
+        }
+      }
+    }
+    for (const sourceItem of this) {
+      let sameTarget;
+      let sameKeyTarget;
+      for (const targetItem of uncheckedTarget) {
+        if (!uncheckedTargetSet.has(targetItem)) continue;
+        if (objEqual(targetItem, sourceItem, excludeOpts)) {
+          sameTarget = targetItem;
+          break;
+        }
+      }
+      if (sameTarget === void 0 && keyIndexedTarget) {
+        const sourceKeyStr = JSON.stringify(options.keys.map((k) => sourceItem[k]));
+        const candidates = keyIndexedTarget.get(sourceKeyStr);
+        if (candidates && candidates.length > 0) {
+          sameKeyTarget = candidates.find((c) => uncheckedTargetSet.has(c));
+        }
+      }
+      if (sameTarget !== void 0) {
+        uncheckedTargetSet.delete(sameTarget);
+      } else if (sameKeyTarget !== void 0) {
+        result.push({ source: sourceItem, target: sameKeyTarget });
+        uncheckedTargetSet.delete(sameKeyTarget);
+      } else {
+        result.push({ source: sourceItem, target: void 0 });
+      }
+    }
+    for (const uncheckedTargetItem of uncheckedTargetSet) {
+      result.push({ source: void 0, target: uncheckedTargetItem });
+    }
+    return result;
+  },
+  oneWayDiffs(orgItems, keyPropNameOrFn, options) {
+    const orgItemMap = orgItems instanceof Map ? orgItems : orgItems.toMap(
+      (orgItem) => typeof keyPropNameOrFn === "function" ? keyPropNameOrFn(orgItem) : orgItem[keyPropNameOrFn]
+    );
+    const includeSame = (options == null ? void 0 : options.includeSame) ?? false;
+    const diffs = [];
+    for (const item of this) {
+      const keyValue = typeof keyPropNameOrFn === "function" ? keyPropNameOrFn(item) : item[keyPropNameOrFn];
+      if (keyValue == null) {
+        diffs.push({ type: "create", item, orgItem: void 0 });
+        continue;
+      }
+      const orgItem = orgItemMap.get(keyValue);
+      if (!orgItem) {
+        diffs.push({ type: "create", item, orgItem: void 0 });
+        continue;
+      }
+      if (objEqual(orgItem, item, {
+        topLevelExcludes: options == null ? void 0 : options.excludes,
+        topLevelIncludes: options == null ? void 0 : options.includes
+      })) {
+        if (includeSame) {
+          diffs.push({ type: "same", item, orgItem });
+        }
+        continue;
+      }
+      diffs.push({ type: "update", item, orgItem });
+    }
+    return diffs;
+  },
+  merge(target, options) {
+    const diffs = this.diffs(target, options);
+    const result = objClone(this);
+    const sourceIndexMap = /* @__PURE__ */ new Map();
+    for (let i = 0; i < this.length; i++) {
+      sourceIndexMap.set(this[i], i);
+    }
+    for (const diff of diffs) {
+      if (diff.source !== void 0 && diff.target !== void 0) {
+        const sourceIndex = sourceIndexMap.get(diff.source);
+        if (sourceIndex === void 0) {
+          throw new SdError("\uC608\uC0C1\uCE58 \uBABB\uD55C \uC624\uB958: merge\uC5D0\uC11C source \uD56D\uBAA9\uC744 \uCC3E\uC744 \uC218 \uC5C6\uC2B5\uB2C8\uB2E4.");
+        }
+        result[sourceIndex] = objMerge(diff.source, diff.target);
+      } else if (diff.target !== void 0) {
+        result.push(diff.target);
+      }
+    }
+    return result;
+  },
+  sum(selector) {
+    let result = 0;
+    for (let i = 0; i < this.length; i++) {
+      const item = selector !== void 0 ? selector(this[i], i) : this[i];
+      if (typeof item !== "number") {
+        throw new ArgumentError("sum \uC740 number \uC5D0 \uB300\uD574\uC11C\uB9CC \uC0AC\uC6A9\uD560 \uC218 \uC788\uC2B5\uB2C8\uB2E4.", { type: typeof item });
+      }
+      result += item;
+    }
+    return result;
+  },
+  min(selector) {
+    let result;
+    for (let i = 0; i < this.length; i++) {
+      const item = selector !== void 0 ? selector(this[i], i) : this[i];
+      if (typeof item !== "number" && typeof item !== "string") {
+        throw new ArgumentError("min \uC740 number/string \uC5D0 \uB300\uD574\uC11C\uB9CC \uC0AC\uC6A9\uD560 \uC218 \uC788\uC2B5\uB2C8\uB2E4.", { type: typeof item });
+      }
+      if (result === void 0 || result > item) {
+        result = item;
+      }
+    }
+    return result;
+  },
+  max(selector) {
+    let result;
+    for (let i = 0; i < this.length; i++) {
+      const item = selector !== void 0 ? selector(this[i], i) : this[i];
+      if (typeof item !== "number" && typeof item !== "string") {
+        throw new ArgumentError("max \uC740 number/string \uC5D0 \uB300\uD574\uC11C\uB9CC \uC0AC\uC6A9\uD560 \uC218 \uC788\uC2B5\uB2C8\uB2E4.", { type: typeof item });
+      }
+      if (result === void 0 || result < item) {
+        result = item;
+      }
+    }
+    return result;
+  },
+  shuffle() {
+    if (this.length <= 1) {
+      return [...this];
+    }
+    const result = [...this];
+    for (let i = result.length - 1; i > 0; i--) {
+      const j = Math.floor(Math.random() * (i + 1));
+      [result[i], result[j]] = [result[j], result[i]];
+    }
+    return result;
+  }
+};
+const arrayMutableExtensions = {
+  distinctThis(options) {
+    const opts = typeof options === "boolean" ? { matchAddress: options } : options ?? {};
+    if (opts.matchAddress === true) {
+      const seen2 = /* @__PURE__ */ new Set();
+      const toRemove = [];
+      for (let i = 0; i < this.length; i++) {
+        if (seen2.has(this[i])) {
+          toRemove.push(i);
+        } else {
+          seen2.add(this[i]);
+        }
+      }
+      for (let i = toRemove.length - 1; i >= 0; i--) {
+        this.splice(toRemove[i], 1);
+      }
+      return this;
+    }
+    if (opts.keyFn) {
+      const seen2 = /* @__PURE__ */ new Set();
+      const toRemove = [];
+      for (let i = 0; i < this.length; i++) {
+        const key = opts.keyFn(this[i]);
+        if (seen2.has(key)) {
+          toRemove.push(i);
+        } else {
+          seen2.add(key);
+        }
+      }
+      for (let i = toRemove.length - 1; i >= 0; i--) {
+        this.splice(toRemove[i], 1);
+      }
+      return this;
+    }
+    const seen = /* @__PURE__ */ new Map();
+    const seenRefs = /* @__PURE__ */ new Set();
+    const toRemoveSet = /* @__PURE__ */ new Set();
+    for (let i = 0; i < this.length; i++) {
+      const item = this[i];
+      if (item === null || typeof item !== "object") {
+        const type = typeof item;
+        if (type === "symbol" || type === "function") {
+          if (seenRefs.has(item)) {
+            toRemoveSet.add(i);
+          } else {
+            seenRefs.add(item);
+          }
+          continue;
+        }
+        let key = type + ":";
+        if (Object.is(item, -0)) {
+          key += "-0";
+        } else {
+          key += String(item);
+        }
+        if (seen.has(key)) {
+          toRemoveSet.add(i);
+        } else {
+          seen.set(key, item);
+        }
+        continue;
+      }
+      let hasDuplicateBefore = false;
+      for (let j = 0; j < i; j++) {
+        if (toRemoveSet.has(j)) continue;
+        if (objEqual(this[j], item)) {
+          hasDuplicateBefore = true;
+          break;
+        }
+      }
+      if (hasDuplicateBefore) {
+        toRemoveSet.add(i);
+      }
+    }
+    const toRemoveArr = Array.from(toRemoveSet).sort((a, b) => b - a);
+    for (const idx of toRemoveArr) {
+      this.splice(idx, 1);
+    }
+    return this;
+  },
+  orderByThis(selector) {
+    return this.sort((p, n) => {
+      const pp = (selector == null ? void 0 : selector(p)) ?? p;
+      const pn = (selector == null ? void 0 : selector(n)) ?? n;
+      return compareForOrder(pp, pn, false);
+    });
+  },
+  orderByDescThis(selector) {
+    return this.sort((p, n) => {
+      const pp = (selector == null ? void 0 : selector(p)) ?? p;
+      const pn = (selector == null ? void 0 : selector(n)) ?? n;
+      return compareForOrder(pp, pn, true);
+    });
+  },
+  insert(index, ...items) {
+    this.splice(index, 0, ...items);
+    return this;
+  },
+  remove(itemOrSelector) {
+    const shouldRemove = typeof itemOrSelector === "function" ? itemOrSelector : (item) => item === itemOrSelector;
+    for (let i = this.length - 1; i >= 0; i--) {
+      if (shouldRemove(this[i], i)) {
+        this.splice(i, 1);
+      }
+    }
+    return this;
+  },
+  toggle(item) {
+    if (this.includes(item)) {
+      this.remove(item);
+    } else {
+      this.push(item);
+    }
+    return this;
+  },
+  clear() {
+    return this.remove(() => true);
+  }
+};
+for (const [name, fn] of Object.entries({
+  ...arrayReadonlyExtensions,
+  ...arrayMutableExtensions
+})) {
+  Object.defineProperty(Array.prototype, name, {
+    value: fn,
+    enumerable: false,
+    writable: true,
+    configurable: true
+  });
+}
+//# sourceMappingURL=arr-ext.js.map

package/dist/extensions/arr-ext.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/extensions/arr-ext.ts"],
+  "sourcesContent": ["/**\n * Array \uD655\uC7A5 \uBA54\uC11C\uB4DC\n *\n * @remarks \uAC01 \uBA54\uC11C\uB4DC\uC758 TSDoc\uC740 \uD0C0\uC785 \uC815\uC758 \uD30C\uC77C(arr-ext.types.ts) \uCC38\uC870\n */\n\nimport \"./map-ext\";\nimport { objClone, objEqual, objMerge } from \"../utils/obj\";\nimport type { PrimitiveTypeStr, Type } from \"../common.types\";\nimport { DateTime } from \"../types/date-time\";\nimport { DateOnly } from \"../types/date-only\";\nimport { Time } from \"../types/time\";\nimport { Uuid } from \"../types/uuid\";\nimport { ArgumentError } from \"../errors/argument-error\";\nimport { SdError } from \"../errors/sd-error\";\nimport { compareForOrder } from \"./arr-ext.helpers\";\nimport type {\n  ReadonlyArrayExt,\n  MutableArrayExt,\n  ArrayDiffsResult,\n  ArrayDiffs2Result,\n  TreeArray,\n} from \"./arr-ext.types\";\n\n//#region \uAD6C\uD604\n\nconst arrayReadonlyExtensions: ReadonlyArrayExt<any> & ThisType<any[]> = {\n  single<T>(predicate?: (item: T, index: number) => boolean): T | undefined {\n    const arr = predicate !== undefined ? this.filter(predicate) : this;\n    if (arr.length > 1) {\n      throw new ArgumentError(\"\uBCF5\uC218\uC758 \uACB0\uACFC\uBB3C\uC774 \uC788\uC2B5\uB2C8\uB2E4.\", { count: arr.length });\n    }\n    return arr[0];\n  },\n\n  first<T>(predicate?: (item: T, index: number) => boolean): T | undefined {\n    return predicate !== undefined ? this.find(predicate) : this[0];\n  },\n\n  async filterAsync<T>(predicate: (item: T, index: number) => Promise<boolean>): Promise<T[]> {\n    const arr: T[] = [];\n    for (let i = 0; i < this.length; i++) {\n      if (await predicate(this[i], i)) {\n        arr.push(this[i]);\n      }\n    }\n    return arr;\n  },\n\n  last<T>(predicate?: (item: T, index: number) => boolean): T | undefined {\n    if (predicate !== undefined) {\n      for (let i = this.length - 1; i >= 0; i--) {\n        if (predicate(this[i], i)) {\n          return this[i];\n        }\n      }\n\n      return undefined;\n    } else {\n      return this[this.length - 1];\n    }\n  },\n\n  filterExists<T>(): NonNullable<T>[] {\n    return this.filter((item) => item != null);\n  },\n\n  ofType<T, N extends T>(type: PrimitiveTypeStr | Type<N>): N[] {\n    // PrimitiveTypeStr\uC778 \uACBD\uC6B0\n    if (typeof type === \"string\") {\n      return this.filter((item) => {\n        switch (type) {\n          case \"string\":\n            return typeof item === \"string\";\n          case \"number\":\n            return typeof item === \"number\";\n          case \"boolean\":\n            return typeof item === \"boolean\";\n          case \"DateTime\":\n            return item instanceof DateTime;\n          case \"DateOnly\":\n            return item instanceof DateOnly;\n          case \"Time\":\n            return item instanceof Time;\n          case \"Uuid\":\n            return item instanceof Uuid;\n          case \"Bytes\":\n            return item instanceof Uint8Array;\n          default: {\n            // exhaustive check: PrimitiveTypeStr\uC5D0 \uC0C8 \uD0C0\uC785 \uCD94\uAC00 \uC2DC \uCEF4\uD30C\uC77C \uC5D0\uB7EC \uBC1C\uC0DD\n            const _exhaustive: never = type;\n            throw new ArgumentError(`\uC9C0\uC6D0\uD558\uC9C0 \uC54A\uB294 \uD0C0\uC785: ${_exhaustive}`);\n          }\n        }\n      }) as N[];\n    }\n\n    // Type<N> (\uC0DD\uC131\uC790)\uC778 \uACBD\uC6B0\n    return this.filter((item) => item instanceof type || item?.constructor === type) as N[];\n  },\n\n  async mapAsync<T, R>(selector: (item: T, index: number) => Promise<R>): Promise<R[]> {\n    const result: R[] = [];\n    for (let i = 0; i < this.length; i++) {\n      result.push(await selector(this[i], i));\n    }\n    return result;\n  },\n\n  mapMany<T, R>(selector?: (item: T, index: number) => R[]): T | R[] {\n    const arr = selector ? this.map(selector) : this;\n    return arr.flat().filterExists();\n  },\n\n  async mapManyAsync<T, R>(selector?: (item: T, index: number) => Promise<R[]>): Promise<T | R[]> {\n    const arr = selector !== undefined ? await this.mapAsync(selector) : this;\n    return arr.mapMany();\n  },\n\n  parallelAsync<T, R>(fn: (item: T, index: number) => Promise<R>): Promise<R[]> {\n    return Promise.all(this.map(fn));\n  },\n\n  // \uBC30\uC5F4\uC744 \uD0A4\uBCC4\uB85C \uADF8\uB8F9\uD654\n  // \uC131\uB2A5 \uACE0\uB824\uC0AC\uD56D:\n  // - primitive \uD0A4 (string, number \uB4F1): O(n) - Map \uAE30\uBC18\n  // - \uAC1D\uCCB4 \uD0A4: O(n\u00B2) - objEqual \uBE44\uAD50\n  groupBy<T, K, V>(\n    keySelector: (item: T, index: number) => K,\n    valueSelector?: (item: T, index: number) => V,\n  ): {\n    key: K;\n    values: (V | T)[];\n  }[] {\n    const result: { key: K; values: (V | T)[] }[] = [];\n\n    // primitive \uD0A4 \uCD5C\uC801\uD654\uB97C \uC704\uD55C Map (\uD0A4 \uBB38\uC790\uC5F4 -> result \uC778\uB371\uC2A4)\n    const primitiveKeyIndex = new Map<string, number>();\n\n    for (let i = 0; i < this.length; i++) {\n      const keyObj = keySelector(this[i], i);\n      const valueObj = valueSelector !== undefined ? valueSelector(this[i], i) : this[i];\n\n      // primitive \uD0A4\uB294 Map\uC73C\uB85C O(n) \uCC98\uB9AC\n      if (keyObj == null || typeof keyObj !== \"object\") {\n        const keyStr = typeof keyObj + \":\" + String(keyObj);\n        const existingIndex = primitiveKeyIndex.get(keyStr);\n        if (existingIndex !== undefined) {\n          result[existingIndex].values.push(valueObj);\n        } else {\n          primitiveKeyIndex.set(keyStr, result.length);\n          result.push({ key: keyObj, values: [valueObj] });\n        }\n        continue;\n      }\n\n      // \uAC1D\uCCB4 \uD0A4\uB294 \uAE30\uC874 \uBC29\uC2DD O(n\u00B2)\n      const existsRecord = result.find((item) => objEqual(item.key, keyObj));\n      if (existsRecord !== undefined) {\n        existsRecord.values.push(valueObj);\n      } else {\n        result.push({ key: keyObj, values: [valueObj] });\n      }\n    }\n\n    return result;\n  },\n\n  toMap<T, K, V>(\n    keySelector: (item: T, index: number) => K,\n    valueSelector?: (item: T, index: number) => V,\n  ): Map<K, V | T> {\n    const result = new Map<K, V | T>();\n\n    for (let i = 0; i < this.length; i++) {\n      const item = this[i];\n\n      const keyObj = keySelector(item, i);\n      const valueObj = valueSelector !== undefined ? valueSelector(item, i) : item;\n\n      if (result.has(keyObj)) {\n        throw new ArgumentError(\"\uD0A4\uAC00 \uC911\uBCF5\uB418\uC5C8\uC2B5\uB2C8\uB2E4.\", { duplicatedKey: keyObj });\n      }\n      result.set(keyObj, valueObj);\n    }\n\n    return result;\n  },\n\n  async toMapAsync<T, K, V>(\n    keySelector: (item: T, index: number) => Promise<K> | K,\n    valueSelector?: (item: T, index: number) => Promise<V> | V,\n  ): Promise<Map<K, V | T>> {\n    const result = new Map<K, V | T>();\n\n    for (let i = 0; i < this.length; i++) {\n      const item = this[i];\n\n      const keyObj = await keySelector(item, i);\n      const valueObj = valueSelector !== undefined ? await valueSelector(item, i) : item;\n\n      if (result.has(keyObj)) {\n        throw new ArgumentError(\"\uD0A4\uAC00 \uC911\uBCF5\uB418\uC5C8\uC2B5\uB2C8\uB2E4.\", { duplicatedKey: keyObj });\n      }\n      result.set(keyObj, valueObj);\n    }\n\n    return result;\n  },\n\n  toArrayMap<T, K, V>(\n    keySelector: (item: T, index: number) => K,\n    valueSelector?: (item: T, index: number) => V,\n  ): Map<K, (V | T)[]> {\n    const result = new Map<K, (V | T)[]>();\n\n    for (let i = 0; i < this.length; i++) {\n      const item = this[i];\n\n      const keyObj = keySelector(item, i);\n      const valueObj = valueSelector !== undefined ? valueSelector(item, i) : item;\n\n      const arr = result.getOrCreate(keyObj, []);\n      arr.push(valueObj);\n    }\n\n    return result;\n  },\n\n  toSetMap<T, K, V>(\n    keySelector: (item: T, index: number) => K,\n    valueSelector?: (item: T, index: number) => V,\n  ): Map<K, Set<V | T>> {\n    const result = new Map<K, Set<V | T>>();\n\n    for (let i = 0; i < this.length; i++) {\n      const item = this[i];\n\n      const keyObj = keySelector(item, i);\n      const valueObj = valueSelector !== undefined ? valueSelector(item, i) : item;\n\n      const set = result.getOrCreate(keyObj, new Set<V | T>());\n      set.add(valueObj);\n    }\n\n    return result;\n  },\n\n  toMapValues<T, K, V>(keySelector: (item: T, index: number) => K, valueSelector: (items: T[]) => V): Map<K, V | T> {\n    const itemsMap = new Map<K, T[]>();\n\n    for (let i = 0; i < this.length; i++) {\n      const item = this[i];\n\n      const keyObj = keySelector(item, i);\n\n      const arr = itemsMap.getOrCreate(keyObj, []);\n      arr.push(item);\n    }\n\n    const result = new Map<K, V | T>();\n\n    for (const key of itemsMap.keys()) {\n      result.set(key, valueSelector(itemsMap.get(key)!));\n    }\n\n    return result;\n  },\n\n  toObject<T, V>(\n    keySelector: (item: T, index: number) => string,\n    valueSelector?: (item: T, index: number) => V,\n  ): Record<string, V | T> {\n    const result: Record<string, V | T> = {};\n\n    for (let i = 0; i < this.length; i++) {\n      const item = this[i];\n\n      const key = keySelector(item, i);\n      const valueObj = valueSelector !== undefined ? valueSelector(item, i) : item;\n\n      // undefined \uAC12\uC740 \"\uC5C6\uC74C\"\uC73C\uB85C \uCDE8\uAE09\uD558\uC5EC \uB36E\uC5B4\uC4F0\uAE30 \uD5C8\uC6A9\n      if (result[key] !== undefined) {\n        throw new ArgumentError(\"\uD0A4\uAC00 \uC911\uBCF5\uB418\uC5C8\uC2B5\uB2C8\uB2E4.\", { duplicatedKey: key });\n      }\n      result[key] = valueObj;\n    }\n\n    return result;\n  },\n\n  toTree<T, K extends keyof T, P extends keyof T>(key: K, parentKey: P): TreeArray<T>[] {\n    // O(n) \uCD5C\uC801\uD654: \uB9F5 \uAE30\uBC18 \uC778\uB371\uC2F1\n    const childrenMap = this.toArrayMap((item) => item[parentKey]);\n\n    const fn = (items: T[]): TreeArray<T>[] => {\n      return items.map((item) => ({\n        ...objClone(item),\n        children: fn(childrenMap.get(item[key]) ?? []),\n      }));\n    };\n\n    const rootItems = this.filter((item1) => item1[parentKey] == null);\n    return fn(rootItems);\n  },\n\n  distinct<T>(options?: boolean | { matchAddress?: boolean; keyFn?: (item: T) => string | number }): T[] {\n    // \uC635\uC158 \uC815\uADDC\uD654\n    const opts = typeof options === \"boolean\" ? { matchAddress: options } : (options ?? {});\n\n    // matchAddress: Set \uAE30\uBC18 O(n)\n    if (opts.matchAddress === true) return [...new Set(this)];\n\n    // keyFn \uC81C\uACF5 \uC2DC: \uCEE4\uC2A4\uD140 \uD0A4 \uAE30\uBC18 O(n)\n    if (opts.keyFn) {\n      const seen = new Set<string | number>();\n      const result: T[] = [];\n      for (const item of this) {\n        const key = opts.keyFn(item);\n        if (!seen.has(key)) {\n          seen.add(key);\n          result.push(item);\n        }\n      }\n      return result;\n    }\n\n    // \uAE30\uBCF8: \uD0C0\uC785\uBCC4 \uCC98\uB9AC\n    const seen = new Map<string, T>();\n    const seenRefs = new Set<symbol | ((...args: unknown[]) => unknown)>(); // symbol/function\uC6A9 O(n) \uCC98\uB9AC\n    const result: T[] = [];\n\n    for (const item of this) {\n      // primitive \uD0C0\uC785\uC740 \uBE60\uB978 \uACBD\uB85C\n      if (item === null || typeof item !== \"object\") {\n        const type = typeof item;\n\n        // symbol, function\uC740 Set\uC73C\uB85C identity \uBE44\uAD50 (O(n))\n        if (type === \"symbol\" || type === \"function\") {\n          if (!seenRefs.has(item)) {\n            seenRefs.add(item);\n            result.push(item);\n          }\n          continue;\n        }\n\n        // \uB098\uBA38\uC9C0 primitive\uB294 \uD0C0\uC785 prefix + \uD2B9\uC218 \uCF00\uC774\uC2A4 \uCC98\uB9AC\n        let key = type + \":\";\n        if (Object.is(item, -0)) {\n          key += \"-0\";\n        } else {\n          key += String(item);\n        }\n\n        if (!seen.has(key)) {\n          seen.set(key, item);\n          result.push(item);\n        }\n        continue;\n      }\n\n      if (!result.some((item1) => objEqual(item1, item))) {\n        result.push(item);\n      }\n    }\n\n    return result;\n  },\n\n  orderBy<T>(selector?: (item: T) => string | number | DateTime | DateOnly | Time | undefined): T[] {\n    return [...this].sort((p, n) => {\n      const pp = selector == null ? p : selector(p);\n      const pn = selector == null ? n : selector(n);\n      return compareForOrder(pp, pn, false);\n    });\n  },\n\n  orderByDesc<T>(selector?: (item: T) => string | number | DateTime | DateOnly | Time | undefined): T[] {\n    return [...this].sort((p, n) => {\n      const pp = selector == null ? p : selector(p);\n      const pn = selector == null ? n : selector(n);\n      return compareForOrder(pp, pn, true);\n    });\n  },\n\n  diffs<T, P>(\n    target: P[],\n    options?: {\n      keys?: string[];\n      excludes?: string[];\n    },\n  ): ArrayDiffsResult<T, P>[] {\n    const result: ArrayDiffsResult<T, P>[] = [];\n\n    const uncheckedTarget = [...target];\n    const uncheckedTargetSet = new Set(uncheckedTarget);\n    const hasKeys = options?.keys !== undefined && options.keys.length > 0;\n    const excludeOpts = { topLevelExcludes: options?.excludes };\n\n    // keys \uC635\uC158\uC774 \uC788\uB294 \uACBD\uC6B0 target\uC744 keys \uAE30\uC900\uC73C\uB85C Map\uC5D0 \uBBF8\uB9AC \uC778\uB371\uC2F1\uD558\uC5EC O(n\u00D7m) \u2192 O(n+m) \uAC1C\uC120\n    // \uD0A4 \uAC12\uC774 \uAC19\uC740 target\uC774 \uC5EC\uB7EC \uAC1C \uC788\uC744 \uC218 \uC788\uC73C\uBBC0\uB85C \uBC30\uC5F4\uB85C \uC800\uC7A5\n    const keyIndexedTarget = hasKeys ? new Map<string, P[]>() : undefined;\n\n    if (keyIndexedTarget) {\n      for (const targetItem of uncheckedTarget) {\n        const keyStr = JSON.stringify(options!.keys!.map((k) => (targetItem as Record<string, unknown>)[k]));\n        const arr = keyIndexedTarget.get(keyStr);\n        if (arr) {\n          arr.push(targetItem);\n        } else {\n          keyIndexedTarget.set(keyStr, [targetItem]);\n        }\n      }\n    }\n\n    for (const sourceItem of this) {\n      // \uC804\uCCB4 \uC77C\uCE58(sameTarget) \uC6B0\uC120, \uC5C6\uC73C\uBA74 \uD0A4 \uC77C\uCE58(sameKeyTarget) \uAC80\uC0C9\n      let sameTarget: P | undefined;\n      let sameKeyTarget: P | undefined;\n\n      // Set \uAE30\uBC18 \uAC74\uB108\uB6F0\uAE30\uB85C \uC774\uBBF8 \uB9E4\uCE6D\uB41C \uD56D\uBAA9 \uC2A4\uD0B5 (splice O(n) \uC81C\uAC70)\n      for (const targetItem of uncheckedTarget) {\n        if (!uncheckedTargetSet.has(targetItem)) continue;\n        if (objEqual(targetItem, sourceItem, excludeOpts)) {\n          sameTarget = targetItem;\n          break;\n        }\n      }\n\n      // \uC804\uCCB4 \uC77C\uCE58\uAC00 \uC5C6\uACE0 keys \uC635\uC158\uC774 \uC788\uC73C\uBA74 Map\uC5D0\uC11C O(1) \uC870\uD68C\n      if (sameTarget === undefined && keyIndexedTarget) {\n        const sourceKeyStr = JSON.stringify(options!.keys!.map((k) => (sourceItem as Record<string, unknown>)[k]));\n        const candidates = keyIndexedTarget.get(sourceKeyStr);\n        if (candidates && candidates.length > 0) {\n          // uncheckedTargetSet\uC5D0\uC11C O(1) \uC870\uD68C\uB85C \uC544\uC9C1 \uB0A8\uC544\uC788\uB294 \uCCAB \uBC88\uC9F8 \uD56D\uBAA9 \uC120\uD0DD\n          sameKeyTarget = candidates.find((c) => uncheckedTargetSet.has(c));\n        }\n      }\n\n      if (sameTarget !== undefined) {\n        uncheckedTargetSet.delete(sameTarget);\n      } else if (sameKeyTarget !== undefined) {\n        result.push({ source: sourceItem, target: sameKeyTarget });\n        uncheckedTargetSet.delete(sameKeyTarget);\n      } else {\n        result.push({ source: sourceItem, target: undefined });\n      }\n    }\n\n    for (const uncheckedTargetItem of uncheckedTargetSet) {\n      result.push({ source: undefined, target: uncheckedTargetItem });\n    }\n\n    return result;\n  },\n\n  oneWayDiffs<T extends Record<string, unknown>, K extends keyof T>(\n    orgItems: T[] | Map<T[K], T>,\n    keyPropNameOrFn: K | ((item: T) => K),\n    options?: {\n      includeSame?: boolean;\n      excludes?: string[];\n      includes?: string[];\n    },\n  ): ArrayDiffs2Result<T>[] {\n    const orgItemMap =\n      orgItems instanceof Map\n        ? orgItems\n        : orgItems.toMap((orgItem) =>\n            typeof keyPropNameOrFn === \"function\" ? keyPropNameOrFn(orgItem) : orgItem[keyPropNameOrFn],\n          );\n    const includeSame = options?.includeSame ?? false;\n\n    const diffs: ArrayDiffs2Result<T>[] = [];\n    for (const item of this) {\n      const keyValue = typeof keyPropNameOrFn === \"function\" ? keyPropNameOrFn(item) : item[keyPropNameOrFn];\n      if (keyValue == null) {\n        diffs.push({ type: \"create\", item, orgItem: undefined });\n        continue;\n      }\n\n      const orgItem = orgItemMap.get(keyValue);\n      if (!orgItem) {\n        diffs.push({ type: \"create\", item, orgItem: undefined });\n        continue;\n      }\n\n      if (\n        objEqual(orgItem, item, {\n          topLevelExcludes: options?.excludes,\n          topLevelIncludes: options?.includes,\n        })\n      ) {\n        if (includeSame) {\n          diffs.push({ type: \"same\", item, orgItem });\n        }\n        continue;\n      }\n\n      diffs.push({ type: \"update\", item, orgItem });\n    }\n    return diffs;\n  },\n\n  merge<T, P>(\n    target: P[],\n    options?: {\n      keys?: string[];\n      excludes?: string[];\n    },\n  ): (T | P | (T & P))[] {\n    const diffs = this.diffs(target, options);\n\n    const result: (T | P | (T & P))[] = objClone(this);\n\n    // source \uD56D\uBAA9\uC758 \uC6D0\uBCF8 \uC778\uB371\uC2A4\uB97C \uBBF8\uB9AC \uACC4\uC0B0\uD558\uC5EC O(n) \uAC80\uC0C9\uC744 O(1)\uB85C \uAC1C\uC120\n    const sourceIndexMap = new Map<T, number>();\n    for (let i = 0; i < this.length; i++) {\n      sourceIndexMap.set(this[i], i);\n    }\n\n    for (const diff of diffs) {\n      // \uBCC0\uACBD\uC2DC\n      if (diff.source !== undefined && diff.target !== undefined) {\n        const sourceIndex = sourceIndexMap.get(diff.source);\n        if (sourceIndex === undefined) {\n          throw new SdError(\"\uC608\uC0C1\uCE58 \uBABB\uD55C \uC624\uB958: merge\uC5D0\uC11C source \uD56D\uBAA9\uC744 \uCC3E\uC744 \uC218 \uC5C6\uC2B5\uB2C8\uB2E4.\");\n        }\n        result[sourceIndex] = objMerge(diff.source, diff.target);\n      }\n      // \uCD94\uAC00\uC2DC\n      else if (diff.target !== undefined) {\n        result.push(diff.target);\n      }\n    }\n\n    return result;\n  },\n\n  sum<T>(selector?: (item: T, index: number) => number): number {\n    let result = 0;\n    for (let i = 0; i < this.length; i++) {\n      const item = selector !== undefined ? selector(this[i], i) : this[i];\n      if (typeof item !== \"number\") {\n        throw new ArgumentError(\"sum \uC740 number \uC5D0 \uB300\uD574\uC11C\uB9CC \uC0AC\uC6A9\uD560 \uC218 \uC788\uC2B5\uB2C8\uB2E4.\", { type: typeof item });\n      }\n      result += item;\n    }\n\n    return result;\n  },\n\n  min<T>(selector?: (item: T, index: number) => string | number): string | number | undefined {\n    let result: string | number | undefined;\n    for (let i = 0; i < this.length; i++) {\n      const item = selector !== undefined ? selector(this[i], i) : this[i];\n      if (typeof item !== \"number\" && typeof item !== \"string\") {\n        throw new ArgumentError(\"min \uC740 number/string \uC5D0 \uB300\uD574\uC11C\uB9CC \uC0AC\uC6A9\uD560 \uC218 \uC788\uC2B5\uB2C8\uB2E4.\", { type: typeof item });\n      }\n      if (result === undefined || result > item) {\n        result = item;\n      }\n    }\n\n    return result;\n  },\n\n  max<T>(selector?: (item: T, index: number) => string | number): string | number | undefined {\n    let result: string | number | undefined;\n    for (let i = 0; i < this.length; i++) {\n      const item = selector !== undefined ? selector(this[i], i) : this[i];\n      if (typeof item !== \"number\" && typeof item !== \"string\") {\n        throw new ArgumentError(\"max \uC740 number/string \uC5D0 \uB300\uD574\uC11C\uB9CC \uC0AC\uC6A9\uD560 \uC218 \uC788\uC2B5\uB2C8\uB2E4.\", { type: typeof item });\n      }\n      if (result === undefined || result < item) {\n        result = item;\n      }\n    }\n\n    return result;\n  },\n\n  shuffle<T>(): T[] {\n    if (this.length <= 1) {\n      return [...this];\n    }\n\n    const result = [...this];\n    for (let i = result.length - 1; i > 0; i--) {\n      const j = Math.floor(Math.random() * (i + 1));\n      [result[i], result[j]] = [result[j], result[i]];\n    }\n    return result;\n  },\n};\n\nconst arrayMutableExtensions: MutableArrayExt<any> & ThisType<any[]> = {\n  distinctThis<T>(options?: boolean | { matchAddress?: boolean; keyFn?: (item: T) => string | number }): T[] {\n    // \uC635\uC158 \uC815\uADDC\uD654\n    const opts = typeof options === \"boolean\" ? { matchAddress: options } : (options ?? {});\n\n    // matchAddress: Set \uAE30\uBC18 O(n)\n    // \uCCAB \uBC88\uC9F8 \uB4F1\uC7A5\uD55C \uC694\uC18C\uB97C \uC720\uC9C0\uD558\uAE30 \uC704\uD574 \uC815\uBC29\uD5A5 \uC21C\uD68C \uD6C4 \uC81C\uAC70\uD560 \uC778\uB371\uC2A4 \uC218\uC9D1\n    if (opts.matchAddress === true) {\n      const seen = new Set<T>();\n      const toRemove: number[] = [];\n      for (let i = 0; i < this.length; i++) {\n        if (seen.has(this[i])) {\n          toRemove.push(i);\n        } else {\n          seen.add(this[i]);\n        }\n      }\n      // \uC5ED\uC21C\uC73C\uB85C \uC81C\uAC70 (\uC778\uB371\uC2A4 \uBCC0\uD654 \uBC29\uC9C0)\n      for (let i = toRemove.length - 1; i >= 0; i--) {\n        this.splice(toRemove[i], 1);\n      }\n      return this;\n    }\n\n    // keyFn \uC81C\uACF5 \uC2DC: \uCEE4\uC2A4\uD140 \uD0A4 \uAE30\uBC18 O(n)\n    // \uCCAB \uBC88\uC9F8 \uB4F1\uC7A5\uD55C \uC694\uC18C\uB97C \uC720\uC9C0\uD558\uAE30 \uC704\uD574 \uC815\uBC29\uD5A5 \uC21C\uD68C \uD6C4 \uC81C\uAC70\uD560 \uC778\uB371\uC2A4 \uC218\uC9D1\n    if (opts.keyFn) {\n      const seen = new Set<string | number>();\n      const toRemove: number[] = [];\n      for (let i = 0; i < this.length; i++) {\n        const key = opts.keyFn(this[i]);\n        if (seen.has(key)) {\n          toRemove.push(i);\n        } else {\n          seen.add(key);\n        }\n      }\n      // \uC5ED\uC21C\uC73C\uB85C \uC81C\uAC70 (\uC778\uB371\uC2A4 \uBCC0\uD654 \uBC29\uC9C0)\n      for (let i = toRemove.length - 1; i >= 0; i--) {\n        this.splice(toRemove[i], 1);\n      }\n      return this;\n    }\n\n    // \uAE30\uBCF8: \uD0C0\uC785\uBCC4 \uCC98\uB9AC (primitive \uCD5C\uC801\uD654)\n    const seen = new Map<string, T>();\n    const seenRefs = new Set<symbol | ((...args: unknown[]) => unknown)>();\n    const toRemoveSet = new Set<number>();\n\n    for (let i = 0; i < this.length; i++) {\n      const item = this[i];\n\n      // primitive \uD0C0\uC785\uC740 \uBE60\uB978 \uACBD\uB85C O(n)\n      if (item === null || typeof item !== \"object\") {\n        const type = typeof item;\n\n        // symbol, function\uC740 Set\uC73C\uB85C identity \uBE44\uAD50\n        if (type === \"symbol\" || type === \"function\") {\n          if (seenRefs.has(item)) {\n            toRemoveSet.add(i);\n          } else {\n            seenRefs.add(item);\n          }\n          continue;\n        }\n\n        // \uB098\uBA38\uC9C0 primitive\uB294 \uD0C0\uC785 prefix + \uD2B9\uC218 \uCF00\uC774\uC2A4 \uCC98\uB9AC\n        let key = type + \":\";\n        if (Object.is(item, -0)) {\n          key += \"-0\";\n        } else {\n          key += String(item);\n        }\n\n        if (seen.has(key)) {\n          toRemoveSet.add(i);\n        } else {\n          seen.set(key, item);\n        }\n        continue;\n      }\n\n      // \uAC1D\uCCB4\uB294 \uAE4A\uC740 \uBE44\uAD50 O(n\u00B2) - \uC81C\uAC70\uB418\uC9C0 \uC54A\uC740 \uC774\uC804 \uD56D\uBAA9\uB4E4\uACFC \uBE44\uAD50\n      let hasDuplicateBefore = false;\n      for (let j = 0; j < i; j++) {\n        // toRemoveSet\uC5D0 \uC788\uB294 \uC778\uB371\uC2A4\uB294 \uAC74\uB108\uB700 (O(1) \uC870\uD68C)\n        if (toRemoveSet.has(j)) continue;\n        if (objEqual(this[j], item)) {\n          hasDuplicateBefore = true;\n          break;\n        }\n      }\n      if (hasDuplicateBefore) {\n        toRemoveSet.add(i);\n      }\n    }\n\n    // \uC5ED\uC21C\uC73C\uB85C \uC81C\uAC70 (\uC778\uB371\uC2A4 \uBCC0\uD654 \uBC29\uC9C0)\n    const toRemoveArr = Array.from(toRemoveSet).sort((a, b) => b - a);\n    for (const idx of toRemoveArr) {\n      this.splice(idx, 1);\n    }\n\n    return this;\n  },\n\n  orderByThis<T>(selector?: (item: T) => string | number | DateTime | DateOnly | Time | undefined): T[] {\n    return this.sort((p, n) => {\n      const pp = selector?.(p) ?? p;\n      const pn = selector?.(n) ?? n;\n      return compareForOrder(pp, pn, false);\n    });\n  },\n\n  orderByDescThis<T>(selector?: (item: T) => string | number | DateTime | DateOnly | Time | undefined): T[] {\n    return this.sort((p, n) => {\n      const pp = selector?.(p) ?? p;\n      const pn = selector?.(n) ?? n;\n      return compareForOrder(pp, pn, true);\n    });\n  },\n\n  insert<T>(index: number, ...items: T[]): T[] {\n    this.splice(index, 0, ...items);\n    return this;\n  },\n\n  remove<T>(itemOrSelector: T | ((item: T, index: number) => boolean)): T[] {\n    const shouldRemove =\n      typeof itemOrSelector === \"function\"\n        ? (itemOrSelector as (item: T, index: number) => boolean)\n        : (item: T) => item === itemOrSelector;\n\n    // \uC5ED\uBC29\uD5A5 \uC21C\uD68C\uB85C \uC778\uB371\uC2A4 \uBCC0\uACBD \uBB38\uC81C \uBC29\uC9C0 (O(n) \uC131\uB2A5)\n    for (let i = this.length - 1; i >= 0; i--) {\n      if (shouldRemove(this[i], i)) {\n        this.splice(i, 1);\n      }\n    }\n\n    return this;\n  },\n\n  toggle<T>(this: T[], item: T): T[] {\n    if (this.includes(item)) {\n      this.remove(item);\n    } else {\n      this.push(item);\n    }\n    return this;\n  },\n\n  clear<T>(this: T[]): T[] {\n    return this.remove(() => true);\n  },\n};\n\nfor (const [name, fn] of Object.entries({\n  ...arrayReadonlyExtensions,\n  ...arrayMutableExtensions,\n})) {\n  Object.defineProperty(Array.prototype, name, {\n    value: fn,\n    enumerable: false,\n    writable: true,\n    configurable: true,\n  });\n}\n\n//#endregion\n\n//#region \uD0C0\uC785 \uC120\uC5B8\n\ndeclare global {\n  interface ReadonlyArray<T> extends ReadonlyArrayExt<T> {}\n  interface Array<T> extends ReadonlyArrayExt<T>, MutableArrayExt<T> {}\n}\n\n//#endregion\n\nexport type { ArrayDiffsResult, ArrayDiffs2Result, TreeArray, ComparableType } from \"./arr-ext.types\";\n"],
+  "mappings": "AAMA,OAAO;AACP,SAAS,UAAU,UAAU,gBAAgB;AAE7C,SAAS,gBAAgB;AACzB,SAAS,gBAAgB;AACzB,SAAS,YAAY;AACrB,SAAS,YAAY;AACrB,SAAS,qBAAqB;AAC9B,SAAS,eAAe;AACxB,SAAS,uBAAuB;AAWhC,MAAM,0BAAmE;AAAA,EACvE,OAAU,WAAgE;AACxE,UAAM,MAAM,cAAc,SAAY,KAAK,OAAO,SAAS,IAAI;AAC/D,QAAI,IAAI,SAAS,GAAG;AAClB,YAAM,IAAI,cAAc,yEAAkB,EAAE,OAAO,IAAI,OAAO,CAAC;AAAA,IACjE;AACA,WAAO,IAAI,CAAC;AAAA,EACd;AAAA,EAEA,MAAS,WAAgE;AACvE,WAAO,cAAc,SAAY,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC;AAAA,EAChE;AAAA,EAEA,MAAM,YAAe,WAAuE;AAC1F,UAAM,MAAW,CAAC;AAClB,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,UAAI,MAAM,UAAU,KAAK,CAAC,GAAG,CAAC,GAAG;AAC/B,YAAI,KAAK,KAAK,CAAC,CAAC;AAAA,MAClB;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA,EAEA,KAAQ,WAAgE;AACtE,QAAI,cAAc,QAAW;AAC3B,eAAS,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK;AACzC,YAAI,UAAU,KAAK,CAAC,GAAG,CAAC,GAAG;AACzB,iBAAO,KAAK,CAAC;AAAA,QACf;AAAA,MACF;AAEA,aAAO;AAAA,IACT,OAAO;AACL,aAAO,KAAK,KAAK,SAAS,CAAC;AAAA,IAC7B;AAAA,EACF;AAAA,EAEA,eAAoC;AAClC,WAAO,KAAK,OAAO,CAAC,SAAS,QAAQ,IAAI;AAAA,EAC3C;AAAA,EAEA,OAAuB,MAAuC;AAE5D,QAAI,OAAO,SAAS,UAAU;AAC5B,aAAO,KAAK,OAAO,CAAC,SAAS;AAC3B,gBAAQ,MAAM;AAAA,UACZ,KAAK;AACH,mBAAO,OAAO,SAAS;AAAA,UACzB,KAAK;AACH,mBAAO,OAAO,SAAS;AAAA,UACzB,KAAK;AACH,mBAAO,OAAO,SAAS;AAAA,UACzB,KAAK;AACH,mBAAO,gBAAgB;AAAA,UACzB,KAAK;AACH,mBAAO,gBAAgB;AAAA,UACzB,KAAK;AACH,mBAAO,gBAAgB;AAAA,UACzB,KAAK;AACH,mBAAO,gBAAgB;AAAA,UACzB,KAAK;AACH,mBAAO,gBAAgB;AAAA,UACzB,SAAS;AAEP,kBAAM,cAAqB;AAC3B,kBAAM,IAAI,cAAc,uDAAe,WAAW,EAAE;AAAA,UACtD;AAAA,QACF;AAAA,MACF,CAAC;AAAA,IACH;AAGA,WAAO,KAAK,OAAO,CAAC,SAAS,gBAAgB,SAAQ,6BAAM,iBAAgB,IAAI;AAAA,EACjF;AAAA,EAEA,MAAM,SAAe,UAAgE;AACnF,UAAM,SAAc,CAAC;AACrB,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,aAAO,KAAK,MAAM,SAAS,KAAK,CAAC,GAAG,CAAC,CAAC;AAAA,IACxC;AACA,WAAO;AAAA,EACT;AAAA,EAEA,QAAc,UAAqD;AACjE,UAAM,MAAM,WAAW,KAAK,IAAI,QAAQ,IAAI;AAC5C,WAAO,IAAI,KAAK,EAAE,aAAa;AAAA,EACjC;AAAA,EAEA,MAAM,aAAmB,UAAuE;AAC9F,UAAM,MAAM,aAAa,SAAY,MAAM,KAAK,SAAS,QAAQ,IAAI;AACrE,WAAO,IAAI,QAAQ;AAAA,EACrB;AAAA,EAEA,cAAoB,IAA0D;AAC5E,WAAO,QAAQ,IAAI,KAAK,IAAI,EAAE,CAAC;AAAA,EACjC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QACE,aACA,eAIE;AACF,UAAM,SAA0C,CAAC;AAGjD,UAAM,oBAAoB,oBAAI,IAAoB;AAElD,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAM,SAAS,YAAY,KAAK,CAAC,GAAG,CAAC;AACrC,YAAM,WAAW,kBAAkB,SAAY,cAAc,KAAK,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC;AAGjF,UAAI,UAAU,QAAQ,OAAO,WAAW,UAAU;AAChD,cAAM,SAAS,OAAO,SAAS,MAAM,OAAO,MAAM;AAClD,cAAM,gBAAgB,kBAAkB,IAAI,MAAM;AAClD,YAAI,kBAAkB,QAAW;AAC/B,iBAAO,aAAa,EAAE,OAAO,KAAK,QAAQ;AAAA,QAC5C,OAAO;AACL,4BAAkB,IAAI,QAAQ,OAAO,MAAM;AAC3C,iBAAO,KAAK,EAAE,KAAK,QAAQ,QAAQ,CAAC,QAAQ,EAAE,CAAC;AAAA,QACjD;AACA;AAAA,MACF;AAGA,YAAM,eAAe,OAAO,KAAK,CAAC,SAAS,SAAS,KAAK,KAAK,MAAM,CAAC;AACrE,UAAI,iBAAiB,QAAW;AAC9B,qBAAa,OAAO,KAAK,QAAQ;AAAA,MACnC,OAAO;AACL,eAAO,KAAK,EAAE,KAAK,QAAQ,QAAQ,CAAC,QAAQ,EAAE,CAAC;AAAA,MACjD;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,MACE,aACA,eACe;AACf,UAAM,SAAS,oBAAI,IAAc;AAEjC,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAM,OAAO,KAAK,CAAC;AAEnB,YAAM,SAAS,YAAY,MAAM,CAAC;AAClC,YAAM,WAAW,kBAAkB,SAAY,cAAc,MAAM,CAAC,IAAI;AAExE,UAAI,OAAO,IAAI,MAAM,GAAG;AACtB,cAAM,IAAI,cAAc,4DAAe,EAAE,eAAe,OAAO,CAAC;AAAA,MAClE;AACA,aAAO,IAAI,QAAQ,QAAQ;AAAA,IAC7B;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,WACJ,aACA,eACwB;AACxB,UAAM,SAAS,oBAAI,IAAc;AAEjC,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAM,OAAO,KAAK,CAAC;AAEnB,YAAM,SAAS,MAAM,YAAY,MAAM,CAAC;AACxC,YAAM,WAAW,kBAAkB,SAAY,MAAM,cAAc,MAAM,CAAC,IAAI;AAE9E,UAAI,OAAO,IAAI,MAAM,GAAG;AACtB,cAAM,IAAI,cAAc,4DAAe,EAAE,eAAe,OAAO,CAAC;AAAA,MAClE;AACA,aAAO,IAAI,QAAQ,QAAQ;AAAA,IAC7B;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,WACE,aACA,eACmB;AACnB,UAAM,SAAS,oBAAI,IAAkB;AAErC,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAM,OAAO,KAAK,CAAC;AAEnB,YAAM,SAAS,YAAY,MAAM,CAAC;AAClC,YAAM,WAAW,kBAAkB,SAAY,cAAc,MAAM,CAAC,IAAI;AAExE,YAAM,MAAM,OAAO,YAAY,QAAQ,CAAC,CAAC;AACzC,UAAI,KAAK,QAAQ;AAAA,IACnB;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,SACE,aACA,eACoB;AACpB,UAAM,SAAS,oBAAI,IAAmB;AAEtC,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAM,OAAO,KAAK,CAAC;AAEnB,YAAM,SAAS,YAAY,MAAM,CAAC;AAClC,YAAM,WAAW,kBAAkB,SAAY,cAAc,MAAM,CAAC,IAAI;AAExE,YAAM,MAAM,OAAO,YAAY,QAAQ,oBAAI,IAAW,CAAC;AACvD,UAAI,IAAI,QAAQ;AAAA,IAClB;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,YAAqB,aAA4C,eAAiD;AAChH,UAAM,WAAW,oBAAI,IAAY;AAEjC,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAM,OAAO,KAAK,CAAC;AAEnB,YAAM,SAAS,YAAY,MAAM,CAAC;AAElC,YAAM,MAAM,SAAS,YAAY,QAAQ,CAAC,CAAC;AAC3C,UAAI,KAAK,IAAI;AAAA,IACf;AAEA,UAAM,SAAS,oBAAI,IAAc;AAEjC,eAAW,OAAO,SAAS,KAAK,GAAG;AACjC,aAAO,IAAI,KAAK,cAAc,SAAS,IAAI,GAAG,CAAE,CAAC;AAAA,IACnD;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,SACE,aACA,eACuB;AACvB,UAAM,SAAgC,CAAC;AAEvC,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAM,OAAO,KAAK,CAAC;AAEnB,YAAM,MAAM,YAAY,MAAM,CAAC;AAC/B,YAAM,WAAW,kBAAkB,SAAY,cAAc,MAAM,CAAC,IAAI;AAGxE,UAAI,OAAO,GAAG,MAAM,QAAW;AAC7B,cAAM,IAAI,cAAc,4DAAe,EAAE,eAAe,IAAI,CAAC;AAAA,MAC/D;AACA,aAAO,GAAG,IAAI;AAAA,IAChB;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,OAAgD,KAAQ,WAA8B;AAEpF,UAAM,cAAc,KAAK,WAAW,CAAC,SAAS,KAAK,SAAS,CAAC;AAE7D,UAAM,KAAK,CAAC,UAA+B;AACzC,aAAO,MAAM,IAAI,CAAC,UAAU;AAAA,QAC1B,GAAG,SAAS,IAAI;AAAA,QAChB,UAAU,GAAG,YAAY,IAAI,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;AAAA,MAC/C,EAAE;AAAA,IACJ;AAEA,UAAM,YAAY,KAAK,OAAO,CAAC,UAAU,MAAM,SAAS,KAAK,IAAI;AACjE,WAAO,GAAG,SAAS;AAAA,EACrB;AAAA,EAEA,SAAY,SAA2F;AAErG,UAAM,OAAO,OAAO,YAAY,YAAY,EAAE,cAAc,QAAQ,IAAK,WAAW,CAAC;AAGrF,QAAI,KAAK,iBAAiB,KAAM,QAAO,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC;AAGxD,QAAI,KAAK,OAAO;AACd,YAAMA,QAAO,oBAAI,IAAqB;AACtC,YAAMC,UAAc,CAAC;AACrB,iBAAW,QAAQ,MAAM;AACvB,cAAM,MAAM,KAAK,MAAM,IAAI;AAC3B,YAAI,CAACD,MAAK,IAAI,GAAG,GAAG;AAClB,UAAAA,MAAK,IAAI,GAAG;AACZ,UAAAC,QAAO,KAAK,IAAI;AAAA,QAClB;AAAA,MACF;AACA,aAAOA;AAAA,IACT;AAGA,UAAM,OAAO,oBAAI,IAAe;AAChC,UAAM,WAAW,oBAAI,IAAgD;AACrE,UAAM,SAAc,CAAC;AAErB,eAAW,QAAQ,MAAM;AAEvB,UAAI,SAAS,QAAQ,OAAO,SAAS,UAAU;AAC7C,cAAM,OAAO,OAAO;AAGpB,YAAI,SAAS,YAAY,SAAS,YAAY;AAC5C,cAAI,CAAC,SAAS,IAAI,IAAI,GAAG;AACvB,qBAAS,IAAI,IAAI;AACjB,mBAAO,KAAK,IAAI;AAAA,UAClB;AACA;AAAA,QACF;AAGA,YAAI,MAAM,OAAO;AACjB,YAAI,OAAO,GAAG,MAAM,EAAE,GAAG;AACvB,iBAAO;AAAA,QACT,OAAO;AACL,iBAAO,OAAO,IAAI;AAAA,QACpB;AAEA,YAAI,CAAC,KAAK,IAAI,GAAG,GAAG;AAClB,eAAK,IAAI,KAAK,IAAI;AAClB,iBAAO,KAAK,IAAI;AAAA,QAClB;AACA;AAAA,MACF;AAEA,UAAI,CAAC,OAAO,KAAK,CAAC,UAAU,SAAS,OAAO,IAAI,CAAC,GAAG;AAClD,eAAO,KAAK,IAAI;AAAA,MAClB;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,QAAW,UAAuF;AAChG,WAAO,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,MAAM;AAC9B,YAAM,KAAK,YAAY,OAAO,IAAI,SAAS,CAAC;AAC5C,YAAM,KAAK,YAAY,OAAO,IAAI,SAAS,CAAC;AAC5C,aAAO,gBAAgB,IAAI,IAAI,KAAK;AAAA,IACtC,CAAC;AAAA,EACH;AAAA,EAEA,YAAe,UAAuF;AACpG,WAAO,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,MAAM;AAC9B,YAAM,KAAK,YAAY,OAAO,IAAI,SAAS,CAAC;AAC5C,YAAM,KAAK,YAAY,OAAO,IAAI,SAAS,CAAC;AAC5C,aAAO,gBAAgB,IAAI,IAAI,IAAI;AAAA,IACrC,CAAC;AAAA,EACH;AAAA,EAEA,MACE,QACA,SAI0B;AAC1B,UAAM,SAAmC,CAAC;AAE1C,UAAM,kBAAkB,CAAC,GAAG,MAAM;AAClC,UAAM,qBAAqB,IAAI,IAAI,eAAe;AAClD,UAAM,WAAU,mCAAS,UAAS,UAAa,QAAQ,KAAK,SAAS;AACrE,UAAM,cAAc,EAAE,kBAAkB,mCAAS,SAAS;AAI1D,UAAM,mBAAmB,UAAU,oBAAI,IAAiB,IAAI;AAE5D,QAAI,kBAAkB;AACpB,iBAAW,cAAc,iBAAiB;AACxC,cAAM,SAAS,KAAK,UAAU,QAAS,KAAM,IAAI,CAAC,MAAO,WAAuC,CAAC,CAAC,CAAC;AACnG,cAAM,MAAM,iBAAiB,IAAI,MAAM;AACvC,YAAI,KAAK;AACP,cAAI,KAAK,UAAU;AAAA,QACrB,OAAO;AACL,2BAAiB,IAAI,QAAQ,CAAC,UAAU,CAAC;AAAA,QAC3C;AAAA,MACF;AAAA,IACF;AAEA,eAAW,cAAc,MAAM;AAE7B,UAAI;AACJ,UAAI;AAGJ,iBAAW,cAAc,iBAAiB;AACxC,YAAI,CAAC,mBAAmB,IAAI,UAAU,EAAG;AACzC,YAAI,SAAS,YAAY,YAAY,WAAW,GAAG;AACjD,uBAAa;AACb;AAAA,QACF;AAAA,MACF;AAGA,UAAI,eAAe,UAAa,kBAAkB;AAChD,cAAM,eAAe,KAAK,UAAU,QAAS,KAAM,IAAI,CAAC,MAAO,WAAuC,CAAC,CAAC,CAAC;AACzG,cAAM,aAAa,iBAAiB,IAAI,YAAY;AACpD,YAAI,cAAc,WAAW,SAAS,GAAG;AAEvC,0BAAgB,WAAW,KAAK,CAAC,MAAM,mBAAmB,IAAI,CAAC,CAAC;AAAA,QAClE;AAAA,MACF;AAEA,UAAI,eAAe,QAAW;AAC5B,2BAAmB,OAAO,UAAU;AAAA,MACtC,WAAW,kBAAkB,QAAW;AACtC,eAAO,KAAK,EAAE,QAAQ,YAAY,QAAQ,cAAc,CAAC;AACzD,2BAAmB,OAAO,aAAa;AAAA,MACzC,OAAO;AACL,eAAO,KAAK,EAAE,QAAQ,YAAY,QAAQ,OAAU,CAAC;AAAA,MACvD;AAAA,IACF;AAEA,eAAW,uBAAuB,oBAAoB;AACpD,aAAO,KAAK,EAAE,QAAQ,QAAW,QAAQ,oBAAoB,CAAC;AAAA,IAChE;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,YACE,UACA,iBACA,SAKwB;AACxB,UAAM,aACJ,oBAAoB,MAChB,WACA,SAAS;AAAA,MAAM,CAAC,YACd,OAAO,oBAAoB,aAAa,gBAAgB,OAAO,IAAI,QAAQ,eAAe;AAAA,IAC5F;AACN,UAAM,eAAc,mCAAS,gBAAe;AAE5C,UAAM,QAAgC,CAAC;AACvC,eAAW,QAAQ,MAAM;AACvB,YAAM,WAAW,OAAO,oBAAoB,aAAa,gBAAgB,IAAI,IAAI,KAAK,eAAe;AACrG,UAAI,YAAY,MAAM;AACpB,cAAM,KAAK,EAAE,MAAM,UAAU,MAAM,SAAS,OAAU,CAAC;AACvD;AAAA,MACF;AAEA,YAAM,UAAU,WAAW,IAAI,QAAQ;AACvC,UAAI,CAAC,SAAS;AACZ,cAAM,KAAK,EAAE,MAAM,UAAU,MAAM,SAAS,OAAU,CAAC;AACvD;AAAA,MACF;AAEA,UACE,SAAS,SAAS,MAAM;AAAA,QACtB,kBAAkB,mCAAS;AAAA,QAC3B,kBAAkB,mCAAS;AAAA,MAC7B,CAAC,GACD;AACA,YAAI,aAAa;AACf,gBAAM,KAAK,EAAE,MAAM,QAAQ,MAAM,QAAQ,CAAC;AAAA,QAC5C;AACA;AAAA,MACF;AAEA,YAAM,KAAK,EAAE,MAAM,UAAU,MAAM,QAAQ,CAAC;AAAA,IAC9C;AACA,WAAO;AAAA,EACT;AAAA,EAEA,MACE,QACA,SAIqB;AACrB,UAAM,QAAQ,KAAK,MAAM,QAAQ,OAAO;AAExC,UAAM,SAA8B,SAAS,IAAI;AAGjD,UAAM,iBAAiB,oBAAI,IAAe;AAC1C,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,qBAAe,IAAI,KAAK,CAAC,GAAG,CAAC;AAAA,IAC/B;AAEA,eAAW,QAAQ,OAAO;AAExB,UAAI,KAAK,WAAW,UAAa,KAAK,WAAW,QAAW;AAC1D,cAAM,cAAc,eAAe,IAAI,KAAK,MAAM;AAClD,YAAI,gBAAgB,QAAW;AAC7B,gBAAM,IAAI,QAAQ,yIAA0C;AAAA,QAC9D;AACA,eAAO,WAAW,IAAI,SAAS,KAAK,QAAQ,KAAK,MAAM;AAAA,MACzD,WAES,KAAK,WAAW,QAAW;AAClC,eAAO,KAAK,KAAK,MAAM;AAAA,MACzB;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,IAAO,UAAuD;AAC5D,QAAI,SAAS;AACb,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAM,OAAO,aAAa,SAAY,SAAS,KAAK,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC;AACnE,UAAI,OAAO,SAAS,UAAU;AAC5B,cAAM,IAAI,cAAc,yGAAmC,EAAE,MAAM,OAAO,KAAK,CAAC;AAAA,MAClF;AACA,gBAAU;AAAA,IACZ;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,IAAO,UAAqF;AAC1F,QAAI;AACJ,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAM,OAAO,aAAa,SAAY,SAAS,KAAK,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC;AACnE,UAAI,OAAO,SAAS,YAAY,OAAO,SAAS,UAAU;AACxD,cAAM,IAAI,cAAc,gHAA0C,EAAE,MAAM,OAAO,KAAK,CAAC;AAAA,MACzF;AACA,UAAI,WAAW,UAAa,SAAS,MAAM;AACzC,iBAAS;AAAA,MACX;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,IAAO,UAAqF;AAC1F,QAAI;AACJ,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAM,OAAO,aAAa,SAAY,SAAS,KAAK,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC;AACnE,UAAI,OAAO,SAAS,YAAY,OAAO,SAAS,UAAU;AACxD,cAAM,IAAI,cAAc,gHAA0C,EAAE,MAAM,OAAO,KAAK,CAAC;AAAA,MACzF;AACA,UAAI,WAAW,UAAa,SAAS,MAAM;AACzC,iBAAS;AAAA,MACX;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,UAAkB;AAChB,QAAI,KAAK,UAAU,GAAG;AACpB,aAAO,CAAC,GAAG,IAAI;AAAA,IACjB;AAEA,UAAM,SAAS,CAAC,GAAG,IAAI;AACvB,aAAS,IAAI,OAAO,SAAS,GAAG,IAAI,GAAG,KAAK;AAC1C,YAAM,IAAI,KAAK,MAAM,KAAK,OAAO,KAAK,IAAI,EAAE;AAC5C,OAAC,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AAAA,IAChD;AACA,WAAO;AAAA,EACT;AACF;AAEA,MAAM,yBAAiE;AAAA,EACrE,aAAgB,SAA2F;AAEzG,UAAM,OAAO,OAAO,YAAY,YAAY,EAAE,cAAc,QAAQ,IAAK,WAAW,CAAC;AAIrF,QAAI,KAAK,iBAAiB,MAAM;AAC9B,YAAMD,QAAO,oBAAI,IAAO;AACxB,YAAM,WAAqB,CAAC;AAC5B,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAIA,MAAK,IAAI,KAAK,CAAC,CAAC,GAAG;AACrB,mBAAS,KAAK,CAAC;AAAA,QACjB,OAAO;AACL,UAAAA,MAAK,IAAI,KAAK,CAAC,CAAC;AAAA,QAClB;AAAA,MACF;AAEA,eAAS,IAAI,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;AAC7C,aAAK,OAAO,SAAS,CAAC,GAAG,CAAC;AAAA,MAC5B;AACA,aAAO;AAAA,IACT;AAIA,QAAI,KAAK,OAAO;AACd,YAAMA,QAAO,oBAAI,IAAqB;AACtC,YAAM,WAAqB,CAAC;AAC5B,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,cAAM,MAAM,KAAK,MAAM,KAAK,CAAC,CAAC;AAC9B,YAAIA,MAAK,IAAI,GAAG,GAAG;AACjB,mBAAS,KAAK,CAAC;AAAA,QACjB,OAAO;AACL,UAAAA,MAAK,IAAI,GAAG;AAAA,QACd;AAAA,MACF;AAEA,eAAS,IAAI,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;AAC7C,aAAK,OAAO,SAAS,CAAC,GAAG,CAAC;AAAA,MAC5B;AACA,aAAO;AAAA,IACT;AAGA,UAAM,OAAO,oBAAI,IAAe;AAChC,UAAM,WAAW,oBAAI,IAAgD;AACrE,UAAM,cAAc,oBAAI,IAAY;AAEpC,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAM,OAAO,KAAK,CAAC;AAGnB,UAAI,SAAS,QAAQ,OAAO,SAAS,UAAU;AAC7C,cAAM,OAAO,OAAO;AAGpB,YAAI,SAAS,YAAY,SAAS,YAAY;AAC5C,cAAI,SAAS,IAAI,IAAI,GAAG;AACtB,wBAAY,IAAI,CAAC;AAAA,UACnB,OAAO;AACL,qBAAS,IAAI,IAAI;AAAA,UACnB;AACA;AAAA,QACF;AAGA,YAAI,MAAM,OAAO;AACjB,YAAI,OAAO,GAAG,MAAM,EAAE,GAAG;AACvB,iBAAO;AAAA,QACT,OAAO;AACL,iBAAO,OAAO,IAAI;AAAA,QACpB;AAEA,YAAI,KAAK,IAAI,GAAG,GAAG;AACjB,sBAAY,IAAI,CAAC;AAAA,QACnB,OAAO;AACL,eAAK,IAAI,KAAK,IAAI;AAAA,QACpB;AACA;AAAA,MACF;AAGA,UAAI,qBAAqB;AACzB,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAE1B,YAAI,YAAY,IAAI,CAAC,EAAG;AACxB,YAAI,SAAS,KAAK,CAAC,GAAG,IAAI,GAAG;AAC3B,+BAAqB;AACrB;AAAA,QACF;AAAA,MACF;AACA,UAAI,oBAAoB;AACtB,oBAAY,IAAI,CAAC;AAAA,MACnB;AAAA,IACF;AAGA,UAAM,cAAc,MAAM,KAAK,WAAW,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAChE,eAAW,OAAO,aAAa;AAC7B,WAAK,OAAO,KAAK,CAAC;AAAA,IACpB;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,YAAe,UAAuF;AACpG,WAAO,KAAK,KAAK,CAAC,GAAG,MAAM;AACzB,YAAM,MAAK,qCAAW,OAAM;AAC5B,YAAM,MAAK,qCAAW,OAAM;AAC5B,aAAO,gBAAgB,IAAI,IAAI,KAAK;AAAA,IACtC,CAAC;AAAA,EACH;AAAA,EAEA,gBAAmB,UAAuF;AACxG,WAAO,KAAK,KAAK,CAAC,GAAG,MAAM;AACzB,YAAM,MAAK,qCAAW,OAAM;AAC5B,YAAM,MAAK,qCAAW,OAAM;AAC5B,aAAO,gBAAgB,IAAI,IAAI,IAAI;AAAA,IACrC,CAAC;AAAA,EACH;AAAA,EAEA,OAAU,UAAkB,OAAiB;AAC3C,SAAK,OAAO,OAAO,GAAG,GAAG,KAAK;AAC9B,WAAO;AAAA,EACT;AAAA,EAEA,OAAU,gBAAgE;AACxE,UAAM,eACJ,OAAO,mBAAmB,aACrB,iBACD,CAAC,SAAY,SAAS;AAG5B,aAAS,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK;AACzC,UAAI,aAAa,KAAK,CAAC,GAAG,CAAC,GAAG;AAC5B,aAAK,OAAO,GAAG,CAAC;AAAA,MAClB;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,OAAqB,MAAc;AACjC,QAAI,KAAK,SAAS,IAAI,GAAG;AACvB,WAAK,OAAO,IAAI;AAAA,IAClB,OAAO;AACL,WAAK,KAAK,IAAI;AAAA,IAChB;AACA,WAAO;AAAA,EACT;AAAA,EAEA,QAAyB;AACvB,WAAO,KAAK,OAAO,MAAM,IAAI;AAAA,EAC/B;AACF;AAEA,WAAW,CAAC,MAAM,EAAE,KAAK,OAAO,QAAQ;AAAA,EACtC,GAAG;AAAA,EACH,GAAG;AACL,CAAC,GAAG;AACF,SAAO,eAAe,MAAM,WAAW,MAAM;AAAA,IAC3C,OAAO;AAAA,IACP,YAAY;AAAA,IACZ,UAAU;AAAA,IACV,cAAc;AAAA,EAChB,CAAC;AACH;",
+  "names": ["seen", "result"]
+}