@elastic/isomer-sdk 0.0.0 → 0.1.0

package/dist/validate/composition_schema.js

@@ -0,0 +1,127 @@
+/*
+ * Copyright Elasticsearch B.V. and/or licensed to Elasticsearch B.V. under one
+ * or more contributor license agreements. Licensed under the Elastic License
+ * 2.0; you may not use this file except in compliance with the Elastic License
+ * 2.0.
+ */
+import { z } from 'zod';
+import { IsomerError } from '../composition/error.js';
+import { renderThemeSchema } from './value_schemas.js';
+/** `Composition.meta`: provenance and freshness, every field optional. */
+export const metaSchema = z.object({
+    source: z.string().optional(),
+    generatedAt: z.string().optional(),
+    ariaLabel: z.string().optional(),
+    provenance: z
+        .object({
+        source: z.string().optional(),
+        query: z.string().optional(),
+        provider: z.string().optional(),
+    })
+        .optional(),
+    freshness: z
+        .object({
+        asOf: z.string().optional(),
+        stale: z.boolean().optional(),
+        ttlSeconds: z.number().optional(),
+    })
+        .optional(),
+    partialFailure: z
+        .object({
+        degraded: z.boolean().optional(),
+        reason: z.string().optional(),
+    })
+        .optional(),
+});
+/**
+ * Wraps a body-node union in the `Composition` envelope.
+ *
+ * `.strict()`, so an unknown root key is an error rather than silently carried:
+ * the format crosses vendor boundaries, and a typo'd field that validates is
+ * worse than one that fails. Most callers want
+ * {@link getCompositionSchemaForDefinitions} instead, which memoizes.
+ */
+export const buildCompositionSchema = ({ bodyNodeSchema, }) => z
+    .object({
+    type: z.literal('view', { error: 'type must be "view"' }),
+    version: z.literal(1).optional(),
+    title: z.string().optional(),
+    subtitle: z.string().optional(),
+    theme: renderThemeSchema.optional(),
+    body: z
+        .array(bodyNodeSchema)
+        .min(1, { error: 'must contain at least one node' }),
+    meta: metaSchema.optional(),
+})
+    .strict();
+/**
+ * Builds a body-node union whose containers reference *this* union.
+ *
+ * The `z.lazy` closing the recursion is created here and discarded with the
+ * vocabulary: it memoizes its getter after the first resolution, so one shared
+ * across vocabularies would freeze on whichever union parsed first.
+ */
+export const resolveVocabulary = (definitions) => {
+    if (definitions.length === 0) {
+        throw new IsomerError('EMPTY_VOCABULARY', 'resolveVocabulary: at least one primitive is required');
+    }
+    // Resolved once the union exists; nothing parses before this function returns.
+    const pending = {};
+    const resolveUnion = () => {
+        if (!pending.union) {
+            throw new IsomerError('VOCABULARY_UNRESOLVED', 'resolveVocabulary: body-node union read before its vocabulary resolved');
+        }
+        return pending.union;
+    };
+    const members = new Map();
+    const memberSchemas = definitions.map((definition) => {
+        const schema = definition.schemaFor
+            ? // One `z.lazy` per container: the JSON Schema projection gives a shared
+                // wrapper its own anonymous `$def` instead of `$ref: #/$defs/bodyNode`.
+                definition.schemaFor(z.lazy(resolveUnion))
+            : definition.schema;
+        members.set(definition.type, schema);
+        return schema;
+    });
+    pending.union = z.discriminatedUnion('type', memberSchemas);
+    return { bodyNodeSchema: pending.union, members };
+};
+/**
+ * {@link resolveVocabulary}, discarding the member instances.
+ *
+ * Only for a caller with no id registry to name; anything projecting to JSON
+ * Schema needs the members and should use {@link resolveVocabulary}.
+ */
+export const buildBodyNodeSchemaFromDefinitions = (definitions) => resolveVocabulary(definitions).bodyNodeSchema;
+/**
+ * A fresh `Composition` schema over `definitions`.
+ *
+ * Builds a new union per call. Prefer
+ * {@link getCompositionSchemaForDefinitions} unless a fresh instance is
+ * required.
+ */
+export const buildCompositionSchemaFromDefinitions = (definitions) => buildCompositionSchema({
+    bodyNodeSchema: buildBodyNodeSchemaFromDefinitions(definitions),
+});
+const compositionSchemaCache = new WeakMap();
+const cachedFor = (definitions) => {
+    const cached = compositionSchemaCache.get(definitions);
+    if (cached) {
+        return cached;
+    }
+    const vocabulary = resolveVocabulary(definitions);
+    const entry = {
+        vocabulary,
+        schema: buildCompositionSchema({
+            bodyNodeSchema: vocabulary.bodyNodeSchema,
+        }),
+    };
+    compositionSchemaCache.set(definitions, entry);
+    return entry;
+};
+/**
+ * {@link buildCompositionSchemaFromDefinitions}, memoized per definition array.
+ * Prefer this whenever the caller does not need a fresh schema instance.
+ */
+export const getCompositionSchemaForDefinitions = (definitions) => cachedFor(definitions).schema;
+//# sourceMappingURL=composition_schema.js.map

