@powerhousedao/powerhouse-vetra-packages 6.2.3-dev.10 → 6.2.3-dev.11

package/dist/browser/assets/{entry-DvpdFGdw.js → entry-4ObkElbc.js}

@@ -1,6 +1,6 @@
-import { o as instrumentPgPool } from "./drive-container-types-CE7dxz0_.js";
+import { o as instrumentPgPool } from "./drive-container-types-CS5IxDiA.js";
 import { n as errorToInfo, t as createForwardingLogger } from "./forwarding-logger-BBkMSxuJ.js";
-import { n as defaultLoadFactory, t as buildWorkerExecutor } from "./build-worker-executor-_x-U7e_A.js";
+import { n as defaultLoadFactory, t as buildWorkerExecutor } from "./build-worker-executor-DUjyF4NM.js";
 import { ConsoleLogger } from "document-model";
 import { isMainThread, parentPort } from "node:worker_threads";
 //#region src/executor/worker/run-worker.ts

package/dist/browser/assets/{projection-entry-QU4xTPM_.js → projection-entry-DRGRQCSu.js}

@@ -1,8 +1,8 @@
-import { _ as DocumentMetaCache, c as KyselyKeyframeStore, g as KyselyOperationIndex, h as KyselyWriteCache, l as DocumentModelRegistry, m as EventBus, n as REACTOR_SCHEMA, o as instrumentPgPool, s as KyselyOperationStore, v as CollectionMembershipCache } from "./drive-container-types-CE7dxz0_.js";
+import { _ as DocumentMetaCache, c as KyselyKeyframeStore, g as KyselyOperationIndex, h as KyselyWriteCache, l as DocumentModelRegistry, m as EventBus, n as REACTOR_SCHEMA, o as instrumentPgPool, s as KyselyOperationStore, v as CollectionMembershipCache } from "./drive-container-types-CS5IxDiA.js";
 import { n as ReactorEventTypes } from "./types-DMKLa0Ok.js";
-import { i as KyselyDocumentView, n as ConsistencyTracker, s as ReadModelCoordinator, t as KyselyDocumentIndexer } from "./document-indexer-BRqfWhe1.js";
+import { a as KyselyDocumentView, c as ReadModelCoordinator, i as DeletedDocumentRead, n as ConsistencyTracker, t as KyselyDocumentIndexer } from "./document-indexer-C1oY6CaR.js";
 import { n as errorToInfo, t as createForwardingLogger } from "./forwarding-logger-BBkMSxuJ.js";
-import { n as defaultLoadFactory } from "./build-worker-executor-_x-U7e_A.js";
+import { n as defaultLoadFactory } from "./build-worker-executor-DUjyF4NM.js";
 import { ConsoleLogger } from "document-model";
 import { isMainThread, parentPort } from "node:worker_threads";
 //#region src/projection/projection-worker/build-projection-stack.ts
@@ -22,10 +22,10 @@ async function loadModelManifest(entries, loadFactory, registry, logger) {
 		}
 	}
 }
