@alibarbar/common 1.0.0

package/dist/chunk-BHCRFURU.js

@@ -0,0 +1,491 @@
+'use strict';
+
+// 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());
+  }
+};
+
+exports.BinaryTree = BinaryTree;
+exports.DataQueue = DataQueue;
+exports.Graph = Graph;
+exports.LRUCache = LRUCache;
+exports.LinkedList = LinkedList;
+exports.Stack = Stack;
+//# sourceMappingURL=chunk-BHCRFURU.js.map
+//# sourceMappingURL=chunk-BHCRFURU.js.map

package/dist/chunk-BHCRFURU.js.map

@@ -0,0 +1 @@
+{"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-D7CS5EKF.js

@@ -0,0 +1,110 @@
+'use strict';
+
+// src/core/string.ts
+function capitalize(str) {
+  if (!str) return str;
+  return str.charAt(0).toUpperCase() + str.slice(1).toLowerCase();
+}
+function camelCase(str) {
+  if (!str) return str;
+  const words = str.replace(/[A-Z]/g, (letter) => ` ${letter.toLowerCase()}`).split(/[\s\-_]+/).filter((word) => word.length > 0);
+  if (words.length === 0) return "";
+  return words[0].toLowerCase() + words.slice(1).map((word) => word.charAt(0).toUpperCase() + word.slice(1).toLowerCase()).join("");
+}
+function kebabCase(str) {
+  return str.replace(/([a-z])([A-Z])/g, "$1-$2").replace(/[\s_]+/g, "-").toLowerCase();
+}
+function truncate(str, length, suffix = "...") {
+  if (str.length <= length) return str;
+  return str.slice(0, length - suffix.length) + suffix;
+}
+function snakeCase(str) {
+  if (!str) return str;
+  return str.replace(/[A-Z]/g, (letter) => `_${letter.toLowerCase()}`).replace(/[\s-]+/g, "_").replace(/^_+|_+$/g, "").toLowerCase();
+}
+function pascalCase(str) {
+  if (!str) return str;
+  const camel = camelCase(str);
+  return camel.charAt(0).toUpperCase() + camel.slice(1);
+}
+function mask(str, options = {}) {
+  if (!str) return str;
+  const { start = 0, end = str.length, maskChar = "*" } = options;
+  const startIndex = Math.max(0, start);
+  const endIndex = Math.min(str.length, end);
+  if (startIndex >= endIndex) return str;
+  return str.slice(0, startIndex) + maskChar.repeat(endIndex - startIndex) + str.slice(endIndex);
+}
+function maskPhone(phone) {
+  if (!phone || phone.length < 7) return phone;
+  return mask(phone, { start: 3, end: phone.length - 4 });
+}
+function maskEmail(email) {
+  if (!email || !email.includes("@")) return email;
+  const [local, domain] = email.split("@");
+  if (local.length <= 2) return email;
+  return `${local.slice(0, 2)}***@${domain}`;
+}
+function slugify(str) {
+  if (!str) return "";
+  return str.toLowerCase().trim().replace(/[^\w\s-]/g, "").replace(/[\s_-]+/g, "-").replace(/^-+|-+$/g, "");
+}
+function removeAccents(str) {
+  if (!str) return str;
+  return str.normalize("NFD").replace(/[\u0300-\u036f]/g, "");
+}
+function escapeHtml(str) {
+  if (!str) return str;
+  const map = {
+    "&": "&amp;",
+    "<": "&lt;",
+    ">": "&gt;",
+    '"': "&quot;",
+    "'": "&#39;"
+  };
+  return str.replace(/[&<>"']/g, (char) => map[char]);
+}
+function unescapeHtml(str) {
+  if (!str) return str;
+  const map = {
+    "&amp;": "&",
+    "&lt;": "<",
+    "&gt;": ">",
+    "&quot;": '"',
+    "&#39;": "'"
+  };
+  return str.replace(/&amp;|&lt;|&gt;|&quot;|&#39;/g, (char) => map[char]);
+}
+function template(template2, data) {
+  if (!template2) return template2;
+  return template2.replace(/\{\{(\w+)\}\}/g, (match, key) => {
+    const value = data[key];
+    return value !== void 0 && value !== null ? String(value) : match;
+  });
+}
+function highlight(text, keyword, tag = "mark") {
+  if (!text || !keyword) return text;
+  const regex = new RegExp(`(${escapeRegex(keyword)})`, "gi");
+  return text.replace(regex, `<${tag}>$1</${tag}>`);
+}
+function escapeRegex(str) {
+  return str.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
+}
+
+exports.camelCase = camelCase;
+exports.capitalize = capitalize;
+exports.escapeHtml = escapeHtml;
+exports.highlight = highlight;
+exports.kebabCase = kebabCase;
+exports.mask = mask;
+exports.maskEmail = maskEmail;
+exports.maskPhone = maskPhone;
+exports.pascalCase = pascalCase;
+exports.removeAccents = removeAccents;
+exports.slugify = slugify;
+exports.snakeCase = snakeCase;
+exports.template = template;
+exports.truncate = truncate;
+exports.unescapeHtml = unescapeHtml;
+//# sourceMappingURL=chunk-D7CS5EKF.js.map
+//# sourceMappingURL=chunk-D7CS5EKF.js.map

package/dist/chunk-D7CS5EKF.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/core/string.ts"],"names":["template"],"mappings":";;;AASO,SAAS,WAAW,GAAA,EAAqB;AAC9C,EAAA,IAAI,CAAC,KAAK,OAAO,GAAA;AACjB,EAAA,OAAO,GAAA,CAAI,MAAA,CAAO,CAAC,CAAA,CAAE,WAAA,KAAgB,GAAA,CAAI,KAAA,CAAM,CAAC,CAAA,CAAE,WAAA,EAAY;AAChE;AAOO,SAAS,UAAU,GAAA,EAAqB;AAC7C,EAAA,IAAI,CAAC,KAAK,OAAO,GAAA;AAGjB,EAAA,MAAM,QAAQ,GAAA,CACX,OAAA,CAAQ,UAAU,CAAA,MAAA,KAAU,CAAA,CAAA,EAAI,OAAO,WAAA,EAAa,CAAA,CAAE,CAAA,CACtD,MAAM,UAAU,CAAA,CAChB,OAAO,CAAA,IAAA,KAAQ,IAAA,CAAK,SAAS,CAAC,CAAA;AAEjC,EAAA,IAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,EAAA;AAG/B,EAAA,OACE,KAAA,CAAM,CAAC,CAAA,CAAE,WAAA,EAAY,GACrB,MACG,KAAA,CAAM,CAAC,CAAA,CACP,GAAA,CAAI,CAAA,IAAA,KAAQ,IAAA,CAAK,OAAO,CAAC,CAAA,CAAE,WAAA,EAAY,GAAI,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA,CAAE,WAAA,EAAa,CAAA,CACtE,IAAA,CAAK,EAAE,CAAA;AAEd;AAOO,SAAS,UAAU,GAAA,EAAqB;AAC7C,EAAA,OAAO,GAAA,CACJ,QAAQ,iBAAA,EAAmB,OAAO,EAClC,OAAA,CAAQ,SAAA,EAAW,GAAG,CAAA,CACtB,WAAA,EAAY;AACjB;AASO,SAAS,QAAA,CAAS,GAAA,EAAa,MAAA,EAAgB,MAAA,GAAS,KAAA,EAAe;AAC5E,EAAA,IAAI,GAAA,CAAI,MAAA,IAAU,MAAA,EAAQ,OAAO,GAAA;AACjC,EAAA,OAAO,IAAI,KAAA,CAAM,CAAA,EAAG,MAAA,GAAS,MAAA,CAAO,MAAM,CAAA,GAAI,MAAA;AAChD;AAOO,SAAS,UAAU,GAAA,EAAqB;AAC7C,EAAA,IAAI,CAAC,KAAK,OAAO,GAAA;AACjB,EAAA,OAAO,IACJ,OAAA,CAAQ,QAAA,EAAU,YAAU,CAAA,CAAA,EAAI,MAAA,CAAO,aAAa,CAAA,CAAE,CAAA,CACtD,OAAA,CAAQ,WAAW,GAAG,CAAA,CACtB,QAAQ,UAAA,EAAY,EAAE,EACtB,WAAA,EAAY;AACjB;AAOO,SAAS,WAAW,GAAA,EAAqB;AAC9C,EAAA,IAAI,CAAC,KAAK,OAAO,GAAA;AACjB,EAAA,MAAM,KAAA,GAAQ,UAAU,GAAG,CAAA;AAC3B,EAAA,OAAO,KAAA,CAAM,OAAO,CAAC,CAAA,CAAE,aAAY,GAAI,KAAA,CAAM,MAAM,CAAC,CAAA;AACtD;AAQO,SAAS,IAAA,CACd,GAAA,EACA,OAAA,GAII,EAAC,EACG;AACR,EAAA,IAAI,CAAC,KAAK,OAAO,GAAA;AACjB,EAAA,MAAM,EAAE,QAAQ,CAAA,EAAG,GAAA,GAAM,IAAI,MAAA,EAAQ,QAAA,GAAW,KAAI,GAAI,OAAA;AACxD,EAAA,MAAM,UAAA,GAAa,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA;AACpC,EAAA,MAAM,QAAA,GAAW,IAAA,CAAK,GAAA,CAAI,GAAA,CAAI,QAAQ,GAAG,CAAA;AACzC,EAAA,IAAI,UAAA,IAAc,UAAU,OAAO,GAAA;AACnC,EAAA,OAAO,GAAA,CAAI,KAAA,CAAM,CAAA,EAAG,UAAU,CAAA,GAAI,QAAA,CAAS,MAAA,CAAO,QAAA,GAAW,UAAU,CAAA,GAAI,GAAA,CAAI,KAAA,CAAM,QAAQ,CAAA;AAC/F;AAOO,SAAS,UAAU,KAAA,EAAuB;AAC/C,EAAA,IAAI,CAAC,KAAA,IAAS,KAAA,CAAM,MAAA,GAAS,GAAG,OAAO,KAAA;AACvC,EAAA,OAAO,IAAA,CAAK,OAAO,EAAE,KAAA,EAAO,GAAG,GAAA,EAAK,KAAA,CAAM,MAAA,GAAS,CAAA,EAAG,CAAA;AACxD;AAOO,SAAS,UAAU,KAAA,EAAuB;AAC/C,EAAA,IAAI,CAAC,KAAA,IAAS,CAAC,MAAM,QAAA,CAAS,GAAG,GAAG,OAAO,KAAA;AAC3C,EAAA,MAAM,CAAC,KAAA,EAAO,MAAM,CAAA,GAAI,KAAA,CAAM,MAAM,GAAG,CAAA;AACvC,EAAA,IAAI,KAAA,CAAM,MAAA,IAAU,CAAA,EAAG,OAAO,KAAA;AAC9B,EAAA,OAAO,GAAG,KAAA,CAAM,KAAA,CAAM,GAAG,CAAC,CAAC,OAAO,MAAM,CAAA,CAAA;AAC1C;AAOO,SAAS,QAAQ,GAAA,EAAqB;AAC3C,EAAA,IAAI,CAAC,KAAK,OAAO,EAAA;AACjB,EAAA,OAAO,GAAA,CACJ,WAAA,EAAY,CACZ,IAAA,GACA,OAAA,CAAQ,WAAA,EAAa,EAAE,CAAA,CACvB,QAAQ,UAAA,EAAY,GAAG,CAAA,CACvB,OAAA,CAAQ,YAAY,EAAE,CAAA;AAC3B;AAOO,SAAS,cAAc,GAAA,EAAqB;AACjD,EAAA,IAAI,CAAC,KAAK,OAAO,GAAA;AACjB,EAAA,OAAO,IAAI,SAAA,CAAU,KAAK,CAAA,CAAE,OAAA,CAAQ,oBAAoB,EAAE,CAAA;AAC5D;AAOO,SAAS,WAAW,GAAA,EAAqB;AAC9C,EAAA,IAAI,CAAC,KAAK,OAAO,GAAA;AACjB,EAAA,MAAM,GAAA,GAA8B;AAAA,IAClC,GAAA,EAAK,OAAA;AAAA,IACL,GAAA,EAAK,MAAA;AAAA,IACL,GAAA,EAAK,MAAA;AAAA,IACL,GAAA,EAAK,QAAA;AAAA,IACL,GAAA,EAAK;AAAA,GACP;AACA,EAAA,OAAO,IAAI,OAAA,CAAQ,UAAA,EAAY,CAAA,IAAA,KAAQ,GAAA,CAAI,IAAI,CAAC,CAAA;AAClD;AAOO,SAAS,aAAa,GAAA,EAAqB;AAChD,EAAA,IAAI,CAAC,KAAK,OAAO,GAAA;AACjB,EAAA,MAAM,GAAA,GAA8B;AAAA,IAClC,OAAA,EAAS,GAAA;AAAA,IACT,MAAA,EAAQ,GAAA;AAAA,IACR,MAAA,EAAQ,GAAA;AAAA,IACR,QAAA,EAAU,GAAA;AAAA,IACV,OAAA,EAAS;AAAA,GACX;AACA,EAAA,OAAO,IAAI,OAAA,CAAQ,+BAAA,EAAiC,CAAA,IAAA,KAAQ,GAAA,CAAI,IAAI,CAAC,CAAA;AACvE;AAQO,SAAS,QAAA,CAASA,WAAkB,IAAA,EAAuC;AAChF,EAAA,IAAI,CAACA,WAAU,OAAOA,SAAAA;AACtB,EAAA,OAAOA,SAAAA,CAAS,OAAA,CAAQ,gBAAA,EAAkB,CAAC,OAAO,GAAA,KAAQ;AACxD,IAAA,MAAM,KAAA,GAAQ,KAAK,GAAG,CAAA;AACtB,IAAA,OAAO,UAAU,MAAA,IAAa,KAAA,KAAU,IAAA,GAAO,MAAA,CAAO,KAAK,CAAA,GAAI,KAAA;AAAA,EACjE,CAAC,CAAA;AACH;AASO,SAAS,SAAA,CAAU,IAAA,EAAc,OAAA,EAAiB,GAAA,GAAM,MAAA,EAAgB;AAC7E,EAAA,IAAI,CAAC,IAAA,IAAQ,CAAC,OAAA,EAAS,OAAO,IAAA;AAC9B,EAAA,MAAM,KAAA,GAAQ,IAAI,MAAA,CAAO,CAAA,CAAA,EAAI,YAAY,OAAO,CAAC,KAAK,IAAI,CAAA;AAC1D,EAAA,OAAO,KAAK,OAAA,CAAQ,KAAA,EAAO,IAAI,GAAG,CAAA,KAAA,EAAQ,GAAG,CAAA,CAAA,CAAG,CAAA;AAClD;AAKA,SAAS,YAAY,GAAA,EAAqB;AACxC,EAAA,OAAO,GAAA,CAAI,OAAA,CAAQ,qBAAA,EAAuB,MAAM,CAAA;AAClD","file":"chunk-D7CS5EKF.js","sourcesContent":["/**\n * 字符串工具函数\n */\n\n/**\n * 首字母大写\n * @param str - 输入字符串\n * @returns 首字母大写的字符串\n */\nexport function capitalize(str: string): string {\n  if (!str) return str;\n  return str.charAt(0).toUpperCase() + str.slice(1).toLowerCase();\n}\n\n/**\n * 驼峰命名转换\n * @param str - 输入字符串（支持 kebab-case, snake_case, space separated）\n * @returns 驼峰命名字符串\n */\nexport function camelCase(str: string): string {\n  if (!str) return str;\n\n  // 先转换为小写，然后按空格、短横线、下划线分割\n  const words = str\n    .replace(/[A-Z]/g, letter => ` ${letter.toLowerCase()}`)\n    .split(/[\\s\\-_]+/)\n    .filter(word => word.length > 0);\n\n  if (words.length === 0) return '';\n\n  // 第一个单词全小写，后续单词首字母大写\n  return (\n    words[0].toLowerCase() +\n    words\n      .slice(1)\n      .map(word => word.charAt(0).toUpperCase() + word.slice(1).toLowerCase())\n      .join('')\n  );\n}\n\n/**\n * 短横线命名转换\n * @param str - 输入字符串\n * @returns kebab-case 字符串\n */\nexport function kebabCase(str: string): string {\n  return str\n    .replace(/([a-z])([A-Z])/g, '$1-$2')\n    .replace(/[\\s_]+/g, '-')\n    .toLowerCase();\n}\n\n/**\n * 截断字符串\n * @param str - 输入字符串\n * @param length - 最大长度\n * @param suffix - 后缀，默认为 '...'\n * @returns 截断后的字符串\n */\nexport function truncate(str: string, length: number, suffix = '...'): string {\n  if (str.length <= length) return str;\n  return str.slice(0, length - suffix.length) + suffix;\n}\n\n/**\n * 下划线命名转换\n * @param str - 输入字符串\n * @returns snake_case 字符串\n */\nexport function snakeCase(str: string): string {\n  if (!str) return str;\n  return str\n    .replace(/[A-Z]/g, letter => `_${letter.toLowerCase()}`)\n    .replace(/[\\s-]+/g, '_')\n    .replace(/^_+|_+$/g, '')\n    .toLowerCase();\n}\n\n/**\n * 帕斯卡命名转换\n * @param str - 输入字符串（支持 kebab-case, snake_case, space separated）\n * @returns PascalCase 字符串\n */\nexport function pascalCase(str: string): string {\n  if (!str) return str;\n  const camel = camelCase(str);\n  return camel.charAt(0).toUpperCase() + camel.slice(1);\n}\n\n/**\n * 字符串脱敏\n * @param str - 输入字符串\n * @param options - 脱敏选项\n * @returns 脱敏后的字符串\n */\nexport function mask(\n  str: string,\n  options: {\n    start?: number;\n    end?: number;\n    maskChar?: string;\n  } = {}\n): string {\n  if (!str) return str;\n  const { start = 0, end = str.length, maskChar = '*' } = options;\n  const startIndex = Math.max(0, start);\n  const endIndex = Math.min(str.length, end);\n  if (startIndex >= endIndex) return str;\n  return str.slice(0, startIndex) + maskChar.repeat(endIndex - startIndex) + str.slice(endIndex);\n}\n\n/**\n * 手机号脱敏（默认显示前3位和后4位）\n * @param phone - 手机号\n * @returns 脱敏后的手机号\n */\nexport function maskPhone(phone: string): string {\n  if (!phone || phone.length < 7) return phone;\n  return mask(phone, { start: 3, end: phone.length - 4 });\n}\n\n/**\n * 邮箱脱敏（默认显示前2位和@后的域名）\n * @param email - 邮箱地址\n * @returns 脱敏后的邮箱\n */\nexport function maskEmail(email: string): string {\n  if (!email || !email.includes('@')) return email;\n  const [local, domain] = email.split('@');\n  if (local.length <= 2) return email;\n  return `${local.slice(0, 2)}***@${domain}`;\n}\n\n/**\n * URL友好的字符串转换（slugify）\n * @param str - 输入字符串\n * @returns URL友好的字符串\n */\nexport function slugify(str: string): string {\n  if (!str) return '';\n  return str\n    .toLowerCase()\n    .trim()\n    .replace(/[^\\w\\s-]/g, '')\n    .replace(/[\\s_-]+/g, '-')\n    .replace(/^-+|-+$/g, '');\n}\n\n/**\n * 移除重音符号\n * @param str - 输入字符串\n * @returns 移除重音后的字符串\n */\nexport function removeAccents(str: string): string {\n  if (!str) return str;\n  return str.normalize('NFD').replace(/[\\u0300-\\u036f]/g, '');\n}\n\n/**\n * HTML转义\n * @param str - 输入字符串\n * @returns 转义后的字符串\n */\nexport function escapeHtml(str: string): string {\n  if (!str) return str;\n  const map: Record<string, string> = {\n    '&': '&amp;',\n    '<': '&lt;',\n    '>': '&gt;',\n    '\"': '&quot;',\n    \"'\": '&#39;',\n  };\n  return str.replace(/[&<>\"']/g, char => map[char]);\n}\n\n/**\n * HTML反转义\n * @param str - 输入字符串\n * @returns 反转义后的字符串\n */\nexport function unescapeHtml(str: string): string {\n  if (!str) return str;\n  const map: Record<string, string> = {\n    '&amp;': '&',\n    '&lt;': '<',\n    '&gt;': '>',\n    '&quot;': '\"',\n    '&#39;': \"'\",\n  };\n  return str.replace(/&amp;|&lt;|&gt;|&quot;|&#39;/g, char => map[char]);\n}\n\n/**\n * 模板字符串替换\n * @param template - 模板字符串，使用 {{key}} 作为占位符\n * @param data - 替换数据对象\n * @returns 替换后的字符串\n */\nexport function template(template: string, data: Record<string, unknown>): string {\n  if (!template) return template;\n  return template.replace(/\\{\\{(\\w+)\\}\\}/g, (match, key) => {\n    const value = data[key];\n    return value !== undefined && value !== null ? String(value) : match;\n  });\n}\n\n/**\n * 关键词高亮\n * @param text - 文本内容\n * @param keyword - 关键词\n * @param tag - 高亮标签，默认为 'mark'\n * @returns 高亮后的HTML字符串\n */\nexport function highlight(text: string, keyword: string, tag = 'mark'): string {\n  if (!text || !keyword) return text;\n  const regex = new RegExp(`(${escapeRegex(keyword)})`, 'gi');\n  return text.replace(regex, `<${tag}>$1</${tag}>`);\n}\n\n/**\n * 转义正则表达式特殊字符\n */\nfunction escapeRegex(str: string): string {\n  return str.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&');\n}\n"]}