@vlian/framework 1.0.0

package/dist/library/locale/types.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/library/locale/types.ts"],"sourcesContent":["export type LangType = 'en-US' | 'zh-CN';\n\nexport type Schema = {\n    translation: {\n        notfound: {\n            home: string\n        },\n        defaultApp: {\n            title: string;\n            description: string;\n            quickStart: {\n                title: string;\n                description: string;\n                code: string;\n            };\n            nextSteps: {\n                title: string;\n                step1: string;\n                step2: string;\n                step3: string;\n            };\n            footer: string;\n        };\n    };\n};\n\nexport type GetI18nKey<T extends Record<string, unknown>, K extends keyof T = keyof T> = K extends string\n    ? T[K] extends Record<string, unknown>\n        ? `${K}.${GetI18nKey<T[K]>}`\n        : K\n    : never;\n\nexport type I18nKey = GetI18nKey<Schema['translation']>;\n\nexport type TranslateOptions<Locales extends string> = import('react-i18next').TranslationProps<Locales>;\n\nexport interface $T {\n    (key: I18nKey): string;\n\n    (key: I18nKey, plural: number, options?: TranslateOptions<LangType>): string;\n\n    (key: I18nKey, defaultMsg: string, options?: TranslateOptions<I18nKey>): string;\n\n    (key: I18nKey, list: unknown[], options?: TranslateOptions<I18nKey>): string;\n\n    (key: I18nKey, list: unknown[], plural: number): string;\n\n    (key: I18nKey, list: unknown[], defaultMsg: string): string;\n\n    (key: I18nKey, named: Record<string, unknown>, options?: TranslateOptions<LangType>): string;\n\n    (key: I18nKey, named: Record<string, unknown>, plural: number): string;\n\n    (key: I18nKey, named: Record<string, unknown>, defaultMsg: string): string;\n}\n"],"names":[],"mappings":"AAoCA,WAkBC"}

package/dist/library/storage/cache.cjs

@@ -0,0 +1,245 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", {
+    value: true
+});
+Object.defineProperty(exports, "MultiLevelCache", {
+    enumerable: true,
+    get: function() {
+        return MultiLevelCache;
+    }
+});
+function _define_property(obj, key, value) {
+    if (key in obj) {
+        Object.defineProperty(obj, key, {
+            value: value,
+            enumerable: true,
+            configurable: true,
+            writable: true
+        });
+    } else {
+        obj[key] = value;
+    }
+    return obj;
+}
+let MultiLevelCache = class MultiLevelCache {
+    /**
+   * 将节点移到链表头部（最近使用）
+   */ moveToHead(node) {
+        const nodeAsUnknown = node;
+        if (nodeAsUnknown === this.head) {
+            return;
+        }
+        // 从当前位置移除
+        if (node.prev) {
+            node.prev.next = node.next;
+        }
+        if (node.next) {
+            node.next.prev = node.prev;
+        }
+        if (nodeAsUnknown === this.tail) {
+            this.tail = node.prev;
+        }
+        // 移到头部
+        node.prev = null;
+        node.next = this.head;
+        if (this.head) {
+            this.head.prev = nodeAsUnknown;
+        }
+        this.head = nodeAsUnknown;
+        if (!this.tail) {
+            this.tail = nodeAsUnknown;
+        }
+    }
+    /**
+   * 移除尾部节点（最久未使用）
+   */ removeTail() {
+        if (!this.tail) {
+            return;
+        }
+        const key = this.tail.key;
+        this.memoryCache.delete(key);
+        if (this.tail.prev) {
+            this.tail.prev.next = null;
+            this.tail = this.tail.prev;
+        } else {
+            this.head = null;
+            this.tail = null;
+        }
+    }
+    /**
+   * 获取缓存
+   */ async get(key) {
+        // 先检查内存缓存
+        const node = this.memoryCache.get(key);
+        if (node) {
+            const item = node.value;
+            if (item.expiresAt > Date.now()) {
+                // 移到头部（最近使用）
+                this.moveToHead(node);
+                return item.data;
+            } else {
+                // 已过期，删除
+                this.memoryCache.delete(key);
+                if (node === this.head) {
+                    this.head = node.next;
+                }
+                if (node === this.tail) {
+                    this.tail = node.prev;
+                }
+                if (node.prev) {
+                    node.prev.next = node.next;
+                }
+                if (node.next) {
+                    node.next.prev = node.prev;
+                }
+            }
+        }
+        // 检查存储缓存
+        try {
+            const stored = await this.storage.get(key);
+            if (stored) {
+                const item = JSON.parse(stored);
+                if (item.expiresAt > Date.now()) {
+                    // 更新内存缓存（使用 LRU）
+                    this.setInMemory(key, item);
+                    return item.data;
+                } else {
+                    // 已过期，删除
+                    await this.storage.remove(key);
+                }
+            }
+        } catch (error) {
+        // 忽略解析错误
+        }
+        return null;
+    }
+    /**
+   * 在内存中设置缓存（LRU）
+   */ setInMemory(key, item) {
+        let node = this.memoryCache.get(key);
+        if (node) {
+            // 更新现有节点
+            node.value = item;
+            this.moveToHead(node);
+        } else {
+            // 创建新节点
+            node = {
+                key,
+                value: item,
+                prev: null,
+                next: this.head
+            };
+            if (this.head) {
+                this.head.prev = node;
+            }
+            this.head = node;
+            if (!this.tail) {
+                this.tail = node;
+            }
+            this.memoryCache.set(key, node);
+            // 如果超过最大大小，移除最久未使用的
+            if (this.memoryCache.size > this.config.maxSize) {
+                this.removeTail();
+            }
+        }
+    }
+    /**
+   * 设置缓存
+   */ async set(key, data, ttl) {
+        const expiresAt = Date.now() + (ttl || this.config.defaultTTL);
+        const item = {
+            data,
+            expiresAt,
+            createdAt: Date.now()
+        };
+        // 更新内存缓存（使用 LRU）
+        this.setInMemory(key, item);
+        // 更新存储缓存
+        try {
+            await this.storage.set(key, item);
+        } catch (error) {
+        // 忽略存储错误
+        }
+    }
+    /**
+   * 删除缓存
+   */ async delete(key) {
+        const node = this.memoryCache.get(key);
+        if (node) {
+            // 从链表中移除
+            if (node.prev) {
+                node.prev.next = node.next;
+            }
+            if (node.next) {
+                node.next.prev = node.prev;
+            }
+            if (node === this.head) {
+                this.head = node.next;
+            }
+            if (node === this.tail) {
+                this.tail = node.prev;
+            }
+            this.memoryCache.delete(key);
+        }
+        try {
+            await this.storage.remove(key);
+        } catch (error) {
+        // 忽略删除错误
+        }
+    }
+    /**
+   * 清空缓存
+   */ async clear() {
+        this.memoryCache.clear();
+    // 注意：这里不清空 storage，因为可能包含其他数据
+    }
+    /**
+   * 清理过期项（优化版本：批量删除，减少 DOM 操作）
+   */ async cleanup() {
+        const now = Date.now();
+        const keysToDelete = [];
+        const nodesToRemove = [];
+        // 批量收集需要删除的项
+        for (const [key, node] of this.memoryCache.entries()){
+            if (node.value.expiresAt <= now) {
+                keysToDelete.push(key);
+                nodesToRemove.push(node);
+            }
+        }
+        // 批量删除（优化性能）
+        if (keysToDelete.length > 0) {
+            // 从链表中移除节点
+            for (const node of nodesToRemove){
+                if (node.prev) {
+                    node.prev.next = node.next;
+                }
+                if (node.next) {
+                    node.next.prev = node.prev;
+                }
+                if (node === this.head) {
+                    this.head = node.next;
+                }
+                if (node === this.tail) {
+                    this.tail = node.prev;
+                }
+            }
+            // 批量删除 Map 中的项
+            keysToDelete.forEach((key)=>this.memoryCache.delete(key));
+        }
+    // 注意：存储缓存的清理由存储系统自己处理（通过过期时间）
+    }
+    constructor(storage, config = {}){
+        _define_property(this, "memoryCache", new Map());
+        _define_property(this, "storage", void 0);
+        _define_property(this, "config", void 0);
+        _define_property(this, "head", null);
+        _define_property(this, "tail", null);
+        this.storage = storage;
+        this.config = {
+            defaultTTL: config.defaultTTL ?? 24 * 60 * 60 * 1000,
+            maxSize: config.maxSize ?? 100
+        };
+    }
+};
+
+//# sourceMappingURL=cache.js.map