package/dist/validate/composition_schema.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"composition_schema.js","sourceRoot":"","sources":["../../src/validate/composition_schema.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,CAAC,EAAgC,MAAM,KAAK,CAAC;AAEtD,OAAO,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAGnD,OAAO,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AAEpD,0EAA0E;AAC1E,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,CAAC,MAAM,CAAC;IACjC,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;IAC7B,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;IAClC,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;IAChC,UAAU,EAAE,CAAC;SACV,MAAM,CAAC;QACN,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;QAC7B,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;QAC5B,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;KAChC,CAAC;SACD,QAAQ,EAAE;IACb,SAAS,EAAE,CAAC;SACT,MAAM,CAAC;QACN,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;QAC3B,KAAK,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE;QAC7B,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;KAClC,CAAC;SACD,QAAQ,EAAE;IACb,cAAc,EAAE,CAAC;SACd,MAAM,CAAC;QACN,QAAQ,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE;QAChC,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;KAC9B,CAAC;SACD,QAAQ,EAAE;CACd,CAAC,CAAC;AAQH;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,EACrC,cAAc,GACW,EAAa,EAAE,CACxC,CAAC;KACE,MAAM,CAAC;IACN,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,qBAAqB,EAAE,CAAC;IACzD,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE;IAChC,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;IAC5B,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;IAC/B,KAAK,EAAE,iBAAiB,CAAC,QAAQ,EAAE;IACnC,IAAI,EAAE,CAAC;SACJ,KAAK,CAAC,cAAc,CAAC;SACrB,GAAG,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,gCAAgC,EAAE,CAAC;IACtD,IAAI,EAAE,UAAU,CAAC,QAAQ,EAAE;CAC5B,CAAC;KACD,MAAM,EAAE,CAAC;AAkBd;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAC/B,WAA8C,EAC1B,EAAE;IACtB,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC7B,MAAM,IAAI,WAAW,CACnB,kBAAkB,EAClB,uDAAuD,CACxD,CAAC;IACJ,CAAC;IACD,+EAA+E;IAC/E,MAAM,OAAO,GAAiC,EAAE,CAAC;IACjD,MAAM,YAAY,GAAG,GAAqB,EAAE;QAC1C,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;YACnB,MAAM,IAAI,WAAW,CACnB,uBAAuB,EACvB,wEAAwE,CACzE,CAAC;QACJ,CAAC;QACD,OAAO,OAAO,CAAC,KAAK,CAAC;IACvB,CAAC,CAAC;IAEF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC7C,MAAM,aAAa,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,EAAE;QACnD,MAAM,MAAM,GAAG,UAAU,CAAC,SAAS;YACjC,CAAC,CAAC,wEAAwE;gBACxE,wEAAwE;gBACxE,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAC5C,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC;QACtB,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACrC,OAAO,MAAM,CAAC;IAChB,CAAC,CAAC,CAAC;IAEH,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,kBAAkB,CAClC,MAAM,EACN,aAA4C,CAC7C,CAAC;IACF,OAAO,EAAE,cAAc,EAAE,OAAO,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC;AACpD,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,kCAAkC,GAAG,CAChD,WAA8C,EAC5B,EAAE,CAAC,iBAAiB,CAAC,WAAW,CAAC,CAAC,cAAc,CAAC;AAErE;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,qCAAqC,GAAG,CACnD,WAA8C,EACnC,EAAE,CACb,sBAAsB,CAAC;IACrB,cAAc,EAAE,kCAAkC,CAAC,WAAW,CAAC;CAChE,CAAC,CAAC;AAYL,MAAM,sBAAsB,GAAG,IAAI,OAAO,EAAmC,CAAC;AAE9E,MAAM,SAAS,GAAG,CAChB,WAA8C,EACrB,EAAE;IAC3B,MAAM,MAAM,GAAG,sBAAsB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IACvD,IAAI,MAAM,EAAE,CAAC;QACX,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,MAAM,UAAU,GAAG,iBAAiB,CAAC,WAAW,CAAC,CAAC;IAClD,MAAM,KAAK,GAA4B;QACrC,UAAU;QACV,MAAM,EAAE,sBAAsB,CAAC;YAC7B,cAAc,EAAE,UAAU,CAAC,cAAc;SAC1C,CAAC;KACH,CAAC;IACF,sBAAsB,CAAC,GAAG,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;IAC/C,OAAO,KAAK,CAAC;AACf,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,kCAAkC,GAAG,CAChD,WAA8C,EACnC,EAAE,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC","sourcesContent":["/*\n * Copyright Elasticsearch B.V. and/or licensed to Elasticsearch B.V. under one\n * or more contributor license agreements. Licensed under the Elastic License\n * 2.0; you may not use this file except in compliance with the Elastic License\n * 2.0.\n */\n\nimport { z, type ZodObject, type ZodType } from 'zod';\n\nimport { IsomerError } from '../composition/error';\nimport type { AnyPrimitiveDefinition } from '../define/primitive_module';\n\nimport { renderThemeSchema } from './value_schemas';\n\n/** `Composition.meta`: provenance and freshness, every field optional. */\nexport const metaSchema = z.object({\n  source: z.string().optional(),\n  generatedAt: z.string().optional(),\n  ariaLabel: z.string().optional(),\n  provenance: z\n    .object({\n      source: z.string().optional(),\n      query: z.string().optional(),\n      provider: z.string().optional(),\n    })\n    .optional(),\n  freshness: z\n    .object({\n      asOf: z.string().optional(),\n      stale: z.boolean().optional(),\n      ttlSeconds: z.number().optional(),\n    })\n    .optional(),\n  partialFailure: z\n    .object({\n      degraded: z.boolean().optional(),\n      reason: z.string().optional(),\n    })\n    .optional(),\n});\n\n/** Options for the `Composition` envelope schema a body-node union is wrapped in. */\nexport interface CompositionSchemaOptions {\n  /** The union the envelope's `body` array holds, as {@link resolveVocabulary} builds it. */\n  bodyNodeSchema: ZodType<unknown>;\n}\n\n/**\n * Wraps a body-node union in the `Composition` envelope.\n *\n * `.strict()`, so an unknown root key is an error rather than silently carried:\n * the format crosses vendor boundaries, and a typo'd field that validates is\n * worse than one that fails. Most callers want\n * {@link getCompositionSchemaForDefinitions} instead, which memoizes.\n */\nexport const buildCompositionSchema = ({\n  bodyNodeSchema,\n}: CompositionSchemaOptions): ZodObject =>\n  z\n    .object({\n      type: z.literal('view', { error: 'type must be \"view\"' }),\n      version: z.literal(1).optional(),\n      title: z.string().optional(),\n      subtitle: z.string().optional(),\n      theme: renderThemeSchema.optional(),\n      body: z\n        .array(bodyNodeSchema)\n        .min(1, { error: 'must contain at least one node' }),\n      meta: metaSchema.optional(),\n    })\n    .strict();\n\n/**\n * One set of definitions resolved into a body-node union, with the schema\n * instance that actually landed in it per primitive type.\n *\n * The members matter to callers because a container's schema in the union is\n * built by `schemaFor` and is therefore *not* `definition.schema`. Anything\n * keyed on identity — the JSON Schema id registry, which names `$defs` — has to\n * be given these, or a container's projection silently loses its name.\n */\nexport interface ResolvedVocabulary {\n  /** The discriminated union over every primitive type in this vocabulary. */\n  bodyNodeSchema: ZodType<unknown>;\n  /** Keyed by node type. A container's value comes from `schemaFor`, not `definition.schema`. */\n  members: ReadonlyMap<string, ZodObject>;\n}\n\n/**\n * Builds a body-node union whose containers reference *this* union.\n *\n * The `z.lazy` closing the recursion is created here and discarded with the\n * vocabulary: it memoizes its getter after the first resolution, so one shared\n * across vocabularies would freeze on whichever union parsed first.\n */\nexport const resolveVocabulary = (\n  definitions: readonly AnyPrimitiveDefinition[]\n): ResolvedVocabulary => {\n  if (definitions.length === 0) {\n    throw new IsomerError(\n      'EMPTY_VOCABULARY',\n      'resolveVocabulary: at least one primitive is required'\n    );\n  }\n  // Resolved once the union exists; nothing parses before this function returns.\n  const pending: { union?: ZodType<unknown> } = {};\n  const resolveUnion = (): ZodType<unknown> => {\n    if (!pending.union) {\n      throw new IsomerError(\n        'VOCABULARY_UNRESOLVED',\n        'resolveVocabulary: body-node union read before its vocabulary resolved'\n      );\n    }\n    return pending.union;\n  };\n\n  const members = new Map<string, ZodObject>();\n  const memberSchemas = definitions.map((definition) => {\n    const schema = definition.schemaFor\n      ? // One `z.lazy` per container: the JSON Schema projection gives a shared\n        // wrapper its own anonymous `$def` instead of `$ref: #/$defs/bodyNode`.\n        definition.schemaFor(z.lazy(resolveUnion))\n      : definition.schema;\n    members.set(definition.type, schema);\n    return schema;\n  });\n\n  pending.union = z.discriminatedUnion(\n    'type',\n    memberSchemas as [ZodObject, ...ZodObject[]]\n  );\n  return { bodyNodeSchema: pending.union, members };\n};\n\n/**\n * {@link resolveVocabulary}, discarding the member instances.\n *\n * Only for a caller with no id registry to name; anything projecting to JSON\n * Schema needs the members and should use {@link resolveVocabulary}.\n */\nexport const buildBodyNodeSchemaFromDefinitions = (\n  definitions: readonly AnyPrimitiveDefinition[]\n): ZodType<unknown> => resolveVocabulary(definitions).bodyNodeSchema;\n\n/**\n * A fresh `Composition` schema over `definitions`.\n *\n * Builds a new union per call. Prefer\n * {@link getCompositionSchemaForDefinitions} unless a fresh instance is\n * required.\n */\nexport const buildCompositionSchemaFromDefinitions = (\n  definitions: readonly AnyPrimitiveDefinition[]\n): ZodObject =>\n  buildCompositionSchema({\n    bodyNodeSchema: buildBodyNodeSchemaFromDefinitions(definitions),\n  });\n\n// Keyed on the definition array's identity: a runtime needs the same schema\n// for its validator, parser, and authoring context, so hold the array\n// `composePacks` returns rather than flattening per call. The vocabulary is\n// cached with the schema because the JSON Schema id registry names member\n// instances, and a second resolution would produce different ones.\ninterface CachedCompositionSchema {\n  schema: ZodObject;\n  vocabulary: ResolvedVocabulary;\n}\n\nconst compositionSchemaCache = new WeakMap<object, CachedCompositionSchema>();\n\nconst cachedFor = (\n  definitions: readonly AnyPrimitiveDefinition[]\n): CachedCompositionSchema => {\n  const cached = compositionSchemaCache.get(definitions);\n  if (cached) {\n    return cached;\n  }\n  const vocabulary = resolveVocabulary(definitions);\n  const entry: CachedCompositionSchema = {\n    vocabulary,\n    schema: buildCompositionSchema({\n      bodyNodeSchema: vocabulary.bodyNodeSchema,\n    }),\n  };\n  compositionSchemaCache.set(definitions, entry);\n  return entry;\n};\n\n/**\n * {@link buildCompositionSchemaFromDefinitions}, memoized per definition array.\n * Prefer this whenever the caller does not need a fresh schema instance.\n */\nexport const getCompositionSchemaForDefinitions = (\n  definitions: readonly AnyPrimitiveDefinition[]\n): ZodObject => cachedFor(definitions).schema;\n"]}

package/dist/validate/index.d.ts

