@puzzle-ui/seo 0.0.0-stage → 0.5.0

package/dist/core/graph.js

@@ -0,0 +1,456 @@
+// src/core/graph.ts
+const DEFAULT_CONTEXT = "https://schema.org";
+const isObject = (value) => typeof value === "object" && value !== null && !Array.isArray(value);
+const isNode = (value) => isObject(value) && (typeof value["@type"] === "string" || Array.isArray(value["@type"]) && value["@type"].every((item) => typeof item === "string"));
+const normalizeType = (type) => {
+	const value = type.trim();
+	if (!value) throw new Error("SEO node type cannot be empty.");
+	if (/^[A-Za-z][A-Za-z0-9]*$/.test(value)) return `https://schema.org/${value}`;
+	return value.replace(/^http:\/\/schema\.org\//, "https://schema.org/");
+};
+const compareStrings = (left, right) => left < right ? -1 : left > right ? 1 : 0;
+const slugify = (value) => value.normalize("NFKD").replace(/[\u0300-\u036f]/g, "").toLowerCase().replace(/[^a-z0-9]+/g, "-").replace(/^-+|-+$/g, "").slice(0, 64);
+const canonicalize = (value) => {
+	if (Array.isArray(value)) return value.map(canonicalize);
+	if (!isObject(value)) return value;
+	const result = {};
+	const preferredOrder = [
+		"@context",
+		"@id",
+		"@type"
+	];
+	const keys = Object.keys(value).sort((a, b) => {
+		const ai = preferredOrder.indexOf(a);
+		const bi = preferredOrder.indexOf(b);
+		if (ai !== -1 || bi !== -1) {
+			if (ai === -1) return 1;
+			if (bi === -1) return -1;
+			return ai - bi;
+		}
+		return compareStrings(a, b);
+	});
+	for (const key of keys) result[key] = canonicalize(value[key]);
+	return result;
+};
+const stableStringify = (value) => JSON.stringify(canonicalize(value));
+const hashString = (value) => {
+	let hash = 2166136261;
+	for (let index = 0; index < value.length; index += 1) {
+		hash ^= value.charCodeAt(index);
+		hash = Math.imul(hash, 16777619);
+	}
+	return (hash >>> 0).toString(36);
+};
+const normalizeBaseUrl = (baseUrl) => {
+	if (!baseUrl) return;
+	const url = new URL(baseUrl);
+	if (url.protocol !== "http:" && url.protocol !== "https:") throw new Error("SEO baseUrl must use HTTP or HTTPS.");
+	url.hash = "";
+	return url.toString().replace(/\/$/, "");
+};
+/**
+* Converts an absolute, relative or fragment identifier
+* into a canonical identifier.
+*
+* Relative identifiers require a base URL.
+*/
+const normalizeSeoId = (id, baseUrl) => {
+	const value = id.trim();
+	if (!value) throw new Error("SEO node ID cannot be empty.");
+	if (/^[a-z][a-z\d+.-]*:/i.test(value)) try {
+		const url = new URL(value);
+		if (url.protocol === "http:" && url.hostname === "schema.org") url.protocol = "https:";
+		return url.toString();
+	} catch {
+		throw new Error(`Invalid SEO node ID: ${value}`);
+	}
+	const base = normalizeBaseUrl(baseUrl);
+	if (!base) {
+		if (value.startsWith("#")) return value;
+		throw new Error(`Relative SEO node ID "${value}" requires a baseUrl.`);
+	}
+	try {
+		return new URL(value, `${base}/`).toString();
+	} catch {
+		throw new Error(`Invalid SEO node ID: ${value}`);
+	}
+};
+const createAutomaticId = (node, options) => {
+	const baseUrl = normalizeBaseUrl(options.baseUrl);
+	const type = (Array.isArray(node["@type"]) ? node["@type"] : [node["@type"]])[0] ?? "Thing";
+	const typeSlug = slugify(type.split("/").pop() ?? "thing");
+	const identityProperties = [
+		"url",
+		"mainEntityOfPage",
+		"name",
+		"headline",
+		"title"
+	];
+	let identity;
+	for (const property of identityProperties) {
+		const value = node[property];
+		if (typeof value === "string" && value.trim()) {
+			identity = value;
+			break;
+		}
+		if (isObject(value) && typeof value["@id"] === "string") {
+			identity = value["@id"];
+			break;
+		}
+	}
+	const fragment = `${typeSlug}-${(identity ? slugify(identity) : hashString(stableStringify(node))) || hashString(stableStringify(node))}`;
+	return baseUrl ? `${baseUrl}/#${fragment}` : `#${fragment}`;
+};
+/**
+* Removes values that cannot be represented safely in JSON-LD.
+*
+* Internal Puzzle properties beginning with __puzzle are excluded.
+* User-defined Schema.org properties remain untouched.
+*/
+const cleanValue = (value) => {
+	if (value === null || typeof value === "string" || typeof value === "boolean") return value;
+	if (typeof value === "number") return Number.isFinite(value) ? value : null;
+	if (typeof value === "undefined" || typeof value === "function" || typeof value === "symbol" || typeof value === "bigint") return;
+	if (Array.isArray(value)) return value.map(cleanValue).filter((item) => item !== void 0);
+	if (value instanceof Date) return value.toISOString();
+	if (!isObject(value)) return;
+	const result = {};
+	for (const [key, nestedValue] of Object.entries(value)) {
+		if (key.startsWith("__puzzle")) continue;
+		const cleaned = cleanValue(nestedValue);
+		if (cleaned !== void 0) result[key] = cleaned;
+	}
+	return result;
+};
+const normalizeNodeId = (node, options) => {
+	const explicitId = options.id ?? node["@id"];
+	if (typeof explicitId === "string") return normalizeSeoId(explicitId, options.baseUrl);
+	return createAutomaticId(node, options);
+};
+/**
+* Creates a normalized, JSON-compatible SEO node.
+*
+* Explicit IDs always override generated IDs.
+* The original input is never mutated.
+*/
+const createSeoNode = (input, options = {}) => {
+	if (!isNode(input)) throw new Error("SEO node must contain a valid @type.");
+	const cleaned = cleanValue(input);
+	if (!isObject(cleaned)) throw new Error("Unable to normalize SEO node.");
+	const type = Array.isArray(cleaned["@type"]) ? cleaned["@type"].map((item) => normalizeType(String(item))) : normalizeType(String(cleaned["@type"]));
+	return {
+		...cleaned,
+		"@id": normalizeNodeId(input, options),
+		"@type": type
+	};
+};
+const cloneNode = (node) => {
+	const cloned = cleanValue(node);
+	if (!isObject(cloned) || !isNode(cloned)) throw new Error("Invalid SEO node.");
+	return cloned;
+};
+const isEmptyValue = (value) => value === void 0 || value === null || value === "" || Array.isArray(value) && value.length === 0;
+const mergeArrays = (left, right) => {
+	const values = /* @__PURE__ */ new Map();
+	for (const value of [...left, ...right]) values.set(stableStringify(value), value);
+	return [...values.entries()].sort(([a], [b]) => compareStrings(a, b)).map(([, value]) => value);
+};
+const mergeValues = (left, right, context, path) => {
+	if (isEmptyValue(left)) return right;
+	if (isEmptyValue(right)) return left;
+	if (path === "@type") {
+		const sorted = [.../* @__PURE__ */ new Set([...Array.isArray(left) ? left : [left], ...Array.isArray(right) ? right : [right]])].sort((a, b) => compareStrings(String(a), String(b)));
+		return sorted.length === 1 ? sorted[0] : sorted;
+	}
+	if (stableStringify(left) === stableStringify(right)) return left;
+	if (Array.isArray(left) && Array.isArray(right)) return mergeArrays(left, right);
+	if (isObject(left) && isObject(right)) {
+		const result = { ...left };
+		for (const [key, value] of Object.entries(right)) {
+			if (!(key in result)) {
+				result[key] = value;
+				continue;
+			}
+			result[key] = mergeValues(result[key], value, context, path ? `${path}.${key}` : key);
+		}
+		return result;
+	}
+	const severity = context.strategy === "error" ? "error" : "warning";
+	context.issues.push({
+		code: "graph-property-conflict",
+		severity,
+		message: `Conflicting values found at ${path}.`,
+		nodeId: context.nodeId,
+		property: path
+	});
+	switch (context.strategy) {
+		case "first": return left;
+		case "last": return right;
+		case "error": return compareStrings(stableStringify(left), stableStringify(right)) <= 0 ? left : right;
+		default: return compareStrings(stableStringify(left), stableStringify(right)) <= 0 ? left : right;
+	}
+};
+/**
+* Merges two nodes with the same @id.
+*
+* Complementary values are combined.
+* Arrays are deduplicated.
+* Scalar conflicts are reported.
+*/
+const mergeSeoNodes = (left, right, options = {}) => {
+	const normalizedLeft = createSeoNode(left);
+	const normalizedRight = createSeoNode(right);
+	const leftId = normalizedLeft["@id"];
+	const rightId = normalizedRight["@id"];
+	if (!leftId || leftId !== rightId) throw new Error("Only SEO nodes with identical @id values can be merged.");
+	const issues = [];
+	const context = {
+		strategy: options.conflictStrategy ?? "deterministic",
+		issues,
+		nodeId: String(leftId)
+	};
+	return {
+		node: mergeValues(cloneNode(normalizedLeft), cloneNode(normalizedRight), context, ""),
+		issues
+	};
+};
+const isReference = (value) => isObject(value) && typeof value["@id"] === "string" && Object.keys(value).every((key) => key === "@id");
+const createReference = (id) => ({ "@id": id });
+/**
+* Resolves inline nodes recursively.
+*
+* Nested objects with @type become independent graph nodes.
+* Their original position is replaced by an @id reference.
+*/
+const resolveInlineValue = (value, state) => {
+	if (Array.isArray(value)) return value.map((item) => resolveInlineValue(item, state));
+	if (!isObject(value)) return value;
+	if (isNode(value)) {
+		const nestedNode = createSeoNode(value, {
+			baseUrl: state.options.baseUrl,
+			context: state.options.context
+		});
+		const resolved = resolveNode(nestedNode, state);
+		addNodeToState(resolved, state);
+		return createReference(String(resolved["@id"]));
+	}
+	if (isReference(value)) return { "@id": normalizeSeoId(value["@id"], state.options.baseUrl) };
+	const result = {};
+	for (const [key, nestedValue] of Object.entries(value)) result[key] = resolveInlineValue(nestedValue, state);
+	return result;
+};
+const resolveNode = (node, state) => {
+	const result = cloneNode(node);
+	for (const [key, value] of Object.entries(result)) {
+		if (key === "@id" || key === "@type" || key === "@context") continue;
+		result[key] = resolveInlineValue(value, state);
+	}
+	return result;
+};
+const addNodeToState = (node, state) => {
+	const id = String(node["@id"]);
+	const existing = state.nodes.get(id);
+	if (!existing) {
+		state.nodes.set(id, node);
+		return;
+	}
+	const merged = mergeSeoNodes(existing, node, { conflictStrategy: state.options.conflictStrategy });
+	state.nodes.set(id, merged.node);
+	state.issues.push(...merged.issues);
+};
+const collectReferences = (value, references) => {
+	if (Array.isArray(value)) {
+		for (const item of value) collectReferences(item, references);
+		return;
+	}
+	if (!isObject(value)) return;
+	if (isReference(value)) {
+		references.add(value["@id"]);
+		return;
+	}
+	for (const nestedValue of Object.values(value)) collectReferences(nestedValue, references);
+};
+const isLocalReference = (id, baseUrl) => {
+	if (id.startsWith("#")) return true;
+	if (!baseUrl) return false;
+	try {
+		const reference = new URL(id);
+		const base = new URL(baseUrl);
+		return reference.origin === base.origin;
+	} catch {
+		return false;
+	}
+};
+const validateReferences = (graph, options = {}) => {
+	const ids = new Set(graph["@graph"].map((node) => String(node["@id"])));
+	const references = /* @__PURE__ */ new Set();
+	for (const node of graph["@graph"]) collectReferences(node, references);
+	const issues = [];
+	for (const reference of references) {
+		if (ids.has(reference)) continue;
+		if (options.allowedExternalReferences !== false && !isLocalReference(reference, options.baseUrl)) continue;
+		issues.push({
+			code: "unresolved-reference",
+			severity: options.strictReferences ? "error" : "warning",
+			message: `Unable to resolve SEO reference: ${reference}`,
+			nodeId: reference
+		});
+	}
+	return issues;
+};
+/**
+* Builds a complete JSON-LD graph from a collection of nodes.
+*
+* Each builder instance owns its own state. No global state is used.
+*/
+const createSeoGraphBuilder = (options = {}) => {
+	const state = {
+		nodes: /* @__PURE__ */ new Map(),
+		issues: [],
+		options: {
+			conflictStrategy: "deterministic",
+			strictReferences: false,
+			...options
+		}
+	};
+	const builder = {
+		add(input) {
+			const node = createSeoNode(input, {
+				baseUrl: state.options.baseUrl,
+				context: state.options.context
+			});
+			const resolved = resolveNode(node, state);
+			addNodeToState(resolved, state);
+			return builder;
+		},
+		addMany(nodes) {
+			for (const node of nodes) builder.add(node);
+			return builder;
+		},
+		build() {
+			const nodes = [...state.nodes.values()].sort((a, b) => {
+				const left = String(a["@id"]);
+				const right = String(b["@id"]);
+				return left < right ? -1 : left > right ? 1 : 0;
+			});
+			return {
+				"@context": state.options.context ?? DEFAULT_CONTEXT,
+				"@graph": nodes
+			};
+		},
+		getIssues() {
+			const graph = {
+				"@context": state.options.context ?? DEFAULT_CONTEXT,
+				"@graph": [...state.nodes.values()]
+			};
+			return [...state.issues, ...validateReferences(graph, {
+				baseUrl: state.options.baseUrl,
+				strictReferences: state.options.strictReferences,
+				allowedExternalReferences: true
+			})];
+		}
+	};
+	return builder;
+};
+/**
+* Convenience function for building a graph in one operation.
+*/
+const buildSeoGraph = (nodes, options = {}) => {
+	return createSeoGraphBuilder(options).addMany(nodes).build();
+};
+/**
+* Normalizes and validates an existing graph.
+*
+* Inline nodes are extracted and references are normalized.
+*/
+const resolveSeoReferences = (graph, options = {}) => {
+	return createSeoGraphBuilder({
+		...options,
+		context: options.context ?? graph["@context"] ?? DEFAULT_CONTEXT
+	}).addMany(graph["@graph"]).build();
+};
+/**
+* Validates graph structure, IDs and references.
+*/
+const validateSeoGraph = (graph, options = {}) => {
+	const issues = [];
+	if (!Array.isArray(graph["@graph"])) return {
+		valid: false,
+		issues: [{
+			code: "invalid-graph",
+			severity: "error",
+			message: "SEO graph must contain an @graph array."
+		}]
+	};
+	const ids = /* @__PURE__ */ new Set();
+	for (let index = 0; index < graph["@graph"].length; index += 1) {
+		const node = graph["@graph"][index];
+		if (!isNode(node)) {
+			issues.push({
+				code: "invalid-node",
+				severity: "error",
+				message: `Invalid SEO node at index ${index}.`,
+				path: `@graph[${index}]`
+			});
+			continue;
+		}
+		const id = node["@id"];
+		if (typeof id !== "string" || !id.trim()) {
+			issues.push({
+				code: "missing-node-id",
+				severity: "error",
+				message: `SEO node at index ${index} has no valid @id.`,
+				path: `@graph[${index}].@id`
+			});
+			continue;
+		}
+		if (ids.has(id)) issues.push({
+			code: "duplicate-node-id",
+			severity: "error",
+			message: `Duplicate SEO node ID: ${id}`,
+			nodeId: id
+		});
+		ids.add(id);
+		const types = Array.isArray(node["@type"]) ? node["@type"] : [node["@type"]];
+		if (types.length === 0 || types.some((type) => typeof type !== "string" || !type.trim())) issues.push({
+			code: "invalid-node-type",
+			severity: "error",
+			message: `SEO node ${id} has an invalid @type.`,
+			nodeId: id
+		});
+	}
+	issues.push(...validateReferences(graph, options));
+	return {
+		valid: !issues.some((issue) => issue.severity === "error"),
+		issues
+	};
+};
+const escapeJsonForHtml = (value) => value.replace(/&/g, "\\u0026").replace(/</g, "\\u003c").replace(/>/g, "\\u003e").replace(/\u2028/g, "\\u2028").replace(/\u2029/g, "\\u2029");
+/**
+* Serializes a graph into deterministic JSON-LD.
+*
+* scriptSafe protects the serialized content when embedded in
+* an HTML script element.
+*/
+const serializeSeoGraph = (graph, options = {}) => {
+	const validation = options.validate === false ? {
+		valid: true,
+		issues: []
+	} : validateSeoGraph(graph);
+	const cleaned = cleanValue(graph);
+	if (!isObject(cleaned)) throw new Error("Unable to serialize SEO graph.");
+	const serializable = { ...cleaned };
+	if (options.includeContext === false) delete serializable["@context"];
+	const value = JSON.stringify(canonicalize(serializable), null, options.pretty ? 2 : void 0) ?? "null";
+	return {
+		value: options.scriptSafe ?? options.safe ?? true ? escapeJsonForHtml(value) : value,
+		errors: validation.issues
+	};
+};
+/**
+* Returns the serialized JSON-LD string directly.
+*/
+const stringifySeoGraph = (graph, options = {}) => serializeSeoGraph(graph, options).value;
+export { buildSeoGraph, createSeoGraphBuilder, createSeoNode, mergeSeoNodes, normalizeSeoId, resolveSeoReferences, serializeSeoGraph, stringifySeoGraph, validateSeoGraph };
+
+//# sourceMappingURL=graph.js.map

package/dist/core/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","names":[],"sources":["../../src/core/graph.ts"],"sourcesContent":["import type {\n  SeoGraph,\n  SeoGraphBuilder,\n  SeoGraphBuilderOptions,\n  SeoGraphSerializationOptions,\n  SeoGraphValidationOptions,\n  SeoNode,\n  SeoNodeOptions,\n  SeoValidationIssue,\n  SeoValidationResult,\n} from \"./types\";\n\nconst DEFAULT_CONTEXT = \"https://schema.org\";\n\nconst isObject = (value: unknown): value is Record<string, unknown> =>\n  typeof value === \"object\" && value !== null && !Array.isArray(value);\n\nconst isNode = (value: unknown): value is SeoNode =>\n  isObject(value) &&\n  (typeof value[\"@type\"] === \"string\" ||\n    (Array.isArray(value[\"@type\"]) &&\n      value[\"@type\"].every((item) => typeof item === \"string\")));\n\nconst normalizeType = (type: string): string => {\n  const value = type.trim();\n\n  if (!value) {\n    throw new Error(\"SEO node type cannot be empty.\");\n  }\n\n  if (/^[A-Za-z][A-Za-z0-9]*$/.test(value)) {\n    return `https://schema.org/${value}`;\n  }\n\n  return value.replace(/^http:\\/\\/schema\\.org\\//, \"https://schema.org/\");\n};\n\nconst compareStrings = (left: string, right: string): number =>\n  left < right ? -1 : left > right ? 1 : 0;\n\nconst slugify = (value: string): string =>\n  value\n    .normalize(\"NFKD\")\n    .replace(/[\\u0300-\\u036f]/g, \"\")\n    .toLowerCase()\n    .replace(/[^a-z0-9]+/g, \"-\")\n    .replace(/^-+|-+$/g, \"\")\n    .slice(0, 64);\n\nconst canonicalize = (value: unknown): unknown => {\n  if (Array.isArray(value)) {\n    return value.map(canonicalize);\n  }\n\n  if (!isObject(value)) {\n    return value;\n  }\n\n  const result: Record<string, unknown> = {};\n\n  const preferredOrder = [\"@context\", \"@id\", \"@type\"];\n\n  const keys = Object.keys(value).sort((a, b) => {\n    const ai = preferredOrder.indexOf(a);\n    const bi = preferredOrder.indexOf(b);\n\n    if (ai !== -1 || bi !== -1) {\n      if (ai === -1) return 1;\n      if (bi === -1) return -1;\n      return ai - bi;\n    }\n\n    return compareStrings(a, b);\n  });\n\n  for (const key of keys) {\n    result[key] = canonicalize(value[key]);\n  }\n\n  return result;\n};\n\nconst stableStringify = (value: unknown): string =>\n  JSON.stringify(canonicalize(value));\n\nconst hashString = (value: string): string => {\n  let hash = 2166136261;\n\n  for (let index = 0; index < value.length; index += 1) {\n    hash ^= value.charCodeAt(index);\n    hash = Math.imul(hash, 16777619);\n  }\n\n  return (hash >>> 0).toString(36);\n};\n\nconst normalizeBaseUrl = (baseUrl?: string): string | undefined => {\n  if (!baseUrl) {\n    return undefined;\n  }\n\n  const url = new URL(baseUrl);\n\n  if (url.protocol !== \"http:\" && url.protocol !== \"https:\") {\n    throw new Error(\"SEO baseUrl must use HTTP or HTTPS.\");\n  }\n\n  url.hash = \"\";\n\n  return url.toString().replace(/\\/$/, \"\");\n};\n\n/**\n * Converts an absolute, relative or fragment identifier\n * into a canonical identifier.\n *\n * Relative identifiers require a base URL.\n */\nexport const normalizeSeoId = (id: string, baseUrl?: string): string => {\n  const value = id.trim();\n\n  if (!value) {\n    throw new Error(\"SEO node ID cannot be empty.\");\n  }\n\n  if (/^[a-z][a-z\\d+.-]*:/i.test(value)) {\n    try {\n      const url = new URL(value);\n\n      if (url.protocol === \"http:\" && url.hostname === \"schema.org\") {\n        url.protocol = \"https:\";\n      }\n\n      return url.toString();\n    } catch {\n      throw new Error(`Invalid SEO node ID: ${value}`);\n    }\n  }\n\n  const base = normalizeBaseUrl(baseUrl);\n\n  if (!base) {\n    if (value.startsWith(\"#\")) {\n      return value;\n    }\n\n    throw new Error(`Relative SEO node ID \"${value}\" requires a baseUrl.`);\n  }\n\n  try {\n    return new URL(value, `${base}/`).toString();\n  } catch {\n    throw new Error(`Invalid SEO node ID: ${value}`);\n  }\n};\n\nconst createAutomaticId = (node: SeoNode, options: SeoNodeOptions): string => {\n  const baseUrl = normalizeBaseUrl(options.baseUrl);\n\n  const types = Array.isArray(node[\"@type\"]) ? node[\"@type\"] : [node[\"@type\"]];\n\n  const type = types[0] ?? \"Thing\";\n  const typeSlug = slugify(type.split(\"/\").pop() ?? \"thing\");\n\n  const identityProperties = [\n    \"url\",\n    \"mainEntityOfPage\",\n    \"name\",\n    \"headline\",\n    \"title\",\n  ];\n\n  let identity: string | undefined;\n\n  for (const property of identityProperties) {\n    const value = node[property];\n\n    if (typeof value === \"string\" && value.trim()) {\n      identity = value;\n      break;\n    }\n\n    if (isObject(value) && typeof value[\"@id\"] === \"string\") {\n      identity = value[\"@id\"];\n      break;\n    }\n  }\n\n  const identitySlug = identity\n    ? slugify(identity)\n    : hashString(stableStringify(node));\n\n  const fragment = `${typeSlug}-${identitySlug || hashString(stableStringify(node))}`;\n\n  return baseUrl ? `${baseUrl}/#${fragment}` : `#${fragment}`;\n};\n\n/**\n * Removes values that cannot be represented safely in JSON-LD.\n *\n * Internal Puzzle properties beginning with __puzzle are excluded.\n * User-defined Schema.org properties remain untouched.\n */\nconst cleanValue = (value: unknown): unknown => {\n  if (\n    value === null ||\n    typeof value === \"string\" ||\n    typeof value === \"boolean\"\n  ) {\n    return value;\n  }\n\n  if (typeof value === \"number\") {\n    return Number.isFinite(value) ? value : null;\n  }\n\n  if (\n    typeof value === \"undefined\" ||\n    typeof value === \"function\" ||\n    typeof value === \"symbol\" ||\n    typeof value === \"bigint\"\n  ) {\n    return undefined;\n  }\n\n  if (Array.isArray(value)) {\n    return value.map(cleanValue).filter((item) => item !== undefined);\n  }\n\n  if (value instanceof Date) {\n    return value.toISOString();\n  }\n\n  if (!isObject(value)) {\n    return undefined;\n  }\n\n  const result: Record<string, unknown> = {};\n\n  for (const [key, nestedValue] of Object.entries(value)) {\n    if (key.startsWith(\"__puzzle\")) {\n      continue;\n    }\n\n    const cleaned = cleanValue(nestedValue);\n\n    if (cleaned !== undefined) {\n      result[key] = cleaned;\n    }\n  }\n\n  return result;\n};\n\nconst normalizeNodeId = (node: SeoNode, options: SeoNodeOptions): string => {\n  // An explicit options.id takes precedence over the node's @id.\n  const explicitId = options.id ?? node[\"@id\"];\n\n  if (typeof explicitId === \"string\") {\n    return normalizeSeoId(explicitId, options.baseUrl);\n  }\n\n  return createAutomaticId(node, options);\n};\n\n/**\n * Creates a normalized, JSON-compatible SEO node.\n *\n * Explicit IDs always override generated IDs.\n * The original input is never mutated.\n */\nexport const createSeoNode = (\n  input: SeoNode,\n  options: SeoNodeOptions = {},\n): SeoNode => {\n  if (!isNode(input)) {\n    throw new Error(\"SEO node must contain a valid @type.\");\n  }\n\n  const cleaned = cleanValue(input);\n\n  if (!isObject(cleaned)) {\n    throw new Error(\"Unable to normalize SEO node.\");\n  }\n\n  const type = Array.isArray(cleaned[\"@type\"])\n    ? cleaned[\"@type\"].map((item) => normalizeType(String(item)))\n    : normalizeType(String(cleaned[\"@type\"]));\n\n  const node: SeoNode = {\n    ...cleaned,\n    \"@id\": normalizeNodeId(input, options),\n    \"@type\": type,\n  };\n\n  return node;\n};\n\nconst cloneNode = (node: SeoNode): SeoNode => {\n  const cloned = cleanValue(node);\n\n  if (!isObject(cloned) || !isNode(cloned)) {\n    throw new Error(\"Invalid SEO node.\");\n  }\n\n  return cloned as SeoNode;\n};\n\ninterface MergeContext {\n  strategy: NonNullable<SeoGraphBuilderOptions[\"conflictStrategy\"]>;\n  issues: SeoValidationIssue[];\n  nodeId: string;\n}\n\nconst isEmptyValue = (value: unknown): boolean =>\n  value === undefined ||\n  value === null ||\n  value === \"\" ||\n  (Array.isArray(value) && value.length === 0);\n\nconst mergeArrays = (left: unknown[], right: unknown[]): unknown[] => {\n  const values = new Map<string, unknown>();\n\n  for (const value of [...left, ...right]) {\n    values.set(stableStringify(value), value);\n  }\n\n  return [...values.entries()]\n    .sort(([a], [b]) => compareStrings(a, b))\n    .map(([, value]) => value);\n};\n\nconst mergeValues = (\n  left: unknown,\n  right: unknown,\n  context: MergeContext,\n  path: string,\n): unknown => {\n  if (isEmptyValue(left)) return right;\n  if (isEmptyValue(right)) return left;\n\n  if (path === \"@type\") {\n    const types = new Set([\n      ...(Array.isArray(left) ? left : [left]),\n      ...(Array.isArray(right) ? right : [right]),\n    ]);\n\n    const sorted = [...types].sort((a, b) =>\n      compareStrings(String(a), String(b)),\n    );\n\n    return sorted.length === 1 ? sorted[0] : sorted;\n  }\n\n  if (stableStringify(left) === stableStringify(right)) {\n    return left;\n  }\n\n  if (Array.isArray(left) && Array.isArray(right)) {\n    return mergeArrays(left, right);\n  }\n\n  if (isObject(left) && isObject(right)) {\n    const result: Record<string, unknown> = {\n      ...left,\n    };\n\n    for (const [key, value] of Object.entries(right)) {\n      if (!(key in result)) {\n        result[key] = value;\n        continue;\n      }\n\n      result[key] = mergeValues(\n        result[key],\n        value,\n        context,\n        path ? `${path}.${key}` : key,\n      );\n    }\n\n    return result;\n  }\n\n  const severity = context.strategy === \"error\" ? \"error\" : \"warning\";\n\n  context.issues.push({\n    code: \"graph-property-conflict\",\n    severity,\n    message: `Conflicting values found at ${path}.`,\n    nodeId: context.nodeId,\n    property: path,\n  });\n\n  switch (context.strategy) {\n    case \"first\":\n      return left;\n\n    case \"last\":\n      return right;\n\n    case \"error\":\n      // Keep the deterministic existing value while reporting an error.\n      return compareStrings(stableStringify(left), stableStringify(right)) <= 0\n        ? left\n        : right;\n\n    case \"deterministic\":\n    default:\n      return compareStrings(stableStringify(left), stableStringify(right)) <= 0\n        ? left\n        : right;\n  }\n};\n\n/**\n * Merges two nodes with the same @id.\n *\n * Complementary values are combined.\n * Arrays are deduplicated.\n * Scalar conflicts are reported.\n */\nexport const mergeSeoNodes = (\n  left: SeoNode,\n  right: SeoNode,\n  options: {\n    conflictStrategy?: SeoGraphBuilderOptions[\"conflictStrategy\"];\n  } = {},\n): {\n  node: SeoNode;\n  issues: SeoValidationIssue[];\n} => {\n  const normalizedLeft = createSeoNode(left);\n  const normalizedRight = createSeoNode(right);\n\n  const leftId = normalizedLeft[\"@id\"];\n  const rightId = normalizedRight[\"@id\"];\n\n  if (!leftId || leftId !== rightId) {\n    throw new Error(\"Only SEO nodes with identical @id values can be merged.\");\n  }\n\n  const issues: SeoValidationIssue[] = [];\n\n  const context: MergeContext = {\n    strategy: options.conflictStrategy ?? \"deterministic\",\n    issues,\n    nodeId: String(leftId),\n  };\n\n  const node = mergeValues(\n    cloneNode(normalizedLeft),\n    cloneNode(normalizedRight),\n    context,\n    \"\",\n  ) as SeoNode;\n\n  return {\n    node,\n    issues,\n  };\n};\n\nconst isReference = (value: unknown): value is { \"@id\": string } =>\n  isObject(value) &&\n  typeof value[\"@id\"] === \"string\" &&\n  Object.keys(value).every((key) => key === \"@id\");\n\nconst createReference = (id: string): { \"@id\": string } => ({\n  \"@id\": id,\n});\n\ninterface BuilderState {\n  nodes: Map<string, SeoNode>;\n  issues: SeoValidationIssue[];\n  options: SeoGraphBuilderOptions;\n}\n\n/**\n * Resolves inline nodes recursively.\n *\n * Nested objects with @type become independent graph nodes.\n * Their original position is replaced by an @id reference.\n */\nconst resolveInlineValue = (value: unknown, state: BuilderState): unknown => {\n  if (Array.isArray(value)) {\n    return value.map((item) => resolveInlineValue(item, state));\n  }\n\n  if (!isObject(value)) {\n    return value;\n  }\n\n  if (isNode(value)) {\n    const nestedNode = createSeoNode(value as SeoNode, {\n      baseUrl: state.options.baseUrl,\n      context: state.options.context,\n    });\n\n    const resolved = resolveNode(nestedNode, state);\n\n    addNodeToState(resolved, state);\n\n    return createReference(String(resolved[\"@id\"]));\n  }\n\n  if (isReference(value)) {\n    return {\n      \"@id\": normalizeSeoId(value[\"@id\"], state.options.baseUrl),\n    };\n  }\n\n  const result: Record<string, unknown> = {};\n\n  for (const [key, nestedValue] of Object.entries(value)) {\n    result[key] = resolveInlineValue(nestedValue, state);\n  }\n\n  return result;\n};\n\nconst resolveNode = (node: SeoNode, state: BuilderState): SeoNode => {\n  const result = cloneNode(node);\n\n  for (const [key, value] of Object.entries(result)) {\n    if (key === \"@id\" || key === \"@type\" || key === \"@context\") {\n      continue;\n    }\n\n    result[key] = resolveInlineValue(value, state);\n  }\n\n  return result;\n};\n\nconst addNodeToState = (node: SeoNode, state: BuilderState): void => {\n  const id = String(node[\"@id\"]);\n\n  const existing = state.nodes.get(id);\n\n  if (!existing) {\n    state.nodes.set(id, node);\n    return;\n  }\n\n  const merged = mergeSeoNodes(existing, node, {\n    conflictStrategy: state.options.conflictStrategy,\n  });\n\n  state.nodes.set(id, merged.node);\n  state.issues.push(...merged.issues);\n};\n\nconst collectReferences = (value: unknown, references: Set<string>): void => {\n  if (Array.isArray(value)) {\n    for (const item of value) {\n      collectReferences(item, references);\n    }\n\n    return;\n  }\n\n  if (!isObject(value)) {\n    return;\n  }\n\n  if (isReference(value)) {\n    references.add(value[\"@id\"]);\n    return;\n  }\n\n  for (const nestedValue of Object.values(value)) {\n    collectReferences(nestedValue, references);\n  }\n};\n\nconst isLocalReference = (id: string, baseUrl?: string): boolean => {\n  if (id.startsWith(\"#\")) {\n    return true;\n  }\n\n  if (!baseUrl) {\n    return false;\n  }\n\n  try {\n    const reference = new URL(id);\n    const base = new URL(baseUrl);\n\n    return reference.origin === base.origin;\n  } catch {\n    return false;\n  }\n};\n\nconst validateReferences = (\n  graph: SeoGraph,\n  options: SeoGraphValidationOptions = {},\n): SeoValidationIssue[] => {\n  const ids = new Set(graph[\"@graph\"].map((node) => String(node[\"@id\"])));\n\n  const references = new Set<string>();\n\n  for (const node of graph[\"@graph\"]) {\n    collectReferences(node, references);\n  }\n\n  const issues: SeoValidationIssue[] = [];\n\n  for (const reference of references) {\n    if (ids.has(reference)) {\n      continue;\n    }\n\n    if (\n      options.allowedExternalReferences !== false &&\n      !isLocalReference(reference, options.baseUrl)\n    ) {\n      continue;\n    }\n\n    issues.push({\n      code: \"unresolved-reference\",\n      severity: options.strictReferences ? \"error\" : \"warning\",\n      message: `Unable to resolve SEO reference: ${reference}`,\n      nodeId: reference,\n    });\n  }\n\n  return issues;\n};\n\n/**\n * Builds a complete JSON-LD graph from a collection of nodes.\n *\n * Each builder instance owns its own state. No global state is used.\n */\nexport const createSeoGraphBuilder = (\n  options: SeoGraphBuilderOptions = {},\n): SeoGraphBuilder => {\n  const state: BuilderState = {\n    nodes: new Map(),\n    issues: [],\n    options: {\n      conflictStrategy: \"deterministic\",\n      strictReferences: false,\n      ...options,\n    },\n  };\n\n  const builder: SeoGraphBuilder = {\n    add(input) {\n      const node = createSeoNode(input, {\n        baseUrl: state.options.baseUrl,\n        context: state.options.context,\n      });\n\n      const resolved = resolveNode(node, state);\n\n      addNodeToState(resolved, state);\n\n      return builder;\n    },\n\n    addMany(nodes) {\n      for (const node of nodes) {\n        builder.add(node);\n      }\n\n      return builder;\n    },\n\n    build() {\n      const nodes = [...state.nodes.values()].sort((a, b) => {\n        const left = String(a[\"@id\"]);\n        const right = String(b[\"@id\"]);\n\n        return left < right ? -1 : left > right ? 1 : 0;\n      });\n\n      const graph: SeoGraph = {\n        \"@context\": state.options.context ?? DEFAULT_CONTEXT,\n        \"@graph\": nodes,\n      };\n\n      return graph;\n    },\n\n    getIssues() {\n      const graph: SeoGraph = {\n        \"@context\": state.options.context ?? DEFAULT_CONTEXT,\n        \"@graph\": [...state.nodes.values()],\n      };\n\n      return [\n        ...state.issues,\n        ...validateReferences(graph, {\n          baseUrl: state.options.baseUrl,\n          strictReferences: state.options.strictReferences,\n          allowedExternalReferences: true,\n        }),\n      ];\n    },\n  };\n\n  return builder;\n};\n\n/**\n * Convenience function for building a graph in one operation.\n */\nexport const buildSeoGraph = (\n  nodes: readonly SeoNode[],\n  options: SeoGraphBuilderOptions = {},\n): SeoGraph => {\n  return createSeoGraphBuilder(options).addMany(nodes).build();\n};\n\n/**\n * Normalizes and validates an existing graph.\n *\n * Inline nodes are extracted and references are normalized.\n */\nexport const resolveSeoReferences = (\n  graph: SeoGraph,\n  options: SeoGraphBuilderOptions = {},\n): SeoGraph => {\n  return createSeoGraphBuilder({\n    ...options,\n    context: options.context ?? graph[\"@context\"] ?? DEFAULT_CONTEXT,\n  })\n    .addMany(graph[\"@graph\"])\n    .build();\n};\n\n/**\n * Validates graph structure, IDs and references.\n */\nexport const validateSeoGraph = (\n  graph: SeoGraph,\n  options: SeoGraphValidationOptions = {},\n): SeoValidationResult => {\n  const issues: SeoValidationIssue[] = [];\n\n  if (!Array.isArray(graph[\"@graph\"])) {\n    return {\n      valid: false,\n      issues: [\n        {\n          code: \"invalid-graph\",\n          severity: \"error\",\n          message: \"SEO graph must contain an @graph array.\",\n        },\n      ],\n    };\n  }\n\n  const ids = new Set<string>();\n\n  for (let index = 0; index < graph[\"@graph\"].length; index += 1) {\n    const node = graph[\"@graph\"][index];\n\n    if (!isNode(node)) {\n      issues.push({\n        code: \"invalid-node\",\n        severity: \"error\",\n        message: `Invalid SEO node at index ${index}.`,\n        path: `@graph[${index}]`,\n      });\n\n      continue;\n    }\n\n    const id = node[\"@id\"];\n\n    if (typeof id !== \"string\" || !id.trim()) {\n      issues.push({\n        code: \"missing-node-id\",\n        severity: \"error\",\n        message: `SEO node at index ${index} has no valid @id.`,\n        path: `@graph[${index}].@id`,\n      });\n\n      continue;\n    }\n\n    if (ids.has(id)) {\n      issues.push({\n        code: \"duplicate-node-id\",\n        severity: \"error\",\n        message: `Duplicate SEO node ID: ${id}`,\n        nodeId: id,\n      });\n    }\n\n    ids.add(id);\n\n    const types = Array.isArray(node[\"@type\"])\n      ? node[\"@type\"]\n      : [node[\"@type\"]];\n\n    if (\n      types.length === 0 ||\n      types.some((type) => typeof type !== \"string\" || !type.trim())\n    ) {\n      issues.push({\n        code: \"invalid-node-type\",\n        severity: \"error\",\n        message: `SEO node ${id} has an invalid @type.`,\n        nodeId: id,\n      });\n    }\n  }\n\n  issues.push(...validateReferences(graph, options));\n\n  return {\n    valid: !issues.some((issue) => issue.severity === \"error\"),\n    issues,\n  };\n};\n\nconst escapeJsonForHtml = (value: string): string =>\n  value\n    .replace(/&/g, \"\\\\u0026\")\n    .replace(/</g, \"\\\\u003c\")\n    .replace(/>/g, \"\\\\u003e\")\n    .replace(/\\u2028/g, \"\\\\u2028\")\n    .replace(/\\u2029/g, \"\\\\u2029\");\n\n/**\n * Serializes a graph into deterministic JSON-LD.\n *\n * scriptSafe protects the serialized content when embedded in\n * an HTML script element.\n */\nexport const serializeSeoGraph = (\n  graph: SeoGraph,\n  options: SeoGraphSerializationOptions = {},\n): {\n  value: string;\n  errors: SeoValidationIssue[];\n} => {\n  const validation =\n    options.validate === false\n      ? { valid: true, issues: [] }\n      : validateSeoGraph(graph);\n\n  const cleaned = cleanValue(graph);\n\n  if (!isObject(cleaned)) {\n    throw new Error(\"Unable to serialize SEO graph.\");\n  }\n\n  const serializable: Record<string, unknown> = {\n    ...cleaned,\n  };\n\n  if (options.includeContext === false) {\n    delete serializable[\"@context\"];\n  }\n\n  const value =\n    JSON.stringify(\n      canonicalize(serializable),\n      null,\n      options.pretty ? 2 : undefined,\n    ) ?? \"null\";\n\n  const scriptSafe = options.scriptSafe ?? options.safe ?? true;\n\n  return {\n    value: scriptSafe ? escapeJsonForHtml(value) : value,\n    errors: validation.issues,\n  };\n};\n\n/**\n * Returns the serialized JSON-LD string directly.\n */\nexport const stringifySeoGraph = (\n  graph: SeoGraph,\n  options: SeoGraphSerializationOptions = {},\n): string => serializeSeoGraph(graph, options).value;\n"],"mappings":";AAYA,MAAM,kBAAkB;AAExB,MAAM,YAAY,UAChB,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;AAErE,MAAM,UAAU,UACd,SAAS,KAAK,MACb,OAAO,MAAM,aAAa,YACxB,MAAM,QAAQ,MAAM,QAAQ,KAC3B,MAAM,QAAQ,CAAC,OAAO,SAAS,OAAO,SAAS,QAAQ;AAE7D,MAAM,iBAAiB,SAAyB;CAC9C,MAAM,QAAQ,KAAK,KAAK;CAExB,IAAI,CAAC,OACH,MAAM,IAAI,MAAM,gCAAgC;CAGlD,IAAI,yBAAyB,KAAK,KAAK,GACrC,OAAO,sBAAsB;CAG/B,OAAO,MAAM,QAAQ,2BAA2B,qBAAqB;AACvE;AAEA,MAAM,kBAAkB,MAAc,UACpC,OAAO,QAAQ,KAAK,OAAO,QAAQ,IAAI;AAEzC,MAAM,WAAW,UACf,MACG,UAAU,MAAM,CAAC,CACjB,QAAQ,oBAAoB,EAAE,CAAC,CAC/B,YAAY,CAAC,CACb,QAAQ,eAAe,GAAG,CAAC,CAC3B,QAAQ,YAAY,EAAE,CAAC,CACvB,MAAM,GAAG,EAAE;AAEhB,MAAM,gBAAgB,UAA4B;CAChD,IAAI,MAAM,QAAQ,KAAK,GACrB,OAAO,MAAM,IAAI,YAAY;CAG/B,IAAI,CAAC,SAAS,KAAK,GACjB,OAAO;CAGT,MAAM,SAAkC,CAAC;CAEzC,MAAM,iBAAiB;EAAC;EAAY;EAAO;CAAO;CAElD,MAAM,OAAO,OAAO,KAAK,KAAK,CAAC,CAAC,MAAM,GAAG,MAAM;EAC7C,MAAM,KAAK,eAAe,QAAQ,CAAC;EACnC,MAAM,KAAK,eAAe,QAAQ,CAAC;EAEnC,IAAI,OAAO,MAAM,OAAO,IAAI;GAC1B,IAAI,OAAO,IAAI,OAAO;GACtB,IAAI,OAAO,IAAI,OAAO;GACtB,OAAO,KAAK;EACd;EAEA,OAAO,eAAe,GAAG,CAAC;CAC5B,CAAC;CAED,KAAK,MAAM,OAAO,MAChB,OAAO,OAAO,aAAa,MAAM,IAAI;CAGvC,OAAO;AACT;AAEA,MAAM,mBAAmB,UACvB,KAAK,UAAU,aAAa,KAAK,CAAC;AAEpC,MAAM,cAAc,UAA0B;CAC5C,IAAI,OAAO;CAEX,KAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS,GAAG;EACpD,QAAQ,MAAM,WAAW,KAAK;EAC9B,OAAO,KAAK,KAAK,MAAM,QAAQ;CACjC;CAEA,QAAQ,SAAS,EAAA,CAAG,SAAS,EAAE;AACjC;AAEA,MAAM,oBAAoB,YAAyC;CACjE,IAAI,CAAC,SACH;CAGF,MAAM,MAAM,IAAI,IAAI,OAAO;CAE3B,IAAI,IAAI,aAAa,WAAW,IAAI,aAAa,UAC/C,MAAM,IAAI,MAAM,qCAAqC;CAGvD,IAAI,OAAO;CAEX,OAAO,IAAI,SAAS,CAAC,CAAC,QAAQ,OAAO,EAAE;AACzC;;;;;;;AAQA,MAAa,kBAAkB,IAAY,YAA6B;CACtE,MAAM,QAAQ,GAAG,KAAK;CAEtB,IAAI,CAAC,OACH,MAAM,IAAI,MAAM,8BAA8B;CAGhD,IAAI,sBAAsB,KAAK,KAAK,GAClC,IAAI;EACF,MAAM,MAAM,IAAI,IAAI,KAAK;EAEzB,IAAI,IAAI,aAAa,WAAW,IAAI,aAAa,cAC/C,IAAI,WAAW;EAGjB,OAAO,IAAI,SAAS;CACtB,QAAQ;EACN,MAAM,IAAI,MAAM,wBAAwB,OAAO;CACjD;CAGF,MAAM,OAAO,iBAAiB,OAAO;CAErC,IAAI,CAAC,MAAM;EACT,IAAI,MAAM,WAAW,GAAG,GACtB,OAAO;EAGT,MAAM,IAAI,MAAM,yBAAyB,MAAM,sBAAsB;CACvE;CAEA,IAAI;EACF,OAAO,IAAI,IAAI,OAAO,GAAG,KAAK,EAAE,CAAC,CAAC,SAAS;CAC7C,QAAQ;EACN,MAAM,IAAI,MAAM,wBAAwB,OAAO;CACjD;AACF;AAEA,MAAM,qBAAqB,MAAe,YAAoC;CAC5E,MAAM,UAAU,iBAAiB,QAAQ,OAAO;CAIhD,MAAM,QAFQ,MAAM,QAAQ,KAAK,QAAQ,IAAI,KAAK,WAAW,CAAC,KAAK,QAAQ,EAAA,CAExD,MAAM;CACzB,MAAM,WAAW,QAAQ,KAAK,MAAM,GAAG,CAAC,CAAC,IAAI,KAAK,OAAO;CAEzD,MAAM,qBAAqB;EACzB;EACA;EACA;EACA;EACA;CACF;CAEA,IAAI;CAEJ,KAAK,MAAM,YAAY,oBAAoB;EACzC,MAAM,QAAQ,KAAK;EAEnB,IAAI,OAAO,UAAU,YAAY,MAAM,KAAK,GAAG;GAC7C,WAAW;GACX;EACF;EAEA,IAAI,SAAS,KAAK,KAAK,OAAO,MAAM,WAAW,UAAU;GACvD,WAAW,MAAM;GACjB;EACF;CACF;CAMA,MAAM,WAAW,GAAG,SAAS,IAJR,WACjB,QAAQ,QAAQ,IAChB,WAAW,gBAAgB,IAAI,CAAC,MAEY,WAAW,gBAAgB,IAAI,CAAC;CAEhF,OAAO,UAAU,GAAG,QAAQ,IAAI,aAAa,IAAI;AACnD;;;;;;;AAQA,MAAM,cAAc,UAA4B;CAC9C,IACE,UAAU,QACV,OAAO,UAAU,YACjB,OAAO,UAAU,WAEjB,OAAO;CAGT,IAAI,OAAO,UAAU,UACnB,OAAO,OAAO,SAAS,KAAK,IAAI,QAAQ;CAG1C,IACE,OAAO,UAAU,eACjB,OAAO,UAAU,cACjB,OAAO,UAAU,YACjB,OAAO,UAAU,UAEjB;CAGF,IAAI,MAAM,QAAQ,KAAK,GACrB,OAAO,MAAM,IAAI,UAAU,CAAC,CAAC,QAAQ,SAAS,SAAS,KAAA,CAAS;CAGlE,IAAI,iBAAiB,MACnB,OAAO,MAAM,YAAY;CAG3B,IAAI,CAAC,SAAS,KAAK,GACjB;CAGF,MAAM,SAAkC,CAAC;CAEzC,KAAK,MAAM,CAAC,KAAK,gBAAgB,OAAO,QAAQ,KAAK,GAAG;EACtD,IAAI,IAAI,WAAW,UAAU,GAC3B;EAGF,MAAM,UAAU,WAAW,WAAW;EAEtC,IAAI,YAAY,KAAA,GACd,OAAO,OAAO;CAElB;CAEA,OAAO;AACT;AAEA,MAAM,mBAAmB,MAAe,YAAoC;CAE1E,MAAM,aAAa,QAAQ,MAAM,KAAK;CAEtC,IAAI,OAAO,eAAe,UACxB,OAAO,eAAe,YAAY,QAAQ,OAAO;CAGnD,OAAO,kBAAkB,MAAM,OAAO;AACxC;;;;;;;AAQA,MAAa,iBACX,OACA,UAA0B,CAAC,MACf;CACZ,IAAI,CAAC,OAAO,KAAK,GACf,MAAM,IAAI,MAAM,sCAAsC;CAGxD,MAAM,UAAU,WAAW,KAAK;CAEhC,IAAI,CAAC,SAAS,OAAO,GACnB,MAAM,IAAI,MAAM,+BAA+B;CAGjD,MAAM,OAAO,MAAM,QAAQ,QAAQ,QAAQ,IACvC,QAAQ,QAAQ,CAAC,KAAK,SAAS,cAAc,OAAO,IAAI,CAAC,CAAC,IAC1D,cAAc,OAAO,QAAQ,QAAQ,CAAC;CAQ1C,OAAO;EALL,GAAG;EACH,OAAO,gBAAgB,OAAO,OAAO;EACrC,SAAS;CAGD;AACZ;AAEA,MAAM,aAAa,SAA2B;CAC5C,MAAM,SAAS,WAAW,IAAI;CAE9B,IAAI,CAAC,SAAS,MAAM,KAAK,CAAC,OAAO,MAAM,GACrC,MAAM,IAAI,MAAM,mBAAmB;CAGrC,OAAO;AACT;AAQA,MAAM,gBAAgB,UACpB,UAAU,KAAA,KACV,UAAU,QACV,UAAU,MACT,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW;AAE5C,MAAM,eAAe,MAAiB,UAAgC;CACpE,MAAM,yBAAS,IAAI,IAAqB;CAExC,KAAK,MAAM,SAAS,CAAC,GAAG,MAAM,GAAG,KAAK,GACpC,OAAO,IAAI,gBAAgB,KAAK,GAAG,KAAK;CAG1C,OAAO,CAAC,GAAG,OAAO,QAAQ,CAAC,CAAC,CACzB,MAAM,CAAC,IAAI,CAAC,OAAO,eAAe,GAAG,CAAC,CAAC,CAAC,CACxC,KAAK,GAAG,WAAW,KAAK;AAC7B;AAEA,MAAM,eACJ,MACA,OACA,SACA,SACY;CACZ,IAAI,aAAa,IAAI,GAAG,OAAO;CAC/B,IAAI,aAAa,KAAK,GAAG,OAAO;CAEhC,IAAI,SAAS,SAAS;EAMpB,MAAM,SAAS,CAAC,mBAAG,IALD,IAAI,CACpB,GAAI,MAAM,QAAQ,IAAI,IAAI,OAAO,CAAC,IAAI,GACtC,GAAI,MAAM,QAAQ,KAAK,IAAI,QAAQ,CAAC,KAAK,CAC3C,CAEuB,CAAC,CAAC,CAAC,MAAM,GAAG,MACjC,eAAe,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,CACrC;EAEA,OAAO,OAAO,WAAW,IAAI,OAAO,KAAK;CAC3C;CAEA,IAAI,gBAAgB,IAAI,MAAM,gBAAgB,KAAK,GACjD,OAAO;CAGT,IAAI,MAAM,QAAQ,IAAI,KAAK,MAAM,QAAQ,KAAK,GAC5C,OAAO,YAAY,MAAM,KAAK;CAGhC,IAAI,SAAS,IAAI,KAAK,SAAS,KAAK,GAAG;EACrC,MAAM,SAAkC,EACtC,GAAG,KACL;EAEA,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,KAAK,GAAG;GAChD,IAAI,EAAE,OAAO,SAAS;IACpB,OAAO,OAAO;IACd;GACF;GAEA,OAAO,OAAO,YACZ,OAAO,MACP,OACA,SACA,OAAO,GAAG,KAAK,GAAG,QAAQ,GAC5B;EACF;EAEA,OAAO;CACT;CAEA,MAAM,WAAW,QAAQ,aAAa,UAAU,UAAU;CAE1D,QAAQ,OAAO,KAAK;EAClB,MAAM;EACN;EACA,SAAS,+BAA+B,KAAK;EAC7C,QAAQ,QAAQ;EAChB,UAAU;CACZ,CAAC;CAED,QAAQ,QAAQ,UAAhB;EACE,KAAK,SACH,OAAO;EAET,KAAK,QACH,OAAO;EAET,KAAK,SAEH,OAAO,eAAe,gBAAgB,IAAI,GAAG,gBAAgB,KAAK,CAAC,KAAK,IACpE,OACA;EAGN,SACE,OAAO,eAAe,gBAAgB,IAAI,GAAG,gBAAgB,KAAK,CAAC,KAAK,IACpE,OACA;CACR;AACF;;;;;;;;AASA,MAAa,iBACX,MACA,OACA,UAEI,CAAC,MAIF;CACH,MAAM,iBAAiB,cAAc,IAAI;CACzC,MAAM,kBAAkB,cAAc,KAAK;CAE3C,MAAM,SAAS,eAAe;CAC9B,MAAM,UAAU,gBAAgB;CAEhC,IAAI,CAAC,UAAU,WAAW,SACxB,MAAM,IAAI,MAAM,yDAAyD;CAG3E,MAAM,SAA+B,CAAC;CAEtC,MAAM,UAAwB;EAC5B,UAAU,QAAQ,oBAAoB;EACtC;EACA,QAAQ,OAAO,MAAM;CACvB;CASA,OAAO;EACL,MARW,YACX,UAAU,cAAc,GACxB,UAAU,eAAe,GACzB,SACA,EAIG;EACH;CACF;AACF;AAEA,MAAM,eAAe,UACnB,SAAS,KAAK,KACd,OAAO,MAAM,WAAW,YACxB,OAAO,KAAK,KAAK,CAAC,CAAC,OAAO,QAAQ,QAAQ,KAAK;AAEjD,MAAM,mBAAmB,QAAmC,EAC1D,OAAO,GACT;;;;;;;AAcA,MAAM,sBAAsB,OAAgB,UAAiC;CAC3E,IAAI,MAAM,QAAQ,KAAK,GACrB,OAAO,MAAM,KAAK,SAAS,mBAAmB,MAAM,KAAK,CAAC;CAG5D,IAAI,CAAC,SAAS,KAAK,GACjB,OAAO;CAGT,IAAI,OAAO,KAAK,GAAG;EACjB,MAAM,aAAa,cAAc,OAAkB;GACjD,SAAS,MAAM,QAAQ;GACvB,SAAS,MAAM,QAAQ;EACzB,CAAC;EAED,MAAM,WAAW,YAAY,YAAY,KAAK;EAE9C,eAAe,UAAU,KAAK;EAE9B,OAAO,gBAAgB,OAAO,SAAS,MAAM,CAAC;CAChD;CAEA,IAAI,YAAY,KAAK,GACnB,OAAO,EACL,OAAO,eAAe,MAAM,QAAQ,MAAM,QAAQ,OAAO,EAC3D;CAGF,MAAM,SAAkC,CAAC;CAEzC,KAAK,MAAM,CAAC,KAAK,gBAAgB,OAAO,QAAQ,KAAK,GACnD,OAAO,OAAO,mBAAmB,aAAa,KAAK;CAGrD,OAAO;AACT;AAEA,MAAM,eAAe,MAAe,UAAiC;CACnE,MAAM,SAAS,UAAU,IAAI;CAE7B,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,MAAM,GAAG;EACjD,IAAI,QAAQ,SAAS,QAAQ,WAAW,QAAQ,YAC9C;EAGF,OAAO,OAAO,mBAAmB,OAAO,KAAK;CAC/C;CAEA,OAAO;AACT;AAEA,MAAM,kBAAkB,MAAe,UAA8B;CACnE,MAAM,KAAK,OAAO,KAAK,MAAM;CAE7B,MAAM,WAAW,MAAM,MAAM,IAAI,EAAE;CAEnC,IAAI,CAAC,UAAU;EACb,MAAM,MAAM,IAAI,IAAI,IAAI;EACxB;CACF;CAEA,MAAM,SAAS,cAAc,UAAU,MAAM,EAC3C,kBAAkB,MAAM,QAAQ,iBAClC,CAAC;CAED,MAAM,MAAM,IAAI,IAAI,OAAO,IAAI;CAC/B,MAAM,OAAO,KAAK,GAAG,OAAO,MAAM;AACpC;AAEA,MAAM,qBAAqB,OAAgB,eAAkC;CAC3E,IAAI,MAAM,QAAQ,KAAK,GAAG;EACxB,KAAK,MAAM,QAAQ,OACjB,kBAAkB,MAAM,UAAU;EAGpC;CACF;CAEA,IAAI,CAAC,SAAS,KAAK,GACjB;CAGF,IAAI,YAAY,KAAK,GAAG;EACtB,WAAW,IAAI,MAAM,MAAM;EAC3B;CACF;CAEA,KAAK,MAAM,eAAe,OAAO,OAAO,KAAK,GAC3C,kBAAkB,aAAa,UAAU;AAE7C;AAEA,MAAM,oBAAoB,IAAY,YAA8B;CAClE,IAAI,GAAG,WAAW,GAAG,GACnB,OAAO;CAGT,IAAI,CAAC,SACH,OAAO;CAGT,IAAI;EACF,MAAM,YAAY,IAAI,IAAI,EAAE;EAC5B,MAAM,OAAO,IAAI,IAAI,OAAO;EAE5B,OAAO,UAAU,WAAW,KAAK;CACnC,QAAQ;EACN,OAAO;CACT;AACF;AAEA,MAAM,sBACJ,OACA,UAAqC,CAAC,MACb;CACzB,MAAM,MAAM,IAAI,IAAI,MAAM,SAAS,CAAC,KAAK,SAAS,OAAO,KAAK,MAAM,CAAC,CAAC;CAEtE,MAAM,6BAAa,IAAI,IAAY;CAEnC,KAAK,MAAM,QAAQ,MAAM,WACvB,kBAAkB,MAAM,UAAU;CAGpC,MAAM,SAA+B,CAAC;CAEtC,KAAK,MAAM,aAAa,YAAY;EAClC,IAAI,IAAI,IAAI,SAAS,GACnB;EAGF,IACE,QAAQ,8BAA8B,SACtC,CAAC,iBAAiB,WAAW,QAAQ,OAAO,GAE5C;EAGF,OAAO,KAAK;GACV,MAAM;GACN,UAAU,QAAQ,mBAAmB,UAAU;GAC/C,SAAS,oCAAoC;GAC7C,QAAQ;EACV,CAAC;CACH;CAEA,OAAO;AACT;;;;;;AAOA,MAAa,yBACX,UAAkC,CAAC,MACf;CACpB,MAAM,QAAsB;EAC1B,uBAAO,IAAI,IAAI;EACf,QAAQ,CAAC;EACT,SAAS;GACP,kBAAkB;GAClB,kBAAkB;GAClB,GAAG;EACL;CACF;CAEA,MAAM,UAA2B;EAC/B,IAAI,OAAO;GACT,MAAM,OAAO,cAAc,OAAO;IAChC,SAAS,MAAM,QAAQ;IACvB,SAAS,MAAM,QAAQ;GACzB,CAAC;GAED,MAAM,WAAW,YAAY,MAAM,KAAK;GAExC,eAAe,UAAU,KAAK;GAE9B,OAAO;EACT;EAEA,QAAQ,OAAO;GACb,KAAK,MAAM,QAAQ,OACjB,QAAQ,IAAI,IAAI;GAGlB,OAAO;EACT;EAEA,QAAQ;GACN,MAAM,QAAQ,CAAC,GAAG,MAAM,MAAM,OAAO,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM;IACrD,MAAM,OAAO,OAAO,EAAE,MAAM;IAC5B,MAAM,QAAQ,OAAO,EAAE,MAAM;IAE7B,OAAO,OAAO,QAAQ,KAAK,OAAO,QAAQ,IAAI;GAChD,CAAC;GAOD,OAAO;IAJL,YAAY,MAAM,QAAQ,WAAW;IACrC,UAAU;GAGD;EACb;EAEA,YAAY;GACV,MAAM,QAAkB;IACtB,YAAY,MAAM,QAAQ,WAAW;IACrC,UAAU,CAAC,GAAG,MAAM,MAAM,OAAO,CAAC;GACpC;GAEA,OAAO,CACL,GAAG,MAAM,QACT,GAAG,mBAAmB,OAAO;IAC3B,SAAS,MAAM,QAAQ;IACvB,kBAAkB,MAAM,QAAQ;IAChC,2BAA2B;GAC7B,CAAC,CACH;EACF;CACF;CAEA,OAAO;AACT;;;;AAKA,MAAa,iBACX,OACA,UAAkC,CAAC,MACtB;CACb,OAAO,sBAAsB,OAAO,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,MAAM;AAC7D;;;;;;AAOA,MAAa,wBACX,OACA,UAAkC,CAAC,MACtB;CACb,OAAO,sBAAsB;EAC3B,GAAG;EACH,SAAS,QAAQ,WAAW,MAAM,eAAe;CACnD,CAAC,CAAC,CACC,QAAQ,MAAM,SAAS,CAAC,CACxB,MAAM;AACX;;;;AAKA,MAAa,oBACX,OACA,UAAqC,CAAC,MACd;CACxB,MAAM,SAA+B,CAAC;CAEtC,IAAI,CAAC,MAAM,QAAQ,MAAM,SAAS,GAChC,OAAO;EACL,OAAO;EACP,QAAQ,CACN;GACE,MAAM;GACN,UAAU;GACV,SAAS;EACX,CACF;CACF;CAGF,MAAM,sBAAM,IAAI,IAAY;CAE5B,KAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,SAAS,CAAC,QAAQ,SAAS,GAAG;EAC9D,MAAM,OAAO,MAAM,SAAS,CAAC;EAE7B,IAAI,CAAC,OAAO,IAAI,GAAG;GACjB,OAAO,KAAK;IACV,MAAM;IACN,UAAU;IACV,SAAS,6BAA6B,MAAM;IAC5C,MAAM,UAAU,MAAM;GACxB,CAAC;GAED;EACF;EAEA,MAAM,KAAK,KAAK;EAEhB,IAAI,OAAO,OAAO,YAAY,CAAC,GAAG,KAAK,GAAG;GACxC,OAAO,KAAK;IACV,MAAM;IACN,UAAU;IACV,SAAS,qBAAqB,MAAM;IACpC,MAAM,UAAU,MAAM;GACxB,CAAC;GAED;EACF;EAEA,IAAI,IAAI,IAAI,EAAE,GACZ,OAAO,KAAK;GACV,MAAM;GACN,UAAU;GACV,SAAS,0BAA0B;GACnC,QAAQ;EACV,CAAC;EAGH,IAAI,IAAI,EAAE;EAEV,MAAM,QAAQ,MAAM,QAAQ,KAAK,QAAQ,IACrC,KAAK,WACL,CAAC,KAAK,QAAQ;EAElB,IACE,MAAM,WAAW,KACjB,MAAM,MAAM,SAAS,OAAO,SAAS,YAAY,CAAC,KAAK,KAAK,CAAC,GAE7D,OAAO,KAAK;GACV,MAAM;GACN,UAAU;GACV,SAAS,YAAY,GAAG;GACxB,QAAQ;EACV,CAAC;CAEL;CAEA,OAAO,KAAK,GAAG,mBAAmB,OAAO,OAAO,CAAC;CAEjD,OAAO;EACL,OAAO,CAAC,OAAO,MAAM,UAAU,MAAM,aAAa,OAAO;EACzD;CACF;AACF;AAEA,MAAM,qBAAqB,UACzB,MACG,QAAQ,MAAM,SAAS,CAAC,CACxB,QAAQ,MAAM,SAAS,CAAC,CACxB,QAAQ,MAAM,SAAS,CAAC,CACxB,QAAQ,WAAW,SAAS,CAAC,CAC7B,QAAQ,WAAW,SAAS;;;;;;;AAQjC,MAAa,qBACX,OACA,UAAwC,CAAC,MAItC;CACH,MAAM,aACJ,QAAQ,aAAa,QACjB;EAAE,OAAO;EAAM,QAAQ,CAAC;CAAE,IAC1B,iBAAiB,KAAK;CAE5B,MAAM,UAAU,WAAW,KAAK;CAEhC,IAAI,CAAC,SAAS,OAAO,GACnB,MAAM,IAAI,MAAM,gCAAgC;CAGlD,MAAM,eAAwC,EAC5C,GAAG,QACL;CAEA,IAAI,QAAQ,mBAAmB,OAC7B,OAAO,aAAa;CAGtB,MAAM,QACJ,KAAK,UACH,aAAa,YAAY,GACzB,MACA,QAAQ,SAAS,IAAI,KAAA,CACvB,KAAK;CAIP,OAAO;EACL,OAHiB,QAAQ,cAAc,QAAQ,QAAQ,OAGnC,kBAAkB,KAAK,IAAI;EAC/C,QAAQ,WAAW;CACrB;AACF;;;;AAKA,MAAa,qBACX,OACA,UAAwC,CAAC,MAC9B,kBAAkB,OAAO,OAAO,CAAC,CAAC"}

