fast-map-cache 1.0.1

package/dist/main.js

@@ -0,0 +1,376 @@
+//#region rolldown:runtime
+var __create = Object.create;
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __getProtoOf = Object.getPrototypeOf;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __commonJS = (cb, mod) => function() {
+	return mod || (0, cb[__getOwnPropNames(cb)[0]])((mod = { exports: {} }).exports, mod), mod.exports;
+};
+var __copyProps = (to, from, except, desc) => {
+	if (from && typeof from === "object" || typeof from === "function") for (var keys = __getOwnPropNames(from), i = 0, n = keys.length, key; i < n; i++) {
+		key = keys[i];
+		if (!__hasOwnProp.call(to, key) && key !== except) __defProp(to, key, {
+			get: ((k) => from[k]).bind(null, key),
+			enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable
+		});
+	}
+	return to;
+};
+var __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__getProtoOf(mod)) : {}, __copyProps(isNodeMode || !mod || !mod.__esModule ? __defProp(target, "default", {
+	value: mod,
+	enumerable: true
+}) : target, mod));
+
+//#endregion
+
+//#region node_modules/.pnpm/@oxc-project+runtime@0.72.3/node_modules/@oxc-project/runtime/src/helpers/typeof.js
+var require_typeof = __commonJS({ "node_modules/.pnpm/@oxc-project+runtime@0.72.3/node_modules/@oxc-project/runtime/src/helpers/typeof.js"(exports, module) {
+	function _typeof$2(o) {
+		"@babel/helpers - typeof";
+		return module.exports = _typeof$2 = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function(o$1) {
+			return typeof o$1;
+		} : function(o$1) {
+			return o$1 && "function" == typeof Symbol && o$1.constructor === Symbol && o$1 !== Symbol.prototype ? "symbol" : typeof o$1;
+		}, module.exports.__esModule = true, module.exports["default"] = module.exports, _typeof$2(o);
+	}
+	module.exports = _typeof$2, module.exports.__esModule = true, module.exports["default"] = module.exports;
+} });
+
+//#endregion
+//#region node_modules/.pnpm/@oxc-project+runtime@0.72.3/node_modules/@oxc-project/runtime/src/helpers/toPrimitive.js
+var require_toPrimitive = __commonJS({ "node_modules/.pnpm/@oxc-project+runtime@0.72.3/node_modules/@oxc-project/runtime/src/helpers/toPrimitive.js"(exports, module) {
+	var _typeof$1 = require_typeof()["default"];
+	function toPrimitive$1(t, r) {
+		if ("object" != _typeof$1(t) || !t) return t;
+		var e = t[Symbol.toPrimitive];
+		if (void 0 !== e) {
+			var i = e.call(t, r || "default");
+			if ("object" != _typeof$1(i)) return i;
+			throw new TypeError("@@toPrimitive must return a primitive value.");
+		}
+		return ("string" === r ? String : Number)(t);
+	}
+	module.exports = toPrimitive$1, module.exports.__esModule = true, module.exports["default"] = module.exports;
+} });
+
+//#endregion
+//#region node_modules/.pnpm/@oxc-project+runtime@0.72.3/node_modules/@oxc-project/runtime/src/helpers/toPropertyKey.js
+var require_toPropertyKey = __commonJS({ "node_modules/.pnpm/@oxc-project+runtime@0.72.3/node_modules/@oxc-project/runtime/src/helpers/toPropertyKey.js"(exports, module) {
+	var _typeof = require_typeof()["default"];
+	var toPrimitive = require_toPrimitive();
+	function toPropertyKey$1(t) {
+		var i = toPrimitive(t, "string");
+		return "symbol" == _typeof(i) ? i : i + "";
+	}
+	module.exports = toPropertyKey$1, module.exports.__esModule = true, module.exports["default"] = module.exports;
+} });
+
+//#endregion
+//#region node_modules/.pnpm/@oxc-project+runtime@0.72.3/node_modules/@oxc-project/runtime/src/helpers/defineProperty.js
+var require_defineProperty = __commonJS({ "node_modules/.pnpm/@oxc-project+runtime@0.72.3/node_modules/@oxc-project/runtime/src/helpers/defineProperty.js"(exports, module) {
+	var toPropertyKey = require_toPropertyKey();
+	function _defineProperty$2(e, r, t) {
+		return (r = toPropertyKey(r)) in e ? Object.defineProperty(e, r, {
+			value: t,
+			enumerable: !0,
+			configurable: !0,
+			writable: !0
+		}) : e[r] = t, e;
+	}
+	module.exports = _defineProperty$2, module.exports.__esModule = true, module.exports["default"] = module.exports;
+} });
+
+//#endregion
+//#region src/fast-cache.ts
+var import_defineProperty$1 = __toESM(require_defineProperty());
+/**
+* 高性能 LRU 缓存实现
+* 使用 Map + 双向链表实现 O(1) 复杂度的所有操作
+*/
+var FastCache = class {
+	constructor(maxSize) {
+		(0, import_defineProperty$1.default)(this, "cache", void 0);
+		(0, import_defineProperty$1.default)(this, "head", void 0);
+		(0, import_defineProperty$1.default)(this, "tail", void 0);
+		(0, import_defineProperty$1.default)(this, "maxSize", void 0);
+		(0, import_defineProperty$1.default)(this, "hits", 0);
+		(0, import_defineProperty$1.default)(this, "misses", 0);
+		if (maxSize <= 0) throw new Error("Cache size must be positive");
+		this.maxSize = maxSize;
+		this.cache = /* @__PURE__ */ new Map();
+		this.head = {};
+		this.tail = {};
+		this.head.next = this.tail;
+		this.tail.prev = this.head;
+	}
+	get(key) {
+		const node = this.cache.get(key);
+		if (node === void 0) {
+			this.misses++;
+			return void 0;
+		}
+		this.moveToHead(node);
+		this.hits++;
+		return node.value;
+	}
+	set(key, value) {
+		const existingNode = this.cache.get(key);
+		if (existingNode !== void 0) {
+			existingNode.value = value;
+			this.moveToHead(existingNode);
+			return;
+		}
+		const newNode = {
+			key,
+			value,
+			prev: null,
+			next: null
+		};
+		if (this.cache.size >= this.maxSize) this.removeTail();
+		this.cache.set(key, newNode);
+		this.addToHead(newNode);
+	}
+	delete(key) {
+		const node = this.cache.get(key);
+		if (node === void 0) return false;
+		this.cache.delete(key);
+		this.removeNode(node);
+		return true;
+	}
+	clear() {
+		this.cache.clear();
+		this.head.next = this.tail;
+		this.tail.prev = this.head;
+		this.hits = 0;
+		this.misses = 0;
+	}
+	has(key) {
+		return this.cache.has(key);
+	}
+	get size() {
+		return this.cache.size;
+	}
+	get capacity() {
+		return this.maxSize;
+	}
+	setMany(entries) {
+		for (const [key, value] of entries) this.set(key, value);
+	}
+	getMany(keys) {
+		const result = /* @__PURE__ */ new Map();
+		for (const key of keys) {
+			const value = this.get(key);
+			if (value !== void 0) result.set(key, value);
+		}
+		return result;
+	}
+	getStats() {
+		const total = this.hits + this.misses;
+		return {
+			hits: this.hits,
+			misses: this.misses,
+			hitRate: total > 0 ? this.hits / total : 0,
+			size: this.size,
+			capacity: this.capacity
+		};
+	}
+	addToHead(node) {
+		node.prev = this.head;
+		node.next = this.head.next;
+		this.head.next.prev = node;
+		this.head.next = node;
+	}
+	removeNode(node) {
+		if (node.prev) node.prev.next = node.next;
+		if (node.next) node.next.prev = node.prev;
+	}
+	moveToHead(node) {
+		this.removeNode(node);
+		this.addToHead(node);
+	}
+	removeTail() {
+		const lastNode = this.tail.prev;
+		if (lastNode && lastNode !== this.head) {
+			this.cache.delete(lastNode.key);
+			this.removeNode(lastNode);
+		}
+	}
+};
+
+//#endregion
+//#region src/fast-cache-ttl.ts
+var import_defineProperty = __toESM(require_defineProperty());
+/**
+* 带 TTL (Time To Live) 支持的高性能缓存实现。
+* 继承自 FastCache，并增加了一个按时间排序的独立链表，
+* 以实现 O(M) 复杂度的过期项目清理（M 为过期数量）。
+*
+* @important 在 Node.js 环境下使用 `autoCleanup: true` 时，
+* 必须在程序退出前手动调用 `destroy()` 方法来清理定时器，
+* 否则定时器会阻止 Node.js 进程正常退出。
+*/
+var FastCacheWithTTL = class extends FastCache {
+	constructor(options) {
+		super(options.maxSize);
+		(0, import_defineProperty.default)(this, "ttl", void 0);
+		(0, import_defineProperty.default)(this, "autoCleanup", void 0);
+		(0, import_defineProperty.default)(this, "cleanupTimer", void 0);
+		(0, import_defineProperty.default)(this, "timeHead", void 0);
+		(0, import_defineProperty.default)(this, "timeTail", void 0);
+		(0, import_defineProperty.default)(this, "expired", 0);
+		if (options.ttl !== void 0 && options.ttl <= 0) throw new Error("TTL must be positive");
+		this.ttl = options.ttl ?? 0;
+		this.autoCleanup = options.autoCleanup ?? false;
+		this.timeHead = {};
+		this.timeTail = {};
+		this.timeHead.timeNext = this.timeTail;
+		this.timeTail.timePrev = this.timeHead;
+		if (this.autoCleanup && this.ttl > 0) {
+			const cleanupInterval = options.cleanupInterval ?? this.ttl;
+			this.cleanupTimer = setInterval(() => this.cleanup(), cleanupInterval);
+		}
+	}
+	get(key) {
+		const node = this.cache.get(key);
+		if (node === void 0) {
+			this.misses++;
+			return void 0;
+		}
+		if (this.isExpired(node)) {
+			this.delete(key);
+			this.expired++;
+			this.misses++;
+			return void 0;
+		}
+		return super.get(key);
+	}
+	set(key, value) {
+		const existingNode = this.cache.get(key);
+		const now = this.ttl > 0 ? Date.now() : 0;
+		super.set(key, value);
+		const node = this.cache.get(key);
+		node.timestamp = now;
+		if (existingNode) this._moveToTimeListTail(node);
+		else this._addToTimeListTail(node);
+	}
+	delete(key) {
+		const node = this.cache.get(key);
+		if (node === void 0) return false;
+		this._removeFromTimeList(node);
+		return super.delete(key);
+	}
+	clear() {
+		super.clear();
+		this.timeHead.timeNext = this.timeTail;
+		this.timeTail.timePrev = this.timeHead;
+		this.expired = 0;
+	}
+	has(key) {
+		const node = this.cache.get(key);
+		if (node === void 0) return false;
+		if (this.isExpired(node)) {
+			this.delete(key);
+			this.expired++;
+			return false;
+		}
+		return true;
+	}
+	get size() {
+		return this.cache.size;
+	}
+	get capacity() {
+		return this.maxSize;
+	}
+	setMany(entries) {
+		for (const [key, value] of entries) this.set(key, value);
+	}
+	getMany(keys) {
+		const result = /* @__PURE__ */ new Map();
+		for (const key of keys) {
+			const value = this.get(key);
+			if (value !== void 0) result.set(key, value);
+		}
+		return result;
+	}
+	getStats() {
+		const stats = super.getStats();
+		return {
+			...stats,
+			expired: this.expired
+		};
+	}
+	cleanup() {
+		if (this.ttl === 0) return 0;
+		let removedCount = 0;
+		const now = Date.now();
+		let currentNode = this.timeHead.timeNext;
+		while (currentNode && currentNode !== this.timeTail) if (this.isExpired(currentNode, now)) {
+			this.delete(currentNode.key);
+			removedCount++;
+			this.expired++;
+			currentNode = this.timeHead.timeNext;
+		} else break;
+		return removedCount;
+	}
+	/**
+	* 清理定时器，防止在 Node.js 环境中进程无法正常退出。
+	* 如果开启了 `autoCleanup`，你应当在应用关闭前调用此方法。
+	*/
+	destroy() {
+		if (this.cleanupTimer) {
+			clearInterval(this.cleanupTimer);
+			this.cleanupTimer = void 0;
+		}
+	}
+	isExpired(node, now) {
+		if (this.ttl === 0 || node.timestamp === void 0) return false;
+		return (now ?? Date.now()) - node.timestamp > this.ttl;
+	}
+	_addToTimeListTail(node) {
+		const prev = this.timeTail.timePrev;
+		prev.timeNext = node;
+		node.timePrev = prev;
+		node.timeNext = this.timeTail;
+		this.timeTail.timePrev = node;
+	}
+	_removeFromTimeList(node) {
+		if (node.timePrev) node.timePrev.timeNext = node.timeNext ?? null;
+		if (node.timeNext) node.timeNext.timePrev = node.timePrev ?? null;
+	}
+	_moveToTimeListTail(node) {
+		this._removeFromTimeList(node);
+		this._addToTimeListTail(node);
+	}
+};
+
+//#endregion
+//#region src/index.ts
+function createCache(maxSize) {
+	return new FastCache(maxSize);
+}
+function createCacheWithTTL(options) {
+	return new FastCacheWithTTL(options);
+}
+const CachePresets = {
+	apiCache: (maxSize = 1e3) => createCache(maxSize),
+	computeCache: (maxSize = 500) => createCache(maxSize),
+	sessionCache: (maxSize = 100, ttl = 30 * 60 * 1e3) => createCacheWithTTL({
+		maxSize,
+		ttl,
+		autoCleanup: true
+	}),
+	tempCache: (maxSize = 200, ttl = 5 * 60 * 1e3) => createCacheWithTTL({
+		maxSize,
+		ttl,
+		autoCleanup: true
+	})
+};
+
+//#endregion
+exports.CachePresets = CachePresets;
+exports.FastCache = FastCache;
+exports.FastCacheWithTTL = FastCacheWithTTL;
+exports.createCache = createCache;
+exports.createCacheWithTTL = createCacheWithTTL;

