@kubb/ast 5.0.0-beta.36 → 5.0.0-beta.37

package/dist/index.cjs

@@ -555,7 +555,7 @@ function isNode(value) {
 /**
 * Returns the immediate traversable children of `node` based on {@link VISITOR_KEYS}.
 *
-* `Schema` children are only included when `recurse` is `true`; shallow mode skips them.
+* `Schema` children are only included when `recurse` is `true`. Shallow mode skips them.
 *
 * @example
 * ```ts
@@ -577,7 +577,7 @@ function* getChildren(node, recurse) {
 }
 /**
 * Maps a node `kind` to the matching visitor callback name. Only the seven
-* traversable node kinds have an entry; every other kind resolves to
+* traversable node kinds have an entry. Every other kind resolves to
 * `undefined` and is skipped.
 */
 const VISITOR_KEY_BY_KIND = {
@@ -610,7 +610,7 @@ function applyVisitor(node, visitor, parent) {
 *
 * Sibling nodes at each depth run concurrently up to `options.concurrency`
 * (defaults to `WALK_CONCURRENCY`). Higher values overlap I/O-bound visitor
-* work; lower values reduce memory pressure.
+* work. Lower values reduce memory pressure.
 *
 * @example Log every operation
 * ```ts
@@ -1047,7 +1047,7 @@ function importKey(path, name, isTypeOnly) {
 }
 /**
 * Computes a multi-level sort key for exports and imports:
-* non-array names first (wildcards/namespace aliases); type-only before value; alphabetical path; unnamed before named.
+* non-array names first (wildcards/namespace aliases). Type-only before value. Alphabetical path. Unnamed before named.
 */
 function sortKey(node) {
 	const isArray = Array.isArray(node.name) ? "1" : "0";
@@ -1222,7 +1222,7 @@ function resolveRefName(node) {
 /**
 * Collects every named schema referenced (transitively) from a node via ref edges.
 *
-* Refs are followed by name only — the resolved `node.schema` is not traversed inline.
+* Refs are followed by name only, the resolved `node.schema` is not traversed inline.
 * Use this to determine schema dependencies, build reference graphs, or detect what schemas need to be emitted.
 *
 * @example Collect refs from a single schema
@@ -1258,7 +1258,7 @@ function collectReferencedSchemaNames(node, out = /* @__PURE__ */ new Set()) {
 * Collects the names of all top-level schemas transitively used by a set of operations.
 *
 * An operation uses a schema when any of its parameters, request body content, or responses
-* reference it — directly or indirectly through other named schemas.
+* reference it, directly or indirectly through other named schemas.
 * The walk is iterative and safe against reference cycles.
 *
 * Use this together with `include` filters to determine which schemas from `components/schemas`
@@ -1348,7 +1348,7 @@ function findCircularSchemas(schemas) {
 * Use `excludeName` to ignore refs to specific schemas (useful when self-references are handled separately).
 * Commonly used with `findCircularSchemas()` to detect where lazy wrappers are needed in code generation.
 *
-* @note Returns `true` for the first matching circular ref found; use for fast dependency checks.
+* @note Returns `true` for the first matching circular ref found. Use for fast dependency checks.
 */
 function containsCircularRef(node, { circularSchemas, excludeName }) {
 	if (!node || circularSchemas.size === 0) return false;
@@ -1383,7 +1383,7 @@ function syncOptionality(schema, required) {
 * `changes` already equals (by reference) the current value, otherwise a new node
 * with the changes applied.
 *
-* Mirrors the TypeScript compiler's `factory.updateX` contract — pair it with the
+* Mirrors the TypeScript compiler's `factory.updateX` contract, pair it with the
 * structural sharing in {@link transform} so a no-op rewrite doesn't allocate and
 * downstream passes can detect "nothing changed" by identity. Comparison is
 * shallow: a structurally-equal but newly-allocated array/object counts as a change.
@@ -1499,7 +1499,7 @@ function createOperation(props) {
 }
 /**
 * Maps schema `type` to its underlying `primitive`.
-* Primitive types map to themselves; special string formats map to `'string'`.
+* Primitive types map to themselves. Special string formats map to `'string'`.
 * Complex types (`ref`, `enum`, `union`, `intersection`, `tuple`, `blob`) are left unset.
 */
 const TYPE_TO_PRIMITIVE = {
@@ -1650,7 +1650,7 @@ function createResponse(props) {
 * // → params?: QueryParams
 * ```
 *
-* @example Param with default (implicitly optional; cannot combine with `optional: true`)
+* @example Param with default (implicitly optional. Cannot combine with `optional: true`)
 * ```ts
 * createFunctionParameter({ name: 'config', type: createParamsType({ variant: 'reference', name: 'RequestConfig' }), default: '{}' })
 * // → config: RequestConfig = {}
@@ -1707,7 +1707,7 @@ function createParamsType(props) {
 * // call        → { id, name }
 * ```
 *
-* @example Inline (spread) — children emitted as individual top-level parameters
+* @example Inline (spread), children emitted as individual top-level parameters
 * ```ts
 * createParameterGroup({
 *   properties: [createFunctionParameter({ name: 'petId', type: createParamsType({ variant: 'reference', name: 'string' }), optional: false })],
@@ -1809,9 +1809,9 @@ function createSource(props) {
 * Creates a fully resolved `FileNode` from a file input descriptor.
 *
 * Computes:
-* - `id` — SHA256 hash of the file path
-* - `name` — `baseName` without extension
-* - `extname` — extension extracted from `baseName`
+* - `id` SHA256 hash of the file path
+* - `name` `baseName` without extension
+* - `extname` extension extracted from `baseName`
 *
 * Deduplicates:
 * - `sources` via `combineSources`
@@ -2043,7 +2043,7 @@ function createJsx(value) {
 /**
 * The shape-affecting flags shared by every node kind: base primitive, format, and `nullable`.
 * Documentation and usage-slot flags (`optional`/`nullish`/`readOnly`/`writeOnly`) are
-* intentionally excluded — they describe the property slot, not the type.
+* intentionally excluded, they describe the property slot, not the type.
 */
 function flagsDescriptor(node) {
 	return `${node.primitive ?? ""};${node.format ?? ""};${node.nullable ? 1 : 0}`;
@@ -2256,7 +2256,7 @@ function serializeShapeField(field, node, record) {
 }
 /**
 * Builds the local, shape-only descriptor for a node: its kind, flags, constraints, and its
-* children's signatures. {@link signatureOf} hashes this string; children contribute their
+* children's signatures. {@link signatureOf} hashes this string. Children contribute their
 * fixed-length signature rather than their own full descriptor, which keeps the result bounded.
 */
 function describeShape(node) {
@@ -2275,14 +2275,14 @@ function describeShape(node) {
 * during dedupe planning is not re-hashed when the same tree is rewritten during streaming
 * (where `schemaSignature` and `applyDedupe` would otherwise each walk it from scratch). Reuse
 * across calls is sound because a signature depends only on a node's content, and schema nodes
-* are immutable once created — transforms allocate new objects rather than mutating in place.
+* are immutable once created, transforms allocate new objects rather than mutating in place.
 */
 const signatureCache = /* @__PURE__ */ new WeakMap();
 /**
 * Hash-consing: each node's signature is a fixed-length digest of its local shape plus its
 * children's digests (a Merkle hash). Children contribute their 64-char hash instead of their
 * full nested descriptor, so a signature stays bounded regardless of subtree depth, and the
-* digest is identical across calls because it depends only on content — never on traversal
+* digest is identical across calls because it depends only on content, never on traversal
 * order. This keeps the keys built during planning consistent with the ones recomputed later
 * during streaming. {@link signatureCache} memoizes node → digest across every computation.
 */
@@ -2360,7 +2360,7 @@ function cleanDefinition(node, name) {
 *
 * A shape that occurs at least `minOccurrences` times is deduplicated: if any occurrence
 * is a named top-level schema, that name becomes the canonical (so other top-level duplicates
-* and inline copies turn into references to it); otherwise a new definition is hoisted using
+* and inline copies turn into references to it). Otherwise a new definition is hoisted using
 * `nameFor`. The plan is then applied per node with {@link applyDedupe}.
 *
 * @example
@@ -2425,7 +2425,7 @@ function buildDedupePlan(roots, options) {
 //#region src/dialect.ts
 /**
 * Identity helper that types a {@link SchemaDialect} for an adapter. Like
-* `defineParser`, it adds no runtime behavior — it pins the dialect's type for
+* `defineParser`, it adds no runtime behavior, it pins the dialect's type for
 * inference and gives adapter authors a discoverable anchor.
 *
 * @example
@@ -2455,7 +2455,7 @@ function defineSchemaDialect(dialect) {
 *
 * An adapter derives a context from a source spec node, then declares an ordered table of
 * rules mapping spec shapes onto Kubb AST nodes. To add support for a new spec, write a new
-* context type and a new rules table — the traversal here is reused unchanged.
+* context type and a new rules table, the traversal here is reused unchanged.
 *
 * Order is significant: earlier rules win, so list higher-precedence or more specific shapes
 * first (e.g. composition keywords before plain `type`). A rule whose `match` returns `true`
@@ -2485,11 +2485,11 @@ function dispatch(rules, context) {
 *
 * The builder receives resolved options and returns:
 *
-* - `name` — unique identifier for the printer.
-* - `options` — stored on the returned printer instance.
-* - `nodes` — map of `SchemaType` → handler. Handlers return the rendered
+* - `name` unique identifier for the printer.
+* - `options` stored on the returned printer instance.
+* - `nodes` map of `SchemaType` → handler. Handlers return the rendered
 *   output (a string, a TypeScript AST node, ...) for that schema type.
-* - `print` (optional) — top-level override exposed as `printer.print`.
+* - `print` (optional), top-level override exposed as `printer.print`.
 *   Use `this.transform(node)` inside it to dispatch to `nodes` recursively.
 *
 * Without a `print` override, `printer.print` falls back to `printer.transform`