@nocobase/plugin-idp-oauth 2.3.0-beta.12 → 2.3.0-beta.14

package/dist/node_modules/quick-lru/index.d.ts

@@ -1,178 +0,0 @@
-export type Options<KeyType, ValueType> = {
-	/**
-	The maximum number of milliseconds an item should remain in the cache.
-
-	@default Infinity
-
-	By default, `maxAge` will be `Infinity`, which means that items will never expire.
-	Lazy expiration occurs upon the next write or read call.
-
-	Individual expiration of an item can be specified with the `set(key, value, {maxAge})` method.
-	*/
-	readonly maxAge?: number;
-
-	/**
-	The target maximum number of items before evicting the least recently used items.
-
-	__Note:__ This package uses an [algorithm](https://github.com/sindresorhus/quick-lru#algorithm) which maintains between `maxSize` and `2 × maxSize` items for performance reasons. The cache may temporarily contain up to twice the specified size due to the dual-cache design that avoids expensive delete operations.
-	*/
-	readonly maxSize: number;
-
-	/**
-	Called right before an item is evicted from the cache due to LRU pressure, TTL expiration, or manual eviction via `evict()`.
-
-	Useful for side effects or for items like object URLs that need explicit cleanup (`revokeObjectURL`).
-
-	__Note:__ This callback is not called for manual removals via `delete()` or `clear()`. It fires for automatic evictions and manual evictions via `evict()`.
-	*/
-	onEviction?: (key: KeyType, value: ValueType) => void;
-};
-
-// eslint-disable-next-line @typescript-eslint/naming-convention
-export default class QuickLRU<KeyType, ValueType> extends Map<KeyType, ValueType> implements Iterable<[KeyType, ValueType]> {
-	/**
-	Simple ["Least Recently Used" (LRU) cache](https://en.m.wikipedia.org/wiki/Cache_replacement_policies#Least_Recently_Used_.28LRU.29).
-
-	The instance is an [`Iterable`](https://developer.mozilla.org/en/docs/Web/JavaScript/Reference/Iteration_protocols) of `[key, value]` pairs so you can use it directly in a [`for…of`](https://developer.mozilla.org/en/docs/Web/JavaScript/Reference/Statements/for...of) loop.
-
-	@example
-	```
-	import QuickLRU from 'quick-lru';
-
-	const lru = new QuickLRU({maxSize: 1000});
-
-	lru.set('🦄', '🌈');
-
-	lru.has('🦄');
-	//=> true
-
-	lru.get('🦄');
-	//=> '🌈'
-	```
-	*/
-	constructor(options: Options<KeyType, ValueType>);
-
-	[Symbol.iterator](): IterableIterator<[KeyType, ValueType]>;
-
-	/**
-	Set an item. Returns the instance.
-
-	Individual expiration of an item can be specified with the `maxAge` option. If not specified, the global `maxAge` value will be used in case it is specified in the constructor; otherwise the item will never expire.
-
-	@returns The cache instance.
-	*/
-	set(key: KeyType, value: ValueType, options?: {maxAge?: number}): this;
-
-	/**
-	Get an item.
-
-	@returns The stored item or `undefined`.
-	*/
-	get(key: KeyType): ValueType | undefined;
-
-	/**
-	Check if an item exists.
-	*/
-	has(key: KeyType): boolean;
-
-	/**
-	Get an item without marking it as recently used.
-
-	@returns The stored item or `undefined`.
-	*/
-	peek(key: KeyType): ValueType | undefined;
-
-	/**
-	Delete an item.
-
-	@returns `true` if the item is removed or `false` if the item doesn't exist.
-	*/
-	delete(key: KeyType): boolean;
-
-	/**
-	Delete all items.
-	*/
-	clear(): void;
-
-	/**
-	Get the remaining time to live (in milliseconds) for the given item, or `undefined` when the item is not in the cache.
-
-	- Does not mark the item as recently used.
-	- Does not trigger lazy expiration or remove the entry when it is expired.
-	- Returns `Infinity` if the item has no expiration.
-	- May return a negative number if the item is already expired but not yet lazily removed.
-
-	@returns Remaining time to live in milliseconds when set, `Infinity` when there is no expiration, or `undefined` when the item does not exist.
-	*/
-	expiresIn(key: KeyType): number | undefined;
-
-	/**
-	Update the `maxSize` in-place, discarding items as necessary. Insertion order is mostly preserved, though this is not a strong guarantee.
-
-	Useful for on-the-fly tuning of cache sizes in live systems.
-	*/
-	resize(maxSize: number): void;
-
-	/**
-	The stored item count.
-	*/
-	get size(): number;
-
-	/**
-	The set max size.
-	*/
-	get maxSize(): number;
-
-	/**
-	The set max age.
-	*/
-	get maxAge(): number;
-
-	/**
-	Iterable for all the keys.
-	*/
-	keys(): IterableIterator<KeyType>;
-
-	/**
-	Iterable for all the values.
-	*/
-	values(): IterableIterator<ValueType>;
-
-	/**
-	Iterable for all entries, starting with the oldest (ascending in recency).
-	*/
-	entriesAscending(): IterableIterator<[KeyType, ValueType]>;
-
-	/**
-	Iterable for all entries, starting with the newest (descending in recency).
-	*/
-	entriesDescending(): IterableIterator<[KeyType, ValueType]>;
-
-	/**
-	Evict the least recently used items from the cache.
-
-	@param count - The number of items to evict. Defaults to 1.
-
-	It will always keep at least one item in the cache.
-
-	@example
-	```
-	import QuickLRU from 'quick-lru';
-
-	const lru = new QuickLRU({maxSize: 10});
-
-	lru.set('a', 1);
-	lru.set('b', 2);
-	lru.set('c', 3);
-
-	lru.evict(2); // Evicts 'a' and 'b'
-
-	console.log(lru.has('a'));
-	//=> false
-
-	console.log(lru.has('c'));
-	//=> true
-	```
-	*/
-	evict(count?: number): void;
-}