package/dist/main.mjs

@@ -0,0 +1,327 @@
+//#region node_modules/.pnpm/@oxc-project+runtime@0.72.3/node_modules/@oxc-project/runtime/src/helpers/esm/typeof.js
+function _typeof(o) {
+	"@babel/helpers - typeof";
+	return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function(o$1) {
+		return typeof o$1;
+	} : function(o$1) {
+		return o$1 && "function" == typeof Symbol && o$1.constructor === Symbol && o$1 !== Symbol.prototype ? "symbol" : typeof o$1;
+	}, _typeof(o);
+}
+
+//#endregion
+//#region node_modules/.pnpm/@oxc-project+runtime@0.72.3/node_modules/@oxc-project/runtime/src/helpers/esm/toPrimitive.js
+function toPrimitive(t, r) {
+	if ("object" != _typeof(t) || !t) return t;
+	var e = t[Symbol.toPrimitive];
+	if (void 0 !== e) {
+		var i = e.call(t, r || "default");
+		if ("object" != _typeof(i)) return i;
+		throw new TypeError("@@toPrimitive must return a primitive value.");
+	}
+	return ("string" === r ? String : Number)(t);
+}
+
+//#endregion
+//#region node_modules/.pnpm/@oxc-project+runtime@0.72.3/node_modules/@oxc-project/runtime/src/helpers/esm/toPropertyKey.js
+function toPropertyKey(t) {
+	var i = toPrimitive(t, "string");
+	return "symbol" == _typeof(i) ? i : i + "";
+}
+
+//#endregion
+//#region node_modules/.pnpm/@oxc-project+runtime@0.72.3/node_modules/@oxc-project/runtime/src/helpers/esm/defineProperty.js
+function _defineProperty(e, r, t) {
+	return (r = toPropertyKey(r)) in e ? Object.defineProperty(e, r, {
+		value: t,
+		enumerable: !0,
+		configurable: !0,
+		writable: !0
+	}) : e[r] = t, e;
+}
+
+//#endregion
+//#region src/fast-cache.ts
+/**
+* 高性能 LRU 缓存实现
+* 使用 Map + 双向链表实现 O(1) 复杂度的所有操作
+*/
+var FastCache = class {
+	constructor(maxSize) {
+		_defineProperty(this, "cache", void 0);
+		_defineProperty(this, "head", void 0);
+		_defineProperty(this, "tail", void 0);
+		_defineProperty(this, "maxSize", void 0);
+		_defineProperty(this, "hits", 0);
+		_defineProperty(this, "misses", 0);
+		if (maxSize <= 0) throw new Error("Cache size must be positive");
+		this.maxSize = maxSize;
+		this.cache = /* @__PURE__ */ new Map();
+		this.head = {};
+		this.tail = {};
+		this.head.next = this.tail;
+		this.tail.prev = this.head;
+	}
+	get(key) {
+		const node = this.cache.get(key);
+		if (node === void 0) {
+			this.misses++;
+			return void 0;
+		}
+		this.moveToHead(node);
+		this.hits++;
+		return node.value;
+	}
+	set(key, value) {
+		const existingNode = this.cache.get(key);
+		if (existingNode !== void 0) {
+			existingNode.value = value;
+			this.moveToHead(existingNode);
+			return;
+		}
+		const newNode = {
+			key,
+			value,
+			prev: null,
+			next: null
+		};
+		if (this.cache.size >= this.maxSize) this.removeTail();
+		this.cache.set(key, newNode);
+		this.addToHead(newNode);
+	}
+	delete(key) {
+		const node = this.cache.get(key);
+		if (node === void 0) return false;
+		this.cache.delete(key);
+		this.removeNode(node);
+		return true;
+	}
+	clear() {
+		this.cache.clear();
+		this.head.next = this.tail;
+		this.tail.prev = this.head;
+		this.hits = 0;
+		this.misses = 0;
+	}
+	has(key) {
+		return this.cache.has(key);
+	}
+	get size() {
+		return this.cache.size;
+	}
+	get capacity() {
+		return this.maxSize;
+	}
+	setMany(entries) {
+		for (const [key, value] of entries) this.set(key, value);
+	}
+	getMany(keys) {
+		const result = /* @__PURE__ */ new Map();
+		for (const key of keys) {
+			const value = this.get(key);
+			if (value !== void 0) result.set(key, value);
+		}
+		return result;
+	}
+	getStats() {
+		const total = this.hits + this.misses;
+		return {
+			hits: this.hits,
+			misses: this.misses,
+			hitRate: total > 0 ? this.hits / total : 0,
+			size: this.size,
+			capacity: this.capacity
+		};
+	}
+	addToHead(node) {
+		node.prev = this.head;
+		node.next = this.head.next;
+		this.head.next.prev = node;
+		this.head.next = node;
+	}
+	removeNode(node) {
+		if (node.prev) node.prev.next = node.next;
+		if (node.next) node.next.prev = node.prev;
+	}
+	moveToHead(node) {
+		this.removeNode(node);
+		this.addToHead(node);
+	}
+	removeTail() {
+		const lastNode = this.tail.prev;
+		if (lastNode && lastNode !== this.head) {
+			this.cache.delete(lastNode.key);
+			this.removeNode(lastNode);
+		}
+	}
+};
+
+//#endregion
+//#region src/fast-cache-ttl.ts
+/**
+* 带 TTL (Time To Live) 支持的高性能缓存实现。
+* 继承自 FastCache，并增加了一个按时间排序的独立链表，
+* 以实现 O(M) 复杂度的过期项目清理（M 为过期数量）。
+*
+* @important 在 Node.js 环境下使用 `autoCleanup: true` 时，
+* 必须在程序退出前手动调用 `destroy()` 方法来清理定时器，
+* 否则定时器会阻止 Node.js 进程正常退出。
+*/
+var FastCacheWithTTL = class extends FastCache {
+	constructor(options) {
+		super(options.maxSize);
+		_defineProperty(this, "ttl", void 0);
+		_defineProperty(this, "autoCleanup", void 0);
+		_defineProperty(this, "cleanupTimer", void 0);
+		_defineProperty(this, "timeHead", void 0);
+		_defineProperty(this, "timeTail", void 0);
+		_defineProperty(this, "expired", 0);
+		if (options.ttl !== void 0 && options.ttl <= 0) throw new Error("TTL must be positive");
+		this.ttl = options.ttl ?? 0;
+		this.autoCleanup = options.autoCleanup ?? false;
+		this.timeHead = {};
+		this.timeTail = {};
+		this.timeHead.timeNext = this.timeTail;
+		this.timeTail.timePrev = this.timeHead;
+		if (this.autoCleanup && this.ttl > 0) {
+			const cleanupInterval = options.cleanupInterval ?? this.ttl;
+			this.cleanupTimer = setInterval(() => this.cleanup(), cleanupInterval);
+		}
+	}
+	get(key) {
+		const node = this.cache.get(key);
+		if (node === void 0) {
+			this.misses++;
+			return void 0;
+		}
+		if (this.isExpired(node)) {
+			this.delete(key);
+			this.expired++;
+			this.misses++;
+			return void 0;
+		}
+		return super.get(key);
+	}
+	set(key, value) {
+		const existingNode = this.cache.get(key);
+		const now = this.ttl > 0 ? Date.now() : 0;
+		super.set(key, value);
+		const node = this.cache.get(key);
+		node.timestamp = now;
+		if (existingNode) this._moveToTimeListTail(node);
+		else this._addToTimeListTail(node);
+	}
+	delete(key) {
+		const node = this.cache.get(key);
+		if (node === void 0) return false;
+		this._removeFromTimeList(node);
+		return super.delete(key);
+	}
+	clear() {
+		super.clear();
+		this.timeHead.timeNext = this.timeTail;
+		this.timeTail.timePrev = this.timeHead;
+		this.expired = 0;
+	}
+	has(key) {
+		const node = this.cache.get(key);
+		if (node === void 0) return false;
+		if (this.isExpired(node)) {
+			this.delete(key);
+			this.expired++;
+			return false;
+		}
+		return true;
+	}
+	get size() {
+		return this.cache.size;
+	}
+	get capacity() {
+		return this.maxSize;
+	}
+	setMany(entries) {
+		for (const [key, value] of entries) this.set(key, value);
+	}
+	getMany(keys) {
+		const result = /* @__PURE__ */ new Map();
+		for (const key of keys) {
+			const value = this.get(key);
+			if (value !== void 0) result.set(key, value);
+		}
+		return result;
+	}
+	getStats() {
+		const stats = super.getStats();
+		return {
+			...stats,
+			expired: this.expired
+		};
+	}
+	cleanup() {
+		if (this.ttl === 0) return 0;
+		let removedCount = 0;
+		const now = Date.now();
+		let currentNode = this.timeHead.timeNext;
+		while (currentNode && currentNode !== this.timeTail) if (this.isExpired(currentNode, now)) {
+			this.delete(currentNode.key);
+			removedCount++;
+			this.expired++;
+			currentNode = this.timeHead.timeNext;
+		} else break;
+		return removedCount;
+	}
+	/**
+	* 清理定时器，防止在 Node.js 环境中进程无法正常退出。
+	* 如果开启了 `autoCleanup`，你应当在应用关闭前调用此方法。
+	*/
+	destroy() {
+		if (this.cleanupTimer) {
+			clearInterval(this.cleanupTimer);
+			this.cleanupTimer = void 0;
+		}
+	}
+	isExpired(node, now) {
+		if (this.ttl === 0 || node.timestamp === void 0) return false;
+		return (now ?? Date.now()) - node.timestamp > this.ttl;
+	}
+	_addToTimeListTail(node) {
+		const prev = this.timeTail.timePrev;
+		prev.timeNext = node;
+		node.timePrev = prev;
+		node.timeNext = this.timeTail;
+		this.timeTail.timePrev = node;
+	}
+	_removeFromTimeList(node) {
+		if (node.timePrev) node.timePrev.timeNext = node.timeNext ?? null;
+		if (node.timeNext) node.timeNext.timePrev = node.timePrev ?? null;
+	}
+	_moveToTimeListTail(node) {
+		this._removeFromTimeList(node);
+		this._addToTimeListTail(node);
+	}
+};
+
+//#endregion
+//#region src/index.ts
+function createCache(maxSize) {
+	return new FastCache(maxSize);
+}
+function createCacheWithTTL(options) {
+	return new FastCacheWithTTL(options);
+}
+const CachePresets = {
+	apiCache: (maxSize = 1e3) => createCache(maxSize),
+	computeCache: (maxSize = 500) => createCache(maxSize),
+	sessionCache: (maxSize = 100, ttl = 30 * 60 * 1e3) => createCacheWithTTL({
+		maxSize,
+		ttl,
+		autoCleanup: true
+	}),
+	tempCache: (maxSize = 200, ttl = 5 * 60 * 1e3) => createCacheWithTTL({
+		maxSize,
+		ttl,
+		autoCleanup: true
+	})
+};
+
+//#endregion
+export { CachePresets, FastCache, FastCacheWithTTL, createCache, createCacheWithTTL };