@vibesdotdev/mcp 0.0.0-stage → 1.0.0-rc.0

package/dist/adapters/zod-mcp.js

@@ -0,0 +1,617 @@
+import { toJsonSchemaCompat } from '@modelcontextprotocol/sdk/server/zod-json-schema-compat.js';
+import { CapabilityError } from '@vibesdotdev/kernel';
+import * as z from 'zod/v4';
+// Single source of truth (ai-schemas literal, re-exported by tools). Never re-litigate the budget here.
+import { MCP_DESCRIPTION_LIMIT } from '@vibesdotdev/tools/schemas/schema';
+import { omitContextBoundInputs } from '@vibesdotdev/tools/agents/native-tool-definitions';
+// Wire DU flatten owned by tools — invoke gate + tools/list share one algorithm.
+import { flattenDiscriminatedUnionToObject as flattenDiscriminatedUnionToObjectFromTools, flattenRootUnion as flattenRootUnionFromTools, getDiscriminator as getDiscriminatorFromTools, getDiscriminatorOptions as getDiscriminatorOptionsFromTools, isDiscriminatedUnion as isDiscriminatedUnionFromTools, isPlainUnion as isPlainUnionFromTools } from '@vibesdotdev/tools/schemas/discriminated-union-wire';
+export const isPlainUnion = isPlainUnionFromTools;
+function isStringValue(value) {
+    return typeof value === 'string';
+}
+function inferWrapType(schema) {
+    const type = schema.type;
+    if (type === 'object')
+        return 'object';
+    if (type === 'array')
+        return 'array';
+    if (isStringValue(type))
+        return 'primitive';
+    return 'none';
+}
+/**
+ * JSON Schema string formats whose `pattern` is fully implied by `format`.
+ * Zod v4 emits both `format: "uuid"` AND a 96-char regex pattern for UUIDs,
+ * and a 600+ char regex for date-time. Stripping the pattern when format is
+ * one of these standard names keeps the schema valid (servers still validate
+ * via Zod) while shrinking the wire payload significantly.
+ */
+const PATTERN_REDUNDANT_FORMATS = new Set([
+    'uuid',
+    'date-time',
+    'date',
+    'time',
+    'duration',
+    'email',
+    'idn-email',
+    'uri',
+    'uri-reference',
+    'iri',
+    'iri-reference',
+    'hostname',
+    'idn-hostname',
+    'ipv4',
+    'ipv6',
+    'regex',
+    'json-pointer',
+    'relative-json-pointer'
+]);
+/**
+ * Serialize a JSON-schema node with recursively sorted keys so structural
+ * equality can be tested via string comparison regardless of key order.
+ */
+function canonicalJson(node) {
+    if (Array.isArray(node))
+        return `[${node.map((item) => canonicalJson(item)).join(',')}]`;
+    if (!isJsonObject(node))
+        return JSON.stringify(node) ?? 'null';
+    const body = Object.entries(node)
+        .sort(([left], [right]) => left < right ? -1 : left > right ? 1 : 0)
+        .map(([key, value]) => `${JSON.stringify(key)}:${canonicalJson(value)}`)
+        .join(',');
+    return `{${body}}`;
+}
+const DEDUPED_UNION_KEYS = ['anyOf', 'oneOf'];
+/**
+ * How many times a `$ref` into the same cyclic anchor may be expanded along one
+ * path before the advertisement terminates in the permissive-but-typed leaf.
+ */
+const RECURSIVE_REF_DEPTH_LIMIT = 3;
+/** Is `value` the object form of a schema node (not an array, null, or a scalar)? */
+function isJsonObject(node) {
+    return typeof node === 'object' && node !== null && !Array.isArray(node);
+}
+/**
+ * Is `value` a non-null object of either form — plain object or array? This is
+ * the document check every transform entry makes: the shapes a walker descends,
+ * a JSON pointer walks through, and a spread copies.
+ */
+function isJsonContainer(value) {
+    return typeof value === 'object' && value !== null;
+}
+/** A node whose `$ref` is a string — the only referencing form converters emit. */
+function isLocalRefNode(node) {
+    return typeof node.$ref === 'string';
+}
+/** Is `node` the string scalar form of a schema node? */
+function isStringNode(node) {
+    return typeof node === 'string';
+}
+/**
+ * The leaf that terminates a bounded recursion on the wire. The recursive
+ * original allows any JSON value at that position, so the leaf names exactly
+ * the six JSON types with unconstrained nesting — permissive, but typed.
+ */
+function recursionBoundLeaf() {
+    return {
+        anyOf: [
+            { type: 'string' },
+            { type: 'number' },
+            { type: 'boolean' },
+            { type: 'null' },
+            { type: 'array' },
+            { type: 'object' }
+        ],
+        description: 'Any JSON value (deeper recursion of the same shape is accepted; the wire schema is depth-bounded).'
+    };
+}
+/**
+ * `array[part]` for a node array without a record cast: canonical numeric
+ * strings read the element, `length` reads the length (a number node), every
+ * other key is absent.
+ */
+function readArrayMember(array, part) {
+    const index = Number(part);
+    if (Number.isInteger(index) && index >= 0 && `${index}` === part && index < array.length) {
+        return array[index];
+    }
+    if (part === 'length')
+        return array.length;
+    return undefined;
+}
+/**
+ * Read one JSON-pointer part from a container with `container[part]`
+ * semantics: objects read the named property, arrays read their members.
+ */
+function readPointerPart(container, part) {
+    if (isJsonObject(container))
+        return container[part];
+    return readArrayMember(container, part);
+}
+/** Resolve a local JSON pointer (`#/$defs/Foo`, `#/definitions/Foo`, `#`) inside `root`. */
+function resolveLocalRefPointer(root, ref) {
+    if (!ref.startsWith('#/'))
+        return undefined;
+    const parts = ref
+        .slice(2)
+        .split('/')
+        .map((part) => part.replace(/~1/g, '/').replace(/~0/g, '~'));
+    let node = root;
+    const walked = [];
+    for (const part of parts) {
+        const next = isJsonContainer(node)
+            ? readPointerPart(node, part)
+            : undefined;
+        if (next === undefined)
+            return undefined;
+        walked.push(part);
+        node = next;
+    }
+    return { path: '#/' + walked.join('/'), node };
+}
+/**
+ * Index every local `$ref` in the document. A cycle must traverse at least one
+ * `$ref` (plain object containment is a tree), so the ref graph between anchors
+ * fully describes recursion: graph edges from an anchor are the refs found
+ * anywhere in that anchor's literal subtree.
+ */
+function indexRefGraph(root) {
+    const anchors = new Map();
+    const sites = [];
+    const walk = (node, path) => {
+        if (Array.isArray(node)) {
+            node.forEach((item, i) => walk(item, `${path}/${i}`));
+            return;
+        }
+        if (!isJsonObject(node))
+            return;
+        if (isLocalRefNode(node)) {
+            const target = resolveLocalRefPointer(root, node.$ref);
+            if (target) {
+                sites.push({ at: path, target: target.path });
+                if (!anchors.has(target.path))
+                    anchors.set(target.path, target.node);
+            }
+        }
+        for (const [key, value] of Object.entries(node))
+            walk(value, `${path}/${key}`);
+    };
+    walk(root, '#');
+    const edges = new Map();
+    for (const anchor of anchors.keys()) {
+        const prefix = `${anchor}/`;
+        edges.set(anchor, sites
+            .filter((site) => site.at === anchor || site.at.startsWith(prefix))
+            .map((site) => site.target));
+    }
+    return { anchors, edges };
+}
+/** Anchor paths whose node can reach itself through `$ref` edges (self or mutual recursion). */
+function computeCyclicRefTargets(root) {
+    const { anchors, edges } = indexRefGraph(root);
+    const cyclic = new Set();
+    for (const anchor of anchors.keys()) {
+        // DFS over anchor edges: can `anchor` be reached again from itself?
+        const frontier = [...(edges.get(anchor) ?? [])];
+        const seen = new Set(frontier);
+        while (frontier.length > 0) {
+            const current = frontier.pop();
+            if (current === anchor) {
+                cyclic.add(anchor);
+                break;
+            }
+            for (const next of edges.get(current) ?? []) {
+                if (!seen.has(next)) {
+                    seen.add(next);
+                    frontier.push(next);
+                }
+            }
+        }
+    }
+    return cyclic;
+}
+/**
+ * Every cyclic anchor advertised by this schema, as `path -> …` descriptions.
+ * Empty for an acyclic schema. Shared by tests and `validateMcpSchema`.
+ */
+export function findJsonSchemaRefCycles(schema) {
+    if (!isJsonContainer(schema))
+        return [];
+    const cyclic = computeCyclicRefTargets(schema);
+    return [...cyclic].sort().map((path) => `${path} -> ${path}`);
+}
+/**
+ * Bound recursion in a JSON Schema document for advertisement.
+ *
+ * `$ref`s into cyclic anchors are expanded inline up to
+ * {@link RECURSIVE_REF_DEPTH_LIMIT} expansions per anchor per path, then
+ * terminate in the permissive-but-typed JSON leaf. Because NO reference to a
+ * cyclic anchor survives as a string, the output is acyclic for every
+ * recursion shape (self-referential and mutual). Non-recursive `$ref`s are
+ * left exactly as authored — nothing else is loosened.
+ */
+function boundNode(root, node, stack, cyclic) {
+    if (Array.isArray(node)) {
+        return node.map((item) => boundNode(root, item, stack, cyclic));
+    }
+    if (!isJsonObject(node))
+        return node;
+    if (isLocalRefNode(node)) {
+        const target = resolveLocalRefPointer(root, node.$ref);
+        if (target && cyclic.has(target.path)) {
+            // Siblings are the ref node's own keywords minus `$ref`, exactly as
+            // spread-then-delete produced them.
+            const siblings = {};
+            for (const [key, value] of Object.entries(node)) {
+                if (key !== '$ref')
+                    siblings[key] = value;
+            }
+            const depth = stack.filter((path) => path === target.path).length;
+            if (depth >= RECURSIVE_REF_DEPTH_LIMIT) {
+                return { ...recursionBoundLeaf(), ...siblings };
+            }
+            const expanded = boundNode(root, target.node, [...stack, target.path], cyclic);
+            if (isJsonObject(expanded))
+                return { ...expanded, ...siblings };
+            if (Array.isArray(expanded))
+                return { ...expanded, ...siblings };
+            return siblings;
+        }
+        return node;
+    }
+    const out = {};
+    for (const [key, value] of Object.entries(node)) {
+        out[key] = boundNode(root, value, stack, cyclic);
+    }
+    return out;
+}
+/**
+ * Bound recursive `$ref`s in a schema document. Fast path returns the input
+ * unchanged when the document has no cyclic anchors (the overwhelming case).
+ */
+function boundRecursiveRefs(schema) {
+    if (!isJsonContainer(schema))
+        return schema;
+    const cyclic = computeCyclicRefTargets(schema);
+    if (cyclic.size === 0)
+        return schema;
+    const bounded = boundNode(schema, schema, [], cyclic);
+    return pruneBoundedAnchorEntries(bounded, cyclic);
+}
+/** Container keys under which definition entries live. */
+const DEFINITION_CONTAINER_KEYS = new Set(['definitions', '$defs']);
+/**
+ * Drop definition entries that WERE cyclic anchors and are now unreferenced:
+ * bounding inlines every `$ref` to a cyclic anchor, so its definition entry is
+ * unreachable dead weight. Only entries inside `definitions`/`$defs` are
+ * eligible, and only when no remaining `$ref` points at them — a referenced
+ * entry, or one that was never cyclic, is left exactly as is.
+ */
+function pruneBoundedAnchorEntries(node, cyclic) {
+    const refs = new Set();
+    const collectRefs = (value) => {
+        if (Array.isArray(value)) {
+            value.forEach(collectRefs);
+            return;
+        }
+        if (!isJsonObject(value))
+            return;
+        if (isLocalRefNode(value))
+            refs.add(value.$ref);
+        for (const child of Object.values(value))
+            collectRefs(child);
+    };
+    collectRefs(node);
+    const prune = (value, path) => {
+        if (Array.isArray(value)) {
+            return value.map((item, i) => prune(item, `${path}/${i}`));
+        }
+        if (!isJsonObject(value))
+            return value;
+        const out = {};
+        for (const [key, child] of Object.entries(value)) {
+            const childPath = `${path}/${key}`;
+            if (DEFINITION_CONTAINER_KEYS.has(key) && isJsonObject(child)) {
+                const kept = {};
+                for (const [defKey, defValue] of Object.entries(child)) {
+                    const defPath = `${childPath}/${defKey}`;
+                    if (cyclic.has(defPath) && !refs.has(defPath))
+                        continue;
+                    kept[defKey] = defValue;
+                }
+                if (Object.keys(kept).length === 0)
+                    continue;
+                out[key] = prune(kept, childPath);
+                continue;
+            }
+            out[key] = prune(child, childPath);
+        }
+        return out;
+    };
+    return prune(node, '#');
+}
+/**
+ * Drop structurally identical branches from an anyOf/oneOf array, preserving
+ * first-seen order. Flattening a discriminated union into one object merges
+ * same-named fields from every action variant into a union
+ * (`mergeVariantFieldSchemas`), so a field declared identically across N
+ * variants used to ship N identical branches on the wire (e.g. ai-generate's
+ * `capabilities` ×6, knowledge's `knowledgeBaseId` ×11).
+ */
+function dedupeUnionBranches(out) {
+    for (const key of DEDUPED_UNION_KEYS) {
+        const branches = out[key];
+        if (!isNodeArray(branches) || branches.length < 2)
+            continue;
+        const seen = new Set();
+        const deduped = [];
+        for (const branch of branches) {
+            const canonical = canonicalJson(branch);
+            if (seen.has(canonical))
+                continue;
+            seen.add(canonical);
+            deduped.push(branch);
+        }
+        if (deduped.length === branches.length)
+            continue;
+        const survivor = deduped[0];
+        if (deduped.length === 1 && survivor !== undefined && isSchemaObject(survivor) && !isArrayValue(survivor)) {
+            // All branches were identical — inline the survivor into this node.
+            // Annotations already on the parent (description, default, …) win.
+            delete out[key];
+            for (const [k, v] of Object.entries(survivor)) {
+                if (!(k in out))
+                    out[k] = v;
+            }
+        }
+        else {
+            out[key] = deduped;
+        }
+    }
+}
+/**
+ * Walk a JSON Schema tree and (a) strip `pattern` where `format` carries the
+ * same information, (b) dedupe structurally identical anyOf/oneOf branches,
+ * collapsing all-identical unions into their single member, (c) bound
+ * recursive `$ref`s so the advertised schema is acyclic — model APIs reject
+ * recursive schemas wholesale (`400 Recursive JSON schemas are not currently
+ * supported`, observed on the `agent` tool's `JsonValueSchema` metadata), so one
+ * recursive field in one tool can take down every session that loads the
+ * catalog. Pure transformation; no Zod runtime dependency. Server-side input
+ * validation never uses this projection — it parses the registered Zod object.
+ */
+export function tightenJsonSchema(node) {
+    const bounded = boundRecursiveRefs(node);
+    // Non-container leaves (scalars, undefined) pass both stages through
+    // unchanged; only containers reach the recursive tightener.
+    return isJsonContainer(bounded) ? tightenJsonSchemaNode(bounded) : bounded;
+}
+function tightenJsonSchemaNode(node) {
+    if (Array.isArray(node)) {
+        return node.map((item) => tightenJsonSchemaNode(item));
+    }
+    if (!isJsonObject(node))
+        return node;
+    const out = {};
+    const dropPattern = node.type === 'string' &&
+        isStringNode(node.format) &&
+        PATTERN_REDUNDANT_FORMATS.has(node.format) &&
+        'pattern' in node;
+    for (const [k, v] of Object.entries(node)) {
+        if (dropPattern && k === 'pattern')
+            continue;
+        out[k] = tightenJsonSchemaNode(v);
+    }
+    const additionalProperties = out.additionalProperties;
+    if (isJsonObject(additionalProperties) && Object.keys(additionalProperties).length === 0) {
+        // Empty `additionalProperties: {}` is a Record bag. Hosts stringify nested
+        // values against it; `true` is the same JSON Schema meaning without the map trap.
+        out.additionalProperties = true;
+    }
+    dedupeUnionBranches(out);
+    return out;
+}
+function isSchemaObject(value) {
+    return typeof value === 'object' && value !== null;
+}
+function isArrayValue(value) {
+    return Array.isArray(value);
+}
+function isNodeArray(value) {
+    return Array.isArray(value);
+}
+function requireSchemaObject(value) {
+    if (!isSchemaObject(value) || isArrayValue(value))
+        throw new CapabilityError('MCP schema conversion must produce an object', 'INVALID_INPUT');
+    return value;
+}
+export function zodToMcpSchema(schema, options = {}) {
+    const builtIn = schema.toJSONSchema?.();
+    const produced = builtIn !== undefined && isSchemaObject(builtIn) && !isArrayValue(builtIn)
+        ? builtIn
+        : toJsonSchemaCompat(schema, { strictUnions: true, pipeStrategy: 'input' });
+    if (!isSchemaObject(produced) || isArrayValue(produced)) {
+        throw new CapabilityError('MCP schema conversion must produce an object', 'INVALID_INPUT');
+    }
+    const tightened = requireSchemaObject(tightenJsonSchema(produced));
+    const withTitle = options.name ? { ...tightened, title: options.name } : tightened;
+    const withoutSchemaField = { ...withTitle };
+    if (options.removeSchemaField)
+        delete withoutSchemaField.schema;
+    const projected = omitContextBoundInputs(withoutSchemaField);
+    return { schema: projected, wrapType: inferWrapType(projected) };
+}
+/**
+ * Wrap a transport's `send` so any outgoing tools/list response (or
+ * tools/listChanged update) has its tool schemas tightened before
+ * serialization. The MCP SDK does its own Zod→JSON Schema conversion
+ * inside its tools/list handler (via `toJsonSchemaCompat`), so the
+ * `tightenJsonSchema` step in `zodToMcpSchema` is bypassed for those
+ * responses. Wrapping the transport is the lowest-friction interception
+ * point that doesn't require monkey-patching the SDK's private state.
+ */
+export function wrapTransportWithSchemaTightening(transport, options) {
+    const original = transport.send.bind(transport);
+    transport.send = (...args) => {
+        const msg = args[0];
+        const result = isSchemaObject(msg) && !isArrayValue(msg) && isSchemaObject(msg.result) && !isArrayValue(msg.result) ? msg.result : undefined;
+        const tools = result?.tools;
+        if (Array.isArray(tools)) {
+            for (const tool of tools) {
+                if (!isSchemaObject(tool) || isArrayValue(tool))
+                    throw new CapabilityError('MCP tools/list entries must be objects', 'INVALID_INPUT');
+                if (isSchemaObject(tool.inputSchema) && !isArrayValue(tool.inputSchema)) {
+                    tool.inputSchema = requireSchemaObject(tightenJsonSchema(tool.inputSchema));
+                }
+                if (options?.omitOutputSchema) {
+                    delete tool.outputSchema;
+                }
+                else if (isSchemaObject(tool.outputSchema) && !isArrayValue(tool.outputSchema)) {
+                    tool.outputSchema = requireSchemaObject(tightenJsonSchema(tool.outputSchema));
+                }
+            }
+        }
+        return original(...args);
+    };
+}
+/**
+ * Keys that make a JSON Schema well-formed WITHOUT a sibling `type`. A root
+ * combinator or reference is a complete schema on its own (JSON Schema
+ * 2020-12 §10-11); requiring `type` beside one is simply wrong.
+ */
+const TYPELESS_SCHEMA_FORMS = ['oneOf', 'anyOf', 'allOf', '$ref', 'enum', 'const'];
+/**
+ * Structural sanity check for an outgoing MCP `inputSchema`.
+ *
+ * It USED to require `type` unconditionally, which is a false positive on every
+ * root-union tool we ship. Verified 2026-07-25: `awareness` — the heaviest tool on
+ * the wire — has a root `oneOf` and no `type`, so this reported
+ * "Schema missing 'type'" for a schema that is valid and serving correctly today.
+ * A validator that flags correct schemas is worse than none: the first person to
+ * wire it up would have chased a phantom.
+ *
+ * Nothing on the serve path calls this yet (it is public API from
+ * `@vibesdotdev/mcp`, its one home). Left exported and
+ * correct rather than deleted — constitution §NO DELETE WITHOUT CONSUMER PROOF, and
+ * a correct unused check can be wired later; an incorrect one cannot.
+ */
+export function validateMcpSchema(schema) {
+    const issues = [];
+    if (!isSchemaObject(schema) || isArrayValue(schema))
+        return ['Schema is not an object'];
+    const hasType = isStringValue(schema.type) || isArrayValue(schema.type);
+    const hasTypelessForm = TYPELESS_SCHEMA_FORMS.some((key) => key in schema);
+    if (!hasType && !hasTypelessForm) {
+        issues.push("Schema missing 'type' (string or string[]) and no oneOf/anyOf/allOf/$ref/enum/const");
+    }
+    if ('properties' in schema && schema.properties && !isSchemaObject(schema.properties)) {
+        issues.push("Schema has invalid 'properties' (must be object)");
+    }
+    const cycles = findJsonSchemaRefCycles(schema);
+    if (cycles.length > 0) {
+        issues.push(`Schema is recursive (${cycles.join('; ')}) — model APIs reject recursive schemas`);
+    }
+    return issues;
+}
+export function validateMcpDescription(description) {
+    const trimmed = description.trim();
+    if (trimmed.length === 0)
+        return ['Description is empty'];
+    if (/[\r\n]/.test(trimmed))
+        return ['Description must be single-line'];
+    if (trimmed.length > MCP_DESCRIPTION_LIMIT) {
+        return [`Description exceeds ${MCP_DESCRIPTION_LIMIT} chars (${trimmed.length})`];
+    }
+    return [];
+}
+function collapseWhitespace(description) {
+    return description.replace(/\s+/g, ' ').trim();
+}
+function trimAtWordBoundary(description, limit) {
+    if (description.length <= limit)
+        return description;
+    // Reserve 1 char for a trailing period when we need to append one.
+    const bodyLimit = Math.max(1, limit - 1);
+    const slice = description.slice(0, bodyLimit).trim();
+    const lastSpace = slice.lastIndexOf(' ');
+    const candidate = lastSpace > Math.floor(bodyLimit * 0.6) ? slice.slice(0, lastSpace) : slice;
+    const cleaned = candidate.replace(/[,:;/-]+$/g, '').trim();
+    const withPeriod = cleaned.endsWith('.') || cleaned.endsWith('!') || cleaned.endsWith('?')
+        ? cleaned
+        : `${cleaned}.`;
+    // Hard cap: never return more than `limit` (period append must not overflow).
+    return withPeriod.length <= limit ? withPeriod : withPeriod.slice(0, limit).trimEnd();
+}
+export function generateMcpDescription(description) {
+    const normalized = collapseWhitespace(description);
+    if (!normalized)
+        return '';
+    const candidates = [
+        normalized,
+        normalized.split(/\bActions?\s*:/i)[0]?.trim(),
+        normalized.split(/\bExamples?\s*:/i)[0]?.trim(),
+        normalized.split(/\bUse this\b/i)[0]?.trim(),
+        normalized.split(/\bThe query parameter\b/i)[0]?.trim(),
+        normalized.split(/\bincluding\b/i)[0]?.trim(),
+        normalized.replace(/\([^)]*\)/g, '').replace(/\s+/g, ' ').trim(),
+        normalized.split(/[;:]/)[0]?.trim(),
+        normalized.match(/^(.+?[.!?])(?:\s|$)/)?.[1]?.trim()
+    ].filter((candidate) => !!candidate);
+    for (const candidate of candidates) {
+        if (candidate.length <= MCP_DESCRIPTION_LIMIT)
+            return candidate;
+    }
+    return trimAtWordBoundary(normalized, MCP_DESCRIPTION_LIMIT);
+}
+export function resolveMcpDescription(source) {
+    // Author-provided mcpDescription is the contract surface: prefer it intact
+    // (whitespace-collapsed) when it fits the wire limit so Ex: examples are not
+    // discarded by generateMcpDescription's candidate-split heuristics.
+    if (source.mcpDescription !== undefined && source.mcpDescription.trim().length > 0) {
+        const normalized = collapseWhitespace(source.mcpDescription);
+        if (normalized.length > 0 && !/[\r\n]/.test(normalized)) {
+            if (normalized.length <= MCP_DESCRIPTION_LIMIT)
+                return normalized;
+            return generateMcpDescription(normalized);
+        }
+    }
+    const raw = source.description ?? source.name ?? source.id ?? '';
+    return generateMcpDescription(raw);
+}
+export const flattenRootUnion = flattenRootUnionFromTools;
+export const isDiscriminatedUnion = isDiscriminatedUnionFromTools;
+export const getDiscriminator = getDiscriminatorFromTools;
+export const getDiscriminatorOptions = getDiscriminatorOptionsFromTools;
+export function wrapDiscriminatedUnion(schema, defaultAction, toolId) {
+    if (!isDiscriminatedUnion(schema))
+        return schema;
+    const discriminator = getDiscriminator(schema);
+    const options = getDiscriminatorOptions(schema);
+    return z.preprocess((input) => {
+        if (!isSchemaObject(input) || isArrayValue(input))
+            return input;
+        if (!(discriminator in input)) {
+            if (defaultAction && options.includes(defaultAction)) {
+                return { [discriminator]: defaultAction, ...input };
+            }
+            throw new Error(`Missing required '${discriminator}' parameter for ${toolId}. ` +
+                `Available options: ${options.join(', ')}`);
+        }
+        return input;
+    }, schema);
+}
+/**
+ * Flatten a z.discriminatedUnion into a z.object that the MCP SDK can handle.
+ * Implementation lives in @vibesdotdev/tools (shared with invoke validation).
+ */
+export const flattenDiscriminatedUnionToObject = flattenDiscriminatedUnionToObjectFromTools;
+export function createMcpTool(config) {
+    const { schema } = zodToMcpSchema(config.schema, {
+        name: config.name,
+        removeSchemaField: true,
+        addAliasHints: true
+    });
+    return { name: config.name, description: config.description, inputSchema: schema };
+}
+//# sourceMappingURL=zod-mcp.js.map

