@powerhousedao/powerhouse-vetra-packages 6.2.2-dev.8 → 6.2.2-dev.80

package/dist/browser/printer-CEYr4JOg.js

@@ -0,0 +1,604 @@
+import { a as printBlockString, c as Kind, d as QueryDocumentKeys, f as isNode, g as devAssert, r as inspect } from "./parser-CkF6Qt8V.js";
+//#region ../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/language/printString.mjs
+/**
+* Prints a string as a GraphQL StringValue literal. Replaces control characters
+* and excluded characters (" U+0022 and \\ U+005C) with escape sequences.
+*/
+function printString(str) {
+	return `"${str.replace(escapedRegExp, escapedReplacer)}"`;
+}
+const escapedRegExp = /[\x00-\x1f\x22\x5c\x7f-\x9f]/g;
+function escapedReplacer(str) {
+	return escapeSequences[str.charCodeAt(0)];
+}
+const escapeSequences = [
+	"\\u0000",
+	"\\u0001",
+	"\\u0002",
+	"\\u0003",
+	"\\u0004",
+	"\\u0005",
+	"\\u0006",
+	"\\u0007",
+	"\\b",
+	"\\t",
+	"\\n",
+	"\\u000B",
+	"\\f",
+	"\\r",
+	"\\u000E",
+	"\\u000F",
+	"\\u0010",
+	"\\u0011",
+	"\\u0012",
+	"\\u0013",
+	"\\u0014",
+	"\\u0015",
+	"\\u0016",
+	"\\u0017",
+	"\\u0018",
+	"\\u0019",
+	"\\u001A",
+	"\\u001B",
+	"\\u001C",
+	"\\u001D",
+	"\\u001E",
+	"\\u001F",
+	"",
+	"",
+	"\\\"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"\\\\",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"",
+	"\\u007F",
+	"\\u0080",
+	"\\u0081",
+	"\\u0082",
+	"\\u0083",
+	"\\u0084",
+	"\\u0085",
+	"\\u0086",
+	"\\u0087",
+	"\\u0088",
+	"\\u0089",
+	"\\u008A",
+	"\\u008B",
+	"\\u008C",
+	"\\u008D",
+	"\\u008E",
+	"\\u008F",
+	"\\u0090",
+	"\\u0091",
+	"\\u0092",
+	"\\u0093",
+	"\\u0094",
+	"\\u0095",
+	"\\u0096",
+	"\\u0097",
+	"\\u0098",
+	"\\u0099",
+	"\\u009A",
+	"\\u009B",
+	"\\u009C",
+	"\\u009D",
+	"\\u009E",
+	"\\u009F"
+];
+//#endregion
+//#region ../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/language/visitor.mjs
+/**
+* A visitor is provided to visit, it contains the collection of
+* relevant functions to be called during the visitor's traversal.
+*/
+const BREAK = Object.freeze({});
+/**
+* visit() will walk through an AST using a depth-first traversal, calling
+* the visitor's enter function at each node in the traversal, and calling the
+* leave function after visiting that node and all of its child nodes.
+*
+* By returning different values from the enter and leave functions, the
+* behavior of the visitor can be altered, including skipping over a sub-tree of
+* the AST (by returning false), editing the AST by returning a value or null
+* to remove the value, or to stop the whole traversal by returning BREAK.
+*
+* When using visit() to edit an AST, the original AST will not be modified, and
+* a new version of the AST with the changes applied will be returned from the
+* visit function.
+*
+* ```ts
+* const editedAST = visit(ast, {
+*   enter(node, key, parent, path, ancestors) {
+*     // @return
+*     //   undefined: no action
+*     //   false: skip visiting this node
+*     //   visitor.BREAK: stop visiting altogether
+*     //   null: delete this node
+*     //   any value: replace this node with the returned value
+*   },
+*   leave(node, key, parent, path, ancestors) {
+*     // @return
+*     //   undefined: no action
+*     //   false: no action
+*     //   visitor.BREAK: stop visiting altogether
+*     //   null: delete this node
+*     //   any value: replace this node with the returned value
+*   }
+* });
+* ```
+*
+* Alternatively to providing enter() and leave() functions, a visitor can
+* instead provide functions named the same as the kinds of AST nodes, or
+* enter/leave visitors at a named key, leading to three permutations of the
+* visitor API:
+*
+* 1) Named visitors triggered when entering a node of a specific kind.
+*
+* ```ts
+* visit(ast, {
+*   Kind(node) {
+*     // enter the "Kind" node
+*   }
+* })
+* ```
+*
+* 2) Named visitors that trigger upon entering and leaving a node of a specific kind.
+*
+* ```ts
+* visit(ast, {
+*   Kind: {
+*     enter(node) {
+*       // enter the "Kind" node
+*     }
+*     leave(node) {
+*       // leave the "Kind" node
+*     }
+*   }
+* })
+* ```
+*
+* 3) Generic visitors that trigger upon entering and leaving any node.
+*
+* ```ts
+* visit(ast, {
+*   enter(node) {
+*     // enter any node
+*   },
+*   leave(node) {
+*     // leave any node
+*   }
+* })
+* ```
+*/
+function visit(root, visitor, visitorKeys = QueryDocumentKeys) {
+	const enterLeaveMap = /* @__PURE__ */ new Map();
+	for (const kind of Object.values(Kind)) enterLeaveMap.set(kind, getEnterLeaveForKind(visitor, kind));
+	let stack = void 0;
+	let inArray = Array.isArray(root);
+	let keys = [root];
+	let index = -1;
+	let edits = [];
+	let node = root;
+	let key = void 0;
+	let parent = void 0;
+	const path = [];
+	const ancestors = [];
+	do {
+		index++;
+		const isLeaving = index === keys.length;
+		const isEdited = isLeaving && edits.length !== 0;
+		if (isLeaving) {
+			key = ancestors.length === 0 ? void 0 : path[path.length - 1];
+			node = parent;
+			parent = ancestors.pop();
+			if (isEdited) if (inArray) {
+				node = node.slice();
+				let editOffset = 0;
+				for (const [editKey, editValue] of edits) {
+					const arrayKey = editKey - editOffset;
+					if (editValue === null) {
+						node.splice(arrayKey, 1);
+						editOffset++;
+					} else node[arrayKey] = editValue;
+				}
+			} else {
+				node = { ...node };
+				for (const [editKey, editValue] of edits) node[editKey] = editValue;
+			}
+			index = stack.index;
+			keys = stack.keys;
+			edits = stack.edits;
+			inArray = stack.inArray;
+			stack = stack.prev;
+		} else if (parent) {
+			key = inArray ? index : keys[index];
+			node = parent[key];
+			if (node === null || node === void 0) continue;
+			path.push(key);
+		}
+		let result;
+		if (!Array.isArray(node)) {
+			var _enterLeaveMap$get, _enterLeaveMap$get2;
+			isNode(node) || devAssert(false, `Invalid AST Node: ${inspect(node)}.`);
+			const visitFn = isLeaving ? (_enterLeaveMap$get = enterLeaveMap.get(node.kind)) === null || _enterLeaveMap$get === void 0 ? void 0 : _enterLeaveMap$get.leave : (_enterLeaveMap$get2 = enterLeaveMap.get(node.kind)) === null || _enterLeaveMap$get2 === void 0 ? void 0 : _enterLeaveMap$get2.enter;
+			result = visitFn === null || visitFn === void 0 ? void 0 : visitFn.call(visitor, node, key, parent, path, ancestors);
+			if (result === BREAK) break;
+			if (result === false) {
+				if (!isLeaving) {
+					path.pop();
+					continue;
+				}
+			} else if (result !== void 0) {
+				edits.push([key, result]);
+				if (!isLeaving) if (isNode(result)) node = result;
+				else {
+					path.pop();
+					continue;
+				}
+			}
+		}
+		if (result === void 0 && isEdited) edits.push([key, node]);
+		if (isLeaving) path.pop();
+		else {
+			var _node$kind;
+			stack = {
+				inArray,
+				index,
+				keys,
+				edits,
+				prev: stack
+			};
+			inArray = Array.isArray(node);
+			keys = inArray ? node : (_node$kind = visitorKeys[node.kind]) !== null && _node$kind !== void 0 ? _node$kind : [];
+			index = -1;
+			edits = [];
+			if (parent) ancestors.push(parent);
+			parent = node;
+		}
+	} while (stack !== void 0);
+	if (edits.length !== 0) return edits[edits.length - 1][1];
+	return root;
+}
+/**
+* Creates a new visitor instance which delegates to many visitors to run in
+* parallel. Each visitor will be visited for each node before moving on.
+*
+* If a prior visitor edits a node, no following visitors will see that node.
+*/
+function visitInParallel(visitors) {
+	const skipping = new Array(visitors.length).fill(null);
+	const mergedVisitor = Object.create(null);
+	for (const kind of Object.values(Kind)) {
+		let hasVisitor = false;
+		const enterList = new Array(visitors.length).fill(void 0);
+		const leaveList = new Array(visitors.length).fill(void 0);
+		for (let i = 0; i < visitors.length; ++i) {
+			const { enter, leave } = getEnterLeaveForKind(visitors[i], kind);
+			hasVisitor || (hasVisitor = enter != null || leave != null);
+			enterList[i] = enter;
+			leaveList[i] = leave;
+		}
+		if (!hasVisitor) continue;
+		mergedVisitor[kind] = {
+			enter(...args) {
+				const node = args[0];
+				for (let i = 0; i < visitors.length; i++) if (skipping[i] === null) {
+					var _enterList$i;
+					const result = (_enterList$i = enterList[i]) === null || _enterList$i === void 0 ? void 0 : _enterList$i.apply(visitors[i], args);
+					if (result === false) skipping[i] = node;
+					else if (result === BREAK) skipping[i] = BREAK;
+					else if (result !== void 0) return result;
+				}
+			},
+			leave(...args) {
+				const node = args[0];
+				for (let i = 0; i < visitors.length; i++) if (skipping[i] === null) {
+					var _leaveList$i;
+					const result = (_leaveList$i = leaveList[i]) === null || _leaveList$i === void 0 ? void 0 : _leaveList$i.apply(visitors[i], args);
+					if (result === BREAK) skipping[i] = BREAK;
+					else if (result !== void 0 && result !== false) return result;
+				} else if (skipping[i] === node) skipping[i] = null;
+			}
+		};
+	}
+	return mergedVisitor;
+}
+/**
+* Given a visitor instance and a node kind, return EnterLeaveVisitor for that kind.
+*/
+function getEnterLeaveForKind(visitor, kind) {
+	const kindVisitor = visitor[kind];
+	if (typeof kindVisitor === "object") return kindVisitor;
+	else if (typeof kindVisitor === "function") return {
+		enter: kindVisitor,
+		leave: void 0
+	};
+	return {
+		enter: visitor.enter,
+		leave: visitor.leave
+	};
+}
+//#endregion
+//#region ../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/language/printer.mjs
+/**
+* Converts an AST into a string, using one set of reasonable
+* formatting rules.
+*/
+function print(ast) {
+	return visit(ast, printDocASTReducer);
+}
+const MAX_LINE_LENGTH = 80;
+const printDocASTReducer = {
+	Name: { leave: (node) => node.value },
+	Variable: { leave: (node) => "$" + node.name },
+	Document: { leave: (node) => join(node.definitions, "\n\n") },
+	OperationDefinition: { leave(node) {
+		const varDefs = hasMultilineItems(node.variableDefinitions) ? wrap("(\n", join(node.variableDefinitions, "\n"), "\n)") : wrap("(", join(node.variableDefinitions, ", "), ")");
+		const prefix = wrap("", node.description, "\n") + join([
+			node.operation,
+			join([node.name, varDefs]),
+			join(node.directives, " ")
+		], " ");
+		return (prefix === "query" ? "" : prefix + " ") + node.selectionSet;
+	} },
+	VariableDefinition: { leave: ({ variable, type, defaultValue, directives, description }) => wrap("", description, "\n") + variable + ": " + type + wrap(" = ", defaultValue) + wrap(" ", join(directives, " ")) },
+	SelectionSet: { leave: ({ selections }) => block(selections) },
+	Field: { leave({ alias, name, arguments: args, directives, selectionSet }) {
+		const prefix = wrap("", alias, ": ") + name;
+		let argsLine = prefix + wrap("(", join(args, ", "), ")");
+		if (argsLine.length > MAX_LINE_LENGTH) argsLine = prefix + wrap("(\n", indent(join(args, "\n")), "\n)");
+		return join([
+			argsLine,
+			join(directives, " "),
+			selectionSet
+		], " ");
+	} },
+	Argument: { leave: ({ name, value }) => name + ": " + value },
+	FragmentSpread: { leave: ({ name, directives }) => "..." + name + wrap(" ", join(directives, " ")) },
+	InlineFragment: { leave: ({ typeCondition, directives, selectionSet }) => join([
+		"...",
+		wrap("on ", typeCondition),
+		join(directives, " "),
+		selectionSet
+	], " ") },
+	FragmentDefinition: { leave: ({ name, typeCondition, variableDefinitions, directives, selectionSet, description }) => wrap("", description, "\n") + `fragment ${name}${wrap("(", join(variableDefinitions, ", "), ")")} on ${typeCondition} ${wrap("", join(directives, " "), " ")}` + selectionSet },
+	IntValue: { leave: ({ value }) => value },
+	FloatValue: { leave: ({ value }) => value },
+	StringValue: { leave: ({ value, block: isBlockString }) => isBlockString ? printBlockString(value) : printString(value) },
+	BooleanValue: { leave: ({ value }) => value ? "true" : "false" },
+	NullValue: { leave: () => "null" },
+	EnumValue: { leave: ({ value }) => value },
+	ListValue: { leave: ({ values }) => "[" + join(values, ", ") + "]" },
+	ObjectValue: { leave: ({ fields }) => "{" + join(fields, ", ") + "}" },
+	ObjectField: { leave: ({ name, value }) => name + ": " + value },
+	Directive: { leave: ({ name, arguments: args }) => "@" + name + wrap("(", join(args, ", "), ")") },
+	NamedType: { leave: ({ name }) => name },
+	ListType: { leave: ({ type }) => "[" + type + "]" },
+	NonNullType: { leave: ({ type }) => type + "!" },
+	SchemaDefinition: { leave: ({ description, directives, operationTypes }) => wrap("", description, "\n") + join([
+		"schema",
+		join(directives, " "),
+		block(operationTypes)
+	], " ") },
+	OperationTypeDefinition: { leave: ({ operation, type }) => operation + ": " + type },
+	ScalarTypeDefinition: { leave: ({ description, name, directives }) => wrap("", description, "\n") + join([
+		"scalar",
+		name,
+		join(directives, " ")
+	], " ") },
+	ObjectTypeDefinition: { leave: ({ description, name, interfaces, directives, fields }) => wrap("", description, "\n") + join([
+		"type",
+		name,
+		wrap("implements ", join(interfaces, " & ")),
+		join(directives, " "),
+		block(fields)
+	], " ") },
+	FieldDefinition: { leave: ({ description, name, arguments: args, type, directives }) => wrap("", description, "\n") + name + (hasMultilineItems(args) ? wrap("(\n", indent(join(args, "\n")), "\n)") : wrap("(", join(args, ", "), ")")) + ": " + type + wrap(" ", join(directives, " ")) },
+	InputValueDefinition: { leave: ({ description, name, type, defaultValue, directives }) => wrap("", description, "\n") + join([
+		name + ": " + type,
+		wrap("= ", defaultValue),
+		join(directives, " ")
+	], " ") },
+	InterfaceTypeDefinition: { leave: ({ description, name, interfaces, directives, fields }) => wrap("", description, "\n") + join([
+		"interface",
+		name,
+		wrap("implements ", join(interfaces, " & ")),
+		join(directives, " "),
+		block(fields)
+	], " ") },
+	UnionTypeDefinition: { leave: ({ description, name, directives, types }) => wrap("", description, "\n") + join([
+		"union",
+		name,
+		join(directives, " "),
+		wrap("= ", join(types, " | "))
+	], " ") },
+	EnumTypeDefinition: { leave: ({ description, name, directives, values }) => wrap("", description, "\n") + join([
+		"enum",
+		name,
+		join(directives, " "),
+		block(values)
+	], " ") },
+	EnumValueDefinition: { leave: ({ description, name, directives }) => wrap("", description, "\n") + join([name, join(directives, " ")], " ") },
+	InputObjectTypeDefinition: { leave: ({ description, name, directives, fields }) => wrap("", description, "\n") + join([
+		"input",
+		name,
+		join(directives, " "),
+		block(fields)
+	], " ") },
+	DirectiveDefinition: { leave: ({ description, name, arguments: args, repeatable, locations }) => wrap("", description, "\n") + "directive @" + name + (hasMultilineItems(args) ? wrap("(\n", indent(join(args, "\n")), "\n)") : wrap("(", join(args, ", "), ")")) + (repeatable ? " repeatable" : "") + " on " + join(locations, " | ") },
+	SchemaExtension: { leave: ({ directives, operationTypes }) => join([
+		"extend schema",
+		join(directives, " "),
+		block(operationTypes)
+	], " ") },
+	ScalarTypeExtension: { leave: ({ name, directives }) => join([
+		"extend scalar",
+		name,
+		join(directives, " ")
+	], " ") },
+	ObjectTypeExtension: { leave: ({ name, interfaces, directives, fields }) => join([
+		"extend type",
+		name,
+		wrap("implements ", join(interfaces, " & ")),
+		join(directives, " "),
+		block(fields)
+	], " ") },
+	InterfaceTypeExtension: { leave: ({ name, interfaces, directives, fields }) => join([
+		"extend interface",
+		name,
+		wrap("implements ", join(interfaces, " & ")),
+		join(directives, " "),
+		block(fields)
+	], " ") },
+	UnionTypeExtension: { leave: ({ name, directives, types }) => join([
+		"extend union",
+		name,
+		join(directives, " "),
+		wrap("= ", join(types, " | "))
+	], " ") },
+	EnumTypeExtension: { leave: ({ name, directives, values }) => join([
+		"extend enum",
+		name,
+		join(directives, " "),
+		block(values)
+	], " ") },
+	InputObjectTypeExtension: { leave: ({ name, directives, fields }) => join([
+		"extend input",
+		name,
+		join(directives, " "),
+		block(fields)
+	], " ") },
+	TypeCoordinate: { leave: ({ name }) => name },
+	MemberCoordinate: { leave: ({ name, memberName }) => join([name, wrap(".", memberName)]) },
+	ArgumentCoordinate: { leave: ({ name, fieldName, argumentName }) => join([
+		name,
+		wrap(".", fieldName),
+		wrap("(", argumentName, ":)")
+	]) },
+	DirectiveCoordinate: { leave: ({ name }) => join(["@", name]) },
+	DirectiveArgumentCoordinate: { leave: ({ name, argumentName }) => join([
+		"@",
+		name,
+		wrap("(", argumentName, ":)")
+	]) }
+};
+/**
+* Given maybeArray, print an empty string if it is null or empty, otherwise
+* print all items together separated by separator if provided
+*/
+function join(maybeArray, separator = "") {
+	var _maybeArray$filter$jo;
+	return (_maybeArray$filter$jo = maybeArray === null || maybeArray === void 0 ? void 0 : maybeArray.filter((x) => x).join(separator)) !== null && _maybeArray$filter$jo !== void 0 ? _maybeArray$filter$jo : "";
+}
+/**
+* Given array, print each item on its own line, wrapped in an indented `{ }` block.
+*/
+function block(array) {
+	return wrap("{\n", indent(join(array, "\n")), "\n}");
+}
+/**
+* If maybeString is not null or empty, then wrap with start and end, otherwise print an empty string.
+*/
+function wrap(start, maybeString, end = "") {
+	return maybeString != null && maybeString !== "" ? start + maybeString + end : "";
+}
+function indent(str) {
+	return wrap("  ", str.replace(/\n/g, "\n  "));
+}
+function hasMultilineItems(maybeArray) {
+	var _maybeArray$some;
+	/* c8 ignore next */
+	return (_maybeArray$some = maybeArray === null || maybeArray === void 0 ? void 0 : maybeArray.some((str) => str.includes("\n"))) !== null && _maybeArray$some !== void 0 ? _maybeArray$some : false;
+}
+//#endregion
+export { visitInParallel as a, visit as i, BREAK as n, getEnterLeaveForKind as r, print as t };
+
+//# sourceMappingURL=printer-CEYr4JOg.js.map

