@code-yeongyu/senpi-ai 2026.7.25-2

package/dist/utils/tool-schema-compat.js

@@ -0,0 +1,215 @@
+/**
+ * JSON Schema normalization for tool parameters sent to OpenAI-compatible
+ * backends. Some gateways (e.g. Apitopia → Kimi / Moonshot) enforce a stricter
+ * subset that rejects a sibling `type` keyword on schemas that also declare
+ * `anyOf` / `oneOf` / `allOf`. This helper removes that redundancy while
+ * preserving the schema's semantics.
+ */
+const COMBINER_KEYS = ["anyOf", "oneOf", "allOf"];
+const SCHEMA_MAP_KEYS = ["properties", "patternProperties", "$defs", "definitions"];
+const SCHEMA_SINGLE_KEYS = [
+    "items",
+    "additionalProperties",
+    "contains",
+    "propertyNames",
+    "if",
+    "then",
+    "else",
+    "not",
+];
+function isJsonObject(value) {
+    return value !== null && typeof value === "object" && !Array.isArray(value);
+}
+function isScalarType(type) {
+    return type === "string" || type === "number" || type === "integer" || type === "boolean";
+}
+/**
+ * Move a parent-level `type` keyword into combiner branches that do not already
+ * declare one, then drop the parent `type`. This keeps the schema equivalent
+ * while satisfying validators that require `type` to live inside each branch.
+ */
+function moveTypeIntoCombinerBranches(node) {
+    if (!("type" in node))
+        return;
+    const parentType = node.type;
+    for (const combiner of COMBINER_KEYS) {
+        const branches = node[combiner];
+        if (!Array.isArray(branches))
+            continue;
+        for (const branch of branches) {
+            if (isJsonObject(branch) && !("type" in branch)) {
+                branch.type = parentType;
+            }
+        }
+    }
+    delete node.type;
+}
+/**
+ * Collapse a homogeneous all-`const` union into a typed `enum`. This is the
+ * wire shape many OpenAI-compatible gateways expect for literal unions.
+ */
+function collapseConstUnion(node) {
+    const branches = node.anyOf;
+    if (!Array.isArray(branches) || branches.length < 2)
+        return;
+    if ("type" in node)
+        return;
+    const values = [];
+    let sharedType;
+    for (const branch of branches) {
+        if (!isJsonObject(branch))
+            return;
+        if (!Object.hasOwn(branch, "const"))
+            return;
+        const keys = Object.keys(branch);
+        if (keys.length !== 2 || !keys.includes("type"))
+            return;
+        const branchType = branch.type;
+        if (!isScalarType(branchType))
+            return;
+        if (sharedType === undefined) {
+            sharedType = branchType;
+        }
+        else if (sharedType !== branchType) {
+            return;
+        }
+        values.push(branch.const);
+    }
+    if (sharedType === undefined || values.length === 0)
+        return;
+    delete node.anyOf;
+    node.type = sharedType;
+    node.enum = values;
+}
+function mergeRootObjectUnion(schema) {
+    const branches = Array.isArray(schema.anyOf) ? schema.anyOf : Array.isArray(schema.oneOf) ? schema.oneOf : undefined;
+    if (branches === undefined || branches.length === 0)
+        return undefined;
+    const objectBranches = [];
+    for (const branch of branches) {
+        if (!isJsonObject(branch) || branch.type !== "object")
+            return undefined;
+        if (branch.properties !== undefined && !isJsonObject(branch.properties))
+            return undefined;
+        if (branch.required !== undefined && !Array.isArray(branch.required))
+            return undefined;
+        objectBranches.push(branch);
+    }
+    const properties = {};
+    for (const branch of objectBranches) {
+        if (!isJsonObject(branch.properties))
+            continue;
+        for (const [name, propertySchema] of Object.entries(branch.properties)) {
+            const existing = properties[name];
+            properties[name] =
+                existing === undefined || JSON.stringify(existing) === JSON.stringify(propertySchema)
+                    ? propertySchema
+                    : { anyOf: [existing, propertySchema] };
+        }
+    }
+    const firstRequired = objectBranches[0]?.required;
+    let commonRequired = Array.isArray(firstRequired)
+        ? firstRequired.filter((name) => typeof name === "string")
+        : [];
+    for (const branch of objectBranches.slice(1)) {
+        const branchRequired = new Set(Array.isArray(branch.required)
+            ? branch.required.filter((name) => typeof name === "string")
+            : []);
+        commonRequired = commonRequired.filter((name) => branchRequired.has(name));
+    }
+    const { anyOf: _anyOf, oneOf: _oneOf, ...rest } = schema;
+    return {
+        ...rest,
+        type: "object",
+        properties,
+        ...(commonRequired.length > 0 ? { required: commonRequired } : {}),
+    };
+}
+function normalizeNode(node) {
+    if (Array.isArray(node)) {
+        return node.map((child) => normalizeNode(child));
+    }
+    if (!isJsonObject(node)) {
+        return node;
+    }
+    const hasCombiner = COMBINER_KEYS.some((key) => Array.isArray(node[key]));
+    if (hasCombiner) {
+        moveTypeIntoCombinerBranches(node);
+    }
+    for (const combiner of COMBINER_KEYS) {
+        const branches = node[combiner];
+        if (Array.isArray(branches)) {
+            node[combiner] = branches.map((branch) => normalizeNode(branch));
+        }
+    }
+    if (Array.isArray(node.anyOf)) {
+        collapseConstUnion(node);
+    }
+    for (const key of SCHEMA_SINGLE_KEYS) {
+        if (Object.hasOwn(node, key)) {
+            node[key] = normalizeNode(node[key]);
+        }
+    }
+    for (const key of SCHEMA_MAP_KEYS) {
+        const map = node[key];
+        if (!isJsonObject(map))
+            continue;
+        for (const name of Object.keys(map)) {
+            map[name] = normalizeNode(map[name]);
+        }
+    }
+    return node;
+}
+/**
+ * Return a deep-normalized copy of a tool's JSON Schema parameters, suitable
+ * for OpenAI-compatible Chat Completions backends.
+ */
+export function normalizeToolParametersForOpenAICompat(schema) {
+    return normalizeNode(structuredClone(schema));
+}
+/**
+ * Moonshot-flavored JSON Schema subset: in addition to the OpenAI-compatible
+ * normalization, drop non-structural annotation keywords that Moonshot rejects.
+ */
+export function normalizeToolParametersForMoonshot(schema) {
+    const normalized = normalizeToolParametersForOpenAICompat(schema);
+    return stripMoonshotAnnotations(mergeRootObjectUnion(normalized) ?? normalized);
+}
+function stripMoonshotAnnotations(node) {
+    if (Array.isArray(node)) {
+        return node.map((child) => stripMoonshotAnnotations(child));
+    }
+    if (!isJsonObject(node)) {
+        return node;
+    }
+    // Moonshot does not support JSON Schema validators like `format` or
+    // annotation-only keywords like `examples` inside function parameters.
+    delete node.format;
+    delete node.examples;
+    delete node.readOnly;
+    delete node.writeOnly;
+    delete node.deprecated;
+    delete node.$schema;
+    delete node.$id;
+    for (const combiner of COMBINER_KEYS) {
+        const branches = node[combiner];
+        if (Array.isArray(branches)) {
+            node[combiner] = branches.map((branch) => stripMoonshotAnnotations(branch));
+        }
+    }
+    for (const key of SCHEMA_SINGLE_KEYS) {
+        if (Object.hasOwn(node, key)) {
+            node[key] = stripMoonshotAnnotations(node[key]);
+        }
+    }
+    for (const key of SCHEMA_MAP_KEYS) {
+        const map = node[key];
+        if (!isJsonObject(map))
+            continue;
+        for (const name of Object.keys(map)) {
+            map[name] = stripMoonshotAnnotations(map[name]);
+        }
+    }
+    return node;
+}
+//# sourceMappingURL=tool-schema-compat.js.map