package/dist/adapters/zod-mcp.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"zod-mcp.js","sourceRoot":"","sources":["../../src/adapters/zod-mcp.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,kBAAkB,EAAE,MAAM,4DAA4D,CAAC;AAChG,OAAO,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AACtD,OAAO,KAAK,CAAC,MAAM,QAAQ,CAAC;AAC5B,wGAAwG;AACxG,OAAO,EAAE,qBAAqB,EAAE,MAAM,mCAAmC,CAAC;AAC1E,OAAO,EAAE,sBAAsB,EAAE,MAAM,mDAAmD,CAAC;AAC3F,iFAAiF;AACjF,OAAO,EACN,iCAAiC,IAAI,0CAA0C,EAC/E,gBAAgB,IAAI,yBAAyB,EAC7C,gBAAgB,IAAI,yBAAyB,EAC7C,uBAAuB,IAAI,gCAAgC,EAC3D,oBAAoB,IAAI,6BAA6B,EACrD,YAAY,IAAI,qBAAqB,EACrC,MAAM,qDAAqD,CAAC;AAiD7D,MAAM,CAAC,MAAM,YAAY,GAAG,qBAAqB,CAAC;AAElD,SAAS,aAAa,CAAC,KAAiC;IACvD,OAAO,OAAO,KAAK,KAAK,QAAQ,CAAC;AAClC,CAAC;AAED,SAAS,aAAa,CAAC,MAAkB;IACxC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;IACzB,IAAI,IAAI,KAAK,QAAQ;QAAE,OAAO,QAAQ,CAAC;IACvC,IAAI,IAAI,KAAK,OAAO;QAAE,OAAO,OAAO,CAAC;IACrC,IAAI,aAAa,CAAC,IAAI,CAAC;QAAE,OAAO,WAAW,CAAC;IAC5C,OAAO,MAAM,CAAC;AACf,CAAC;AAED;;;;;;GAMG;AACH,MAAM,yBAAyB,GAAG,IAAI,GAAG,CAAC;IACzC,MAAM;IACN,WAAW;IACX,MAAM;IACN,MAAM;IACN,UAAU;IACV,OAAO;IACP,WAAW;IACX,KAAK;IACL,eAAe;IACf,KAAK;IACL,eAAe;IACf,UAAU;IACV,cAAc;IACd,MAAM;IACN,MAAM;IACN,OAAO;IACP,cAAc;IACd,uBAAuB;CACvB,CAAC,CAAC;AAEH;;;GAGG;AACH,SAAS,aAAa,CAAC,IAAoB;IAC1C,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;IACzF,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC;IAC/D,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC;SAC/B,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SACnE,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;SACvE,IAAI,CAAC,GAAG,CAAC,CAAC;IACZ,OAAO,IAAI,IAAI,GAAG,CAAC;AACpB,CAAC;AAED,MAAM,kBAAkB,GAAG,CAAC,OAAO,EAAE,OAAO,CAAU,CAAC;AAEvD;;;GAGG;AACH,MAAM,yBAAyB,GAAG,CAAC,CAAC;AA4BpC,qFAAqF;AACrF,SAAS,YAAY,CAAC,IAAoB;IACzC,OAAO,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;AAC1E,CAAC;AAED;;;;GAIG;AACH,SAAS,eAAe,CAAI,KAAQ;IACnC,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,CAAC;AACpD,CAAC;AAED,mFAAmF;AACnF,SAAS,cAAc,CAAC,IAAsB;IAC7C,OAAO,OAAO,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC;AACtC,CAAC;AAED,yDAAyD;AACzD,SAAS,YAAY,CAAC,IAAoB;IACzC,OAAO,OAAO,IAAI,KAAK,QAAQ,CAAC;AACjC,CAAC;AAED;;;;GAIG;AACH,SAAS,kBAAkB;IAC1B,OAAO;QACN,KAAK,EAAE;YACN,EAAE,IAAI,EAAE,QAAQ,EAAE;YAClB,EAAE,IAAI,EAAE,QAAQ,EAAE;YAClB,EAAE,IAAI,EAAE,SAAS,EAAE;YACnB,EAAE,IAAI,EAAE,MAAM,EAAE;YAChB,EAAE,IAAI,EAAE,OAAO,EAAE;YACjB,EAAE,IAAI,EAAE,QAAQ,EAAE;SAClB;QACD,WAAW,EACV,oGAAoG;KACrG,CAAC;AACH,CAAC;AAID;;;;GAIG;AACH,SAAS,eAAe,CACvB,KAAgC,EAChC,IAAY;IAEZ,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;IAC3B,IAAI,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,GAAG,KAAK,EAAE,KAAK,IAAI,IAAI,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAC1F,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC;IACrB,CAAC;IACD,IAAI,IAAI,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC,MAAM,CAAC;IAC3C,OAAO,SAAS,CAAC;AAClB,CAAC;AAED;;;GAGG;AACH,SAAS,eAAe,CACvB,SAA8B,EAC9B,IAAY;IAEZ,IAAI,YAAY,CAAC,SAAS,CAAC;QAAE,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC;IACpD,OAAO,eAAe,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;AACzC,CAAC;AAED,4FAA4F;AAC5F,SAAS,sBAAsB,CAAC,IAAyB,EAAE,GAAW;IACrE,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC;IAC5C,MAAM,KAAK,GAAG,GAAG;SACf,KAAK,CAAC,CAAC,CAAC;SACR,KAAK,CAAC,GAAG,CAAC;SACV,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;IAC9D,IAAI,IAAI,GAAmB,IAAI,CAAC;IAChC,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,MAAM,IAAI,GAA+B,eAAe,CAAC,IAAI,CAAC;YAC7D,CAAC,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC;YAC7B,CAAC,CAAC,SAAS,CAAC;QACb,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QACzC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClB,IAAI,GAAG,IAAI,CAAC;IACb,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC;AAChD,CAAC;AASD;;;;;GAKG;AACH,SAAS,aAAa,CAAC,IAAyB;IAC/C,MAAM,OAAO,GAAG,IAAI,GAAG,EAA0B,CAAC;IAClD,MAAM,KAAK,GAA0C,EAAE,CAAC;IACxD,MAAM,IAAI,GAAG,CAAC,IAAoB,EAAE,IAAY,EAAQ,EAAE;QACzD,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACzB,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;YACtD,OAAO;QACR,CAAC;QACD,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC;YAAE,OAAO;QAChC,IAAI,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1B,MAAM,MAAM,GAAG,sBAAsB,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YACvD,IAAI,MAAM,EAAE,CAAC;gBACZ,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;gBAC9C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC;oBAAE,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;YACtE,CAAC;QACF,CAAC;QACD,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC;YAAE,IAAI,CAAC,KAAK,EAAE,GAAG,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC;IAChF,CAAC,CAAC;IACF,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAEhB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC1C,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;QACrC,MAAM,MAAM,GAAG,GAAG,MAAM,GAAG,CAAC;QAC5B,KAAK,CAAC,GAAG,CACR,MAAM,EACN,KAAK;aACH,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,MAAM,IAAI,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;aAClE,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAC5B,CAAC;IACH,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;AAC3B,CAAC;AAED,gGAAgG;AAChG,SAAS,uBAAuB,CAAC,IAAyB;IACzD,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;IAC/C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;QACrC,oEAAoE;QACpE,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAChD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC/B,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,EAAG,CAAC;YAChC,IAAI,OAAO,KAAK,MAAM,EAAE,CAAC;gBACxB,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACnB,MAAM;YACP,CAAC;YACD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC7C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBACrB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBACf,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACrB,CAAC;YACF,CAAC;QACF,CAAC;IACF,CAAC;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,uBAAuB,CAAI,MAAS;IACnD,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC;QAAE,OAAO,EAAE,CAAC;IACxC,MAAM,MAAM,GAAG,uBAAuB,CAAC,MAAM,CAAC,CAAC;IAC/C,OAAO,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,IAAI,OAAO,IAAI,EAAE,CAAC,CAAC;AAC/D,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,SAAS,CACjB,IAAyB,EACzB,IAAoB,EACpB,KAAwB,EACxB,MAA2B;IAE3B,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QACzB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC;IACjE,CAAC;IACD,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACrC,IAAI,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1B,MAAM,MAAM,GAAG,sBAAsB,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QACvD,IAAI,MAAM,IAAI,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YACvC,oEAAoE;YACpE,oCAAoC;YACpC,MAAM,QAAQ,GAAqB,EAAE,CAAC;YACtC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;gBACjD,IAAI,GAAG,KAAK,MAAM;oBAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;YAC3C,CAAC;YACD,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;YAClE,IAAI,KAAK,IAAI,yBAAyB,EAAE,CAAC;gBACxC,OAAO,EAAE,GAAG,kBAAkB,EAAE,EAAE,GAAG,QAAQ,EAAE,CAAC;YACjD,CAAC;YACD,MAAM,QAAQ,GAAG,SAAS,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC,GAAG,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,CAAC;YAC/E,IAAI,YAAY,CAAC,QAAQ,CAAC;gBAAE,OAAO,EAAE,GAAG,QAAQ,EAAE,GAAG,QAAQ,EAAE,CAAC;YAChE,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC;gBAAE,OAAO,EAAE,GAAG,QAAQ,EAAE,GAAG,QAAQ,EAAE,CAAC;YACjE,OAAO,QAAQ,CAAC;QACjB,CAAC;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IACD,MAAM,GAAG,GAAqB,EAAE,CAAC;IACjC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QACjD,GAAG,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IAClD,CAAC;IACD,OAAO,GAAG,CAAC;AACZ,CAAC;AAED;;;GAGG;AACH,SAAS,kBAAkB,CAAI,MAAS;IACvC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC;QAAE,OAAO,MAAM,CAAC;IAC5C,MAAM,MAAM,GAAG,uBAAuB,CAAC,MAAM,CAAC,CAAC;IAC/C,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC;IACrC,MAAM,OAAO,GAAG,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC;IACtD,OAAO,yBAAyB,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;AACnD,CAAC;AAED,0DAA0D;AAC1D,MAAM,yBAAyB,GAAG,IAAI,GAAG,CAAC,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC,CAAC;AAEpE;;;;;;GAMG;AACH,SAAS,yBAAyB,CAAC,IAAoB,EAAE,MAA2B;IACnF,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,WAAW,GAAG,CAAC,KAAqB,EAAQ,EAAE;QACnD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;YAC3B,OAAO;QACR,CAAC;QACD,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;YAAE,OAAO;QACjC,IAAI,cAAc,CAAC,KAAK,CAAC;YAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAChD,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC;YAAE,WAAW,CAAC,KAAK,CAAC,CAAC;IAC9D,CAAC,CAAC;IACF,WAAW,CAAC,IAAI,CAAC,CAAC;IAElB,MAAM,KAAK,GAAG,CAAC,KAAqB,EAAE,IAAY,EAAkB,EAAE;QACrE,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5D,CAAC;QACD,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QACvC,MAAM,GAAG,GAAqB,EAAE,CAAC;QACjC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YAClD,MAAM,SAAS,GAAG,GAAG,IAAI,IAAI,GAAG,EAAE,CAAC;YACnC,IAAI,yBAAyB,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC/D,MAAM,IAAI,GAAqB,EAAE,CAAC;gBAClC,KAAK,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;oBACxD,MAAM,OAAO,GAAG,GAAG,SAAS,IAAI,MAAM,EAAE,CAAC;oBACzC,IAAI,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC;wBAAE,SAAS;oBACxD,IAAI,CAAC,MAAM,CAAC,GAAG,QAAQ,CAAC;gBACzB,CAAC;gBACD,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;oBAAE,SAAS;gBAC7C,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;gBAClC,SAAS;YACV,CAAC;YACD,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QACpC,CAAC;QACD,OAAO,GAAG,CAAC;IACZ,CAAC,CAAC;IACF,OAAO,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;AACzB,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,mBAAmB,CAAC,GAAqB;IACjD,KAAK,MAAM,GAAG,IAAI,kBAAkB,EAAE,CAAC;QACtC,MAAM,QAAQ,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QAE5D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,MAAM,OAAO,GAAqB,EAAE,CAAC;QACrC,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC/B,MAAM,SAAS,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;YACxC,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC;gBAAE,SAAS;YAClC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACpB,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtB,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,KAAK,QAAQ,CAAC,MAAM;YAAE,SAAS;QAEjD,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,QAAQ,KAAK,SAAS,IAAI,cAAc,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC3G,oEAAoE;YACpE,mEAAmE;YACnE,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC;YAChB,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC/C,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;oBAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC7B,CAAC;QACF,CAAC;aAAM,CAAC;YACP,GAAG,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC;QACpB,CAAC;IACF,CAAC;AACF,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAoB;IACrD,MAAM,OAAO,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC;IACzC,qEAAqE;IACrE,4DAA4D;IAC5D,OAAO,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,qBAAqB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;AAC5E,CAAC;AAED,SAAS,qBAAqB,CAAC,IAAoB;IAClD,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QACzB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,qBAAqB,CAAC,IAAI,CAAC,CAAC,CAAC;IACxD,CAAC;IACD,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAErC,MAAM,GAAG,GAAqB,EAAE,CAAC;IACjC,MAAM,WAAW,GAChB,IAAI,CAAC,IAAI,KAAK,QAAQ;QACtB,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC;QACzB,yBAAyB,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;QAC1C,SAAS,IAAI,IAAI,CAAC;IAEnB,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3C,IAAI,WAAW,IAAI,CAAC,KAAK,SAAS;YAAE,SAAS;QAC7C,GAAG,CAAC,CAAC,CAAC,GAAG,qBAAqB,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC;IACD,MAAM,oBAAoB,GAAG,GAAG,CAAC,oBAAoB,CAAC;IACtD,IAAI,YAAY,CAAC,oBAAoB,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1F,2EAA2E;QAC3E,kFAAkF;QAClF,GAAG,CAAC,oBAAoB,GAAG,IAAI,CAAC;IACjC,CAAC;IACD,mBAAmB,CAAC,GAAG,CAAC,CAAC;IACzB,OAAO,GAAG,CAAC;AACZ,CAAC;AAED,SAAS,cAAc,CAAC,KAAc;IACrC,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,CAAC;AACpD,CAAC;AAED,SAAS,YAAY,CAAC,KAAc;IACnC,OAAO,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AAC7B,CAAC;AAED,SAAS,WAAW,CAAC,KAAiC;IACrD,OAAO,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AAC7B,CAAC;AAED,SAAS,mBAAmB,CAAC,KAAqB;IACjD,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,IAAI,YAAY,CAAC,KAAK,CAAC;QAAE,MAAM,IAAI,eAAe,CAAC,8CAA8C,EAAE,eAAe,CAAC,CAAC;IAC9I,OAAO,KAAK,CAAC;AACd,CAAC;AAED,MAAM,UAAU,cAAc,CAC7B,MAAoB,EACpB,UAA2B,EAAE;IAE7B,MAAM,OAAO,GAAG,MAAM,CAAC,YAAY,EAAE,EAAE,CAAC;IACxC,MAAM,QAAQ,GAAG,OAAO,KAAK,SAAS,IAAI,cAAc,CAAC,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC;QAC1F,CAAC,CAAC,OAAO;QACT,CAAC,CAAC,kBAAkB,CAAC,MAAM,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC,CAAC;IAC7E,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,IAAI,YAAY,CAAC,QAAQ,CAAC,EAAE,CAAC;QACzD,MAAM,IAAI,eAAe,CAAC,8CAA8C,EAAE,eAAe,CAAC,CAAC;IAC5F,CAAC;IACD,MAAM,SAAS,GAAG,mBAAmB,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC,CAAC;IACnE,MAAM,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,SAAS,EAAE,KAAK,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;IACnF,MAAM,kBAAkB,GAAG,EAAE,GAAG,SAAS,EAAE,CAAC;IAC5C,IAAI,OAAO,CAAC,iBAAiB;QAAE,OAAO,kBAAkB,CAAC,MAAM,CAAC;IAChE,MAAM,SAAS,GAAG,sBAAsB,CAAC,kBAAkB,CAAC,CAAC;IAC7D,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,aAAa,CAAC,SAAS,CAAC,EAAE,CAAC;AAClE,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,iCAAiC,CAChD,SAEC,EACD,OAwBC;IAED,MAAM,QAAQ,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAChD,SAAS,CAAC,IAAI,GAAG,CAAC,GAAG,IAAW,EAAE,EAAE;QACnC,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACpB,MAAM,MAAM,GAAG,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;QAC7I,MAAM,KAAK,GAAG,MAAM,EAAE,KAAK,CAAC;QAC5B,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YAC1B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBAC1B,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,IAAI,CAAC;oBAAE,MAAM,IAAI,eAAe,CAAC,wCAAwC,EAAE,eAAe,CAAC,CAAC;gBACtI,IAAI,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;oBACzE,IAAI,CAAC,WAAW,GAAG,mBAAmB,CAAC,iBAAiB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;gBAC7E,CAAC;gBACD,IAAI,OAAO,EAAE,gBAAgB,EAAE,CAAC;oBAC/B,OAAO,IAAI,CAAC,YAAY,CAAC;gBAC1B,CAAC;qBAAM,IAAI,cAAc,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;oBAClF,IAAI,CAAC,YAAY,GAAG,mBAAmB,CAAC,iBAAiB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;gBAC/E,CAAC;YACF,CAAC;QACF,CAAC;QACD,OAAO,QAAQ,CAAC,GAAG,IAAI,CAAC,CAAC;IAC1B,CAAC,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,qBAAqB,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,CAAU,CAAC;AAE5F;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,iBAAiB,CAAC,MAAsB;IACvD,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,IAAI,YAAY,CAAC,MAAM,CAAC;QAAE,OAAO,CAAC,yBAAyB,CAAC,CAAC;IAExF,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACxE,MAAM,eAAe,GAAG,qBAAqB,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,IAAI,MAAM,CAAC,CAAC;IAC3E,IAAI,CAAC,OAAO,IAAI,CAAC,eAAe,EAAE,CAAC;QAClC,MAAM,CAAC,IAAI,CACV,qFAAqF,CACrF,CAAC;IACH,CAAC;IACD,IAAI,YAAY,IAAI,MAAM,IAAI,MAAM,CAAC,UAAU,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC;QACvF,MAAM,CAAC,IAAI,CAAC,kDAAkD,CAAC,CAAC;IACjE,CAAC;IACD,MAAM,MAAM,GAAG,uBAAuB,CAAC,MAAM,CAAC,CAAC;IAC/C,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,MAAM,CAAC,IAAI,CAAC,wBAAwB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,yCAAyC,CAAC,CAAC;IACjG,CAAC;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AAED,MAAM,UAAU,sBAAsB,CAAC,WAAmB;IACzD,MAAM,OAAO,GAAG,WAAW,CAAC,IAAI,EAAE,CAAC;IACnC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,sBAAsB,CAAC,CAAC;IAC1D,IAAI,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC;QAAE,OAAO,CAAC,iCAAiC,CAAC,CAAC;IACvE,IAAI,OAAO,CAAC,MAAM,GAAG,qBAAqB,EAAE,CAAC;QAC5C,OAAO,CAAC,uBAAuB,qBAAqB,WAAW,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;IACnF,CAAC;IACD,OAAO,EAAE,CAAC;AACX,CAAC;AAED,SAAS,kBAAkB,CAAC,WAAmB;IAC9C,OAAO,WAAW,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;AAChD,CAAC;AAED,SAAS,kBAAkB,CAAC,WAAmB,EAAE,KAAa;IAC7D,IAAI,WAAW,CAAC,MAAM,IAAI,KAAK;QAAE,OAAO,WAAW,CAAC;IACpD,mEAAmE;IACnE,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,IAAI,EAAE,CAAC;IACrD,MAAM,SAAS,GAAG,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IACzC,MAAM,SAAS,GAAG,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IAC9F,MAAM,OAAO,GAAG,SAAS,CAAC,OAAO,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IAC3D,MAAM,UAAU,GACf,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC;QACtE,CAAC,CAAC,OAAO;QACT,CAAC,CAAC,GAAG,OAAO,GAAG,CAAC;IAClB,8EAA8E;IAC9E,OAAO,UAAU,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;AACvF,CAAC;AAED,MAAM,UAAU,sBAAsB,CAAC,WAAmB;IACzD,MAAM,UAAU,GAAG,kBAAkB,CAAC,WAAW,CAAC,CAAC;IACnD,IAAI,CAAC,UAAU;QAAE,OAAO,EAAE,CAAC;IAE3B,MAAM,UAAU,GAAG;QAClB,UAAU;QACV,UAAU,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE;QAC9C,UAAU,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE;QAC/C,UAAU,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE;QAC5C,UAAU,CAAC,KAAK,CAAC,0BAA0B,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE;QACvD,UAAU,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE;QAC7C,UAAU,CAAC,OAAO,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE;QAChE,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE;QACnC,UAAU,CAAC,KAAK,CAAC,qBAAqB,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE;KACpD,CAAC,MAAM,CAAC,CAAC,SAAS,EAAuB,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAE1D,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACpC,IAAI,SAAS,CAAC,MAAM,IAAI,qBAAqB;YAAE,OAAO,SAAS,CAAC;IACjE,CAAC;IAED,OAAO,kBAAkB,CAAC,UAAU,EAAE,qBAAqB,CAAC,CAAC;AAC9D,CAAC;AAED,MAAM,UAAU,qBAAqB,CAAC,MAA4B;IACjE,2EAA2E;IAC3E,6EAA6E;IAC7E,oEAAoE;IACpE,IAAI,MAAM,CAAC,cAAc,KAAK,SAAS,IAAI,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpF,MAAM,UAAU,GAAG,kBAAkB,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;QAC7D,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;YACzD,IAAI,UAAU,CAAC,MAAM,IAAI,qBAAqB;gBAAE,OAAO,UAAU,CAAC;YAClE,OAAO,sBAAsB,CAAC,UAAU,CAAC,CAAC;QAC3C,CAAC;IACF,CAAC;IACD,MAAM,GAAG,GAAG,MAAM,CAAC,WAAW,IAAI,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,EAAE,IAAI,EAAE,CAAC;IACjE,OAAO,sBAAsB,CAAC,GAAG,CAAC,CAAC;AACpC,CAAC;AAED,MAAM,CAAC,MAAM,gBAAgB,GAAG,yBAAyB,CAAC;AAC1D,MAAM,CAAC,MAAM,oBAAoB,GAAG,6BAA6B,CAAC;AAClE,MAAM,CAAC,MAAM,gBAAgB,GAAG,yBAAyB,CAAC;AAC1D,MAAM,CAAC,MAAM,uBAAuB,GAAG,gCAAgC,CAAC;AAExE,MAAM,UAAU,sBAAsB,CACrC,MAAoB,EACpB,aAAiC,EACjC,MAAc;IAEd,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC;QAAE,OAAO,MAAM,CAAC;IAEjD,MAAM,aAAa,GAAG,gBAAgB,CAAC,MAAM,CAAE,CAAC;IAChD,MAAM,OAAO,GAAG,uBAAuB,CAAC,MAAM,CAAC,CAAC;IAEhD,OAAO,CAAC,CAAC,UAAU,CAAC,CAAC,KAAK,EAAE,EAAE;QAC7B,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,IAAI,YAAY,CAAC,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QAChE,IAAI,CAAC,CAAC,aAAa,IAAI,KAAK,CAAC,EAAE,CAAC;YAC/B,IAAI,aAAa,IAAI,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC;gBACtD,OAAO,EAAE,CAAC,aAAa,CAAC,EAAE,aAAa,EAAE,GAAG,KAAK,EAAE,CAAC;YACrD,CAAC;YACD,MAAM,IAAI,KAAK,CACd,qBAAqB,aAAa,mBAAmB,MAAM,IAAI;gBAC9D,sBAAsB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAC3C,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACd,CAAC,EAAE,MAAM,CAAC,CAAC;AACZ,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,iCAAiC,GAAG,0CAA0C,CAAC;AAE5F,MAAM,UAAU,aAAa,CAAC,MAA2B;IACxD,MAAM,EAAE,MAAM,EAAE,GAAG,cAAc,CAAC,MAAM,CAAC,MAAM,EAAE;QAChD,IAAI,EAAE,MAAM,CAAC,IAAI;QACjB,iBAAiB,EAAE,IAAI;QACvB,aAAa,EAAE,IAAI;KACnB,CAAC,CAAC;IACH,OAAO,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,WAAW,EAAE,MAAM,CAAC,WAAW,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC;AACpF,CAAC"}

