@alibarbar/common 1.0.9 → 1.1.0

package/dist/chunk-A4SWQXX7.mjs

@@ -1,484 +0,0 @@
-// src/data/data-structure.ts
-var Stack = class {
-  constructor() {
-    this.items = [];
-  }
-  /**
-   * 入栈
-   */
-  push(item) {
-    this.items.push(item);
-  }
-  /**
-   * 出栈
-   */
-  pop() {
-    return this.items.pop();
-  }
-  /**
-   * 查看栈顶元素
-   */
-  peek() {
-    return this.items[this.items.length - 1];
-  }
-  /**
-   * 判断栈是否为空
-   */
-  isEmpty() {
-    return this.items.length === 0;
-  }
-  /**
-   * 获取栈的大小
-   */
-  size() {
-    return this.items.length;
-  }
-  /**
-   * 清空栈
-   */
-  clear() {
-    this.items = [];
-  }
-  /**
-   * 转换为数组
-   */
-  toArray() {
-    return [...this.items];
-  }
-};
-var DataQueue = class {
-  constructor() {
-    this.items = [];
-  }
-  /**
-   * 入队
-   */
-  enqueue(item) {
-    this.items.push(item);
-  }
-  /**
-   * 出队
-   */
-  dequeue() {
-    return this.items.shift();
-  }
-  /**
-   * 查看队首元素
-   */
-  front() {
-    return this.items[0];
-  }
-  /**
-   * 判断队列是否为空
-   */
-  isEmpty() {
-    return this.items.length === 0;
-  }
-  /**
-   * 获取队列的大小
-   */
-  size() {
-    return this.items.length;
-  }
-  /**
-   * 清空队列
-   */
-  clear() {
-    this.items = [];
-  }
-  /**
-   * 转换为数组
-   */
-  toArray() {
-    return [...this.items];
-  }
-};
-var ListNode = class {
-  constructor(value) {
-    this.next = null;
-    this.value = value;
-  }
-};
-var LinkedList = class {
-  constructor() {
-    this.head = null;
-    this.length = 0;
-  }
-  /**
-   * 在链表末尾添加元素
-   */
-  append(value) {
-    const newNode = new ListNode(value);
-    if (!this.head) {
-      this.head = newNode;
-    } else {
-      let current = this.head;
-      while (current.next) {
-        current = current.next;
-      }
-      current.next = newNode;
-    }
-    this.length++;
-  }
-  /**
-   * 在指定位置插入元素
-   */
-  insert(index, value) {
-    if (index < 0 || index > this.length) {
-      return false;
-    }
-    const newNode = new ListNode(value);
-    if (index === 0) {
-      newNode.next = this.head;
-      this.head = newNode;
-    } else {
-      let current = this.head;
-      for (let i = 0; i < index - 1; i++) {
-        current = current.next;
-      }
-      newNode.next = current.next;
-      current.next = newNode;
-    }
-    this.length++;
-    return true;
-  }
-  /**
-   * 删除指定位置的元素
-   */
-  removeAt(index) {
-    if (index < 0 || index >= this.length || !this.head) {
-      return null;
-    }
-    let current = this.head;
-    if (index === 0) {
-      this.head = current.next;
-      this.length--;
-      return current.value;
-    }
-    for (let i = 0; i < index - 1; i++) {
-      current = current.next;
-    }
-    const removed = current.next;
-    current.next = removed.next;
-    this.length--;
-    return removed.value;
-  }
-  /**
-   * 查找元素索引
-   */
-  indexOf(value) {
-    let current = this.head;
-    let index = 0;
-    while (current) {
-      if (current.value === value) {
-        return index;
-      }
-      current = current.next;
-      index++;
-    }
-    return -1;
-  }
-  /**
-   * 获取指定位置的元素
-   */
-  get(index) {
-    if (index < 0 || index >= this.length || !this.head) {
-      return null;
-    }
-    let current = this.head;
-    for (let i = 0; i < index; i++) {
-      current = current.next;
-    }
-    return current.value;
-  }
-  /**
-   * 判断链表是否为空
-   */
-  isEmpty() {
-    return this.length === 0;
-  }
-  /**
-   * 获取链表长度
-   */
-  size() {
-    return this.length;
-  }
-  /**
-   * 转换为数组
-   */
-  toArray() {
-    const result = [];
-    let current = this.head;
-    while (current) {
-      result.push(current.value);
-      current = current.next;
-    }
-    return result;
-  }
-};
-var TreeNode = class {
-  constructor(value) {
-    this.left = null;
-    this.right = null;
-    this.value = value;
-  }
-};
-var BinaryTree = class {
-  constructor() {
-    this.root = null;
-  }
-  /**
-   * 插入节点
-   */
-  insert(value) {
-    const newNode = new TreeNode(value);
-    if (!this.root) {
-      this.root = newNode;
-      return;
-    }
-    this.insertNode(this.root, newNode);
-  }
-  insertNode(node, newNode) {
-    if (newNode.value <= node.value) {
-      if (!node.left) {
-        node.left = newNode;
-      } else {
-        this.insertNode(node.left, newNode);
-      }
-    } else {
-      if (!node.right) {
-        node.right = newNode;
-      } else {
-        this.insertNode(node.right, newNode);
-      }
-    }
-  }
-  /**
-   * 查找节点
-   */
-  search(value) {
-    return this.searchNode(this.root, value);
-  }
-  searchNode(node, value) {
-    if (!node) {
-      return false;
-    }
-    if (value === node.value) {
-      return true;
-    }
-    if (value < node.value) {
-      return this.searchNode(node.left, value);
-    }
-    return this.searchNode(node.right, value);
-  }
-  /**
-   * 中序遍历
-   */
-  inOrder() {
-    const result = [];
-    this.inOrderTraverse(this.root, result);
-    return result;
-  }
-  inOrderTraverse(node, result) {
-    if (node) {
-      this.inOrderTraverse(node.left, result);
-      result.push(node.value);
-      this.inOrderTraverse(node.right, result);
-    }
-  }
-  /**
-   * 前序遍历
-   */
-  preOrder() {
-    const result = [];
-    this.preOrderTraverse(this.root, result);
-    return result;
-  }
-  preOrderTraverse(node, result) {
-    if (node) {
-      result.push(node.value);
-      this.preOrderTraverse(node.left, result);
-      this.preOrderTraverse(node.right, result);
-    }
-  }
-  /**
-   * 后序遍历
-   */
-  postOrder() {
-    const result = [];
-    this.postOrderTraverse(this.root, result);
-    return result;
-  }
-  postOrderTraverse(node, result) {
-    if (node) {
-      this.postOrderTraverse(node.left, result);
-      this.postOrderTraverse(node.right, result);
-      result.push(node.value);
-    }
-  }
-};
-var Graph = class {
-  constructor() {
-    this.vertices = /* @__PURE__ */ new Map();
-  }
-  /**
-   * 添加顶点
-   */
-  addVertex(vertex) {
-    if (!this.vertices.has(vertex)) {
-      this.vertices.set(vertex, []);
-    }
-  }
-  /**
-   * 添加边（无向图）
-   */
-  addEdge(vertex1, vertex2) {
-    if (!this.vertices.has(vertex1)) {
-      this.addVertex(vertex1);
-    }
-    if (!this.vertices.has(vertex2)) {
-      this.addVertex(vertex2);
-    }
-    const neighbors1 = this.vertices.get(vertex1);
-    const neighbors2 = this.vertices.get(vertex2);
-    if (!neighbors1.includes(vertex2)) {
-      neighbors1.push(vertex2);
-    }
-    if (!neighbors2.includes(vertex1)) {
-      neighbors2.push(vertex1);
-    }
-  }
-  /**
-   * 获取顶点的邻居
-   */
-  getNeighbors(vertex) {
-    return this.vertices.get(vertex) || [];
-  }
-  /**
-   * 深度优先搜索
-   */
-  dfs(start, callback) {
-    const visited = /* @__PURE__ */ new Set();
-    const result = [];
-    const dfsVisit = (vertex) => {
-      visited.add(vertex);
-      result.push(vertex);
-      if (callback) {
-        callback(vertex);
-      }
-      const neighbors = this.getNeighbors(vertex);
-      for (const neighbor of neighbors) {
-        if (!visited.has(neighbor)) {
-          dfsVisit(neighbor);
-        }
-      }
-    };
-    dfsVisit(start);
-    return result;
-  }
-  /**
-   * 广度优先搜索
-   */
-  bfs(start, callback) {
-    const visited = /* @__PURE__ */ new Set();
-    const queue = [start];
-    const result = [];
-    visited.add(start);
-    while (queue.length > 0) {
-      const vertex = queue.shift();
-      result.push(vertex);
-      if (callback) {
-        callback(vertex);
-      }
-      const neighbors = this.getNeighbors(vertex);
-      for (const neighbor of neighbors) {
-        if (!visited.has(neighbor)) {
-          visited.add(neighbor);
-          queue.push(neighbor);
-        }
-      }
-    }
-    return result;
-  }
-  /**
-   * 获取所有顶点
-   */
-  getVertices() {
-    return Array.from(this.vertices.keys());
-  }
-};
-var LRUCache = class {
-  constructor(capacity) {
-    if (capacity <= 0) {
-      throw new Error("Capacity must be greater than 0");
-    }
-    this.capacity = capacity;
-    this.cache = /* @__PURE__ */ new Map();
-  }
-  /**
-   * 获取值
-   */
-  get(key) {
-    if (!this.cache.has(key)) {
-      return void 0;
-    }
-    const value = this.cache.get(key);
-    this.cache.delete(key);
-    this.cache.set(key, value);
-    return value;
-  }
-  /**
-   * 设置值
-   */
-  set(key, value) {
-    if (this.cache.has(key)) {
-      this.cache.delete(key);
-    } else if (this.cache.size >= this.capacity) {
-      const firstKey = this.cache.keys().next().value;
-      if (firstKey !== void 0) {
-        this.cache.delete(firstKey);
-      }
-    }
-    this.cache.set(key, value);
-  }
-  /**
-   * 删除键
-   */
-  delete(key) {
-    return this.cache.delete(key);
-  }
-  /**
-   * 清空缓存
-   */
-  clear() {
-    this.cache.clear();
-  }
-  /**
-   * 判断是否包含键
-   */
-  has(key) {
-    return this.cache.has(key);
-  }
-  /**
-   * 获取缓存大小
-   */
-  size() {
-    return this.cache.size;
-  }
-  /**
-   * 获取所有键
-   */
-  keys() {
-    return Array.from(this.cache.keys()).filter((key) => key !== void 0);
-  }
-  /**
-   * 获取所有值
-   */
-  values() {
-    return Array.from(this.cache.values());
-  }
-};
-
-export { BinaryTree, DataQueue, Graph, LRUCache, LinkedList, Stack };
-//# sourceMappingURL=chunk-A4SWQXX7.mjs.map
-//# sourceMappingURL=chunk-A4SWQXX7.mjs.map