package/dist/utils/tool-schema-compat.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tool-schema-compat.js","sourceRoot":"","sources":["../../src/utils/tool-schema-compat.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH,MAAM,aAAa,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAU,CAAC;AAC3D,MAAM,eAAe,GAAG,CAAC,YAAY,EAAE,mBAAmB,EAAE,OAAO,EAAE,aAAa,CAAU,CAAC;AAC7F,MAAM,kBAAkB,GAAG;IAC1B,OAAO;IACP,sBAAsB;IACtB,UAAU;IACV,eAAe;IACf,IAAI;IACJ,MAAM;IACN,MAAM;IACN,KAAK;CACI,CAAC;AAEX,SAAS,YAAY,CAAC,KAAc;IACnC,OAAO,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AAC7E,CAAC;AAED,SAAS,YAAY,CAAC,IAAa;IAClC,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS,CAAC;AAC3F,CAAC;AAED;;;;GAIG;AACH,SAAS,4BAA4B,CAAC,IAA6B;IAClE,IAAI,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC;QAAE,OAAO;IAE9B,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC;IAC7B,KAAK,MAAM,QAAQ,IAAI,aAAa,EAAE,CAAC;QACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC;YAAE,SAAS;QAEvC,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC/B,IAAI,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,IAAI,MAAM,CAAC,EAAE,CAAC;gBACjD,MAAM,CAAC,IAAI,GAAG,UAAU,CAAC;YAC1B,CAAC;QACF,CAAC;IACF,CAAC;IAED,OAAO,IAAI,CAAC,IAAI,CAAC;AAClB,CAAC;AAED;;;GAGG;AACH,SAAS,kBAAkB,CAAC,IAA6B;IACxD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;IAC5B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO;IAC5D,IAAI,MAAM,IAAI,IAAI;QAAE,OAAO;IAE3B,MAAM,MAAM,GAAc,EAAE,CAAC;IAC7B,IAAI,UAA8B,CAAC;IAEnC,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;QAC/B,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;YAAE,OAAO;QAClC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;YAAE,OAAO;QAE5C,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACjC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;YAAE,OAAO;QAExD,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC;QAC/B,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC;YAAE,OAAO;QAEtC,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YAC9B,UAAU,GAAG,UAAU,CAAC;QACzB,CAAC;aAAM,IAAI,UAAU,KAAK,UAAU,EAAE,CAAC;YACtC,OAAO;QACR,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IAED,IAAI,UAAU,KAAK,SAAS,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IAE5D,OAAO,IAAI,CAAC,KAAK,CAAC;IAClB,IAAI,CAAC,IAAI,GAAG,UAAU,CAAC;IACvB,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC;AACpB,CAAC;AAED,SAAS,oBAAoB,CAAC,MAA+B;IAC5D,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;IACrH,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAEtE,MAAM,cAAc,GAA8B,EAAE,CAAC;IACrD,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;QAC/B,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,SAAS,CAAC;QACxE,IAAI,MAAM,CAAC,UAAU,KAAK,SAAS,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,UAAU,CAAC;YAAE,OAAO,SAAS,CAAC;QAC1F,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC;YAAE,OAAO,SAAS,CAAC;QACvF,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC7B,CAAC;IAED,MAAM,UAAU,GAA4B,EAAE,CAAC;IAC/C,KAAK,MAAM,MAAM,IAAI,cAAc,EAAE,CAAC;QACrC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,UAAU,CAAC;YAAE,SAAS;QAC/C,KAAK,MAAM,CAAC,IAAI,EAAE,cAAc,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC;YACxE,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;YAClC,UAAU,CAAC,IAAI,CAAC;gBACf,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC;oBACpF,CAAC,CAAC,cAAc;oBAChB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,QAAQ,EAAE,cAAc,CAAC,EAAE,CAAC;QAC3C,CAAC;IACF,CAAC;IAED,MAAM,aAAa,GAAG,cAAc,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC;IAClD,IAAI,cAAc,GAAG,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC;QAChD,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,IAAI,EAAkB,EAAE,CAAC,OAAO,IAAI,KAAK,QAAQ,CAAC;QAC1E,CAAC,CAAC,EAAE,CAAC;IACN,KAAK,MAAM,MAAM,IAAI,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9C,MAAM,cAAc,GAAG,IAAI,GAAG,CAC7B,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC;YAC7B,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,EAAkB,EAAE,CAAC,OAAO,IAAI,KAAK,QAAQ,CAAC;YAC5E,CAAC,CAAC,EAAE,CACL,CAAC;QACF,cAAc,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;IAC5E,CAAC;IAED,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,IAAI,EAAE,GAAG,MAAM,CAAC;IACzD,OAAO;QACN,GAAG,IAAI;QACP,IAAI,EAAE,QAAQ;QACd,UAAU;QACV,GAAG,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAClE,CAAC;AACH,CAAC;AAED,SAAS,aAAa,CAAC,IAAa;IACnC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QACzB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC;IAClD,CAAC;IAED,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC;QACzB,OAAO,IAAI,CAAC;IACb,CAAC;IAED,MAAM,WAAW,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC1E,IAAI,WAAW,EAAE,CAAC;QACjB,4BAA4B,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IAED,KAAK,MAAM,QAAQ,IAAI,aAAa,EAAE,CAAC;QACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChC,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC7B,IAAI,CAAC,QAAQ,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;QAClE,CAAC;IACF,CAAC;IAED,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QAC/B,kBAAkB,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,KAAK,MAAM,GAAG,IAAI,kBAAkB,EAAE,CAAC;QACtC,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;YAC9B,IAAI,CAAC,GAAG,CAAC,GAAG,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,CAAC;IACF,CAAC;IAED,KAAK,MAAM,GAAG,IAAI,eAAe,EAAE,CAAC;QACnC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC;YAAE,SAAS;QACjC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACrC,GAAG,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QACtC,CAAC;IACF,CAAC;IAED,OAAO,IAAI,CAAC;AACb,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,sCAAsC,CAAC,MAA+B;IACrF,OAAO,aAAa,CAAC,eAAe,CAAC,MAAM,CAAC,CAA4B,CAAC;AAC1E,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,kCAAkC,CAAC,MAA+B;IACjF,MAAM,UAAU,GAAG,sCAAsC,CAAC,MAAM,CAAC,CAAC;IAClE,OAAO,wBAAwB,CAAC,oBAAoB,CAAC,UAAU,CAAC,IAAI,UAAU,CAAC,CAAC;AACjF,CAAC;AAED,SAAS,wBAAwB,CAAC,IAAa;IAC9C,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QACzB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,wBAAwB,CAAC,KAAK,CAAC,CAAuC,CAAC;IACnG,CAAC;IAED,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC;QACzB,OAAO,IAA+B,CAAC;IACxC,CAAC;IAED,oEAAoE;IACpE,uEAAuE;IACvE,OAAO,IAAI,CAAC,MAAM,CAAC;IACnB,OAAO,IAAI,CAAC,QAAQ,CAAC;IACrB,OAAO,IAAI,CAAC,QAAQ,CAAC;IACrB,OAAO,IAAI,CAAC,SAAS,CAAC;IACtB,OAAO,IAAI,CAAC,UAAU,CAAC;IACvB,OAAO,IAAI,CAAC,OAAO,CAAC;IACpB,OAAO,IAAI,CAAC,GAAG,CAAC;IAEhB,KAAK,MAAM,QAAQ,IAAI,aAAa,EAAE,CAAC;QACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChC,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC7B,IAAI,CAAC,QAAQ,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,wBAAwB,CAAC,MAAM,CAAC,CAAC,CAAC;QAC7E,CAAC;IACF,CAAC;IAED,KAAK,MAAM,GAAG,IAAI,kBAAkB,EAAE,CAAC;QACtC,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;YAC9B,IAAI,CAAC,GAAG,CAAC,GAAG,wBAAwB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACjD,CAAC;IACF,CAAC;IAED,KAAK,MAAM,GAAG,IAAI,eAAe,EAAE,CAAC;QACnC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC;YAAE,SAAS;QACjC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACrC,GAAG,CAAC,IAAI,CAAC,GAAG,wBAAwB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QACjD,CAAC;IACF,CAAC;IAED,OAAO,IAAI,CAAC;AACb,CAAC","sourcesContent":["/**\n * JSON Schema normalization for tool parameters sent to OpenAI-compatible\n * backends. Some gateways (e.g. Apitopia → Kimi / Moonshot) enforce a stricter\n * subset that rejects a sibling `type` keyword on schemas that also declare\n * `anyOf` / `oneOf` / `allOf`. This helper removes that redundancy while\n * preserving the schema's semantics.\n */\n\nexport type ToolSchemaFlavor = \"moonshot-mfjs\";\n\nconst COMBINER_KEYS = [\"anyOf\", \"oneOf\", \"allOf\"] as const;\nconst SCHEMA_MAP_KEYS = [\"properties\", \"patternProperties\", \"$defs\", \"definitions\"] as const;\nconst SCHEMA_SINGLE_KEYS = [\n\t\"items\",\n\t\"additionalProperties\",\n\t\"contains\",\n\t\"propertyNames\",\n\t\"if\",\n\t\"then\",\n\t\"else\",\n\t\"not\",\n] as const;\n\nfunction isJsonObject(value: unknown): value is Record<string, unknown> {\n\treturn value !== null && typeof value === \"object\" && !Array.isArray(value);\n}\n\nfunction isScalarType(type: unknown): type is \"string\" | \"number\" | \"integer\" | \"boolean\" {\n\treturn type === \"string\" || type === \"number\" || type === \"integer\" || type === \"boolean\";\n}\n\n/**\n * Move a parent-level `type` keyword into combiner branches that do not already\n * declare one, then drop the parent `type`. This keeps the schema equivalent\n * while satisfying validators that require `type` to live inside each branch.\n */\nfunction moveTypeIntoCombinerBranches(node: Record<string, unknown>): void {\n\tif (!(\"type\" in node)) return;\n\n\tconst parentType = node.type;\n\tfor (const combiner of COMBINER_KEYS) {\n\t\tconst branches = node[combiner];\n\t\tif (!Array.isArray(branches)) continue;\n\n\t\tfor (const branch of branches) {\n\t\t\tif (isJsonObject(branch) && !(\"type\" in branch)) {\n\t\t\t\tbranch.type = parentType;\n\t\t\t}\n\t\t}\n\t}\n\n\tdelete node.type;\n}\n\n/**\n * Collapse a homogeneous all-`const` union into a typed `enum`. This is the\n * wire shape many OpenAI-compatible gateways expect for literal unions.\n */\nfunction collapseConstUnion(node: Record<string, unknown>): void {\n\tconst branches = node.anyOf;\n\tif (!Array.isArray(branches) || branches.length < 2) return;\n\tif (\"type\" in node) return;\n\n\tconst values: unknown[] = [];\n\tlet sharedType: string | undefined;\n\n\tfor (const branch of branches) {\n\t\tif (!isJsonObject(branch)) return;\n\t\tif (!Object.hasOwn(branch, \"const\")) return;\n\n\t\tconst keys = Object.keys(branch);\n\t\tif (keys.length !== 2 || !keys.includes(\"type\")) return;\n\n\t\tconst branchType = branch.type;\n\t\tif (!isScalarType(branchType)) return;\n\n\t\tif (sharedType === undefined) {\n\t\t\tsharedType = branchType;\n\t\t} else if (sharedType !== branchType) {\n\t\t\treturn;\n\t\t}\n\n\t\tvalues.push(branch.const);\n\t}\n\n\tif (sharedType === undefined || values.length === 0) return;\n\n\tdelete node.anyOf;\n\tnode.type = sharedType;\n\tnode.enum = values;\n}\n\nfunction mergeRootObjectUnion(schema: Record<string, unknown>): Record<string, unknown> | undefined {\n\tconst branches = Array.isArray(schema.anyOf) ? schema.anyOf : Array.isArray(schema.oneOf) ? schema.oneOf : undefined;\n\tif (branches === undefined || branches.length === 0) return undefined;\n\n\tconst objectBranches: Record<string, unknown>[] = [];\n\tfor (const branch of branches) {\n\t\tif (!isJsonObject(branch) || branch.type !== \"object\") return undefined;\n\t\tif (branch.properties !== undefined && !isJsonObject(branch.properties)) return undefined;\n\t\tif (branch.required !== undefined && !Array.isArray(branch.required)) return undefined;\n\t\tobjectBranches.push(branch);\n\t}\n\n\tconst properties: Record<string, unknown> = {};\n\tfor (const branch of objectBranches) {\n\t\tif (!isJsonObject(branch.properties)) continue;\n\t\tfor (const [name, propertySchema] of Object.entries(branch.properties)) {\n\t\t\tconst existing = properties[name];\n\t\t\tproperties[name] =\n\t\t\t\texisting === undefined || JSON.stringify(existing) === JSON.stringify(propertySchema)\n\t\t\t\t\t? propertySchema\n\t\t\t\t\t: { anyOf: [existing, propertySchema] };\n\t\t}\n\t}\n\n\tconst firstRequired = objectBranches[0]?.required;\n\tlet commonRequired = Array.isArray(firstRequired)\n\t\t? firstRequired.filter((name): name is string => typeof name === \"string\")\n\t\t: [];\n\tfor (const branch of objectBranches.slice(1)) {\n\t\tconst branchRequired = new Set(\n\t\t\tArray.isArray(branch.required)\n\t\t\t\t? branch.required.filter((name): name is string => typeof name === \"string\")\n\t\t\t\t: [],\n\t\t);\n\t\tcommonRequired = commonRequired.filter((name) => branchRequired.has(name));\n\t}\n\n\tconst { anyOf: _anyOf, oneOf: _oneOf, ...rest } = schema;\n\treturn {\n\t\t...rest,\n\t\ttype: \"object\",\n\t\tproperties,\n\t\t...(commonRequired.length > 0 ? { required: commonRequired } : {}),\n\t};\n}\n\nfunction normalizeNode(node: unknown): unknown {\n\tif (Array.isArray(node)) {\n\t\treturn node.map((child) => normalizeNode(child));\n\t}\n\n\tif (!isJsonObject(node)) {\n\t\treturn node;\n\t}\n\n\tconst hasCombiner = COMBINER_KEYS.some((key) => Array.isArray(node[key]));\n\tif (hasCombiner) {\n\t\tmoveTypeIntoCombinerBranches(node);\n\t}\n\n\tfor (const combiner of COMBINER_KEYS) {\n\t\tconst branches = node[combiner];\n\t\tif (Array.isArray(branches)) {\n\t\t\tnode[combiner] = branches.map((branch) => normalizeNode(branch));\n\t\t}\n\t}\n\n\tif (Array.isArray(node.anyOf)) {\n\t\tcollapseConstUnion(node);\n\t}\n\n\tfor (const key of SCHEMA_SINGLE_KEYS) {\n\t\tif (Object.hasOwn(node, key)) {\n\t\t\tnode[key] = normalizeNode(node[key]);\n\t\t}\n\t}\n\n\tfor (const key of SCHEMA_MAP_KEYS) {\n\t\tconst map = node[key];\n\t\tif (!isJsonObject(map)) continue;\n\t\tfor (const name of Object.keys(map)) {\n\t\t\tmap[name] = normalizeNode(map[name]);\n\t\t}\n\t}\n\n\treturn node;\n}\n\n/**\n * Return a deep-normalized copy of a tool's JSON Schema parameters, suitable\n * for OpenAI-compatible Chat Completions backends.\n */\nexport function normalizeToolParametersForOpenAICompat(schema: Record<string, unknown>): Record<string, unknown> {\n\treturn normalizeNode(structuredClone(schema)) as Record<string, unknown>;\n}\n\n/**\n * Moonshot-flavored JSON Schema subset: in addition to the OpenAI-compatible\n * normalization, drop non-structural annotation keywords that Moonshot rejects.\n */\nexport function normalizeToolParametersForMoonshot(schema: Record<string, unknown>): Record<string, unknown> {\n\tconst normalized = normalizeToolParametersForOpenAICompat(schema);\n\treturn stripMoonshotAnnotations(mergeRootObjectUnion(normalized) ?? normalized);\n}\n\nfunction stripMoonshotAnnotations(node: unknown): Record<string, unknown> {\n\tif (Array.isArray(node)) {\n\t\treturn node.map((child) => stripMoonshotAnnotations(child)) as unknown as Record<string, unknown>;\n\t}\n\n\tif (!isJsonObject(node)) {\n\t\treturn node as Record<string, unknown>;\n\t}\n\n\t// Moonshot does not support JSON Schema validators like `format` or\n\t// annotation-only keywords like `examples` inside function parameters.\n\tdelete node.format;\n\tdelete node.examples;\n\tdelete node.readOnly;\n\tdelete node.writeOnly;\n\tdelete node.deprecated;\n\tdelete node.$schema;\n\tdelete node.$id;\n\n\tfor (const combiner of COMBINER_KEYS) {\n\t\tconst branches = node[combiner];\n\t\tif (Array.isArray(branches)) {\n\t\t\tnode[combiner] = branches.map((branch) => stripMoonshotAnnotations(branch));\n\t\t}\n\t}\n\n\tfor (const key of SCHEMA_SINGLE_KEYS) {\n\t\tif (Object.hasOwn(node, key)) {\n\t\t\tnode[key] = stripMoonshotAnnotations(node[key]);\n\t\t}\n\t}\n\n\tfor (const key of SCHEMA_MAP_KEYS) {\n\t\tconst map = node[key];\n\t\tif (!isJsonObject(map)) continue;\n\t\tfor (const name of Object.keys(map)) {\n\t\t\tmap[name] = stripMoonshotAnnotations(map[name]);\n\t\t}\n\t}\n\n\treturn node;\n}\n"]}

