@vope/utils 1.7.1 → 1.7.3

package/README.md

@@ -1,9 +1,179 @@
-### build
+# @vope/utils
+
+工具函数库
+
+## 安装
+
+```bash
+npm install @vope/utils
+# 或
+pnpm add @vope/utils
+# 或
+yarn add @vope/utils
 ```
-发布构建
+
+## API 文档
+
+### 异步控制
+
+| 函数名 | 说明 |
+|--------|------|
+| asyncLock | 异步锁 |
+| once | 缓存函数返回值 |
+| wait | 等待 |
+| Subscriber | 订阅 |
+
+### 树结构处理
+
+| 函数名 | 说明 |
+|--------|------|
+| FlatTree | 扁平树 |
+| forBfsEach | 广度优先搜索 |
+| forDfsEach | 深度优先搜索 |
+
+### 数据转换
+
+| 函数名 | 说明 |
+|--------|------|
+| parseNum | 解析一个字符串并返回一个数字 |
+| hash8json | 对象数组转 hash |
+| hash8object | 对象转 hash |
+| hash8strings | 字符串数组转 hash |
+
+### 数学计算
+
+| 函数名 | 说明 |
+|--------|------|
+| calc | CSS 长度值加减混合运算 |
+| calc.getExpMN | 获取表达式方法名 |
+| calc.multiply | CSS 长度值乘法运算 |
+| calc.divide | CSS 长度值除法运算 |
+| calc.formatter | CSS 长度值格式化 |
+| calc.clamp | CSS 长度值取中间值运算 |
+| clamp | 获取中间数 |
+
+### 类型判断
+
+| 函数名 | 说明 |
+|--------|------|
+| isNull | 检测是否无值 (undefined/null) |
+| isEmpty | 检测是否为空 (undefined/null/'') |
+| isClass | 判断是否为 Class |
+| isKey | 判断是否为有效的对象键 |
+
+### 样式处理
+
+| 函数名 | 说明 |
+|--------|------|
+| classnames | 拼接多个 class |
+| css | CSS 样式处理 |
+
+### 数据脱敏
+
+| 函数名 | 说明 |
+|--------|------|
+| desensEncrypt | 脱敏加密 (对明文进行多个片段加密) |
+| desensDecrypt | 脱敏解密 (对密文进行多个片段解密) |
+| desensReplace | 脱敏平替 |
+
+### Cron 表达式
+
+| 函数名 | 说明 |
+|--------|------|
+| weekDic | 星期字典 |
+| default_max_second | 默认最大秒 |
+| default_min_second | 默认最小秒 |
+| default_max_minute | 默认最大分 |
+| default_min_minute | 默认最小分 |
+| default_max_hour | 默认最大时 |
+| default_min_hour | 默认最小时 |
+| default_max_day | 默认最大日 |
+| default_min_day | 默认最小日 |
+| default_max_month | 默认最大月 |
+| default_min_month | 默认最小月 |
+| default_max_week | 默认最大周 |
+| default_min_week | 默认最小周 |
+| createCronRegexText | 创建 Cron 正则表达式文本 |
+| InvalidUnit | 无效单位 |
+| isInvalidUnit | 是否为无效单位 |
+| DayLastUnit | 月末单位 |
+| isDayLastUnit | 是否为月末单位 |
+| WeekLastUnit | 周最后单位 |
+| isWeekLastUnit | 是否为周最后单位 |
+| WildcardUnit | 通配符单位 |
+| isWildcardUnit | 是否为通配符单位 |
+| RangeUnit | 范围单位 |
+| isRangeUnit | 是否为范围单位 |
+| AggUnit | 聚合单位 |
+| isAggUnit | 是否为聚合单位 |
+| Cron | Cron 表达式 |
+
+### 比较操作
+
+| 函数名 | 说明 |
+|--------|------|
+| compareVersion | 版本号大小比较 |
+| deepWeakEqual | 深度弱相等比较 |
+
+### 数据结构与集合
+
+| 函数名 | 说明 |
+|--------|------|
+| DicRollup | 字典操作 |
+| MemoryBasic | 内存基础 |
+| MemoryList | 内存列表 |
+| MemoryPower | 内存幂 |
+| MemorySimple | 内存简单 |
+| FlexTable | 弹性表格 |
+| Union | 联合 |
+
+### 图数据库
+
+| 函数名 | 说明 |
+|--------|------|
+| Neo4j | 图管理 |
+| Neo4jAhchors | 图布局之二阶贝塞尔曲线边锚点管理 |
+
+### URL 与路径
+
+| 函数名 | 说明 |
+|--------|------|
+| joinPaths | 拼接路径 |
+| connectURLParams | 连接 URL 参数 |
+| cubeURLParams | 将 URL 查询参数转换成 (复杂) 对象 |
+| flatURLParams | 将 (复杂) 对象转换成 URL 查询参数 |
+| Serializes | 序列化 |
+
+### 几何变换
+
+| 函数名 | 说明 |
+|--------|------|
+| rotateAngle | 角度旋转 |
+| rotateRad | 弧度旋转 |
+
+### 其他工具
+
+| 函数名 | 说明 |
+|--------|------|
+| disableEnumerable | 禁用可枚举性 |
+| indexSort | 索引排序 |
+| getEncoding | 获取编码 |
+| inputRegex | 输入正则 |
+| loadImage | 加载图片 |
+| deconPowersSum | 幂和分解 |
+
+## 测试
+
+```bash
+npm run test
 ```
 