-function instantiateReadModel(kind, database, operationStore, operationIndex, writeCache) {
+function instantiateReadModel(kind, database, operationStore, operationIndex, writeCache, indexing) {
 	switch (kind) {
-		case "document-view": return new KyselyDocumentView(database, operationStore, operationIndex, writeCache, new ConsistencyTracker(), false);
-		case "document-indexer": return new KyselyDocumentIndexer(database, operationIndex, writeCache, new ConsistencyTracker());
+		case "document-view": return new KyselyDocumentView(database, operationStore, operationIndex, writeCache, new ConsistencyTracker(), DeletedDocumentRead.NotFound, indexing);
+		case "document-indexer": return new KyselyDocumentIndexer(database, operationIndex, writeCache, new ConsistencyTracker(), indexing);
 		default: {
 			const exhaustive = kind;
 			throw new Error(`unknown built-in read model kind: ${String(exhaustive)}`);
@@ -60,8 +60,8 @@ async function buildProjectionStack(options) {
 	const operationIndex = new KyselyOperationIndex(database);
 	await new DocumentMetaCache(operationStore, { maxDocuments: 1e3 }).startup();
 	new CollectionMembershipCache(operationIndex);
-	const preReady = init.preReadyKinds.map((kind) => instantiateReadModel(kind, database, operationStore, operationIndex, writeCache));
-	const postReady = init.postReadyKinds.map((kind) => instantiateReadModel(kind, database, operationStore, operationIndex, writeCache));
+	const preReady = init.preReadyKinds.map((kind) => instantiateReadModel(kind, database, operationStore, operationIndex, writeCache, init.indexing));
+	const postReady = init.postReadyKinds.map((kind) => instantiateReadModel(kind, database, operationStore, operationIndex, writeCache, init.indexing));
 	await initReadModels([...preReady, ...postReady], logger);
 	const eventBus = new EventBus();
 	const subscriptions = [];

package/dist/browser/{button-CuO8Gh3v.js → button-sZQCXeCo.js}

@@ -1,11 +1,11 @@
-import { f as lazy$1, g as record, i as sentenceCase, l as array, m as number, r as pascalCase, s as _null, u as boolean, v as string, y as union } from "./dist-B4FWbuEM.js";
-import { c as Kind, p as GraphQLError, t as parse } from "./parser-CkF6Qt8V.js";
-import { a as customScalars, b as getVariableValues, s as buildASTSchema } from "./documents-J_l59mSV.js";
-import { i as visit, t as print } from "./printer-CEYr4JOg.js";
-import { w as twMerge } from "./dist-BAJ5nRDl.js";
-import { n as safeParseSdl } from "./schema-context-ZyeclQwy.js";
+import { c as Kind, p as GraphQLError, t as parse } from "./parser-BBzK7bLd.js";
+import { gt as visit, mt as print, o as buildASTSchema, y as getVariableValues } from "./documents-C-lAnv6o.js";
+import { h as twMerge } from "./dist-D3_ER0Dn.js";
+import { n as safeParseSdl } from "./schema-context-p2bhyog_.js";
+import { z } from "zod";
 import { forwardRef } from "react";
 import { jsx } from "react/jsx-runtime";
+import { getPHCustomScalarByTypeName } from "@powerhousedao/document-engineering/graphql";
 //#region ../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/utilities/getOperationAST.mjs
 /**
 * Returns an operation AST given a document AST and optionally an operation
@@ -24,17 +24,124 @@ function getOperationAST(documentAST, operationName) {
 	return operation;
 }
 //#endregion
-//#region ../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/utils.js
-const SerializableSchema = lazy$1(() => union([
-	string(),
-	number(),
-	boolean(),
-	_null(),
-	array(SerializableSchema),
-	record(string(), SerializableSchema)
-]));
-function getPHCustomScalarByTypeName(name) {
-	return Object.values(customScalars).find((scalar) => scalar.config.name === name) ?? null;
+//#region ../../node_modules/.pnpm/change-case@5.4.4/node_modules/change-case/dist/index.js
+const SPLIT_LOWER_UPPER_RE = /([\p{Ll}\d])(\p{Lu})/gu;
+const SPLIT_UPPER_UPPER_RE = /(\p{Lu})([\p{Lu}][\p{Ll}])/gu;
+const SPLIT_SEPARATE_NUMBER_RE = /(\d)\p{Ll}|(\p{L})\d/u;
+const DEFAULT_STRIP_REGEXP = /[^\p{L}\d]+/giu;
+const SPLIT_REPLACE_VALUE = "$1\0$2";
+const DEFAULT_PREFIX_SUFFIX_CHARACTERS = "";
+/**
+* Split any cased input strings into an array of words.
+*/
+function split(value) {
+	let result = value.trim();
+	result = result.replace(SPLIT_LOWER_UPPER_RE, SPLIT_REPLACE_VALUE).replace(SPLIT_UPPER_UPPER_RE, SPLIT_REPLACE_VALUE);
+	result = result.replace(DEFAULT_STRIP_REGEXP, "\0");
+	let start = 0;
+	let end = result.length;
+	while (result.charAt(start) === "\0") start++;
+	if (start === end) return [];
+	while (result.charAt(end - 1) === "\0") end--;
+	return result.slice(start, end).split(/\0/g);
+}
+/**
+* Split the input string into an array of words, separating numbers.
+*/
+function splitSeparateNumbers(value) {
+	const words = split(value);
+	for (let i = 0; i < words.length; i++) {
+		const word = words[i];
+		const match = SPLIT_SEPARATE_NUMBER_RE.exec(word);
+		if (match) {
+			const offset = match.index + (match[1] ?? match[2]).length;
+			words.splice(i, 1, word.slice(0, offset), word.slice(offset));
+		}
+	}
+	return words;
+}
+/**
+* Convert a string to space separated lower case (`foo bar`).
+*/
+function noCase(input, options) {
+	const [prefix, words, suffix] = splitPrefixSuffix(input, options);
+	return prefix + words.map(lowerFactory(options?.locale)).join(options?.delimiter ?? " ") + suffix;
+}
+/**
+* Convert a string to pascal case (`FooBar`).
+*/
+function pascalCase(input, options) {
+	const [prefix, words, suffix] = splitPrefixSuffix(input, options);
+	const lower = lowerFactory(options?.locale);
+	const upper = upperFactory(options?.locale);
+	const transform = options?.mergeAmbiguousCharacters ? capitalCaseTransformFactory(lower, upper) : pascalCaseTransformFactory(lower, upper);
+	return prefix + words.map(transform).join(options?.delimiter ?? "") + suffix;
+}
+/**
+* Convert a string to constant case (`FOO_BAR`).
+*/
+function constantCase(input, options) {
+	const [prefix, words, suffix] = splitPrefixSuffix(input, options);
+	return prefix + words.map(upperFactory(options?.locale)).join(options?.delimiter ?? "_") + suffix;
+}
+/**
+* Convert a string to path case (`Foo bar`).
+*/
+function sentenceCase(input, options) {
+	const [prefix, words, suffix] = splitPrefixSuffix(input, options);
+	const lower = lowerFactory(options?.locale);
+	const transform = capitalCaseTransformFactory(lower, upperFactory(options?.locale));
+	return prefix + words.map((word, index) => {
+		if (index === 0) return transform(word);
+		return lower(word);
+	}).join(options?.delimiter ?? " ") + suffix;
+}
+/**
+* Convert a string to snake case (`foo_bar`).
+*/
+function snakeCase(input, options) {
+	return noCase(input, {
+		delimiter: "_",
+		...options
+	});
+}
+function lowerFactory(locale) {
+	return locale === false ? (input) => input.toLowerCase() : (input) => input.toLocaleLowerCase(locale);
+}
+function upperFactory(locale) {
+	return locale === false ? (input) => input.toUpperCase() : (input) => input.toLocaleUpperCase(locale);
+}
+function capitalCaseTransformFactory(lower, upper) {
+	return (word) => `${upper(word[0])}${lower(word.slice(1))}`;
+}
+function pascalCaseTransformFactory(lower, upper) {
+	return (word, index) => {
+		const char0 = word[0];
+		return (index > 0 && char0 >= "0" && char0 <= "9" ? "_" + char0 : upper(char0)) + lower(word.slice(1));
+	};
+}
+function splitPrefixSuffix(input, options = {}) {
+	const splitFn = options.split ?? (options.separateNumbers ? splitSeparateNumbers : split);
+	const prefixCharacters = options.prefixCharacters ?? DEFAULT_PREFIX_SUFFIX_CHARACTERS;
+	const suffixCharacters = options.suffixCharacters ?? DEFAULT_PREFIX_SUFFIX_CHARACTERS;
+	let prefixIndex = 0;
+	let suffixIndex = input.length;
+	while (prefixIndex < input.length) {
+		const char = input.charAt(prefixIndex);
+		if (!prefixCharacters.includes(char)) break;
+		prefixIndex++;
+	}
+	while (suffixIndex > prefixIndex) {
+		const index = suffixIndex - 1;
+		const char = input.charAt(index);
+		if (!suffixCharacters.includes(char)) break;
+		suffixIndex = index;
+	}
+	return [
+		input.slice(0, prefixIndex),
+		splitFn(input.slice(prefixIndex, suffixIndex)),
+		input.slice(suffixIndex)
+	];
 }
 //#endregion
 //#region editors/document-model-editor/constants/graphql-kinds.ts
@@ -178,19 +285,19 @@ function makeMinimalValueForGQLPrimitiveNode(primitiveTypeNode, existingFieldVal
 	if (!name) return null;
 	switch (name) {
 		case "ID":
-			if (string().safeParse(existingFieldValue).success) return existingFieldValue;
+			if (z.string().safeParse(existingFieldValue).success) return existingFieldValue;
 			return isNonNull ? "placeholder-id" : null;
 		case BOOLEAN_GQL_PRIMITIVE_NAME:
-			if (boolean().safeParse(existingFieldValue).success) return existingFieldValue;
+			if (z.boolean().safeParse(existingFieldValue).success) return existingFieldValue;
 			return isNonNull ? false : null;
 		case "Int":
-			if (number().safeParse(existingFieldValue).success) return existingFieldValue;
+			if (z.number().safeParse(existingFieldValue).success) return existingFieldValue;
 			return isNonNull ? 0 : null;
 		case FLOAT_GQL_PRIMITIVE_NAME:
-			if (number().safeParse(existingFieldValue).success) return existingFieldValue;
+			if (z.number().safeParse(existingFieldValue).success) return existingFieldValue;
 			return isNonNull ? 0 : null;
 		case STRING_GQL_PRIMITIVE_NAME:
-			if (string().safeParse(existingFieldValue).success) return existingFieldValue;
+			if (z.string().safeParse(existingFieldValue).success) return existingFieldValue;
 			return isNonNull ? "" : null;
 	}
 	return isNonNull ? existingFieldValue : null;
@@ -691,6 +798,6 @@ const Button = forwardRef((props, ref) => {
 	});
 });
 //#endregion
-export { compareStringsWithoutWhitespace as a, isEmptyOperationSchema as c, makeMinimalObjectForStateType as d, makeOperationInitialDoc as f, validateStateObject as h, StateValidationError as i, makeEmptyOperationSchema as l, renameSchemaType as m, ensureValidOperationSchemaInputName as n, handleModelNameChange as o, makeStateSchemaNameForScope as p, ensureValidStateSchemaName as r, initializeModelSchema as s, Button as t, makeInitialSchemaDoc as u };
+export { pascalCase as _, compareStringsWithoutWhitespace as a, isEmptyOperationSchema as c, makeMinimalObjectForStateType as d, makeOperationInitialDoc as f, constantCase as g, validateStateObject as h, StateValidationError as i, makeEmptyOperationSchema as l, renameSchemaType as m, ensureValidOperationSchemaInputName as n, handleModelNameChange as o, makeStateSchemaNameForScope as p, ensureValidStateSchemaName as r, initializeModelSchema as s, Button as t, makeInitialSchemaDoc as u, snakeCase as v };
 
-//# sourceMappingURL=button-CuO8Gh3v.js.map
+//# sourceMappingURL=button-sZQCXeCo.js.map

package/dist/browser/button-sZQCXeCo.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"button-sZQCXeCo.js","names":[],"sources":["../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/utilities/getOperationAST.mjs","../../../../node_modules/.pnpm/change-case@5.4.4/node_modules/change-case/dist/index.js","../../editors/document-model-editor/constants/graphql-kinds.ts","../../editors/document-model-editor/utils/helpers.ts","../../editors/document-model-editor/utils/linting.ts","../../editors/document-model-editor/components/button.tsx"],"sourcesContent":["import { Kind } from '../language/kinds.mjs';\n/**\n * Returns an operation AST given a document AST and optionally an operation\n * name. If a name is not provided, an operation is only returned if only one is\n * provided in the document.\n */\n\nexport function getOperationAST(documentAST, operationName) {\n  let operation = null;\n\n  for (const definition of documentAST.definitions) {\n    if (definition.kind === Kind.OPERATION_DEFINITION) {\n      var _definition$name;\n\n      if (operationName == null) {\n        // If no operation name was provided, only return an Operation if there\n        // is one defined in the document. Upon encountering the second, return\n        // null.\n        if (operation) {\n          return null;\n        }\n\n        operation = definition;\n      } else if (\n        ((_definition$name = definition.name) === null ||\n        _definition$name === void 0\n          ? void 0\n          : _definition$name.value) === operationName\n      ) {\n        return definition;\n      }\n    }\n  }\n\n  return operation;\n}\n","// Regexps involved with splitting words in various case formats.\nconst SPLIT_LOWER_UPPER_RE = /([\\p{Ll}\\d])(\\p{Lu})/gu;\nconst SPLIT_UPPER_UPPER_RE = /(\\p{Lu})([\\p{Lu}][\\p{Ll}])/gu;\n// Used to iterate over the initial split result and separate numbers.\nconst SPLIT_SEPARATE_NUMBER_RE = /(\\d)\\p{Ll}|(\\p{L})\\d/u;\n// Regexp involved with stripping non-word characters from the result.\nconst DEFAULT_STRIP_REGEXP = /[^\\p{L}\\d]+/giu;\n// The replacement value for splits.\nconst SPLIT_REPLACE_VALUE = \"$1\\0$2\";\n// The default characters to keep after transforming case.\nconst DEFAULT_PREFIX_SUFFIX_CHARACTERS = \"\";\n/**\n * Split any cased input strings into an array of words.\n */\nexport function split(value) {\n    let result = value.trim();\n    result = result\n        .replace(SPLIT_LOWER_UPPER_RE, SPLIT_REPLACE_VALUE)\n        .replace(SPLIT_UPPER_UPPER_RE, SPLIT_REPLACE_VALUE);\n    result = result.replace(DEFAULT_STRIP_REGEXP, \"\\0\");\n    let start = 0;\n    let end = result.length;\n    // Trim the delimiter from around the output string.\n    while (result.charAt(start) === \"\\0\")\n        start++;\n    if (start === end)\n        return [];\n    while (result.charAt(end - 1) === \"\\0\")\n        end--;\n    return result.slice(start, end).split(/\\0/g);\n}\n/**\n * Split the input string into an array of words, separating numbers.\n */\nexport function splitSeparateNumbers(value) {\n    const words = split(value);\n    for (let i = 0; i < words.length; i++) {\n        const word = words[i];\n        const match = SPLIT_SEPARATE_NUMBER_RE.exec(word);\n        if (match) {\n            const offset = match.index + (match[1] ?? match[2]).length;\n            words.splice(i, 1, word.slice(0, offset), word.slice(offset));\n        }\n    }\n    return words;\n}\n/**\n * Convert a string to space separated lower case (`foo bar`).\n */\nexport function noCase(input, options) {\n    const [prefix, words, suffix] = splitPrefixSuffix(input, options);\n    return (prefix +\n        words.map(lowerFactory(options?.locale)).join(options?.delimiter ?? \" \") +\n        suffix);\n}\n/**\n * Convert a string to camel case (`fooBar`).\n */\nexport function camelCase(input, options) {\n    const [prefix, words, suffix] = splitPrefixSuffix(input, options);\n    const lower = lowerFactory(options?.locale);\n    const upper = upperFactory(options?.locale);\n    const transform = options?.mergeAmbiguousCharacters\n        ? capitalCaseTransformFactory(lower, upper)\n        : pascalCaseTransformFactory(lower, upper);\n    return (prefix +\n        words\n            .map((word, index) => {\n            if (index === 0)\n                return lower(word);\n            return transform(word, index);\n        })\n            .join(options?.delimiter ?? \"\") +\n        suffix);\n}\n/**\n * Convert a string to pascal case (`FooBar`).\n */\nexport function pascalCase(input, options) {\n    const [prefix, words, suffix] = splitPrefixSuffix(input, options);\n    const lower = lowerFactory(options?.locale);\n    const upper = upperFactory(options?.locale);\n    const transform = options?.mergeAmbiguousCharacters\n        ? capitalCaseTransformFactory(lower, upper)\n        : pascalCaseTransformFactory(lower, upper);\n    return prefix + words.map(transform).join(options?.delimiter ?? \"\") + suffix;\n}\n/**\n * Convert a string to pascal snake case (`Foo_Bar`).\n */\nexport function pascalSnakeCase(input, options) {\n    return capitalCase(input, { delimiter: \"_\", ...options });\n}\n/**\n * Convert a string to capital case (`Foo Bar`).\n */\nexport function capitalCase(input, options) {\n    const [prefix, words, suffix] = splitPrefixSuffix(input, options);\n    const lower = lowerFactory(options?.locale);\n    const upper = upperFactory(options?.locale);\n    return (prefix +\n        words\n            .map(capitalCaseTransformFactory(lower, upper))\n            .join(options?.delimiter ?? \" \") +\n        suffix);\n}\n/**\n * Convert a string to constant case (`FOO_BAR`).\n */\nexport function constantCase(input, options) {\n    const [prefix, words, suffix] = splitPrefixSuffix(input, options);\n    return (prefix +\n        words.map(upperFactory(options?.locale)).join(options?.delimiter ?? \"_\") +\n        suffix);\n}\n/**\n * Convert a string to dot case (`foo.bar`).\n */\nexport function dotCase(input, options) {\n    return noCase(input, { delimiter: \".\", ...options });\n}\n/**\n * Convert a string to kebab case (`foo-bar`).\n */\nexport function kebabCase(input, options) {\n    return noCase(input, { delimiter: \"-\", ...options });\n}\n/**\n * Convert a string to path case (`foo/bar`).\n */\nexport function pathCase(input, options) {\n    return noCase(input, { delimiter: \"/\", ...options });\n}\n/**\n * Convert a string to path case (`Foo bar`).\n */\nexport function sentenceCase(input, options) {\n    const [prefix, words, suffix] = splitPrefixSuffix(input, options);\n    const lower = lowerFactory(options?.locale);\n    const upper = upperFactory(options?.locale);\n    const transform = capitalCaseTransformFactory(lower, upper);\n    return (prefix +\n        words\n            .map((word, index) => {\n            if (index === 0)\n                return transform(word);\n            return lower(word);\n        })\n            .join(options?.delimiter ?? \" \") +\n        suffix);\n}\n/**\n * Convert a string to snake case (`foo_bar`).\n */\nexport function snakeCase(input, options) {\n    return noCase(input, { delimiter: \"_\", ...options });\n}\n/**\n * Convert a string to header case (`Foo-Bar`).\n */\nexport function trainCase(input, options) {\n    return capitalCase(input, { delimiter: \"-\", ...options });\n}\nfunction lowerFactory(locale) {\n    return locale === false\n        ? (input) => input.toLowerCase()\n        : (input) => input.toLocaleLowerCase(locale);\n}\nfunction upperFactory(locale) {\n    return locale === false\n        ? (input) => input.toUpperCase()\n        : (input) => input.toLocaleUpperCase(locale);\n}\nfunction capitalCaseTransformFactory(lower, upper) {\n    return (word) => `${upper(word[0])}${lower(word.slice(1))}`;\n}\nfunction pascalCaseTransformFactory(lower, upper) {\n    return (word, index) => {\n        const char0 = word[0];\n        const initial = index > 0 && char0 >= \"0\" && char0 <= \"9\" ? \"_\" + char0 : upper(char0);\n        return initial + lower(word.slice(1));\n    };\n}\nfunction splitPrefixSuffix(input, options = {}) {\n    const splitFn = options.split ?? (options.separateNumbers ? splitSeparateNumbers : split);\n    const prefixCharacters = options.prefixCharacters ?? DEFAULT_PREFIX_SUFFIX_CHARACTERS;\n    const suffixCharacters = options.suffixCharacters ?? DEFAULT_PREFIX_SUFFIX_CHARACTERS;\n    let prefixIndex = 0;\n    let suffixIndex = input.length;\n    while (prefixIndex < input.length) {\n        const char = input.charAt(prefixIndex);\n        if (!prefixCharacters.includes(char))\n            break;\n        prefixIndex++;\n    }\n    while (suffixIndex > prefixIndex) {\n        const index = suffixIndex - 1;\n        const char = input.charAt(index);\n        if (!suffixCharacters.includes(char))\n            break;\n        suffixIndex = index;\n    }\n    return [\n        input.slice(0, prefixIndex),\n        splitFn(input.slice(prefixIndex, suffixIndex)),\n        input.slice(suffixIndex),\n    ];\n}\n//# sourceMappingURL=index.js.map","export const STRING_GQL_PRIMITIVE_NAME = \"String\";\nexport const BOOLEAN_GQL_PRIMITIVE_NAME = \"Boolean\";\nexport const INT_GQL_PRIMITIVE_NAME = \"Int\";\nexport const FLOAT_GQL_PRIMITIVE_NAME = \"Float\";\nexport const ID_GQL_PRIMITIVE_NAME = \"ID\";\n\nexport const gqlPrimitiveNodeNamesList = [\n  STRING_GQL_PRIMITIVE_NAME,\n  BOOLEAN_GQL_PRIMITIVE_NAME,\n  INT_GQL_PRIMITIVE_NAME,\n  FLOAT_GQL_PRIMITIVE_NAME,\n  ID_GQL_PRIMITIVE_NAME,\n] as const;\n\nexport type GqlPrimitiveNodeNames = typeof gqlPrimitiveNodeNamesList;\nexport type GqlPrimitiveNodeName = GqlPrimitiveNodeNames[number];\n","import type { Serializable } from \"@powerhousedao/document-engineering/graphql\";\nimport { getPHCustomScalarByTypeName } from \"@powerhousedao/document-engineering/graphql\";\nimport { pascalCase } from \"change-case\";\nimport type {\n  ASTNode,\n  DefinitionNode,\n  DocumentNode,\n  EnumTypeDefinitionNode,\n  FieldDefinitionNode,\n  GraphQLInputType,\n  GraphQLObjectType,\n  GraphQLOutputType,\n  GraphQLSchema,\n  InputObjectTypeDefinitionNode,\n  ListTypeNode,\n  NamedTypeNode,\n  NonNullTypeNode,\n  ObjectTypeDefinitionNode,\n  ScalarTypeDefinitionNode,\n  TypeNode,\n  UnionTypeDefinitionNode,\n} from \"graphql\";\nimport {\n  buildASTSchema,\n  getOperationAST,\n  getVariableValues,\n  GraphQLError,\n  GraphQLInputObjectType,\n  GraphQLList,\n  GraphQLNonNull,\n  isEnumType,\n  isListType,\n  isNonNullType,\n  isObjectType,\n  isScalarType,\n  Kind,\n  parse,\n  print,\n  visit,\n} from \"graphql\";\nimport { z } from \"zod\";\nimport type { GqlPrimitiveNodeName } from \"../constants/graphql-kinds.js\";\nimport {\n  BOOLEAN_GQL_PRIMITIVE_NAME,\n  FLOAT_GQL_PRIMITIVE_NAME,\n  gqlPrimitiveNodeNamesList,\n  ID_GQL_PRIMITIVE_NAME,\n  INT_GQL_PRIMITIVE_NAME,\n  STRING_GQL_PRIMITIVE_NAME,\n} from \"../constants/graphql-kinds.js\";\nimport { safeParseSdl } from \"../context/schema-context.js\";\nimport type { Scope } from \"../types/documents.js\";\n\nexport function makeStateSchemaNameForScope(modelName: string, scope: string) {\n  const modelNamePascalCase = pascalCase(modelName);\n  const scopePascalCase = pascalCase(scope);\n  const name =\n    scopePascalCase === \"Global\"\n      ? `${modelNamePascalCase}State`\n      : `${modelNamePascalCase}${scopePascalCase}State`;\n  return name;\n}\n\nexport function makeInitialSchemaDoc(modelName: string, scope: string) {\n  const name = makeStateSchemaNameForScope(modelName, scope);\n  const stateSchemaSdl = `type ${name} {\n  \"Add your ${scope} state fields here\"\n  _placeholder: String\n}`;\n  return stateSchemaSdl;\n}\n\nexport function makeOperationInitialDoc(name: string) {\n  const inputSdl = `input ${pascalCase(name)}Input {\n  \"Add your inputs here\"\n  _placeholder: String\n}`;\n  return inputSdl;\n}\n\nexport function makeEmptyOperationSchema(operationName: string): string {\n  const pascalName = pascalCase(operationName);\n  return `input ${pascalName}Input {\\n  _empty: Boolean\\n}`;\n}\n\nexport function isEmptyOperationSchema(\n  schema: string | null | undefined,\n): boolean {\n  if (!schema) return false;\n  // Check if schema only contains _empty: Boolean field\n  return (\n    /_empty:\\s*Boolean/.test(schema) &&\n    !schema.replace(/_empty:\\s*Boolean/, \"\").match(/\\w+:\\s*\\w+/)\n  );\n}\n\nexport function safeParseJsonRecord(json: string) {\n  try {\n    return JSON.parse(json) as Record<string, Serializable>;\n  } catch (_error) {\n    return null;\n  }\n}\n\nexport function makeMinimalObjectForStateType(args: {\n  sharedSchemaDocumentNode: DocumentNode;\n  stateTypeDefinitionNode: ObjectTypeDefinitionNode;\n  existingValue: string;\n}) {\n  const { sharedSchemaDocumentNode, stateTypeDefinitionNode, existingValue } =\n    args;\n  const existingValueObject = safeParseJsonRecord(existingValue);\n  if (!existingValueObject) {\n    return existingValue;\n  }\n  const stateTypeDefinitionFields = stateTypeDefinitionNode.fields;\n  if (!stateTypeDefinitionFields?.length) {\n    return existingValue;\n  }\n  // Initialize visitedTypes with the root type to detect self-recursive types\n  const visitedTypes = new Set<string>([stateTypeDefinitionNode.name.value]);\n  const minimalObject = makeMinimalValuesForObjectFields({\n    schemaDocumentNode: sharedSchemaDocumentNode,\n    fieldDefinitionNodes: stateTypeDefinitionFields,\n    existingValueObject,\n    visitedTypes,\n  });\n  return JSON.stringify(minimalObject, null, 2);\n}\n\nexport function makeMinimalValuesForObjectFields(args: {\n  schemaDocumentNode: DocumentNode;\n  existingValueObject: Record<string, Serializable> | null;\n  fieldDefinitionNodes: readonly FieldDefinitionNode[];\n  visitedTypes?: Set<string>;\n}) {\n  const {\n    schemaDocumentNode,\n    existingValueObject,\n    fieldDefinitionNodes,\n    visitedTypes,\n  } = args;\n  const newJson: Record<string, Serializable> = {};\n\n  for (const astNode of fieldDefinitionNodes) {\n    const fieldName = getASTNodeName(astNode);\n    if (!fieldName) {\n      continue;\n    }\n    const minimalValue = makeMinimalValueForASTNode({\n      fieldName,\n      astNode,\n      schemaDocumentNode,\n      existingValueObject,\n      visitedTypes,\n    });\n    newJson[astNode.name.value] = minimalValue;\n  }\n\n  return newJson;\n}\n\nfunction makeMinimalValueForASTNode(args: {\n  fieldName: string;\n  astNode: ASTNode;\n  schemaDocumentNode: DocumentNode;\n  existingValueObject: Record<string, Serializable> | null;\n  visitedTypes?: Set<string>;\n}): Serializable {\n  const {\n    fieldName,\n    astNode,\n    schemaDocumentNode,\n    existingValueObject,\n    visitedTypes,\n  } = args;\n  const existingFieldValue = existingValueObject?.[fieldName];\n  let node: ASTNode | null = astNode;\n\n  if (isFieldDefinitionNode(astNode)) {\n    node = getASTNodeTypeNode(node);\n  }\n  const isNonNull = isNonNullNode(node);\n  if (isNonNull) {\n    node = getASTNodeTypeNode(node);\n  }\n\n  if (isListTypeNode(node)) {\n    return makeMinimalValueForGqlListNode(\n      node,\n      existingFieldValue,\n      isNonNull,\n      schemaDocumentNode,\n      visitedTypes,\n    );\n  }\n  if (isGqlPrimitiveNode(node)) {\n    return makeMinimalValueForGQLPrimitiveNode(\n      node,\n      existingFieldValue,\n      isNonNull,\n    );\n  }\n\n  const namedTypeDefinitionNode = getNamedTypeDefinitionNode(\n    node,\n    schemaDocumentNode,\n  );\n\n  if (isEnumTypeDefinitionNode(namedTypeDefinitionNode)) {\n    return makeMinimalValueForGqlEnum(\n      namedTypeDefinitionNode,\n      existingFieldValue,\n      isNonNull,\n    );\n  }\n  if (isScalarTypeDefinitionNode(namedTypeDefinitionNode)) {\n    return makeMinimalValueForGqlScalar(\n      namedTypeDefinitionNode,\n      existingFieldValue,\n      isNonNull,\n    );\n  }\n  if (isUnionTypeDefinitionNode(namedTypeDefinitionNode)) {\n    return makeMinimalValueForGqlUnion(\n      namedTypeDefinitionNode,\n      existingFieldValue,\n      schemaDocumentNode,\n      existingValueObject,\n      isNonNull,\n      visitedTypes,\n    );\n  }\n  if (isObjectTypeDefinitionNode(namedTypeDefinitionNode)) {\n    return makeMinimalValueForGqlObject(\n      namedTypeDefinitionNode,\n      schemaDocumentNode,\n      existingValueObject,\n      existingFieldValue,\n      isNonNull,\n      visitedTypes,\n    );\n  }\n\n  return existingFieldValue;\n}\n\nfunction isFieldDefinitionNode(\n  astNodeTypeNode: ASTNode | null,\n): astNodeTypeNode is FieldDefinitionNode {\n  if (!astNodeTypeNode) return false;\n  return astNodeTypeNode.kind === Kind.FIELD_DEFINITION;\n}\n\nfunction isNonNullNode(astNode: ASTNode | null): astNode is NonNullTypeNode {\n  if (!astNode) return false;\n  return astNode.kind === Kind.NON_NULL_TYPE;\n}\n\nexport function isGqlPrimitiveNode(\n  astNodeTypeNode: ASTNode | null,\n): astNodeTypeNode is NamedTypeNode {\n  if (!astNodeTypeNode) return false;\n  const name = getASTNodeName(astNodeTypeNode);\n  return gqlPrimitiveNodeNamesList.includes(name as GqlPrimitiveNodeName);\n}\n\nfunction isListTypeNode(\n  astNodeTypeNode: ASTNode | null,\n): astNodeTypeNode is ListTypeNode {\n  if (!astNodeTypeNode) return false;\n  return astNodeTypeNode.kind === Kind.LIST_TYPE;\n}\n\nfunction isEnumTypeDefinitionNode(\n  definitionNode: DefinitionNode | null,\n): definitionNode is EnumTypeDefinitionNode {\n  if (!definitionNode) return false;\n  return definitionNode.kind === Kind.ENUM_TYPE_DEFINITION;\n}\n\nfunction isScalarTypeDefinitionNode(\n  definitionNode: DefinitionNode | null,\n): definitionNode is ScalarTypeDefinitionNode {\n  if (!definitionNode) return false;\n  return definitionNode.kind === Kind.SCALAR_TYPE_DEFINITION;\n}\n\nfunction isUnionTypeDefinitionNode(\n  definitionNode: DefinitionNode | null,\n): definitionNode is UnionTypeDefinitionNode {\n  if (!definitionNode) return false;\n  return definitionNode.kind === Kind.UNION_TYPE_DEFINITION;\n}\n\nfunction isObjectTypeDefinitionNode(\n  definitionNode: DefinitionNode | null,\n): definitionNode is ObjectTypeDefinitionNode {\n  if (!definitionNode) return false;\n  return definitionNode.kind === Kind.OBJECT_TYPE_DEFINITION;\n}\n\nfunction getASTNodeName(astNode: ASTNode | null) {\n  if (!astNode) {\n    return null;\n  }\n  if (!(\"name\" in astNode)) {\n    return null;\n  }\n  if (!astNode.name) {\n    return null;\n  }\n  if (!(\"value\" in astNode.name)) {\n    return null;\n  }\n  return astNode.name.value;\n}\n\nfunction getASTNodeTypeNode(astNode: ASTNode | null) {\n  if (!astNode) {\n    return null;\n  }\n  if (!(\"type\" in astNode)) {\n    return null;\n  }\n  return astNode.type;\n}\n\nfunction makeMinimalValueForGQLPrimitiveNode(\n  primitiveTypeNode: NamedTypeNode,\n  existingFieldValue: Serializable,\n  isNonNull: boolean,\n) {\n  const name = getASTNodeName(primitiveTypeNode);\n  if (!name) {\n    return null;\n  }\n  switch (name) {\n    case ID_GQL_PRIMITIVE_NAME: {\n      if (z.string().safeParse(existingFieldValue).success) {\n        return existingFieldValue;\n      }\n      return isNonNull ? \"placeholder-id\" : null;\n    }\n    case BOOLEAN_GQL_PRIMITIVE_NAME: {\n      if (z.boolean().safeParse(existingFieldValue).success) {\n        return existingFieldValue;\n      }\n      return isNonNull ? false : null;\n    }\n    case INT_GQL_PRIMITIVE_NAME: {\n      if (z.number().safeParse(existingFieldValue).success) {\n        return existingFieldValue;\n      }\n      return isNonNull ? 0 : null;\n    }\n    case FLOAT_GQL_PRIMITIVE_NAME: {\n      if (z.number().safeParse(existingFieldValue).success) {\n        return existingFieldValue;\n      }\n      return isNonNull ? 0.0 : null;\n    }\n    case STRING_GQL_PRIMITIVE_NAME: {\n      if (z.string().safeParse(existingFieldValue).success) {\n        return existingFieldValue;\n      }\n      return isNonNull ? \"\" : null;\n    }\n  }\n\n  return isNonNull ? existingFieldValue : null;\n}\n\nfunction makeMinimalValueForGqlEnum(\n  namedTypeDefinitionNode: EnumTypeDefinitionNode,\n  existingFieldValue: Serializable,\n  isNonNull: boolean,\n) {\n  const enumValues =\n    namedTypeDefinitionNode.values?.map((value) => value.name.value) ?? [];\n  if (\n    typeof existingFieldValue === \"string\" &&\n    enumValues.includes(existingFieldValue)\n  ) {\n    return existingFieldValue;\n  }\n  if (isNonNull) {\n    return enumValues[0];\n  }\n  return null;\n}\n\nfunction makeMinimalValueForGqlScalar(\n  scalarTypeDefinitionNode: ScalarTypeDefinitionNode,\n  existingFieldValue: Serializable,\n  isNonNull: boolean,\n) {\n  if (!isNonNull && !existingFieldValue) {\n    return null;\n  }\n  const name = getASTNodeName(scalarTypeDefinitionNode);\n  if (!name) {\n    console.error(\n      \"No name for scalar type definition node\",\n      scalarTypeDefinitionNode,\n    );\n    return null;\n  }\n  const scalar = getPHCustomScalarByTypeName(name);\n  if (!scalar) {\n    return null;\n  }\n  const existingValueIsValid = scalar.schema.safeParse(existingFieldValue);\n  if (existingValueIsValid.success) {\n    return existingFieldValue;\n  }\n  if (!isNonNull) {\n    return null;\n  }\n  const minimalValue = scalar.getDefaultValue?.();\n  if (minimalValue) {\n    return minimalValue;\n  }\n  return existingFieldValue;\n}\n\nfunction makeMinimalValueForGqlUnion(\n  namedTypeDefinitionNode: UnionTypeDefinitionNode,\n  existingFieldValue: Serializable,\n  schemaDocumentNode: DocumentNode,\n  existingValueObject: Record<string, Serializable> | null,\n  isNonNull: boolean,\n  visitedTypes?: Set<string>,\n) {\n  if (!isNonNull && !existingFieldValue) {\n    return null;\n  }\n\n  const types = namedTypeDefinitionNode.types;\n  if (!types?.length) {\n    return null;\n  }\n\n  const firstNamedTypeDefinitionNode = namedTypeDefinitionNode.types?.at(0);\n  if (!firstNamedTypeDefinitionNode) {\n    return null;\n  }\n  const firstNamedTypeObjectDefinitionNode = getNamedTypeDefinitionNode(\n    firstNamedTypeDefinitionNode,\n    schemaDocumentNode,\n  );\n  if (!isObjectTypeDefinitionNode(firstNamedTypeObjectDefinitionNode)) {\n    return null;\n  }\n  return makeMinimalValueForGqlObject(\n    firstNamedTypeObjectDefinitionNode,\n    schemaDocumentNode,\n    existingValueObject,\n    existingFieldValue,\n    isNonNull,\n    visitedTypes,\n  );\n}\n\nfunction makeMinimalValueForGqlListNode(\n  listTypeNode: ListTypeNode,\n  existingFieldValue: Serializable,\n  isNonNull: boolean,\n  schemaDocumentNode: DocumentNode,\n  visitedTypes?: Set<string>,\n) {\n  if (!isNonNull && !Array.isArray(existingFieldValue)) {\n    return null;\n  }\n  if (isNonNull && !Array.isArray(existingFieldValue)) {\n    return [];\n  }\n\n  // Process each array item recursively\n  const arrayValue = existingFieldValue as Serializable[];\n  return arrayValue.map((item, index) =>\n    makeMinimalValueForASTNode({\n      fieldName: String(index),\n      astNode: listTypeNode.type,\n      schemaDocumentNode,\n      existingValueObject: { [index]: item },\n      visitedTypes,\n    }),\n  );\n}\n\nfunction makeMinimalValueForGqlObject(\n  objectTypeDefinitionNode: ObjectTypeDefinitionNode,\n  schemaDocumentNode: DocumentNode,\n  _existingValueObject: Record<string, Serializable> | null,\n  existingFieldValue: Serializable,\n  isNonNull: boolean,\n  visitedTypes?: Set<string>,\n) {\n  const typeName = objectTypeDefinitionNode.name.value;\n\n  // Check for recursive types to prevent infinite recursion\n  if (visitedTypes?.has(typeName)) {\n    return null;\n  }\n\n  if (!isNonNull && !existingFieldValue) {\n    return null;\n  }\n  const fields = objectTypeDefinitionNode.fields;\n  if (!fields?.length) {\n    return {};\n  }\n\n  // Track this type to detect cycles\n  const newVisitedTypes = new Set(visitedTypes);\n  newVisitedTypes.add(typeName);\n\n  // Use existingFieldValue (the actual nested object) instead of existingValueObject (parent)\n  const nestedExistingValue =\n    existingFieldValue &&\n    typeof existingFieldValue === \"object\" &&\n    !Array.isArray(existingFieldValue)\n      ? (existingFieldValue as Record<string, Serializable>)\n      : null;\n  return makeMinimalValuesForObjectFields({\n    schemaDocumentNode,\n    existingValueObject: nestedExistingValue,\n    fieldDefinitionNodes: fields,\n    visitedTypes: newVisitedTypes,\n  });\n}\n\nfunction getNamedTypeDefinitionNode(\n  astNodeTypeNode: ASTNode | null,\n  schemaDocumentNode: DocumentNode,\n) {\n  if (!astNodeTypeNode) {\n    return null;\n  }\n  const name = getASTNodeName(astNodeTypeNode);\n  if (!name) {\n    return null;\n  }\n  const definitionNode = schemaDocumentNode.definitions.find(\n    (def) => \"kind\" in def && \"name\" in def && def.name?.value === name,\n  );\n  if (!definitionNode) {\n    return null;\n  }\n  return definitionNode;\n}\n\nfunction removeWhitespace(str: string) {\n  return str.replace(/\\s+|\\\\n|\\\\t/g, \"\").toLowerCase();\n}\n\nexport function compareStringsWithoutWhitespace(\n  str1: string | null | undefined,\n  str2: string | null | undefined,\n) {\n  if (\n    str1 === null ||\n    str2 === null ||\n    str1 === undefined ||\n    str2 === undefined\n  )\n    return false;\n  return removeWhitespace(str1) === removeWhitespace(str2);\n}\n\nexport function renameSchemaType(\n  sdl: string,\n  oldName: string,\n  newName: string,\n  scope: Scope,\n): string {\n  const typeSuffix = scope === \"global\" ? \"State\" : \"LocalState\";\n  const oldTypeName = `${pascalCase(oldName)}${typeSuffix}`;\n  const newTypeName = `${pascalCase(newName)}${typeSuffix}`;\n\n  const ast = safeParseSdl(sdl);\n  if (!ast) return sdl;\n\n  const updatedAst = visit(ast, {\n    ObjectTypeDefinition: (node) => {\n      if (node.name.value === oldTypeName) {\n        return {\n          ...node,\n          name: {\n            ...node.name,\n            value: newTypeName,\n          },\n        };\n      }\n    },\n  });\n\n  return print(updatedAst);\n}\n\nexport function initializeModelSchema(modelName: string) {\n  const initialSchemaDoc = makeInitialSchemaDoc(modelName, \"global\");\n  return initialSchemaDoc;\n}\n\nexport function updateModelSchemaNames(params: {\n  oldName: string;\n  newName: string;\n  globalStateSchema: string;\n  localStateSchema: string;\n  setStateSchema: (schema: string, scope: Scope) => void;\n}) {\n  const {\n    oldName,\n    newName,\n    globalStateSchema,\n    localStateSchema,\n    setStateSchema,\n  } = params;\n\n  const newSchema = renameSchemaType(\n    globalStateSchema,\n    oldName,\n    newName,\n    \"global\",\n  );\n  setStateSchema(newSchema, \"global\");\n\n  if (localStateSchema) {\n    const newLocalStateSchema = renameSchemaType(\n      localStateSchema,\n      oldName,\n      newName,\n      \"local\",\n    );\n    setStateSchema(newLocalStateSchema, \"local\");\n  }\n}\n\nexport function handleModelNameChange(params: {\n  oldName: string;\n  newName: string;\n  globalStateSchema: string;\n  localStateSchema: string;\n  setStateSchema: (schema: string, scope: Scope) => void;\n}) {\n  const { newName, globalStateSchema, setStateSchema } = params;\n\n  const hasExistingSchema = !!globalStateSchema;\n\n  if (!hasExistingSchema) {\n    const initialSchemaDoc = initializeModelSchema(newName);\n    setStateSchema(initialSchemaDoc, \"global\");\n    return;\n  }\n\n  updateModelSchemaNames(params);\n}\n\n/**\n * Converts an output object type into an equivalent input object type.\n * Intended for structural validation of state objects.\n */\nexport function objectTypeToInputType(\n  schema: GraphQLSchema,\n  objectType: GraphQLObjectType,\n  options?: {\n    nameSuffix?: string;\n    cache?: Map<string, GraphQLInputObjectType>;\n  },\n): GraphQLInputObjectType {\n  const suffix = options?.nameSuffix ?? \"Input\";\n  const cache = options?.cache ?? new Map<string, GraphQLInputObjectType>();\n\n  const inputTypeName = `${objectType.name}${suffix}`;\n\n  if (cache.has(inputTypeName)) {\n    return cache.get(inputTypeName)!;\n  }\n\n  const inputType = new GraphQLInputObjectType({\n    name: inputTypeName,\n    fields: () => {\n      const fields = objectType.getFields();\n      const inputFields: Record<string, { type: GraphQLInputType }> = {};\n\n      for (const fieldName in fields) {\n        const field = fields[fieldName];\n\n        if (field.args.length > 0) {\n          throw new Error(\n            `Cannot convert field \"${objectType.name}.${fieldName}\" with arguments into input type`,\n          );\n        }\n\n        inputFields[fieldName] = {\n          type: outputTypeToInputType(schema, field.type, suffix, cache),\n        };\n      }\n\n      return inputFields;\n    },\n  });\n\n  cache.set(inputTypeName, inputType);\n  return inputType;\n}\n\nfunction outputTypeToInputType(\n  schema: GraphQLSchema,\n  type: GraphQLOutputType,\n  suffix: string,\n  cache: Map<string, GraphQLInputObjectType>,\n): GraphQLInputType {\n  if (isNonNullType(type)) {\n    return new GraphQLNonNull(\n      outputTypeToInputType(schema, type.ofType, suffix, cache),\n    );\n  }\n\n  if (isListType(type)) {\n    return new GraphQLList(\n      outputTypeToInputType(schema, type.ofType, suffix, cache),\n    );\n  }\n\n  if (isScalarType(type) || isEnumType(type)) {\n    return type;\n  }\n\n  if (isObjectType(type)) {\n    return objectTypeToInputType(schema, type, {\n      nameSuffix: suffix,\n      cache,\n    });\n  }\n\n  throw new Error(`Unsupported output type: ${type.toString()}`);\n}\n\nexport function validateStateObject(\n  sharedSchemaDocumentNode: DocumentNode,\n  stateTypeDefinitionNode: ObjectTypeDefinitionNode,\n  stateValue: string,\n): Error[] {\n  let stateObjectJson: Record<string, unknown> | undefined;\n  try {\n    stateObjectJson = JSON.parse(stateValue) as Record<string, unknown>;\n  } catch (error) {\n    return [new Error(\"Invalid JSON object\", { cause: error })];\n  }\n\n  // 2) Build a quick index of type definitions from the shared schema\n  const typeDefByName = indexTypeDefinitions(sharedSchemaDocumentNode);\n\n  // Ensure the passed node exists in the shared schema (optional but helpful)\n  const stateTypeName = stateTypeDefinitionNode.name.value;\n  if (!typeDefByName.has(stateTypeName)) {\n    return [\n      new Error(\n        `State type \"${stateTypeName}\" was not found in sharedSchemaDocumentNode`,\n      ),\n    ];\n  }\n\n  // 3) Generate input types needed to validate this state object\n  const inputSuffix = \"Input\";\n  const generatedInputDefs = generateInputTypesForObjectTree(\n    stateTypeName,\n    typeDefByName,\n    inputSuffix,\n  );\n\n  // 4) Build a schema that includes the generated input types\n  const augmentedDoc: DocumentNode = {\n    ...sharedSchemaDocumentNode,\n    definitions: [\n      ...sharedSchemaDocumentNode.definitions,\n      ...generatedInputDefs,\n    ],\n  };\n\n  let schema;\n  try {\n    schema = buildASTSchema(augmentedDoc, { assumeValidSDL: false });\n  } catch (e) {\n    return [new Error(\"Failed to build schema from SDL\", { cause: e })];\n  }\n\n  // 5) Validate by coercing variables against the generated input type\n  const inputTypeName = `${stateTypeName}${inputSuffix}`;\n  const opDoc = parse(`query($v: ${inputTypeName}!) { __typename }`);\n  const op = getOperationAST(opDoc);\n\n  if (!op) {\n    return [new Error(\"Failed to create validation operation AST\")];\n  }\n\n  const { errors } = getVariableValues(schema, op.variableDefinitions ?? [], {\n    v: stateObjectJson,\n  });\n\n  // Detect recursive types first - these take priority over NON_NULL errors\n  const recursiveTypeErrors = detectRecursiveTypes(\n    stateTypeDefinitionNode,\n    typeDefByName,\n  );\n\n  // Get the field names that have recursive types\n  const recursiveFieldNames = new Set(recursiveTypeErrors.map((e) => e.field));\n\n  const validationErrors = errors\n    ? graphQLErrorsToStateValidationErrors(errors).filter((e) => {\n        // Filter out NON_NULL errors caused by recursive types\n        if (e instanceof StateValidationError && e.kind === \"NON_NULL\") {\n          // Check if this error is in a path that starts with a recursive field\n          const rootField = e.path[0];\n          if (\n            typeof rootField === \"string\" &&\n            recursiveFieldNames.has(rootField)\n          ) {\n            return false;\n          }\n        }\n        return true;\n      })\n    : [];\n\n  // Add recursive type errors first (they have priority)\n  validationErrors.unshift(...recursiveTypeErrors);\n\n  const missingOptionalErrors = detectMissingOptionalFields(\n    sharedSchemaDocumentNode,\n    stateTypeDefinitionNode,\n    stateObjectJson,\n  );\n  validationErrors.push(...missingOptionalErrors);\n\n  return validationErrors;\n}\n\n/**\n * Indexes object/input/enum/scalar/interface/union type definition nodes by name.\n * Note: only AST definitions that have a \"name\" field are indexed.\n */\nfunction indexTypeDefinitions(doc: DocumentNode): Map<string, DefinitionNode> {\n  const map = new Map<string, DefinitionNode>();\n\n  for (const def of doc.definitions) {\n    if (\n      def.kind === Kind.OBJECT_TYPE_DEFINITION ||\n      def.kind === Kind.INPUT_OBJECT_TYPE_DEFINITION ||\n      def.kind === Kind.ENUM_TYPE_DEFINITION ||\n      def.kind === Kind.SCALAR_TYPE_DEFINITION ||\n      def.kind === Kind.INTERFACE_TYPE_DEFINITION ||\n      def.kind === Kind.UNION_TYPE_DEFINITION ||\n      def.kind === Kind.OBJECT_TYPE_EXTENSION ||\n      def.kind === Kind.INPUT_OBJECT_TYPE_EXTENSION ||\n      def.kind === Kind.ENUM_TYPE_EXTENSION ||\n      def.kind === Kind.INTERFACE_TYPE_EXTENSION ||\n      def.kind === Kind.UNION_TYPE_EXTENSION\n    ) {\n      // Extensions also have names; we index them too (but see note below).\n      // In production, you may want to merge extensions into base definitions.\n      // For state validation, prefer definitions (not extensions) if both exist.\n      const name = def.name.value;\n      if (!map.has(name)) {\n        map.set(name, def);\n      }\n    }\n  }\n\n  return map;\n}\n\n/**\n * Generates InputObjectTypeDefinitionNode(s) for a root object type and any nested\n * object types reachable via fields, converting object references to their *Input equivalents*.\n */\nfunction generateInputTypesForObjectTree(\n  rootObjectTypeName: string,\n  typeDefByName: Map<string, DefinitionNode>,\n  inputSuffix: string,\n): InputObjectTypeDefinitionNode[] {\n  const generated = new Map<string, InputObjectTypeDefinitionNode>();\n  const visiting = new Set<string>();\n\n  const ensureInputForObject = (objectTypeName: string) => {\n    const inputName = `${objectTypeName}${inputSuffix}`;\n    if (generated.has(inputName)) return;\n\n    if (visiting.has(objectTypeName)) {\n      // Recursive reference; we rely on GraphQLInputObjectType lazy field resolution via AST schema build.\n      // Still, we must avoid infinite loops while generating AST nodes.\n      return;\n    }\n    visiting.add(objectTypeName);\n\n    const def = typeDefByName.get(objectTypeName);\n    if (!def) {\n      throw new GraphQLError(`Unknown referenced type \"${objectTypeName}\"`);\n    }\n\n    if (\n      def.kind !== Kind.OBJECT_TYPE_DEFINITION &&\n      def.kind !== Kind.OBJECT_TYPE_EXTENSION\n    ) {\n      throw new GraphQLError(\n        `Type \"${objectTypeName}\" is not an object type; cannot generate input from kind \"${def.kind}\"`,\n      );\n    }\n\n    const objDef = def as ObjectTypeDefinitionNode;\n\n    // Convert each field type to an input-acceptable TypeNode.\n    const inputFields =\n      objDef.fields?.map((f) => {\n        return {\n          kind: Kind.INPUT_VALUE_DEFINITION as const,\n          name: f.name,\n          description: f.description,\n          directives: [], // output-field directives don't automatically translate to input fields\n          type: convertOutputTypeNodeToInputTypeNode(\n            f.type,\n            typeDefByName,\n            inputSuffix,\n            ensureInputForObject,\n          ),\n          defaultValue: undefined,\n        };\n      }) ?? [];\n\n    const inputDef: InputObjectTypeDefinitionNode = {\n      kind: Kind.INPUT_OBJECT_TYPE_DEFINITION,\n      name: { kind: Kind.NAME, value: inputName },\n      description: objDef.description,\n      directives: [],\n      fields: inputFields,\n    };\n\n    generated.set(inputName, inputDef);\n\n    visiting.delete(objectTypeName);\n  };\n\n  // Kick off generation for root\n  ensureInputForObject(rootObjectTypeName);\n\n  return Array.from(generated.values());\n}\n\nfunction convertOutputTypeNodeToInputTypeNode(\n  typeNode: TypeNode,\n  typeDefByName: Map<string, DefinitionNode>,\n  inputSuffix: string,\n  ensureInputForObject: (objectTypeName: string) => void,\n): TypeNode {\n  switch (typeNode.kind) {\n    case Kind.NON_NULL_TYPE:\n      return {\n        kind: Kind.NON_NULL_TYPE,\n        type: convertOutputTypeNodeToInputTypeNode(\n          typeNode.type,\n          typeDefByName,\n          inputSuffix,\n          ensureInputForObject,\n        ) as NamedTypeNode | ListTypeNode,\n      };\n\n    case Kind.LIST_TYPE:\n      return {\n        kind: Kind.LIST_TYPE,\n        type: convertOutputTypeNodeToInputTypeNode(\n          typeNode.type,\n          typeDefByName,\n          inputSuffix,\n          ensureInputForObject,\n        ),\n      };\n\n    case Kind.NAMED_TYPE: {\n      const named = typeNode as NamedTypeNode;\n      const name = named.name.value;\n\n      const def = typeDefByName.get(name);\n\n      // If it's an object type, we must reference its generated input twin.\n      if (\n        def?.kind === Kind.OBJECT_TYPE_DEFINITION ||\n        def?.kind === Kind.OBJECT_TYPE_EXTENSION\n      ) {\n        ensureInputForObject(name);\n        return {\n          kind: Kind.NAMED_TYPE,\n          name: { kind: Kind.NAME, value: `${name}${inputSuffix}` },\n        };\n      }\n\n      // Scalars/enums/input objects are valid as-is in input positions.\n      if (\n        !def ||\n        def.kind === Kind.SCALAR_TYPE_DEFINITION ||\n        def.kind === Kind.ENUM_TYPE_DEFINITION ||\n        def.kind === Kind.INPUT_OBJECT_TYPE_DEFINITION ||\n        def.kind === Kind.INPUT_OBJECT_TYPE_EXTENSION\n      ) {\n        return named;\n      }\n\n      // Interfaces/unions are not valid input types.\n      if (\n        def.kind === Kind.INTERFACE_TYPE_DEFINITION ||\n        def.kind === Kind.UNION_TYPE_DEFINITION\n      ) {\n        throw new GraphQLError(\n          `Type \"${name}\" (${def.kind}) cannot be used in an input type`,\n        );\n      }\n\n      // Anything else is unexpected.\n      throw new GraphQLError(\n        `Unsupported named type \"${name}\" of kind \"${def.kind}\"`,\n      );\n    }\n\n    default:\n      // Exhaustiveness guard\n      throw new GraphQLError(\n        `Unsupported TypeNode kind: ${JSON.stringify(typeNode)}`,\n      );\n  }\n}\n\nexport type StateValidationErrorKind =\n  | \"MISSING\"\n  | \"MISSING_OPTIONAL\"\n  | \"UNKNOWN_FIELD\"\n  | \"NON_NULL\"\n  | \"TYPE\"\n  | \"RECURSIVE_TYPE\";\n\nexport type StateValidationErrorPayload =\n  | {\n      kind: \"MISSING\";\n      path: (string | number)[];\n      field: string;\n      expectedType?: string; // e.g. \"String!\"\n    }\n  | {\n      kind: \"MISSING_OPTIONAL\";\n      path: (string | number)[];\n      field: string;\n      expectedType?: string; // e.g. \"String\"\n    }\n  | {\n      kind: \"UNKNOWN_FIELD\";\n      path: (string | number)[];\n      field: string;\n      didYouMean?: string; // e.g. \"test\"\n      typeName?: string; // e.g. \"Test5StateInput\"\n    }\n  | {\n      kind: \"NON_NULL\";\n      path: (string | number)[];\n      field: string;\n      expectedType?: string; // e.g. \"Int!\"\n    }\n  | {\n      kind: \"TYPE\";\n      path: (string | number)[];\n      field: string;\n      expectedType?: string; // e.g. \"String\" (or custom scalar)\n      details?: string; // optional raw hint (e.g. \"cannot represent ...\")\n    }\n  | {\n      kind: \"RECURSIVE_TYPE\";\n      path: (string | number)[];\n      field: string;\n      typeName: string; // e.g. \"Item\"\n    };\n\nexport class StateValidationError extends Error {\n  readonly payload: StateValidationErrorPayload;\n  readonly originalMessage?: string;\n\n  constructor(payload: StateValidationErrorPayload, originalMessage?: string) {\n    // Keep Error.message stable but not user-facing; UI should render from payload.\n    super(payload.kind);\n    this.name = \"StateValidationError\";\n    this.payload = payload;\n    this.originalMessage = originalMessage;\n    Object.setPrototypeOf(this, new.target.prototype);\n  }\n\n  get kind(): StateValidationErrorKind {\n    return this.payload.kind;\n  }\n\n  get path(): (string | number)[] {\n    return this.payload.path;\n  }\n\n  get field(): string {\n    return this.payload.field;\n  }\n}\n\nfunction extractInputPath(message: string): (string | number)[] {\n  const match = message.match(/at\\s+\"([^\"]+)\"/);\n  if (!match) return [];\n  const parts = match[1].split(\".\").filter(Boolean);\n  const withoutVar = parts[0] === \"v\" ? parts.slice(1) : parts;\n  return withoutVar.map((p) => (/^\\d+$/.test(p) ? Number(p) : p));\n}\n\nconst RE_MISSING_REQUIRED_FIELD =\n  /Field \"([^\"]+)\" of required type \"([^\"]+)\" was not provided\\./;\n\nconst RE_UNKNOWN_FIELD =\n  /Field \"([^\"]+)\" is not defined by type \"([^\"]+)\"\\.(?: Did you mean \"([^\"]+)\"\\?)?/;\n\nfunction extractMissingRequiredField(\n  message: string,\n): { field: string; expectedType: string } | null {\n  const m = message.match(RE_MISSING_REQUIRED_FIELD);\n  if (!m) return null;\n  return { field: m[1], expectedType: m[2] };\n}\n\nfunction extractUnknownField(\n  message: string,\n): { field: string; typeName: string; didYouMean?: string } | null {\n  const m = message.match(RE_UNKNOWN_FIELD);\n  if (!m) return null;\n  return { field: m[1], typeName: m[2], didYouMean: m[3] };\n}\n\nfunction lastFieldFromPath(path: (string | number)[]): string | undefined {\n  for (let i = path.length - 1; i >= 0; i--) {\n    if (typeof path[i] === \"string\") return path[i] as string;\n  }\n  return undefined;\n}\n\nfunction extractExpectedType(message: string): string | undefined {\n  // NON_NULL: Expected non-nullable type \"Int!\" not to be null.\n  let m = message.match(/Expected non-nullable type \"([^\"]+)\"/);\n  if (m?.[1]) return m[1];\n\n  // Sometimes: Expected type \"X\" ...\n  m = message.match(/Expected type \"([^\"]+)\"/);\n  if (m?.[1]) return m[1];\n\n  // Scalar coercion: \"; String cannot represent ...\"\n  m = message.match(/;\\s*([_A-Za-z][_0-9A-Za-z]*)\\s+cannot represent/i);\n  if (m?.[1]) return m[1];\n\n  return undefined;\n}\n\nexport function graphQLErrorsToStateValidationErrors(\n  errors: readonly Error[],\n): StateValidationError[] {\n  const out: StateValidationError[] = [];\n\n  for (const e of errors) {\n    const originalMessage = e.message;\n\n    // 1) Missing required field (no `at \"v.x\"` path usually)\n    const missing = extractMissingRequiredField(originalMessage);\n    if (missing) {\n      out.push(\n        new StateValidationError(\n          {\n            kind: \"MISSING\",\n            path: [missing.field],\n            field: missing.field,\n            expectedType: missing.expectedType, // if your payload supports it\n          },\n          originalMessage,\n        ),\n      );\n      continue;\n    }\n\n    // 2) Unknown field (extra key)\n    const unknown = extractUnknownField(originalMessage);\n    if (unknown) {\n      out.push(\n        new StateValidationError(\n          {\n            kind: \"UNKNOWN_FIELD\",\n            path: [unknown.field],\n            field: unknown.field,\n            didYouMean: unknown.didYouMean, // optional\n          },\n          originalMessage,\n        ),\n      );\n      continue;\n    }\n\n    // 3) Usual `at \"v.path\"` extraction (NON_NULL / TYPE)\n    const path = extractInputPath(originalMessage);\n    const field = lastFieldFromPath(path) ?? \"value\";\n    const expectedType = extractExpectedType(originalMessage);\n\n    if (\n      originalMessage.includes(\"Expected non-nullable type\") &&\n      originalMessage.includes(\"not to be null\")\n    ) {\n      out.push(\n        new StateValidationError(\n          { kind: \"NON_NULL\", path, field, expectedType },\n          originalMessage,\n        ),\n      );\n      continue;\n    }\n\n    if (\n      originalMessage.includes(\"cannot represent\") ||\n      originalMessage.includes(\"Expected type\")\n    ) {\n      out.push(\n        new StateValidationError(\n          {\n            kind: \"TYPE\",\n            path,\n            field,\n            expectedType,\n            details: originalMessage,\n          },\n          originalMessage,\n        ),\n      );\n      continue;\n    }\n\n    out.push(\n      new StateValidationError(\n        { kind: \"TYPE\", path, field, details: originalMessage },\n        originalMessage,\n      ),\n    );\n  }\n\n  return out;\n}\n\n/**\n * Information about a missing field in the state object.\n */\nexport type MissingFieldInfo = {\n  fieldName: string;\n  path: (string | number)[];\n  isRequired: boolean;\n  /** The underlying type (unwrapped from NonNull if applicable) */\n  type: TypeNode;\n};\n\n/**\n * Finds all fields defined in the schema that are missing from the state object.\n * Returns information about each missing field including whether it's required.\n */\nexport function findMissingFields(\n  sharedSchemaDocumentNode: DocumentNode,\n  rootTypeNode: ObjectTypeDefinitionNode,\n  value: string | Record<string, unknown>,\n  basePath: (string | number)[] = [],\n): MissingFieldInfo[] {\n  let stateObjectJson: Record<string, unknown> | undefined;\n  try {\n    stateObjectJson =\n      typeof value === \"string\"\n        ? (JSON.parse(value) as Record<string, unknown>)\n        : value;\n  } catch {\n    return [];\n  }\n\n  const typeByName = indexObjectTypes(sharedSchemaDocumentNode);\n  const missingFields: MissingFieldInfo[] = [];\n\n  for (const field of rootTypeNode.fields ?? []) {\n    const fieldName = field.name.value;\n    const fieldPath = [...basePath, fieldName];\n    const isRequired = field.type.kind === Kind.NON_NULL_TYPE;\n    // Unwrap NonNull to get the underlying type\n    const underlyingType = isRequired\n      ? (field.type as NonNullTypeNode).type\n      : field.type;\n\n    // Check if field is missing from the state object\n    if (!(fieldName in stateObjectJson)) {\n      missingFields.push({\n        fieldName,\n        path: fieldPath,\n        isRequired,\n        type: underlyingType,\n      });\n      continue;\n    }\n\n    // If present and object-typed → recurse to check nested missing fields\n    const namedType = unwrapNamedType(field.type);\n    const childType = namedType ? typeByName.get(namedType) : undefined;\n\n    if (\n      childType &&\n      typeof stateObjectJson[fieldName] === \"object\" &&\n      stateObjectJson[fieldName] !== null &&\n      !Array.isArray(stateObjectJson[fieldName])\n    ) {\n      const nestedMissing = findMissingFields(\n        sharedSchemaDocumentNode,\n        childType,\n        stateObjectJson[fieldName] as Record<string, unknown>,\n        fieldPath,\n      );\n      missingFields.push(...nestedMissing);\n    }\n  }\n\n  return missingFields;\n}\n\n/**\n * Detects optional fields defined in the schema that are missing from the state object.\n * Returns StateValidationError[] for each missing optional field.\n */\nexport function detectMissingOptionalFields(\n  sharedSchemaDocumentNode: DocumentNode,\n  rootTypeNode: ObjectTypeDefinitionNode,\n  value: string | Record<string, unknown>,\n): StateValidationError[] {\n  const missingFields = findMissingFields(\n    sharedSchemaDocumentNode,\n    rootTypeNode,\n    value,\n  );\n\n  // Only report optional (not required) fields as MISSING_OPTIONAL errors\n  // Required fields are already caught by GraphQL validation\n  return missingFields\n    .filter((field) => !field.isRequired)\n    .map(\n      (field) =>\n        new StateValidationError({\n          kind: \"MISSING_OPTIONAL\",\n          path: field.path,\n          field: field.fieldName,\n          expectedType: typeNodeToString(field.type),\n        }),\n    );\n}\n\n/**\n * Detects fields that have recursive types (types that reference themselves directly or indirectly).\n * Returns a RECURSIVE_TYPE error for each field that contains a recursive type.\n */\nfunction detectRecursiveTypes(\n  stateTypeDefinitionNode: ObjectTypeDefinitionNode,\n  typeDefByName: Map<string, DefinitionNode>,\n): StateValidationError[] {\n  const errors: StateValidationError[] = [];\n\n  for (const field of stateTypeDefinitionNode.fields ?? []) {\n    const fieldName = field.name.value;\n    const namedTypeName = getNamedTypeName(field.type);\n\n    if (!namedTypeName) continue;\n\n    // Check if this field's type is recursive\n    if (isRecursiveType(namedTypeName, typeDefByName, new Set())) {\n      errors.push(\n        new StateValidationError({\n          kind: \"RECURSIVE_TYPE\",\n          path: [fieldName],\n          field: fieldName,\n          typeName: namedTypeName,\n        }),\n      );\n    }\n  }\n\n  return errors;\n}\n\n/**\n * Gets the named type name from a TypeNode, unwrapping NonNull and List types.\n */\nfunction getNamedTypeName(typeNode: TypeNode): string | null {\n  if (typeNode.kind === Kind.NAMED_TYPE) {\n    return typeNode.name.value;\n  }\n  if (\n    typeNode.kind === Kind.NON_NULL_TYPE ||\n    typeNode.kind === Kind.LIST_TYPE\n  ) {\n    return getNamedTypeName(typeNode.type);\n  }\n  return null;\n}\n\n/**\n * Checks if a type is recursive (references itself directly or indirectly through required fields).\n */\nfunction isRecursiveType(\n  typeName: string,\n  typeDefByName: Map<string, DefinitionNode>,\n  visitedTypes: Set<string>,\n): boolean {\n  if (visitedTypes.has(typeName)) {\n    return true;\n  }\n\n  const typeDef = typeDefByName.get(typeName);\n  if (!typeDef || typeDef.kind !== Kind.OBJECT_TYPE_DEFINITION) {\n    return false;\n  }\n\n  visitedTypes.add(typeName);\n\n  for (const field of typeDef.fields ?? []) {\n    // Only check required fields for recursion (NonNull types)\n    if (field.type.kind !== Kind.NON_NULL_TYPE) continue;\n\n    const innerType = field.type.type;\n    let fieldTypeName: string | null = null;\n\n    if (innerType.kind === Kind.NAMED_TYPE) {\n      fieldTypeName = innerType.name.value;\n    } else if (innerType.kind === Kind.LIST_TYPE) {\n      // For list types like [Item!]!, get the inner type\n      fieldTypeName = getNamedTypeName(innerType);\n    }\n\n    if (\n      fieldTypeName &&\n      isRecursiveType(fieldTypeName, typeDefByName, visitedTypes)\n    ) {\n      return true;\n    }\n  }\n\n  visitedTypes.delete(typeName);\n  return false;\n}\n\n/**\n * Converts a TypeNode to its string representation (e.g., \"String\", \"Int!\", \"[String]!\")\n */\nfunction typeNodeToString(typeNode: TypeNode): string {\n  switch (typeNode.kind) {\n    case Kind.NAMED_TYPE:\n      return typeNode.name.value;\n    case Kind.NON_NULL_TYPE:\n      return `${typeNodeToString(typeNode.type)}!`;\n    case Kind.LIST_TYPE:\n      return `[${typeNodeToString(typeNode.type)}]`;\n  }\n}\n\nfunction indexObjectTypes(\n  doc: DocumentNode,\n): Map<string, ObjectTypeDefinitionNode> {\n  const map = new Map<string, ObjectTypeDefinitionNode>();\n  for (const def of doc.definitions) {\n    if (def.kind === Kind.OBJECT_TYPE_DEFINITION) {\n      map.set(def.name.value, def);\n    }\n  }\n  return map;\n}\n\nfunction unwrapNamedType(typeNode: TypeNode): string | undefined {\n  if (typeNode.kind === Kind.NAMED_TYPE) return typeNode.name.value;\n  if (typeNode.kind === Kind.NON_NULL_TYPE)\n    return unwrapNamedType(typeNode.type);\n  if (typeNode.kind === Kind.LIST_TYPE) return unwrapNamedType(typeNode.type);\n  return undefined;\n}\n","import type { Diagnostic } from \"@codemirror/lint\";\nimport { pascalCase, sentenceCase } from \"change-case\";\nimport { Kind } from \"graphql\";\nimport { safeParseSdl } from \"../context/schema-context.js\";\nimport { makeStateSchemaNameForScope } from \"./helpers.js\";\n\nexport function ensureDocumentContainsNodeWithNameAndType(\n  doc: string,\n  nodeName: string,\n  nodeType: keyof typeof Kind,\n): boolean {\n  const parsedDoc = safeParseSdl(doc);\n\n  if (!parsedDoc) return true;\n\n  return parsedDoc.definitions.some((def) => {\n    const hasMatchingType = def.kind === Kind[nodeType];\n\n    return hasMatchingType && \"name\" in def && def.name?.value === nodeName;\n  });\n}\n\nexport function createNodeTypeAndNameDiagnostic(\n  doc: string,\n  errorMessage: string,\n): Diagnostic | undefined {\n  const parsedDoc = safeParseSdl(doc);\n  if (!parsedDoc) return undefined;\n\n  const firstNode = parsedDoc.definitions[0];\n\n  const nameNode = \"name\" in firstNode ? firstNode.name : null;\n\n  return {\n    from: nameNode?.loc?.start ?? firstNode.loc?.start ?? 0,\n    to: nameNode?.loc?.end ?? firstNode.loc?.end ?? 0,\n    severity: \"error\",\n    message: errorMessage,\n  };\n}\n\nexport function ensureValidStateSchemaName(\n  doc: string,\n  modelName: string,\n  scope: string,\n) {\n  if (!safeParseSdl(doc)) return [];\n  const requiredTypeName = makeStateSchemaNameForScope(modelName, scope);\n  if (\n    !ensureDocumentContainsNodeWithNameAndType(\n      doc,\n      requiredTypeName,\n      \"OBJECT_TYPE_DEFINITION\",\n    )\n  ) {\n    return [\n      createNodeTypeAndNameDiagnostic(\n        doc,\n        `${sentenceCase(scope)} state schema must be named ${requiredTypeName}`,\n      ),\n    ].filter((d) => d !== undefined);\n  }\n\n  return [];\n}\n\nexport function ensureValidOperationSchemaInputName(\n  doc: string | undefined,\n  operationName: string,\n) {\n  if (!doc || !safeParseSdl(doc)) return [];\n\n  const requiredTypeName = `${pascalCase(operationName)}Input`;\n  if (\n    !ensureDocumentContainsNodeWithNameAndType(\n      doc,\n      requiredTypeName,\n      \"INPUT_OBJECT_TYPE_DEFINITION\",\n    )\n  ) {\n    return [\n      createNodeTypeAndNameDiagnostic(\n        doc,\n        `Operation schema must contain an input type named ${requiredTypeName}`,\n      ),\n    ].filter((d) => d !== undefined);\n  }\n\n  return [];\n}\n","import type { ComponentPropsWithRef } from \"react\";\nimport { forwardRef } from \"react\";\nimport { twMerge } from \"tailwind-merge\";\n\ntype Props = ComponentPropsWithRef<\"button\">;\n\nexport const Button = forwardRef<HTMLButtonElement, Props>((props, ref) => {\n  const { className, ...rest } = props;\n  return (\n    <button\n      ref={ref}\n      {...rest}\n      className={twMerge(\n        \"h-10 rounded-md border border-border bg-background px-4 py-2 text-sm font-medium whitespace-nowrap text-foreground transition-colors hover:hover-effect focus-visible:ring-2 focus-visible:ring-offset-2 focus-visible:outline-none disabled:disabled-effect\",\n        className,\n      )}\n    />\n  );\n});\n"],"x_google_ignoreList":[0,1],"mappings":";;;;;;;;;;;;;;AAOA,SAAgB,gBAAgB,aAAa,eAAe;CAC1D,IAAI,YAAY;AAEhB,MAAK,MAAM,cAAc,YAAY,YACnC,KAAI,WAAW,SAAS,KAAK,sBAAsB;EACjD,IAAI;AAEJ,MAAI,iBAAiB,MAAM;AAIzB,OAAI,UACF,QAAO;AAGT,eAAY;eAEV,mBAAmB,WAAW,UAAU,QAC1C,qBAAqB,KAAK,IACtB,KAAK,IACL,iBAAiB,WAAW,cAEhC,QAAO;;AAKb,QAAO;;;;ACjCT,MAAM,uBAAuB;AAC7B,MAAM,uBAAuB;AAE7B,MAAM,2BAA2B;AAEjC,MAAM,uBAAuB;AAE7B,MAAM,sBAAsB;AAE5B,MAAM,mCAAmC;;;;AAIzC,SAAgB,MAAM,OAAO;CACzB,IAAI,SAAS,MAAM,MAAM;AACzB,UAAS,OACJ,QAAQ,sBAAsB,oBAAoB,CAClD,QAAQ,sBAAsB,oBAAoB;AACvD,UAAS,OAAO,QAAQ,sBAAsB,KAAK;CACnD,IAAI,QAAQ;CACZ,IAAI,MAAM,OAAO;AAEjB,QAAO,OAAO,OAAO,MAAM,KAAK,KAC5B;AACJ,KAAI,UAAU,IACV,QAAO,EAAE;AACb,QAAO,OAAO,OAAO,MAAM,EAAE,KAAK,KAC9B;AACJ,QAAO,OAAO,MAAM,OAAO,IAAI,CAAC,MAAM,MAAM;;;;;AAKhD,SAAgB,qBAAqB,OAAO;CACxC,MAAM,QAAQ,MAAM,MAAM;AAC1B,MAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;EACnC,MAAM,OAAO,MAAM;EACnB,MAAM,QAAQ,yBAAyB,KAAK,KAAK;AACjD,MAAI,OAAO;GACP,MAAM,SAAS,MAAM,SAAS,MAAM,MAAM,MAAM,IAAI;AACpD,SAAM,OAAO,GAAG,GAAG,KAAK,MAAM,GAAG,OAAO,EAAE,KAAK,MAAM,OAAO,CAAC;;;AAGrE,QAAO;;;;;AAKX,SAAgB,OAAO,OAAO,SAAS;CACnC,MAAM,CAAC,QAAQ,OAAO,UAAU,kBAAkB,OAAO,QAAQ;AACjE,QAAQ,SACJ,MAAM,IAAI,aAAa,SAAS,OAAO,CAAC,CAAC,KAAK,SAAS,aAAa,IAAI,GACxE;;;;;AAyBR,SAAgB,WAAW,OAAO,SAAS;CACvC,MAAM,CAAC,QAAQ,OAAO,UAAU,kBAAkB,OAAO,QAAQ;CACjE,MAAM,QAAQ,aAAa,SAAS,OAAO;CAC3C,MAAM,QAAQ,aAAa,SAAS,OAAO;CAC3C,MAAM,YAAY,SAAS,2BACrB,4BAA4B,OAAO,MAAM,GACzC,2BAA2B,OAAO,MAAM;AAC9C,QAAO,SAAS,MAAM,IAAI,UAAU,CAAC,KAAK,SAAS,aAAa,GAAG,GAAG;;;;;AAwB1E,SAAgB,aAAa,OAAO,SAAS;CACzC,MAAM,CAAC,QAAQ,OAAO,UAAU,kBAAkB,OAAO,QAAQ;AACjE,QAAQ,SACJ,MAAM,IAAI,aAAa,SAAS,OAAO,CAAC,CAAC,KAAK,SAAS,aAAa,IAAI,GACxE;;;;;AAuBR,SAAgB,aAAa,OAAO,SAAS;CACzC,MAAM,CAAC,QAAQ,OAAO,UAAU,kBAAkB,OAAO,QAAQ;CACjE,MAAM,QAAQ,aAAa,SAAS,OAAO;CAE3C,MAAM,YAAY,4BAA4B,OADhC,aAAa,SAAS,OAAO,CACgB;AAC3D,QAAQ,SACJ,MACK,KAAK,MAAM,UAAU;AACtB,MAAI,UAAU,EACV,QAAO,UAAU,KAAK;AAC1B,SAAO,MAAM,KAAK;GACpB,CACG,KAAK,SAAS,aAAa,IAAI,GACpC;;;;;AAKR,SAAgB,UAAU,OAAO,SAAS;AACtC,QAAO,OAAO,OAAO;EAAE,WAAW;EAAK,GAAG;EAAS,CAAC;;AAQxD,SAAS,aAAa,QAAQ;AAC1B,QAAO,WAAW,SACX,UAAU,MAAM,aAAa,IAC7B,UAAU,MAAM,kBAAkB,OAAO;;AAEpD,SAAS,aAAa,QAAQ;AAC1B,QAAO,WAAW,SACX,UAAU,MAAM,aAAa,IAC7B,UAAU,MAAM,kBAAkB,OAAO;;AAEpD,SAAS,4BAA4B,OAAO,OAAO;AAC/C,SAAQ,SAAS,GAAG,MAAM,KAAK,GAAG,GAAG,MAAM,KAAK,MAAM,EAAE,CAAC;;AAE7D,SAAS,2BAA2B,OAAO,OAAO;AAC9C,SAAQ,MAAM,UAAU;EACpB,MAAM,QAAQ,KAAK;AAEnB,UADgB,QAAQ,KAAK,SAAS,OAAO,SAAS,MAAM,MAAM,QAAQ,MAAM,MAAM,IACrE,MAAM,KAAK,MAAM,EAAE,CAAC;;;AAG7C,SAAS,kBAAkB,OAAO,UAAU,EAAE,EAAE;CAC5C,MAAM,UAAU,QAAQ,UAAU,QAAQ,kBAAkB,uBAAuB;CACnF,MAAM,mBAAmB,QAAQ,oBAAoB;CACrD,MAAM,mBAAmB,QAAQ,oBAAoB;CACrD,IAAI,cAAc;CAClB,IAAI,cAAc,MAAM;AACxB,QAAO,cAAc,MAAM,QAAQ;EAC/B,MAAM,OAAO,MAAM,OAAO,YAAY;AACtC,MAAI,CAAC,iBAAiB,SAAS,KAAK,CAChC;AACJ;;AAEJ,QAAO,cAAc,aAAa;EAC9B,MAAM,QAAQ,cAAc;EAC5B,MAAM,OAAO,MAAM,OAAO,MAAM;AAChC,MAAI,CAAC,iBAAiB,SAAS,KAAK,CAChC;AACJ,gBAAc;;AAElB,QAAO;EACH,MAAM,MAAM,GAAG,YAAY;EAC3B,QAAQ,MAAM,MAAM,aAAa,YAAY,CAAC;EAC9C,MAAM,MAAM,YAAY;EAC3B;;;;AC9ML,MAAa,4BAA4B;AACzC,MAAa,6BAA6B;AAE1C,MAAa,2BAA2B;AAGxC,MAAa,4BAA4B;CACvC;CACA;;CAEA;;CAED;;;ACyCD,SAAgB,4BAA4B,WAAmB,OAAe;CAC5E,MAAM,sBAAsB,WAAW,UAAU;CACjD,MAAM,kBAAkB,WAAW,MAAM;AAKzC,QAHE,oBAAoB,WAChB,GAAG,oBAAoB,SACvB,GAAG,sBAAsB,gBAAgB;;AAIjD,SAAgB,qBAAqB,WAAmB,OAAe;AAMrE,QAJuB,QADV,4BAA4B,WAAW,MAAM,CACtB;cACxB,MAAM;;;;AAMpB,SAAgB,wBAAwB,MAAc;AAKpD,QAJiB,SAAS,WAAW,KAAK,CAAC;;;;;AAO7C,SAAgB,yBAAyB,eAA+B;AAEtE,QAAO,SADY,WAAW,cAAc,CACjB;;AAG7B,SAAgB,uBACd,QACS;AACT,KAAI,CAAC,OAAQ,QAAO;AAEpB,QACE,oBAAoB,KAAK,OAAO,IAChC,CAAC,OAAO,QAAQ,qBAAqB,GAAG,CAAC,MAAM,aAAa;;AAIhE,SAAgB,oBAAoB,MAAc;AAChD,KAAI;AACF,SAAO,KAAK,MAAM,KAAK;UAChB,QAAQ;AACf,SAAO;;;AAIX,SAAgB,8BAA8B,MAI3C;CACD,MAAM,EAAE,0BAA0B,yBAAyB,kBACzD;CACF,MAAM,sBAAsB,oBAAoB,cAAc;AAC9D,KAAI,CAAC,oBACH,QAAO;CAET,MAAM,4BAA4B,wBAAwB;AAC1D,KAAI,CAAC,2BAA2B,OAC9B,QAAO;CAIT,MAAM,gBAAgB,iCAAiC;EACrD,oBAAoB;EACpB,sBAAsB;EACtB;EACA,cALmB,IAAI,IAAY,CAAC,wBAAwB,KAAK,MAAM,CAAC;EAMzE,CAAC;AACF,QAAO,KAAK,UAAU,eAAe,MAAM,EAAE;;AAG/C,SAAgB,iCAAiC,MAK9C;CACD,MAAM,EACJ,oBACA,qBACA,sBACA,iBACE;CACJ,MAAM,UAAwC,EAAE;AAEhD,MAAK,MAAM,WAAW,sBAAsB;EAC1C,MAAM,YAAY,eAAe,QAAQ;AACzC,MAAI,CAAC,UACH;EAEF,MAAM,eAAe,2BAA2B;GAC9C;GACA;GACA;GACA;GACA;GACD,CAAC;AACF,UAAQ,QAAQ,KAAK,SAAS;;AAGhC,QAAO;;AAGT,SAAS,2BAA2B,MAMnB;CACf,MAAM,EACJ,WACA,SACA,oBACA,qBACA,iBACE;CACJ,MAAM,qBAAqB,sBAAsB;CACjD,IAAI,OAAuB;AAE3B,KAAI,sBAAsB,QAAQ,CAChC,QAAO,mBAAmB,KAAK;CAEjC,MAAM,YAAY,cAAc,KAAK;AACrC,KAAI,UACF,QAAO,mBAAmB,KAAK;AAGjC,KAAI,eAAe,KAAK,CACtB,QAAO,+BACL,MACA,oBACA,WACA,oBACA,aACD;AAEH,KAAI,mBAAmB,KAAK,CAC1B,QAAO,oCACL,MACA,oBACA,UACD;CAGH,MAAM,0BAA0B,2BAC9B,MACA,mBACD;AAED,KAAI,yBAAyB,wBAAwB,CACnD,QAAO,2BACL,yBACA,oBACA,UACD;AAEH,KAAI,2BAA2B,wBAAwB,CACrD,QAAO,6BACL,yBACA,oBACA,UACD;AAEH,KAAI,0BAA0B,wBAAwB,CACpD,QAAO,4BACL,yBACA,oBACA,oBACA,qBACA,WACA,aACD;AAEH,KAAI,2BAA2B,wBAAwB,CACrD,QAAO,6BACL,yBACA,oBACA,qBACA,oBACA,WACA,aACD;AAGH,QAAO;;AAGT,SAAS,sBACP,iBACwC;AACxC,KAAI,CAAC,gBAAiB,QAAO;AAC7B,QAAO,gBAAgB,SAAS,KAAK;;AAGvC,SAAS,cAAc,SAAqD;AAC1E,KAAI,CAAC,QAAS,QAAO;AACrB,QAAO,QAAQ,SAAS,KAAK;;AAG/B,SAAgB,mBACd,iBACkC;AAClC,KAAI,CAAC,gBAAiB,QAAO;CAC7B,MAAM,OAAO,eAAe,gBAAgB;AAC5C,QAAO,0BAA0B,SAAS,KAA6B;;AAGzE,SAAS,eACP,iBACiC;AACjC,KAAI,CAAC,gBAAiB,QAAO;AAC7B,QAAO,gBAAgB,SAAS,KAAK;;AAGvC,SAAS,yBACP,gBAC0C;AAC1C,KAAI,CAAC,eAAgB,QAAO;AAC5B,QAAO,eAAe,SAAS,KAAK;;AAGtC,SAAS,2BACP,gBAC4C;AAC5C,KAAI,CAAC,eAAgB,QAAO;AAC5B,QAAO,eAAe,SAAS,KAAK;;AAGtC,SAAS,0BACP,gBAC2C;AAC3C,KAAI,CAAC,eAAgB,QAAO;AAC5B,QAAO,eAAe,SAAS,KAAK;;AAGtC,SAAS,2BACP,gBAC4C;AAC5C,KAAI,CAAC,eAAgB,QAAO;AAC5B,QAAO,eAAe,SAAS,KAAK;;AAGtC,SAAS,eAAe,SAAyB;AAC/C,KAAI,CAAC,QACH,QAAO;AAET,KAAI,EAAE,UAAU,SACd,QAAO;AAET,KAAI,CAAC,QAAQ,KACX,QAAO;AAET,KAAI,EAAE,WAAW,QAAQ,MACvB,QAAO;AAET,QAAO,QAAQ,KAAK;;AAGtB,SAAS,mBAAmB,SAAyB;AACnD,KAAI,CAAC,QACH,QAAO;AAET,KAAI,EAAE,UAAU,SACd,QAAO;AAET,QAAO,QAAQ;;AAGjB,SAAS,oCACP,mBACA,oBACA,WACA;CACA,MAAM,OAAO,eAAe,kBAAkB;AAC9C,KAAI,CAAC,KACH,QAAO;AAET,SAAQ,MAAR;EACE,KAAA;AACE,OAAI,EAAE,QAAQ,CAAC,UAAU,mBAAmB,CAAC,QAC3C,QAAO;AAET,UAAO,YAAY,mBAAmB;EAExC,KAAK;AACH,OAAI,EAAE,SAAS,CAAC,UAAU,mBAAmB,CAAC,QAC5C,QAAO;AAET,UAAO,YAAY,QAAQ;EAE7B,KAAA;AACE,OAAI,EAAE,QAAQ,CAAC,UAAU,mBAAmB,CAAC,QAC3C,QAAO;AAET,UAAO,YAAY,IAAI;EAEzB,KAAK;AACH,OAAI,EAAE,QAAQ,CAAC,UAAU,mBAAmB,CAAC,QAC3C,QAAO;AAET,UAAO,YAAY,IAAM;EAE3B,KAAK;AACH,OAAI,EAAE,QAAQ,CAAC,UAAU,mBAAmB,CAAC,QAC3C,QAAO;AAET,UAAO,YAAY,KAAK;;AAI5B,QAAO,YAAY,qBAAqB;;AAG1C,SAAS,2BACP,yBACA,oBACA,WACA;CACA,MAAM,aACJ,wBAAwB,QAAQ,KAAK,UAAU,MAAM,KAAK,MAAM,IAAI,EAAE;AACxE,KACE,OAAO,uBAAuB,YAC9B,WAAW,SAAS,mBAAmB,CAEvC,QAAO;AAET,KAAI,UACF,QAAO,WAAW;AAEpB,QAAO;;AAGT,SAAS,6BACP,0BACA,oBACA,WACA;AACA,KAAI,CAAC,aAAa,CAAC,mBACjB,QAAO;CAET,MAAM,OAAO,eAAe,yBAAyB;AACrD,KAAI,CAAC,MAAM;AACT,UAAQ,MACN,2CACA,yBACD;AACD,SAAO;;CAET,MAAM,SAAS,4BAA4B,KAAK;AAChD,KAAI,CAAC,OACH,QAAO;AAGT,KAD6B,OAAO,OAAO,UAAU,mBAAmB,CAC/C,QACvB,QAAO;AAET,KAAI,CAAC,UACH,QAAO;CAET,MAAM,eAAe,OAAO,mBAAmB;AAC/C,KAAI,aACF,QAAO;AAET,QAAO;;AAGT,SAAS,4BACP,yBACA,oBACA,oBACA,qBACA,WACA,cACA;AACA,KAAI,CAAC,aAAa,CAAC,mBACjB,QAAO;AAIT,KAAI,CADU,wBAAwB,OAC1B,OACV,QAAO;CAGT,MAAM,+BAA+B,wBAAwB,OAAO,GAAG,EAAE;AACzE,KAAI,CAAC,6BACH,QAAO;CAET,MAAM,qCAAqC,2BACzC,8BACA,mBACD;AACD,KAAI,CAAC,2BAA2B,mCAAmC,CACjE,QAAO;AAET,QAAO,6BACL,oCACA,oBACA,qBACA,oBACA,WACA,aACD;;AAGH,SAAS,+BACP,cACA,oBACA,WACA,oBACA,cACA;AACA,KAAI,CAAC,aAAa,CAAC,MAAM,QAAQ,mBAAmB,CAClD,QAAO;AAET,KAAI,aAAa,CAAC,MAAM,QAAQ,mBAAmB,CACjD,QAAO,EAAE;AAKX,QADmB,mBACD,KAAK,MAAM,UAC3B,2BAA2B;EACzB,WAAW,OAAO,MAAM;EACxB,SAAS,aAAa;EACtB;EACA,qBAAqB,GAAG,QAAQ,MAAM;EACtC;EACD,CAAC,CACH;;AAGH,SAAS,6BACP,0BACA,oBACA,sBACA,oBACA,WACA,cACA;CACA,MAAM,WAAW,yBAAyB,KAAK;AAG/C,KAAI,cAAc,IAAI,SAAS,CAC7B,QAAO;AAGT,KAAI,CAAC,aAAa,CAAC,mBACjB,QAAO;CAET,MAAM,SAAS,yBAAyB;AACxC,KAAI,CAAC,QAAQ,OACX,QAAO,EAAE;CAIX,MAAM,kBAAkB,IAAI,IAAI,aAAa;AAC7C,iBAAgB,IAAI,SAAS;AAS7B,QAAO,iCAAiC;EACtC;EACA,qBAPA,sBACA,OAAO,uBAAuB,YAC9B,CAAC,MAAM,QAAQ,mBAAmB,GAC7B,qBACD;EAIJ,sBAAsB;EACtB,cAAc;EACf,CAAC;;AAGJ,SAAS,2BACP,iBACA,oBACA;AACA,KAAI,CAAC,gBACH,QAAO;CAET,MAAM,OAAO,eAAe,gBAAgB;AAC5C,KAAI,CAAC,KACH,QAAO;CAET,MAAM,iBAAiB,mBAAmB,YAAY,MACnD,QAAQ,UAAU,OAAO,UAAU,OAAO,IAAI,MAAM,UAAU,KAChE;AACD,KAAI,CAAC,eACH,QAAO;AAET,QAAO;;AAGT,SAAS,iBAAiB,KAAa;AACrC,QAAO,IAAI,QAAQ,gBAAgB,GAAG,CAAC,aAAa;;AAGtD,SAAgB,gCACd,MACA,MACA;AACA,KACE,SAAS,QACT,SAAS,QACT,SAAS,KAAA,KACT,SAAS,KAAA,EAET,QAAO;AACT,QAAO,iBAAiB,KAAK,KAAK,iBAAiB,KAAK;;AAG1D,SAAgB,iBACd,KACA,SACA,SACA,OACQ;CACR,MAAM,aAAa,UAAU,WAAW,UAAU;CAClD,MAAM,cAAc,GAAG,WAAW,QAAQ,GAAG;CAC7C,MAAM,cAAc,GAAG,WAAW,QAAQ,GAAG;CAE7C,MAAM,MAAM,aAAa,IAAI;AAC7B,KAAI,CAAC,IAAK,QAAO;AAgBjB,QAAO,MAdY,MAAM,KAAK,EAC5B,uBAAuB,SAAS;AAC9B,MAAI,KAAK,KAAK,UAAU,YACtB,QAAO;GACL,GAAG;GACH,MAAM;IACJ,GAAG,KAAK;IACR,OAAO;IACR;GACF;IAGN,CAAC,CAEsB;;AAG1B,SAAgB,sBAAsB,WAAmB;AAEvD,QADyB,qBAAqB,WAAW,SAAS;;AAIpE,SAAgB,uBAAuB,QAMpC;CACD,MAAM,EACJ,SACA,SACA,mBACA,kBACA,mBACE;AAQJ,gBANkB,iBAChB,mBACA,SACA,SACA,SACD,EACyB,SAAS;AAEnC,KAAI,iBAOF,gBAN4B,iBAC1B,kBACA,SACA,SACA,QACD,EACmC,QAAQ;;AAIhD,SAAgB,sBAAsB,QAMnC;CACD,MAAM,EAAE,SAAS,mBAAmB,mBAAmB;AAIvD,KAAI,CAFsB,CAAC,CAAC,mBAEJ;AAEtB,iBADyB,sBAAsB,QAAQ,EACtB,SAAS;AAC1C;;AAGF,wBAAuB,OAAO;;AAoFhC,SAAgB,oBACd,0BACA,yBACA,YACS;CACT,IAAI;AACJ,KAAI;AACF,oBAAkB,KAAK,MAAM,WAAW;UACjC,OAAO;AACd,SAAO,CAAC,IAAI,MAAM,uBAAuB,EAAE,OAAO,OAAO,CAAC,CAAC;;CAI7D,MAAM,gBAAgB,qBAAqB,yBAAyB;CAGpE,MAAM,gBAAgB,wBAAwB,KAAK;AACnD,KAAI,CAAC,cAAc,IAAI,cAAc,CACnC,QAAO,iBACL,IAAI,MACF,eAAe,cAAc,6CAC9B,CACF;CAIH,MAAM,cAAc;CACpB,MAAM,qBAAqB,gCACzB,eACA,eACA,YACD;CAGD,MAAM,eAA6B;EACjC,GAAG;EACH,aAAa,CACX,GAAG,yBAAyB,aAC5B,GAAG,mBACJ;EACF;CAED,IAAI;AACJ,KAAI;AACF,WAAS,eAAe,cAAc,EAAE,gBAAgB,OAAO,CAAC;UACzD,GAAG;AACV,SAAO,CAAC,IAAI,MAAM,mCAAmC,EAAE,OAAO,GAAG,CAAC,CAAC;;CAMrE,MAAM,KAAK,gBADG,MAAM,aADE,GAAG,gBAAgB,cACM,mBAAmB,CACjC;AAEjC,KAAI,CAAC,GACH,QAAO,iBAAC,IAAI,MAAM,4CAA4C,CAAC;CAGjE,MAAM,EAAE,WAAW,kBAAkB,QAAQ,GAAG,uBAAuB,EAAE,EAAE,EACzE,GAAG,iBACJ,CAAC;CAGF,MAAM,sBAAsB,qBAC1B,yBACA,cACD;CAGD,MAAM,sBAAsB,IAAI,IAAI,oBAAoB,KAAK,MAAM,EAAE,MAAM,CAAC;CAE5E,MAAM,mBAAmB,SACrB,qCAAqC,OAAO,CAAC,QAAQ,MAAM;AAEzD,MAAI,aAAa,wBAAwB,EAAE,SAAS,YAAY;GAE9D,MAAM,YAAY,EAAE,KAAK;AACzB,OACE,OAAO,cAAc,YACrB,oBAAoB,IAAI,UAAU,CAElC,QAAO;;AAGX,SAAO;GACP,GACF,EAAE;AAGN,kBAAiB,QAAQ,GAAG,oBAAoB;CAEhD,MAAM,wBAAwB,4BAC5B,0BACA,yBACA,gBACD;AACD,kBAAiB,KAAK,GAAG,sBAAsB;AAE/C,QAAO;;;;;;AAOT,SAAS,qBAAqB,KAAgD;CAC5E,MAAM,sBAAM,IAAI,KAA6B;AAE7C,MAAK,MAAM,OAAO,IAAI,YACpB,KACE,IAAI,SAAS,KAAK,0BAClB,IAAI,SAAS,KAAK,gCAClB,IAAI,SAAS,KAAK,wBAClB,IAAI,SAAS,KAAK,0BAClB,IAAI,SAAS,KAAK,6BAClB,IAAI,SAAS,KAAK,yBAClB,IAAI,SAAS,KAAK,yBAClB,IAAI,SAAS,KAAK,+BAClB,IAAI,SAAS,KAAK,uBAClB,IAAI,SAAS,KAAK,4BAClB,IAAI,SAAS,KAAK,sBAClB;EAIA,MAAM,OAAO,IAAI,KAAK;AACtB,MAAI,CAAC,IAAI,IAAI,KAAK,CAChB,KAAI,IAAI,MAAM,IAAI;;AAKxB,QAAO;;;;;;AAOT,SAAS,gCACP,oBACA,eACA,aACiC;CACjC,MAAM,4BAAY,IAAI,KAA4C;CAClE,MAAM,2BAAW,IAAI,KAAa;CAElC,MAAM,wBAAwB,mBAA2B;EACvD,MAAM,YAAY,GAAG,iBAAiB;AACtC,MAAI,UAAU,IAAI,UAAU,CAAE;AAE9B,MAAI,SAAS,IAAI,eAAe,CAG9B;AAEF,WAAS,IAAI,eAAe;EAE5B,MAAM,MAAM,cAAc,IAAI,eAAe;AAC7C,MAAI,CAAC,IACH,OAAM,IAAI,aAAa,4BAA4B,eAAe,GAAG;AAGvE,MACE,IAAI,SAAS,KAAK,0BAClB,IAAI,SAAS,KAAK,sBAElB,OAAM,IAAI,aACR,SAAS,eAAe,4DAA4D,IAAI,KAAK,GAC9F;EAGH,MAAM,SAAS;EAGf,MAAM,cACJ,OAAO,QAAQ,KAAK,MAAM;AACxB,UAAO;IACL,MAAM,KAAK;IACX,MAAM,EAAE;IACR,aAAa,EAAE;IACf,YAAY,EAAE;IACd,MAAM,qCACJ,EAAE,MACF,eACA,aACA,qBACD;IACD,cAAc,KAAA;IACf;IACD,IAAI,EAAE;EAEV,MAAM,WAA0C;GAC9C,MAAM,KAAK;GACX,MAAM;IAAE,MAAM,KAAK;IAAM,OAAO;IAAW;GAC3C,aAAa,OAAO;GACpB,YAAY,EAAE;GACd,QAAQ;GACT;AAED,YAAU,IAAI,WAAW,SAAS;AAElC,WAAS,OAAO,eAAe;;AAIjC,sBAAqB,mBAAmB;AAExC,QAAO,MAAM,KAAK,UAAU,QAAQ,CAAC;;AAGvC,SAAS,qCACP,UACA,eACA,aACA,sBACU;AACV,SAAQ,SAAS,MAAjB;EACE,KAAK,KAAK,cACR,QAAO;GACL,MAAM,KAAK;GACX,MAAM,qCACJ,SAAS,MACT,eACA,aACA,qBACD;GACF;EAEH,KAAK,KAAK,UACR,QAAO;GACL,MAAM,KAAK;GACX,MAAM,qCACJ,SAAS,MACT,eACA,aACA,qBACD;GACF;EAEH,KAAK,KAAK,YAAY;GACpB,MAAM,QAAQ;GACd,MAAM,OAAO,MAAM,KAAK;GAExB,MAAM,MAAM,cAAc,IAAI,KAAK;AAGnC,OACE,KAAK,SAAS,KAAK,0BACnB,KAAK,SAAS,KAAK,uBACnB;AACA,yBAAqB,KAAK;AAC1B,WAAO;KACL,MAAM,KAAK;KACX,MAAM;MAAE,MAAM,KAAK;MAAM,OAAO,GAAG,OAAO;MAAe;KAC1D;;AAIH,OACE,CAAC,OACD,IAAI,SAAS,KAAK,0BAClB,IAAI,SAAS,KAAK,wBAClB,IAAI,SAAS,KAAK,gCAClB,IAAI,SAAS,KAAK,4BAElB,QAAO;AAIT,OACE,IAAI,SAAS,KAAK,6BAClB,IAAI,SAAS,KAAK,sBAElB,OAAM,IAAI,aACR,SAAS,KAAK,KAAK,IAAI,KAAK,mCAC7B;AAIH,SAAM,IAAI,aACR,2BAA2B,KAAK,aAAa,IAAI,KAAK,GACvD;;EAGH,QAEE,OAAM,IAAI,aACR,8BAA8B,KAAK,UAAU,SAAS,GACvD;;;AAoDP,IAAa,uBAAb,cAA0C,MAAM;CAC9C;CACA;CAEA,YAAY,SAAsC,iBAA0B;AAE1E,QAAM,QAAQ,KAAK;AACnB,OAAK,OAAO;AACZ,OAAK,UAAU;AACf,OAAK,kBAAkB;AACvB,SAAO,eAAe,MAAM,IAAI,OAAO,UAAU;;CAGnD,IAAI,OAAiC;AACnC,SAAO,KAAK,QAAQ;;CAGtB,IAAI,OAA4B;AAC9B,SAAO,KAAK,QAAQ;;CAGtB,IAAI,QAAgB;AAClB,SAAO,KAAK,QAAQ;;;AAIxB,SAAS,iBAAiB,SAAsC;CAC9D,MAAM,QAAQ,QAAQ,MAAM,iBAAiB;AAC7C,KAAI,CAAC,MAAO,QAAO,EAAE;CACrB,MAAM,QAAQ,MAAM,GAAG,MAAM,IAAI,CAAC,OAAO,QAAQ;AAEjD,SADmB,MAAM,OAAO,MAAM,MAAM,MAAM,EAAE,GAAG,OACrC,KAAK,MAAO,QAAQ,KAAK,EAAE,GAAG,OAAO,EAAE,GAAG,EAAG;;AAGjE,MAAM,4BACJ;AAEF,MAAM,mBACJ;AAEF,SAAS,4BACP,SACgD;CAChD,MAAM,IAAI,QAAQ,MAAM,0BAA0B;AAClD,KAAI,CAAC,EAAG,QAAO;AACf,QAAO;EAAE,OAAO,EAAE;EAAI,cAAc,EAAE;EAAI;;AAG5C,SAAS,oBACP,SACiE;CACjE,MAAM,IAAI,QAAQ,MAAM,iBAAiB;AACzC,KAAI,CAAC,EAAG,QAAO;AACf,QAAO;EAAE,OAAO,EAAE;EAAI,UAAU,EAAE;EAAI,YAAY,EAAE;EAAI;;AAG1D,SAAS,kBAAkB,MAA+C;AACxE,MAAK,IAAI,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,IACpC,KAAI,OAAO,KAAK,OAAO,SAAU,QAAO,KAAK;;AAKjD,SAAS,oBAAoB,SAAqC;CAEhE,IAAI,IAAI,QAAQ,MAAM,uCAAuC;AAC7D,KAAI,IAAI,GAAI,QAAO,EAAE;AAGrB,KAAI,QAAQ,MAAM,0BAA0B;AAC5C,KAAI,IAAI,GAAI,QAAO,EAAE;AAGrB,KAAI,QAAQ,MAAM,mDAAmD;AACrE,KAAI,IAAI,GAAI,QAAO,EAAE;;AAKvB,SAAgB,qCACd,QACwB;CACxB,MAAM,MAA8B,EAAE;AAEtC,MAAK,MAAM,KAAK,QAAQ;EACtB,MAAM,kBAAkB,EAAE;EAG1B,MAAM,UAAU,4BAA4B,gBAAgB;AAC5D,MAAI,SAAS;AACX,OAAI,KACF,IAAI,qBACF;IACE,MAAM;IACN,MAAM,CAAC,QAAQ,MAAM;IACrB,OAAO,QAAQ;IACf,cAAc,QAAQ;IACvB,EACD,gBACD,CACF;AACD;;EAIF,MAAM,UAAU,oBAAoB,gBAAgB;AACpD,MAAI,SAAS;AACX,OAAI,KACF,IAAI,qBACF;IACE,MAAM;IACN,MAAM,CAAC,QAAQ,MAAM;IACrB,OAAO,QAAQ;IACf,YAAY,QAAQ;IACrB,EACD,gBACD,CACF;AACD;;EAIF,MAAM,OAAO,iBAAiB,gBAAgB;EAC9C,MAAM,QAAQ,kBAAkB,KAAK,IAAI;EACzC,MAAM,eAAe,oBAAoB,gBAAgB;AAEzD,MACE,gBAAgB,SAAS,6BAA6B,IACtD,gBAAgB,SAAS,iBAAiB,EAC1C;AACA,OAAI,KACF,IAAI,qBACF;IAAE,MAAM;IAAY;IAAM;IAAO;IAAc,EAC/C,gBACD,CACF;AACD;;AAGF,MACE,gBAAgB,SAAS,mBAAmB,IAC5C,gBAAgB,SAAS,gBAAgB,EACzC;AACA,OAAI,KACF,IAAI,qBACF;IACE,MAAM;IACN;IACA;IACA;IACA,SAAS;IACV,EACD,gBACD,CACF;AACD;;AAGF,MAAI,KACF,IAAI,qBACF;GAAE,MAAM;GAAQ;GAAM;GAAO,SAAS;GAAiB,EACvD,gBACD,CACF;;AAGH,QAAO;;;;;;AAkBT,SAAgB,kBACd,0BACA,cACA,OACA,WAAgC,EAAE,EACd;CACpB,IAAI;AACJ,KAAI;AACF,oBACE,OAAO,UAAU,WACZ,KAAK,MAAM,MAAM,GAClB;SACA;AACN,SAAO,EAAE;;CAGX,MAAM,aAAa,iBAAiB,yBAAyB;CAC7D,MAAM,gBAAoC,EAAE;AAE5C,MAAK,MAAM,SAAS,aAAa,UAAU,EAAE,EAAE;EAC7C,MAAM,YAAY,MAAM,KAAK;EAC7B,MAAM,YAAY,CAAC,GAAG,UAAU,UAAU;EAC1C,MAAM,aAAa,MAAM,KAAK,SAAS,KAAK;EAE5C,MAAM,iBAAiB,aAClB,MAAM,KAAyB,OAChC,MAAM;AAGV,MAAI,EAAE,aAAa,kBAAkB;AACnC,iBAAc,KAAK;IACjB;IACA,MAAM;IACN;IACA,MAAM;IACP,CAAC;AACF;;EAIF,MAAM,YAAY,gBAAgB,MAAM,KAAK;EAC7C,MAAM,YAAY,YAAY,WAAW,IAAI,UAAU,GAAG,KAAA;AAE1D,MACE,aACA,OAAO,gBAAgB,eAAe,YACtC,gBAAgB,eAAe,QAC/B,CAAC,MAAM,QAAQ,gBAAgB,WAAW,EAC1C;GACA,MAAM,gBAAgB,kBACpB,0BACA,WACA,gBAAgB,YAChB,UACD;AACD,iBAAc,KAAK,GAAG,cAAc;;;AAIxC,QAAO;;;;;;AAOT,SAAgB,4BACd,0BACA,cACA,OACwB;AASxB,QARsB,kBACpB,0BACA,cACA,MACD,CAKE,QAAQ,UAAU,CAAC,MAAM,WAAW,CACpC,KACE,UACC,IAAI,qBAAqB;EACvB,MAAM;EACN,MAAM,MAAM;EACZ,OAAO,MAAM;EACb,cAAc,iBAAiB,MAAM,KAAK;EAC3C,CAAC,CACL;;;;;;AAOL,SAAS,qBACP,yBACA,eACwB;CACxB,MAAM,SAAiC,EAAE;AAEzC,MAAK,MAAM,SAAS,wBAAwB,UAAU,EAAE,EAAE;EACxD,MAAM,YAAY,MAAM,KAAK;EAC7B,MAAM,gBAAgB,iBAAiB,MAAM,KAAK;AAElD,MAAI,CAAC,cAAe;AAGpB,MAAI,gBAAgB,eAAe,+BAAe,IAAI,KAAK,CAAC,CAC1D,QAAO,KACL,IAAI,qBAAqB;GACvB,MAAM;GACN,MAAM,CAAC,UAAU;GACjB,OAAO;GACP,UAAU;GACX,CAAC,CACH;;AAIL,QAAO;;;;;AAMT,SAAS,iBAAiB,UAAmC;AAC3D,KAAI,SAAS,SAAS,KAAK,WACzB,QAAO,SAAS,KAAK;AAEvB,KACE,SAAS,SAAS,KAAK,iBACvB,SAAS,SAAS,KAAK,UAEvB,QAAO,iBAAiB,SAAS,KAAK;AAExC,QAAO;;;;;AAMT,SAAS,gBACP,UACA,eACA,cACS;AACT,KAAI,aAAa,IAAI,SAAS,CAC5B,QAAO;CAGT,MAAM,UAAU,cAAc,IAAI,SAAS;AAC3C,KAAI,CAAC,WAAW,QAAQ,SAAS,KAAK,uBACpC,QAAO;AAGT,cAAa,IAAI,SAAS;AAE1B,MAAK,MAAM,SAAS,QAAQ,UAAU,EAAE,EAAE;AAExC,MAAI,MAAM,KAAK,SAAS,KAAK,cAAe;EAE5C,MAAM,YAAY,MAAM,KAAK;EAC7B,IAAI,gBAA+B;AAEnC,MAAI,UAAU,SAAS,KAAK,WAC1B,iBAAgB,UAAU,KAAK;WACtB,UAAU,SAAS,KAAK,UAEjC,iBAAgB,iBAAiB,UAAU;AAG7C,MACE,iBACA,gBAAgB,eAAe,eAAe,aAAa,CAE3D,QAAO;;AAIX,cAAa,OAAO,SAAS;AAC7B,QAAO;;;;;AAMT,SAAS,iBAAiB,UAA4B;AACpD,SAAQ,SAAS,MAAjB;EACE,KAAK,KAAK,WACR,QAAO,SAAS,KAAK;EACvB,KAAK,KAAK,cACR,QAAO,GAAG,iBAAiB,SAAS,KAAK,CAAC;EAC5C,KAAK,KAAK,UACR,QAAO,IAAI,iBAAiB,SAAS,KAAK,CAAC;;;AAIjD,SAAS,iBACP,KACuC;CACvC,MAAM,sBAAM,IAAI,KAAuC;AACvD,MAAK,MAAM,OAAO,IAAI,YACpB,KAAI,IAAI,SAAS,KAAK,uBACpB,KAAI,IAAI,IAAI,KAAK,OAAO,IAAI;AAGhC,QAAO;;AAGT,SAAS,gBAAgB,UAAwC;AAC/D,KAAI,SAAS,SAAS,KAAK,WAAY,QAAO,SAAS,KAAK;AAC5D,KAAI,SAAS,SAAS,KAAK,cACzB,QAAO,gBAAgB,SAAS,KAAK;AACvC,KAAI,SAAS,SAAS,KAAK,UAAW,QAAO,gBAAgB,SAAS,KAAK;;;;ACn8C7E,SAAgB,0CACd,KACA,UACA,UACS;CACT,MAAM,YAAY,aAAa,IAAI;AAEnC,KAAI,CAAC,UAAW,QAAO;AAEvB,QAAO,UAAU,YAAY,MAAM,QAAQ;AAGzC,SAFwB,IAAI,SAAS,KAAK,aAEhB,UAAU,OAAO,IAAI,MAAM,UAAU;GAC/D;;AAGJ,SAAgB,gCACd,KACA,cACwB;CACxB,MAAM,YAAY,aAAa,IAAI;AACnC,KAAI,CAAC,UAAW,QAAO,KAAA;CAEvB,MAAM,YAAY,UAAU,YAAY;CAExC,MAAM,WAAW,UAAU,YAAY,UAAU,OAAO;AAExD,QAAO;EACL,MAAM,UAAU,KAAK,SAAS,UAAU,KAAK,SAAS;EACtD,IAAI,UAAU,KAAK,OAAO,UAAU,KAAK,OAAO;EAChD,UAAU;EACV,SAAS;EACV;;AAGH,SAAgB,2BACd,KACA,WACA,OACA;AACA,KAAI,CAAC,aAAa,IAAI,CAAE,QAAO,EAAE;CACjC,MAAM,mBAAmB,4BAA4B,WAAW,MAAM;AACtE,KACE,CAAC,0CACC,KACA,kBACA,yBACD,CAED,QAAO,CACL,gCACE,KACA,GAAG,aAAa,MAAM,CAAC,8BAA8B,mBACtD,CACF,CAAC,QAAQ,MAAM,MAAM,KAAA,EAAU;AAGlC,QAAO,EAAE;;AAGX,SAAgB,oCACd,KACA,eACA;AACA,KAAI,CAAC,OAAO,CAAC,aAAa,IAAI,CAAE,QAAO,EAAE;CAEzC,MAAM,mBAAmB,GAAG,WAAW,cAAc,CAAC;AACtD,KACE,CAAC,0CACC,KACA,kBACA,+BACD,CAED,QAAO,CACL,gCACE,KACA,qDAAqD,mBACtD,CACF,CAAC,QAAQ,MAAM,MAAM,KAAA,EAAU;AAGlC,QAAO,EAAE;;;;AClFX,MAAa,SAAS,YAAsC,OAAO,QAAQ;CACzE,MAAM,EAAE,WAAW,GAAG,SAAS;AAC/B,QACE,oBAAC,UAAD;EACO;EACL,GAAI;EACJ,WAAW,QACT,gQACA,UACD;EACD,CAAA;EAEJ"}

package/dist/browser/chunk-CRPLlQ3x.js

@@ -0,0 +1,28 @@
+//#region \0rolldown/runtime.js
+var __create = Object.create;
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __getProtoOf = Object.getPrototypeOf;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __commonJSMin = (cb, mod) => () => (mod || cb((mod = { exports: {} }).exports, mod), mod.exports);
+var __copyProps = (to, from, except, desc) => {
+	if (from && typeof from === "object" || typeof from === "function") for (var keys = __getOwnPropNames(from), i = 0, n = keys.length, key; i < n; i++) {
+		key = keys[i];
+		if (!__hasOwnProp.call(to, key) && key !== except) __defProp(to, key, {
+			get: ((k) => from[k]).bind(null, key),
+			enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable
+		});
+	}
+	return to;
+};
+var __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__getProtoOf(mod)) : {}, __copyProps(isNodeMode || !mod || !mod.__esModule ? __defProp(target, "default", {
+	value: mod,
+	enumerable: true
+}) : target, mod));
+var __require = /* @__PURE__ */ ((x) => typeof require !== "undefined" ? require : typeof Proxy !== "undefined" ? new Proxy(x, { get: (a, b) => (typeof require !== "undefined" ? require : a)[b] }) : x)(function(x) {
+	if (typeof require !== "undefined") return require.apply(this, arguments);
+	throw Error("Calling `require` for \"" + x + "\" in an environment that doesn't expose the `require` function. See https://rolldown.rs/in-depth/bundling-cjs#require-external-modules for more details.");
+});
+//#endregion
+export { __require as n, __toESM as r, __commonJSMin as t };