package/dist/core/index.cjs

@@ -0,0 +1,11 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const require_graph = require("./graph.cjs");
+exports.buildSeoGraph = require_graph.buildSeoGraph;
+exports.createSeoGraphBuilder = require_graph.createSeoGraphBuilder;
+exports.createSeoNode = require_graph.createSeoNode;
+exports.mergeSeoNodes = require_graph.mergeSeoNodes;
+exports.normalizeSeoId = require_graph.normalizeSeoId;
+exports.resolveSeoReferences = require_graph.resolveSeoReferences;
+exports.serializeSeoGraph = require_graph.serializeSeoGraph;
+exports.stringifySeoGraph = require_graph.stringifySeoGraph;
+exports.validateSeoGraph = require_graph.validateSeoGraph;

package/dist/core/index.d.cts

@@ -0,0 +1,3 @@
+import { Brand, JsonObject, JsonPrimitive, JsonValue, SeoGraph, SeoGraphBuilder, SeoGraphBuilderOptions, SeoGraphConflictStrategy, SeoGraphOptions, SeoGraphRoot, SeoGraphSerializationOptions, SeoGraphValidationOptions, SeoLocale, SeoMetadata, SeoNode, SeoNodeId, SeoNodeOptions, SeoNodeReference, SeoNodeType, SeoReference, SeoSerializationOptions, SeoSerializationResult, SeoUrl, SeoValidationIssue, SeoValidationResult, SeoValidationSeverity } from "./types.cjs";
+import { buildSeoGraph, createSeoGraphBuilder, createSeoNode, mergeSeoNodes, normalizeSeoId, resolveSeoReferences, serializeSeoGraph, stringifySeoGraph, validateSeoGraph } from "./graph.cjs";
+export { type Brand, type JsonObject, type JsonPrimitive, type JsonValue, type SeoGraph, type SeoGraphBuilder, type SeoGraphBuilderOptions, type SeoGraphConflictStrategy, type SeoGraphOptions, type SeoGraphRoot, type SeoGraphSerializationOptions, type SeoGraphValidationOptions, type SeoLocale, type SeoMetadata, type SeoNode, type SeoNodeId, type SeoNodeOptions, type SeoNodeReference, type SeoNodeType, type SeoReference, type SeoSerializationOptions, type SeoSerializationResult, type SeoUrl, type SeoValidationIssue, type SeoValidationResult, type SeoValidationSeverity, buildSeoGraph, createSeoGraphBuilder, createSeoNode, mergeSeoNodes, normalizeSeoId, resolveSeoReferences, serializeSeoGraph, stringifySeoGraph, validateSeoGraph };