package/dist/chunk-A4SWQXX7.mjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/data/data-structure.ts"],"names":[],"mappings":";AAOO,IAAM,QAAN,MAAe;AAAA,EAAf,WAAA,GAAA;AACL,IAAA,IAAA,CAAQ,QAAa,EAAC;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAKtB,KAAK,IAAA,EAAe;AAClB,IAAA,IAAA,CAAK,KAAA,CAAM,KAAK,IAAI,CAAA;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA,EAKA,GAAA,GAAqB;AACnB,IAAA,OAAO,IAAA,CAAK,MAAM,GAAA,EAAI;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA,EAKA,IAAA,GAAsB;AACpB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,KAAA,CAAM,SAAS,CAAC,CAAA;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA,EAKA,OAAA,GAAmB;AACjB,IAAA,OAAO,IAAA,CAAK,MAAM,MAAA,KAAW,CAAA;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA,EAKA,IAAA,GAAe;AACb,IAAA,OAAO,KAAK,KAAA,CAAM,MAAA;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA,EAKA,KAAA,GAAc;AACZ,IAAA,IAAA,CAAK,QAAQ,EAAC;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA,EAKA,OAAA,GAAe;AACb,IAAA,OAAO,CAAC,GAAG,IAAA,CAAK,KAAK,CAAA;AAAA,EACvB;AACF;AAKO,IAAM,YAAN,MAAmB;AAAA,EAAnB,WAAA,GAAA;AACL,IAAA,IAAA,CAAQ,QAAa,EAAC;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAKtB,QAAQ,IAAA,EAAe;AACrB,IAAA,IAAA,CAAK,KAAA,CAAM,KAAK,IAAI,CAAA;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA,EAKA,OAAA,GAAyB;AACvB,IAAA,OAAO,IAAA,CAAK,MAAM,KAAA,EAAM;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA,EAKA,KAAA,GAAuB;AACrB,IAAA,OAAO,IAAA,CAAK,MAAM,CAAC,CAAA;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA,EAKA,OAAA,GAAmB;AACjB,IAAA,OAAO,IAAA,CAAK,MAAM,MAAA,KAAW,CAAA;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA,EAKA,IAAA,GAAe;AACb,IAAA,OAAO,KAAK,KAAA,CAAM,MAAA;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA,EAKA,KAAA,GAAc;AACZ,IAAA,IAAA,CAAK,QAAQ,EAAC;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA,EAKA,OAAA,GAAe;AACb,IAAA,OAAO,CAAC,GAAG,IAAA,CAAK,KAAK,CAAA;AAAA,EACvB;AACF;AAKA,IAAM,WAAN,MAAkB;AAAA,EAIhB,YAAY,KAAA,EAAU;AAFtB,IAAA,IAAA,CAAA,IAAA,GAA2B,IAAA;AAGzB,IAAA,IAAA,CAAK,KAAA,GAAQ,KAAA;AAAA,EACf;AACF,CAAA;AAKO,IAAM,aAAN,MAAoB;AAAA,EAApB,WAAA,GAAA;AACL,IAAA,IAAA,CAAQ,IAAA,GAA2B,IAAA;AACnC,IAAA,IAAA,CAAQ,MAAA,GAAS,CAAA;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAKjB,OAAO,KAAA,EAAgB;AACrB,IAAA,MAAM,OAAA,GAAU,IAAI,QAAA,CAAS,KAAK,CAAA;AAElC,IAAA,IAAI,CAAC,KAAK,IAAA,EAAM;AACd,MAAA,IAAA,CAAK,IAAA,GAAO,OAAA;AAAA,IACd,CAAA,MAAO;AACL,MAAA,IAAI,UAAU,IAAA,CAAK,IAAA;AACnB,MAAA,OAAO,QAAQ,IAAA,EAAM;AACnB,QAAA,OAAA,GAAU,OAAA,CAAQ,IAAA;AAAA,MACpB;AACA,MAAA,OAAA,CAAQ,IAAA,GAAO,OAAA;AAAA,IACjB;AAEA,IAAA,IAAA,CAAK,MAAA,EAAA;AAAA,EACP;AAAA;AAAA;AAAA;AAAA,EAKA,MAAA,CAAO,OAAe,KAAA,EAAmB;AACvC,IAAA,IAAI,KAAA,GAAQ,CAAA,IAAK,KAAA,GAAQ,IAAA,CAAK,MAAA,EAAQ;AACpC,MAAA,OAAO,KAAA;AAAA,IACT;AAEA,IAAA,MAAM,OAAA,GAAU,IAAI,QAAA,CAAS,KAAK,CAAA;AAElC,IAAA,IAAI,UAAU,CAAA,EAAG;AACf,MAAA,OAAA,CAAQ,OAAO,IAAA,CAAK,IAAA;AACpB,MAAA,IAAA,CAAK,IAAA,GAAO,OAAA;AAAA,IACd,CAAA,MAAO;AACL,MAAA,IAAI,UAAU,IAAA,CAAK,IAAA;AACnB,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,GAAQ,GAAG,CAAA,EAAA,EAAK;AAClC,QAAA,OAAA,GAAU,OAAA,CAAS,IAAA;AAAA,MACrB;AACA,MAAA,OAAA,CAAQ,OAAO,OAAA,CAAS,IAAA;AACxB,MAAA,OAAA,CAAS,IAAA,GAAO,OAAA;AAAA,IAClB;AAEA,IAAA,IAAA,CAAK,MAAA,EAAA;AACL,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,SAAS,KAAA,EAAyB;AAChC,IAAA,IAAI,QAAQ,CAAA,IAAK,KAAA,IAAS,KAAK,MAAA,IAAU,CAAC,KAAK,IAAA,EAAM;AACnD,MAAA,OAAO,IAAA;AAAA,IACT;AAEA,IAAA,IAAI,UAAU,IAAA,CAAK,IAAA;AAEnB,IAAA,IAAI,UAAU,CAAA,EAAG;AACf,MAAA,IAAA,CAAK,OAAO,OAAA,CAAQ,IAAA;AACpB,MAAA,IAAA,CAAK,MAAA,EAAA;AACL,MAAA,OAAO,OAAA,CAAQ,KAAA;AAAA,IACjB;AAEA,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,GAAQ,GAAG,CAAA,EAAA,EAAK;AAClC,MAAA,OAAA,GAAU,OAAA,CAAQ,IAAA;AAAA,IACpB;AAEA,IAAA,MAAM,UAAU,OAAA,CAAQ,IAAA;AACxB,IAAA,OAAA,CAAQ,OAAO,OAAA,CAAQ,IAAA;AACvB,IAAA,IAAA,CAAK,MAAA,EAAA;AAEL,IAAA,OAAO,OAAA,CAAQ,KAAA;AAAA,EACjB;AAAA;AAAA;AAAA;AAAA,EAKA,QAAQ,KAAA,EAAkB;AACxB,IAAA,IAAI,UAAU,IAAA,CAAK,IAAA;AACnB,IAAA,IAAI,KAAA,GAAQ,CAAA;AAEZ,IAAA,OAAO,OAAA,EAAS;AACd,MAAA,IAAI,OAAA,CAAQ,UAAU,KAAA,EAAO;AAC3B,QAAA,OAAO,KAAA;AAAA,MACT;AACA,MAAA,OAAA,GAAU,OAAA,CAAQ,IAAA;AAClB,MAAA,KAAA,EAAA;AAAA,IACF;AAEA,IAAA,OAAO,EAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,KAAA,EAAyB;AAC3B,IAAA,IAAI,QAAQ,CAAA,IAAK,KAAA,IAAS,KAAK,MAAA,IAAU,CAAC,KAAK,IAAA,EAAM;AACnD,MAAA,OAAO,IAAA;AAAA,IACT;AAEA,IAAA,IAAI,UAAU,IAAA,CAAK,IAAA;AACnB,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,EAAO,CAAA,EAAA,EAAK;AAC9B,MAAA,OAAA,GAAU,OAAA,CAAQ,IAAA;AAAA,IACpB;AAEA,IAAA,OAAO,OAAA,CAAQ,KAAA;AAAA,EACjB;AAAA;AAAA;AAAA;AAAA,EAKA,OAAA,GAAmB;AACjB,IAAA,OAAO,KAAK,MAAA,KAAW,CAAA;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA,EAKA,IAAA,GAAe;AACb,IAAA,OAAO,IAAA,CAAK,MAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKA,OAAA,GAAe;AACb,IAAA,MAAM,SAAc,EAAC;AACrB,IAAA,IAAI,UAAU,IAAA,CAAK,IAAA;AAEnB,IAAA,OAAO,OAAA,EAAS;AACd,MAAA,MAAA,CAAO,IAAA,CAAK,QAAQ,KAAK,CAAA;AACzB,MAAA,OAAA,GAAU,OAAA,CAAQ,IAAA;AAAA,IACpB;AAEA,IAAA,OAAO,MAAA;AAAA,EACT;AACF;AAKA,IAAM,WAAN,MAAkB;AAAA,EAKhB,YAAY,KAAA,EAAU;AAHtB,IAAA,IAAA,CAAA,IAAA,GAA2B,IAAA;AAC3B,IAAA,IAAA,CAAA,KAAA,GAA4B,IAAA;AAG1B,IAAA,IAAA,CAAK,KAAA,GAAQ,KAAA;AAAA,EACf;AACF,CAAA;AAKO,IAAM,aAAN,MAAoB;AAAA,EAApB,WAAA,GAAA;AACL,IAAA,IAAA,CAAQ,IAAA,GAA2B,IAAA;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAKnC,OAAO,KAAA,EAAgB;AACrB,IAAA,MAAM,OAAA,GAAU,IAAI,QAAA,CAAS,KAAK,CAAA;AAElC,IAAA,IAAI,CAAC,KAAK,IAAA,EAAM;AACd,MAAA,IAAA,CAAK,IAAA,GAAO,OAAA;AACZ,MAAA;AAAA,IACF;AAEA,IAAA,IAAA,CAAK,UAAA,CAAW,IAAA,CAAK,IAAA,EAAM,OAAO,CAAA;AAAA,EACpC;AAAA,EAEQ,UAAA,CAAW,MAAmB,OAAA,EAA4B;AAEhE,IAAA,IAAI,OAAA,CAAQ,KAAA,IAAS,IAAA,CAAK,KAAA,EAAO;AAC/B,MAAA,IAAI,CAAC,KAAK,IAAA,EAAM;AACd,QAAA,IAAA,CAAK,IAAA,GAAO,OAAA;AAAA,MACd,CAAA,MAAO;AACL,QAAA,IAAA,CAAK,UAAA,CAAW,IAAA,CAAK,IAAA,EAAM,OAAO,CAAA;AAAA,MACpC;AAAA,IACF,CAAA,MAAO;AACL,MAAA,IAAI,CAAC,KAAK,KAAA,EAAO;AACf,QAAA,IAAA,CAAK,KAAA,GAAQ,OAAA;AAAA,MACf,CAAA,MAAO;AACL,QAAA,IAAA,CAAK,UAAA,CAAW,IAAA,CAAK,KAAA,EAAO,OAAO,CAAA;AAAA,MACrC;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,KAAA,EAAmB;AACxB,IAAA,OAAO,IAAA,CAAK,UAAA,CAAW,IAAA,CAAK,IAAA,EAAM,KAAK,CAAA;AAAA,EACzC;AAAA,EAEQ,UAAA,CAAW,MAA0B,KAAA,EAAmB;AAC9D,IAAA,IAAI,CAAC,IAAA,EAAM;AACT,MAAA,OAAO,KAAA;AAAA,IACT;AAEA,IAAA,IAAI,KAAA,KAAU,KAAK,KAAA,EAAO;AACxB,MAAA,OAAO,IAAA;AAAA,IACT;AAEA,IAAA,IAAI,KAAA,GAAQ,KAAK,KAAA,EAAO;AACtB,MAAA,OAAO,IAAA,CAAK,UAAA,CAAW,IAAA,CAAK,IAAA,EAAM,KAAK,CAAA;AAAA,IACzC;AAEA,IAAA,OAAO,IAAA,CAAK,UAAA,CAAW,IAAA,CAAK,KAAA,EAAO,KAAK,CAAA;AAAA,EAC1C;AAAA;AAAA;AAAA;AAAA,EAKA,OAAA,GAAe;AACb,IAAA,MAAM,SAAc,EAAC;AACrB,IAAA,IAAA,CAAK,eAAA,CAAgB,IAAA,CAAK,IAAA,EAAM,MAAM,CAAA;AACtC,IAAA,OAAO,MAAA;AAAA,EACT;AAAA,EAEQ,eAAA,CAAgB,MAA0B,MAAA,EAAmB;AACnE,IAAA,IAAI,IAAA,EAAM;AACR,MAAA,IAAA,CAAK,eAAA,CAAgB,IAAA,CAAK,IAAA,EAAM,MAAM,CAAA;AACtC,MAAA,MAAA,CAAO,IAAA,CAAK,KAAK,KAAK,CAAA;AACtB,MAAA,IAAA,CAAK,eAAA,CAAgB,IAAA,CAAK,KAAA,EAAO,MAAM,CAAA;AAAA,IACzC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,QAAA,GAAgB;AACd,IAAA,MAAM,SAAc,EAAC;AACrB,IAAA,IAAA,CAAK,gBAAA,CAAiB,IAAA,CAAK,IAAA,EAAM,MAAM,CAAA;AACvC,IAAA,OAAO,MAAA;AAAA,EACT;AAAA,EAEQ,gBAAA,CAAiB,MAA0B,MAAA,EAAmB;AACpE,IAAA,IAAI,IAAA,EAAM;AACR,MAAA,MAAA,CAAO,IAAA,CAAK,KAAK,KAAK,CAAA;AACtB,MAAA,IAAA,CAAK,gBAAA,CAAiB,IAAA,CAAK,IAAA,EAAM,MAAM,CAAA;AACvC,MAAA,IAAA,CAAK,gBAAA,CAAiB,IAAA,CAAK,KAAA,EAAO,MAAM,CAAA;AAAA,IAC1C;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,SAAA,GAAiB;AACf,IAAA,MAAM,SAAc,EAAC;AACrB,IAAA,IAAA,CAAK,iBAAA,CAAkB,IAAA,CAAK,IAAA,EAAM,MAAM,CAAA;AACxC,IAAA,OAAO,MAAA;AAAA,EACT;AAAA,EAEQ,iBAAA,CAAkB,MAA0B,MAAA,EAAmB;AACrE,IAAA,IAAI,IAAA,EAAM;AACR,MAAA,IAAA,CAAK,iBAAA,CAAkB,IAAA,CAAK,IAAA,EAAM,MAAM,CAAA;AACxC,MAAA,IAAA,CAAK,iBAAA,CAAkB,IAAA,CAAK,KAAA,EAAO,MAAM,CAAA;AACzC,MAAA,MAAA,CAAO,IAAA,CAAK,KAAK,KAAK,CAAA;AAAA,IACxB;AAAA,EACF;AACF;AAKO,IAAM,QAAN,MAAe;AAAA,EAAf,WAAA,GAAA;AACL,IAAA,IAAA,CAAQ,QAAA,uBAA4B,GAAA,EAAI;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAKxC,UAAU,MAAA,EAAiB;AACzB,IAAA,IAAI,CAAC,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,MAAM,CAAA,EAAG;AAC9B,MAAA,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,MAAA,EAAQ,EAAE,CAAA;AAAA,IAC9B;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAA,CAAQ,SAAY,OAAA,EAAkB;AACpC,IAAA,IAAI,CAAC,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,OAAO,CAAA,EAAG;AAC/B,MAAA,IAAA,CAAK,UAAU,OAAO,CAAA;AAAA,IACxB;AACA,IAAA,IAAI,CAAC,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,OAAO,CAAA,EAAG;AAC/B,MAAA,IAAA,CAAK,UAAU,OAAO,CAAA;AAAA,IACxB;AAEA,IAAA,MAAM,UAAA,GAAa,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,OAAO,CAAA;AAC5C,IAAA,MAAM,UAAA,GAAa,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,OAAO,CAAA;AAE5C,IAAA,IAAI,CAAC,UAAA,CAAW,QAAA,CAAS,OAAO,CAAA,EAAG;AACjC,MAAA,UAAA,CAAW,KAAK,OAAO,CAAA;AAAA,IACzB;AACA,IAAA,IAAI,CAAC,UAAA,CAAW,QAAA,CAAS,OAAO,CAAA,EAAG;AACjC,MAAA,UAAA,CAAW,KAAK,OAAO,CAAA;AAAA,IACzB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,aAAa,MAAA,EAAgB;AAC3B,IAAA,OAAO,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,MAAM,KAAK,EAAC;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA,EAKA,GAAA,CAAI,OAAU,QAAA,EAAqC;AACjD,IAAA,MAAM,OAAA,uBAAc,GAAA,EAAO;AAC3B,IAAA,MAAM,SAAc,EAAC;AAErB,IAAA,MAAM,QAAA,GAAW,CAAC,MAAA,KAAoB;AACpC,MAAA,OAAA,CAAQ,IAAI,MAAM,CAAA;AAClB,MAAA,MAAA,CAAO,KAAK,MAAM,CAAA;AAClB,MAAA,IAAI,QAAA,EAAU;AACZ,QAAA,QAAA,CAAS,MAAM,CAAA;AAAA,MACjB;AAEA,MAAA,MAAM,SAAA,GAAY,IAAA,CAAK,YAAA,CAAa,MAAM,CAAA;AAC1C,MAAA,KAAA,MAAW,YAAY,SAAA,EAAW;AAChC,QAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,QAAQ,CAAA,EAAG;AAC1B,UAAA,QAAA,CAAS,QAAQ,CAAA;AAAA,QACnB;AAAA,MACF;AAAA,IACF,CAAA;AAEA,IAAA,QAAA,CAAS,KAAK,CAAA;AACd,IAAA,OAAO,MAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,GAAA,CAAI,OAAU,QAAA,EAAqC;AACjD,IAAA,MAAM,OAAA,uBAAc,GAAA,EAAO;AAC3B,IAAA,MAAM,KAAA,GAAa,CAAC,KAAK,CAAA;AACzB,IAAA,MAAM,SAAc,EAAC;AAErB,IAAA,OAAA,CAAQ,IAAI,KAAK,CAAA;AAEjB,IAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,MAAA,MAAM,MAAA,GAAS,MAAM,KAAA,EAAM;AAC3B,MAAA,MAAA,CAAO,KAAK,MAAM,CAAA;AAClB,MAAA,IAAI,QAAA,EAAU;AACZ,QAAA,QAAA,CAAS,MAAM,CAAA;AAAA,MACjB;AAEA,MAAA,MAAM,SAAA,GAAY,IAAA,CAAK,YAAA,CAAa,MAAM,CAAA;AAC1C,MAAA,KAAA,MAAW,YAAY,SAAA,EAAW;AAChC,QAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,QAAQ,CAAA,EAAG;AAC1B,UAAA,OAAA,CAAQ,IAAI,QAAQ,CAAA;AACpB,UAAA,KAAA,CAAM,KAAK,QAAQ,CAAA;AAAA,QACrB;AAAA,MACF;AAAA,IACF;AAEA,IAAA,OAAO,MAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,WAAA,GAAmB;AACjB,IAAA,OAAO,KAAA,CAAM,IAAA,CAAK,IAAA,CAAK,QAAA,CAAS,MAAM,CAAA;AAAA,EACxC;AACF;AAKO,IAAM,WAAN,MAAqB;AAAA,EAI1B,YAAY,QAAA,EAAkB;AAC5B,IAAA,IAAI,YAAY,CAAA,EAAG;AACjB,MAAA,MAAM,IAAI,MAAM,iCAAiC,CAAA;AAAA,IACnD;AACA,IAAA,IAAA,CAAK,QAAA,GAAW,QAAA;AAChB,IAAA,IAAA,CAAK,KAAA,uBAAY,GAAA,EAAI;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,GAAA,EAAuB;AACzB,IAAA,IAAI,CAAC,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,GAAG,CAAA,EAAG;AACxB,MAAA,OAAO,MAAA;AAAA,IACT;AAGA,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,GAAG,CAAA;AAChC,IAAA,IAAA,CAAK,KAAA,CAAM,OAAO,GAAG,CAAA;AACrB,IAAA,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,GAAA,EAAK,KAAK,CAAA;AAEzB,IAAA,OAAO,KAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,GAAA,CAAI,KAAQ,KAAA,EAAgB;AAC1B,IAAA,IAAI,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,GAAG,CAAA,EAAG;AAEvB,MAAA,IAAA,CAAK,KAAA,CAAM,OAAO,GAAG,CAAA;AAAA,IACvB,CAAA,MAAA,IAAW,IAAA,CAAK,KAAA,CAAM,IAAA,IAAQ,KAAK,QAAA,EAAU;AAE3C,MAAA,MAAM,WAAW,IAAA,CAAK,KAAA,CAAM,IAAA,EAAK,CAAE,MAAK,CAAE,KAAA;AAC1C,MAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,QAAA,IAAA,CAAK,KAAA,CAAM,OAAO,QAAQ,CAAA;AAAA,MAC5B;AAAA,IACF;AAEA,IAAA,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,GAAA,EAAK,KAAK,CAAA;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,GAAA,EAAiB;AACtB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,MAAA,CAAO,GAAG,CAAA;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA,EAKA,KAAA,GAAc;AACZ,IAAA,IAAA,CAAK,MAAM,KAAA,EAAM;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,GAAA,EAAiB;AACnB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,GAAG,CAAA;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAKA,IAAA,GAAe;AACb,IAAA,OAAO,KAAK,KAAA,CAAM,IAAA;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA,EAKA,IAAA,GAAY;AACV,IAAA,OAAO,KAAA,CAAM,IAAA,CAAK,IAAA,CAAK,KAAA,CAAM,IAAA,EAAM,CAAA,CAAE,MAAA,CAAO,CAAC,GAAA,KAAkB,GAAA,KAAQ,MAAS,CAAA;AAAA,EAClF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAA,GAAc;AACZ,IAAA,OAAO,KAAA,CAAM,IAAA,CAAK,IAAA,CAAK,KAAA,CAAM,QAAQ,CAAA;AAAA,EACvC;AACF","file":"chunk-A4SWQXX7.mjs","sourcesContent":["/**\n * 数据结构工具\n */\n\n/**\n * 栈实现\n */\nexport class Stack<T> {\n  private items: T[] = [];\n\n  /**\n   * 入栈\n   */\n  push(item: T): void {\n    this.items.push(item);\n  }\n\n  /**\n   * 出栈\n   */\n  pop(): T | undefined {\n    return this.items.pop();\n  }\n\n  /**\n   * 查看栈顶元素\n   */\n  peek(): T | undefined {\n    return this.items[this.items.length - 1];\n  }\n\n  /**\n   * 判断栈是否为空\n   */\n  isEmpty(): boolean {\n    return this.items.length === 0;\n  }\n\n  /**\n   * 获取栈的大小\n   */\n  size(): number {\n    return this.items.length;\n  }\n\n  /**\n   * 清空栈\n   */\n  clear(): void {\n    this.items = [];\n  }\n\n  /**\n   * 转换为数组\n   */\n  toArray(): T[] {\n    return [...this.items];\n  }\n}\n\n/**\n * 队列实现（数据结构版本，与performance.Queue区分）\n */\nexport class DataQueue<T> {\n  private items: T[] = [];\n\n  /**\n   * 入队\n   */\n  enqueue(item: T): void {\n    this.items.push(item);\n  }\n\n  /**\n   * 出队\n   */\n  dequeue(): T | undefined {\n    return this.items.shift();\n  }\n\n  /**\n   * 查看队首元素\n   */\n  front(): T | undefined {\n    return this.items[0];\n  }\n\n  /**\n   * 判断队列是否为空\n   */\n  isEmpty(): boolean {\n    return this.items.length === 0;\n  }\n\n  /**\n   * 获取队列的大小\n   */\n  size(): number {\n    return this.items.length;\n  }\n\n  /**\n   * 清空队列\n   */\n  clear(): void {\n    this.items = [];\n  }\n\n  /**\n   * 转换为数组\n   */\n  toArray(): T[] {\n    return [...this.items];\n  }\n}\n\n/**\n * 链表节点\n */\nclass ListNode<T> {\n  value: T;\n  next: ListNode<T> | null = null;\n\n  constructor(value: T) {\n    this.value = value;\n  }\n}\n\n/**\n * 链表实现\n */\nexport class LinkedList<T> {\n  private head: ListNode<T> | null = null;\n  private length = 0;\n\n  /**\n   * 在链表末尾添加元素\n   */\n  append(value: T): void {\n    const newNode = new ListNode(value);\n\n    if (!this.head) {\n      this.head = newNode;\n    } else {\n      let current = this.head;\n      while (current.next) {\n        current = current.next;\n      }\n      current.next = newNode;\n    }\n\n    this.length++;\n  }\n\n  /**\n   * 在指定位置插入元素\n   */\n  insert(index: number, value: T): boolean {\n    if (index < 0 || index > this.length) {\n      return false;\n    }\n\n    const newNode = new ListNode(value);\n\n    if (index === 0) {\n      newNode.next = this.head;\n      this.head = newNode;\n    } else {\n      let current = this.head;\n      for (let i = 0; i < index - 1; i++) {\n        current = current!.next;\n      }\n      newNode.next = current!.next;\n      current!.next = newNode;\n    }\n\n    this.length++;\n    return true;\n  }\n\n  /**\n   * 删除指定位置的元素\n   */\n  removeAt(index: number): T | null {\n    if (index < 0 || index >= this.length || !this.head) {\n      return null;\n    }\n\n    let current = this.head;\n\n    if (index === 0) {\n      this.head = current.next;\n      this.length--;\n      return current.value;\n    }\n\n    for (let i = 0; i < index - 1; i++) {\n      current = current.next!;\n    }\n\n    const removed = current.next!;\n    current.next = removed.next;\n    this.length--;\n\n    return removed.value;\n  }\n\n  /**\n   * 查找元素索引\n   */\n  indexOf(value: T): number {\n    let current = this.head;\n    let index = 0;\n\n    while (current) {\n      if (current.value === value) {\n        return index;\n      }\n      current = current.next;\n      index++;\n    }\n\n    return -1;\n  }\n\n  /**\n   * 获取指定位置的元素\n   */\n  get(index: number): T | null {\n    if (index < 0 || index >= this.length || !this.head) {\n      return null;\n    }\n\n    let current = this.head;\n    for (let i = 0; i < index; i++) {\n      current = current.next!;\n    }\n\n    return current.value;\n  }\n\n  /**\n   * 判断链表是否为空\n   */\n  isEmpty(): boolean {\n    return this.length === 0;\n  }\n\n  /**\n   * 获取链表长度\n   */\n  size(): number {\n    return this.length;\n  }\n\n  /**\n   * 转换为数组\n   */\n  toArray(): T[] {\n    const result: T[] = [];\n    let current = this.head;\n\n    while (current) {\n      result.push(current.value);\n      current = current.next;\n    }\n\n    return result;\n  }\n}\n\n/**\n * 二叉树节点\n */\nclass TreeNode<T> {\n  value: T;\n  left: TreeNode<T> | null = null;\n  right: TreeNode<T> | null = null;\n\n  constructor(value: T) {\n    this.value = value;\n  }\n}\n\n/**\n * 二叉树实现\n */\nexport class BinaryTree<T> {\n  private root: TreeNode<T> | null = null;\n\n  /**\n   * 插入节点\n   */\n  insert(value: T): void {\n    const newNode = new TreeNode(value);\n\n    if (!this.root) {\n      this.root = newNode;\n      return;\n    }\n\n    this.insertNode(this.root, newNode);\n  }\n\n  private insertNode(node: TreeNode<T>, newNode: TreeNode<T>): void {\n    // 简单实现：小于等于的放左边，大于的放右边\n    if (newNode.value <= node.value) {\n      if (!node.left) {\n        node.left = newNode;\n      } else {\n        this.insertNode(node.left, newNode);\n      }\n    } else {\n      if (!node.right) {\n        node.right = newNode;\n      } else {\n        this.insertNode(node.right, newNode);\n      }\n    }\n  }\n\n  /**\n   * 查找节点\n   */\n  search(value: T): boolean {\n    return this.searchNode(this.root, value);\n  }\n\n  private searchNode(node: TreeNode<T> | null, value: T): boolean {\n    if (!node) {\n      return false;\n    }\n\n    if (value === node.value) {\n      return true;\n    }\n\n    if (value < node.value) {\n      return this.searchNode(node.left, value);\n    }\n\n    return this.searchNode(node.right, value);\n  }\n\n  /**\n   * 中序遍历\n   */\n  inOrder(): T[] {\n    const result: T[] = [];\n    this.inOrderTraverse(this.root, result);\n    return result;\n  }\n\n  private inOrderTraverse(node: TreeNode<T> | null, result: T[]): void {\n    if (node) {\n      this.inOrderTraverse(node.left, result);\n      result.push(node.value);\n      this.inOrderTraverse(node.right, result);\n    }\n  }\n\n  /**\n   * 前序遍历\n   */\n  preOrder(): T[] {\n    const result: T[] = [];\n    this.preOrderTraverse(this.root, result);\n    return result;\n  }\n\n  private preOrderTraverse(node: TreeNode<T> | null, result: T[]): void {\n    if (node) {\n      result.push(node.value);\n      this.preOrderTraverse(node.left, result);\n      this.preOrderTraverse(node.right, result);\n    }\n  }\n\n  /**\n   * 后序遍历\n   */\n  postOrder(): T[] {\n    const result: T[] = [];\n    this.postOrderTraverse(this.root, result);\n    return result;\n  }\n\n  private postOrderTraverse(node: TreeNode<T> | null, result: T[]): void {\n    if (node) {\n      this.postOrderTraverse(node.left, result);\n      this.postOrderTraverse(node.right, result);\n      result.push(node.value);\n    }\n  }\n}\n\n/**\n * 图实现（邻接表）\n */\nexport class Graph<T> {\n  private vertices: Map<T, T[]> = new Map();\n\n  /**\n   * 添加顶点\n   */\n  addVertex(vertex: T): void {\n    if (!this.vertices.has(vertex)) {\n      this.vertices.set(vertex, []);\n    }\n  }\n\n  /**\n   * 添加边（无向图）\n   */\n  addEdge(vertex1: T, vertex2: T): void {\n    if (!this.vertices.has(vertex1)) {\n      this.addVertex(vertex1);\n    }\n    if (!this.vertices.has(vertex2)) {\n      this.addVertex(vertex2);\n    }\n\n    const neighbors1 = this.vertices.get(vertex1)!;\n    const neighbors2 = this.vertices.get(vertex2)!;\n\n    if (!neighbors1.includes(vertex2)) {\n      neighbors1.push(vertex2);\n    }\n    if (!neighbors2.includes(vertex1)) {\n      neighbors2.push(vertex1);\n    }\n  }\n\n  /**\n   * 获取顶点的邻居\n   */\n  getNeighbors(vertex: T): T[] {\n    return this.vertices.get(vertex) || [];\n  }\n\n  /**\n   * 深度优先搜索\n   */\n  dfs(start: T, callback?: (vertex: T) => void): T[] {\n    const visited = new Set<T>();\n    const result: T[] = [];\n\n    const dfsVisit = (vertex: T): void => {\n      visited.add(vertex);\n      result.push(vertex);\n      if (callback) {\n        callback(vertex);\n      }\n\n      const neighbors = this.getNeighbors(vertex);\n      for (const neighbor of neighbors) {\n        if (!visited.has(neighbor)) {\n          dfsVisit(neighbor);\n        }\n      }\n    };\n\n    dfsVisit(start);\n    return result;\n  }\n\n  /**\n   * 广度优先搜索\n   */\n  bfs(start: T, callback?: (vertex: T) => void): T[] {\n    const visited = new Set<T>();\n    const queue: T[] = [start];\n    const result: T[] = [];\n\n    visited.add(start);\n\n    while (queue.length > 0) {\n      const vertex = queue.shift()!;\n      result.push(vertex);\n      if (callback) {\n        callback(vertex);\n      }\n\n      const neighbors = this.getNeighbors(vertex);\n      for (const neighbor of neighbors) {\n        if (!visited.has(neighbor)) {\n          visited.add(neighbor);\n          queue.push(neighbor);\n        }\n      }\n    }\n\n    return result;\n  }\n\n  /**\n   * 获取所有顶点\n   */\n  getVertices(): T[] {\n    return Array.from(this.vertices.keys());\n  }\n}\n\n/**\n * LRU缓存实现\n */\nexport class LRUCache<K, V> {\n  private capacity: number;\n  private cache: Map<K, V>;\n\n  constructor(capacity: number) {\n    if (capacity <= 0) {\n      throw new Error('Capacity must be greater than 0');\n    }\n    this.capacity = capacity;\n    this.cache = new Map();\n  }\n\n  /**\n   * 获取值\n   */\n  get(key: K): V | undefined {\n    if (!this.cache.has(key)) {\n      return undefined;\n    }\n\n    // 将访问的键移到末尾（最近使用）\n    const value = this.cache.get(key)!;\n    this.cache.delete(key);\n    this.cache.set(key, value);\n\n    return value;\n  }\n\n  /**\n   * 设置值\n   */\n  set(key: K, value: V): void {\n    if (this.cache.has(key)) {\n      // 更新现有键，移到末尾\n      this.cache.delete(key);\n    } else if (this.cache.size >= this.capacity) {\n      // 删除最久未使用的键（第一个）\n      const firstKey = this.cache.keys().next().value;\n      if (firstKey !== undefined) {\n        this.cache.delete(firstKey);\n      }\n    }\n\n    this.cache.set(key, value);\n  }\n\n  /**\n   * 删除键\n   */\n  delete(key: K): boolean {\n    return this.cache.delete(key);\n  }\n\n  /**\n   * 清空缓存\n   */\n  clear(): void {\n    this.cache.clear();\n  }\n\n  /**\n   * 判断是否包含键\n   */\n  has(key: K): boolean {\n    return this.cache.has(key);\n  }\n\n  /**\n   * 获取缓存大小\n   */\n  size(): number {\n    return this.cache.size;\n  }\n\n  /**\n   * 获取所有键\n   */\n  keys(): K[] {\n    return Array.from(this.cache.keys()).filter((key): key is K => key !== undefined);\n  }\n\n  /**\n   * 获取所有值\n   */\n  values(): V[] {\n    return Array.from(this.cache.values());\n  }\n}\n"]}

package/dist/chunk-BHCRFURU.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/data/data-structure.ts"],"names":[],"mappings":";;;AAOO,IAAM,QAAN,MAAe;AAAA,EAAf,WAAA,GAAA;AACL,IAAA,IAAA,CAAQ,QAAa,EAAC;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAKtB,KAAK,IAAA,EAAe;AAClB,IAAA,IAAA,CAAK,KAAA,CAAM,KAAK,IAAI,CAAA;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA,EAKA,GAAA,GAAqB;AACnB,IAAA,OAAO,IAAA,CAAK,MAAM,GAAA,EAAI;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA,EAKA,IAAA,GAAsB;AACpB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,KAAA,CAAM,SAAS,CAAC,CAAA;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA,EAKA,OAAA,GAAmB;AACjB,IAAA,OAAO,IAAA,CAAK,MAAM,MAAA,KAAW,CAAA;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA,EAKA,IAAA,GAAe;AACb,IAAA,OAAO,KAAK,KAAA,CAAM,MAAA;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA,EAKA,KAAA,GAAc;AACZ,IAAA,IAAA,CAAK,QAAQ,EAAC;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA,EAKA,OAAA,GAAe;AACb,IAAA,OAAO,CAAC,GAAG,IAAA,CAAK,KAAK,CAAA;AAAA,EACvB;AACF;AAKO,IAAM,YAAN,MAAmB;AAAA,EAAnB,WAAA,GAAA;AACL,IAAA,IAAA,CAAQ,QAAa,EAAC;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAKtB,QAAQ,IAAA,EAAe;AACrB,IAAA,IAAA,CAAK,KAAA,CAAM,KAAK,IAAI,CAAA;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA,EAKA,OAAA,GAAyB;AACvB,IAAA,OAAO,IAAA,CAAK,MAAM,KAAA,EAAM;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA,EAKA,KAAA,GAAuB;AACrB,IAAA,OAAO,IAAA,CAAK,MAAM,CAAC,CAAA;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA,EAKA,OAAA,GAAmB;AACjB,IAAA,OAAO,IAAA,CAAK,MAAM,MAAA,KAAW,CAAA;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA,EAKA,IAAA,GAAe;AACb,IAAA,OAAO,KAAK,KAAA,CAAM,MAAA;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA,EAKA,KAAA,GAAc;AACZ,IAAA,IAAA,CAAK,QAAQ,EAAC;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA,EAKA,OAAA,GAAe;AACb,IAAA,OAAO,CAAC,GAAG,IAAA,CAAK,KAAK,CAAA;AAAA,EACvB;AACF;AAKA,IAAM,WAAN,MAAkB;AAAA,EAIhB,YAAY,KAAA,EAAU;AAFtB,IAAA,IAAA,CAAA,IAAA,GAA2B,IAAA;AAGzB,IAAA,IAAA,CAAK,KAAA,GAAQ,KAAA;AAAA,EACf;AACF,CAAA;AAKO,IAAM,aAAN,MAAoB;AAAA,EAApB,WAAA,GAAA;AACL,IAAA,IAAA,CAAQ,IAAA,GAA2B,IAAA;AACnC,IAAA,IAAA,CAAQ,MAAA,GAAS,CAAA;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAKjB,OAAO,KAAA,EAAgB;AACrB,IAAA,MAAM,OAAA,GAAU,IAAI,QAAA,CAAS,KAAK,CAAA;AAElC,IAAA,IAAI,CAAC,KAAK,IAAA,EAAM;AACd,MAAA,IAAA,CAAK,IAAA,GAAO,OAAA;AAAA,IACd,CAAA,MAAO;AACL,MAAA,IAAI,UAAU,IAAA,CAAK,IAAA;AACnB,MAAA,OAAO,QAAQ,IAAA,EAAM;AACnB,QAAA,OAAA,GAAU,OAAA,CAAQ,IAAA;AAAA,MACpB;AACA,MAAA,OAAA,CAAQ,IAAA,GAAO,OAAA;AAAA,IACjB;AAEA,IAAA,IAAA,CAAK,MAAA,EAAA;AAAA,EACP;AAAA;AAAA;AAAA;AAAA,EAKA,MAAA,CAAO,OAAe,KAAA,EAAmB;AACvC,IAAA,IAAI,KAAA,GAAQ,CAAA,IAAK,KAAA,GAAQ,IAAA,CAAK,MAAA,EAAQ;AACpC,MAAA,OAAO,KAAA;AAAA,IACT;AAEA,IAAA,MAAM,OAAA,GAAU,IAAI,QAAA,CAAS,KAAK,CAAA;AAElC,IAAA,IAAI,UAAU,CAAA,EAAG;AACf,MAAA,OAAA,CAAQ,OAAO,IAAA,CAAK,IAAA;AACpB,MAAA,IAAA,CAAK,IAAA,GAAO,OAAA;AAAA,IACd,CAAA,MAAO;AACL,MAAA,IAAI,UAAU,IAAA,CAAK,IAAA;AACnB,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,GAAQ,GAAG,CAAA,EAAA,EAAK;AAClC,QAAA,OAAA,GAAU,OAAA,CAAS,IAAA;AAAA,MACrB;AACA,MAAA,OAAA,CAAQ,OAAO,OAAA,CAAS,IAAA;AACxB,MAAA,OAAA,CAAS,IAAA,GAAO,OAAA;AAAA,IAClB;AAEA,IAAA,IAAA,CAAK,MAAA,EAAA;AACL,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,SAAS,KAAA,EAAyB;AAChC,IAAA,IAAI,QAAQ,CAAA,IAAK,KAAA,IAAS,KAAK,MAAA,IAAU,CAAC,KAAK,IAAA,EAAM;AACnD,MAAA,OAAO,IAAA;AAAA,IACT;AAEA,IAAA,IAAI,UAAU,IAAA,CAAK,IAAA;AAEnB,IAAA,IAAI,UAAU,CAAA,EAAG;AACf,MAAA,IAAA,CAAK,OAAO,OAAA,CAAQ,IAAA;AACpB,MAAA,IAAA,CAAK,MAAA,EAAA;AACL,MAAA,OAAO,OAAA,CAAQ,KAAA;AAAA,IACjB;AAEA,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,GAAQ,GAAG,CAAA,EAAA,EAAK;AAClC,MAAA,OAAA,GAAU,OAAA,CAAQ,IAAA;AAAA,IACpB;AAEA,IAAA,MAAM,UAAU,OAAA,CAAQ,IAAA;AACxB,IAAA,OAAA,CAAQ,OAAO,OAAA,CAAQ,IAAA;AACvB,IAAA,IAAA,CAAK,MAAA,EAAA;AAEL,IAAA,OAAO,OAAA,CAAQ,KAAA;AAAA,EACjB;AAAA;AAAA;AAAA;AAAA,EAKA,QAAQ,KAAA,EAAkB;AACxB,IAAA,IAAI,UAAU,IAAA,CAAK,IAAA;AACnB,IAAA,IAAI,KAAA,GAAQ,CAAA;AAEZ,IAAA,OAAO,OAAA,EAAS;AACd,MAAA,IAAI,OAAA,CAAQ,UAAU,KAAA,EAAO;AAC3B,QAAA,OAAO,KAAA;AAAA,MACT;AACA,MAAA,OAAA,GAAU,OAAA,CAAQ,IAAA;AAClB,MAAA,KAAA,EAAA;AAAA,IACF;AAEA,IAAA,OAAO,EAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,KAAA,EAAyB;AAC3B,IAAA,IAAI,QAAQ,CAAA,IAAK,KAAA,IAAS,KAAK,MAAA,IAAU,CAAC,KAAK,IAAA,EAAM;AACnD,MAAA,OAAO,IAAA;AAAA,IACT;AAEA,IAAA,IAAI,UAAU,IAAA,CAAK,IAAA;AACnB,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,EAAO,CAAA,EAAA,EAAK;AAC9B,MAAA,OAAA,GAAU,OAAA,CAAQ,IAAA;AAAA,IACpB;AAEA,IAAA,OAAO,OAAA,CAAQ,KAAA;AAAA,EACjB;AAAA;AAAA;AAAA;AAAA,EAKA,OAAA,GAAmB;AACjB,IAAA,OAAO,KAAK,MAAA,KAAW,CAAA;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA,EAKA,IAAA,GAAe;AACb,IAAA,OAAO,IAAA,CAAK,MAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKA,OAAA,GAAe;AACb,IAAA,MAAM,SAAc,EAAC;AACrB,IAAA,IAAI,UAAU,IAAA,CAAK,IAAA;AAEnB,IAAA,OAAO,OAAA,EAAS;AACd,MAAA,MAAA,CAAO,IAAA,CAAK,QAAQ,KAAK,CAAA;AACzB,MAAA,OAAA,GAAU,OAAA,CAAQ,IAAA;AAAA,IACpB;AAEA,IAAA,OAAO,MAAA;AAAA,EACT;AACF;AAKA,IAAM,WAAN,MAAkB;AAAA,EAKhB,YAAY,KAAA,EAAU;AAHtB,IAAA,IAAA,CAAA,IAAA,GAA2B,IAAA;AAC3B,IAAA,IAAA,CAAA,KAAA,GAA4B,IAAA;AAG1B,IAAA,IAAA,CAAK,KAAA,GAAQ,KAAA;AAAA,EACf;AACF,CAAA;AAKO,IAAM,aAAN,MAAoB;AAAA,EAApB,WAAA,GAAA;AACL,IAAA,IAAA,CAAQ,IAAA,GAA2B,IAAA;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAKnC,OAAO,KAAA,EAAgB;AACrB,IAAA,MAAM,OAAA,GAAU,IAAI,QAAA,CAAS,KAAK,CAAA;AAElC,IAAA,IAAI,CAAC,KAAK,IAAA,EAAM;AACd,MAAA,IAAA,CAAK,IAAA,GAAO,OAAA;AACZ,MAAA;AAAA,IACF;AAEA,IAAA,IAAA,CAAK,UAAA,CAAW,IAAA,CAAK,IAAA,EAAM,OAAO,CAAA;AAAA,EACpC;AAAA,EAEQ,UAAA,CAAW,MAAmB,OAAA,EAA4B;AAEhE,IAAA,IAAI,OAAA,CAAQ,KAAA,IAAS,IAAA,CAAK,KAAA,EAAO;AAC/B,MAAA,IAAI,CAAC,KAAK,IAAA,EAAM;AACd,QAAA,IAAA,CAAK,IAAA,GAAO,OAAA;AAAA,MACd,CAAA,MAAO;AACL,QAAA,IAAA,CAAK,UAAA,CAAW,IAAA,CAAK,IAAA,EAAM,OAAO,CAAA;AAAA,MACpC;AAAA,IACF,CAAA,MAAO;AACL,MAAA,IAAI,CAAC,KAAK,KAAA,EAAO;AACf,QAAA,IAAA,CAAK,KAAA,GAAQ,OAAA;AAAA,MACf,CAAA,MAAO;AACL,QAAA,IAAA,CAAK,UAAA,CAAW,IAAA,CAAK,KAAA,EAAO,OAAO,CAAA;AAAA,MACrC;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,KAAA,EAAmB;AACxB,IAAA,OAAO,IAAA,CAAK,UAAA,CAAW,IAAA,CAAK,IAAA,EAAM,KAAK,CAAA;AAAA,EACzC;AAAA,EAEQ,UAAA,CAAW,MAA0B,KAAA,EAAmB;AAC9D,IAAA,IAAI,CAAC,IAAA,EAAM;AACT,MAAA,OAAO,KAAA;AAAA,IACT;AAEA,IAAA,IAAI,KAAA,KAAU,KAAK,KAAA,EAAO;AACxB,MAAA,OAAO,IAAA;AAAA,IACT;AAEA,IAAA,IAAI,KAAA,GAAQ,KAAK,KAAA,EAAO;AACtB,MAAA,OAAO,IAAA,CAAK,UAAA,CAAW,IAAA,CAAK,IAAA,EAAM,KAAK,CAAA;AAAA,IACzC;AAEA,IAAA,OAAO,IAAA,CAAK,UAAA,CAAW,IAAA,CAAK,KAAA,EAAO,KAAK,CAAA;AAAA,EAC1C;AAAA;AAAA;AAAA;AAAA,EAKA,OAAA,GAAe;AACb,IAAA,MAAM,SAAc,EAAC;AACrB,IAAA,IAAA,CAAK,eAAA,CAAgB,IAAA,CAAK,IAAA,EAAM,MAAM,CAAA;AACtC,IAAA,OAAO,MAAA;AAAA,EACT;AAAA,EAEQ,eAAA,CAAgB,MAA0B,MAAA,EAAmB;AACnE,IAAA,IAAI,IAAA,EAAM;AACR,MAAA,IAAA,CAAK,eAAA,CAAgB,IAAA,CAAK,IAAA,EAAM,MAAM,CAAA;AACtC,MAAA,MAAA,CAAO,IAAA,CAAK,KAAK,KAAK,CAAA;AACtB,MAAA,IAAA,CAAK,eAAA,CAAgB,IAAA,CAAK,KAAA,EAAO,MAAM,CAAA;AAAA,IACzC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,QAAA,GAAgB;AACd,IAAA,MAAM,SAAc,EAAC;AACrB,IAAA,IAAA,CAAK,gBAAA,CAAiB,IAAA,CAAK,IAAA,EAAM,MAAM,CAAA;AACvC,IAAA,OAAO,MAAA;AAAA,EACT;AAAA,EAEQ,gBAAA,CAAiB,MAA0B,MAAA,EAAmB;AACpE,IAAA,IAAI,IAAA,EAAM;AACR,MAAA,MAAA,CAAO,IAAA,CAAK,KAAK,KAAK,CAAA;AACtB,MAAA,IAAA,CAAK,gBAAA,CAAiB,IAAA,CAAK,IAAA,EAAM,MAAM,CAAA;AACvC,MAAA,IAAA,CAAK,gBAAA,CAAiB,IAAA,CAAK,KAAA,EAAO,MAAM,CAAA;AAAA,IAC1C;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,SAAA,GAAiB;AACf,IAAA,MAAM,SAAc,EAAC;AACrB,IAAA,IAAA,CAAK,iBAAA,CAAkB,IAAA,CAAK,IAAA,EAAM,MAAM,CAAA;AACxC,IAAA,OAAO,MAAA;AAAA,EACT;AAAA,EAEQ,iBAAA,CAAkB,MAA0B,MAAA,EAAmB;AACrE,IAAA,IAAI,IAAA,EAAM;AACR,MAAA,IAAA,CAAK,iBAAA,CAAkB,IAAA,CAAK,IAAA,EAAM,MAAM,CAAA;AACxC,MAAA,IAAA,CAAK,iBAAA,CAAkB,IAAA,CAAK,KAAA,EAAO,MAAM,CAAA;AACzC,MAAA,MAAA,CAAO,IAAA,CAAK,KAAK,KAAK,CAAA;AAAA,IACxB;AAAA,EACF;AACF;AAKO,IAAM,QAAN,MAAe;AAAA,EAAf,WAAA,GAAA;AACL,IAAA,IAAA,CAAQ,QAAA,uBAA4B,GAAA,EAAI;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAKxC,UAAU,MAAA,EAAiB;AACzB,IAAA,IAAI,CAAC,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,MAAM,CAAA,EAAG;AAC9B,MAAA,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,MAAA,EAAQ,EAAE,CAAA;AAAA,IAC9B;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAA,CAAQ,SAAY,OAAA,EAAkB;AACpC,IAAA,IAAI,CAAC,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,OAAO,CAAA,EAAG;AAC/B,MAAA,IAAA,CAAK,UAAU,OAAO,CAAA;AAAA,IACxB;AACA,IAAA,IAAI,CAAC,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,OAAO,CAAA,EAAG;AAC/B,MAAA,IAAA,CAAK,UAAU,OAAO,CAAA;AAAA,IACxB;AAEA,IAAA,MAAM,UAAA,GAAa,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,OAAO,CAAA;AAC5C,IAAA,MAAM,UAAA,GAAa,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,OAAO,CAAA;AAE5C,IAAA,IAAI,CAAC,UAAA,CAAW,QAAA,CAAS,OAAO,CAAA,EAAG;AACjC,MAAA,UAAA,CAAW,KAAK,OAAO,CAAA;AAAA,IACzB;AACA,IAAA,IAAI,CAAC,UAAA,CAAW,QAAA,CAAS,OAAO,CAAA,EAAG;AACjC,MAAA,UAAA,CAAW,KAAK,OAAO,CAAA;AAAA,IACzB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,aAAa,MAAA,EAAgB;AAC3B,IAAA,OAAO,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,MAAM,KAAK,EAAC;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA,EAKA,GAAA,CAAI,OAAU,QAAA,EAAqC;AACjD,IAAA,MAAM,OAAA,uBAAc,GAAA,EAAO;AAC3B,IAAA,MAAM,SAAc,EAAC;AAErB,IAAA,MAAM,QAAA,GAAW,CAAC,MAAA,KAAoB;AACpC,MAAA,OAAA,CAAQ,IAAI,MAAM,CAAA;AAClB,MAAA,MAAA,CAAO,KAAK,MAAM,CAAA;AAClB,MAAA,IAAI,QAAA,EAAU;AACZ,QAAA,QAAA,CAAS,MAAM,CAAA;AAAA,MACjB;AAEA,MAAA,MAAM,SAAA,GAAY,IAAA,CAAK,YAAA,CAAa,MAAM,CAAA;AAC1C,MAAA,KAAA,MAAW,YAAY,SAAA,EAAW;AAChC,QAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,QAAQ,CAAA,EAAG;AAC1B,UAAA,QAAA,CAAS,QAAQ,CAAA;AAAA,QACnB;AAAA,MACF;AAAA,IACF,CAAA;AAEA,IAAA,QAAA,CAAS,KAAK,CAAA;AACd,IAAA,OAAO,MAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,GAAA,CAAI,OAAU,QAAA,EAAqC;AACjD,IAAA,MAAM,OAAA,uBAAc,GAAA,EAAO;AAC3B,IAAA,MAAM,KAAA,GAAa,CAAC,KAAK,CAAA;AACzB,IAAA,MAAM,SAAc,EAAC;AAErB,IAAA,OAAA,CAAQ,IAAI,KAAK,CAAA;AAEjB,IAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,MAAA,MAAM,MAAA,GAAS,MAAM,KAAA,EAAM;AAC3B,MAAA,MAAA,CAAO,KAAK,MAAM,CAAA;AAClB,MAAA,IAAI,QAAA,EAAU;AACZ,QAAA,QAAA,CAAS,MAAM,CAAA;AAAA,MACjB;AAEA,MAAA,MAAM,SAAA,GAAY,IAAA,CAAK,YAAA,CAAa,MAAM,CAAA;AAC1C,MAAA,KAAA,MAAW,YAAY,SAAA,EAAW;AAChC,QAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,QAAQ,CAAA,EAAG;AAC1B,UAAA,OAAA,CAAQ,IAAI,QAAQ,CAAA;AACpB,UAAA,KAAA,CAAM,KAAK,QAAQ,CAAA;AAAA,QACrB;AAAA,MACF;AAAA,IACF;AAEA,IAAA,OAAO,MAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,WAAA,GAAmB;AACjB,IAAA,OAAO,KAAA,CAAM,IAAA,CAAK,IAAA,CAAK,QAAA,CAAS,MAAM,CAAA;AAAA,EACxC;AACF;AAKO,IAAM,WAAN,MAAqB;AAAA,EAI1B,YAAY,QAAA,EAAkB;AAC5B,IAAA,IAAI,YAAY,CAAA,EAAG;AACjB,MAAA,MAAM,IAAI,MAAM,iCAAiC,CAAA;AAAA,IACnD;AACA,IAAA,IAAA,CAAK,QAAA,GAAW,QAAA;AAChB,IAAA,IAAA,CAAK,KAAA,uBAAY,GAAA,EAAI;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,GAAA,EAAuB;AACzB,IAAA,IAAI,CAAC,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,GAAG,CAAA,EAAG;AACxB,MAAA,OAAO,MAAA;AAAA,IACT;AAGA,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,GAAG,CAAA;AAChC,IAAA,IAAA,CAAK,KAAA,CAAM,OAAO,GAAG,CAAA;AACrB,IAAA,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,GAAA,EAAK,KAAK,CAAA;AAEzB,IAAA,OAAO,KAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,GAAA,CAAI,KAAQ,KAAA,EAAgB;AAC1B,IAAA,IAAI,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,GAAG,CAAA,EAAG;AAEvB,MAAA,IAAA,CAAK,KAAA,CAAM,OAAO,GAAG,CAAA;AAAA,IACvB,CAAA,MAAA,IAAW,IAAA,CAAK,KAAA,CAAM,IAAA,IAAQ,KAAK,QAAA,EAAU;AAE3C,MAAA,MAAM,WAAW,IAAA,CAAK,KAAA,CAAM,IAAA,EAAK,CAAE,MAAK,CAAE,KAAA;AAC1C,MAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,QAAA,IAAA,CAAK,KAAA,CAAM,OAAO,QAAQ,CAAA;AAAA,MAC5B;AAAA,IACF;AAEA,IAAA,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,GAAA,EAAK,KAAK,CAAA;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,GAAA,EAAiB;AACtB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,MAAA,CAAO,GAAG,CAAA;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA,EAKA,KAAA,GAAc;AACZ,IAAA,IAAA,CAAK,MAAM,KAAA,EAAM;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,GAAA,EAAiB;AACnB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,GAAG,CAAA;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAKA,IAAA,GAAe;AACb,IAAA,OAAO,KAAK,KAAA,CAAM,IAAA;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA,EAKA,IAAA,GAAY;AACV,IAAA,OAAO,KAAA,CAAM,IAAA,CAAK,IAAA,CAAK,KAAA,CAAM,IAAA,EAAM,CAAA,CAAE,MAAA,CAAO,CAAC,GAAA,KAAkB,GAAA,KAAQ,MAAS,CAAA;AAAA,EAClF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAA,GAAc;AACZ,IAAA,OAAO,KAAA,CAAM,IAAA,CAAK,IAAA,CAAK,KAAA,CAAM,QAAQ,CAAA;AAAA,EACvC;AACF","file":"chunk-BHCRFURU.js","sourcesContent":["/**\n * 数据结构工具\n */\n\n/**\n * 栈实现\n */\nexport class Stack<T> {\n  private items: T[] = [];\n\n  /**\n   * 入栈\n   */\n  push(item: T): void {\n    this.items.push(item);\n  }\n\n  /**\n   * 出栈\n   */\n  pop(): T | undefined {\n    return this.items.pop();\n  }\n\n  /**\n   * 查看栈顶元素\n   */\n  peek(): T | undefined {\n    return this.items[this.items.length - 1];\n  }\n\n  /**\n   * 判断栈是否为空\n   */\n  isEmpty(): boolean {\n    return this.items.length === 0;\n  }\n\n  /**\n   * 获取栈的大小\n   */\n  size(): number {\n    return this.items.length;\n  }\n\n  /**\n   * 清空栈\n   */\n  clear(): void {\n    this.items = [];\n  }\n\n  /**\n   * 转换为数组\n   */\n  toArray(): T[] {\n    return [...this.items];\n  }\n}\n\n/**\n * 队列实现（数据结构版本，与performance.Queue区分）\n */\nexport class DataQueue<T> {\n  private items: T[] = [];\n\n  /**\n   * 入队\n   */\n  enqueue(item: T): void {\n    this.items.push(item);\n  }\n\n  /**\n   * 出队\n   */\n  dequeue(): T | undefined {\n    return this.items.shift();\n  }\n\n  /**\n   * 查看队首元素\n   */\n  front(): T | undefined {\n    return this.items[0];\n  }\n\n  /**\n   * 判断队列是否为空\n   */\n  isEmpty(): boolean {\n    return this.items.length === 0;\n  }\n\n  /**\n   * 获取队列的大小\n   */\n  size(): number {\n    return this.items.length;\n  }\n\n  /**\n   * 清空队列\n   */\n  clear(): void {\n    this.items = [];\n  }\n\n  /**\n   * 转换为数组\n   */\n  toArray(): T[] {\n    return [...this.items];\n  }\n}\n\n/**\n * 链表节点\n */\nclass ListNode<T> {\n  value: T;\n  next: ListNode<T> | null = null;\n\n  constructor(value: T) {\n    this.value = value;\n  }\n}\n\n/**\n * 链表实现\n */\nexport class LinkedList<T> {\n  private head: ListNode<T> | null = null;\n  private length = 0;\n\n  /**\n   * 在链表末尾添加元素\n   */\n  append(value: T): void {\n    const newNode = new ListNode(value);\n\n    if (!this.head) {\n      this.head = newNode;\n    } else {\n      let current = this.head;\n      while (current.next) {\n        current = current.next;\n      }\n      current.next = newNode;\n    }\n\n    this.length++;\n  }\n\n  /**\n   * 在指定位置插入元素\n   */\n  insert(index: number, value: T): boolean {\n    if (index < 0 || index > this.length) {\n      return false;\n    }\n\n    const newNode = new ListNode(value);\n\n    if (index === 0) {\n      newNode.next = this.head;\n      this.head = newNode;\n    } else {\n      let current = this.head;\n      for (let i = 0; i < index - 1; i++) {\n        current = current!.next;\n      }\n      newNode.next = current!.next;\n      current!.next = newNode;\n    }\n\n    this.length++;\n    return true;\n  }\n\n  /**\n   * 删除指定位置的元素\n   */\n  removeAt(index: number): T | null {\n    if (index < 0 || index >= this.length || !this.head) {\n      return null;\n    }\n\n    let current = this.head;\n\n    if (index === 0) {\n      this.head = current.next;\n      this.length--;\n      return current.value;\n    }\n\n    for (let i = 0; i < index - 1; i++) {\n      current = current.next!;\n    }\n\n    const removed = current.next!;\n    current.next = removed.next;\n    this.length--;\n\n    return removed.value;\n  }\n\n  /**\n   * 查找元素索引\n   */\n  indexOf(value: T): number {\n    let current = this.head;\n    let index = 0;\n\n    while (current) {\n      if (current.value === value) {\n        return index;\n      }\n      current = current.next;\n      index++;\n    }\n\n    return -1;\n  }\n\n  /**\n   * 获取指定位置的元素\n   */\n  get(index: number): T | null {\n    if (index < 0 || index >= this.length || !this.head) {\n      return null;\n    }\n\n    let current = this.head;\n    for (let i = 0; i < index; i++) {\n      current = current.next!;\n    }\n\n    return current.value;\n  }\n\n  /**\n   * 判断链表是否为空\n   */\n  isEmpty(): boolean {\n    return this.length === 0;\n  }\n\n  /**\n   * 获取链表长度\n   */\n  size(): number {\n    return this.length;\n  }\n\n  /**\n   * 转换为数组\n   */\n  toArray(): T[] {\n    const result: T[] = [];\n    let current = this.head;\n\n    while (current) {\n      result.push(current.value);\n      current = current.next;\n    }\n\n    return result;\n  }\n}\n\n/**\n * 二叉树节点\n */\nclass TreeNode<T> {\n  value: T;\n  left: TreeNode<T> | null = null;\n  right: TreeNode<T> | null = null;\n\n  constructor(value: T) {\n    this.value = value;\n  }\n}\n\n/**\n * 二叉树实现\n */\nexport class BinaryTree<T> {\n  private root: TreeNode<T> | null = null;\n\n  /**\n   * 插入节点\n   */\n  insert(value: T): void {\n    const newNode = new TreeNode(value);\n\n    if (!this.root) {\n      this.root = newNode;\n      return;\n    }\n\n    this.insertNode(this.root, newNode);\n  }\n\n  private insertNode(node: TreeNode<T>, newNode: TreeNode<T>): void {\n    // 简单实现：小于等于的放左边，大于的放右边\n    if (newNode.value <= node.value) {\n      if (!node.left) {\n        node.left = newNode;\n      } else {\n        this.insertNode(node.left, newNode);\n      }\n    } else {\n      if (!node.right) {\n        node.right = newNode;\n      } else {\n        this.insertNode(node.right, newNode);\n      }\n    }\n  }\n\n  /**\n   * 查找节点\n   */\n  search(value: T): boolean {\n    return this.searchNode(this.root, value);\n  }\n\n  private searchNode(node: TreeNode<T> | null, value: T): boolean {\n    if (!node) {\n      return false;\n    }\n\n    if (value === node.value) {\n      return true;\n    }\n\n    if (value < node.value) {\n      return this.searchNode(node.left, value);\n    }\n\n    return this.searchNode(node.right, value);\n  }\n\n  /**\n   * 中序遍历\n   */\n  inOrder(): T[] {\n    const result: T[] = [];\n    this.inOrderTraverse(this.root, result);\n    return result;\n  }\n\n  private inOrderTraverse(node: TreeNode<T> | null, result: T[]): void {\n    if (node) {\n      this.inOrderTraverse(node.left, result);\n      result.push(node.value);\n      this.inOrderTraverse(node.right, result);\n    }\n  }\n\n  /**\n   * 前序遍历\n   */\n  preOrder(): T[] {\n    const result: T[] = [];\n    this.preOrderTraverse(this.root, result);\n    return result;\n  }\n\n  private preOrderTraverse(node: TreeNode<T> | null, result: T[]): void {\n    if (node) {\n      result.push(node.value);\n      this.preOrderTraverse(node.left, result);\n      this.preOrderTraverse(node.right, result);\n    }\n  }\n\n  /**\n   * 后序遍历\n   */\n  postOrder(): T[] {\n    const result: T[] = [];\n    this.postOrderTraverse(this.root, result);\n    return result;\n  }\n\n  private postOrderTraverse(node: TreeNode<T> | null, result: T[]): void {\n    if (node) {\n      this.postOrderTraverse(node.left, result);\n      this.postOrderTraverse(node.right, result);\n      result.push(node.value);\n    }\n  }\n}\n\n/**\n * 图实现（邻接表）\n */\nexport class Graph<T> {\n  private vertices: Map<T, T[]> = new Map();\n\n  /**\n   * 添加顶点\n   */\n  addVertex(vertex: T): void {\n    if (!this.vertices.has(vertex)) {\n      this.vertices.set(vertex, []);\n    }\n  }\n\n  /**\n   * 添加边（无向图）\n   */\n  addEdge(vertex1: T, vertex2: T): void {\n    if (!this.vertices.has(vertex1)) {\n      this.addVertex(vertex1);\n    }\n    if (!this.vertices.has(vertex2)) {\n      this.addVertex(vertex2);\n    }\n\n    const neighbors1 = this.vertices.get(vertex1)!;\n    const neighbors2 = this.vertices.get(vertex2)!;\n\n    if (!neighbors1.includes(vertex2)) {\n      neighbors1.push(vertex2);\n    }\n    if (!neighbors2.includes(vertex1)) {\n      neighbors2.push(vertex1);\n    }\n  }\n\n  /**\n   * 获取顶点的邻居\n   */\n  getNeighbors(vertex: T): T[] {\n    return this.vertices.get(vertex) || [];\n  }\n\n  /**\n   * 深度优先搜索\n   */\n  dfs(start: T, callback?: (vertex: T) => void): T[] {\n    const visited = new Set<T>();\n    const result: T[] = [];\n\n    const dfsVisit = (vertex: T): void => {\n      visited.add(vertex);\n      result.push(vertex);\n      if (callback) {\n        callback(vertex);\n      }\n\n      const neighbors = this.getNeighbors(vertex);\n      for (const neighbor of neighbors) {\n        if (!visited.has(neighbor)) {\n          dfsVisit(neighbor);\n        }\n      }\n    };\n\n    dfsVisit(start);\n    return result;\n  }\n\n  /**\n   * 广度优先搜索\n   */\n  bfs(start: T, callback?: (vertex: T) => void): T[] {\n    const visited = new Set<T>();\n    const queue: T[] = [start];\n    const result: T[] = [];\n\n    visited.add(start);\n\n    while (queue.length > 0) {\n      const vertex = queue.shift()!;\n      result.push(vertex);\n      if (callback) {\n        callback(vertex);\n      }\n\n      const neighbors = this.getNeighbors(vertex);\n      for (const neighbor of neighbors) {\n        if (!visited.has(neighbor)) {\n          visited.add(neighbor);\n          queue.push(neighbor);\n        }\n      }\n    }\n\n    return result;\n  }\n\n  /**\n   * 获取所有顶点\n   */\n  getVertices(): T[] {\n    return Array.from(this.vertices.keys());\n  }\n}\n\n/**\n * LRU缓存实现\n */\nexport class LRUCache<K, V> {\n  private capacity: number;\n  private cache: Map<K, V>;\n\n  constructor(capacity: number) {\n    if (capacity <= 0) {\n      throw new Error('Capacity must be greater than 0');\n    }\n    this.capacity = capacity;\n    this.cache = new Map();\n  }\n\n  /**\n   * 获取值\n   */\n  get(key: K): V | undefined {\n    if (!this.cache.has(key)) {\n      return undefined;\n    }\n\n    // 将访问的键移到末尾（最近使用）\n    const value = this.cache.get(key)!;\n    this.cache.delete(key);\n    this.cache.set(key, value);\n\n    return value;\n  }\n\n  /**\n   * 设置值\n   */\n  set(key: K, value: V): void {\n    if (this.cache.has(key)) {\n      // 更新现有键，移到末尾\n      this.cache.delete(key);\n    } else if (this.cache.size >= this.capacity) {\n      // 删除最久未使用的键（第一个）\n      const firstKey = this.cache.keys().next().value;\n      if (firstKey !== undefined) {\n        this.cache.delete(firstKey);\n      }\n    }\n\n    this.cache.set(key, value);\n  }\n\n  /**\n   * 删除键\n   */\n  delete(key: K): boolean {\n    return this.cache.delete(key);\n  }\n\n  /**\n   * 清空缓存\n   */\n  clear(): void {\n    this.cache.clear();\n  }\n\n  /**\n   * 判断是否包含键\n   */\n  has(key: K): boolean {\n    return this.cache.has(key);\n  }\n\n  /**\n   * 获取缓存大小\n   */\n  size(): number {\n    return this.cache.size;\n  }\n\n  /**\n   * 获取所有键\n   */\n  keys(): K[] {\n    return Array.from(this.cache.keys()).filter((key): key is K => key !== undefined);\n  }\n\n  /**\n   * 获取所有值\n   */\n  values(): V[] {\n    return Array.from(this.cache.values());\n  }\n}\n"]}

package/dist/chunk-CDSGEAOK.mjs

@@ -1,80 +0,0 @@
-// src/format/number.ts
-function formatNumber(num, options = {}) {
-  const { decimals, separator = ",", decimalPoint = ".", minimumFractionDigits } = options;
-  let numStr;
-  if (decimals !== void 0) {
-    numStr = num.toFixed(decimals);
-  } else if (minimumFractionDigits !== void 0) {
-    numStr = num.toFixed(minimumFractionDigits);
-  } else {
-    const str = num.toString();
-    if (str.includes(".")) {
-      numStr = str;
-    } else {
-      numStr = num.toFixed(0);
-    }
-  }
-  const parts = numStr.split(".");
-  parts[0] = parts[0].replace(/\B(?=(\d{3})+(?!\d))/g, separator);
-  return parts.join(decimalPoint);
-}
-function random(min, max, integer = false) {
-  const value = Math.random() * (max - min) + min;
-  return integer ? Math.floor(value) : value;
-}
-function clamp(num, min, max) {
-  return Math.min(Math.max(num, min), max);
-}
-function round(num, decimals = 0) {
-  const factor = Math.pow(10, decimals);
-  return Math.round(num * factor) / factor;
-}
-function floor(num, decimals = 0) {
-  const factor = Math.pow(10, decimals);
-  return Math.floor(num * factor) / factor;
-}
-function ceil(num, decimals = 0) {
-  const factor = Math.pow(10, decimals);
-  return Math.ceil(num * factor) / factor;
-}
-function toFixed(num, decimals) {
-  return num.toFixed(decimals);
-}
-function parseNumber(str, defaultValue = 0) {
-  const num = Number(str);
-  return isNaN(num) ? defaultValue : num;
-}
-function isBetween(num, min, max, inclusive = true) {
-  if (inclusive) {
-    return num >= min && num <= max;
-  }
-  return num > min && num < max;
-}
-function percent(value, decimalsOrTotal, decimals) {
-  if (value >= 0 && value <= 1 && (decimalsOrTotal === void 0 || decimalsOrTotal < 10)) {
-    const dec2 = decimalsOrTotal ?? 0;
-    return Number((value * 100).toFixed(dec2));
-  }
-  if (decimalsOrTotal !== void 0 && decimalsOrTotal >= 10) {
-    const total = decimalsOrTotal;
-    const dec2 = decimals ?? 2;
-    if (total === 0) return "0%";
-    return `${(value / total * 100).toFixed(dec2)}%`;
-  }
-  const dec = decimalsOrTotal ?? 0;
-  return Number((value * 100).toFixed(dec));
-}
-function formatCurrency(num, currency = "\xA5", decimals = 2) {
-  return `${currency}${formatNumber(num, { decimals, separator: "," })}`;
-}
-function formatBytes(bytes, decimals = 2) {
-  if (bytes === 0) return "0 Bytes";
-  const k = 1024;
-  const sizes = ["Bytes", "KB", "MB", "GB", "TB", "PB"];
-  const i = Math.floor(Math.log(bytes) / Math.log(k));
-  return `${parseFloat((bytes / Math.pow(k, i)).toFixed(decimals))} ${sizes[i]}`;
-}
-
-export { ceil, clamp, floor, formatBytes, formatCurrency, formatNumber, isBetween, parseNumber, percent, random, round, toFixed };
-//# sourceMappingURL=chunk-CDSGEAOK.mjs.map
-//# sourceMappingURL=chunk-CDSGEAOK.mjs.map

package/dist/chunk-CDSGEAOK.mjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/format/number.ts"],"names":["dec"],"mappings":";AAUO,SAAS,YAAA,CACd,GAAA,EACA,OAAA,GAKI,EAAC,EACG;AACR,EAAA,MAAM,EAAE,QAAA,EAAU,SAAA,GAAY,KAAK,YAAA,GAAe,GAAA,EAAK,uBAAsB,GAAI,OAAA;AAGjF,EAAA,IAAI,MAAA;AACJ,EAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,IAAA,MAAA,GAAS,GAAA,CAAI,QAAQ,QAAQ,CAAA;AAAA,EAC/B,CAAA,MAAA,IAAW,0BAA0B,MAAA,EAAW;AAC9C,IAAA,MAAA,GAAS,GAAA,CAAI,QAAQ,qBAAqB,CAAA;AAAA,EAC5C,CAAA,MAAO;AAEL,IAAA,MAAM,GAAA,GAAM,IAAI,QAAA,EAAS;AACzB,IAAA,IAAI,GAAA,CAAI,QAAA,CAAS,GAAG,CAAA,EAAG;AACrB,MAAA,MAAA,GAAS,GAAA;AAAA,IACX,CAAA,MAAO;AACL,MAAA,MAAA,GAAS,GAAA,CAAI,QAAQ,CAAC,CAAA;AAAA,IACxB;AAAA,EACF;AAEA,EAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,KAAA,CAAM,GAAG,CAAA;AAC9B,EAAA,KAAA,CAAM,CAAC,CAAA,GAAI,KAAA,CAAM,CAAC,CAAA,CAAE,OAAA,CAAQ,yBAAyB,SAAS,CAAA;AAC9D,EAAA,OAAO,KAAA,CAAM,KAAK,YAAY,CAAA;AAChC;AASO,SAAS,MAAA,CAAO,GAAA,EAAa,GAAA,EAAa,OAAA,GAAU,KAAA,EAAe;AACxE,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,MAAA,EAAO,IAAK,MAAM,GAAA,CAAA,GAAO,GAAA;AAC5C,EAAA,OAAO,OAAA,GAAU,IAAA,CAAK,KAAA,CAAM,KAAK,CAAA,GAAI,KAAA;AACvC;AASO,SAAS,KAAA,CAAM,GAAA,EAAa,GAAA,EAAa,GAAA,EAAqB;AACnE,EAAA,OAAO,KAAK,GAAA,CAAI,IAAA,CAAK,IAAI,GAAA,EAAK,GAAG,GAAG,GAAG,CAAA;AACzC;AAQO,SAAS,KAAA,CAAM,GAAA,EAAa,QAAA,GAAW,CAAA,EAAW;AACvD,EAAA,MAAM,MAAA,GAAS,IAAA,CAAK,GAAA,CAAI,EAAA,EAAI,QAAQ,CAAA;AACpC,EAAA,OAAO,IAAA,CAAK,KAAA,CAAM,GAAA,GAAM,MAAM,CAAA,GAAI,MAAA;AACpC;AAQO,SAAS,KAAA,CAAM,GAAA,EAAa,QAAA,GAAW,CAAA,EAAW;AACvD,EAAA,MAAM,MAAA,GAAS,IAAA,CAAK,GAAA,CAAI,EAAA,EAAI,QAAQ,CAAA;AACpC,EAAA,OAAO,IAAA,CAAK,KAAA,CAAM,GAAA,GAAM,MAAM,CAAA,GAAI,MAAA;AACpC;AAQO,SAAS,IAAA,CAAK,GAAA,EAAa,QAAA,GAAW,CAAA,EAAW;AACtD,EAAA,MAAM,MAAA,GAAS,IAAA,CAAK,GAAA,CAAI,EAAA,EAAI,QAAQ,CAAA;AACpC,EAAA,OAAO,IAAA,CAAK,IAAA,CAAK,GAAA,GAAM,MAAM,CAAA,GAAI,MAAA;AACnC;AAQO,SAAS,OAAA,CAAQ,KAAa,QAAA,EAA0B;AAC7D,EAAA,OAAO,GAAA,CAAI,QAAQ,QAAQ,CAAA;AAC7B;AAQO,SAAS,WAAA,CAAY,GAAA,EAAa,YAAA,GAAe,CAAA,EAAW;AACjE,EAAA,MAAM,GAAA,GAAM,OAAO,GAAG,CAAA;AACtB,EAAA,OAAO,KAAA,CAAM,GAAG,CAAA,GAAI,YAAA,GAAe,GAAA;AACrC;AAUO,SAAS,SAAA,CAAU,GAAA,EAAa,GAAA,EAAa,GAAA,EAAa,YAAY,IAAA,EAAe;AAC1F,EAAA,IAAI,SAAA,EAAW;AACb,IAAA,OAAO,GAAA,IAAO,OAAO,GAAA,IAAO,GAAA;AAAA,EAC9B;AACA,EAAA,OAAO,GAAA,GAAM,OAAO,GAAA,GAAM,GAAA;AAC5B;AAUO,SAAS,OAAA,CACd,KAAA,EACA,eAAA,EACA,QAAA,EACiB;AAEjB,EAAA,IAAI,SAAS,CAAA,IAAK,KAAA,IAAS,MAAM,eAAA,KAAoB,MAAA,IAAa,kBAAkB,EAAA,CAAA,EAAK;AACvF,IAAA,MAAMA,OAAM,eAAA,IAAmB,CAAA;AAC/B,IAAA,OAAO,MAAA,CAAA,CAAQ,KAAA,GAAQ,GAAA,EAAK,OAAA,CAAQA,IAAG,CAAC,CAAA;AAAA,EAC1C;AAGA,EAAA,IAAI,eAAA,KAAoB,MAAA,IAAa,eAAA,IAAmB,EAAA,EAAI;AAC1D,IAAA,MAAM,KAAA,GAAQ,eAAA;AACd,IAAA,MAAMA,OAAM,QAAA,IAAY,CAAA;AACxB,IAAA,IAAI,KAAA,KAAU,GAAG,OAAO,IAAA;AACxB,IAAA,OAAO,IAAK,KAAA,GAAQ,KAAA,GAAS,GAAA,EAAK,OAAA,CAAQA,IAAG,CAAC,CAAA,CAAA,CAAA;AAAA,EAChD;AAGA,EAAA,MAAM,MAAM,eAAA,IAAmB,CAAA;AAC/B,EAAA,OAAO,MAAA,CAAA,CAAQ,KAAA,GAAQ,GAAA,EAAK,OAAA,CAAQ,GAAG,CAAC,CAAA;AAC1C;AASO,SAAS,cAAA,CAAe,GAAA,EAAa,QAAA,GAAW,MAAA,EAAK,WAAW,CAAA,EAAW;AAChF,EAAA,OAAO,CAAA,EAAG,QAAQ,CAAA,EAAG,YAAA,CAAa,GAAA,EAAK,EAAE,QAAA,EAAU,SAAA,EAAW,GAAA,EAAK,CAAC,CAAA,CAAA;AACtE;AAQO,SAAS,WAAA,CAAY,KAAA,EAAe,QAAA,GAAW,CAAA,EAAW;AAC/D,EAAA,IAAI,KAAA,KAAU,GAAG,OAAO,SAAA;AACxB,EAAA,MAAM,CAAA,GAAI,IAAA;AACV,EAAA,MAAM,QAAQ,CAAC,OAAA,EAAS,MAAM,IAAA,EAAM,IAAA,EAAM,MAAM,IAAI,CAAA;AACpD,EAAA,MAAM,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,GAAA,CAAI,KAAK,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAC,CAAC,CAAA;AAClD,EAAA,OAAO,CAAA,EAAG,UAAA,CAAA,CAAY,KAAA,GAAQ,IAAA,CAAK,IAAI,CAAA,EAAG,CAAC,CAAA,EAAG,OAAA,CAAQ,QAAQ,CAAC,CAAC,CAAA,CAAA,EAAI,KAAA,CAAM,CAAC,CAAC,CAAA,CAAA;AAC9E","file":"chunk-CDSGEAOK.mjs","sourcesContent":["/**\n * 数字工具函数\n */\n\n/**\n * 数字格式化（千分位）\n * @param num - 数字\n * @param options - 格式化选项\n * @returns 格式化后的字符串\n */\nexport function formatNumber(\n  num: number,\n  options: {\n    decimals?: number;\n    separator?: string;\n    decimalPoint?: string;\n    minimumFractionDigits?: number;\n  } = {}\n): string {\n  const { decimals, separator = ',', decimalPoint = '.', minimumFractionDigits } = options;\n\n  // 如果没有指定 decimals，自动检测小数位\n  let numStr: string;\n  if (decimals !== undefined) {\n    numStr = num.toFixed(decimals);\n  } else if (minimumFractionDigits !== undefined) {\n    numStr = num.toFixed(minimumFractionDigits);\n  } else {\n    // 自动检测小数位\n    const str = num.toString();\n    if (str.includes('.')) {\n      numStr = str;\n    } else {\n      numStr = num.toFixed(0);\n    }\n  }\n\n  const parts = numStr.split('.');\n  parts[0] = parts[0].replace(/\\B(?=(\\d{3})+(?!\\d))/g, separator);\n  return parts.join(decimalPoint);\n}\n\n/**\n * 生成随机数\n * @param min - 最小值\n * @param max - 最大值\n * @param integer - 是否为整数，默认为 false\n * @returns 随机数\n */\nexport function random(min: number, max: number, integer = false): number {\n  const value = Math.random() * (max - min) + min;\n  return integer ? Math.floor(value) : value;\n}\n\n/**\n * 限制数值范围\n * @param num - 数字\n * @param min - 最小值\n * @param max - 最大值\n * @returns 限制后的数字\n */\nexport function clamp(num: number, min: number, max: number): number {\n  return Math.min(Math.max(num, min), max);\n}\n\n/**\n * 增强版四舍五入\n * @param num - 数字\n * @param decimals - 小数位数，默认为 0\n * @returns 四舍五入后的数字\n */\nexport function round(num: number, decimals = 0): number {\n  const factor = Math.pow(10, decimals);\n  return Math.round(num * factor) / factor;\n}\n\n/**\n * 增强版向下取整\n * @param num - 数字\n * @param decimals - 小数位数，默认为 0\n * @returns 向下取整后的数字\n */\nexport function floor(num: number, decimals = 0): number {\n  const factor = Math.pow(10, decimals);\n  return Math.floor(num * factor) / factor;\n}\n\n/**\n * 增强版向上取整\n * @param num - 数字\n * @param decimals - 小数位数，默认为 0\n * @returns 向上取整后的数字\n */\nexport function ceil(num: number, decimals = 0): number {\n  const factor = Math.pow(10, decimals);\n  return Math.ceil(num * factor) / factor;\n}\n\n/**\n * 保留小数位（增强版）\n * @param num - 数字\n * @param decimals - 小数位数\n * @returns 格式化后的字符串\n */\nexport function toFixed(num: number, decimals: number): string {\n  return num.toFixed(decimals);\n}\n\n/**\n * 解析数字字符串\n * @param str - 数字字符串\n * @param defaultValue - 默认值，解析失败时返回\n * @returns 解析后的数字\n */\nexport function parseNumber(str: string, defaultValue = 0): number {\n  const num = Number(str);\n  return isNaN(num) ? defaultValue : num;\n}\n\n/**\n * 判断是否在范围内\n * @param num - 数字\n * @param min - 最小值\n * @param max - 最大值\n * @param inclusive - 是否包含边界，默认为 true\n * @returns 是否在范围内\n */\nexport function isBetween(num: number, min: number, max: number, inclusive = true): boolean {\n  if (inclusive) {\n    return num >= min && num <= max;\n  }\n  return num > min && num < max;\n}\n\n/**\n * 百分比计算\n * @param value - 当前值（0-1之间的小数）或当前值（当提供total时）\n * @param decimals - 小数位数，默认为 0（当value是0-1之间的小数时）或总值（当value是实际值时）\n * @returns 百分比数字（当value是0-1之间的小数时）或百分比字符串（当提供total时）\n */\nexport function percent(value: number, decimals?: number): number;\nexport function percent(value: number, total: number, decimals: number): string;\nexport function percent(\n  value: number,\n  decimalsOrTotal?: number,\n  decimals?: number\n): number | string {\n  // 如果 value 是 0-1 之间的小数，且只传了一个参数或第二个参数是小数位数\n  if (value >= 0 && value <= 1 && (decimalsOrTotal === undefined || decimalsOrTotal < 10)) {\n    const dec = decimalsOrTotal ?? 0;\n    return Number((value * 100).toFixed(dec));\n  }\n\n  // 如果提供了 total（第二个参数大于等于10，认为是total）\n  if (decimalsOrTotal !== undefined && decimalsOrTotal >= 10) {\n    const total = decimalsOrTotal;\n    const dec = decimals ?? 2;\n    if (total === 0) return '0%';\n    return `${((value / total) * 100).toFixed(dec)}%`;\n  }\n\n  // 默认情况：value 是 0-1 之间的小数\n  const dec = decimalsOrTotal ?? 0;\n  return Number((value * 100).toFixed(dec));\n}\n\n/**\n * 货币格式化\n * @param num - 数字\n * @param currency - 货币符号，默认为 '¥'\n * @param decimals - 小数位数，默认为 2\n * @returns 格式化后的货币字符串\n */\nexport function formatCurrency(num: number, currency = '¥', decimals = 2): string {\n  return `${currency}${formatNumber(num, { decimals, separator: ',' })}`;\n}\n\n/**\n * 字节格式化\n * @param bytes - 字节数\n * @param decimals - 小数位数，默认为 2\n * @returns 格式化后的字节字符串\n */\nexport function formatBytes(bytes: number, decimals = 2): string {\n  if (bytes === 0) return '0 Bytes';\n  const k = 1024;\n  const sizes = ['Bytes', 'KB', 'MB', 'GB', 'TB', 'PB'];\n  const i = Math.floor(Math.log(bytes) / Math.log(k));\n  return `${parseFloat((bytes / Math.pow(k, i)).toFixed(decimals))} ${sizes[i]}`;\n}\n"]}