@kubb/fabric-core 0.2.19 → 0.3.1

package/src/utils/TreeNode.ts

@@ -15,6 +15,7 @@ export class TreeNode<TData = unknown> {
   data: TData
   parent?: TreeNode<TData>
   children: Array<TreeNode<TData>> = []
+  #childrenMap = new Map<string, TreeNode<TData>>()
   #cachedLeaves?: Array<TreeNode<TData>>
 
   constructor(data: TData, parent?: TreeNode<TData>) {
@@ -25,20 +26,35 @@ export class TreeNode<TData = unknown> {
   addChild(data: TData): TreeNode<TData> {
     const child = new TreeNode(data, this)
     this.children.push(child)
+    // Update Map if data has a name property (for BarrelData)
+    if (typeof data === 'object' && data !== null && 'name' in data) {
+      this.#childrenMap.set((data as { name: string }).name, child)
+    }
     this.#cachedLeaves = undefined // invalidate cached leaves
     return child
   }
 
+  getChildByName(name: string): TreeNode<TData> | undefined {
+    return this.#childrenMap.get(name)
+  }
+
   get leaves(): Array<TreeNode<TData>> {
     if (this.#cachedLeaves) return this.#cachedLeaves
     if (this.children.length === 0) return [this]
 
-    const stack: Array<TreeNode<TData>> = [...this.children]
     const result: Array<TreeNode<TData>> = []
+    const stack: Array<TreeNode<TData>> = [...this.children]
+    const visited = new Set<TreeNode<TData>>()
 
-    for (const node of stack) {
-      if (node.children.length) {
-        for (const child of node.children) stack.push(child)
+    while (stack.length > 0) {
+      const node = stack.pop()!
+      if (visited.has(node)) {
+        continue
+      }
+      visited.add(node)
+
+      if (node.children.length > 0) {
+        stack.push(...node.children)
       } else {
         result.push(node)
       }
@@ -51,12 +67,15 @@ export class TreeNode<TData = unknown> {
   forEach(callback: (node: TreeNode<TData>) => void): this {
     const stack: Array<TreeNode<TData>> = [this]
 
-    for (const node of stack) {
+    for (let i = 0; i < stack.length; i++) {
+      const node = stack[i]!
       callback(node)
-      if (node.children.length) {
-        for (const child of node.children) stack.push(child)
+
+      if (node.children.length > 0) {
+        stack.push(...node.children)
       }
     }
+
     return this
   }
 
@@ -71,19 +90,28 @@ export class TreeNode<TData = unknown> {
     const nodes: Array<{ id: string; label: string }> = []
     const edges: Array<{ from: string; to: string }> = []
 
-    root.forEach((node) => {
+    const stack: Array<TreeNode<BarrelData>> = [root]
+
+    for (let i = 0; i < stack.length; i++) {
+      const node = stack[i]!
+
       nodes.push({
         id: node.data.path,
         label: node.data.name,
       })
 
-      for (const child of node.children) {
-        edges.push({
-          from: node.data.path,
-          to: child.data.path,
-        })
+      const children = node.children
+      if (children.length > 0) {
+        for (let j = 0, len = children.length; j < len; j++) {
+          const child = children[j]!
+          edges.push({
+            from: node.data.path,
+            to: child.data.path,
+          })
+          stack.push(child)
+        }
       }
-    })
+    }
 
     return { nodes, edges }
   }
@@ -93,11 +121,15 @@ export class TreeNode<TData = unknown> {
     const normalizedRoot = normalizePath(rootFolder)
     const rootPrefix = normalizedRoot.endsWith('/') ? normalizedRoot : `${normalizedRoot}/`
 
-    const filteredFiles = files.filter((file) => {
-      const filePath = normalizePath(file.path)
-
-      return !filePath.endsWith('.json') && (!rootFolder || filePath.startsWith(rootPrefix))
-    })
+    const normalizedPaths = new Map<KubbFile.File, string>()
+    const filteredFiles: Array<KubbFile.File> = []
+    for (const file of files) {
+      const filePath = normalizedPaths.get(file) ?? normalizePath(file.path)
+      normalizedPaths.set(file, filePath)
+      if (!filePath.endsWith('.json') && (!rootFolder || filePath.startsWith(rootPrefix))) {
+        filteredFiles.push(file)
+      }
+    }
 
     if (filteredFiles.length === 0) {
       return null
@@ -110,7 +142,8 @@ export class TreeNode<TData = unknown> {
     })
 
     for (const file of filteredFiles) {
-      const relPath = normalizePath(file.path).slice(rootPrefix.length)
+      const filePath = normalizedPaths.get(file)!
+      const relPath = filePath.slice(rootPrefix.length)
       const parts = relPath.split('/')
 
       let current = treeNode
@@ -120,13 +153,7 @@ export class TreeNode<TData = unknown> {
         const isLast = index === parts.length - 1
         currentPath += (currentPath.endsWith('/') ? '' : '/') + part
 
-        let next: TreeNode<BarrelData> | undefined
-        for (const child of current.children) {
-          if ((child.data as BarrelData).name === part) {
-            next = child
-            break
-          }
-        }
+        let next = current.getChildByName(part)
 
         if (!next) {
           next = current.addChild({

package/dist/defineProperty-DZi5DvrW.cjs

@@ -1,390 +0,0 @@
-const require_trimExtName = require('./trimExtName-Bb4zGVF1.cjs');
-let natural_orderby = require("natural-orderby");
-natural_orderby = require_trimExtName.__toESM(natural_orderby);
-let node_crypto = require("node:crypto");
-node_crypto = require_trimExtName.__toESM(node_crypto);
-let node_path = require("node:path");
-node_path = require_trimExtName.__toESM(node_path);
-
-//#region ../../node_modules/.pnpm/remeda@2.32.0/node_modules/remeda/dist/lazyDataLastImpl-BDhrIOwR.js
-function e$1(e$2, t$5, n$4) {
-	let r$4 = (n$5) => e$2(n$5, ...t$5);
-	return n$4 === void 0 ? r$4 : Object.assign(r$4, {
-		lazy: n$4,
-		lazyArgs: t$5
-	});
-}
-
-//#endregion
-//#region ../../node_modules/.pnpm/remeda@2.32.0/node_modules/remeda/dist/purry-DH9cw9sy.js
-function t$3(t$5, n$4, r$4) {
-	let i$2 = t$5.length - n$4.length;
-	if (i$2 === 0) return t$5(...n$4);
-	if (i$2 === 1) return e$1(t$5, n$4, r$4);
-	throw Error(`Wrong number of arguments`);
-}
-
-//#endregion
-//#region ../../node_modules/.pnpm/remeda@2.32.0/node_modules/remeda/dist/utilityEvaluators-DORpnx39.js
-const e = {
-	done: !0,
-	hasNext: !1
-}, t$1 = {
-	done: !1,
-	hasNext: !1
-}, n$3 = () => e, r$3 = (e$2) => ({
-	hasNext: !0,
-	next: e$2,
-	done: !1
-});
-
-//#endregion
-//#region ../../node_modules/.pnpm/remeda@2.32.0/node_modules/remeda/dist/pipe-jLehR9-P.js
-function t$4(e$2, ...t$5) {
-	let a$1 = e$2, o = t$5.map((e$3) => `lazy` in e$3 ? r$2(e$3) : void 0), s = 0;
-	for (; s < t$5.length;) {
-		if (o[s] === void 0 || !i$1(a$1)) {
-			let e$4 = t$5[s];
-			a$1 = e$4(a$1), s += 1;
-			continue;
-		}
-		let e$3 = [];
-		for (let n$4 = s; n$4 < t$5.length; n$4++) {
-			let t$6 = o[n$4];
-			if (t$6 === void 0 || (e$3.push(t$6), t$6.isSingle)) break;
-		}
-		let r$4 = [];
-		for (let t$6 of a$1) if (n$2(t$6, r$4, e$3)) break;
-		let { isSingle: c } = e$3.at(-1);
-		a$1 = c ? r$4[0] : r$4, s += e$3.length;
-	}
-	return a$1;
-}
-function n$2(t$5, r$4, i$2) {
-	if (i$2.length === 0) return r$4.push(t$5), !1;
-	let a$1 = t$5, o = t$1, s = !1;
-	for (let [e$2, t$6] of i$2.entries()) {
-		let { index: c, items: l } = t$6;
-		if (l.push(a$1), o = t$6(a$1, c, l), t$6.index += 1, o.hasNext) {
-			var _o$hasMany;
-			if ((_o$hasMany = o.hasMany) !== null && _o$hasMany !== void 0 ? _o$hasMany : !1) {
-				for (let t$7 of o.next) if (n$2(t$7, r$4, i$2.slice(e$2 + 1))) return !0;
-				return s;
-			}
-			a$1 = o.next;
-		}
-		if (!o.hasNext) break;
-		o.done && (s = !0);
-	}
-	return o.hasNext && r$4.push(a$1), s;
-}
-function r$2(e$2) {
-	var _t$single;
-	let { lazy: t$5, lazyArgs: n$4 } = e$2, r$4 = t$5(...n$4);
-	return Object.assign(r$4, {
-		isSingle: (_t$single = t$5.single) !== null && _t$single !== void 0 ? _t$single : !1,
-		index: 0,
-		items: []
-	});
-}
-function i$1(e$2) {
-	return typeof e$2 == `string` || typeof e$2 == `object` && !!e$2 && Symbol.iterator in e$2;
-}
-
-//#endregion
-//#region ../../node_modules/.pnpm/remeda@2.32.0/node_modules/remeda/dist/purryFromLazy-3oywCNIb.js
-function t$2(t$5, n$4) {
-	let r$4 = n$4.length - t$5.length;
-	if (r$4 === 1) {
-		let [r$5, ...i$2] = n$4;
-		return t$4(r$5, {
-			lazy: t$5,
-			lazyArgs: i$2
-		});
-	}
-	if (r$4 === 0) {
-		let r$5 = {
-			lazy: t$5,
-			lazyArgs: n$4
-		};
-		return Object.assign((t$6) => t$4(t$6, r$5), r$5);
-	}
-	throw Error(`Wrong number of arguments`);
-}
-
-//#endregion
-//#region ../../node_modules/.pnpm/remeda@2.32.0/node_modules/remeda/dist/isDeepEqual-jLo35Woq.js
-function t(...t$5) {
-	return t$3(n$1, t$5);
-}
-function n$1(e$2, t$5) {
-	if (e$2 === t$5 || Object.is(e$2, t$5)) return !0;
-	if (typeof e$2 != `object` || typeof t$5 != `object` || e$2 === null || t$5 === null || Object.getPrototypeOf(e$2) !== Object.getPrototypeOf(t$5)) return !1;
-	if (Array.isArray(e$2)) return r$1(e$2, t$5);
-	if (e$2 instanceof Map) return i(e$2, t$5);
-	if (e$2 instanceof Set) return a(e$2, t$5);
-	if (e$2 instanceof Date) return e$2.getTime() === t$5.getTime();
-	if (e$2 instanceof RegExp) return e$2.toString() === t$5.toString();
-	if (Object.keys(e$2).length !== Object.keys(t$5).length) return !1;
-	for (let [r$4, i$2] of Object.entries(e$2)) if (!(r$4 in t$5) || !n$1(i$2, t$5[r$4])) return !1;
-	return !0;
-}
-function r$1(e$2, t$5) {
-	if (e$2.length !== t$5.length) return !1;
-	for (let [r$4, i$2] of e$2.entries()) if (!n$1(i$2, t$5[r$4])) return !1;
-	return !0;
-}
-function i(e$2, t$5) {
-	if (e$2.size !== t$5.size) return !1;
-	for (let [r$4, i$2] of e$2.entries()) if (!t$5.has(r$4) || !n$1(i$2, t$5.get(r$4))) return !1;
-	return !0;
-}
-function a(e$2, t$5) {
-	if (e$2.size !== t$5.size) return !1;
-	let r$4 = [...t$5];
-	for (let t$6 of e$2) {
-		let e$3 = !1;
-		for (let [i$2, a$1] of r$4.entries()) if (n$1(t$6, a$1)) {
-			e$3 = !0, r$4.splice(i$2, 1);
-			break;
-		}
-		if (!e$3) return !1;
-	}
-	return !0;
-}
-
-//#endregion
-//#region ../../node_modules/.pnpm/remeda@2.32.0/node_modules/remeda/dist/uniqueBy-C_PxkF_D.js
-function n(...e$2) {
-	return t$2(r, e$2);
-}
-function r(t$5) {
-	let n$4 = t$5, r$4 = /* @__PURE__ */ new Set();
-	return (t$6, i$2, a$1) => {
-		let o = n$4(t$6, i$2, a$1);
-		return r$4.has(o) ? t$1 : (r$4.add(o), {
-			done: !1,
-			hasNext: !0,
-			next: t$6
-		});
-	};
-}
-
-//#endregion
-//#region src/createFile.ts
-function combineSources(sources) {
-	return n(sources, (obj) => [
-		obj.name,
-		obj.isExportable,
-		obj.isTypeOnly
-	]);
-}
-function combineExports(exports$1) {
-	return (0, natural_orderby.orderBy)(exports$1, [
-		(v) => !!Array.isArray(v.name),
-		(v) => !v.isTypeOnly,
-		(v) => v.path,
-		(v) => !!v.name,
-		(v) => Array.isArray(v.name) ? (0, natural_orderby.orderBy)(v.name) : v.name
-	]).reduce((prev, curr) => {
-		const name = curr.name;
-		const prevByPath = prev.findLast((imp) => imp.path === curr.path);
-		if (prev.findLast((imp) => imp.path === curr.path && t(imp.name, name) && imp.isTypeOnly)) return prev;
-		if (prev.findLast((imp) => imp.path === curr.path && t(imp.name, name) && imp.isTypeOnly === curr.isTypeOnly && imp.asAlias === curr.asAlias) || Array.isArray(name) && !name.length || (prevByPath === null || prevByPath === void 0 ? void 0 : prevByPath.asAlias) && !curr.asAlias) return prev;
-		if (!prevByPath) return [...prev, {
-			...curr,
-			name: Array.isArray(name) ? [...new Set(name)] : name
-		}];
-		if (prevByPath && Array.isArray(prevByPath.name) && Array.isArray(curr.name) && prevByPath.isTypeOnly === curr.isTypeOnly) {
-			prevByPath.name = [...new Set([...prevByPath.name, ...curr.name])];
-			return prev;
-		}
-		return [...prev, curr];
-	}, []);
-}
-function combineImports(imports, exports$1, source) {
-	const exportedNameLookup = /* @__PURE__ */ new Set();
-	for (const item of exports$1) {
-		const { name } = item;
-		if (!name) continue;
-		if (Array.isArray(name)) {
-			for (const value of name) if (value) exportedNameLookup.add(value);
-			continue;
-		}
-		exportedNameLookup.add(name);
-	}
-	const usageCache = /* @__PURE__ */ new Map();
-	const hasImportInSource = (importName) => {
-		if (!source) return true;
-		const cached = usageCache.get(importName);
-		if (cached !== void 0) return cached;
-		const isUsed = source.includes(importName) || exportedNameLookup.has(importName);
-		usageCache.set(importName, isUsed);
-		return isUsed;
-	};
-	return (0, natural_orderby.orderBy)(imports, [
-		(v) => !!Array.isArray(v.name),
-		(v) => !v.isTypeOnly,
-		(v) => v.path,
-		(v) => !!v.name,
-		(v) => Array.isArray(v.name) ? (0, natural_orderby.orderBy)(v.name) : v.name
-	]).reduce((prev, curr) => {
-		let name = Array.isArray(curr.name) ? [...new Set(curr.name)] : curr.name;
-		if (curr.path === curr.root) return prev;
-		if (Array.isArray(name)) name = name.filter((item) => typeof item === "string" ? hasImportInSource(item) : hasImportInSource(item.propertyName));
-		const prevByPath = prev.findLast((imp) => imp.path === curr.path && imp.isTypeOnly === curr.isTypeOnly);
-		const uniquePrev = prev.findLast((imp) => imp.path === curr.path && t(imp.name, name) && imp.isTypeOnly === curr.isTypeOnly);
-		if (prev.findLast((imp) => imp.path === curr.path && t(imp.name, name) && imp.isTypeOnly)) return prev;
-		if (uniquePrev || Array.isArray(name) && !name.length) return prev;
-		if (!prevByPath) return [...prev, {
-			...curr,
-			name
-		}];
-		if (prevByPath && Array.isArray(prevByPath.name) && Array.isArray(name) && prevByPath.isTypeOnly === curr.isTypeOnly) {
-			prevByPath.name = [...new Set([...prevByPath.name, ...name])];
-			return prev;
-		}
-		if (!Array.isArray(name) && name && !hasImportInSource(name)) return prev;
-		return [...prev, curr];
-	}, []);
-}
-/**
-* Helper to create a file with name and id set
-*/
-function createFile(file) {
-	var _file$exports, _file$imports, _file$sources;
-	const extname = node_path.default.extname(file.baseName);
-	if (!extname) throw new Error(`No extname found for ${file.baseName}`);
-	const source = file.sources.map((item) => item.value).join("\n\n");
-	const exports$1 = ((_file$exports = file.exports) === null || _file$exports === void 0 ? void 0 : _file$exports.length) ? combineExports(file.exports) : [];
-	const imports = ((_file$imports = file.imports) === null || _file$imports === void 0 ? void 0 : _file$imports.length) && source ? combineImports(file.imports, exports$1, source) : [];
-	const sources = ((_file$sources = file.sources) === null || _file$sources === void 0 ? void 0 : _file$sources.length) ? combineSources(file.sources) : [];
-	return {
-		...file,
-		id: (0, node_crypto.createHash)("sha256").update(file.path).digest("hex"),
-		name: require_trimExtName.trimExtName(file.baseName),
-		extname,
-		imports,
-		exports: exports$1,
-		sources,
-		meta: file.meta || {}
-	};
-}
-
-//#endregion
-//#region \0@oxc-project+runtime@0.95.0/helpers/checkPrivateRedeclaration.js
-function _checkPrivateRedeclaration(e$2, t$5) {
-	if (t$5.has(e$2)) throw new TypeError("Cannot initialize the same private elements twice on an object");
-}
-
-//#endregion
-//#region \0@oxc-project+runtime@0.95.0/helpers/classPrivateFieldInitSpec.js
-function _classPrivateFieldInitSpec(e$2, t$5, a$1) {
-	_checkPrivateRedeclaration(e$2, t$5), t$5.set(e$2, a$1);
-}
-
-//#endregion
-//#region \0@oxc-project+runtime@0.95.0/helpers/assertClassBrand.js
-function _assertClassBrand(e$2, t$5, n$4) {
-	if ("function" == typeof e$2 ? e$2 === t$5 : e$2.has(t$5)) return arguments.length < 3 ? t$5 : n$4;
-	throw new TypeError("Private element is not present on this object");
-}
-
-//#endregion
-//#region \0@oxc-project+runtime@0.95.0/helpers/classPrivateFieldGet2.js
-function _classPrivateFieldGet2(s, a$1) {
-	return s.get(_assertClassBrand(s, a$1));
-}
-
-//#endregion
-//#region \0@oxc-project+runtime@0.95.0/helpers/classPrivateFieldSet2.js
-function _classPrivateFieldSet2(s, a$1, r$4) {
-	return s.set(_assertClassBrand(s, a$1), r$4), r$4;
-}
-
-//#endregion
-//#region \0@oxc-project+runtime@0.95.0/helpers/typeof.js
-function _typeof(o) {
-	"@babel/helpers - typeof";
-	return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function(o$1) {
-		return typeof o$1;
-	} : function(o$1) {
-		return o$1 && "function" == typeof Symbol && o$1.constructor === Symbol && o$1 !== Symbol.prototype ? "symbol" : typeof o$1;
-	}, _typeof(o);
-}
-
-//#endregion
-//#region \0@oxc-project+runtime@0.95.0/helpers/toPrimitive.js
-function toPrimitive(t$5, r$4) {
-	if ("object" != _typeof(t$5) || !t$5) return t$5;
-	var e$2 = t$5[Symbol.toPrimitive];
-	if (void 0 !== e$2) {
-		var i$2 = e$2.call(t$5, r$4 || "default");
-		if ("object" != _typeof(i$2)) return i$2;
-		throw new TypeError("@@toPrimitive must return a primitive value.");
-	}
-	return ("string" === r$4 ? String : Number)(t$5);
-}
-
-//#endregion
-//#region \0@oxc-project+runtime@0.95.0/helpers/toPropertyKey.js
-function toPropertyKey(t$5) {
-	var i$2 = toPrimitive(t$5, "string");
-	return "symbol" == _typeof(i$2) ? i$2 : i$2 + "";
-}
-
-//#endregion
-//#region \0@oxc-project+runtime@0.95.0/helpers/defineProperty.js
-function _defineProperty(e$2, r$4, t$5) {
-	return (r$4 = toPropertyKey(r$4)) in e$2 ? Object.defineProperty(e$2, r$4, {
-		value: t$5,
-		enumerable: !0,
-		configurable: !0,
-		writable: !0
-	}) : e$2[r$4] = t$5, e$2;
-}
-
-//#endregion
-Object.defineProperty(exports, '_assertClassBrand', {
-  enumerable: true,
-  get: function () {
-    return _assertClassBrand;
-  }
-});
-Object.defineProperty(exports, '_checkPrivateRedeclaration', {
-  enumerable: true,
-  get: function () {
-    return _checkPrivateRedeclaration;
-  }
-});
-Object.defineProperty(exports, '_classPrivateFieldGet2', {
-  enumerable: true,
-  get: function () {
-    return _classPrivateFieldGet2;
-  }
-});
-Object.defineProperty(exports, '_classPrivateFieldInitSpec', {
-  enumerable: true,
-  get: function () {
-    return _classPrivateFieldInitSpec;
-  }
-});
-Object.defineProperty(exports, '_classPrivateFieldSet2', {
-  enumerable: true,
-  get: function () {
-    return _classPrivateFieldSet2;
-  }
-});
-Object.defineProperty(exports, '_defineProperty', {
-  enumerable: true,
-  get: function () {
-    return _defineProperty;
-  }
-});
-Object.defineProperty(exports, 'createFile', {
-  enumerable: true,
-  get: function () {
-    return createFile;
-  }
-});
-//# sourceMappingURL=defineProperty-DZi5DvrW.cjs.map

package/dist/defineProperty-DZi5DvrW.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"defineProperty-DZi5DvrW.cjs","names":["e","r","n","t","t","i","n","e","r","t","n","r","e","t","a","e","r","i","n","t","r","n","i","e","t","e","n","r","i","a","e","t","n","r","i","a","uniqueBy","exports","isDeepEqual","path","trimExtName"],"sources":["../../../node_modules/.pnpm/remeda@2.32.0/node_modules/remeda/dist/lazyDataLastImpl-BDhrIOwR.js","../../../node_modules/.pnpm/remeda@2.32.0/node_modules/remeda/dist/purry-DH9cw9sy.js","../../../node_modules/.pnpm/remeda@2.32.0/node_modules/remeda/dist/utilityEvaluators-DORpnx39.js","../../../node_modules/.pnpm/remeda@2.32.0/node_modules/remeda/dist/pipe-jLehR9-P.js","../../../node_modules/.pnpm/remeda@2.32.0/node_modules/remeda/dist/purryFromLazy-3oywCNIb.js","../../../node_modules/.pnpm/remeda@2.32.0/node_modules/remeda/dist/isDeepEqual-jLo35Woq.js","../../../node_modules/.pnpm/remeda@2.32.0/node_modules/remeda/dist/uniqueBy-C_PxkF_D.js","../src/createFile.ts"],"sourcesContent":["function e(e,t,n){let r=n=>e(n,...t);return n===void 0?r:Object.assign(r,{lazy:n,lazyArgs:t})}export{e as lazyDataLastImpl};\n//# sourceMappingURL=lazyDataLastImpl-BDhrIOwR.js.map","import{lazyDataLastImpl as e}from\"./lazyDataLastImpl-BDhrIOwR.js\";function t(t,n,r){let i=t.length-n.length;if(i===0)return t(...n);if(i===1)return e(t,n,r);throw Error(`Wrong number of arguments`)}export{t as purry};\n//# sourceMappingURL=purry-DH9cw9sy.js.map","const e={done:!0,hasNext:!1},t={done:!1,hasNext:!1},n=()=>e,r=e=>({hasNext:!0,next:e,done:!1});export{t as SKIP_ITEM,n as lazyEmptyEvaluator,r as lazyIdentityEvaluator};\n//# sourceMappingURL=utilityEvaluators-DORpnx39.js.map","import{SKIP_ITEM as e}from\"./utilityEvaluators-DORpnx39.js\";function t(e,...t){let a=e,o=t.map(e=>`lazy`in e?r(e):void 0),s=0;for(;s<t.length;){if(o[s]===void 0||!i(a)){let e=t[s];a=e(a),s+=1;continue}let e=[];for(let n=s;n<t.length;n++){let t=o[n];if(t===void 0||(e.push(t),t.isSingle))break}let r=[];for(let t of a)if(n(t,r,e))break;let{isSingle:c}=e.at(-1);a=c?r[0]:r,s+=e.length}return a}function n(t,r,i){if(i.length===0)return r.push(t),!1;let a=t,o=e,s=!1;for(let[e,t]of i.entries()){let{index:c,items:l}=t;if(l.push(a),o=t(a,c,l),t.index+=1,o.hasNext){if(o.hasMany??!1){for(let t of o.next)if(n(t,r,i.slice(e+1)))return!0;return s}a=o.next}if(!o.hasNext)break;o.done&&(s=!0)}return o.hasNext&&r.push(a),s}function r(e){let{lazy:t,lazyArgs:n}=e,r=t(...n);return Object.assign(r,{isSingle:t.single??!1,index:0,items:[]})}function i(e){return typeof e==`string`||typeof e==`object`&&!!e&&Symbol.iterator in e}export{t as pipe};\n//# sourceMappingURL=pipe-jLehR9-P.js.map","import{pipe as e}from\"./pipe-jLehR9-P.js\";function t(t,n){let r=n.length-t.length;if(r===1){let[r,...i]=n;return e(r,{lazy:t,lazyArgs:i})}if(r===0){let r={lazy:t,lazyArgs:n};return Object.assign(t=>e(t,r),r)}throw Error(`Wrong number of arguments`)}export{t as purryFromLazy};\n//# sourceMappingURL=purryFromLazy-3oywCNIb.js.map","import{purry as e}from\"./purry-DH9cw9sy.js\";function t(...t){return e(n,t)}function n(e,t){if(e===t||Object.is(e,t))return!0;if(typeof e!=`object`||typeof t!=`object`||e===null||t===null||Object.getPrototypeOf(e)!==Object.getPrototypeOf(t))return!1;if(Array.isArray(e))return r(e,t);if(e instanceof Map)return i(e,t);if(e instanceof Set)return a(e,t);if(e instanceof Date)return e.getTime()===t.getTime();if(e instanceof RegExp)return e.toString()===t.toString();if(Object.keys(e).length!==Object.keys(t).length)return!1;for(let[r,i]of Object.entries(e))if(!(r in t)||!n(i,t[r]))return!1;return!0}function r(e,t){if(e.length!==t.length)return!1;for(let[r,i]of e.entries())if(!n(i,t[r]))return!1;return!0}function i(e,t){if(e.size!==t.size)return!1;for(let[r,i]of e.entries())if(!t.has(r)||!n(i,t.get(r)))return!1;return!0}function a(e,t){if(e.size!==t.size)return!1;let r=[...t];for(let t of e){let e=!1;for(let[i,a]of r.entries())if(n(t,a)){e=!0,r.splice(i,1);break}if(!e)return!1}return!0}export{t as isDeepEqual};\n//# sourceMappingURL=isDeepEqual-jLo35Woq.js.map","import{SKIP_ITEM as e}from\"./utilityEvaluators-DORpnx39.js\";import{purryFromLazy as t}from\"./purryFromLazy-3oywCNIb.js\";function n(...e){return t(r,e)}function r(t){let n=t,r=new Set;return(t,i,a)=>{let o=n(t,i,a);return r.has(o)?e:(r.add(o),{done:!1,hasNext:!0,next:t})}}export{n as uniqueBy};\n//# sourceMappingURL=uniqueBy-C_PxkF_D.js.map","import { createHash } from 'node:crypto'\nimport path from 'node:path'\nimport { orderBy } from 'natural-orderby'\nimport { isDeepEqual, uniqueBy } from 'remeda'\nimport type * as KubbFile from './KubbFile.ts'\nimport { trimExtName } from './utils/trimExtName.ts'\n\nexport function combineSources(sources: Array<KubbFile.Source>): Array<KubbFile.Source> {\n  return uniqueBy(sources, (obj) => [obj.name, obj.isExportable, obj.isTypeOnly] as const)\n}\n\nexport function combineExports(exports: Array<KubbFile.Export>): Array<KubbFile.Export> {\n  return orderBy(exports, [\n    (v) => !!Array.isArray(v.name),\n    (v) => !v.isTypeOnly,\n    (v) => v.path,\n    (v) => !!v.name,\n    (v) => (Array.isArray(v.name) ? orderBy(v.name) : v.name),\n  ]).reduce(\n    (prev, curr) => {\n      const name = curr.name\n      const prevByPath = prev.findLast((imp) => imp.path === curr.path)\n      const prevByPathAndIsTypeOnly = prev.findLast((imp) => imp.path === curr.path && isDeepEqual(imp.name, name) && imp.isTypeOnly)\n\n      if (prevByPathAndIsTypeOnly) {\n        // we already have an export that has the same path but uses `isTypeOnly` (export type ...)\n        return prev\n      }\n\n      const uniquePrev = prev.findLast(\n        (imp) => imp.path === curr.path && isDeepEqual(imp.name, name) && imp.isTypeOnly === curr.isTypeOnly && imp.asAlias === curr.asAlias,\n      )\n\n      // we already have an item that was unique enough or name field is empty or prev asAlias is set but current has no changes\n      if (uniquePrev || (Array.isArray(name) && !name.length) || (prevByPath?.asAlias && !curr.asAlias)) {\n        return prev\n      }\n\n      if (!prevByPath) {\n        return [\n          ...prev,\n          {\n            ...curr,\n            name: Array.isArray(name) ? [...new Set(name)] : name,\n          },\n        ]\n      }\n\n      // merge all names when prev and current both have the same isTypeOnly set\n      if (prevByPath && Array.isArray(prevByPath.name) && Array.isArray(curr.name) && prevByPath.isTypeOnly === curr.isTypeOnly) {\n        prevByPath.name = [...new Set([...prevByPath.name, ...curr.name])]\n\n        return prev\n      }\n\n      return [...prev, curr]\n    },\n    [] as Array<KubbFile.Export>,\n  )\n}\n\nexport function combineImports(imports: Array<KubbFile.Import>, exports: Array<KubbFile.Export>, source?: string): Array<KubbFile.Import> {\n  const exportedNameLookup = new Set<string>()\n  for (const item of exports) {\n    const { name } = item\n    if (!name) {\n      continue\n    }\n\n    if (Array.isArray(name)) {\n      for (const value of name) {\n        if (value) {\n          exportedNameLookup.add(value)\n        }\n      }\n      continue\n    }\n\n    exportedNameLookup.add(name)\n  }\n\n  const usageCache = new Map<string, boolean>()\n  const hasImportInSource = (importName: string): boolean => {\n    if (!source) {\n      return true\n    }\n\n    const cached = usageCache.get(importName)\n    if (cached !== undefined) {\n      return cached\n    }\n\n    const isUsed = source.includes(importName) || exportedNameLookup.has(importName)\n    usageCache.set(importName, isUsed)\n\n    return isUsed\n  }\n\n  return orderBy(imports, [\n    (v) => !!Array.isArray(v.name),\n    (v) => !v.isTypeOnly,\n    (v) => v.path,\n    (v) => !!v.name,\n    (v) => (Array.isArray(v.name) ? orderBy(v.name) : v.name),\n  ]).reduce<Array<KubbFile.Import>>((prev, curr) => {\n    let name = Array.isArray(curr.name) ? [...new Set(curr.name)] : curr.name\n\n    if (curr.path === curr.root) {\n      // root and path are the same file, remove the \"./\" import\n      return prev\n    }\n\n    // merge all names and check if the importName is being used in the generated source and if not filter those imports out\n    if (Array.isArray(name)) {\n      name = name.filter((item) => (typeof item === 'string' ? hasImportInSource(item) : hasImportInSource(item.propertyName)))\n    }\n\n    const prevByPath = prev.findLast((imp) => imp.path === curr.path && imp.isTypeOnly === curr.isTypeOnly)\n    const uniquePrev = prev.findLast((imp) => imp.path === curr.path && isDeepEqual(imp.name, name) && imp.isTypeOnly === curr.isTypeOnly)\n    const prevByPathNameAndIsTypeOnly = prev.findLast((imp) => imp.path === curr.path && isDeepEqual(imp.name, name) && imp.isTypeOnly)\n\n    if (prevByPathNameAndIsTypeOnly) {\n      // we already have an export that has the same path but uses `isTypeOnly` (import type ...)\n      return prev\n    }\n\n    // already unique enough or name is empty\n    if (uniquePrev || (Array.isArray(name) && !name.length)) {\n      return prev\n    }\n\n    // new item, append name\n    if (!prevByPath) {\n      return [\n        ...prev,\n        {\n          ...curr,\n          name,\n        },\n      ]\n    }\n\n    // merge all names when prev and current both have the same isTypeOnly set\n    if (prevByPath && Array.isArray(prevByPath.name) && Array.isArray(name) && prevByPath.isTypeOnly === curr.isTypeOnly) {\n      prevByPath.name = [...new Set([...prevByPath.name, ...name])]\n\n      return prev\n    }\n\n    // no import was found in the source, ignore import\n    if (!Array.isArray(name) && name && !hasImportInSource(name)) {\n      return prev\n    }\n\n    return [...prev, curr]\n  }, [])\n}\n\n/**\n * Helper to create a file with name and id set\n */\nexport function createFile<TMeta extends object = object>(file: KubbFile.File<TMeta>): KubbFile.ResolvedFile<TMeta> {\n  const extname = path.extname(file.baseName) as KubbFile.Extname\n  if (!extname) {\n    throw new Error(`No extname found for ${file.baseName}`)\n  }\n\n  const source = file.sources.map((item) => item.value).join('\\n\\n')\n  const exports = file.exports?.length ? combineExports(file.exports) : []\n  const imports = file.imports?.length && source ? combineImports(file.imports, exports, source) : []\n  const sources = file.sources?.length ? combineSources(file.sources) : []\n\n  return {\n    ...file,\n    id: createHash('sha256').update(file.path).digest('hex'),\n    name: trimExtName(file.baseName),\n    extname,\n    imports: imports,\n    exports: exports,\n    sources: sources,\n    meta: file.meta || ({} as TMeta),\n  }\n}\n"],"x_google_ignoreList":[0,1,2,3,4,5,6],"mappings":";;;;;;;;;AAAA,SAASA,IAAE,KAAE,KAAE,KAAE;CAAC,IAAIC,OAAE,QAAGD,IAAEE,KAAE,GAAGC,IAAE;AAAC,QAAOD,QAAI,KAAK,IAAED,MAAE,OAAO,OAAOA,KAAE;EAAC,MAAKC;EAAE,UAASC;EAAE,CAAC;;;;;ACA3B,SAASC,IAAE,KAAE,KAAE,KAAE;CAAC,IAAIC,MAAED,IAAE,SAAOE,IAAE;AAAO,KAAGD,QAAI,EAAE,QAAOD,IAAE,GAAGE,IAAE;AAAC,KAAGD,QAAI,EAAE,QAAOE,IAAEH,KAAEE,KAAEE,IAAE;AAAC,OAAM,MAAM,4BAA4B;;;;;ACArM,MAAM,IAAE;CAAC,MAAK,CAAC;CAAE,SAAQ,CAAC;CAAE,EAACC,MAAE;CAAC,MAAK,CAAC;CAAE,SAAQ,CAAC;CAAE,EAACC,YAAM,GAAEC,OAAE,SAAI;CAAC,SAAQ,CAAC;CAAE,MAAKC;CAAE,MAAK,CAAC;CAAE;;;;ACAjC,SAASC,IAAE,KAAE,GAAGA,KAAE;CAAC,IAAIC,MAAEC,KAAE,IAAEF,IAAE,KAAI,QAAG,UAASE,MAAEC,IAAED,IAAE,GAAC,KAAK,EAAE,EAAC,IAAE;AAAE,QAAK,IAAEF,IAAE,SAAQ;AAAC,MAAG,EAAE,OAAK,KAAK,KAAG,CAACI,IAAEH,IAAE,EAAC;GAAC,IAAIC,MAAEF,IAAE;AAAG,SAAEE,IAAED,IAAE,EAAC,KAAG;AAAE;;EAAS,IAAIC,MAAE,EAAE;AAAC,OAAI,IAAIG,MAAE,GAAEA,MAAEL,IAAE,QAAO,OAAI;GAAC,IAAIA,MAAE,EAAEK;AAAG,OAAGL,QAAI,KAAK,MAAIE,IAAE,KAAKF,IAAE,EAACA,IAAE,UAAU;;EAAM,IAAIG,MAAE,EAAE;AAAC,OAAI,IAAIH,OAAKC,IAAE,KAAGI,IAAEL,KAAEG,KAAED,IAAE,CAAC;EAAM,IAAG,EAAC,UAAS,MAAGA,IAAE,GAAG,GAAG;AAAC,QAAE,IAAEC,IAAE,KAAGA,KAAE,KAAGD,IAAE;;AAAO,QAAOD;;AAAE,SAASI,IAAE,KAAE,KAAE,KAAE;AAAC,KAAGD,IAAE,WAAS,EAAE,QAAOD,IAAE,KAAKH,IAAE,EAAC,CAAC;CAAE,IAAIC,MAAED,KAAE,IAAEE,KAAE,IAAE,CAAC;AAAE,MAAI,IAAG,CAACA,KAAEF,QAAKI,IAAE,SAAS,EAAC;EAAC,IAAG,EAAC,OAAM,GAAE,OAAM,MAAGJ;AAAE,MAAG,EAAE,KAAKC,IAAE,EAAC,IAAED,IAAEC,KAAE,GAAE,EAAE,EAAC,IAAE,SAAO,GAAE,EAAE,SAAQ;;AAAC,qBAAG,EAAE,0DAAS,CAAC,GAAE;AAAC,SAAI,IAAID,OAAK,EAAE,KAAK,KAAGK,IAAEL,KAAEG,KAAEC,IAAE,MAAMF,MAAE,EAAE,CAAC,CAAC,QAAM,CAAC;AAAE,WAAO;;AAAE,SAAE,EAAE;;AAAK,MAAG,CAAC,EAAE,QAAQ;AAAM,IAAE,SAAO,IAAE,CAAC;;AAAG,QAAO,EAAE,WAASC,IAAE,KAAKF,IAAE,EAAC;;AAAE,SAASE,IAAE,KAAE;;CAAC,IAAG,EAAC,MAAKH,KAAE,UAASK,QAAGH,KAAEC,MAAEH,IAAE,GAAGK,IAAE;AAAC,QAAO,OAAO,OAAOF,KAAE;EAAC,uBAASH,IAAE,uDAAQ,CAAC;EAAE,OAAM;EAAE,OAAM,EAAE;EAAC,CAAC;;AAAC,SAASI,IAAE,KAAE;AAAC,QAAO,OAAOF,OAAG,YAAU,OAAOA,OAAG,YAAU,CAAC,CAACA,OAAG,OAAO,YAAYA;;;;;ACAt2B,SAASI,IAAE,KAAE,KAAE;CAAC,IAAIC,MAAEC,IAAE,SAAOF,IAAE;AAAO,KAAGC,QAAI,GAAE;EAAC,IAAG,CAACA,KAAE,GAAGE,OAAGD;AAAE,SAAOE,IAAEH,KAAE;GAAC,MAAKD;GAAE,UAASG;GAAE,CAAC;;AAAC,KAAGF,QAAI,GAAE;EAAC,IAAIA,MAAE;GAAC,MAAKD;GAAE,UAASE;GAAE;AAAC,SAAO,OAAO,QAAO,QAAGE,IAAEJ,KAAEC,IAAE,EAACA,IAAE;;AAAC,OAAM,MAAM,4BAA4B;;;;;ACA5M,SAAS,EAAE,GAAGI,KAAE;AAAC,QAAOC,IAAEC,KAAEF,IAAE;;AAAC,SAASE,IAAE,KAAE,KAAE;AAAC,KAAGD,QAAID,OAAG,OAAO,GAAGC,KAAED,IAAE,CAAC,QAAM,CAAC;AAAE,KAAG,OAAOC,OAAG,YAAU,OAAOD,OAAG,YAAUC,QAAI,QAAMD,QAAI,QAAM,OAAO,eAAeC,IAAE,KAAG,OAAO,eAAeD,IAAE,CAAC,QAAM,CAAC;AAAE,KAAG,MAAM,QAAQC,IAAE,CAAC,QAAOE,IAAEF,KAAED,IAAE;AAAC,KAAGC,eAAa,IAAI,QAAO,EAAEA,KAAED,IAAE;AAAC,KAAGC,eAAa,IAAI,QAAO,EAAEA,KAAED,IAAE;AAAC,KAAGC,eAAa,KAAK,QAAOA,IAAE,SAAS,KAAGD,IAAE,SAAS;AAAC,KAAGC,eAAa,OAAO,QAAOA,IAAE,UAAU,KAAGD,IAAE,UAAU;AAAC,KAAG,OAAO,KAAKC,IAAE,CAAC,WAAS,OAAO,KAAKD,IAAE,CAAC,OAAO,QAAM,CAAC;AAAE,MAAI,IAAG,CAACG,KAAEC,QAAK,OAAO,QAAQH,IAAE,CAAC,KAAG,EAAEE,OAAKH,QAAI,CAACE,IAAEE,KAAEJ,IAAEG,KAAG,CAAC,QAAM,CAAC;AAAE,QAAM,CAAC;;AAAE,SAASA,IAAE,KAAE,KAAE;AAAC,KAAGF,IAAE,WAASD,IAAE,OAAO,QAAM,CAAC;AAAE,MAAI,IAAG,CAACG,KAAEC,QAAKH,IAAE,SAAS,CAAC,KAAG,CAACC,IAAEE,KAAEJ,IAAEG,KAAG,CAAC,QAAM,CAAC;AAAE,QAAM,CAAC;;AAAE,SAAS,EAAE,KAAE,KAAE;AAAC,KAAGF,IAAE,SAAOD,IAAE,KAAK,QAAM,CAAC;AAAE,MAAI,IAAG,CAACG,KAAEC,QAAKH,IAAE,SAAS,CAAC,KAAG,CAACD,IAAE,IAAIG,IAAE,IAAE,CAACD,IAAEE,KAAEJ,IAAE,IAAIG,IAAE,CAAC,CAAC,QAAM,CAAC;AAAE,QAAM,CAAC;;AAAE,SAAS,EAAE,KAAE,KAAE;AAAC,KAAGF,IAAE,SAAOD,IAAE,KAAK,QAAM,CAAC;CAAE,IAAIG,MAAE,CAAC,GAAGH,IAAE;AAAC,MAAI,IAAIA,OAAKC,KAAE;EAAC,IAAIA,MAAE,CAAC;AAAE,OAAI,IAAG,CAACG,KAAEC,QAAKF,IAAE,SAAS,CAAC,KAAGD,IAAEF,KAAEK,IAAE,EAAC;AAAC,SAAE,CAAC,GAAEF,IAAE,OAAOC,KAAE,EAAE;AAAC;;AAAM,MAAG,CAACH,IAAE,QAAM,CAAC;;AAAE,QAAM,CAAC;;;;;ACAr2B,SAAS,EAAE,GAAGK,KAAE;AAAC,QAAOC,IAAE,GAAED,IAAE;;AAAC,SAAS,EAAE,KAAE;CAAC,IAAIE,MAAED,KAAEE,sBAAE,IAAI,KAAG;AAAC,SAAO,KAAE,KAAE,QAAI;EAAC,IAAI,IAAED,IAAED,KAAEG,KAAEC,IAAE;AAAC,SAAOF,IAAE,IAAI,EAAE,GAACH,OAAGG,IAAE,IAAI,EAAE,EAAC;GAAC,MAAK,CAAC;GAAE,SAAQ,CAAC;GAAE,MAAKF;GAAE;;;;;;ACO7Q,SAAgB,eAAe,SAAyD;AACtF,QAAOK,EAAS,UAAU,QAAQ;EAAC,IAAI;EAAM,IAAI;EAAc,IAAI;EAAW,CAAU;;AAG1F,SAAgB,eAAe,WAAyD;AACtF,qCAAeC,WAAS;GACrB,MAAM,CAAC,CAAC,MAAM,QAAQ,EAAE,KAAK;GAC7B,MAAM,CAAC,EAAE;GACT,MAAM,EAAE;GACR,MAAM,CAAC,CAAC,EAAE;GACV,MAAO,MAAM,QAAQ,EAAE,KAAK,gCAAW,EAAE,KAAK,GAAG,EAAE;EACrD,CAAC,CAAC,QACA,MAAM,SAAS;EACd,MAAM,OAAO,KAAK;EAClB,MAAM,aAAa,KAAK,UAAU,QAAQ,IAAI,SAAS,KAAK,KAAK;AAGjE,MAFgC,KAAK,UAAU,QAAQ,IAAI,SAAS,KAAK,QAAQC,EAAY,IAAI,MAAM,KAAK,IAAI,IAAI,WAAW,CAI7H,QAAO;AAQT,MALmB,KAAK,UACrB,QAAQ,IAAI,SAAS,KAAK,QAAQA,EAAY,IAAI,MAAM,KAAK,IAAI,IAAI,eAAe,KAAK,cAAc,IAAI,YAAY,KAAK,QAC9H,IAGkB,MAAM,QAAQ,KAAK,IAAI,CAAC,KAAK,mEAAY,WAAY,YAAW,CAAC,KAAK,QACvF,QAAO;AAGT,MAAI,CAAC,WACH,QAAO,CACL,GAAG,MACH;GACE,GAAG;GACH,MAAM,MAAM,QAAQ,KAAK,GAAG,CAAC,GAAG,IAAI,IAAI,KAAK,CAAC,GAAG;GAClD,CACF;AAIH,MAAI,cAAc,MAAM,QAAQ,WAAW,KAAK,IAAI,MAAM,QAAQ,KAAK,KAAK,IAAI,WAAW,eAAe,KAAK,YAAY;AACzH,cAAW,OAAO,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,WAAW,MAAM,GAAG,KAAK,KAAK,CAAC,CAAC;AAElE,UAAO;;AAGT,SAAO,CAAC,GAAG,MAAM,KAAK;IAExB,EAAE,CACH;;AAGH,SAAgB,eAAe,SAAiC,WAAiC,QAAyC;CACxI,MAAM,qCAAqB,IAAI,KAAa;AAC5C,MAAK,MAAM,QAAQD,WAAS;EAC1B,MAAM,EAAE,SAAS;AACjB,MAAI,CAAC,KACH;AAGF,MAAI,MAAM,QAAQ,KAAK,EAAE;AACvB,QAAK,MAAM,SAAS,KAClB,KAAI,MACF,oBAAmB,IAAI,MAAM;AAGjC;;AAGF,qBAAmB,IAAI,KAAK;;CAG9B,MAAM,6BAAa,IAAI,KAAsB;CAC7C,MAAM,qBAAqB,eAAgC;AACzD,MAAI,CAAC,OACH,QAAO;EAGT,MAAM,SAAS,WAAW,IAAI,WAAW;AACzC,MAAI,WAAW,OACb,QAAO;EAGT,MAAM,SAAS,OAAO,SAAS,WAAW,IAAI,mBAAmB,IAAI,WAAW;AAChF,aAAW,IAAI,YAAY,OAAO;AAElC,SAAO;;AAGT,qCAAe,SAAS;GACrB,MAAM,CAAC,CAAC,MAAM,QAAQ,EAAE,KAAK;GAC7B,MAAM,CAAC,EAAE;GACT,MAAM,EAAE;GACR,MAAM,CAAC,CAAC,EAAE;GACV,MAAO,MAAM,QAAQ,EAAE,KAAK,gCAAW,EAAE,KAAK,GAAG,EAAE;EACrD,CAAC,CAAC,QAAgC,MAAM,SAAS;EAChD,IAAI,OAAO,MAAM,QAAQ,KAAK,KAAK,GAAG,CAAC,GAAG,IAAI,IAAI,KAAK,KAAK,CAAC,GAAG,KAAK;AAErE,MAAI,KAAK,SAAS,KAAK,KAErB,QAAO;AAIT,MAAI,MAAM,QAAQ,KAAK,CACrB,QAAO,KAAK,QAAQ,SAAU,OAAO,SAAS,WAAW,kBAAkB,KAAK,GAAG,kBAAkB,KAAK,aAAa,CAAE;EAG3H,MAAM,aAAa,KAAK,UAAU,QAAQ,IAAI,SAAS,KAAK,QAAQ,IAAI,eAAe,KAAK,WAAW;EACvG,MAAM,aAAa,KAAK,UAAU,QAAQ,IAAI,SAAS,KAAK,QAAQC,EAAY,IAAI,MAAM,KAAK,IAAI,IAAI,eAAe,KAAK,WAAW;AAGtI,MAFoC,KAAK,UAAU,QAAQ,IAAI,SAAS,KAAK,QAAQA,EAAY,IAAI,MAAM,KAAK,IAAI,IAAI,WAAW,CAIjI,QAAO;AAIT,MAAI,cAAe,MAAM,QAAQ,KAAK,IAAI,CAAC,KAAK,OAC9C,QAAO;AAIT,MAAI,CAAC,WACH,QAAO,CACL,GAAG,MACH;GACE,GAAG;GACH;GACD,CACF;AAIH,MAAI,cAAc,MAAM,QAAQ,WAAW,KAAK,IAAI,MAAM,QAAQ,KAAK,IAAI,WAAW,eAAe,KAAK,YAAY;AACpH,cAAW,OAAO,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,WAAW,MAAM,GAAG,KAAK,CAAC,CAAC;AAE7D,UAAO;;AAIT,MAAI,CAAC,MAAM,QAAQ,KAAK,IAAI,QAAQ,CAAC,kBAAkB,KAAK,CAC1D,QAAO;AAGT,SAAO,CAAC,GAAG,MAAM,KAAK;IACrB,EAAE,CAAC;;;;;AAMR,SAAgB,WAA0C,MAA0D;;CAClH,MAAM,UAAUC,kBAAK,QAAQ,KAAK,SAAS;AAC3C,KAAI,CAAC,QACH,OAAM,IAAI,MAAM,wBAAwB,KAAK,WAAW;CAG1D,MAAM,SAAS,KAAK,QAAQ,KAAK,SAAS,KAAK,MAAM,CAAC,KAAK,OAAO;CAClE,MAAMF,8BAAU,KAAK,uEAAS,UAAS,eAAe,KAAK,QAAQ,GAAG,EAAE;CACxE,MAAM,4BAAU,KAAK,uEAAS,WAAU,SAAS,eAAe,KAAK,SAASA,WAAS,OAAO,GAAG,EAAE;CACnG,MAAM,4BAAU,KAAK,uEAAS,UAAS,eAAe,KAAK,QAAQ,GAAG,EAAE;AAExE,QAAO;EACL,GAAG;EACH,gCAAe,SAAS,CAAC,OAAO,KAAK,KAAK,CAAC,OAAO,MAAM;EACxD,MAAMG,gCAAY,KAAK,SAAS;EAChC;EACS;EACT,SAASH;EACA;EACT,MAAM,KAAK,QAAS,EAAE;EACvB"}