-### test
+## 构建
+
+```bash
+npm run build
 ```
-运行测试用例
-```
+
+## License
+
+ISC

package/dist/each.d.ts

@@ -0,0 +1,14 @@
+/**
+ * 广度优先搜索
+ * @param list 节点源
+ * @param up 节点下钻，返回当前节点的子节点
+ * @param callback 节点回调，返回false则停止搜索
+ */
+export declare const forBfsEach: <T>(list: T[] | Set<T>, up: (data: T) => T[] | Set<T> | void, callback: (data: T) => boolean) => void;
+/**
+ * 深度优先搜索
+ * @param list 节点源
+ * @param up 节点下钻，返回当前节点的子节点
+ * @param callback 节点回调，返回false则停止搜索
+ */
+export declare const forDfsEach: <T>(list: T[] | Set<T>, up: (data: T) => T[] | Set<T> | void, callback: (data: T) => boolean) => void;

package/dist/each.js

@@ -0,0 +1,28 @@
+const forBfsEach = (list, up, callback) => {
+  const stack = Array.isArray(list) ? list.slice() : Array.from(list);
+  for (const value of stack) {
+    if (!callback(value)) break;
+    const result = up(value);
+    result === void 0 || stack.push(...result);
+  }
+};
+const reverseMergeIn = (from, to = []) => {
+  let i = to.length + (Array.isArray(from) ? from.length : from.size);
+  for (const value of from) {
+    to[--i] = value;
+  }
+  return to;
+};
+const forDfsEach = (list, up, callback) => {
+  const stack = reverseMergeIn(list);
+  while (stack.length > 0) {
+    const value = stack.pop();
+    if (!callback(value)) break;
+    const result = up(value);
+    result === void 0 || reverseMergeIn(result, stack);
+  }
+};
+export {
+  forBfsEach,
+  forDfsEach
+};

package/dist/flat-tree.d.ts

@@ -0,0 +1,99 @@
+type Value = keyof any;
+type PValue = Value | null | undefined;
+type Sup<K, T> = [K] extends [never] ? ((data: T) => PValue) : K;
+interface Options<K, SK, T> {
+    /**
+     * 节点数据唯一标识字段
+     */
+    key: K;
+    /**
+     * 节点数据源
+     */
+    origin: T[];
+    /**
+     * 节点数据与上级节点关系标识
+     */
+    sup: Sup<SK, T>;
+}
+export declare namespace FlatTree {
+    /**
+     * (0) 先入先出的普通模式 (1) 广度优先 (2) 深度优先
+     */
+    type Mode = 0 | 1 | 2;
+}
+/**
+ * 扁平树
+ */
+export declare class FlatTree<K extends string, T extends {
+    [P in K]: Value;
+} & {
+    [P in SK]?: PValue;
+}, SK extends string = never> {
+    protected key: K;
+    protected sup: Sup<SK, T>;
+    /**
+     * 节点存储
+     */
+    protected memory: Map<string | number | symbol, T>;
+    /**
+     * 顶级节点
+     */
+    protected list: Set<string | number | symbol>;
+    /**
+     * 节点下钻
+     */
+    protected downs: Map<string | number | symbol, Set<string | number | symbol>>;
+    /**
+     * 节点上钻
+     */
+    protected ups: Map<string | number | symbol, string | number | symbol>;
+    constructor(options: Options<K, SK, T>);
+    /**
+     * 获取指定节点的上级节点标识
+     */
+    protected getPid(data: T): PValue | T[SK];
+    /**
+     * 添加节点
+     */
+    add(data: T): boolean;
+    /**
+     * 删除节点
+     * @description 删除节点时如果存在子孙节点也将被同步删除
+     */
+    delete(value: Value): boolean;
+    /**
+     * 删除指定节点所有的子节点
+     */
+    deleteSubs(value: Value): boolean;
+    /**
+     * 更新上级节点标识
+     */
+    updateSup(data: T): boolean;
+    /**
+     * 获取节点
+     */
+    get(value: Value): T | undefined;
+    /**
+     * 获取上级节点
+     */
+    getSup(value: Value): T | undefined;
+    /**
+     * 是否含有节点
+     */
+    has(value: Value): boolean;
+    /**
+     * 遍历节点
+     * @param mode 遍历模式
+     */
+    forEach(callback: (data: T) => void, mode?: FlatTree.Mode): void;
+    /**
+     * 查询节点
+     * @param mode 遍历模式
+     */
+    some(callback: (data: T) => boolean, mode?: FlatTree.Mode): boolean;
+    /**
+     * 清除所有节点数据
+     */
+    clear(): void;
+}
+export {};

package/dist/flat-tree.js

@@ -0,0 +1,191 @@
+import { forBfsEach, forDfsEach } from "./each";
+import { isNull } from "./is/null";
+const eachs = {
+  1: forBfsEach,
+  2: forDfsEach
+};
+class FlatTree {
+  key;
+  sup;
+  /**
+   * 节点存储
+   */
+  memory = /* @__PURE__ */ new Map();
+  /**
+   * 顶级节点
+   */
+  list = /* @__PURE__ */ new Set();
+  /**
+   * 节点下钻
+   */
+  downs = /* @__PURE__ */ new Map();
+  /**
+   * 节点上钻
+   */
+  ups = /* @__PURE__ */ new Map();
+  constructor(options) {
+    this.key = options.key;
+    this.sup = options.sup;
+    options.origin.forEach((data) => this.add(data));
+  }
+  /**
+   * 获取指定节点的上级节点标识
+   */
+  getPid(data) {
+    const { sup } = this;
+    return typeof sup === "function" ? sup(data) : data[sup];
+  }
+  /**
+   * 添加节点
+   */
+  add(data) {
+    const { memory, downs } = this;
+    const id = data[this.key];
+    if (memory.has(id)) return false;
+    const pid = this.getPid(data);
+    if (isNull(pid)) {
+      this.list.add(id);
+    } else {
+      const tmp = downs.get(pid);
+      tmp ? tmp.add(id) : downs.set(pid, /* @__PURE__ */ new Set([id]));
+      this.ups.set(id, pid);
+    }
+    this.memory.set(id, data);
+    return true;
+  }
+  /**
+   * 删除节点
+   * @description 删除节点时如果存在子孙节点也将被同步删除
+   */
+  delete(value) {
+    const { memory, downs } = this;
+    if (!memory.has(value)) return false;
+    let isTop = false;
+    const stack = [value];
+    for (const id of stack) {
+      const pid = this.ups.get(id);
+      const tmp = downs.get(id);
+      if (tmp) {
+        downs.delete(id);
+        tmp.forEach((value2) => stack.push(value2));
+      }
+      this.ups.delete(id);
+      isNull(pid) ? isTop = true : downs.get(pid)?.delete(id);
+      memory.delete(id);
+    }
+    isTop && this.list.delete(value);
+    return true;
+  }
+  /**
+   * 删除指定节点所有的子节点
+   */
+  deleteSubs(value) {
+    if (!this.memory.has(value)) return false;
+    const { downs } = this;
+    const subs = downs.get(value);
+    if (!subs) return true;
+    for (const id of subs) {
+      this.delete(id);
+    }
+    return true;
+  }
+  /**
+   * 更新上级节点标识
+   */
+  updateSup(data) {
+    const { memory } = this;
+    const id = data[this.key];
+    if (!memory.has(id)) return false;
+    const oldPid = this.ups.get(id);
+    const newPid = this.getPid(data);
+    if (oldPid === newPid || isNull(oldPid) && isNull(newPid)) return true;
+    const { list, ups, downs } = this;
+    if (isNull(oldPid)) {
+      if (!memory.has(newPid)) return false;
+      list.delete(id);
+      ups.set(id, newPid);
+      downs.get(newPid).add(id);
+    } else {
+      if (isNull(newPid)) {
+        list.add(id);
+        ups.delete(id);
+      } else {
+        if (!memory.has(newPid)) return false;
+        ups.set(id, newPid);
+        const tmp = downs.get(newPid);
+        tmp ? tmp.add(id) : downs.set(newPid, /* @__PURE__ */ new Set([id]));
+      }
+      downs.get(oldPid).delete(id);
+    }
+    return true;
+  }
+  /**
+   * 获取节点
+   */
+  get(value) {
+    return this.memory.get(value);
+  }
+  /**
+   * 获取上级节点
+   */
+  getSup(value) {
+    const pid = this.ups.get(value);
+    return isNull(pid) ? void 0 : this.memory.get(pid);
+  }
+  /**
+   * 是否含有节点
+   */
+  has(value) {
+    return this.memory.has(value);
+  }
+  /**
+   * 遍历节点
+   * @param mode 遍历模式
+   */
+  forEach(callback, mode) {
+    if (mode === void 0 || mode === 0) {
+      this.memory.forEach(callback);
+    } else {
+      eachs[mode](
+        this.list,
+        (value) => this.downs.get(value),
+        (value) => (callback(this.memory.get(value)), true)
+      );
+    }
+  }
+  /**
+   * 查询节点
+   * @param mode 遍历模式
+   */
+  some(callback, mode) {
+    const { memory } = this;
+    let result = false;
+    if (mode === void 0 || mode === 0) {
+      for (const [, data] of memory) {
+        if (callback(data)) {
+          result = true;
+          break;
+        }
+      }
+    } else {
+      eachs[mode](
+        this.list,
+        (value) => this.downs.get(value),
+        (value) => (result = true, callback(memory.get(value)))
+      );
+    }
+    return result;
+  }
+  /**
+   * 清除所有节点数据
+   */
+  clear() {
+    this.memory.clear();
+    this.list.clear();
+    this.downs.clear();
+    this.ups.clear();
+  }
+}
+export {
+  FlatTree
+};

package/dist/index.cjs.js

@@ -23,6 +23,7 @@ __export(index_exports, {
   Cron: () => Cron,
   DayLastUnit: () => DayLastUnit,
   DicRollup: () => dic_default,
+  FlatTree: () => FlatTree,
   FlexTable: () => FlexTable,
   InvalidUnit: () => InvalidUnit,
   MemoryBasic: () => MemoryBasic,
@@ -64,6 +65,8 @@ __export(index_exports, {
   desensReplace: () => desensReplace,
   disableEnumerable: () => disable_enumerable_default,
   flatURLParams: () => flatURLParams,
+  forBfsEach: () => forBfsEach,
+  forDfsEach: () => forDfsEach,
   getEncoding: () => getEncoding,
   hash8json: () => hash8json,
   hash8object: () => hash8object,
@@ -1167,6 +1170,32 @@ var disable_enumerable_default = (data, key) => {
   });
 };
 
+// src/each.ts
+var forBfsEach = (list, up, callback) => {
+  const stack = Array.isArray(list) ? list.slice() : Array.from(list);
+  for (const value of stack) {
+    if (!callback(value)) break;
+    const result = up(value);
+    result === void 0 || stack.push(...result);
+  }
+};
+var reverseMergeIn = (from, to = []) => {
+  let i = to.length + (Array.isArray(from) ? from.length : from.size);
+  for (const value of from) {
+    to[--i] = value;
+  }
+  return to;
+};
+var forDfsEach = (list, up, callback) => {
+  const stack = reverseMergeIn(list);
+  while (stack.length > 0) {
+    const value = stack.pop();
+    if (!callback(value)) break;
+    const result = up(value);
+    result === void 0 || reverseMergeIn(result, stack);
+  }
+};
+
 // src/encoding.ts
 var utf8_first_prefix = /^1{2,}/g;
 var utf8_other_prefix = /^10/;
@@ -1222,6 +1251,197 @@ var getEncoding = (uint, limit = 1024) => {
   return { encoding, offset };
 };
 
+// src/is/null.ts
+var isNull = (value) => value === void 0 || value === null;
+
+// src/flat-tree.ts
+var eachs = {
+  1: forBfsEach,
+  2: forDfsEach
+};
+var FlatTree = class {
+  key;
+  sup;
+  /**
+   * 节点存储
+   */
+  memory = /* @__PURE__ */ new Map();
+  /**
+   * 顶级节点
+   */
+  list = /* @__PURE__ */ new Set();
+  /**
+   * 节点下钻
+   */
+  downs = /* @__PURE__ */ new Map();
+  /**
+   * 节点上钻
+   */
+  ups = /* @__PURE__ */ new Map();
+  constructor(options) {
+    this.key = options.key;
+    this.sup = options.sup;
+    options.origin.forEach((data) => this.add(data));
+  }
+  /**
+   * 获取指定节点的上级节点标识
+   */
+  getPid(data) {
+    const { sup } = this;
+    return typeof sup === "function" ? sup(data) : data[sup];
+  }
+  /**
+   * 添加节点
+   */
+  add(data) {
+    const { memory, downs } = this;
+    const id = data[this.key];
+    if (memory.has(id)) return false;
+    const pid = this.getPid(data);
+    if (isNull(pid)) {
+      this.list.add(id);
+    } else {
+      const tmp = downs.get(pid);
+      tmp ? tmp.add(id) : downs.set(pid, /* @__PURE__ */ new Set([id]));
+      this.ups.set(id, pid);
+    }
+    this.memory.set(id, data);
+    return true;
+  }
+  /**
+   * 删除节点
+   * @description 删除节点时如果存在子孙节点也将被同步删除
+   */
+  delete(value) {
+    const { memory, downs } = this;
+    if (!memory.has(value)) return false;
+    let isTop = false;
+    const stack = [value];
+    for (const id of stack) {
+      const pid = this.ups.get(id);
+      const tmp = downs.get(id);
+      if (tmp) {
+        downs.delete(id);
+        tmp.forEach((value2) => stack.push(value2));
+      }
+      this.ups.delete(id);
+      isNull(pid) ? isTop = true : downs.get(pid)?.delete(id);
+      memory.delete(id);
+    }
+    isTop && this.list.delete(value);
+    return true;
+  }
+  /**
+   * 删除指定节点所有的子节点
+   */
+  deleteSubs(value) {
+    if (!this.memory.has(value)) return false;
+    const { downs } = this;
+    const subs = downs.get(value);
+    if (!subs) return true;
+    for (const id of subs) {
+      this.delete(id);
+    }
+    return true;
+  }
+  /**
+   * 更新上级节点标识
+   */
+  updateSup(data) {
+    const { memory } = this;
+    const id = data[this.key];
+    if (!memory.has(id)) return false;
+    const oldPid = this.ups.get(id);
+    const newPid = this.getPid(data);
+    if (oldPid === newPid || isNull(oldPid) && isNull(newPid)) return true;
+    const { list, ups, downs } = this;
+    if (isNull(oldPid)) {
+      if (!memory.has(newPid)) return false;
+      list.delete(id);
+      ups.set(id, newPid);
+      downs.get(newPid).add(id);
+    } else {
+      if (isNull(newPid)) {
+        list.add(id);
+        ups.delete(id);
+      } else {
+        if (!memory.has(newPid)) return false;
+        ups.set(id, newPid);
+        const tmp = downs.get(newPid);
+        tmp ? tmp.add(id) : downs.set(newPid, /* @__PURE__ */ new Set([id]));
+      }
+      downs.get(oldPid).delete(id);
+    }
+    return true;
+  }
+  /**
+   * 获取节点
+   */
+  get(value) {
+    return this.memory.get(value);
+  }
+  /**
+   * 获取上级节点
+   */
+  getSup(value) {
+    const pid = this.ups.get(value);
+    return isNull(pid) ? void 0 : this.memory.get(pid);
+  }
+  /**
+   * 是否含有节点
+   */
+  has(value) {
+    return this.memory.has(value);
+  }
+  /**
+   * 遍历节点
+   * @param mode 遍历模式
+   */
+  forEach(callback, mode) {
+    if (mode === void 0 || mode === 0) {
+      this.memory.forEach(callback);
+    } else {
+      eachs[mode](
+        this.list,
+        (value) => this.downs.get(value),
+        (value) => (callback(this.memory.get(value)), true)
+      );
+    }
+  }
+  /**
+   * 查询节点
+   * @param mode 遍历模式
+   */
+  some(callback, mode) {
+    const { memory } = this;
+    let result = false;
+    if (mode === void 0 || mode === 0) {
+      for (const [, data] of memory) {
+        if (callback(data)) {
+          result = true;
+          break;
+        }
+      }
+    } else {
+      eachs[mode](
+        this.list,
+        (value) => this.downs.get(value),
+        (value) => (result = true, callback(memory.get(value)))
+      );
+    }
+    return result;
+  }
+  /**
+   * 清除所有节点数据
+   */
+  clear() {
+    this.memory.clear();
+    this.list.clear();
+    this.downs.clear();
+    this.ups.clear();
+  }
+};
+
 // src/index-sort.ts
 var index_sort_default = (list, key) => {
   const { length } = list;
@@ -1283,9 +1503,6 @@ var isClass = (value, strict = true) => {
   return false;
 };
 
-// src/is/null.ts
-var isNull = (value) => value === void 0 || value === null;
-
 // src/is/empty.ts
 var isEmpty = (value) => isNull(value) || value === "";
 

package/dist/index.d.ts

@@ -11,7 +11,9 @@ export { weekDic, default_max_second, default_min_second, default_max_minute, de
 export { type DesensDecrypt, type DesensEncrypt, desensEncrypt, desensDecrypt, desensReplace } from './desens';
 export { type Dic, default as DicRollup } from './dic';
 export { default as disableEnumerable } from './disable-enumerable';
+export { forBfsEach, forDfsEach } from './each';
 export { getEncoding } from './encoding';
+export { FlatTree } from './flat-tree';
 export { default as indexSort } from './index-sort';
 export { inputRegex } from './input-regex';
 export { isClass } from './is/class';

package/dist/index.js

@@ -11,7 +11,9 @@ import { weekDic, default_max_second, default_min_second, default_max_minute, de
 import { desensEncrypt, desensDecrypt, desensReplace } from "./desens";
 import { default as default4 } from "./dic";
 import { default as default5 } from "./disable-enumerable";
+import { forBfsEach, forDfsEach } from "./each";
 import { getEncoding } from "./encoding";
+import { FlatTree } from "./flat-tree";
 import { default as default6 } from "./index-sort";
 import { inputRegex } from "./input-regex";
 import { isClass } from "./is/class";
@@ -43,6 +45,7 @@ export {
   Cron,
   DayLastUnit,
   default4 as DicRollup,
+  FlatTree,
   FlexTable,
   InvalidUnit,
   MemoryBasic,
@@ -84,6 +87,8 @@ export {
   desensReplace,
   default5 as disableEnumerable,
   flatURLParams,
+  forBfsEach,
+  forDfsEach,
   getEncoding,
   hash8json,
   hash8object,

package/dist/union.d.ts

@@ -8,7 +8,9 @@ type Raws<Primary extends string, Status extends string, Origin extends {
 }> = {
     [P in Status]: Revise<Origin, Primary, P>;
 };
-type GetStatus<T> = T extends Union<any, any, any, any, any, infer S> ? S : never;
+export declare namespace Union {
+    type Status<T> = T extends Union<any, any, any, any, any, infer S> ? S : never;
+}
 /**
  * 数据联合(用于需要对加入的数据进行智能提示)
  */
@@ -29,6 +31,6 @@ export declare class Union<Primary extends string, Member extends string, Origin
     /**
      * 从已有的联合中拷贝数据
      */
-    clone<T extends Union<Primary, string, Origin, Data, Option>, const P extends Exclude<GetStatus<T> & Member, Status>>(target: T, key: P | P[]): Union<Primary, Member, Origin, Data, Option, Status | P> & Omit<this, keyof Union<Primary, Member, Origin, Data, Option, Status | P>>;
+    clone<T extends Union<Primary, string, Origin, Data, Option>, const P extends Exclude<Union.Status<T> & Member, Status>>(target: T, key: P | P[]): Union<Primary, Member, Origin, Data, Option, Status | P> & Omit<this, keyof Union<Primary, Member, Origin, Data, Option, Status | P>>;
 }
 export {};

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@vope/utils",
-  "version": "1.7.1",
+  "version": "1.7.3",
   "description": "",
   "publishConfig": {
     "access": "public",