package/dist/node_modules/quick-lru/index.js

@@ -1,329 +0,0 @@
-export default class QuickLRU extends Map {
-	#size = 0;
-	#cache = new Map();
-	#oldCache = new Map();
-	#maxSize;
-	#maxAge;
-	#onEviction;
-
-	constructor(options = {}) {
-		super();
-
-		if (!(options.maxSize && options.maxSize > 0)) {
-			throw new TypeError('`maxSize` must be a number greater than 0');
-		}
-
-		if (typeof options.maxAge === 'number' && options.maxAge === 0) {
-			throw new TypeError('`maxAge` must be a number greater than 0');
-		}
-
-		this.#maxSize = options.maxSize;
-		this.#maxAge = options.maxAge || Number.POSITIVE_INFINITY;
-		this.#onEviction = options.onEviction;
-	}
-
-	// For tests.
-	get __oldCache() {
-		return this.#oldCache;
-	}
-
-	#emitEvictions(cache) {
-		if (typeof this.#onEviction !== 'function') {
-			return;
-		}
-
-		for (const [key, item] of cache) {
-			this.#onEviction(key, item.value);
-		}
-	}
-
-	#deleteIfExpired(key, item) {
-		if (typeof item.expiry === 'number' && item.expiry <= Date.now()) {
-			if (typeof this.#onEviction === 'function') {
-				this.#onEviction(key, item.value);
-			}
-
-			return this.delete(key);
-		}
-
-		return false;
-	}
-
-	#getOrDeleteIfExpired(key, item) {
-		const deleted = this.#deleteIfExpired(key, item);
-		if (deleted === false) {
-			return item.value;
-		}
-	}
-
-	#getItemValue(key, item) {
-		return item.expiry ? this.#getOrDeleteIfExpired(key, item) : item.value;
-	}
-
-	#peek(key, cache) {
-		const item = cache.get(key);
-		return this.#getItemValue(key, item);
-	}
-
-	#set(key, value) {
-		this.#cache.set(key, value);
-		this.#size++;
-
-		if (this.#size >= this.#maxSize) {
-			this.#size = 0;
-			this.#emitEvictions(this.#oldCache);
-			this.#oldCache = this.#cache;
-			this.#cache = new Map();
-		}
-	}
-
-	#moveToRecent(key, item) {
-		this.#oldCache.delete(key);
-		this.#set(key, item);
-	}
-
-	* #entriesAscending() {
-		for (const item of this.#oldCache) {
-			const [key, value] = item;
-			if (!this.#cache.has(key)) {
-				const deleted = this.#deleteIfExpired(key, value);
-				if (deleted === false) {
-					yield item;
-				}
-			}
-		}
-
-		for (const item of this.#cache) {
-			const [key, value] = item;
-			const deleted = this.#deleteIfExpired(key, value);
-			if (deleted === false) {
-				yield item;
-			}
-		}
-	}
-
-	get(key) {
-		if (this.#cache.has(key)) {
-			const item = this.#cache.get(key);
-			return this.#getItemValue(key, item);
-		}
-
-		if (this.#oldCache.has(key)) {
-			const item = this.#oldCache.get(key);
-			if (this.#deleteIfExpired(key, item) === false) {
-				this.#moveToRecent(key, item);
-				return item.value;
-			}
-		}
-	}
-
-	set(key, value, {maxAge = this.#maxAge} = {}) {
-		const expiry = typeof maxAge === 'number' && maxAge !== Number.POSITIVE_INFINITY
-			? (Date.now() + maxAge)
-			: undefined;
-
-		if (this.#cache.has(key)) {
-			this.#cache.set(key, {
-				value,
-				expiry,
-			});
-		} else {
-			this.#set(key, {value, expiry});
-		}
-
-		return this;
-	}
-
-	has(key) {
-		if (this.#cache.has(key)) {
-			return !this.#deleteIfExpired(key, this.#cache.get(key));
-		}
-
-		if (this.#oldCache.has(key)) {
-			return !this.#deleteIfExpired(key, this.#oldCache.get(key));
-		}
-
-		return false;
-	}
-
-	peek(key) {
-		if (this.#cache.has(key)) {
-			return this.#peek(key, this.#cache);
-		}
-
-		if (this.#oldCache.has(key)) {
-			return this.#peek(key, this.#oldCache);
-		}
-	}
-
-	expiresIn(key) {
-		const item = this.#cache.get(key) ?? this.#oldCache.get(key);
-		if (item) {
-			return item.expiry ? item.expiry - Date.now() : Number.POSITIVE_INFINITY;
-		}
-	}
-
-	delete(key) {
-		const deleted = this.#cache.delete(key);
-		if (deleted) {
-			this.#size--;
-		}
-
-		return this.#oldCache.delete(key) || deleted;
-	}
-
-	clear() {
-		this.#cache.clear();
-		this.#oldCache.clear();
-		this.#size = 0;
-	}
-
-	resize(newSize) {
-		if (!(newSize && newSize > 0)) {
-			throw new TypeError('`maxSize` must be a number greater than 0');
-		}
-
-		const items = [...this.#entriesAscending()];
-		const removeCount = items.length - newSize;
-		if (removeCount < 0) {
-			this.#cache = new Map(items);
-			this.#oldCache = new Map();
-			this.#size = items.length;
-		} else {
-			if (removeCount > 0) {
-				this.#emitEvictions(items.slice(0, removeCount));
-			}
-
-			this.#oldCache = new Map(items.slice(removeCount));
-			this.#cache = new Map();
-			this.#size = 0;
-		}
-
-		this.#maxSize = newSize;
-	}
-
-	evict(count = 1) {
-		const requested = Number(count);
-		if (!requested || requested <= 0) {
-			return;
-		}
-
-		const items = [...this.#entriesAscending()];
-		const evictCount = Math.trunc(Math.min(requested, Math.max(items.length - 1, 0)));
-		if (evictCount <= 0) {
-			return;
-		}
-
-		this.#emitEvictions(items.slice(0, evictCount));
-		this.#oldCache = new Map(items.slice(evictCount));
-		this.#cache = new Map();
-		this.#size = 0;
-	}
-
-	* keys() {
-		for (const [key] of this) {
-			yield key;
-		}
-	}
-
-	* values() {
-		for (const [, value] of this) {
-			yield value;
-		}
-	}
-
-	* [Symbol.iterator]() {
-		for (const item of this.#cache) {
-			const [key, value] = item;
-			const deleted = this.#deleteIfExpired(key, value);
-			if (deleted === false) {
-				yield [key, value.value];
-			}
-		}
-
-		for (const item of this.#oldCache) {
-			const [key, value] = item;
-			if (!this.#cache.has(key)) {
-				const deleted = this.#deleteIfExpired(key, value);
-				if (deleted === false) {
-					yield [key, value.value];
-				}
-			}
-		}
-	}
-
-	* entriesDescending() {
-		let items = [...this.#cache];
-		for (let i = items.length - 1; i >= 0; --i) {
-			const item = items[i];
-			const [key, value] = item;
-			const deleted = this.#deleteIfExpired(key, value);
-			if (deleted === false) {
-				yield [key, value.value];
-			}
-		}
-
-		items = [...this.#oldCache];
-		for (let i = items.length - 1; i >= 0; --i) {
-			const item = items[i];
-			const [key, value] = item;
-			if (!this.#cache.has(key)) {
-				const deleted = this.#deleteIfExpired(key, value);
-				if (deleted === false) {
-					yield [key, value.value];
-				}
-			}
-		}
-	}
-
-	* entriesAscending() {
-		for (const [key, value] of this.#entriesAscending()) {
-			yield [key, value.value];
-		}
-	}
-
-	get size() {
-		if (!this.#size) {
-			return this.#oldCache.size;
-		}
-
-		let oldCacheSize = 0;
-		for (const key of this.#oldCache.keys()) {
-			if (!this.#cache.has(key)) {
-				oldCacheSize++;
-			}
-		}
-
-		return Math.min(this.#size + oldCacheSize, this.#maxSize);
-	}
-
-	get maxSize() {
-		return this.#maxSize;
-	}
-
-	get maxAge() {
-		return this.#maxAge;
-	}
-
-	entries() {
-		return this.entriesAscending();
-	}
-
-	forEach(callbackFunction, thisArgument = this) {
-		for (const [key, value] of this.entriesAscending()) {
-			callbackFunction.call(thisArgument, value, key, this);
-		}
-	}
-
-	get [Symbol.toStringTag]() {
-		return 'QuickLRU';
-	}
-
-	toString() {
-		return `QuickLRU(${this.size}/${this.maxSize})`;
-	}
-
-	[Symbol.for('nodejs.util.inspect.custom')]() {
-		return this.toString();
-	}
-}

package/dist/node_modules/quick-lru/license

@@ -1,9 +0,0 @@
-MIT License
-
-Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
-
-Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

package/dist/node_modules/quick-lru/package.json

@@ -1,54 +0,0 @@
-{
-	"name": "quick-lru",
-	"version": "7.3.0",
-	"description": "Simple “Least Recently Used” (LRU) cache",
-	"license": "MIT",
-	"repository": "sindresorhus/quick-lru",
-	"funding": "https://github.com/sponsors/sindresorhus",
-	"author": {
-		"name": "Sindre Sorhus",
-		"email": "sindresorhus@gmail.com",
-		"url": "https://sindresorhus.com"
-	},
-	"type": "module",
-	"exports": {
-		"types": "./index.d.ts",
-		"default": "./index.js"
-	},
-	"sideEffects": false,
-	"engines": {
-		"node": ">=18"
-	},
-	"scripts": {
-		"test": "xo && nyc ava && tsd"
-	},
-	"files": [
-		"index.js",
-		"index.d.ts"
-	],
-	"keywords": [
-		"lru",
-		"quick",
-		"cache",
-		"caching",
-		"least",
-		"recently",
-		"used",
-		"fast",
-		"map",
-		"hash",
-		"buffer"
-	],
-	"devDependencies": {
-		"ava": "^5.3.1",
-		"nyc": "^15.1.0",
-		"tsd": "^0.29.0",
-		"xo": "^0.56.0"
-	},
-	"nyc": {
-		"reporter": [
-			"text",
-			"lcov"
-		]
-	}
-}