@@ -0,0 +1,9 @@
+export { type AuthoringJsonSchemaOptions, authoringSchemaSubset, buildAuthoringJsonSchema, } from './authoring_schema.js';
+export { type CompositionSchemaOptions, buildBodyNodeSchemaFromDefinitions, buildCompositionSchema, buildCompositionSchemaFromDefinitions, getCompositionSchemaForDefinitions, metaSchema, } from './composition_schema.js';
+export { type InputBudget, type InputBudgetCheck, MAX_INPUT_CHARACTERS, MAX_INPUT_DEPTH, MAX_INPUT_VALUES, checkInputBudget, isInputRefusal, } from './input_budget.js';
+export { type CompositionJsonSchemaOptions, buildCompositionJsonSchema, } from './json_schema.js';
+export { type IssueRoot, createNodeIssueFormatter } from './node_issues.js';
+export { type UrlSchemaOptions, ASSET_URL_MESSAGE, ASSET_URL_RULE, BLOCKED_HREF, NAVIGATION_HREF_MESSAGE, NAVIGATION_HREF_RULE, assetUrl, navigationHref, sanitizeAssetUrl, sanitizeNavigationHref, sanitizeParsedAssetUrl, sanitizeParsedNavigationHref, } from './url.js';
+export { type CheckedComposition, type CheckedValidationResult, type CompositionValidatorOptions, type ParsedComposition, type ValidationErrorMode, type ValidationResult, type ValidationWarning, compositionToRender, CompositionValidationError, createCompositionParser, createCompositionValidator, warningsForSurface, } from './validation.js';
+export { displayValueSchema, namedColorSchema, renderThemeSchema, structuredValueSchema, } from './value_schemas.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/validate/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/validate/index.ts"],"names":[],"mappings":"AAOA,OAAO,EACL,KAAK,0BAA0B,EAC/B,qBAAqB,EACrB,wBAAwB,GACzB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EACL,KAAK,wBAAwB,EAC7B,kCAAkC,EAClC,sBAAsB,EACtB,qCAAqC,EACrC,kCAAkC,EAClC,UAAU,GACX,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EACL,KAAK,WAAW,EAChB,KAAK,gBAAgB,EACrB,oBAAoB,EACpB,eAAe,EACf,gBAAgB,EAChB,gBAAgB,EAChB,cAAc,GACf,MAAM,gBAAgB,CAAC;AACxB,OAAO,EACL,KAAK,4BAA4B,EACjC,0BAA0B,GAC3B,MAAM,eAAe,CAAC;AACvB,OAAO,EAAE,KAAK,SAAS,EAAE,wBAAwB,EAAE,MAAM,eAAe,CAAC;AACzE,OAAO,EACL,KAAK,gBAAgB,EACrB,iBAAiB,EACjB,cAAc,EACd,YAAY,EACZ,uBAAuB,EACvB,oBAAoB,EACpB,QAAQ,EACR,cAAc,EACd,gBAAgB,EAChB,sBAAsB,EACtB,sBAAsB,EACtB,4BAA4B,GAC7B,MAAM,OAAO,CAAC;AACf,OAAO,EACL,KAAK,kBAAkB,EACvB,KAAK,uBAAuB,EAC5B,KAAK,2BAA2B,EAChC,KAAK,iBAAiB,EACtB,KAAK,mBAAmB,EACxB,KAAK,gBAAgB,EACrB,KAAK,iBAAiB,EACtB,mBAAmB,EACnB,0BAA0B,EAC1B,uBAAuB,EACvB,0BAA0B,EAC1B,kBAAkB,GACnB,MAAM,cAAc,CAAC;AACtB,OAAO,EACL,kBAAkB,EAClB,gBAAgB,EAChB,iBAAiB,EACjB,qBAAqB,GACtB,MAAM,iBAAiB,CAAC"}

package/dist/validate/index.js

@@ -0,0 +1,15 @@
+/*
+ * Copyright Elasticsearch B.V. and/or licensed to Elasticsearch B.V. under one
+ * or more contributor license agreements. Licensed under the Elastic License
+ * 2.0; you may not use this file except in compliance with the Elastic License
+ * 2.0.
+ */
+export { authoringSchemaSubset, buildAuthoringJsonSchema, } from './authoring_schema.js';
+export { buildBodyNodeSchemaFromDefinitions, buildCompositionSchema, buildCompositionSchemaFromDefinitions, getCompositionSchemaForDefinitions, metaSchema, } from './composition_schema.js';
+export { MAX_INPUT_CHARACTERS, MAX_INPUT_DEPTH, MAX_INPUT_VALUES, checkInputBudget, isInputRefusal, } from './input_budget.js';
+export { buildCompositionJsonSchema, } from './json_schema.js';
+export { createNodeIssueFormatter } from './node_issues.js';
+export { ASSET_URL_MESSAGE, ASSET_URL_RULE, BLOCKED_HREF, NAVIGATION_HREF_MESSAGE, NAVIGATION_HREF_RULE, assetUrl, navigationHref, sanitizeAssetUrl, sanitizeNavigationHref, sanitizeParsedAssetUrl, sanitizeParsedNavigationHref, } from './url.js';
+export { compositionToRender, CompositionValidationError, createCompositionParser, createCompositionValidator, warningsForSurface, } from './validation.js';
+export { displayValueSchema, namedColorSchema, renderThemeSchema, structuredValueSchema, } from './value_schemas.js';
+//# sourceMappingURL=index.js.map

package/dist/validate/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/validate/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAEL,qBAAqB,EACrB,wBAAwB,GACzB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAEL,kCAAkC,EAClC,sBAAsB,EACtB,qCAAqC,EACrC,kCAAkC,EAClC,UAAU,GACX,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EAGL,oBAAoB,EACpB,eAAe,EACf,gBAAgB,EAChB,gBAAgB,EAChB,cAAc,GACf,MAAM,gBAAgB,CAAC;AACxB,OAAO,EAEL,0BAA0B,GAC3B,MAAM,eAAe,CAAC;AACvB,OAAO,EAAkB,wBAAwB,EAAE,MAAM,eAAe,CAAC;AACzE,OAAO,EAEL,iBAAiB,EACjB,cAAc,EACd,YAAY,EACZ,uBAAuB,EACvB,oBAAoB,EACpB,QAAQ,EACR,cAAc,EACd,gBAAgB,EAChB,sBAAsB,EACtB,sBAAsB,EACtB,4BAA4B,GAC7B,MAAM,OAAO,CAAC;AACf,OAAO,EAQL,mBAAmB,EACnB,0BAA0B,EAC1B,uBAAuB,EACvB,0BAA0B,EAC1B,kBAAkB,GACnB,MAAM,cAAc,CAAC;AACtB,OAAO,EACL,kBAAkB,EAClB,gBAAgB,EAChB,iBAAiB,EACjB,qBAAqB,GACtB,MAAM,iBAAiB,CAAC","sourcesContent":["/*\n * Copyright Elasticsearch B.V. and/or licensed to Elasticsearch B.V. under one\n * or more contributor license agreements. Licensed under the Elastic License\n * 2.0; you may not use this file except in compliance with the Elastic License\n * 2.0.\n */\n\nexport {\n  type AuthoringJsonSchemaOptions,\n  authoringSchemaSubset,\n  buildAuthoringJsonSchema,\n} from './authoring_schema';\nexport {\n  type CompositionSchemaOptions,\n  buildBodyNodeSchemaFromDefinitions,\n  buildCompositionSchema,\n  buildCompositionSchemaFromDefinitions,\n  getCompositionSchemaForDefinitions,\n  metaSchema,\n} from './composition_schema';\nexport {\n  type InputBudget,\n  type InputBudgetCheck,\n  MAX_INPUT_CHARACTERS,\n  MAX_INPUT_DEPTH,\n  MAX_INPUT_VALUES,\n  checkInputBudget,\n  isInputRefusal,\n} from './input_budget';\nexport {\n  type CompositionJsonSchemaOptions,\n  buildCompositionJsonSchema,\n} from './json_schema';\nexport { type IssueRoot, createNodeIssueFormatter } from './node_issues';\nexport {\n  type UrlSchemaOptions,\n  ASSET_URL_MESSAGE,\n  ASSET_URL_RULE,\n  BLOCKED_HREF,\n  NAVIGATION_HREF_MESSAGE,\n  NAVIGATION_HREF_RULE,\n  assetUrl,\n  navigationHref,\n  sanitizeAssetUrl,\n  sanitizeNavigationHref,\n  sanitizeParsedAssetUrl,\n  sanitizeParsedNavigationHref,\n} from './url';\nexport {\n  type CheckedComposition,\n  type CheckedValidationResult,\n  type CompositionValidatorOptions,\n  type ParsedComposition,\n  type ValidationErrorMode,\n  type ValidationResult,\n  type ValidationWarning,\n  compositionToRender,\n  CompositionValidationError,\n  createCompositionParser,\n  createCompositionValidator,\n  warningsForSurface,\n} from './validation';\nexport {\n  displayValueSchema,\n  namedColorSchema,\n  renderThemeSchema,\n  structuredValueSchema,\n} from './value_schemas';\n"]}

package/dist/validate/input_budget.d.ts

@@ -0,0 +1,35 @@
+import type { ValidationError } from '../composition/validation_error.js';
+/** Objects and arrays nested in one another, the input itself included. */
+export declare const MAX_INPUT_DEPTH = 64;
+/** Every object, array, and leaf counts once. */
+export declare const MAX_INPUT_VALUES = 20000;
+/** Every object key and string, and each other leaf as `String` prints it. */
+export declare const MAX_INPUT_CHARACTERS = 1000000;
+/** Overrides for the limits {@link checkInputBudget} enforces; an omitted one keeps its default. */
+export interface InputBudget {
+    /** Defaults to {@link MAX_INPUT_DEPTH}. Zod parses what passes recursively, so a few hundred nested containers can exhaust the call stack. */
+    depth?: number;
+    /** Defaults to {@link MAX_INPUT_VALUES}. */
+    values?: number;
+    /** Defaults to {@link MAX_INPUT_CHARACTERS}. */
+    characters?: number;
+}
+/** Whether `error` is a refusal before parsing, which no validation mode collects. */
+export declare const isInputRefusal: ({ code, }: Pick<ValidationError, "code">) => boolean;
+/** A plain copy of the input to parse in its place, or why there is none. */
+export type InputBudgetCheck = {
+    valid: true;
+    value: unknown;
+} | {
+    valid: false;
+    error: ValidationError;
+};
+/**
+ * A plain copy of `value` within `budget`, or why there is none: it is over `budget` or is not plain data.
+ *
+ * Plain data is arrays without holes, objects whose prototype is `Object.prototype` or `null`, enumerable own data properties with string keys, and primitives other than functions.
+ * Each property is read once, so a caller that parses the copy parses exactly what was checked; an array's other own properties are left out.
+ * Iterative and cycle-safe. Its cost is linear in the input's size: it lists a container's own keys, then refuses past the value limit before reading any of them.
+ */
+export declare const checkInputBudget: (value: unknown, budget?: InputBudget) => InputBudgetCheck;
+//# sourceMappingURL=input_budget.d.ts.map

