@mintlify/msft-sdk 1.1.62 → 1.1.64

package/dist/api-playground-2/schemaGraph/reduceCompositions.js

@@ -1,282 +1,321 @@
-import { MAX_SCHEMA_COMBINATION_SIZE as b } from "../constants/index.js";
-import { handleExistingError as M, ImpossibleSchemaError as y } from "./errors.js";
-import { flattenSchemaOneOfs as c, isCircularRef as x, shouldTruncateForSize as E, createEmptyReducedSchema as w, createUnknownReducedSchema as L, combine as p, takeLast as m, isReducedSchema as P } from "./utils.js";
-function k({
+import { MAX_SCHEMA_COMBINATION_SIZE as w } from "../constants/index.js";
+import { handleExistingError as c, ImpossibleSchemaError as v } from "./errors.js";
+import { flattenSchemaOneOfs as L, isCircularRef as b, shouldTruncateForSize as C, createEmptyReducedSchema as I, createUnknownReducedSchema as $, combine as y, takeLast as O, isReducedSchema as A } from "./utils.js";
+function B({
   schema: e,
-  depth: i,
-  location: r,
-  flattenOneOfs: n = !0
+  depth: t,
+  location: i,
+  flattenOneOfs: o = !0
 }) {
-  const l = O({
+  const l = m({
     schema: e,
-    depth: i,
-    location: r,
+    depth: t,
+    location: i,
     safeParse: !1,
     path: ["#"]
   });
-  return n ? c(l) : l;
+  return o ? L(l) : l;
 }
-function O({
+function m({
   schema: e,
-  depth: i,
-  location: r,
-  safeParse: n = !1,
+  depth: t,
+  location: i,
+  safeParse: o = !1,
   path: l = ["#"]
 }) {
   try {
-    if (x(e))
+    if (typeof e == "boolean")
+      return { oneOf: [{}] };
+    if (typeof e != "object")
+      return { oneOf: [{ type: "any" }] };
+    if (b(e))
       return { oneOf: [e] };
-    if (E(e))
+    if (C(e))
       return { oneOf: [{ type: "any" }] };
-    if (e.oneOf && e.oneOf.length > 0 ? e.oneOf = S({
+    if (e.oneOf && e.oneOf.length > 0 ? e.oneOf = j({
       schemaArray: e.oneOf,
-      depth: i,
-      location: r,
+      depth: t,
+      location: i,
       path: [...l, "oneOf"]
-    }) : e.oneOf = [], e.anyOf && e.anyOf.length > 0 && (e.anyOf = S({
+    }) : e.oneOf = [], e.anyOf && e.anyOf.length > 0 && (e.anyOf = j({
       schemaArray: e.anyOf,
-      depth: i,
-      location: r,
+      depth: t,
+      location: i,
       path: [...l, "anyOf"]
     })), e.allOf && e.allOf.length > 0) {
-      const d = e.allOf.map(
-        (u, t) => O({
-          schema: u,
-          depth: i + 1,
-          location: r,
-          safeParse: n,
-          path: [...l, "allOf", t.toString()]
+      const u = e.allOf.map(
+        (n, d) => m({
+          schema: n,
+          depth: t + 1,
+          location: i,
+          safeParse: o,
+          path: [...l, "allOf", d.toString()]
         })
       ).reduce(
-        (u, t) => v(u, t, i + 1),
-        w()
+        (n, d) => M(n, d, t + 1),
+        I()
       );
-      e.oneOf = s(e.oneOf, d.oneOf, i);
+      e.oneOf = g(e.oneOf, u.oneOf, t);
     }
     if (e.properties)
-      for (const d in e.properties) {
-        const u = e.properties[d];
-        if (x(u)) {
-          e.properties[d] = { oneOf: [u] };
+      for (const u in e.properties) {
+        const n = e.properties[u];
+        if (b(n)) {
+          e.properties[u] = { oneOf: [n] };
+          continue;
+        }
+        if (typeof n == "boolean") {
+          e.properties[u] = { oneOf: [{}] };
           continue;
         }
-        if (u.readOnly && r === "request" || u.writeOnly && r === "response") {
-          delete e.properties[d];
+        if (typeof n == "object" && (n.readOnly && i === "request" || n.writeOnly && i === "response")) {
+          delete e.properties[u];
           continue;
         }
-        const t = [...l, "properties", d];
+        const d = [...l, "properties", u];
         try {
-          e.properties[d] = O({
-            schema: u,
-            depth: i + 1,
-            location: r,
-            safeParse: n,
-            path: t
+          e.properties[u] = m({
+            schema: n,
+            depth: t + 1,
+            location: i,
+            safeParse: o,
+            path: d
           });
-        } catch (f) {
-          M(f, t, n, "error reducing property schema"), e.properties[d] = { oneOf: [{}] };
+        } catch (s) {
+          c(s, d, o, "error reducing property schema"), e.properties[u] = { oneOf: [{}] };
         }
       }
-    if ("items" in e && e.items && !x(e.items))
+    if ("items" in e && e.items && !b(e.items))
       try {
-        e.items = O({
+        e.items = m({
           schema: e.items,
-          depth: i + 1,
-          location: r,
-          safeParse: n,
+          depth: t + 1,
+          location: i,
+          safeParse: o,
           path: [...l, "items"]
         });
-      } catch (d) {
-        M(d, [...l, "items"], n, "error reducing items schema"), e.items = L();
+      } catch (u) {
+        c(u, [...l, "items"], o, "error reducing items schema"), e.items = $();
       }
-    if (e.additionalProperties && typeof e.additionalProperties == "object" && !x(e.additionalProperties))
+    if (e.additionalProperties && typeof e.additionalProperties == "object" && !b(e.additionalProperties))
       try {
-        e.additionalProperties = O({
+        e.additionalProperties = m({
           schema: e.additionalProperties,
-          depth: i + 1,
-          location: r,
-          safeParse: n,
+          depth: t + 1,
+          location: i,
+          safeParse: o,
           path: [...l, "additionalProperties"]
         });
-      } catch (d) {
-        e.additionalProperties = !(d instanceof y);
+      } catch (u) {
+        e.additionalProperties = !(u instanceof v);
       }
-    e.anyOf && e.anyOf.length > 0 && (e.oneOf = s(e.oneOf, e.anyOf, i));
-    const o = C(e);
+    e.anyOf && e.anyOf.length > 0 && (e.oneOf = g(e.oneOf, e.anyOf, t));
+    const p = T(e);
     return {
-      oneOf: s(e.oneOf, o, i)
+      oneOf: g(e.oneOf, p, t, !0)
     };
-  } catch (o) {
-    return o instanceof Error && console.error("Error processing schema:", o.message), { oneOf: [{ type: "any" }] };
+  } catch (p) {
+    return p instanceof Error && console.error("Error processing schema:", p.message), { oneOf: [{ type: "any" }] };
   }
 }
-function S({
+function q(e, t, i = !1) {
+  if (e.description && t.description && !t.discriminator) {
+    const o = e.type === "object" && t.type === "object", l = e.type && t.type && typeof e.type == "string" && typeof t.type == "string" && e.type === t.type;
+    if (o || l)
+      return i ? `${t.description}
+${e.description}` : `${e.description}
+${t.description}`;
+  }
+  return O(e, t, "description");
+}
+function j({
   schemaArray: e,
-  depth: i,
-  location: r,
-  path: n = ["#"]
+  depth: t,
+  location: i,
+  path: o = ["#"]
 }) {
-  const l = e.flatMap((o, d) => {
+  const l = e.flatMap((p, u) => {
     try {
-      return O({
-        schema: o,
-        depth: i + 1,
-        location: r,
+      return m({
+        schema: p,
+        depth: t + 1,
+        location: i,
         safeParse: !1,
-        path: [...n, d.toString()]
+        path: [...o, u.toString()]
       }).oneOf;
-    } catch (u) {
-      if (u instanceof y)
+    } catch (n) {
+      if (n instanceof v)
         return [];
-      throw u;
+      throw n;
     }
   });
   if (l.length === 0)
-    throw new y(n, "no valid options in schema");
+    throw new v(o, "no valid options in schema");
   return l;
 }
-function s(e, i, r) {
-  if (e.length * i.length > b)
+function g(e, t, i, o = !1) {
+  if (e.length * t.length > w)
     return [{}];
-  if (e.length === 0 && i.length === 0)
+  if (e.length === 0 && t.length === 0)
     return [{}];
   if (e.length === 0)
-    return i;
-  if (i.length === 0)
+    return t;
+  if (t.length === 0)
     return e;
-  const l = e.flatMap((o) => i.flatMap((d) => {
+  const p = e.flatMap((u) => t.flatMap((n) => {
     try {
-      return [I(o, d, r + 1)];
-    } catch (u) {
-      if (u instanceof y)
+      return [R(
+        u,
+        n,
+        i + 1,
+        o
+      )];
+    } catch (d) {
+      if (d instanceof v)
         return [];
-      throw u;
+      throw d;
     }
   }));
-  return l.length, l;
+  return p.length, p;
 }
-function v(e, i, r) {
+function M(e, t, i) {
   return {
-    oneOf: s(
+    oneOf: g(
       e.oneOf ?? [],
-      i.oneOf ?? [],
-      r
+      t.oneOf ?? [],
+      i,
+      !1
     )
   };
 }
-function I(e, i, r) {
-  let n = e.type, l = i.type;
-  if (n === "integer" && l === "number" ? l = "integer" : n === "number" && l === "integer" && (n = "integer"), n && l && n !== l)
-    throw new y([], `mismatched type in composition: "${n}" "${l}"`);
-  for (const t of [e, i])
-    typeof t.exclusiveMaximum == "number" && (t.maximum === void 0 || t.maximum >= t.exclusiveMaximum ? (t.maximum = t.exclusiveMaximum, t.exclusiveMaximum = !0) : t.exclusiveMaximum = void 0), typeof t.exclusiveMinimum == "number" && (t.minimum === void 0 || t.minimum <= t.exclusiveMinimum ? (t.minimum = t.exclusiveMinimum, t.exclusiveMinimum = !0) : t.exclusiveMinimum = void 0);
-  const o = {
-    title: m(e, i, "title"),
-    description: m(e, i, "description"),
-    format: m(e, i, "format"),
-    default: m(e, i, "default"),
-    multipleOf: p(e, i, "multipleOf", q),
-    maximum: p(e, i, "maximum", Math.min),
-    minimum: p(e, i, "minimum", Math.max),
-    maxLength: p(e, i, "maxLength", Math.min),
-    minLength: p(e, i, "minLength", Math.max),
-    pattern: m(e, i, "pattern"),
-    maxItems: p(e, i, "maxItems", Math.min),
-    minItems: p(e, i, "minItems", Math.max),
-    uniqueItems: m(e, i, "uniqueItems"),
-    maxProperties: p(e, i, "maxProperties", Math.min),
-    minProperties: p(e, i, "minProperties", Math.max),
-    required: p(
+function R(e, t, i, o = !1) {
+  let l = e.type, p = t.type;
+  if (l === "integer" && p === "number" ? p = "integer" : l === "number" && p === "integer" && (l = "integer"), l && p && l !== p)
+    throw new v([], `mismatched type in composition: "${l}" "${p}"`);
+  for (const r of [e, t])
+    typeof r.exclusiveMaximum == "number" && (r.maximum === void 0 || r.maximum >= r.exclusiveMaximum ? (r.maximum = r.exclusiveMaximum, r.exclusiveMaximum = !0) : r.exclusiveMaximum = void 0), typeof r.exclusiveMinimum == "number" && (r.minimum === void 0 || r.minimum <= r.exclusiveMinimum ? (r.minimum = r.exclusiveMinimum, r.exclusiveMinimum = !0) : r.exclusiveMinimum = void 0);
+  const u = q(
+    e,
+    t,
+    o
+  ), n = {
+    title: O(e, t, "title"),
+    description: u,
+    format: O(e, t, "format"),
+    default: O(e, t, "default"),
+    multipleOf: y(e, t, "multipleOf", D),
+    maximum: y(e, t, "maximum", Math.min),
+    minimum: y(e, t, "minimum", Math.max),
+    maxLength: y(e, t, "maxLength", Math.min),
+    minLength: y(e, t, "minLength", Math.max),
+    pattern: O(e, t, "pattern"),
+    maxItems: y(e, t, "maxItems", Math.min),
+    minItems: y(e, t, "minItems", Math.max),
+    uniqueItems: O(e, t, "uniqueItems"),
+    maxProperties: y(e, t, "maxProperties", Math.min),
+    minProperties: y(e, t, "minProperties", Math.max),
+    required: y(
       e,
-      i,
+      t,
       "required",
-      (t, f) => f.concat(t.filter((a) => !f.includes(a)))
+      (r, f) => f.concat(r.filter((a) => !f.includes(a)))
     ),
-    enum: p(e, i, "enum", (t, f) => f.filter((a) => t.includes(a))),
-    const: p(e, i, "const", (t, f) => f ?? t),
-    readOnly: e.readOnly && i.readOnly,
-    writeOnly: e.writeOnly && i.writeOnly,
-    deprecated: e.deprecated || i.deprecated
+    enum: y(e, t, "enum", (r, f) => f.filter((a) => r.includes(a))),
+    const: y(e, t, "const", (r, f) => f ?? r),
+    readOnly: e.readOnly && t.readOnly,
+    writeOnly: e.writeOnly && t.writeOnly,
+    deprecated: e.deprecated || t.deprecated
   };
-  for (const t of [e, i])
-    Object.keys(t).forEach((f) => {
-      f.startsWith("x-") && (o[f] = m(
+  for (const r of [e, t])
+    Object.keys(r).forEach((f) => {
+      f.startsWith("x-") && (n[f] = O(
         e,
-        i,
+        t,
         f
       ));
     });
-  Object.entries(o).forEach(([t, f]) => {
-    f === void 0 && delete o[t];
+  Object.entries(n).forEach(([r, f]) => {
+    f === void 0 && delete n[r];
   });
-  const d = j(e, i);
-  d !== void 0 && (o.example = d), o.maximum !== void 0 && (o.exclusiveMaximum = (e.maximum === o.maximum ? e.exclusiveMaximum : void 0) || (i.maximum === o.maximum ? i.exclusiveMaximum : void 0)), o.minimum !== void 0 && (o.exclusiveMinimum = (e.minimum === o.minimum ? e.exclusiveMinimum : void 0) || (i.minimum === o.minimum ? i.exclusiveMinimum : void 0));
-  const u = n ?? l;
-  if (u === "array")
-    return {
+  const d = z(e, t);
+  d !== void 0 && (n.example = d), n.maximum !== void 0 && (n.exclusiveMaximum = (e.maximum === n.maximum ? e.exclusiveMaximum : void 0) || (t.maximum === n.maximum ? t.exclusiveMaximum : void 0)), n.minimum !== void 0 && (n.exclusiveMinimum = (e.minimum === n.minimum ? e.exclusiveMinimum : void 0) || (t.minimum === n.minimum ? t.exclusiveMinimum : void 0));
+  const s = l ?? p;
+  if (s === "array") {
+    let r = {};
+    "items" in e && e.items !== void 0 && (typeof e.items == "boolean" ? r = { oneOf: [{}] } : typeof e.items == "object" && (r = e.items));
+    let f = {};
+    return "items" in t && t.items !== void 0 && (typeof t.items == "boolean" ? f = { oneOf: [{}] } : typeof t.items == "object" && (f = t.items)), {
       type: "array",
-      items: v(
-        "items" in e && e.items ? e.items : {},
-        "items" in i && i.items ? i.items : {},
-        r + 1
-      ),
-      ...o
+      items: M(r, f, i + 1),
+      ...n
     };
-  if (e.properties && i.properties) {
-    const t = { ...e.properties };
-    Object.entries(i.properties).forEach(([f, a]) => {
-      const g = t[f];
-      g ? t[f] = v(g, a, r + 1) : t[f] = a;
-    }), o.properties = t;
-  } else (e.properties || i.properties) && (o.properties = {
+  }
+  if (e.properties && t.properties) {
+    const r = { ...e.properties };
+    Object.entries(t.properties).forEach(([f, a]) => {
+      let x = a;
+      typeof a == "boolean" && (x = { oneOf: [{}] });
+      const S = r[f];
+      if (S) {
+        let P = S;
+        typeof S == "boolean" && (P = { oneOf: [{}] }), typeof x == "object" && typeof P == "object" ? r[f] = M(
+          P,
+          x,
+          i + 1
+        ) : r[f] = x;
+      } else
+        r[f] = x;
+    }), n.properties = r;
+  } else (e.properties || t.properties) && (n.properties = {
     ...e.properties,
-    ...i.properties
+    ...t.properties
   });
-  if (e.additionalProperties === !1 || i.additionalProperties === !1)
-    o.additionalProperties = !1;
+  if (e.additionalProperties === !1 || t.additionalProperties === !1)
+    n.additionalProperties = !1;
   else {
-    const t = P(e.additionalProperties) ? e.additionalProperties : void 0, f = P(i.additionalProperties) ? i.additionalProperties : void 0;
-    t && f ? o.additionalProperties = v(
-      t,
+    const r = A(e.additionalProperties) ? e.additionalProperties : void 0, f = A(t.additionalProperties) ? t.additionalProperties : void 0;
+    r && f ? n.additionalProperties = M(
+      r,
       f,
-      r + 1
-    ) : t ? o.additionalProperties = t : f ? o.additionalProperties = f : (e.additionalProperties === !0 || i.additionalProperties === !0) && (o.additionalProperties = !0);
+      i + 1
+    ) : r ? n.additionalProperties = r : f ? n.additionalProperties = f : (e.additionalProperties === !0 || t.additionalProperties === !0) && (n.additionalProperties = !0);
   }
-  return u ? { type: u, ...o } : o;
+  return s ? { type: s, ...n } : n;
 }
-function C(e) {
+function T(e) {
   if (e.nullable) {
-    const r = { ...e };
-    delete r.oneOf, delete r.anyOf, delete r.allOf, delete r.nullable;
-    const n = { ...e };
-    return delete n.oneOf, delete n.anyOf, delete n.allOf, delete n.nullable, n.type = "null", [r, n];
+    const i = { ...e };
+    delete i.oneOf, delete i.anyOf, delete i.allOf, delete i.nullable;
+    const o = { ...e };
+    return delete o.oneOf, delete o.anyOf, delete o.allOf, delete o.nullable, o.type = "null", [i, o];
   }
   if (Array.isArray(e.type)) {
     if (e.type.length === 0) {
-      const r = { ...e };
-      return delete r.oneOf, delete r.anyOf, delete r.allOf, delete r.type, [r];
+      const i = { ...e };
+      return delete i.oneOf, delete i.anyOf, delete i.allOf, delete i.type, [i];
     }
-    return e.type.map((r) => {
-      const n = { ...e };
-      return delete n.oneOf, delete n.anyOf, delete n.allOf, n.type = r, n;
+    return e.type.map((i) => {
+      const o = { ...e };
+      return delete o.oneOf, delete o.anyOf, delete o.allOf, o.type = i, o;
     });
   }
-  const i = { ...e };
-  return delete i.oneOf, delete i.anyOf, delete i.allOf, [i];
+  const t = { ...e };
+  return delete t.oneOf, delete t.anyOf, delete t.allOf, [t];
 }
-function j(e, i) {
-  const r = "examples" in e ? e.examples : void 0, n = "examples" in i ? i.examples : void 0, l = (r == null ? void 0 : r[0]) !== void 0 ? r[0] : e.example, o = (n == null ? void 0 : n[0]) !== void 0 ? n[0] : i.example;
-  return l && o && typeof l == "object" && typeof o == "object" && !Array.isArray(l) && !Array.isArray(o) ? {
+function z(e, t) {
+  const i = "examples" in e ? e.examples : void 0, o = "examples" in t ? t.examples : void 0, l = (i == null ? void 0 : i[0]) !== void 0 ? i[0] : e.example, p = (o == null ? void 0 : o[0]) !== void 0 ? o[0] : t.example;
+  return l && p && typeof l == "object" && typeof p == "object" && !Array.isArray(l) && !Array.isArray(p) ? {
     ...l,
-    ...o
-  } : o !== void 0 ? o : l;
+    ...p
+  } : p !== void 0 ? p : l;
 }
-function q(e, i) {
-  return Math.abs(e * i) / A(e, i);
+function D(e, t) {
+  return Math.abs(e * t) / E(e, t);
 }
-function A(e, i) {
-  return i === 0 ? e : A(i, e % i);
+function E(e, t) {
+  return t === 0 ? e : E(t, e % t);
 }
 export {
-  k as reduceExpandedSchema
+  q as getCombinedDescription,
+  B as reduceExpandedSchema
 };