package/dist/utils/typebox-helpers.d.ts

@@ -0,0 +1,17 @@
+import { type TUnsafe } from "typebox";
+/**
+ * Creates a string enum schema compatible with Google's API and other providers
+ * that don't support anyOf/const patterns.
+ *
+ * @example
+ * const OperationSchema = StringEnum(["add", "subtract", "multiply", "divide"], {
+ *   description: "The operation to perform"
+ * });
+ *
+ * type Operation = Static<typeof OperationSchema>; // "add" | "subtract" | "multiply" | "divide"
+ */
+export declare function StringEnum<T extends readonly string[]>(values: T, options?: {
+    description?: string;
+    default?: T[number];
+}): TUnsafe<T[number]>;
+//# sourceMappingURL=typebox-helpers.d.ts.map

package/dist/utils/typebox-helpers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"typebox-helpers.d.ts","sourceRoot":"","sources":["../../src/utils/typebox-helpers.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,OAAO,EAAQ,MAAM,SAAS,CAAC;AAE7C;;;;;;;;;;GAUG;AACH,wBAAgB,UAAU,CAAC,CAAC,SAAS,SAAS,MAAM,EAAE,EACrD,MAAM,EAAE,CAAC,EACT,OAAO,CAAC,EAAE;IAAE,WAAW,CAAC,EAAE,MAAM,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAA;CAAE,GACrD,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAOpB"}