package/dist/core/index.d.ts

@@ -0,0 +1,3 @@
+import { Brand, JsonObject, JsonPrimitive, JsonValue, SeoGraph, SeoGraphBuilder, SeoGraphBuilderOptions, SeoGraphConflictStrategy, SeoGraphOptions, SeoGraphRoot, SeoGraphSerializationOptions, SeoGraphValidationOptions, SeoLocale, SeoMetadata, SeoNode, SeoNodeId, SeoNodeOptions, SeoNodeReference, SeoNodeType, SeoReference, SeoSerializationOptions, SeoSerializationResult, SeoUrl, SeoValidationIssue, SeoValidationResult, SeoValidationSeverity } from "./types.js";
+import { buildSeoGraph, createSeoGraphBuilder, createSeoNode, mergeSeoNodes, normalizeSeoId, resolveSeoReferences, serializeSeoGraph, stringifySeoGraph, validateSeoGraph } from "./graph.js";
+export { type Brand, type JsonObject, type JsonPrimitive, type JsonValue, type SeoGraph, type SeoGraphBuilder, type SeoGraphBuilderOptions, type SeoGraphConflictStrategy, type SeoGraphOptions, type SeoGraphRoot, type SeoGraphSerializationOptions, type SeoGraphValidationOptions, type SeoLocale, type SeoMetadata, type SeoNode, type SeoNodeId, type SeoNodeOptions, type SeoNodeReference, type SeoNodeType, type SeoReference, type SeoSerializationOptions, type SeoSerializationResult, type SeoUrl, type SeoValidationIssue, type SeoValidationResult, type SeoValidationSeverity, buildSeoGraph, createSeoGraphBuilder, createSeoNode, mergeSeoNodes, normalizeSeoId, resolveSeoReferences, serializeSeoGraph, stringifySeoGraph, validateSeoGraph };

