@tamagui/compiler-core 0.0.0-bootstrap.0 → 3.0.0-beta.1093.1

package/dist/esm/evaluate.mjs

@@ -0,0 +1,576 @@
+import { childNode, childNodes, identifierName, isAstNode, unwrapExpression } from "./ast.mjs";
+import { expressionReference, spanOf } from "./contracts.mjs";
+import { linkedBailout, localBailout } from "./diagnostics.mjs";
+
+function success(value) {
+	return {
+		ok: true,
+		value
+	};
+}
+function literal(node) {
+	if (node.type === "NullLiteral") return null;
+	if (node.type === "Literal" || node.type.endsWith("Literal")) {
+		const value = node.value;
+		if (typeof value === "string" || typeof value === "number" || typeof value === "boolean" || value === null) {
+			return value;
+		}
+	}
+	return void 0;
+}
+function unsupported(id, node, detail = `Expression ${node.type} is not statically supported`) {
+	return {
+		ok: false,
+		bailout: localBailout("local/unsupported-expression", spanOf(id, node), detail)
+	};
+}
+function evaluateDefinition(resolver, definition, useSpan, state) {
+	const key = `${definition.id}:${definition.span.start}`;
+	if (state.activeDefinitions.has(key)) {
+		return {
+			ok: false,
+			bailout: localBailout("local/static-evaluation-cycle", useSpan, `Static evaluation cycle reached ${definition.name}`)
+		};
+	}
+	if (!definition.initializer) {
+		return {
+			ok: false,
+			bailout: linkedBailout("linked/missing-initializer", useSpan, `Binding ${definition.name} has no static initializer`, definition.id)
+		};
+	}
+	if (!definition.constant) {
+		return {
+			ok: false,
+			bailout: linkedBailout("linked/unresolved-binding", useSpan, `Binding ${definition.name} is mutable and cannot be statically evaluated`, definition.id)
+		};
+	}
+	const initializer = resolver.expressionNode(definition.initializer);
+	if (!initializer) {
+		return {
+			ok: false,
+			bailout: linkedBailout("linked/missing-initializer", useSpan, `Binding ${definition.name} initializer is outside the linked graph`, definition.id)
+		};
+	}
+	state.dependencies.add(definition.id);
+	state.activeDefinitions.add(key);
+	try {
+		return evaluateNode(resolver, definition.id, initializer, state);
+	} finally {
+		state.activeDefinitions.delete(key);
+	}
+}
+function evaluateObject(resolver, id, node, state) {
+	const output = {};
+	for (const property of childNodes(node, "properties")) {
+		if (property.type === "SpreadElement") {
+			const argument = childNode(property, "argument");
+			if (!argument) return unsupported(id, property);
+			const spread = evaluateNode(resolver, id, argument, state);
+			if (!spread.ok) return spread;
+			if (!spread.value || typeof spread.value !== "object" || Array.isArray(spread.value)) {
+				return {
+					ok: false,
+					bailout: localBailout("local/non-object-spread", spanOf(id, property), "Static object spread did not evaluate to an object")
+				};
+			}
+			Object.assign(output, spread.value);
+			continue;
+		}
+		if (property.type !== "Property" && property.type !== "ObjectProperty") {
+			return unsupported(id, property);
+		}
+		const keyNode = childNode(property, "key");
+		const valueNode = childNode(property, "value");
+		if (!keyNode || !valueNode) return unsupported(id, property);
+		let key = identifierName(keyNode) ?? void 0;
+		if (property.computed === true || key === void 0) {
+			const evaluatedKey = evaluateNode(resolver, id, keyNode, state);
+			if (!evaluatedKey.ok) return evaluatedKey;
+			key = evaluatedKey.value;
+		}
+		if (typeof key !== "string" && typeof key !== "number") {
+			return unsupported(id, keyNode, "Static object key is not a string or number");
+		}
+		const value = evaluateNode(resolver, id, valueNode, state);
+		if (!value.ok) return value;
+		output[String(key)] = value.value;
+	}
+	return success(output);
+}
+function evaluateArray(resolver, id, node, state) {
+	const output = [];
+	const rawElements = node.elements;
+	if (!Array.isArray(rawElements) || rawElements.some((element) => element === null || !isAstNode(element))) {
+		return unsupported(id, node, "Sparse arrays are not statically supported");
+	}
+	for (const element of rawElements.filter(isAstNode)) {
+		if (element.type === "SpreadElement") {
+			const argument = childNode(element, "argument");
+			if (!argument) return unsupported(id, element);
+			const spread = evaluateNode(resolver, id, argument, state);
+			if (!spread.ok) return spread;
+			if (!Array.isArray(spread.value)) {
+				return unsupported(id, element, "Static array spread did not evaluate to an array");
+			}
+			output.push(...spread.value);
+			continue;
+		}
+		const value = evaluateNode(resolver, id, element, state);
+		if (!value.ok) return value;
+		output.push(value.value);
+	}
+	return success(output);
+}
+function evaluateNode(resolver, id, input, state) {
+	const node = unwrapExpression(input);
+	const literalValue = literal(node);
+	if (literalValue !== void 0) return success(literalValue);
+	switch (node.type) {
+		case "Identifier": {
+			const name = identifierName(node);
+			if (!name) return unsupported(id, node);
+			const definition = resolver.resolveReference(expressionReference(id, node));
+			if (!definition) {
+				return {
+					ok: false,
+					bailout: linkedBailout("linked/unresolved-binding", spanOf(id, node), `Binding ${name} has no host-linked definition`)
+				};
+			}
+			return evaluateDefinition(resolver, definition, spanOf(id, node), state);
+		}
+		case "ObjectExpression": return evaluateObject(resolver, id, node, state);
+		case "ArrayExpression": return evaluateArray(resolver, id, node, state);
+		case "MemberExpression": {
+			const objectNode = childNode(node, "object");
+			const propertyNode = childNode(node, "property");
+			if (!objectNode || !propertyNode) return unsupported(id, node);
+			const object = evaluateNode(resolver, id, objectNode, state);
+			if (!object.ok) return object;
+			let property = identifierName(propertyNode);
+			if (node.computed === true || property === null) {
+				const evaluatedProperty = evaluateNode(resolver, id, propertyNode, state);
+				if (!evaluatedProperty.ok) return evaluatedProperty;
+				property = evaluatedProperty.value;
+			}
+			if ((typeof object.value !== "object" || object.value === null) && typeof object.value !== "string") {
+				return unsupported(id, node, "Static member target is not indexable");
+			}
+			if (typeof property !== "string" && typeof property !== "number") {
+				return unsupported(id, propertyNode, "Static member key is not a string or number");
+			}
+			const value = object.value[String(property)];
+			return value === void 0 ? unsupported(id, node, `Static member ${String(property)} does not exist`) : success(value);
+		}
+		case "UnaryExpression": {
+			const argument = childNode(node, "argument");
+			if (!argument) return unsupported(id, node);
+			const value = evaluateNode(resolver, id, argument, state);
+			if (!value.ok) return value;
+			if (node.operator === "-" && typeof value.value === "number") {
+				return success(-value.value);
+			}
+			if (node.operator === "+" && typeof value.value === "number") {
+				return success(value.value);
+			}
+			if (node.operator === "!") return success(!value.value);
+			return unsupported(id, node, `Unary operator ${String(node.operator)} is unsupported`);
+		}
+		case "BinaryExpression":
+		case "LogicalExpression": {
+			const leftNode = childNode(node, "left");
+			const rightNode = childNode(node, "right");
+			if (!leftNode || !rightNode) return unsupported(id, node);
+			const left = evaluateNode(resolver, id, leftNode, state);
+			if (!left.ok) return left;
+			if (node.type === "LogicalExpression") {
+				if (node.operator === "&&" && !left.value) return left;
+				if (node.operator === "||" && left.value) return left;
+				if (node.operator === "??" && left.value !== null) return left;
+			}
+			const right = evaluateNode(resolver, id, rightNode, state);
+			if (!right.ok) return right;
+			switch (node.operator) {
+				case "+":
+					if (typeof left.value === "number" && typeof right.value === "number") {
+						return success(left.value + right.value);
+					}
+					if (typeof left.value === "string" || typeof right.value === "string") {
+						return success(String(left.value) + String(right.value));
+					}
+					break;
+				case "-":
+					if (typeof left.value === "number" && typeof right.value === "number") {
+						return success(left.value - right.value);
+					}
+					break;
+				case "*":
+					if (typeof left.value === "number" && typeof right.value === "number") {
+						return success(left.value * right.value);
+					}
+					break;
+				case "/":
+					if (typeof left.value === "number" && typeof right.value === "number") {
+						return success(left.value / right.value);
+					}
+					break;
+				case "&&":
+				case "||":
+				case "??": return right;
+			}
+			return unsupported(id, node, `Binary operator ${String(node.operator)} is unsupported`);
+		}
+		case "ConditionalExpression": {
+			const testNode = childNode(node, "test");
+			const consequent = childNode(node, "consequent");
+			const alternate = childNode(node, "alternate");
+			if (!testNode || !consequent || !alternate) return unsupported(id, node);
+			const test = evaluateNode(resolver, id, testNode, state);
+			if (!test.ok) return test;
+			return evaluateNode(resolver, id, test.value ? consequent : alternate, state);
+		}
+		case "TemplateLiteral": {
+			const quasis = childNodes(node, "quasis");
+			const expressions = childNodes(node, "expressions");
+			let output = "";
+			for (let index = 0; index < quasis.length; index++) {
+				output += quasiText(quasis[index]);
+				const expression = expressions[index];
+				if (expression) {
+					const value = evaluateNode(resolver, id, expression, state);
+					if (!value.ok) return value;
+					output += String(value.value);
+				}
+			}
+			return success(output);
+		}
+		default: return unsupported(id, node);
+	}
+}
+function quasiText(quasi) {
+	const cooked = quasi?.value?.cooked;
+	const raw = quasi?.value?.raw;
+	return typeof cooked === "string" ? cooked : typeof raw === "string" ? raw : "";
+}
+function dynamicPrimitive(value) {
+	if (value === null) return "null";
+	if (typeof value === "number") return "number";
+	if (typeof value === "string") return "string";
+	if (typeof value === "boolean") return "boolean";
+	return null;
+}
+function evaluateDynamicNode(resolver, id, input, state) {
+	const exact = evaluateNode(resolver, id, input, state);
+	if (exact.ok) {
+		const type = dynamicPrimitive(exact.value);
+		return type ? {
+			type,
+			values: [exact.value]
+		} : null;
+	}
+	const node = unwrapExpression(input);
+	if (node.type === "Identifier") {
+		if (!identifierName(node)) return null;
+		const definition = resolver.resolveReference(expressionReference(id, node));
+		if (!definition?.constant || !definition.initializer) return null;
+		const key = `${definition.id}:${definition.span.start}`;
+		if (state.activeDefinitions.has(key)) return null;
+		const initializer = resolver.expressionNode(definition.initializer);
+		if (!initializer) return null;
+		state.dependencies.add(definition.id);
+		state.activeDefinitions.add(key);
+		try {
+			return evaluateDynamicNode(resolver, definition.id, initializer, state);
+		} finally {
+			state.activeDefinitions.delete(key);
+		}
+	}
+	if (node.type === "MemberExpression") {
+		const objectNode = childNode(node, "object");
+		const propertyNode = childNode(node, "property");
+		if (!objectNode || !propertyNode) return null;
+		const object = evaluateNode(resolver, id, objectNode, state);
+		if (!object.ok || !Array.isArray(object.value)) return null;
+		const property = evaluateDynamicNode(resolver, id, propertyNode, state);
+		if (property?.type !== "number" || object.value.length > 32) return null;
+		const values = [];
+		let type = null;
+		for (const value of object.value) {
+			const nextType = dynamicPrimitive(value);
+			if (!nextType || type && type !== nextType) return null;
+			type = nextType;
+			const primitive = value;
+			if (!values.includes(primitive)) values.push(primitive);
+		}
+		return type ? {
+			type,
+			values
+		} : null;
+	}
+	if (node.type === "BinaryExpression") {
+		const leftNode = childNode(node, "left");
+		const rightNode = childNode(node, "right");
+		if (!leftNode || !rightNode) return null;
+		const left = evaluateDynamicNode(resolver, id, leftNode, state);
+		const right = evaluateDynamicNode(resolver, id, rightNode, state);
+		if (node.operator === "+") {
+			return left?.type === "number" && right?.type === "number" ? { type: "number" } : null;
+		}
+		if (node.operator === "-" || node.operator === "*" || node.operator === "/" || node.operator === "%" || node.operator === "**") {
+			if (left?.type === "number" || right?.type === "number") {
+				return { type: "number" };
+			}
+		}
+	}
+	if (node.type === "TemplateLiteral") {
+		const quasis = childNodes(node, "quasis");
+		const expressions = childNodes(node, "expressions");
+		let values = [""];
+		for (let position = 0; position < quasis.length; position++) {
+			const text = quasiText(quasis[position]);
+			values = values.map((value) => value + text);
+			const expression = expressions[position];
+			if (!expression) continue;
+			const part = evaluateDynamicNode(resolver, id, expression, state);
+			if (!part?.values) return null;
+			const next = [];
+			for (const value of values) {
+				for (const primitive of part.values) {
+					const joined = value + String(primitive);
+					if (!next.includes(joined)) next.push(joined);
+				}
+			}
+			if (next.length > 32) return null;
+			values = next;
+		}
+		return {
+			type: "string",
+			values
+		};
+	}
+	return null;
+}
+function collectLeaves(node) {
+	if (node.kind === "leaf") return [node];
+	return [...collectLeaves(node.whenTrue), ...collectLeaves(node.whenFalse)];
+}
+function collectBranchDependencies(node) {
+	if (node.kind === "leaf") return node.dependencies;
+	return [.../* @__PURE__ */ new Set([...collectBranchDependencies(node.whenTrue), ...collectBranchDependencies(node.whenFalse)])].sort();
+}
+function evaluateBranchChild(resolver, id, node, depth, state, sourceId) {
+	const leafState = {
+		activeDefinitions: new Set(state.activeDefinitions),
+		dependencies: new Set(state.dependencies)
+	};
+	const leafRes = evaluateNode(resolver, id, node, leafState);
+	if (leafRes.ok) {
+		return {
+			kind: "leaf",
+			value: leafRes.value,
+			dependencies: [...leafState.dependencies].sort()
+		};
+	}
+	return evaluateBranchesNode(resolver, id, node, depth + 1, leafState, sourceId);
+}
+function evaluateBranchesNode(resolver, id, input, depth, state, sourceId) {
+	const node = unwrapExpression(input);
+	if (!isAstNode(node)) return null;
+	if (node.type === "Identifier") {
+		if (!identifierName(node)) return null;
+		const definition = resolver.resolveReference(expressionReference(id, node));
+		if (!definition || !definition.constant || !definition.initializer) return null;
+		const initializer = resolver.expressionNode(definition.initializer);
+		if (!initializer) return null;
+		const key = `${definition.id}:${definition.span.start}`;
+		if (state.activeDefinitions.has(key)) return null;
+		state.activeDefinitions.add(key);
+		state.dependencies.add(definition.id);
+		try {
+			return evaluateBranchesNode(resolver, definition.id, initializer, depth, state, sourceId);
+		} finally {
+			state.activeDefinitions.delete(key);
+		}
+	}
+	if (depth >= 3) return null;
+	if (node.type === "ConditionalExpression") {
+		const testNode = childNode(node, "test");
+		const consequent = childNode(node, "consequent");
+		const alternate = childNode(node, "alternate");
+		if (!testNode || !consequent || !alternate) return null;
+		const test = spanOf(id, testNode);
+		if (test.id !== sourceId) return null;
+		const whenTrue = evaluateBranchChild(resolver, id, consequent, depth, state, sourceId);
+		if (!whenTrue) return null;
+		const whenFalse = evaluateBranchChild(resolver, id, alternate, depth, state, sourceId);
+		if (!whenFalse) return null;
+		return {
+			kind: "branch",
+			test,
+			whenTrue,
+			whenFalse
+		};
+	}
+	if (node.type === "TemplateLiteral") {
+		return templateBranchesNode(resolver, id, childNodes(node, "quasis"), childNodes(node, "expressions"), 0, "", depth, state, sourceId);
+	}
+	if (node.type === "LogicalExpression") {
+		const left = childNode(node, "left");
+		const right = childNode(node, "right");
+		if (!left || !right) return null;
+		if (node.operator === "&&") {
+			const test = spanOf(id, left);
+			if (test.id !== sourceId) return null;
+			const whenTrue = evaluateBranchChild(resolver, id, right, depth, state, sourceId);
+			if (!whenTrue) return null;
+			const whenFalse = {
+				kind: "leaf",
+				value: void 0,
+				dependencies: [...state.dependencies].sort()
+			};
+			return {
+				kind: "branch",
+				test,
+				whenTrue,
+				whenFalse
+			};
+		}
+		if (node.operator === "||" || node.operator === "??") {
+			const test = spanOf(id, left);
+			if (test.id !== sourceId) return null;
+			const leftState = {
+				activeDefinitions: new Set(state.activeDefinitions),
+				dependencies: new Set(state.dependencies)
+			};
+			const leftRes = evaluateNode(resolver, id, left, leftState);
+			if (!leftRes.ok) return null;
+			const whenTrue = {
+				kind: "leaf",
+				value: leftRes.value,
+				dependencies: [...leftState.dependencies].sort()
+			};
+			const whenFalse = evaluateBranchChild(resolver, id, right, depth, state, sourceId);
+			if (!whenFalse) return null;
+			return {
+				kind: "branch",
+				test,
+				whenTrue,
+				whenFalse
+			};
+		}
+	}
+	return null;
+}
+function mapBranchLeaves(node, map) {
+	if (node.kind === "leaf") return map(node);
+	const whenTrue = mapBranchLeaves(node.whenTrue, map);
+	if (!whenTrue) return null;
+	const whenFalse = mapBranchLeaves(node.whenFalse, map);
+	if (!whenFalse) return null;
+	return {
+		kind: "branch",
+		test: node.test,
+		whenTrue,
+		whenFalse
+	};
+}
+function templateBranchesNode(resolver, id, quasis, expressions, index, prefix, depth, state, sourceId) {
+	let text = prefix;
+	for (let position = index; position < quasis.length; position++) {
+		text += quasiText(quasis[position]);
+		const expression = expressions[position];
+		if (!expression) continue;
+		const exact = evaluateNode(resolver, id, expression, state);
+		if (exact.ok) {
+			const interpolated = templateInterpolation(exact.value);
+			if (interpolated === null) return null;
+			text += interpolated;
+			continue;
+		}
+		const tree = evaluateBranchesNode(resolver, id, expression, depth + 1, state, sourceId);
+		if (!tree) return null;
+		return mapBranchLeaves(tree, (leaf) => {
+			if (leaf.value === void 0) return null;
+			const interpolated = templateInterpolation(leaf.value);
+			if (interpolated === null) return null;
+			return templateBranchesNode(resolver, id, quasis, expressions, position + 1, text + interpolated, depth + 1, state, sourceId);
+		});
+	}
+	return {
+		kind: "leaf",
+		value: text,
+		dependencies: [...state.dependencies].sort()
+	};
+}
+function templateInterpolation(value) {
+	if (value === null) return "null";
+	if (typeof value === "string" || typeof value === "number" || typeof value === "boolean") {
+		return String(value);
+	}
+	return null;
+}
+function evaluateBranches(resolver, reference) {
+	const node = resolver.expressionNode(reference);
+	if (!node) return null;
+	const state = {
+		activeDefinitions: /* @__PURE__ */ new Set(),
+		dependencies: /* @__PURE__ */ new Set()
+	};
+	const tree = evaluateBranchesNode(resolver, reference.id, node, 0, state, reference.id);
+	return tree?.kind === "branch" ? tree : null;
+}
+function evaluateExpression(resolver, reference) {
+	const node = resolver.expressionNode(reference);
+	if (!node) {
+		return {
+			ok: false,
+			bailout: linkedBailout("linked/missing-initializer", reference, "Expression is outside the linked project graph", reference.id)
+		};
+	}
+	const state = {
+		activeDefinitions: /* @__PURE__ */ new Set(),
+		dependencies: /* @__PURE__ */ new Set()
+	};
+	const result = evaluateNode(resolver, reference.id, node, state);
+	return result.ok ? {
+		ok: true,
+		value: result.value,
+		dependencies: [...state.dependencies].sort()
+	} : result;
+}
+function evaluateDynamicExpression(resolver, reference) {
+	const node = resolver.expressionNode(reference);
+	if (!node) return null;
+	const state = {
+		activeDefinitions: /* @__PURE__ */ new Set(),
+		dependencies: /* @__PURE__ */ new Set()
+	};
+	const result = evaluateDynamicNode(resolver, reference.id, node, state);
+	return result ? {
+		...result,
+		dependencies: [...state.dependencies].sort()
+	} : null;
+}
+function evaluateBinding(resolver, id, localName) {
+	const definition = resolver.resolveBinding(id, localName);
+	if (!definition) {
+		const emptySpan = {
+			id,
+			start: 0,
+			end: 0
+		};
+		return {
+			ok: false,
+			bailout: linkedBailout("linked/unresolved-binding", emptySpan, `Binding ${localName} has no host-linked definition`)
+		};
+	}
+	if (!definition.initializer) {
+		return {
+			ok: false,
+			bailout: linkedBailout("linked/missing-initializer", definition.span, `Binding ${localName} has no static initializer`, definition.id)
+		};
+	}
+	return evaluateExpression(resolver, expressionReference(definition.id, definition.initializer));
+}
+
+export { collectBranchDependencies, collectLeaves, evaluateBinding, evaluateBranches, evaluateDynamicExpression, evaluateExpression };
+//# sourceMappingURL=evaluate.mjs.map