package/dist/utils/typebox-helpers.js

@@ -0,0 +1,21 @@
+import { Type } from "typebox";
+/**
+ * Creates a string enum schema compatible with Google's API and other providers
+ * that don't support anyOf/const patterns.
+ *
+ * @example
+ * const OperationSchema = StringEnum(["add", "subtract", "multiply", "divide"], {
+ *   description: "The operation to perform"
+ * });
+ *
+ * type Operation = Static<typeof OperationSchema>; // "add" | "subtract" | "multiply" | "divide"
+ */
+export function StringEnum(values, options) {
+    return Type.Unsafe({
+        type: "string",
+        enum: values,
+        ...(options?.description && { description: options.description }),
+        ...(options?.default && { default: options.default }),
+    });
+}
+//# sourceMappingURL=typebox-helpers.js.map

package/dist/utils/typebox-helpers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"typebox-helpers.js","sourceRoot":"","sources":["../../src/utils/typebox-helpers.ts"],"names":[],"mappings":"AAAA,OAAO,EAAgB,IAAI,EAAE,MAAM,SAAS,CAAC;AAE7C;;;;;;;;;;GAUG;AACH,MAAM,UAAU,UAAU,CACzB,MAAS,EACT,OAAuD;IAEvD,OAAO,IAAI,CAAC,MAAM,CAAY;QAC7B,IAAI,EAAE,QAAQ;QACd,IAAI,EAAE,MAAa;QACnB,GAAG,CAAC,OAAO,EAAE,WAAW,IAAI,EAAE,WAAW,EAAE,OAAO,CAAC,WAAW,EAAE,CAAC;QACjE,GAAG,CAAC,OAAO,EAAE,OAAO,IAAI,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE,CAAC;KACrD,CAAC,CAAC;AACJ,CAAC","sourcesContent":["import { type TUnsafe, Type } from \"typebox\";\n\n/**\n * Creates a string enum schema compatible with Google's API and other providers\n * that don't support anyOf/const patterns.\n *\n * @example\n * const OperationSchema = StringEnum([\"add\", \"subtract\", \"multiply\", \"divide\"], {\n *   description: \"The operation to perform\"\n * });\n *\n * type Operation = Static<typeof OperationSchema>; // \"add\" | \"subtract\" | \"multiply\" | \"divide\"\n */\nexport function StringEnum<T extends readonly string[]>(\n\tvalues: T,\n\toptions?: { description?: string; default?: T[number] },\n): TUnsafe<T[number]> {\n\treturn Type.Unsafe<T[number]>({\n\t\ttype: \"string\",\n\t\tenum: values as any,\n\t\t...(options?.description && { description: options.description }),\n\t\t...(options?.default && { default: options.default }),\n\t});\n}\n"]}