package/dist/core/index.js

@@ -0,0 +1 @@
+export { buildSeoGraph, createSeoGraphBuilder, createSeoNode, mergeSeoNodes, normalizeSeoId, resolveSeoReferences, serializeSeoGraph, stringifySeoGraph, validateSeoGraph } from "./graph.js";

package/dist/core/types.d.cts

@@ -0,0 +1,92 @@
+export type Brand<T, Name extends string> = T & {
+  readonly __brand: Name;
+};
+export type SeoUrl = Brand<string, "SeoUrl">;
+export type SeoNodeId = Brand<string, "SeoNodeId">;
+export type SeoLocale = Brand<string, "SeoLocale">;
+export type JsonPrimitive = string | number | boolean | null;
+export type JsonValue = JsonPrimitive | JsonValue[] | {
+  [key: string]: JsonValue;
+};
+export type JsonObject = {
+  [key: string]: JsonValue;
+};
+export type SeoNodeType = string | string[];
+export interface SeoNode {
+  "@id"?: SeoNodeId | string;
+  "@type": SeoNodeType;
+  "@context"?: string | Record<string, JsonValue>;
+  [key: string]: unknown;
+}
+export interface SeoGraph {
+  "@context"?: string | Record<string, JsonValue>;
+  "@graph": SeoNode[];
+}
+export interface SeoGraphOptions {
+  baseUrl?: string;
+  locale?: SeoLocale | string;
+  context?: string | Record<string, JsonValue>;
+  rootIds?: string[];
+}
+export interface SeoNodeReference {
+  "@id": SeoNodeId | string;
+}
+export interface SeoMetadata {
+  title?: string;
+  description?: string;
+  canonical?: SeoUrl | string;
+  robots?: string;
+}
+export type SeoValidationSeverity = "error" | "warning" | "info";
+export interface SeoValidationIssue {
+  code: string;
+  message: string;
+  severity: SeoValidationSeverity;
+  path?: string;
+  nodeId?: string;
+  property?: string;
+}
+export interface SeoValidationResult {
+  valid: boolean;
+  issues: SeoValidationIssue[];
+}
+export interface SeoSerializationOptions {
+  pretty?: boolean;
+  safe?: boolean;
+  scriptSafe?: boolean;
+}
+export interface SeoSerializationResult {
+  value: string;
+  errors: SeoValidationIssue[];
+}
+export interface SeoReference {
+  id: SeoNodeId | string;
+}
+export interface SeoGraphRoot {
+  id: SeoNodeId | string;
+  primary?: boolean;
+}
+export type SeoGraphConflictStrategy = "deterministic" | "first" | "last" | "error";
+export interface SeoNodeOptions extends SeoGraphOptions {
+  id?: string;
+  type?: string;
+}
+export interface SeoGraphBuilderOptions extends SeoGraphOptions {
+  conflictStrategy?: SeoGraphConflictStrategy;
+  strictReferences?: boolean;
+}
+export interface SeoGraphBuilder {
+  add(node: SeoNode): this;
+  addMany(nodes: readonly SeoNode[]): this;
+  build(): SeoGraph;
+  getIssues(): readonly SeoValidationIssue[];
+}
+export interface SeoGraphValidationOptions {
+  baseUrl?: string;
+  strictReferences?: boolean;
+  allowedExternalReferences?: boolean;
+}
+export interface SeoGraphSerializationOptions extends SeoSerializationOptions {
+  includeContext?: boolean;
+  validate?: boolean;
+}