package/dist/browser/printer-CEYr4JOg.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"printer-CEYr4JOg.js","names":[],"sources":["../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/language/printString.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/language/visitor.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/language/printer.mjs"],"sourcesContent":["/**\n * Prints a string as a GraphQL StringValue literal. Replaces control characters\n * and excluded characters (\" U+0022 and \\\\ U+005C) with escape sequences.\n */\nexport function printString(str) {\n  return `\"${str.replace(escapedRegExp, escapedReplacer)}\"`;\n} // eslint-disable-next-line no-control-regex\n\nconst escapedRegExp = /[\\x00-\\x1f\\x22\\x5c\\x7f-\\x9f]/g;\n\nfunction escapedReplacer(str) {\n  return escapeSequences[str.charCodeAt(0)];\n} // prettier-ignore\n\nconst escapeSequences = [\n  '\\\\u0000',\n  '\\\\u0001',\n  '\\\\u0002',\n  '\\\\u0003',\n  '\\\\u0004',\n  '\\\\u0005',\n  '\\\\u0006',\n  '\\\\u0007',\n  '\\\\b',\n  '\\\\t',\n  '\\\\n',\n  '\\\\u000B',\n  '\\\\f',\n  '\\\\r',\n  '\\\\u000E',\n  '\\\\u000F',\n  '\\\\u0010',\n  '\\\\u0011',\n  '\\\\u0012',\n  '\\\\u0013',\n  '\\\\u0014',\n  '\\\\u0015',\n  '\\\\u0016',\n  '\\\\u0017',\n  '\\\\u0018',\n  '\\\\u0019',\n  '\\\\u001A',\n  '\\\\u001B',\n  '\\\\u001C',\n  '\\\\u001D',\n  '\\\\u001E',\n  '\\\\u001F',\n  '',\n  '',\n  '\\\\\"',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '', // 2F\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '', // 3F\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '', // 4F\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '\\\\\\\\',\n  '',\n  '',\n  '', // 5F\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '', // 6F\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '\\\\u007F',\n  '\\\\u0080',\n  '\\\\u0081',\n  '\\\\u0082',\n  '\\\\u0083',\n  '\\\\u0084',\n  '\\\\u0085',\n  '\\\\u0086',\n  '\\\\u0087',\n  '\\\\u0088',\n  '\\\\u0089',\n  '\\\\u008A',\n  '\\\\u008B',\n  '\\\\u008C',\n  '\\\\u008D',\n  '\\\\u008E',\n  '\\\\u008F',\n  '\\\\u0090',\n  '\\\\u0091',\n  '\\\\u0092',\n  '\\\\u0093',\n  '\\\\u0094',\n  '\\\\u0095',\n  '\\\\u0096',\n  '\\\\u0097',\n  '\\\\u0098',\n  '\\\\u0099',\n  '\\\\u009A',\n  '\\\\u009B',\n  '\\\\u009C',\n  '\\\\u009D',\n  '\\\\u009E',\n  '\\\\u009F',\n];\n","import { devAssert } from '../jsutils/devAssert.mjs';\nimport { inspect } from '../jsutils/inspect.mjs';\nimport { isNode, QueryDocumentKeys } from './ast.mjs';\nimport { Kind } from './kinds.mjs';\n/**\n * A visitor is provided to visit, it contains the collection of\n * relevant functions to be called during the visitor's traversal.\n */\n\nexport const BREAK = Object.freeze({});\n/**\n * visit() will walk through an AST using a depth-first traversal, calling\n * the visitor's enter function at each node in the traversal, and calling the\n * leave function after visiting that node and all of its child nodes.\n *\n * By returning different values from the enter and leave functions, the\n * behavior of the visitor can be altered, including skipping over a sub-tree of\n * the AST (by returning false), editing the AST by returning a value or null\n * to remove the value, or to stop the whole traversal by returning BREAK.\n *\n * When using visit() to edit an AST, the original AST will not be modified, and\n * a new version of the AST with the changes applied will be returned from the\n * visit function.\n *\n * ```ts\n * const editedAST = visit(ast, {\n *   enter(node, key, parent, path, ancestors) {\n *     // @return\n *     //   undefined: no action\n *     //   false: skip visiting this node\n *     //   visitor.BREAK: stop visiting altogether\n *     //   null: delete this node\n *     //   any value: replace this node with the returned value\n *   },\n *   leave(node, key, parent, path, ancestors) {\n *     // @return\n *     //   undefined: no action\n *     //   false: no action\n *     //   visitor.BREAK: stop visiting altogether\n *     //   null: delete this node\n *     //   any value: replace this node with the returned value\n *   }\n * });\n * ```\n *\n * Alternatively to providing enter() and leave() functions, a visitor can\n * instead provide functions named the same as the kinds of AST nodes, or\n * enter/leave visitors at a named key, leading to three permutations of the\n * visitor API:\n *\n * 1) Named visitors triggered when entering a node of a specific kind.\n *\n * ```ts\n * visit(ast, {\n *   Kind(node) {\n *     // enter the \"Kind\" node\n *   }\n * })\n * ```\n *\n * 2) Named visitors that trigger upon entering and leaving a node of a specific kind.\n *\n * ```ts\n * visit(ast, {\n *   Kind: {\n *     enter(node) {\n *       // enter the \"Kind\" node\n *     }\n *     leave(node) {\n *       // leave the \"Kind\" node\n *     }\n *   }\n * })\n * ```\n *\n * 3) Generic visitors that trigger upon entering and leaving any node.\n *\n * ```ts\n * visit(ast, {\n *   enter(node) {\n *     // enter any node\n *   },\n *   leave(node) {\n *     // leave any node\n *   }\n * })\n * ```\n */\n\nexport function visit(root, visitor, visitorKeys = QueryDocumentKeys) {\n  const enterLeaveMap = new Map();\n\n  for (const kind of Object.values(Kind)) {\n    enterLeaveMap.set(kind, getEnterLeaveForKind(visitor, kind));\n  }\n  /* eslint-disable no-undef-init */\n\n  let stack = undefined;\n  let inArray = Array.isArray(root);\n  let keys = [root];\n  let index = -1;\n  let edits = [];\n  let node = root;\n  let key = undefined;\n  let parent = undefined;\n  const path = [];\n  const ancestors = [];\n  /* eslint-enable no-undef-init */\n\n  do {\n    index++;\n    const isLeaving = index === keys.length;\n    const isEdited = isLeaving && edits.length !== 0;\n\n    if (isLeaving) {\n      key = ancestors.length === 0 ? undefined : path[path.length - 1];\n      node = parent;\n      parent = ancestors.pop();\n\n      if (isEdited) {\n        if (inArray) {\n          node = node.slice();\n          let editOffset = 0;\n\n          for (const [editKey, editValue] of edits) {\n            const arrayKey = editKey - editOffset;\n\n            if (editValue === null) {\n              node.splice(arrayKey, 1);\n              editOffset++;\n            } else {\n              node[arrayKey] = editValue;\n            }\n          }\n        } else {\n          node = { ...node };\n\n          for (const [editKey, editValue] of edits) {\n            node[editKey] = editValue;\n          }\n        }\n      }\n\n      index = stack.index;\n      keys = stack.keys;\n      edits = stack.edits;\n      inArray = stack.inArray;\n      stack = stack.prev;\n    } else if (parent) {\n      key = inArray ? index : keys[index];\n      node = parent[key];\n\n      if (node === null || node === undefined) {\n        continue;\n      }\n\n      path.push(key);\n    }\n\n    let result;\n\n    if (!Array.isArray(node)) {\n      var _enterLeaveMap$get, _enterLeaveMap$get2;\n\n      isNode(node) || devAssert(false, `Invalid AST Node: ${inspect(node)}.`);\n      const visitFn = isLeaving\n        ? (_enterLeaveMap$get = enterLeaveMap.get(node.kind)) === null ||\n          _enterLeaveMap$get === void 0\n          ? void 0\n          : _enterLeaveMap$get.leave\n        : (_enterLeaveMap$get2 = enterLeaveMap.get(node.kind)) === null ||\n          _enterLeaveMap$get2 === void 0\n        ? void 0\n        : _enterLeaveMap$get2.enter;\n      result =\n        visitFn === null || visitFn === void 0\n          ? void 0\n          : visitFn.call(visitor, node, key, parent, path, ancestors);\n\n      if (result === BREAK) {\n        break;\n      }\n\n      if (result === false) {\n        if (!isLeaving) {\n          path.pop();\n          continue;\n        }\n      } else if (result !== undefined) {\n        edits.push([key, result]);\n\n        if (!isLeaving) {\n          if (isNode(result)) {\n            node = result;\n          } else {\n            path.pop();\n            continue;\n          }\n        }\n      }\n    }\n\n    if (result === undefined && isEdited) {\n      edits.push([key, node]);\n    }\n\n    if (isLeaving) {\n      path.pop();\n    } else {\n      var _node$kind;\n\n      stack = {\n        inArray,\n        index,\n        keys,\n        edits,\n        prev: stack,\n      };\n      inArray = Array.isArray(node);\n      keys = inArray\n        ? node\n        : (_node$kind = visitorKeys[node.kind]) !== null &&\n          _node$kind !== void 0\n        ? _node$kind\n        : [];\n      index = -1;\n      edits = [];\n\n      if (parent) {\n        ancestors.push(parent);\n      }\n\n      parent = node;\n    }\n  } while (stack !== undefined);\n\n  if (edits.length !== 0) {\n    // New root\n    return edits[edits.length - 1][1];\n  }\n\n  return root;\n}\n/**\n * Creates a new visitor instance which delegates to many visitors to run in\n * parallel. Each visitor will be visited for each node before moving on.\n *\n * If a prior visitor edits a node, no following visitors will see that node.\n */\n\nexport function visitInParallel(visitors) {\n  const skipping = new Array(visitors.length).fill(null);\n  const mergedVisitor = Object.create(null);\n\n  for (const kind of Object.values(Kind)) {\n    let hasVisitor = false;\n    const enterList = new Array(visitors.length).fill(undefined);\n    const leaveList = new Array(visitors.length).fill(undefined);\n\n    for (let i = 0; i < visitors.length; ++i) {\n      const { enter, leave } = getEnterLeaveForKind(visitors[i], kind);\n      hasVisitor || (hasVisitor = enter != null || leave != null);\n      enterList[i] = enter;\n      leaveList[i] = leave;\n    }\n\n    if (!hasVisitor) {\n      continue;\n    }\n\n    const mergedEnterLeave = {\n      enter(...args) {\n        const node = args[0];\n\n        for (let i = 0; i < visitors.length; i++) {\n          if (skipping[i] === null) {\n            var _enterList$i;\n\n            const result =\n              (_enterList$i = enterList[i]) === null || _enterList$i === void 0\n                ? void 0\n                : _enterList$i.apply(visitors[i], args);\n\n            if (result === false) {\n              skipping[i] = node;\n            } else if (result === BREAK) {\n              skipping[i] = BREAK;\n            } else if (result !== undefined) {\n              return result;\n            }\n          }\n        }\n      },\n\n      leave(...args) {\n        const node = args[0];\n\n        for (let i = 0; i < visitors.length; i++) {\n          if (skipping[i] === null) {\n            var _leaveList$i;\n\n            const result =\n              (_leaveList$i = leaveList[i]) === null || _leaveList$i === void 0\n                ? void 0\n                : _leaveList$i.apply(visitors[i], args);\n\n            if (result === BREAK) {\n              skipping[i] = BREAK;\n            } else if (result !== undefined && result !== false) {\n              return result;\n            }\n          } else if (skipping[i] === node) {\n            skipping[i] = null;\n          }\n        }\n      },\n    };\n    mergedVisitor[kind] = mergedEnterLeave;\n  }\n\n  return mergedVisitor;\n}\n/**\n * Given a visitor instance and a node kind, return EnterLeaveVisitor for that kind.\n */\n\nexport function getEnterLeaveForKind(visitor, kind) {\n  const kindVisitor = visitor[kind];\n\n  if (typeof kindVisitor === 'object') {\n    // { Kind: { enter() {}, leave() {} } }\n    return kindVisitor;\n  } else if (typeof kindVisitor === 'function') {\n    // { Kind() {} }\n    return {\n      enter: kindVisitor,\n      leave: undefined,\n    };\n  } // { enter() {}, leave() {} }\n\n  return {\n    enter: visitor.enter,\n    leave: visitor.leave,\n  };\n}\n/**\n * Given a visitor instance, if it is leaving or not, and a node kind, return\n * the function the visitor runtime should call.\n *\n * @deprecated Please use `getEnterLeaveForKind` instead. Will be removed in v17\n */\n\n/* c8 ignore next 8 */\n\nexport function getVisitFn(visitor, kind, isLeaving) {\n  const { enter, leave } = getEnterLeaveForKind(visitor, kind);\n  return isLeaving ? leave : enter;\n}\n","import { printBlockString } from './blockString.mjs';\nimport { printString } from './printString.mjs';\nimport { visit } from './visitor.mjs';\n/**\n * Converts an AST into a string, using one set of reasonable\n * formatting rules.\n */\n\nexport function print(ast) {\n  return visit(ast, printDocASTReducer);\n}\nconst MAX_LINE_LENGTH = 80;\nconst printDocASTReducer = {\n  Name: {\n    leave: (node) => node.value,\n  },\n  Variable: {\n    leave: (node) => '$' + node.name,\n  },\n  // Document\n  Document: {\n    leave: (node) => join(node.definitions, '\\n\\n'),\n  },\n  OperationDefinition: {\n    leave(node) {\n      const varDefs = hasMultilineItems(node.variableDefinitions)\n        ? wrap('(\\n', join(node.variableDefinitions, '\\n'), '\\n)')\n        : wrap('(', join(node.variableDefinitions, ', '), ')');\n      const prefix =\n        wrap('', node.description, '\\n') +\n        join(\n          [\n            node.operation,\n            join([node.name, varDefs]),\n            join(node.directives, ' '),\n          ],\n          ' ',\n        ); // Anonymous queries with no directives or variable definitions can use\n      // the query short form.\n\n      return (prefix === 'query' ? '' : prefix + ' ') + node.selectionSet;\n    },\n  },\n  VariableDefinition: {\n    leave: ({ variable, type, defaultValue, directives, description }) =>\n      wrap('', description, '\\n') +\n      variable +\n      ': ' +\n      type +\n      wrap(' = ', defaultValue) +\n      wrap(' ', join(directives, ' ')),\n  },\n  SelectionSet: {\n    leave: ({ selections }) => block(selections),\n  },\n  Field: {\n    leave({ alias, name, arguments: args, directives, selectionSet }) {\n      const prefix = wrap('', alias, ': ') + name;\n      let argsLine = prefix + wrap('(', join(args, ', '), ')');\n\n      if (argsLine.length > MAX_LINE_LENGTH) {\n        argsLine = prefix + wrap('(\\n', indent(join(args, '\\n')), '\\n)');\n      }\n\n      return join([argsLine, join(directives, ' '), selectionSet], ' ');\n    },\n  },\n  Argument: {\n    leave: ({ name, value }) => name + ': ' + value,\n  },\n  // Fragments\n  FragmentSpread: {\n    leave: ({ name, directives }) =>\n      '...' + name + wrap(' ', join(directives, ' ')),\n  },\n  InlineFragment: {\n    leave: ({ typeCondition, directives, selectionSet }) =>\n      join(\n        [\n          '...',\n          wrap('on ', typeCondition),\n          join(directives, ' '),\n          selectionSet,\n        ],\n        ' ',\n      ),\n  },\n  FragmentDefinition: {\n    leave: ({\n      name,\n      typeCondition,\n      variableDefinitions,\n      directives,\n      selectionSet,\n      description,\n    }) =>\n      wrap('', description, '\\n') + // Note: fragment variable definitions are experimental and may be changed\n      // or removed in the future.\n      `fragment ${name}${wrap('(', join(variableDefinitions, ', '), ')')} ` +\n      `on ${typeCondition} ${wrap('', join(directives, ' '), ' ')}` +\n      selectionSet,\n  },\n  // Value\n  IntValue: {\n    leave: ({ value }) => value,\n  },\n  FloatValue: {\n    leave: ({ value }) => value,\n  },\n  StringValue: {\n    leave: ({ value, block: isBlockString }) =>\n      isBlockString ? printBlockString(value) : printString(value),\n  },\n  BooleanValue: {\n    leave: ({ value }) => (value ? 'true' : 'false'),\n  },\n  NullValue: {\n    leave: () => 'null',\n  },\n  EnumValue: {\n    leave: ({ value }) => value,\n  },\n  ListValue: {\n    leave: ({ values }) => '[' + join(values, ', ') + ']',\n  },\n  ObjectValue: {\n    leave: ({ fields }) => '{' + join(fields, ', ') + '}',\n  },\n  ObjectField: {\n    leave: ({ name, value }) => name + ': ' + value,\n  },\n  // Directive\n  Directive: {\n    leave: ({ name, arguments: args }) =>\n      '@' + name + wrap('(', join(args, ', '), ')'),\n  },\n  // Type\n  NamedType: {\n    leave: ({ name }) => name,\n  },\n  ListType: {\n    leave: ({ type }) => '[' + type + ']',\n  },\n  NonNullType: {\n    leave: ({ type }) => type + '!',\n  },\n  // Type System Definitions\n  SchemaDefinition: {\n    leave: ({ description, directives, operationTypes }) =>\n      wrap('', description, '\\n') +\n      join(['schema', join(directives, ' '), block(operationTypes)], ' '),\n  },\n  OperationTypeDefinition: {\n    leave: ({ operation, type }) => operation + ': ' + type,\n  },\n  ScalarTypeDefinition: {\n    leave: ({ description, name, directives }) =>\n      wrap('', description, '\\n') +\n      join(['scalar', name, join(directives, ' ')], ' '),\n  },\n  ObjectTypeDefinition: {\n    leave: ({ description, name, interfaces, directives, fields }) =>\n      wrap('', description, '\\n') +\n      join(\n        [\n          'type',\n          name,\n          wrap('implements ', join(interfaces, ' & ')),\n          join(directives, ' '),\n          block(fields),\n        ],\n        ' ',\n      ),\n  },\n  FieldDefinition: {\n    leave: ({ description, name, arguments: args, type, directives }) =>\n      wrap('', description, '\\n') +\n      name +\n      (hasMultilineItems(args)\n        ? wrap('(\\n', indent(join(args, '\\n')), '\\n)')\n        : wrap('(', join(args, ', '), ')')) +\n      ': ' +\n      type +\n      wrap(' ', join(directives, ' ')),\n  },\n  InputValueDefinition: {\n    leave: ({ description, name, type, defaultValue, directives }) =>\n      wrap('', description, '\\n') +\n      join(\n        [name + ': ' + type, wrap('= ', defaultValue), join(directives, ' ')],\n        ' ',\n      ),\n  },\n  InterfaceTypeDefinition: {\n    leave: ({ description, name, interfaces, directives, fields }) =>\n      wrap('', description, '\\n') +\n      join(\n        [\n          'interface',\n          name,\n          wrap('implements ', join(interfaces, ' & ')),\n          join(directives, ' '),\n          block(fields),\n        ],\n        ' ',\n      ),\n  },\n  UnionTypeDefinition: {\n    leave: ({ description, name, directives, types }) =>\n      wrap('', description, '\\n') +\n      join(\n        ['union', name, join(directives, ' '), wrap('= ', join(types, ' | '))],\n        ' ',\n      ),\n  },\n  EnumTypeDefinition: {\n    leave: ({ description, name, directives, values }) =>\n      wrap('', description, '\\n') +\n      join(['enum', name, join(directives, ' '), block(values)], ' '),\n  },\n  EnumValueDefinition: {\n    leave: ({ description, name, directives }) =>\n      wrap('', description, '\\n') + join([name, join(directives, ' ')], ' '),\n  },\n  InputObjectTypeDefinition: {\n    leave: ({ description, name, directives, fields }) =>\n      wrap('', description, '\\n') +\n      join(['input', name, join(directives, ' '), block(fields)], ' '),\n  },\n  DirectiveDefinition: {\n    leave: ({ description, name, arguments: args, repeatable, locations }) =>\n      wrap('', description, '\\n') +\n      'directive @' +\n      name +\n      (hasMultilineItems(args)\n        ? wrap('(\\n', indent(join(args, '\\n')), '\\n)')\n        : wrap('(', join(args, ', '), ')')) +\n      (repeatable ? ' repeatable' : '') +\n      ' on ' +\n      join(locations, ' | '),\n  },\n  SchemaExtension: {\n    leave: ({ directives, operationTypes }) =>\n      join(\n        ['extend schema', join(directives, ' '), block(operationTypes)],\n        ' ',\n      ),\n  },\n  ScalarTypeExtension: {\n    leave: ({ name, directives }) =>\n      join(['extend scalar', name, join(directives, ' ')], ' '),\n  },\n  ObjectTypeExtension: {\n    leave: ({ name, interfaces, directives, fields }) =>\n      join(\n        [\n          'extend type',\n          name,\n          wrap('implements ', join(interfaces, ' & ')),\n          join(directives, ' '),\n          block(fields),\n        ],\n        ' ',\n      ),\n  },\n  InterfaceTypeExtension: {\n    leave: ({ name, interfaces, directives, fields }) =>\n      join(\n        [\n          'extend interface',\n          name,\n          wrap('implements ', join(interfaces, ' & ')),\n          join(directives, ' '),\n          block(fields),\n        ],\n        ' ',\n      ),\n  },\n  UnionTypeExtension: {\n    leave: ({ name, directives, types }) =>\n      join(\n        [\n          'extend union',\n          name,\n          join(directives, ' '),\n          wrap('= ', join(types, ' | ')),\n        ],\n        ' ',\n      ),\n  },\n  EnumTypeExtension: {\n    leave: ({ name, directives, values }) =>\n      join(['extend enum', name, join(directives, ' '), block(values)], ' '),\n  },\n  InputObjectTypeExtension: {\n    leave: ({ name, directives, fields }) =>\n      join(['extend input', name, join(directives, ' '), block(fields)], ' '),\n  },\n  // Schema Coordinates\n  TypeCoordinate: {\n    leave: ({ name }) => name,\n  },\n  MemberCoordinate: {\n    leave: ({ name, memberName }) => join([name, wrap('.', memberName)]),\n  },\n  ArgumentCoordinate: {\n    leave: ({ name, fieldName, argumentName }) =>\n      join([name, wrap('.', fieldName), wrap('(', argumentName, ':)')]),\n  },\n  DirectiveCoordinate: {\n    leave: ({ name }) => join(['@', name]),\n  },\n  DirectiveArgumentCoordinate: {\n    leave: ({ name, argumentName }) =>\n      join(['@', name, wrap('(', argumentName, ':)')]),\n  },\n};\n/**\n * Given maybeArray, print an empty string if it is null or empty, otherwise\n * print all items together separated by separator if provided\n */\n\nfunction join(maybeArray, separator = '') {\n  var _maybeArray$filter$jo;\n\n  return (_maybeArray$filter$jo =\n    maybeArray === null || maybeArray === void 0\n      ? void 0\n      : maybeArray.filter((x) => x).join(separator)) !== null &&\n    _maybeArray$filter$jo !== void 0\n    ? _maybeArray$filter$jo\n    : '';\n}\n/**\n * Given array, print each item on its own line, wrapped in an indented `{ }` block.\n */\n\nfunction block(array) {\n  return wrap('{\\n', indent(join(array, '\\n')), '\\n}');\n}\n/**\n * If maybeString is not null or empty, then wrap with start and end, otherwise print an empty string.\n */\n\nfunction wrap(start, maybeString, end = '') {\n  return maybeString != null && maybeString !== ''\n    ? start + maybeString + end\n    : '';\n}\n\nfunction indent(str) {\n  return wrap('  ', str.replace(/\\n/g, '\\n  '));\n}\n\nfunction hasMultilineItems(maybeArray) {\n  var _maybeArray$some;\n\n  // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n  /* c8 ignore next */\n  return (_maybeArray$some =\n    maybeArray === null || maybeArray === void 0\n      ? void 0\n      : maybeArray.some((str) => str.includes('\\n'))) !== null &&\n    _maybeArray$some !== void 0\n    ? _maybeArray$some\n    : false;\n}\n"],"x_google_ignoreList":[0,1,2],"mappings":";;;;;;AAIA,SAAgB,YAAY,KAAK;AAC/B,QAAO,IAAI,IAAI,QAAQ,eAAe,gBAAgB,CAAC;;AAGzD,MAAM,gBAAgB;AAEtB,SAAS,gBAAgB,KAAK;AAC5B,QAAO,gBAAgB,IAAI,WAAW,EAAE;;AAG1C,MAAM,kBAAkB;CACtB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACD;;;;;;;ACtKD,MAAa,QAAQ,OAAO,OAAO,EAAE,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgFtC,SAAgB,MAAM,MAAM,SAAS,cAAc,mBAAmB;CACpE,MAAM,gCAAgB,IAAI,KAAK;AAE/B,MAAK,MAAM,QAAQ,OAAO,OAAO,KAAK,CACpC,eAAc,IAAI,MAAM,qBAAqB,SAAS,KAAK,CAAC;CAI9D,IAAI,QAAQ,KAAA;CACZ,IAAI,UAAU,MAAM,QAAQ,KAAK;CACjC,IAAI,OAAO,CAAC,KAAK;CACjB,IAAI,QAAQ;CACZ,IAAI,QAAQ,EAAE;CACd,IAAI,OAAO;CACX,IAAI,MAAM,KAAA;CACV,IAAI,SAAS,KAAA;CACb,MAAM,OAAO,EAAE;CACf,MAAM,YAAY,EAAE;AAGpB,IAAG;AACD;EACA,MAAM,YAAY,UAAU,KAAK;EACjC,MAAM,WAAW,aAAa,MAAM,WAAW;AAE/C,MAAI,WAAW;AACb,SAAM,UAAU,WAAW,IAAI,KAAA,IAAY,KAAK,KAAK,SAAS;AAC9D,UAAO;AACP,YAAS,UAAU,KAAK;AAExB,OAAI,SACF,KAAI,SAAS;AACX,WAAO,KAAK,OAAO;IACnB,IAAI,aAAa;AAEjB,SAAK,MAAM,CAAC,SAAS,cAAc,OAAO;KACxC,MAAM,WAAW,UAAU;AAE3B,SAAI,cAAc,MAAM;AACtB,WAAK,OAAO,UAAU,EAAE;AACxB;WAEA,MAAK,YAAY;;UAGhB;AACL,WAAO,EAAE,GAAG,MAAM;AAElB,SAAK,MAAM,CAAC,SAAS,cAAc,MACjC,MAAK,WAAW;;AAKtB,WAAQ,MAAM;AACd,UAAO,MAAM;AACb,WAAQ,MAAM;AACd,aAAU,MAAM;AAChB,WAAQ,MAAM;aACL,QAAQ;AACjB,SAAM,UAAU,QAAQ,KAAK;AAC7B,UAAO,OAAO;AAEd,OAAI,SAAS,QAAQ,SAAS,KAAA,EAC5B;AAGF,QAAK,KAAK,IAAI;;EAGhB,IAAI;AAEJ,MAAI,CAAC,MAAM,QAAQ,KAAK,EAAE;GACxB,IAAI,oBAAoB;AAExB,UAAO,KAAK,IAAI,UAAU,OAAO,qBAAqB,QAAQ,KAAK,CAAC,GAAG;GACvE,MAAM,UAAU,aACX,qBAAqB,cAAc,IAAI,KAAK,KAAK,MAAM,QACxD,uBAAuB,KAAK,IAC1B,KAAK,IACL,mBAAmB,SACpB,sBAAsB,cAAc,IAAI,KAAK,KAAK,MAAM,QACzD,wBAAwB,KAAK,IAC7B,KAAK,IACL,oBAAoB;AACxB,YACE,YAAY,QAAQ,YAAY,KAAK,IACjC,KAAK,IACL,QAAQ,KAAK,SAAS,MAAM,KAAK,QAAQ,MAAM,UAAU;AAE/D,OAAI,WAAW,MACb;AAGF,OAAI,WAAW;QACT,CAAC,WAAW;AACd,UAAK,KAAK;AACV;;cAEO,WAAW,KAAA,GAAW;AAC/B,UAAM,KAAK,CAAC,KAAK,OAAO,CAAC;AAEzB,QAAI,CAAC,UACH,KAAI,OAAO,OAAO,CAChB,QAAO;SACF;AACL,UAAK,KAAK;AACV;;;;AAMR,MAAI,WAAW,KAAA,KAAa,SAC1B,OAAM,KAAK,CAAC,KAAK,KAAK,CAAC;AAGzB,MAAI,UACF,MAAK,KAAK;OACL;GACL,IAAI;AAEJ,WAAQ;IACN;IACA;IACA;IACA;IACA,MAAM;IACP;AACD,aAAU,MAAM,QAAQ,KAAK;AAC7B,UAAO,UACH,QACC,aAAa,YAAY,KAAK,WAAW,QAC1C,eAAe,KAAK,IACpB,aACA,EAAE;AACN,WAAQ;AACR,WAAQ,EAAE;AAEV,OAAI,OACF,WAAU,KAAK,OAAO;AAGxB,YAAS;;UAEJ,UAAU,KAAA;AAEnB,KAAI,MAAM,WAAW,EAEnB,QAAO,MAAM,MAAM,SAAS,GAAG;AAGjC,QAAO;;;;;;;;AAST,SAAgB,gBAAgB,UAAU;CACxC,MAAM,WAAW,IAAI,MAAM,SAAS,OAAO,CAAC,KAAK,KAAK;CACtD,MAAM,gBAAgB,OAAO,OAAO,KAAK;AAEzC,MAAK,MAAM,QAAQ,OAAO,OAAO,KAAK,EAAE;EACtC,IAAI,aAAa;EACjB,MAAM,YAAY,IAAI,MAAM,SAAS,OAAO,CAAC,KAAK,KAAA,EAAU;EAC5D,MAAM,YAAY,IAAI,MAAM,SAAS,OAAO,CAAC,KAAK,KAAA,EAAU;AAE5D,OAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,EAAE,GAAG;GACxC,MAAM,EAAE,OAAO,UAAU,qBAAqB,SAAS,IAAI,KAAK;AAChE,kBAAe,aAAa,SAAS,QAAQ,SAAS;AACtD,aAAU,KAAK;AACf,aAAU,KAAK;;AAGjB,MAAI,CAAC,WACH;AAkDF,gBAAc,QA/CW;GACvB,MAAM,GAAG,MAAM;IACb,MAAM,OAAO,KAAK;AAElB,SAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,IACnC,KAAI,SAAS,OAAO,MAAM;KACxB,IAAI;KAEJ,MAAM,UACH,eAAe,UAAU,QAAQ,QAAQ,iBAAiB,KAAK,IAC5D,KAAK,IACL,aAAa,MAAM,SAAS,IAAI,KAAK;AAE3C,SAAI,WAAW,MACb,UAAS,KAAK;cACL,WAAW,MACpB,UAAS,KAAK;cACL,WAAW,KAAA,EACpB,QAAO;;;GAMf,MAAM,GAAG,MAAM;IACb,MAAM,OAAO,KAAK;AAElB,SAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,IACnC,KAAI,SAAS,OAAO,MAAM;KACxB,IAAI;KAEJ,MAAM,UACH,eAAe,UAAU,QAAQ,QAAQ,iBAAiB,KAAK,IAC5D,KAAK,IACL,aAAa,MAAM,SAAS,IAAI,KAAK;AAE3C,SAAI,WAAW,MACb,UAAS,KAAK;cACL,WAAW,KAAA,KAAa,WAAW,MAC5C,QAAO;eAEA,SAAS,OAAO,KACzB,UAAS,KAAK;;GAIrB;;AAIH,QAAO;;;;;AAMT,SAAgB,qBAAqB,SAAS,MAAM;CAClD,MAAM,cAAc,QAAQ;AAE5B,KAAI,OAAO,gBAAgB,SAEzB,QAAO;UACE,OAAO,gBAAgB,WAEhC,QAAO;EACL,OAAO;EACP,OAAO,KAAA;EACR;AAGH,QAAO;EACL,OAAO,QAAQ;EACf,OAAO,QAAQ;EAChB;;;;;;;;AC/UH,SAAgB,MAAM,KAAK;AACzB,QAAO,MAAM,KAAK,mBAAmB;;AAEvC,MAAM,kBAAkB;AACxB,MAAM,qBAAqB;CACzB,MAAM,EACJ,QAAQ,SAAS,KAAK,OACvB;CACD,UAAU,EACR,QAAQ,SAAS,MAAM,KAAK,MAC7B;CAED,UAAU,EACR,QAAQ,SAAS,KAAK,KAAK,aAAa,OAAO,EAChD;CACD,qBAAqB,EACnB,MAAM,MAAM;EACV,MAAM,UAAU,kBAAkB,KAAK,oBAAoB,GACvD,KAAK,OAAO,KAAK,KAAK,qBAAqB,KAAK,EAAE,MAAM,GACxD,KAAK,KAAK,KAAK,KAAK,qBAAqB,KAAK,EAAE,IAAI;EACxD,MAAM,SACJ,KAAK,IAAI,KAAK,aAAa,KAAK,GAChC,KACE;GACE,KAAK;GACL,KAAK,CAAC,KAAK,MAAM,QAAQ,CAAC;GAC1B,KAAK,KAAK,YAAY,IAAI;GAC3B,EACD,IACD;AAGH,UAAQ,WAAW,UAAU,KAAK,SAAS,OAAO,KAAK;IAE1D;CACD,oBAAoB,EAClB,QAAQ,EAAE,UAAU,MAAM,cAAc,YAAY,kBAClD,KAAK,IAAI,aAAa,KAAK,GAC3B,WACA,OACA,OACA,KAAK,OAAO,aAAa,GACzB,KAAK,KAAK,KAAK,YAAY,IAAI,CAAC,EACnC;CACD,cAAc,EACZ,QAAQ,EAAE,iBAAiB,MAAM,WAAW,EAC7C;CACD,OAAO,EACL,MAAM,EAAE,OAAO,MAAM,WAAW,MAAM,YAAY,gBAAgB;EAChE,MAAM,SAAS,KAAK,IAAI,OAAO,KAAK,GAAG;EACvC,IAAI,WAAW,SAAS,KAAK,KAAK,KAAK,MAAM,KAAK,EAAE,IAAI;AAExD,MAAI,SAAS,SAAS,gBACpB,YAAW,SAAS,KAAK,OAAO,OAAO,KAAK,MAAM,KAAK,CAAC,EAAE,MAAM;AAGlE,SAAO,KAAK;GAAC;GAAU,KAAK,YAAY,IAAI;GAAE;GAAa,EAAE,IAAI;IAEpE;CACD,UAAU,EACR,QAAQ,EAAE,MAAM,YAAY,OAAO,OAAO,OAC3C;CAED,gBAAgB,EACd,QAAQ,EAAE,MAAM,iBACd,QAAQ,OAAO,KAAK,KAAK,KAAK,YAAY,IAAI,CAAC,EAClD;CACD,gBAAgB,EACd,QAAQ,EAAE,eAAe,YAAY,mBACnC,KACE;EACE;EACA,KAAK,OAAO,cAAc;EAC1B,KAAK,YAAY,IAAI;EACrB;EACD,EACD,IACD,EACJ;CACD,oBAAoB,EAClB,QAAQ,EACN,MACA,eACA,qBACA,YACA,cACA,kBAEA,KAAK,IAAI,aAAa,KAAK,GAE3B,YAAY,OAAO,KAAK,KAAK,KAAK,qBAAqB,KAAK,EAAE,IAAI,CAAC,MAC7D,cAAc,GAAG,KAAK,IAAI,KAAK,YAAY,IAAI,EAAE,IAAI,KAC3D,cACH;CAED,UAAU,EACR,QAAQ,EAAE,YAAY,OACvB;CACD,YAAY,EACV,QAAQ,EAAE,YAAY,OACvB;CACD,aAAa,EACX,QAAQ,EAAE,OAAO,OAAO,oBACtB,gBAAgB,iBAAiB,MAAM,GAAG,YAAY,MAAM,EAC/D;CACD,cAAc,EACZ,QAAQ,EAAE,YAAa,QAAQ,SAAS,SACzC;CACD,WAAW,EACT,aAAa,QACd;CACD,WAAW,EACT,QAAQ,EAAE,YAAY,OACvB;CACD,WAAW,EACT,QAAQ,EAAE,aAAa,MAAM,KAAK,QAAQ,KAAK,GAAG,KACnD;CACD,aAAa,EACX,QAAQ,EAAE,aAAa,MAAM,KAAK,QAAQ,KAAK,GAAG,KACnD;CACD,aAAa,EACX,QAAQ,EAAE,MAAM,YAAY,OAAO,OAAO,OAC3C;CAED,WAAW,EACT,QAAQ,EAAE,MAAM,WAAW,WACzB,MAAM,OAAO,KAAK,KAAK,KAAK,MAAM,KAAK,EAAE,IAAI,EAChD;CAED,WAAW,EACT,QAAQ,EAAE,WAAW,MACtB;CACD,UAAU,EACR,QAAQ,EAAE,WAAW,MAAM,OAAO,KACnC;CACD,aAAa,EACX,QAAQ,EAAE,WAAW,OAAO,KAC7B;CAED,kBAAkB,EAChB,QAAQ,EAAE,aAAa,YAAY,qBACjC,KAAK,IAAI,aAAa,KAAK,GAC3B,KAAK;EAAC;EAAU,KAAK,YAAY,IAAI;EAAE,MAAM,eAAe;EAAC,EAAE,IAAI,EACtE;CACD,yBAAyB,EACvB,QAAQ,EAAE,WAAW,WAAW,YAAY,OAAO,MACpD;CACD,sBAAsB,EACpB,QAAQ,EAAE,aAAa,MAAM,iBAC3B,KAAK,IAAI,aAAa,KAAK,GAC3B,KAAK;EAAC;EAAU;EAAM,KAAK,YAAY,IAAI;EAAC,EAAE,IAAI,EACrD;CACD,sBAAsB,EACpB,QAAQ,EAAE,aAAa,MAAM,YAAY,YAAY,aACnD,KAAK,IAAI,aAAa,KAAK,GAC3B,KACE;EACE;EACA;EACA,KAAK,eAAe,KAAK,YAAY,MAAM,CAAC;EAC5C,KAAK,YAAY,IAAI;EACrB,MAAM,OAAO;EACd,EACD,IACD,EACJ;CACD,iBAAiB,EACf,QAAQ,EAAE,aAAa,MAAM,WAAW,MAAM,MAAM,iBAClD,KAAK,IAAI,aAAa,KAAK,GAC3B,QACC,kBAAkB,KAAK,GACpB,KAAK,OAAO,OAAO,KAAK,MAAM,KAAK,CAAC,EAAE,MAAM,GAC5C,KAAK,KAAK,KAAK,MAAM,KAAK,EAAE,IAAI,IACpC,OACA,OACA,KAAK,KAAK,KAAK,YAAY,IAAI,CAAC,EACnC;CACD,sBAAsB,EACpB,QAAQ,EAAE,aAAa,MAAM,MAAM,cAAc,iBAC/C,KAAK,IAAI,aAAa,KAAK,GAC3B,KACE;EAAC,OAAO,OAAO;EAAM,KAAK,MAAM,aAAa;EAAE,KAAK,YAAY,IAAI;EAAC,EACrE,IACD,EACJ;CACD,yBAAyB,EACvB,QAAQ,EAAE,aAAa,MAAM,YAAY,YAAY,aACnD,KAAK,IAAI,aAAa,KAAK,GAC3B,KACE;EACE;EACA;EACA,KAAK,eAAe,KAAK,YAAY,MAAM,CAAC;EAC5C,KAAK,YAAY,IAAI;EACrB,MAAM,OAAO;EACd,EACD,IACD,EACJ;CACD,qBAAqB,EACnB,QAAQ,EAAE,aAAa,MAAM,YAAY,YACvC,KAAK,IAAI,aAAa,KAAK,GAC3B,KACE;EAAC;EAAS;EAAM,KAAK,YAAY,IAAI;EAAE,KAAK,MAAM,KAAK,OAAO,MAAM,CAAC;EAAC,EACtE,IACD,EACJ;CACD,oBAAoB,EAClB,QAAQ,EAAE,aAAa,MAAM,YAAY,aACvC,KAAK,IAAI,aAAa,KAAK,GAC3B,KAAK;EAAC;EAAQ;EAAM,KAAK,YAAY,IAAI;EAAE,MAAM,OAAO;EAAC,EAAE,IAAI,EAClE;CACD,qBAAqB,EACnB,QAAQ,EAAE,aAAa,MAAM,iBAC3B,KAAK,IAAI,aAAa,KAAK,GAAG,KAAK,CAAC,MAAM,KAAK,YAAY,IAAI,CAAC,EAAE,IAAI,EACzE;CACD,2BAA2B,EACzB,QAAQ,EAAE,aAAa,MAAM,YAAY,aACvC,KAAK,IAAI,aAAa,KAAK,GAC3B,KAAK;EAAC;EAAS;EAAM,KAAK,YAAY,IAAI;EAAE,MAAM,OAAO;EAAC,EAAE,IAAI,EACnE;CACD,qBAAqB,EACnB,QAAQ,EAAE,aAAa,MAAM,WAAW,MAAM,YAAY,gBACxD,KAAK,IAAI,aAAa,KAAK,GAC3B,gBACA,QACC,kBAAkB,KAAK,GACpB,KAAK,OAAO,OAAO,KAAK,MAAM,KAAK,CAAC,EAAE,MAAM,GAC5C,KAAK,KAAK,KAAK,MAAM,KAAK,EAAE,IAAI,KACnC,aAAa,gBAAgB,MAC9B,SACA,KAAK,WAAW,MAAM,EACzB;CACD,iBAAiB,EACf,QAAQ,EAAE,YAAY,qBACpB,KACE;EAAC;EAAiB,KAAK,YAAY,IAAI;EAAE,MAAM,eAAe;EAAC,EAC/D,IACD,EACJ;CACD,qBAAqB,EACnB,QAAQ,EAAE,MAAM,iBACd,KAAK;EAAC;EAAiB;EAAM,KAAK,YAAY,IAAI;EAAC,EAAE,IAAI,EAC5D;CACD,qBAAqB,EACnB,QAAQ,EAAE,MAAM,YAAY,YAAY,aACtC,KACE;EACE;EACA;EACA,KAAK,eAAe,KAAK,YAAY,MAAM,CAAC;EAC5C,KAAK,YAAY,IAAI;EACrB,MAAM,OAAO;EACd,EACD,IACD,EACJ;CACD,wBAAwB,EACtB,QAAQ,EAAE,MAAM,YAAY,YAAY,aACtC,KACE;EACE;EACA;EACA,KAAK,eAAe,KAAK,YAAY,MAAM,CAAC;EAC5C,KAAK,YAAY,IAAI;EACrB,MAAM,OAAO;EACd,EACD,IACD,EACJ;CACD,oBAAoB,EAClB,QAAQ,EAAE,MAAM,YAAY,YAC1B,KACE;EACE;EACA;EACA,KAAK,YAAY,IAAI;EACrB,KAAK,MAAM,KAAK,OAAO,MAAM,CAAC;EAC/B,EACD,IACD,EACJ;CACD,mBAAmB,EACjB,QAAQ,EAAE,MAAM,YAAY,aAC1B,KAAK;EAAC;EAAe;EAAM,KAAK,YAAY,IAAI;EAAE,MAAM,OAAO;EAAC,EAAE,IAAI,EACzE;CACD,0BAA0B,EACxB,QAAQ,EAAE,MAAM,YAAY,aAC1B,KAAK;EAAC;EAAgB;EAAM,KAAK,YAAY,IAAI;EAAE,MAAM,OAAO;EAAC,EAAE,IAAI,EAC1E;CAED,gBAAgB,EACd,QAAQ,EAAE,WAAW,MACtB;CACD,kBAAkB,EAChB,QAAQ,EAAE,MAAM,iBAAiB,KAAK,CAAC,MAAM,KAAK,KAAK,WAAW,CAAC,CAAC,EACrE;CACD,oBAAoB,EAClB,QAAQ,EAAE,MAAM,WAAW,mBACzB,KAAK;EAAC;EAAM,KAAK,KAAK,UAAU;EAAE,KAAK,KAAK,cAAc,KAAK;EAAC,CAAC,EACpE;CACD,qBAAqB,EACnB,QAAQ,EAAE,WAAW,KAAK,CAAC,KAAK,KAAK,CAAC,EACvC;CACD,6BAA6B,EAC3B,QAAQ,EAAE,MAAM,mBACd,KAAK;EAAC;EAAK;EAAM,KAAK,KAAK,cAAc,KAAK;EAAC,CAAC,EACnD;CACF;;;;;AAMD,SAAS,KAAK,YAAY,YAAY,IAAI;CACxC,IAAI;AAEJ,SAAQ,wBACN,eAAe,QAAQ,eAAe,KAAK,IACvC,KAAK,IACL,WAAW,QAAQ,MAAM,EAAE,CAAC,KAAK,UAAU,MAAM,QACrD,0BAA0B,KAAK,IAC7B,wBACA;;;;;AAMN,SAAS,MAAM,OAAO;AACpB,QAAO,KAAK,OAAO,OAAO,KAAK,OAAO,KAAK,CAAC,EAAE,MAAM;;;;;AAMtD,SAAS,KAAK,OAAO,aAAa,MAAM,IAAI;AAC1C,QAAO,eAAe,QAAQ,gBAAgB,KAC1C,QAAQ,cAAc,MACtB;;AAGN,SAAS,OAAO,KAAK;AACnB,QAAO,KAAK,MAAM,IAAI,QAAQ,OAAO,OAAO,CAAC;;AAG/C,SAAS,kBAAkB,YAAY;CACrC,IAAI;;AAKJ,SAAQ,mBACN,eAAe,QAAQ,eAAe,KAAK,IACvC,KAAK,IACL,WAAW,MAAM,QAAQ,IAAI,SAAS,KAAK,CAAC,MAAM,QACtD,qBAAqB,KAAK,IACxB,mBACA"}