package/dist/cli/mcp/audit/dev.audit.tools.descriptor.d.ts

@@ -0,0 +1,15 @@
+/**
+ * `vibes dev audit tools` — the universal-tools czar cycle capability.
+ *
+ * Checks declared tool descriptors through the MCP exposure funnel for every
+ * client preset: exposure counts, unintended preset exclusions, and description
+ * length limits. Served-catalog evidence requires --live; read-safe canary and
+ * host-attestation checks require --doctor. Composed into the existing `dev.audit`
+ * group beside `dev.audit.ledger` — NOT a new top-level group and NOT a
+ * `tools`-group command (both were killed in docs/proposals/universal-tools-czar/
+ * as second-way / slop). `--json` for the scheduled daily czar routine.
+ */
+import type { CLICommandAssetDescriptor } from '@vibesdotdev/cli/schemas/types';
+declare const descriptor: CLICommandAssetDescriptor;
+export default descriptor;
+//# sourceMappingURL=dev.audit.tools.descriptor.d.ts.map

package/dist/cli/mcp/audit/dev.audit.tools.descriptor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dev.audit.tools.descriptor.d.ts","sourceRoot":"","sources":["../../../../src/cli/mcp/audit/dev.audit.tools.descriptor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,yBAAyB,EAAE,MAAM,gCAAgC,CAAC;AAEhF,QAAA,MAAM,UAAU,EAAE,yBA8CjB,CAAC;AAEF,eAAe,UAAU,CAAC"}