package/dist/validate/input_budget.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"input_budget.d.ts","sourceRoot":"","sources":["../../src/validate/input_budget.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,iCAAiC,CAAC;AAEvE,2EAA2E;AAC3E,eAAO,MAAM,eAAe,KAAK,CAAC;AAElC,iDAAiD;AACjD,eAAO,MAAM,gBAAgB,QAAS,CAAC;AAEvC,8EAA8E;AAC9E,eAAO,MAAM,oBAAoB,UAAY,CAAC;AAE9C,oGAAoG;AACpG,MAAM,WAAW,WAAW;IAC1B,8IAA8I;IAC9I,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,4CAA4C;IAC5C,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,gDAAgD;IAChD,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAQD,sFAAsF;AACtF,eAAO,MAAM,cAAc,GAAI,WAE5B,IAAI,CAAC,eAAe,EAAE,MAAM,CAAC,KAAG,OAAwC,CAAC;AAE5E,6EAA6E;AAC7E,MAAM,MAAM,gBAAgB,GAC1B;IAAE,KAAK,EAAE,IAAI,CAAC;IAAC,KAAK,EAAE,OAAO,CAAA;CAAE,GAAG;IAAE,KAAK,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,eAAe,CAAA;CAAE,CAAC;AAiD7E;;;;;;GAMG;AACH,eAAO,MAAM,gBAAgB,GAC3B,OAAO,OAAO,EACd,SAAQ,WAAgB,KACvB,gBA6FF,CAAC"}

package/dist/validate/input_budget.js

@@ -0,0 +1,151 @@
+/*
+ * Copyright Elasticsearch B.V. and/or licensed to Elasticsearch B.V. under one
+ * or more contributor license agreements. Licensed under the Elastic License
+ * 2.0; you may not use this file except in compliance with the Elastic License
+ * 2.0.
+ */
+import { ISOMER_ERROR_CODES } from '../composition/error.js';
+/** Objects and arrays nested in one another, the input itself included. */
+export const MAX_INPUT_DEPTH = 64;
+/** Every object, array, and leaf counts once. */
+export const MAX_INPUT_VALUES = 20_000;
+/** Every object key and string, and each other leaf as `String` prints it. */
+export const MAX_INPUT_CHARACTERS = 1_000_000;
+/** The codes {@link checkInputBudget} refuses with. */
+const INPUT_REFUSAL_CODES = new Set([
+    ISOMER_ERROR_CODES.INPUT_NOT_PLAIN_DATA,
+    ISOMER_ERROR_CODES.INPUT_OVER_BUDGET,
+]);
+/** Whether `error` is a refusal before parsing, which no validation mode collects. */
+export const isInputRefusal = ({ code, }) => INPUT_REFUSAL_CODES.has(code);
+class Refusal extends Error {
+    error;
+    constructor(error) {
+        super(error.message);
+        this.error = error;
+    }
+}
+const overBudget = (message) => new Refusal({
+    path: '',
+    message,
+    code: ISOMER_ERROR_CODES.INPUT_OVER_BUDGET,
+});
+const notPlainData = (what) => new Refusal({
+    path: '',
+    message: `input holds ${what}, which is not plain data`,
+    code: ISOMER_ERROR_CODES.INPUT_NOT_PLAIN_DATA,
+});
+const leafLength = (value) => typeof value === 'string' ? value.length : String(value).length;
+/** Reads `key` once, through its descriptor. */
+const plainProperty = (source, key) => {
+    const descriptor = Reflect.getOwnPropertyDescriptor(source, key);
+    if (descriptor === undefined) {
+        throw notPlainData('an array hole');
+    }
+    if (!('value' in descriptor)) {
+        throw notPlainData('an accessor property');
+    }
+    if (!descriptor.enumerable) {
+        throw notPlainData('a non-enumerable property');
+    }
+    return descriptor.value;
+};
+/**
+ * A plain copy of `value` within `budget`, or why there is none: it is over `budget` or is not plain data.
+ *
+ * Plain data is arrays without holes, objects whose prototype is `Object.prototype` or `null`, enumerable own data properties with string keys, and primitives other than functions.
+ * Each property is read once, so a caller that parses the copy parses exactly what was checked; an array's other own properties are left out.
+ * Iterative and cycle-safe. Its cost is linear in the input's size: it lists a container's own keys, then refuses past the value limit before reading any of them.
+ */
+export const checkInputBudget = (value, budget = {}) => {
+    const { depth: maxDepth = MAX_INPUT_DEPTH, values: maxValues = MAX_INPUT_VALUES, characters: maxCharacters = MAX_INPUT_CHARACTERS, } = budget;
+    const tooManyValues = `input holds more than ${maxValues} values`;
+    const ancestors = new Set();
+    const stack = [];
+    let values = 0;
+    let characters = 0;
+    const countCharacters = (count) => {
+        characters += count;
+        if (characters > maxCharacters) {
+            throw overBudget(`input holds more than ${maxCharacters} characters`);
+        }
+    };
+    const enqueue = (child, depth, keyLength) => {
+        values += 1;
+        if (values > maxValues) {
+            throw overBudget(tooManyValues);
+        }
+        if (typeof child === 'function') {
+            throw notPlainData('a function');
+        }
+        if (typeof child !== 'object' || child === null) {
+            countCharacters(keyLength + leafLength(child));
+            return child;
+        }
+        let copy = [];
+        if (!Array.isArray(child)) {
+            const prototype = Reflect.getPrototypeOf(child);
+            if (prototype !== Object.prototype && prototype !== null) {
+                throw notPlainData('an object that is not a plain object or array');
+            }
+            copy = Object.create(prototype);
+        }
+        countCharacters(keyLength);
+        stack.push({ source: child, copy, depth });
+        return copy;
+    };
+    const copyChildren = ({ source, copy, depth }) => {
+        const keys = Array.isArray(copy) ? undefined : Reflect.ownKeys(source);
+        const count = keys?.length ?? source.length;
+        if (values + count > maxValues) {
+            throw overBudget(tooManyValues);
+        }
+        for (let index = 0; index < count; index += 1) {
+            const key = keys === undefined ? index : keys[index];
+            if (typeof key === 'symbol') {
+                throw notPlainData('a symbol key');
+            }
+            const child = plainProperty(source, key);
+            if (Array.isArray(copy)) {
+                copy.push(enqueue(child, depth, 0));
+            }
+            else {
+                Object.defineProperty(copy, key, {
+                    value: enqueue(child, depth, String(key).length),
+                    writable: true,
+                    enumerable: true,
+                    configurable: true,
+                });
+            }
+        }
+    };
+    try {
+        const root = enqueue(value, 1, 0);
+        while (stack.length > 0) {
+            const entry = stack.pop();
+            const { source, depth, leave } = entry;
+            if (leave) {
+                ancestors.delete(source);
+            }
+            else if (ancestors.has(source)) {
+                throw overBudget('input contains itself');
+            }
+            else if (depth > maxDepth) {
+                throw overBudget(`input nests deeper than ${maxDepth} levels`);
+            }
+            else {
+                ancestors.add(source);
+                stack.push({ ...entry, leave: true });
+                copyChildren({ ...entry, depth: depth + 1 });
+            }
+        }
+        return { valid: true, value: root };
+    }
+    catch (error) {
+        if (error instanceof Refusal) {
+            return { valid: false, error: error.error };
+        }
+        throw error;
+    }
+};
+//# sourceMappingURL=input_budget.js.map