package/dist/utils/uuid.d.ts

@@ -0,0 +1,3 @@
+/** Generate a time-ordered UUIDv7. */
+export declare function uuidv7(): string;
+//# sourceMappingURL=uuid.d.ts.map

package/dist/utils/uuid.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"uuid.d.ts","sourceRoot":"","sources":["../../src/utils/uuid.ts"],"names":[],"mappings":"AAcA,sCAAsC;AACtC,wBAAgB,MAAM,IAAI,MAAM,CAgC/B"}

package/dist/utils/uuid.js

@@ -0,0 +1,50 @@
+let lastTimestamp = -Infinity;
+let sequence = 0;
+function fillRandomBytes(bytes) {
+    const crypto = globalThis.crypto;
+    if (crypto?.getRandomValues) {
+        crypto.getRandomValues(bytes);
+        return;
+    }
+    for (let i = 0; i < bytes.length; i++) {
+        bytes[i] = Math.floor(Math.random() * 256);
+    }
+}
+/** Generate a time-ordered UUIDv7. */
+export function uuidv7() {
+    const random = new Uint8Array(16);
+    fillRandomBytes(random);
+    const timestamp = Date.now();
+    if (timestamp > lastTimestamp) {
+        sequence = random[6] * 0x1000000 + random[7] * 0x10000 + random[8] * 0x100 + random[9];
+        lastTimestamp = timestamp;
+    }
+    else {
+        sequence = (sequence + 1) >>> 0;
+        if (sequence === 0)
+            lastTimestamp++;
+    }
+    const bytes = new Uint8Array(16);
+    bytes[0] = (lastTimestamp / 0x10000000000) & 0xff;
+    bytes[1] = (lastTimestamp / 0x100000000) & 0xff;
+    bytes[2] = (lastTimestamp / 0x1000000) & 0xff;
+    bytes[3] = (lastTimestamp / 0x10000) & 0xff;
+    bytes[4] = (lastTimestamp / 0x100) & 0xff;
+    bytes[5] = lastTimestamp & 0xff;
+    bytes[6] = 0x70 | ((sequence >>> 28) & 0x0f);
+    bytes[7] = (sequence >>> 20) & 0xff;
+    bytes[8] = 0x80 | ((sequence >>> 14) & 0x3f);
+    bytes[9] = (sequence >>> 6) & 0xff;
+    bytes[10] = ((sequence & 0x3f) << 2) | (random[10] & 0x03);
+    bytes[11] = random[11];
+    bytes[12] = random[12];
+    bytes[13] = random[13];
+    bytes[14] = random[14];
+    bytes[15] = random[15];
+    return formatUuid(bytes);
+}
+function formatUuid(bytes) {
+    const hex = Array.from(bytes, (byte) => byte.toString(16).padStart(2, "0"));
+    return `${hex.slice(0, 4).join("")}-${hex.slice(4, 6).join("")}-${hex.slice(6, 8).join("")}-${hex.slice(8, 10).join("")}-${hex.slice(10, 16).join("")}`;
+}
+//# sourceMappingURL=uuid.js.map

