fumadocs-openapi 10.10.0 → 10.10.2

package/dist/utils/pages/preset-auto.d.ts

@@ -66,6 +66,5 @@ interface BaseConfig {
    */
   slugify?: (name: string) => string;
 }
-declare function createAutoPreset(options: SchemaToPagesOptions): PagesBuilderConfig;
 //#endregion
-export { SchemaToPagesOptions, createAutoPreset };
+export { SchemaToPagesOptions };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "fumadocs-openapi",
-  "version": "10.10.0",
+  "version": "10.10.2",
   "description": "Generate MDX docs for your OpenAPI spec",
   "keywords": [
     "Docs",
@@ -44,7 +44,6 @@
     "@radix-ui/react-accordion": "^1.2.12",
     "@radix-ui/react-dialog": "^1.1.15",
     "@radix-ui/react-select": "^2.2.6",
-    "@radix-ui/react-slot": "^1.2.4",
     "chokidar": "^5.0.0",
     "class-variance-authority": "^0.7.1",
     "github-slugger": "^2.0.0",
@@ -58,9 +57,9 @@
     "@fumari/stf": "1.0.5"
   },
   "devDependencies": {
+    "@apidevtools/json-schema-ref-parser": "^15.3.5",
     "@fastify/deepmerge": "^3.2.1",
     "@scalar/api-client-react": "2.0.20",
-    "@scalar/json-magic": "^0.12.14",
     "@scalar/openapi-upgrader": "^0.2.8",
     "@tailwindcss/oxide": "^4.3.0",
     "@types/js-yaml": "^4.0.9",
@@ -97,18 +96,15 @@
     }
   },
   "inlinedDependencies": {
+    "@apidevtools/json-schema-ref-parser": "15.3.5",
     "@fastify/deepmerge": "3.2.1",
-    "@scalar/helpers": "0.8.0",
-    "@scalar/json-magic": "0.12.14",
     "@scalar/openapi-upgrader": "0.2.8",
     "ajv": "8.20.0",
     "fast-content-type-parse": "3.0.0",
     "fast-deep-equal": "3.1.3",
     "fast-uri": "3.1.0",
     "json-schema-traverse": "1.0.0",
-    "pathe": "2.0.3",
-    "xml-js": "1.6.11",
-    "yaml": "2.9.0"
+    "xml-js": "1.6.11"
   },
   "scripts": {
     "build": "tsdown",

package/dist/node_modules/.pnpm/@scalar_helpers@0.8.0/node_modules/@scalar/helpers/dist/general/create-limiter.js

@@ -1,43 +0,0 @@
-import { Queue } from "../queue/queue.js";
-//#region ../../node_modules/.pnpm/@scalar+helpers@0.8.0/node_modules/@scalar/helpers/dist/general/create-limiter.js
-/**
-* Creates a function that limits the number of concurrent executions of async functions.
-*
-* @param maxConcurrent - Maximum number of concurrent executions allowed
-* @returns A function that wraps async functions to limit their concurrent execution
-*
-* @example
-* ```ts
-* const limiter = createLimiter(2) // Allow max 2 concurrent executions
-*
-* // These will run with max 2 at a time
-* const results = await Promise.all([
-*   limiter(() => fetch('/api/1')),
-*   limiter(() => fetch('/api/2')),
-*   limiter(() => fetch('/api/3')),
-*   limiter(() => fetch('/api/4'))
-* ])
-* ```
-*/
-function createLimiter(maxConcurrent) {
-	let activeCount = 0;
-	const queue = new Queue();
-	const next = () => {
-		if (queue.isEmpty() || activeCount >= maxConcurrent) return;
-		const resolve = queue.dequeue();
-		if (resolve) resolve();
-	};
-	const run = async (fn) => {
-		if (activeCount >= maxConcurrent) await new Promise((resolve) => queue.enqueue(resolve));
-		activeCount++;
-		try {
-			return await fn();
-		} finally {
-			activeCount--;
-			next();
-		}
-	};
-	return run;
-}
-//#endregion
-export { createLimiter };

package/dist/node_modules/.pnpm/@scalar_helpers@0.8.0/node_modules/@scalar/helpers/dist/object/is-object.js

@@ -1,27 +0,0 @@
-//#region ../../node_modules/.pnpm/@scalar+helpers@0.8.0/node_modules/@scalar/helpers/dist/object/is-object.js
-/**
-* Returns true if the provided value is a record object
-* (i.e. not null, not an array, and has an actual object as the prototype).
-*
-* Differs from the previous isObject in that it returns false for Date,
-* RegExp, Error, Map, Set, WeakMap, WeakSet, Promise, and other non-plain objects.
-*
-* | Value | Result |
-* | :--- | :--- |
-* | `isObject({})` | `true` |
-* | `isObject({ a: 1 })` | `true` |
-* | `isObject([])` | `false` (Array) |
-* | `isObject(null)` | `false` |
-* | `isObject(123)` | `false` |
-* | `isObject('string')` | `false` |
-* | `isObject(new Error('test'))` | `false` |
-* | `isObject(new Date())` | `false` |
-* | `isObject(Object.create(null))` | `true` |
-*/
-const isObject = (value) => {
-	if (value === null || typeof value !== "object") return false;
-	const proto = Object.getPrototypeOf(value);
-	return proto === Object.prototype || proto === null;
-};
-//#endregion
-export { isObject };

package/dist/node_modules/.pnpm/@scalar_helpers@0.8.0/node_modules/@scalar/helpers/dist/object/prevent-pollution.js

@@ -1,33 +0,0 @@
-//#region ../../node_modules/.pnpm/@scalar+helpers@0.8.0/node_modules/@scalar/helpers/dist/object/prevent-pollution.js
-/**
-* Set of dangerous keys that can be used for prototype pollution attacks.
-* These keys should never be used as property names in dynamic object operations.
-*/
-const PROTOTYPE_POLLUTION_KEYS = new Set([
-	"__proto__",
-	"prototype",
-	"constructor"
-]);
-/**
-* Validates that a key is safe to use and does not pose a prototype pollution risk.
-* Throws an error if a dangerous key is detected.
-*
-* @param key - The key to validate
-* @param context - Optional context string to help identify where the validation failed
-* @throws {Error} If the key matches a known prototype pollution vector
-*
-* @example
-* ```ts
-* preventPollution('__proto__') // throws Error
-* preventPollution('safeName') // passes
-* preventPollution('constructor', 'operation update') // throws Error with context
-* ```
-*/
-const preventPollution = (key, context) => {
-	if (PROTOTYPE_POLLUTION_KEYS.has(key)) {
-		const errorMessage = context ? `Prototype pollution key detected: "${key}" in ${context}` : `Prototype pollution key detected: "${key}"`;
-		throw new Error(errorMessage);
-	}
-};
-//#endregion
-export { preventPollution };

package/dist/node_modules/.pnpm/@scalar_helpers@0.8.0/node_modules/@scalar/helpers/dist/queue/queue.js

@@ -1,106 +0,0 @@
-//#region ../../node_modules/.pnpm/@scalar+helpers@0.8.0/node_modules/@scalar/helpers/dist/queue/queue.js
-/**
-* Represents a node in a singly linked list structure, used internally by the Queue.
-*
-* Example:
-*   const node = new Node<number>(42);
-*   console.log(node.data); // 42
-*   console.log(node.next); // null
-*/
-var Node = class {
-	data;
-	next;
-	constructor(data) {
-		this.data = data;
-		this.next = null;
-	}
-};
-/**
-* A generic queue implementation using a singly linked list.
-*
-* Example usage:
-*
-*   const q = new Queue<number>();
-*   q.enqueue(1);
-*   q.enqueue(2);
-*   q.enqueue(3);
-*   console.log(q.dequeue()); // 1
-*   console.log(q.peek());    // 2
-*   console.log(q.getSize()); // 2
-*   console.log(q.toString()); // "2 -> 3"
-*   console.log(q.isEmpty()); // false
-*/
-var Queue = class {
-	front;
-	rear;
-	size;
-	constructor() {
-		this.front = null;
-		this.rear = null;
-		this.size = 0;
-	}
-	/**
-	* Adds an element to the end of the queue.
-	* @param data - The data to add to the queue.
-	*/
-	enqueue(data) {
-		const newNode = new Node(data);
-		if (this.isEmpty() || !this.rear) {
-			this.front = newNode;
-			this.rear = newNode;
-		} else {
-			this.rear.next = newNode;
-			this.rear = newNode;
-		}
-		this.size++;
-	}
-	/**
-	* Removes and returns the front element of the queue.
-	* @returns The data from the removed node, or null if the queue is empty.
-	*/
-	dequeue() {
-		if (this.isEmpty() || !this.front) return null;
-		const removedNode = this.front;
-		this.front = this.front.next;
-		if (this.front === null) this.rear = null;
-		this.size--;
-		return removedNode.data;
-	}
-	/**
-	* Returns the front element of the queue without removing it.
-	* @returns The front data, or null if the queue is empty.
-	*/
-	peek() {
-		if (this.isEmpty() || !this.front) return null;
-		return this.front.data;
-	}
-	/**
-	* Checks whether the queue is empty.
-	* @returns True if the queue has no elements, false otherwise.
-	*/
-	isEmpty() {
-		return this.size === 0;
-	}
-	/**
-	* Returns the number of elements in the queue.
-	* @returns The size of the queue.
-	*/
-	getSize() {
-		return this.size;
-	}
-	/**
-	* Returns a string representation of the queue.
-	* @returns Elements of the queue separated by ' -> '.
-	*/
-	toString() {
-		let current = this.front;
-		const elements = [];
-		while (current) {
-			elements.push(current.data);
-			current = current.next;
-		}
-		return elements.join(" -> ");
-	}
-};
-//#endregion
-export { Queue };

package/dist/node_modules/.pnpm/@scalar_helpers@0.8.0/node_modules/@scalar/helpers/dist/string/generate-hash.js

@@ -1,120 +0,0 @@
-//#region ../../node_modules/.pnpm/@scalar+helpers@0.8.0/node_modules/@scalar/helpers/dist/string/generate-hash.js
-/**
-* MurmurHash3 implementation
-*
-* Generate a hash from a string using the MurmurHash3 algorithm
-* Provides 64-bit hash output with excellent speed and distribution
-*
-* We had to move away from xxhash-wasm since it was causing issues with content security policy (CSP) violations.
-*
-* We cannot use crypto.subtle because it is only available in secure contexts (HTTPS) or on localhost.
-*
-* @param input - The string to hash
-* @returns The 64-bit hash of the input string as a 16-character hex string
-*/
-const generateHash = (input) => {
-	const seed = 0;
-	let h1 = seed;
-	let h2 = seed;
-	const len = input.length;
-	const remainder = len & 15;
-	const bytes = len - remainder;
-	const c1 = 2277735313;
-	const c2 = 1291169091;
-	const c3 = 1390208809;
-	const c4 = 944331445;
-	for (let i = 0; i < bytes; i += 16) {
-		let k1 = input.charCodeAt(i) & 255 | (input.charCodeAt(i + 1) & 255) << 8 | (input.charCodeAt(i + 2) & 255) << 16 | (input.charCodeAt(i + 3) & 255) << 24;
-		let k2 = input.charCodeAt(i + 4) & 255 | (input.charCodeAt(i + 5) & 255) << 8 | (input.charCodeAt(i + 6) & 255) << 16 | (input.charCodeAt(i + 7) & 255) << 24;
-		let k3 = input.charCodeAt(i + 8) & 255 | (input.charCodeAt(i + 9) & 255) << 8 | (input.charCodeAt(i + 10) & 255) << 16 | (input.charCodeAt(i + 11) & 255) << 24;
-		let k4 = input.charCodeAt(i + 12) & 255 | (input.charCodeAt(i + 13) & 255) << 8 | (input.charCodeAt(i + 14) & 255) << 16 | (input.charCodeAt(i + 15) & 255) << 24;
-		k1 = Math.imul(k1, c1);
-		k1 = k1 << 15 | k1 >>> 17;
-		k1 = Math.imul(k1, c2);
-		h1 ^= k1;
-		h1 = h1 << 13 | h1 >>> 19;
-		h1 = Math.imul(h1, 5) + 3864292196;
-		k2 = Math.imul(k2, c2);
-		k2 = k2 << 16 | k2 >>> 16;
-		k2 = Math.imul(k2, c3);
-		h2 ^= k2;
-		h2 = h2 << 17 | h2 >>> 15;
-		h2 = Math.imul(h2, 5) + 461845907;
-		k3 = Math.imul(k3, c3);
-		k3 = k3 << 17 | k3 >>> 15;
-		k3 = Math.imul(k3, c4);
-		h1 ^= k3;
-		h1 = h1 << 15 | h1 >>> 17;
-		h1 = Math.imul(h1, 5) + 1390208809;
-		k4 = Math.imul(k4, c4);
-		k4 = k4 << 18 | k4 >>> 14;
-		k4 = Math.imul(k4, c1);
-		h2 ^= k4;
-		h2 = h2 << 13 | h2 >>> 19;
-		h2 = Math.imul(h2, 5) + 944331445;
-	}
-	if (remainder > 0) {
-		let k1 = 0;
-		let k2 = 0;
-		let k3 = 0;
-		let k4 = 0;
-		if (remainder >= 15) k4 ^= (input.charCodeAt(bytes + 14) & 255) << 16;
-		if (remainder >= 14) k4 ^= (input.charCodeAt(bytes + 13) & 255) << 8;
-		if (remainder >= 13) {
-			k4 ^= input.charCodeAt(bytes + 12) & 255;
-			k4 = Math.imul(k4, c4);
-			k4 = k4 << 18 | k4 >>> 14;
-			k4 = Math.imul(k4, c1);
-			h2 ^= k4;
-		}
-		if (remainder >= 12) k3 ^= (input.charCodeAt(bytes + 11) & 255) << 24;
-		if (remainder >= 11) k3 ^= (input.charCodeAt(bytes + 10) & 255) << 16;
-		if (remainder >= 10) k3 ^= (input.charCodeAt(bytes + 9) & 255) << 8;
-		if (remainder >= 9) {
-			k3 ^= input.charCodeAt(bytes + 8) & 255;
-			k3 = Math.imul(k3, c3);
-			k3 = k3 << 17 | k3 >>> 15;
-			k3 = Math.imul(k3, c4);
-			h1 ^= k3;
-		}
-		if (remainder >= 8) k2 ^= (input.charCodeAt(bytes + 7) & 255) << 24;
-		if (remainder >= 7) k2 ^= (input.charCodeAt(bytes + 6) & 255) << 16;
-		if (remainder >= 6) k2 ^= (input.charCodeAt(bytes + 5) & 255) << 8;
-		if (remainder >= 5) {
-			k2 ^= input.charCodeAt(bytes + 4) & 255;
-			k2 = Math.imul(k2, c2);
-			k2 = k2 << 16 | k2 >>> 16;
-			k2 = Math.imul(k2, c3);
-			h2 ^= k2;
-		}
-		if (remainder >= 4) k1 ^= (input.charCodeAt(bytes + 3) & 255) << 24;
-		if (remainder >= 3) k1 ^= (input.charCodeAt(bytes + 2) & 255) << 16;
-		if (remainder >= 2) k1 ^= (input.charCodeAt(bytes + 1) & 255) << 8;
-		if (remainder >= 1) {
-			k1 ^= input.charCodeAt(bytes) & 255;
-			k1 = Math.imul(k1, c1);
-			k1 = k1 << 15 | k1 >>> 17;
-			k1 = Math.imul(k1, c2);
-			h1 ^= k1;
-		}
-	}
-	h1 ^= len;
-	h2 ^= len;
-	h1 += h2;
-	h2 += h1;
-	h1 ^= h1 >>> 16;
-	h1 = Math.imul(h1, 2246822507);
-	h1 ^= h1 >>> 13;
-	h1 = Math.imul(h1, 3266489909);
-	h1 ^= h1 >>> 16;
-	h2 ^= h2 >>> 16;
-	h2 = Math.imul(h2, 2246822507);
-	h2 ^= h2 >>> 13;
-	h2 = Math.imul(h2, 3266489909);
-	h2 ^= h2 >>> 16;
-	h1 += h2;
-	h2 += h1;
-	return (h1 >>> 0).toString(16).padStart(8, "0") + (h2 >>> 0).toString(16).padStart(8, "0");
-};
-//#endregion
-export { generateHash };