package/dist/validate/input_budget.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"input_budget.js","sourceRoot":"","sources":["../../src/validate/input_budget.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAG1D,2EAA2E;AAC3E,MAAM,CAAC,MAAM,eAAe,GAAG,EAAE,CAAC;AAElC,iDAAiD;AACjD,MAAM,CAAC,MAAM,gBAAgB,GAAG,MAAM,CAAC;AAEvC,8EAA8E;AAC9E,MAAM,CAAC,MAAM,oBAAoB,GAAG,SAAS,CAAC;AAY9C,uDAAuD;AACvD,MAAM,mBAAmB,GAAoC,IAAI,GAAG,CAAC;IACnE,kBAAkB,CAAC,oBAAoB;IACvC,kBAAkB,CAAC,iBAAiB;CACrC,CAAC,CAAC;AAEH,sFAAsF;AACtF,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,EAC7B,IAAI,GAC0B,EAAW,EAAE,CAAC,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AAe5E,MAAM,OAAQ,SAAQ,KAAK;IACJ;IAArB,YAAqB,KAAsB;QACzC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QADF,UAAK,GAAL,KAAK,CAAiB;IAE3C,CAAC;CACF;AAED,MAAM,UAAU,GAAG,CAAC,OAAe,EAAW,EAAE,CAC9C,IAAI,OAAO,CAAC;IACV,IAAI,EAAE,EAAE;IACR,OAAO;IACP,IAAI,EAAE,kBAAkB,CAAC,iBAAiB;CAC3C,CAAC,CAAC;AAEL,MAAM,YAAY,GAAG,CAAC,IAAY,EAAW,EAAE,CAC7C,IAAI,OAAO,CAAC;IACV,IAAI,EAAE,EAAE;IACR,OAAO,EAAE,eAAe,IAAI,2BAA2B;IACvD,IAAI,EAAE,kBAAkB,CAAC,oBAAoB;CAC9C,CAAC,CAAC;AAEL,MAAM,UAAU,GAAG,CAAC,KAAc,EAAU,EAAE,CAC5C,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;AAElE,gDAAgD;AAChD,MAAM,aAAa,GAAG,CAAC,MAAc,EAAE,GAAoB,EAAW,EAAE;IACtE,MAAM,UAAU,GAAG,OAAO,CAAC,wBAAwB,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IACjE,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC7B,MAAM,YAAY,CAAC,eAAe,CAAC,CAAC;IACtC,CAAC;IACD,IAAI,CAAC,CAAC,OAAO,IAAI,UAAU,CAAC,EAAE,CAAC;QAC7B,MAAM,YAAY,CAAC,sBAAsB,CAAC,CAAC;IAC7C,CAAC;IACD,IAAI,CAAC,UAAU,CAAC,UAAU,EAAE,CAAC;QAC3B,MAAM,YAAY,CAAC,2BAA2B,CAAC,CAAC;IAClD,CAAC;IACD,OAAO,UAAU,CAAC,KAAK,CAAC;AAC1B,CAAC,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAC9B,KAAc,EACd,SAAsB,EAAE,EACN,EAAE;IACpB,MAAM,EACJ,KAAK,EAAE,QAAQ,GAAG,eAAe,EACjC,MAAM,EAAE,SAAS,GAAG,gBAAgB,EACpC,UAAU,EAAE,aAAa,GAAG,oBAAoB,GACjD,GAAG,MAAM,CAAC;IACX,MAAM,aAAa,GAAG,yBAAyB,SAAS,SAAS,CAAC;IAClE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,MAAM,KAAK,GAAY,EAAE,CAAC;IAC1B,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,MAAM,eAAe,GAAG,CAAC,KAAa,EAAQ,EAAE;QAC9C,UAAU,IAAI,KAAK,CAAC;QACpB,IAAI,UAAU,GAAG,aAAa,EAAE,CAAC;YAC/B,MAAM,UAAU,CAAC,yBAAyB,aAAa,aAAa,CAAC,CAAC;QACxE,CAAC;IACH,CAAC,CAAC;IACF,MAAM,OAAO,GAAG,CACd,KAAc,EACd,KAAa,EACb,SAAiB,EACR,EAAE;QACX,MAAM,IAAI,CAAC,CAAC;QACZ,IAAI,MAAM,GAAG,SAAS,EAAE,CAAC;YACvB,MAAM,UAAU,CAAC,aAAa,CAAC,CAAC;QAClC,CAAC;QACD,IAAI,OAAO,KAAK,KAAK,UAAU,EAAE,CAAC;YAChC,MAAM,YAAY,CAAC,YAAY,CAAC,CAAC;QACnC,CAAC;QACD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;YAChD,eAAe,CAAC,SAAS,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC;YAC/C,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,IAAI,GAAmB,EAAE,CAAC;QAC9B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YAC1B,MAAM,SAAS,GAAG,OAAO,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;YAChD,IAAI,SAAS,KAAK,MAAM,CAAC,SAAS,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;gBACzD,MAAM,YAAY,CAAC,+CAA+C,CAAC,CAAC;YACtE,CAAC;YACD,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,SAAS,CAA4B,CAAC;QAC7D,CAAC;QACD,eAAe,CAAC,SAAS,CAAC,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;QAC3C,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IACF,MAAM,YAAY,GAAG,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAS,EAAQ,EAAE;QAC5D,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACvE,MAAM,KAAK,GAAG,IAAI,EAAE,MAAM,IAAK,MAAoB,CAAC,MAAM,CAAC;QAC3D,IAAI,MAAM,GAAG,KAAK,GAAG,SAAS,EAAE,CAAC;YAC/B,MAAM,UAAU,CAAC,aAAa,CAAC,CAAC;QAClC,CAAC;QACD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;YAC9C,MAAM,GAAG,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAE,CAAC;YACtD,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;gBAC5B,MAAM,YAAY,CAAC,cAAc,CAAC,CAAC;YACrC,CAAC;YACD,MAAM,KAAK,GAAG,aAAa,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;YACzC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxB,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,EAAE;oBAC/B,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;oBAChD,QAAQ,EAAE,IAAI;oBACd,UAAU,EAAE,IAAI;oBAChB,YAAY,EAAE,IAAI;iBACnB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IACF,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAClC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YAC3B,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC;YACvC,IAAI,KAAK,EAAE,CAAC;gBACV,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC3B,CAAC;iBAAM,IAAI,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACjC,MAAM,UAAU,CAAC,uBAAuB,CAAC,CAAC;YAC5C,CAAC;iBAAM,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;gBAC5B,MAAM,UAAU,CAAC,2BAA2B,QAAQ,SAAS,CAAC,CAAC;YACjE,CAAC;iBAAM,CAAC;gBACN,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACtB,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;gBACtC,YAAY,CAAC,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;IACtC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,KAAK,YAAY,OAAO,EAAE,CAAC;YAC7B,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC;QAC9C,CAAC;QACD,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC,CAAC","sourcesContent":["/*\n * Copyright Elasticsearch B.V. and/or licensed to Elasticsearch B.V. under one\n * or more contributor license agreements. Licensed under the Elastic License\n * 2.0; you may not use this file except in compliance with the Elastic License\n * 2.0.\n */\n\nimport { ISOMER_ERROR_CODES } from '../composition/error';\nimport type { ValidationError } from '../composition/validation_error';\n\n/** Objects and arrays nested in one another, the input itself included. */\nexport const MAX_INPUT_DEPTH = 64;\n\n/** Every object, array, and leaf counts once. */\nexport const MAX_INPUT_VALUES = 20_000;\n\n/** Every object key and string, and each other leaf as `String` prints it. */\nexport const MAX_INPUT_CHARACTERS = 1_000_000;\n\n/** Overrides for the limits {@link checkInputBudget} enforces; an omitted one keeps its default. */\nexport interface InputBudget {\n  /** Defaults to {@link MAX_INPUT_DEPTH}. Zod parses what passes recursively, so a few hundred nested containers can exhaust the call stack. */\n  depth?: number;\n  /** Defaults to {@link MAX_INPUT_VALUES}. */\n  values?: number;\n  /** Defaults to {@link MAX_INPUT_CHARACTERS}. */\n  characters?: number;\n}\n\n/** The codes {@link checkInputBudget} refuses with. */\nconst INPUT_REFUSAL_CODES: ReadonlySet<string | undefined> = new Set([\n  ISOMER_ERROR_CODES.INPUT_NOT_PLAIN_DATA,\n  ISOMER_ERROR_CODES.INPUT_OVER_BUDGET,\n]);\n\n/** Whether `error` is a refusal before parsing, which no validation mode collects. */\nexport const isInputRefusal = ({\n  code,\n}: Pick<ValidationError, 'code'>): boolean => INPUT_REFUSAL_CODES.has(code);\n\n/** A plain copy of the input to parse in its place, or why there is none. */\nexport type InputBudgetCheck =\n  { valid: true; value: unknown } | { valid: false; error: ValidationError };\n\ntype PlainContainer = unknown[] | Record<string, unknown>;\n\ninterface Entry {\n  source: object;\n  copy: PlainContainer;\n  depth: number;\n  leave?: true;\n}\n\nclass Refusal extends Error {\n  constructor(readonly error: ValidationError) {\n    super(error.message);\n  }\n}\n\nconst overBudget = (message: string): Refusal =>\n  new Refusal({\n    path: '',\n    message,\n    code: ISOMER_ERROR_CODES.INPUT_OVER_BUDGET,\n  });\n\nconst notPlainData = (what: string): Refusal =>\n  new Refusal({\n    path: '',\n    message: `input holds ${what}, which is not plain data`,\n    code: ISOMER_ERROR_CODES.INPUT_NOT_PLAIN_DATA,\n  });\n\nconst leafLength = (value: unknown): number =>\n  typeof value === 'string' ? value.length : String(value).length;\n\n/** Reads `key` once, through its descriptor. */\nconst plainProperty = (source: object, key: string | number): unknown => {\n  const descriptor = Reflect.getOwnPropertyDescriptor(source, key);\n  if (descriptor === undefined) {\n    throw notPlainData('an array hole');\n  }\n  if (!('value' in descriptor)) {\n    throw notPlainData('an accessor property');\n  }\n  if (!descriptor.enumerable) {\n    throw notPlainData('a non-enumerable property');\n  }\n  return descriptor.value;\n};\n\n/**\n * A plain copy of `value` within `budget`, or why there is none: it is over `budget` or is not plain data.\n *\n * Plain data is arrays without holes, objects whose prototype is `Object.prototype` or `null`, enumerable own data properties with string keys, and primitives other than functions.\n * Each property is read once, so a caller that parses the copy parses exactly what was checked; an array's other own properties are left out.\n * Iterative and cycle-safe. Its cost is linear in the input's size: it lists a container's own keys, then refuses past the value limit before reading any of them.\n */\nexport const checkInputBudget = (\n  value: unknown,\n  budget: InputBudget = {}\n): InputBudgetCheck => {\n  const {\n    depth: maxDepth = MAX_INPUT_DEPTH,\n    values: maxValues = MAX_INPUT_VALUES,\n    characters: maxCharacters = MAX_INPUT_CHARACTERS,\n  } = budget;\n  const tooManyValues = `input holds more than ${maxValues} values`;\n  const ancestors = new Set<object>();\n  const stack: Entry[] = [];\n  let values = 0;\n  let characters = 0;\n  const countCharacters = (count: number): void => {\n    characters += count;\n    if (characters > maxCharacters) {\n      throw overBudget(`input holds more than ${maxCharacters} characters`);\n    }\n  };\n  const enqueue = (\n    child: unknown,\n    depth: number,\n    keyLength: number\n  ): unknown => {\n    values += 1;\n    if (values > maxValues) {\n      throw overBudget(tooManyValues);\n    }\n    if (typeof child === 'function') {\n      throw notPlainData('a function');\n    }\n    if (typeof child !== 'object' || child === null) {\n      countCharacters(keyLength + leafLength(child));\n      return child;\n    }\n    let copy: PlainContainer = [];\n    if (!Array.isArray(child)) {\n      const prototype = Reflect.getPrototypeOf(child);\n      if (prototype !== Object.prototype && prototype !== null) {\n        throw notPlainData('an object that is not a plain object or array');\n      }\n      copy = Object.create(prototype) as Record<string, unknown>;\n    }\n    countCharacters(keyLength);\n    stack.push({ source: child, copy, depth });\n    return copy;\n  };\n  const copyChildren = ({ source, copy, depth }: Entry): void => {\n    const keys = Array.isArray(copy) ? undefined : Reflect.ownKeys(source);\n    const count = keys?.length ?? (source as unknown[]).length;\n    if (values + count > maxValues) {\n      throw overBudget(tooManyValues);\n    }\n    for (let index = 0; index < count; index += 1) {\n      const key = keys === undefined ? index : keys[index]!;\n      if (typeof key === 'symbol') {\n        throw notPlainData('a symbol key');\n      }\n      const child = plainProperty(source, key);\n      if (Array.isArray(copy)) {\n        copy.push(enqueue(child, depth, 0));\n      } else {\n        Object.defineProperty(copy, key, {\n          value: enqueue(child, depth, String(key).length),\n          writable: true,\n          enumerable: true,\n          configurable: true,\n        });\n      }\n    }\n  };\n  try {\n    const root = enqueue(value, 1, 0);\n    while (stack.length > 0) {\n      const entry = stack.pop()!;\n      const { source, depth, leave } = entry;\n      if (leave) {\n        ancestors.delete(source);\n      } else if (ancestors.has(source)) {\n        throw overBudget('input contains itself');\n      } else if (depth > maxDepth) {\n        throw overBudget(`input nests deeper than ${maxDepth} levels`);\n      } else {\n        ancestors.add(source);\n        stack.push({ ...entry, leave: true });\n        copyChildren({ ...entry, depth: depth + 1 });\n      }\n    }\n    return { valid: true, value: root };\n  } catch (error) {\n    if (error instanceof Refusal) {\n      return { valid: false, error: error.error };\n    }\n    throw error;\n  }\n};\n"]}