package/dist/utils/uuid.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"uuid.js","sourceRoot":"","sources":["../../src/utils/uuid.ts"],"names":[],"mappings":"AAAA,IAAI,aAAa,GAAG,CAAC,QAAQ,CAAC;AAC9B,IAAI,QAAQ,GAAG,CAAC,CAAC;AAEjB,SAAS,eAAe,CAAC,KAA8B;IACtD,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC;IACjC,IAAI,MAAM,EAAE,eAAe,EAAE,CAAC;QAC7B,MAAM,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAC9B,OAAO;IACR,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC;IAC5C,CAAC;AACF,CAAC;AAED,sCAAsC;AACtC,MAAM,UAAU,MAAM;IACrB,MAAM,MAAM,GAA4B,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC;IAC3D,eAAe,CAAC,MAAM,CAAC,CAAC;IACxB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAE7B,IAAI,SAAS,GAAG,aAAa,EAAE,CAAC;QAC/B,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACvF,aAAa,GAAG,SAAS,CAAC;IAC3B,CAAC;SAAM,CAAC;QACP,QAAQ,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,QAAQ,KAAK,CAAC;YAAE,aAAa,EAAE,CAAC;IACrC,CAAC;IAED,MAAM,KAAK,GAA4B,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC;IAC1D,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,aAAa,GAAG,aAAa,CAAC,GAAG,IAAI,CAAC;IAClD,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,aAAa,GAAG,WAAW,CAAC,GAAG,IAAI,CAAC;IAChD,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,aAAa,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC;IAC9C,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,aAAa,GAAG,OAAO,CAAC,GAAG,IAAI,CAAC;IAC5C,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,aAAa,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC;IAC1C,KAAK,CAAC,CAAC,CAAC,GAAG,aAAa,GAAG,IAAI,CAAC;IAChC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,QAAQ,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;IAC7C,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;IACpC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,QAAQ,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;IAC7C,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC;IACnC,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;IAC3D,KAAK,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;IACvB,KAAK,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;IACvB,KAAK,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;IACvB,KAAK,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;IACvB,KAAK,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;IAEvB,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC;AAC1B,CAAC;AAED,SAAS,UAAU,CAAC,KAA8B;IACjD,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IAC5E,OAAO,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;AACzJ,CAAC","sourcesContent":["let lastTimestamp = -Infinity;\nlet sequence = 0;\n\nfunction fillRandomBytes(bytes: Uint8Array<ArrayBuffer>): void {\n\tconst crypto = globalThis.crypto;\n\tif (crypto?.getRandomValues) {\n\t\tcrypto.getRandomValues(bytes);\n\t\treturn;\n\t}\n\tfor (let i = 0; i < bytes.length; i++) {\n\t\tbytes[i] = Math.floor(Math.random() * 256);\n\t}\n}\n\n/** Generate a time-ordered UUIDv7. */\nexport function uuidv7(): string {\n\tconst random: Uint8Array<ArrayBuffer> = new Uint8Array(16);\n\tfillRandomBytes(random);\n\tconst timestamp = Date.now();\n\n\tif (timestamp > lastTimestamp) {\n\t\tsequence = random[6] * 0x1000000 + random[7] * 0x10000 + random[8] * 0x100 + random[9];\n\t\tlastTimestamp = timestamp;\n\t} else {\n\t\tsequence = (sequence + 1) >>> 0;\n\t\tif (sequence === 0) lastTimestamp++;\n\t}\n\n\tconst bytes: Uint8Array<ArrayBuffer> = new Uint8Array(16);\n\tbytes[0] = (lastTimestamp / 0x10000000000) & 0xff;\n\tbytes[1] = (lastTimestamp / 0x100000000) & 0xff;\n\tbytes[2] = (lastTimestamp / 0x1000000) & 0xff;\n\tbytes[3] = (lastTimestamp / 0x10000) & 0xff;\n\tbytes[4] = (lastTimestamp / 0x100) & 0xff;\n\tbytes[5] = lastTimestamp & 0xff;\n\tbytes[6] = 0x70 | ((sequence >>> 28) & 0x0f);\n\tbytes[7] = (sequence >>> 20) & 0xff;\n\tbytes[8] = 0x80 | ((sequence >>> 14) & 0x3f);\n\tbytes[9] = (sequence >>> 6) & 0xff;\n\tbytes[10] = ((sequence & 0x3f) << 2) | (random[10] & 0x03);\n\tbytes[11] = random[11];\n\tbytes[12] = random[12];\n\tbytes[13] = random[13];\n\tbytes[14] = random[14];\n\tbytes[15] = random[15];\n\n\treturn formatUuid(bytes);\n}\n\nfunction formatUuid(bytes: Uint8Array<ArrayBuffer>): string {\n\tconst hex = Array.from(bytes, (byte) => byte.toString(16).padStart(2, \"0\"));\n\treturn `${hex.slice(0, 4).join(\"\")}-${hex.slice(4, 6).join(\"\")}-${hex.slice(6, 8).join(\"\")}-${hex.slice(8, 10).join(\"\")}-${hex.slice(10, 16).join(\"\")}`;\n}\n"]}