package/dist/esm/evaluate.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"evaluate.js","names":[],"sources":["esm/evaluate.js"],"sourcesContent":["import { childNode, childNodes, identifierName, isAstNode, unwrapExpression } from \"./ast\";\nimport { expressionReference, spanOf } from \"./contracts\";\nimport { linkedBailout, localBailout } from \"./diagnostics\";\nfunction success(value) {\n  return { ok: true, value };\n}\nfunction literal(node) {\n  if (node.type === \"NullLiteral\") return null;\n  if (node.type === \"Literal\" || node.type.endsWith(\"Literal\")) {\n    const value = node.value;\n    if (typeof value === \"string\" || typeof value === \"number\" || typeof value === \"boolean\" || value === null) {\n      return value;\n    }\n  }\n  return void 0;\n}\nfunction unsupported(id, node, detail = `Expression ${node.type} is not statically supported`) {\n  return {\n    ok: false,\n    bailout: localBailout(\"local/unsupported-expression\", spanOf(id, node), detail)\n  };\n}\nfunction evaluateDefinition(resolver, definition, useSpan, state) {\n  const key = `${definition.id}:${definition.span.start}`;\n  if (state.activeDefinitions.has(key)) {\n    return {\n      ok: false,\n      bailout: localBailout(\n        \"local/static-evaluation-cycle\",\n        useSpan,\n        `Static evaluation cycle reached ${definition.name}`\n      )\n    };\n  }\n  if (!definition.initializer) {\n    return {\n      ok: false,\n      bailout: linkedBailout(\n        \"linked/missing-initializer\",\n        useSpan,\n        `Binding ${definition.name} has no static initializer`,\n        definition.id\n      )\n    };\n  }\n  if (!definition.constant) {\n    return {\n      ok: false,\n      bailout: linkedBailout(\n        \"linked/unresolved-binding\",\n        useSpan,\n        `Binding ${definition.name} is mutable and cannot be statically evaluated`,\n        definition.id\n      )\n    };\n  }\n  const initializer = resolver.expressionNode(definition.initializer);\n  if (!initializer) {\n    return {\n      ok: false,\n      bailout: linkedBailout(\n        \"linked/missing-initializer\",\n        useSpan,\n        `Binding ${definition.name} initializer is outside the linked graph`,\n        definition.id\n      )\n    };\n  }\n  state.dependencies.add(definition.id);\n  state.activeDefinitions.add(key);\n  try {\n    return evaluateNode(resolver, definition.id, initializer, state);\n  } finally {\n    state.activeDefinitions.delete(key);\n  }\n}\nfunction evaluateObject(resolver, id, node, state) {\n  const output = {};\n  for (const property of childNodes(node, \"properties\")) {\n    if (property.type === \"SpreadElement\") {\n      const argument = childNode(property, \"argument\");\n      if (!argument) return unsupported(id, property);\n      const spread = evaluateNode(resolver, id, argument, state);\n      if (!spread.ok) return spread;\n      if (!spread.value || typeof spread.value !== \"object\" || Array.isArray(spread.value)) {\n        return {\n          ok: false,\n          bailout: localBailout(\n            \"local/non-object-spread\",\n            spanOf(id, property),\n            \"Static object spread did not evaluate to an object\"\n          )\n        };\n      }\n      Object.assign(output, spread.value);\n      continue;\n    }\n    if (property.type !== \"Property\" && property.type !== \"ObjectProperty\") {\n      return unsupported(id, property);\n    }\n    const keyNode = childNode(property, \"key\");\n    const valueNode = childNode(property, \"value\");\n    if (!keyNode || !valueNode) return unsupported(id, property);\n    let key = identifierName(keyNode) ?? void 0;\n    if (property.computed === true || key === void 0) {\n      const evaluatedKey = evaluateNode(resolver, id, keyNode, state);\n      if (!evaluatedKey.ok) return evaluatedKey;\n      key = evaluatedKey.value;\n    }\n    if (typeof key !== \"string\" && typeof key !== \"number\") {\n      return unsupported(id, keyNode, \"Static object key is not a string or number\");\n    }\n    const value = evaluateNode(resolver, id, valueNode, state);\n    if (!value.ok) return value;\n    output[String(key)] = value.value;\n  }\n  return success(output);\n}\nfunction evaluateArray(resolver, id, node, state) {\n  const output = [];\n  const rawElements = node.elements;\n  if (!Array.isArray(rawElements) || rawElements.some((element) => element === null || !isAstNode(element))) {\n    return unsupported(id, node, \"Sparse arrays are not statically supported\");\n  }\n  for (const element of rawElements.filter(isAstNode)) {\n    if (element.type === \"SpreadElement\") {\n      const argument = childNode(element, \"argument\");\n      if (!argument) return unsupported(id, element);\n      const spread = evaluateNode(resolver, id, argument, state);\n      if (!spread.ok) return spread;\n      if (!Array.isArray(spread.value)) {\n        return unsupported(\n          id,\n          element,\n          \"Static array spread did not evaluate to an array\"\n        );\n      }\n      output.push(...spread.value);\n      continue;\n    }\n    const value = evaluateNode(resolver, id, element, state);\n    if (!value.ok) return value;\n    output.push(value.value);\n  }\n  return success(output);\n}\nfunction evaluateNode(resolver, id, input, state) {\n  const node = unwrapExpression(input);\n  const literalValue = literal(node);\n  if (literalValue !== void 0) return success(literalValue);\n  switch (node.type) {\n    case \"Identifier\": {\n      const name = identifierName(node);\n      if (!name) return unsupported(id, node);\n      const definition = resolver.resolveReference(expressionReference(id, node));\n      if (!definition) {\n        return {\n          ok: false,\n          bailout: linkedBailout(\n            \"linked/unresolved-binding\",\n            spanOf(id, node),\n            `Binding ${name} has no host-linked definition`\n          )\n        };\n      }\n      return evaluateDefinition(resolver, definition, spanOf(id, node), state);\n    }\n    case \"ObjectExpression\":\n      return evaluateObject(resolver, id, node, state);\n    case \"ArrayExpression\":\n      return evaluateArray(resolver, id, node, state);\n    case \"MemberExpression\": {\n      const objectNode = childNode(node, \"object\");\n      const propertyNode = childNode(node, \"property\");\n      if (!objectNode || !propertyNode) return unsupported(id, node);\n      const object = evaluateNode(resolver, id, objectNode, state);\n      if (!object.ok) return object;\n      let property = identifierName(propertyNode);\n      if (node.computed === true || property === null) {\n        const evaluatedProperty = evaluateNode(resolver, id, propertyNode, state);\n        if (!evaluatedProperty.ok) return evaluatedProperty;\n        property = evaluatedProperty.value;\n      }\n      if ((typeof object.value !== \"object\" || object.value === null) && typeof object.value !== \"string\") {\n        return unsupported(id, node, \"Static member target is not indexable\");\n      }\n      if (typeof property !== \"string\" && typeof property !== \"number\") {\n        return unsupported(\n          id,\n          propertyNode,\n          \"Static member key is not a string or number\"\n        );\n      }\n      const value = object.value[String(property)];\n      return value === void 0 ? unsupported(id, node, `Static member ${String(property)} does not exist`) : success(value);\n    }\n    case \"UnaryExpression\": {\n      const argument = childNode(node, \"argument\");\n      if (!argument) return unsupported(id, node);\n      const value = evaluateNode(resolver, id, argument, state);\n      if (!value.ok) return value;\n      if (node.operator === \"-\" && typeof value.value === \"number\") {\n        return success(-value.value);\n      }\n      if (node.operator === \"+\" && typeof value.value === \"number\") {\n        return success(value.value);\n      }\n      if (node.operator === \"!\") return success(!value.value);\n      return unsupported(\n        id,\n        node,\n        `Unary operator ${String(node.operator)} is unsupported`\n      );\n    }\n    case \"BinaryExpression\":\n    case \"LogicalExpression\": {\n      const leftNode = childNode(node, \"left\");\n      const rightNode = childNode(node, \"right\");\n      if (!leftNode || !rightNode) return unsupported(id, node);\n      const left = evaluateNode(resolver, id, leftNode, state);\n      if (!left.ok) return left;\n      if (node.type === \"LogicalExpression\") {\n        if (node.operator === \"&&\" && !left.value) return left;\n        if (node.operator === \"||\" && left.value) return left;\n        if (node.operator === \"??\" && left.value !== null) return left;\n      }\n      const right = evaluateNode(resolver, id, rightNode, state);\n      if (!right.ok) return right;\n      switch (node.operator) {\n        case \"+\":\n          if (typeof left.value === \"number\" && typeof right.value === \"number\") {\n            return success(left.value + right.value);\n          }\n          if (typeof left.value === \"string\" || typeof right.value === \"string\") {\n            return success(String(left.value) + String(right.value));\n          }\n          break;\n        case \"-\":\n          if (typeof left.value === \"number\" && typeof right.value === \"number\") {\n            return success(left.value - right.value);\n          }\n          break;\n        case \"*\":\n          if (typeof left.value === \"number\" && typeof right.value === \"number\") {\n            return success(left.value * right.value);\n          }\n          break;\n        case \"/\":\n          if (typeof left.value === \"number\" && typeof right.value === \"number\") {\n            return success(left.value / right.value);\n          }\n          break;\n        case \"&&\":\n        case \"||\":\n        case \"??\":\n          return right;\n      }\n      return unsupported(\n        id,\n        node,\n        `Binary operator ${String(node.operator)} is unsupported`\n      );\n    }\n    case \"ConditionalExpression\": {\n      const testNode = childNode(node, \"test\");\n      const consequent = childNode(node, \"consequent\");\n      const alternate = childNode(node, \"alternate\");\n      if (!testNode || !consequent || !alternate) return unsupported(id, node);\n      const test = evaluateNode(resolver, id, testNode, state);\n      if (!test.ok) return test;\n      return evaluateNode(resolver, id, test.value ? consequent : alternate, state);\n    }\n    case \"TemplateLiteral\": {\n      const quasis = childNodes(node, \"quasis\");\n      const expressions = childNodes(node, \"expressions\");\n      let output = \"\";\n      for (let index = 0; index < quasis.length; index++) {\n        output += quasiText(quasis[index]);\n        const expression = expressions[index];\n        if (expression) {\n          const value = evaluateNode(resolver, id, expression, state);\n          if (!value.ok) return value;\n          output += String(value.value);\n        }\n      }\n      return success(output);\n    }\n    default:\n      return unsupported(id, node);\n  }\n}\nfunction quasiText(quasi) {\n  const cooked = quasi?.value?.cooked;\n  const raw = quasi?.value?.raw;\n  return typeof cooked === \"string\" ? cooked : typeof raw === \"string\" ? raw : \"\";\n}\nfunction dynamicPrimitive(value) {\n  if (value === null) return \"null\";\n  if (typeof value === \"number\") return \"number\";\n  if (typeof value === \"string\") return \"string\";\n  if (typeof value === \"boolean\") return \"boolean\";\n  return null;\n}\nfunction evaluateDynamicNode(resolver, id, input, state) {\n  const exact = evaluateNode(resolver, id, input, state);\n  if (exact.ok) {\n    const type = dynamicPrimitive(exact.value);\n    return type ? { type, values: [exact.value] } : null;\n  }\n  const node = unwrapExpression(input);\n  if (node.type === \"Identifier\") {\n    if (!identifierName(node)) return null;\n    const definition = resolver.resolveReference(expressionReference(id, node));\n    if (!definition?.constant || !definition.initializer) return null;\n    const key = `${definition.id}:${definition.span.start}`;\n    if (state.activeDefinitions.has(key)) return null;\n    const initializer = resolver.expressionNode(definition.initializer);\n    if (!initializer) return null;\n    state.dependencies.add(definition.id);\n    state.activeDefinitions.add(key);\n    try {\n      return evaluateDynamicNode(resolver, definition.id, initializer, state);\n    } finally {\n      state.activeDefinitions.delete(key);\n    }\n  }\n  if (node.type === \"MemberExpression\") {\n    const objectNode = childNode(node, \"object\");\n    const propertyNode = childNode(node, \"property\");\n    if (!objectNode || !propertyNode) return null;\n    const object = evaluateNode(resolver, id, objectNode, state);\n    if (!object.ok || !Array.isArray(object.value)) return null;\n    const property = evaluateDynamicNode(resolver, id, propertyNode, state);\n    if (property?.type !== \"number\" || object.value.length > 32) return null;\n    const values = [];\n    let type = null;\n    for (const value of object.value) {\n      const nextType = dynamicPrimitive(value);\n      if (!nextType || type && type !== nextType) return null;\n      type = nextType;\n      const primitive = value;\n      if (!values.includes(primitive)) values.push(primitive);\n    }\n    return type ? { type, values } : null;\n  }\n  if (node.type === \"BinaryExpression\") {\n    const leftNode = childNode(node, \"left\");\n    const rightNode = childNode(node, \"right\");\n    if (!leftNode || !rightNode) return null;\n    const left = evaluateDynamicNode(resolver, id, leftNode, state);\n    const right = evaluateDynamicNode(resolver, id, rightNode, state);\n    if (node.operator === \"+\") {\n      return left?.type === \"number\" && right?.type === \"number\" ? { type: \"number\" } : null;\n    }\n    if (node.operator === \"-\" || node.operator === \"*\" || node.operator === \"/\" || node.operator === \"%\" || node.operator === \"**\") {\n      if (left?.type === \"number\" || right?.type === \"number\") {\n        return { type: \"number\" };\n      }\n    }\n  }\n  if (node.type === \"TemplateLiteral\") {\n    const quasis = childNodes(node, \"quasis\");\n    const expressions = childNodes(node, \"expressions\");\n    let values = [\"\"];\n    for (let position = 0; position < quasis.length; position++) {\n      const text = quasiText(quasis[position]);\n      values = values.map((value) => value + text);\n      const expression = expressions[position];\n      if (!expression) continue;\n      const part = evaluateDynamicNode(resolver, id, expression, state);\n      if (!part?.values) return null;\n      const next = [];\n      for (const value of values) {\n        for (const primitive of part.values) {\n          const joined = value + String(primitive);\n          if (!next.includes(joined)) next.push(joined);\n        }\n      }\n      if (next.length > 32) return null;\n      values = next;\n    }\n    return { type: \"string\", values };\n  }\n  return null;\n}\nfunction collectLeaves(node) {\n  if (node.kind === \"leaf\") return [node];\n  return [...collectLeaves(node.whenTrue), ...collectLeaves(node.whenFalse)];\n}\nfunction collectBranchDependencies(node) {\n  if (node.kind === \"leaf\") return node.dependencies;\n  return [\n    .../* @__PURE__ */ new Set([\n      ...collectBranchDependencies(node.whenTrue),\n      ...collectBranchDependencies(node.whenFalse)\n    ])\n  ].sort();\n}\nfunction evaluateBranchChild(resolver, id, node, depth, state, sourceId) {\n  const leafState = {\n    activeDefinitions: new Set(state.activeDefinitions),\n    dependencies: new Set(state.dependencies)\n  };\n  const leafRes = evaluateNode(resolver, id, node, leafState);\n  if (leafRes.ok) {\n    return {\n      kind: \"leaf\",\n      value: leafRes.value,\n      dependencies: [...leafState.dependencies].sort()\n    };\n  }\n  return evaluateBranchesNode(resolver, id, node, depth + 1, leafState, sourceId);\n}\nfunction evaluateBranchesNode(resolver, id, input, depth, state, sourceId) {\n  const node = unwrapExpression(input);\n  if (!isAstNode(node)) return null;\n  if (node.type === \"Identifier\") {\n    if (!identifierName(node)) return null;\n    const definition = resolver.resolveReference(expressionReference(id, node));\n    if (!definition || !definition.constant || !definition.initializer) return null;\n    const initializer = resolver.expressionNode(definition.initializer);\n    if (!initializer) return null;\n    const key = `${definition.id}:${definition.span.start}`;\n    if (state.activeDefinitions.has(key)) return null;\n    state.activeDefinitions.add(key);\n    state.dependencies.add(definition.id);\n    try {\n      return evaluateBranchesNode(\n        resolver,\n        definition.id,\n        initializer,\n        depth,\n        state,\n        sourceId\n      );\n    } finally {\n      state.activeDefinitions.delete(key);\n    }\n  }\n  if (depth >= 3) return null;\n  if (node.type === \"ConditionalExpression\") {\n    const testNode = childNode(node, \"test\");\n    const consequent = childNode(node, \"consequent\");\n    const alternate = childNode(node, \"alternate\");\n    if (!testNode || !consequent || !alternate) return null;\n    const test = spanOf(id, testNode);\n    if (test.id !== sourceId) return null;\n    const whenTrue = evaluateBranchChild(resolver, id, consequent, depth, state, sourceId);\n    if (!whenTrue) return null;\n    const whenFalse = evaluateBranchChild(resolver, id, alternate, depth, state, sourceId);\n    if (!whenFalse) return null;\n    return {\n      kind: \"branch\",\n      test,\n      whenTrue,\n      whenFalse\n    };\n  }\n  if (node.type === \"TemplateLiteral\") {\n    return templateBranchesNode(\n      resolver,\n      id,\n      childNodes(node, \"quasis\"),\n      childNodes(node, \"expressions\"),\n      0,\n      \"\",\n      depth,\n      state,\n      sourceId\n    );\n  }\n  if (node.type === \"LogicalExpression\") {\n    const left = childNode(node, \"left\");\n    const right = childNode(node, \"right\");\n    if (!left || !right) return null;\n    if (node.operator === \"&&\") {\n      const test = spanOf(id, left);\n      if (test.id !== sourceId) return null;\n      const whenTrue = evaluateBranchChild(resolver, id, right, depth, state, sourceId);\n      if (!whenTrue) return null;\n      const whenFalse = {\n        kind: \"leaf\",\n        value: void 0,\n        dependencies: [...state.dependencies].sort()\n      };\n      return {\n        kind: \"branch\",\n        test,\n        whenTrue,\n        whenFalse\n      };\n    }\n    if (node.operator === \"||\" || node.operator === \"??\") {\n      const test = spanOf(id, left);\n      if (test.id !== sourceId) return null;\n      const leftState = {\n        activeDefinitions: new Set(state.activeDefinitions),\n        dependencies: new Set(state.dependencies)\n      };\n      const leftRes = evaluateNode(resolver, id, left, leftState);\n      if (!leftRes.ok) return null;\n      const whenTrue = {\n        kind: \"leaf\",\n        value: leftRes.value,\n        dependencies: [...leftState.dependencies].sort()\n      };\n      const whenFalse = evaluateBranchChild(resolver, id, right, depth, state, sourceId);\n      if (!whenFalse) return null;\n      return {\n        kind: \"branch\",\n        test,\n        whenTrue,\n        whenFalse\n      };\n    }\n  }\n  return null;\n}\nfunction mapBranchLeaves(node, map) {\n  if (node.kind === \"leaf\") return map(node);\n  const whenTrue = mapBranchLeaves(node.whenTrue, map);\n  if (!whenTrue) return null;\n  const whenFalse = mapBranchLeaves(node.whenFalse, map);\n  if (!whenFalse) return null;\n  return { kind: \"branch\", test: node.test, whenTrue, whenFalse };\n}\nfunction templateBranchesNode(resolver, id, quasis, expressions, index, prefix, depth, state, sourceId) {\n  let text = prefix;\n  for (let position = index; position < quasis.length; position++) {\n    text += quasiText(quasis[position]);\n    const expression = expressions[position];\n    if (!expression) continue;\n    const exact = evaluateNode(resolver, id, expression, state);\n    if (exact.ok) {\n      const interpolated = templateInterpolation(exact.value);\n      if (interpolated === null) return null;\n      text += interpolated;\n      continue;\n    }\n    const tree = evaluateBranchesNode(\n      resolver,\n      id,\n      expression,\n      depth + 1,\n      state,\n      sourceId\n    );\n    if (!tree) return null;\n    return mapBranchLeaves(tree, (leaf) => {\n      if (leaf.value === void 0) return null;\n      const interpolated = templateInterpolation(leaf.value);\n      if (interpolated === null) return null;\n      return templateBranchesNode(\n        resolver,\n        id,\n        quasis,\n        expressions,\n        position + 1,\n        text + interpolated,\n        depth + 1,\n        state,\n        sourceId\n      );\n    });\n  }\n  return { kind: \"leaf\", value: text, dependencies: [...state.dependencies].sort() };\n}\nfunction templateInterpolation(value) {\n  if (value === null) return \"null\";\n  if (typeof value === \"string\" || typeof value === \"number\" || typeof value === \"boolean\") {\n    return String(value);\n  }\n  return null;\n}\nfunction evaluateBranches(resolver, reference) {\n  const node = resolver.expressionNode(reference);\n  if (!node) return null;\n  const state = {\n    activeDefinitions: /* @__PURE__ */ new Set(),\n    dependencies: /* @__PURE__ */ new Set()\n  };\n  const tree = evaluateBranchesNode(resolver, reference.id, node, 0, state, reference.id);\n  return tree?.kind === \"branch\" ? tree : null;\n}\nfunction evaluateExpression(resolver, reference) {\n  const node = resolver.expressionNode(reference);\n  if (!node) {\n    return {\n      ok: false,\n      bailout: linkedBailout(\n        \"linked/missing-initializer\",\n        reference,\n        \"Expression is outside the linked project graph\",\n        reference.id\n      )\n    };\n  }\n  const state = {\n    activeDefinitions: /* @__PURE__ */ new Set(),\n    dependencies: /* @__PURE__ */ new Set()\n  };\n  const result = evaluateNode(resolver, reference.id, node, state);\n  return result.ok ? {\n    ok: true,\n    value: result.value,\n    dependencies: [...state.dependencies].sort()\n  } : result;\n}\nfunction evaluateDynamicExpression(resolver, reference) {\n  const node = resolver.expressionNode(reference);\n  if (!node) return null;\n  const state = {\n    activeDefinitions: /* @__PURE__ */ new Set(),\n    dependencies: /* @__PURE__ */ new Set()\n  };\n  const result = evaluateDynamicNode(resolver, reference.id, node, state);\n  return result ? { ...result, dependencies: [...state.dependencies].sort() } : null;\n}\nfunction evaluateBinding(resolver, id, localName) {\n  const definition = resolver.resolveBinding(id, localName);\n  if (!definition) {\n    const emptySpan = { id, start: 0, end: 0 };\n    return {\n      ok: false,\n      bailout: linkedBailout(\n        \"linked/unresolved-binding\",\n        emptySpan,\n        `Binding ${localName} has no host-linked definition`\n      )\n    };\n  }\n  if (!definition.initializer) {\n    return {\n      ok: false,\n      bailout: linkedBailout(\n        \"linked/missing-initializer\",\n        definition.span,\n        `Binding ${localName} has no static initializer`,\n        definition.id\n      )\n    };\n  }\n  return evaluateExpression(\n    resolver,\n    expressionReference(definition.id, definition.initializer)\n  );\n}\nexport {\n  collectBranchDependencies,\n  collectLeaves,\n  evaluateBinding,\n  evaluateBranches,\n  evaluateDynamicExpression,\n  evaluateExpression\n};\n//# sourceMappingURL=evaluate.js.map\n"],"mappings":";;;;;AAGA,SAAS,QAAQ,OAAO;CACtB,OAAO;EAAE,IAAI;EAAM;CAAM;AAC3B;AACA,SAAS,QAAQ,MAAM;CACrB,IAAI,KAAK,SAAS,eAAe,OAAO;CACxC,IAAI,KAAK,SAAS,aAAa,KAAK,KAAK,SAAS,SAAS,GAAG;EAC5D,MAAM,QAAQ,KAAK;EACnB,IAAI,OAAO,UAAU,YAAY,OAAO,UAAU,YAAY,OAAO,UAAU,aAAa,UAAU,MAAM;GAC1G,OAAO;EACT;CACF;CACA,OAAO,KAAK;AACd;AACA,SAAS,YAAY,IAAI,MAAM,SAAS,cAAc,KAAK,KAAK,+BAA+B;CAC7F,OAAO;EACL,IAAI;EACJ,SAAS,aAAa,gCAAgC,OAAO,IAAI,IAAI,GAAG,MAAM;CAChF;AACF;AACA,SAAS,mBAAmB,UAAU,YAAY,SAAS,OAAO;CAChE,MAAM,MAAM,GAAG,WAAW,GAAG,GAAG,WAAW,KAAK;CAChD,IAAI,MAAM,kBAAkB,IAAI,GAAG,GAAG;EACpC,OAAO;GACL,IAAI;GACJ,SAAS,aACP,iCACA,SACA,mCAAmC,WAAW,MAChD;EACF;CACF;CACA,IAAI,CAAC,WAAW,aAAa;EAC3B,OAAO;GACL,IAAI;GACJ,SAAS,cACP,8BACA,SACA,WAAW,WAAW,KAAK,6BAC3B,WAAW,EACb;EACF;CACF;CACA,IAAI,CAAC,WAAW,UAAU;EACxB,OAAO;GACL,IAAI;GACJ,SAAS,cACP,6BACA,SACA,WAAW,WAAW,KAAK,iDAC3B,WAAW,EACb;EACF;CACF;CACA,MAAM,cAAc,SAAS,eAAe,WAAW,WAAW;CAClE,IAAI,CAAC,aAAa;EAChB,OAAO;GACL,IAAI;GACJ,SAAS,cACP,8BACA,SACA,WAAW,WAAW,KAAK,2CAC3B,WAAW,EACb;EACF;CACF;CACA,MAAM,aAAa,IAAI,WAAW,EAAE;CACpC,MAAM,kBAAkB,IAAI,GAAG;CAC/B,IAAI;EACF,OAAO,aAAa,UAAU,WAAW,IAAI,aAAa,KAAK;CACjE,UAAU;EACR,MAAM,kBAAkB,OAAO,GAAG;CACpC;AACF;AACA,SAAS,eAAe,UAAU,IAAI,MAAM,OAAO;CACjD,MAAM,SAAS,CAAC;CAChB,KAAK,MAAM,YAAY,WAAW,MAAM,YAAY,GAAG;EACrD,IAAI,SAAS,SAAS,iBAAiB;GACrC,MAAM,WAAW,UAAU,UAAU,UAAU;GAC/C,IAAI,CAAC,UAAU,OAAO,YAAY,IAAI,QAAQ;GAC9C,MAAM,SAAS,aAAa,UAAU,IAAI,UAAU,KAAK;GACzD,IAAI,CAAC,OAAO,IAAI,OAAO;GACvB,IAAI,CAAC,OAAO,SAAS,OAAO,OAAO,UAAU,YAAY,MAAM,QAAQ,OAAO,KAAK,GAAG;IACpF,OAAO;KACL,IAAI;KACJ,SAAS,aACP,2BACA,OAAO,IAAI,QAAQ,GACnB,oDACF;IACF;GACF;GACA,OAAO,OAAO,QAAQ,OAAO,KAAK;GAClC;EACF;EACA,IAAI,SAAS,SAAS,cAAc,SAAS,SAAS,kBAAkB;GACtE,OAAO,YAAY,IAAI,QAAQ;EACjC;EACA,MAAM,UAAU,UAAU,UAAU,KAAK;EACzC,MAAM,YAAY,UAAU,UAAU,OAAO;EAC7C,IAAI,CAAC,WAAW,CAAC,WAAW,OAAO,YAAY,IAAI,QAAQ;EAC3D,IAAI,MAAM,eAAe,OAAO,KAAK,KAAK;EAC1C,IAAI,SAAS,aAAa,QAAQ,QAAQ,KAAK,GAAG;GAChD,MAAM,eAAe,aAAa,UAAU,IAAI,SAAS,KAAK;GAC9D,IAAI,CAAC,aAAa,IAAI,OAAO;GAC7B,MAAM,aAAa;EACrB;EACA,IAAI,OAAO,QAAQ,YAAY,OAAO,QAAQ,UAAU;GACtD,OAAO,YAAY,IAAI,SAAS,6CAA6C;EAC/E;EACA,MAAM,QAAQ,aAAa,UAAU,IAAI,WAAW,KAAK;EACzD,IAAI,CAAC,MAAM,IAAI,OAAO;EACtB,OAAO,OAAO,GAAG,KAAK,MAAM;CAC9B;CACA,OAAO,QAAQ,MAAM;AACvB;AACA,SAAS,cAAc,UAAU,IAAI,MAAM,OAAO;CAChD,MAAM,SAAS,CAAC;CAChB,MAAM,cAAc,KAAK;CACzB,IAAI,CAAC,MAAM,QAAQ,WAAW,KAAK,YAAY,MAAM,YAAY,YAAY,QAAQ,CAAC,UAAU,OAAO,CAAC,GAAG;EACzG,OAAO,YAAY,IAAI,MAAM,4CAA4C;CAC3E;CACA,KAAK,MAAM,WAAW,YAAY,OAAO,SAAS,GAAG;EACnD,IAAI,QAAQ,SAAS,iBAAiB;GACpC,MAAM,WAAW,UAAU,SAAS,UAAU;GAC9C,IAAI,CAAC,UAAU,OAAO,YAAY,IAAI,OAAO;GAC7C,MAAM,SAAS,aAAa,UAAU,IAAI,UAAU,KAAK;GACzD,IAAI,CAAC,OAAO,IAAI,OAAO;GACvB,IAAI,CAAC,MAAM,QAAQ,OAAO,KAAK,GAAG;IAChC,OAAO,YACL,IACA,SACA,kDACF;GACF;GACA,OAAO,KAAK,GAAG,OAAO,KAAK;GAC3B;EACF;EACA,MAAM,QAAQ,aAAa,UAAU,IAAI,SAAS,KAAK;EACvD,IAAI,CAAC,MAAM,IAAI,OAAO;EACtB,OAAO,KAAK,MAAM,KAAK;CACzB;CACA,OAAO,QAAQ,MAAM;AACvB;AACA,SAAS,aAAa,UAAU,IAAI,OAAO,OAAO;CAChD,MAAM,OAAO,iBAAiB,KAAK;CACnC,MAAM,eAAe,QAAQ,IAAI;CACjC,IAAI,iBAAiB,KAAK,GAAG,OAAO,QAAQ,YAAY;CACxD,QAAQ,KAAK,MAAb;EACE,KAAK,cAAc;GACjB,MAAM,OAAO,eAAe,IAAI;GAChC,IAAI,CAAC,MAAM,OAAO,YAAY,IAAI,IAAI;GACtC,MAAM,aAAa,SAAS,iBAAiB,oBAAoB,IAAI,IAAI,CAAC;GAC1E,IAAI,CAAC,YAAY;IACf,OAAO;KACL,IAAI;KACJ,SAAS,cACP,6BACA,OAAO,IAAI,IAAI,GACf,WAAW,KAAK,+BAClB;IACF;GACF;GACA,OAAO,mBAAmB,UAAU,YAAY,OAAO,IAAI,IAAI,GAAG,KAAK;EACzE;EACA,KAAK,oBACH,OAAO,eAAe,UAAU,IAAI,MAAM,KAAK;EACjD,KAAK,mBACH,OAAO,cAAc,UAAU,IAAI,MAAM,KAAK;EAChD,KAAK,oBAAoB;GACvB,MAAM,aAAa,UAAU,MAAM,QAAQ;GAC3C,MAAM,eAAe,UAAU,MAAM,UAAU;GAC/C,IAAI,CAAC,cAAc,CAAC,cAAc,OAAO,YAAY,IAAI,IAAI;GAC7D,MAAM,SAAS,aAAa,UAAU,IAAI,YAAY,KAAK;GAC3D,IAAI,CAAC,OAAO,IAAI,OAAO;GACvB,IAAI,WAAW,eAAe,YAAY;GAC1C,IAAI,KAAK,aAAa,QAAQ,aAAa,MAAM;IAC/C,MAAM,oBAAoB,aAAa,UAAU,IAAI,cAAc,KAAK;IACxE,IAAI,CAAC,kBAAkB,IAAI,OAAO;IAClC,WAAW,kBAAkB;GAC/B;GACA,KAAK,OAAO,OAAO,UAAU,YAAY,OAAO,UAAU,SAAS,OAAO,OAAO,UAAU,UAAU;IACnG,OAAO,YAAY,IAAI,MAAM,uCAAuC;GACtE;GACA,IAAI,OAAO,aAAa,YAAY,OAAO,aAAa,UAAU;IAChE,OAAO,YACL,IACA,cACA,6CACF;GACF;GACA,MAAM,QAAQ,OAAO,MAAM,OAAO,QAAQ;GAC1C,OAAO,UAAU,KAAK,IAAI,YAAY,IAAI,MAAM,iBAAiB,OAAO,QAAQ,EAAE,gBAAgB,IAAI,QAAQ,KAAK;EACrH;EACA,KAAK,mBAAmB;GACtB,MAAM,WAAW,UAAU,MAAM,UAAU;GAC3C,IAAI,CAAC,UAAU,OAAO,YAAY,IAAI,IAAI;GAC1C,MAAM,QAAQ,aAAa,UAAU,IAAI,UAAU,KAAK;GACxD,IAAI,CAAC,MAAM,IAAI,OAAO;GACtB,IAAI,KAAK,aAAa,OAAO,OAAO,MAAM,UAAU,UAAU;IAC5D,OAAO,QAAQ,CAAC,MAAM,KAAK;GAC7B;GACA,IAAI,KAAK,aAAa,OAAO,OAAO,MAAM,UAAU,UAAU;IAC5D,OAAO,QAAQ,MAAM,KAAK;GAC5B;GACA,IAAI,KAAK,aAAa,KAAK,OAAO,QAAQ,CAAC,MAAM,KAAK;GACtD,OAAO,YACL,IACA,MACA,kBAAkB,OAAO,KAAK,QAAQ,EAAE,gBAC1C;EACF;EACA,KAAK;EACL,KAAK,qBAAqB;GACxB,MAAM,WAAW,UAAU,MAAM,MAAM;GACvC,MAAM,YAAY,UAAU,MAAM,OAAO;GACzC,IAAI,CAAC,YAAY,CAAC,WAAW,OAAO,YAAY,IAAI,IAAI;GACxD,MAAM,OAAO,aAAa,UAAU,IAAI,UAAU,KAAK;GACvD,IAAI,CAAC,KAAK,IAAI,OAAO;GACrB,IAAI,KAAK,SAAS,qBAAqB;IACrC,IAAI,KAAK,aAAa,QAAQ,CAAC,KAAK,OAAO,OAAO;IAClD,IAAI,KAAK,aAAa,QAAQ,KAAK,OAAO,OAAO;IACjD,IAAI,KAAK,aAAa,QAAQ,KAAK,UAAU,MAAM,OAAO;GAC5D;GACA,MAAM,QAAQ,aAAa,UAAU,IAAI,WAAW,KAAK;GACzD,IAAI,CAAC,MAAM,IAAI,OAAO;GACtB,QAAQ,KAAK,UAAb;IACE,KAAK;KACH,IAAI,OAAO,KAAK,UAAU,YAAY,OAAO,MAAM,UAAU,UAAU;MACrE,OAAO,QAAQ,KAAK,QAAQ,MAAM,KAAK;KACzC;KACA,IAAI,OAAO,KAAK,UAAU,YAAY,OAAO,MAAM,UAAU,UAAU;MACrE,OAAO,QAAQ,OAAO,KAAK,KAAK,IAAI,OAAO,MAAM,KAAK,CAAC;KACzD;KACA;IACF,KAAK;KACH,IAAI,OAAO,KAAK,UAAU,YAAY,OAAO,MAAM,UAAU,UAAU;MACrE,OAAO,QAAQ,KAAK,QAAQ,MAAM,KAAK;KACzC;KACA;IACF,KAAK;KACH,IAAI,OAAO,KAAK,UAAU,YAAY,OAAO,MAAM,UAAU,UAAU;MACrE,OAAO,QAAQ,KAAK,QAAQ,MAAM,KAAK;KACzC;KACA;IACF,KAAK;KACH,IAAI,OAAO,KAAK,UAAU,YAAY,OAAO,MAAM,UAAU,UAAU;MACrE,OAAO,QAAQ,KAAK,QAAQ,MAAM,KAAK;KACzC;KACA;IACF,KAAK;IACL,KAAK;IACL,KAAK,MACH,OAAO;GACX;GACA,OAAO,YACL,IACA,MACA,mBAAmB,OAAO,KAAK,QAAQ,EAAE,gBAC3C;EACF;EACA,KAAK,yBAAyB;GAC5B,MAAM,WAAW,UAAU,MAAM,MAAM;GACvC,MAAM,aAAa,UAAU,MAAM,YAAY;GAC/C,MAAM,YAAY,UAAU,MAAM,WAAW;GAC7C,IAAI,CAAC,YAAY,CAAC,cAAc,CAAC,WAAW,OAAO,YAAY,IAAI,IAAI;GACvE,MAAM,OAAO,aAAa,UAAU,IAAI,UAAU,KAAK;GACvD,IAAI,CAAC,KAAK,IAAI,OAAO;GACrB,OAAO,aAAa,UAAU,IAAI,KAAK,QAAQ,aAAa,WAAW,KAAK;EAC9E;EACA,KAAK,mBAAmB;GACtB,MAAM,SAAS,WAAW,MAAM,QAAQ;GACxC,MAAM,cAAc,WAAW,MAAM,aAAa;GAClD,IAAI,SAAS;GACb,KAAK,IAAI,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS;IAClD,UAAU,UAAU,OAAO,MAAM;IACjC,MAAM,aAAa,YAAY;IAC/B,IAAI,YAAY;KACd,MAAM,QAAQ,aAAa,UAAU,IAAI,YAAY,KAAK;KAC1D,IAAI,CAAC,MAAM,IAAI,OAAO;KACtB,UAAU,OAAO,MAAM,KAAK;IAC9B;GACF;GACA,OAAO,QAAQ,MAAM;EACvB;EACA,SACE,OAAO,YAAY,IAAI,IAAI;CAC/B;AACF;AACA,SAAS,UAAU,OAAO;CACxB,MAAM,SAAS,OAAO,OAAO;CAC7B,MAAM,MAAM,OAAO,OAAO;CAC1B,OAAO,OAAO,WAAW,WAAW,SAAS,OAAO,QAAQ,WAAW,MAAM;AAC/E;AACA,SAAS,iBAAiB,OAAO;CAC/B,IAAI,UAAU,MAAM,OAAO;CAC3B,IAAI,OAAO,UAAU,UAAU,OAAO;CACtC,IAAI,OAAO,UAAU,UAAU,OAAO;CACtC,IAAI,OAAO,UAAU,WAAW,OAAO;CACvC,OAAO;AACT;AACA,SAAS,oBAAoB,UAAU,IAAI,OAAO,OAAO;CACvD,MAAM,QAAQ,aAAa,UAAU,IAAI,OAAO,KAAK;CACrD,IAAI,MAAM,IAAI;EACZ,MAAM,OAAO,iBAAiB,MAAM,KAAK;EACzC,OAAO,OAAO;GAAE;GAAM,QAAQ,CAAC,MAAM,KAAK;EAAE,IAAI;CAClD;CACA,MAAM,OAAO,iBAAiB,KAAK;CACnC,IAAI,KAAK,SAAS,cAAc;EAC9B,IAAI,CAAC,eAAe,IAAI,GAAG,OAAO;EAClC,MAAM,aAAa,SAAS,iBAAiB,oBAAoB,IAAI,IAAI,CAAC;EAC1E,IAAI,CAAC,YAAY,YAAY,CAAC,WAAW,aAAa,OAAO;EAC7D,MAAM,MAAM,GAAG,WAAW,GAAG,GAAG,WAAW,KAAK;EAChD,IAAI,MAAM,kBAAkB,IAAI,GAAG,GAAG,OAAO;EAC7C,MAAM,cAAc,SAAS,eAAe,WAAW,WAAW;EAClE,IAAI,CAAC,aAAa,OAAO;EACzB,MAAM,aAAa,IAAI,WAAW,EAAE;EACpC,MAAM,kBAAkB,IAAI,GAAG;EAC/B,IAAI;GACF,OAAO,oBAAoB,UAAU,WAAW,IAAI,aAAa,KAAK;EACxE,UAAU;GACR,MAAM,kBAAkB,OAAO,GAAG;EACpC;CACF;CACA,IAAI,KAAK,SAAS,oBAAoB;EACpC,MAAM,aAAa,UAAU,MAAM,QAAQ;EAC3C,MAAM,eAAe,UAAU,MAAM,UAAU;EAC/C,IAAI,CAAC,cAAc,CAAC,cAAc,OAAO;EACzC,MAAM,SAAS,aAAa,UAAU,IAAI,YAAY,KAAK;EAC3D,IAAI,CAAC,OAAO,MAAM,CAAC,MAAM,QAAQ,OAAO,KAAK,GAAG,OAAO;EACvD,MAAM,WAAW,oBAAoB,UAAU,IAAI,cAAc,KAAK;EACtE,IAAI,UAAU,SAAS,YAAY,OAAO,MAAM,SAAS,IAAI,OAAO;EACpE,MAAM,SAAS,CAAC;EAChB,IAAI,OAAO;EACX,KAAK,MAAM,SAAS,OAAO,OAAO;GAChC,MAAM,WAAW,iBAAiB,KAAK;GACvC,IAAI,CAAC,YAAY,QAAQ,SAAS,UAAU,OAAO;GACnD,OAAO;GACP,MAAM,YAAY;GAClB,IAAI,CAAC,OAAO,SAAS,SAAS,GAAG,OAAO,KAAK,SAAS;EACxD;EACA,OAAO,OAAO;GAAE;GAAM;EAAO,IAAI;CACnC;CACA,IAAI,KAAK,SAAS,oBAAoB;EACpC,MAAM,WAAW,UAAU,MAAM,MAAM;EACvC,MAAM,YAAY,UAAU,MAAM,OAAO;EACzC,IAAI,CAAC,YAAY,CAAC,WAAW,OAAO;EACpC,MAAM,OAAO,oBAAoB,UAAU,IAAI,UAAU,KAAK;EAC9D,MAAM,QAAQ,oBAAoB,UAAU,IAAI,WAAW,KAAK;EAChE,IAAI,KAAK,aAAa,KAAK;GACzB,OAAO,MAAM,SAAS,YAAY,OAAO,SAAS,WAAW,EAAE,MAAM,SAAS,IAAI;EACpF;EACA,IAAI,KAAK,aAAa,OAAO,KAAK,aAAa,OAAO,KAAK,aAAa,OAAO,KAAK,aAAa,OAAO,KAAK,aAAa,MAAM;GAC9H,IAAI,MAAM,SAAS,YAAY,OAAO,SAAS,UAAU;IACvD,OAAO,EAAE,MAAM,SAAS;GAC1B;EACF;CACF;CACA,IAAI,KAAK,SAAS,mBAAmB;EACnC,MAAM,SAAS,WAAW,MAAM,QAAQ;EACxC,MAAM,cAAc,WAAW,MAAM,aAAa;EAClD,IAAI,SAAS,CAAC,EAAE;EAChB,KAAK,IAAI,WAAW,GAAG,WAAW,OAAO,QAAQ,YAAY;GAC3D,MAAM,OAAO,UAAU,OAAO,SAAS;GACvC,SAAS,OAAO,KAAK,UAAU,QAAQ,IAAI;GAC3C,MAAM,aAAa,YAAY;GAC/B,IAAI,CAAC,YAAY;GACjB,MAAM,OAAO,oBAAoB,UAAU,IAAI,YAAY,KAAK;GAChE,IAAI,CAAC,MAAM,QAAQ,OAAO;GAC1B,MAAM,OAAO,CAAC;GACd,KAAK,MAAM,SAAS,QAAQ;IAC1B,KAAK,MAAM,aAAa,KAAK,QAAQ;KACnC,MAAM,SAAS,QAAQ,OAAO,SAAS;KACvC,IAAI,CAAC,KAAK,SAAS,MAAM,GAAG,KAAK,KAAK,MAAM;IAC9C;GACF;GACA,IAAI,KAAK,SAAS,IAAI,OAAO;GAC7B,SAAS;EACX;EACA,OAAO;GAAE,MAAM;GAAU;EAAO;CAClC;CACA,OAAO;AACT;AACA,SAAS,cAAc,MAAM;CAC3B,IAAI,KAAK,SAAS,QAAQ,OAAO,CAAC,IAAI;CACtC,OAAO,CAAC,GAAG,cAAc,KAAK,QAAQ,GAAG,GAAG,cAAc,KAAK,SAAS,CAAC;AAC3E;AACA,SAAS,0BAA0B,MAAM;CACvC,IAAI,KAAK,SAAS,QAAQ,OAAO,KAAK;CACtC,OAAO,CACL,mBAAmB,IAAI,IAAI,CACzB,GAAG,0BAA0B,KAAK,QAAQ,GAC1C,GAAG,0BAA0B,KAAK,SAAS,CAC7C,CAAC,CACH,CAAC,CAAC,KAAK;AACT;AACA,SAAS,oBAAoB,UAAU,IAAI,MAAM,OAAO,OAAO,UAAU;CACvE,MAAM,YAAY;EAChB,mBAAmB,IAAI,IAAI,MAAM,iBAAiB;EAClD,cAAc,IAAI,IAAI,MAAM,YAAY;CAC1C;CACA,MAAM,UAAU,aAAa,UAAU,IAAI,MAAM,SAAS;CAC1D,IAAI,QAAQ,IAAI;EACd,OAAO;GACL,MAAM;GACN,OAAO,QAAQ;GACf,cAAc,CAAC,GAAG,UAAU,YAAY,CAAC,CAAC,KAAK;EACjD;CACF;CACA,OAAO,qBAAqB,UAAU,IAAI,MAAM,QAAQ,GAAG,WAAW,QAAQ;AAChF;AACA,SAAS,qBAAqB,UAAU,IAAI,OAAO,OAAO,OAAO,UAAU;CACzE,MAAM,OAAO,iBAAiB,KAAK;CACnC,IAAI,CAAC,UAAU,IAAI,GAAG,OAAO;CAC7B,IAAI,KAAK,SAAS,cAAc;EAC9B,IAAI,CAAC,eAAe,IAAI,GAAG,OAAO;EAClC,MAAM,aAAa,SAAS,iBAAiB,oBAAoB,IAAI,IAAI,CAAC;EAC1E,IAAI,CAAC,cAAc,CAAC,WAAW,YAAY,CAAC,WAAW,aAAa,OAAO;EAC3E,MAAM,cAAc,SAAS,eAAe,WAAW,WAAW;EAClE,IAAI,CAAC,aAAa,OAAO;EACzB,MAAM,MAAM,GAAG,WAAW,GAAG,GAAG,WAAW,KAAK;EAChD,IAAI,MAAM,kBAAkB,IAAI,GAAG,GAAG,OAAO;EAC7C,MAAM,kBAAkB,IAAI,GAAG;EAC/B,MAAM,aAAa,IAAI,WAAW,EAAE;EACpC,IAAI;GACF,OAAO,qBACL,UACA,WAAW,IACX,aACA,OACA,OACA,QACF;EACF,UAAU;GACR,MAAM,kBAAkB,OAAO,GAAG;EACpC;CACF;CACA,IAAI,SAAS,GAAG,OAAO;CACvB,IAAI,KAAK,SAAS,yBAAyB;EACzC,MAAM,WAAW,UAAU,MAAM,MAAM;EACvC,MAAM,aAAa,UAAU,MAAM,YAAY;EAC/C,MAAM,YAAY,UAAU,MAAM,WAAW;EAC7C,IAAI,CAAC,YAAY,CAAC,cAAc,CAAC,WAAW,OAAO;EACnD,MAAM,OAAO,OAAO,IAAI,QAAQ;EAChC,IAAI,KAAK,OAAO,UAAU,OAAO;EACjC,MAAM,WAAW,oBAAoB,UAAU,IAAI,YAAY,OAAO,OAAO,QAAQ;EACrF,IAAI,CAAC,UAAU,OAAO;EACtB,MAAM,YAAY,oBAAoB,UAAU,IAAI,WAAW,OAAO,OAAO,QAAQ;EACrF,IAAI,CAAC,WAAW,OAAO;EACvB,OAAO;GACL,MAAM;GACN;GACA;GACA;EACF;CACF;CACA,IAAI,KAAK,SAAS,mBAAmB;EACnC,OAAO,qBACL,UACA,IACA,WAAW,MAAM,QAAQ,GACzB,WAAW,MAAM,aAAa,GAC9B,GACA,IACA,OACA,OACA,QACF;CACF;CACA,IAAI,KAAK,SAAS,qBAAqB;EACrC,MAAM,OAAO,UAAU,MAAM,MAAM;EACnC,MAAM,QAAQ,UAAU,MAAM,OAAO;EACrC,IAAI,CAAC,QAAQ,CAAC,OAAO,OAAO;EAC5B,IAAI,KAAK,aAAa,MAAM;GAC1B,MAAM,OAAO,OAAO,IAAI,IAAI;GAC5B,IAAI,KAAK,OAAO,UAAU,OAAO;GACjC,MAAM,WAAW,oBAAoB,UAAU,IAAI,OAAO,OAAO,OAAO,QAAQ;GAChF,IAAI,CAAC,UAAU,OAAO;GACtB,MAAM,YAAY;IAChB,MAAM;IACN,OAAO,KAAK;IACZ,cAAc,CAAC,GAAG,MAAM,YAAY,CAAC,CAAC,KAAK;GAC7C;GACA,OAAO;IACL,MAAM;IACN;IACA;IACA;GACF;EACF;EACA,IAAI,KAAK,aAAa,QAAQ,KAAK,aAAa,MAAM;GACpD,MAAM,OAAO,OAAO,IAAI,IAAI;GAC5B,IAAI,KAAK,OAAO,UAAU,OAAO;GACjC,MAAM,YAAY;IAChB,mBAAmB,IAAI,IAAI,MAAM,iBAAiB;IAClD,cAAc,IAAI,IAAI,MAAM,YAAY;GAC1C;GACA,MAAM,UAAU,aAAa,UAAU,IAAI,MAAM,SAAS;GAC1D,IAAI,CAAC,QAAQ,IAAI,OAAO;GACxB,MAAM,WAAW;IACf,MAAM;IACN,OAAO,QAAQ;IACf,cAAc,CAAC,GAAG,UAAU,YAAY,CAAC,CAAC,KAAK;GACjD;GACA,MAAM,YAAY,oBAAoB,UAAU,IAAI,OAAO,OAAO,OAAO,QAAQ;GACjF,IAAI,CAAC,WAAW,OAAO;GACvB,OAAO;IACL,MAAM;IACN;IACA;IACA;GACF;EACF;CACF;CACA,OAAO;AACT;AACA,SAAS,gBAAgB,MAAM,KAAK;CAClC,IAAI,KAAK,SAAS,QAAQ,OAAO,IAAI,IAAI;CACzC,MAAM,WAAW,gBAAgB,KAAK,UAAU,GAAG;CACnD,IAAI,CAAC,UAAU,OAAO;CACtB,MAAM,YAAY,gBAAgB,KAAK,WAAW,GAAG;CACrD,IAAI,CAAC,WAAW,OAAO;CACvB,OAAO;EAAE,MAAM;EAAU,MAAM,KAAK;EAAM;EAAU;CAAU;AAChE;AACA,SAAS,qBAAqB,UAAU,IAAI,QAAQ,aAAa,OAAO,QAAQ,OAAO,OAAO,UAAU;CACtG,IAAI,OAAO;CACX,KAAK,IAAI,WAAW,OAAO,WAAW,OAAO,QAAQ,YAAY;EAC/D,QAAQ,UAAU,OAAO,SAAS;EAClC,MAAM,aAAa,YAAY;EAC/B,IAAI,CAAC,YAAY;EACjB,MAAM,QAAQ,aAAa,UAAU,IAAI,YAAY,KAAK;EAC1D,IAAI,MAAM,IAAI;GACZ,MAAM,eAAe,sBAAsB,MAAM,KAAK;GACtD,IAAI,iBAAiB,MAAM,OAAO;GAClC,QAAQ;GACR;EACF;EACA,MAAM,OAAO,qBACX,UACA,IACA,YACA,QAAQ,GACR,OACA,QACF;EACA,IAAI,CAAC,MAAM,OAAO;EAClB,OAAO,gBAAgB,OAAO,SAAS;GACrC,IAAI,KAAK,UAAU,KAAK,GAAG,OAAO;GAClC,MAAM,eAAe,sBAAsB,KAAK,KAAK;GACrD,IAAI,iBAAiB,MAAM,OAAO;GAClC,OAAO,qBACL,UACA,IACA,QACA,aACA,WAAW,GACX,OAAO,cACP,QAAQ,GACR,OACA,QACF;EACF,CAAC;CACH;CACA,OAAO;EAAE,MAAM;EAAQ,OAAO;EAAM,cAAc,CAAC,GAAG,MAAM,YAAY,CAAC,CAAC,KAAK;CAAE;AACnF;AACA,SAAS,sBAAsB,OAAO;CACpC,IAAI,UAAU,MAAM,OAAO;CAC3B,IAAI,OAAO,UAAU,YAAY,OAAO,UAAU,YAAY,OAAO,UAAU,WAAW;EACxF,OAAO,OAAO,KAAK;CACrB;CACA,OAAO;AACT;AACA,SAAS,iBAAiB,UAAU,WAAW;CAC7C,MAAM,OAAO,SAAS,eAAe,SAAS;CAC9C,IAAI,CAAC,MAAM,OAAO;CAClB,MAAM,QAAQ;EACZ,mCAAmC,IAAI,IAAI;EAC3C,8BAA8B,IAAI,IAAI;CACxC;CACA,MAAM,OAAO,qBAAqB,UAAU,UAAU,IAAI,MAAM,GAAG,OAAO,UAAU,EAAE;CACtF,OAAO,MAAM,SAAS,WAAW,OAAO;AAC1C;AACA,SAAS,mBAAmB,UAAU,WAAW;CAC/C,MAAM,OAAO,SAAS,eAAe,SAAS;CAC9C,IAAI,CAAC,MAAM;EACT,OAAO;GACL,IAAI;GACJ,SAAS,cACP,8BACA,WACA,kDACA,UAAU,EACZ;EACF;CACF;CACA,MAAM,QAAQ;EACZ,mCAAmC,IAAI,IAAI;EAC3C,8BAA8B,IAAI,IAAI;CACxC;CACA,MAAM,SAAS,aAAa,UAAU,UAAU,IAAI,MAAM,KAAK;CAC/D,OAAO,OAAO,KAAK;EACjB,IAAI;EACJ,OAAO,OAAO;EACd,cAAc,CAAC,GAAG,MAAM,YAAY,CAAC,CAAC,KAAK;CAC7C,IAAI;AACN;AACA,SAAS,0BAA0B,UAAU,WAAW;CACtD,MAAM,OAAO,SAAS,eAAe,SAAS;CAC9C,IAAI,CAAC,MAAM,OAAO;CAClB,MAAM,QAAQ;EACZ,mCAAmC,IAAI,IAAI;EAC3C,8BAA8B,IAAI,IAAI;CACxC;CACA,MAAM,SAAS,oBAAoB,UAAU,UAAU,IAAI,MAAM,KAAK;CACtE,OAAO,SAAS;EAAE,GAAG;EAAQ,cAAc,CAAC,GAAG,MAAM,YAAY,CAAC,CAAC,KAAK;CAAE,IAAI;AAChF;AACA,SAAS,gBAAgB,UAAU,IAAI,WAAW;CAChD,MAAM,aAAa,SAAS,eAAe,IAAI,SAAS;CACxD,IAAI,CAAC,YAAY;EACf,MAAM,YAAY;GAAE;GAAI,OAAO;GAAG,KAAK;EAAE;EACzC,OAAO;GACL,IAAI;GACJ,SAAS,cACP,6BACA,WACA,WAAW,UAAU,+BACvB;EACF;CACF;CACA,IAAI,CAAC,WAAW,aAAa;EAC3B,OAAO;GACL,IAAI;GACJ,SAAS,cACP,8BACA,WAAW,MACX,WAAW,UAAU,6BACrB,WAAW,EACb;EACF;CACF;CACA,OAAO,mBACL,UACA,oBAAoB,WAAW,IAAI,WAAW,WAAW,CAC3D;AACF"}