package/dist/validate/json_schema.d.ts

@@ -0,0 +1,32 @@
+import { type ZodType } from 'zod';
+import type { AnyPrimitiveDefinition } from '../define/primitive_module.js';
+type JsonSchema = Record<string, unknown>;
+/** Options for {@link buildCompositionJsonSchema}. */
+export interface CompositionJsonSchemaOptions {
+    /** Base URI for the emitted schema, which `$ref`s resolve against. */
+    $id?: string;
+    /** Reaches the model, so it keeps the word "view". Defaults to `'View'`. */
+    title?: string;
+    /** Reaches the model too, so write it as guidance rather than as a type note. */
+    description?: string;
+    /**
+     * Extra schemas to name in `$defs`, for types a pack references by `$ref`.
+     * Each `id` becomes the `$defs` key, so it must be unique.
+     */
+    extraDefs?: readonly {
+        schema: ZodType;
+        id: string;
+    }[];
+    /** `ref` gives a repeated schema its own `$def`; `inline` repeats it. Defaults to `ref`. */
+    reused?: 'ref' | 'inline';
+}
+/**
+ * Projects the composition schema to JSON Schema draft 2020-12, for hosts
+ * that validate outside TypeScript.
+ *
+ * `$defs` are named per primitive type, plus `bodyNode` for the union.
+ * Agent-facing prompt text uses `buildAuthoringJsonSchema` instead.
+ */
+export declare const buildCompositionJsonSchema: (definitions: readonly AnyPrimitiveDefinition[], options?: CompositionJsonSchemaOptions) => JsonSchema;
+export {};
+//# sourceMappingURL=json_schema.d.ts.map

package/dist/validate/json_schema.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"json_schema.d.ts","sourceRoot":"","sources":["../../src/validate/json_schema.ts"],"names":[],"mappings":"AAOA,OAAO,EAAK,KAAK,OAAO,EAAE,MAAM,KAAK,CAAC;AAEtC,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,4BAA4B,CAAC;AAOzE,KAAK,UAAU,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AAE1C,sDAAsD;AACtD,MAAM,WAAW,4BAA4B;IAC3C,sEAAsE;IACtE,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,4EAA4E;IAC5E,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,iFAAiF;IACjF,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;;;OAGG;IACH,SAAS,CAAC,EAAE,SAAS;QAAE,MAAM,EAAE,OAAO,CAAC;QAAC,EAAE,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IACvD,4FAA4F;IAC5F,MAAM,CAAC,EAAE,KAAK,GAAG,QAAQ,CAAC;CAC3B;AAED;;;;;;GAMG;AACH,eAAO,MAAM,0BAA0B,GACrC,aAAa,SAAS,sBAAsB,EAAE,EAC9C,UAAS,4BAAiC,KACzC,UAmDF,CAAC"}

package/dist/validate/json_schema.js

@@ -0,0 +1,68 @@
+/*
+ * Copyright Elasticsearch B.V. and/or licensed to Elasticsearch B.V. under one
+ * or more contributor license agreements. Licensed under the Elastic License
+ * 2.0; you may not use this file except in compliance with the Elastic License
+ * 2.0.
+ */
+import { z } from 'zod';
+import { buildCompositionSchema, resolveVocabulary, } from './composition_schema.js';
+/**
+ * Projects the composition schema to JSON Schema draft 2020-12, for hosts
+ * that validate outside TypeScript.
+ *
+ * `$defs` are named per primitive type, plus `bodyNode` for the union.
+ * Agent-facing prompt text uses `buildAuthoringJsonSchema` instead.
+ */
+export const buildCompositionJsonSchema = (definitions, options = {}) => {
+    // Members, not `definition.schema`: a container's member is built by
+    // `schemaFor`, and the registry is keyed on identity.
+    const composed = resolveVocabulary(definitions);
+    const { bodyNodeSchema, members } = composed;
+    const compositionSchema = buildCompositionSchema({ bodyNodeSchema });
+    // `metadata` replaces `z.toJSONSchema`'s default registry rather than
+    // extending it, and `z.globalRegistry` is where every `.describe()` lives,
+    // so ids are added to the global registry for the duration of this call
+    // and the prior entries restored in `finally`. Only a schema's first
+    // registration is recorded: a schema named twice (an `extraDefs` entry that
+    // is also a member) must restore its original entry, not the first id.
+    const previous = new Map();
+    const registerId = (schema, id) => {
+        if (!previous.has(schema)) {
+            previous.set(schema, z.globalRegistry.get(schema));
+        }
+        z.globalRegistry.add(schema, { ...z.globalRegistry.get(schema), id });
+    };
+    registerId(bodyNodeSchema, 'bodyNode');
+    for (const extra of options.extraDefs ?? []) {
+        registerId(extra.schema, extra.id);
+    }
+    for (const [type, schema] of members) {
+        registerId(schema, type);
+    }
+    try {
+        return {
+            ...z.toJSONSchema(compositionSchema, {
+                target: 'draft-2020-12',
+                metadata: z.globalRegistry,
+                reused: options.reused ?? 'ref',
+                cycles: 'ref',
+                unrepresentable: 'any',
+            }),
+            ...(options.$id ? { $id: options.$id } : {}),
+            title: options.title ?? 'View',
+            description: options.description ??
+                'A compact view that may include registered primitives.',
+        };
+    }
+    finally {
+        for (const [schema, entry] of previous) {
+            if (entry === undefined) {
+                z.globalRegistry.remove(schema);
+            }
+            else {
+                z.globalRegistry.add(schema, entry);
+            }
+        }
+    }
+};
+//# sourceMappingURL=json_schema.js.map