package/dist/utils/validation.d.ts

@@ -0,0 +1,18 @@
+import type { Tool, ToolCall } from "../types.ts";
+/**
+ * Finds a tool by name and validates the tool call arguments against its TypeBox schema
+ * @param tools Array of tool definitions
+ * @param toolCall The tool call from the LLM
+ * @returns The validated arguments
+ * @throws Error if tool is not found or validation fails
+ */
+export declare function validateToolCall(tools: Tool[], toolCall: ToolCall): any;
+/**
+ * Validates tool call arguments against the tool's TypeBox schema
+ * @param tool The tool definition with TypeBox schema
+ * @param toolCall The tool call from the LLM
+ * @returns The validated (and potentially coerced) arguments
+ * @throws Error with formatted message if validation fails
+ */
+export declare function validateToolArguments(tool: Tool, toolCall: ToolCall): any;
+//# sourceMappingURL=validation.d.ts.map

package/dist/utils/validation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"validation.d.ts","sourceRoot":"","sources":["../../src/utils/validation.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AA4PlD;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,QAAQ,EAAE,QAAQ,GAAG,GAAG,CAMvE;AAED;;;;;;GAMG;AACH,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,GAAG,GAAG,CAgCzE"}

package/dist/utils/validation.js

@@ -0,0 +1,269 @@
+import { Compile } from "typebox/compile";
+import { Value } from "typebox/value";
+const validatorCache = new WeakMap();
+const TYPEBOX_KIND = Symbol.for("TypeBox.Kind");
+function getSchemaTypes(schema) {
+    if (typeof schema.type === "string") {
+        return [schema.type];
+    }
+    if (Array.isArray(schema.type)) {
+        return schema.type.filter((type) => typeof type === "string");
+    }
+    return [];
+}
+function matchesJsonType(value, type) {
+    switch (type) {
+        case "number":
+            return typeof value === "number";
+        case "integer":
+            return typeof value === "number" && Number.isInteger(value);
+        case "boolean":
+            return typeof value === "boolean";
+        case "string":
+            return typeof value === "string";
+        case "null":
+            return value === null;
+        case "array":
+            return Array.isArray(value);
+        case "object":
+            return typeof value === "object" && value !== null && !Array.isArray(value);
+        default:
+            return false;
+    }
+}
+function getSubSchemaValidator(schema) {
+    try {
+        return getValidator(schema);
+    }
+    catch {
+        return undefined;
+    }
+}
+function coercePrimitiveByType(value, type) {
+    switch (type) {
+        case "number": {
+            if (value === null) {
+                return 0;
+            }
+            if (typeof value === "string" && value.trim() !== "") {
+                const parsed = Number(value);
+                if (Number.isFinite(parsed)) {
+                    return parsed;
+                }
+            }
+            if (typeof value === "boolean") {
+                return value ? 1 : 0;
+            }
+            return value;
+        }
+        case "integer": {
+            if (value === null) {
+                return 0;
+            }
+            if (typeof value === "string" && value.trim() !== "") {
+                const parsed = Number(value);
+                if (Number.isInteger(parsed)) {
+                    return parsed;
+                }
+            }
+            if (typeof value === "boolean") {
+                return value ? 1 : 0;
+            }
+            return value;
+        }
+        case "boolean": {
+            if (value === null) {
+                return false;
+            }
+            if (typeof value === "string") {
+                if (value === "true") {
+                    return true;
+                }
+                if (value === "false") {
+                    return false;
+                }
+            }
+            if (typeof value === "number") {
+                if (value === 1) {
+                    return true;
+                }
+                if (value === 0) {
+                    return false;
+                }
+            }
+            return value;
+        }
+        case "string": {
+            if (value === null) {
+                return "";
+            }
+            if (typeof value === "number" || typeof value === "boolean") {
+                return String(value);
+            }
+            return value;
+        }
+        case "null": {
+            if (value === "" || value === 0 || value === false) {
+                return null;
+            }
+            return value;
+        }
+        default:
+            return value;
+    }
+}
+function applySchemaObjectCoercion(value, schema) {
+    const properties = schema.properties;
+    const definedKeys = new Set(properties ? Object.keys(properties) : []);
+    if (properties) {
+        for (const [key, propertySchema] of Object.entries(properties)) {
+            if (!(key in value)) {
+                continue;
+            }
+            value[key] = coerceWithJsonSchema(value[key], propertySchema);
+        }
+    }
+    if (schema.additionalProperties && typeof schema.additionalProperties === "object") {
+        for (const [key, propertyValue] of Object.entries(value)) {
+            if (definedKeys.has(key)) {
+                continue;
+            }
+            value[key] = coerceWithJsonSchema(propertyValue, schema.additionalProperties);
+        }
+    }
+}
+function applySchemaArrayCoercion(value, schema) {
+    if (Array.isArray(schema.items)) {
+        for (let index = 0; index < value.length; index++) {
+            const itemSchema = schema.items[index];
+            if (!itemSchema) {
+                continue;
+            }
+            value[index] = coerceWithJsonSchema(value[index], itemSchema);
+        }
+        return;
+    }
+    if (schema.items && typeof schema.items === "object") {
+        for (let index = 0; index < value.length; index++) {
+            value[index] = coerceWithJsonSchema(value[index], schema.items);
+        }
+    }
+}
+function coerceWithUnionSchema(value, schemas) {
+    for (const schema of schemas) {
+        const candidate = structuredClone(value);
+        const coerced = coerceWithJsonSchema(candidate, schema);
+        const validator = getSubSchemaValidator(schema);
+        if (validator?.Check(coerced)) {
+            return coerced;
+        }
+    }
+    return value;
+}
+function coerceWithJsonSchema(value, schema) {
+    let nextValue = value;
+    if (Array.isArray(schema.allOf)) {
+        for (const nested of schema.allOf) {
+            nextValue = coerceWithJsonSchema(nextValue, nested);
+        }
+    }
+    if (Array.isArray(schema.anyOf)) {
+        nextValue = coerceWithUnionSchema(nextValue, schema.anyOf);
+    }
+    if (Array.isArray(schema.oneOf)) {
+        nextValue = coerceWithUnionSchema(nextValue, schema.oneOf);
+    }
+    const schemaTypes = getSchemaTypes(schema);
+    const matchesUnionMember = schemaTypes.length > 1 && schemaTypes.some((schemaType) => matchesJsonType(nextValue, schemaType));
+    if (schemaTypes.length > 0 && !matchesUnionMember) {
+        for (const schemaType of schemaTypes) {
+            const candidate = coercePrimitiveByType(nextValue, schemaType);
+            if (candidate !== nextValue) {
+                nextValue = candidate;
+                break;
+            }
+        }
+    }
+    if (schemaTypes.includes("object") &&
+        typeof nextValue === "object" &&
+        nextValue !== null &&
+        !Array.isArray(nextValue)) {
+        applySchemaObjectCoercion(nextValue, schema);
+    }
+    if (schemaTypes.includes("array") && Array.isArray(nextValue)) {
+        applySchemaArrayCoercion(nextValue, schema);
+    }
+    return nextValue;
+}
+function getValidator(schema) {
+    const key = schema;
+    const cached = validatorCache.get(key);
+    if (cached) {
+        return cached;
+    }
+    const validator = Compile(schema);
+    validatorCache.set(key, validator);
+    return validator;
+}
+function formatValidationPath(error) {
+    if (error.keyword === "required") {
+        const requiredProperties = error.params.requiredProperties;
+        const requiredProperty = requiredProperties?.[0];
+        if (requiredProperty) {
+            const basePath = error.instancePath.replace(/^\//, "").replace(/\//g, ".");
+            return basePath ? `${basePath}.${requiredProperty}` : requiredProperty;
+        }
+    }
+    const path = error.instancePath.replace(/^\//, "").replace(/\//g, ".");
+    return path || "root";
+}
+/**
+ * Finds a tool by name and validates the tool call arguments against its TypeBox schema
+ * @param tools Array of tool definitions
+ * @param toolCall The tool call from the LLM
+ * @returns The validated arguments
+ * @throws Error if tool is not found or validation fails
+ */
+export function validateToolCall(tools, toolCall) {
+    const tool = tools.find((t) => t.name === toolCall.name);
+    if (!tool) {
+        throw new Error(`Tool "${toolCall.name}" not found`);
+    }
+    return validateToolArguments(tool, toolCall);
+}
+/**
+ * Validates tool call arguments against the tool's TypeBox schema
+ * @param tool The tool definition with TypeBox schema
+ * @param toolCall The tool call from the LLM
+ * @returns The validated (and potentially coerced) arguments
+ * @throws Error with formatted message if validation fails
+ */
+export function validateToolArguments(tool, toolCall) {
+    const args = structuredClone(toolCall.arguments);
+    Value.Convert(tool.parameters, args);
+    const validator = getValidator(tool.parameters);
+    if (!Object.getOwnPropertySymbols(tool.parameters).includes(TYPEBOX_KIND)) {
+        const coerced = coerceWithJsonSchema(args, tool.parameters);
+        if (coerced !== args) {
+            if (typeof args === "object" && args !== null && typeof coerced === "object" && coerced !== null) {
+                for (const key of Object.keys(args)) {
+                    delete args[key];
+                }
+                Object.assign(args, coerced);
+            }
+            else {
+                return validator.Check(coerced) ? coerced : args;
+            }
+        }
+    }
+    if (validator.Check(args)) {
+        return args;
+    }
+    const errors = validator
+        .Errors(args)
+        .map((error) => `  - ${formatValidationPath(error)}: ${error.message}`)
+        .join("\n") || "Unknown validation error";
+    const errorMessage = `Validation failed for tool "${toolCall.name}":\n${errors}\n\nReceived arguments:\n${JSON.stringify(toolCall.arguments, null, 2)}`;
+    throw new Error(errorMessage);
+}
+//# sourceMappingURL=validation.js.map