package/dist/library/storage/cache.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/library/storage/cache.ts"],"sourcesContent":["import type { StorageInstance } from '@vlian/utils';\n\n/**\n * 缓存项\n */\ninterface CacheItem<T> {\n  /**\n   * 数据\n   */\n  data: T;\n  /**\n   * 过期时间戳\n   */\n  expiresAt: number;\n  /**\n   * 创建时间戳\n   */\n  createdAt: number;\n}\n\n/**\n * 缓存配置\n */\nexport interface CacheConfig {\n  /**\n   * 默认过期时间（毫秒）\n   */\n  defaultTTL?: number;\n  /**\n   * 最大缓存项数量\n   */\n  maxSize?: number;\n}\n\n/**\n * LRU 缓存节点\n */\ninterface LRUNode<T> {\n  key: string;\n  value: CacheItem<T>;\n  prev: LRUNode<T> | null;\n  next: LRUNode<T> | null;\n}\n\n/**\n * 多级缓存管理器（使用 LRU 策略）\n */\nexport class MultiLevelCache {\n  private memoryCache: Map<string, LRUNode<unknown>> = new Map();\n  private storage: StorageInstance;\n  private config: Required<CacheConfig>;\n  private head: LRUNode<unknown> | null = null;\n  private tail: LRUNode<unknown> | null = null;\n\n  constructor(storage: StorageInstance, config: CacheConfig = {}) {\n    this.storage = storage;\n    this.config = {\n      defaultTTL: config.defaultTTL ?? 24 * 60 * 60 * 1000, // 24小时\n      maxSize: config.maxSize ?? 100,\n    };\n  }\n\n  /**\n   * 将节点移到链表头部（最近使用）\n   */\n  private moveToHead<T>(node: LRUNode<T>): void {\n    const nodeAsUnknown = node as unknown as LRUNode<unknown>;\n    if (nodeAsUnknown === this.head) {\n      return;\n    }\n\n    // 从当前位置移除\n    if (node.prev) {\n      node.prev.next = node.next;\n    }\n    if (node.next) {\n      node.next.prev = node.prev;\n    }\n    if (nodeAsUnknown === this.tail) {\n      this.tail = node.prev as unknown as LRUNode<unknown> | null;\n    }\n\n    // 移到头部\n    node.prev = null;\n    node.next = this.head as unknown as LRUNode<T> | null;\n    if (this.head) {\n      this.head.prev = nodeAsUnknown;\n    }\n    this.head = nodeAsUnknown;\n    if (!this.tail) {\n      this.tail = nodeAsUnknown;\n    }\n  }\n\n  /**\n   * 移除尾部节点（最久未使用）\n   */\n  private removeTail(): void {\n    if (!this.tail) {\n      return;\n    }\n\n    const key = this.tail.key;\n    this.memoryCache.delete(key);\n\n    if (this.tail.prev) {\n      this.tail.prev.next = null;\n      this.tail = this.tail.prev;\n    } else {\n      this.head = null;\n      this.tail = null;\n    }\n  }\n\n  /**\n   * 获取缓存\n   */\n  async get<T>(key: string): Promise<T | null> {\n    // 先检查内存缓存\n    const node = this.memoryCache.get(key);\n    if (node) {\n      const item = node.value;\n      if (item.expiresAt > Date.now()) {\n        // 移到头部（最近使用）\n        this.moveToHead(node as unknown as LRUNode<T>);\n        return item.data as T;\n      } else {\n        // 已过期，删除\n        this.memoryCache.delete(key);\n        if (node === this.head) {\n          this.head = node.next;\n        }\n        if (node === this.tail) {\n          this.tail = node.prev;\n        }\n        if (node.prev) {\n          node.prev.next = node.next;\n        }\n        if (node.next) {\n          node.next.prev = node.prev;\n        }\n      }\n    }\n\n    // 检查存储缓存\n    try {\n      const stored = await (this.storage as any).get(key);\n      if (stored) {\n        const item: CacheItem<T> = JSON.parse(stored);\n        if (item.expiresAt > Date.now()) {\n          // 更新内存缓存（使用 LRU）\n          this.setInMemory(key, item);\n          return item.data;\n        } else {\n          // 已过期，删除\n          await (this.storage as any).remove(key);\n        }\n      }\n    } catch (error) {\n      // 忽略解析错误\n    }\n\n    return null;\n  }\n\n  /**\n   * 在内存中设置缓存（LRU）\n   */\n  private setInMemory<T>(key: string, item: CacheItem<T>): void {\n    let node = this.memoryCache.get(key);\n\n    if (node) {\n      // 更新现有节点\n      node.value = item as unknown as CacheItem<unknown>;\n      this.moveToHead(node as unknown as LRUNode<T>);\n    } else {\n      // 创建新节点\n      node = {\n        key,\n        value: item as unknown as CacheItem<unknown>,\n        prev: null,\n        next: this.head,\n      } as LRUNode<unknown>;\n\n      if (this.head) {\n        this.head.prev = node;\n      }\n      this.head = node;\n      if (!this.tail) {\n        this.tail = node;\n      }\n\n      this.memoryCache.set(key, node);\n\n      // 如果超过最大大小，移除最久未使用的\n      if (this.memoryCache.size > this.config.maxSize) {\n        this.removeTail();\n      }\n    }\n  }\n\n  /**\n   * 设置缓存\n   */\n  async set<T>(key: string, data: T, ttl?: number): Promise<void> {\n    const expiresAt = Date.now() + (ttl || this.config.defaultTTL);\n    const item: CacheItem<T> = {\n      data,\n      expiresAt,\n      createdAt: Date.now(),\n    };\n\n    // 更新内存缓存（使用 LRU）\n    this.setInMemory(key, item);\n\n    // 更新存储缓存\n    try {\n      await (this.storage as any).set(key, item);\n    } catch (error) {\n      // 忽略存储错误\n    }\n  }\n\n  /**\n   * 删除缓存\n   */\n  async delete(key: string): Promise<void> {\n    const node = this.memoryCache.get(key);\n    if (node) {\n      // 从链表中移除\n      if (node.prev) {\n        node.prev.next = node.next;\n      }\n      if (node.next) {\n        node.next.prev = node.prev;\n      }\n      if (node === this.head) {\n        this.head = node.next;\n      }\n      if (node === this.tail) {\n        this.tail = node.prev;\n      }\n      this.memoryCache.delete(key);\n    }\n\n    try {\n      await (this.storage as any).remove(key);\n    } catch (error) {\n      // 忽略删除错误\n    }\n  }\n\n  /**\n   * 清空缓存\n   */\n  async clear(): Promise<void> {\n    this.memoryCache.clear();\n    // 注意：这里不清空 storage，因为可能包含其他数据\n  }\n\n  /**\n   * 清理过期项（优化版本：批量删除，减少 DOM 操作）\n   */\n  async cleanup(): Promise<void> {\n    const now = Date.now();\n    const keysToDelete: string[] = [];\n    const nodesToRemove: LRUNode<unknown>[] = [];\n\n    // 批量收集需要删除的项\n    for (const [key, node] of this.memoryCache.entries()) {\n      if (node.value.expiresAt <= now) {\n        keysToDelete.push(key);\n        nodesToRemove.push(node);\n      }\n    }\n\n    // 批量删除（优化性能）\n    if (keysToDelete.length > 0) {\n      // 从链表中移除节点\n      for (const node of nodesToRemove) {\n        if (node.prev) {\n          node.prev.next = node.next;\n        }\n        if (node.next) {\n          node.next.prev = node.prev;\n        }\n        if (node === this.head) {\n          this.head = node.next as unknown as LRUNode<unknown> | null;\n        }\n        if (node === this.tail) {\n          this.tail = node.prev as unknown as LRUNode<unknown> | null;\n        }\n      }\n\n      // 批量删除 Map 中的项\n      keysToDelete.forEach((key) => this.memoryCache.delete(key));\n    }\n\n    // 注意：存储缓存的清理由存储系统自己处理（通过过期时间）\n  }\n}\n"],"names":["MultiLevelCache","moveToHead","node","nodeAsUnknown","head","prev","next","tail","removeTail","key","memoryCache","delete","get","item","value","expiresAt","Date","now","data","stored","storage","JSON","parse","setInMemory","remove","error","set","size","config","maxSize","ttl","defaultTTL","createdAt","clear","cleanup","keysToDelete","nodesToRemove","entries","push","length","forEach","Map"],"mappings":";;;;+BA+CaA;;;eAAAA;;;;;;;;;;;;;;;;AAAN,IAAA,AAAMA,kBAAN,MAAMA;IAeX;;GAEC,GACD,AAAQC,WAAcC,IAAgB,EAAQ;QAC5C,MAAMC,gBAAgBD;QACtB,IAAIC,kBAAkB,IAAI,CAACC,IAAI,EAAE;YAC/B;QACF;QAEA,UAAU;QACV,IAAIF,KAAKG,IAAI,EAAE;YACbH,KAAKG,IAAI,CAACC,IAAI,GAAGJ,KAAKI,IAAI;QAC5B;QACA,IAAIJ,KAAKI,IAAI,EAAE;YACbJ,KAAKI,IAAI,CAACD,IAAI,GAAGH,KAAKG,IAAI;QAC5B;QACA,IAAIF,kBAAkB,IAAI,CAACI,IAAI,EAAE;YAC/B,IAAI,CAACA,IAAI,GAAGL,KAAKG,IAAI;QACvB;QAEA,OAAO;QACPH,KAAKG,IAAI,GAAG;QACZH,KAAKI,IAAI,GAAG,IAAI,CAACF,IAAI;QACrB,IAAI,IAAI,CAACA,IAAI,EAAE;YACb,IAAI,CAACA,IAAI,CAACC,IAAI,GAAGF;QACnB;QACA,IAAI,CAACC,IAAI,GAAGD;QACZ,IAAI,CAAC,IAAI,CAACI,IAAI,EAAE;YACd,IAAI,CAACA,IAAI,GAAGJ;QACd;IACF;IAEA;;GAEC,GACD,AAAQK,aAAmB;QACzB,IAAI,CAAC,IAAI,CAACD,IAAI,EAAE;YACd;QACF;QAEA,MAAME,MAAM,IAAI,CAACF,IAAI,CAACE,GAAG;QACzB,IAAI,CAACC,WAAW,CAACC,MAAM,CAACF;QAExB,IAAI,IAAI,CAACF,IAAI,CAACF,IAAI,EAAE;YAClB,IAAI,CAACE,IAAI,CAACF,IAAI,CAACC,IAAI,GAAG;YACtB,IAAI,CAACC,IAAI,GAAG,IAAI,CAACA,IAAI,CAACF,IAAI;QAC5B,OAAO;YACL,IAAI,CAACD,IAAI,GAAG;YACZ,IAAI,CAACG,IAAI,GAAG;QACd;IACF;IAEA;;GAEC,GACD,MAAMK,IAAOH,GAAW,EAAqB;QAC3C,UAAU;QACV,MAAMP,OAAO,IAAI,CAACQ,WAAW,CAACE,GAAG,CAACH;QAClC,IAAIP,MAAM;YACR,MAAMW,OAAOX,KAAKY,KAAK;YACvB,IAAID,KAAKE,SAAS,GAAGC,KAAKC,GAAG,IAAI;gBAC/B,aAAa;gBACb,IAAI,CAAChB,UAAU,CAACC;gBAChB,OAAOW,KAAKK,IAAI;YAClB,OAAO;gBACL,SAAS;gBACT,IAAI,CAACR,WAAW,CAACC,MAAM,CAACF;gBACxB,IAAIP,SAAS,IAAI,CAACE,IAAI,EAAE;oBACtB,IAAI,CAACA,IAAI,GAAGF,KAAKI,IAAI;gBACvB;gBACA,IAAIJ,SAAS,IAAI,CAACK,IAAI,EAAE;oBACtB,IAAI,CAACA,IAAI,GAAGL,KAAKG,IAAI;gBACvB;gBACA,IAAIH,KAAKG,IAAI,EAAE;oBACbH,KAAKG,IAAI,CAACC,IAAI,GAAGJ,KAAKI,IAAI;gBAC5B;gBACA,IAAIJ,KAAKI,IAAI,EAAE;oBACbJ,KAAKI,IAAI,CAACD,IAAI,GAAGH,KAAKG,IAAI;gBAC5B;YACF;QACF;QAEA,SAAS;QACT,IAAI;YACF,MAAMc,SAAS,MAAM,AAAC,IAAI,CAACC,OAAO,CAASR,GAAG,CAACH;YAC/C,IAAIU,QAAQ;gBACV,MAAMN,OAAqBQ,KAAKC,KAAK,CAACH;gBACtC,IAAIN,KAAKE,SAAS,GAAGC,KAAKC,GAAG,IAAI;oBAC/B,iBAAiB;oBACjB,IAAI,CAACM,WAAW,CAACd,KAAKI;oBACtB,OAAOA,KAAKK,IAAI;gBAClB,OAAO;oBACL,SAAS;oBACT,MAAM,AAAC,IAAI,CAACE,OAAO,CAASI,MAAM,CAACf;gBACrC;YACF;QACF,EAAE,OAAOgB,OAAO;QACd,SAAS;QACX;QAEA,OAAO;IACT;IAEA;;GAEC,GACD,AAAQF,YAAed,GAAW,EAAEI,IAAkB,EAAQ;QAC5D,IAAIX,OAAO,IAAI,CAACQ,WAAW,CAACE,GAAG,CAACH;QAEhC,IAAIP,MAAM;YACR,SAAS;YACTA,KAAKY,KAAK,GAAGD;YACb,IAAI,CAACZ,UAAU,CAACC;QAClB,OAAO;YACL,QAAQ;YACRA,OAAO;gBACLO;gBACAK,OAAOD;gBACPR,MAAM;gBACNC,MAAM,IAAI,CAACF,IAAI;YACjB;YAEA,IAAI,IAAI,CAACA,IAAI,EAAE;gBACb,IAAI,CAACA,IAAI,CAACC,IAAI,GAAGH;YACnB;YACA,IAAI,CAACE,IAAI,GAAGF;YACZ,IAAI,CAAC,IAAI,CAACK,IAAI,EAAE;gBACd,IAAI,CAACA,IAAI,GAAGL;YACd;YAEA,IAAI,CAACQ,WAAW,CAACgB,GAAG,CAACjB,KAAKP;YAE1B,oBAAoB;YACpB,IAAI,IAAI,CAACQ,WAAW,CAACiB,IAAI,GAAG,IAAI,CAACC,MAAM,CAACC,OAAO,EAAE;gBAC/C,IAAI,CAACrB,UAAU;YACjB;QACF;IACF;IAEA;;GAEC,GACD,MAAMkB,IAAOjB,GAAW,EAAES,IAAO,EAAEY,GAAY,EAAiB;QAC9D,MAAMf,YAAYC,KAAKC,GAAG,KAAMa,CAAAA,OAAO,IAAI,CAACF,MAAM,CAACG,UAAU,AAAD;QAC5D,MAAMlB,OAAqB;YACzBK;YACAH;YACAiB,WAAWhB,KAAKC,GAAG;QACrB;QAEA,iBAAiB;QACjB,IAAI,CAACM,WAAW,CAACd,KAAKI;QAEtB,SAAS;QACT,IAAI;YACF,MAAM,AAAC,IAAI,CAACO,OAAO,CAASM,GAAG,CAACjB,KAAKI;QACvC,EAAE,OAAOY,OAAO;QACd,SAAS;QACX;IACF;IAEA;;GAEC,GACD,MAAMd,OAAOF,GAAW,EAAiB;QACvC,MAAMP,OAAO,IAAI,CAACQ,WAAW,CAACE,GAAG,CAACH;QAClC,IAAIP,MAAM;YACR,SAAS;YACT,IAAIA,KAAKG,IAAI,EAAE;gBACbH,KAAKG,IAAI,CAACC,IAAI,GAAGJ,KAAKI,IAAI;YAC5B;YACA,IAAIJ,KAAKI,IAAI,EAAE;gBACbJ,KAAKI,IAAI,CAACD,IAAI,GAAGH,KAAKG,IAAI;YAC5B;YACA,IAAIH,SAAS,IAAI,CAACE,IAAI,EAAE;gBACtB,IAAI,CAACA,IAAI,GAAGF,KAAKI,IAAI;YACvB;YACA,IAAIJ,SAAS,IAAI,CAACK,IAAI,EAAE;gBACtB,IAAI,CAACA,IAAI,GAAGL,KAAKG,IAAI;YACvB;YACA,IAAI,CAACK,WAAW,CAACC,MAAM,CAACF;QAC1B;QAEA,IAAI;YACF,MAAM,AAAC,IAAI,CAACW,OAAO,CAASI,MAAM,CAACf;QACrC,EAAE,OAAOgB,OAAO;QACd,SAAS;QACX;IACF;IAEA;;GAEC,GACD,MAAMQ,QAAuB;QAC3B,IAAI,CAACvB,WAAW,CAACuB,KAAK;IACtB,8BAA8B;IAChC;IAEA;;GAEC,GACD,MAAMC,UAAyB;QAC7B,MAAMjB,MAAMD,KAAKC,GAAG;QACpB,MAAMkB,eAAyB,EAAE;QACjC,MAAMC,gBAAoC,EAAE;QAE5C,aAAa;QACb,KAAK,MAAM,CAAC3B,KAAKP,KAAK,IAAI,IAAI,CAACQ,WAAW,CAAC2B,OAAO,GAAI;YACpD,IAAInC,KAAKY,KAAK,CAACC,SAAS,IAAIE,KAAK;gBAC/BkB,aAAaG,IAAI,CAAC7B;gBAClB2B,cAAcE,IAAI,CAACpC;YACrB;QACF;QAEA,aAAa;QACb,IAAIiC,aAAaI,MAAM,GAAG,GAAG;YAC3B,WAAW;YACX,KAAK,MAAMrC,QAAQkC,cAAe;gBAChC,IAAIlC,KAAKG,IAAI,EAAE;oBACbH,KAAKG,IAAI,CAACC,IAAI,GAAGJ,KAAKI,IAAI;gBAC5B;gBACA,IAAIJ,KAAKI,IAAI,EAAE;oBACbJ,KAAKI,IAAI,CAACD,IAAI,GAAGH,KAAKG,IAAI;gBAC5B;gBACA,IAAIH,SAAS,IAAI,CAACE,IAAI,EAAE;oBACtB,IAAI,CAACA,IAAI,GAAGF,KAAKI,IAAI;gBACvB;gBACA,IAAIJ,SAAS,IAAI,CAACK,IAAI,EAAE;oBACtB,IAAI,CAACA,IAAI,GAAGL,KAAKG,IAAI;gBACvB;YACF;YAEA,eAAe;YACf8B,aAAaK,OAAO,CAAC,CAAC/B,MAAQ,IAAI,CAACC,WAAW,CAACC,MAAM,CAACF;QACxD;IAEA,8BAA8B;IAChC;IArPA,YAAYW,OAAwB,EAAEQ,SAAsB,CAAC,CAAC,CAAE;QANhE,uBAAQlB,eAA6C,IAAI+B;QACzD,uBAAQrB,WAAR,KAAA;QACA,uBAAQQ,UAAR,KAAA;QACA,uBAAQxB,QAAgC;QACxC,uBAAQG,QAAgC;QAGtC,IAAI,CAACa,OAAO,GAAGA;QACf,IAAI,CAACQ,MAAM,GAAG;YACZG,YAAYH,OAAOG,UAAU,IAAI,KAAK,KAAK,KAAK;YAChDF,SAASD,OAAOC,OAAO,IAAI;QAC7B;IACF;AAgPF"}

package/dist/library/storage/cache.d.ts

@@ -0,0 +1,58 @@
+import type { StorageInstance } from '@vlian/utils';
+/**
+ * 缓存配置
+ */
+export interface CacheConfig {
+    /**
+     * 默认过期时间（毫秒）
+     */
+    defaultTTL?: number;
+    /**
+     * 最大缓存项数量
+     */
+    maxSize?: number;
+}
+/**
+ * 多级缓存管理器（使用 LRU 策略）
+ */
+export declare class MultiLevelCache {
+    private memoryCache;
+    private storage;
+    private config;
+    private head;
+    private tail;
+    constructor(storage: StorageInstance, config?: CacheConfig);
+    /**
+     * 将节点移到链表头部（最近使用）
+     */
+    private moveToHead;
+    /**
+     * 移除尾部节点（最久未使用）
+     */
+    private removeTail;
+    /**
+     * 获取缓存
+     */
+    get<T>(key: string): Promise<T | null>;
+    /**
+     * 在内存中设置缓存（LRU）
+     */
+    private setInMemory;
+    /**
+     * 设置缓存
+     */
+    set<T>(key: string, data: T, ttl?: number): Promise<void>;
+    /**
+     * 删除缓存
+     */
+    delete(key: string): Promise<void>;
+    /**
+     * 清空缓存
+     */
+    clear(): Promise<void>;
+    /**
+     * 清理过期项（优化版本：批量删除，减少 DOM 操作）
+     */
+    cleanup(): Promise<void>;
+}
+//# sourceMappingURL=cache.d.ts.map

package/dist/library/storage/cache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cache.d.ts","sourceRoot":"","sources":["../../../src/library/storage/cache.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAoBpD;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B;;OAEG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;;OAEG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAYD;;GAEG;AACH,qBAAa,eAAe;IAC1B,OAAO,CAAC,WAAW,CAA4C;IAC/D,OAAO,CAAC,OAAO,CAAkB;IACjC,OAAO,CAAC,MAAM,CAAwB;IACtC,OAAO,CAAC,IAAI,CAAiC;IAC7C,OAAO,CAAC,IAAI,CAAiC;gBAEjC,OAAO,EAAE,eAAe,EAAE,MAAM,GAAE,WAAgB;IAQ9D;;OAEG;IACH,OAAO,CAAC,UAAU;IA6BlB;;OAEG;IACH,OAAO,CAAC,UAAU;IAiBlB;;OAEG;IACG,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC;IAgD5C;;OAEG;IACH,OAAO,CAAC,WAAW;IAiCnB;;OAEG;IACG,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAmB/D;;OAEG;IACG,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IA0BxC;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAK5B;;OAEG;IACG,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC;CAqC/B"}

package/dist/library/storage/cache.js

@@ -0,0 +1,237 @@
+function _define_property(obj, key, value) {
+    if (key in obj) {
+        Object.defineProperty(obj, key, {
+            value: value,
+            enumerable: true,
+            configurable: true,
+            writable: true
+        });
+    } else {
+        obj[key] = value;
+    }
+    return obj;
+}
+/**
+ * 多级缓存管理器（使用 LRU 策略）
+ */ export class MultiLevelCache {
+    /**
+   * 将节点移到链表头部（最近使用）
+   */ moveToHead(node) {
+        const nodeAsUnknown = node;
+        if (nodeAsUnknown === this.head) {
+            return;
+        }
+        // 从当前位置移除
+        if (node.prev) {
+            node.prev.next = node.next;
+        }
+        if (node.next) {
+            node.next.prev = node.prev;
+        }
+        if (nodeAsUnknown === this.tail) {
+            this.tail = node.prev;
+        }
+        // 移到头部
+        node.prev = null;
+        node.next = this.head;
+        if (this.head) {
+            this.head.prev = nodeAsUnknown;
+        }
+        this.head = nodeAsUnknown;
+        if (!this.tail) {
+            this.tail = nodeAsUnknown;
+        }
+    }
+    /**
+   * 移除尾部节点（最久未使用）
+   */ removeTail() {
+        if (!this.tail) {
+            return;
+        }
+        const key = this.tail.key;
+        this.memoryCache.delete(key);
+        if (this.tail.prev) {
+            this.tail.prev.next = null;
+            this.tail = this.tail.prev;
+        } else {
+            this.head = null;
+            this.tail = null;
+        }
+    }
+    /**
+   * 获取缓存
+   */ async get(key) {
+        // 先检查内存缓存
+        const node = this.memoryCache.get(key);
+        if (node) {
+            const item = node.value;
+            if (item.expiresAt > Date.now()) {
+                // 移到头部（最近使用）
+                this.moveToHead(node);
+                return item.data;
+            } else {
+                // 已过期，删除
+                this.memoryCache.delete(key);
+                if (node === this.head) {
+                    this.head = node.next;
+                }
+                if (node === this.tail) {
+                    this.tail = node.prev;
+                }
+                if (node.prev) {
+                    node.prev.next = node.next;
+                }
+                if (node.next) {
+                    node.next.prev = node.prev;
+                }
+            }
+        }
+        // 检查存储缓存
+        try {
+            const stored = await this.storage.get(key);
+            if (stored) {
+                const item = JSON.parse(stored);
+                if (item.expiresAt > Date.now()) {
+                    // 更新内存缓存（使用 LRU）
+                    this.setInMemory(key, item);
+                    return item.data;
+                } else {
+                    // 已过期，删除
+                    await this.storage.remove(key);
+                }
+            }
+        } catch (error) {
+        // 忽略解析错误
+        }
+        return null;
+    }
+    /**
+   * 在内存中设置缓存（LRU）
+   */ setInMemory(key, item) {
+        let node = this.memoryCache.get(key);
+        if (node) {
+            // 更新现有节点
+            node.value = item;
+            this.moveToHead(node);
+        } else {
+            // 创建新节点
+            node = {
+                key,
+                value: item,
+                prev: null,
+                next: this.head
+            };
+            if (this.head) {
+                this.head.prev = node;
+            }
+            this.head = node;
+            if (!this.tail) {
+                this.tail = node;
+            }
+            this.memoryCache.set(key, node);
+            // 如果超过最大大小，移除最久未使用的
+            if (this.memoryCache.size > this.config.maxSize) {
+                this.removeTail();
+            }
+        }
+    }
+    /**
+   * 设置缓存
+   */ async set(key, data, ttl) {
+        const expiresAt = Date.now() + (ttl || this.config.defaultTTL);
+        const item = {
+            data,
+            expiresAt,
+            createdAt: Date.now()
+        };
+        // 更新内存缓存（使用 LRU）
+        this.setInMemory(key, item);
+        // 更新存储缓存
+        try {
+            await this.storage.set(key, item);
+        } catch (error) {
+        // 忽略存储错误
+        }
+    }
+    /**
+   * 删除缓存
+   */ async delete(key) {
+        const node = this.memoryCache.get(key);
+        if (node) {
+            // 从链表中移除
+            if (node.prev) {
+                node.prev.next = node.next;
+            }
+            if (node.next) {
+                node.next.prev = node.prev;
+            }
+            if (node === this.head) {
+                this.head = node.next;
+            }
+            if (node === this.tail) {
+                this.tail = node.prev;
+            }
+            this.memoryCache.delete(key);
+        }
+        try {
+            await this.storage.remove(key);
+        } catch (error) {
+        // 忽略删除错误
+        }
+    }
+    /**
+   * 清空缓存
+   */ async clear() {
+        this.memoryCache.clear();
+    // 注意：这里不清空 storage，因为可能包含其他数据
+    }
+    /**
+   * 清理过期项（优化版本：批量删除，减少 DOM 操作）
+   */ async cleanup() {
+        const now = Date.now();
+        const keysToDelete = [];
+        const nodesToRemove = [];
+        // 批量收集需要删除的项
+        for (const [key, node] of this.memoryCache.entries()){
+            if (node.value.expiresAt <= now) {
+                keysToDelete.push(key);
+                nodesToRemove.push(node);
+            }
+        }
+        // 批量删除（优化性能）
+        if (keysToDelete.length > 0) {
+            // 从链表中移除节点
+            for (const node of nodesToRemove){
+                if (node.prev) {
+                    node.prev.next = node.next;
+                }
+                if (node.next) {
+                    node.next.prev = node.prev;
+                }
+                if (node === this.head) {
+                    this.head = node.next;
+                }
+                if (node === this.tail) {
+                    this.tail = node.prev;
+                }
+            }
+            // 批量删除 Map 中的项
+            keysToDelete.forEach((key)=>this.memoryCache.delete(key));
+        }
+    // 注意：存储缓存的清理由存储系统自己处理（通过过期时间）
+    }
+    constructor(storage, config = {}){
+        _define_property(this, "memoryCache", new Map());
+        _define_property(this, "storage", void 0);
+        _define_property(this, "config", void 0);
+        _define_property(this, "head", null);
+        _define_property(this, "tail", null);
+        this.storage = storage;
+        this.config = {
+            defaultTTL: config.defaultTTL ?? 24 * 60 * 60 * 1000,
+            maxSize: config.maxSize ?? 100
+        };
+    }
+}
+
+//# sourceMappingURL=cache.js.map

package/dist/library/storage/cache.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/library/storage/cache.ts"],"sourcesContent":["import type { StorageInstance } from '@vlian/utils';\n\n/**\n * 缓存项\n */\ninterface CacheItem<T> {\n  /**\n   * 数据\n   */\n  data: T;\n  /**\n   * 过期时间戳\n   */\n  expiresAt: number;\n  /**\n   * 创建时间戳\n   */\n  createdAt: number;\n}\n\n/**\n * 缓存配置\n */\nexport interface CacheConfig {\n  /**\n   * 默认过期时间（毫秒）\n   */\n  defaultTTL?: number;\n  /**\n   * 最大缓存项数量\n   */\n  maxSize?: number;\n}\n\n/**\n * LRU 缓存节点\n */\ninterface LRUNode<T> {\n  key: string;\n  value: CacheItem<T>;\n  prev: LRUNode<T> | null;\n  next: LRUNode<T> | null;\n}\n\n/**\n * 多级缓存管理器（使用 LRU 策略）\n */\nexport class MultiLevelCache {\n  private memoryCache: Map<string, LRUNode<unknown>> = new Map();\n  private storage: StorageInstance;\n  private config: Required<CacheConfig>;\n  private head: LRUNode<unknown> | null = null;\n  private tail: LRUNode<unknown> | null = null;\n\n  constructor(storage: StorageInstance, config: CacheConfig = {}) {\n    this.storage = storage;\n    this.config = {\n      defaultTTL: config.defaultTTL ?? 24 * 60 * 60 * 1000, // 24小时\n      maxSize: config.maxSize ?? 100,\n    };\n  }\n\n  /**\n   * 将节点移到链表头部（最近使用）\n   */\n  private moveToHead<T>(node: LRUNode<T>): void {\n    const nodeAsUnknown = node as unknown as LRUNode<unknown>;\n    if (nodeAsUnknown === this.head) {\n      return;\n    }\n\n    // 从当前位置移除\n    if (node.prev) {\n      node.prev.next = node.next;\n    }\n    if (node.next) {\n      node.next.prev = node.prev;\n    }\n    if (nodeAsUnknown === this.tail) {\n      this.tail = node.prev as unknown as LRUNode<unknown> | null;\n    }\n\n    // 移到头部\n    node.prev = null;\n    node.next = this.head as unknown as LRUNode<T> | null;\n    if (this.head) {\n      this.head.prev = nodeAsUnknown;\n    }\n    this.head = nodeAsUnknown;\n    if (!this.tail) {\n      this.tail = nodeAsUnknown;\n    }\n  }\n\n  /**\n   * 移除尾部节点（最久未使用）\n   */\n  private removeTail(): void {\n    if (!this.tail) {\n      return;\n    }\n\n    const key = this.tail.key;\n    this.memoryCache.delete(key);\n\n    if (this.tail.prev) {\n      this.tail.prev.next = null;\n      this.tail = this.tail.prev;\n    } else {\n      this.head = null;\n      this.tail = null;\n    }\n  }\n\n  /**\n   * 获取缓存\n   */\n  async get<T>(key: string): Promise<T | null> {\n    // 先检查内存缓存\n    const node = this.memoryCache.get(key);\n    if (node) {\n      const item = node.value;\n      if (item.expiresAt > Date.now()) {\n        // 移到头部（最近使用）\n        this.moveToHead(node as unknown as LRUNode<T>);\n        return item.data as T;\n      } else {\n        // 已过期，删除\n        this.memoryCache.delete(key);\n        if (node === this.head) {\n          this.head = node.next;\n        }\n        if (node === this.tail) {\n          this.tail = node.prev;\n        }\n        if (node.prev) {\n          node.prev.next = node.next;\n        }\n        if (node.next) {\n          node.next.prev = node.prev;\n        }\n      }\n    }\n\n    // 检查存储缓存\n    try {\n      const stored = await (this.storage as any).get(key);\n      if (stored) {\n        const item: CacheItem<T> = JSON.parse(stored);\n        if (item.expiresAt > Date.now()) {\n          // 更新内存缓存（使用 LRU）\n          this.setInMemory(key, item);\n          return item.data;\n        } else {\n          // 已过期，删除\n          await (this.storage as any).remove(key);\n        }\n      }\n    } catch (error) {\n      // 忽略解析错误\n    }\n\n    return null;\n  }\n\n  /**\n   * 在内存中设置缓存（LRU）\n   */\n  private setInMemory<T>(key: string, item: CacheItem<T>): void {\n    let node = this.memoryCache.get(key);\n\n    if (node) {\n      // 更新现有节点\n      node.value = item as unknown as CacheItem<unknown>;\n      this.moveToHead(node as unknown as LRUNode<T>);\n    } else {\n      // 创建新节点\n      node = {\n        key,\n        value: item as unknown as CacheItem<unknown>,\n        prev: null,\n        next: this.head,\n      } as LRUNode<unknown>;\n\n      if (this.head) {\n        this.head.prev = node;\n      }\n      this.head = node;\n      if (!this.tail) {\n        this.tail = node;\n      }\n\n      this.memoryCache.set(key, node);\n\n      // 如果超过最大大小，移除最久未使用的\n      if (this.memoryCache.size > this.config.maxSize) {\n        this.removeTail();\n      }\n    }\n  }\n\n  /**\n   * 设置缓存\n   */\n  async set<T>(key: string, data: T, ttl?: number): Promise<void> {\n    const expiresAt = Date.now() + (ttl || this.config.defaultTTL);\n    const item: CacheItem<T> = {\n      data,\n      expiresAt,\n      createdAt: Date.now(),\n    };\n\n    // 更新内存缓存（使用 LRU）\n    this.setInMemory(key, item);\n\n    // 更新存储缓存\n    try {\n      await (this.storage as any).set(key, item);\n    } catch (error) {\n      // 忽略存储错误\n    }\n  }\n\n  /**\n   * 删除缓存\n   */\n  async delete(key: string): Promise<void> {\n    const node = this.memoryCache.get(key);\n    if (node) {\n      // 从链表中移除\n      if (node.prev) {\n        node.prev.next = node.next;\n      }\n      if (node.next) {\n        node.next.prev = node.prev;\n      }\n      if (node === this.head) {\n        this.head = node.next;\n      }\n      if (node === this.tail) {\n        this.tail = node.prev;\n      }\n      this.memoryCache.delete(key);\n    }\n\n    try {\n      await (this.storage as any).remove(key);\n    } catch (error) {\n      // 忽略删除错误\n    }\n  }\n\n  /**\n   * 清空缓存\n   */\n  async clear(): Promise<void> {\n    this.memoryCache.clear();\n    // 注意：这里不清空 storage，因为可能包含其他数据\n  }\n\n  /**\n   * 清理过期项（优化版本：批量删除，减少 DOM 操作）\n   */\n  async cleanup(): Promise<void> {\n    const now = Date.now();\n    const keysToDelete: string[] = [];\n    const nodesToRemove: LRUNode<unknown>[] = [];\n\n    // 批量收集需要删除的项\n    for (const [key, node] of this.memoryCache.entries()) {\n      if (node.value.expiresAt <= now) {\n        keysToDelete.push(key);\n        nodesToRemove.push(node);\n      }\n    }\n\n    // 批量删除（优化性能）\n    if (keysToDelete.length > 0) {\n      // 从链表中移除节点\n      for (const node of nodesToRemove) {\n        if (node.prev) {\n          node.prev.next = node.next;\n        }\n        if (node.next) {\n          node.next.prev = node.prev;\n        }\n        if (node === this.head) {\n          this.head = node.next as unknown as LRUNode<unknown> | null;\n        }\n        if (node === this.tail) {\n          this.tail = node.prev as unknown as LRUNode<unknown> | null;\n        }\n      }\n\n      // 批量删除 Map 中的项\n      keysToDelete.forEach((key) => this.memoryCache.delete(key));\n    }\n\n    // 注意：存储缓存的清理由存储系统自己处理（通过过期时间）\n  }\n}\n"],"names":["MultiLevelCache","moveToHead","node","nodeAsUnknown","head","prev","next","tail","removeTail","key","memoryCache","delete","get","item","value","expiresAt","Date","now","data","stored","storage","JSON","parse","setInMemory","remove","error","set","size","config","maxSize","ttl","defaultTTL","createdAt","clear","cleanup","keysToDelete","nodesToRemove","entries","push","length","forEach","Map"],"mappings":";;;;;;;;;;;;;AA4CA;;CAEC,GACD,OAAO,MAAMA;IAeX;;GAEC,GACD,AAAQC,WAAcC,IAAgB,EAAQ;QAC5C,MAAMC,gBAAgBD;QACtB,IAAIC,kBAAkB,IAAI,CAACC,IAAI,EAAE;YAC/B;QACF;QAEA,UAAU;QACV,IAAIF,KAAKG,IAAI,EAAE;YACbH,KAAKG,IAAI,CAACC,IAAI,GAAGJ,KAAKI,IAAI;QAC5B;QACA,IAAIJ,KAAKI,IAAI,EAAE;YACbJ,KAAKI,IAAI,CAACD,IAAI,GAAGH,KAAKG,IAAI;QAC5B;QACA,IAAIF,kBAAkB,IAAI,CAACI,IAAI,EAAE;YAC/B,IAAI,CAACA,IAAI,GAAGL,KAAKG,IAAI;QACvB;QAEA,OAAO;QACPH,KAAKG,IAAI,GAAG;QACZH,KAAKI,IAAI,GAAG,IAAI,CAACF,IAAI;QACrB,IAAI,IAAI,CAACA,IAAI,EAAE;YACb,IAAI,CAACA,IAAI,CAACC,IAAI,GAAGF;QACnB;QACA,IAAI,CAACC,IAAI,GAAGD;QACZ,IAAI,CAAC,IAAI,CAACI,IAAI,EAAE;YACd,IAAI,CAACA,IAAI,GAAGJ;QACd;IACF;IAEA;;GAEC,GACD,AAAQK,aAAmB;QACzB,IAAI,CAAC,IAAI,CAACD,IAAI,EAAE;YACd;QACF;QAEA,MAAME,MAAM,IAAI,CAACF,IAAI,CAACE,GAAG;QACzB,IAAI,CAACC,WAAW,CAACC,MAAM,CAACF;QAExB,IAAI,IAAI,CAACF,IAAI,CAACF,IAAI,EAAE;YAClB,IAAI,CAACE,IAAI,CAACF,IAAI,CAACC,IAAI,GAAG;YACtB,IAAI,CAACC,IAAI,GAAG,IAAI,CAACA,IAAI,CAACF,IAAI;QAC5B,OAAO;YACL,IAAI,CAACD,IAAI,GAAG;YACZ,IAAI,CAACG,IAAI,GAAG;QACd;IACF;IAEA;;GAEC,GACD,MAAMK,IAAOH,GAAW,EAAqB;QAC3C,UAAU;QACV,MAAMP,OAAO,IAAI,CAACQ,WAAW,CAACE,GAAG,CAACH;QAClC,IAAIP,MAAM;YACR,MAAMW,OAAOX,KAAKY,KAAK;YACvB,IAAID,KAAKE,SAAS,GAAGC,KAAKC,GAAG,IAAI;gBAC/B,aAAa;gBACb,IAAI,CAAChB,UAAU,CAACC;gBAChB,OAAOW,KAAKK,IAAI;YAClB,OAAO;gBACL,SAAS;gBACT,IAAI,CAACR,WAAW,CAACC,MAAM,CAACF;gBACxB,IAAIP,SAAS,IAAI,CAACE,IAAI,EAAE;oBACtB,IAAI,CAACA,IAAI,GAAGF,KAAKI,IAAI;gBACvB;gBACA,IAAIJ,SAAS,IAAI,CAACK,IAAI,EAAE;oBACtB,IAAI,CAACA,IAAI,GAAGL,KAAKG,IAAI;gBACvB;gBACA,IAAIH,KAAKG,IAAI,EAAE;oBACbH,KAAKG,IAAI,CAACC,IAAI,GAAGJ,KAAKI,IAAI;gBAC5B;gBACA,IAAIJ,KAAKI,IAAI,EAAE;oBACbJ,KAAKI,IAAI,CAACD,IAAI,GAAGH,KAAKG,IAAI;gBAC5B;YACF;QACF;QAEA,SAAS;QACT,IAAI;YACF,MAAMc,SAAS,MAAM,AAAC,IAAI,CAACC,OAAO,CAASR,GAAG,CAACH;YAC/C,IAAIU,QAAQ;gBACV,MAAMN,OAAqBQ,KAAKC,KAAK,CAACH;gBACtC,IAAIN,KAAKE,SAAS,GAAGC,KAAKC,GAAG,IAAI;oBAC/B,iBAAiB;oBACjB,IAAI,CAACM,WAAW,CAACd,KAAKI;oBACtB,OAAOA,KAAKK,IAAI;gBAClB,OAAO;oBACL,SAAS;oBACT,MAAM,AAAC,IAAI,CAACE,OAAO,CAASI,MAAM,CAACf;gBACrC;YACF;QACF,EAAE,OAAOgB,OAAO;QACd,SAAS;QACX;QAEA,OAAO;IACT;IAEA;;GAEC,GACD,AAAQF,YAAed,GAAW,EAAEI,IAAkB,EAAQ;QAC5D,IAAIX,OAAO,IAAI,CAACQ,WAAW,CAACE,GAAG,CAACH;QAEhC,IAAIP,MAAM;YACR,SAAS;YACTA,KAAKY,KAAK,GAAGD;YACb,IAAI,CAACZ,UAAU,CAACC;QAClB,OAAO;YACL,QAAQ;YACRA,OAAO;gBACLO;gBACAK,OAAOD;gBACPR,MAAM;gBACNC,MAAM,IAAI,CAACF,IAAI;YACjB;YAEA,IAAI,IAAI,CAACA,IAAI,EAAE;gBACb,IAAI,CAACA,IAAI,CAACC,IAAI,GAAGH;YACnB;YACA,IAAI,CAACE,IAAI,GAAGF;YACZ,IAAI,CAAC,IAAI,CAACK,IAAI,EAAE;gBACd,IAAI,CAACA,IAAI,GAAGL;YACd;YAEA,IAAI,CAACQ,WAAW,CAACgB,GAAG,CAACjB,KAAKP;YAE1B,oBAAoB;YACpB,IAAI,IAAI,CAACQ,WAAW,CAACiB,IAAI,GAAG,IAAI,CAACC,MAAM,CAACC,OAAO,EAAE;gBAC/C,IAAI,CAACrB,UAAU;YACjB;QACF;IACF;IAEA;;GAEC,GACD,MAAMkB,IAAOjB,GAAW,EAAES,IAAO,EAAEY,GAAY,EAAiB;QAC9D,MAAMf,YAAYC,KAAKC,GAAG,KAAMa,CAAAA,OAAO,IAAI,CAACF,MAAM,CAACG,UAAU,AAAD;QAC5D,MAAMlB,OAAqB;YACzBK;YACAH;YACAiB,WAAWhB,KAAKC,GAAG;QACrB;QAEA,iBAAiB;QACjB,IAAI,CAACM,WAAW,CAACd,KAAKI;QAEtB,SAAS;QACT,IAAI;YACF,MAAM,AAAC,IAAI,CAACO,OAAO,CAASM,GAAG,CAACjB,KAAKI;QACvC,EAAE,OAAOY,OAAO;QACd,SAAS;QACX;IACF;IAEA;;GAEC,GACD,MAAMd,OAAOF,GAAW,EAAiB;QACvC,MAAMP,OAAO,IAAI,CAACQ,WAAW,CAACE,GAAG,CAACH;QAClC,IAAIP,MAAM;YACR,SAAS;YACT,IAAIA,KAAKG,IAAI,EAAE;gBACbH,KAAKG,IAAI,CAACC,IAAI,GAAGJ,KAAKI,IAAI;YAC5B;YACA,IAAIJ,KAAKI,IAAI,EAAE;gBACbJ,KAAKI,IAAI,CAACD,IAAI,GAAGH,KAAKG,IAAI;YAC5B;YACA,IAAIH,SAAS,IAAI,CAACE,IAAI,EAAE;gBACtB,IAAI,CAACA,IAAI,GAAGF,KAAKI,IAAI;YACvB;YACA,IAAIJ,SAAS,IAAI,CAACK,IAAI,EAAE;gBACtB,IAAI,CAACA,IAAI,GAAGL,KAAKG,IAAI;YACvB;YACA,IAAI,CAACK,WAAW,CAACC,MAAM,CAACF;QAC1B;QAEA,IAAI;YACF,MAAM,AAAC,IAAI,CAACW,OAAO,CAASI,MAAM,CAACf;QACrC,EAAE,OAAOgB,OAAO;QACd,SAAS;QACX;IACF;IAEA;;GAEC,GACD,MAAMQ,QAAuB;QAC3B,IAAI,CAACvB,WAAW,CAACuB,KAAK;IACtB,8BAA8B;IAChC;IAEA;;GAEC,GACD,MAAMC,UAAyB;QAC7B,MAAMjB,MAAMD,KAAKC,GAAG;QACpB,MAAMkB,eAAyB,EAAE;QACjC,MAAMC,gBAAoC,EAAE;QAE5C,aAAa;QACb,KAAK,MAAM,CAAC3B,KAAKP,KAAK,IAAI,IAAI,CAACQ,WAAW,CAAC2B,OAAO,GAAI;YACpD,IAAInC,KAAKY,KAAK,CAACC,SAAS,IAAIE,KAAK;gBAC/BkB,aAAaG,IAAI,CAAC7B;gBAClB2B,cAAcE,IAAI,CAACpC;YACrB;QACF;QAEA,aAAa;QACb,IAAIiC,aAAaI,MAAM,GAAG,GAAG;YAC3B,WAAW;YACX,KAAK,MAAMrC,QAAQkC,cAAe;gBAChC,IAAIlC,KAAKG,IAAI,EAAE;oBACbH,KAAKG,IAAI,CAACC,IAAI,GAAGJ,KAAKI,IAAI;gBAC5B;gBACA,IAAIJ,KAAKI,IAAI,EAAE;oBACbJ,KAAKI,IAAI,CAACD,IAAI,GAAGH,KAAKG,IAAI;gBAC5B;gBACA,IAAIH,SAAS,IAAI,CAACE,IAAI,EAAE;oBACtB,IAAI,CAACA,IAAI,GAAGF,KAAKI,IAAI;gBACvB;gBACA,IAAIJ,SAAS,IAAI,CAACK,IAAI,EAAE;oBACtB,IAAI,CAACA,IAAI,GAAGL,KAAKG,IAAI;gBACvB;YACF;YAEA,eAAe;YACf8B,aAAaK,OAAO,CAAC,CAAC/B,MAAQ,IAAI,CAACC,WAAW,CAACC,MAAM,CAACF;QACxD;IAEA,8BAA8B;IAChC;IArPA,YAAYW,OAAwB,EAAEQ,SAAsB,CAAC,CAAC,CAAE;QANhE,uBAAQlB,eAA6C,IAAI+B;QACzD,uBAAQrB,WAAR,KAAA;QACA,uBAAQQ,UAAR,KAAA;QACA,uBAAQxB,QAAgC;QACxC,uBAAQG,QAAgC;QAGtC,IAAI,CAACa,OAAO,GAAGA;QACf,IAAI,CAACQ,MAAM,GAAG;YACZG,YAAYH,OAAOG,UAAU,IAAI,KAAK,KAAK,KAAK;YAChDF,SAASD,OAAOC,OAAO,IAAI;QAC7B;IACF;AAgPF"}