package/dist/validate/json_schema.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"json_schema.js","sourceRoot":"","sources":["../../src/validate/json_schema.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,CAAC,EAAgB,MAAM,KAAK,CAAC;AAItC,OAAO,EACL,sBAAsB,EACtB,iBAAiB,GAClB,MAAM,sBAAsB,CAAC;AAqB9B;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,0BAA0B,GAAG,CACxC,WAA8C,EAC9C,UAAwC,EAAE,EAC9B,EAAE;IACd,qEAAqE;IACrE,sDAAsD;IACtD,MAAM,QAAQ,GAAG,iBAAiB,CAAC,WAAW,CAAC,CAAC;IAChD,MAAM,EAAE,cAAc,EAAE,OAAO,EAAE,GAAG,QAAQ,CAAC;IAC7C,MAAM,iBAAiB,GAAG,sBAAsB,CAAC,EAAE,cAAc,EAAE,CAAC,CAAC;IAErE,sEAAsE;IACtE,2EAA2E;IAC3E,wEAAwE;IACxE,qEAAqE;IACrE,4EAA4E;IAC5E,uEAAuE;IACvE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,MAAM,UAAU,GAAG,CAAC,MAAe,EAAE,EAAU,EAAQ,EAAE;QACvD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC1B,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;QACrD,CAAC;QACD,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,GAAG,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACxE,CAAC,CAAC;IACF,UAAU,CAAC,cAAc,EAAE,UAAU,CAAC,CAAC;IACvC,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,SAAS,IAAI,EAAE,EAAE,CAAC;QAC5C,UAAU,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;IACrC,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACrC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAC3B,CAAC;IACD,IAAI,CAAC;QACH,OAAO;YACL,GAAG,CAAC,CAAC,YAAY,CAAC,iBAAiB,EAAE;gBACnC,MAAM,EAAE,eAAe;gBACvB,QAAQ,EAAE,CAAC,CAAC,cAAc;gBAC1B,MAAM,EAAE,OAAO,CAAC,MAAM,IAAI,KAAK;gBAC/B,MAAM,EAAE,KAAK;gBACb,eAAe,EAAE,KAAK;aACvB,CAAC;YACF,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5C,KAAK,EAAE,OAAO,CAAC,KAAK,IAAI,MAAM;YAC9B,WAAW,EACT,OAAO,CAAC,WAAW;gBACnB,wDAAwD;SAC3D,CAAC;IACJ,CAAC;YAAS,CAAC;QACT,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,QAAQ,EAAE,CAAC;YACvC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,CAAC,CAAC,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAClC,CAAC;iBAAM,CAAC;gBACN,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,EAAE,KAAc,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC,CAAC","sourcesContent":["/*\n * Copyright Elasticsearch B.V. and/or licensed to Elasticsearch B.V. under one\n * or more contributor license agreements. Licensed under the Elastic License\n * 2.0; you may not use this file except in compliance with the Elastic License\n * 2.0.\n */\n\nimport { z, type ZodType } from 'zod';\n\nimport type { AnyPrimitiveDefinition } from '../define/primitive_module';\n\nimport {\n  buildCompositionSchema,\n  resolveVocabulary,\n} from './composition_schema';\n\ntype JsonSchema = Record<string, unknown>;\n\n/** Options for {@link buildCompositionJsonSchema}. */\nexport interface CompositionJsonSchemaOptions {\n  /** Base URI for the emitted schema, which `$ref`s resolve against. */\n  $id?: string;\n  /** Reaches the model, so it keeps the word \"view\". Defaults to `'View'`. */\n  title?: string;\n  /** Reaches the model too, so write it as guidance rather than as a type note. */\n  description?: string;\n  /**\n   * Extra schemas to name in `$defs`, for types a pack references by `$ref`.\n   * Each `id` becomes the `$defs` key, so it must be unique.\n   */\n  extraDefs?: readonly { schema: ZodType; id: string }[];\n  /** `ref` gives a repeated schema its own `$def`; `inline` repeats it. Defaults to `ref`. */\n  reused?: 'ref' | 'inline';\n}\n\n/**\n * Projects the composition schema to JSON Schema draft 2020-12, for hosts\n * that validate outside TypeScript.\n *\n * `$defs` are named per primitive type, plus `bodyNode` for the union.\n * Agent-facing prompt text uses `buildAuthoringJsonSchema` instead.\n */\nexport const buildCompositionJsonSchema = (\n  definitions: readonly AnyPrimitiveDefinition[],\n  options: CompositionJsonSchemaOptions = {}\n): JsonSchema => {\n  // Members, not `definition.schema`: a container's member is built by\n  // `schemaFor`, and the registry is keyed on identity.\n  const composed = resolveVocabulary(definitions);\n  const { bodyNodeSchema, members } = composed;\n  const compositionSchema = buildCompositionSchema({ bodyNodeSchema });\n\n  // `metadata` replaces `z.toJSONSchema`'s default registry rather than\n  // extending it, and `z.globalRegistry` is where every `.describe()` lives,\n  // so ids are added to the global registry for the duration of this call\n  // and the prior entries restored in `finally`. Only a schema's first\n  // registration is recorded: a schema named twice (an `extraDefs` entry that\n  // is also a member) must restore its original entry, not the first id.\n  const previous = new Map<ZodType, unknown>();\n  const registerId = (schema: ZodType, id: string): void => {\n    if (!previous.has(schema)) {\n      previous.set(schema, z.globalRegistry.get(schema));\n    }\n    z.globalRegistry.add(schema, { ...z.globalRegistry.get(schema), id });\n  };\n  registerId(bodyNodeSchema, 'bodyNode');\n  for (const extra of options.extraDefs ?? []) {\n    registerId(extra.schema, extra.id);\n  }\n  for (const [type, schema] of members) {\n    registerId(schema, type);\n  }\n  try {\n    return {\n      ...z.toJSONSchema(compositionSchema, {\n        target: 'draft-2020-12',\n        metadata: z.globalRegistry,\n        reused: options.reused ?? 'ref',\n        cycles: 'ref',\n        unrepresentable: 'any',\n      }),\n      ...(options.$id ? { $id: options.$id } : {}),\n      title: options.title ?? 'View',\n      description:\n        options.description ??\n        'A compact view that may include registered primitives.',\n    };\n  } finally {\n    for (const [schema, entry] of previous) {\n      if (entry === undefined) {\n        z.globalRegistry.remove(schema);\n      } else {\n        z.globalRegistry.add(schema, entry as never);\n      }\n    }\n  }\n};\n"]}

package/dist/validate/node_issues.d.ts

@@ -0,0 +1,12 @@
+import type { core } from 'zod';
+import type { ValidationError } from '../composition/validation_error.js';
+import type { AnyPrimitiveDefinition } from '../define/primitive_module.js';
+/** A node an issue path can start from, and its path. */
+export type IssueRoot = readonly [node: unknown, path: string];
+/**
+ * Builds the formatter that converts Zod issues with {@link formatZodIssue},
+ * each error naming the innermost node its path lands in when that node's type
+ * is known, and an unknown key on a node appending {@link declaredFieldsNote}.
+ */
+export declare const createNodeIssueFormatter: (definitions: readonly AnyPrimitiveDefinition[]) => ((roots: readonly IssueRoot[], issues: ReadonlyArray<core.$ZodIssue>, basePath?: string) => ValidationError[]);
+//# sourceMappingURL=node_issues.d.ts.map

package/dist/validate/node_issues.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"node_issues.d.ts","sourceRoot":"","sources":["../../src/validate/node_issues.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,KAAK,CAAC;AAOhC,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,iCAAiC,CAAC;AACvE,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,4BAA4B,CAAC;AAOzE,yDAAyD;AACzD,MAAM,MAAM,SAAS,GAAG,SAAS,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;AA8B/D;;;;GAIG;AACH,eAAO,MAAM,wBAAwB,GACnC,aAAa,SAAS,sBAAsB,EAAE,KAC7C,CAAC,CACF,KAAK,EAAE,SAAS,SAAS,EAAE,EAC3B,MAAM,EAAE,aAAa,CAAC,IAAI,CAAC,SAAS,CAAC,EACrC,QAAQ,CAAC,EAAE,MAAM,KACd,eAAe,EAAE,CAiCrB,CAAC"}

package/dist/validate/node_issues.js

@@ -0,0 +1,61 @@
+/*
+ * Copyright Elasticsearch B.V. and/or licensed to Elasticsearch B.V. under one
+ * or more contributor license agreements. Licensed under the Elastic License
+ * 2.0; you may not use this file except in compliance with the Elastic License
+ * 2.0.
+ */
+import { childNodePath, createChildNodeWalker, } from '../composition/body_node_base.js';
+import { declaredFieldsNote, formatPath, formatZodIssue, } from '../define/zod_format.js';
+/**
+ * The raw `type` of each node `walk` reaches from `roots`, keyed by its path.
+ * The input has failed a schema, so a node whose children cannot be walked adds none.
+ */
+const nodeTypesByPath = (roots, walk) => {
+    const types = new Map();
+    const visit = (node, path) => {
+        if (typeof node !== 'object' || node === null) {
+            return;
+        }
+        types.set(path, node.type);
+        let children;
+        try {
+            children = walk(node);
+        }
+        catch {
+            return;
+        }
+        children.forEach(({ node: child, path: field }) => {
+            visit(child, childNodePath(path, field));
+        });
+    };
+    roots.forEach(([node, path]) => visit(node, path));
+    return types;
+};
+/**
+ * Builds the formatter that converts Zod issues with {@link formatZodIssue},
+ * each error naming the innermost node its path lands in when that node's type
+ * is known, and an unknown key on a node appending {@link declaredFieldsNote}.
+ */
+export const createNodeIssueFormatter = (definitions) => {
+    const walk = createChildNodeWalker(definitions);
+    const fieldNotes = new Map(definitions.map(({ type, schema }) => [type, declaredFieldsNote(schema)]));
+    const knownType = (type) => typeof type === 'string' && fieldNotes.has(type) ? type : undefined;
+    return (roots, issues, basePath = '') => {
+        const nodes = nodeTypesByPath(roots, walk);
+        const nodeTypeAt = (segments) => segments
+            .reduce((paths, segment) => [...paths, formatPath([segment], paths.at(-1))], [basePath])
+            .reduce((found, path) => nodes.has(path) ? knownType(nodes.get(path)) : found, undefined);
+        return issues.map((issue) => {
+            const error = formatZodIssue(issue, basePath);
+            const nodeType = nodeTypeAt(issue.path);
+            if (nodeType === undefined) {
+                return error;
+            }
+            const message = issue.code === 'unrecognized_keys' && nodes.get(error.path) === nodeType
+                ? `${error.message}; ${fieldNotes.get(nodeType)}`
+                : error.message;
+            return { ...error, message, nodeType };
+        });
+    };
+};
+//# sourceMappingURL=node_issues.js.map

package/dist/validate/node_issues.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"node_issues.js","sourceRoot":"","sources":["../../src/validate/node_issues.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,OAAO,EACL,aAAa,EAEb,qBAAqB,GACtB,MAAM,+BAA+B,CAAC;AAGvC,OAAO,EACL,kBAAkB,EAClB,UAAU,EACV,cAAc,GACf,MAAM,sBAAsB,CAAC;AAK9B;;;GAGG;AACH,MAAM,eAAe,GAAG,CACtB,KAA2B,EAC3B,IAAqB,EACC,EAAE;IACxB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAmB,CAAC;IACzC,MAAM,KAAK,GAAG,CAAC,IAAa,EAAE,IAAY,EAAQ,EAAE;QAClD,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAC9C,OAAO;QACT,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,IAAI,EAAG,IAA2B,CAAC,IAAI,CAAC,CAAC;QACnD,IAAI,QAAqC,CAAC;QAC1C,IAAI,CAAC;YACH,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;QAAC,MAAM,CAAC;YACP,OAAO;QACT,CAAC;QACD,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE;YAChD,KAAK,CAAC,KAAK,EAAE,aAAa,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;QAC3C,CAAC,CAAC,CAAC;IACL,CAAC,CAAC;IACF,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;IACnD,OAAO,KAAK,CAAC;AACf,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAG,CACtC,WAA8C,EAKxB,EAAE;IACxB,MAAM,IAAI,GAAG,qBAAqB,CAAC,WAAW,CAAC,CAAC;IAChD,MAAM,UAAU,GAAG,IAAI,GAAG,CACxB,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAAC,CAC1E,CAAC;IACF,MAAM,SAAS,GAAG,CAAC,IAAa,EAAsB,EAAE,CACtD,OAAO,IAAI,KAAK,QAAQ,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;IACtE,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,GAAG,EAAE,EAAE,EAAE;QACtC,MAAM,KAAK,GAAG,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC3C,MAAM,UAAU,GAAG,CAAC,QAAgC,EAAE,EAAE,CACtD,QAAQ;aACL,MAAM,CACL,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,CAAC,CAAC,GAAG,KAAK,EAAE,UAAU,CAAC,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EACnE,CAAC,QAAQ,CAAC,CACX;aACA,MAAM,CACL,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,CACd,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EACtD,SAAS,CACV,CAAC;QACN,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;YAC1B,MAAM,KAAK,GAAG,cAAc,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;YAC9C,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACxC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,OAAO,KAAK,CAAC;YACf,CAAC;YACD,MAAM,OAAO,GACX,KAAK,CAAC,IAAI,KAAK,mBAAmB,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,QAAQ;gBACtE,CAAC,CAAC,GAAG,KAAK,CAAC,OAAO,KAAK,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;gBACjD,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC;YACpB,OAAO,EAAE,GAAG,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC;QACzC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC;AACJ,CAAC,CAAC","sourcesContent":["/*\n * Copyright Elasticsearch B.V. and/or licensed to Elasticsearch B.V. under one\n * or more contributor license agreements. Licensed under the Elastic License\n * 2.0; you may not use this file except in compliance with the Elastic License\n * 2.0.\n */\n\nimport type { core } from 'zod';\n\nimport {\n  childNodePath,\n  type ChildNodeWalker,\n  createChildNodeWalker,\n} from '../composition/body_node_base';\nimport type { ValidationError } from '../composition/validation_error';\nimport type { AnyPrimitiveDefinition } from '../define/primitive_module';\nimport {\n  declaredFieldsNote,\n  formatPath,\n  formatZodIssue,\n} from '../define/zod_format';\n\n/** A node an issue path can start from, and its path. */\nexport type IssueRoot = readonly [node: unknown, path: string];\n\n/**\n * The raw `type` of each node `walk` reaches from `roots`, keyed by its path.\n * The input has failed a schema, so a node whose children cannot be walked adds none.\n */\nconst nodeTypesByPath = (\n  roots: readonly IssueRoot[],\n  walk: ChildNodeWalker\n): Map<string, unknown> => {\n  const types = new Map<string, unknown>();\n  const visit = (node: unknown, path: string): void => {\n    if (typeof node !== 'object' || node === null) {\n      return;\n    }\n    types.set(path, (node as { type?: unknown }).type);\n    let children: ReturnType<ChildNodeWalker>;\n    try {\n      children = walk(node);\n    } catch {\n      return;\n    }\n    children.forEach(({ node: child, path: field }) => {\n      visit(child, childNodePath(path, field));\n    });\n  };\n  roots.forEach(([node, path]) => visit(node, path));\n  return types;\n};\n\n/**\n * Builds the formatter that converts Zod issues with {@link formatZodIssue},\n * each error naming the innermost node its path lands in when that node's type\n * is known, and an unknown key on a node appending {@link declaredFieldsNote}.\n */\nexport const createNodeIssueFormatter = (\n  definitions: readonly AnyPrimitiveDefinition[]\n): ((\n  roots: readonly IssueRoot[],\n  issues: ReadonlyArray<core.$ZodIssue>,\n  basePath?: string\n) => ValidationError[]) => {\n  const walk = createChildNodeWalker(definitions);\n  const fieldNotes = new Map(\n    definitions.map(({ type, schema }) => [type, declaredFieldsNote(schema)])\n  );\n  const knownType = (type: unknown): string | undefined =>\n    typeof type === 'string' && fieldNotes.has(type) ? type : undefined;\n  return (roots, issues, basePath = '') => {\n    const nodes = nodeTypesByPath(roots, walk);\n    const nodeTypeAt = (segments: readonly PropertyKey[]) =>\n      segments\n        .reduce(\n          (paths, segment) => [...paths, formatPath([segment], paths.at(-1))],\n          [basePath]\n        )\n        .reduce<string | undefined>(\n          (found, path) =>\n            nodes.has(path) ? knownType(nodes.get(path)) : found,\n          undefined\n        );\n    return issues.map((issue) => {\n      const error = formatZodIssue(issue, basePath);\n      const nodeType = nodeTypeAt(issue.path);\n      if (nodeType === undefined) {\n        return error;\n      }\n      const message =\n        issue.code === 'unrecognized_keys' && nodes.get(error.path) === nodeType\n          ? `${error.message}; ${fieldNotes.get(nodeType)}`\n          : error.message;\n      return { ...error, message, nodeType };\n    });\n  };\n};\n"]}